From be2ee1311ea98537ffc70299fca0623eb0241512 Mon Sep 17 00:00:00 2001
From: bjoern <me@tentakelfabrik.de>
Date: Sun, 8 Sep 2019 20:04:59 +0200
Subject: [PATCH] adding

---
 dist/index.html                               |    34 +
 node_modules/.bin/acorn                       |     1 +
 node_modules/.bin/cssesc                      |     1 +
 node_modules/.bin/esparse                     |     1 +
 node_modules/.bin/esvalidate                  |     1 +
 node_modules/@riotjs/compiler/CHANGELOG.md    |   378 +
 node_modules/@riotjs/compiler/LICENSE         |    22 +
 node_modules/@riotjs/compiler/README.md       |   107 +
 .../@riotjs/compiler/dist/compiler.js         | 35811 ++++++++++++++++
 .../@riotjs/compiler/dist/index.esm.js        |  2157 +
 node_modules/@riotjs/compiler/dist/index.js   |  2167 +
 node_modules/@riotjs/compiler/package.json    |    99 +
 node_modules/@riotjs/compiler/src/.DS_Store   |   Bin 0 -> 6148 bytes
 .../@riotjs/compiler/src/constants.js         |     4 +
 .../@riotjs/compiler/src/generators/.DS_Store |   Bin 0 -> 6148 bytes
 .../compiler/src/generators/css/index.js      |   124 +
 .../src/generators/javascript/index.js        |    92 +
 .../src/generators/template/bindings/each.js  |   110 +
 .../src/generators/template/bindings/if.js    |    43 +
 .../generators/template/bindings/simple.js    |    52 +
 .../src/generators/template/bindings/slot.js  |    38 +
 .../src/generators/template/bindings/tag.js   |   151 +
 .../src/generators/template/builder.js        |   178 +
 .../src/generators/template/checks.js         |   194 +
 .../src/generators/template/constants.js      |    64 +
 .../template/expressions/attribute.js         |    36 +
 .../generators/template/expressions/event.js  |    34 +
 .../generators/template/expressions/index.js  |    34 +
 .../generators/template/expressions/text.js   |    90 +
 .../generators/template/expressions/value.js  |    25 +
 .../compiler/src/generators/template/find.js  |    47 +
 .../compiler/src/generators/template/index.js |    74 +
 .../compiler/src/generators/template/utils.js |   486 +
 node_modules/@riotjs/compiler/src/index.js    |   156 +
 .../@riotjs/compiler/src/postprocessors.js    |    53 +
 .../@riotjs/compiler/src/preprocessors.js     |    72 +
 .../@riotjs/compiler/src/transformer.js       |    45 +
 .../compiler/src/utils/add-lines-offset.js    |    13 +
 .../compiler/src/utils/ast-nodes-checks.js    |    19 +
 .../@riotjs/compiler/src/utils/build-types.js |     5 +
 .../@riotjs/compiler/src/utils/clone-deep.js  |     8 +
 .../compiler/src/utils/compose-sourcemaps.js  |    22 +
 .../compiler/src/utils/create-sourcemap.js    |    10 +
 .../compiler/src/utils/custom-ast-nodes.js    |     9 +
 .../compiler/src/utils/generate-ast.js        |    22 +
 .../compiler/src/utils/generate-javascript.js |    15 +
 .../utils/get-line-and-column-by-position.js  |    16 +
 .../get-preprocessor-type-by-attribute.js     |    24 +
 .../compiler/src/utils/is-empty-sourcemap.js  |     8 +
 .../@riotjs/compiler/src/utils/is-node.js     |     7 +
 .../@riotjs/compiler/src/utils/panic.js       |     8 +
 .../compiler/src/utils/preprocess-node.js     |    18 +
 .../compiler/src/utils/sourcemap-as-json.js   |    10 +
 .../compiler/src/utils/split-string-by-EOL.js |    10 +
 .../compiler/src/utils/unescape-char.js       |     9 +
 node_modules/@riotjs/dom-bindings/LICENSE     |    21 +
 node_modules/@riotjs/dom-bindings/README.md   |   546 +
 .../dom-bindings/dist/esm.dom-bindings.js     |  1657 +
 .../dom-bindings/dist/umd.dom-bindings.js     |  1671 +
 .../@riotjs/dom-bindings/package.json         |    88 +
 node_modules/@riotjs/parser/CHANGELOG.md      |    89 +
 node_modules/@riotjs/parser/LICENSE           |    21 +
 node_modules/@riotjs/parser/README.md         |   140 +
 node_modules/@riotjs/parser/index.js          |  1715 +
 node_modules/@riotjs/parser/package.json      |    89 +
 node_modules/@riotjs/parser/rollup.config.js  |    11 +
 node_modules/@riotjs/parser/src/.DS_Store     |   Bin 0 -> 6148 bytes
 node_modules/@riotjs/parser/src/constants.js  |    16 +
 node_modules/@riotjs/parser/src/index.js      |    12 +
 node_modules/@riotjs/parser/src/messages.js   |    10 +
 node_modules/@riotjs/parser/src/node-types.js |    14 +
 node_modules/@riotjs/parser/src/parser.js     |   112 +
 .../@riotjs/parser/src/parsers/attribute.js   |   183 +
 .../@riotjs/parser/src/parsers/comment.js     |    43 +
 .../@riotjs/parser/src/parsers/expression.js  |   100 +
 .../@riotjs/parser/src/parsers/tag.js         |    49 +
 .../@riotjs/parser/src/parsers/text.js        |    69 +
 node_modules/@riotjs/parser/src/regex.js      |    41 +
 .../@riotjs/parser/src/tree-builder.js        |   238 +
 .../parser/src/utils/add-to-collection.js     |    11 +
 .../@riotjs/parser/src/utils/escape-str.js    |     7 +
 .../@riotjs/parser/src/utils/exec-from-pos.js |    11 +
 .../@riotjs/parser/src/utils/expr-extr.js     |   139 +
 .../parser/src/utils/flush-parser-state.js    |    14 +
 .../@riotjs/parser/src/utils/format-error.js  |    12 +
 .../@riotjs/parser/src/utils/get-chunk.js     |    11 +
 .../@riotjs/parser/src/utils/memoize.js       |    18 +
 .../@riotjs/parser/src/utils/panic.js         |    15 +
 .../@riotjs/parser/src/utils/push-tag.js      |    48 +
 .../@riotjs/parser/src/utils/push-text.js     |    42 +
 .../@riotjs/parser/src/utils/skip-es6-tl.js   |    33 +
 .../@riotjs/parser/src/utils/skip-regex.js    |   116 +
 node_modules/@ungap/essential-map/LICENSE     |    15 +
 node_modules/@ungap/essential-map/README.md   |    15 +
 .../@ungap/essential-map/cjs/index.js         |    43 +
 .../@ungap/essential-map/esm/index.js         |    43 +
 node_modules/@ungap/essential-map/index.js    |    42 +
 node_modules/@ungap/essential-map/min.js      |     2 +
 .../@ungap/essential-map/package.json         |    68 +
 node_modules/acorn/CHANGELOG.md               |   552 +
 node_modules/acorn/LICENSE                    |    19 +
 node_modules/acorn/README.md                  |   269 +
 node_modules/acorn/bin/acorn                  |     4 +
 node_modules/acorn/dist/acorn.d.ts            |   209 +
 node_modules/acorn/dist/acorn.js              |  4979 +++
 node_modules/acorn/dist/acorn.js.map          |     1 +
 node_modules/acorn/dist/acorn.mjs             |  4948 +++
 node_modules/acorn/dist/acorn.mjs.map         |     1 +
 node_modules/acorn/dist/bin.js                |    64 +
 node_modules/acorn/package.json               |    66 +
 node_modules/ast-types/.travis.yml            |    11 +
 node_modules/ast-types/LICENSE                |    20 +
 node_modules/ast-types/README.md              |   511 +
 node_modules/ast-types/def/babel-core.d.ts    |     2 +
 node_modules/ast-types/def/babel-core.js      |   258 +
 node_modules/ast-types/def/babel.d.ts         |     2 +
 node_modules/ast-types/def/babel.js           |    13 +
 node_modules/ast-types/def/core.d.ts          |     2 +
 node_modules/ast-types/def/core.js            |   300 +
 node_modules/ast-types/def/es-proposals.d.ts  |     2 +
 node_modules/ast-types/def/es-proposals.js    |    35 +
 node_modules/ast-types/def/es6.d.ts           |     2 +
 node_modules/ast-types/def/es6.js             |   212 +
 node_modules/ast-types/def/es7.d.ts           |     2 +
 node_modules/ast-types/def/es7.js             |    36 +
 node_modules/ast-types/def/esprima.d.ts       |     2 +
 node_modules/ast-types/def/esprima.js         |    51 +
 node_modules/ast-types/def/flow.d.ts          |     2 +
 node_modules/ast-types/def/flow.js            |   294 +
 node_modules/ast-types/def/jsx.d.ts           |     2 +
 node_modules/ast-types/def/jsx.js             |   105 +
 .../ast-types/def/type-annotations.d.ts       |     7 +
 .../ast-types/def/type-annotations.js         |    42 +
 node_modules/ast-types/def/typescript.d.ts    |     2 +
 node_modules/ast-types/def/typescript.js      |   339 +
 node_modules/ast-types/fork.d.ts              |    42 +
 node_modules/ast-types/fork.js                |    54 +
 node_modules/ast-types/gen/builders.d.ts      |  2563 ++
 node_modules/ast-types/gen/builders.js        |     2 +
 node_modules/ast-types/gen/kinds.d.ts         |   262 +
 node_modules/ast-types/gen/kinds.js           |     2 +
 node_modules/ast-types/gen/namedTypes.d.ts    |  1794 +
 node_modules/ast-types/gen/namedTypes.js      |     5 +
 node_modules/ast-types/gen/nodes.d.ts         |  1265 +
 node_modules/ast-types/gen/nodes.js           |     2 +
 node_modules/ast-types/gen/visitor.d.ts       |   266 +
 node_modules/ast-types/gen/visitor.js         |     2 +
 node_modules/ast-types/lib/equiv.d.ts         |     5 +
 node_modules/ast-types/lib/equiv.js           |   156 +
 node_modules/ast-types/lib/node-path.d.ts     |    22 +
 node_modules/ast-types/lib/node-path.js       |   413 +
 node_modules/ast-types/lib/path-visitor.d.ts  |    52 +
 node_modules/ast-types/lib/path-visitor.js    |   345 +
 node_modules/ast-types/lib/path.d.ts          |    25 +
 node_modules/ast-types/lib/path.js            |   333 +
 node_modules/ast-types/lib/scope.d.ts         |    26 +
 node_modules/ast-types/lib/scope.js           |   317 +
 node_modules/ast-types/lib/shared.d.ts        |    13 +
 node_modules/ast-types/lib/shared.js          |    49 +
 node_modules/ast-types/lib/types.d.ts         |   136 +
 node_modules/ast-types/lib/types.js           |   781 +
 node_modules/ast-types/main.d.ts              |    28 +
 node_modules/ast-types/main.js                |    52 +
 node_modules/ast-types/package.json           |    94 +
 node_modules/ast-types/tsconfig.json          |    20 +
 node_modules/ast-types/types.d.ts             |     6 +
 node_modules/ast-types/types.js               |     2 +
 node_modules/bianco.attr/LICENSE              |    21 +
 node_modules/bianco.attr/README.md            |   162 +
 node_modules/bianco.attr/index.js             |   143 +
 node_modules/bianco.attr/index.next.js        |   131 +
 node_modules/bianco.attr/package.json         |    74 +
 node_modules/bianco.dom-to-array/LICENSE      |    21 +
 node_modules/bianco.dom-to-array/README.md    |    62 +
 node_modules/bianco.dom-to-array/index.js     |    27 +
 .../bianco.dom-to-array/index.next.js         |    23 +
 node_modules/bianco.dom-to-array/package.json |    77 +
 node_modules/bianco.query/LICENSE             |    21 +
 node_modules/bianco.query/README.md           |    59 +
 node_modules/bianco.query/index.js            |    20 +
 node_modules/bianco.query/index.next.js       |    14 +
 node_modules/bianco.query/package.json        |    79 +
 node_modules/cssesc/LICENSE-MIT.txt           |    20 +
 node_modules/cssesc/README.md                 |   201 +
 node_modules/cssesc/bin/cssesc                |   116 +
 node_modules/cssesc/cssesc.js                 |   110 +
 node_modules/cssesc/man/cssesc.1              |    70 +
 node_modules/cssesc/package.json              |    82 +
 node_modules/cumpa/LICENSE                    |    21 +
 node_modules/cumpa/README.md                  |    75 +
 node_modules/cumpa/cumpa.js                   |    32 +
 node_modules/cumpa/index.next.js              |    19 +
 node_modules/cumpa/package.json               |    72 +
 node_modules/curri/LICENSE                    |    21 +
 node_modules/curri/README.md                  |    52 +
 node_modules/curri/curri.js                   |    26 +
 node_modules/curri/index.next.js              |    16 +
 node_modules/curri/package.json               |    70 +
 node_modules/dom-nodes/LICENSE                |    21 +
 node_modules/dom-nodes/README.md              |   267 +
 node_modules/dom-nodes/dom-nodes.js           |   473 +
 node_modules/dom-nodes/index.next.js          |   444 +
 node_modules/dom-nodes/package.json           |    71 +
 node_modules/domdiff/LICENSE                  |    15 +
 node_modules/domdiff/README.md                |   179 +
 node_modules/domdiff/cjs/index.js             |   222 +
 node_modules/domdiff/cjs/utils.js             |   388 +
 node_modules/domdiff/esm/index.js             |   223 +
 node_modules/domdiff/esm/utils.js             |   379 +
 node_modules/domdiff/index.js                 |   409 +
 node_modules/domdiff/min.js                   |     2 +
 node_modules/domdiff/package.json             |    90 +
 node_modules/domdiff/types.d.ts               |    44 +
 node_modules/esprima/ChangeLog                |   235 +
 node_modules/esprima/LICENSE.BSD              |    21 +
 node_modules/esprima/README.md                |    46 +
 node_modules/esprima/bin/esparse.js           |   139 +
 node_modules/esprima/bin/esvalidate.js        |   236 +
 node_modules/esprima/dist/esprima.js          |  6709 +++
 node_modules/esprima/package.json             |   137 +
 node_modules/globals/globals.json             |  1563 +
 node_modules/globals/index.js                 |     2 +
 node_modules/globals/license                  |     9 +
 node_modules/globals/package.json             |    82 +
 node_modules/globals/readme.md                |    36 +
 node_modules/private/LICENSE                  |    20 +
 node_modules/private/README.md                |   245 +
 node_modules/private/package.json             |    67 +
 node_modules/private/private.js               |   129 +
 node_modules/recast/.editorconfig             |     2 +
 node_modules/recast/.travis.yml               |    19 +
 node_modules/recast/LICENSE                   |    20 +
 node_modules/recast/README.md                 |   208 +
 node_modules/recast/example/add-braces        |    44 +
 node_modules/recast/example/generic-identity  |    17 +
 node_modules/recast/example/identity          |     8 +
 node_modules/recast/example/to-while          |    84 +
 node_modules/recast/lib/comments.d.ts         |     2 +
 node_modules/recast/lib/comments.js           |   308 +
 node_modules/recast/lib/fast-path.d.ts        |    25 +
 node_modules/recast/lib/fast-path.js          |   539 +
 node_modules/recast/lib/lines.d.ts            |    62 +
 node_modules/recast/lib/lines.js              |   668 +
 node_modules/recast/lib/mapping.d.ts          |    15 +
 node_modules/recast/lib/mapping.js            |   202 +
 node_modules/recast/lib/options.d.ts          |   148 +
 node_modules/recast/lib/options.js            |    55 +
 node_modules/recast/lib/parser.d.ts           |     2 +
 node_modules/recast/lib/parser.js             |   257 +
 node_modules/recast/lib/patcher.d.ts          |    12 +
 node_modules/recast/lib/patcher.js            |   392 +
 node_modules/recast/lib/printer.d.ts          |    14 +
 node_modules/recast/lib/printer.js            |  2248 +
 node_modules/recast/lib/util.d.ts             |    16 +
 node_modules/recast/lib/util.js               |   339 +
 node_modules/recast/main.d.ts                 |    50 +
 node_modules/recast/main.js                   |    73 +
 .../node_modules/source-map/CHANGELOG.md      |   301 +
 .../recast/node_modules/source-map/LICENSE    |    28 +
 .../recast/node_modules/source-map/README.md  |   742 +
 .../source-map/dist/source-map.debug.js       |  3234 ++
 .../source-map/dist/source-map.js             |  3233 ++
 .../source-map/dist/source-map.min.js         |     2 +
 .../source-map/dist/source-map.min.js.map     |     1 +
 .../node_modules/source-map/lib/array-set.js  |   121 +
 .../node_modules/source-map/lib/base64-vlq.js |   140 +
 .../node_modules/source-map/lib/base64.js     |    67 +
 .../source-map/lib/binary-search.js           |   111 +
 .../source-map/lib/mapping-list.js            |    79 +
 .../node_modules/source-map/lib/quick-sort.js |   114 +
 .../source-map/lib/source-map-consumer.js     |  1145 +
 .../source-map/lib/source-map-generator.js    |   425 +
 .../source-map/lib/source-node.js             |   413 +
 .../node_modules/source-map/lib/util.js       |   488 +
 .../node_modules/source-map/package.json      |   212 +
 .../node_modules/source-map/source-map.d.ts   |    98 +
 .../node_modules/source-map/source-map.js     |     8 +
 node_modules/recast/package.json              |    93 +
 .../recast/parsers/_babel_options.d.ts        |     8 +
 node_modules/recast/parsers/_babel_options.js |    42 +
 node_modules/recast/parsers/acorn.d.ts        |     1 +
 node_modules/recast/parsers/acorn.js          |    33 +
 node_modules/recast/parsers/babel.d.ts        |     8 +
 node_modules/recast/parsers/babel.js          |    30 +
 node_modules/recast/parsers/babylon.d.ts      |     1 +
 node_modules/recast/parsers/babylon.js        |     6 +
 node_modules/recast/parsers/esprima.d.ts      |     1 +
 node_modules/recast/parsers/esprima.js        |    28 +
 node_modules/recast/parsers/flow.d.ts         |     2 +
 node_modules/recast/parsers/flow.js           |    21 +
 node_modules/recast/parsers/typescript.d.ts   |     2 +
 node_modules/recast/parsers/typescript.js     |    21 +
 node_modules/recast/tsconfig.json             |    20 +
 node_modules/riot/LICENSE.txt                 |    25 +
 node_modules/riot/README.md                   |   250 +
 node_modules/riot/package.json                |   123 +
 node_modules/riot/riot+compiler.js            |  7393 ++++
 node_modules/riot/riot+compiler.min.js        |     8 +
 node_modules/riot/riot.d.ts                   |    71 +
 node_modules/riot/riot.esm.js                 |  2366 +
 node_modules/riot/riot.js                     |  2384 +
 node_modules/riot/riot.min.js                 |     2 +
 node_modules/riot/src/.DS_Store               |   Bin 0 -> 6148 bytes
 node_modules/riot/src/core/component.js       |   314 +
 node_modules/riot/src/core/css-manager.js     |    69 +
 node_modules/riot/src/globals.js              |     8 +
 node_modules/riot/src/riot+compiler.js        |    63 +
 node_modules/riot/src/riot.js                 |   117 +
 node_modules/riot/src/utils/checks.js         |    18 +
 node_modules/riot/src/utils/dom.js            |    24 +
 node_modules/riot/src/utils/misc.js           |   139 +
 .../smooth-scroll/.github/contributing.md     |    17 +
 .../smooth-scroll/.github/issue_template.md   |     3 +
 .../smooth-scroll/.github/main.workflow       |    10 +
 node_modules/smooth-scroll/.travis.yml        |     6 +
 node_modules/smooth-scroll/LICENSE.md         |    21 +
 node_modules/smooth-scroll/README.md          |   390 +
 .../smooth-scroll/dist/smooth-scroll.js       |   645 +
 .../smooth-scroll/dist/smooth-scroll.min.js   |     2 +
 .../dist/smooth-scroll.polyfills.js           |   715 +
 .../dist/smooth-scroll.polyfills.min.js       |     2 +
 node_modules/smooth-scroll/gulpfile.js        |   315 +
 node_modules/smooth-scroll/index.html         |   132 +
 node_modules/smooth-scroll/jump-to-top.html   |    60 +
 node_modules/smooth-scroll/package.json       |    64 +
 node_modules/smooth-scroll/speed.html         |    69 +
 .../smooth-scroll/src/copy/index.html         |   132 +
 .../smooth-scroll/src/copy/jump-to-top.html   |    60 +
 .../smooth-scroll/src/copy/speed.html         |    69 +
 .../src/js/smooth-scroll/_closest.polyfill.js |    16 +
 .../js/smooth-scroll/_customEvent.polyfill.js |    19 +
 .../_requestAnimationFrame.polyfill.js        |    33 +
 .../src/js/smooth-scroll/smooth-scroll.js     |   637 +
 node_modules/source-map/CHANGELOG.md          |   344 +
 node_modules/source-map/LICENSE               |    28 +
 node_modules/source-map/README.md             |   822 +
 node_modules/source-map/dist/source-map.js    |  3351 ++
 node_modules/source-map/lib/array-set.js      |   100 +
 node_modules/source-map/lib/base64-vlq.js     |   111 +
 node_modules/source-map/lib/base64.js         |    18 +
 node_modules/source-map/lib/binary-search.js  |   107 +
 node_modules/source-map/lib/mapping-list.js   |    80 +
 node_modules/source-map/lib/mappings.wasm     |   Bin 0 -> 48693 bytes
 node_modules/source-map/lib/read-wasm.js      |    40 +
 .../source-map/lib/source-map-consumer.js     |  1254 +
 .../source-map/lib/source-map-generator.js    |   413 +
 node_modules/source-map/lib/source-node.js    |   404 +
 node_modules/source-map/lib/util.js           |   546 +
 node_modules/source-map/lib/wasm.js           |   107 +
 node_modules/source-map/package.json          |   229 +
 node_modules/source-map/source-map.d.ts       |   369 +
 node_modules/source-map/source-map.js         |     8 +
 node_modules/type-fest/index.d.ts             |    15 +
 node_modules/type-fest/license                |     9 +
 node_modules/type-fest/package.json           |    83 +
 node_modules/type-fest/readme.md              |   119 +
 node_modules/type-fest/source/basic.d.ts      |    67 +
 node_modules/type-fest/source/except.d.ts     |    22 +
 .../type-fest/source/literal-union.d.ts       |    33 +
 .../type-fest/source/merge-exclusive.d.ts     |    39 +
 node_modules/type-fest/source/merge.d.ts      |    22 +
 node_modules/type-fest/source/mutable.d.ts    |    22 +
 .../type-fest/source/package-json.d.ts        |   501 +
 node_modules/type-fest/source/promisable.d.ts |    23 +
 .../type-fest/source/readonly-deep.d.ts       |    59 +
 .../source/require-at-least-one.d.ts          |    32 +
 package-lock.json                             |   168 +
 src/TinyOnePage.riot                          |    60 +
 368 files changed, 131698 insertions(+)
 create mode 100644 dist/index.html
 create mode 120000 node_modules/.bin/acorn
 create mode 120000 node_modules/.bin/cssesc
 create mode 120000 node_modules/.bin/esparse
 create mode 120000 node_modules/.bin/esvalidate
 create mode 100644 node_modules/@riotjs/compiler/CHANGELOG.md
 create mode 100644 node_modules/@riotjs/compiler/LICENSE
 create mode 100644 node_modules/@riotjs/compiler/README.md
 create mode 100644 node_modules/@riotjs/compiler/dist/compiler.js
 create mode 100644 node_modules/@riotjs/compiler/dist/index.esm.js
 create mode 100644 node_modules/@riotjs/compiler/dist/index.js
 create mode 100644 node_modules/@riotjs/compiler/package.json
 create mode 100644 node_modules/@riotjs/compiler/src/.DS_Store
 create mode 100644 node_modules/@riotjs/compiler/src/constants.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/.DS_Store
 create mode 100644 node_modules/@riotjs/compiler/src/generators/css/index.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/javascript/index.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/bindings/each.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/bindings/if.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/bindings/simple.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/bindings/slot.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/bindings/tag.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/builder.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/checks.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/constants.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/expressions/attribute.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/expressions/event.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/expressions/index.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/expressions/text.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/expressions/value.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/find.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/index.js
 create mode 100644 node_modules/@riotjs/compiler/src/generators/template/utils.js
 create mode 100644 node_modules/@riotjs/compiler/src/index.js
 create mode 100644 node_modules/@riotjs/compiler/src/postprocessors.js
 create mode 100644 node_modules/@riotjs/compiler/src/preprocessors.js
 create mode 100644 node_modules/@riotjs/compiler/src/transformer.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/add-lines-offset.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/ast-nodes-checks.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/build-types.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/clone-deep.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/compose-sourcemaps.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/create-sourcemap.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/custom-ast-nodes.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/generate-ast.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/generate-javascript.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/get-line-and-column-by-position.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/get-preprocessor-type-by-attribute.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/is-empty-sourcemap.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/is-node.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/panic.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/preprocess-node.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/sourcemap-as-json.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/split-string-by-EOL.js
 create mode 100644 node_modules/@riotjs/compiler/src/utils/unescape-char.js
 create mode 100644 node_modules/@riotjs/dom-bindings/LICENSE
 create mode 100644 node_modules/@riotjs/dom-bindings/README.md
 create mode 100644 node_modules/@riotjs/dom-bindings/dist/esm.dom-bindings.js
 create mode 100644 node_modules/@riotjs/dom-bindings/dist/umd.dom-bindings.js
 create mode 100644 node_modules/@riotjs/dom-bindings/package.json
 create mode 100644 node_modules/@riotjs/parser/CHANGELOG.md
 create mode 100644 node_modules/@riotjs/parser/LICENSE
 create mode 100644 node_modules/@riotjs/parser/README.md
 create mode 100644 node_modules/@riotjs/parser/index.js
 create mode 100755 node_modules/@riotjs/parser/package.json
 create mode 100644 node_modules/@riotjs/parser/rollup.config.js
 create mode 100644 node_modules/@riotjs/parser/src/.DS_Store
 create mode 100644 node_modules/@riotjs/parser/src/constants.js
 create mode 100644 node_modules/@riotjs/parser/src/index.js
 create mode 100644 node_modules/@riotjs/parser/src/messages.js
 create mode 100644 node_modules/@riotjs/parser/src/node-types.js
 create mode 100644 node_modules/@riotjs/parser/src/parser.js
 create mode 100644 node_modules/@riotjs/parser/src/parsers/attribute.js
 create mode 100644 node_modules/@riotjs/parser/src/parsers/comment.js
 create mode 100644 node_modules/@riotjs/parser/src/parsers/expression.js
 create mode 100644 node_modules/@riotjs/parser/src/parsers/tag.js
 create mode 100644 node_modules/@riotjs/parser/src/parsers/text.js
 create mode 100644 node_modules/@riotjs/parser/src/regex.js
 create mode 100644 node_modules/@riotjs/parser/src/tree-builder.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/add-to-collection.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/escape-str.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/exec-from-pos.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/expr-extr.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/flush-parser-state.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/format-error.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/get-chunk.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/memoize.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/panic.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/push-tag.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/push-text.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/skip-es6-tl.js
 create mode 100644 node_modules/@riotjs/parser/src/utils/skip-regex.js
 create mode 100644 node_modules/@ungap/essential-map/LICENSE
 create mode 100644 node_modules/@ungap/essential-map/README.md
 create mode 100644 node_modules/@ungap/essential-map/cjs/index.js
 create mode 100644 node_modules/@ungap/essential-map/esm/index.js
 create mode 100644 node_modules/@ungap/essential-map/index.js
 create mode 100644 node_modules/@ungap/essential-map/min.js
 create mode 100644 node_modules/@ungap/essential-map/package.json
 create mode 100644 node_modules/acorn/CHANGELOG.md
 create mode 100644 node_modules/acorn/LICENSE
 create mode 100644 node_modules/acorn/README.md
 create mode 100755 node_modules/acorn/bin/acorn
 create mode 100644 node_modules/acorn/dist/acorn.d.ts
 create mode 100644 node_modules/acorn/dist/acorn.js
 create mode 100644 node_modules/acorn/dist/acorn.js.map
 create mode 100644 node_modules/acorn/dist/acorn.mjs
 create mode 100644 node_modules/acorn/dist/acorn.mjs.map
 create mode 100644 node_modules/acorn/dist/bin.js
 create mode 100644 node_modules/acorn/package.json
 create mode 100644 node_modules/ast-types/.travis.yml
 create mode 100644 node_modules/ast-types/LICENSE
 create mode 100644 node_modules/ast-types/README.md
 create mode 100644 node_modules/ast-types/def/babel-core.d.ts
 create mode 100644 node_modules/ast-types/def/babel-core.js
 create mode 100644 node_modules/ast-types/def/babel.d.ts
 create mode 100644 node_modules/ast-types/def/babel.js
 create mode 100644 node_modules/ast-types/def/core.d.ts
 create mode 100644 node_modules/ast-types/def/core.js
 create mode 100644 node_modules/ast-types/def/es-proposals.d.ts
 create mode 100644 node_modules/ast-types/def/es-proposals.js
 create mode 100644 node_modules/ast-types/def/es6.d.ts
 create mode 100644 node_modules/ast-types/def/es6.js
 create mode 100644 node_modules/ast-types/def/es7.d.ts
 create mode 100644 node_modules/ast-types/def/es7.js
 create mode 100644 node_modules/ast-types/def/esprima.d.ts
 create mode 100644 node_modules/ast-types/def/esprima.js
 create mode 100644 node_modules/ast-types/def/flow.d.ts
 create mode 100644 node_modules/ast-types/def/flow.js
 create mode 100644 node_modules/ast-types/def/jsx.d.ts
 create mode 100644 node_modules/ast-types/def/jsx.js
 create mode 100644 node_modules/ast-types/def/type-annotations.d.ts
 create mode 100644 node_modules/ast-types/def/type-annotations.js
 create mode 100644 node_modules/ast-types/def/typescript.d.ts
 create mode 100644 node_modules/ast-types/def/typescript.js
 create mode 100644 node_modules/ast-types/fork.d.ts
 create mode 100644 node_modules/ast-types/fork.js
 create mode 100644 node_modules/ast-types/gen/builders.d.ts
 create mode 100644 node_modules/ast-types/gen/builders.js
 create mode 100644 node_modules/ast-types/gen/kinds.d.ts
 create mode 100644 node_modules/ast-types/gen/kinds.js
 create mode 100644 node_modules/ast-types/gen/namedTypes.d.ts
 create mode 100644 node_modules/ast-types/gen/namedTypes.js
 create mode 100644 node_modules/ast-types/gen/nodes.d.ts
 create mode 100644 node_modules/ast-types/gen/nodes.js
 create mode 100644 node_modules/ast-types/gen/visitor.d.ts
 create mode 100644 node_modules/ast-types/gen/visitor.js
 create mode 100644 node_modules/ast-types/lib/equiv.d.ts
 create mode 100644 node_modules/ast-types/lib/equiv.js
 create mode 100644 node_modules/ast-types/lib/node-path.d.ts
 create mode 100644 node_modules/ast-types/lib/node-path.js
 create mode 100644 node_modules/ast-types/lib/path-visitor.d.ts
 create mode 100644 node_modules/ast-types/lib/path-visitor.js
 create mode 100644 node_modules/ast-types/lib/path.d.ts
 create mode 100644 node_modules/ast-types/lib/path.js
 create mode 100644 node_modules/ast-types/lib/scope.d.ts
 create mode 100644 node_modules/ast-types/lib/scope.js
 create mode 100644 node_modules/ast-types/lib/shared.d.ts
 create mode 100644 node_modules/ast-types/lib/shared.js
 create mode 100644 node_modules/ast-types/lib/types.d.ts
 create mode 100644 node_modules/ast-types/lib/types.js
 create mode 100644 node_modules/ast-types/main.d.ts
 create mode 100644 node_modules/ast-types/main.js
 create mode 100644 node_modules/ast-types/package.json
 create mode 100644 node_modules/ast-types/tsconfig.json
 create mode 100644 node_modules/ast-types/types.d.ts
 create mode 100644 node_modules/ast-types/types.js
 create mode 100644 node_modules/bianco.attr/LICENSE
 create mode 100644 node_modules/bianco.attr/README.md
 create mode 100644 node_modules/bianco.attr/index.js
 create mode 100644 node_modules/bianco.attr/index.next.js
 create mode 100644 node_modules/bianco.attr/package.json
 create mode 100644 node_modules/bianco.dom-to-array/LICENSE
 create mode 100644 node_modules/bianco.dom-to-array/README.md
 create mode 100644 node_modules/bianco.dom-to-array/index.js
 create mode 100644 node_modules/bianco.dom-to-array/index.next.js
 create mode 100644 node_modules/bianco.dom-to-array/package.json
 create mode 100644 node_modules/bianco.query/LICENSE
 create mode 100644 node_modules/bianco.query/README.md
 create mode 100644 node_modules/bianco.query/index.js
 create mode 100644 node_modules/bianco.query/index.next.js
 create mode 100644 node_modules/bianco.query/package.json
 create mode 100644 node_modules/cssesc/LICENSE-MIT.txt
 create mode 100644 node_modules/cssesc/README.md
 create mode 100755 node_modules/cssesc/bin/cssesc
 create mode 100644 node_modules/cssesc/cssesc.js
 create mode 100644 node_modules/cssesc/man/cssesc.1
 create mode 100644 node_modules/cssesc/package.json
 create mode 100644 node_modules/cumpa/LICENSE
 create mode 100644 node_modules/cumpa/README.md
 create mode 100644 node_modules/cumpa/cumpa.js
 create mode 100644 node_modules/cumpa/index.next.js
 create mode 100644 node_modules/cumpa/package.json
 create mode 100644 node_modules/curri/LICENSE
 create mode 100644 node_modules/curri/README.md
 create mode 100644 node_modules/curri/curri.js
 create mode 100644 node_modules/curri/index.next.js
 create mode 100644 node_modules/curri/package.json
 create mode 100644 node_modules/dom-nodes/LICENSE
 create mode 100644 node_modules/dom-nodes/README.md
 create mode 100644 node_modules/dom-nodes/dom-nodes.js
 create mode 100644 node_modules/dom-nodes/index.next.js
 create mode 100644 node_modules/dom-nodes/package.json
 create mode 100644 node_modules/domdiff/LICENSE
 create mode 100644 node_modules/domdiff/README.md
 create mode 100644 node_modules/domdiff/cjs/index.js
 create mode 100644 node_modules/domdiff/cjs/utils.js
 create mode 100644 node_modules/domdiff/esm/index.js
 create mode 100644 node_modules/domdiff/esm/utils.js
 create mode 100644 node_modules/domdiff/index.js
 create mode 100644 node_modules/domdiff/min.js
 create mode 100644 node_modules/domdiff/package.json
 create mode 100644 node_modules/domdiff/types.d.ts
 create mode 100644 node_modules/esprima/ChangeLog
 create mode 100644 node_modules/esprima/LICENSE.BSD
 create mode 100644 node_modules/esprima/README.md
 create mode 100755 node_modules/esprima/bin/esparse.js
 create mode 100755 node_modules/esprima/bin/esvalidate.js
 create mode 100644 node_modules/esprima/dist/esprima.js
 create mode 100644 node_modules/esprima/package.json
 create mode 100644 node_modules/globals/globals.json
 create mode 100644 node_modules/globals/index.js
 create mode 100644 node_modules/globals/license
 create mode 100644 node_modules/globals/package.json
 create mode 100644 node_modules/globals/readme.md
 create mode 100644 node_modules/private/LICENSE
 create mode 100644 node_modules/private/README.md
 create mode 100644 node_modules/private/package.json
 create mode 100644 node_modules/private/private.js
 create mode 100644 node_modules/recast/.editorconfig
 create mode 100644 node_modules/recast/.travis.yml
 create mode 100644 node_modules/recast/LICENSE
 create mode 100644 node_modules/recast/README.md
 create mode 100755 node_modules/recast/example/add-braces
 create mode 100755 node_modules/recast/example/generic-identity
 create mode 100755 node_modules/recast/example/identity
 create mode 100755 node_modules/recast/example/to-while
 create mode 100644 node_modules/recast/lib/comments.d.ts
 create mode 100644 node_modules/recast/lib/comments.js
 create mode 100644 node_modules/recast/lib/fast-path.d.ts
 create mode 100644 node_modules/recast/lib/fast-path.js
 create mode 100644 node_modules/recast/lib/lines.d.ts
 create mode 100644 node_modules/recast/lib/lines.js
 create mode 100644 node_modules/recast/lib/mapping.d.ts
 create mode 100644 node_modules/recast/lib/mapping.js
 create mode 100644 node_modules/recast/lib/options.d.ts
 create mode 100644 node_modules/recast/lib/options.js
 create mode 100644 node_modules/recast/lib/parser.d.ts
 create mode 100644 node_modules/recast/lib/parser.js
 create mode 100644 node_modules/recast/lib/patcher.d.ts
 create mode 100644 node_modules/recast/lib/patcher.js
 create mode 100644 node_modules/recast/lib/printer.d.ts
 create mode 100644 node_modules/recast/lib/printer.js
 create mode 100644 node_modules/recast/lib/util.d.ts
 create mode 100644 node_modules/recast/lib/util.js
 create mode 100644 node_modules/recast/main.d.ts
 create mode 100644 node_modules/recast/main.js
 create mode 100644 node_modules/recast/node_modules/source-map/CHANGELOG.md
 create mode 100644 node_modules/recast/node_modules/source-map/LICENSE
 create mode 100644 node_modules/recast/node_modules/source-map/README.md
 create mode 100644 node_modules/recast/node_modules/source-map/dist/source-map.debug.js
 create mode 100644 node_modules/recast/node_modules/source-map/dist/source-map.js
 create mode 100644 node_modules/recast/node_modules/source-map/dist/source-map.min.js
 create mode 100644 node_modules/recast/node_modules/source-map/dist/source-map.min.js.map
 create mode 100644 node_modules/recast/node_modules/source-map/lib/array-set.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/base64-vlq.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/base64.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/binary-search.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/mapping-list.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/quick-sort.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/source-map-consumer.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/source-map-generator.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/source-node.js
 create mode 100644 node_modules/recast/node_modules/source-map/lib/util.js
 create mode 100644 node_modules/recast/node_modules/source-map/package.json
 create mode 100644 node_modules/recast/node_modules/source-map/source-map.d.ts
 create mode 100644 node_modules/recast/node_modules/source-map/source-map.js
 create mode 100644 node_modules/recast/package.json
 create mode 100644 node_modules/recast/parsers/_babel_options.d.ts
 create mode 100644 node_modules/recast/parsers/_babel_options.js
 create mode 100644 node_modules/recast/parsers/acorn.d.ts
 create mode 100644 node_modules/recast/parsers/acorn.js
 create mode 100644 node_modules/recast/parsers/babel.d.ts
 create mode 100644 node_modules/recast/parsers/babel.js
 create mode 100644 node_modules/recast/parsers/babylon.d.ts
 create mode 100644 node_modules/recast/parsers/babylon.js
 create mode 100644 node_modules/recast/parsers/esprima.d.ts
 create mode 100644 node_modules/recast/parsers/esprima.js
 create mode 100644 node_modules/recast/parsers/flow.d.ts
 create mode 100644 node_modules/recast/parsers/flow.js
 create mode 100644 node_modules/recast/parsers/typescript.d.ts
 create mode 100644 node_modules/recast/parsers/typescript.js
 create mode 100644 node_modules/recast/tsconfig.json
 create mode 100644 node_modules/riot/LICENSE.txt
 create mode 100644 node_modules/riot/README.md
 create mode 100644 node_modules/riot/package.json
 create mode 100644 node_modules/riot/riot+compiler.js
 create mode 100644 node_modules/riot/riot+compiler.min.js
 create mode 100644 node_modules/riot/riot.d.ts
 create mode 100644 node_modules/riot/riot.esm.js
 create mode 100644 node_modules/riot/riot.js
 create mode 100644 node_modules/riot/riot.min.js
 create mode 100644 node_modules/riot/src/.DS_Store
 create mode 100644 node_modules/riot/src/core/component.js
 create mode 100644 node_modules/riot/src/core/css-manager.js
 create mode 100644 node_modules/riot/src/globals.js
 create mode 100644 node_modules/riot/src/riot+compiler.js
 create mode 100644 node_modules/riot/src/riot.js
 create mode 100644 node_modules/riot/src/utils/checks.js
 create mode 100644 node_modules/riot/src/utils/dom.js
 create mode 100644 node_modules/riot/src/utils/misc.js
 create mode 100644 node_modules/smooth-scroll/.github/contributing.md
 create mode 100755 node_modules/smooth-scroll/.github/issue_template.md
 create mode 100644 node_modules/smooth-scroll/.github/main.workflow
 create mode 100755 node_modules/smooth-scroll/.travis.yml
 create mode 100755 node_modules/smooth-scroll/LICENSE.md
 create mode 100755 node_modules/smooth-scroll/README.md
 create mode 100755 node_modules/smooth-scroll/dist/smooth-scroll.js
 create mode 100755 node_modules/smooth-scroll/dist/smooth-scroll.min.js
 create mode 100755 node_modules/smooth-scroll/dist/smooth-scroll.polyfills.js
 create mode 100755 node_modules/smooth-scroll/dist/smooth-scroll.polyfills.min.js
 create mode 100755 node_modules/smooth-scroll/gulpfile.js
 create mode 100755 node_modules/smooth-scroll/index.html
 create mode 100644 node_modules/smooth-scroll/jump-to-top.html
 create mode 100755 node_modules/smooth-scroll/package.json
 create mode 100644 node_modules/smooth-scroll/speed.html
 create mode 100755 node_modules/smooth-scroll/src/copy/index.html
 create mode 100644 node_modules/smooth-scroll/src/copy/jump-to-top.html
 create mode 100644 node_modules/smooth-scroll/src/copy/speed.html
 create mode 100644 node_modules/smooth-scroll/src/js/smooth-scroll/_closest.polyfill.js
 create mode 100644 node_modules/smooth-scroll/src/js/smooth-scroll/_customEvent.polyfill.js
 create mode 100644 node_modules/smooth-scroll/src/js/smooth-scroll/_requestAnimationFrame.polyfill.js
 create mode 100755 node_modules/smooth-scroll/src/js/smooth-scroll/smooth-scroll.js
 create mode 100644 node_modules/source-map/CHANGELOG.md
 create mode 100644 node_modules/source-map/LICENSE
 create mode 100644 node_modules/source-map/README.md
 create mode 100644 node_modules/source-map/dist/source-map.js
 create mode 100644 node_modules/source-map/lib/array-set.js
 create mode 100644 node_modules/source-map/lib/base64-vlq.js
 create mode 100644 node_modules/source-map/lib/base64.js
 create mode 100644 node_modules/source-map/lib/binary-search.js
 create mode 100644 node_modules/source-map/lib/mapping-list.js
 create mode 100644 node_modules/source-map/lib/mappings.wasm
 create mode 100644 node_modules/source-map/lib/read-wasm.js
 create mode 100644 node_modules/source-map/lib/source-map-consumer.js
 create mode 100644 node_modules/source-map/lib/source-map-generator.js
 create mode 100644 node_modules/source-map/lib/source-node.js
 create mode 100644 node_modules/source-map/lib/util.js
 create mode 100644 node_modules/source-map/lib/wasm.js
 create mode 100644 node_modules/source-map/package.json
 create mode 100644 node_modules/source-map/source-map.d.ts
 create mode 100644 node_modules/source-map/source-map.js
 create mode 100644 node_modules/type-fest/index.d.ts
 create mode 100644 node_modules/type-fest/license
 create mode 100644 node_modules/type-fest/package.json
 create mode 100644 node_modules/type-fest/readme.md
 create mode 100644 node_modules/type-fest/source/basic.d.ts
 create mode 100644 node_modules/type-fest/source/except.d.ts
 create mode 100644 node_modules/type-fest/source/literal-union.d.ts
 create mode 100644 node_modules/type-fest/source/merge-exclusive.d.ts
 create mode 100644 node_modules/type-fest/source/merge.d.ts
 create mode 100644 node_modules/type-fest/source/mutable.d.ts
 create mode 100644 node_modules/type-fest/source/package-json.d.ts
 create mode 100644 node_modules/type-fest/source/promisable.d.ts
 create mode 100644 node_modules/type-fest/source/readonly-deep.d.ts
 create mode 100644 node_modules/type-fest/source/require-at-least-one.d.ts
 create mode 100644 package-lock.json
 create mode 100644 src/TinyOnePage.riot

diff --git a/dist/index.html b/dist/index.html
new file mode 100644
index 0000000..952c39b
--- /dev/null
+++ b/dist/index.html
@@ -0,0 +1,34 @@
+<!DOCTYPE html>
+<html>
+<head lang="en">
+    <meta charset="utf-8">
+
+    <title>Tiny Hamburger | Demo 386 Top</title>
+    <link rel="shortcut icon" href="#" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+
+    <link href="https://cdnjs.cloudflare.com/ajax/libs/normalize/8.0.1/normalize.min.css" type="text/css" rel="stylesheet" />
+    <link href="css/icomoon.css" type="text/css" rel="stylesheet" />
+    <link href="css/fonts.css" type="text/css" rel="stylesheet" />
+    <link href="css/demo-386-top.css" type="text/css" rel="stylesheet" />
+</head>
+<body>
+    <div class="panel">
+        <tiny-hamburger>
+            <nav>
+                <ul>
+                    <li><a class="current" href="index.html">Demo: 386 / Top</a></li>
+                    <li><a href="demo-386-left.html">Demo: 386 / Left</a></li>
+                    <li><a href="demo-flat-left.html">Demo: Flat / Left</a></li>
+                </ul>
+            </nav>
+        </tiny-hamburger>
+    </div>
+    <footer>
+        <a target="_blank" href="https://github.com/HerrHase/tiny-hamburger">
+            <i class="icon icon-github"></i>
+        </a>
+    </footer>
+    <script src="js/demo-386-top.js"></script>
+</body>
+</html>
diff --git a/node_modules/.bin/acorn b/node_modules/.bin/acorn
new file mode 120000
index 0000000..cf76760
--- /dev/null
+++ b/node_modules/.bin/acorn
@@ -0,0 +1 @@
+../acorn/bin/acorn
\ No newline at end of file
diff --git a/node_modules/.bin/cssesc b/node_modules/.bin/cssesc
new file mode 120000
index 0000000..487b689
--- /dev/null
+++ b/node_modules/.bin/cssesc
@@ -0,0 +1 @@
+../cssesc/bin/cssesc
\ No newline at end of file
diff --git a/node_modules/.bin/esparse b/node_modules/.bin/esparse
new file mode 120000
index 0000000..7423b18
--- /dev/null
+++ b/node_modules/.bin/esparse
@@ -0,0 +1 @@
+../esprima/bin/esparse.js
\ No newline at end of file
diff --git a/node_modules/.bin/esvalidate b/node_modules/.bin/esvalidate
new file mode 120000
index 0000000..16069ef
--- /dev/null
+++ b/node_modules/.bin/esvalidate
@@ -0,0 +1 @@
+../esprima/bin/esvalidate.js
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/CHANGELOG.md b/node_modules/@riotjs/compiler/CHANGELOG.md
new file mode 100644
index 0000000..17d4729
--- /dev/null
+++ b/node_modules/@riotjs/compiler/CHANGELOG.md
@@ -0,0 +1,378 @@
+# Compiler Changes
+
+### v4.3.11
+- Fix https://github.com/riot/compiler/issues/127
+- Fix https://github.com/riot/compiler/issues/126
+- Improve the code maintainability refactoring big files into smaller ones
+
+### v4.3.10
+- Fix https://github.com/riot/riot/issues/2753
+- Fix https://github.com/riot/riot/issues/2748
+- Update acorn to v7.0.0
+
+### v4.3.9
+- Fix https://github.com/riot/compiler/issues/125
+- Fix https://github.com/riot/compiler/issues/124
+
+### v4.3.8
+- Fix make sure that the `createExpression` internal function receives always all its arguments
+
+### v4.3.7
+- Fix https://github.com/riot/compiler/issues/121
+
+### v4.3.6
+- Fix https://github.com/riot/compiler/issues/122
+- Fix https://github.com/riot/compiler/pull/118
+
+### v4.3.5
+- Fix backslashed unicode css properties
+
+### v4.3.4
+- Fix escape backslashes in css strings https://github.com/riot/riot/issues/2726
+
+### v4.3.3
+- Fix https://github.com/riot/compiler/issues/119
+- Fix https://github.com/riot/riot/issues/2726
+
+### v4.3.2
+- Fix void tags will be automatically corrected for example:
+  ```html
+    <svg>
+      <circle></circle>
+    </svg>
+  ```
+  Will be transfromed to
+
+  ```html
+    <svg>
+      <circle/>
+    </svg>
+  ```
+
+### v4.3.1
+- Fix https://github.com/riot/riot/issues/2719
+- Fix https://github.com/riot/riot/issues/2723
+
+### v4.3.0
+- Add support for dynamic import
+
+### v4.2.6
+- Fix expression parts issues https://github.com/riot/riot/issues/2701
+
+### v4.2.5
+- Fix https://github.com/riot/riot/issues/2700 replacing the `esprima` parser with `acorn`
+
+### v4.2.4
+- Fix attributes on custom tags having `if` or `each` directives
+
+### v4.2.3
+- Update `@riotjs/dom-bindings` using v4.0.0
+- Update npm dependencies
+
+### v4.2.2
+- Fix [riot#2691](https://github.com/riot/riot/issues/2691)
+
+### v4.2.1
+- Fix css generation with `@media` queries
+
+### v4.2.0
+- Add support for `<a {href}/>` shortcut expressions
+- Fix spread expressions issue [riot/2679](https://github.com/riot/riot/issues/2679)
+
+### v4.1.1
+- Fix commonjs imports
+
+### v4.1.0
+- Add support for the slot attribute binding
+
+### v4.0.4
+- Fix avoid removing selector attributes twice on custom tags
+
+### v4.0.3
+- Fix attributes handling on custom children nodes [riot#2680](https://github.com/riot/riot/issues/2680)
+
+### v4.0.2
+- Fix spread operator on each directives [riot#2679](https://github.com/riot/riot/issues/2679)
+
+### v4.0.1
+- Fix attributes mixed with expressions [riot#2681](https://github.com/riot/riot/issues/2681)
+
+### v4.0.0
+- Complete rewrite **not backward compatible**
+- New output compatible only for Riot.js 4.0.0
+- Add better sourcemaps generation
+- Add the `@riotjs/parser` fixing odd issues with regex like [#114](https://github.com/riot/compiler/issues/114)
+- Improve the code generation strategy preferring AST to regex parsing
+- Remove all the preprocessors from the core in favor of `registerPreprocessor` and `registerPostprocessor` instead
+
+### v4.0.0-beta.5
+- Fix https://github.com/riot/riot/issues/2669
+
+### v4.0.0-beta.3
+- Fix https://github.com/riot/compiler/issues/115
+
+### v4.0.0-beta.2
+- Add support for multiple expressions on the same attribute node
+
+### v4.0.0-beta.1
+- Update rename the `tag` property `exports`
+
+### v4.0.0-alpha.20
+- Fix handle escaped chars
+
+### v4.0.0-alpha.19
+- Fix bug in nodes with a single expression
+
+### v4.0.0-alpha.18
+- Add the `name` key to the tag exports
+- Fix self-closed tag bindings
+
+### v4.0.0-alpha.17
+- Remove unused dev dependencies
+
+### v4.0.0-alpha.16
+- *Breaking change*: make the compiler API synchronous
+
+### v4.0.0-alpha.15
+- Fix slots root nodes handling
+
+### v4.0.0-alpha.14
+- Add sourcemap tests for babel preprocessor
+- Update handling of multiple line text expressions, from template literal to array
+- Update output format
+
+### v4.0.0-alpha.13
+- Fix sourcemap for the multiple text expressions
+- Check make sure that `slot` tags will not be considered custom tags
+
+### v4.0.0-alpha.12
+- Fix sourcemap `sourcesContent` property
+- Update sourcemap filename
+
+### v4.0.0-alpha.11
+- Fix sourcemap generation for the `if` and `each` tag bindings
+
+### v4.0.0-alpha.10
+- Update enhance sourcemaps generation
+- Change second arguments for the pre/post processors. The `meta` object will contain info about the current compilation
+
+### v4.0.0-alpha.9
+- Fix move `recast` into the package dependencies
+
+### v4.0.0-alpha.8
+- Enhance the source map generation
+- Improve performance
+- Update npm dependencies
+
+### v4.0.0-alpha.7
+- Add support for the scoped css
+- Update the Tag bindings output to support dynamic tags
+
+### v4.0.0-alpha.6
+- Fix issue with the object expressions scoping
+
+### v4.0.0-alpha.5
+- Update the tag bindings API to get the component implementation via function
+
+### v4.0.0-alpha.4
+- Fix issues related to the member expressions traversal and the scope
+
+### v4.0.0-alpha.3
+- Fix issue with custom tags and no slots
+
+### v4.0.0-alpha.2
+- Add support for the spread attributes `<a {...foo}/>`
+- Add the `tagName` to the compiler options in runtime
+- Fix the options were not passed to the postprocessor
+
+### v4.0.0-alpha.1
+
+- New complete rewrite from scratch
+- Change npm name from `riot-compiler` to `@riotjs/compiler`
+- First alpha release not backward compatible
+
+### v3.5.2
+- Fix es6 dynamic imports https://github.com/riot/riot/issues/2641
+
+### v3.5.1
+- Fix try importing `@babel/core` first and then fallback to `babel-core` for the `es6` parser
+
+### v3.5.0
+- Add support for Babel 7
+
+### v3.4.0
+- Add inline sourcemap support via `sourcemap='inline'` option
+
+### v3.3.1
+- Improve the sourcemap generation adding the `sourceContent` key
+
+### v3.3.0
+- Add initial experimental sourcemaps support via `sourcemap: true` option
+
+### v3.2.6
+- Fix #105
+- Fix #104
+
+### v3.2.5
+- Update dependencies and refactor some internal code avoiding bitwise operators
+- Fix coffeescript parser require https://github.com/riot/compiler/pull/102
+
+### v3.2.4
+- Fix [riot#2369](https://github.com/riot/riot/issues/2369) : Possible bug involving compilation of tags containing regex.
+- Using the `skip-regex` function from npm for sharing bwteen modules (at future).
+- Using the `jsSplitter` function for safer replacement of JS code, part of the next compiler.
+
+### v3.2.3
+- Fixes various issues with literal regexes.
+
+### v3.1.4
+- Fix avoid the `filename` option for the babel-standalone parser
+
+### v3.1.3
+- Fix babel in browser runtime parser https://github.com/riot/examples/issues/51
+
+### v3.1.2
+- Fix [riot#2210](https://github.com/riot/riot/issues/2210) : Style tag get stripped from riot tag even if it's in a javascript string.
+- Updated devDependencies.
+
+### v3.1.0
+- Adds support for css @apply rule: now ScopedCSS parser can handle it properly
+
+### v3.0.0
+- Deprecate old `babel` support, now the `es6` parser will use Babel 6 by default
+- Change css always scoped by default
+- Fix all the `value` attributes using expressions will be output as `riot-value` to [riot#1957](https://github.com/riot/riot/issues/1957)
+
+### v2.5.5
+- Fix to erroneous version number in the package.json, v2.5.4 was released before.
+- Removed unuseful files from the npm package.
+- Updated credits in package.json
+- Updated devDependencies, skip ESLint in CI test for node v0.12
+- BuGless-hack for [riot#1966](https://github.com/riot/riot/issues/1966) - You can use `<-/>` to signal the end of the html if your html is ending with an expression.
+
+### v2.5.4
+- Fix #68 : SASS inside Pug template gives Invalid CSS.
+- Added parser for [bublé](https://buble.surge.sh) as `buble` in the browser. Option `modules` is `false` in all versions.
+- Added parser for [bublé](https://buble.surge.sh) as `buble`.
+- Added support for es6 `import` statements. Thanks to @kuashe! - Related to [riot#1715](https://github.com/riot/riot/issues/1715), [riot#1784](https://github.com/riot/riot/issues/1784), and [riot#1864](https://github.com/riot/riot/issues/1864).
+
+### v2.5.3
+- Fix #73 : resolveModuleSource must be a function - Option removed from the default Babel options.
+- Updated node.js to 4.4 in the Travis environment.
+- Downgraded ESLint to 2.x for using with node v0.12.x
+
+### v2.5.2
+- Fix #72: `undefined` is not a function when evaluating `parsers._req`.
+- Updated node versions for travis, including v5.x
+
+### v2.4.1
+
+- Add the `pug` parser (it will replace completely `jade` in the next major release)
+- Add the possibility to pass custom parsers options directly via the `compiler.compile` method through the `parserOptions: {js: {}, template: {}, style: {}}` key [more info](https://github.com/riot/compiler/issues/64)
+- Fix un-escape parser options in html [more info](https://github.com/riot/compiler/issues/63)
+
+### v2.3.23
+- The parsers are moved to its own directory in the node version. The load is on first use.
+- Fix [riot#1325](https://github.com/riot/riot/issues/1325) : Gulp + Browserify + Babelify + type="es6" error.
+- Fix [riot#1342](https://github.com/riot/riot/issues/1342), [riot#1636](https://github.com/riot/riot/issues/1636) and request from [dwyl/learn-riot#8](https://github.com/dwyl/learn-riot/issues/8) : Server-Side Rendered Page Fails W3C Check. The new `data-is` attribute is used for scoped styles in addition to `riot-tag` (the later will be removed in compiler v3.x)
+- The keyword `defer` in `<script src=file>` avoids that the compiler loads the file, preserving the tag - Requested by [riot#1492](https://github.com/riot/riot/issues/1492) : Stop script tags from being evaluated with serverside `riot.render`. It is removed in client-side compilation because browsers will not load scripts through innerHTML.
+- It has changed the character used to hide expressions during the compilation, maybe this fix [riot#1588](https://github.com/riot/riot/issues/1588) : Syntax Error: Invalid character `\0129` (riot+compiler.min).
+- The option `debug` inserts newlines between the `riot.tag2` parameters and the call is prefixed with the source filename - Requested by [riot#1646](https://github.com/riot/riot/issues/1646) : Split portions of generated html with newline instead of space
+- Removed the unused parameter with the compiled-time brackets from the call to `riot.tag2`.
+- Removed support for raw expressions. It is unlikely this feature will be implemented in v2.3.x
+- Updated the regex that is used to match tag names, more closer to the HTML5 specs.
+- Update devDependencies.
+
+### v2.3.22
+- Fix [riot#1511](https://github.com/riot/riot/issues/1511) : Escape Quotes - They may be some issues to fix.
+- Regression of logic to parse style and script tags, due to loss of performance and other issues.
+- Removed the "compress" option of the `less` parser, which is deprecated and generates warnings in the console.
+- Removed the unuseful CSS parser `stylus` from the browser version.
+- Refactorization of all the code, with more comments in preparation for the automatic documentation of the API.
+- Various tweaks to increase performance and reduce (~55%) memory consumption.
+- Files to preprocess are moved from "lib" to the "src" directory, now "lib" has the required node.js files only.
+
+### v2.3.21 (unpublished due to errors)
+
+### v2.3.20
+- Fix [riot#1495](https://github.com/riot/riot/issues/1495) : Warning of input tag value - Avoids warnings for date/datetime/time/month/email/color types with expression in its value.
+- Fix [riot#1488](https://github.com/riot/riot/issues/1488) : Cannot read property 'replace' of undefined when compiling in Node a tag with an import in its less stylesheet -- Thanks to @jrx-jsj
+- Fix [riot#1448](https://github.com/riot/riot/issues/1448) : Riot compiler parses and removes content from string declaration. This is partial fix, you need to write `<\/script>` for closing script tags within quoted strings.
+- Revised regex that matches `<pre>` tags.
+- `@import` directives of `stylus`, `sass`, `scss`, and `less` can be relative to the file being processed.
+- Fixed lint issues with new .eslintrc.yml, almost compatible with [JavaScript Standard Style](http://standardjs.com/)
+
+### v2.3.19
+- Fixing issues with double quotes.
+- Removed dependency on riot-tmpl for the node build, now we are using a local version of `brackets`.
+
+### v2.3.18
+
+- Regression of optimized regexes not working in IE9/10.
+- Fix #36 : removed the excluded strings from the ouput.
+- Fix: avoid changing the global brackets when the compiler is called with other brackets (requires riot-tmpl v2.3.15).
+- A new property `version` (string) is included in the compiler set.
+- Fixes to travis CI and the bump routine
+
+### v2.3.15 (unpublished from npm)
+
+- Preparation for use as ES6 module through [rollup.js](http://rollupjs.org/)
+- Update devDependencies, including jspreproc v0.2.5 with an important fix.
+- Partial regression of fix [riot#1120](https://github.com/riot/riot/issues/1120), `tmpl` can parse double-quotes within expressions, encoding double-quotes generates issues.
+
+### v2.3.14
+
+- The prefix `__` for boolean attributes is not used anymore. This IE8 hack and it is not neccessary for current supported versions.
+- Option `exclude` for ignore parts of the tag. This is an array with one or more of 'html', 'css', 'attribs', 'js'.
+- Removed `inert` from the boolean attributes list, this html5 attribute was dropped from the specs.
+- Fixed normalization of root attributes, was not working as expected. Example updated.
+
+### v2.3.13
+
+- Fixed the `style` option for setting the CSS parser through the `options` object.
+- Fixed an issue in preservation of line endings in the generated html markup.
+- Fixed tests, coverage is 100% again.
+- Updated [doc/guide.md](https://github.com/riot/compiler/blob/master/doc/guide.md) and [doc/attributes.md](https://github.com/riot/compiler/blob/master/doc/attrbutes.md) with the latest features.
+
+### v2.3.12
+
+- Gets rid of the zero-indentation restriction for custom tags, now you can indent these tags, but the opening and closing tag must have exactly the same indentation (length and type). All the tag will be unindented by this amount.
+- Support for `src` and `charset` attributes in `<script>` tags for reading JavaScript sources from the file system - [riot#1116](https://github.com/riot/riot/issues/1116), [riot#507](https://github.com/riot/riot/issues/507)
+- The `compile` function can return separate parts by setting the new `entities` option. These parts has unescaped newlines.
+- New attribute `options` for `script` and `style` tags will append/overwrite attributes in the default configuration object of the parser at tag level.
+- Fix [riot#1261](https://github.com/riot/riot/issues/1261) : `<pre>` tag does not preserve neither `\n` nor `\t`.
+  Now whitespace within `<pre>` tags is always preserved.
+- Fix [riot#1358](https://github.com/riot/riot/issues/1358) : Empty style in tag (scoped) breaks.
+
+### v2.3.11
+
+- New type="babel" supports babel-core v6.x. You must `npm install babel-preset-es2015` too, for this works.
+  Use type="es6" for babel and babel-core v5.8.x and bellow - [riot#1039](https://github.com/riot/riot/issues/1039)
+- Fix [riot#1306](https://github.com/riot/riot/issues/1306) : Compiler preserves newlines in class objects, causing "Unterminated String Constant" errors.
+- Fix [riot#1314](https://github.com/riot/riot/issues/1314) : `settings.brackets` no longer works.
+- Fix [riot#1309](https://github.com/riot/riot/issues/1309) : Tag renders js instead of content when no attributes present.
+
+### v2.3.0
+
+This is a complete rewrite and the first solo version of the compiler.
+
+- Now the compiler generates a call to the new `riot.tag2` function, with the same parameters as `riot.tag` and an
+  additional one: the brackets used in the compilation. `riot.tag2` requires all parameters except the brackets,
+  so the compiler generates all but ignores the brackets if there are no generated expressions.
+- Unlike previous versions, backslashes are removed from the expressions (before being sent to any parser).
+  Outside of expressions, all backslashes are preserved.
+- Double quotes inside expressions are converted to `&quot;`, to avoid issues with HTML markup.
+- Fix [riot#1207](https://github.com/riot/riot/issues/1207) : Riot compiler/parser breaks indentation.
+- Fix [riot#1120](https://github.com/riot/riot/issues/1120) : Double quotes break Riot attributes
+
+Enhancements
+
+- The compiler loads the brackets in runtime on each tag, allowing use of different brackets. [riot#1122](https://github.com/riot/riot/issues/1122) related.
+- Multiple `<script>` blocks. These can have different types and are merged with the untagged script block, if any.
+- More flexible formats in ES6 style method definitions.
+- In the JavaScript, trailing whitespace are removed and multiple empty lines are combined into one.
+- Better recognition of expressions. Now you can use almost any character, even in unquoted expressions (expressions containing the `>` operator needs to be enclosed in quotes) - [riot#744](https://github.com/riot/riot/issues/744)
+- If the first character inside an expression is `^`, the expression is not passed to any parser. This is some sort of type=none at expression level - [riot#543](https://github.com/riot/riot/issues/543), [riot#1090](https://github.com/riot/riot/issues/1090)
+- Type es6 now supports babel-core - [riot#1039](https://github.com/riot/riot/issues/1039)
+- New logic for scoped style blocks, if a style contains the ":scoped" selector, this is replaced by the name of the root element, if not, the name is prepended - [riot#912](https://github.com/riot/riot/issues/912)
+- `type="scoped-css"` for `style` tags is deprecated, use only `scoped` or `scoped="scoped"`
diff --git a/node_modules/@riotjs/compiler/LICENSE b/node_modules/@riotjs/compiler/LICENSE
new file mode 100644
index 0000000..f48a2e5
--- /dev/null
+++ b/node_modules/@riotjs/compiler/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Riot 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/@riotjs/compiler/README.md b/node_modules/@riotjs/compiler/README.md
new file mode 100644
index 0000000..3a84a70
--- /dev/null
+++ b/node_modules/@riotjs/compiler/README.md
@@ -0,0 +1,107 @@
+[![Build Status][travis-image]][travis-url]
+[![Issue Count][codeclimate-image]][codeclimate-url]
+[![Coverage Status][coverage-image]][coverage-url]
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Important
+
+This compiler will not work with older Riot.js versions.
+It's designed to work with Riot.js > 4.0.0.
+For Riot.js < 4.0.0 please check the [v3](https://github.com/riot/compiler/tree/v3) branch
+
+## Installation
+
+```
+npm i @riotjs/compiler -D
+```
+
+## Usage
+
+The riot compiler can compile only strings:
+
+```js
+import { compile } from '@riotjs/compiler'
+
+const { code, map } = compile('<p>{hello}</p>')
+```
+
+You can compile your tags also using the new `registerPreprocessor` and `registerPostprocessor` APIs for example:
+
+```js
+import { compiler, registerPreprocessor, registerPostprocessor } from '@riotjs/compiler'
+import pug from 'pug'
+import buble from 'buble'
+
+// process your tag template before it will be compiled
+registerPreprocessor('template', 'pug', function(code, { options }) {
+  const { file } = options
+  console.log('your file path is:', file)
+  
+  return {
+    code: pug.render(code),
+    // no sourcemap here
+    map: null
+  }
+})
+
+// your compiler output will pass from here
+registerPostprocessor(function(code, { options }) {
+  const { file } = options
+  console.log('your file path is:', file)
+  
+  // notice that buble.transform returns {code, map}
+  return buble.transform(code)
+})
+
+const { code, map } = compile('<p>{hello}</p>', {
+  // specify the template preprocessor
+  template: 'pug'
+})
+```
+
+## API
+
+### compile(string, options)
+#### @returns `<Promise>{ code, map }` output that can be used by Riot.js
+
+- *string*: is your tag source code
+- *options*: the options should contain the `file` key identifying the source of the string to compile and
+the `template` preprocessor to use as string
+
+Note: specific preprocessors like the `css` or the `javascript` ones can be enabled simply specifying the `type` attribute
+in the tag source code for example
+
+```html
+<my-tag>
+  <style type='scss'>
+    // ...
+  </style>
+</my-tag>
+```
+
+### registerPreprocessor(type, id, preprocessorFn)
+#### @returns `Object` containing all the preprocessors registered
+
+- *type*: either one of `template` `css` or `javascript`
+- *id*: unique preprocessor identifier
+- *preprocessorFn*: function receiving the code as first argument and the current options as second
+
+### registerPostprocessor(postprocessorFn)
+#### @returns `Set` containing all the postprocessors registered
+
+- *postprocessorFn*: function receiving the compiler output as first argument and the current options as second
+
+
+[travis-image]:  https://img.shields.io/travis/riot/compiler.svg?style=flat-square
+[travis-url]:    https://travis-ci.org/riot/compiler
+[license-image]: https://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+[license-url]:   LICENSE
+[npm-version-image]:   https://img.shields.io/npm/v/@riotjs/compiler.svg?style=flat-square
+[npm-downloads-image]: https://img.shields.io/npm/dm/@riotjs/compiler.svg?style=flat-square
+[npm-url]:             https://npmjs.org/package/@riotjs/compiler
+[coverage-image]:    https://img.shields.io/coveralls/riot/compiler/master.svg?style=flat-square
+[coverage-url]:      https://coveralls.io/r/riot/compiler?branch=master
+[codeclimate-image]: https://api.codeclimate.com/v1/badges/37de24282e8d113bb0cc/maintainability
+[codeclimate-url]:   https://codeclimate.com/github/riot/compiler
diff --git a/node_modules/@riotjs/compiler/dist/compiler.js b/node_modules/@riotjs/compiler/dist/compiler.js
new file mode 100644
index 0000000..2eda51e
--- /dev/null
+++ b/node_modules/@riotjs/compiler/dist/compiler.js
@@ -0,0 +1,35811 @@
+/* Riot Compiler WIP, @license MIT */
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('fs'), require('path')) :
+	typeof define === 'function' && define.amd ? define(['exports', 'fs', 'path'], factory) :
+	(global = global || self, factory(global.compiler = {}, global.fs, global.path));
+}(this, function (exports, fs, path$1) { 'use strict';
+
+	fs = fs && fs.hasOwnProperty('default') ? fs['default'] : fs;
+	path$1 = path$1 && path$1.hasOwnProperty('default') ? path$1['default'] : path$1;
+
+	const TAG_LOGIC_PROPERTY = 'exports';
+	const TAG_CSS_PROPERTY = 'css';
+	const TAG_TEMPLATE_PROPERTY = 'template';
+	const TAG_NAME_PROPERTY = 'name';
+
+	function unwrapExports (x) {
+		return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+	}
+
+	function createCommonjsModule(fn, module) {
+		return module = { exports: {} }, fn(module, module.exports), module.exports;
+	}
+
+	function getCjsExportFromNamespace (n) {
+		return n && n['default'] || n;
+	}
+
+	var types = createCommonjsModule(function (module, exports) {
+	var __extends = (this && this.__extends) || (function () {
+	    var extendStatics = function (d, b) {
+	        extendStatics = Object.setPrototypeOf ||
+	            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+	            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+	        return extendStatics(d, b);
+	    };
+	    return function (d, b) {
+	        extendStatics(d, b);
+	        function __() { this.constructor = d; }
+	        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+	    };
+	})();
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var Op = Object.prototype;
+	var objToStr = Op.toString;
+	var hasOwn = Op.hasOwnProperty;
+	var BaseType = /** @class */ (function () {
+	    function BaseType() {
+	    }
+	    BaseType.prototype.assert = function (value, deep) {
+	        if (!this.check(value, deep)) {
+	            var str = shallowStringify(value);
+	            throw new Error(str + " does not match type " + this);
+	        }
+	        return true;
+	    };
+	    BaseType.prototype.arrayOf = function () {
+	        var elemType = this;
+	        return new ArrayType(elemType);
+	    };
+	    return BaseType;
+	}());
+	var ArrayType = /** @class */ (function (_super) {
+	    __extends(ArrayType, _super);
+	    function ArrayType(elemType) {
+	        var _this = _super.call(this) || this;
+	        _this.elemType = elemType;
+	        _this.kind = "ArrayType";
+	        return _this;
+	    }
+	    ArrayType.prototype.toString = function () {
+	        return "[" + this.elemType + "]";
+	    };
+	    ArrayType.prototype.check = function (value, deep) {
+	        var _this = this;
+	        return Array.isArray(value) && value.every(function (elem) { return _this.elemType.check(elem, deep); });
+	    };
+	    return ArrayType;
+	}(BaseType));
+	var IdentityType = /** @class */ (function (_super) {
+	    __extends(IdentityType, _super);
+	    function IdentityType(value) {
+	        var _this = _super.call(this) || this;
+	        _this.value = value;
+	        _this.kind = "IdentityType";
+	        return _this;
+	    }
+	    IdentityType.prototype.toString = function () {
+	        return String(this.value);
+	    };
+	    IdentityType.prototype.check = function (value, deep) {
+	        var result = value === this.value;
+	        if (!result && typeof deep === "function") {
+	            deep(this, value);
+	        }
+	        return result;
+	    };
+	    return IdentityType;
+	}(BaseType));
+	var ObjectType = /** @class */ (function (_super) {
+	    __extends(ObjectType, _super);
+	    function ObjectType(fields) {
+	        var _this = _super.call(this) || this;
+	        _this.fields = fields;
+	        _this.kind = "ObjectType";
+	        return _this;
+	    }
+	    ObjectType.prototype.toString = function () {
+	        return "{ " + this.fields.join(", ") + " }";
+	    };
+	    ObjectType.prototype.check = function (value, deep) {
+	        return (objToStr.call(value) === objToStr.call({}) &&
+	            this.fields.every(function (field) {
+	                return field.type.check(value[field.name], deep);
+	            }));
+	    };
+	    return ObjectType;
+	}(BaseType));
+	var OrType = /** @class */ (function (_super) {
+	    __extends(OrType, _super);
+	    function OrType(types) {
+	        var _this = _super.call(this) || this;
+	        _this.types = types;
+	        _this.kind = "OrType";
+	        return _this;
+	    }
+	    OrType.prototype.toString = function () {
+	        return this.types.join(" | ");
+	    };
+	    OrType.prototype.check = function (value, deep) {
+	        return this.types.some(function (type) {
+	            return type.check(value, deep);
+	        });
+	    };
+	    return OrType;
+	}(BaseType));
+	var PredicateType = /** @class */ (function (_super) {
+	    __extends(PredicateType, _super);
+	    function PredicateType(name, predicate) {
+	        var _this = _super.call(this) || this;
+	        _this.name = name;
+	        _this.predicate = predicate;
+	        _this.kind = "PredicateType";
+	        return _this;
+	    }
+	    PredicateType.prototype.toString = function () {
+	        return this.name;
+	    };
+	    PredicateType.prototype.check = function (value, deep) {
+	        var result = this.predicate(value, deep);
+	        if (!result && typeof deep === "function") {
+	            deep(this, value);
+	        }
+	        return result;
+	    };
+	    return PredicateType;
+	}(BaseType));
+	var Def = /** @class */ (function () {
+	    function Def(type, typeName) {
+	        this.type = type;
+	        this.typeName = typeName;
+	        this.baseNames = [];
+	        this.ownFields = Object.create(null);
+	        // Includes own typeName. Populated during finalization.
+	        this.allSupertypes = Object.create(null);
+	        // Linear inheritance hierarchy. Populated during finalization.
+	        this.supertypeList = [];
+	        // Includes inherited fields.
+	        this.allFields = Object.create(null);
+	        // Non-hidden keys of allFields.
+	        this.fieldNames = [];
+	        // This property will be overridden as true by individual Def instances
+	        // when they are finalized.
+	        this.finalized = false;
+	        // False by default until .build(...) is called on an instance.
+	        this.buildable = false;
+	        this.buildParams = [];
+	    }
+	    Def.prototype.isSupertypeOf = function (that) {
+	        if (that instanceof Def) {
+	            if (this.finalized !== true ||
+	                that.finalized !== true) {
+	                throw new Error("");
+	            }
+	            return hasOwn.call(that.allSupertypes, this.typeName);
+	        }
+	        else {
+	            throw new Error(that + " is not a Def");
+	        }
+	    };
+	    Def.prototype.checkAllFields = function (value, deep) {
+	        var allFields = this.allFields;
+	        if (this.finalized !== true) {
+	            throw new Error("" + this.typeName);
+	        }
+	        function checkFieldByName(name) {
+	            var field = allFields[name];
+	            var type = field.type;
+	            var child = field.getValue(value);
+	            return type.check(child, deep);
+	        }
+	        return value !== null &&
+	            typeof value === "object" &&
+	            Object.keys(allFields).every(checkFieldByName);
+	    };
+	    Def.prototype.bases = function () {
+	        var supertypeNames = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            supertypeNames[_i] = arguments[_i];
+	        }
+	        var bases = this.baseNames;
+	        if (this.finalized) {
+	            if (supertypeNames.length !== bases.length) {
+	                throw new Error("");
+	            }
+	            for (var i = 0; i < supertypeNames.length; i++) {
+	                if (supertypeNames[i] !== bases[i]) {
+	                    throw new Error("");
+	                }
+	            }
+	            return this;
+	        }
+	        supertypeNames.forEach(function (baseName) {
+	            // This indexOf lookup may be O(n), but the typical number of base
+	            // names is very small, and indexOf is a native Array method.
+	            if (bases.indexOf(baseName) < 0) {
+	                bases.push(baseName);
+	            }
+	        });
+	        return this; // For chaining.
+	    };
+	    return Def;
+	}());
+	exports.Def = Def;
+	var Field = /** @class */ (function () {
+	    function Field(name, type, defaultFn, hidden) {
+	        this.name = name;
+	        this.type = type;
+	        this.defaultFn = defaultFn;
+	        this.hidden = !!hidden;
+	    }
+	    Field.prototype.toString = function () {
+	        return JSON.stringify(this.name) + ": " + this.type;
+	    };
+	    Field.prototype.getValue = function (obj) {
+	        var value = obj[this.name];
+	        if (typeof value !== "undefined") {
+	            return value;
+	        }
+	        if (typeof this.defaultFn === "function") {
+	            value = this.defaultFn.call(obj);
+	        }
+	        return value;
+	    };
+	    return Field;
+	}());
+	function shallowStringify(value) {
+	    if (Array.isArray(value)) {
+	        return "[" + value.map(shallowStringify).join(", ") + "]";
+	    }
+	    if (value && typeof value === "object") {
+	        return "{ " + Object.keys(value).map(function (key) {
+	            return key + ": " + value[key];
+	        }).join(", ") + " }";
+	    }
+	    return JSON.stringify(value);
+	}
+	function typesPlugin(_fork) {
+	    var Type = {
+	        or: function () {
+	            var types = [];
+	            for (var _i = 0; _i < arguments.length; _i++) {
+	                types[_i] = arguments[_i];
+	            }
+	            return new OrType(types.map(function (type) { return Type.from(type); }));
+	        },
+	        from: function (value, name) {
+	            if (value instanceof ArrayType ||
+	                value instanceof IdentityType ||
+	                value instanceof ObjectType ||
+	                value instanceof OrType ||
+	                value instanceof PredicateType) {
+	                return value;
+	            }
+	            // The Def type is used as a helper for constructing compound
+	            // interface types for AST nodes.
+	            if (value instanceof Def) {
+	                return value.type;
+	            }
+	            // Support [ElemType] syntax.
+	            if (isArray.check(value)) {
+	                if (value.length !== 1) {
+	                    throw new Error("only one element type is permitted for typed arrays");
+	                }
+	                return new ArrayType(Type.from(value[0]));
+	            }
+	            // Support { someField: FieldType, ... } syntax.
+	            if (isObject.check(value)) {
+	                return new ObjectType(Object.keys(value).map(function (name) {
+	                    return new Field(name, Type.from(value[name], name));
+	                }));
+	            }
+	            if (typeof value === "function") {
+	                var bicfIndex = builtInCtorFns.indexOf(value);
+	                if (bicfIndex >= 0) {
+	                    return builtInCtorTypes[bicfIndex];
+	                }
+	                if (typeof name !== "string") {
+	                    throw new Error("missing name");
+	                }
+	                return new PredicateType(name, value);
+	            }
+	            // As a last resort, toType returns a type that matches any value that
+	            // is === from. This is primarily useful for literal values like
+	            // toType(null), but it has the additional advantage of allowing
+	            // toType to be a total function.
+	            return new IdentityType(value);
+	        },
+	        // Define a type whose name is registered in a namespace (the defCache) so
+	        // that future definitions will return the same type given the same name.
+	        // In particular, this system allows for circular and forward definitions.
+	        // The Def object d returned from Type.def may be used to configure the
+	        // type d.type by calling methods such as d.bases, d.build, and d.field.
+	        def: function (typeName) {
+	            return hasOwn.call(defCache, typeName)
+	                ? defCache[typeName]
+	                : defCache[typeName] = new DefImpl(typeName);
+	        },
+	        hasDef: function (typeName) {
+	            return hasOwn.call(defCache, typeName);
+	        }
+	    };
+	    var builtInCtorFns = [];
+	    var builtInCtorTypes = [];
+	    var builtInTypes = {};
+	    function defBuiltInType(example, name) {
+	        var objStr = objToStr.call(example);
+	        var type = new PredicateType(name, function (value) { return objToStr.call(value) === objStr; });
+	        builtInTypes[name] = type;
+	        if (example && typeof example.constructor === "function") {
+	            builtInCtorFns.push(example.constructor);
+	            builtInCtorTypes.push(type);
+	        }
+	        return type;
+	    }
+	    // These types check the underlying [[Class]] attribute of the given
+	    // value, rather than using the problematic typeof operator. Note however
+	    // that no subtyping is considered; so, for instance, isObject.check
+	    // returns false for [], /./, new Date, and null.
+	    var isString = defBuiltInType("truthy", "string");
+	    var isFunction = defBuiltInType(function () { }, "function");
+	    var isArray = defBuiltInType([], "array");
+	    var isObject = defBuiltInType({}, "object");
+	    var isRegExp = defBuiltInType(/./, "RegExp");
+	    var isDate = defBuiltInType(new Date, "Date");
+	    var isNumber = defBuiltInType(3, "number");
+	    var isBoolean = defBuiltInType(true, "boolean");
+	    var isNull = defBuiltInType(null, "null");
+	    var isUndefined = defBuiltInType(void 0, "undefined");
+	    // In order to return the same Def instance every time Type.def is called
+	    // with a particular name, those instances need to be stored in a cache.
+	    var defCache = Object.create(null);
+	    function defFromValue(value) {
+	        if (value && typeof value === "object") {
+	            var type = value.type;
+	            if (typeof type === "string" &&
+	                hasOwn.call(defCache, type)) {
+	                var d = defCache[type];
+	                if (d.finalized) {
+	                    return d;
+	                }
+	            }
+	        }
+	        return null;
+	    }
+	    var DefImpl = /** @class */ (function (_super) {
+	        __extends(DefImpl, _super);
+	        function DefImpl(typeName) {
+	            var _this = _super.call(this, new PredicateType(typeName, function (value, deep) { return _this.check(value, deep); }), typeName) || this;
+	            return _this;
+	        }
+	        DefImpl.prototype.check = function (value, deep) {
+	            if (this.finalized !== true) {
+	                throw new Error("prematurely checking unfinalized type " + this.typeName);
+	            }
+	            // A Def type can only match an object value.
+	            if (value === null || typeof value !== "object") {
+	                return false;
+	            }
+	            var vDef = defFromValue(value);
+	            if (!vDef) {
+	                // If we couldn't infer the Def associated with the given value,
+	                // and we expected it to be a SourceLocation or a Position, it was
+	                // probably just missing a "type" field (because Esprima does not
+	                // assign a type property to such nodes). Be optimistic and let
+	                // this.checkAllFields make the final decision.
+	                if (this.typeName === "SourceLocation" ||
+	                    this.typeName === "Position") {
+	                    return this.checkAllFields(value, deep);
+	                }
+	                // Calling this.checkAllFields for any other type of node is both
+	                // bad for performance and way too forgiving.
+	                return false;
+	            }
+	            // If checking deeply and vDef === this, then we only need to call
+	            // checkAllFields once. Calling checkAllFields is too strict when deep
+	            // is false, because then we only care about this.isSupertypeOf(vDef).
+	            if (deep && vDef === this) {
+	                return this.checkAllFields(value, deep);
+	            }
+	            // In most cases we rely exclusively on isSupertypeOf to make O(1)
+	            // subtyping determinations. This suffices in most situations outside
+	            // of unit tests, since interface conformance is checked whenever new
+	            // instances are created using builder functions.
+	            if (!this.isSupertypeOf(vDef)) {
+	                return false;
+	            }
+	            // The exception is when deep is true; then, we recursively check all
+	            // fields.
+	            if (!deep) {
+	                return true;
+	            }
+	            // Use the more specific Def (vDef) to perform the deep check, but
+	            // shallow-check fields defined by the less specific Def (this).
+	            return vDef.checkAllFields(value, deep)
+	                && this.checkAllFields(value, false);
+	        };
+	        DefImpl.prototype.build = function () {
+	            var _this = this;
+	            var buildParams = [];
+	            for (var _i = 0; _i < arguments.length; _i++) {
+	                buildParams[_i] = arguments[_i];
+	            }
+	            // Calling Def.prototype.build multiple times has the effect of merely
+	            // redefining this property.
+	            this.buildParams = buildParams;
+	            if (this.buildable) {
+	                // If this Def is already buildable, update self.buildParams and
+	                // continue using the old builder function.
+	                return this;
+	            }
+	            // Every buildable type will have its "type" field filled in
+	            // automatically. This includes types that are not subtypes of Node,
+	            // like SourceLocation, but that seems harmless (TODO?).
+	            this.field("type", String, function () { return _this.typeName; });
+	            // Override Dp.buildable for this Def instance.
+	            this.buildable = true;
+	            var addParam = function (built, param, arg, isArgAvailable) {
+	                if (hasOwn.call(built, param))
+	                    return;
+	                var all = _this.allFields;
+	                if (!hasOwn.call(all, param)) {
+	                    throw new Error("" + param);
+	                }
+	                var field = all[param];
+	                var type = field.type;
+	                var value;
+	                if (isArgAvailable) {
+	                    value = arg;
+	                }
+	                else if (field.defaultFn) {
+	                    // Expose the partially-built object to the default
+	                    // function as its `this` object.
+	                    value = field.defaultFn.call(built);
+	                }
+	                else {
+	                    var message = "no value or default function given for field " +
+	                        JSON.stringify(param) + " of " + _this.typeName + "(" +
+	                        _this.buildParams.map(function (name) {
+	                            return all[name];
+	                        }).join(", ") + ")";
+	                    throw new Error(message);
+	                }
+	                if (!type.check(value)) {
+	                    throw new Error(shallowStringify(value) +
+	                        " does not match field " + field +
+	                        " of type " + _this.typeName);
+	                }
+	                built[param] = value;
+	            };
+	            // Calling the builder function will construct an instance of the Def,
+	            // with positional arguments mapped to the fields original passed to .build.
+	            // If not enough arguments are provided, the default value for the remaining fields
+	            // will be used.
+	            var builder = function () {
+	                var args = [];
+	                for (var _i = 0; _i < arguments.length; _i++) {
+	                    args[_i] = arguments[_i];
+	                }
+	                var argc = args.length;
+	                if (!_this.finalized) {
+	                    throw new Error("attempting to instantiate unfinalized type " +
+	                        _this.typeName);
+	                }
+	                var built = Object.create(nodePrototype);
+	                _this.buildParams.forEach(function (param, i) {
+	                    if (i < argc) {
+	                        addParam(built, param, args[i], true);
+	                    }
+	                    else {
+	                        addParam(built, param, null, false);
+	                    }
+	                });
+	                Object.keys(_this.allFields).forEach(function (param) {
+	                    // Use the default value.
+	                    addParam(built, param, null, false);
+	                });
+	                // Make sure that the "type" field was filled automatically.
+	                if (built.type !== _this.typeName) {
+	                    throw new Error("");
+	                }
+	                return built;
+	            };
+	            // Calling .from on the builder function will construct an instance of the Def,
+	            // using field values from the passed object. For fields missing from the passed object,
+	            // their default value will be used.
+	            builder.from = function (obj) {
+	                if (!_this.finalized) {
+	                    throw new Error("attempting to instantiate unfinalized type " +
+	                        _this.typeName);
+	                }
+	                var built = Object.create(nodePrototype);
+	                Object.keys(_this.allFields).forEach(function (param) {
+	                    if (hasOwn.call(obj, param)) {
+	                        addParam(built, param, obj[param], true);
+	                    }
+	                    else {
+	                        addParam(built, param, null, false);
+	                    }
+	                });
+	                // Make sure that the "type" field was filled automatically.
+	                if (built.type !== _this.typeName) {
+	                    throw new Error("");
+	                }
+	                return built;
+	            };
+	            Object.defineProperty(builders, getBuilderName(this.typeName), {
+	                enumerable: true,
+	                value: builder
+	            });
+	            return this;
+	        };
+	        // The reason fields are specified using .field(...) instead of an object
+	        // literal syntax is somewhat subtle: the object literal syntax would
+	        // support only one key and one value, but with .field(...) we can pass
+	        // any number of arguments to specify the field.
+	        DefImpl.prototype.field = function (name, type, defaultFn, hidden) {
+	            if (this.finalized) {
+	                console.error("Ignoring attempt to redefine field " +
+	                    JSON.stringify(name) + " of finalized type " +
+	                    JSON.stringify(this.typeName));
+	                return this;
+	            }
+	            this.ownFields[name] = new Field(name, Type.from(type), defaultFn, hidden);
+	            return this; // For chaining.
+	        };
+	        DefImpl.prototype.finalize = function () {
+	            var _this = this;
+	            // It's not an error to finalize a type more than once, but only the
+	            // first call to .finalize does anything.
+	            if (!this.finalized) {
+	                var allFields = this.allFields;
+	                var allSupertypes = this.allSupertypes;
+	                this.baseNames.forEach(function (name) {
+	                    var def = defCache[name];
+	                    if (def instanceof Def) {
+	                        def.finalize();
+	                        extend(allFields, def.allFields);
+	                        extend(allSupertypes, def.allSupertypes);
+	                    }
+	                    else {
+	                        var message = "unknown supertype name " +
+	                            JSON.stringify(name) +
+	                            " for subtype " +
+	                            JSON.stringify(_this.typeName);
+	                        throw new Error(message);
+	                    }
+	                });
+	                // TODO Warn if fields are overridden with incompatible types.
+	                extend(allFields, this.ownFields);
+	                allSupertypes[this.typeName] = this;
+	                this.fieldNames.length = 0;
+	                for (var fieldName in allFields) {
+	                    if (hasOwn.call(allFields, fieldName) &&
+	                        !allFields[fieldName].hidden) {
+	                        this.fieldNames.push(fieldName);
+	                    }
+	                }
+	                // Types are exported only once they have been finalized.
+	                Object.defineProperty(namedTypes, this.typeName, {
+	                    enumerable: true,
+	                    value: this.type
+	                });
+	                this.finalized = true;
+	                // A linearization of the inheritance hierarchy.
+	                populateSupertypeList(this.typeName, this.supertypeList);
+	                if (this.buildable &&
+	                    this.supertypeList.lastIndexOf("Expression") >= 0) {
+	                    wrapExpressionBuilderWithStatement(this.typeName);
+	                }
+	            }
+	        };
+	        return DefImpl;
+	    }(Def));
+	    // Note that the list returned by this function is a copy of the internal
+	    // supertypeList, *without* the typeName itself as the first element.
+	    function getSupertypeNames(typeName) {
+	        if (!hasOwn.call(defCache, typeName)) {
+	            throw new Error("");
+	        }
+	        var d = defCache[typeName];
+	        if (d.finalized !== true) {
+	            throw new Error("");
+	        }
+	        return d.supertypeList.slice(1);
+	    }
+	    // Returns an object mapping from every known type in the defCache to the
+	    // most specific supertype whose name is an own property of the candidates
+	    // object.
+	    function computeSupertypeLookupTable(candidates) {
+	        var table = {};
+	        var typeNames = Object.keys(defCache);
+	        var typeNameCount = typeNames.length;
+	        for (var i = 0; i < typeNameCount; ++i) {
+	            var typeName = typeNames[i];
+	            var d = defCache[typeName];
+	            if (d.finalized !== true) {
+	                throw new Error("" + typeName);
+	            }
+	            for (var j = 0; j < d.supertypeList.length; ++j) {
+	                var superTypeName = d.supertypeList[j];
+	                if (hasOwn.call(candidates, superTypeName)) {
+	                    table[typeName] = superTypeName;
+	                    break;
+	                }
+	            }
+	        }
+	        return table;
+	    }
+	    var builders = Object.create(null);
+	    // This object is used as prototype for any node created by a builder.
+	    var nodePrototype = {};
+	    // Call this function to define a new method to be shared by all AST
+	    // nodes. The replaced method (if any) is returned for easy wrapping.
+	    function defineMethod(name, func) {
+	        var old = nodePrototype[name];
+	        // Pass undefined as func to delete nodePrototype[name].
+	        if (isUndefined.check(func)) {
+	            delete nodePrototype[name];
+	        }
+	        else {
+	            isFunction.assert(func);
+	            Object.defineProperty(nodePrototype, name, {
+	                enumerable: true,
+	                configurable: true,
+	                value: func
+	            });
+	        }
+	        return old;
+	    }
+	    function getBuilderName(typeName) {
+	        return typeName.replace(/^[A-Z]+/, function (upperCasePrefix) {
+	            var len = upperCasePrefix.length;
+	            switch (len) {
+	                case 0: return "";
+	                // If there's only one initial capital letter, just lower-case it.
+	                case 1: return upperCasePrefix.toLowerCase();
+	                default:
+	                    // If there's more than one initial capital letter, lower-case
+	                    // all but the last one, so that XMLDefaultDeclaration (for
+	                    // example) becomes xmlDefaultDeclaration.
+	                    return upperCasePrefix.slice(0, len - 1).toLowerCase() +
+	                        upperCasePrefix.charAt(len - 1);
+	            }
+	        });
+	    }
+	    function getStatementBuilderName(typeName) {
+	        typeName = getBuilderName(typeName);
+	        return typeName.replace(/(Expression)?$/, "Statement");
+	    }
+	    var namedTypes = {};
+	    // Like Object.keys, but aware of what fields each AST type should have.
+	    function getFieldNames(object) {
+	        var d = defFromValue(object);
+	        if (d) {
+	            return d.fieldNames.slice(0);
+	        }
+	        if ("type" in object) {
+	            throw new Error("did not recognize object of type " +
+	                JSON.stringify(object.type));
+	        }
+	        return Object.keys(object);
+	    }
+	    // Get the value of an object property, taking object.type and default
+	    // functions into account.
+	    function getFieldValue(object, fieldName) {
+	        var d = defFromValue(object);
+	        if (d) {
+	            var field = d.allFields[fieldName];
+	            if (field) {
+	                return field.getValue(object);
+	            }
+	        }
+	        return object && object[fieldName];
+	    }
+	    // Iterate over all defined fields of an object, including those missing
+	    // or undefined, passing each field name and effective value (as returned
+	    // by getFieldValue) to the callback. If the object has no corresponding
+	    // Def, the callback will never be called.
+	    function eachField(object, callback, context) {
+	        getFieldNames(object).forEach(function (name) {
+	            callback.call(this, name, getFieldValue(object, name));
+	        }, context);
+	    }
+	    // Similar to eachField, except that iteration stops as soon as the
+	    // callback returns a truthy value. Like Array.prototype.some, the final
+	    // result is either true or false to indicates whether the callback
+	    // returned true for any element or not.
+	    function someField(object, callback, context) {
+	        return getFieldNames(object).some(function (name) {
+	            return callback.call(this, name, getFieldValue(object, name));
+	        }, context);
+	    }
+	    // Adds an additional builder for Expression subtypes
+	    // that wraps the built Expression in an ExpressionStatements.
+	    function wrapExpressionBuilderWithStatement(typeName) {
+	        var wrapperName = getStatementBuilderName(typeName);
+	        // skip if the builder already exists
+	        if (builders[wrapperName])
+	            return;
+	        // the builder function to wrap with builders.ExpressionStatement
+	        var wrapped = builders[getBuilderName(typeName)];
+	        // skip if there is nothing to wrap
+	        if (!wrapped)
+	            return;
+	        var builder = function () {
+	            var args = [];
+	            for (var _i = 0; _i < arguments.length; _i++) {
+	                args[_i] = arguments[_i];
+	            }
+	            return builders.expressionStatement(wrapped.apply(builders, args));
+	        };
+	        builder.from = function () {
+	            var args = [];
+	            for (var _i = 0; _i < arguments.length; _i++) {
+	                args[_i] = arguments[_i];
+	            }
+	            return builders.expressionStatement(wrapped.from.apply(builders, args));
+	        };
+	        builders[wrapperName] = builder;
+	    }
+	    function populateSupertypeList(typeName, list) {
+	        list.length = 0;
+	        list.push(typeName);
+	        var lastSeen = Object.create(null);
+	        for (var pos = 0; pos < list.length; ++pos) {
+	            typeName = list[pos];
+	            var d = defCache[typeName];
+	            if (d.finalized !== true) {
+	                throw new Error("");
+	            }
+	            // If we saw typeName earlier in the breadth-first traversal,
+	            // delete the last-seen occurrence.
+	            if (hasOwn.call(lastSeen, typeName)) {
+	                delete list[lastSeen[typeName]];
+	            }
+	            // Record the new index of the last-seen occurrence of typeName.
+	            lastSeen[typeName] = pos;
+	            // Enqueue the base names of this type.
+	            list.push.apply(list, d.baseNames);
+	        }
+	        // Compaction loop to remove array holes.
+	        for (var to = 0, from = to, len = list.length; from < len; ++from) {
+	            if (hasOwn.call(list, from)) {
+	                list[to++] = list[from];
+	            }
+	        }
+	        list.length = to;
+	    }
+	    function extend(into, from) {
+	        Object.keys(from).forEach(function (name) {
+	            into[name] = from[name];
+	        });
+	        return into;
+	    }
+	    function finalize() {
+	        Object.keys(defCache).forEach(function (name) {
+	            defCache[name].finalize();
+	        });
+	    }
+	    return {
+	        Type: Type,
+	        builtInTypes: builtInTypes,
+	        getSupertypeNames: getSupertypeNames,
+	        computeSupertypeLookupTable: computeSupertypeLookupTable,
+	        builders: builders,
+	        defineMethod: defineMethod,
+	        getBuilderName: getBuilderName,
+	        getStatementBuilderName: getStatementBuilderName,
+	        namedTypes: namedTypes,
+	        getFieldNames: getFieldNames,
+	        getFieldValue: getFieldValue,
+	        eachField: eachField,
+	        someField: someField,
+	        finalize: finalize,
+	    };
+	}
+	exports.default = typesPlugin;
+	});
+
+	unwrapExports(types);
+	var types_1 = types.Def;
+
+	var path = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var Op = Object.prototype;
+	var hasOwn = Op.hasOwnProperty;
+	function pathPlugin(fork) {
+	    var types = fork.use(types_1.default);
+	    var isArray = types.builtInTypes.array;
+	    var isNumber = types.builtInTypes.number;
+	    var Path = function Path(value, parentPath, name) {
+	        if (!(this instanceof Path)) {
+	            throw new Error("Path constructor cannot be invoked without 'new'");
+	        }
+	        if (parentPath) {
+	            if (!(parentPath instanceof Path)) {
+	                throw new Error("");
+	            }
+	        }
+	        else {
+	            parentPath = null;
+	            name = null;
+	        }
+	        // The value encapsulated by this Path, generally equal to
+	        // parentPath.value[name] if we have a parentPath.
+	        this.value = value;
+	        // The immediate parent Path of this Path.
+	        this.parentPath = parentPath;
+	        // The name of the property of parentPath.value through which this
+	        // Path's value was reached.
+	        this.name = name;
+	        // Calling path.get("child") multiple times always returns the same
+	        // child Path object, for both performance and consistency reasons.
+	        this.__childCache = null;
+	    };
+	    var Pp = Path.prototype;
+	    function getChildCache(path) {
+	        // Lazily create the child cache. This also cheapens cache
+	        // invalidation, since you can just reset path.__childCache to null.
+	        return path.__childCache || (path.__childCache = Object.create(null));
+	    }
+	    function getChildPath(path, name) {
+	        var cache = getChildCache(path);
+	        var actualChildValue = path.getValueProperty(name);
+	        var childPath = cache[name];
+	        if (!hasOwn.call(cache, name) ||
+	            // Ensure consistency between cache and reality.
+	            childPath.value !== actualChildValue) {
+	            childPath = cache[name] = new path.constructor(actualChildValue, path, name);
+	        }
+	        return childPath;
+	    }
+	    // This method is designed to be overridden by subclasses that need to
+	    // handle missing properties, etc.
+	    Pp.getValueProperty = function getValueProperty(name) {
+	        return this.value[name];
+	    };
+	    Pp.get = function get() {
+	        var names = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            names[_i] = arguments[_i];
+	        }
+	        var path = this;
+	        var count = names.length;
+	        for (var i = 0; i < count; ++i) {
+	            path = getChildPath(path, names[i]);
+	        }
+	        return path;
+	    };
+	    Pp.each = function each(callback, context) {
+	        var childPaths = [];
+	        var len = this.value.length;
+	        var i = 0;
+	        // Collect all the original child paths before invoking the callback.
+	        for (var i = 0; i < len; ++i) {
+	            if (hasOwn.call(this.value, i)) {
+	                childPaths[i] = this.get(i);
+	            }
+	        }
+	        // Invoke the callback on just the original child paths, regardless of
+	        // any modifications made to the array by the callback. I chose these
+	        // semantics over cleverly invoking the callback on new elements because
+	        // this way is much easier to reason about.
+	        context = context || this;
+	        for (i = 0; i < len; ++i) {
+	            if (hasOwn.call(childPaths, i)) {
+	                callback.call(context, childPaths[i]);
+	            }
+	        }
+	    };
+	    Pp.map = function map(callback, context) {
+	        var result = [];
+	        this.each(function (childPath) {
+	            result.push(callback.call(this, childPath));
+	        }, context);
+	        return result;
+	    };
+	    Pp.filter = function filter(callback, context) {
+	        var result = [];
+	        this.each(function (childPath) {
+	            if (callback.call(this, childPath)) {
+	                result.push(childPath);
+	            }
+	        }, context);
+	        return result;
+	    };
+	    function emptyMoves() { }
+	    function getMoves(path, offset, start, end) {
+	        isArray.assert(path.value);
+	        if (offset === 0) {
+	            return emptyMoves;
+	        }
+	        var length = path.value.length;
+	        if (length < 1) {
+	            return emptyMoves;
+	        }
+	        var argc = arguments.length;
+	        if (argc === 2) {
+	            start = 0;
+	            end = length;
+	        }
+	        else if (argc === 3) {
+	            start = Math.max(start, 0);
+	            end = length;
+	        }
+	        else {
+	            start = Math.max(start, 0);
+	            end = Math.min(end, length);
+	        }
+	        isNumber.assert(start);
+	        isNumber.assert(end);
+	        var moves = Object.create(null);
+	        var cache = getChildCache(path);
+	        for (var i = start; i < end; ++i) {
+	            if (hasOwn.call(path.value, i)) {
+	                var childPath = path.get(i);
+	                if (childPath.name !== i) {
+	                    throw new Error("");
+	                }
+	                var newIndex = i + offset;
+	                childPath.name = newIndex;
+	                moves[newIndex] = childPath;
+	                delete cache[i];
+	            }
+	        }
+	        delete cache.length;
+	        return function () {
+	            for (var newIndex in moves) {
+	                var childPath = moves[newIndex];
+	                if (childPath.name !== +newIndex) {
+	                    throw new Error("");
+	                }
+	                cache[newIndex] = childPath;
+	                path.value[newIndex] = childPath.value;
+	            }
+	        };
+	    }
+	    Pp.shift = function shift() {
+	        var move = getMoves(this, -1);
+	        var result = this.value.shift();
+	        move();
+	        return result;
+	    };
+	    Pp.unshift = function unshift() {
+	        var args = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            args[_i] = arguments[_i];
+	        }
+	        var move = getMoves(this, args.length);
+	        var result = this.value.unshift.apply(this.value, args);
+	        move();
+	        return result;
+	    };
+	    Pp.push = function push() {
+	        var args = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            args[_i] = arguments[_i];
+	        }
+	        isArray.assert(this.value);
+	        delete getChildCache(this).length;
+	        return this.value.push.apply(this.value, args);
+	    };
+	    Pp.pop = function pop() {
+	        isArray.assert(this.value);
+	        var cache = getChildCache(this);
+	        delete cache[this.value.length - 1];
+	        delete cache.length;
+	        return this.value.pop();
+	    };
+	    Pp.insertAt = function insertAt(index) {
+	        var argc = arguments.length;
+	        var move = getMoves(this, argc - 1, index);
+	        if (move === emptyMoves && argc <= 1) {
+	            return this;
+	        }
+	        index = Math.max(index, 0);
+	        for (var i = 1; i < argc; ++i) {
+	            this.value[index + i - 1] = arguments[i];
+	        }
+	        move();
+	        return this;
+	    };
+	    Pp.insertBefore = function insertBefore() {
+	        var args = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            args[_i] = arguments[_i];
+	        }
+	        var pp = this.parentPath;
+	        var argc = args.length;
+	        var insertAtArgs = [this.name];
+	        for (var i = 0; i < argc; ++i) {
+	            insertAtArgs.push(args[i]);
+	        }
+	        return pp.insertAt.apply(pp, insertAtArgs);
+	    };
+	    Pp.insertAfter = function insertAfter() {
+	        var args = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            args[_i] = arguments[_i];
+	        }
+	        var pp = this.parentPath;
+	        var argc = args.length;
+	        var insertAtArgs = [this.name + 1];
+	        for (var i = 0; i < argc; ++i) {
+	            insertAtArgs.push(args[i]);
+	        }
+	        return pp.insertAt.apply(pp, insertAtArgs);
+	    };
+	    function repairRelationshipWithParent(path) {
+	        if (!(path instanceof Path)) {
+	            throw new Error("");
+	        }
+	        var pp = path.parentPath;
+	        if (!pp) {
+	            // Orphan paths have no relationship to repair.
+	            return path;
+	        }
+	        var parentValue = pp.value;
+	        var parentCache = getChildCache(pp);
+	        // Make sure parentCache[path.name] is populated.
+	        if (parentValue[path.name] === path.value) {
+	            parentCache[path.name] = path;
+	        }
+	        else if (isArray.check(parentValue)) {
+	            // Something caused path.name to become out of date, so attempt to
+	            // recover by searching for path.value in parentValue.
+	            var i = parentValue.indexOf(path.value);
+	            if (i >= 0) {
+	                parentCache[path.name = i] = path;
+	            }
+	        }
+	        else {
+	            // If path.value disagrees with parentValue[path.name], and
+	            // path.name is not an array index, let path.value become the new
+	            // parentValue[path.name] and update parentCache accordingly.
+	            parentValue[path.name] = path.value;
+	            parentCache[path.name] = path;
+	        }
+	        if (parentValue[path.name] !== path.value) {
+	            throw new Error("");
+	        }
+	        if (path.parentPath.get(path.name) !== path) {
+	            throw new Error("");
+	        }
+	        return path;
+	    }
+	    Pp.replace = function replace(replacement) {
+	        var results = [];
+	        var parentValue = this.parentPath.value;
+	        var parentCache = getChildCache(this.parentPath);
+	        var count = arguments.length;
+	        repairRelationshipWithParent(this);
+	        if (isArray.check(parentValue)) {
+	            var originalLength = parentValue.length;
+	            var move = getMoves(this.parentPath, count - 1, this.name + 1);
+	            var spliceArgs = [this.name, 1];
+	            for (var i = 0; i < count; ++i) {
+	                spliceArgs.push(arguments[i]);
+	            }
+	            var splicedOut = parentValue.splice.apply(parentValue, spliceArgs);
+	            if (splicedOut[0] !== this.value) {
+	                throw new Error("");
+	            }
+	            if (parentValue.length !== (originalLength - 1 + count)) {
+	                throw new Error("");
+	            }
+	            move();
+	            if (count === 0) {
+	                delete this.value;
+	                delete parentCache[this.name];
+	                this.__childCache = null;
+	            }
+	            else {
+	                if (parentValue[this.name] !== replacement) {
+	                    throw new Error("");
+	                }
+	                if (this.value !== replacement) {
+	                    this.value = replacement;
+	                    this.__childCache = null;
+	                }
+	                for (i = 0; i < count; ++i) {
+	                    results.push(this.parentPath.get(this.name + i));
+	                }
+	                if (results[0] !== this) {
+	                    throw new Error("");
+	                }
+	            }
+	        }
+	        else if (count === 1) {
+	            if (this.value !== replacement) {
+	                this.__childCache = null;
+	            }
+	            this.value = parentValue[this.name] = replacement;
+	            results.push(this);
+	        }
+	        else if (count === 0) {
+	            delete parentValue[this.name];
+	            delete this.value;
+	            this.__childCache = null;
+	            // Leave this path cached as parentCache[this.name], even though
+	            // it no longer has a value defined.
+	        }
+	        else {
+	            throw new Error("Could not replace path");
+	        }
+	        return results;
+	    };
+	    return Path;
+	}
+	exports.default = pathPlugin;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(path);
+
+	var scope = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var hasOwn = Object.prototype.hasOwnProperty;
+	function scopePlugin(fork) {
+	    var types = fork.use(types_1.default);
+	    var Type = types.Type;
+	    var namedTypes = types.namedTypes;
+	    var Node = namedTypes.Node;
+	    var Expression = namedTypes.Expression;
+	    var isArray = types.builtInTypes.array;
+	    var b = types.builders;
+	    var Scope = function Scope(path, parentScope) {
+	        if (!(this instanceof Scope)) {
+	            throw new Error("Scope constructor cannot be invoked without 'new'");
+	        }
+	        ScopeType.assert(path.value);
+	        var depth;
+	        if (parentScope) {
+	            if (!(parentScope instanceof Scope)) {
+	                throw new Error("");
+	            }
+	            depth = parentScope.depth + 1;
+	        }
+	        else {
+	            parentScope = null;
+	            depth = 0;
+	        }
+	        Object.defineProperties(this, {
+	            path: { value: path },
+	            node: { value: path.value },
+	            isGlobal: { value: !parentScope, enumerable: true },
+	            depth: { value: depth },
+	            parent: { value: parentScope },
+	            bindings: { value: {} },
+	            types: { value: {} },
+	        });
+	    };
+	    var scopeTypes = [
+	        // Program nodes introduce global scopes.
+	        namedTypes.Program,
+	        // Function is the supertype of FunctionExpression,
+	        // FunctionDeclaration, ArrowExpression, etc.
+	        namedTypes.Function,
+	        // In case you didn't know, the caught parameter shadows any variable
+	        // of the same name in an outer scope.
+	        namedTypes.CatchClause
+	    ];
+	    var ScopeType = Type.or.apply(Type, scopeTypes);
+	    Scope.isEstablishedBy = function (node) {
+	        return ScopeType.check(node);
+	    };
+	    var Sp = Scope.prototype;
+	    // Will be overridden after an instance lazily calls scanScope.
+	    Sp.didScan = false;
+	    Sp.declares = function (name) {
+	        this.scan();
+	        return hasOwn.call(this.bindings, name);
+	    };
+	    Sp.declaresType = function (name) {
+	        this.scan();
+	        return hasOwn.call(this.types, name);
+	    };
+	    Sp.declareTemporary = function (prefix) {
+	        if (prefix) {
+	            if (!/^[a-z$_]/i.test(prefix)) {
+	                throw new Error("");
+	            }
+	        }
+	        else {
+	            prefix = "t$";
+	        }
+	        // Include this.depth in the name to make sure the name does not
+	        // collide with any variables in nested/enclosing scopes.
+	        prefix += this.depth.toString(36) + "$";
+	        this.scan();
+	        var index = 0;
+	        while (this.declares(prefix + index)) {
+	            ++index;
+	        }
+	        var name = prefix + index;
+	        return this.bindings[name] = types.builders.identifier(name);
+	    };
+	    Sp.injectTemporary = function (identifier, init) {
+	        identifier || (identifier = this.declareTemporary());
+	        var bodyPath = this.path.get("body");
+	        if (namedTypes.BlockStatement.check(bodyPath.value)) {
+	            bodyPath = bodyPath.get("body");
+	        }
+	        bodyPath.unshift(b.variableDeclaration("var", [b.variableDeclarator(identifier, init || null)]));
+	        return identifier;
+	    };
+	    Sp.scan = function (force) {
+	        if (force || !this.didScan) {
+	            for (var name in this.bindings) {
+	                // Empty out this.bindings, just in cases.
+	                delete this.bindings[name];
+	            }
+	            scanScope(this.path, this.bindings, this.types);
+	            this.didScan = true;
+	        }
+	    };
+	    Sp.getBindings = function () {
+	        this.scan();
+	        return this.bindings;
+	    };
+	    Sp.getTypes = function () {
+	        this.scan();
+	        return this.types;
+	    };
+	    function scanScope(path, bindings, scopeTypes) {
+	        var node = path.value;
+	        ScopeType.assert(node);
+	        if (namedTypes.CatchClause.check(node)) {
+	            // A catch clause establishes a new scope but the only variable
+	            // bound in that scope is the catch parameter. Any other
+	            // declarations create bindings in the outer scope.
+	            addPattern(path.get("param"), bindings);
+	        }
+	        else {
+	            recursiveScanScope(path, bindings, scopeTypes);
+	        }
+	    }
+	    function recursiveScanScope(path, bindings, scopeTypes) {
+	        var node = path.value;
+	        if (path.parent &&
+	            namedTypes.FunctionExpression.check(path.parent.node) &&
+	            path.parent.node.id) {
+	            addPattern(path.parent.get("id"), bindings);
+	        }
+	        if (!node) ;
+	        else if (isArray.check(node)) {
+	            path.each(function (childPath) {
+	                recursiveScanChild(childPath, bindings, scopeTypes);
+	            });
+	        }
+	        else if (namedTypes.Function.check(node)) {
+	            path.get("params").each(function (paramPath) {
+	                addPattern(paramPath, bindings);
+	            });
+	            recursiveScanChild(path.get("body"), bindings, scopeTypes);
+	        }
+	        else if ((namedTypes.TypeAlias && namedTypes.TypeAlias.check(node)) ||
+	            (namedTypes.InterfaceDeclaration && namedTypes.InterfaceDeclaration.check(node)) ||
+	            (namedTypes.TSTypeAliasDeclaration && namedTypes.TSTypeAliasDeclaration.check(node)) ||
+	            (namedTypes.TSInterfaceDeclaration && namedTypes.TSInterfaceDeclaration.check(node))) {
+	            addTypePattern(path.get("id"), scopeTypes);
+	        }
+	        else if (namedTypes.VariableDeclarator.check(node)) {
+	            addPattern(path.get("id"), bindings);
+	            recursiveScanChild(path.get("init"), bindings, scopeTypes);
+	        }
+	        else if (node.type === "ImportSpecifier" ||
+	            node.type === "ImportNamespaceSpecifier" ||
+	            node.type === "ImportDefaultSpecifier") {
+	            addPattern(
+	            // Esprima used to use the .name field to refer to the local
+	            // binding identifier for ImportSpecifier nodes, but .id for
+	            // ImportNamespaceSpecifier and ImportDefaultSpecifier nodes.
+	            // ESTree/Acorn/ESpree use .local for all three node types.
+	            path.get(node.local ? "local" :
+	                node.name ? "name" : "id"), bindings);
+	        }
+	        else if (Node.check(node) && !Expression.check(node)) {
+	            types.eachField(node, function (name, child) {
+	                var childPath = path.get(name);
+	                if (!pathHasValue(childPath, child)) {
+	                    throw new Error("");
+	                }
+	                recursiveScanChild(childPath, bindings, scopeTypes);
+	            });
+	        }
+	    }
+	    function pathHasValue(path, value) {
+	        if (path.value === value) {
+	            return true;
+	        }
+	        // Empty arrays are probably produced by defaults.emptyArray, in which
+	        // case is makes sense to regard them as equivalent, if not ===.
+	        if (Array.isArray(path.value) &&
+	            path.value.length === 0 &&
+	            Array.isArray(value) &&
+	            value.length === 0) {
+	            return true;
+	        }
+	        return false;
+	    }
+	    function recursiveScanChild(path, bindings, scopeTypes) {
+	        var node = path.value;
+	        if (!node || Expression.check(node)) ;
+	        else if (namedTypes.FunctionDeclaration.check(node) &&
+	            node.id !== null) {
+	            addPattern(path.get("id"), bindings);
+	        }
+	        else if (namedTypes.ClassDeclaration &&
+	            namedTypes.ClassDeclaration.check(node)) {
+	            addPattern(path.get("id"), bindings);
+	        }
+	        else if (ScopeType.check(node)) {
+	            if (namedTypes.CatchClause.check(node) &&
+	                // TODO Broaden this to accept any pattern.
+	                namedTypes.Identifier.check(node.param)) {
+	                var catchParamName = node.param.name;
+	                var hadBinding = hasOwn.call(bindings, catchParamName);
+	                // Any declarations that occur inside the catch body that do
+	                // not have the same name as the catch parameter should count
+	                // as bindings in the outer scope.
+	                recursiveScanScope(path.get("body"), bindings, scopeTypes);
+	                // If a new binding matching the catch parameter name was
+	                // created while scanning the catch body, ignore it because it
+	                // actually refers to the catch parameter and not the outer
+	                // scope that we're currently scanning.
+	                if (!hadBinding) {
+	                    delete bindings[catchParamName];
+	                }
+	            }
+	        }
+	        else {
+	            recursiveScanScope(path, bindings, scopeTypes);
+	        }
+	    }
+	    function addPattern(patternPath, bindings) {
+	        var pattern = patternPath.value;
+	        namedTypes.Pattern.assert(pattern);
+	        if (namedTypes.Identifier.check(pattern)) {
+	            if (hasOwn.call(bindings, pattern.name)) {
+	                bindings[pattern.name].push(patternPath);
+	            }
+	            else {
+	                bindings[pattern.name] = [patternPath];
+	            }
+	        }
+	        else if (namedTypes.AssignmentPattern &&
+	            namedTypes.AssignmentPattern.check(pattern)) {
+	            addPattern(patternPath.get('left'), bindings);
+	        }
+	        else if (namedTypes.ObjectPattern &&
+	            namedTypes.ObjectPattern.check(pattern)) {
+	            patternPath.get('properties').each(function (propertyPath) {
+	                var property = propertyPath.value;
+	                if (namedTypes.Pattern.check(property)) {
+	                    addPattern(propertyPath, bindings);
+	                }
+	                else if (namedTypes.Property.check(property)) {
+	                    addPattern(propertyPath.get('value'), bindings);
+	                }
+	                else if (namedTypes.SpreadProperty &&
+	                    namedTypes.SpreadProperty.check(property)) {
+	                    addPattern(propertyPath.get('argument'), bindings);
+	                }
+	            });
+	        }
+	        else if (namedTypes.ArrayPattern &&
+	            namedTypes.ArrayPattern.check(pattern)) {
+	            patternPath.get('elements').each(function (elementPath) {
+	                var element = elementPath.value;
+	                if (namedTypes.Pattern.check(element)) {
+	                    addPattern(elementPath, bindings);
+	                }
+	                else if (namedTypes.SpreadElement &&
+	                    namedTypes.SpreadElement.check(element)) {
+	                    addPattern(elementPath.get("argument"), bindings);
+	                }
+	            });
+	        }
+	        else if (namedTypes.PropertyPattern &&
+	            namedTypes.PropertyPattern.check(pattern)) {
+	            addPattern(patternPath.get('pattern'), bindings);
+	        }
+	        else if ((namedTypes.SpreadElementPattern &&
+	            namedTypes.SpreadElementPattern.check(pattern)) ||
+	            (namedTypes.SpreadPropertyPattern &&
+	                namedTypes.SpreadPropertyPattern.check(pattern))) {
+	            addPattern(patternPath.get('argument'), bindings);
+	        }
+	    }
+	    function addTypePattern(patternPath, types) {
+	        var pattern = patternPath.value;
+	        namedTypes.Pattern.assert(pattern);
+	        if (namedTypes.Identifier.check(pattern)) {
+	            if (hasOwn.call(types, pattern.name)) {
+	                types[pattern.name].push(patternPath);
+	            }
+	            else {
+	                types[pattern.name] = [patternPath];
+	            }
+	        }
+	    }
+	    Sp.lookup = function (name) {
+	        for (var scope = this; scope; scope = scope.parent)
+	            if (scope.declares(name))
+	                break;
+	        return scope;
+	    };
+	    Sp.lookupType = function (name) {
+	        for (var scope = this; scope; scope = scope.parent)
+	            if (scope.declaresType(name))
+	                break;
+	        return scope;
+	    };
+	    Sp.getGlobalScope = function () {
+	        var scope = this;
+	        while (!scope.isGlobal)
+	            scope = scope.parent;
+	        return scope;
+	    };
+	    return Scope;
+	}
+	exports.default = scopePlugin;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(scope);
+
+	var nodePath = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var path_1 = __importDefault(path);
+	var scope_1 = __importDefault(scope);
+	function nodePathPlugin(fork) {
+	    var types = fork.use(types_1.default);
+	    var n = types.namedTypes;
+	    var b = types.builders;
+	    var isNumber = types.builtInTypes.number;
+	    var isArray = types.builtInTypes.array;
+	    var Path = fork.use(path_1.default);
+	    var Scope = fork.use(scope_1.default);
+	    var NodePath = function NodePath(value, parentPath, name) {
+	        if (!(this instanceof NodePath)) {
+	            throw new Error("NodePath constructor cannot be invoked without 'new'");
+	        }
+	        Path.call(this, value, parentPath, name);
+	    };
+	    var NPp = NodePath.prototype = Object.create(Path.prototype, {
+	        constructor: {
+	            value: NodePath,
+	            enumerable: false,
+	            writable: true,
+	            configurable: true
+	        }
+	    });
+	    Object.defineProperties(NPp, {
+	        node: {
+	            get: function () {
+	                Object.defineProperty(this, "node", {
+	                    configurable: true,
+	                    value: this._computeNode()
+	                });
+	                return this.node;
+	            }
+	        },
+	        parent: {
+	            get: function () {
+	                Object.defineProperty(this, "parent", {
+	                    configurable: true,
+	                    value: this._computeParent()
+	                });
+	                return this.parent;
+	            }
+	        },
+	        scope: {
+	            get: function () {
+	                Object.defineProperty(this, "scope", {
+	                    configurable: true,
+	                    value: this._computeScope()
+	                });
+	                return this.scope;
+	            }
+	        }
+	    });
+	    NPp.replace = function () {
+	        delete this.node;
+	        delete this.parent;
+	        delete this.scope;
+	        return Path.prototype.replace.apply(this, arguments);
+	    };
+	    NPp.prune = function () {
+	        var remainingNodePath = this.parent;
+	        this.replace();
+	        return cleanUpNodesAfterPrune(remainingNodePath);
+	    };
+	    // The value of the first ancestor Path whose value is a Node.
+	    NPp._computeNode = function () {
+	        var value = this.value;
+	        if (n.Node.check(value)) {
+	            return value;
+	        }
+	        var pp = this.parentPath;
+	        return pp && pp.node || null;
+	    };
+	    // The first ancestor Path whose value is a Node distinct from this.node.
+	    NPp._computeParent = function () {
+	        var value = this.value;
+	        var pp = this.parentPath;
+	        if (!n.Node.check(value)) {
+	            while (pp && !n.Node.check(pp.value)) {
+	                pp = pp.parentPath;
+	            }
+	            if (pp) {
+	                pp = pp.parentPath;
+	            }
+	        }
+	        while (pp && !n.Node.check(pp.value)) {
+	            pp = pp.parentPath;
+	        }
+	        return pp || null;
+	    };
+	    // The closest enclosing scope that governs this node.
+	    NPp._computeScope = function () {
+	        var value = this.value;
+	        var pp = this.parentPath;
+	        var scope = pp && pp.scope;
+	        if (n.Node.check(value) &&
+	            Scope.isEstablishedBy(value)) {
+	            scope = new Scope(this, scope);
+	        }
+	        return scope || null;
+	    };
+	    NPp.getValueProperty = function (name) {
+	        return types.getFieldValue(this.value, name);
+	    };
+	    /**
+	     * Determine whether this.node needs to be wrapped in parentheses in order
+	     * for a parser to reproduce the same local AST structure.
+	     *
+	     * For instance, in the expression `(1 + 2) * 3`, the BinaryExpression
+	     * whose operator is "+" needs parentheses, because `1 + 2 * 3` would
+	     * parse differently.
+	     *
+	     * If assumeExpressionContext === true, we don't worry about edge cases
+	     * like an anonymous FunctionExpression appearing lexically first in its
+	     * enclosing statement and thus needing parentheses to avoid being parsed
+	     * as a FunctionDeclaration with a missing name.
+	     */
+	    NPp.needsParens = function (assumeExpressionContext) {
+	        var pp = this.parentPath;
+	        if (!pp) {
+	            return false;
+	        }
+	        var node = this.value;
+	        // Only expressions need parentheses.
+	        if (!n.Expression.check(node)) {
+	            return false;
+	        }
+	        // Identifiers never need parentheses.
+	        if (node.type === "Identifier") {
+	            return false;
+	        }
+	        while (!n.Node.check(pp.value)) {
+	            pp = pp.parentPath;
+	            if (!pp) {
+	                return false;
+	            }
+	        }
+	        var parent = pp.value;
+	        switch (node.type) {
+	            case "UnaryExpression":
+	            case "SpreadElement":
+	            case "SpreadProperty":
+	                return parent.type === "MemberExpression"
+	                    && this.name === "object"
+	                    && parent.object === node;
+	            case "BinaryExpression":
+	            case "LogicalExpression":
+	                switch (parent.type) {
+	                    case "CallExpression":
+	                        return this.name === "callee"
+	                            && parent.callee === node;
+	                    case "UnaryExpression":
+	                    case "SpreadElement":
+	                    case "SpreadProperty":
+	                        return true;
+	                    case "MemberExpression":
+	                        return this.name === "object"
+	                            && parent.object === node;
+	                    case "BinaryExpression":
+	                    case "LogicalExpression": {
+	                        var n_1 = node;
+	                        var po = parent.operator;
+	                        var pp_1 = PRECEDENCE[po];
+	                        var no = n_1.operator;
+	                        var np = PRECEDENCE[no];
+	                        if (pp_1 > np) {
+	                            return true;
+	                        }
+	                        if (pp_1 === np && this.name === "right") {
+	                            if (parent.right !== n_1) {
+	                                throw new Error("Nodes must be equal");
+	                            }
+	                            return true;
+	                        }
+	                    }
+	                    default:
+	                        return false;
+	                }
+	            case "SequenceExpression":
+	                switch (parent.type) {
+	                    case "ForStatement":
+	                        // Although parentheses wouldn't hurt around sequence
+	                        // expressions in the head of for loops, traditional style
+	                        // dictates that e.g. i++, j++ should not be wrapped with
+	                        // parentheses.
+	                        return false;
+	                    case "ExpressionStatement":
+	                        return this.name !== "expression";
+	                    default:
+	                        // Otherwise err on the side of overparenthesization, adding
+	                        // explicit exceptions above if this proves overzealous.
+	                        return true;
+	                }
+	            case "YieldExpression":
+	                switch (parent.type) {
+	                    case "BinaryExpression":
+	                    case "LogicalExpression":
+	                    case "UnaryExpression":
+	                    case "SpreadElement":
+	                    case "SpreadProperty":
+	                    case "CallExpression":
+	                    case "MemberExpression":
+	                    case "NewExpression":
+	                    case "ConditionalExpression":
+	                    case "YieldExpression":
+	                        return true;
+	                    default:
+	                        return false;
+	                }
+	            case "Literal":
+	                return parent.type === "MemberExpression"
+	                    && isNumber.check(node.value)
+	                    && this.name === "object"
+	                    && parent.object === node;
+	            case "AssignmentExpression":
+	            case "ConditionalExpression":
+	                switch (parent.type) {
+	                    case "UnaryExpression":
+	                    case "SpreadElement":
+	                    case "SpreadProperty":
+	                    case "BinaryExpression":
+	                    case "LogicalExpression":
+	                        return true;
+	                    case "CallExpression":
+	                        return this.name === "callee"
+	                            && parent.callee === node;
+	                    case "ConditionalExpression":
+	                        return this.name === "test"
+	                            && parent.test === node;
+	                    case "MemberExpression":
+	                        return this.name === "object"
+	                            && parent.object === node;
+	                    default:
+	                        return false;
+	                }
+	            default:
+	                if (parent.type === "NewExpression" &&
+	                    this.name === "callee" &&
+	                    parent.callee === node) {
+	                    return containsCallExpression(node);
+	                }
+	        }
+	        if (assumeExpressionContext !== true &&
+	            !this.canBeFirstInStatement() &&
+	            this.firstInStatement())
+	            return true;
+	        return false;
+	    };
+	    function isBinary(node) {
+	        return n.BinaryExpression.check(node)
+	            || n.LogicalExpression.check(node);
+	    }
+	    var PRECEDENCE = {};
+	    [["||"],
+	        ["&&"],
+	        ["|"],
+	        ["^"],
+	        ["&"],
+	        ["==", "===", "!=", "!=="],
+	        ["<", ">", "<=", ">=", "in", "instanceof"],
+	        [">>", "<<", ">>>"],
+	        ["+", "-"],
+	        ["*", "/", "%"]
+	    ].forEach(function (tier, i) {
+	        tier.forEach(function (op) {
+	            PRECEDENCE[op] = i;
+	        });
+	    });
+	    function containsCallExpression(node) {
+	        if (n.CallExpression.check(node)) {
+	            return true;
+	        }
+	        if (isArray.check(node)) {
+	            return node.some(containsCallExpression);
+	        }
+	        if (n.Node.check(node)) {
+	            return types.someField(node, function (_name, child) {
+	                return containsCallExpression(child);
+	            });
+	        }
+	        return false;
+	    }
+	    NPp.canBeFirstInStatement = function () {
+	        var node = this.node;
+	        return !n.FunctionExpression.check(node)
+	            && !n.ObjectExpression.check(node);
+	    };
+	    NPp.firstInStatement = function () {
+	        return firstInStatement(this);
+	    };
+	    function firstInStatement(path) {
+	        for (var node, parent; path.parent; path = path.parent) {
+	            node = path.node;
+	            parent = path.parent.node;
+	            if (n.BlockStatement.check(parent) &&
+	                path.parent.name === "body" &&
+	                path.name === 0) {
+	                if (parent.body[0] !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                return true;
+	            }
+	            if (n.ExpressionStatement.check(parent) &&
+	                path.name === "expression") {
+	                if (parent.expression !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                return true;
+	            }
+	            if (n.SequenceExpression.check(parent) &&
+	                path.parent.name === "expressions" &&
+	                path.name === 0) {
+	                if (parent.expressions[0] !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            if (n.CallExpression.check(parent) &&
+	                path.name === "callee") {
+	                if (parent.callee !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            if (n.MemberExpression.check(parent) &&
+	                path.name === "object") {
+	                if (parent.object !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            if (n.ConditionalExpression.check(parent) &&
+	                path.name === "test") {
+	                if (parent.test !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            if (isBinary(parent) &&
+	                path.name === "left") {
+	                if (parent.left !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            if (n.UnaryExpression.check(parent) &&
+	                !parent.prefix &&
+	                path.name === "argument") {
+	                if (parent.argument !== node) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	                continue;
+	            }
+	            return false;
+	        }
+	        return true;
+	    }
+	    /**
+	     * Pruning certain nodes will result in empty or incomplete nodes, here we clean those nodes up.
+	     */
+	    function cleanUpNodesAfterPrune(remainingNodePath) {
+	        if (n.VariableDeclaration.check(remainingNodePath.node)) {
+	            var declarations = remainingNodePath.get('declarations').value;
+	            if (!declarations || declarations.length === 0) {
+	                return remainingNodePath.prune();
+	            }
+	        }
+	        else if (n.ExpressionStatement.check(remainingNodePath.node)) {
+	            if (!remainingNodePath.get('expression').value) {
+	                return remainingNodePath.prune();
+	            }
+	        }
+	        else if (n.IfStatement.check(remainingNodePath.node)) {
+	            cleanUpIfStatementAfterPrune(remainingNodePath);
+	        }
+	        return remainingNodePath;
+	    }
+	    function cleanUpIfStatementAfterPrune(ifStatement) {
+	        var testExpression = ifStatement.get('test').value;
+	        var alternate = ifStatement.get('alternate').value;
+	        var consequent = ifStatement.get('consequent').value;
+	        if (!consequent && !alternate) {
+	            var testExpressionStatement = b.expressionStatement(testExpression);
+	            ifStatement.replace(testExpressionStatement);
+	        }
+	        else if (!consequent && alternate) {
+	            var negatedTestExpression = b.unaryExpression('!', testExpression, true);
+	            if (n.UnaryExpression.check(testExpression) && testExpression.operator === '!') {
+	                negatedTestExpression = testExpression.argument;
+	            }
+	            ifStatement.get("test").replace(negatedTestExpression);
+	            ifStatement.get("consequent").replace(alternate);
+	            ifStatement.get("alternate").replace();
+	        }
+	    }
+	    return NodePath;
+	}
+	exports.default = nodePathPlugin;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(nodePath);
+
+	var pathVisitor = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var node_path_1 = __importDefault(nodePath);
+	var hasOwn = Object.prototype.hasOwnProperty;
+	function pathVisitorPlugin(fork) {
+	    var types = fork.use(types_1.default);
+	    var NodePath = fork.use(node_path_1.default);
+	    var isArray = types.builtInTypes.array;
+	    var isObject = types.builtInTypes.object;
+	    var isFunction = types.builtInTypes.function;
+	    var undefined$1;
+	    var PathVisitor = function PathVisitor() {
+	        if (!(this instanceof PathVisitor)) {
+	            throw new Error("PathVisitor constructor cannot be invoked without 'new'");
+	        }
+	        // Permanent state.
+	        this._reusableContextStack = [];
+	        this._methodNameTable = computeMethodNameTable(this);
+	        this._shouldVisitComments =
+	            hasOwn.call(this._methodNameTable, "Block") ||
+	                hasOwn.call(this._methodNameTable, "Line");
+	        this.Context = makeContextConstructor(this);
+	        // State reset every time PathVisitor.prototype.visit is called.
+	        this._visiting = false;
+	        this._changeReported = false;
+	    };
+	    function computeMethodNameTable(visitor) {
+	        var typeNames = Object.create(null);
+	        for (var methodName in visitor) {
+	            if (/^visit[A-Z]/.test(methodName)) {
+	                typeNames[methodName.slice("visit".length)] = true;
+	            }
+	        }
+	        var supertypeTable = types.computeSupertypeLookupTable(typeNames);
+	        var methodNameTable = Object.create(null);
+	        var typeNameKeys = Object.keys(supertypeTable);
+	        var typeNameCount = typeNameKeys.length;
+	        for (var i = 0; i < typeNameCount; ++i) {
+	            var typeName = typeNameKeys[i];
+	            methodName = "visit" + supertypeTable[typeName];
+	            if (isFunction.check(visitor[methodName])) {
+	                methodNameTable[typeName] = methodName;
+	            }
+	        }
+	        return methodNameTable;
+	    }
+	    PathVisitor.fromMethodsObject = function fromMethodsObject(methods) {
+	        if (methods instanceof PathVisitor) {
+	            return methods;
+	        }
+	        if (!isObject.check(methods)) {
+	            // An empty visitor?
+	            return new PathVisitor;
+	        }
+	        var Visitor = function Visitor() {
+	            if (!(this instanceof Visitor)) {
+	                throw new Error("Visitor constructor cannot be invoked without 'new'");
+	            }
+	            PathVisitor.call(this);
+	        };
+	        var Vp = Visitor.prototype = Object.create(PVp);
+	        Vp.constructor = Visitor;
+	        extend(Vp, methods);
+	        extend(Visitor, PathVisitor);
+	        isFunction.assert(Visitor.fromMethodsObject);
+	        isFunction.assert(Visitor.visit);
+	        return new Visitor;
+	    };
+	    function extend(target, source) {
+	        for (var property in source) {
+	            if (hasOwn.call(source, property)) {
+	                target[property] = source[property];
+	            }
+	        }
+	        return target;
+	    }
+	    PathVisitor.visit = function visit(node, methods) {
+	        return PathVisitor.fromMethodsObject(methods).visit(node);
+	    };
+	    var PVp = PathVisitor.prototype;
+	    PVp.visit = function () {
+	        if (this._visiting) {
+	            throw new Error("Recursively calling visitor.visit(path) resets visitor state. " +
+	                "Try this.visit(path) or this.traverse(path) instead.");
+	        }
+	        // Private state that needs to be reset before every traversal.
+	        this._visiting = true;
+	        this._changeReported = false;
+	        this._abortRequested = false;
+	        var argc = arguments.length;
+	        var args = new Array(argc);
+	        for (var i = 0; i < argc; ++i) {
+	            args[i] = arguments[i];
+	        }
+	        if (!(args[0] instanceof NodePath)) {
+	            args[0] = new NodePath({ root: args[0] }).get("root");
+	        }
+	        // Called with the same arguments as .visit.
+	        this.reset.apply(this, args);
+	        var didNotThrow;
+	        try {
+	            var root = this.visitWithoutReset(args[0]);
+	            didNotThrow = true;
+	        }
+	        finally {
+	            this._visiting = false;
+	            if (!didNotThrow && this._abortRequested) {
+	                // If this.visitWithoutReset threw an exception and
+	                // this._abortRequested was set to true, return the root of
+	                // the AST instead of letting the exception propagate, so that
+	                // client code does not have to provide a try-catch block to
+	                // intercept the AbortRequest exception.  Other kinds of
+	                // exceptions will propagate without being intercepted and
+	                // rethrown by a catch block, so their stacks will accurately
+	                // reflect the original throwing context.
+	                return args[0].value;
+	            }
+	        }
+	        return root;
+	    };
+	    PVp.AbortRequest = function AbortRequest() { };
+	    PVp.abort = function () {
+	        var visitor = this;
+	        visitor._abortRequested = true;
+	        var request = new visitor.AbortRequest();
+	        // If you decide to catch this exception and stop it from propagating,
+	        // make sure to call its cancel method to avoid silencing other
+	        // exceptions that might be thrown later in the traversal.
+	        request.cancel = function () {
+	            visitor._abortRequested = false;
+	        };
+	        throw request;
+	    };
+	    PVp.reset = function (_path /*, additional arguments */) {
+	        // Empty stub; may be reassigned or overridden by subclasses.
+	    };
+	    PVp.visitWithoutReset = function (path) {
+	        if (this instanceof this.Context) {
+	            // Since this.Context.prototype === this, there's a chance we
+	            // might accidentally call context.visitWithoutReset. If that
+	            // happens, re-invoke the method against context.visitor.
+	            return this.visitor.visitWithoutReset(path);
+	        }
+	        if (!(path instanceof NodePath)) {
+	            throw new Error("");
+	        }
+	        var value = path.value;
+	        var methodName = value &&
+	            typeof value === "object" &&
+	            typeof value.type === "string" &&
+	            this._methodNameTable[value.type];
+	        if (methodName) {
+	            var context = this.acquireContext(path);
+	            try {
+	                return context.invokeVisitorMethod(methodName);
+	            }
+	            finally {
+	                this.releaseContext(context);
+	            }
+	        }
+	        else {
+	            // If there was no visitor method to call, visit the children of
+	            // this node generically.
+	            return visitChildren(path, this);
+	        }
+	    };
+	    function visitChildren(path, visitor) {
+	        if (!(path instanceof NodePath)) {
+	            throw new Error("");
+	        }
+	        if (!(visitor instanceof PathVisitor)) {
+	            throw new Error("");
+	        }
+	        var value = path.value;
+	        if (isArray.check(value)) {
+	            path.each(visitor.visitWithoutReset, visitor);
+	        }
+	        else if (!isObject.check(value)) ;
+	        else {
+	            var childNames = types.getFieldNames(value);
+	            // The .comments field of the Node type is hidden, so we only
+	            // visit it if the visitor defines visitBlock or visitLine, and
+	            // value.comments is defined.
+	            if (visitor._shouldVisitComments &&
+	                value.comments &&
+	                childNames.indexOf("comments") < 0) {
+	                childNames.push("comments");
+	            }
+	            var childCount = childNames.length;
+	            var childPaths = [];
+	            for (var i = 0; i < childCount; ++i) {
+	                var childName = childNames[i];
+	                if (!hasOwn.call(value, childName)) {
+	                    value[childName] = types.getFieldValue(value, childName);
+	                }
+	                childPaths.push(path.get(childName));
+	            }
+	            for (var i = 0; i < childCount; ++i) {
+	                visitor.visitWithoutReset(childPaths[i]);
+	            }
+	        }
+	        return path.value;
+	    }
+	    PVp.acquireContext = function (path) {
+	        if (this._reusableContextStack.length === 0) {
+	            return new this.Context(path);
+	        }
+	        return this._reusableContextStack.pop().reset(path);
+	    };
+	    PVp.releaseContext = function (context) {
+	        if (!(context instanceof this.Context)) {
+	            throw new Error("");
+	        }
+	        this._reusableContextStack.push(context);
+	        context.currentPath = null;
+	    };
+	    PVp.reportChanged = function () {
+	        this._changeReported = true;
+	    };
+	    PVp.wasChangeReported = function () {
+	        return this._changeReported;
+	    };
+	    function makeContextConstructor(visitor) {
+	        function Context(path) {
+	            if (!(this instanceof Context)) {
+	                throw new Error("");
+	            }
+	            if (!(this instanceof PathVisitor)) {
+	                throw new Error("");
+	            }
+	            if (!(path instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            Object.defineProperty(this, "visitor", {
+	                value: visitor,
+	                writable: false,
+	                enumerable: true,
+	                configurable: false
+	            });
+	            this.currentPath = path;
+	            this.needToCallTraverse = true;
+	            Object.seal(this);
+	        }
+	        if (!(visitor instanceof PathVisitor)) {
+	            throw new Error("");
+	        }
+	        // Note that the visitor object is the prototype of Context.prototype,
+	        // so all visitor methods are inherited by context objects.
+	        var Cp = Context.prototype = Object.create(visitor);
+	        Cp.constructor = Context;
+	        extend(Cp, sharedContextProtoMethods);
+	        return Context;
+	    }
+	    // Every PathVisitor has a different this.Context constructor and
+	    // this.Context.prototype object, but those prototypes can all use the
+	    // same reset, invokeVisitorMethod, and traverse function objects.
+	    var sharedContextProtoMethods = Object.create(null);
+	    sharedContextProtoMethods.reset =
+	        function reset(path) {
+	            if (!(this instanceof this.Context)) {
+	                throw new Error("");
+	            }
+	            if (!(path instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            this.currentPath = path;
+	            this.needToCallTraverse = true;
+	            return this;
+	        };
+	    sharedContextProtoMethods.invokeVisitorMethod =
+	        function invokeVisitorMethod(methodName) {
+	            if (!(this instanceof this.Context)) {
+	                throw new Error("");
+	            }
+	            if (!(this.currentPath instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            var result = this.visitor[methodName].call(this, this.currentPath);
+	            if (result === false) {
+	                // Visitor methods return false to indicate that they have handled
+	                // their own traversal needs, and we should not complain if
+	                // this.needToCallTraverse is still true.
+	                this.needToCallTraverse = false;
+	            }
+	            else if (result !== undefined$1) {
+	                // Any other non-undefined value returned from the visitor method
+	                // is interpreted as a replacement value.
+	                this.currentPath = this.currentPath.replace(result)[0];
+	                if (this.needToCallTraverse) {
+	                    // If this.traverse still hasn't been called, visit the
+	                    // children of the replacement node.
+	                    this.traverse(this.currentPath);
+	                }
+	            }
+	            if (this.needToCallTraverse !== false) {
+	                throw new Error("Must either call this.traverse or return false in " + methodName);
+	            }
+	            var path = this.currentPath;
+	            return path && path.value;
+	        };
+	    sharedContextProtoMethods.traverse =
+	        function traverse(path, newVisitor) {
+	            if (!(this instanceof this.Context)) {
+	                throw new Error("");
+	            }
+	            if (!(path instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            if (!(this.currentPath instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            this.needToCallTraverse = false;
+	            return visitChildren(path, PathVisitor.fromMethodsObject(newVisitor || this.visitor));
+	        };
+	    sharedContextProtoMethods.visit =
+	        function visit(path, newVisitor) {
+	            if (!(this instanceof this.Context)) {
+	                throw new Error("");
+	            }
+	            if (!(path instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            if (!(this.currentPath instanceof NodePath)) {
+	                throw new Error("");
+	            }
+	            this.needToCallTraverse = false;
+	            return PathVisitor.fromMethodsObject(newVisitor || this.visitor).visitWithoutReset(path);
+	        };
+	    sharedContextProtoMethods.reportChanged = function reportChanged() {
+	        this.visitor.reportChanged();
+	    };
+	    sharedContextProtoMethods.abort = function abort() {
+	        this.needToCallTraverse = false;
+	        this.visitor.abort();
+	    };
+	    return PathVisitor;
+	}
+	exports.default = pathVisitorPlugin;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(pathVisitor);
+
+	var equiv = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	function default_1(fork) {
+	    var types = fork.use(types_1.default);
+	    var getFieldNames = types.getFieldNames;
+	    var getFieldValue = types.getFieldValue;
+	    var isArray = types.builtInTypes.array;
+	    var isObject = types.builtInTypes.object;
+	    var isDate = types.builtInTypes.Date;
+	    var isRegExp = types.builtInTypes.RegExp;
+	    var hasOwn = Object.prototype.hasOwnProperty;
+	    function astNodesAreEquivalent(a, b, problemPath) {
+	        if (isArray.check(problemPath)) {
+	            problemPath.length = 0;
+	        }
+	        else {
+	            problemPath = null;
+	        }
+	        return areEquivalent(a, b, problemPath);
+	    }
+	    astNodesAreEquivalent.assert = function (a, b) {
+	        var problemPath = [];
+	        if (!astNodesAreEquivalent(a, b, problemPath)) {
+	            if (problemPath.length === 0) {
+	                if (a !== b) {
+	                    throw new Error("Nodes must be equal");
+	                }
+	            }
+	            else {
+	                throw new Error("Nodes differ in the following path: " +
+	                    problemPath.map(subscriptForProperty).join(""));
+	            }
+	        }
+	    };
+	    function subscriptForProperty(property) {
+	        if (/[_$a-z][_$a-z0-9]*/i.test(property)) {
+	            return "." + property;
+	        }
+	        return "[" + JSON.stringify(property) + "]";
+	    }
+	    function areEquivalent(a, b, problemPath) {
+	        if (a === b) {
+	            return true;
+	        }
+	        if (isArray.check(a)) {
+	            return arraysAreEquivalent(a, b, problemPath);
+	        }
+	        if (isObject.check(a)) {
+	            return objectsAreEquivalent(a, b, problemPath);
+	        }
+	        if (isDate.check(a)) {
+	            return isDate.check(b) && (+a === +b);
+	        }
+	        if (isRegExp.check(a)) {
+	            return isRegExp.check(b) && (a.source === b.source &&
+	                a.global === b.global &&
+	                a.multiline === b.multiline &&
+	                a.ignoreCase === b.ignoreCase);
+	        }
+	        return a == b;
+	    }
+	    function arraysAreEquivalent(a, b, problemPath) {
+	        isArray.assert(a);
+	        var aLength = a.length;
+	        if (!isArray.check(b) || b.length !== aLength) {
+	            if (problemPath) {
+	                problemPath.push("length");
+	            }
+	            return false;
+	        }
+	        for (var i = 0; i < aLength; ++i) {
+	            if (problemPath) {
+	                problemPath.push(i);
+	            }
+	            if (i in a !== i in b) {
+	                return false;
+	            }
+	            if (!areEquivalent(a[i], b[i], problemPath)) {
+	                return false;
+	            }
+	            if (problemPath) {
+	                var problemPathTail = problemPath.pop();
+	                if (problemPathTail !== i) {
+	                    throw new Error("" + problemPathTail);
+	                }
+	            }
+	        }
+	        return true;
+	    }
+	    function objectsAreEquivalent(a, b, problemPath) {
+	        isObject.assert(a);
+	        if (!isObject.check(b)) {
+	            return false;
+	        }
+	        // Fast path for a common property of AST nodes.
+	        if (a.type !== b.type) {
+	            if (problemPath) {
+	                problemPath.push("type");
+	            }
+	            return false;
+	        }
+	        var aNames = getFieldNames(a);
+	        var aNameCount = aNames.length;
+	        var bNames = getFieldNames(b);
+	        var bNameCount = bNames.length;
+	        if (aNameCount === bNameCount) {
+	            for (var i = 0; i < aNameCount; ++i) {
+	                var name = aNames[i];
+	                var aChild = getFieldValue(a, name);
+	                var bChild = getFieldValue(b, name);
+	                if (problemPath) {
+	                    problemPath.push(name);
+	                }
+	                if (!areEquivalent(aChild, bChild, problemPath)) {
+	                    return false;
+	                }
+	                if (problemPath) {
+	                    var problemPathTail = problemPath.pop();
+	                    if (problemPathTail !== name) {
+	                        throw new Error("" + problemPathTail);
+	                    }
+	                }
+	            }
+	            return true;
+	        }
+	        if (!problemPath) {
+	            return false;
+	        }
+	        // Since aNameCount !== bNameCount, we need to find some name that's
+	        // missing in aNames but present in bNames, or vice-versa.
+	        var seenNames = Object.create(null);
+	        for (i = 0; i < aNameCount; ++i) {
+	            seenNames[aNames[i]] = true;
+	        }
+	        for (i = 0; i < bNameCount; ++i) {
+	            name = bNames[i];
+	            if (!hasOwn.call(seenNames, name)) {
+	                problemPath.push(name);
+	                return false;
+	            }
+	            delete seenNames[name];
+	        }
+	        for (name in seenNames) {
+	            problemPath.push(name);
+	            break;
+	        }
+	        return false;
+	    }
+	    return astNodesAreEquivalent;
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(equiv);
+
+	var fork = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var path_visitor_1 = __importDefault(pathVisitor);
+	var equiv_1 = __importDefault(equiv);
+	var path_1 = __importDefault(path);
+	var node_path_1 = __importDefault(nodePath);
+	function default_1(defs) {
+	    var fork = createFork();
+	    var types = fork.use(types_1.default);
+	    defs.forEach(fork.use);
+	    types.finalize();
+	    var PathVisitor = fork.use(path_visitor_1.default);
+	    return {
+	        Type: types.Type,
+	        builtInTypes: types.builtInTypes,
+	        namedTypes: types.namedTypes,
+	        builders: types.builders,
+	        defineMethod: types.defineMethod,
+	        getFieldNames: types.getFieldNames,
+	        getFieldValue: types.getFieldValue,
+	        eachField: types.eachField,
+	        someField: types.someField,
+	        getSupertypeNames: types.getSupertypeNames,
+	        getBuilderName: types.getBuilderName,
+	        astNodesAreEquivalent: fork.use(equiv_1.default),
+	        finalize: types.finalize,
+	        Path: fork.use(path_1.default),
+	        NodePath: fork.use(node_path_1.default),
+	        PathVisitor: PathVisitor,
+	        use: fork.use,
+	        visit: PathVisitor.visit,
+	    };
+	}
+	exports.default = default_1;
+	function createFork() {
+	    var used = [];
+	    var usedResult = [];
+	    function use(plugin) {
+	        var idx = used.indexOf(plugin);
+	        if (idx === -1) {
+	            idx = used.length;
+	            used.push(plugin);
+	            usedResult[idx] = plugin(fork);
+	        }
+	        return usedResult[idx];
+	    }
+	    var fork = { use: use };
+	    return fork;
+	}
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(fork);
+
+	var shared = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	function default_1(fork) {
+	    var types = fork.use(types_1.default);
+	    var Type = types.Type;
+	    var builtin = types.builtInTypes;
+	    var isNumber = builtin.number;
+	    // An example of constructing a new type with arbitrary constraints from
+	    // an existing type.
+	    function geq(than) {
+	        return Type.from(function (value) { return isNumber.check(value) && value >= than; }, isNumber + " >= " + than);
+	    }
+	    // Default value-returning functions that may optionally be passed as a
+	    // third argument to Def.prototype.field.
+	    var defaults = {
+	        // Functions were used because (among other reasons) that's the most
+	        // elegant way to allow for the emptyArray one always to give a new
+	        // array instance.
+	        "null": function () { return null; },
+	        "emptyArray": function () { return []; },
+	        "false": function () { return false; },
+	        "true": function () { return true; },
+	        "undefined": function () { },
+	        "use strict": function () { return "use strict"; }
+	    };
+	    var naiveIsPrimitive = Type.or(builtin.string, builtin.number, builtin.boolean, builtin.null, builtin.undefined);
+	    var isPrimitive = Type.from(function (value) {
+	        if (value === null)
+	            return true;
+	        var type = typeof value;
+	        if (type === "object" ||
+	            type === "function") {
+	            return false;
+	        }
+	        return true;
+	    }, naiveIsPrimitive.toString());
+	    return {
+	        geq: geq,
+	        defaults: defaults,
+	        isPrimitive: isPrimitive,
+	    };
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(shared);
+
+	var core = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    var types = fork.use(types_1.default);
+	    var Type = types.Type;
+	    var def = Type.def;
+	    var or = Type.or;
+	    var shared = fork.use(shared_1.default);
+	    var defaults = shared.defaults;
+	    var geq = shared.geq;
+	    // Abstract supertype of all syntactic entities that are allowed to have a
+	    // .loc field.
+	    def("Printable")
+	        .field("loc", or(def("SourceLocation"), null), defaults["null"], true);
+	    def("Node")
+	        .bases("Printable")
+	        .field("type", String)
+	        .field("comments", or([def("Comment")], null), defaults["null"], true);
+	    def("SourceLocation")
+	        .field("start", def("Position"))
+	        .field("end", def("Position"))
+	        .field("source", or(String, null), defaults["null"]);
+	    def("Position")
+	        .field("line", geq(1))
+	        .field("column", geq(0));
+	    def("File")
+	        .bases("Node")
+	        .build("program", "name")
+	        .field("program", def("Program"))
+	        .field("name", or(String, null), defaults["null"]);
+	    def("Program")
+	        .bases("Node")
+	        .build("body")
+	        .field("body", [def("Statement")]);
+	    def("Function")
+	        .bases("Node")
+	        .field("id", or(def("Identifier"), null), defaults["null"])
+	        .field("params", [def("Pattern")])
+	        .field("body", def("BlockStatement"))
+	        .field("generator", Boolean, defaults["false"])
+	        .field("async", Boolean, defaults["false"]);
+	    def("Statement").bases("Node");
+	    // The empty .build() here means that an EmptyStatement can be constructed
+	    // (i.e. it's not abstract) but that it needs no arguments.
+	    def("EmptyStatement").bases("Statement").build();
+	    def("BlockStatement")
+	        .bases("Statement")
+	        .build("body")
+	        .field("body", [def("Statement")]);
+	    // TODO Figure out how to silently coerce Expressions to
+	    // ExpressionStatements where a Statement was expected.
+	    def("ExpressionStatement")
+	        .bases("Statement")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    def("IfStatement")
+	        .bases("Statement")
+	        .build("test", "consequent", "alternate")
+	        .field("test", def("Expression"))
+	        .field("consequent", def("Statement"))
+	        .field("alternate", or(def("Statement"), null), defaults["null"]);
+	    def("LabeledStatement")
+	        .bases("Statement")
+	        .build("label", "body")
+	        .field("label", def("Identifier"))
+	        .field("body", def("Statement"));
+	    def("BreakStatement")
+	        .bases("Statement")
+	        .build("label")
+	        .field("label", or(def("Identifier"), null), defaults["null"]);
+	    def("ContinueStatement")
+	        .bases("Statement")
+	        .build("label")
+	        .field("label", or(def("Identifier"), null), defaults["null"]);
+	    def("WithStatement")
+	        .bases("Statement")
+	        .build("object", "body")
+	        .field("object", def("Expression"))
+	        .field("body", def("Statement"));
+	    def("SwitchStatement")
+	        .bases("Statement")
+	        .build("discriminant", "cases", "lexical")
+	        .field("discriminant", def("Expression"))
+	        .field("cases", [def("SwitchCase")])
+	        .field("lexical", Boolean, defaults["false"]);
+	    def("ReturnStatement")
+	        .bases("Statement")
+	        .build("argument")
+	        .field("argument", or(def("Expression"), null));
+	    def("ThrowStatement")
+	        .bases("Statement")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    def("TryStatement")
+	        .bases("Statement")
+	        .build("block", "handler", "finalizer")
+	        .field("block", def("BlockStatement"))
+	        .field("handler", or(def("CatchClause"), null), function () {
+	        return this.handlers && this.handlers[0] || null;
+	    })
+	        .field("handlers", [def("CatchClause")], function () {
+	        return this.handler ? [this.handler] : [];
+	    }, true) // Indicates this field is hidden from eachField iteration.
+	        .field("guardedHandlers", [def("CatchClause")], defaults.emptyArray)
+	        .field("finalizer", or(def("BlockStatement"), null), defaults["null"]);
+	    def("CatchClause")
+	        .bases("Node")
+	        .build("param", "guard", "body")
+	        // https://github.com/tc39/proposal-optional-catch-binding
+	        .field("param", or(def("Pattern"), null), defaults["null"])
+	        .field("guard", or(def("Expression"), null), defaults["null"])
+	        .field("body", def("BlockStatement"));
+	    def("WhileStatement")
+	        .bases("Statement")
+	        .build("test", "body")
+	        .field("test", def("Expression"))
+	        .field("body", def("Statement"));
+	    def("DoWhileStatement")
+	        .bases("Statement")
+	        .build("body", "test")
+	        .field("body", def("Statement"))
+	        .field("test", def("Expression"));
+	    def("ForStatement")
+	        .bases("Statement")
+	        .build("init", "test", "update", "body")
+	        .field("init", or(def("VariableDeclaration"), def("Expression"), null))
+	        .field("test", or(def("Expression"), null))
+	        .field("update", or(def("Expression"), null))
+	        .field("body", def("Statement"));
+	    def("ForInStatement")
+	        .bases("Statement")
+	        .build("left", "right", "body")
+	        .field("left", or(def("VariableDeclaration"), def("Expression")))
+	        .field("right", def("Expression"))
+	        .field("body", def("Statement"));
+	    def("DebuggerStatement").bases("Statement").build();
+	    def("Declaration").bases("Statement");
+	    def("FunctionDeclaration")
+	        .bases("Function", "Declaration")
+	        .build("id", "params", "body")
+	        .field("id", def("Identifier"));
+	    def("FunctionExpression")
+	        .bases("Function", "Expression")
+	        .build("id", "params", "body");
+	    def("VariableDeclaration")
+	        .bases("Declaration")
+	        .build("kind", "declarations")
+	        .field("kind", or("var", "let", "const"))
+	        .field("declarations", [def("VariableDeclarator")]);
+	    def("VariableDeclarator")
+	        .bases("Node")
+	        .build("id", "init")
+	        .field("id", def("Pattern"))
+	        .field("init", or(def("Expression"), null), defaults["null"]);
+	    def("Expression").bases("Node");
+	    def("ThisExpression").bases("Expression").build();
+	    def("ArrayExpression")
+	        .bases("Expression")
+	        .build("elements")
+	        .field("elements", [or(def("Expression"), null)]);
+	    def("ObjectExpression")
+	        .bases("Expression")
+	        .build("properties")
+	        .field("properties", [def("Property")]);
+	    // TODO Not in the Mozilla Parser API, but used by Esprima.
+	    def("Property")
+	        .bases("Node") // Want to be able to visit Property Nodes.
+	        .build("kind", "key", "value")
+	        .field("kind", or("init", "get", "set"))
+	        .field("key", or(def("Literal"), def("Identifier")))
+	        .field("value", def("Expression"));
+	    def("SequenceExpression")
+	        .bases("Expression")
+	        .build("expressions")
+	        .field("expressions", [def("Expression")]);
+	    var UnaryOperator = or("-", "+", "!", "~", "typeof", "void", "delete");
+	    def("UnaryExpression")
+	        .bases("Expression")
+	        .build("operator", "argument", "prefix")
+	        .field("operator", UnaryOperator)
+	        .field("argument", def("Expression"))
+	        // Esprima doesn't bother with this field, presumably because it's
+	        // always true for unary operators.
+	        .field("prefix", Boolean, defaults["true"]);
+	    var BinaryOperator = or("==", "!=", "===", "!==", "<", "<=", ">", ">=", "<<", ">>", ">>>", "+", "-", "*", "/", "%", "**", "&", // TODO Missing from the Parser API.
+	    "|", "^", "in", "instanceof");
+	    def("BinaryExpression")
+	        .bases("Expression")
+	        .build("operator", "left", "right")
+	        .field("operator", BinaryOperator)
+	        .field("left", def("Expression"))
+	        .field("right", def("Expression"));
+	    var AssignmentOperator = or("=", "+=", "-=", "*=", "/=", "%=", "<<=", ">>=", ">>>=", "|=", "^=", "&=");
+	    def("AssignmentExpression")
+	        .bases("Expression")
+	        .build("operator", "left", "right")
+	        .field("operator", AssignmentOperator)
+	        .field("left", or(def("Pattern"), def("MemberExpression")))
+	        .field("right", def("Expression"));
+	    var UpdateOperator = or("++", "--");
+	    def("UpdateExpression")
+	        .bases("Expression")
+	        .build("operator", "argument", "prefix")
+	        .field("operator", UpdateOperator)
+	        .field("argument", def("Expression"))
+	        .field("prefix", Boolean);
+	    var LogicalOperator = or("||", "&&");
+	    def("LogicalExpression")
+	        .bases("Expression")
+	        .build("operator", "left", "right")
+	        .field("operator", LogicalOperator)
+	        .field("left", def("Expression"))
+	        .field("right", def("Expression"));
+	    def("ConditionalExpression")
+	        .bases("Expression")
+	        .build("test", "consequent", "alternate")
+	        .field("test", def("Expression"))
+	        .field("consequent", def("Expression"))
+	        .field("alternate", def("Expression"));
+	    def("NewExpression")
+	        .bases("Expression")
+	        .build("callee", "arguments")
+	        .field("callee", def("Expression"))
+	        // The Mozilla Parser API gives this type as [or(def("Expression"),
+	        // null)], but null values don't really make sense at the call site.
+	        // TODO Report this nonsense.
+	        .field("arguments", [def("Expression")]);
+	    def("CallExpression")
+	        .bases("Expression")
+	        .build("callee", "arguments")
+	        .field("callee", def("Expression"))
+	        // See comment for NewExpression above.
+	        .field("arguments", [def("Expression")]);
+	    def("MemberExpression")
+	        .bases("Expression")
+	        .build("object", "property", "computed")
+	        .field("object", def("Expression"))
+	        .field("property", or(def("Identifier"), def("Expression")))
+	        .field("computed", Boolean, function () {
+	        var type = this.property.type;
+	        if (type === 'Literal' ||
+	            type === 'MemberExpression' ||
+	            type === 'BinaryExpression') {
+	            return true;
+	        }
+	        return false;
+	    });
+	    def("Pattern").bases("Node");
+	    def("SwitchCase")
+	        .bases("Node")
+	        .build("test", "consequent")
+	        .field("test", or(def("Expression"), null))
+	        .field("consequent", [def("Statement")]);
+	    def("Identifier")
+	        .bases("Expression", "Pattern")
+	        .build("name")
+	        .field("name", String)
+	        .field("optional", Boolean, defaults["false"]);
+	    def("Literal")
+	        .bases("Expression")
+	        .build("value")
+	        .field("value", or(String, Boolean, null, Number, RegExp))
+	        .field("regex", or({
+	        pattern: String,
+	        flags: String
+	    }, null), function () {
+	        if (this.value instanceof RegExp) {
+	            var flags = "";
+	            if (this.value.ignoreCase)
+	                flags += "i";
+	            if (this.value.multiline)
+	                flags += "m";
+	            if (this.value.global)
+	                flags += "g";
+	            return {
+	                pattern: this.value.source,
+	                flags: flags
+	            };
+	        }
+	        return null;
+	    });
+	    // Abstract (non-buildable) comment supertype. Not a Node.
+	    def("Comment")
+	        .bases("Printable")
+	        .field("value", String)
+	        // A .leading comment comes before the node, whereas a .trailing
+	        // comment comes after it. These two fields should not both be true,
+	        // but they might both be false when the comment falls inside a node
+	        // and the node has no children for the comment to lead or trail,
+	        // e.g. { /*dangling*/ }.
+	        .field("leading", Boolean, defaults["true"])
+	        .field("trailing", Boolean, defaults["false"]);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(core);
+
+	var es6 = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var core_1 = __importDefault(core);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    fork.use(core_1.default);
+	    var types = fork.use(types_1.default);
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    def("Function")
+	        .field("generator", Boolean, defaults["false"])
+	        .field("expression", Boolean, defaults["false"])
+	        .field("defaults", [or(def("Expression"), null)], defaults.emptyArray)
+	        // TODO This could be represented as a RestElement in .params.
+	        .field("rest", or(def("Identifier"), null), defaults["null"]);
+	    // The ESTree way of representing a ...rest parameter.
+	    def("RestElement")
+	        .bases("Pattern")
+	        .build("argument")
+	        .field("argument", def("Pattern"))
+	        .field("typeAnnotation", // for Babylon. Flow parser puts it on the identifier
+	    or(def("TypeAnnotation"), def("TSTypeAnnotation"), null), defaults["null"]);
+	    def("SpreadElementPattern")
+	        .bases("Pattern")
+	        .build("argument")
+	        .field("argument", def("Pattern"));
+	    def("FunctionDeclaration")
+	        .build("id", "params", "body", "generator", "expression");
+	    def("FunctionExpression")
+	        .build("id", "params", "body", "generator", "expression");
+	    // The Parser API calls this ArrowExpression, but Esprima and all other
+	    // actual parsers use ArrowFunctionExpression.
+	    def("ArrowFunctionExpression")
+	        .bases("Function", "Expression")
+	        .build("params", "body", "expression")
+	        // The forced null value here is compatible with the overridden
+	        // definition of the "id" field in the Function interface.
+	        .field("id", null, defaults["null"])
+	        // Arrow function bodies are allowed to be expressions.
+	        .field("body", or(def("BlockStatement"), def("Expression")))
+	        // The current spec forbids arrow generators, so I have taken the
+	        // liberty of enforcing that. TODO Report this.
+	        .field("generator", false, defaults["false"]);
+	    def("ForOfStatement")
+	        .bases("Statement")
+	        .build("left", "right", "body")
+	        .field("left", or(def("VariableDeclaration"), def("Pattern")))
+	        .field("right", def("Expression"))
+	        .field("body", def("Statement"));
+	    def("YieldExpression")
+	        .bases("Expression")
+	        .build("argument", "delegate")
+	        .field("argument", or(def("Expression"), null))
+	        .field("delegate", Boolean, defaults["false"]);
+	    def("GeneratorExpression")
+	        .bases("Expression")
+	        .build("body", "blocks", "filter")
+	        .field("body", def("Expression"))
+	        .field("blocks", [def("ComprehensionBlock")])
+	        .field("filter", or(def("Expression"), null));
+	    def("ComprehensionExpression")
+	        .bases("Expression")
+	        .build("body", "blocks", "filter")
+	        .field("body", def("Expression"))
+	        .field("blocks", [def("ComprehensionBlock")])
+	        .field("filter", or(def("Expression"), null));
+	    def("ComprehensionBlock")
+	        .bases("Node")
+	        .build("left", "right", "each")
+	        .field("left", def("Pattern"))
+	        .field("right", def("Expression"))
+	        .field("each", Boolean);
+	    def("Property")
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+	        .field("value", or(def("Expression"), def("Pattern")))
+	        .field("method", Boolean, defaults["false"])
+	        .field("shorthand", Boolean, defaults["false"])
+	        .field("computed", Boolean, defaults["false"]);
+	    def("ObjectProperty")
+	        .field("shorthand", Boolean, defaults["false"]);
+	    def("PropertyPattern")
+	        .bases("Pattern")
+	        .build("key", "pattern")
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+	        .field("pattern", def("Pattern"))
+	        .field("computed", Boolean, defaults["false"]);
+	    def("ObjectPattern")
+	        .bases("Pattern")
+	        .build("properties")
+	        .field("properties", [or(def("PropertyPattern"), def("Property"))]);
+	    def("ArrayPattern")
+	        .bases("Pattern")
+	        .build("elements")
+	        .field("elements", [or(def("Pattern"), null)]);
+	    def("MethodDefinition")
+	        .bases("Declaration")
+	        .build("kind", "key", "value", "static")
+	        .field("kind", or("constructor", "method", "get", "set"))
+	        .field("key", def("Expression"))
+	        .field("value", def("Function"))
+	        .field("computed", Boolean, defaults["false"])
+	        .field("static", Boolean, defaults["false"]);
+	    def("SpreadElement")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    def("ArrayExpression")
+	        .field("elements", [or(def("Expression"), def("SpreadElement"), def("RestElement"), null)]);
+	    def("NewExpression")
+	        .field("arguments", [or(def("Expression"), def("SpreadElement"))]);
+	    def("CallExpression")
+	        .field("arguments", [or(def("Expression"), def("SpreadElement"))]);
+	    // Note: this node type is *not* an AssignmentExpression with a Pattern on
+	    // the left-hand side! The existing AssignmentExpression type already
+	    // supports destructuring assignments. AssignmentPattern nodes may appear
+	    // wherever a Pattern is allowed, and the right-hand side represents a
+	    // default value to be destructured against the left-hand side, if no
+	    // value is otherwise provided. For example: default parameter values.
+	    def("AssignmentPattern")
+	        .bases("Pattern")
+	        .build("left", "right")
+	        .field("left", def("Pattern"))
+	        .field("right", def("Expression"));
+	    var ClassBodyElement = or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"));
+	    def("ClassProperty")
+	        .bases("Declaration")
+	        .build("key")
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+	        .field("computed", Boolean, defaults["false"]);
+	    def("ClassPropertyDefinition") // static property
+	        .bases("Declaration")
+	        .build("definition")
+	        // Yes, Virginia, circular definitions are permitted.
+	        .field("definition", ClassBodyElement);
+	    def("ClassBody")
+	        .bases("Declaration")
+	        .build("body")
+	        .field("body", [ClassBodyElement]);
+	    def("ClassDeclaration")
+	        .bases("Declaration")
+	        .build("id", "body", "superClass")
+	        .field("id", or(def("Identifier"), null))
+	        .field("body", def("ClassBody"))
+	        .field("superClass", or(def("Expression"), null), defaults["null"]);
+	    def("ClassExpression")
+	        .bases("Expression")
+	        .build("id", "body", "superClass")
+	        .field("id", or(def("Identifier"), null), defaults["null"])
+	        .field("body", def("ClassBody"))
+	        .field("superClass", or(def("Expression"), null), defaults["null"]);
+	    // Specifier and ModuleSpecifier are abstract non-standard types
+	    // introduced for definitional convenience.
+	    def("Specifier").bases("Node");
+	    // This supertype is shared/abused by both def/babel.js and
+	    // def/esprima.js. In the future, it will be possible to load only one set
+	    // of definitions appropriate for a given parser, but until then we must
+	    // rely on default functions to reconcile the conflicting AST formats.
+	    def("ModuleSpecifier")
+	        .bases("Specifier")
+	        // This local field is used by Babel/Acorn. It should not technically
+	        // be optional in the Babel/Acorn AST format, but it must be optional
+	        // in the Esprima AST format.
+	        .field("local", or(def("Identifier"), null), defaults["null"])
+	        // The id and name fields are used by Esprima. The id field should not
+	        // technically be optional in the Esprima AST format, but it must be
+	        // optional in the Babel/Acorn AST format.
+	        .field("id", or(def("Identifier"), null), defaults["null"])
+	        .field("name", or(def("Identifier"), null), defaults["null"]);
+	    // Like ModuleSpecifier, except type:"ImportSpecifier" and buildable.
+	    // import {<id [as name]>} from ...;
+	    def("ImportSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("id", "name");
+	    // import <* as id> from ...;
+	    def("ImportNamespaceSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("id");
+	    // import <id> from ...;
+	    def("ImportDefaultSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("id");
+	    def("ImportDeclaration")
+	        .bases("Declaration")
+	        .build("specifiers", "source", "importKind")
+	        .field("specifiers", [or(def("ImportSpecifier"), def("ImportNamespaceSpecifier"), def("ImportDefaultSpecifier"))], defaults.emptyArray)
+	        .field("source", def("Literal"))
+	        .field("importKind", or("value", "type"), function () {
+	        return "value";
+	    });
+	    def("TaggedTemplateExpression")
+	        .bases("Expression")
+	        .build("tag", "quasi")
+	        .field("tag", def("Expression"))
+	        .field("quasi", def("TemplateLiteral"));
+	    def("TemplateLiteral")
+	        .bases("Expression")
+	        .build("quasis", "expressions")
+	        .field("quasis", [def("TemplateElement")])
+	        .field("expressions", [def("Expression")]);
+	    def("TemplateElement")
+	        .bases("Node")
+	        .build("value", "tail")
+	        .field("value", { "cooked": String, "raw": String })
+	        .field("tail", Boolean);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(es6);
+
+	var es7 = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var es6_1 = __importDefault(es6);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    fork.use(es6_1.default);
+	    var types = fork.use(types_1.default);
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    def("Function")
+	        .field("async", Boolean, defaults["false"]);
+	    def("SpreadProperty")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    def("ObjectExpression")
+	        .field("properties", [or(def("Property"), def("SpreadProperty"), def("SpreadElement"))]);
+	    def("SpreadPropertyPattern")
+	        .bases("Pattern")
+	        .build("argument")
+	        .field("argument", def("Pattern"));
+	    def("ObjectPattern")
+	        .field("properties", [or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"))]);
+	    def("AwaitExpression")
+	        .bases("Expression")
+	        .build("argument", "all")
+	        .field("argument", or(def("Expression"), null))
+	        .field("all", Boolean, defaults["false"]);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(es7);
+
+	var jsx = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var es7_1 = __importDefault(es7);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    fork.use(es7_1.default);
+	    var types = fork.use(types_1.default);
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    def("JSXAttribute")
+	        .bases("Node")
+	        .build("name", "value")
+	        .field("name", or(def("JSXIdentifier"), def("JSXNamespacedName")))
+	        .field("value", or(def("Literal"), // attr="value"
+	    def("JSXExpressionContainer"), // attr={value}
+	    null // attr= or just attr
+	    ), defaults["null"]);
+	    def("JSXIdentifier")
+	        .bases("Identifier")
+	        .build("name")
+	        .field("name", String);
+	    def("JSXNamespacedName")
+	        .bases("Node")
+	        .build("namespace", "name")
+	        .field("namespace", def("JSXIdentifier"))
+	        .field("name", def("JSXIdentifier"));
+	    def("JSXMemberExpression")
+	        .bases("MemberExpression")
+	        .build("object", "property")
+	        .field("object", or(def("JSXIdentifier"), def("JSXMemberExpression")))
+	        .field("property", def("JSXIdentifier"))
+	        .field("computed", Boolean, defaults.false);
+	    var JSXElementName = or(def("JSXIdentifier"), def("JSXNamespacedName"), def("JSXMemberExpression"));
+	    def("JSXSpreadAttribute")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    var JSXAttributes = [or(def("JSXAttribute"), def("JSXSpreadAttribute"))];
+	    def("JSXExpressionContainer")
+	        .bases("Expression")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    def("JSXElement")
+	        .bases("Expression")
+	        .build("openingElement", "closingElement", "children")
+	        .field("openingElement", def("JSXOpeningElement"))
+	        .field("closingElement", or(def("JSXClosingElement"), null), defaults["null"])
+	        .field("children", [or(def("JSXElement"), def("JSXExpressionContainer"), def("JSXFragment"), def("JSXText"), def("Literal") // TODO Esprima should return JSXText instead.
+	        )], defaults.emptyArray)
+	        .field("name", JSXElementName, function () {
+	        // Little-known fact: the `this` object inside a default function
+	        // is none other than the partially-built object itself, and any
+	        // fields initialized directly from builder function arguments
+	        // (like openingElement, closingElement, and children) are
+	        // guaranteed to be available.
+	        return this.openingElement.name;
+	    }, true) // hidden from traversal
+	        .field("selfClosing", Boolean, function () {
+	        return this.openingElement.selfClosing;
+	    }, true) // hidden from traversal
+	        .field("attributes", JSXAttributes, function () {
+	        return this.openingElement.attributes;
+	    }, true); // hidden from traversal
+	    def("JSXOpeningElement")
+	        .bases("Node") // TODO Does this make sense? Can't really be an JSXElement.
+	        .build("name", "attributes", "selfClosing")
+	        .field("name", JSXElementName)
+	        .field("attributes", JSXAttributes, defaults.emptyArray)
+	        .field("selfClosing", Boolean, defaults["false"]);
+	    def("JSXClosingElement")
+	        .bases("Node") // TODO Same concern.
+	        .build("name")
+	        .field("name", JSXElementName);
+	    def("JSXFragment")
+	        .bases("Expression")
+	        .build("openingElement", "closingElement", "children")
+	        .field("openingElement", def("JSXOpeningFragment"))
+	        .field("closingElement", def("JSXClosingFragment"))
+	        .field("children", [or(def("JSXElement"), def("JSXExpressionContainer"), def("JSXFragment"), def("JSXText"), def("Literal") // TODO Esprima should return JSXText instead.
+	        )], defaults.emptyArray);
+	    def("JSXOpeningFragment")
+	        .bases("Node") // TODO Same concern.
+	        .build();
+	    def("JSXClosingFragment")
+	        .bases("Node") // TODO Same concern.
+	        .build();
+	    def("JSXText")
+	        .bases("Literal")
+	        .build("value")
+	        .field("value", String);
+	    def("JSXEmptyExpression").bases("Expression").build();
+	    // This PR has caused many people issues, but supporting it seems like a
+	    // good idea anyway: https://github.com/babel/babel/pull/4988
+	    def("JSXSpreadChild")
+	        .bases("Expression")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(jsx);
+
+	var typeAnnotations = createCommonjsModule(function (module, exports) {
+	/**
+	 * Type annotation defs shared between Flow and TypeScript.
+	 * These defs could not be defined in ./flow.ts or ./typescript.ts directly
+	 * because they use the same name.
+	 */
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    var types = fork.use(types_1.default);
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    var TypeAnnotation = or(def("TypeAnnotation"), def("TSTypeAnnotation"), null);
+	    var TypeParamDecl = or(def("TypeParameterDeclaration"), def("TSTypeParameterDeclaration"), null);
+	    def("Identifier")
+	        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+	    def("ObjectPattern")
+	        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+	    def("Function")
+	        .field("returnType", TypeAnnotation, defaults["null"])
+	        .field("typeParameters", TypeParamDecl, defaults["null"]);
+	    def("ClassProperty")
+	        .build("key", "value", "typeAnnotation", "static")
+	        .field("value", or(def("Expression"), null))
+	        .field("static", Boolean, defaults["false"])
+	        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+	    ["ClassDeclaration",
+	        "ClassExpression",
+	    ].forEach(function (typeName) {
+	        def(typeName)
+	            .field("typeParameters", TypeParamDecl, defaults["null"])
+	            .field("superTypeParameters", or(def("TypeParameterInstantiation"), def("TSTypeParameterInstantiation"), null), defaults["null"])
+	            .field("implements", or([def("ClassImplements")], [def("TSExpressionWithTypeArguments")]), defaults.emptyArray);
+	    });
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(typeAnnotations);
+
+	var flow = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var es7_1 = __importDefault(es7);
+	var type_annotations_1 = __importDefault(typeAnnotations);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    fork.use(es7_1.default);
+	    fork.use(type_annotations_1.default);
+	    var types = fork.use(types_1.default);
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    // Base types
+	    def("Flow").bases("Node");
+	    def("FlowType").bases("Flow");
+	    // Type annotations
+	    def("AnyTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("EmptyTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("MixedTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("VoidTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("NumberTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("NumberLiteralTypeAnnotation")
+	        .bases("FlowType")
+	        .build("value", "raw")
+	        .field("value", Number)
+	        .field("raw", String);
+	    // Babylon 6 differs in AST from Flow
+	    // same as NumberLiteralTypeAnnotation
+	    def("NumericLiteralTypeAnnotation")
+	        .bases("FlowType")
+	        .build("value", "raw")
+	        .field("value", Number)
+	        .field("raw", String);
+	    def("StringTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("StringLiteralTypeAnnotation")
+	        .bases("FlowType")
+	        .build("value", "raw")
+	        .field("value", String)
+	        .field("raw", String);
+	    def("BooleanTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("BooleanLiteralTypeAnnotation")
+	        .bases("FlowType")
+	        .build("value", "raw")
+	        .field("value", Boolean)
+	        .field("raw", String);
+	    def("TypeAnnotation")
+	        .bases("Node")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("FlowType"));
+	    def("NullableTypeAnnotation")
+	        .bases("FlowType")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("FlowType"));
+	    def("NullLiteralTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("NullTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("ThisTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("ExistsTypeAnnotation")
+	        .bases("FlowType")
+	        .build();
+	    def("ExistentialTypeParam")
+	        .bases("FlowType")
+	        .build();
+	    def("FunctionTypeAnnotation")
+	        .bases("FlowType")
+	        .build("params", "returnType", "rest", "typeParameters")
+	        .field("params", [def("FunctionTypeParam")])
+	        .field("returnType", def("FlowType"))
+	        .field("rest", or(def("FunctionTypeParam"), null))
+	        .field("typeParameters", or(def("TypeParameterDeclaration"), null));
+	    def("FunctionTypeParam")
+	        .bases("Node")
+	        .build("name", "typeAnnotation", "optional")
+	        .field("name", def("Identifier"))
+	        .field("typeAnnotation", def("FlowType"))
+	        .field("optional", Boolean);
+	    def("ArrayTypeAnnotation")
+	        .bases("FlowType")
+	        .build("elementType")
+	        .field("elementType", def("FlowType"));
+	    def("ObjectTypeAnnotation")
+	        .bases("FlowType")
+	        .build("properties", "indexers", "callProperties")
+	        .field("properties", [
+	        or(def("ObjectTypeProperty"), def("ObjectTypeSpreadProperty"))
+	    ])
+	        .field("indexers", [def("ObjectTypeIndexer")], defaults.emptyArray)
+	        .field("callProperties", [def("ObjectTypeCallProperty")], defaults.emptyArray)
+	        .field("inexact", or(Boolean, void 0), defaults["undefined"])
+	        .field("exact", Boolean, defaults["false"])
+	        .field("internalSlots", [def("ObjectTypeInternalSlot")], defaults.emptyArray);
+	    def("Variance")
+	        .bases("Node")
+	        .build("kind")
+	        .field("kind", or("plus", "minus"));
+	    var LegacyVariance = or(def("Variance"), "plus", "minus", null);
+	    def("ObjectTypeProperty")
+	        .bases("Node")
+	        .build("key", "value", "optional")
+	        .field("key", or(def("Literal"), def("Identifier")))
+	        .field("value", def("FlowType"))
+	        .field("optional", Boolean)
+	        .field("variance", LegacyVariance, defaults["null"]);
+	    def("ObjectTypeIndexer")
+	        .bases("Node")
+	        .build("id", "key", "value")
+	        .field("id", def("Identifier"))
+	        .field("key", def("FlowType"))
+	        .field("value", def("FlowType"))
+	        .field("variance", LegacyVariance, defaults["null"]);
+	    def("ObjectTypeCallProperty")
+	        .bases("Node")
+	        .build("value")
+	        .field("value", def("FunctionTypeAnnotation"))
+	        .field("static", Boolean, defaults["false"]);
+	    def("QualifiedTypeIdentifier")
+	        .bases("Node")
+	        .build("qualification", "id")
+	        .field("qualification", or(def("Identifier"), def("QualifiedTypeIdentifier")))
+	        .field("id", def("Identifier"));
+	    def("GenericTypeAnnotation")
+	        .bases("FlowType")
+	        .build("id", "typeParameters")
+	        .field("id", or(def("Identifier"), def("QualifiedTypeIdentifier")))
+	        .field("typeParameters", or(def("TypeParameterInstantiation"), null));
+	    def("MemberTypeAnnotation")
+	        .bases("FlowType")
+	        .build("object", "property")
+	        .field("object", def("Identifier"))
+	        .field("property", or(def("MemberTypeAnnotation"), def("GenericTypeAnnotation")));
+	    def("UnionTypeAnnotation")
+	        .bases("FlowType")
+	        .build("types")
+	        .field("types", [def("FlowType")]);
+	    def("IntersectionTypeAnnotation")
+	        .bases("FlowType")
+	        .build("types")
+	        .field("types", [def("FlowType")]);
+	    def("TypeofTypeAnnotation")
+	        .bases("FlowType")
+	        .build("argument")
+	        .field("argument", def("FlowType"));
+	    def("ObjectTypeSpreadProperty")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("FlowType"));
+	    def("ObjectTypeInternalSlot")
+	        .bases("Node")
+	        .build("id", "value", "optional", "static", "method")
+	        .field("id", def("Identifier"))
+	        .field("value", def("FlowType"))
+	        .field("optional", Boolean)
+	        .field("static", Boolean)
+	        .field("method", Boolean);
+	    def("TypeParameterDeclaration")
+	        .bases("Node")
+	        .build("params")
+	        .field("params", [def("TypeParameter")]);
+	    def("TypeParameterInstantiation")
+	        .bases("Node")
+	        .build("params")
+	        .field("params", [def("FlowType")]);
+	    def("TypeParameter")
+	        .bases("FlowType")
+	        .build("name", "variance", "bound")
+	        .field("name", String)
+	        .field("variance", LegacyVariance, defaults["null"])
+	        .field("bound", or(def("TypeAnnotation"), null), defaults["null"]);
+	    def("ClassProperty")
+	        .field("variance", LegacyVariance, defaults["null"]);
+	    def("ClassImplements")
+	        .bases("Node")
+	        .build("id")
+	        .field("id", def("Identifier"))
+	        .field("superClass", or(def("Expression"), null), defaults["null"])
+	        .field("typeParameters", or(def("TypeParameterInstantiation"), null), defaults["null"]);
+	    def("InterfaceTypeAnnotation")
+	        .bases("FlowType")
+	        .build("body", "extends")
+	        .field("body", def("ObjectTypeAnnotation"))
+	        .field("extends", or([def("InterfaceExtends")], null), defaults["null"]);
+	    def("InterfaceDeclaration")
+	        .bases("Declaration")
+	        .build("id", "body", "extends")
+	        .field("id", def("Identifier"))
+	        .field("typeParameters", or(def("TypeParameterDeclaration"), null), defaults["null"])
+	        .field("body", def("ObjectTypeAnnotation"))
+	        .field("extends", [def("InterfaceExtends")]);
+	    def("DeclareInterface")
+	        .bases("InterfaceDeclaration")
+	        .build("id", "body", "extends");
+	    def("InterfaceExtends")
+	        .bases("Node")
+	        .build("id")
+	        .field("id", def("Identifier"))
+	        .field("typeParameters", or(def("TypeParameterInstantiation"), null), defaults["null"]);
+	    def("TypeAlias")
+	        .bases("Declaration")
+	        .build("id", "typeParameters", "right")
+	        .field("id", def("Identifier"))
+	        .field("typeParameters", or(def("TypeParameterDeclaration"), null))
+	        .field("right", def("FlowType"));
+	    def("OpaqueType")
+	        .bases("Declaration")
+	        .build("id", "typeParameters", "impltype", "supertype")
+	        .field("id", def("Identifier"))
+	        .field("typeParameters", or(def("TypeParameterDeclaration"), null))
+	        .field("impltype", def("FlowType"))
+	        .field("supertype", def("FlowType"));
+	    def("DeclareTypeAlias")
+	        .bases("TypeAlias")
+	        .build("id", "typeParameters", "right");
+	    def("DeclareOpaqueType")
+	        .bases("TypeAlias")
+	        .build("id", "typeParameters", "supertype");
+	    def("TypeCastExpression")
+	        .bases("Expression")
+	        .build("expression", "typeAnnotation")
+	        .field("expression", def("Expression"))
+	        .field("typeAnnotation", def("TypeAnnotation"));
+	    def("TupleTypeAnnotation")
+	        .bases("FlowType")
+	        .build("types")
+	        .field("types", [def("FlowType")]);
+	    def("DeclareVariable")
+	        .bases("Statement")
+	        .build("id")
+	        .field("id", def("Identifier"));
+	    def("DeclareFunction")
+	        .bases("Statement")
+	        .build("id")
+	        .field("id", def("Identifier"));
+	    def("DeclareClass")
+	        .bases("InterfaceDeclaration")
+	        .build("id");
+	    def("DeclareModule")
+	        .bases("Statement")
+	        .build("id", "body")
+	        .field("id", or(def("Identifier"), def("Literal")))
+	        .field("body", def("BlockStatement"));
+	    def("DeclareModuleExports")
+	        .bases("Statement")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("TypeAnnotation"));
+	    def("DeclareExportDeclaration")
+	        .bases("Declaration")
+	        .build("default", "declaration", "specifiers", "source")
+	        .field("default", Boolean)
+	        .field("declaration", or(def("DeclareVariable"), def("DeclareFunction"), def("DeclareClass"), def("FlowType"), // Implies default.
+	    null))
+	        .field("specifiers", [or(def("ExportSpecifier"), def("ExportBatchSpecifier"))], defaults.emptyArray)
+	        .field("source", or(def("Literal"), null), defaults["null"]);
+	    def("DeclareExportAllDeclaration")
+	        .bases("Declaration")
+	        .build("source")
+	        .field("source", or(def("Literal"), null), defaults["null"]);
+	    def("FlowPredicate").bases("Flow");
+	    def("InferredPredicate")
+	        .bases("FlowPredicate")
+	        .build();
+	    def("DeclaredPredicate")
+	        .bases("FlowPredicate")
+	        .build("value")
+	        .field("value", def("Expression"));
+	    def("CallExpression")
+	        .field("typeArguments", or(null, def("TypeParameterInstantiation")), defaults["null"]);
+	    def("NewExpression")
+	        .field("typeArguments", or(null, def("TypeParameterInstantiation")), defaults["null"]);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(flow);
+
+	var esprima = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var es7_1 = __importDefault(es7);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    fork.use(es7_1.default);
+	    var types = fork.use(types_1.default);
+	    var defaults = fork.use(shared_1.default).defaults;
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    def("VariableDeclaration")
+	        .field("declarations", [or(def("VariableDeclarator"), def("Identifier") // Esprima deviation.
+	        )]);
+	    def("Property")
+	        .field("value", or(def("Expression"), def("Pattern") // Esprima deviation.
+	    ));
+	    def("ArrayPattern")
+	        .field("elements", [or(def("Pattern"), def("SpreadElement"), null)]);
+	    def("ObjectPattern")
+	        .field("properties", [or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"), def("SpreadProperty") // Used by Esprima.
+	        )]);
+	    // Like ModuleSpecifier, except type:"ExportSpecifier" and buildable.
+	    // export {<id [as name]>} [from ...];
+	    def("ExportSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("id", "name");
+	    // export <*> from ...;
+	    def("ExportBatchSpecifier")
+	        .bases("Specifier")
+	        .build();
+	    def("ExportDeclaration")
+	        .bases("Declaration")
+	        .build("default", "declaration", "specifiers", "source")
+	        .field("default", Boolean)
+	        .field("declaration", or(def("Declaration"), def("Expression"), // Implies default.
+	    null))
+	        .field("specifiers", [or(def("ExportSpecifier"), def("ExportBatchSpecifier"))], defaults.emptyArray)
+	        .field("source", or(def("Literal"), null), defaults["null"]);
+	    def("Block")
+	        .bases("Comment")
+	        .build("value", /*optional:*/ "leading", "trailing");
+	    def("Line")
+	        .bases("Comment")
+	        .build("value", /*optional:*/ "leading", "trailing");
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(esprima);
+
+	var babelCore = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	var es7_1 = __importDefault(es7);
+	function default_1(fork) {
+	    fork.use(es7_1.default);
+	    var types = fork.use(types_1.default);
+	    var defaults = fork.use(shared_1.default).defaults;
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    def("Noop")
+	        .bases("Statement")
+	        .build();
+	    def("DoExpression")
+	        .bases("Expression")
+	        .build("body")
+	        .field("body", [def("Statement")]);
+	    def("Super")
+	        .bases("Expression")
+	        .build();
+	    def("BindExpression")
+	        .bases("Expression")
+	        .build("object", "callee")
+	        .field("object", or(def("Expression"), null))
+	        .field("callee", def("Expression"));
+	    def("Decorator")
+	        .bases("Node")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    def("Property")
+	        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+	    def("MethodDefinition")
+	        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+	    def("MetaProperty")
+	        .bases("Expression")
+	        .build("meta", "property")
+	        .field("meta", def("Identifier"))
+	        .field("property", def("Identifier"));
+	    def("ParenthesizedExpression")
+	        .bases("Expression")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    def("ImportSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("imported", "local")
+	        .field("imported", def("Identifier"));
+	    def("ImportDefaultSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("local");
+	    def("ImportNamespaceSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("local");
+	    def("ExportDefaultDeclaration")
+	        .bases("Declaration")
+	        .build("declaration")
+	        .field("declaration", or(def("Declaration"), def("Expression")));
+	    def("ExportNamedDeclaration")
+	        .bases("Declaration")
+	        .build("declaration", "specifiers", "source")
+	        .field("declaration", or(def("Declaration"), null))
+	        .field("specifiers", [def("ExportSpecifier")], defaults.emptyArray)
+	        .field("source", or(def("Literal"), null), defaults["null"]);
+	    def("ExportSpecifier")
+	        .bases("ModuleSpecifier")
+	        .build("local", "exported")
+	        .field("exported", def("Identifier"));
+	    def("ExportNamespaceSpecifier")
+	        .bases("Specifier")
+	        .build("exported")
+	        .field("exported", def("Identifier"));
+	    def("ExportDefaultSpecifier")
+	        .bases("Specifier")
+	        .build("exported")
+	        .field("exported", def("Identifier"));
+	    def("ExportAllDeclaration")
+	        .bases("Declaration")
+	        .build("exported", "source")
+	        .field("exported", or(def("Identifier"), null))
+	        .field("source", def("Literal"));
+	    def("CommentBlock")
+	        .bases("Comment")
+	        .build("value", /*optional:*/ "leading", "trailing");
+	    def("CommentLine")
+	        .bases("Comment")
+	        .build("value", /*optional:*/ "leading", "trailing");
+	    def("Directive")
+	        .bases("Node")
+	        .build("value")
+	        .field("value", def("DirectiveLiteral"));
+	    def("DirectiveLiteral")
+	        .bases("Node", "Expression")
+	        .build("value")
+	        .field("value", String, defaults["use strict"]);
+	    def("InterpreterDirective")
+	        .bases("Node")
+	        .build("value")
+	        .field("value", String);
+	    def("BlockStatement")
+	        .bases("Statement")
+	        .build("body")
+	        .field("body", [def("Statement")])
+	        .field("directives", [def("Directive")], defaults.emptyArray);
+	    def("Program")
+	        .bases("Node")
+	        .build("body")
+	        .field("body", [def("Statement")])
+	        .field("directives", [def("Directive")], defaults.emptyArray)
+	        .field("interpreter", or(def("InterpreterDirective"), null), defaults["null"]);
+	    // Split Literal
+	    def("StringLiteral")
+	        .bases("Literal")
+	        .build("value")
+	        .field("value", String);
+	    def("NumericLiteral")
+	        .bases("Literal")
+	        .build("value")
+	        .field("value", Number)
+	        .field("raw", or(String, null), defaults["null"])
+	        .field("extra", {
+	        rawValue: Number,
+	        raw: String
+	    }, function getDefault() {
+	        return {
+	            rawValue: this.value,
+	            raw: this.value + ""
+	        };
+	    });
+	    def("BigIntLiteral")
+	        .bases("Literal")
+	        .build("value")
+	        // Only String really seems appropriate here, since BigInt values
+	        // often exceed the limits of JS numbers.
+	        .field("value", or(String, Number))
+	        .field("extra", {
+	        rawValue: String,
+	        raw: String
+	    }, function getDefault() {
+	        return {
+	            rawValue: String(this.value),
+	            raw: this.value + "n"
+	        };
+	    });
+	    def("NullLiteral")
+	        .bases("Literal")
+	        .build()
+	        .field("value", null, defaults["null"]);
+	    def("BooleanLiteral")
+	        .bases("Literal")
+	        .build("value")
+	        .field("value", Boolean);
+	    def("RegExpLiteral")
+	        .bases("Literal")
+	        .build("pattern", "flags")
+	        .field("pattern", String)
+	        .field("flags", String)
+	        .field("value", RegExp, function () {
+	        return new RegExp(this.pattern, this.flags);
+	    });
+	    var ObjectExpressionProperty = or(def("Property"), def("ObjectMethod"), def("ObjectProperty"), def("SpreadProperty"), def("SpreadElement"));
+	    // Split Property -> ObjectProperty and ObjectMethod
+	    def("ObjectExpression")
+	        .bases("Expression")
+	        .build("properties")
+	        .field("properties", [ObjectExpressionProperty]);
+	    // ObjectMethod hoist .value properties to own properties
+	    def("ObjectMethod")
+	        .bases("Node", "Function")
+	        .build("kind", "key", "params", "body", "computed")
+	        .field("kind", or("method", "get", "set"))
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+	        .field("params", [def("Pattern")])
+	        .field("body", def("BlockStatement"))
+	        .field("computed", Boolean, defaults["false"])
+	        .field("generator", Boolean, defaults["false"])
+	        .field("async", Boolean, defaults["false"])
+	        .field("accessibility", // TypeScript
+	    or(def("Literal"), null), defaults["null"])
+	        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+	    def("ObjectProperty")
+	        .bases("Node")
+	        .build("key", "value")
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+	        .field("value", or(def("Expression"), def("Pattern")))
+	        .field("accessibility", // TypeScript
+	    or(def("Literal"), null), defaults["null"])
+	        .field("computed", Boolean, defaults["false"]);
+	    var ClassBodyElement = or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"), def("ClassPrivateProperty"), def("ClassMethod"), def("ClassPrivateMethod"));
+	    // MethodDefinition -> ClassMethod
+	    def("ClassBody")
+	        .bases("Declaration")
+	        .build("body")
+	        .field("body", [ClassBodyElement]);
+	    def("ClassMethod")
+	        .bases("Declaration", "Function")
+	        .build("kind", "key", "params", "body", "computed", "static")
+	        .field("key", or(def("Literal"), def("Identifier"), def("Expression")));
+	    def("ClassPrivateMethod")
+	        .bases("Declaration", "Function")
+	        .build("key", "params", "body", "kind", "computed", "static")
+	        .field("key", def("PrivateName"));
+	    ["ClassMethod",
+	        "ClassPrivateMethod",
+	    ].forEach(function (typeName) {
+	        def(typeName)
+	            .field("kind", or("get", "set", "method", "constructor"), function () { return "method"; })
+	            .field("body", def("BlockStatement"))
+	            .field("computed", Boolean, defaults["false"])
+	            .field("static", or(Boolean, null), defaults["null"])
+	            .field("abstract", or(Boolean, null), defaults["null"])
+	            .field("access", or("public", "private", "protected", null), defaults["null"])
+	            .field("accessibility", or("public", "private", "protected", null), defaults["null"])
+	            .field("decorators", or([def("Decorator")], null), defaults["null"])
+	            .field("optional", or(Boolean, null), defaults["null"]);
+	    });
+	    def("ClassPrivateProperty")
+	        .bases("ClassProperty")
+	        .build("key", "value")
+	        .field("key", def("PrivateName"))
+	        .field("value", or(def("Expression"), null), defaults["null"]);
+	    def("PrivateName")
+	        .bases("Expression", "Pattern")
+	        .build("id")
+	        .field("id", def("Identifier"));
+	    var ObjectPatternProperty = or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"), def("SpreadProperty"), // Used by Esprima
+	    def("ObjectProperty"), // Babel 6
+	    def("RestProperty") // Babel 6
+	    );
+	    // Split into RestProperty and SpreadProperty
+	    def("ObjectPattern")
+	        .bases("Pattern")
+	        .build("properties")
+	        .field("properties", [ObjectPatternProperty])
+	        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+	    def("SpreadProperty")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    def("RestProperty")
+	        .bases("Node")
+	        .build("argument")
+	        .field("argument", def("Expression"));
+	    def("ForAwaitStatement")
+	        .bases("Statement")
+	        .build("left", "right", "body")
+	        .field("left", or(def("VariableDeclaration"), def("Expression")))
+	        .field("right", def("Expression"))
+	        .field("body", def("Statement"));
+	    // The callee node of a dynamic import(...) expression.
+	    def("Import")
+	        .bases("Expression")
+	        .build();
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(babelCore);
+
+	var babel = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var babel_core_1 = __importDefault(babelCore);
+	var flow_1 = __importDefault(flow);
+	function default_1(fork) {
+	    fork.use(babel_core_1.default);
+	    fork.use(flow_1.default);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(babel);
+
+	var typescript = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var babel_core_1 = __importDefault(babelCore);
+	var type_annotations_1 = __importDefault(typeAnnotations);
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	function default_1(fork) {
+	    // Since TypeScript is parsed by Babylon, include the core Babylon types
+	    // but omit the Flow-related types.
+	    fork.use(babel_core_1.default);
+	    fork.use(type_annotations_1.default);
+	    var types = fork.use(types_1.default);
+	    var n = types.namedTypes;
+	    var def = types.Type.def;
+	    var or = types.Type.or;
+	    var defaults = fork.use(shared_1.default).defaults;
+	    var StringLiteral = types.Type.from(function (value, deep) {
+	        if (n.StringLiteral &&
+	            n.StringLiteral.check(value, deep)) {
+	            return true;
+	        }
+	        if (n.Literal &&
+	            n.Literal.check(value, deep) &&
+	            typeof value.value === "string") {
+	            return true;
+	        }
+	        return false;
+	    }, "StringLiteral");
+	    def("TSType")
+	        .bases("Node");
+	    var TSEntityName = or(def("Identifier"), def("TSQualifiedName"));
+	    def("TSTypeReference")
+	        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+	        .build("typeName", "typeParameters")
+	        .field("typeName", TSEntityName);
+	    // An abstract (non-buildable) base type that provide a commonly-needed
+	    // optional .typeParameters field.
+	    def("TSHasOptionalTypeParameterInstantiation")
+	        .field("typeParameters", or(def("TSTypeParameterInstantiation"), null), defaults["null"]);
+	    // An abstract (non-buildable) base type that provide a commonly-needed
+	    // optional .typeParameters field.
+	    def("TSHasOptionalTypeParameters")
+	        .field("typeParameters", or(def("TSTypeParameterDeclaration"), null, void 0), defaults["null"]);
+	    // An abstract (non-buildable) base type that provide a commonly-needed
+	    // optional .typeAnnotation field.
+	    def("TSHasOptionalTypeAnnotation")
+	        .field("typeAnnotation", or(def("TSTypeAnnotation"), null), defaults["null"]);
+	    def("TSQualifiedName")
+	        .bases("Node")
+	        .build("left", "right")
+	        .field("left", TSEntityName)
+	        .field("right", TSEntityName);
+	    def("TSAsExpression")
+	        .bases("Expression", "Pattern")
+	        .build("expression", "typeAnnotation")
+	        .field("expression", def("Expression"))
+	        .field("typeAnnotation", def("TSType"))
+	        .field("extra", or({ parenthesized: Boolean }, null), defaults["null"]);
+	    def("TSNonNullExpression")
+	        .bases("Expression", "Pattern")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    [
+	        "TSAnyKeyword",
+	        "TSBigIntKeyword",
+	        "TSBooleanKeyword",
+	        "TSNeverKeyword",
+	        "TSNullKeyword",
+	        "TSNumberKeyword",
+	        "TSObjectKeyword",
+	        "TSStringKeyword",
+	        "TSSymbolKeyword",
+	        "TSUndefinedKeyword",
+	        "TSUnknownKeyword",
+	        "TSVoidKeyword",
+	        "TSThisType",
+	    ].forEach(function (keywordType) {
+	        def(keywordType)
+	            .bases("TSType")
+	            .build();
+	    });
+	    def("TSArrayType")
+	        .bases("TSType")
+	        .build("elementType")
+	        .field("elementType", def("TSType"));
+	    def("TSLiteralType")
+	        .bases("TSType")
+	        .build("literal")
+	        .field("literal", or(def("NumericLiteral"), def("StringLiteral"), def("BooleanLiteral"), def("TemplateLiteral"), def("UnaryExpression")));
+	    ["TSUnionType",
+	        "TSIntersectionType",
+	    ].forEach(function (typeName) {
+	        def(typeName)
+	            .bases("TSType")
+	            .build("types")
+	            .field("types", [def("TSType")]);
+	    });
+	    def("TSConditionalType")
+	        .bases("TSType")
+	        .build("checkType", "extendsType", "trueType", "falseType")
+	        .field("checkType", def("TSType"))
+	        .field("extendsType", def("TSType"))
+	        .field("trueType", def("TSType"))
+	        .field("falseType", def("TSType"));
+	    def("TSInferType")
+	        .bases("TSType")
+	        .build("typeParameter")
+	        .field("typeParameter", def("TSTypeParameter"));
+	    def("TSParenthesizedType")
+	        .bases("TSType")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("TSType"));
+	    var ParametersType = [or(def("Identifier"), def("RestElement"), def("ArrayPattern"), def("ObjectPattern"))];
+	    ["TSFunctionType",
+	        "TSConstructorType",
+	    ].forEach(function (typeName) {
+	        def(typeName)
+	            .bases("TSType", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+	            .build("parameters")
+	            .field("parameters", ParametersType);
+	    });
+	    def("TSDeclareFunction")
+	        .bases("Declaration", "TSHasOptionalTypeParameters")
+	        .build("id", "params", "returnType")
+	        .field("declare", Boolean, defaults["false"])
+	        .field("async", Boolean, defaults["false"])
+	        .field("generator", Boolean, defaults["false"])
+	        .field("id", or(def("Identifier"), null), defaults["null"])
+	        .field("params", [def("Pattern")])
+	        // tSFunctionTypeAnnotationCommon
+	        .field("returnType", or(def("TSTypeAnnotation"), def("Noop"), // Still used?
+	    null), defaults["null"]);
+	    def("TSDeclareMethod")
+	        .bases("Declaration", "TSHasOptionalTypeParameters")
+	        .build("key", "params", "returnType")
+	        .field("async", Boolean, defaults["false"])
+	        .field("generator", Boolean, defaults["false"])
+	        .field("params", [def("Pattern")])
+	        // classMethodOrPropertyCommon
+	        .field("abstract", Boolean, defaults["false"])
+	        .field("accessibility", or("public", "private", "protected", void 0), defaults["undefined"])
+	        .field("static", Boolean, defaults["false"])
+	        .field("computed", Boolean, defaults["false"])
+	        .field("optional", Boolean, defaults["false"])
+	        .field("key", or(def("Identifier"), def("StringLiteral"), def("NumericLiteral"), 
+	    // Only allowed if .computed is true.
+	    def("Expression")))
+	        // classMethodOrDeclareMethodCommon
+	        .field("kind", or("get", "set", "method", "constructor"), function getDefault() { return "method"; })
+	        .field("access", // Not "accessibility"?
+	    or("public", "private", "protected", void 0), defaults["undefined"])
+	        .field("decorators", or([def("Decorator")], null), defaults["null"])
+	        // tSFunctionTypeAnnotationCommon
+	        .field("returnType", or(def("TSTypeAnnotation"), def("Noop"), // Still used?
+	    null), defaults["null"]);
+	    def("TSMappedType")
+	        .bases("TSType")
+	        .build("typeParameter", "typeAnnotation")
+	        .field("readonly", or(Boolean, "+", "-"), defaults["false"])
+	        .field("typeParameter", def("TSTypeParameter"))
+	        .field("optional", or(Boolean, "+", "-"), defaults["false"])
+	        .field("typeAnnotation", or(def("TSType"), null), defaults["null"]);
+	    def("TSTupleType")
+	        .bases("TSType")
+	        .build("elementTypes")
+	        .field("elementTypes", [def("TSType")]);
+	    def("TSRestType")
+	        .bases("TSType")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("TSType"));
+	    def("TSOptionalType")
+	        .bases("TSType")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", def("TSType"));
+	    def("TSIndexedAccessType")
+	        .bases("TSType")
+	        .build("objectType", "indexType")
+	        .field("objectType", def("TSType"))
+	        .field("indexType", def("TSType"));
+	    def("TSTypeOperator")
+	        .bases("TSType")
+	        .build("operator")
+	        .field("operator", String)
+	        .field("typeAnnotation", def("TSType"));
+	    def("TSTypeAnnotation")
+	        .bases("Node")
+	        .build("typeAnnotation")
+	        .field("typeAnnotation", or(def("TSType"), def("TSTypeAnnotation")));
+	    def("TSIndexSignature")
+	        .bases("Declaration", "TSHasOptionalTypeAnnotation")
+	        .build("parameters", "typeAnnotation")
+	        .field("parameters", [def("Identifier")]) // Length === 1
+	        .field("readonly", Boolean, defaults["false"]);
+	    def("TSPropertySignature")
+	        .bases("Declaration", "TSHasOptionalTypeAnnotation")
+	        .build("key", "typeAnnotation", "optional")
+	        .field("key", def("Expression"))
+	        .field("computed", Boolean, defaults["false"])
+	        .field("readonly", Boolean, defaults["false"])
+	        .field("optional", Boolean, defaults["false"])
+	        .field("initializer", or(def("Expression"), null), defaults["null"]);
+	    def("TSMethodSignature")
+	        .bases("Declaration", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+	        .build("key", "parameters", "typeAnnotation")
+	        .field("key", def("Expression"))
+	        .field("computed", Boolean, defaults["false"])
+	        .field("optional", Boolean, defaults["false"])
+	        .field("parameters", ParametersType);
+	    def("TSTypePredicate")
+	        .bases("TSTypeAnnotation")
+	        .build("parameterName", "typeAnnotation")
+	        .field("parameterName", or(def("Identifier"), def("TSThisType")))
+	        .field("typeAnnotation", def("TSTypeAnnotation"));
+	    ["TSCallSignatureDeclaration",
+	        "TSConstructSignatureDeclaration",
+	    ].forEach(function (typeName) {
+	        def(typeName)
+	            .bases("Declaration", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+	            .build("parameters", "typeAnnotation")
+	            .field("parameters", ParametersType);
+	    });
+	    def("TSEnumMember")
+	        .bases("Node")
+	        .build("id", "initializer")
+	        .field("id", or(def("Identifier"), StringLiteral))
+	        .field("initializer", or(def("Expression"), null), defaults["null"]);
+	    def("TSTypeQuery")
+	        .bases("TSType")
+	        .build("exprName")
+	        .field("exprName", or(TSEntityName, def("TSImportType")));
+	    // Inferred from Babylon's tsParseTypeMember method.
+	    var TSTypeMember = or(def("TSCallSignatureDeclaration"), def("TSConstructSignatureDeclaration"), def("TSIndexSignature"), def("TSMethodSignature"), def("TSPropertySignature"));
+	    def("TSTypeLiteral")
+	        .bases("TSType")
+	        .build("members")
+	        .field("members", [TSTypeMember]);
+	    def("TSTypeParameter")
+	        .bases("Identifier")
+	        .build("name", "constraint", "default")
+	        .field("name", String)
+	        .field("constraint", or(def("TSType"), void 0), defaults["undefined"])
+	        .field("default", or(def("TSType"), void 0), defaults["undefined"]);
+	    def("TSTypeAssertion")
+	        .bases("Expression", "Pattern")
+	        .build("typeAnnotation", "expression")
+	        .field("typeAnnotation", def("TSType"))
+	        .field("expression", def("Expression"))
+	        .field("extra", or({ parenthesized: Boolean }, null), defaults["null"]);
+	    def("TSTypeParameterDeclaration")
+	        .bases("Declaration")
+	        .build("params")
+	        .field("params", [def("TSTypeParameter")]);
+	    def("TSTypeParameterInstantiation")
+	        .bases("Node")
+	        .build("params")
+	        .field("params", [def("TSType")]);
+	    def("TSEnumDeclaration")
+	        .bases("Declaration")
+	        .build("id", "members")
+	        .field("id", def("Identifier"))
+	        .field("const", Boolean, defaults["false"])
+	        .field("declare", Boolean, defaults["false"])
+	        .field("members", [def("TSEnumMember")])
+	        .field("initializer", or(def("Expression"), null), defaults["null"]);
+	    def("TSTypeAliasDeclaration")
+	        .bases("Declaration", "TSHasOptionalTypeParameters")
+	        .build("id", "typeAnnotation")
+	        .field("id", def("Identifier"))
+	        .field("declare", Boolean, defaults["false"])
+	        .field("typeAnnotation", def("TSType"));
+	    def("TSModuleBlock")
+	        .bases("Node")
+	        .build("body")
+	        .field("body", [def("Statement")]);
+	    def("TSModuleDeclaration")
+	        .bases("Declaration")
+	        .build("id", "body")
+	        .field("id", or(StringLiteral, TSEntityName))
+	        .field("declare", Boolean, defaults["false"])
+	        .field("global", Boolean, defaults["false"])
+	        .field("body", or(def("TSModuleBlock"), def("TSModuleDeclaration"), null), defaults["null"]);
+	    def("TSImportType")
+	        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+	        .build("argument", "qualifier", "typeParameters")
+	        .field("argument", StringLiteral)
+	        .field("qualifier", or(TSEntityName, void 0), defaults["undefined"]);
+	    def("TSImportEqualsDeclaration")
+	        .bases("Declaration")
+	        .build("id", "moduleReference")
+	        .field("id", def("Identifier"))
+	        .field("isExport", Boolean, defaults["false"])
+	        .field("moduleReference", or(TSEntityName, def("TSExternalModuleReference")));
+	    def("TSExternalModuleReference")
+	        .bases("Declaration")
+	        .build("expression")
+	        .field("expression", StringLiteral);
+	    def("TSExportAssignment")
+	        .bases("Statement")
+	        .build("expression")
+	        .field("expression", def("Expression"));
+	    def("TSNamespaceExportDeclaration")
+	        .bases("Declaration")
+	        .build("id")
+	        .field("id", def("Identifier"));
+	    def("TSInterfaceBody")
+	        .bases("Node")
+	        .build("body")
+	        .field("body", [TSTypeMember]);
+	    def("TSExpressionWithTypeArguments")
+	        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+	        .build("expression", "typeParameters")
+	        .field("expression", TSEntityName);
+	    def("TSInterfaceDeclaration")
+	        .bases("Declaration", "TSHasOptionalTypeParameters")
+	        .build("id", "body")
+	        .field("id", TSEntityName)
+	        .field("declare", Boolean, defaults["false"])
+	        .field("extends", or([def("TSExpressionWithTypeArguments")], null), defaults["null"])
+	        .field("body", def("TSInterfaceBody"));
+	    def("TSParameterProperty")
+	        .bases("Pattern")
+	        .build("parameter")
+	        .field("accessibility", or("public", "private", "protected", void 0), defaults["undefined"])
+	        .field("readonly", Boolean, defaults["false"])
+	        .field("parameter", or(def("Identifier"), def("AssignmentPattern")));
+	    def("ClassProperty")
+	        .field("access", // Not "accessibility"?
+	    or("public", "private", "protected", void 0), defaults["undefined"]);
+	    // Defined already in es6 and babel-core.
+	    def("ClassBody")
+	        .field("body", [or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"), def("ClassPrivateProperty"), def("ClassMethod"), def("ClassPrivateMethod"), 
+	        // Just need to add these types:
+	        def("TSDeclareMethod"), TSTypeMember)]);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(typescript);
+
+	var esProposals = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var types_1 = __importDefault(types);
+	var shared_1 = __importDefault(shared);
+	var core_1 = __importDefault(core);
+	function default_1(fork) {
+	    fork.use(core_1.default);
+	    var types = fork.use(types_1.default);
+	    var Type = types.Type;
+	    var def = types.Type.def;
+	    var or = Type.or;
+	    var shared = fork.use(shared_1.default);
+	    var defaults = shared.defaults;
+	    // https://github.com/tc39/proposal-optional-chaining
+	    // `a?.b` as per https://github.com/estree/estree/issues/146
+	    def("OptionalMemberExpression")
+	        .bases("MemberExpression")
+	        .build("object", "property", "computed", "optional")
+	        .field("optional", Boolean, defaults["true"]);
+	    // a?.b()
+	    def("OptionalCallExpression")
+	        .bases("CallExpression")
+	        .build("callee", "arguments", "optional")
+	        .field("optional", Boolean, defaults["true"]);
+	    // https://github.com/tc39/proposal-nullish-coalescing
+	    // `a ?? b` as per https://github.com/babel/babylon/pull/761/files
+	    var LogicalOperator = or("||", "&&", "??");
+	    def("LogicalExpression")
+	        .field("operator", LogicalOperator);
+	}
+	exports.default = default_1;
+	module.exports = exports["default"];
+	});
+
+	unwrapExports(esProposals);
+
+	var namedTypes_1 = createCommonjsModule(function (module, exports) {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var namedTypes;
+	(function (namedTypes) {
+	})(namedTypes = exports.namedTypes || (exports.namedTypes = {}));
+	});
+
+	unwrapExports(namedTypes_1);
+	var namedTypes_2 = namedTypes_1.namedTypes;
+
+	var main = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var fork_1 = __importDefault(fork);
+	var core_1 = __importDefault(core);
+	var es6_1 = __importDefault(es6);
+	var es7_1 = __importDefault(es7);
+	var jsx_1 = __importDefault(jsx);
+	var flow_1 = __importDefault(flow);
+	var esprima_1 = __importDefault(esprima);
+	var babel_1 = __importDefault(babel);
+	var typescript_1 = __importDefault(typescript);
+	var es_proposals_1 = __importDefault(esProposals);
+
+	exports.namedTypes = namedTypes_1.namedTypes;
+	var _a = fork_1.default([
+	    // This core module of AST types captures ES5 as it is parsed today by
+	    // git://github.com/ariya/esprima.git#master.
+	    core_1.default,
+	    // Feel free to add to or remove from this list of extension modules to
+	    // configure the precise type hierarchy that you need.
+	    es6_1.default,
+	    es7_1.default,
+	    jsx_1.default,
+	    flow_1.default,
+	    esprima_1.default,
+	    babel_1.default,
+	    typescript_1.default,
+	    es_proposals_1.default,
+	]), astNodesAreEquivalent = _a.astNodesAreEquivalent, builders = _a.builders, builtInTypes = _a.builtInTypes, defineMethod = _a.defineMethod, eachField = _a.eachField, finalize = _a.finalize, getBuilderName = _a.getBuilderName, getFieldNames = _a.getFieldNames, getFieldValue = _a.getFieldValue, getSupertypeNames = _a.getSupertypeNames, n = _a.namedTypes, NodePath = _a.NodePath, Path = _a.Path, PathVisitor = _a.PathVisitor, someField = _a.someField, Type = _a.Type, use = _a.use, visit = _a.visit;
+	exports.astNodesAreEquivalent = astNodesAreEquivalent;
+	exports.builders = builders;
+	exports.builtInTypes = builtInTypes;
+	exports.defineMethod = defineMethod;
+	exports.eachField = eachField;
+	exports.finalize = finalize;
+	exports.getBuilderName = getBuilderName;
+	exports.getFieldNames = getFieldNames;
+	exports.getFieldValue = getFieldValue;
+	exports.getSupertypeNames = getSupertypeNames;
+	exports.NodePath = NodePath;
+	exports.Path = Path;
+	exports.PathVisitor = PathVisitor;
+	exports.someField = someField;
+	exports.Type = Type;
+	exports.use = use;
+	exports.visit = visit;
+	// Populate the exported fields of the namedTypes namespace, while still
+	// retaining its member types.
+	Object.assign(namedTypes_1.namedTypes, n);
+	});
+
+	unwrapExports(main);
+	var main_1 = main.namedTypes;
+	var main_2 = main.astNodesAreEquivalent;
+	var main_3 = main.builders;
+	var main_4 = main.builtInTypes;
+	var main_5 = main.defineMethod;
+	var main_6 = main.eachField;
+	var main_7 = main.finalize;
+	var main_8 = main.getBuilderName;
+	var main_9 = main.getFieldNames;
+	var main_10 = main.getFieldValue;
+	var main_11 = main.getSupertypeNames;
+	var main_12 = main.NodePath;
+	var main_13 = main.Path;
+	var main_14 = main.PathVisitor;
+	var main_15 = main.someField;
+	var main_16 = main.Type;
+	var main_17 = main.use;
+	var main_18 = main.visit;
+
+	var lookup = [];
+	var revLookup = [];
+	var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;
+	var inited = false;
+	function init () {
+	  inited = true;
+	  var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+	  for (var i = 0, len = code.length; i < len; ++i) {
+	    lookup[i] = code[i];
+	    revLookup[code.charCodeAt(i)] = i;
+	  }
+
+	  revLookup['-'.charCodeAt(0)] = 62;
+	  revLookup['_'.charCodeAt(0)] = 63;
+	}
+
+	function toByteArray (b64) {
+	  if (!inited) {
+	    init();
+	  }
+	  var i, j, l, tmp, placeHolders, arr;
+	  var len = b64.length;
+
+	  if (len % 4 > 0) {
+	    throw new Error('Invalid string. Length must be a multiple of 4')
+	  }
+
+	  // the number of equal signs (place holders)
+	  // if there are two placeholders, than the two characters before it
+	  // represent one byte
+	  // if there is only one, then the three characters before it represent 2 bytes
+	  // this is just a cheap hack to not do indexOf twice
+	  placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0;
+
+	  // base64 is 4/3 + up to two characters of the original data
+	  arr = new Arr(len * 3 / 4 - placeHolders);
+
+	  // if there are placeholders, only get up to the last complete 4 chars
+	  l = placeHolders > 0 ? len - 4 : len;
+
+	  var L = 0;
+
+	  for (i = 0, j = 0; i < l; i += 4, j += 3) {
+	    tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)];
+	    arr[L++] = (tmp >> 16) & 0xFF;
+	    arr[L++] = (tmp >> 8) & 0xFF;
+	    arr[L++] = tmp & 0xFF;
+	  }
+
+	  if (placeHolders === 2) {
+	    tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4);
+	    arr[L++] = tmp & 0xFF;
+	  } else if (placeHolders === 1) {
+	    tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2);
+	    arr[L++] = (tmp >> 8) & 0xFF;
+	    arr[L++] = tmp & 0xFF;
+	  }
+
+	  return arr
+	}
+
+	function tripletToBase64 (num) {
+	  return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]
+	}
+
+	function encodeChunk (uint8, start, end) {
+	  var tmp;
+	  var output = [];
+	  for (var i = start; i < end; i += 3) {
+	    tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]);
+	    output.push(tripletToBase64(tmp));
+	  }
+	  return output.join('')
+	}
+
+	function fromByteArray (uint8) {
+	  if (!inited) {
+	    init();
+	  }
+	  var tmp;
+	  var len = uint8.length;
+	  var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes
+	  var output = '';
+	  var parts = [];
+	  var maxChunkLength = 16383; // must be multiple of 3
+
+	  // go through the array every three bytes, we'll deal with trailing stuff later
+	  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
+	    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)));
+	  }
+
+	  // pad the end with zeros, but make sure to not forget the extra bytes
+	  if (extraBytes === 1) {
+	    tmp = uint8[len - 1];
+	    output += lookup[tmp >> 2];
+	    output += lookup[(tmp << 4) & 0x3F];
+	    output += '==';
+	  } else if (extraBytes === 2) {
+	    tmp = (uint8[len - 2] << 8) + (uint8[len - 1]);
+	    output += lookup[tmp >> 10];
+	    output += lookup[(tmp >> 4) & 0x3F];
+	    output += lookup[(tmp << 2) & 0x3F];
+	    output += '=';
+	  }
+
+	  parts.push(output);
+
+	  return parts.join('')
+	}
+
+	function read (buffer, offset, isLE, mLen, nBytes) {
+	  var e, m;
+	  var eLen = nBytes * 8 - mLen - 1;
+	  var eMax = (1 << eLen) - 1;
+	  var eBias = eMax >> 1;
+	  var nBits = -7;
+	  var i = isLE ? (nBytes - 1) : 0;
+	  var d = isLE ? -1 : 1;
+	  var s = buffer[offset + i];
+
+	  i += d;
+
+	  e = s & ((1 << (-nBits)) - 1);
+	  s >>= (-nBits);
+	  nBits += eLen;
+	  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {}
+
+	  m = e & ((1 << (-nBits)) - 1);
+	  e >>= (-nBits);
+	  nBits += mLen;
+	  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
+
+	  if (e === 0) {
+	    e = 1 - eBias;
+	  } else if (e === eMax) {
+	    return m ? NaN : ((s ? -1 : 1) * Infinity)
+	  } else {
+	    m = m + Math.pow(2, mLen);
+	    e = e - eBias;
+	  }
+	  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
+	}
+
+	function write (buffer, value, offset, isLE, mLen, nBytes) {
+	  var e, m, c;
+	  var eLen = nBytes * 8 - mLen - 1;
+	  var eMax = (1 << eLen) - 1;
+	  var eBias = eMax >> 1;
+	  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0);
+	  var i = isLE ? 0 : (nBytes - 1);
+	  var d = isLE ? 1 : -1;
+	  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
+
+	  value = Math.abs(value);
+
+	  if (isNaN(value) || value === Infinity) {
+	    m = isNaN(value) ? 1 : 0;
+	    e = eMax;
+	  } else {
+	    e = Math.floor(Math.log(value) / Math.LN2);
+	    if (value * (c = Math.pow(2, -e)) < 1) {
+	      e--;
+	      c *= 2;
+	    }
+	    if (e + eBias >= 1) {
+	      value += rt / c;
+	    } else {
+	      value += rt * Math.pow(2, 1 - eBias);
+	    }
+	    if (value * c >= 2) {
+	      e++;
+	      c /= 2;
+	    }
+
+	    if (e + eBias >= eMax) {
+	      m = 0;
+	      e = eMax;
+	    } else if (e + eBias >= 1) {
+	      m = (value * c - 1) * Math.pow(2, mLen);
+	      e = e + eBias;
+	    } else {
+	      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
+	      e = 0;
+	    }
+	  }
+
+	  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
+
+	  e = (e << mLen) | m;
+	  eLen += mLen;
+	  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
+
+	  buffer[offset + i - d] |= s * 128;
+	}
+
+	var toString = {}.toString;
+
+	var isArray = Array.isArray || function (arr) {
+	  return toString.call(arr) == '[object Array]';
+	};
+
+	/*!
+	 * The buffer module from node.js, for the browser.
+	 *
+	 * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+	 * @license  MIT
+	 */
+
+	var INSPECT_MAX_BYTES = 50;
+
+	/**
+	 * If `Buffer.TYPED_ARRAY_SUPPORT`:
+	 *   === true    Use Uint8Array implementation (fastest)
+	 *   === false   Use Object implementation (most compatible, even IE6)
+	 *
+	 * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
+	 * Opera 11.6+, iOS 4.2+.
+	 *
+	 * Due to various browser bugs, sometimes the Object implementation will be used even
+	 * when the browser supports typed arrays.
+	 *
+	 * Note:
+	 *
+	 *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,
+	 *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
+	 *
+	 *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
+	 *
+	 *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
+	 *     incorrect length in some situations.
+
+	 * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they
+	 * get the Object implementation, which is slower but behaves correctly.
+	 */
+	Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined
+	  ? global.TYPED_ARRAY_SUPPORT
+	  : true;
+
+	function kMaxLength () {
+	  return Buffer.TYPED_ARRAY_SUPPORT
+	    ? 0x7fffffff
+	    : 0x3fffffff
+	}
+
+	function createBuffer (that, length) {
+	  if (kMaxLength() < length) {
+	    throw new RangeError('Invalid typed array length')
+	  }
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    // Return an augmented `Uint8Array` instance, for best performance
+	    that = new Uint8Array(length);
+	    that.__proto__ = Buffer.prototype;
+	  } else {
+	    // Fallback: Return an object instance of the Buffer class
+	    if (that === null) {
+	      that = new Buffer(length);
+	    }
+	    that.length = length;
+	  }
+
+	  return that
+	}
+
+	/**
+	 * The Buffer constructor returns instances of `Uint8Array` that have their
+	 * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
+	 * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
+	 * and the `Uint8Array` methods. Square bracket notation works as expected -- it
+	 * returns a single octet.
+	 *
+	 * The `Uint8Array` prototype remains unmodified.
+	 */
+
+	function Buffer (arg, encodingOrOffset, length) {
+	  if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {
+	    return new Buffer(arg, encodingOrOffset, length)
+	  }
+
+	  // Common case.
+	  if (typeof arg === 'number') {
+	    if (typeof encodingOrOffset === 'string') {
+	      throw new Error(
+	        'If encoding is specified then the first argument must be a string'
+	      )
+	    }
+	    return allocUnsafe(this, arg)
+	  }
+	  return from(this, arg, encodingOrOffset, length)
+	}
+
+	Buffer.poolSize = 8192; // not used by this implementation
+
+	// TODO: Legacy, not needed anymore. Remove in next major version.
+	Buffer._augment = function (arr) {
+	  arr.__proto__ = Buffer.prototype;
+	  return arr
+	};
+
+	function from (that, value, encodingOrOffset, length) {
+	  if (typeof value === 'number') {
+	    throw new TypeError('"value" argument must not be a number')
+	  }
+
+	  if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {
+	    return fromArrayBuffer(that, value, encodingOrOffset, length)
+	  }
+
+	  if (typeof value === 'string') {
+	    return fromString(that, value, encodingOrOffset)
+	  }
+
+	  return fromObject(that, value)
+	}
+
+	/**
+	 * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
+	 * if value is a number.
+	 * Buffer.from(str[, encoding])
+	 * Buffer.from(array)
+	 * Buffer.from(buffer)
+	 * Buffer.from(arrayBuffer[, byteOffset[, length]])
+	 **/
+	Buffer.from = function (value, encodingOrOffset, length) {
+	  return from(null, value, encodingOrOffset, length)
+	};
+
+	if (Buffer.TYPED_ARRAY_SUPPORT) {
+	  Buffer.prototype.__proto__ = Uint8Array.prototype;
+	  Buffer.__proto__ = Uint8Array;
+	}
+
+	function assertSize (size) {
+	  if (typeof size !== 'number') {
+	    throw new TypeError('"size" argument must be a number')
+	  } else if (size < 0) {
+	    throw new RangeError('"size" argument must not be negative')
+	  }
+	}
+
+	function alloc (that, size, fill, encoding) {
+	  assertSize(size);
+	  if (size <= 0) {
+	    return createBuffer(that, size)
+	  }
+	  if (fill !== undefined) {
+	    // Only pay attention to encoding if it's a string. This
+	    // prevents accidentally sending in a number that would
+	    // be interpretted as a start offset.
+	    return typeof encoding === 'string'
+	      ? createBuffer(that, size).fill(fill, encoding)
+	      : createBuffer(that, size).fill(fill)
+	  }
+	  return createBuffer(that, size)
+	}
+
+	/**
+	 * Creates a new filled Buffer instance.
+	 * alloc(size[, fill[, encoding]])
+	 **/
+	Buffer.alloc = function (size, fill, encoding) {
+	  return alloc(null, size, fill, encoding)
+	};
+
+	function allocUnsafe (that, size) {
+	  assertSize(size);
+	  that = createBuffer(that, size < 0 ? 0 : checked(size) | 0);
+	  if (!Buffer.TYPED_ARRAY_SUPPORT) {
+	    for (var i = 0; i < size; ++i) {
+	      that[i] = 0;
+	    }
+	  }
+	  return that
+	}
+
+	/**
+	 * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
+	 * */
+	Buffer.allocUnsafe = function (size) {
+	  return allocUnsafe(null, size)
+	};
+	/**
+	 * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
+	 */
+	Buffer.allocUnsafeSlow = function (size) {
+	  return allocUnsafe(null, size)
+	};
+
+	function fromString (that, string, encoding) {
+	  if (typeof encoding !== 'string' || encoding === '') {
+	    encoding = 'utf8';
+	  }
+
+	  if (!Buffer.isEncoding(encoding)) {
+	    throw new TypeError('"encoding" must be a valid string encoding')
+	  }
+
+	  var length = byteLength(string, encoding) | 0;
+	  that = createBuffer(that, length);
+
+	  var actual = that.write(string, encoding);
+
+	  if (actual !== length) {
+	    // Writing a hex string, for example, that contains invalid characters will
+	    // cause everything after the first invalid character to be ignored. (e.g.
+	    // 'abxxcd' will be treated as 'ab')
+	    that = that.slice(0, actual);
+	  }
+
+	  return that
+	}
+
+	function fromArrayLike (that, array) {
+	  var length = array.length < 0 ? 0 : checked(array.length) | 0;
+	  that = createBuffer(that, length);
+	  for (var i = 0; i < length; i += 1) {
+	    that[i] = array[i] & 255;
+	  }
+	  return that
+	}
+
+	function fromArrayBuffer (that, array, byteOffset, length) {
+	  array.byteLength; // this throws if `array` is not a valid ArrayBuffer
+
+	  if (byteOffset < 0 || array.byteLength < byteOffset) {
+	    throw new RangeError('\'offset\' is out of bounds')
+	  }
+
+	  if (array.byteLength < byteOffset + (length || 0)) {
+	    throw new RangeError('\'length\' is out of bounds')
+	  }
+
+	  if (byteOffset === undefined && length === undefined) {
+	    array = new Uint8Array(array);
+	  } else if (length === undefined) {
+	    array = new Uint8Array(array, byteOffset);
+	  } else {
+	    array = new Uint8Array(array, byteOffset, length);
+	  }
+
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    // Return an augmented `Uint8Array` instance, for best performance
+	    that = array;
+	    that.__proto__ = Buffer.prototype;
+	  } else {
+	    // Fallback: Return an object instance of the Buffer class
+	    that = fromArrayLike(that, array);
+	  }
+	  return that
+	}
+
+	function fromObject (that, obj) {
+	  if (internalIsBuffer(obj)) {
+	    var len = checked(obj.length) | 0;
+	    that = createBuffer(that, len);
+
+	    if (that.length === 0) {
+	      return that
+	    }
+
+	    obj.copy(that, 0, 0, len);
+	    return that
+	  }
+
+	  if (obj) {
+	    if ((typeof ArrayBuffer !== 'undefined' &&
+	        obj.buffer instanceof ArrayBuffer) || 'length' in obj) {
+	      if (typeof obj.length !== 'number' || isnan(obj.length)) {
+	        return createBuffer(that, 0)
+	      }
+	      return fromArrayLike(that, obj)
+	    }
+
+	    if (obj.type === 'Buffer' && isArray(obj.data)) {
+	      return fromArrayLike(that, obj.data)
+	    }
+	  }
+
+	  throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')
+	}
+
+	function checked (length) {
+	  // Note: cannot use `length < kMaxLength()` here because that fails when
+	  // length is NaN (which is otherwise coerced to zero.)
+	  if (length >= kMaxLength()) {
+	    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
+	                         'size: 0x' + kMaxLength().toString(16) + ' bytes')
+	  }
+	  return length | 0
+	}
+	Buffer.isBuffer = isBuffer;
+	function internalIsBuffer (b) {
+	  return !!(b != null && b._isBuffer)
+	}
+
+	Buffer.compare = function compare (a, b) {
+	  if (!internalIsBuffer(a) || !internalIsBuffer(b)) {
+	    throw new TypeError('Arguments must be Buffers')
+	  }
+
+	  if (a === b) return 0
+
+	  var x = a.length;
+	  var y = b.length;
+
+	  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
+	    if (a[i] !== b[i]) {
+	      x = a[i];
+	      y = b[i];
+	      break
+	    }
+	  }
+
+	  if (x < y) return -1
+	  if (y < x) return 1
+	  return 0
+	};
+
+	Buffer.isEncoding = function isEncoding (encoding) {
+	  switch (String(encoding).toLowerCase()) {
+	    case 'hex':
+	    case 'utf8':
+	    case 'utf-8':
+	    case 'ascii':
+	    case 'latin1':
+	    case 'binary':
+	    case 'base64':
+	    case 'ucs2':
+	    case 'ucs-2':
+	    case 'utf16le':
+	    case 'utf-16le':
+	      return true
+	    default:
+	      return false
+	  }
+	};
+
+	Buffer.concat = function concat (list, length) {
+	  if (!isArray(list)) {
+	    throw new TypeError('"list" argument must be an Array of Buffers')
+	  }
+
+	  if (list.length === 0) {
+	    return Buffer.alloc(0)
+	  }
+
+	  var i;
+	  if (length === undefined) {
+	    length = 0;
+	    for (i = 0; i < list.length; ++i) {
+	      length += list[i].length;
+	    }
+	  }
+
+	  var buffer = Buffer.allocUnsafe(length);
+	  var pos = 0;
+	  for (i = 0; i < list.length; ++i) {
+	    var buf = list[i];
+	    if (!internalIsBuffer(buf)) {
+	      throw new TypeError('"list" argument must be an Array of Buffers')
+	    }
+	    buf.copy(buffer, pos);
+	    pos += buf.length;
+	  }
+	  return buffer
+	};
+
+	function byteLength (string, encoding) {
+	  if (internalIsBuffer(string)) {
+	    return string.length
+	  }
+	  if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&
+	      (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {
+	    return string.byteLength
+	  }
+	  if (typeof string !== 'string') {
+	    string = '' + string;
+	  }
+
+	  var len = string.length;
+	  if (len === 0) return 0
+
+	  // Use a for loop to avoid recursion
+	  var loweredCase = false;
+	  for (;;) {
+	    switch (encoding) {
+	      case 'ascii':
+	      case 'latin1':
+	      case 'binary':
+	        return len
+	      case 'utf8':
+	      case 'utf-8':
+	      case undefined:
+	        return utf8ToBytes(string).length
+	      case 'ucs2':
+	      case 'ucs-2':
+	      case 'utf16le':
+	      case 'utf-16le':
+	        return len * 2
+	      case 'hex':
+	        return len >>> 1
+	      case 'base64':
+	        return base64ToBytes(string).length
+	      default:
+	        if (loweredCase) return utf8ToBytes(string).length // assume utf8
+	        encoding = ('' + encoding).toLowerCase();
+	        loweredCase = true;
+	    }
+	  }
+	}
+	Buffer.byteLength = byteLength;
+
+	function slowToString (encoding, start, end) {
+	  var loweredCase = false;
+
+	  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
+	  // property of a typed array.
+
+	  // This behaves neither like String nor Uint8Array in that we set start/end
+	  // to their upper/lower bounds if the value passed is out of range.
+	  // undefined is handled specially as per ECMA-262 6th Edition,
+	  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
+	  if (start === undefined || start < 0) {
+	    start = 0;
+	  }
+	  // Return early if start > this.length. Done here to prevent potential uint32
+	  // coercion fail below.
+	  if (start > this.length) {
+	    return ''
+	  }
+
+	  if (end === undefined || end > this.length) {
+	    end = this.length;
+	  }
+
+	  if (end <= 0) {
+	    return ''
+	  }
+
+	  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.
+	  end >>>= 0;
+	  start >>>= 0;
+
+	  if (end <= start) {
+	    return ''
+	  }
+
+	  if (!encoding) encoding = 'utf8';
+
+	  while (true) {
+	    switch (encoding) {
+	      case 'hex':
+	        return hexSlice(this, start, end)
+
+	      case 'utf8':
+	      case 'utf-8':
+	        return utf8Slice(this, start, end)
+
+	      case 'ascii':
+	        return asciiSlice(this, start, end)
+
+	      case 'latin1':
+	      case 'binary':
+	        return latin1Slice(this, start, end)
+
+	      case 'base64':
+	        return base64Slice(this, start, end)
+
+	      case 'ucs2':
+	      case 'ucs-2':
+	      case 'utf16le':
+	      case 'utf-16le':
+	        return utf16leSlice(this, start, end)
+
+	      default:
+	        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
+	        encoding = (encoding + '').toLowerCase();
+	        loweredCase = true;
+	    }
+	  }
+	}
+
+	// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect
+	// Buffer instances.
+	Buffer.prototype._isBuffer = true;
+
+	function swap (b, n, m) {
+	  var i = b[n];
+	  b[n] = b[m];
+	  b[m] = i;
+	}
+
+	Buffer.prototype.swap16 = function swap16 () {
+	  var len = this.length;
+	  if (len % 2 !== 0) {
+	    throw new RangeError('Buffer size must be a multiple of 16-bits')
+	  }
+	  for (var i = 0; i < len; i += 2) {
+	    swap(this, i, i + 1);
+	  }
+	  return this
+	};
+
+	Buffer.prototype.swap32 = function swap32 () {
+	  var len = this.length;
+	  if (len % 4 !== 0) {
+	    throw new RangeError('Buffer size must be a multiple of 32-bits')
+	  }
+	  for (var i = 0; i < len; i += 4) {
+	    swap(this, i, i + 3);
+	    swap(this, i + 1, i + 2);
+	  }
+	  return this
+	};
+
+	Buffer.prototype.swap64 = function swap64 () {
+	  var len = this.length;
+	  if (len % 8 !== 0) {
+	    throw new RangeError('Buffer size must be a multiple of 64-bits')
+	  }
+	  for (var i = 0; i < len; i += 8) {
+	    swap(this, i, i + 7);
+	    swap(this, i + 1, i + 6);
+	    swap(this, i + 2, i + 5);
+	    swap(this, i + 3, i + 4);
+	  }
+	  return this
+	};
+
+	Buffer.prototype.toString = function toString () {
+	  var length = this.length | 0;
+	  if (length === 0) return ''
+	  if (arguments.length === 0) return utf8Slice(this, 0, length)
+	  return slowToString.apply(this, arguments)
+	};
+
+	Buffer.prototype.equals = function equals (b) {
+	  if (!internalIsBuffer(b)) throw new TypeError('Argument must be a Buffer')
+	  if (this === b) return true
+	  return Buffer.compare(this, b) === 0
+	};
+
+	Buffer.prototype.inspect = function inspect () {
+	  var str = '';
+	  var max = INSPECT_MAX_BYTES;
+	  if (this.length > 0) {
+	    str = this.toString('hex', 0, max).match(/.{2}/g).join(' ');
+	    if (this.length > max) str += ' ... ';
+	  }
+	  return '<Buffer ' + str + '>'
+	};
+
+	Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
+	  if (!internalIsBuffer(target)) {
+	    throw new TypeError('Argument must be a Buffer')
+	  }
+
+	  if (start === undefined) {
+	    start = 0;
+	  }
+	  if (end === undefined) {
+	    end = target ? target.length : 0;
+	  }
+	  if (thisStart === undefined) {
+	    thisStart = 0;
+	  }
+	  if (thisEnd === undefined) {
+	    thisEnd = this.length;
+	  }
+
+	  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
+	    throw new RangeError('out of range index')
+	  }
+
+	  if (thisStart >= thisEnd && start >= end) {
+	    return 0
+	  }
+	  if (thisStart >= thisEnd) {
+	    return -1
+	  }
+	  if (start >= end) {
+	    return 1
+	  }
+
+	  start >>>= 0;
+	  end >>>= 0;
+	  thisStart >>>= 0;
+	  thisEnd >>>= 0;
+
+	  if (this === target) return 0
+
+	  var x = thisEnd - thisStart;
+	  var y = end - start;
+	  var len = Math.min(x, y);
+
+	  var thisCopy = this.slice(thisStart, thisEnd);
+	  var targetCopy = target.slice(start, end);
+
+	  for (var i = 0; i < len; ++i) {
+	    if (thisCopy[i] !== targetCopy[i]) {
+	      x = thisCopy[i];
+	      y = targetCopy[i];
+	      break
+	    }
+	  }
+
+	  if (x < y) return -1
+	  if (y < x) return 1
+	  return 0
+	};
+
+	// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
+	// OR the last index of `val` in `buffer` at offset <= `byteOffset`.
+	//
+	// Arguments:
+	// - buffer - a Buffer to search
+	// - val - a string, Buffer, or number
+	// - byteOffset - an index into `buffer`; will be clamped to an int32
+	// - encoding - an optional encoding, relevant is val is a string
+	// - dir - true for indexOf, false for lastIndexOf
+	function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {
+	  // Empty buffer means no match
+	  if (buffer.length === 0) return -1
+
+	  // Normalize byteOffset
+	  if (typeof byteOffset === 'string') {
+	    encoding = byteOffset;
+	    byteOffset = 0;
+	  } else if (byteOffset > 0x7fffffff) {
+	    byteOffset = 0x7fffffff;
+	  } else if (byteOffset < -0x80000000) {
+	    byteOffset = -0x80000000;
+	  }
+	  byteOffset = +byteOffset;  // Coerce to Number.
+	  if (isNaN(byteOffset)) {
+	    // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
+	    byteOffset = dir ? 0 : (buffer.length - 1);
+	  }
+
+	  // Normalize byteOffset: negative offsets start from the end of the buffer
+	  if (byteOffset < 0) byteOffset = buffer.length + byteOffset;
+	  if (byteOffset >= buffer.length) {
+	    if (dir) return -1
+	    else byteOffset = buffer.length - 1;
+	  } else if (byteOffset < 0) {
+	    if (dir) byteOffset = 0;
+	    else return -1
+	  }
+
+	  // Normalize val
+	  if (typeof val === 'string') {
+	    val = Buffer.from(val, encoding);
+	  }
+
+	  // Finally, search either indexOf (if dir is true) or lastIndexOf
+	  if (internalIsBuffer(val)) {
+	    // Special case: looking for empty string/buffer always fails
+	    if (val.length === 0) {
+	      return -1
+	    }
+	    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)
+	  } else if (typeof val === 'number') {
+	    val = val & 0xFF; // Search for a byte value [0-255]
+	    if (Buffer.TYPED_ARRAY_SUPPORT &&
+	        typeof Uint8Array.prototype.indexOf === 'function') {
+	      if (dir) {
+	        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)
+	      } else {
+	        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)
+	      }
+	    }
+	    return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)
+	  }
+
+	  throw new TypeError('val must be string, number or Buffer')
+	}
+
+	function arrayIndexOf (arr, val, byteOffset, encoding, dir) {
+	  var indexSize = 1;
+	  var arrLength = arr.length;
+	  var valLength = val.length;
+
+	  if (encoding !== undefined) {
+	    encoding = String(encoding).toLowerCase();
+	    if (encoding === 'ucs2' || encoding === 'ucs-2' ||
+	        encoding === 'utf16le' || encoding === 'utf-16le') {
+	      if (arr.length < 2 || val.length < 2) {
+	        return -1
+	      }
+	      indexSize = 2;
+	      arrLength /= 2;
+	      valLength /= 2;
+	      byteOffset /= 2;
+	    }
+	  }
+
+	  function read (buf, i) {
+	    if (indexSize === 1) {
+	      return buf[i]
+	    } else {
+	      return buf.readUInt16BE(i * indexSize)
+	    }
+	  }
+
+	  var i;
+	  if (dir) {
+	    var foundIndex = -1;
+	    for (i = byteOffset; i < arrLength; i++) {
+	      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
+	        if (foundIndex === -1) foundIndex = i;
+	        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize
+	      } else {
+	        if (foundIndex !== -1) i -= i - foundIndex;
+	        foundIndex = -1;
+	      }
+	    }
+	  } else {
+	    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;
+	    for (i = byteOffset; i >= 0; i--) {
+	      var found = true;
+	      for (var j = 0; j < valLength; j++) {
+	        if (read(arr, i + j) !== read(val, j)) {
+	          found = false;
+	          break
+	        }
+	      }
+	      if (found) return i
+	    }
+	  }
+
+	  return -1
+	}
+
+	Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
+	  return this.indexOf(val, byteOffset, encoding) !== -1
+	};
+
+	Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
+	  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)
+	};
+
+	Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {
+	  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)
+	};
+
+	function hexWrite (buf, string, offset, length) {
+	  offset = Number(offset) || 0;
+	  var remaining = buf.length - offset;
+	  if (!length) {
+	    length = remaining;
+	  } else {
+	    length = Number(length);
+	    if (length > remaining) {
+	      length = remaining;
+	    }
+	  }
+
+	  // must be an even number of digits
+	  var strLen = string.length;
+	  if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')
+
+	  if (length > strLen / 2) {
+	    length = strLen / 2;
+	  }
+	  for (var i = 0; i < length; ++i) {
+	    var parsed = parseInt(string.substr(i * 2, 2), 16);
+	    if (isNaN(parsed)) return i
+	    buf[offset + i] = parsed;
+	  }
+	  return i
+	}
+
+	function utf8Write (buf, string, offset, length) {
+	  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
+	}
+
+	function asciiWrite (buf, string, offset, length) {
+	  return blitBuffer(asciiToBytes(string), buf, offset, length)
+	}
+
+	function latin1Write (buf, string, offset, length) {
+	  return asciiWrite(buf, string, offset, length)
+	}
+
+	function base64Write (buf, string, offset, length) {
+	  return blitBuffer(base64ToBytes(string), buf, offset, length)
+	}
+
+	function ucs2Write (buf, string, offset, length) {
+	  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
+	}
+
+	Buffer.prototype.write = function write (string, offset, length, encoding) {
+	  // Buffer#write(string)
+	  if (offset === undefined) {
+	    encoding = 'utf8';
+	    length = this.length;
+	    offset = 0;
+	  // Buffer#write(string, encoding)
+	  } else if (length === undefined && typeof offset === 'string') {
+	    encoding = offset;
+	    length = this.length;
+	    offset = 0;
+	  // Buffer#write(string, offset[, length][, encoding])
+	  } else if (isFinite(offset)) {
+	    offset = offset | 0;
+	    if (isFinite(length)) {
+	      length = length | 0;
+	      if (encoding === undefined) encoding = 'utf8';
+	    } else {
+	      encoding = length;
+	      length = undefined;
+	    }
+	  // legacy write(string, encoding, offset, length) - remove in v0.13
+	  } else {
+	    throw new Error(
+	      'Buffer.write(string, encoding, offset[, length]) is no longer supported'
+	    )
+	  }
+
+	  var remaining = this.length - offset;
+	  if (length === undefined || length > remaining) length = remaining;
+
+	  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
+	    throw new RangeError('Attempt to write outside buffer bounds')
+	  }
+
+	  if (!encoding) encoding = 'utf8';
+
+	  var loweredCase = false;
+	  for (;;) {
+	    switch (encoding) {
+	      case 'hex':
+	        return hexWrite(this, string, offset, length)
+
+	      case 'utf8':
+	      case 'utf-8':
+	        return utf8Write(this, string, offset, length)
+
+	      case 'ascii':
+	        return asciiWrite(this, string, offset, length)
+
+	      case 'latin1':
+	      case 'binary':
+	        return latin1Write(this, string, offset, length)
+
+	      case 'base64':
+	        // Warning: maxLength not taken into account in base64Write
+	        return base64Write(this, string, offset, length)
+
+	      case 'ucs2':
+	      case 'ucs-2':
+	      case 'utf16le':
+	      case 'utf-16le':
+	        return ucs2Write(this, string, offset, length)
+
+	      default:
+	        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
+	        encoding = ('' + encoding).toLowerCase();
+	        loweredCase = true;
+	    }
+	  }
+	};
+
+	Buffer.prototype.toJSON = function toJSON () {
+	  return {
+	    type: 'Buffer',
+	    data: Array.prototype.slice.call(this._arr || this, 0)
+	  }
+	};
+
+	function base64Slice (buf, start, end) {
+	  if (start === 0 && end === buf.length) {
+	    return fromByteArray(buf)
+	  } else {
+	    return fromByteArray(buf.slice(start, end))
+	  }
+	}
+
+	function utf8Slice (buf, start, end) {
+	  end = Math.min(buf.length, end);
+	  var res = [];
+
+	  var i = start;
+	  while (i < end) {
+	    var firstByte = buf[i];
+	    var codePoint = null;
+	    var bytesPerSequence = (firstByte > 0xEF) ? 4
+	      : (firstByte > 0xDF) ? 3
+	      : (firstByte > 0xBF) ? 2
+	      : 1;
+
+	    if (i + bytesPerSequence <= end) {
+	      var secondByte, thirdByte, fourthByte, tempCodePoint;
+
+	      switch (bytesPerSequence) {
+	        case 1:
+	          if (firstByte < 0x80) {
+	            codePoint = firstByte;
+	          }
+	          break
+	        case 2:
+	          secondByte = buf[i + 1];
+	          if ((secondByte & 0xC0) === 0x80) {
+	            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F);
+	            if (tempCodePoint > 0x7F) {
+	              codePoint = tempCodePoint;
+	            }
+	          }
+	          break
+	        case 3:
+	          secondByte = buf[i + 1];
+	          thirdByte = buf[i + 2];
+	          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
+	            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F);
+	            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
+	              codePoint = tempCodePoint;
+	            }
+	          }
+	          break
+	        case 4:
+	          secondByte = buf[i + 1];
+	          thirdByte = buf[i + 2];
+	          fourthByte = buf[i + 3];
+	          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
+	            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F);
+	            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
+	              codePoint = tempCodePoint;
+	            }
+	          }
+	      }
+	    }
+
+	    if (codePoint === null) {
+	      // we did not generate a valid codePoint so insert a
+	      // replacement char (U+FFFD) and advance only 1 byte
+	      codePoint = 0xFFFD;
+	      bytesPerSequence = 1;
+	    } else if (codePoint > 0xFFFF) {
+	      // encode to utf16 (surrogate pair dance)
+	      codePoint -= 0x10000;
+	      res.push(codePoint >>> 10 & 0x3FF | 0xD800);
+	      codePoint = 0xDC00 | codePoint & 0x3FF;
+	    }
+
+	    res.push(codePoint);
+	    i += bytesPerSequence;
+	  }
+
+	  return decodeCodePointsArray(res)
+	}
+
+	// Based on http://stackoverflow.com/a/22747272/680742, the browser with
+	// the lowest limit is Chrome, with 0x10000 args.
+	// We go 1 magnitude less, for safety
+	var MAX_ARGUMENTS_LENGTH = 0x1000;
+
+	function decodeCodePointsArray (codePoints) {
+	  var len = codePoints.length;
+	  if (len <= MAX_ARGUMENTS_LENGTH) {
+	    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()
+	  }
+
+	  // Decode in chunks to avoid "call stack size exceeded".
+	  var res = '';
+	  var i = 0;
+	  while (i < len) {
+	    res += String.fromCharCode.apply(
+	      String,
+	      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)
+	    );
+	  }
+	  return res
+	}
+
+	function asciiSlice (buf, start, end) {
+	  var ret = '';
+	  end = Math.min(buf.length, end);
+
+	  for (var i = start; i < end; ++i) {
+	    ret += String.fromCharCode(buf[i] & 0x7F);
+	  }
+	  return ret
+	}
+
+	function latin1Slice (buf, start, end) {
+	  var ret = '';
+	  end = Math.min(buf.length, end);
+
+	  for (var i = start; i < end; ++i) {
+	    ret += String.fromCharCode(buf[i]);
+	  }
+	  return ret
+	}
+
+	function hexSlice (buf, start, end) {
+	  var len = buf.length;
+
+	  if (!start || start < 0) start = 0;
+	  if (!end || end < 0 || end > len) end = len;
+
+	  var out = '';
+	  for (var i = start; i < end; ++i) {
+	    out += toHex(buf[i]);
+	  }
+	  return out
+	}
+
+	function utf16leSlice (buf, start, end) {
+	  var bytes = buf.slice(start, end);
+	  var res = '';
+	  for (var i = 0; i < bytes.length; i += 2) {
+	    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);
+	  }
+	  return res
+	}
+
+	Buffer.prototype.slice = function slice (start, end) {
+	  var len = this.length;
+	  start = ~~start;
+	  end = end === undefined ? len : ~~end;
+
+	  if (start < 0) {
+	    start += len;
+	    if (start < 0) start = 0;
+	  } else if (start > len) {
+	    start = len;
+	  }
+
+	  if (end < 0) {
+	    end += len;
+	    if (end < 0) end = 0;
+	  } else if (end > len) {
+	    end = len;
+	  }
+
+	  if (end < start) end = start;
+
+	  var newBuf;
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    newBuf = this.subarray(start, end);
+	    newBuf.__proto__ = Buffer.prototype;
+	  } else {
+	    var sliceLen = end - start;
+	    newBuf = new Buffer(sliceLen, undefined);
+	    for (var i = 0; i < sliceLen; ++i) {
+	      newBuf[i] = this[i + start];
+	    }
+	  }
+
+	  return newBuf
+	};
+
+	/*
+	 * Need to make sure that buffer isn't trying to write out of bounds.
+	 */
+	function checkOffset (offset, ext, length) {
+	  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
+	  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
+	}
+
+	Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+	  var val = this[offset];
+	  var mul = 1;
+	  var i = 0;
+	  while (++i < byteLength && (mul *= 0x100)) {
+	    val += this[offset + i] * mul;
+	  }
+
+	  return val
+	};
+
+	Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) {
+	    checkOffset(offset, byteLength, this.length);
+	  }
+
+	  var val = this[offset + --byteLength];
+	  var mul = 1;
+	  while (byteLength > 0 && (mul *= 0x100)) {
+	    val += this[offset + --byteLength] * mul;
+	  }
+
+	  return val
+	};
+
+	Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 1, this.length);
+	  return this[offset]
+	};
+
+	Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 2, this.length);
+	  return this[offset] | (this[offset + 1] << 8)
+	};
+
+	Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 2, this.length);
+	  return (this[offset] << 8) | this[offset + 1]
+	};
+
+	Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+
+	  return ((this[offset]) |
+	      (this[offset + 1] << 8) |
+	      (this[offset + 2] << 16)) +
+	      (this[offset + 3] * 0x1000000)
+	};
+
+	Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+
+	  return (this[offset] * 0x1000000) +
+	    ((this[offset + 1] << 16) |
+	    (this[offset + 2] << 8) |
+	    this[offset + 3])
+	};
+
+	Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+	  var val = this[offset];
+	  var mul = 1;
+	  var i = 0;
+	  while (++i < byteLength && (mul *= 0x100)) {
+	    val += this[offset + i] * mul;
+	  }
+	  mul *= 0x80;
+
+	  if (val >= mul) val -= Math.pow(2, 8 * byteLength);
+
+	  return val
+	};
+
+	Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+	  var i = byteLength;
+	  var mul = 1;
+	  var val = this[offset + --i];
+	  while (i > 0 && (mul *= 0x100)) {
+	    val += this[offset + --i] * mul;
+	  }
+	  mul *= 0x80;
+
+	  if (val >= mul) val -= Math.pow(2, 8 * byteLength);
+
+	  return val
+	};
+
+	Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 1, this.length);
+	  if (!(this[offset] & 0x80)) return (this[offset])
+	  return ((0xff - this[offset] + 1) * -1)
+	};
+
+	Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 2, this.length);
+	  var val = this[offset] | (this[offset + 1] << 8);
+	  return (val & 0x8000) ? val | 0xFFFF0000 : val
+	};
+
+	Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 2, this.length);
+	  var val = this[offset + 1] | (this[offset] << 8);
+	  return (val & 0x8000) ? val | 0xFFFF0000 : val
+	};
+
+	Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+
+	  return (this[offset]) |
+	    (this[offset + 1] << 8) |
+	    (this[offset + 2] << 16) |
+	    (this[offset + 3] << 24)
+	};
+
+	Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+
+	  return (this[offset] << 24) |
+	    (this[offset + 1] << 16) |
+	    (this[offset + 2] << 8) |
+	    (this[offset + 3])
+	};
+
+	Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+	  return read(this, offset, true, 23, 4)
+	};
+
+	Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 4, this.length);
+	  return read(this, offset, false, 23, 4)
+	};
+
+	Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 8, this.length);
+	  return read(this, offset, true, 52, 8)
+	};
+
+	Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
+	  if (!noAssert) checkOffset(offset, 8, this.length);
+	  return read(this, offset, false, 52, 8)
+	};
+
+	function checkInt (buf, value, offset, ext, max, min) {
+	  if (!internalIsBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance')
+	  if (value > max || value < min) throw new RangeError('"value" argument is out of bounds')
+	  if (offset + ext > buf.length) throw new RangeError('Index out of range')
+	}
+
+	Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) {
+	    var maxBytes = Math.pow(2, 8 * byteLength) - 1;
+	    checkInt(this, value, offset, byteLength, maxBytes, 0);
+	  }
+
+	  var mul = 1;
+	  var i = 0;
+	  this[offset] = value & 0xFF;
+	  while (++i < byteLength && (mul *= 0x100)) {
+	    this[offset + i] = (value / mul) & 0xFF;
+	  }
+
+	  return offset + byteLength
+	};
+
+	Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  byteLength = byteLength | 0;
+	  if (!noAssert) {
+	    var maxBytes = Math.pow(2, 8 * byteLength) - 1;
+	    checkInt(this, value, offset, byteLength, maxBytes, 0);
+	  }
+
+	  var i = byteLength - 1;
+	  var mul = 1;
+	  this[offset + i] = value & 0xFF;
+	  while (--i >= 0 && (mul *= 0x100)) {
+	    this[offset + i] = (value / mul) & 0xFF;
+	  }
+
+	  return offset + byteLength
+	};
+
+	Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);
+	  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);
+	  this[offset] = (value & 0xff);
+	  return offset + 1
+	};
+
+	function objectWriteUInt16 (buf, value, offset, littleEndian) {
+	  if (value < 0) value = 0xffff + value + 1;
+	  for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {
+	    buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
+	      (littleEndian ? i : 1 - i) * 8;
+	  }
+	}
+
+	Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value & 0xff);
+	    this[offset + 1] = (value >>> 8);
+	  } else {
+	    objectWriteUInt16(this, value, offset, true);
+	  }
+	  return offset + 2
+	};
+
+	Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value >>> 8);
+	    this[offset + 1] = (value & 0xff);
+	  } else {
+	    objectWriteUInt16(this, value, offset, false);
+	  }
+	  return offset + 2
+	};
+
+	function objectWriteUInt32 (buf, value, offset, littleEndian) {
+	  if (value < 0) value = 0xffffffff + value + 1;
+	  for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {
+	    buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff;
+	  }
+	}
+
+	Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset + 3] = (value >>> 24);
+	    this[offset + 2] = (value >>> 16);
+	    this[offset + 1] = (value >>> 8);
+	    this[offset] = (value & 0xff);
+	  } else {
+	    objectWriteUInt32(this, value, offset, true);
+	  }
+	  return offset + 4
+	};
+
+	Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value >>> 24);
+	    this[offset + 1] = (value >>> 16);
+	    this[offset + 2] = (value >>> 8);
+	    this[offset + 3] = (value & 0xff);
+	  } else {
+	    objectWriteUInt32(this, value, offset, false);
+	  }
+	  return offset + 4
+	};
+
+	Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) {
+	    var limit = Math.pow(2, 8 * byteLength - 1);
+
+	    checkInt(this, value, offset, byteLength, limit - 1, -limit);
+	  }
+
+	  var i = 0;
+	  var mul = 1;
+	  var sub = 0;
+	  this[offset] = value & 0xFF;
+	  while (++i < byteLength && (mul *= 0x100)) {
+	    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
+	      sub = 1;
+	    }
+	    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;
+	  }
+
+	  return offset + byteLength
+	};
+
+	Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) {
+	    var limit = Math.pow(2, 8 * byteLength - 1);
+
+	    checkInt(this, value, offset, byteLength, limit - 1, -limit);
+	  }
+
+	  var i = byteLength - 1;
+	  var mul = 1;
+	  var sub = 0;
+	  this[offset + i] = value & 0xFF;
+	  while (--i >= 0 && (mul *= 0x100)) {
+	    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
+	      sub = 1;
+	    }
+	    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF;
+	  }
+
+	  return offset + byteLength
+	};
+
+	Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);
+	  if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);
+	  if (value < 0) value = 0xff + value + 1;
+	  this[offset] = (value & 0xff);
+	  return offset + 1
+	};
+
+	Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value & 0xff);
+	    this[offset + 1] = (value >>> 8);
+	  } else {
+	    objectWriteUInt16(this, value, offset, true);
+	  }
+	  return offset + 2
+	};
+
+	Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value >>> 8);
+	    this[offset + 1] = (value & 0xff);
+	  } else {
+	    objectWriteUInt16(this, value, offset, false);
+	  }
+	  return offset + 2
+	};
+
+	Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value & 0xff);
+	    this[offset + 1] = (value >>> 8);
+	    this[offset + 2] = (value >>> 16);
+	    this[offset + 3] = (value >>> 24);
+	  } else {
+	    objectWriteUInt32(this, value, offset, true);
+	  }
+	  return offset + 4
+	};
+
+	Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
+	  value = +value;
+	  offset = offset | 0;
+	  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);
+	  if (value < 0) value = 0xffffffff + value + 1;
+	  if (Buffer.TYPED_ARRAY_SUPPORT) {
+	    this[offset] = (value >>> 24);
+	    this[offset + 1] = (value >>> 16);
+	    this[offset + 2] = (value >>> 8);
+	    this[offset + 3] = (value & 0xff);
+	  } else {
+	    objectWriteUInt32(this, value, offset, false);
+	  }
+	  return offset + 4
+	};
+
+	function checkIEEE754 (buf, value, offset, ext, max, min) {
+	  if (offset + ext > buf.length) throw new RangeError('Index out of range')
+	  if (offset < 0) throw new RangeError('Index out of range')
+	}
+
+	function writeFloat (buf, value, offset, littleEndian, noAssert) {
+	  if (!noAssert) {
+	    checkIEEE754(buf, value, offset, 4);
+	  }
+	  write(buf, value, offset, littleEndian, 23, 4);
+	  return offset + 4
+	}
+
+	Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
+	  return writeFloat(this, value, offset, true, noAssert)
+	};
+
+	Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
+	  return writeFloat(this, value, offset, false, noAssert)
+	};
+
+	function writeDouble (buf, value, offset, littleEndian, noAssert) {
+	  if (!noAssert) {
+	    checkIEEE754(buf, value, offset, 8);
+	  }
+	  write(buf, value, offset, littleEndian, 52, 8);
+	  return offset + 8
+	}
+
+	Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
+	  return writeDouble(this, value, offset, true, noAssert)
+	};
+
+	Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
+	  return writeDouble(this, value, offset, false, noAssert)
+	};
+
+	// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
+	Buffer.prototype.copy = function copy (target, targetStart, start, end) {
+	  if (!start) start = 0;
+	  if (!end && end !== 0) end = this.length;
+	  if (targetStart >= target.length) targetStart = target.length;
+	  if (!targetStart) targetStart = 0;
+	  if (end > 0 && end < start) end = start;
+
+	  // Copy 0 bytes; we're done
+	  if (end === start) return 0
+	  if (target.length === 0 || this.length === 0) return 0
+
+	  // Fatal error conditions
+	  if (targetStart < 0) {
+	    throw new RangeError('targetStart out of bounds')
+	  }
+	  if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')
+	  if (end < 0) throw new RangeError('sourceEnd out of bounds')
+
+	  // Are we oob?
+	  if (end > this.length) end = this.length;
+	  if (target.length - targetStart < end - start) {
+	    end = target.length - targetStart + start;
+	  }
+
+	  var len = end - start;
+	  var i;
+
+	  if (this === target && start < targetStart && targetStart < end) {
+	    // descending copy from end
+	    for (i = len - 1; i >= 0; --i) {
+	      target[i + targetStart] = this[i + start];
+	    }
+	  } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {
+	    // ascending copy from start
+	    for (i = 0; i < len; ++i) {
+	      target[i + targetStart] = this[i + start];
+	    }
+	  } else {
+	    Uint8Array.prototype.set.call(
+	      target,
+	      this.subarray(start, start + len),
+	      targetStart
+	    );
+	  }
+
+	  return len
+	};
+
+	// Usage:
+	//    buffer.fill(number[, offset[, end]])
+	//    buffer.fill(buffer[, offset[, end]])
+	//    buffer.fill(string[, offset[, end]][, encoding])
+	Buffer.prototype.fill = function fill (val, start, end, encoding) {
+	  // Handle string cases:
+	  if (typeof val === 'string') {
+	    if (typeof start === 'string') {
+	      encoding = start;
+	      start = 0;
+	      end = this.length;
+	    } else if (typeof end === 'string') {
+	      encoding = end;
+	      end = this.length;
+	    }
+	    if (val.length === 1) {
+	      var code = val.charCodeAt(0);
+	      if (code < 256) {
+	        val = code;
+	      }
+	    }
+	    if (encoding !== undefined && typeof encoding !== 'string') {
+	      throw new TypeError('encoding must be a string')
+	    }
+	    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
+	      throw new TypeError('Unknown encoding: ' + encoding)
+	    }
+	  } else if (typeof val === 'number') {
+	    val = val & 255;
+	  }
+
+	  // Invalid ranges are not set to a default, so can range check early.
+	  if (start < 0 || this.length < start || this.length < end) {
+	    throw new RangeError('Out of range index')
+	  }
+
+	  if (end <= start) {
+	    return this
+	  }
+
+	  start = start >>> 0;
+	  end = end === undefined ? this.length : end >>> 0;
+
+	  if (!val) val = 0;
+
+	  var i;
+	  if (typeof val === 'number') {
+	    for (i = start; i < end; ++i) {
+	      this[i] = val;
+	    }
+	  } else {
+	    var bytes = internalIsBuffer(val)
+	      ? val
+	      : utf8ToBytes(new Buffer(val, encoding).toString());
+	    var len = bytes.length;
+	    for (i = 0; i < end - start; ++i) {
+	      this[i + start] = bytes[i % len];
+	    }
+	  }
+
+	  return this
+	};
+
+	// HELPER FUNCTIONS
+	// ================
+
+	var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g;
+
+	function base64clean (str) {
+	  // Node strips out invalid characters like \n and \t from the string, base64-js does not
+	  str = stringtrim(str).replace(INVALID_BASE64_RE, '');
+	  // Node converts strings with length < 2 to ''
+	  if (str.length < 2) return ''
+	  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
+	  while (str.length % 4 !== 0) {
+	    str = str + '=';
+	  }
+	  return str
+	}
+
+	function stringtrim (str) {
+	  if (str.trim) return str.trim()
+	  return str.replace(/^\s+|\s+$/g, '')
+	}
+
+	function toHex (n) {
+	  if (n < 16) return '0' + n.toString(16)
+	  return n.toString(16)
+	}
+
+	function utf8ToBytes (string, units) {
+	  units = units || Infinity;
+	  var codePoint;
+	  var length = string.length;
+	  var leadSurrogate = null;
+	  var bytes = [];
+
+	  for (var i = 0; i < length; ++i) {
+	    codePoint = string.charCodeAt(i);
+
+	    // is surrogate component
+	    if (codePoint > 0xD7FF && codePoint < 0xE000) {
+	      // last char was a lead
+	      if (!leadSurrogate) {
+	        // no lead yet
+	        if (codePoint > 0xDBFF) {
+	          // unexpected trail
+	          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
+	          continue
+	        } else if (i + 1 === length) {
+	          // unpaired lead
+	          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
+	          continue
+	        }
+
+	        // valid lead
+	        leadSurrogate = codePoint;
+
+	        continue
+	      }
+
+	      // 2 leads in a row
+	      if (codePoint < 0xDC00) {
+	        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
+	        leadSurrogate = codePoint;
+	        continue
+	      }
+
+	      // valid surrogate pair
+	      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000;
+	    } else if (leadSurrogate) {
+	      // valid bmp char, but last char was a lead
+	      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD);
+	    }
+
+	    leadSurrogate = null;
+
+	    // encode utf8
+	    if (codePoint < 0x80) {
+	      if ((units -= 1) < 0) break
+	      bytes.push(codePoint);
+	    } else if (codePoint < 0x800) {
+	      if ((units -= 2) < 0) break
+	      bytes.push(
+	        codePoint >> 0x6 | 0xC0,
+	        codePoint & 0x3F | 0x80
+	      );
+	    } else if (codePoint < 0x10000) {
+	      if ((units -= 3) < 0) break
+	      bytes.push(
+	        codePoint >> 0xC | 0xE0,
+	        codePoint >> 0x6 & 0x3F | 0x80,
+	        codePoint & 0x3F | 0x80
+	      );
+	    } else if (codePoint < 0x110000) {
+	      if ((units -= 4) < 0) break
+	      bytes.push(
+	        codePoint >> 0x12 | 0xF0,
+	        codePoint >> 0xC & 0x3F | 0x80,
+	        codePoint >> 0x6 & 0x3F | 0x80,
+	        codePoint & 0x3F | 0x80
+	      );
+	    } else {
+	      throw new Error('Invalid code point')
+	    }
+	  }
+
+	  return bytes
+	}
+
+	function asciiToBytes (str) {
+	  var byteArray = [];
+	  for (var i = 0; i < str.length; ++i) {
+	    // Node's code seems to be doing this and not & 0x7F..
+	    byteArray.push(str.charCodeAt(i) & 0xFF);
+	  }
+	  return byteArray
+	}
+
+	function utf16leToBytes (str, units) {
+	  var c, hi, lo;
+	  var byteArray = [];
+	  for (var i = 0; i < str.length; ++i) {
+	    if ((units -= 2) < 0) break
+
+	    c = str.charCodeAt(i);
+	    hi = c >> 8;
+	    lo = c % 256;
+	    byteArray.push(lo);
+	    byteArray.push(hi);
+	  }
+
+	  return byteArray
+	}
+
+
+	function base64ToBytes (str) {
+	  return toByteArray(base64clean(str))
+	}
+
+	function blitBuffer (src, dst, offset, length) {
+	  for (var i = 0; i < length; ++i) {
+	    if ((i + offset >= dst.length) || (i >= src.length)) break
+	    dst[i + offset] = src[i];
+	  }
+	  return i
+	}
+
+	function isnan (val) {
+	  return val !== val // eslint-disable-line no-self-compare
+	}
+
+
+	// the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence
+	// The _isBuffer check is for Safari 5-7 support, because it's missing
+	// Object.prototype.constructor. Remove this eventually
+	function isBuffer(obj) {
+	  return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj))
+	}
+
+	function isFastBuffer (obj) {
+	  return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)
+	}
+
+	// For Node v0.10 support. Remove this eventually.
+	function isSlowBuffer (obj) {
+	  return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0))
+	}
+
+	// shim for using process in browser
+	if (typeof global.setTimeout === 'function') ;
+	if (typeof global.clearTimeout === 'function') ;
+
+	// from https://github.com/kumavis/browser-process-hrtime/blob/master/index.js
+	var performance = global.performance || {};
+	var performanceNow =
+	  performance.now        ||
+	  performance.mozNow     ||
+	  performance.msNow      ||
+	  performance.oNow       ||
+	  performance.webkitNow  ||
+	  function(){ return (new Date()).getTime() };
+
+	var inherits;
+	if (typeof Object.create === 'function'){
+	  inherits = function inherits(ctor, superCtor) {
+	    // implementation from standard node.js 'util' module
+	    ctor.super_ = superCtor;
+	    ctor.prototype = Object.create(superCtor.prototype, {
+	      constructor: {
+	        value: ctor,
+	        enumerable: false,
+	        writable: true,
+	        configurable: true
+	      }
+	    });
+	  };
+	} else {
+	  inherits = function inherits(ctor, superCtor) {
+	    ctor.super_ = superCtor;
+	    var TempCtor = function () {};
+	    TempCtor.prototype = superCtor.prototype;
+	    ctor.prototype = new TempCtor();
+	    ctor.prototype.constructor = ctor;
+	  };
+	}
+	var inherits$1 = inherits;
+
+	// Copyright Joyent, Inc. and other Node contributors.
+
+
+	/**
+	 * Echos the value of a value. Trys to print the value out
+	 * in the best way possible given the different types.
+	 *
+	 * @param {Object} obj The object to print out.
+	 * @param {Object} opts Optional options object that alters the output.
+	 */
+	/* legacy: obj, showHidden, depth, colors*/
+	function inspect(obj, opts) {
+	  // default options
+	  var ctx = {
+	    seen: [],
+	    stylize: stylizeNoColor
+	  };
+	  // legacy...
+	  if (arguments.length >= 3) ctx.depth = arguments[2];
+	  if (arguments.length >= 4) ctx.colors = arguments[3];
+	  if (isBoolean(opts)) {
+	    // legacy...
+	    ctx.showHidden = opts;
+	  } else if (opts) {
+	    // got an "options" object
+	    _extend(ctx, opts);
+	  }
+	  // set default options
+	  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
+	  if (isUndefined(ctx.depth)) ctx.depth = 2;
+	  if (isUndefined(ctx.colors)) ctx.colors = false;
+	  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
+	  if (ctx.colors) ctx.stylize = stylizeWithColor;
+	  return formatValue(ctx, obj, ctx.depth);
+	}
+
+	// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
+	inspect.colors = {
+	  'bold' : [1, 22],
+	  'italic' : [3, 23],
+	  'underline' : [4, 24],
+	  'inverse' : [7, 27],
+	  'white' : [37, 39],
+	  'grey' : [90, 39],
+	  'black' : [30, 39],
+	  'blue' : [34, 39],
+	  'cyan' : [36, 39],
+	  'green' : [32, 39],
+	  'magenta' : [35, 39],
+	  'red' : [31, 39],
+	  'yellow' : [33, 39]
+	};
+
+	// Don't use 'blue' not visible on cmd.exe
+	inspect.styles = {
+	  'special': 'cyan',
+	  'number': 'yellow',
+	  'boolean': 'yellow',
+	  'undefined': 'grey',
+	  'null': 'bold',
+	  'string': 'green',
+	  'date': 'magenta',
+	  // "name": intentionally not styling
+	  'regexp': 'red'
+	};
+
+
+	function stylizeWithColor(str, styleType) {
+	  var style = inspect.styles[styleType];
+
+	  if (style) {
+	    return '\u001b[' + inspect.colors[style][0] + 'm' + str +
+	           '\u001b[' + inspect.colors[style][1] + 'm';
+	  } else {
+	    return str;
+	  }
+	}
+
+
+	function stylizeNoColor(str, styleType) {
+	  return str;
+	}
+
+
+	function arrayToHash(array) {
+	  var hash = {};
+
+	  array.forEach(function(val, idx) {
+	    hash[val] = true;
+	  });
+
+	  return hash;
+	}
+
+
+	function formatValue(ctx, value, recurseTimes) {
+	  // Provide a hook for user-specified inspect functions.
+	  // Check that value is an object with an inspect function on it
+	  if (ctx.customInspect &&
+	      value &&
+	      isFunction(value.inspect) &&
+	      // Filter out the util module, it's inspect function is special
+	      value.inspect !== inspect &&
+	      // Also filter out any prototype objects using the circular check.
+	      !(value.constructor && value.constructor.prototype === value)) {
+	    var ret = value.inspect(recurseTimes, ctx);
+	    if (!isString(ret)) {
+	      ret = formatValue(ctx, ret, recurseTimes);
+	    }
+	    return ret;
+	  }
+
+	  // Primitive types cannot have properties
+	  var primitive = formatPrimitive(ctx, value);
+	  if (primitive) {
+	    return primitive;
+	  }
+
+	  // Look up the keys of the object.
+	  var keys = Object.keys(value);
+	  var visibleKeys = arrayToHash(keys);
+
+	  if (ctx.showHidden) {
+	    keys = Object.getOwnPropertyNames(value);
+	  }
+
+	  // IE doesn't make error fields non-enumerable
+	  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
+	  if (isError(value)
+	      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
+	    return formatError(value);
+	  }
+
+	  // Some type of object without properties can be shortcutted.
+	  if (keys.length === 0) {
+	    if (isFunction(value)) {
+	      var name = value.name ? ': ' + value.name : '';
+	      return ctx.stylize('[Function' + name + ']', 'special');
+	    }
+	    if (isRegExp(value)) {
+	      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
+	    }
+	    if (isDate(value)) {
+	      return ctx.stylize(Date.prototype.toString.call(value), 'date');
+	    }
+	    if (isError(value)) {
+	      return formatError(value);
+	    }
+	  }
+
+	  var base = '', array = false, braces = ['{', '}'];
+
+	  // Make Array say that they are Array
+	  if (isArray$1(value)) {
+	    array = true;
+	    braces = ['[', ']'];
+	  }
+
+	  // Make functions say that they are functions
+	  if (isFunction(value)) {
+	    var n = value.name ? ': ' + value.name : '';
+	    base = ' [Function' + n + ']';
+	  }
+
+	  // Make RegExps say that they are RegExps
+	  if (isRegExp(value)) {
+	    base = ' ' + RegExp.prototype.toString.call(value);
+	  }
+
+	  // Make dates with properties first say the date
+	  if (isDate(value)) {
+	    base = ' ' + Date.prototype.toUTCString.call(value);
+	  }
+
+	  // Make error with message first say the error
+	  if (isError(value)) {
+	    base = ' ' + formatError(value);
+	  }
+
+	  if (keys.length === 0 && (!array || value.length == 0)) {
+	    return braces[0] + base + braces[1];
+	  }
+
+	  if (recurseTimes < 0) {
+	    if (isRegExp(value)) {
+	      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
+	    } else {
+	      return ctx.stylize('[Object]', 'special');
+	    }
+	  }
+
+	  ctx.seen.push(value);
+
+	  var output;
+	  if (array) {
+	    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
+	  } else {
+	    output = keys.map(function(key) {
+	      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
+	    });
+	  }
+
+	  ctx.seen.pop();
+
+	  return reduceToSingleString(output, base, braces);
+	}
+
+
+	function formatPrimitive(ctx, value) {
+	  if (isUndefined(value))
+	    return ctx.stylize('undefined', 'undefined');
+	  if (isString(value)) {
+	    var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
+	                                             .replace(/'/g, "\\'")
+	                                             .replace(/\\"/g, '"') + '\'';
+	    return ctx.stylize(simple, 'string');
+	  }
+	  if (isNumber(value))
+	    return ctx.stylize('' + value, 'number');
+	  if (isBoolean(value))
+	    return ctx.stylize('' + value, 'boolean');
+	  // For some reason typeof null is "object", so special case here.
+	  if (isNull(value))
+	    return ctx.stylize('null', 'null');
+	}
+
+
+	function formatError(value) {
+	  return '[' + Error.prototype.toString.call(value) + ']';
+	}
+
+
+	function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
+	  var output = [];
+	  for (var i = 0, l = value.length; i < l; ++i) {
+	    if (hasOwnProperty(value, String(i))) {
+	      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
+	          String(i), true));
+	    } else {
+	      output.push('');
+	    }
+	  }
+	  keys.forEach(function(key) {
+	    if (!key.match(/^\d+$/)) {
+	      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
+	          key, true));
+	    }
+	  });
+	  return output;
+	}
+
+
+	function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
+	  var name, str, desc;
+	  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
+	  if (desc.get) {
+	    if (desc.set) {
+	      str = ctx.stylize('[Getter/Setter]', 'special');
+	    } else {
+	      str = ctx.stylize('[Getter]', 'special');
+	    }
+	  } else {
+	    if (desc.set) {
+	      str = ctx.stylize('[Setter]', 'special');
+	    }
+	  }
+	  if (!hasOwnProperty(visibleKeys, key)) {
+	    name = '[' + key + ']';
+	  }
+	  if (!str) {
+	    if (ctx.seen.indexOf(desc.value) < 0) {
+	      if (isNull(recurseTimes)) {
+	        str = formatValue(ctx, desc.value, null);
+	      } else {
+	        str = formatValue(ctx, desc.value, recurseTimes - 1);
+	      }
+	      if (str.indexOf('\n') > -1) {
+	        if (array) {
+	          str = str.split('\n').map(function(line) {
+	            return '  ' + line;
+	          }).join('\n').substr(2);
+	        } else {
+	          str = '\n' + str.split('\n').map(function(line) {
+	            return '   ' + line;
+	          }).join('\n');
+	        }
+	      }
+	    } else {
+	      str = ctx.stylize('[Circular]', 'special');
+	    }
+	  }
+	  if (isUndefined(name)) {
+	    if (array && key.match(/^\d+$/)) {
+	      return str;
+	    }
+	    name = JSON.stringify('' + key);
+	    if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
+	      name = name.substr(1, name.length - 2);
+	      name = ctx.stylize(name, 'name');
+	    } else {
+	      name = name.replace(/'/g, "\\'")
+	                 .replace(/\\"/g, '"')
+	                 .replace(/(^"|"$)/g, "'");
+	      name = ctx.stylize(name, 'string');
+	    }
+	  }
+
+	  return name + ': ' + str;
+	}
+
+
+	function reduceToSingleString(output, base, braces) {
+	  var length = output.reduce(function(prev, cur) {
+	    if (cur.indexOf('\n') >= 0) ;
+	    return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
+	  }, 0);
+
+	  if (length > 60) {
+	    return braces[0] +
+	           (base === '' ? '' : base + '\n ') +
+	           ' ' +
+	           output.join(',\n  ') +
+	           ' ' +
+	           braces[1];
+	  }
+
+	  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
+	}
+
+
+	// NOTE: These type checking functions intentionally don't use `instanceof`
+	// because it is fragile and can be easily faked with `Object.create()`.
+	function isArray$1(ar) {
+	  return Array.isArray(ar);
+	}
+
+	function isBoolean(arg) {
+	  return typeof arg === 'boolean';
+	}
+
+	function isNull(arg) {
+	  return arg === null;
+	}
+
+	function isNumber(arg) {
+	  return typeof arg === 'number';
+	}
+
+	function isString(arg) {
+	  return typeof arg === 'string';
+	}
+
+	function isUndefined(arg) {
+	  return arg === void 0;
+	}
+
+	function isRegExp(re) {
+	  return isObject(re) && objectToString(re) === '[object RegExp]';
+	}
+
+	function isObject(arg) {
+	  return typeof arg === 'object' && arg !== null;
+	}
+
+	function isDate(d) {
+	  return isObject(d) && objectToString(d) === '[object Date]';
+	}
+
+	function isError(e) {
+	  return isObject(e) &&
+	      (objectToString(e) === '[object Error]' || e instanceof Error);
+	}
+
+	function isFunction(arg) {
+	  return typeof arg === 'function';
+	}
+
+	function isPrimitive(arg) {
+	  return arg === null ||
+	         typeof arg === 'boolean' ||
+	         typeof arg === 'number' ||
+	         typeof arg === 'string' ||
+	         typeof arg === 'symbol' ||  // ES6 symbol
+	         typeof arg === 'undefined';
+	}
+
+	function objectToString(o) {
+	  return Object.prototype.toString.call(o);
+	}
+
+	function _extend(origin, add) {
+	  // Don't do anything if add isn't an object
+	  if (!add || !isObject(add)) return origin;
+
+	  var keys = Object.keys(add);
+	  var i = keys.length;
+	  while (i--) {
+	    origin[keys[i]] = add[keys[i]];
+	  }
+	  return origin;
+	}
+	function hasOwnProperty(obj, prop) {
+	  return Object.prototype.hasOwnProperty.call(obj, prop);
+	}
+
+	function compare(a, b) {
+	  if (a === b) {
+	    return 0;
+	  }
+
+	  var x = a.length;
+	  var y = b.length;
+
+	  for (var i = 0, len = Math.min(x, y); i < len; ++i) {
+	    if (a[i] !== b[i]) {
+	      x = a[i];
+	      y = b[i];
+	      break;
+	    }
+	  }
+
+	  if (x < y) {
+	    return -1;
+	  }
+	  if (y < x) {
+	    return 1;
+	  }
+	  return 0;
+	}
+	var hasOwn = Object.prototype.hasOwnProperty;
+
+	var objectKeys = Object.keys || function (obj) {
+	  var keys = [];
+	  for (var key in obj) {
+	    if (hasOwn.call(obj, key)) keys.push(key);
+	  }
+	  return keys;
+	};
+	var pSlice = Array.prototype.slice;
+	var _functionsHaveNames;
+	function functionsHaveNames() {
+	  if (typeof _functionsHaveNames !== 'undefined') {
+	    return _functionsHaveNames;
+	  }
+	  return _functionsHaveNames = (function () {
+	    return function foo() {}.name === 'foo';
+	  }());
+	}
+	function pToString (obj) {
+	  return Object.prototype.toString.call(obj);
+	}
+	function isView(arrbuf) {
+	  if (isBuffer(arrbuf)) {
+	    return false;
+	  }
+	  if (typeof global.ArrayBuffer !== 'function') {
+	    return false;
+	  }
+	  if (typeof ArrayBuffer.isView === 'function') {
+	    return ArrayBuffer.isView(arrbuf);
+	  }
+	  if (!arrbuf) {
+	    return false;
+	  }
+	  if (arrbuf instanceof DataView) {
+	    return true;
+	  }
+	  if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {
+	    return true;
+	  }
+	  return false;
+	}
+	// 1. The assert module provides functions that throw
+	// AssertionError's when particular conditions are not met. The
+	// assert module must conform to the following interface.
+
+	function assert(value, message) {
+	  if (!value) fail(value, true, message, '==', ok);
+	}
+
+	// 2. The AssertionError is defined in assert.
+	// new assert.AssertionError({ message: message,
+	//                             actual: actual,
+	//                             expected: expected })
+
+	var regex = /\s*function\s+([^\(\s]*)\s*/;
+	// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js
+	function getName(func) {
+	  if (!isFunction(func)) {
+	    return;
+	  }
+	  if (functionsHaveNames()) {
+	    return func.name;
+	  }
+	  var str = func.toString();
+	  var match = str.match(regex);
+	  return match && match[1];
+	}
+	assert.AssertionError = AssertionError;
+	function AssertionError(options) {
+	  this.name = 'AssertionError';
+	  this.actual = options.actual;
+	  this.expected = options.expected;
+	  this.operator = options.operator;
+	  if (options.message) {
+	    this.message = options.message;
+	    this.generatedMessage = false;
+	  } else {
+	    this.message = getMessage(this);
+	    this.generatedMessage = true;
+	  }
+	  var stackStartFunction = options.stackStartFunction || fail;
+	  if (Error.captureStackTrace) {
+	    Error.captureStackTrace(this, stackStartFunction);
+	  } else {
+	    // non v8 browsers so we can have a stacktrace
+	    var err = new Error();
+	    if (err.stack) {
+	      var out = err.stack;
+
+	      // try to strip useless frames
+	      var fn_name = getName(stackStartFunction);
+	      var idx = out.indexOf('\n' + fn_name);
+	      if (idx >= 0) {
+	        // once we have located the function frame
+	        // we need to strip out everything before it (and its line)
+	        var next_line = out.indexOf('\n', idx + 1);
+	        out = out.substring(next_line + 1);
+	      }
+
+	      this.stack = out;
+	    }
+	  }
+	}
+
+	// assert.AssertionError instanceof Error
+	inherits$1(AssertionError, Error);
+
+	function truncate(s, n) {
+	  if (typeof s === 'string') {
+	    return s.length < n ? s : s.slice(0, n);
+	  } else {
+	    return s;
+	  }
+	}
+	function inspect$1(something) {
+	  if (functionsHaveNames() || !isFunction(something)) {
+	    return inspect(something);
+	  }
+	  var rawname = getName(something);
+	  var name = rawname ? ': ' + rawname : '';
+	  return '[Function' +  name + ']';
+	}
+	function getMessage(self) {
+	  return truncate(inspect$1(self.actual), 128) + ' ' +
+	         self.operator + ' ' +
+	         truncate(inspect$1(self.expected), 128);
+	}
+
+	// At present only the three keys mentioned above are used and
+	// understood by the spec. Implementations or sub modules can pass
+	// other keys to the AssertionError's constructor - they will be
+	// ignored.
+
+	// 3. All of the following functions must throw an AssertionError
+	// when a corresponding condition is not met, with a message that
+	// may be undefined if not provided.  All assertion methods provide
+	// both the actual and expected values to the assertion error for
+	// display purposes.
+
+	function fail(actual, expected, message, operator, stackStartFunction) {
+	  throw new AssertionError({
+	    message: message,
+	    actual: actual,
+	    expected: expected,
+	    operator: operator,
+	    stackStartFunction: stackStartFunction
+	  });
+	}
+
+	// EXTENSION! allows for well behaved errors defined elsewhere.
+	assert.fail = fail;
+
+	// 4. Pure assertion tests whether a value is truthy, as determined
+	// by !!guard.
+	// assert.ok(guard, message_opt);
+	// This statement is equivalent to assert.equal(true, !!guard,
+	// message_opt);. To test strictly for the value true, use
+	// assert.strictEqual(true, guard, message_opt);.
+
+	function ok(value, message) {
+	  if (!value) fail(value, true, message, '==', ok);
+	}
+	assert.ok = ok;
+
+	// 5. The equality assertion tests shallow, coercive equality with
+	// ==.
+	// assert.equal(actual, expected, message_opt);
+	assert.equal = equal;
+	function equal(actual, expected, message) {
+	  if (actual != expected) fail(actual, expected, message, '==', equal);
+	}
+
+	// 6. The non-equality assertion tests for whether two objects are not equal
+	// with != assert.notEqual(actual, expected, message_opt);
+	assert.notEqual = notEqual;
+	function notEqual(actual, expected, message) {
+	  if (actual == expected) {
+	    fail(actual, expected, message, '!=', notEqual);
+	  }
+	}
+
+	// 7. The equivalence assertion tests a deep equality relation.
+	// assert.deepEqual(actual, expected, message_opt);
+	assert.deepEqual = deepEqual;
+	function deepEqual(actual, expected, message) {
+	  if (!_deepEqual(actual, expected, false)) {
+	    fail(actual, expected, message, 'deepEqual', deepEqual);
+	  }
+	}
+	assert.deepStrictEqual = deepStrictEqual;
+	function deepStrictEqual(actual, expected, message) {
+	  if (!_deepEqual(actual, expected, true)) {
+	    fail(actual, expected, message, 'deepStrictEqual', deepStrictEqual);
+	  }
+	}
+
+	function _deepEqual(actual, expected, strict, memos) {
+	  // 7.1. All identical values are equivalent, as determined by ===.
+	  if (actual === expected) {
+	    return true;
+	  } else if (isBuffer(actual) && isBuffer(expected)) {
+	    return compare(actual, expected) === 0;
+
+	  // 7.2. If the expected value is a Date object, the actual value is
+	  // equivalent if it is also a Date object that refers to the same time.
+	  } else if (isDate(actual) && isDate(expected)) {
+	    return actual.getTime() === expected.getTime();
+
+	  // 7.3 If the expected value is a RegExp object, the actual value is
+	  // equivalent if it is also a RegExp object with the same source and
+	  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
+	  } else if (isRegExp(actual) && isRegExp(expected)) {
+	    return actual.source === expected.source &&
+	           actual.global === expected.global &&
+	           actual.multiline === expected.multiline &&
+	           actual.lastIndex === expected.lastIndex &&
+	           actual.ignoreCase === expected.ignoreCase;
+
+	  // 7.4. Other pairs that do not both pass typeof value == 'object',
+	  // equivalence is determined by ==.
+	  } else if ((actual === null || typeof actual !== 'object') &&
+	             (expected === null || typeof expected !== 'object')) {
+	    return strict ? actual === expected : actual == expected;
+
+	  // If both values are instances of typed arrays, wrap their underlying
+	  // ArrayBuffers in a Buffer each to increase performance
+	  // This optimization requires the arrays to have the same type as checked by
+	  // Object.prototype.toString (aka pToString). Never perform binary
+	  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their
+	  // bit patterns are not identical.
+	  } else if (isView(actual) && isView(expected) &&
+	             pToString(actual) === pToString(expected) &&
+	             !(actual instanceof Float32Array ||
+	               actual instanceof Float64Array)) {
+	    return compare(new Uint8Array(actual.buffer),
+	                   new Uint8Array(expected.buffer)) === 0;
+
+	  // 7.5 For all other Object pairs, including Array objects, equivalence is
+	  // determined by having the same number of owned properties (as verified
+	  // with Object.prototype.hasOwnProperty.call), the same set of keys
+	  // (although not necessarily the same order), equivalent values for every
+	  // corresponding key, and an identical 'prototype' property. Note: this
+	  // accounts for both named and indexed properties on Arrays.
+	  } else if (isBuffer(actual) !== isBuffer(expected)) {
+	    return false;
+	  } else {
+	    memos = memos || {actual: [], expected: []};
+
+	    var actualIndex = memos.actual.indexOf(actual);
+	    if (actualIndex !== -1) {
+	      if (actualIndex === memos.expected.indexOf(expected)) {
+	        return true;
+	      }
+	    }
+
+	    memos.actual.push(actual);
+	    memos.expected.push(expected);
+
+	    return objEquiv(actual, expected, strict, memos);
+	  }
+	}
+
+	function isArguments(object) {
+	  return Object.prototype.toString.call(object) == '[object Arguments]';
+	}
+
+	function objEquiv(a, b, strict, actualVisitedObjects) {
+	  if (a === null || a === undefined || b === null || b === undefined)
+	    return false;
+	  // if one is a primitive, the other must be same
+	  if (isPrimitive(a) || isPrimitive(b))
+	    return a === b;
+	  if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))
+	    return false;
+	  var aIsArgs = isArguments(a);
+	  var bIsArgs = isArguments(b);
+	  if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
+	    return false;
+	  if (aIsArgs) {
+	    a = pSlice.call(a);
+	    b = pSlice.call(b);
+	    return _deepEqual(a, b, strict);
+	  }
+	  var ka = objectKeys(a);
+	  var kb = objectKeys(b);
+	  var key, i;
+	  // having the same number of owned properties (keys incorporates
+	  // hasOwnProperty)
+	  if (ka.length !== kb.length)
+	    return false;
+	  //the same set of keys (although not necessarily the same order),
+	  ka.sort();
+	  kb.sort();
+	  //~~~cheap key test
+	  for (i = ka.length - 1; i >= 0; i--) {
+	    if (ka[i] !== kb[i])
+	      return false;
+	  }
+	  //equivalent values for every corresponding key, and
+	  //~~~possibly expensive deep test
+	  for (i = ka.length - 1; i >= 0; i--) {
+	    key = ka[i];
+	    if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))
+	      return false;
+	  }
+	  return true;
+	}
+
+	// 8. The non-equivalence assertion tests for any deep inequality.
+	// assert.notDeepEqual(actual, expected, message_opt);
+	assert.notDeepEqual = notDeepEqual;
+	function notDeepEqual(actual, expected, message) {
+	  if (_deepEqual(actual, expected, false)) {
+	    fail(actual, expected, message, 'notDeepEqual', notDeepEqual);
+	  }
+	}
+
+	assert.notDeepStrictEqual = notDeepStrictEqual;
+	function notDeepStrictEqual(actual, expected, message) {
+	  if (_deepEqual(actual, expected, true)) {
+	    fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);
+	  }
+	}
+
+
+	// 9. The strict equality assertion tests strict equality, as determined by ===.
+	// assert.strictEqual(actual, expected, message_opt);
+	assert.strictEqual = strictEqual;
+	function strictEqual(actual, expected, message) {
+	  if (actual !== expected) {
+	    fail(actual, expected, message, '===', strictEqual);
+	  }
+	}
+
+	// 10. The strict non-equality assertion tests for strict inequality, as
+	// determined by !==.  assert.notStrictEqual(actual, expected, message_opt);
+	assert.notStrictEqual = notStrictEqual;
+	function notStrictEqual(actual, expected, message) {
+	  if (actual === expected) {
+	    fail(actual, expected, message, '!==', notStrictEqual);
+	  }
+	}
+
+	function expectedException(actual, expected) {
+	  if (!actual || !expected) {
+	    return false;
+	  }
+
+	  if (Object.prototype.toString.call(expected) == '[object RegExp]') {
+	    return expected.test(actual);
+	  }
+
+	  try {
+	    if (actual instanceof expected) {
+	      return true;
+	    }
+	  } catch (e) {
+	    // Ignore.  The instanceof check doesn't work for arrow functions.
+	  }
+
+	  if (Error.isPrototypeOf(expected)) {
+	    return false;
+	  }
+
+	  return expected.call({}, actual) === true;
+	}
+
+	function _tryBlock(block) {
+	  var error;
+	  try {
+	    block();
+	  } catch (e) {
+	    error = e;
+	  }
+	  return error;
+	}
+
+	function _throws(shouldThrow, block, expected, message) {
+	  var actual;
+
+	  if (typeof block !== 'function') {
+	    throw new TypeError('"block" argument must be a function');
+	  }
+
+	  if (typeof expected === 'string') {
+	    message = expected;
+	    expected = null;
+	  }
+
+	  actual = _tryBlock(block);
+
+	  message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +
+	            (message ? ' ' + message : '.');
+
+	  if (shouldThrow && !actual) {
+	    fail(actual, expected, 'Missing expected exception' + message);
+	  }
+
+	  var userProvidedMessage = typeof message === 'string';
+	  var isUnwantedException = !shouldThrow && isError(actual);
+	  var isUnexpectedException = !shouldThrow && actual && !expected;
+
+	  if ((isUnwantedException &&
+	      userProvidedMessage &&
+	      expectedException(actual, expected)) ||
+	      isUnexpectedException) {
+	    fail(actual, expected, 'Got unwanted exception' + message);
+	  }
+
+	  if ((shouldThrow && actual && expected &&
+	      !expectedException(actual, expected)) || (!shouldThrow && actual)) {
+	    throw actual;
+	  }
+	}
+
+	// 11. Expected to throw an error:
+	// assert.throws(block, Error_opt, message_opt);
+	assert.throws = throws;
+	function throws(block, /*optional*/error, /*optional*/message) {
+	  _throws(true, block, error, message);
+	}
+
+	// EXTENSION! This is annoying to write outside this module.
+	assert.doesNotThrow = doesNotThrow;
+	function doesNotThrow(block, /*optional*/error, /*optional*/message) {
+	  _throws(false, block, error, message);
+	}
+
+	assert.ifError = ifError;
+	function ifError(err) {
+	  if (err) throw err;
+	}
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	var encode = function (number) {
+	  if (0 <= number && number < intToCharMap.length) {
+	    return intToCharMap[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+
+	/**
+	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+	 * failure.
+	 */
+	var decode = function (charCode) {
+	  var bigA = 65;     // 'A'
+	  var bigZ = 90;     // 'Z'
+
+	  var littleA = 97;  // 'a'
+	  var littleZ = 122; // 'z'
+
+	  var zero = 48;     // '0'
+	  var nine = 57;     // '9'
+
+	  var plus = 43;     // '+'
+	  var slash = 47;    // '/'
+
+	  var littleOffset = 26;
+	  var numberOffset = 52;
+
+	  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+	  if (bigA <= charCode && charCode <= bigZ) {
+	    return (charCode - bigA);
+	  }
+
+	  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+	  if (littleA <= charCode && charCode <= littleZ) {
+	    return (charCode - littleA + littleOffset);
+	  }
+
+	  // 52 - 61: 0123456789
+	  if (zero <= charCode && charCode <= nine) {
+	    return (charCode - zero + numberOffset);
+	  }
+
+	  // 62: +
+	  if (charCode == plus) {
+	    return 62;
+	  }
+
+	  // 63: /
+	  if (charCode == slash) {
+	    return 63;
+	  }
+
+	  // Invalid base64 digit.
+	  return -1;
+	};
+
+	var base64 = {
+		encode: encode,
+		decode: decode
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+
+
+
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+
+	var VLQ_BASE_SHIFT = 5;
+
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	var encode$1 = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+
+	  var vlq = toVLQSigned(aValue);
+
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+
+	  return encoded;
+	};
+
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	var decode$1 = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+
+	var base64Vlq = {
+		encode: encode$1,
+		decode: decode$1
+	};
+
+	var util = createCommonjsModule(function (module, exports) {
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  } else {
+	    throw new Error('"' + aName + '" is a required argument.');
+	  }
+	}
+	exports.getArg = getArg;
+
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+
+	function urlParse(aUrl) {
+	  var match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+
+	function urlGenerate(aParsedUrl) {
+	  var url = '';
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ':';
+	  }
+	  url += '//';
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + '@';
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port;
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	function normalize(aPath) {
+	  var path = aPath;
+	  var url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  var isAbsolute = exports.isAbsolute(path);
+
+	  var parts = path.split(/\/+/);
+	  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+	    part = parts[i];
+	    if (part === '.') {
+	      parts.splice(i, 1);
+	    } else if (part === '..') {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === '') {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join('/');
+
+	  if (path === '') {
+	    path = isAbsolute ? '/' : '.';
+	  }
+
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	}
+	exports.normalize = normalize;
+
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  var aPathUrl = urlParse(aPath);
+	  var aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || '/';
+	  }
+
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+
+	  var joined = aPath.charAt(0) === '/'
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+
+	exports.isAbsolute = function (aPath) {
+	  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+	};
+
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+
+	  aRoot = aRoot.replace(/\/$/, '');
+
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  var level = 0;
+	  while (aPath.indexOf(aRoot + '/') !== 0) {
+	    var index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+
+	    ++level;
+	  }
+
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+
+	var supportsNullProto = (function () {
+	  var obj = Object.create(null);
+	  return !('__proto__' in obj);
+	}());
+
+	function identity (s) {
+	  return s;
+	}
+
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return '$' + aStr;
+	  }
+
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+
+	  var length = s.length;
+
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+
+	  for (var i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+
+	  return true;
+	}
+
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  var cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+
+	  return -1;
+	}
+
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || '';
+
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+	      sourceRoot += '/';
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    var parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      var index = parsed.path.lastIndexOf('/');
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+	});
+	var util_1 = util.getArg;
+	var util_2 = util.urlParse;
+	var util_3 = util.urlGenerate;
+	var util_4 = util.normalize;
+	var util_5 = util.join;
+	var util_6 = util.isAbsolute;
+	var util_7 = util.relative;
+	var util_8 = util.toSetString;
+	var util_9 = util.fromSetString;
+	var util_10 = util.compareByOriginalPositions;
+	var util_11 = util.compareByGeneratedPositionsDeflated;
+	var util_12 = util.compareByGeneratedPositionsInflated;
+	var util_13 = util.parseSourceMapInput;
+	var util_14 = util.computeSourceURL;
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+
+	var ArraySet_1 = ArraySet;
+
+	var arraySet = {
+		ArraySet: ArraySet_1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter(mappingA, mappingB) {
+	  // Optimized for most common case
+	  var lineA = mappingA.generatedLine;
+	  var lineB = mappingB.generatedLine;
+	  var columnA = mappingA.generatedColumn;
+	  var columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a neglibable overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	function MappingList() {
+	  this._array = [];
+	  this._sorted = true;
+	  // Serves as infimum
+	  this._last = {generatedLine: -1, generatedColumn: 0};
+	}
+
+	/**
+	 * Iterate through internal items. This method takes the same arguments that
+	 * `Array.prototype.forEach` takes.
+	 *
+	 * NOTE: The order of the mappings is NOT guaranteed.
+	 */
+	MappingList.prototype.unsortedForEach =
+	  function MappingList_forEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  };
+
+	/**
+	 * Add the given source mapping.
+	 *
+	 * @param Object aMapping
+	 */
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+	  if (generatedPositionAfter(this._last, aMapping)) {
+	    this._last = aMapping;
+	    this._array.push(aMapping);
+	  } else {
+	    this._sorted = false;
+	    this._array.push(aMapping);
+	  }
+	};
+
+	/**
+	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+	 * generated position.
+	 *
+	 * WARNING: This method returns internal data without copying, for
+	 * performance. The return value must NOT be mutated, and should be treated as
+	 * an immutable borrow. If you want to take ownership, you must make your own
+	 * copy.
+	 */
+	MappingList.prototype.toArray = function MappingList_toArray() {
+	  if (!this._sorted) {
+	    this._array.sort(util.compareByGeneratedPositionsInflated);
+	    this._sorted = true;
+	  }
+	  return this._array;
+	};
+
+	var MappingList_1 = MappingList;
+
+	var mappingList = {
+		MappingList: MappingList_1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	var ArraySet$1 = arraySet.ArraySet;
+	var MappingList$1 = mappingList.MappingList;
+
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	function SourceMapGenerator(aArgs) {
+	  if (!aArgs) {
+	    aArgs = {};
+	  }
+	  this._file = util.getArg(aArgs, 'file', null);
+	  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+	  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+	  this._sources = new ArraySet$1();
+	  this._names = new ArraySet$1();
+	  this._mappings = new MappingList$1();
+	  this._sourcesContents = null;
+	}
+
+	SourceMapGenerator.prototype._version = 3;
+
+	/**
+	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	 *
+	 * @param aSourceMapConsumer The SourceMap.
+	 */
+	SourceMapGenerator.fromSourceMap =
+	  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+	    var sourceRoot = aSourceMapConsumer.sourceRoot;
+	    var generator = new SourceMapGenerator({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot: sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      var newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util.relative(sourceRoot, newMapping.source);
+	        }
+
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util.relative(sourceRoot, sourceFile);
+	      }
+
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  };
+
+	/**
+	 * Add a single mapping from original source line and column to the generated
+	 * source's line and column for this source map being created. The mapping
+	 * object should have the following properties:
+	 *
+	 *   - generated: An object with the generated line and column positions.
+	 *   - original: An object with the original line and column positions.
+	 *   - source: The original source file (relative to the sourceRoot).
+	 *   - name: An optional original token name for this mapping.
+	 */
+	SourceMapGenerator.prototype.addMapping =
+	  function SourceMapGenerator_addMapping(aArgs) {
+	    var generated = util.getArg(aArgs, 'generated');
+	    var original = util.getArg(aArgs, 'original', null);
+	    var source = util.getArg(aArgs, 'source', null);
+	    var name = util.getArg(aArgs, 'name', null);
+
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source: source,
+	      name: name
+	    });
+	  };
+
+	/**
+	 * Set the source content for a source file.
+	 */
+	SourceMapGenerator.prototype.setSourceContent =
+	  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+	    var source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util.relative(this._sourceRoot, source);
+	    }
+
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  };
+
+	/**
+	 * Applies the mappings of a sub-source-map for a specific source file to the
+	 * source map being generated. Each mapping to the supplied source file is
+	 * rewritten using the supplied source map. Note: The resolution for the
+	 * resulting mappings is the minimium of this map and the supplied map.
+	 *
+	 * @param aSourceMapConsumer The source map to be applied.
+	 * @param aSourceFile Optional. The filename of the source file.
+	 *        If omitted, SourceMapConsumer's file property will be used.
+	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	 *        This parameter is needed when the two source maps aren't in the same
+	 *        directory, and the source map to be applied contains relative source
+	 *        paths. If so, those relative source paths need to be rewritten
+	 *        relative to the SourceMapGenerator.
+	 */
+	SourceMapGenerator.prototype.applySourceMap =
+	  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    var sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    var sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    var newSources = new ArraySet$1();
+	    var newNames = new ArraySet$1();
+
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function (mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        var original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util.join(aSourceMapPath, mapping.source);
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+
+	      var source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+
+	      var name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          sourceFile = util.join(aSourceMapPath, sourceFile);
+	        }
+	        if (sourceRoot != null) {
+	          sourceFile = util.relative(sourceRoot, sourceFile);
+	        }
+	        this.setSourceContent(sourceFile, content);
+	      }
+	    }, this);
+	  };
+
+	/**
+	 * A mapping can have one of the three levels of data:
+	 *
+	 *   1. Just the generated position.
+	 *   2. The Generated position, original position, and original source.
+	 *   3. Generated and original position, original source, as well as a name
+	 *      token.
+	 *
+	 * To maintain consistency, we validate that any new mapping being added falls
+	 * in to one of these categories.
+	 */
+	SourceMapGenerator.prototype._validateMapping =
+	  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+	                                              aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+	        throw new Error(
+	            'original.line and original.column are not numbers -- you probably meant to omit ' +
+	            'the original mapping entirely and only map the generated position. If so, pass ' +
+	            'null for the original mapping instead of an object with empty or null values.'
+	        );
+	    }
+
+	    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) {
+	      // Case 1.
+	      return;
+	    }
+	    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) {
+	      // Cases 2 and 3.
+	      return;
+	    }
+	    else {
+	      throw new Error('Invalid mapping: ' + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  };
+
+	/**
+	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	 * specified by the source map format.
+	 */
+	SourceMapGenerator.prototype._serializeMappings =
+	  function SourceMapGenerator_serializeMappings() {
+	    var previousGeneratedColumn = 0;
+	    var previousGeneratedLine = 1;
+	    var previousOriginalColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousName = 0;
+	    var previousSource = 0;
+	    var result = '';
+	    var next;
+	    var mapping;
+	    var nameIdx;
+	    var sourceIdx;
+
+	    var mappings = this._mappings.toArray();
+	    for (var i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = '';
+
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ';';
+	          previousGeneratedLine++;
+	        }
+	      }
+	      else {
+	        if (i > 0) {
+	          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	            continue;
+	          }
+	          next += ',';
+	        }
+	      }
+
+	      next += base64Vlq.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64Vlq.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64Vlq.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+
+	        next += base64Vlq.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64Vlq.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+
+	      result += next;
+	    }
+
+	    return result;
+	  };
+
+	SourceMapGenerator.prototype._generateSourcesContent =
+	  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function (source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util.relative(aSourceRoot, source);
+	      }
+	      var key = util.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  };
+
+	/**
+	 * Externalize the source map.
+	 */
+	SourceMapGenerator.prototype.toJSON =
+	  function SourceMapGenerator_toJSON() {
+	    var map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+
+	    return map;
+	  };
+
+	/**
+	 * Render the source map being generated to a string.
+	 */
+	SourceMapGenerator.prototype.toString =
+	  function SourceMapGenerator_toString() {
+	    return JSON.stringify(this.toJSON());
+	  };
+
+	var SourceMapGenerator_1 = SourceMapGenerator;
+
+	var sourceMapGenerator = {
+		SourceMapGenerator: SourceMapGenerator_1
+	};
+
+	var binarySearch = createCommonjsModule(function (module, exports) {
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  }
+	  else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    } else {
+	      return mid;
+	    }
+	  }
+	  else {
+	    // Our needle is less than aHaystack[mid].
+	    if (mid - aLow > 1) {
+	      // The element is in the lower half.
+	      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return mid;
+	    } else {
+	      return aLow < 0 ? -1 : aLow;
+	    }
+	  }
+	}
+
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+
+	  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+
+	  return index;
+	};
+	});
+	var binarySearch_1 = binarySearch.GREATEST_LOWER_BOUND;
+	var binarySearch_2 = binarySearch.LEAST_UPPER_BOUND;
+	var binarySearch_3 = binarySearch.search;
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	// It turns out that some (most?) JavaScript engines don't self-host
+	// `Array.prototype.sort`. This makes sense because C++ will likely remain
+	// faster than JS when doing raw CPU-intensive sorting. However, when using a
+	// custom comparator function, calling back and forth between the VM's C++ and
+	// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+	// worse generated code for the comparator function than would be optimal. In
+	// fact, when sorting with a comparator, these costs outweigh the benefits of
+	// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+	// a ~3500ms mean speed-up in `bench/bench.html`.
+
+	/**
+	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+	 *
+	 * @param {Array} ary
+	 *        The array.
+	 * @param {Number} x
+	 *        The index of the first item.
+	 * @param {Number} y
+	 *        The index of the second item.
+	 */
+	function swap$1(ary, x, y) {
+	  var temp = ary[x];
+	  ary[x] = ary[y];
+	  ary[y] = temp;
+	}
+
+	/**
+	 * Returns a random integer within the range `low .. high` inclusive.
+	 *
+	 * @param {Number} low
+	 *        The lower bound on the range.
+	 * @param {Number} high
+	 *        The upper bound on the range.
+	 */
+	function randomIntInRange(low, high) {
+	  return Math.round(low + (Math.random() * (high - low)));
+	}
+
+	/**
+	 * The Quick Sort algorithm.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 * @param {Number} p
+	 *        Start index of the array
+	 * @param {Number} r
+	 *        End index of the array
+	 */
+	function doQuickSort(ary, comparator, p, r) {
+	  // If our lower bound is less than our upper bound, we (1) partition the
+	  // array into two pieces and (2) recurse on each half. If it is not, this is
+	  // the empty array and our base case.
+
+	  if (p < r) {
+	    // (1) Partitioning.
+	    //
+	    // The partitioning chooses a pivot between `p` and `r` and moves all
+	    // elements that are less than or equal to the pivot to the before it, and
+	    // all the elements that are greater than it after it. The effect is that
+	    // once partition is done, the pivot is in the exact place it will be when
+	    // the array is put in sorted order, and it will not need to be moved
+	    // again. This runs in O(n) time.
+
+	    // Always choose a random pivot so that an input array which is reverse
+	    // sorted does not cause O(n^2) running time.
+	    var pivotIndex = randomIntInRange(p, r);
+	    var i = p - 1;
+
+	    swap$1(ary, pivotIndex, r);
+	    var pivot = ary[r];
+
+	    // Immediately after `j` is incremented in this loop, the following hold
+	    // true:
+	    //
+	    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+	    //
+	    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+	    for (var j = p; j < r; j++) {
+	      if (comparator(ary[j], pivot) <= 0) {
+	        i += 1;
+	        swap$1(ary, i, j);
+	      }
+	    }
+
+	    swap$1(ary, i + 1, j);
+	    var q = i + 1;
+
+	    // (2) Recurse on each half.
+
+	    doQuickSort(ary, comparator, p, q - 1);
+	    doQuickSort(ary, comparator, q + 1, r);
+	  }
+	}
+
+	/**
+	 * Sort the given array in-place with the given comparator function.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 */
+	var quickSort_1 = function (ary, comparator) {
+	  doQuickSort(ary, comparator, 0, ary.length - 1);
+	};
+
+	var quickSort = {
+		quickSort: quickSort_1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	var ArraySet$2 = arraySet.ArraySet;
+
+	var quickSort$1 = quickSort.quickSort;
+
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  return sourceMap.sections != null
+	    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+	    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	};
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer.prototype._version = 3;
+
+	// `__generatedMappings` and `__originalMappings` are arrays that hold the
+	// parsed mapping coordinates from the source map's "mappings" attribute. They
+	// are lazily instantiated, accessed via the `_generatedMappings` and
+	// `_originalMappings` getters respectively, and we only parse the mappings
+	// and create these arrays once queried for a source location. We jump through
+	// these hoops because there can be many thousands of mappings, and parsing
+	// them is expensive, so we only want to do it if we must.
+	//
+	// Each object in the arrays is of the form:
+	//
+	//     {
+	//       generatedLine: The line number in the generated code,
+	//       generatedColumn: The column number in the generated code,
+	//       source: The path to the original source file that generated this
+	//               chunk of code,
+	//       originalLine: The line number in the original source that
+	//                     corresponds to this chunk of generated code,
+	//       originalColumn: The column number in the original source that
+	//                       corresponds to this chunk of generated code,
+	//       name: The name of the original symbol which generated this chunk of
+	//             code.
+	//     }
+	//
+	// All properties except for `generatedLine` and `generatedColumn` can be
+	// `null`.
+	//
+	// `_generatedMappings` is ordered by the generated positions.
+	//
+	// `_originalMappings` is ordered by the original positions.
+
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__generatedMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__generatedMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__originalMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__originalMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype._charIsMappingSeparator =
+	  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+	    var c = aStr.charAt(index);
+	    return c === ";" || c === ",";
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	SourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  };
+
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Iterate over each mapping between an original source/line/column and a
+	 * generated line/column in this source map.
+	 *
+	 * @param Function aCallback
+	 *        The function that is called with each mapping.
+	 * @param Object aContext
+	 *        Optional. If specified, this object will be the value of `this` every
+	 *        time that `aCallback` is called.
+	 * @param aOrder
+	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	 *        iterate over the mappings sorted by the generated file's line/column
+	 *        order or the original's source/line/column order, respectively. Defaults to
+	 *        `SourceMapConsumer.GENERATED_ORDER`.
+	 */
+	SourceMapConsumer.prototype.eachMapping =
+	  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+	    var context = aContext || null;
+	    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+	    var mappings;
+	    switch (order) {
+	    case SourceMapConsumer.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+
+	    var sourceRoot = this.sourceRoot;
+	    mappings.map(function (mapping) {
+	      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+	      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      return {
+	        source: source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  };
+
+	/**
+	 * Returns all generated line and column information for the original source,
+	 * line, and column provided. If no column is provided, returns all mappings
+	 * corresponding to a either the line we are searching for or the next
+	 * closest line that has any mappings. Otherwise, returns all mappings
+	 * corresponding to the given line and either the column we are searching for
+	 * or the next closest column that has any offsets.
+	 *
+	 * The only argument is an object with the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number is 1-based.
+	 *   - column: Optional. the column number in the original source.
+	 *    The column number is 0-based.
+	 *
+	 * and an array of objects is returned, each with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *    line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *    The column number is 0-based.
+	 */
+	SourceMapConsumer.prototype.allGeneratedPositionsFor =
+	  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+	    var line = util.getArg(aArgs, 'line');
+
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    var needle = {
+	      source: util.getArg(aArgs, 'source'),
+	      originalLine: line,
+	      originalColumn: util.getArg(aArgs, 'column', 0)
+	    };
+
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+
+	    var mappings = [];
+
+	    var index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util.compareByOriginalPositions,
+	                                  binarySearch.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (aArgs.column === undefined) {
+	        var originalLine = mapping.originalLine;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        var originalColumn = mapping.originalColumn;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+
+	    return mappings;
+	  };
+
+	var SourceMapConsumer_1 = SourceMapConsumer;
+
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sources = util.getArg(sourceMap, 'sources');
+	  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	  // requires the array) to play nice here.
+	  var names = util.getArg(sourceMap, 'names', []);
+	  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+	  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+	  var mappings = util.getArg(sourceMap, 'mappings');
+	  var file = util.getArg(sourceMap, 'file', null);
+
+	  // Once again, Sass deviates from the spec and supplies the version as a
+	  // string rather than a number, so we use loose equality checking here.
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  if (sourceRoot) {
+	    sourceRoot = util.normalize(sourceRoot);
+	  }
+
+	  sources = sources
+	    .map(String)
+	    // Some source maps produce relative source paths like "./foo.js" instead of
+	    // "foo.js".  Normalize these first so that future comparisons will succeed.
+	    // See bugzil.la/1090768.
+	    .map(util.normalize)
+	    // Always ensure that absolute sources are internally stored relative to
+	    // the source root, if the source root is absolute. Not doing this would
+	    // be particularly problematic when the source root is a prefix of the
+	    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	    .map(function (source) {
+	      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+	        ? util.relative(sourceRoot, source)
+	        : source;
+	    });
+
+	  // Pass `true` below to allow duplicate names and sources. While source maps
+	  // are intended to be compressed and deduplicated, the TypeScript compiler
+	  // sometimes generates source maps with duplicates in them. See Github issue
+	  // #72 and bugzil.la/889492.
+	  this._names = ArraySet$2.fromArray(names.map(String), true);
+	  this._sources = ArraySet$2.fromArray(sources, true);
+
+	  this._absoluteSources = this._sources.toArray().map(function (s) {
+	    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	  });
+
+	  this.sourceRoot = sourceRoot;
+	  this.sourcesContent = sourcesContent;
+	  this._mappings = mappings;
+	  this._sourceMapURL = aSourceMapURL;
+	  this.file = file;
+	}
+
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+
+	/**
+	 * Utility function to find the index of a source.  Returns -1 if not
+	 * found.
+	 */
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+	  var relativeSource = aSource;
+	  if (this.sourceRoot != null) {
+	    relativeSource = util.relative(this.sourceRoot, relativeSource);
+	  }
+
+	  if (this._sources.has(relativeSource)) {
+	    return this._sources.indexOf(relativeSource);
+	  }
+
+	  // Maybe aSource is an absolute URL as returned by |sources|.  In
+	  // this case we can't simply undo the transform.
+	  var i;
+	  for (i = 0; i < this._absoluteSources.length; ++i) {
+	    if (this._absoluteSources[i] == aSource) {
+	      return i;
+	    }
+	  }
+
+	  return -1;
+	};
+
+	/**
+	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	 *
+	 * @param SourceMapGenerator aSourceMap
+	 *        The source map that will be consumed.
+	 * @param String aSourceMapURL
+	 *        The URL at which the source map can be found (optional)
+	 * @returns BasicSourceMapConsumer
+	 */
+	BasicSourceMapConsumer.fromSourceMap =
+	  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+	    var smc = Object.create(BasicSourceMapConsumer.prototype);
+
+	    var names = smc._names = ArraySet$2.fromArray(aSourceMap._names.toArray(), true);
+	    var sources = smc._sources = ArraySet$2.fromArray(aSourceMap._sources.toArray(), true);
+	    smc.sourceRoot = aSourceMap._sourceRoot;
+	    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+	                                                            smc.sourceRoot);
+	    smc.file = aSourceMap._file;
+	    smc._sourceMapURL = aSourceMapURL;
+	    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+	      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+	    });
+
+	    // Because we are modifying the entries (by converting string sources and
+	    // names to indices into the sources and names ArraySets), we have to make
+	    // a copy of the entry or else bad things happen. Shared mutable state
+	    // strikes again! See github issue #191.
+
+	    var generatedMappings = aSourceMap._mappings.toArray().slice();
+	    var destGeneratedMappings = smc.__generatedMappings = [];
+	    var destOriginalMappings = smc.__originalMappings = [];
+
+	    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+	      var srcMapping = generatedMappings[i];
+	      var destMapping = new Mapping;
+	      destMapping.generatedLine = srcMapping.generatedLine;
+	      destMapping.generatedColumn = srcMapping.generatedColumn;
+
+	      if (srcMapping.source) {
+	        destMapping.source = sources.indexOf(srcMapping.source);
+	        destMapping.originalLine = srcMapping.originalLine;
+	        destMapping.originalColumn = srcMapping.originalColumn;
+
+	        if (srcMapping.name) {
+	          destMapping.name = names.indexOf(srcMapping.name);
+	        }
+
+	        destOriginalMappings.push(destMapping);
+	      }
+
+	      destGeneratedMappings.push(destMapping);
+	    }
+
+	    quickSort$1(smc.__originalMappings, util.compareByOriginalPositions);
+
+	    return smc;
+	  };
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	BasicSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    return this._absoluteSources.slice();
+	  }
+	});
+
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	BasicSourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    var generatedLine = 1;
+	    var previousGeneratedColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousOriginalColumn = 0;
+	    var previousSource = 0;
+	    var previousName = 0;
+	    var length = aStr.length;
+	    var index = 0;
+	    var cachedSegments = {};
+	    var temp = {};
+	    var originalMappings = [];
+	    var generatedMappings = [];
+	    var mapping, str, segment, end, value;
+
+	    while (index < length) {
+	      if (aStr.charAt(index) === ';') {
+	        generatedLine++;
+	        index++;
+	        previousGeneratedColumn = 0;
+	      }
+	      else if (aStr.charAt(index) === ',') {
+	        index++;
+	      }
+	      else {
+	        mapping = new Mapping();
+	        mapping.generatedLine = generatedLine;
+
+	        // Because each offset is encoded relative to the previous one,
+	        // many segments often have the same encoding. We can exploit this
+	        // fact by caching the parsed variable length fields of each segment,
+	        // allowing us to avoid a second parse if we encounter the same
+	        // segment again.
+	        for (end = index; end < length; end++) {
+	          if (this._charIsMappingSeparator(aStr, end)) {
+	            break;
+	          }
+	        }
+	        str = aStr.slice(index, end);
+
+	        segment = cachedSegments[str];
+	        if (segment) {
+	          index += str.length;
+	        } else {
+	          segment = [];
+	          while (index < end) {
+	            base64Vlq.decode(aStr, index, temp);
+	            value = temp.value;
+	            index = temp.rest;
+	            segment.push(value);
+	          }
+
+	          if (segment.length === 2) {
+	            throw new Error('Found a source, but no line and column');
+	          }
+
+	          if (segment.length === 3) {
+	            throw new Error('Found a source and line, but no column');
+	          }
+
+	          cachedSegments[str] = segment;
+	        }
+
+	        // Generated column.
+	        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+	        previousGeneratedColumn = mapping.generatedColumn;
+
+	        if (segment.length > 1) {
+	          // Original source.
+	          mapping.source = previousSource + segment[1];
+	          previousSource += segment[1];
+
+	          // Original line.
+	          mapping.originalLine = previousOriginalLine + segment[2];
+	          previousOriginalLine = mapping.originalLine;
+	          // Lines are stored 0-based
+	          mapping.originalLine += 1;
+
+	          // Original column.
+	          mapping.originalColumn = previousOriginalColumn + segment[3];
+	          previousOriginalColumn = mapping.originalColumn;
+
+	          if (segment.length > 4) {
+	            // Original name.
+	            mapping.name = previousName + segment[4];
+	            previousName += segment[4];
+	          }
+	        }
+
+	        generatedMappings.push(mapping);
+	        if (typeof mapping.originalLine === 'number') {
+	          originalMappings.push(mapping);
+	        }
+	      }
+	    }
+
+	    quickSort$1(generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = generatedMappings;
+
+	    quickSort$1(originalMappings, util.compareByOriginalPositions);
+	    this.__originalMappings = originalMappings;
+	  };
+
+	/**
+	 * Find the mapping that best matches the hypothetical "needle" mapping that
+	 * we are searching for in the given "haystack" of mappings.
+	 */
+	BasicSourceMapConsumer.prototype._findMapping =
+	  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+	                                         aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError('Line must be greater than or equal to 1, got '
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError('Column must be greater than or equal to 0, got '
+	                          + aNeedle[aColumnName]);
+	    }
+
+	    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	  };
+
+	/**
+	 * Compute the last column for each generated mapping. The last column is
+	 * inclusive.
+	 */
+	BasicSourceMapConsumer.prototype.computeColumnSpans =
+	  function SourceMapConsumer_computeColumnSpans() {
+	    for (var index = 0; index < this._generatedMappings.length; ++index) {
+	      var mapping = this._generatedMappings[index];
+
+	      // Mappings do not contain a field for the last generated columnt. We
+	      // can come up with an optimistic estimate, however, by assuming that
+	      // mappings are contiguous (i.e. given two consecutive mappings, the
+	      // first mapping ends where the second one starts).
+	      if (index + 1 < this._generatedMappings.length) {
+	        var nextMapping = this._generatedMappings[index + 1];
+
+	        if (mapping.generatedLine === nextMapping.generatedLine) {
+	          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+	          continue;
+	        }
+	      }
+
+	      // The last mapping for each line spans the entire line.
+	      mapping.lastGeneratedColumn = Infinity;
+	    }
+	  };
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	BasicSourceMapConsumer.prototype.originalPositionFor =
+	  function SourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._generatedMappings,
+	      "generatedLine",
+	      "generatedColumn",
+	      util.compareByGeneratedPositionsDeflated,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._generatedMappings[index];
+
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        var source = util.getArg(mapping, 'source', null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+	        var name = util.getArg(mapping, 'name', null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+	        return {
+	          source: source,
+	          line: util.getArg(mapping, 'originalLine', null),
+	          column: util.getArg(mapping, 'originalColumn', null),
+	          name: name
+	        };
+	      }
+	    }
+
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function (sc) { return sc == null; });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	BasicSourceMapConsumer.prototype.sourceContentFor =
+	  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+
+	    var index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+
+	    var relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util.relative(this.sourceRoot, relativeSource);
+	    }
+
+	    var url;
+	    if (this.sourceRoot != null
+	        && (url = util.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+	      }
+
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	BasicSourceMapConsumer.prototype.generatedPositionFor =
+	  function SourceMapConsumer_generatedPositionFor(aArgs) {
+	    var source = util.getArg(aArgs, 'source');
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+
+	    var needle = {
+	      source: source,
+	      originalLine: util.getArg(aArgs, 'line'),
+	      originalColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._originalMappings,
+	      "originalLine",
+	      "originalColumn",
+	      util.compareByOriginalPositions,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (mapping.source === needle.source) {
+	        return {
+	          line: util.getArg(mapping, 'generatedLine', null),
+	          column: util.getArg(mapping, 'generatedColumn', null),
+	          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	        };
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  };
+
+	var BasicSourceMapConsumer_1 = BasicSourceMapConsumer;
+
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sections = util.getArg(sourceMap, 'sections');
+
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  this._sources = new ArraySet$2();
+	  this._names = new ArraySet$2();
+
+	  var lastOffset = {
+	    line: -1,
+	    column: 0
+	  };
+	  this._sections = sections.map(function (s) {
+	    if (s.url) {
+	      // The url field will require support for asynchronicity.
+	      // See https://github.com/mozilla/source-map/issues/16
+	      throw new Error('Support for url field in sections not implemented.');
+	    }
+	    var offset = util.getArg(s, 'offset');
+	    var offsetLine = util.getArg(offset, 'line');
+	    var offsetColumn = util.getArg(offset, 'column');
+
+	    if (offsetLine < lastOffset.line ||
+	        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	      throw new Error('Section offsets must be ordered and non-overlapping.');
+	    }
+	    lastOffset = offset;
+
+	    return {
+	      generatedOffset: {
+	        // The offset fields are 0-based, but we use 1-based indices when
+	        // encoding/decoding from VLQ.
+	        generatedLine: offsetLine + 1,
+	        generatedColumn: offsetColumn + 1
+	      },
+	      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+	    }
+	  });
+	}
+
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	IndexedSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    var sources = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+	});
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	IndexedSourceMapConsumer.prototype.originalPositionFor =
+	  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    var sectionIndex = binarySearch.search(needle, this._sections,
+	      function(needle, section) {
+	        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+
+	        return (needle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    var section = this._sections[sectionIndex];
+
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+	    return this._sections.every(function (s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	IndexedSourceMapConsumer.prototype.sourceContentFor =
+	  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      var content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + aSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based. 
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	IndexedSourceMapConsumer.prototype.generatedPositionFor =
+	  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+	        continue;
+	      }
+	      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        var ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	IndexedSourceMapConsumer.prototype._parseMappings =
+	  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    this.__generatedMappings = [];
+	    this.__originalMappings = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	      var sectionMappings = section.consumer._generatedMappings;
+	      for (var j = 0; j < sectionMappings.length; j++) {
+	        var mapping = sectionMappings[j];
+
+	        var source = section.consumer._sources.at(mapping.source);
+	        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+
+	        var name = null;
+	        if (mapping.name) {
+	          name = section.consumer._names.at(mapping.name);
+	          this._names.add(name);
+	          name = this._names.indexOf(name);
+	        }
+
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        var adjustedMapping = {
+	          source: source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name: name
+	        };
+
+	        this.__generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === 'number') {
+	          this.__originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+
+	    quickSort$1(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    quickSort$1(this.__originalMappings, util.compareByOriginalPositions);
+	  };
+
+	var IndexedSourceMapConsumer_1 = IndexedSourceMapConsumer;
+
+	var sourceMapConsumer = {
+		SourceMapConsumer: SourceMapConsumer_1,
+		BasicSourceMapConsumer: BasicSourceMapConsumer_1,
+		IndexedSourceMapConsumer: IndexedSourceMapConsumer_1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var SourceMapGenerator$1 = sourceMapGenerator.SourceMapGenerator;
+
+
+	// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+	// operating systems these days (capturing the result).
+	var REGEX_NEWLINE = /(\r?\n)/;
+
+	// Newline character code for charCodeAt() comparisons
+	var NEWLINE_CODE = 10;
+
+	// Private symbol for identifying `SourceNode`s when multiple versions of
+	// the source-map library are loaded. This MUST NOT CHANGE across
+	// versions!
+	var isSourceNode = "$$$isSourceNode$$$";
+
+	/**
+	 * SourceNodes provide a way to abstract over interpolating/concatenating
+	 * snippets of generated JavaScript source code while maintaining the line and
+	 * column information associated with the original source code.
+	 *
+	 * @param aLine The original line number.
+	 * @param aColumn The original column number.
+	 * @param aSource The original source's filename.
+	 * @param aChunks Optional. An array of strings which are snippets of
+	 *        generated JS, or other SourceNodes.
+	 * @param aName The original identifier.
+	 */
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+	  this.children = [];
+	  this.sourceContents = {};
+	  this.line = aLine == null ? null : aLine;
+	  this.column = aColumn == null ? null : aColumn;
+	  this.source = aSource == null ? null : aSource;
+	  this.name = aName == null ? null : aName;
+	  this[isSourceNode] = true;
+	  if (aChunks != null) this.add(aChunks);
+	}
+
+	/**
+	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+	 *
+	 * @param aGeneratedCode The generated code
+	 * @param aSourceMapConsumer The SourceMap for the generated code
+	 * @param aRelativePath Optional. The path that relative sources in the
+	 *        SourceMapConsumer should be relative to.
+	 */
+	SourceNode.fromStringWithSourceMap =
+	  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+	    // The SourceNode we want to fill with the generated code
+	    // and the SourceMap
+	    var node = new SourceNode();
+
+	    // All even indices of this array are one line of the generated code,
+	    // while all odd indices are the newlines between two adjacent lines
+	    // (since `REGEX_NEWLINE` captures its match).
+	    // Processed fragments are accessed by calling `shiftNextLine`.
+	    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+	    var remainingLinesIndex = 0;
+	    var shiftNextLine = function() {
+	      var lineContents = getNextLine();
+	      // The last line of a file might not have a newline.
+	      var newLine = getNextLine() || "";
+	      return lineContents + newLine;
+
+	      function getNextLine() {
+	        return remainingLinesIndex < remainingLines.length ?
+	            remainingLines[remainingLinesIndex++] : undefined;
+	      }
+	    };
+
+	    // We need to remember the position of "remainingLines"
+	    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+	    // The generate SourceNodes we need a code range.
+	    // To extract it current and last mapping is used.
+	    // Here we store the last mapping.
+	    var lastMapping = null;
+
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      if (lastMapping !== null) {
+	        // We add the code from "lastMapping" to "mapping":
+	        // First check if there is a new line in between.
+	        if (lastGeneratedLine < mapping.generatedLine) {
+	          // Associate first line with "lastMapping"
+	          addMappingWithCode(lastMapping, shiftNextLine());
+	          lastGeneratedLine++;
+	          lastGeneratedColumn = 0;
+	          // The remaining code is added without mapping
+	        } else {
+	          // There is no new line in between.
+	          // Associate the code between "lastGeneratedColumn" and
+	          // "mapping.generatedColumn" with "lastMapping"
+	          var nextLine = remainingLines[remainingLinesIndex] || '';
+	          var code = nextLine.substr(0, mapping.generatedColumn -
+	                                        lastGeneratedColumn);
+	          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+	                                              lastGeneratedColumn);
+	          lastGeneratedColumn = mapping.generatedColumn;
+	          addMappingWithCode(lastMapping, code);
+	          // No more remaining code, continue
+	          lastMapping = mapping;
+	          return;
+	        }
+	      }
+	      // We add the generated code until the first mapping
+	      // to the SourceNode without any mapping.
+	      // Each line is added as separate string.
+	      while (lastGeneratedLine < mapping.generatedLine) {
+	        node.add(shiftNextLine());
+	        lastGeneratedLine++;
+	      }
+	      if (lastGeneratedColumn < mapping.generatedColumn) {
+	        var nextLine = remainingLines[remainingLinesIndex] || '';
+	        node.add(nextLine.substr(0, mapping.generatedColumn));
+	        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+	        lastGeneratedColumn = mapping.generatedColumn;
+	      }
+	      lastMapping = mapping;
+	    }, this);
+	    // We have processed all mappings.
+	    if (remainingLinesIndex < remainingLines.length) {
+	      if (lastMapping) {
+	        // Associate the remaining code in the current line with "lastMapping"
+	        addMappingWithCode(lastMapping, shiftNextLine());
+	      }
+	      // and add the remaining lines without any mapping
+	      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+	    }
+
+	    // Copy sourcesContent into SourceNode
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aRelativePath != null) {
+	          sourceFile = util.join(aRelativePath, sourceFile);
+	        }
+	        node.setSourceContent(sourceFile, content);
+	      }
+	    });
+
+	    return node;
+
+	    function addMappingWithCode(mapping, code) {
+	      if (mapping === null || mapping.source === undefined) {
+	        node.add(code);
+	      } else {
+	        var source = aRelativePath
+	          ? util.join(aRelativePath, mapping.source)
+	          : mapping.source;
+	        node.add(new SourceNode(mapping.originalLine,
+	                                mapping.originalColumn,
+	                                source,
+	                                code,
+	                                mapping.name));
+	      }
+	    }
+	  };
+
+	/**
+	 * Add a chunk of generated JS to this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    aChunk.forEach(function (chunk) {
+	      this.add(chunk);
+	    }, this);
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    if (aChunk) {
+	      this.children.push(aChunk);
+	    }
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Add a chunk of generated JS to the beginning of this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    for (var i = aChunk.length-1; i >= 0; i--) {
+	      this.prepend(aChunk[i]);
+	    }
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    this.children.unshift(aChunk);
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Walk over the tree of JS snippets in this node and its children. The
+	 * walking function is called once for each snippet of JS and is passed that
+	 * snippet and the its original associated source's line/column location.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+	  var chunk;
+	  for (var i = 0, len = this.children.length; i < len; i++) {
+	    chunk = this.children[i];
+	    if (chunk[isSourceNode]) {
+	      chunk.walk(aFn);
+	    }
+	    else {
+	      if (chunk !== '') {
+	        aFn(chunk, { source: this.source,
+	                     line: this.line,
+	                     column: this.column,
+	                     name: this.name });
+	      }
+	    }
+	  }
+	};
+
+	/**
+	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	 * each of `this.children`.
+	 *
+	 * @param aSep The separator.
+	 */
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+	  var newChildren;
+	  var i;
+	  var len = this.children.length;
+	  if (len > 0) {
+	    newChildren = [];
+	    for (i = 0; i < len-1; i++) {
+	      newChildren.push(this.children[i]);
+	      newChildren.push(aSep);
+	    }
+	    newChildren.push(this.children[i]);
+	    this.children = newChildren;
+	  }
+	  return this;
+	};
+
+	/**
+	 * Call String.prototype.replace on the very right-most source snippet. Useful
+	 * for trimming whitespace from the end of a source node, etc.
+	 *
+	 * @param aPattern The pattern to replace.
+	 * @param aReplacement The thing to replace the pattern with.
+	 */
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+	  var lastChild = this.children[this.children.length - 1];
+	  if (lastChild[isSourceNode]) {
+	    lastChild.replaceRight(aPattern, aReplacement);
+	  }
+	  else if (typeof lastChild === 'string') {
+	    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+	  }
+	  else {
+	    this.children.push(''.replace(aPattern, aReplacement));
+	  }
+	  return this;
+	};
+
+	/**
+	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+	 * in the sourcesContent field.
+	 *
+	 * @param aSourceFile The filename of the source file
+	 * @param aSourceContent The content of the source file
+	 */
+	SourceNode.prototype.setSourceContent =
+	  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+	    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	  };
+
+	/**
+	 * Walk over the tree of SourceNodes. The walking function is called for each
+	 * source file content and is passed the filename and source content.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walkSourceContents =
+	  function SourceNode_walkSourceContents(aFn) {
+	    for (var i = 0, len = this.children.length; i < len; i++) {
+	      if (this.children[i][isSourceNode]) {
+	        this.children[i].walkSourceContents(aFn);
+	      }
+	    }
+
+	    var sources = Object.keys(this.sourceContents);
+	    for (var i = 0, len = sources.length; i < len; i++) {
+	      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	    }
+	  };
+
+	/**
+	 * Return the string representation of this source node. Walks over the tree
+	 * and concatenates all the various snippets together to one string.
+	 */
+	SourceNode.prototype.toString = function SourceNode_toString() {
+	  var str = "";
+	  this.walk(function (chunk) {
+	    str += chunk;
+	  });
+	  return str;
+	};
+
+	/**
+	 * Returns the string representation of this source node along with a source
+	 * map.
+	 */
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+	  var generated = {
+	    code: "",
+	    line: 1,
+	    column: 0
+	  };
+	  var map = new SourceMapGenerator$1(aArgs);
+	  var sourceMappingActive = false;
+	  var lastOriginalSource = null;
+	  var lastOriginalLine = null;
+	  var lastOriginalColumn = null;
+	  var lastOriginalName = null;
+	  this.walk(function (chunk, original) {
+	    generated.code += chunk;
+	    if (original.source !== null
+	        && original.line !== null
+	        && original.column !== null) {
+	      if(lastOriginalSource !== original.source
+	         || lastOriginalLine !== original.line
+	         || lastOriginalColumn !== original.column
+	         || lastOriginalName !== original.name) {
+	        map.addMapping({
+	          source: original.source,
+	          original: {
+	            line: original.line,
+	            column: original.column
+	          },
+	          generated: {
+	            line: generated.line,
+	            column: generated.column
+	          },
+	          name: original.name
+	        });
+	      }
+	      lastOriginalSource = original.source;
+	      lastOriginalLine = original.line;
+	      lastOriginalColumn = original.column;
+	      lastOriginalName = original.name;
+	      sourceMappingActive = true;
+	    } else if (sourceMappingActive) {
+	      map.addMapping({
+	        generated: {
+	          line: generated.line,
+	          column: generated.column
+	        }
+	      });
+	      lastOriginalSource = null;
+	      sourceMappingActive = false;
+	    }
+	    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+	      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+	        generated.line++;
+	        generated.column = 0;
+	        // Mappings end at eol
+	        if (idx + 1 === length) {
+	          lastOriginalSource = null;
+	          sourceMappingActive = false;
+	        } else if (sourceMappingActive) {
+	          map.addMapping({
+	            source: original.source,
+	            original: {
+	              line: original.line,
+	              column: original.column
+	            },
+	            generated: {
+	              line: generated.line,
+	              column: generated.column
+	            },
+	            name: original.name
+	          });
+	        }
+	      } else {
+	        generated.column++;
+	      }
+	    }
+	  });
+	  this.walkSourceContents(function (sourceFile, sourceContent) {
+	    map.setSourceContent(sourceFile, sourceContent);
+	  });
+
+	  return { code: generated.code, map: map };
+	};
+
+	var SourceNode_1 = SourceNode;
+
+	var sourceNode = {
+		SourceNode: SourceNode_1
+	};
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	var SourceMapGenerator$2 = sourceMapGenerator.SourceMapGenerator;
+	var SourceMapConsumer$1 = sourceMapConsumer.SourceMapConsumer;
+	var SourceNode$1 = sourceNode.SourceNode;
+
+	var sourceMap = {
+		SourceMapGenerator: SourceMapGenerator$2,
+		SourceMapConsumer: SourceMapConsumer$1,
+		SourceNode: SourceNode$1
+	};
+
+	var util$1 = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var types = __importStar(main);
+	var n = types.namedTypes;
+	var source_map_1 = __importDefault(sourceMap);
+	var SourceMapConsumer = source_map_1.default.SourceMapConsumer;
+	var SourceMapGenerator = source_map_1.default.SourceMapGenerator;
+	var hasOwn = Object.prototype.hasOwnProperty;
+	function getOption(options, key, defaultValue) {
+	    if (options && hasOwn.call(options, key)) {
+	        return options[key];
+	    }
+	    return defaultValue;
+	}
+	exports.getOption = getOption;
+	function getUnionOfKeys() {
+	    var args = [];
+	    for (var _i = 0; _i < arguments.length; _i++) {
+	        args[_i] = arguments[_i];
+	    }
+	    var result = {};
+	    var argc = args.length;
+	    for (var i = 0; i < argc; ++i) {
+	        var keys = Object.keys(args[i]);
+	        var keyCount = keys.length;
+	        for (var j = 0; j < keyCount; ++j) {
+	            result[keys[j]] = true;
+	        }
+	    }
+	    return result;
+	}
+	exports.getUnionOfKeys = getUnionOfKeys;
+	function comparePos(pos1, pos2) {
+	    return (pos1.line - pos2.line) || (pos1.column - pos2.column);
+	}
+	exports.comparePos = comparePos;
+	function copyPos(pos) {
+	    return {
+	        line: pos.line,
+	        column: pos.column
+	    };
+	}
+	exports.copyPos = copyPos;
+	function composeSourceMaps(formerMap, latterMap) {
+	    if (formerMap) {
+	        if (!latterMap) {
+	            return formerMap;
+	        }
+	    }
+	    else {
+	        return latterMap || null;
+	    }
+	    var smcFormer = new SourceMapConsumer(formerMap);
+	    var smcLatter = new SourceMapConsumer(latterMap);
+	    var smg = new SourceMapGenerator({
+	        file: latterMap.file,
+	        sourceRoot: latterMap.sourceRoot
+	    });
+	    var sourcesToContents = {};
+	    smcLatter.eachMapping(function (mapping) {
+	        var origPos = smcFormer.originalPositionFor({
+	            line: mapping.originalLine,
+	            column: mapping.originalColumn
+	        });
+	        var sourceName = origPos.source;
+	        if (sourceName === null) {
+	            return;
+	        }
+	        smg.addMapping({
+	            source: sourceName,
+	            original: copyPos(origPos),
+	            generated: {
+	                line: mapping.generatedLine,
+	                column: mapping.generatedColumn
+	            },
+	            name: mapping.name
+	        });
+	        var sourceContent = smcFormer.sourceContentFor(sourceName);
+	        if (sourceContent && !hasOwn.call(sourcesToContents, sourceName)) {
+	            sourcesToContents[sourceName] = sourceContent;
+	            smg.setSourceContent(sourceName, sourceContent);
+	        }
+	    });
+	    return smg.toJSON();
+	}
+	exports.composeSourceMaps = composeSourceMaps;
+	function getTrueLoc(node, lines) {
+	    // It's possible that node is newly-created (not parsed by Esprima),
+	    // in which case it probably won't have a .loc property (or an
+	    // .original property for that matter). That's fine; we'll just
+	    // pretty-print it as usual.
+	    if (!node.loc) {
+	        return null;
+	    }
+	    var result = {
+	        start: node.loc.start,
+	        end: node.loc.end
+	    };
+	    function include(node) {
+	        expandLoc(result, node.loc);
+	    }
+	    // If the node is an export declaration and its .declaration has any
+	    // decorators, their locations might contribute to the true start/end
+	    // positions of the export declaration node.
+	    if (node.declaration &&
+	        node.declaration.decorators &&
+	        isExportDeclaration(node)) {
+	        node.declaration.decorators.forEach(include);
+	    }
+	    if (comparePos(result.start, result.end) < 0) {
+	        // Trim leading whitespace.
+	        result.start = copyPos(result.start);
+	        lines.skipSpaces(result.start, false, true);
+	        if (comparePos(result.start, result.end) < 0) {
+	            // Trim trailing whitespace, if the end location is not already the
+	            // same as the start location.
+	            result.end = copyPos(result.end);
+	            lines.skipSpaces(result.end, true, true);
+	        }
+	    }
+	    // If the node has any comments, their locations might contribute to
+	    // the true start/end positions of the node.
+	    if (node.comments) {
+	        node.comments.forEach(include);
+	    }
+	    return result;
+	}
+	exports.getTrueLoc = getTrueLoc;
+	function expandLoc(parentLoc, childLoc) {
+	    if (parentLoc && childLoc) {
+	        if (comparePos(childLoc.start, parentLoc.start) < 0) {
+	            parentLoc.start = childLoc.start;
+	        }
+	        if (comparePos(parentLoc.end, childLoc.end) < 0) {
+	            parentLoc.end = childLoc.end;
+	        }
+	    }
+	}
+	function fixFaultyLocations(node, lines) {
+	    var loc = node.loc;
+	    if (loc) {
+	        if (loc.start.line < 1) {
+	            loc.start.line = 1;
+	        }
+	        if (loc.end.line < 1) {
+	            loc.end.line = 1;
+	        }
+	    }
+	    if (node.type === "File") {
+	        // Babylon returns File nodes whose .loc.{start,end} do not include
+	        // leading or trailing whitespace.
+	        loc.start = lines.firstPos();
+	        loc.end = lines.lastPos();
+	    }
+	    fixForLoopHead(node, lines);
+	    fixTemplateLiteral(node, lines);
+	    if (loc && node.decorators) {
+	        // Expand the .loc of the node responsible for printing the decorators
+	        // (here, the decorated node) so that it includes node.decorators.
+	        node.decorators.forEach(function (decorator) {
+	            expandLoc(loc, decorator.loc);
+	        });
+	    }
+	    else if (node.declaration && isExportDeclaration(node)) {
+	        // Nullify .loc information for the child declaration so that we never
+	        // try to reprint it without also reprinting the export declaration.
+	        node.declaration.loc = null;
+	        // Expand the .loc of the node responsible for printing the decorators
+	        // (here, the export declaration) so that it includes node.decorators.
+	        var decorators = node.declaration.decorators;
+	        if (decorators) {
+	            decorators.forEach(function (decorator) {
+	                expandLoc(loc, decorator.loc);
+	            });
+	        }
+	    }
+	    else if ((n.MethodDefinition && n.MethodDefinition.check(node)) ||
+	        (n.Property.check(node) && (node.method || node.shorthand))) {
+	        // If the node is a MethodDefinition or a .method or .shorthand
+	        // Property, then the location information stored in
+	        // node.value.loc is very likely untrustworthy (just the {body}
+	        // part of a method, or nothing in the case of shorthand
+	        // properties), so we null out that information to prevent
+	        // accidental reuse of bogus source code during reprinting.
+	        node.value.loc = null;
+	        if (n.FunctionExpression.check(node.value)) {
+	            // FunctionExpression method values should be anonymous,
+	            // because their .id fields are ignored anyway.
+	            node.value.id = null;
+	        }
+	    }
+	    else if (node.type === "ObjectTypeProperty") {
+	        var loc = node.loc;
+	        var end = loc && loc.end;
+	        if (end) {
+	            end = copyPos(end);
+	            if (lines.prevPos(end) &&
+	                lines.charAt(end) === ",") {
+	                // Some parsers accidentally include trailing commas in the
+	                // .loc.end information for ObjectTypeProperty nodes.
+	                if ((end = lines.skipSpaces(end, true, true))) {
+	                    loc.end = end;
+	                }
+	            }
+	        }
+	    }
+	}
+	exports.fixFaultyLocations = fixFaultyLocations;
+	function fixForLoopHead(node, lines) {
+	    if (node.type !== "ForStatement") {
+	        return;
+	    }
+	    function fix(child) {
+	        var loc = child && child.loc;
+	        var start = loc && loc.start;
+	        var end = loc && copyPos(loc.end);
+	        while (start && end && comparePos(start, end) < 0) {
+	            lines.prevPos(end);
+	            if (lines.charAt(end) === ";") {
+	                // Update child.loc.end to *exclude* the ';' character.
+	                loc.end.line = end.line;
+	                loc.end.column = end.column;
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	    }
+	    fix(node.init);
+	    fix(node.test);
+	    fix(node.update);
+	}
+	function fixTemplateLiteral(node, lines) {
+	    if (node.type !== "TemplateLiteral") {
+	        return;
+	    }
+	    if (node.quasis.length === 0) {
+	        // If there are no quasi elements, then there is nothing to fix.
+	        return;
+	    }
+	    // node.loc is not present when using export default with a template literal
+	    if (node.loc) {
+	        // First we need to exclude the opening ` from the .loc of the first
+	        // quasi element, in case the parser accidentally decided to include it.
+	        var afterLeftBackTickPos = copyPos(node.loc.start);
+	        assert_1.default.strictEqual(lines.charAt(afterLeftBackTickPos), "`");
+	        assert_1.default.ok(lines.nextPos(afterLeftBackTickPos));
+	        var firstQuasi = node.quasis[0];
+	        if (comparePos(firstQuasi.loc.start, afterLeftBackTickPos) < 0) {
+	            firstQuasi.loc.start = afterLeftBackTickPos;
+	        }
+	        // Next we need to exclude the closing ` from the .loc of the last quasi
+	        // element, in case the parser accidentally decided to include it.
+	        var rightBackTickPos = copyPos(node.loc.end);
+	        assert_1.default.ok(lines.prevPos(rightBackTickPos));
+	        assert_1.default.strictEqual(lines.charAt(rightBackTickPos), "`");
+	        var lastQuasi = node.quasis[node.quasis.length - 1];
+	        if (comparePos(rightBackTickPos, lastQuasi.loc.end) < 0) {
+	            lastQuasi.loc.end = rightBackTickPos;
+	        }
+	    }
+	    // Now we need to exclude ${ and } characters from the .loc's of all
+	    // quasi elements, since some parsers accidentally include them.
+	    node.expressions.forEach(function (expr, i) {
+	        // Rewind from expr.loc.start over any whitespace and the ${ that
+	        // precedes the expression. The position of the $ should be the same
+	        // as the .loc.end of the preceding quasi element, but some parsers
+	        // accidentally include the ${ in the .loc of the quasi element.
+	        var dollarCurlyPos = lines.skipSpaces(expr.loc.start, true, false);
+	        if (lines.prevPos(dollarCurlyPos) &&
+	            lines.charAt(dollarCurlyPos) === "{" &&
+	            lines.prevPos(dollarCurlyPos) &&
+	            lines.charAt(dollarCurlyPos) === "$") {
+	            var quasiBefore = node.quasis[i];
+	            if (comparePos(dollarCurlyPos, quasiBefore.loc.end) < 0) {
+	                quasiBefore.loc.end = dollarCurlyPos;
+	            }
+	        }
+	        // Likewise, some parsers accidentally include the } that follows
+	        // the expression in the .loc of the following quasi element.
+	        var rightCurlyPos = lines.skipSpaces(expr.loc.end, false, false);
+	        if (lines.charAt(rightCurlyPos) === "}") {
+	            assert_1.default.ok(lines.nextPos(rightCurlyPos));
+	            // Now rightCurlyPos is technically the position just after the }.
+	            var quasiAfter = node.quasis[i + 1];
+	            if (comparePos(quasiAfter.loc.start, rightCurlyPos) < 0) {
+	                quasiAfter.loc.start = rightCurlyPos;
+	            }
+	        }
+	    });
+	}
+	function isExportDeclaration(node) {
+	    if (node)
+	        switch (node.type) {
+	            case "ExportDeclaration":
+	            case "ExportDefaultDeclaration":
+	            case "ExportDefaultSpecifier":
+	            case "DeclareExportDeclaration":
+	            case "ExportNamedDeclaration":
+	            case "ExportAllDeclaration":
+	                return true;
+	        }
+	    return false;
+	}
+	exports.isExportDeclaration = isExportDeclaration;
+	function getParentExportDeclaration(path) {
+	    var parentNode = path.getParentNode();
+	    if (path.getName() === "declaration" &&
+	        isExportDeclaration(parentNode)) {
+	        return parentNode;
+	    }
+	    return null;
+	}
+	exports.getParentExportDeclaration = getParentExportDeclaration;
+	function isTrailingCommaEnabled(options, context) {
+	    var trailingComma = options.trailingComma;
+	    if (typeof trailingComma === "object") {
+	        return !!trailingComma[context];
+	    }
+	    return !!trailingComma;
+	}
+	exports.isTrailingCommaEnabled = isTrailingCommaEnabled;
+	});
+
+	unwrapExports(util$1);
+	var util_1$1 = util$1.getOption;
+	var util_2$1 = util$1.getUnionOfKeys;
+	var util_3$1 = util$1.comparePos;
+	var util_4$1 = util$1.copyPos;
+	var util_5$1 = util$1.composeSourceMaps;
+	var util_6$1 = util$1.getTrueLoc;
+	var util_7$1 = util$1.fixFaultyLocations;
+	var util_8$1 = util$1.isExportDeclaration;
+	var util_9$1 = util$1.getParentExportDeclaration;
+	var util_10$1 = util$1.isTrailingCommaEnabled;
+
+	var esprima$1 = createCommonjsModule(function (module, exports) {
+	(function webpackUniversalModuleDefinition(root, factory) {
+	/* istanbul ignore next */
+		module.exports = factory();
+	})(this, function() {
+	return /******/ (function(modules) { // webpackBootstrap
+	/******/ 	// The module cache
+	/******/ 	var installedModules = {};
+
+	/******/ 	// The require function
+	/******/ 	function __webpack_require__(moduleId) {
+
+	/******/ 		// Check if module is in cache
+	/* istanbul ignore if */
+	/******/ 		if(installedModules[moduleId])
+	/******/ 			return installedModules[moduleId].exports;
+
+	/******/ 		// Create a new module (and put it into the cache)
+	/******/ 		var module = installedModules[moduleId] = {
+	/******/ 			exports: {},
+	/******/ 			id: moduleId,
+	/******/ 			loaded: false
+	/******/ 		};
+
+	/******/ 		// Execute the module function
+	/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+
+	/******/ 		// Flag the module as loaded
+	/******/ 		module.loaded = true;
+
+	/******/ 		// Return the exports of the module
+	/******/ 		return module.exports;
+	/******/ 	}
+
+
+	/******/ 	// expose the modules object (__webpack_modules__)
+	/******/ 	__webpack_require__.m = modules;
+
+	/******/ 	// expose the module cache
+	/******/ 	__webpack_require__.c = installedModules;
+
+	/******/ 	// __webpack_public_path__
+	/******/ 	__webpack_require__.p = "";
+
+	/******/ 	// Load entry module and return exports
+	/******/ 	return __webpack_require__(0);
+	/******/ })
+	/************************************************************************/
+	/******/ ([
+	/* 0 */
+	/***/ function(module, exports, __webpack_require__) {
+		/*
+		  Copyright JS Foundation and other contributors, https://js.foundation/
+
+		  Redistribution and use in source and binary forms, with or without
+		  modification, are permitted provided that the following conditions are met:
+
+		    * Redistributions of source code must retain the above copyright
+		      notice, this list of conditions and the following disclaimer.
+		    * Redistributions in binary form must reproduce the above copyright
+		      notice, this list of conditions and the following disclaimer in the
+		      documentation and/or other materials provided with the distribution.
+
+		  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+		  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+		  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+		  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+		  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+		  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+		  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+		  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+		  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+		  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+		*/
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var comment_handler_1 = __webpack_require__(1);
+		var jsx_parser_1 = __webpack_require__(3);
+		var parser_1 = __webpack_require__(8);
+		var tokenizer_1 = __webpack_require__(15);
+		function parse(code, options, delegate) {
+		    var commentHandler = null;
+		    var proxyDelegate = function (node, metadata) {
+		        if (delegate) {
+		            delegate(node, metadata);
+		        }
+		        if (commentHandler) {
+		            commentHandler.visit(node, metadata);
+		        }
+		    };
+		    var parserDelegate = (typeof delegate === 'function') ? proxyDelegate : null;
+		    var collectComment = false;
+		    if (options) {
+		        collectComment = (typeof options.comment === 'boolean' && options.comment);
+		        var attachComment = (typeof options.attachComment === 'boolean' && options.attachComment);
+		        if (collectComment || attachComment) {
+		            commentHandler = new comment_handler_1.CommentHandler();
+		            commentHandler.attach = attachComment;
+		            options.comment = true;
+		            parserDelegate = proxyDelegate;
+		        }
+		    }
+		    var isModule = false;
+		    if (options && typeof options.sourceType === 'string') {
+		        isModule = (options.sourceType === 'module');
+		    }
+		    var parser;
+		    if (options && typeof options.jsx === 'boolean' && options.jsx) {
+		        parser = new jsx_parser_1.JSXParser(code, options, parserDelegate);
+		    }
+		    else {
+		        parser = new parser_1.Parser(code, options, parserDelegate);
+		    }
+		    var program = isModule ? parser.parseModule() : parser.parseScript();
+		    var ast = program;
+		    if (collectComment && commentHandler) {
+		        ast.comments = commentHandler.comments;
+		    }
+		    if (parser.config.tokens) {
+		        ast.tokens = parser.tokens;
+		    }
+		    if (parser.config.tolerant) {
+		        ast.errors = parser.errorHandler.errors;
+		    }
+		    return ast;
+		}
+		exports.parse = parse;
+		function parseModule(code, options, delegate) {
+		    var parsingOptions = options || {};
+		    parsingOptions.sourceType = 'module';
+		    return parse(code, parsingOptions, delegate);
+		}
+		exports.parseModule = parseModule;
+		function parseScript(code, options, delegate) {
+		    var parsingOptions = options || {};
+		    parsingOptions.sourceType = 'script';
+		    return parse(code, parsingOptions, delegate);
+		}
+		exports.parseScript = parseScript;
+		function tokenize(code, options, delegate) {
+		    var tokenizer = new tokenizer_1.Tokenizer(code, options);
+		    var tokens;
+		    tokens = [];
+		    try {
+		        while (true) {
+		            var token = tokenizer.getNextToken();
+		            if (!token) {
+		                break;
+		            }
+		            if (delegate) {
+		                token = delegate(token);
+		            }
+		            tokens.push(token);
+		        }
+		    }
+		    catch (e) {
+		        tokenizer.errorHandler.tolerate(e);
+		    }
+		    if (tokenizer.errorHandler.tolerant) {
+		        tokens.errors = tokenizer.errors();
+		    }
+		    return tokens;
+		}
+		exports.tokenize = tokenize;
+		var syntax_1 = __webpack_require__(2);
+		exports.Syntax = syntax_1.Syntax;
+		// Sync with *.json manifests.
+		exports.version = '4.0.1';
+
+
+	/***/ },
+	/* 1 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var syntax_1 = __webpack_require__(2);
+		var CommentHandler = (function () {
+		    function CommentHandler() {
+		        this.attach = false;
+		        this.comments = [];
+		        this.stack = [];
+		        this.leading = [];
+		        this.trailing = [];
+		    }
+		    CommentHandler.prototype.insertInnerComments = function (node, metadata) {
+		        //  innnerComments for properties empty block
+		        //  `function a() {/** comments **\/}`
+		        if (node.type === syntax_1.Syntax.BlockStatement && node.body.length === 0) {
+		            var innerComments = [];
+		            for (var i = this.leading.length - 1; i >= 0; --i) {
+		                var entry = this.leading[i];
+		                if (metadata.end.offset >= entry.start) {
+		                    innerComments.unshift(entry.comment);
+		                    this.leading.splice(i, 1);
+		                    this.trailing.splice(i, 1);
+		                }
+		            }
+		            if (innerComments.length) {
+		                node.innerComments = innerComments;
+		            }
+		        }
+		    };
+		    CommentHandler.prototype.findTrailingComments = function (metadata) {
+		        var trailingComments = [];
+		        if (this.trailing.length > 0) {
+		            for (var i = this.trailing.length - 1; i >= 0; --i) {
+		                var entry_1 = this.trailing[i];
+		                if (entry_1.start >= metadata.end.offset) {
+		                    trailingComments.unshift(entry_1.comment);
+		                }
+		            }
+		            this.trailing.length = 0;
+		            return trailingComments;
+		        }
+		        var entry = this.stack[this.stack.length - 1];
+		        if (entry && entry.node.trailingComments) {
+		            var firstComment = entry.node.trailingComments[0];
+		            if (firstComment && firstComment.range[0] >= metadata.end.offset) {
+		                trailingComments = entry.node.trailingComments;
+		                delete entry.node.trailingComments;
+		            }
+		        }
+		        return trailingComments;
+		    };
+		    CommentHandler.prototype.findLeadingComments = function (metadata) {
+		        var leadingComments = [];
+		        var target;
+		        while (this.stack.length > 0) {
+		            var entry = this.stack[this.stack.length - 1];
+		            if (entry && entry.start >= metadata.start.offset) {
+		                target = entry.node;
+		                this.stack.pop();
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        if (target) {
+		            var count = target.leadingComments ? target.leadingComments.length : 0;
+		            for (var i = count - 1; i >= 0; --i) {
+		                var comment = target.leadingComments[i];
+		                if (comment.range[1] <= metadata.start.offset) {
+		                    leadingComments.unshift(comment);
+		                    target.leadingComments.splice(i, 1);
+		                }
+		            }
+		            if (target.leadingComments && target.leadingComments.length === 0) {
+		                delete target.leadingComments;
+		            }
+		            return leadingComments;
+		        }
+		        for (var i = this.leading.length - 1; i >= 0; --i) {
+		            var entry = this.leading[i];
+		            if (entry.start <= metadata.start.offset) {
+		                leadingComments.unshift(entry.comment);
+		                this.leading.splice(i, 1);
+		            }
+		        }
+		        return leadingComments;
+		    };
+		    CommentHandler.prototype.visitNode = function (node, metadata) {
+		        if (node.type === syntax_1.Syntax.Program && node.body.length > 0) {
+		            return;
+		        }
+		        this.insertInnerComments(node, metadata);
+		        var trailingComments = this.findTrailingComments(metadata);
+		        var leadingComments = this.findLeadingComments(metadata);
+		        if (leadingComments.length > 0) {
+		            node.leadingComments = leadingComments;
+		        }
+		        if (trailingComments.length > 0) {
+		            node.trailingComments = trailingComments;
+		        }
+		        this.stack.push({
+		            node: node,
+		            start: metadata.start.offset
+		        });
+		    };
+		    CommentHandler.prototype.visitComment = function (node, metadata) {
+		        var type = (node.type[0] === 'L') ? 'Line' : 'Block';
+		        var comment = {
+		            type: type,
+		            value: node.value
+		        };
+		        if (node.range) {
+		            comment.range = node.range;
+		        }
+		        if (node.loc) {
+		            comment.loc = node.loc;
+		        }
+		        this.comments.push(comment);
+		        if (this.attach) {
+		            var entry = {
+		                comment: {
+		                    type: type,
+		                    value: node.value,
+		                    range: [metadata.start.offset, metadata.end.offset]
+		                },
+		                start: metadata.start.offset
+		            };
+		            if (node.loc) {
+		                entry.comment.loc = node.loc;
+		            }
+		            node.type = type;
+		            this.leading.push(entry);
+		            this.trailing.push(entry);
+		        }
+		    };
+		    CommentHandler.prototype.visit = function (node, metadata) {
+		        if (node.type === 'LineComment') {
+		            this.visitComment(node, metadata);
+		        }
+		        else if (node.type === 'BlockComment') {
+		            this.visitComment(node, metadata);
+		        }
+		        else if (this.attach) {
+		            this.visitNode(node, metadata);
+		        }
+		    };
+		    return CommentHandler;
+		}());
+		exports.CommentHandler = CommentHandler;
+
+
+	/***/ },
+	/* 2 */
+	/***/ function(module, exports) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		exports.Syntax = {
+		    AssignmentExpression: 'AssignmentExpression',
+		    AssignmentPattern: 'AssignmentPattern',
+		    ArrayExpression: 'ArrayExpression',
+		    ArrayPattern: 'ArrayPattern',
+		    ArrowFunctionExpression: 'ArrowFunctionExpression',
+		    AwaitExpression: 'AwaitExpression',
+		    BlockStatement: 'BlockStatement',
+		    BinaryExpression: 'BinaryExpression',
+		    BreakStatement: 'BreakStatement',
+		    CallExpression: 'CallExpression',
+		    CatchClause: 'CatchClause',
+		    ClassBody: 'ClassBody',
+		    ClassDeclaration: 'ClassDeclaration',
+		    ClassExpression: 'ClassExpression',
+		    ConditionalExpression: 'ConditionalExpression',
+		    ContinueStatement: 'ContinueStatement',
+		    DoWhileStatement: 'DoWhileStatement',
+		    DebuggerStatement: 'DebuggerStatement',
+		    EmptyStatement: 'EmptyStatement',
+		    ExportAllDeclaration: 'ExportAllDeclaration',
+		    ExportDefaultDeclaration: 'ExportDefaultDeclaration',
+		    ExportNamedDeclaration: 'ExportNamedDeclaration',
+		    ExportSpecifier: 'ExportSpecifier',
+		    ExpressionStatement: 'ExpressionStatement',
+		    ForStatement: 'ForStatement',
+		    ForOfStatement: 'ForOfStatement',
+		    ForInStatement: 'ForInStatement',
+		    FunctionDeclaration: 'FunctionDeclaration',
+		    FunctionExpression: 'FunctionExpression',
+		    Identifier: 'Identifier',
+		    IfStatement: 'IfStatement',
+		    ImportDeclaration: 'ImportDeclaration',
+		    ImportDefaultSpecifier: 'ImportDefaultSpecifier',
+		    ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',
+		    ImportSpecifier: 'ImportSpecifier',
+		    Literal: 'Literal',
+		    LabeledStatement: 'LabeledStatement',
+		    LogicalExpression: 'LogicalExpression',
+		    MemberExpression: 'MemberExpression',
+		    MetaProperty: 'MetaProperty',
+		    MethodDefinition: 'MethodDefinition',
+		    NewExpression: 'NewExpression',
+		    ObjectExpression: 'ObjectExpression',
+		    ObjectPattern: 'ObjectPattern',
+		    Program: 'Program',
+		    Property: 'Property',
+		    RestElement: 'RestElement',
+		    ReturnStatement: 'ReturnStatement',
+		    SequenceExpression: 'SequenceExpression',
+		    SpreadElement: 'SpreadElement',
+		    Super: 'Super',
+		    SwitchCase: 'SwitchCase',
+		    SwitchStatement: 'SwitchStatement',
+		    TaggedTemplateExpression: 'TaggedTemplateExpression',
+		    TemplateElement: 'TemplateElement',
+		    TemplateLiteral: 'TemplateLiteral',
+		    ThisExpression: 'ThisExpression',
+		    ThrowStatement: 'ThrowStatement',
+		    TryStatement: 'TryStatement',
+		    UnaryExpression: 'UnaryExpression',
+		    UpdateExpression: 'UpdateExpression',
+		    VariableDeclaration: 'VariableDeclaration',
+		    VariableDeclarator: 'VariableDeclarator',
+		    WhileStatement: 'WhileStatement',
+		    WithStatement: 'WithStatement',
+		    YieldExpression: 'YieldExpression'
+		};
+
+
+	/***/ },
+	/* 3 */
+	/***/ function(module, exports, __webpack_require__) {
+	/* istanbul ignore next */
+		var __extends = (this && this.__extends) || (function () {
+		    var extendStatics = Object.setPrototypeOf ||
+		        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+		        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+		    return function (d, b) {
+		        extendStatics(d, b);
+		        function __() { this.constructor = d; }
+		        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+		    };
+		})();
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var character_1 = __webpack_require__(4);
+		var JSXNode = __webpack_require__(5);
+		var jsx_syntax_1 = __webpack_require__(6);
+		var Node = __webpack_require__(7);
+		var parser_1 = __webpack_require__(8);
+		var token_1 = __webpack_require__(13);
+		var xhtml_entities_1 = __webpack_require__(14);
+		token_1.TokenName[100 /* Identifier */] = 'JSXIdentifier';
+		token_1.TokenName[101 /* Text */] = 'JSXText';
+		// Fully qualified element name, e.g. <svg:path> returns "svg:path"
+		function getQualifiedElementName(elementName) {
+		    var qualifiedName;
+		    switch (elementName.type) {
+		        case jsx_syntax_1.JSXSyntax.JSXIdentifier:
+		            var id = elementName;
+		            qualifiedName = id.name;
+		            break;
+		        case jsx_syntax_1.JSXSyntax.JSXNamespacedName:
+		            var ns = elementName;
+		            qualifiedName = getQualifiedElementName(ns.namespace) + ':' +
+		                getQualifiedElementName(ns.name);
+		            break;
+		        case jsx_syntax_1.JSXSyntax.JSXMemberExpression:
+		            var expr = elementName;
+		            qualifiedName = getQualifiedElementName(expr.object) + '.' +
+		                getQualifiedElementName(expr.property);
+		            break;
+		        /* istanbul ignore next */
+		        default:
+		            break;
+		    }
+		    return qualifiedName;
+		}
+		var JSXParser = (function (_super) {
+		    __extends(JSXParser, _super);
+		    function JSXParser(code, options, delegate) {
+		        return _super.call(this, code, options, delegate) || this;
+		    }
+		    JSXParser.prototype.parsePrimaryExpression = function () {
+		        return this.match('<') ? this.parseJSXRoot() : _super.prototype.parsePrimaryExpression.call(this);
+		    };
+		    JSXParser.prototype.startJSX = function () {
+		        // Unwind the scanner before the lookahead token.
+		        this.scanner.index = this.startMarker.index;
+		        this.scanner.lineNumber = this.startMarker.line;
+		        this.scanner.lineStart = this.startMarker.index - this.startMarker.column;
+		    };
+		    JSXParser.prototype.finishJSX = function () {
+		        // Prime the next lookahead.
+		        this.nextToken();
+		    };
+		    JSXParser.prototype.reenterJSX = function () {
+		        this.startJSX();
+		        this.expectJSX('}');
+		        // Pop the closing '}' added from the lookahead.
+		        if (this.config.tokens) {
+		            this.tokens.pop();
+		        }
+		    };
+		    JSXParser.prototype.createJSXNode = function () {
+		        this.collectComments();
+		        return {
+		            index: this.scanner.index,
+		            line: this.scanner.lineNumber,
+		            column: this.scanner.index - this.scanner.lineStart
+		        };
+		    };
+		    JSXParser.prototype.createJSXChildNode = function () {
+		        return {
+		            index: this.scanner.index,
+		            line: this.scanner.lineNumber,
+		            column: this.scanner.index - this.scanner.lineStart
+		        };
+		    };
+		    JSXParser.prototype.scanXHTMLEntity = function (quote) {
+		        var result = '&';
+		        var valid = true;
+		        var terminated = false;
+		        var numeric = false;
+		        var hex = false;
+		        while (!this.scanner.eof() && valid && !terminated) {
+		            var ch = this.scanner.source[this.scanner.index];
+		            if (ch === quote) {
+		                break;
+		            }
+		            terminated = (ch === ';');
+		            result += ch;
+		            ++this.scanner.index;
+		            if (!terminated) {
+		                switch (result.length) {
+		                    case 2:
+		                        // e.g. '&#123;'
+		                        numeric = (ch === '#');
+		                        break;
+		                    case 3:
+		                        if (numeric) {
+		                            // e.g. '&#x41;'
+		                            hex = (ch === 'x');
+		                            valid = hex || character_1.Character.isDecimalDigit(ch.charCodeAt(0));
+		                            numeric = numeric && !hex;
+		                        }
+		                        break;
+		                    default:
+		                        valid = valid && !(numeric && !character_1.Character.isDecimalDigit(ch.charCodeAt(0)));
+		                        valid = valid && !(hex && !character_1.Character.isHexDigit(ch.charCodeAt(0)));
+		                        break;
+		                }
+		            }
+		        }
+		        if (valid && terminated && result.length > 2) {
+		            // e.g. '&#x41;' becomes just '#x41'
+		            var str = result.substr(1, result.length - 2);
+		            if (numeric && str.length > 1) {
+		                result = String.fromCharCode(parseInt(str.substr(1), 10));
+		            }
+		            else if (hex && str.length > 2) {
+		                result = String.fromCharCode(parseInt('0' + str.substr(1), 16));
+		            }
+		            else if (!numeric && !hex && xhtml_entities_1.XHTMLEntities[str]) {
+		                result = xhtml_entities_1.XHTMLEntities[str];
+		            }
+		        }
+		        return result;
+		    };
+		    // Scan the next JSX token. This replaces Scanner#lex when in JSX mode.
+		    JSXParser.prototype.lexJSX = function () {
+		        var cp = this.scanner.source.charCodeAt(this.scanner.index);
+		        // < > / : = { }
+		        if (cp === 60 || cp === 62 || cp === 47 || cp === 58 || cp === 61 || cp === 123 || cp === 125) {
+		            var value = this.scanner.source[this.scanner.index++];
+		            return {
+		                type: 7 /* Punctuator */,
+		                value: value,
+		                lineNumber: this.scanner.lineNumber,
+		                lineStart: this.scanner.lineStart,
+		                start: this.scanner.index - 1,
+		                end: this.scanner.index
+		            };
+		        }
+		        // " '
+		        if (cp === 34 || cp === 39) {
+		            var start = this.scanner.index;
+		            var quote = this.scanner.source[this.scanner.index++];
+		            var str = '';
+		            while (!this.scanner.eof()) {
+		                var ch = this.scanner.source[this.scanner.index++];
+		                if (ch === quote) {
+		                    break;
+		                }
+		                else if (ch === '&') {
+		                    str += this.scanXHTMLEntity(quote);
+		                }
+		                else {
+		                    str += ch;
+		                }
+		            }
+		            return {
+		                type: 8 /* StringLiteral */,
+		                value: str,
+		                lineNumber: this.scanner.lineNumber,
+		                lineStart: this.scanner.lineStart,
+		                start: start,
+		                end: this.scanner.index
+		            };
+		        }
+		        // ... or .
+		        if (cp === 46) {
+		            var n1 = this.scanner.source.charCodeAt(this.scanner.index + 1);
+		            var n2 = this.scanner.source.charCodeAt(this.scanner.index + 2);
+		            var value = (n1 === 46 && n2 === 46) ? '...' : '.';
+		            var start = this.scanner.index;
+		            this.scanner.index += value.length;
+		            return {
+		                type: 7 /* Punctuator */,
+		                value: value,
+		                lineNumber: this.scanner.lineNumber,
+		                lineStart: this.scanner.lineStart,
+		                start: start,
+		                end: this.scanner.index
+		            };
+		        }
+		        // `
+		        if (cp === 96) {
+		            // Only placeholder, since it will be rescanned as a real assignment expression.
+		            return {
+		                type: 10 /* Template */,
+		                value: '',
+		                lineNumber: this.scanner.lineNumber,
+		                lineStart: this.scanner.lineStart,
+		                start: this.scanner.index,
+		                end: this.scanner.index
+		            };
+		        }
+		        // Identifer can not contain backslash (char code 92).
+		        if (character_1.Character.isIdentifierStart(cp) && (cp !== 92)) {
+		            var start = this.scanner.index;
+		            ++this.scanner.index;
+		            while (!this.scanner.eof()) {
+		                var ch = this.scanner.source.charCodeAt(this.scanner.index);
+		                if (character_1.Character.isIdentifierPart(ch) && (ch !== 92)) {
+		                    ++this.scanner.index;
+		                }
+		                else if (ch === 45) {
+		                    // Hyphen (char code 45) can be part of an identifier.
+		                    ++this.scanner.index;
+		                }
+		                else {
+		                    break;
+		                }
+		            }
+		            var id = this.scanner.source.slice(start, this.scanner.index);
+		            return {
+		                type: 100 /* Identifier */,
+		                value: id,
+		                lineNumber: this.scanner.lineNumber,
+		                lineStart: this.scanner.lineStart,
+		                start: start,
+		                end: this.scanner.index
+		            };
+		        }
+		        return this.scanner.lex();
+		    };
+		    JSXParser.prototype.nextJSXToken = function () {
+		        this.collectComments();
+		        this.startMarker.index = this.scanner.index;
+		        this.startMarker.line = this.scanner.lineNumber;
+		        this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+		        var token = this.lexJSX();
+		        this.lastMarker.index = this.scanner.index;
+		        this.lastMarker.line = this.scanner.lineNumber;
+		        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+		        if (this.config.tokens) {
+		            this.tokens.push(this.convertToken(token));
+		        }
+		        return token;
+		    };
+		    JSXParser.prototype.nextJSXText = function () {
+		        this.startMarker.index = this.scanner.index;
+		        this.startMarker.line = this.scanner.lineNumber;
+		        this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+		        var start = this.scanner.index;
+		        var text = '';
+		        while (!this.scanner.eof()) {
+		            var ch = this.scanner.source[this.scanner.index];
+		            if (ch === '{' || ch === '<') {
+		                break;
+		            }
+		            ++this.scanner.index;
+		            text += ch;
+		            if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                ++this.scanner.lineNumber;
+		                if (ch === '\r' && this.scanner.source[this.scanner.index] === '\n') {
+		                    ++this.scanner.index;
+		                }
+		                this.scanner.lineStart = this.scanner.index;
+		            }
+		        }
+		        this.lastMarker.index = this.scanner.index;
+		        this.lastMarker.line = this.scanner.lineNumber;
+		        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+		        var token = {
+		            type: 101 /* Text */,
+		            value: text,
+		            lineNumber: this.scanner.lineNumber,
+		            lineStart: this.scanner.lineStart,
+		            start: start,
+		            end: this.scanner.index
+		        };
+		        if ((text.length > 0) && this.config.tokens) {
+		            this.tokens.push(this.convertToken(token));
+		        }
+		        return token;
+		    };
+		    JSXParser.prototype.peekJSXToken = function () {
+		        var state = this.scanner.saveState();
+		        this.scanner.scanComments();
+		        var next = this.lexJSX();
+		        this.scanner.restoreState(state);
+		        return next;
+		    };
+		    // Expect the next JSX token to match the specified punctuator.
+		    // If not, an exception will be thrown.
+		    JSXParser.prototype.expectJSX = function (value) {
+		        var token = this.nextJSXToken();
+		        if (token.type !== 7 /* Punctuator */ || token.value !== value) {
+		            this.throwUnexpectedToken(token);
+		        }
+		    };
+		    // Return true if the next JSX token matches the specified punctuator.
+		    JSXParser.prototype.matchJSX = function (value) {
+		        var next = this.peekJSXToken();
+		        return next.type === 7 /* Punctuator */ && next.value === value;
+		    };
+		    JSXParser.prototype.parseJSXIdentifier = function () {
+		        var node = this.createJSXNode();
+		        var token = this.nextJSXToken();
+		        if (token.type !== 100 /* Identifier */) {
+		            this.throwUnexpectedToken(token);
+		        }
+		        return this.finalize(node, new JSXNode.JSXIdentifier(token.value));
+		    };
+		    JSXParser.prototype.parseJSXElementName = function () {
+		        var node = this.createJSXNode();
+		        var elementName = this.parseJSXIdentifier();
+		        if (this.matchJSX(':')) {
+		            var namespace = elementName;
+		            this.expectJSX(':');
+		            var name_1 = this.parseJSXIdentifier();
+		            elementName = this.finalize(node, new JSXNode.JSXNamespacedName(namespace, name_1));
+		        }
+		        else if (this.matchJSX('.')) {
+		            while (this.matchJSX('.')) {
+		                var object = elementName;
+		                this.expectJSX('.');
+		                var property = this.parseJSXIdentifier();
+		                elementName = this.finalize(node, new JSXNode.JSXMemberExpression(object, property));
+		            }
+		        }
+		        return elementName;
+		    };
+		    JSXParser.prototype.parseJSXAttributeName = function () {
+		        var node = this.createJSXNode();
+		        var attributeName;
+		        var identifier = this.parseJSXIdentifier();
+		        if (this.matchJSX(':')) {
+		            var namespace = identifier;
+		            this.expectJSX(':');
+		            var name_2 = this.parseJSXIdentifier();
+		            attributeName = this.finalize(node, new JSXNode.JSXNamespacedName(namespace, name_2));
+		        }
+		        else {
+		            attributeName = identifier;
+		        }
+		        return attributeName;
+		    };
+		    JSXParser.prototype.parseJSXStringLiteralAttribute = function () {
+		        var node = this.createJSXNode();
+		        var token = this.nextJSXToken();
+		        if (token.type !== 8 /* StringLiteral */) {
+		            this.throwUnexpectedToken(token);
+		        }
+		        var raw = this.getTokenRaw(token);
+		        return this.finalize(node, new Node.Literal(token.value, raw));
+		    };
+		    JSXParser.prototype.parseJSXExpressionAttribute = function () {
+		        var node = this.createJSXNode();
+		        this.expectJSX('{');
+		        this.finishJSX();
+		        if (this.match('}')) {
+		            this.tolerateError('JSX attributes must only be assigned a non-empty expression');
+		        }
+		        var expression = this.parseAssignmentExpression();
+		        this.reenterJSX();
+		        return this.finalize(node, new JSXNode.JSXExpressionContainer(expression));
+		    };
+		    JSXParser.prototype.parseJSXAttributeValue = function () {
+		        return this.matchJSX('{') ? this.parseJSXExpressionAttribute() :
+		            this.matchJSX('<') ? this.parseJSXElement() : this.parseJSXStringLiteralAttribute();
+		    };
+		    JSXParser.prototype.parseJSXNameValueAttribute = function () {
+		        var node = this.createJSXNode();
+		        var name = this.parseJSXAttributeName();
+		        var value = null;
+		        if (this.matchJSX('=')) {
+		            this.expectJSX('=');
+		            value = this.parseJSXAttributeValue();
+		        }
+		        return this.finalize(node, new JSXNode.JSXAttribute(name, value));
+		    };
+		    JSXParser.prototype.parseJSXSpreadAttribute = function () {
+		        var node = this.createJSXNode();
+		        this.expectJSX('{');
+		        this.expectJSX('...');
+		        this.finishJSX();
+		        var argument = this.parseAssignmentExpression();
+		        this.reenterJSX();
+		        return this.finalize(node, new JSXNode.JSXSpreadAttribute(argument));
+		    };
+		    JSXParser.prototype.parseJSXAttributes = function () {
+		        var attributes = [];
+		        while (!this.matchJSX('/') && !this.matchJSX('>')) {
+		            var attribute = this.matchJSX('{') ? this.parseJSXSpreadAttribute() :
+		                this.parseJSXNameValueAttribute();
+		            attributes.push(attribute);
+		        }
+		        return attributes;
+		    };
+		    JSXParser.prototype.parseJSXOpeningElement = function () {
+		        var node = this.createJSXNode();
+		        this.expectJSX('<');
+		        var name = this.parseJSXElementName();
+		        var attributes = this.parseJSXAttributes();
+		        var selfClosing = this.matchJSX('/');
+		        if (selfClosing) {
+		            this.expectJSX('/');
+		        }
+		        this.expectJSX('>');
+		        return this.finalize(node, new JSXNode.JSXOpeningElement(name, selfClosing, attributes));
+		    };
+		    JSXParser.prototype.parseJSXBoundaryElement = function () {
+		        var node = this.createJSXNode();
+		        this.expectJSX('<');
+		        if (this.matchJSX('/')) {
+		            this.expectJSX('/');
+		            var name_3 = this.parseJSXElementName();
+		            this.expectJSX('>');
+		            return this.finalize(node, new JSXNode.JSXClosingElement(name_3));
+		        }
+		        var name = this.parseJSXElementName();
+		        var attributes = this.parseJSXAttributes();
+		        var selfClosing = this.matchJSX('/');
+		        if (selfClosing) {
+		            this.expectJSX('/');
+		        }
+		        this.expectJSX('>');
+		        return this.finalize(node, new JSXNode.JSXOpeningElement(name, selfClosing, attributes));
+		    };
+		    JSXParser.prototype.parseJSXEmptyExpression = function () {
+		        var node = this.createJSXChildNode();
+		        this.collectComments();
+		        this.lastMarker.index = this.scanner.index;
+		        this.lastMarker.line = this.scanner.lineNumber;
+		        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+		        return this.finalize(node, new JSXNode.JSXEmptyExpression());
+		    };
+		    JSXParser.prototype.parseJSXExpressionContainer = function () {
+		        var node = this.createJSXNode();
+		        this.expectJSX('{');
+		        var expression;
+		        if (this.matchJSX('}')) {
+		            expression = this.parseJSXEmptyExpression();
+		            this.expectJSX('}');
+		        }
+		        else {
+		            this.finishJSX();
+		            expression = this.parseAssignmentExpression();
+		            this.reenterJSX();
+		        }
+		        return this.finalize(node, new JSXNode.JSXExpressionContainer(expression));
+		    };
+		    JSXParser.prototype.parseJSXChildren = function () {
+		        var children = [];
+		        while (!this.scanner.eof()) {
+		            var node = this.createJSXChildNode();
+		            var token = this.nextJSXText();
+		            if (token.start < token.end) {
+		                var raw = this.getTokenRaw(token);
+		                var child = this.finalize(node, new JSXNode.JSXText(token.value, raw));
+		                children.push(child);
+		            }
+		            if (this.scanner.source[this.scanner.index] === '{') {
+		                var container = this.parseJSXExpressionContainer();
+		                children.push(container);
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        return children;
+		    };
+		    JSXParser.prototype.parseComplexJSXElement = function (el) {
+		        var stack = [];
+		        while (!this.scanner.eof()) {
+		            el.children = el.children.concat(this.parseJSXChildren());
+		            var node = this.createJSXChildNode();
+		            var element = this.parseJSXBoundaryElement();
+		            if (element.type === jsx_syntax_1.JSXSyntax.JSXOpeningElement) {
+		                var opening = element;
+		                if (opening.selfClosing) {
+		                    var child = this.finalize(node, new JSXNode.JSXElement(opening, [], null));
+		                    el.children.push(child);
+		                }
+		                else {
+		                    stack.push(el);
+		                    el = { node: node, opening: opening, closing: null, children: [] };
+		                }
+		            }
+		            if (element.type === jsx_syntax_1.JSXSyntax.JSXClosingElement) {
+		                el.closing = element;
+		                var open_1 = getQualifiedElementName(el.opening.name);
+		                var close_1 = getQualifiedElementName(el.closing.name);
+		                if (open_1 !== close_1) {
+		                    this.tolerateError('Expected corresponding JSX closing tag for %0', open_1);
+		                }
+		                if (stack.length > 0) {
+		                    var child = this.finalize(el.node, new JSXNode.JSXElement(el.opening, el.children, el.closing));
+		                    el = stack[stack.length - 1];
+		                    el.children.push(child);
+		                    stack.pop();
+		                }
+		                else {
+		                    break;
+		                }
+		            }
+		        }
+		        return el;
+		    };
+		    JSXParser.prototype.parseJSXElement = function () {
+		        var node = this.createJSXNode();
+		        var opening = this.parseJSXOpeningElement();
+		        var children = [];
+		        var closing = null;
+		        if (!opening.selfClosing) {
+		            var el = this.parseComplexJSXElement({ node: node, opening: opening, closing: closing, children: children });
+		            children = el.children;
+		            closing = el.closing;
+		        }
+		        return this.finalize(node, new JSXNode.JSXElement(opening, children, closing));
+		    };
+		    JSXParser.prototype.parseJSXRoot = function () {
+		        // Pop the opening '<' added from the lookahead.
+		        if (this.config.tokens) {
+		            this.tokens.pop();
+		        }
+		        this.startJSX();
+		        var element = this.parseJSXElement();
+		        this.finishJSX();
+		        return element;
+		    };
+		    JSXParser.prototype.isStartOfExpression = function () {
+		        return _super.prototype.isStartOfExpression.call(this) || this.match('<');
+		    };
+		    return JSXParser;
+		}(parser_1.Parser));
+		exports.JSXParser = JSXParser;
+
+
+	/***/ },
+	/* 4 */
+	/***/ function(module, exports) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		// See also tools/generate-unicode-regex.js.
+		var Regex = {
+		    // Unicode v8.0.0 NonAsciiIdentifierStart:
+		    NonAsciiIdentifierStart: /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B4\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\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-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\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\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,
+		    // Unicode v8.0.0 NonAsciiIdentifierPart:
+		    NonAsciiIdentifierPart: /[\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF]/
+		};
+		exports.Character = {
+		    /* tslint:disable:no-bitwise */
+		    fromCodePoint: function (cp) {
+		        return (cp < 0x10000) ? String.fromCharCode(cp) :
+		            String.fromCharCode(0xD800 + ((cp - 0x10000) >> 10)) +
+		                String.fromCharCode(0xDC00 + ((cp - 0x10000) & 1023));
+		    },
+		    // https://tc39.github.io/ecma262/#sec-white-space
+		    isWhiteSpace: function (cp) {
+		        return (cp === 0x20) || (cp === 0x09) || (cp === 0x0B) || (cp === 0x0C) || (cp === 0xA0) ||
+		            (cp >= 0x1680 && [0x1680, 0x2000, 0x2001, 0x2002, 0x2003, 0x2004, 0x2005, 0x2006, 0x2007, 0x2008, 0x2009, 0x200A, 0x202F, 0x205F, 0x3000, 0xFEFF].indexOf(cp) >= 0);
+		    },
+		    // https://tc39.github.io/ecma262/#sec-line-terminators
+		    isLineTerminator: function (cp) {
+		        return (cp === 0x0A) || (cp === 0x0D) || (cp === 0x2028) || (cp === 0x2029);
+		    },
+		    // https://tc39.github.io/ecma262/#sec-names-and-keywords
+		    isIdentifierStart: function (cp) {
+		        return (cp === 0x24) || (cp === 0x5F) ||
+		            (cp >= 0x41 && cp <= 0x5A) ||
+		            (cp >= 0x61 && cp <= 0x7A) ||
+		            (cp === 0x5C) ||
+		            ((cp >= 0x80) && Regex.NonAsciiIdentifierStart.test(exports.Character.fromCodePoint(cp)));
+		    },
+		    isIdentifierPart: function (cp) {
+		        return (cp === 0x24) || (cp === 0x5F) ||
+		            (cp >= 0x41 && cp <= 0x5A) ||
+		            (cp >= 0x61 && cp <= 0x7A) ||
+		            (cp >= 0x30 && cp <= 0x39) ||
+		            (cp === 0x5C) ||
+		            ((cp >= 0x80) && Regex.NonAsciiIdentifierPart.test(exports.Character.fromCodePoint(cp)));
+		    },
+		    // https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+		    isDecimalDigit: function (cp) {
+		        return (cp >= 0x30 && cp <= 0x39); // 0..9
+		    },
+		    isHexDigit: function (cp) {
+		        return (cp >= 0x30 && cp <= 0x39) ||
+		            (cp >= 0x41 && cp <= 0x46) ||
+		            (cp >= 0x61 && cp <= 0x66); // a..f
+		    },
+		    isOctalDigit: function (cp) {
+		        return (cp >= 0x30 && cp <= 0x37); // 0..7
+		    }
+		};
+
+
+	/***/ },
+	/* 5 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var jsx_syntax_1 = __webpack_require__(6);
+		/* tslint:disable:max-classes-per-file */
+		var JSXClosingElement = (function () {
+		    function JSXClosingElement(name) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXClosingElement;
+		        this.name = name;
+		    }
+		    return JSXClosingElement;
+		}());
+		exports.JSXClosingElement = JSXClosingElement;
+		var JSXElement = (function () {
+		    function JSXElement(openingElement, children, closingElement) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXElement;
+		        this.openingElement = openingElement;
+		        this.children = children;
+		        this.closingElement = closingElement;
+		    }
+		    return JSXElement;
+		}());
+		exports.JSXElement = JSXElement;
+		var JSXEmptyExpression = (function () {
+		    function JSXEmptyExpression() {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXEmptyExpression;
+		    }
+		    return JSXEmptyExpression;
+		}());
+		exports.JSXEmptyExpression = JSXEmptyExpression;
+		var JSXExpressionContainer = (function () {
+		    function JSXExpressionContainer(expression) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXExpressionContainer;
+		        this.expression = expression;
+		    }
+		    return JSXExpressionContainer;
+		}());
+		exports.JSXExpressionContainer = JSXExpressionContainer;
+		var JSXIdentifier = (function () {
+		    function JSXIdentifier(name) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXIdentifier;
+		        this.name = name;
+		    }
+		    return JSXIdentifier;
+		}());
+		exports.JSXIdentifier = JSXIdentifier;
+		var JSXMemberExpression = (function () {
+		    function JSXMemberExpression(object, property) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXMemberExpression;
+		        this.object = object;
+		        this.property = property;
+		    }
+		    return JSXMemberExpression;
+		}());
+		exports.JSXMemberExpression = JSXMemberExpression;
+		var JSXAttribute = (function () {
+		    function JSXAttribute(name, value) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXAttribute;
+		        this.name = name;
+		        this.value = value;
+		    }
+		    return JSXAttribute;
+		}());
+		exports.JSXAttribute = JSXAttribute;
+		var JSXNamespacedName = (function () {
+		    function JSXNamespacedName(namespace, name) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXNamespacedName;
+		        this.namespace = namespace;
+		        this.name = name;
+		    }
+		    return JSXNamespacedName;
+		}());
+		exports.JSXNamespacedName = JSXNamespacedName;
+		var JSXOpeningElement = (function () {
+		    function JSXOpeningElement(name, selfClosing, attributes) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXOpeningElement;
+		        this.name = name;
+		        this.selfClosing = selfClosing;
+		        this.attributes = attributes;
+		    }
+		    return JSXOpeningElement;
+		}());
+		exports.JSXOpeningElement = JSXOpeningElement;
+		var JSXSpreadAttribute = (function () {
+		    function JSXSpreadAttribute(argument) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXSpreadAttribute;
+		        this.argument = argument;
+		    }
+		    return JSXSpreadAttribute;
+		}());
+		exports.JSXSpreadAttribute = JSXSpreadAttribute;
+		var JSXText = (function () {
+		    function JSXText(value, raw) {
+		        this.type = jsx_syntax_1.JSXSyntax.JSXText;
+		        this.value = value;
+		        this.raw = raw;
+		    }
+		    return JSXText;
+		}());
+		exports.JSXText = JSXText;
+
+
+	/***/ },
+	/* 6 */
+	/***/ function(module, exports) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		exports.JSXSyntax = {
+		    JSXAttribute: 'JSXAttribute',
+		    JSXClosingElement: 'JSXClosingElement',
+		    JSXElement: 'JSXElement',
+		    JSXEmptyExpression: 'JSXEmptyExpression',
+		    JSXExpressionContainer: 'JSXExpressionContainer',
+		    JSXIdentifier: 'JSXIdentifier',
+		    JSXMemberExpression: 'JSXMemberExpression',
+		    JSXNamespacedName: 'JSXNamespacedName',
+		    JSXOpeningElement: 'JSXOpeningElement',
+		    JSXSpreadAttribute: 'JSXSpreadAttribute',
+		    JSXText: 'JSXText'
+		};
+
+
+	/***/ },
+	/* 7 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var syntax_1 = __webpack_require__(2);
+		/* tslint:disable:max-classes-per-file */
+		var ArrayExpression = (function () {
+		    function ArrayExpression(elements) {
+		        this.type = syntax_1.Syntax.ArrayExpression;
+		        this.elements = elements;
+		    }
+		    return ArrayExpression;
+		}());
+		exports.ArrayExpression = ArrayExpression;
+		var ArrayPattern = (function () {
+		    function ArrayPattern(elements) {
+		        this.type = syntax_1.Syntax.ArrayPattern;
+		        this.elements = elements;
+		    }
+		    return ArrayPattern;
+		}());
+		exports.ArrayPattern = ArrayPattern;
+		var ArrowFunctionExpression = (function () {
+		    function ArrowFunctionExpression(params, body, expression) {
+		        this.type = syntax_1.Syntax.ArrowFunctionExpression;
+		        this.id = null;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = false;
+		        this.expression = expression;
+		        this.async = false;
+		    }
+		    return ArrowFunctionExpression;
+		}());
+		exports.ArrowFunctionExpression = ArrowFunctionExpression;
+		var AssignmentExpression = (function () {
+		    function AssignmentExpression(operator, left, right) {
+		        this.type = syntax_1.Syntax.AssignmentExpression;
+		        this.operator = operator;
+		        this.left = left;
+		        this.right = right;
+		    }
+		    return AssignmentExpression;
+		}());
+		exports.AssignmentExpression = AssignmentExpression;
+		var AssignmentPattern = (function () {
+		    function AssignmentPattern(left, right) {
+		        this.type = syntax_1.Syntax.AssignmentPattern;
+		        this.left = left;
+		        this.right = right;
+		    }
+		    return AssignmentPattern;
+		}());
+		exports.AssignmentPattern = AssignmentPattern;
+		var AsyncArrowFunctionExpression = (function () {
+		    function AsyncArrowFunctionExpression(params, body, expression) {
+		        this.type = syntax_1.Syntax.ArrowFunctionExpression;
+		        this.id = null;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = false;
+		        this.expression = expression;
+		        this.async = true;
+		    }
+		    return AsyncArrowFunctionExpression;
+		}());
+		exports.AsyncArrowFunctionExpression = AsyncArrowFunctionExpression;
+		var AsyncFunctionDeclaration = (function () {
+		    function AsyncFunctionDeclaration(id, params, body) {
+		        this.type = syntax_1.Syntax.FunctionDeclaration;
+		        this.id = id;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = false;
+		        this.expression = false;
+		        this.async = true;
+		    }
+		    return AsyncFunctionDeclaration;
+		}());
+		exports.AsyncFunctionDeclaration = AsyncFunctionDeclaration;
+		var AsyncFunctionExpression = (function () {
+		    function AsyncFunctionExpression(id, params, body) {
+		        this.type = syntax_1.Syntax.FunctionExpression;
+		        this.id = id;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = false;
+		        this.expression = false;
+		        this.async = true;
+		    }
+		    return AsyncFunctionExpression;
+		}());
+		exports.AsyncFunctionExpression = AsyncFunctionExpression;
+		var AwaitExpression = (function () {
+		    function AwaitExpression(argument) {
+		        this.type = syntax_1.Syntax.AwaitExpression;
+		        this.argument = argument;
+		    }
+		    return AwaitExpression;
+		}());
+		exports.AwaitExpression = AwaitExpression;
+		var BinaryExpression = (function () {
+		    function BinaryExpression(operator, left, right) {
+		        var logical = (operator === '||' || operator === '&&');
+		        this.type = logical ? syntax_1.Syntax.LogicalExpression : syntax_1.Syntax.BinaryExpression;
+		        this.operator = operator;
+		        this.left = left;
+		        this.right = right;
+		    }
+		    return BinaryExpression;
+		}());
+		exports.BinaryExpression = BinaryExpression;
+		var BlockStatement = (function () {
+		    function BlockStatement(body) {
+		        this.type = syntax_1.Syntax.BlockStatement;
+		        this.body = body;
+		    }
+		    return BlockStatement;
+		}());
+		exports.BlockStatement = BlockStatement;
+		var BreakStatement = (function () {
+		    function BreakStatement(label) {
+		        this.type = syntax_1.Syntax.BreakStatement;
+		        this.label = label;
+		    }
+		    return BreakStatement;
+		}());
+		exports.BreakStatement = BreakStatement;
+		var CallExpression = (function () {
+		    function CallExpression(callee, args) {
+		        this.type = syntax_1.Syntax.CallExpression;
+		        this.callee = callee;
+		        this.arguments = args;
+		    }
+		    return CallExpression;
+		}());
+		exports.CallExpression = CallExpression;
+		var CatchClause = (function () {
+		    function CatchClause(param, body) {
+		        this.type = syntax_1.Syntax.CatchClause;
+		        this.param = param;
+		        this.body = body;
+		    }
+		    return CatchClause;
+		}());
+		exports.CatchClause = CatchClause;
+		var ClassBody = (function () {
+		    function ClassBody(body) {
+		        this.type = syntax_1.Syntax.ClassBody;
+		        this.body = body;
+		    }
+		    return ClassBody;
+		}());
+		exports.ClassBody = ClassBody;
+		var ClassDeclaration = (function () {
+		    function ClassDeclaration(id, superClass, body) {
+		        this.type = syntax_1.Syntax.ClassDeclaration;
+		        this.id = id;
+		        this.superClass = superClass;
+		        this.body = body;
+		    }
+		    return ClassDeclaration;
+		}());
+		exports.ClassDeclaration = ClassDeclaration;
+		var ClassExpression = (function () {
+		    function ClassExpression(id, superClass, body) {
+		        this.type = syntax_1.Syntax.ClassExpression;
+		        this.id = id;
+		        this.superClass = superClass;
+		        this.body = body;
+		    }
+		    return ClassExpression;
+		}());
+		exports.ClassExpression = ClassExpression;
+		var ComputedMemberExpression = (function () {
+		    function ComputedMemberExpression(object, property) {
+		        this.type = syntax_1.Syntax.MemberExpression;
+		        this.computed = true;
+		        this.object = object;
+		        this.property = property;
+		    }
+		    return ComputedMemberExpression;
+		}());
+		exports.ComputedMemberExpression = ComputedMemberExpression;
+		var ConditionalExpression = (function () {
+		    function ConditionalExpression(test, consequent, alternate) {
+		        this.type = syntax_1.Syntax.ConditionalExpression;
+		        this.test = test;
+		        this.consequent = consequent;
+		        this.alternate = alternate;
+		    }
+		    return ConditionalExpression;
+		}());
+		exports.ConditionalExpression = ConditionalExpression;
+		var ContinueStatement = (function () {
+		    function ContinueStatement(label) {
+		        this.type = syntax_1.Syntax.ContinueStatement;
+		        this.label = label;
+		    }
+		    return ContinueStatement;
+		}());
+		exports.ContinueStatement = ContinueStatement;
+		var DebuggerStatement = (function () {
+		    function DebuggerStatement() {
+		        this.type = syntax_1.Syntax.DebuggerStatement;
+		    }
+		    return DebuggerStatement;
+		}());
+		exports.DebuggerStatement = DebuggerStatement;
+		var Directive = (function () {
+		    function Directive(expression, directive) {
+		        this.type = syntax_1.Syntax.ExpressionStatement;
+		        this.expression = expression;
+		        this.directive = directive;
+		    }
+		    return Directive;
+		}());
+		exports.Directive = Directive;
+		var DoWhileStatement = (function () {
+		    function DoWhileStatement(body, test) {
+		        this.type = syntax_1.Syntax.DoWhileStatement;
+		        this.body = body;
+		        this.test = test;
+		    }
+		    return DoWhileStatement;
+		}());
+		exports.DoWhileStatement = DoWhileStatement;
+		var EmptyStatement = (function () {
+		    function EmptyStatement() {
+		        this.type = syntax_1.Syntax.EmptyStatement;
+		    }
+		    return EmptyStatement;
+		}());
+		exports.EmptyStatement = EmptyStatement;
+		var ExportAllDeclaration = (function () {
+		    function ExportAllDeclaration(source) {
+		        this.type = syntax_1.Syntax.ExportAllDeclaration;
+		        this.source = source;
+		    }
+		    return ExportAllDeclaration;
+		}());
+		exports.ExportAllDeclaration = ExportAllDeclaration;
+		var ExportDefaultDeclaration = (function () {
+		    function ExportDefaultDeclaration(declaration) {
+		        this.type = syntax_1.Syntax.ExportDefaultDeclaration;
+		        this.declaration = declaration;
+		    }
+		    return ExportDefaultDeclaration;
+		}());
+		exports.ExportDefaultDeclaration = ExportDefaultDeclaration;
+		var ExportNamedDeclaration = (function () {
+		    function ExportNamedDeclaration(declaration, specifiers, source) {
+		        this.type = syntax_1.Syntax.ExportNamedDeclaration;
+		        this.declaration = declaration;
+		        this.specifiers = specifiers;
+		        this.source = source;
+		    }
+		    return ExportNamedDeclaration;
+		}());
+		exports.ExportNamedDeclaration = ExportNamedDeclaration;
+		var ExportSpecifier = (function () {
+		    function ExportSpecifier(local, exported) {
+		        this.type = syntax_1.Syntax.ExportSpecifier;
+		        this.exported = exported;
+		        this.local = local;
+		    }
+		    return ExportSpecifier;
+		}());
+		exports.ExportSpecifier = ExportSpecifier;
+		var ExpressionStatement = (function () {
+		    function ExpressionStatement(expression) {
+		        this.type = syntax_1.Syntax.ExpressionStatement;
+		        this.expression = expression;
+		    }
+		    return ExpressionStatement;
+		}());
+		exports.ExpressionStatement = ExpressionStatement;
+		var ForInStatement = (function () {
+		    function ForInStatement(left, right, body) {
+		        this.type = syntax_1.Syntax.ForInStatement;
+		        this.left = left;
+		        this.right = right;
+		        this.body = body;
+		        this.each = false;
+		    }
+		    return ForInStatement;
+		}());
+		exports.ForInStatement = ForInStatement;
+		var ForOfStatement = (function () {
+		    function ForOfStatement(left, right, body) {
+		        this.type = syntax_1.Syntax.ForOfStatement;
+		        this.left = left;
+		        this.right = right;
+		        this.body = body;
+		    }
+		    return ForOfStatement;
+		}());
+		exports.ForOfStatement = ForOfStatement;
+		var ForStatement = (function () {
+		    function ForStatement(init, test, update, body) {
+		        this.type = syntax_1.Syntax.ForStatement;
+		        this.init = init;
+		        this.test = test;
+		        this.update = update;
+		        this.body = body;
+		    }
+		    return ForStatement;
+		}());
+		exports.ForStatement = ForStatement;
+		var FunctionDeclaration = (function () {
+		    function FunctionDeclaration(id, params, body, generator) {
+		        this.type = syntax_1.Syntax.FunctionDeclaration;
+		        this.id = id;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = generator;
+		        this.expression = false;
+		        this.async = false;
+		    }
+		    return FunctionDeclaration;
+		}());
+		exports.FunctionDeclaration = FunctionDeclaration;
+		var FunctionExpression = (function () {
+		    function FunctionExpression(id, params, body, generator) {
+		        this.type = syntax_1.Syntax.FunctionExpression;
+		        this.id = id;
+		        this.params = params;
+		        this.body = body;
+		        this.generator = generator;
+		        this.expression = false;
+		        this.async = false;
+		    }
+		    return FunctionExpression;
+		}());
+		exports.FunctionExpression = FunctionExpression;
+		var Identifier = (function () {
+		    function Identifier(name) {
+		        this.type = syntax_1.Syntax.Identifier;
+		        this.name = name;
+		    }
+		    return Identifier;
+		}());
+		exports.Identifier = Identifier;
+		var IfStatement = (function () {
+		    function IfStatement(test, consequent, alternate) {
+		        this.type = syntax_1.Syntax.IfStatement;
+		        this.test = test;
+		        this.consequent = consequent;
+		        this.alternate = alternate;
+		    }
+		    return IfStatement;
+		}());
+		exports.IfStatement = IfStatement;
+		var ImportDeclaration = (function () {
+		    function ImportDeclaration(specifiers, source) {
+		        this.type = syntax_1.Syntax.ImportDeclaration;
+		        this.specifiers = specifiers;
+		        this.source = source;
+		    }
+		    return ImportDeclaration;
+		}());
+		exports.ImportDeclaration = ImportDeclaration;
+		var ImportDefaultSpecifier = (function () {
+		    function ImportDefaultSpecifier(local) {
+		        this.type = syntax_1.Syntax.ImportDefaultSpecifier;
+		        this.local = local;
+		    }
+		    return ImportDefaultSpecifier;
+		}());
+		exports.ImportDefaultSpecifier = ImportDefaultSpecifier;
+		var ImportNamespaceSpecifier = (function () {
+		    function ImportNamespaceSpecifier(local) {
+		        this.type = syntax_1.Syntax.ImportNamespaceSpecifier;
+		        this.local = local;
+		    }
+		    return ImportNamespaceSpecifier;
+		}());
+		exports.ImportNamespaceSpecifier = ImportNamespaceSpecifier;
+		var ImportSpecifier = (function () {
+		    function ImportSpecifier(local, imported) {
+		        this.type = syntax_1.Syntax.ImportSpecifier;
+		        this.local = local;
+		        this.imported = imported;
+		    }
+		    return ImportSpecifier;
+		}());
+		exports.ImportSpecifier = ImportSpecifier;
+		var LabeledStatement = (function () {
+		    function LabeledStatement(label, body) {
+		        this.type = syntax_1.Syntax.LabeledStatement;
+		        this.label = label;
+		        this.body = body;
+		    }
+		    return LabeledStatement;
+		}());
+		exports.LabeledStatement = LabeledStatement;
+		var Literal = (function () {
+		    function Literal(value, raw) {
+		        this.type = syntax_1.Syntax.Literal;
+		        this.value = value;
+		        this.raw = raw;
+		    }
+		    return Literal;
+		}());
+		exports.Literal = Literal;
+		var MetaProperty = (function () {
+		    function MetaProperty(meta, property) {
+		        this.type = syntax_1.Syntax.MetaProperty;
+		        this.meta = meta;
+		        this.property = property;
+		    }
+		    return MetaProperty;
+		}());
+		exports.MetaProperty = MetaProperty;
+		var MethodDefinition = (function () {
+		    function MethodDefinition(key, computed, value, kind, isStatic) {
+		        this.type = syntax_1.Syntax.MethodDefinition;
+		        this.key = key;
+		        this.computed = computed;
+		        this.value = value;
+		        this.kind = kind;
+		        this.static = isStatic;
+		    }
+		    return MethodDefinition;
+		}());
+		exports.MethodDefinition = MethodDefinition;
+		var Module = (function () {
+		    function Module(body) {
+		        this.type = syntax_1.Syntax.Program;
+		        this.body = body;
+		        this.sourceType = 'module';
+		    }
+		    return Module;
+		}());
+		exports.Module = Module;
+		var NewExpression = (function () {
+		    function NewExpression(callee, args) {
+		        this.type = syntax_1.Syntax.NewExpression;
+		        this.callee = callee;
+		        this.arguments = args;
+		    }
+		    return NewExpression;
+		}());
+		exports.NewExpression = NewExpression;
+		var ObjectExpression = (function () {
+		    function ObjectExpression(properties) {
+		        this.type = syntax_1.Syntax.ObjectExpression;
+		        this.properties = properties;
+		    }
+		    return ObjectExpression;
+		}());
+		exports.ObjectExpression = ObjectExpression;
+		var ObjectPattern = (function () {
+		    function ObjectPattern(properties) {
+		        this.type = syntax_1.Syntax.ObjectPattern;
+		        this.properties = properties;
+		    }
+		    return ObjectPattern;
+		}());
+		exports.ObjectPattern = ObjectPattern;
+		var Property = (function () {
+		    function Property(kind, key, computed, value, method, shorthand) {
+		        this.type = syntax_1.Syntax.Property;
+		        this.key = key;
+		        this.computed = computed;
+		        this.value = value;
+		        this.kind = kind;
+		        this.method = method;
+		        this.shorthand = shorthand;
+		    }
+		    return Property;
+		}());
+		exports.Property = Property;
+		var RegexLiteral = (function () {
+		    function RegexLiteral(value, raw, pattern, flags) {
+		        this.type = syntax_1.Syntax.Literal;
+		        this.value = value;
+		        this.raw = raw;
+		        this.regex = { pattern: pattern, flags: flags };
+		    }
+		    return RegexLiteral;
+		}());
+		exports.RegexLiteral = RegexLiteral;
+		var RestElement = (function () {
+		    function RestElement(argument) {
+		        this.type = syntax_1.Syntax.RestElement;
+		        this.argument = argument;
+		    }
+		    return RestElement;
+		}());
+		exports.RestElement = RestElement;
+		var ReturnStatement = (function () {
+		    function ReturnStatement(argument) {
+		        this.type = syntax_1.Syntax.ReturnStatement;
+		        this.argument = argument;
+		    }
+		    return ReturnStatement;
+		}());
+		exports.ReturnStatement = ReturnStatement;
+		var Script = (function () {
+		    function Script(body) {
+		        this.type = syntax_1.Syntax.Program;
+		        this.body = body;
+		        this.sourceType = 'script';
+		    }
+		    return Script;
+		}());
+		exports.Script = Script;
+		var SequenceExpression = (function () {
+		    function SequenceExpression(expressions) {
+		        this.type = syntax_1.Syntax.SequenceExpression;
+		        this.expressions = expressions;
+		    }
+		    return SequenceExpression;
+		}());
+		exports.SequenceExpression = SequenceExpression;
+		var SpreadElement = (function () {
+		    function SpreadElement(argument) {
+		        this.type = syntax_1.Syntax.SpreadElement;
+		        this.argument = argument;
+		    }
+		    return SpreadElement;
+		}());
+		exports.SpreadElement = SpreadElement;
+		var StaticMemberExpression = (function () {
+		    function StaticMemberExpression(object, property) {
+		        this.type = syntax_1.Syntax.MemberExpression;
+		        this.computed = false;
+		        this.object = object;
+		        this.property = property;
+		    }
+		    return StaticMemberExpression;
+		}());
+		exports.StaticMemberExpression = StaticMemberExpression;
+		var Super = (function () {
+		    function Super() {
+		        this.type = syntax_1.Syntax.Super;
+		    }
+		    return Super;
+		}());
+		exports.Super = Super;
+		var SwitchCase = (function () {
+		    function SwitchCase(test, consequent) {
+		        this.type = syntax_1.Syntax.SwitchCase;
+		        this.test = test;
+		        this.consequent = consequent;
+		    }
+		    return SwitchCase;
+		}());
+		exports.SwitchCase = SwitchCase;
+		var SwitchStatement = (function () {
+		    function SwitchStatement(discriminant, cases) {
+		        this.type = syntax_1.Syntax.SwitchStatement;
+		        this.discriminant = discriminant;
+		        this.cases = cases;
+		    }
+		    return SwitchStatement;
+		}());
+		exports.SwitchStatement = SwitchStatement;
+		var TaggedTemplateExpression = (function () {
+		    function TaggedTemplateExpression(tag, quasi) {
+		        this.type = syntax_1.Syntax.TaggedTemplateExpression;
+		        this.tag = tag;
+		        this.quasi = quasi;
+		    }
+		    return TaggedTemplateExpression;
+		}());
+		exports.TaggedTemplateExpression = TaggedTemplateExpression;
+		var TemplateElement = (function () {
+		    function TemplateElement(value, tail) {
+		        this.type = syntax_1.Syntax.TemplateElement;
+		        this.value = value;
+		        this.tail = tail;
+		    }
+		    return TemplateElement;
+		}());
+		exports.TemplateElement = TemplateElement;
+		var TemplateLiteral = (function () {
+		    function TemplateLiteral(quasis, expressions) {
+		        this.type = syntax_1.Syntax.TemplateLiteral;
+		        this.quasis = quasis;
+		        this.expressions = expressions;
+		    }
+		    return TemplateLiteral;
+		}());
+		exports.TemplateLiteral = TemplateLiteral;
+		var ThisExpression = (function () {
+		    function ThisExpression() {
+		        this.type = syntax_1.Syntax.ThisExpression;
+		    }
+		    return ThisExpression;
+		}());
+		exports.ThisExpression = ThisExpression;
+		var ThrowStatement = (function () {
+		    function ThrowStatement(argument) {
+		        this.type = syntax_1.Syntax.ThrowStatement;
+		        this.argument = argument;
+		    }
+		    return ThrowStatement;
+		}());
+		exports.ThrowStatement = ThrowStatement;
+		var TryStatement = (function () {
+		    function TryStatement(block, handler, finalizer) {
+		        this.type = syntax_1.Syntax.TryStatement;
+		        this.block = block;
+		        this.handler = handler;
+		        this.finalizer = finalizer;
+		    }
+		    return TryStatement;
+		}());
+		exports.TryStatement = TryStatement;
+		var UnaryExpression = (function () {
+		    function UnaryExpression(operator, argument) {
+		        this.type = syntax_1.Syntax.UnaryExpression;
+		        this.operator = operator;
+		        this.argument = argument;
+		        this.prefix = true;
+		    }
+		    return UnaryExpression;
+		}());
+		exports.UnaryExpression = UnaryExpression;
+		var UpdateExpression = (function () {
+		    function UpdateExpression(operator, argument, prefix) {
+		        this.type = syntax_1.Syntax.UpdateExpression;
+		        this.operator = operator;
+		        this.argument = argument;
+		        this.prefix = prefix;
+		    }
+		    return UpdateExpression;
+		}());
+		exports.UpdateExpression = UpdateExpression;
+		var VariableDeclaration = (function () {
+		    function VariableDeclaration(declarations, kind) {
+		        this.type = syntax_1.Syntax.VariableDeclaration;
+		        this.declarations = declarations;
+		        this.kind = kind;
+		    }
+		    return VariableDeclaration;
+		}());
+		exports.VariableDeclaration = VariableDeclaration;
+		var VariableDeclarator = (function () {
+		    function VariableDeclarator(id, init) {
+		        this.type = syntax_1.Syntax.VariableDeclarator;
+		        this.id = id;
+		        this.init = init;
+		    }
+		    return VariableDeclarator;
+		}());
+		exports.VariableDeclarator = VariableDeclarator;
+		var WhileStatement = (function () {
+		    function WhileStatement(test, body) {
+		        this.type = syntax_1.Syntax.WhileStatement;
+		        this.test = test;
+		        this.body = body;
+		    }
+		    return WhileStatement;
+		}());
+		exports.WhileStatement = WhileStatement;
+		var WithStatement = (function () {
+		    function WithStatement(object, body) {
+		        this.type = syntax_1.Syntax.WithStatement;
+		        this.object = object;
+		        this.body = body;
+		    }
+		    return WithStatement;
+		}());
+		exports.WithStatement = WithStatement;
+		var YieldExpression = (function () {
+		    function YieldExpression(argument, delegate) {
+		        this.type = syntax_1.Syntax.YieldExpression;
+		        this.argument = argument;
+		        this.delegate = delegate;
+		    }
+		    return YieldExpression;
+		}());
+		exports.YieldExpression = YieldExpression;
+
+
+	/***/ },
+	/* 8 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var assert_1 = __webpack_require__(9);
+		var error_handler_1 = __webpack_require__(10);
+		var messages_1 = __webpack_require__(11);
+		var Node = __webpack_require__(7);
+		var scanner_1 = __webpack_require__(12);
+		var syntax_1 = __webpack_require__(2);
+		var token_1 = __webpack_require__(13);
+		var ArrowParameterPlaceHolder = 'ArrowParameterPlaceHolder';
+		var Parser = (function () {
+		    function Parser(code, options, delegate) {
+		        if (options === void 0) { options = {}; }
+		        this.config = {
+		            range: (typeof options.range === 'boolean') && options.range,
+		            loc: (typeof options.loc === 'boolean') && options.loc,
+		            source: null,
+		            tokens: (typeof options.tokens === 'boolean') && options.tokens,
+		            comment: (typeof options.comment === 'boolean') && options.comment,
+		            tolerant: (typeof options.tolerant === 'boolean') && options.tolerant
+		        };
+		        if (this.config.loc && options.source && options.source !== null) {
+		            this.config.source = String(options.source);
+		        }
+		        this.delegate = delegate;
+		        this.errorHandler = new error_handler_1.ErrorHandler();
+		        this.errorHandler.tolerant = this.config.tolerant;
+		        this.scanner = new scanner_1.Scanner(code, this.errorHandler);
+		        this.scanner.trackComment = this.config.comment;
+		        this.operatorPrecedence = {
+		            ')': 0,
+		            ';': 0,
+		            ',': 0,
+		            '=': 0,
+		            ']': 0,
+		            '||': 1,
+		            '&&': 2,
+		            '|': 3,
+		            '^': 4,
+		            '&': 5,
+		            '==': 6,
+		            '!=': 6,
+		            '===': 6,
+		            '!==': 6,
+		            '<': 7,
+		            '>': 7,
+		            '<=': 7,
+		            '>=': 7,
+		            '<<': 8,
+		            '>>': 8,
+		            '>>>': 8,
+		            '+': 9,
+		            '-': 9,
+		            '*': 11,
+		            '/': 11,
+		            '%': 11
+		        };
+		        this.lookahead = {
+		            type: 2 /* EOF */,
+		            value: '',
+		            lineNumber: this.scanner.lineNumber,
+		            lineStart: 0,
+		            start: 0,
+		            end: 0
+		        };
+		        this.hasLineTerminator = false;
+		        this.context = {
+		            isModule: false,
+		            await: false,
+		            allowIn: true,
+		            allowStrictDirective: true,
+		            allowYield: true,
+		            firstCoverInitializedNameError: null,
+		            isAssignmentTarget: false,
+		            isBindingElement: false,
+		            inFunctionBody: false,
+		            inIteration: false,
+		            inSwitch: false,
+		            labelSet: {},
+		            strict: false
+		        };
+		        this.tokens = [];
+		        this.startMarker = {
+		            index: 0,
+		            line: this.scanner.lineNumber,
+		            column: 0
+		        };
+		        this.lastMarker = {
+		            index: 0,
+		            line: this.scanner.lineNumber,
+		            column: 0
+		        };
+		        this.nextToken();
+		        this.lastMarker = {
+		            index: this.scanner.index,
+		            line: this.scanner.lineNumber,
+		            column: this.scanner.index - this.scanner.lineStart
+		        };
+		    }
+		    Parser.prototype.throwError = function (messageFormat) {
+		        var values = [];
+		        for (var _i = 1; _i < arguments.length; _i++) {
+		            values[_i - 1] = arguments[_i];
+		        }
+		        var args = Array.prototype.slice.call(arguments, 1);
+		        var msg = messageFormat.replace(/%(\d)/g, function (whole, idx) {
+		            assert_1.assert(idx < args.length, 'Message reference must be in range');
+		            return args[idx];
+		        });
+		        var index = this.lastMarker.index;
+		        var line = this.lastMarker.line;
+		        var column = this.lastMarker.column + 1;
+		        throw this.errorHandler.createError(index, line, column, msg);
+		    };
+		    Parser.prototype.tolerateError = function (messageFormat) {
+		        var values = [];
+		        for (var _i = 1; _i < arguments.length; _i++) {
+		            values[_i - 1] = arguments[_i];
+		        }
+		        var args = Array.prototype.slice.call(arguments, 1);
+		        var msg = messageFormat.replace(/%(\d)/g, function (whole, idx) {
+		            assert_1.assert(idx < args.length, 'Message reference must be in range');
+		            return args[idx];
+		        });
+		        var index = this.lastMarker.index;
+		        var line = this.scanner.lineNumber;
+		        var column = this.lastMarker.column + 1;
+		        this.errorHandler.tolerateError(index, line, column, msg);
+		    };
+		    // Throw an exception because of the token.
+		    Parser.prototype.unexpectedTokenError = function (token, message) {
+		        var msg = message || messages_1.Messages.UnexpectedToken;
+		        var value;
+		        if (token) {
+		            if (!message) {
+		                msg = (token.type === 2 /* EOF */) ? messages_1.Messages.UnexpectedEOS :
+		                    (token.type === 3 /* Identifier */) ? messages_1.Messages.UnexpectedIdentifier :
+		                        (token.type === 6 /* NumericLiteral */) ? messages_1.Messages.UnexpectedNumber :
+		                            (token.type === 8 /* StringLiteral */) ? messages_1.Messages.UnexpectedString :
+		                                (token.type === 10 /* Template */) ? messages_1.Messages.UnexpectedTemplate :
+		                                    messages_1.Messages.UnexpectedToken;
+		                if (token.type === 4 /* Keyword */) {
+		                    if (this.scanner.isFutureReservedWord(token.value)) {
+		                        msg = messages_1.Messages.UnexpectedReserved;
+		                    }
+		                    else if (this.context.strict && this.scanner.isStrictModeReservedWord(token.value)) {
+		                        msg = messages_1.Messages.StrictReservedWord;
+		                    }
+		                }
+		            }
+		            value = token.value;
+		        }
+		        else {
+		            value = 'ILLEGAL';
+		        }
+		        msg = msg.replace('%0', value);
+		        if (token && typeof token.lineNumber === 'number') {
+		            var index = token.start;
+		            var line = token.lineNumber;
+		            var lastMarkerLineStart = this.lastMarker.index - this.lastMarker.column;
+		            var column = token.start - lastMarkerLineStart + 1;
+		            return this.errorHandler.createError(index, line, column, msg);
+		        }
+		        else {
+		            var index = this.lastMarker.index;
+		            var line = this.lastMarker.line;
+		            var column = this.lastMarker.column + 1;
+		            return this.errorHandler.createError(index, line, column, msg);
+		        }
+		    };
+		    Parser.prototype.throwUnexpectedToken = function (token, message) {
+		        throw this.unexpectedTokenError(token, message);
+		    };
+		    Parser.prototype.tolerateUnexpectedToken = function (token, message) {
+		        this.errorHandler.tolerate(this.unexpectedTokenError(token, message));
+		    };
+		    Parser.prototype.collectComments = function () {
+		        if (!this.config.comment) {
+		            this.scanner.scanComments();
+		        }
+		        else {
+		            var comments = this.scanner.scanComments();
+		            if (comments.length > 0 && this.delegate) {
+		                for (var i = 0; i < comments.length; ++i) {
+		                    var e = comments[i];
+		                    var node = void 0;
+		                    node = {
+		                        type: e.multiLine ? 'BlockComment' : 'LineComment',
+		                        value: this.scanner.source.slice(e.slice[0], e.slice[1])
+		                    };
+		                    if (this.config.range) {
+		                        node.range = e.range;
+		                    }
+		                    if (this.config.loc) {
+		                        node.loc = e.loc;
+		                    }
+		                    var metadata = {
+		                        start: {
+		                            line: e.loc.start.line,
+		                            column: e.loc.start.column,
+		                            offset: e.range[0]
+		                        },
+		                        end: {
+		                            line: e.loc.end.line,
+		                            column: e.loc.end.column,
+		                            offset: e.range[1]
+		                        }
+		                    };
+		                    this.delegate(node, metadata);
+		                }
+		            }
+		        }
+		    };
+		    // From internal representation to an external structure
+		    Parser.prototype.getTokenRaw = function (token) {
+		        return this.scanner.source.slice(token.start, token.end);
+		    };
+		    Parser.prototype.convertToken = function (token) {
+		        var t = {
+		            type: token_1.TokenName[token.type],
+		            value: this.getTokenRaw(token)
+		        };
+		        if (this.config.range) {
+		            t.range = [token.start, token.end];
+		        }
+		        if (this.config.loc) {
+		            t.loc = {
+		                start: {
+		                    line: this.startMarker.line,
+		                    column: this.startMarker.column
+		                },
+		                end: {
+		                    line: this.scanner.lineNumber,
+		                    column: this.scanner.index - this.scanner.lineStart
+		                }
+		            };
+		        }
+		        if (token.type === 9 /* RegularExpression */) {
+		            var pattern = token.pattern;
+		            var flags = token.flags;
+		            t.regex = { pattern: pattern, flags: flags };
+		        }
+		        return t;
+		    };
+		    Parser.prototype.nextToken = function () {
+		        var token = this.lookahead;
+		        this.lastMarker.index = this.scanner.index;
+		        this.lastMarker.line = this.scanner.lineNumber;
+		        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+		        this.collectComments();
+		        if (this.scanner.index !== this.startMarker.index) {
+		            this.startMarker.index = this.scanner.index;
+		            this.startMarker.line = this.scanner.lineNumber;
+		            this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+		        }
+		        var next = this.scanner.lex();
+		        this.hasLineTerminator = (token.lineNumber !== next.lineNumber);
+		        if (next && this.context.strict && next.type === 3 /* Identifier */) {
+		            if (this.scanner.isStrictModeReservedWord(next.value)) {
+		                next.type = 4 /* Keyword */;
+		            }
+		        }
+		        this.lookahead = next;
+		        if (this.config.tokens && next.type !== 2 /* EOF */) {
+		            this.tokens.push(this.convertToken(next));
+		        }
+		        return token;
+		    };
+		    Parser.prototype.nextRegexToken = function () {
+		        this.collectComments();
+		        var token = this.scanner.scanRegExp();
+		        if (this.config.tokens) {
+		            // Pop the previous token, '/' or '/='
+		            // This is added from the lookahead token.
+		            this.tokens.pop();
+		            this.tokens.push(this.convertToken(token));
+		        }
+		        // Prime the next lookahead.
+		        this.lookahead = token;
+		        this.nextToken();
+		        return token;
+		    };
+		    Parser.prototype.createNode = function () {
+		        return {
+		            index: this.startMarker.index,
+		            line: this.startMarker.line,
+		            column: this.startMarker.column
+		        };
+		    };
+		    Parser.prototype.startNode = function (token, lastLineStart) {
+		        if (lastLineStart === void 0) { lastLineStart = 0; }
+		        var column = token.start - token.lineStart;
+		        var line = token.lineNumber;
+		        if (column < 0) {
+		            column += lastLineStart;
+		            line--;
+		        }
+		        return {
+		            index: token.start,
+		            line: line,
+		            column: column
+		        };
+		    };
+		    Parser.prototype.finalize = function (marker, node) {
+		        if (this.config.range) {
+		            node.range = [marker.index, this.lastMarker.index];
+		        }
+		        if (this.config.loc) {
+		            node.loc = {
+		                start: {
+		                    line: marker.line,
+		                    column: marker.column,
+		                },
+		                end: {
+		                    line: this.lastMarker.line,
+		                    column: this.lastMarker.column
+		                }
+		            };
+		            if (this.config.source) {
+		                node.loc.source = this.config.source;
+		            }
+		        }
+		        if (this.delegate) {
+		            var metadata = {
+		                start: {
+		                    line: marker.line,
+		                    column: marker.column,
+		                    offset: marker.index
+		                },
+		                end: {
+		                    line: this.lastMarker.line,
+		                    column: this.lastMarker.column,
+		                    offset: this.lastMarker.index
+		                }
+		            };
+		            this.delegate(node, metadata);
+		        }
+		        return node;
+		    };
+		    // Expect the next token to match the specified punctuator.
+		    // If not, an exception will be thrown.
+		    Parser.prototype.expect = function (value) {
+		        var token = this.nextToken();
+		        if (token.type !== 7 /* Punctuator */ || token.value !== value) {
+		            this.throwUnexpectedToken(token);
+		        }
+		    };
+		    // Quietly expect a comma when in tolerant mode, otherwise delegates to expect().
+		    Parser.prototype.expectCommaSeparator = function () {
+		        if (this.config.tolerant) {
+		            var token = this.lookahead;
+		            if (token.type === 7 /* Punctuator */ && token.value === ',') {
+		                this.nextToken();
+		            }
+		            else if (token.type === 7 /* Punctuator */ && token.value === ';') {
+		                this.nextToken();
+		                this.tolerateUnexpectedToken(token);
+		            }
+		            else {
+		                this.tolerateUnexpectedToken(token, messages_1.Messages.UnexpectedToken);
+		            }
+		        }
+		        else {
+		            this.expect(',');
+		        }
+		    };
+		    // Expect the next token to match the specified keyword.
+		    // If not, an exception will be thrown.
+		    Parser.prototype.expectKeyword = function (keyword) {
+		        var token = this.nextToken();
+		        if (token.type !== 4 /* Keyword */ || token.value !== keyword) {
+		            this.throwUnexpectedToken(token);
+		        }
+		    };
+		    // Return true if the next token matches the specified punctuator.
+		    Parser.prototype.match = function (value) {
+		        return this.lookahead.type === 7 /* Punctuator */ && this.lookahead.value === value;
+		    };
+		    // Return true if the next token matches the specified keyword
+		    Parser.prototype.matchKeyword = function (keyword) {
+		        return this.lookahead.type === 4 /* Keyword */ && this.lookahead.value === keyword;
+		    };
+		    // Return true if the next token matches the specified contextual keyword
+		    // (where an identifier is sometimes a keyword depending on the context)
+		    Parser.prototype.matchContextualKeyword = function (keyword) {
+		        return this.lookahead.type === 3 /* Identifier */ && this.lookahead.value === keyword;
+		    };
+		    // Return true if the next token is an assignment operator
+		    Parser.prototype.matchAssign = function () {
+		        if (this.lookahead.type !== 7 /* Punctuator */) {
+		            return false;
+		        }
+		        var op = this.lookahead.value;
+		        return op === '=' ||
+		            op === '*=' ||
+		            op === '**=' ||
+		            op === '/=' ||
+		            op === '%=' ||
+		            op === '+=' ||
+		            op === '-=' ||
+		            op === '<<=' ||
+		            op === '>>=' ||
+		            op === '>>>=' ||
+		            op === '&=' ||
+		            op === '^=' ||
+		            op === '|=';
+		    };
+		    // Cover grammar support.
+		    //
+		    // When an assignment expression position starts with an left parenthesis, the determination of the type
+		    // of the syntax is to be deferred arbitrarily long until the end of the parentheses pair (plus a lookahead)
+		    // or the first comma. This situation also defers the determination of all the expressions nested in the pair.
+		    //
+		    // There are three productions that can be parsed in a parentheses pair that needs to be determined
+		    // after the outermost pair is closed. They are:
+		    //
+		    //   1. AssignmentExpression
+		    //   2. BindingElements
+		    //   3. AssignmentTargets
+		    //
+		    // In order to avoid exponential backtracking, we use two flags to denote if the production can be
+		    // binding element or assignment target.
+		    //
+		    // The three productions have the relationship:
+		    //
+		    //   BindingElements ⊆ AssignmentTargets ⊆ AssignmentExpression
+		    //
+		    // with a single exception that CoverInitializedName when used directly in an Expression, generates
+		    // an early error. Therefore, we need the third state, firstCoverInitializedNameError, to track the
+		    // first usage of CoverInitializedName and report it when we reached the end of the parentheses pair.
+		    //
+		    // isolateCoverGrammar function runs the given parser function with a new cover grammar context, and it does not
+		    // effect the current flags. This means the production the parser parses is only used as an expression. Therefore
+		    // the CoverInitializedName check is conducted.
+		    //
+		    // inheritCoverGrammar function runs the given parse function with a new cover grammar context, and it propagates
+		    // the flags outside of the parser. This means the production the parser parses is used as a part of a potential
+		    // pattern. The CoverInitializedName check is deferred.
+		    Parser.prototype.isolateCoverGrammar = function (parseFunction) {
+		        var previousIsBindingElement = this.context.isBindingElement;
+		        var previousIsAssignmentTarget = this.context.isAssignmentTarget;
+		        var previousFirstCoverInitializedNameError = this.context.firstCoverInitializedNameError;
+		        this.context.isBindingElement = true;
+		        this.context.isAssignmentTarget = true;
+		        this.context.firstCoverInitializedNameError = null;
+		        var result = parseFunction.call(this);
+		        if (this.context.firstCoverInitializedNameError !== null) {
+		            this.throwUnexpectedToken(this.context.firstCoverInitializedNameError);
+		        }
+		        this.context.isBindingElement = previousIsBindingElement;
+		        this.context.isAssignmentTarget = previousIsAssignmentTarget;
+		        this.context.firstCoverInitializedNameError = previousFirstCoverInitializedNameError;
+		        return result;
+		    };
+		    Parser.prototype.inheritCoverGrammar = function (parseFunction) {
+		        var previousIsBindingElement = this.context.isBindingElement;
+		        var previousIsAssignmentTarget = this.context.isAssignmentTarget;
+		        var previousFirstCoverInitializedNameError = this.context.firstCoverInitializedNameError;
+		        this.context.isBindingElement = true;
+		        this.context.isAssignmentTarget = true;
+		        this.context.firstCoverInitializedNameError = null;
+		        var result = parseFunction.call(this);
+		        this.context.isBindingElement = this.context.isBindingElement && previousIsBindingElement;
+		        this.context.isAssignmentTarget = this.context.isAssignmentTarget && previousIsAssignmentTarget;
+		        this.context.firstCoverInitializedNameError = previousFirstCoverInitializedNameError || this.context.firstCoverInitializedNameError;
+		        return result;
+		    };
+		    Parser.prototype.consumeSemicolon = function () {
+		        if (this.match(';')) {
+		            this.nextToken();
+		        }
+		        else if (!this.hasLineTerminator) {
+		            if (this.lookahead.type !== 2 /* EOF */ && !this.match('}')) {
+		                this.throwUnexpectedToken(this.lookahead);
+		            }
+		            this.lastMarker.index = this.startMarker.index;
+		            this.lastMarker.line = this.startMarker.line;
+		            this.lastMarker.column = this.startMarker.column;
+		        }
+		    };
+		    // https://tc39.github.io/ecma262/#sec-primary-expression
+		    Parser.prototype.parsePrimaryExpression = function () {
+		        var node = this.createNode();
+		        var expr;
+		        var token, raw;
+		        switch (this.lookahead.type) {
+		            case 3 /* Identifier */:
+		                if ((this.context.isModule || this.context.await) && this.lookahead.value === 'await') {
+		                    this.tolerateUnexpectedToken(this.lookahead);
+		                }
+		                expr = this.matchAsyncFunction() ? this.parseFunctionExpression() : this.finalize(node, new Node.Identifier(this.nextToken().value));
+		                break;
+		            case 6 /* NumericLiteral */:
+		            case 8 /* StringLiteral */:
+		                if (this.context.strict && this.lookahead.octal) {
+		                    this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.StrictOctalLiteral);
+		                }
+		                this.context.isAssignmentTarget = false;
+		                this.context.isBindingElement = false;
+		                token = this.nextToken();
+		                raw = this.getTokenRaw(token);
+		                expr = this.finalize(node, new Node.Literal(token.value, raw));
+		                break;
+		            case 1 /* BooleanLiteral */:
+		                this.context.isAssignmentTarget = false;
+		                this.context.isBindingElement = false;
+		                token = this.nextToken();
+		                raw = this.getTokenRaw(token);
+		                expr = this.finalize(node, new Node.Literal(token.value === 'true', raw));
+		                break;
+		            case 5 /* NullLiteral */:
+		                this.context.isAssignmentTarget = false;
+		                this.context.isBindingElement = false;
+		                token = this.nextToken();
+		                raw = this.getTokenRaw(token);
+		                expr = this.finalize(node, new Node.Literal(null, raw));
+		                break;
+		            case 10 /* Template */:
+		                expr = this.parseTemplateLiteral();
+		                break;
+		            case 7 /* Punctuator */:
+		                switch (this.lookahead.value) {
+		                    case '(':
+		                        this.context.isBindingElement = false;
+		                        expr = this.inheritCoverGrammar(this.parseGroupExpression);
+		                        break;
+		                    case '[':
+		                        expr = this.inheritCoverGrammar(this.parseArrayInitializer);
+		                        break;
+		                    case '{':
+		                        expr = this.inheritCoverGrammar(this.parseObjectInitializer);
+		                        break;
+		                    case '/':
+		                    case '/=':
+		                        this.context.isAssignmentTarget = false;
+		                        this.context.isBindingElement = false;
+		                        this.scanner.index = this.startMarker.index;
+		                        token = this.nextRegexToken();
+		                        raw = this.getTokenRaw(token);
+		                        expr = this.finalize(node, new Node.RegexLiteral(token.regex, raw, token.pattern, token.flags));
+		                        break;
+		                    default:
+		                        expr = this.throwUnexpectedToken(this.nextToken());
+		                }
+		                break;
+		            case 4 /* Keyword */:
+		                if (!this.context.strict && this.context.allowYield && this.matchKeyword('yield')) {
+		                    expr = this.parseIdentifierName();
+		                }
+		                else if (!this.context.strict && this.matchKeyword('let')) {
+		                    expr = this.finalize(node, new Node.Identifier(this.nextToken().value));
+		                }
+		                else {
+		                    this.context.isAssignmentTarget = false;
+		                    this.context.isBindingElement = false;
+		                    if (this.matchKeyword('function')) {
+		                        expr = this.parseFunctionExpression();
+		                    }
+		                    else if (this.matchKeyword('this')) {
+		                        this.nextToken();
+		                        expr = this.finalize(node, new Node.ThisExpression());
+		                    }
+		                    else if (this.matchKeyword('class')) {
+		                        expr = this.parseClassExpression();
+		                    }
+		                    else {
+		                        expr = this.throwUnexpectedToken(this.nextToken());
+		                    }
+		                }
+		                break;
+		            default:
+		                expr = this.throwUnexpectedToken(this.nextToken());
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-array-initializer
+		    Parser.prototype.parseSpreadElement = function () {
+		        var node = this.createNode();
+		        this.expect('...');
+		        var arg = this.inheritCoverGrammar(this.parseAssignmentExpression);
+		        return this.finalize(node, new Node.SpreadElement(arg));
+		    };
+		    Parser.prototype.parseArrayInitializer = function () {
+		        var node = this.createNode();
+		        var elements = [];
+		        this.expect('[');
+		        while (!this.match(']')) {
+		            if (this.match(',')) {
+		                this.nextToken();
+		                elements.push(null);
+		            }
+		            else if (this.match('...')) {
+		                var element = this.parseSpreadElement();
+		                if (!this.match(']')) {
+		                    this.context.isAssignmentTarget = false;
+		                    this.context.isBindingElement = false;
+		                    this.expect(',');
+		                }
+		                elements.push(element);
+		            }
+		            else {
+		                elements.push(this.inheritCoverGrammar(this.parseAssignmentExpression));
+		                if (!this.match(']')) {
+		                    this.expect(',');
+		                }
+		            }
+		        }
+		        this.expect(']');
+		        return this.finalize(node, new Node.ArrayExpression(elements));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-object-initializer
+		    Parser.prototype.parsePropertyMethod = function (params) {
+		        this.context.isAssignmentTarget = false;
+		        this.context.isBindingElement = false;
+		        var previousStrict = this.context.strict;
+		        var previousAllowStrictDirective = this.context.allowStrictDirective;
+		        this.context.allowStrictDirective = params.simple;
+		        var body = this.isolateCoverGrammar(this.parseFunctionSourceElements);
+		        if (this.context.strict && params.firstRestricted) {
+		            this.tolerateUnexpectedToken(params.firstRestricted, params.message);
+		        }
+		        if (this.context.strict && params.stricted) {
+		            this.tolerateUnexpectedToken(params.stricted, params.message);
+		        }
+		        this.context.strict = previousStrict;
+		        this.context.allowStrictDirective = previousAllowStrictDirective;
+		        return body;
+		    };
+		    Parser.prototype.parsePropertyMethodFunction = function () {
+		        var isGenerator = false;
+		        var node = this.createNode();
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.allowYield = true;
+		        var params = this.parseFormalParameters();
+		        var method = this.parsePropertyMethod(params);
+		        this.context.allowYield = previousAllowYield;
+		        return this.finalize(node, new Node.FunctionExpression(null, params.params, method, isGenerator));
+		    };
+		    Parser.prototype.parsePropertyMethodAsyncFunction = function () {
+		        var node = this.createNode();
+		        var previousAllowYield = this.context.allowYield;
+		        var previousAwait = this.context.await;
+		        this.context.allowYield = false;
+		        this.context.await = true;
+		        var params = this.parseFormalParameters();
+		        var method = this.parsePropertyMethod(params);
+		        this.context.allowYield = previousAllowYield;
+		        this.context.await = previousAwait;
+		        return this.finalize(node, new Node.AsyncFunctionExpression(null, params.params, method));
+		    };
+		    Parser.prototype.parseObjectPropertyKey = function () {
+		        var node = this.createNode();
+		        var token = this.nextToken();
+		        var key;
+		        switch (token.type) {
+		            case 8 /* StringLiteral */:
+		            case 6 /* NumericLiteral */:
+		                if (this.context.strict && token.octal) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictOctalLiteral);
+		                }
+		                var raw = this.getTokenRaw(token);
+		                key = this.finalize(node, new Node.Literal(token.value, raw));
+		                break;
+		            case 3 /* Identifier */:
+		            case 1 /* BooleanLiteral */:
+		            case 5 /* NullLiteral */:
+		            case 4 /* Keyword */:
+		                key = this.finalize(node, new Node.Identifier(token.value));
+		                break;
+		            case 7 /* Punctuator */:
+		                if (token.value === '[') {
+		                    key = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                    this.expect(']');
+		                }
+		                else {
+		                    key = this.throwUnexpectedToken(token);
+		                }
+		                break;
+		            default:
+		                key = this.throwUnexpectedToken(token);
+		        }
+		        return key;
+		    };
+		    Parser.prototype.isPropertyKey = function (key, value) {
+		        return (key.type === syntax_1.Syntax.Identifier && key.name === value) ||
+		            (key.type === syntax_1.Syntax.Literal && key.value === value);
+		    };
+		    Parser.prototype.parseObjectProperty = function (hasProto) {
+		        var node = this.createNode();
+		        var token = this.lookahead;
+		        var kind;
+		        var key = null;
+		        var value = null;
+		        var computed = false;
+		        var method = false;
+		        var shorthand = false;
+		        var isAsync = false;
+		        if (token.type === 3 /* Identifier */) {
+		            var id = token.value;
+		            this.nextToken();
+		            computed = this.match('[');
+		            isAsync = !this.hasLineTerminator && (id === 'async') &&
+		                !this.match(':') && !this.match('(') && !this.match('*') && !this.match(',');
+		            key = isAsync ? this.parseObjectPropertyKey() : this.finalize(node, new Node.Identifier(id));
+		        }
+		        else if (this.match('*')) {
+		            this.nextToken();
+		        }
+		        else {
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		        }
+		        var lookaheadPropertyKey = this.qualifiedPropertyName(this.lookahead);
+		        if (token.type === 3 /* Identifier */ && !isAsync && token.value === 'get' && lookaheadPropertyKey) {
+		            kind = 'get';
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            this.context.allowYield = false;
+		            value = this.parseGetterMethod();
+		        }
+		        else if (token.type === 3 /* Identifier */ && !isAsync && token.value === 'set' && lookaheadPropertyKey) {
+		            kind = 'set';
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            value = this.parseSetterMethod();
+		        }
+		        else if (token.type === 7 /* Punctuator */ && token.value === '*' && lookaheadPropertyKey) {
+		            kind = 'init';
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            value = this.parseGeneratorMethod();
+		            method = true;
+		        }
+		        else {
+		            if (!key) {
+		                this.throwUnexpectedToken(this.lookahead);
+		            }
+		            kind = 'init';
+		            if (this.match(':') && !isAsync) {
+		                if (!computed && this.isPropertyKey(key, '__proto__')) {
+		                    if (hasProto.value) {
+		                        this.tolerateError(messages_1.Messages.DuplicateProtoProperty);
+		                    }
+		                    hasProto.value = true;
+		                }
+		                this.nextToken();
+		                value = this.inheritCoverGrammar(this.parseAssignmentExpression);
+		            }
+		            else if (this.match('(')) {
+		                value = isAsync ? this.parsePropertyMethodAsyncFunction() : this.parsePropertyMethodFunction();
+		                method = true;
+		            }
+		            else if (token.type === 3 /* Identifier */) {
+		                var id = this.finalize(node, new Node.Identifier(token.value));
+		                if (this.match('=')) {
+		                    this.context.firstCoverInitializedNameError = this.lookahead;
+		                    this.nextToken();
+		                    shorthand = true;
+		                    var init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                    value = this.finalize(node, new Node.AssignmentPattern(id, init));
+		                }
+		                else {
+		                    shorthand = true;
+		                    value = id;
+		                }
+		            }
+		            else {
+		                this.throwUnexpectedToken(this.nextToken());
+		            }
+		        }
+		        return this.finalize(node, new Node.Property(kind, key, computed, value, method, shorthand));
+		    };
+		    Parser.prototype.parseObjectInitializer = function () {
+		        var node = this.createNode();
+		        this.expect('{');
+		        var properties = [];
+		        var hasProto = { value: false };
+		        while (!this.match('}')) {
+		            properties.push(this.parseObjectProperty(hasProto));
+		            if (!this.match('}')) {
+		                this.expectCommaSeparator();
+		            }
+		        }
+		        this.expect('}');
+		        return this.finalize(node, new Node.ObjectExpression(properties));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-template-literals
+		    Parser.prototype.parseTemplateHead = function () {
+		        assert_1.assert(this.lookahead.head, 'Template literal must start with a template head');
+		        var node = this.createNode();
+		        var token = this.nextToken();
+		        var raw = token.value;
+		        var cooked = token.cooked;
+		        return this.finalize(node, new Node.TemplateElement({ raw: raw, cooked: cooked }, token.tail));
+		    };
+		    Parser.prototype.parseTemplateElement = function () {
+		        if (this.lookahead.type !== 10 /* Template */) {
+		            this.throwUnexpectedToken();
+		        }
+		        var node = this.createNode();
+		        var token = this.nextToken();
+		        var raw = token.value;
+		        var cooked = token.cooked;
+		        return this.finalize(node, new Node.TemplateElement({ raw: raw, cooked: cooked }, token.tail));
+		    };
+		    Parser.prototype.parseTemplateLiteral = function () {
+		        var node = this.createNode();
+		        var expressions = [];
+		        var quasis = [];
+		        var quasi = this.parseTemplateHead();
+		        quasis.push(quasi);
+		        while (!quasi.tail) {
+		            expressions.push(this.parseExpression());
+		            quasi = this.parseTemplateElement();
+		            quasis.push(quasi);
+		        }
+		        return this.finalize(node, new Node.TemplateLiteral(quasis, expressions));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-grouping-operator
+		    Parser.prototype.reinterpretExpressionAsPattern = function (expr) {
+		        switch (expr.type) {
+		            case syntax_1.Syntax.Identifier:
+		            case syntax_1.Syntax.MemberExpression:
+		            case syntax_1.Syntax.RestElement:
+		            case syntax_1.Syntax.AssignmentPattern:
+		                break;
+		            case syntax_1.Syntax.SpreadElement:
+		                expr.type = syntax_1.Syntax.RestElement;
+		                this.reinterpretExpressionAsPattern(expr.argument);
+		                break;
+		            case syntax_1.Syntax.ArrayExpression:
+		                expr.type = syntax_1.Syntax.ArrayPattern;
+		                for (var i = 0; i < expr.elements.length; i++) {
+		                    if (expr.elements[i] !== null) {
+		                        this.reinterpretExpressionAsPattern(expr.elements[i]);
+		                    }
+		                }
+		                break;
+		            case syntax_1.Syntax.ObjectExpression:
+		                expr.type = syntax_1.Syntax.ObjectPattern;
+		                for (var i = 0; i < expr.properties.length; i++) {
+		                    this.reinterpretExpressionAsPattern(expr.properties[i].value);
+		                }
+		                break;
+		            case syntax_1.Syntax.AssignmentExpression:
+		                expr.type = syntax_1.Syntax.AssignmentPattern;
+		                delete expr.operator;
+		                this.reinterpretExpressionAsPattern(expr.left);
+		                break;
+		            default:
+		                // Allow other node type for tolerant parsing.
+		                break;
+		        }
+		    };
+		    Parser.prototype.parseGroupExpression = function () {
+		        var expr;
+		        this.expect('(');
+		        if (this.match(')')) {
+		            this.nextToken();
+		            if (!this.match('=>')) {
+		                this.expect('=>');
+		            }
+		            expr = {
+		                type: ArrowParameterPlaceHolder,
+		                params: [],
+		                async: false
+		            };
+		        }
+		        else {
+		            var startToken = this.lookahead;
+		            var params = [];
+		            if (this.match('...')) {
+		                expr = this.parseRestElement(params);
+		                this.expect(')');
+		                if (!this.match('=>')) {
+		                    this.expect('=>');
+		                }
+		                expr = {
+		                    type: ArrowParameterPlaceHolder,
+		                    params: [expr],
+		                    async: false
+		                };
+		            }
+		            else {
+		                var arrow = false;
+		                this.context.isBindingElement = true;
+		                expr = this.inheritCoverGrammar(this.parseAssignmentExpression);
+		                if (this.match(',')) {
+		                    var expressions = [];
+		                    this.context.isAssignmentTarget = false;
+		                    expressions.push(expr);
+		                    while (this.lookahead.type !== 2 /* EOF */) {
+		                        if (!this.match(',')) {
+		                            break;
+		                        }
+		                        this.nextToken();
+		                        if (this.match(')')) {
+		                            this.nextToken();
+		                            for (var i = 0; i < expressions.length; i++) {
+		                                this.reinterpretExpressionAsPattern(expressions[i]);
+		                            }
+		                            arrow = true;
+		                            expr = {
+		                                type: ArrowParameterPlaceHolder,
+		                                params: expressions,
+		                                async: false
+		                            };
+		                        }
+		                        else if (this.match('...')) {
+		                            if (!this.context.isBindingElement) {
+		                                this.throwUnexpectedToken(this.lookahead);
+		                            }
+		                            expressions.push(this.parseRestElement(params));
+		                            this.expect(')');
+		                            if (!this.match('=>')) {
+		                                this.expect('=>');
+		                            }
+		                            this.context.isBindingElement = false;
+		                            for (var i = 0; i < expressions.length; i++) {
+		                                this.reinterpretExpressionAsPattern(expressions[i]);
+		                            }
+		                            arrow = true;
+		                            expr = {
+		                                type: ArrowParameterPlaceHolder,
+		                                params: expressions,
+		                                async: false
+		                            };
+		                        }
+		                        else {
+		                            expressions.push(this.inheritCoverGrammar(this.parseAssignmentExpression));
+		                        }
+		                        if (arrow) {
+		                            break;
+		                        }
+		                    }
+		                    if (!arrow) {
+		                        expr = this.finalize(this.startNode(startToken), new Node.SequenceExpression(expressions));
+		                    }
+		                }
+		                if (!arrow) {
+		                    this.expect(')');
+		                    if (this.match('=>')) {
+		                        if (expr.type === syntax_1.Syntax.Identifier && expr.name === 'yield') {
+		                            arrow = true;
+		                            expr = {
+		                                type: ArrowParameterPlaceHolder,
+		                                params: [expr],
+		                                async: false
+		                            };
+		                        }
+		                        if (!arrow) {
+		                            if (!this.context.isBindingElement) {
+		                                this.throwUnexpectedToken(this.lookahead);
+		                            }
+		                            if (expr.type === syntax_1.Syntax.SequenceExpression) {
+		                                for (var i = 0; i < expr.expressions.length; i++) {
+		                                    this.reinterpretExpressionAsPattern(expr.expressions[i]);
+		                                }
+		                            }
+		                            else {
+		                                this.reinterpretExpressionAsPattern(expr);
+		                            }
+		                            var parameters = (expr.type === syntax_1.Syntax.SequenceExpression ? expr.expressions : [expr]);
+		                            expr = {
+		                                type: ArrowParameterPlaceHolder,
+		                                params: parameters,
+		                                async: false
+		                            };
+		                        }
+		                    }
+		                    this.context.isBindingElement = false;
+		                }
+		            }
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-left-hand-side-expressions
+		    Parser.prototype.parseArguments = function () {
+		        this.expect('(');
+		        var args = [];
+		        if (!this.match(')')) {
+		            while (true) {
+		                var expr = this.match('...') ? this.parseSpreadElement() :
+		                    this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                args.push(expr);
+		                if (this.match(')')) {
+		                    break;
+		                }
+		                this.expectCommaSeparator();
+		                if (this.match(')')) {
+		                    break;
+		                }
+		            }
+		        }
+		        this.expect(')');
+		        return args;
+		    };
+		    Parser.prototype.isIdentifierName = function (token) {
+		        return token.type === 3 /* Identifier */ ||
+		            token.type === 4 /* Keyword */ ||
+		            token.type === 1 /* BooleanLiteral */ ||
+		            token.type === 5 /* NullLiteral */;
+		    };
+		    Parser.prototype.parseIdentifierName = function () {
+		        var node = this.createNode();
+		        var token = this.nextToken();
+		        if (!this.isIdentifierName(token)) {
+		            this.throwUnexpectedToken(token);
+		        }
+		        return this.finalize(node, new Node.Identifier(token.value));
+		    };
+		    Parser.prototype.parseNewExpression = function () {
+		        var node = this.createNode();
+		        var id = this.parseIdentifierName();
+		        assert_1.assert(id.name === 'new', 'New expression must start with `new`');
+		        var expr;
+		        if (this.match('.')) {
+		            this.nextToken();
+		            if (this.lookahead.type === 3 /* Identifier */ && this.context.inFunctionBody && this.lookahead.value === 'target') {
+		                var property = this.parseIdentifierName();
+		                expr = new Node.MetaProperty(id, property);
+		            }
+		            else {
+		                this.throwUnexpectedToken(this.lookahead);
+		            }
+		        }
+		        else {
+		            var callee = this.isolateCoverGrammar(this.parseLeftHandSideExpression);
+		            var args = this.match('(') ? this.parseArguments() : [];
+		            expr = new Node.NewExpression(callee, args);
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		        }
+		        return this.finalize(node, expr);
+		    };
+		    Parser.prototype.parseAsyncArgument = function () {
+		        var arg = this.parseAssignmentExpression();
+		        this.context.firstCoverInitializedNameError = null;
+		        return arg;
+		    };
+		    Parser.prototype.parseAsyncArguments = function () {
+		        this.expect('(');
+		        var args = [];
+		        if (!this.match(')')) {
+		            while (true) {
+		                var expr = this.match('...') ? this.parseSpreadElement() :
+		                    this.isolateCoverGrammar(this.parseAsyncArgument);
+		                args.push(expr);
+		                if (this.match(')')) {
+		                    break;
+		                }
+		                this.expectCommaSeparator();
+		                if (this.match(')')) {
+		                    break;
+		                }
+		            }
+		        }
+		        this.expect(')');
+		        return args;
+		    };
+		    Parser.prototype.parseLeftHandSideExpressionAllowCall = function () {
+		        var startToken = this.lookahead;
+		        var maybeAsync = this.matchContextualKeyword('async');
+		        var previousAllowIn = this.context.allowIn;
+		        this.context.allowIn = true;
+		        var expr;
+		        if (this.matchKeyword('super') && this.context.inFunctionBody) {
+		            expr = this.createNode();
+		            this.nextToken();
+		            expr = this.finalize(expr, new Node.Super());
+		            if (!this.match('(') && !this.match('.') && !this.match('[')) {
+		                this.throwUnexpectedToken(this.lookahead);
+		            }
+		        }
+		        else {
+		            expr = this.inheritCoverGrammar(this.matchKeyword('new') ? this.parseNewExpression : this.parsePrimaryExpression);
+		        }
+		        while (true) {
+		            if (this.match('.')) {
+		                this.context.isBindingElement = false;
+		                this.context.isAssignmentTarget = true;
+		                this.expect('.');
+		                var property = this.parseIdentifierName();
+		                expr = this.finalize(this.startNode(startToken), new Node.StaticMemberExpression(expr, property));
+		            }
+		            else if (this.match('(')) {
+		                var asyncArrow = maybeAsync && (startToken.lineNumber === this.lookahead.lineNumber);
+		                this.context.isBindingElement = false;
+		                this.context.isAssignmentTarget = false;
+		                var args = asyncArrow ? this.parseAsyncArguments() : this.parseArguments();
+		                expr = this.finalize(this.startNode(startToken), new Node.CallExpression(expr, args));
+		                if (asyncArrow && this.match('=>')) {
+		                    for (var i = 0; i < args.length; ++i) {
+		                        this.reinterpretExpressionAsPattern(args[i]);
+		                    }
+		                    expr = {
+		                        type: ArrowParameterPlaceHolder,
+		                        params: args,
+		                        async: true
+		                    };
+		                }
+		            }
+		            else if (this.match('[')) {
+		                this.context.isBindingElement = false;
+		                this.context.isAssignmentTarget = true;
+		                this.expect('[');
+		                var property = this.isolateCoverGrammar(this.parseExpression);
+		                this.expect(']');
+		                expr = this.finalize(this.startNode(startToken), new Node.ComputedMemberExpression(expr, property));
+		            }
+		            else if (this.lookahead.type === 10 /* Template */ && this.lookahead.head) {
+		                var quasi = this.parseTemplateLiteral();
+		                expr = this.finalize(this.startNode(startToken), new Node.TaggedTemplateExpression(expr, quasi));
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        this.context.allowIn = previousAllowIn;
+		        return expr;
+		    };
+		    Parser.prototype.parseSuper = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('super');
+		        if (!this.match('[') && !this.match('.')) {
+		            this.throwUnexpectedToken(this.lookahead);
+		        }
+		        return this.finalize(node, new Node.Super());
+		    };
+		    Parser.prototype.parseLeftHandSideExpression = function () {
+		        assert_1.assert(this.context.allowIn, 'callee of new expression always allow in keyword.');
+		        var node = this.startNode(this.lookahead);
+		        var expr = (this.matchKeyword('super') && this.context.inFunctionBody) ? this.parseSuper() :
+		            this.inheritCoverGrammar(this.matchKeyword('new') ? this.parseNewExpression : this.parsePrimaryExpression);
+		        while (true) {
+		            if (this.match('[')) {
+		                this.context.isBindingElement = false;
+		                this.context.isAssignmentTarget = true;
+		                this.expect('[');
+		                var property = this.isolateCoverGrammar(this.parseExpression);
+		                this.expect(']');
+		                expr = this.finalize(node, new Node.ComputedMemberExpression(expr, property));
+		            }
+		            else if (this.match('.')) {
+		                this.context.isBindingElement = false;
+		                this.context.isAssignmentTarget = true;
+		                this.expect('.');
+		                var property = this.parseIdentifierName();
+		                expr = this.finalize(node, new Node.StaticMemberExpression(expr, property));
+		            }
+		            else if (this.lookahead.type === 10 /* Template */ && this.lookahead.head) {
+		                var quasi = this.parseTemplateLiteral();
+		                expr = this.finalize(node, new Node.TaggedTemplateExpression(expr, quasi));
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-update-expressions
+		    Parser.prototype.parseUpdateExpression = function () {
+		        var expr;
+		        var startToken = this.lookahead;
+		        if (this.match('++') || this.match('--')) {
+		            var node = this.startNode(startToken);
+		            var token = this.nextToken();
+		            expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+		            if (this.context.strict && expr.type === syntax_1.Syntax.Identifier && this.scanner.isRestrictedWord(expr.name)) {
+		                this.tolerateError(messages_1.Messages.StrictLHSPrefix);
+		            }
+		            if (!this.context.isAssignmentTarget) {
+		                this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+		            }
+		            var prefix = true;
+		            expr = this.finalize(node, new Node.UpdateExpression(token.value, expr, prefix));
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		        }
+		        else {
+		            expr = this.inheritCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+		            if (!this.hasLineTerminator && this.lookahead.type === 7 /* Punctuator */) {
+		                if (this.match('++') || this.match('--')) {
+		                    if (this.context.strict && expr.type === syntax_1.Syntax.Identifier && this.scanner.isRestrictedWord(expr.name)) {
+		                        this.tolerateError(messages_1.Messages.StrictLHSPostfix);
+		                    }
+		                    if (!this.context.isAssignmentTarget) {
+		                        this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+		                    }
+		                    this.context.isAssignmentTarget = false;
+		                    this.context.isBindingElement = false;
+		                    var operator = this.nextToken().value;
+		                    var prefix = false;
+		                    expr = this.finalize(this.startNode(startToken), new Node.UpdateExpression(operator, expr, prefix));
+		                }
+		            }
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-unary-operators
+		    Parser.prototype.parseAwaitExpression = function () {
+		        var node = this.createNode();
+		        this.nextToken();
+		        var argument = this.parseUnaryExpression();
+		        return this.finalize(node, new Node.AwaitExpression(argument));
+		    };
+		    Parser.prototype.parseUnaryExpression = function () {
+		        var expr;
+		        if (this.match('+') || this.match('-') || this.match('~') || this.match('!') ||
+		            this.matchKeyword('delete') || this.matchKeyword('void') || this.matchKeyword('typeof')) {
+		            var node = this.startNode(this.lookahead);
+		            var token = this.nextToken();
+		            expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+		            expr = this.finalize(node, new Node.UnaryExpression(token.value, expr));
+		            if (this.context.strict && expr.operator === 'delete' && expr.argument.type === syntax_1.Syntax.Identifier) {
+		                this.tolerateError(messages_1.Messages.StrictDelete);
+		            }
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		        }
+		        else if (this.context.await && this.matchContextualKeyword('await')) {
+		            expr = this.parseAwaitExpression();
+		        }
+		        else {
+		            expr = this.parseUpdateExpression();
+		        }
+		        return expr;
+		    };
+		    Parser.prototype.parseExponentiationExpression = function () {
+		        var startToken = this.lookahead;
+		        var expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+		        if (expr.type !== syntax_1.Syntax.UnaryExpression && this.match('**')) {
+		            this.nextToken();
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		            var left = expr;
+		            var right = this.isolateCoverGrammar(this.parseExponentiationExpression);
+		            expr = this.finalize(this.startNode(startToken), new Node.BinaryExpression('**', left, right));
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-exp-operator
+		    // https://tc39.github.io/ecma262/#sec-multiplicative-operators
+		    // https://tc39.github.io/ecma262/#sec-additive-operators
+		    // https://tc39.github.io/ecma262/#sec-bitwise-shift-operators
+		    // https://tc39.github.io/ecma262/#sec-relational-operators
+		    // https://tc39.github.io/ecma262/#sec-equality-operators
+		    // https://tc39.github.io/ecma262/#sec-binary-bitwise-operators
+		    // https://tc39.github.io/ecma262/#sec-binary-logical-operators
+		    Parser.prototype.binaryPrecedence = function (token) {
+		        var op = token.value;
+		        var precedence;
+		        if (token.type === 7 /* Punctuator */) {
+		            precedence = this.operatorPrecedence[op] || 0;
+		        }
+		        else if (token.type === 4 /* Keyword */) {
+		            precedence = (op === 'instanceof' || (this.context.allowIn && op === 'in')) ? 7 : 0;
+		        }
+		        else {
+		            precedence = 0;
+		        }
+		        return precedence;
+		    };
+		    Parser.prototype.parseBinaryExpression = function () {
+		        var startToken = this.lookahead;
+		        var expr = this.inheritCoverGrammar(this.parseExponentiationExpression);
+		        var token = this.lookahead;
+		        var prec = this.binaryPrecedence(token);
+		        if (prec > 0) {
+		            this.nextToken();
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		            var markers = [startToken, this.lookahead];
+		            var left = expr;
+		            var right = this.isolateCoverGrammar(this.parseExponentiationExpression);
+		            var stack = [left, token.value, right];
+		            var precedences = [prec];
+		            while (true) {
+		                prec = this.binaryPrecedence(this.lookahead);
+		                if (prec <= 0) {
+		                    break;
+		                }
+		                // Reduce: make a binary expression from the three topmost entries.
+		                while ((stack.length > 2) && (prec <= precedences[precedences.length - 1])) {
+		                    right = stack.pop();
+		                    var operator = stack.pop();
+		                    precedences.pop();
+		                    left = stack.pop();
+		                    markers.pop();
+		                    var node = this.startNode(markers[markers.length - 1]);
+		                    stack.push(this.finalize(node, new Node.BinaryExpression(operator, left, right)));
+		                }
+		                // Shift.
+		                stack.push(this.nextToken().value);
+		                precedences.push(prec);
+		                markers.push(this.lookahead);
+		                stack.push(this.isolateCoverGrammar(this.parseExponentiationExpression));
+		            }
+		            // Final reduce to clean-up the stack.
+		            var i = stack.length - 1;
+		            expr = stack[i];
+		            var lastMarker = markers.pop();
+		            while (i > 1) {
+		                var marker = markers.pop();
+		                var lastLineStart = lastMarker && lastMarker.lineStart;
+		                var node = this.startNode(marker, lastLineStart);
+		                var operator = stack[i - 1];
+		                expr = this.finalize(node, new Node.BinaryExpression(operator, stack[i - 2], expr));
+		                i -= 2;
+		                lastMarker = marker;
+		            }
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-conditional-operator
+		    Parser.prototype.parseConditionalExpression = function () {
+		        var startToken = this.lookahead;
+		        var expr = this.inheritCoverGrammar(this.parseBinaryExpression);
+		        if (this.match('?')) {
+		            this.nextToken();
+		            var previousAllowIn = this.context.allowIn;
+		            this.context.allowIn = true;
+		            var consequent = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		            this.context.allowIn = previousAllowIn;
+		            this.expect(':');
+		            var alternate = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		            expr = this.finalize(this.startNode(startToken), new Node.ConditionalExpression(expr, consequent, alternate));
+		            this.context.isAssignmentTarget = false;
+		            this.context.isBindingElement = false;
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-assignment-operators
+		    Parser.prototype.checkPatternParam = function (options, param) {
+		        switch (param.type) {
+		            case syntax_1.Syntax.Identifier:
+		                this.validateParam(options, param, param.name);
+		                break;
+		            case syntax_1.Syntax.RestElement:
+		                this.checkPatternParam(options, param.argument);
+		                break;
+		            case syntax_1.Syntax.AssignmentPattern:
+		                this.checkPatternParam(options, param.left);
+		                break;
+		            case syntax_1.Syntax.ArrayPattern:
+		                for (var i = 0; i < param.elements.length; i++) {
+		                    if (param.elements[i] !== null) {
+		                        this.checkPatternParam(options, param.elements[i]);
+		                    }
+		                }
+		                break;
+		            case syntax_1.Syntax.ObjectPattern:
+		                for (var i = 0; i < param.properties.length; i++) {
+		                    this.checkPatternParam(options, param.properties[i].value);
+		                }
+		                break;
+		            default:
+		                break;
+		        }
+		        options.simple = options.simple && (param instanceof Node.Identifier);
+		    };
+		    Parser.prototype.reinterpretAsCoverFormalsList = function (expr) {
+		        var params = [expr];
+		        var options;
+		        var asyncArrow = false;
+		        switch (expr.type) {
+		            case syntax_1.Syntax.Identifier:
+		                break;
+		            case ArrowParameterPlaceHolder:
+		                params = expr.params;
+		                asyncArrow = expr.async;
+		                break;
+		            default:
+		                return null;
+		        }
+		        options = {
+		            simple: true,
+		            paramSet: {}
+		        };
+		        for (var i = 0; i < params.length; ++i) {
+		            var param = params[i];
+		            if (param.type === syntax_1.Syntax.AssignmentPattern) {
+		                if (param.right.type === syntax_1.Syntax.YieldExpression) {
+		                    if (param.right.argument) {
+		                        this.throwUnexpectedToken(this.lookahead);
+		                    }
+		                    param.right.type = syntax_1.Syntax.Identifier;
+		                    param.right.name = 'yield';
+		                    delete param.right.argument;
+		                    delete param.right.delegate;
+		                }
+		            }
+		            else if (asyncArrow && param.type === syntax_1.Syntax.Identifier && param.name === 'await') {
+		                this.throwUnexpectedToken(this.lookahead);
+		            }
+		            this.checkPatternParam(options, param);
+		            params[i] = param;
+		        }
+		        if (this.context.strict || !this.context.allowYield) {
+		            for (var i = 0; i < params.length; ++i) {
+		                var param = params[i];
+		                if (param.type === syntax_1.Syntax.YieldExpression) {
+		                    this.throwUnexpectedToken(this.lookahead);
+		                }
+		            }
+		        }
+		        if (options.message === messages_1.Messages.StrictParamDupe) {
+		            var token = this.context.strict ? options.stricted : options.firstRestricted;
+		            this.throwUnexpectedToken(token, options.message);
+		        }
+		        return {
+		            simple: options.simple,
+		            params: params,
+		            stricted: options.stricted,
+		            firstRestricted: options.firstRestricted,
+		            message: options.message
+		        };
+		    };
+		    Parser.prototype.parseAssignmentExpression = function () {
+		        var expr;
+		        if (!this.context.allowYield && this.matchKeyword('yield')) {
+		            expr = this.parseYieldExpression();
+		        }
+		        else {
+		            var startToken = this.lookahead;
+		            var token = startToken;
+		            expr = this.parseConditionalExpression();
+		            if (token.type === 3 /* Identifier */ && (token.lineNumber === this.lookahead.lineNumber) && token.value === 'async') {
+		                if (this.lookahead.type === 3 /* Identifier */ || this.matchKeyword('yield')) {
+		                    var arg = this.parsePrimaryExpression();
+		                    this.reinterpretExpressionAsPattern(arg);
+		                    expr = {
+		                        type: ArrowParameterPlaceHolder,
+		                        params: [arg],
+		                        async: true
+		                    };
+		                }
+		            }
+		            if (expr.type === ArrowParameterPlaceHolder || this.match('=>')) {
+		                // https://tc39.github.io/ecma262/#sec-arrow-function-definitions
+		                this.context.isAssignmentTarget = false;
+		                this.context.isBindingElement = false;
+		                var isAsync = expr.async;
+		                var list = this.reinterpretAsCoverFormalsList(expr);
+		                if (list) {
+		                    if (this.hasLineTerminator) {
+		                        this.tolerateUnexpectedToken(this.lookahead);
+		                    }
+		                    this.context.firstCoverInitializedNameError = null;
+		                    var previousStrict = this.context.strict;
+		                    var previousAllowStrictDirective = this.context.allowStrictDirective;
+		                    this.context.allowStrictDirective = list.simple;
+		                    var previousAllowYield = this.context.allowYield;
+		                    var previousAwait = this.context.await;
+		                    this.context.allowYield = true;
+		                    this.context.await = isAsync;
+		                    var node = this.startNode(startToken);
+		                    this.expect('=>');
+		                    var body = void 0;
+		                    if (this.match('{')) {
+		                        var previousAllowIn = this.context.allowIn;
+		                        this.context.allowIn = true;
+		                        body = this.parseFunctionSourceElements();
+		                        this.context.allowIn = previousAllowIn;
+		                    }
+		                    else {
+		                        body = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                    }
+		                    var expression = body.type !== syntax_1.Syntax.BlockStatement;
+		                    if (this.context.strict && list.firstRestricted) {
+		                        this.throwUnexpectedToken(list.firstRestricted, list.message);
+		                    }
+		                    if (this.context.strict && list.stricted) {
+		                        this.tolerateUnexpectedToken(list.stricted, list.message);
+		                    }
+		                    expr = isAsync ? this.finalize(node, new Node.AsyncArrowFunctionExpression(list.params, body, expression)) :
+		                        this.finalize(node, new Node.ArrowFunctionExpression(list.params, body, expression));
+		                    this.context.strict = previousStrict;
+		                    this.context.allowStrictDirective = previousAllowStrictDirective;
+		                    this.context.allowYield = previousAllowYield;
+		                    this.context.await = previousAwait;
+		                }
+		            }
+		            else {
+		                if (this.matchAssign()) {
+		                    if (!this.context.isAssignmentTarget) {
+		                        this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+		                    }
+		                    if (this.context.strict && expr.type === syntax_1.Syntax.Identifier) {
+		                        var id = expr;
+		                        if (this.scanner.isRestrictedWord(id.name)) {
+		                            this.tolerateUnexpectedToken(token, messages_1.Messages.StrictLHSAssignment);
+		                        }
+		                        if (this.scanner.isStrictModeReservedWord(id.name)) {
+		                            this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+		                        }
+		                    }
+		                    if (!this.match('=')) {
+		                        this.context.isAssignmentTarget = false;
+		                        this.context.isBindingElement = false;
+		                    }
+		                    else {
+		                        this.reinterpretExpressionAsPattern(expr);
+		                    }
+		                    token = this.nextToken();
+		                    var operator = token.value;
+		                    var right = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                    expr = this.finalize(this.startNode(startToken), new Node.AssignmentExpression(operator, expr, right));
+		                    this.context.firstCoverInitializedNameError = null;
+		                }
+		            }
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-comma-operator
+		    Parser.prototype.parseExpression = function () {
+		        var startToken = this.lookahead;
+		        var expr = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		        if (this.match(',')) {
+		            var expressions = [];
+		            expressions.push(expr);
+		            while (this.lookahead.type !== 2 /* EOF */) {
+		                if (!this.match(',')) {
+		                    break;
+		                }
+		                this.nextToken();
+		                expressions.push(this.isolateCoverGrammar(this.parseAssignmentExpression));
+		            }
+		            expr = this.finalize(this.startNode(startToken), new Node.SequenceExpression(expressions));
+		        }
+		        return expr;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-block
+		    Parser.prototype.parseStatementListItem = function () {
+		        var statement;
+		        this.context.isAssignmentTarget = true;
+		        this.context.isBindingElement = true;
+		        if (this.lookahead.type === 4 /* Keyword */) {
+		            switch (this.lookahead.value) {
+		                case 'export':
+		                    if (!this.context.isModule) {
+		                        this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.IllegalExportDeclaration);
+		                    }
+		                    statement = this.parseExportDeclaration();
+		                    break;
+		                case 'import':
+		                    if (!this.context.isModule) {
+		                        this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.IllegalImportDeclaration);
+		                    }
+		                    statement = this.parseImportDeclaration();
+		                    break;
+		                case 'const':
+		                    statement = this.parseLexicalDeclaration({ inFor: false });
+		                    break;
+		                case 'function':
+		                    statement = this.parseFunctionDeclaration();
+		                    break;
+		                case 'class':
+		                    statement = this.parseClassDeclaration();
+		                    break;
+		                case 'let':
+		                    statement = this.isLexicalDeclaration() ? this.parseLexicalDeclaration({ inFor: false }) : this.parseStatement();
+		                    break;
+		                default:
+		                    statement = this.parseStatement();
+		                    break;
+		            }
+		        }
+		        else {
+		            statement = this.parseStatement();
+		        }
+		        return statement;
+		    };
+		    Parser.prototype.parseBlock = function () {
+		        var node = this.createNode();
+		        this.expect('{');
+		        var block = [];
+		        while (true) {
+		            if (this.match('}')) {
+		                break;
+		            }
+		            block.push(this.parseStatementListItem());
+		        }
+		        this.expect('}');
+		        return this.finalize(node, new Node.BlockStatement(block));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-let-and-const-declarations
+		    Parser.prototype.parseLexicalBinding = function (kind, options) {
+		        var node = this.createNode();
+		        var params = [];
+		        var id = this.parsePattern(params, kind);
+		        if (this.context.strict && id.type === syntax_1.Syntax.Identifier) {
+		            if (this.scanner.isRestrictedWord(id.name)) {
+		                this.tolerateError(messages_1.Messages.StrictVarName);
+		            }
+		        }
+		        var init = null;
+		        if (kind === 'const') {
+		            if (!this.matchKeyword('in') && !this.matchContextualKeyword('of')) {
+		                if (this.match('=')) {
+		                    this.nextToken();
+		                    init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		                }
+		                else {
+		                    this.throwError(messages_1.Messages.DeclarationMissingInitializer, 'const');
+		                }
+		            }
+		        }
+		        else if ((!options.inFor && id.type !== syntax_1.Syntax.Identifier) || this.match('=')) {
+		            this.expect('=');
+		            init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		        }
+		        return this.finalize(node, new Node.VariableDeclarator(id, init));
+		    };
+		    Parser.prototype.parseBindingList = function (kind, options) {
+		        var list = [this.parseLexicalBinding(kind, options)];
+		        while (this.match(',')) {
+		            this.nextToken();
+		            list.push(this.parseLexicalBinding(kind, options));
+		        }
+		        return list;
+		    };
+		    Parser.prototype.isLexicalDeclaration = function () {
+		        var state = this.scanner.saveState();
+		        this.scanner.scanComments();
+		        var next = this.scanner.lex();
+		        this.scanner.restoreState(state);
+		        return (next.type === 3 /* Identifier */) ||
+		            (next.type === 7 /* Punctuator */ && next.value === '[') ||
+		            (next.type === 7 /* Punctuator */ && next.value === '{') ||
+		            (next.type === 4 /* Keyword */ && next.value === 'let') ||
+		            (next.type === 4 /* Keyword */ && next.value === 'yield');
+		    };
+		    Parser.prototype.parseLexicalDeclaration = function (options) {
+		        var node = this.createNode();
+		        var kind = this.nextToken().value;
+		        assert_1.assert(kind === 'let' || kind === 'const', 'Lexical declaration must be either let or const');
+		        var declarations = this.parseBindingList(kind, options);
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.VariableDeclaration(declarations, kind));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-destructuring-binding-patterns
+		    Parser.prototype.parseBindingRestElement = function (params, kind) {
+		        var node = this.createNode();
+		        this.expect('...');
+		        var arg = this.parsePattern(params, kind);
+		        return this.finalize(node, new Node.RestElement(arg));
+		    };
+		    Parser.prototype.parseArrayPattern = function (params, kind) {
+		        var node = this.createNode();
+		        this.expect('[');
+		        var elements = [];
+		        while (!this.match(']')) {
+		            if (this.match(',')) {
+		                this.nextToken();
+		                elements.push(null);
+		            }
+		            else {
+		                if (this.match('...')) {
+		                    elements.push(this.parseBindingRestElement(params, kind));
+		                    break;
+		                }
+		                else {
+		                    elements.push(this.parsePatternWithDefault(params, kind));
+		                }
+		                if (!this.match(']')) {
+		                    this.expect(',');
+		                }
+		            }
+		        }
+		        this.expect(']');
+		        return this.finalize(node, new Node.ArrayPattern(elements));
+		    };
+		    Parser.prototype.parsePropertyPattern = function (params, kind) {
+		        var node = this.createNode();
+		        var computed = false;
+		        var shorthand = false;
+		        var method = false;
+		        var key;
+		        var value;
+		        if (this.lookahead.type === 3 /* Identifier */) {
+		            var keyToken = this.lookahead;
+		            key = this.parseVariableIdentifier();
+		            var init = this.finalize(node, new Node.Identifier(keyToken.value));
+		            if (this.match('=')) {
+		                params.push(keyToken);
+		                shorthand = true;
+		                this.nextToken();
+		                var expr = this.parseAssignmentExpression();
+		                value = this.finalize(this.startNode(keyToken), new Node.AssignmentPattern(init, expr));
+		            }
+		            else if (!this.match(':')) {
+		                params.push(keyToken);
+		                shorthand = true;
+		                value = init;
+		            }
+		            else {
+		                this.expect(':');
+		                value = this.parsePatternWithDefault(params, kind);
+		            }
+		        }
+		        else {
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            this.expect(':');
+		            value = this.parsePatternWithDefault(params, kind);
+		        }
+		        return this.finalize(node, new Node.Property('init', key, computed, value, method, shorthand));
+		    };
+		    Parser.prototype.parseObjectPattern = function (params, kind) {
+		        var node = this.createNode();
+		        var properties = [];
+		        this.expect('{');
+		        while (!this.match('}')) {
+		            properties.push(this.parsePropertyPattern(params, kind));
+		            if (!this.match('}')) {
+		                this.expect(',');
+		            }
+		        }
+		        this.expect('}');
+		        return this.finalize(node, new Node.ObjectPattern(properties));
+		    };
+		    Parser.prototype.parsePattern = function (params, kind) {
+		        var pattern;
+		        if (this.match('[')) {
+		            pattern = this.parseArrayPattern(params, kind);
+		        }
+		        else if (this.match('{')) {
+		            pattern = this.parseObjectPattern(params, kind);
+		        }
+		        else {
+		            if (this.matchKeyword('let') && (kind === 'const' || kind === 'let')) {
+		                this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.LetInLexicalBinding);
+		            }
+		            params.push(this.lookahead);
+		            pattern = this.parseVariableIdentifier(kind);
+		        }
+		        return pattern;
+		    };
+		    Parser.prototype.parsePatternWithDefault = function (params, kind) {
+		        var startToken = this.lookahead;
+		        var pattern = this.parsePattern(params, kind);
+		        if (this.match('=')) {
+		            this.nextToken();
+		            var previousAllowYield = this.context.allowYield;
+		            this.context.allowYield = true;
+		            var right = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		            this.context.allowYield = previousAllowYield;
+		            pattern = this.finalize(this.startNode(startToken), new Node.AssignmentPattern(pattern, right));
+		        }
+		        return pattern;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-variable-statement
+		    Parser.prototype.parseVariableIdentifier = function (kind) {
+		        var node = this.createNode();
+		        var token = this.nextToken();
+		        if (token.type === 4 /* Keyword */ && token.value === 'yield') {
+		            if (this.context.strict) {
+		                this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+		            }
+		            else if (!this.context.allowYield) {
+		                this.throwUnexpectedToken(token);
+		            }
+		        }
+		        else if (token.type !== 3 /* Identifier */) {
+		            if (this.context.strict && token.type === 4 /* Keyword */ && this.scanner.isStrictModeReservedWord(token.value)) {
+		                this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+		            }
+		            else {
+		                if (this.context.strict || token.value !== 'let' || kind !== 'var') {
+		                    this.throwUnexpectedToken(token);
+		                }
+		            }
+		        }
+		        else if ((this.context.isModule || this.context.await) && token.type === 3 /* Identifier */ && token.value === 'await') {
+		            this.tolerateUnexpectedToken(token);
+		        }
+		        return this.finalize(node, new Node.Identifier(token.value));
+		    };
+		    Parser.prototype.parseVariableDeclaration = function (options) {
+		        var node = this.createNode();
+		        var params = [];
+		        var id = this.parsePattern(params, 'var');
+		        if (this.context.strict && id.type === syntax_1.Syntax.Identifier) {
+		            if (this.scanner.isRestrictedWord(id.name)) {
+		                this.tolerateError(messages_1.Messages.StrictVarName);
+		            }
+		        }
+		        var init = null;
+		        if (this.match('=')) {
+		            this.nextToken();
+		            init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+		        }
+		        else if (id.type !== syntax_1.Syntax.Identifier && !options.inFor) {
+		            this.expect('=');
+		        }
+		        return this.finalize(node, new Node.VariableDeclarator(id, init));
+		    };
+		    Parser.prototype.parseVariableDeclarationList = function (options) {
+		        var opt = { inFor: options.inFor };
+		        var list = [];
+		        list.push(this.parseVariableDeclaration(opt));
+		        while (this.match(',')) {
+		            this.nextToken();
+		            list.push(this.parseVariableDeclaration(opt));
+		        }
+		        return list;
+		    };
+		    Parser.prototype.parseVariableStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('var');
+		        var declarations = this.parseVariableDeclarationList({ inFor: false });
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.VariableDeclaration(declarations, 'var'));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-empty-statement
+		    Parser.prototype.parseEmptyStatement = function () {
+		        var node = this.createNode();
+		        this.expect(';');
+		        return this.finalize(node, new Node.EmptyStatement());
+		    };
+		    // https://tc39.github.io/ecma262/#sec-expression-statement
+		    Parser.prototype.parseExpressionStatement = function () {
+		        var node = this.createNode();
+		        var expr = this.parseExpression();
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.ExpressionStatement(expr));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-if-statement
+		    Parser.prototype.parseIfClause = function () {
+		        if (this.context.strict && this.matchKeyword('function')) {
+		            this.tolerateError(messages_1.Messages.StrictFunction);
+		        }
+		        return this.parseStatement();
+		    };
+		    Parser.prototype.parseIfStatement = function () {
+		        var node = this.createNode();
+		        var consequent;
+		        var alternate = null;
+		        this.expectKeyword('if');
+		        this.expect('(');
+		        var test = this.parseExpression();
+		        if (!this.match(')') && this.config.tolerant) {
+		            this.tolerateUnexpectedToken(this.nextToken());
+		            consequent = this.finalize(this.createNode(), new Node.EmptyStatement());
+		        }
+		        else {
+		            this.expect(')');
+		            consequent = this.parseIfClause();
+		            if (this.matchKeyword('else')) {
+		                this.nextToken();
+		                alternate = this.parseIfClause();
+		            }
+		        }
+		        return this.finalize(node, new Node.IfStatement(test, consequent, alternate));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-do-while-statement
+		    Parser.prototype.parseDoWhileStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('do');
+		        var previousInIteration = this.context.inIteration;
+		        this.context.inIteration = true;
+		        var body = this.parseStatement();
+		        this.context.inIteration = previousInIteration;
+		        this.expectKeyword('while');
+		        this.expect('(');
+		        var test = this.parseExpression();
+		        if (!this.match(')') && this.config.tolerant) {
+		            this.tolerateUnexpectedToken(this.nextToken());
+		        }
+		        else {
+		            this.expect(')');
+		            if (this.match(';')) {
+		                this.nextToken();
+		            }
+		        }
+		        return this.finalize(node, new Node.DoWhileStatement(body, test));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-while-statement
+		    Parser.prototype.parseWhileStatement = function () {
+		        var node = this.createNode();
+		        var body;
+		        this.expectKeyword('while');
+		        this.expect('(');
+		        var test = this.parseExpression();
+		        if (!this.match(')') && this.config.tolerant) {
+		            this.tolerateUnexpectedToken(this.nextToken());
+		            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+		        }
+		        else {
+		            this.expect(')');
+		            var previousInIteration = this.context.inIteration;
+		            this.context.inIteration = true;
+		            body = this.parseStatement();
+		            this.context.inIteration = previousInIteration;
+		        }
+		        return this.finalize(node, new Node.WhileStatement(test, body));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-for-statement
+		    // https://tc39.github.io/ecma262/#sec-for-in-and-for-of-statements
+		    Parser.prototype.parseForStatement = function () {
+		        var init = null;
+		        var test = null;
+		        var update = null;
+		        var forIn = true;
+		        var left, right;
+		        var node = this.createNode();
+		        this.expectKeyword('for');
+		        this.expect('(');
+		        if (this.match(';')) {
+		            this.nextToken();
+		        }
+		        else {
+		            if (this.matchKeyword('var')) {
+		                init = this.createNode();
+		                this.nextToken();
+		                var previousAllowIn = this.context.allowIn;
+		                this.context.allowIn = false;
+		                var declarations = this.parseVariableDeclarationList({ inFor: true });
+		                this.context.allowIn = previousAllowIn;
+		                if (declarations.length === 1 && this.matchKeyword('in')) {
+		                    var decl = declarations[0];
+		                    if (decl.init && (decl.id.type === syntax_1.Syntax.ArrayPattern || decl.id.type === syntax_1.Syntax.ObjectPattern || this.context.strict)) {
+		                        this.tolerateError(messages_1.Messages.ForInOfLoopInitializer, 'for-in');
+		                    }
+		                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+		                    this.nextToken();
+		                    left = init;
+		                    right = this.parseExpression();
+		                    init = null;
+		                }
+		                else if (declarations.length === 1 && declarations[0].init === null && this.matchContextualKeyword('of')) {
+		                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+		                    this.nextToken();
+		                    left = init;
+		                    right = this.parseAssignmentExpression();
+		                    init = null;
+		                    forIn = false;
+		                }
+		                else {
+		                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+		                    this.expect(';');
+		                }
+		            }
+		            else if (this.matchKeyword('const') || this.matchKeyword('let')) {
+		                init = this.createNode();
+		                var kind = this.nextToken().value;
+		                if (!this.context.strict && this.lookahead.value === 'in') {
+		                    init = this.finalize(init, new Node.Identifier(kind));
+		                    this.nextToken();
+		                    left = init;
+		                    right = this.parseExpression();
+		                    init = null;
+		                }
+		                else {
+		                    var previousAllowIn = this.context.allowIn;
+		                    this.context.allowIn = false;
+		                    var declarations = this.parseBindingList(kind, { inFor: true });
+		                    this.context.allowIn = previousAllowIn;
+		                    if (declarations.length === 1 && declarations[0].init === null && this.matchKeyword('in')) {
+		                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+		                        this.nextToken();
+		                        left = init;
+		                        right = this.parseExpression();
+		                        init = null;
+		                    }
+		                    else if (declarations.length === 1 && declarations[0].init === null && this.matchContextualKeyword('of')) {
+		                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+		                        this.nextToken();
+		                        left = init;
+		                        right = this.parseAssignmentExpression();
+		                        init = null;
+		                        forIn = false;
+		                    }
+		                    else {
+		                        this.consumeSemicolon();
+		                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+		                    }
+		                }
+		            }
+		            else {
+		                var initStartToken = this.lookahead;
+		                var previousAllowIn = this.context.allowIn;
+		                this.context.allowIn = false;
+		                init = this.inheritCoverGrammar(this.parseAssignmentExpression);
+		                this.context.allowIn = previousAllowIn;
+		                if (this.matchKeyword('in')) {
+		                    if (!this.context.isAssignmentTarget || init.type === syntax_1.Syntax.AssignmentExpression) {
+		                        this.tolerateError(messages_1.Messages.InvalidLHSInForIn);
+		                    }
+		                    this.nextToken();
+		                    this.reinterpretExpressionAsPattern(init);
+		                    left = init;
+		                    right = this.parseExpression();
+		                    init = null;
+		                }
+		                else if (this.matchContextualKeyword('of')) {
+		                    if (!this.context.isAssignmentTarget || init.type === syntax_1.Syntax.AssignmentExpression) {
+		                        this.tolerateError(messages_1.Messages.InvalidLHSInForLoop);
+		                    }
+		                    this.nextToken();
+		                    this.reinterpretExpressionAsPattern(init);
+		                    left = init;
+		                    right = this.parseAssignmentExpression();
+		                    init = null;
+		                    forIn = false;
+		                }
+		                else {
+		                    if (this.match(',')) {
+		                        var initSeq = [init];
+		                        while (this.match(',')) {
+		                            this.nextToken();
+		                            initSeq.push(this.isolateCoverGrammar(this.parseAssignmentExpression));
+		                        }
+		                        init = this.finalize(this.startNode(initStartToken), new Node.SequenceExpression(initSeq));
+		                    }
+		                    this.expect(';');
+		                }
+		            }
+		        }
+		        if (typeof left === 'undefined') {
+		            if (!this.match(';')) {
+		                test = this.parseExpression();
+		            }
+		            this.expect(';');
+		            if (!this.match(')')) {
+		                update = this.parseExpression();
+		            }
+		        }
+		        var body;
+		        if (!this.match(')') && this.config.tolerant) {
+		            this.tolerateUnexpectedToken(this.nextToken());
+		            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+		        }
+		        else {
+		            this.expect(')');
+		            var previousInIteration = this.context.inIteration;
+		            this.context.inIteration = true;
+		            body = this.isolateCoverGrammar(this.parseStatement);
+		            this.context.inIteration = previousInIteration;
+		        }
+		        return (typeof left === 'undefined') ?
+		            this.finalize(node, new Node.ForStatement(init, test, update, body)) :
+		            forIn ? this.finalize(node, new Node.ForInStatement(left, right, body)) :
+		                this.finalize(node, new Node.ForOfStatement(left, right, body));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-continue-statement
+		    Parser.prototype.parseContinueStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('continue');
+		        var label = null;
+		        if (this.lookahead.type === 3 /* Identifier */ && !this.hasLineTerminator) {
+		            var id = this.parseVariableIdentifier();
+		            label = id;
+		            var key = '$' + id.name;
+		            if (!Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+		                this.throwError(messages_1.Messages.UnknownLabel, id.name);
+		            }
+		        }
+		        this.consumeSemicolon();
+		        if (label === null && !this.context.inIteration) {
+		            this.throwError(messages_1.Messages.IllegalContinue);
+		        }
+		        return this.finalize(node, new Node.ContinueStatement(label));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-break-statement
+		    Parser.prototype.parseBreakStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('break');
+		        var label = null;
+		        if (this.lookahead.type === 3 /* Identifier */ && !this.hasLineTerminator) {
+		            var id = this.parseVariableIdentifier();
+		            var key = '$' + id.name;
+		            if (!Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+		                this.throwError(messages_1.Messages.UnknownLabel, id.name);
+		            }
+		            label = id;
+		        }
+		        this.consumeSemicolon();
+		        if (label === null && !this.context.inIteration && !this.context.inSwitch) {
+		            this.throwError(messages_1.Messages.IllegalBreak);
+		        }
+		        return this.finalize(node, new Node.BreakStatement(label));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-return-statement
+		    Parser.prototype.parseReturnStatement = function () {
+		        if (!this.context.inFunctionBody) {
+		            this.tolerateError(messages_1.Messages.IllegalReturn);
+		        }
+		        var node = this.createNode();
+		        this.expectKeyword('return');
+		        var hasArgument = (!this.match(';') && !this.match('}') &&
+		            !this.hasLineTerminator && this.lookahead.type !== 2 /* EOF */) ||
+		            this.lookahead.type === 8 /* StringLiteral */ ||
+		            this.lookahead.type === 10 /* Template */;
+		        var argument = hasArgument ? this.parseExpression() : null;
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.ReturnStatement(argument));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-with-statement
+		    Parser.prototype.parseWithStatement = function () {
+		        if (this.context.strict) {
+		            this.tolerateError(messages_1.Messages.StrictModeWith);
+		        }
+		        var node = this.createNode();
+		        var body;
+		        this.expectKeyword('with');
+		        this.expect('(');
+		        var object = this.parseExpression();
+		        if (!this.match(')') && this.config.tolerant) {
+		            this.tolerateUnexpectedToken(this.nextToken());
+		            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+		        }
+		        else {
+		            this.expect(')');
+		            body = this.parseStatement();
+		        }
+		        return this.finalize(node, new Node.WithStatement(object, body));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-switch-statement
+		    Parser.prototype.parseSwitchCase = function () {
+		        var node = this.createNode();
+		        var test;
+		        if (this.matchKeyword('default')) {
+		            this.nextToken();
+		            test = null;
+		        }
+		        else {
+		            this.expectKeyword('case');
+		            test = this.parseExpression();
+		        }
+		        this.expect(':');
+		        var consequent = [];
+		        while (true) {
+		            if (this.match('}') || this.matchKeyword('default') || this.matchKeyword('case')) {
+		                break;
+		            }
+		            consequent.push(this.parseStatementListItem());
+		        }
+		        return this.finalize(node, new Node.SwitchCase(test, consequent));
+		    };
+		    Parser.prototype.parseSwitchStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('switch');
+		        this.expect('(');
+		        var discriminant = this.parseExpression();
+		        this.expect(')');
+		        var previousInSwitch = this.context.inSwitch;
+		        this.context.inSwitch = true;
+		        var cases = [];
+		        var defaultFound = false;
+		        this.expect('{');
+		        while (true) {
+		            if (this.match('}')) {
+		                break;
+		            }
+		            var clause = this.parseSwitchCase();
+		            if (clause.test === null) {
+		                if (defaultFound) {
+		                    this.throwError(messages_1.Messages.MultipleDefaultsInSwitch);
+		                }
+		                defaultFound = true;
+		            }
+		            cases.push(clause);
+		        }
+		        this.expect('}');
+		        this.context.inSwitch = previousInSwitch;
+		        return this.finalize(node, new Node.SwitchStatement(discriminant, cases));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-labelled-statements
+		    Parser.prototype.parseLabelledStatement = function () {
+		        var node = this.createNode();
+		        var expr = this.parseExpression();
+		        var statement;
+		        if ((expr.type === syntax_1.Syntax.Identifier) && this.match(':')) {
+		            this.nextToken();
+		            var id = expr;
+		            var key = '$' + id.name;
+		            if (Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+		                this.throwError(messages_1.Messages.Redeclaration, 'Label', id.name);
+		            }
+		            this.context.labelSet[key] = true;
+		            var body = void 0;
+		            if (this.matchKeyword('class')) {
+		                this.tolerateUnexpectedToken(this.lookahead);
+		                body = this.parseClassDeclaration();
+		            }
+		            else if (this.matchKeyword('function')) {
+		                var token = this.lookahead;
+		                var declaration = this.parseFunctionDeclaration();
+		                if (this.context.strict) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunction);
+		                }
+		                else if (declaration.generator) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.GeneratorInLegacyContext);
+		                }
+		                body = declaration;
+		            }
+		            else {
+		                body = this.parseStatement();
+		            }
+		            delete this.context.labelSet[key];
+		            statement = new Node.LabeledStatement(id, body);
+		        }
+		        else {
+		            this.consumeSemicolon();
+		            statement = new Node.ExpressionStatement(expr);
+		        }
+		        return this.finalize(node, statement);
+		    };
+		    // https://tc39.github.io/ecma262/#sec-throw-statement
+		    Parser.prototype.parseThrowStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('throw');
+		        if (this.hasLineTerminator) {
+		            this.throwError(messages_1.Messages.NewlineAfterThrow);
+		        }
+		        var argument = this.parseExpression();
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.ThrowStatement(argument));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-try-statement
+		    Parser.prototype.parseCatchClause = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('catch');
+		        this.expect('(');
+		        if (this.match(')')) {
+		            this.throwUnexpectedToken(this.lookahead);
+		        }
+		        var params = [];
+		        var param = this.parsePattern(params);
+		        var paramMap = {};
+		        for (var i = 0; i < params.length; i++) {
+		            var key = '$' + params[i].value;
+		            if (Object.prototype.hasOwnProperty.call(paramMap, key)) {
+		                this.tolerateError(messages_1.Messages.DuplicateBinding, params[i].value);
+		            }
+		            paramMap[key] = true;
+		        }
+		        if (this.context.strict && param.type === syntax_1.Syntax.Identifier) {
+		            if (this.scanner.isRestrictedWord(param.name)) {
+		                this.tolerateError(messages_1.Messages.StrictCatchVariable);
+		            }
+		        }
+		        this.expect(')');
+		        var body = this.parseBlock();
+		        return this.finalize(node, new Node.CatchClause(param, body));
+		    };
+		    Parser.prototype.parseFinallyClause = function () {
+		        this.expectKeyword('finally');
+		        return this.parseBlock();
+		    };
+		    Parser.prototype.parseTryStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('try');
+		        var block = this.parseBlock();
+		        var handler = this.matchKeyword('catch') ? this.parseCatchClause() : null;
+		        var finalizer = this.matchKeyword('finally') ? this.parseFinallyClause() : null;
+		        if (!handler && !finalizer) {
+		            this.throwError(messages_1.Messages.NoCatchOrFinally);
+		        }
+		        return this.finalize(node, new Node.TryStatement(block, handler, finalizer));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-debugger-statement
+		    Parser.prototype.parseDebuggerStatement = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('debugger');
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.DebuggerStatement());
+		    };
+		    // https://tc39.github.io/ecma262/#sec-ecmascript-language-statements-and-declarations
+		    Parser.prototype.parseStatement = function () {
+		        var statement;
+		        switch (this.lookahead.type) {
+		            case 1 /* BooleanLiteral */:
+		            case 5 /* NullLiteral */:
+		            case 6 /* NumericLiteral */:
+		            case 8 /* StringLiteral */:
+		            case 10 /* Template */:
+		            case 9 /* RegularExpression */:
+		                statement = this.parseExpressionStatement();
+		                break;
+		            case 7 /* Punctuator */:
+		                var value = this.lookahead.value;
+		                if (value === '{') {
+		                    statement = this.parseBlock();
+		                }
+		                else if (value === '(') {
+		                    statement = this.parseExpressionStatement();
+		                }
+		                else if (value === ';') {
+		                    statement = this.parseEmptyStatement();
+		                }
+		                else {
+		                    statement = this.parseExpressionStatement();
+		                }
+		                break;
+		            case 3 /* Identifier */:
+		                statement = this.matchAsyncFunction() ? this.parseFunctionDeclaration() : this.parseLabelledStatement();
+		                break;
+		            case 4 /* Keyword */:
+		                switch (this.lookahead.value) {
+		                    case 'break':
+		                        statement = this.parseBreakStatement();
+		                        break;
+		                    case 'continue':
+		                        statement = this.parseContinueStatement();
+		                        break;
+		                    case 'debugger':
+		                        statement = this.parseDebuggerStatement();
+		                        break;
+		                    case 'do':
+		                        statement = this.parseDoWhileStatement();
+		                        break;
+		                    case 'for':
+		                        statement = this.parseForStatement();
+		                        break;
+		                    case 'function':
+		                        statement = this.parseFunctionDeclaration();
+		                        break;
+		                    case 'if':
+		                        statement = this.parseIfStatement();
+		                        break;
+		                    case 'return':
+		                        statement = this.parseReturnStatement();
+		                        break;
+		                    case 'switch':
+		                        statement = this.parseSwitchStatement();
+		                        break;
+		                    case 'throw':
+		                        statement = this.parseThrowStatement();
+		                        break;
+		                    case 'try':
+		                        statement = this.parseTryStatement();
+		                        break;
+		                    case 'var':
+		                        statement = this.parseVariableStatement();
+		                        break;
+		                    case 'while':
+		                        statement = this.parseWhileStatement();
+		                        break;
+		                    case 'with':
+		                        statement = this.parseWithStatement();
+		                        break;
+		                    default:
+		                        statement = this.parseExpressionStatement();
+		                        break;
+		                }
+		                break;
+		            default:
+		                statement = this.throwUnexpectedToken(this.lookahead);
+		        }
+		        return statement;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-function-definitions
+		    Parser.prototype.parseFunctionSourceElements = function () {
+		        var node = this.createNode();
+		        this.expect('{');
+		        var body = this.parseDirectivePrologues();
+		        var previousLabelSet = this.context.labelSet;
+		        var previousInIteration = this.context.inIteration;
+		        var previousInSwitch = this.context.inSwitch;
+		        var previousInFunctionBody = this.context.inFunctionBody;
+		        this.context.labelSet = {};
+		        this.context.inIteration = false;
+		        this.context.inSwitch = false;
+		        this.context.inFunctionBody = true;
+		        while (this.lookahead.type !== 2 /* EOF */) {
+		            if (this.match('}')) {
+		                break;
+		            }
+		            body.push(this.parseStatementListItem());
+		        }
+		        this.expect('}');
+		        this.context.labelSet = previousLabelSet;
+		        this.context.inIteration = previousInIteration;
+		        this.context.inSwitch = previousInSwitch;
+		        this.context.inFunctionBody = previousInFunctionBody;
+		        return this.finalize(node, new Node.BlockStatement(body));
+		    };
+		    Parser.prototype.validateParam = function (options, param, name) {
+		        var key = '$' + name;
+		        if (this.context.strict) {
+		            if (this.scanner.isRestrictedWord(name)) {
+		                options.stricted = param;
+		                options.message = messages_1.Messages.StrictParamName;
+		            }
+		            if (Object.prototype.hasOwnProperty.call(options.paramSet, key)) {
+		                options.stricted = param;
+		                options.message = messages_1.Messages.StrictParamDupe;
+		            }
+		        }
+		        else if (!options.firstRestricted) {
+		            if (this.scanner.isRestrictedWord(name)) {
+		                options.firstRestricted = param;
+		                options.message = messages_1.Messages.StrictParamName;
+		            }
+		            else if (this.scanner.isStrictModeReservedWord(name)) {
+		                options.firstRestricted = param;
+		                options.message = messages_1.Messages.StrictReservedWord;
+		            }
+		            else if (Object.prototype.hasOwnProperty.call(options.paramSet, key)) {
+		                options.stricted = param;
+		                options.message = messages_1.Messages.StrictParamDupe;
+		            }
+		        }
+		        /* istanbul ignore next */
+		        if (typeof Object.defineProperty === 'function') {
+		            Object.defineProperty(options.paramSet, key, { value: true, enumerable: true, writable: true, configurable: true });
+		        }
+		        else {
+		            options.paramSet[key] = true;
+		        }
+		    };
+		    Parser.prototype.parseRestElement = function (params) {
+		        var node = this.createNode();
+		        this.expect('...');
+		        var arg = this.parsePattern(params);
+		        if (this.match('=')) {
+		            this.throwError(messages_1.Messages.DefaultRestParameter);
+		        }
+		        if (!this.match(')')) {
+		            this.throwError(messages_1.Messages.ParameterAfterRestParameter);
+		        }
+		        return this.finalize(node, new Node.RestElement(arg));
+		    };
+		    Parser.prototype.parseFormalParameter = function (options) {
+		        var params = [];
+		        var param = this.match('...') ? this.parseRestElement(params) : this.parsePatternWithDefault(params);
+		        for (var i = 0; i < params.length; i++) {
+		            this.validateParam(options, params[i], params[i].value);
+		        }
+		        options.simple = options.simple && (param instanceof Node.Identifier);
+		        options.params.push(param);
+		    };
+		    Parser.prototype.parseFormalParameters = function (firstRestricted) {
+		        var options;
+		        options = {
+		            simple: true,
+		            params: [],
+		            firstRestricted: firstRestricted
+		        };
+		        this.expect('(');
+		        if (!this.match(')')) {
+		            options.paramSet = {};
+		            while (this.lookahead.type !== 2 /* EOF */) {
+		                this.parseFormalParameter(options);
+		                if (this.match(')')) {
+		                    break;
+		                }
+		                this.expect(',');
+		                if (this.match(')')) {
+		                    break;
+		                }
+		            }
+		        }
+		        this.expect(')');
+		        return {
+		            simple: options.simple,
+		            params: options.params,
+		            stricted: options.stricted,
+		            firstRestricted: options.firstRestricted,
+		            message: options.message
+		        };
+		    };
+		    Parser.prototype.matchAsyncFunction = function () {
+		        var match = this.matchContextualKeyword('async');
+		        if (match) {
+		            var state = this.scanner.saveState();
+		            this.scanner.scanComments();
+		            var next = this.scanner.lex();
+		            this.scanner.restoreState(state);
+		            match = (state.lineNumber === next.lineNumber) && (next.type === 4 /* Keyword */) && (next.value === 'function');
+		        }
+		        return match;
+		    };
+		    Parser.prototype.parseFunctionDeclaration = function (identifierIsOptional) {
+		        var node = this.createNode();
+		        var isAsync = this.matchContextualKeyword('async');
+		        if (isAsync) {
+		            this.nextToken();
+		        }
+		        this.expectKeyword('function');
+		        var isGenerator = isAsync ? false : this.match('*');
+		        if (isGenerator) {
+		            this.nextToken();
+		        }
+		        var message;
+		        var id = null;
+		        var firstRestricted = null;
+		        if (!identifierIsOptional || !this.match('(')) {
+		            var token = this.lookahead;
+		            id = this.parseVariableIdentifier();
+		            if (this.context.strict) {
+		                if (this.scanner.isRestrictedWord(token.value)) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunctionName);
+		                }
+		            }
+		            else {
+		                if (this.scanner.isRestrictedWord(token.value)) {
+		                    firstRestricted = token;
+		                    message = messages_1.Messages.StrictFunctionName;
+		                }
+		                else if (this.scanner.isStrictModeReservedWord(token.value)) {
+		                    firstRestricted = token;
+		                    message = messages_1.Messages.StrictReservedWord;
+		                }
+		            }
+		        }
+		        var previousAllowAwait = this.context.await;
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.await = isAsync;
+		        this.context.allowYield = !isGenerator;
+		        var formalParameters = this.parseFormalParameters(firstRestricted);
+		        var params = formalParameters.params;
+		        var stricted = formalParameters.stricted;
+		        firstRestricted = formalParameters.firstRestricted;
+		        if (formalParameters.message) {
+		            message = formalParameters.message;
+		        }
+		        var previousStrict = this.context.strict;
+		        var previousAllowStrictDirective = this.context.allowStrictDirective;
+		        this.context.allowStrictDirective = formalParameters.simple;
+		        var body = this.parseFunctionSourceElements();
+		        if (this.context.strict && firstRestricted) {
+		            this.throwUnexpectedToken(firstRestricted, message);
+		        }
+		        if (this.context.strict && stricted) {
+		            this.tolerateUnexpectedToken(stricted, message);
+		        }
+		        this.context.strict = previousStrict;
+		        this.context.allowStrictDirective = previousAllowStrictDirective;
+		        this.context.await = previousAllowAwait;
+		        this.context.allowYield = previousAllowYield;
+		        return isAsync ? this.finalize(node, new Node.AsyncFunctionDeclaration(id, params, body)) :
+		            this.finalize(node, new Node.FunctionDeclaration(id, params, body, isGenerator));
+		    };
+		    Parser.prototype.parseFunctionExpression = function () {
+		        var node = this.createNode();
+		        var isAsync = this.matchContextualKeyword('async');
+		        if (isAsync) {
+		            this.nextToken();
+		        }
+		        this.expectKeyword('function');
+		        var isGenerator = isAsync ? false : this.match('*');
+		        if (isGenerator) {
+		            this.nextToken();
+		        }
+		        var message;
+		        var id = null;
+		        var firstRestricted;
+		        var previousAllowAwait = this.context.await;
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.await = isAsync;
+		        this.context.allowYield = !isGenerator;
+		        if (!this.match('(')) {
+		            var token = this.lookahead;
+		            id = (!this.context.strict && !isGenerator && this.matchKeyword('yield')) ? this.parseIdentifierName() : this.parseVariableIdentifier();
+		            if (this.context.strict) {
+		                if (this.scanner.isRestrictedWord(token.value)) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunctionName);
+		                }
+		            }
+		            else {
+		                if (this.scanner.isRestrictedWord(token.value)) {
+		                    firstRestricted = token;
+		                    message = messages_1.Messages.StrictFunctionName;
+		                }
+		                else if (this.scanner.isStrictModeReservedWord(token.value)) {
+		                    firstRestricted = token;
+		                    message = messages_1.Messages.StrictReservedWord;
+		                }
+		            }
+		        }
+		        var formalParameters = this.parseFormalParameters(firstRestricted);
+		        var params = formalParameters.params;
+		        var stricted = formalParameters.stricted;
+		        firstRestricted = formalParameters.firstRestricted;
+		        if (formalParameters.message) {
+		            message = formalParameters.message;
+		        }
+		        var previousStrict = this.context.strict;
+		        var previousAllowStrictDirective = this.context.allowStrictDirective;
+		        this.context.allowStrictDirective = formalParameters.simple;
+		        var body = this.parseFunctionSourceElements();
+		        if (this.context.strict && firstRestricted) {
+		            this.throwUnexpectedToken(firstRestricted, message);
+		        }
+		        if (this.context.strict && stricted) {
+		            this.tolerateUnexpectedToken(stricted, message);
+		        }
+		        this.context.strict = previousStrict;
+		        this.context.allowStrictDirective = previousAllowStrictDirective;
+		        this.context.await = previousAllowAwait;
+		        this.context.allowYield = previousAllowYield;
+		        return isAsync ? this.finalize(node, new Node.AsyncFunctionExpression(id, params, body)) :
+		            this.finalize(node, new Node.FunctionExpression(id, params, body, isGenerator));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-directive-prologues-and-the-use-strict-directive
+		    Parser.prototype.parseDirective = function () {
+		        var token = this.lookahead;
+		        var node = this.createNode();
+		        var expr = this.parseExpression();
+		        var directive = (expr.type === syntax_1.Syntax.Literal) ? this.getTokenRaw(token).slice(1, -1) : null;
+		        this.consumeSemicolon();
+		        return this.finalize(node, directive ? new Node.Directive(expr, directive) : new Node.ExpressionStatement(expr));
+		    };
+		    Parser.prototype.parseDirectivePrologues = function () {
+		        var firstRestricted = null;
+		        var body = [];
+		        while (true) {
+		            var token = this.lookahead;
+		            if (token.type !== 8 /* StringLiteral */) {
+		                break;
+		            }
+		            var statement = this.parseDirective();
+		            body.push(statement);
+		            var directive = statement.directive;
+		            if (typeof directive !== 'string') {
+		                break;
+		            }
+		            if (directive === 'use strict') {
+		                this.context.strict = true;
+		                if (firstRestricted) {
+		                    this.tolerateUnexpectedToken(firstRestricted, messages_1.Messages.StrictOctalLiteral);
+		                }
+		                if (!this.context.allowStrictDirective) {
+		                    this.tolerateUnexpectedToken(token, messages_1.Messages.IllegalLanguageModeDirective);
+		                }
+		            }
+		            else {
+		                if (!firstRestricted && token.octal) {
+		                    firstRestricted = token;
+		                }
+		            }
+		        }
+		        return body;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-method-definitions
+		    Parser.prototype.qualifiedPropertyName = function (token) {
+		        switch (token.type) {
+		            case 3 /* Identifier */:
+		            case 8 /* StringLiteral */:
+		            case 1 /* BooleanLiteral */:
+		            case 5 /* NullLiteral */:
+		            case 6 /* NumericLiteral */:
+		            case 4 /* Keyword */:
+		                return true;
+		            case 7 /* Punctuator */:
+		                return token.value === '[';
+		            default:
+		                break;
+		        }
+		        return false;
+		    };
+		    Parser.prototype.parseGetterMethod = function () {
+		        var node = this.createNode();
+		        var isGenerator = false;
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.allowYield = !isGenerator;
+		        var formalParameters = this.parseFormalParameters();
+		        if (formalParameters.params.length > 0) {
+		            this.tolerateError(messages_1.Messages.BadGetterArity);
+		        }
+		        var method = this.parsePropertyMethod(formalParameters);
+		        this.context.allowYield = previousAllowYield;
+		        return this.finalize(node, new Node.FunctionExpression(null, formalParameters.params, method, isGenerator));
+		    };
+		    Parser.prototype.parseSetterMethod = function () {
+		        var node = this.createNode();
+		        var isGenerator = false;
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.allowYield = !isGenerator;
+		        var formalParameters = this.parseFormalParameters();
+		        if (formalParameters.params.length !== 1) {
+		            this.tolerateError(messages_1.Messages.BadSetterArity);
+		        }
+		        else if (formalParameters.params[0] instanceof Node.RestElement) {
+		            this.tolerateError(messages_1.Messages.BadSetterRestParameter);
+		        }
+		        var method = this.parsePropertyMethod(formalParameters);
+		        this.context.allowYield = previousAllowYield;
+		        return this.finalize(node, new Node.FunctionExpression(null, formalParameters.params, method, isGenerator));
+		    };
+		    Parser.prototype.parseGeneratorMethod = function () {
+		        var node = this.createNode();
+		        var isGenerator = true;
+		        var previousAllowYield = this.context.allowYield;
+		        this.context.allowYield = true;
+		        var params = this.parseFormalParameters();
+		        this.context.allowYield = false;
+		        var method = this.parsePropertyMethod(params);
+		        this.context.allowYield = previousAllowYield;
+		        return this.finalize(node, new Node.FunctionExpression(null, params.params, method, isGenerator));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-generator-function-definitions
+		    Parser.prototype.isStartOfExpression = function () {
+		        var start = true;
+		        var value = this.lookahead.value;
+		        switch (this.lookahead.type) {
+		            case 7 /* Punctuator */:
+		                start = (value === '[') || (value === '(') || (value === '{') ||
+		                    (value === '+') || (value === '-') ||
+		                    (value === '!') || (value === '~') ||
+		                    (value === '++') || (value === '--') ||
+		                    (value === '/') || (value === '/='); // regular expression literal
+		                break;
+		            case 4 /* Keyword */:
+		                start = (value === 'class') || (value === 'delete') ||
+		                    (value === 'function') || (value === 'let') || (value === 'new') ||
+		                    (value === 'super') || (value === 'this') || (value === 'typeof') ||
+		                    (value === 'void') || (value === 'yield');
+		                break;
+		            default:
+		                break;
+		        }
+		        return start;
+		    };
+		    Parser.prototype.parseYieldExpression = function () {
+		        var node = this.createNode();
+		        this.expectKeyword('yield');
+		        var argument = null;
+		        var delegate = false;
+		        if (!this.hasLineTerminator) {
+		            var previousAllowYield = this.context.allowYield;
+		            this.context.allowYield = false;
+		            delegate = this.match('*');
+		            if (delegate) {
+		                this.nextToken();
+		                argument = this.parseAssignmentExpression();
+		            }
+		            else if (this.isStartOfExpression()) {
+		                argument = this.parseAssignmentExpression();
+		            }
+		            this.context.allowYield = previousAllowYield;
+		        }
+		        return this.finalize(node, new Node.YieldExpression(argument, delegate));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-class-definitions
+		    Parser.prototype.parseClassElement = function (hasConstructor) {
+		        var token = this.lookahead;
+		        var node = this.createNode();
+		        var kind = '';
+		        var key = null;
+		        var value = null;
+		        var computed = false;
+		        var method = false;
+		        var isStatic = false;
+		        var isAsync = false;
+		        if (this.match('*')) {
+		            this.nextToken();
+		        }
+		        else {
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            var id = key;
+		            if (id.name === 'static' && (this.qualifiedPropertyName(this.lookahead) || this.match('*'))) {
+		                token = this.lookahead;
+		                isStatic = true;
+		                computed = this.match('[');
+		                if (this.match('*')) {
+		                    this.nextToken();
+		                }
+		                else {
+		                    key = this.parseObjectPropertyKey();
+		                }
+		            }
+		            if ((token.type === 3 /* Identifier */) && !this.hasLineTerminator && (token.value === 'async')) {
+		                var punctuator = this.lookahead.value;
+		                if (punctuator !== ':' && punctuator !== '(' && punctuator !== '*') {
+		                    isAsync = true;
+		                    token = this.lookahead;
+		                    key = this.parseObjectPropertyKey();
+		                    if (token.type === 3 /* Identifier */ && token.value === 'constructor') {
+		                        this.tolerateUnexpectedToken(token, messages_1.Messages.ConstructorIsAsync);
+		                    }
+		                }
+		            }
+		        }
+		        var lookaheadPropertyKey = this.qualifiedPropertyName(this.lookahead);
+		        if (token.type === 3 /* Identifier */) {
+		            if (token.value === 'get' && lookaheadPropertyKey) {
+		                kind = 'get';
+		                computed = this.match('[');
+		                key = this.parseObjectPropertyKey();
+		                this.context.allowYield = false;
+		                value = this.parseGetterMethod();
+		            }
+		            else if (token.value === 'set' && lookaheadPropertyKey) {
+		                kind = 'set';
+		                computed = this.match('[');
+		                key = this.parseObjectPropertyKey();
+		                value = this.parseSetterMethod();
+		            }
+		        }
+		        else if (token.type === 7 /* Punctuator */ && token.value === '*' && lookaheadPropertyKey) {
+		            kind = 'init';
+		            computed = this.match('[');
+		            key = this.parseObjectPropertyKey();
+		            value = this.parseGeneratorMethod();
+		            method = true;
+		        }
+		        if (!kind && key && this.match('(')) {
+		            kind = 'init';
+		            value = isAsync ? this.parsePropertyMethodAsyncFunction() : this.parsePropertyMethodFunction();
+		            method = true;
+		        }
+		        if (!kind) {
+		            this.throwUnexpectedToken(this.lookahead);
+		        }
+		        if (kind === 'init') {
+		            kind = 'method';
+		        }
+		        if (!computed) {
+		            if (isStatic && this.isPropertyKey(key, 'prototype')) {
+		                this.throwUnexpectedToken(token, messages_1.Messages.StaticPrototype);
+		            }
+		            if (!isStatic && this.isPropertyKey(key, 'constructor')) {
+		                if (kind !== 'method' || !method || (value && value.generator)) {
+		                    this.throwUnexpectedToken(token, messages_1.Messages.ConstructorSpecialMethod);
+		                }
+		                if (hasConstructor.value) {
+		                    this.throwUnexpectedToken(token, messages_1.Messages.DuplicateConstructor);
+		                }
+		                else {
+		                    hasConstructor.value = true;
+		                }
+		                kind = 'constructor';
+		            }
+		        }
+		        return this.finalize(node, new Node.MethodDefinition(key, computed, value, kind, isStatic));
+		    };
+		    Parser.prototype.parseClassElementList = function () {
+		        var body = [];
+		        var hasConstructor = { value: false };
+		        this.expect('{');
+		        while (!this.match('}')) {
+		            if (this.match(';')) {
+		                this.nextToken();
+		            }
+		            else {
+		                body.push(this.parseClassElement(hasConstructor));
+		            }
+		        }
+		        this.expect('}');
+		        return body;
+		    };
+		    Parser.prototype.parseClassBody = function () {
+		        var node = this.createNode();
+		        var elementList = this.parseClassElementList();
+		        return this.finalize(node, new Node.ClassBody(elementList));
+		    };
+		    Parser.prototype.parseClassDeclaration = function (identifierIsOptional) {
+		        var node = this.createNode();
+		        var previousStrict = this.context.strict;
+		        this.context.strict = true;
+		        this.expectKeyword('class');
+		        var id = (identifierIsOptional && (this.lookahead.type !== 3 /* Identifier */)) ? null : this.parseVariableIdentifier();
+		        var superClass = null;
+		        if (this.matchKeyword('extends')) {
+		            this.nextToken();
+		            superClass = this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+		        }
+		        var classBody = this.parseClassBody();
+		        this.context.strict = previousStrict;
+		        return this.finalize(node, new Node.ClassDeclaration(id, superClass, classBody));
+		    };
+		    Parser.prototype.parseClassExpression = function () {
+		        var node = this.createNode();
+		        var previousStrict = this.context.strict;
+		        this.context.strict = true;
+		        this.expectKeyword('class');
+		        var id = (this.lookahead.type === 3 /* Identifier */) ? this.parseVariableIdentifier() : null;
+		        var superClass = null;
+		        if (this.matchKeyword('extends')) {
+		            this.nextToken();
+		            superClass = this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+		        }
+		        var classBody = this.parseClassBody();
+		        this.context.strict = previousStrict;
+		        return this.finalize(node, new Node.ClassExpression(id, superClass, classBody));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-scripts
+		    // https://tc39.github.io/ecma262/#sec-modules
+		    Parser.prototype.parseModule = function () {
+		        this.context.strict = true;
+		        this.context.isModule = true;
+		        this.scanner.isModule = true;
+		        var node = this.createNode();
+		        var body = this.parseDirectivePrologues();
+		        while (this.lookahead.type !== 2 /* EOF */) {
+		            body.push(this.parseStatementListItem());
+		        }
+		        return this.finalize(node, new Node.Module(body));
+		    };
+		    Parser.prototype.parseScript = function () {
+		        var node = this.createNode();
+		        var body = this.parseDirectivePrologues();
+		        while (this.lookahead.type !== 2 /* EOF */) {
+		            body.push(this.parseStatementListItem());
+		        }
+		        return this.finalize(node, new Node.Script(body));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-imports
+		    Parser.prototype.parseModuleSpecifier = function () {
+		        var node = this.createNode();
+		        if (this.lookahead.type !== 8 /* StringLiteral */) {
+		            this.throwError(messages_1.Messages.InvalidModuleSpecifier);
+		        }
+		        var token = this.nextToken();
+		        var raw = this.getTokenRaw(token);
+		        return this.finalize(node, new Node.Literal(token.value, raw));
+		    };
+		    // import {<foo as bar>} ...;
+		    Parser.prototype.parseImportSpecifier = function () {
+		        var node = this.createNode();
+		        var imported;
+		        var local;
+		        if (this.lookahead.type === 3 /* Identifier */) {
+		            imported = this.parseVariableIdentifier();
+		            local = imported;
+		            if (this.matchContextualKeyword('as')) {
+		                this.nextToken();
+		                local = this.parseVariableIdentifier();
+		            }
+		        }
+		        else {
+		            imported = this.parseIdentifierName();
+		            local = imported;
+		            if (this.matchContextualKeyword('as')) {
+		                this.nextToken();
+		                local = this.parseVariableIdentifier();
+		            }
+		            else {
+		                this.throwUnexpectedToken(this.nextToken());
+		            }
+		        }
+		        return this.finalize(node, new Node.ImportSpecifier(local, imported));
+		    };
+		    // {foo, bar as bas}
+		    Parser.prototype.parseNamedImports = function () {
+		        this.expect('{');
+		        var specifiers = [];
+		        while (!this.match('}')) {
+		            specifiers.push(this.parseImportSpecifier());
+		            if (!this.match('}')) {
+		                this.expect(',');
+		            }
+		        }
+		        this.expect('}');
+		        return specifiers;
+		    };
+		    // import <foo> ...;
+		    Parser.prototype.parseImportDefaultSpecifier = function () {
+		        var node = this.createNode();
+		        var local = this.parseIdentifierName();
+		        return this.finalize(node, new Node.ImportDefaultSpecifier(local));
+		    };
+		    // import <* as foo> ...;
+		    Parser.prototype.parseImportNamespaceSpecifier = function () {
+		        var node = this.createNode();
+		        this.expect('*');
+		        if (!this.matchContextualKeyword('as')) {
+		            this.throwError(messages_1.Messages.NoAsAfterImportNamespace);
+		        }
+		        this.nextToken();
+		        var local = this.parseIdentifierName();
+		        return this.finalize(node, new Node.ImportNamespaceSpecifier(local));
+		    };
+		    Parser.prototype.parseImportDeclaration = function () {
+		        if (this.context.inFunctionBody) {
+		            this.throwError(messages_1.Messages.IllegalImportDeclaration);
+		        }
+		        var node = this.createNode();
+		        this.expectKeyword('import');
+		        var src;
+		        var specifiers = [];
+		        if (this.lookahead.type === 8 /* StringLiteral */) {
+		            // import 'foo';
+		            src = this.parseModuleSpecifier();
+		        }
+		        else {
+		            if (this.match('{')) {
+		                // import {bar}
+		                specifiers = specifiers.concat(this.parseNamedImports());
+		            }
+		            else if (this.match('*')) {
+		                // import * as foo
+		                specifiers.push(this.parseImportNamespaceSpecifier());
+		            }
+		            else if (this.isIdentifierName(this.lookahead) && !this.matchKeyword('default')) {
+		                // import foo
+		                specifiers.push(this.parseImportDefaultSpecifier());
+		                if (this.match(',')) {
+		                    this.nextToken();
+		                    if (this.match('*')) {
+		                        // import foo, * as foo
+		                        specifiers.push(this.parseImportNamespaceSpecifier());
+		                    }
+		                    else if (this.match('{')) {
+		                        // import foo, {bar}
+		                        specifiers = specifiers.concat(this.parseNamedImports());
+		                    }
+		                    else {
+		                        this.throwUnexpectedToken(this.lookahead);
+		                    }
+		                }
+		            }
+		            else {
+		                this.throwUnexpectedToken(this.nextToken());
+		            }
+		            if (!this.matchContextualKeyword('from')) {
+		                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+		                this.throwError(message, this.lookahead.value);
+		            }
+		            this.nextToken();
+		            src = this.parseModuleSpecifier();
+		        }
+		        this.consumeSemicolon();
+		        return this.finalize(node, new Node.ImportDeclaration(specifiers, src));
+		    };
+		    // https://tc39.github.io/ecma262/#sec-exports
+		    Parser.prototype.parseExportSpecifier = function () {
+		        var node = this.createNode();
+		        var local = this.parseIdentifierName();
+		        var exported = local;
+		        if (this.matchContextualKeyword('as')) {
+		            this.nextToken();
+		            exported = this.parseIdentifierName();
+		        }
+		        return this.finalize(node, new Node.ExportSpecifier(local, exported));
+		    };
+		    Parser.prototype.parseExportDeclaration = function () {
+		        if (this.context.inFunctionBody) {
+		            this.throwError(messages_1.Messages.IllegalExportDeclaration);
+		        }
+		        var node = this.createNode();
+		        this.expectKeyword('export');
+		        var exportDeclaration;
+		        if (this.matchKeyword('default')) {
+		            // export default ...
+		            this.nextToken();
+		            if (this.matchKeyword('function')) {
+		                // export default function foo () {}
+		                // export default function () {}
+		                var declaration = this.parseFunctionDeclaration(true);
+		                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+		            }
+		            else if (this.matchKeyword('class')) {
+		                // export default class foo {}
+		                var declaration = this.parseClassDeclaration(true);
+		                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+		            }
+		            else if (this.matchContextualKeyword('async')) {
+		                // export default async function f () {}
+		                // export default async function () {}
+		                // export default async x => x
+		                var declaration = this.matchAsyncFunction() ? this.parseFunctionDeclaration(true) : this.parseAssignmentExpression();
+		                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+		            }
+		            else {
+		                if (this.matchContextualKeyword('from')) {
+		                    this.throwError(messages_1.Messages.UnexpectedToken, this.lookahead.value);
+		                }
+		                // export default {};
+		                // export default [];
+		                // export default (1 + 2);
+		                var declaration = this.match('{') ? this.parseObjectInitializer() :
+		                    this.match('[') ? this.parseArrayInitializer() : this.parseAssignmentExpression();
+		                this.consumeSemicolon();
+		                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+		            }
+		        }
+		        else if (this.match('*')) {
+		            // export * from 'foo';
+		            this.nextToken();
+		            if (!this.matchContextualKeyword('from')) {
+		                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+		                this.throwError(message, this.lookahead.value);
+		            }
+		            this.nextToken();
+		            var src = this.parseModuleSpecifier();
+		            this.consumeSemicolon();
+		            exportDeclaration = this.finalize(node, new Node.ExportAllDeclaration(src));
+		        }
+		        else if (this.lookahead.type === 4 /* Keyword */) {
+		            // export var f = 1;
+		            var declaration = void 0;
+		            switch (this.lookahead.value) {
+		                case 'let':
+		                case 'const':
+		                    declaration = this.parseLexicalDeclaration({ inFor: false });
+		                    break;
+		                case 'var':
+		                case 'class':
+		                case 'function':
+		                    declaration = this.parseStatementListItem();
+		                    break;
+		                default:
+		                    this.throwUnexpectedToken(this.lookahead);
+		            }
+		            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(declaration, [], null));
+		        }
+		        else if (this.matchAsyncFunction()) {
+		            var declaration = this.parseFunctionDeclaration();
+		            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(declaration, [], null));
+		        }
+		        else {
+		            var specifiers = [];
+		            var source = null;
+		            var isExportFromIdentifier = false;
+		            this.expect('{');
+		            while (!this.match('}')) {
+		                isExportFromIdentifier = isExportFromIdentifier || this.matchKeyword('default');
+		                specifiers.push(this.parseExportSpecifier());
+		                if (!this.match('}')) {
+		                    this.expect(',');
+		                }
+		            }
+		            this.expect('}');
+		            if (this.matchContextualKeyword('from')) {
+		                // export {default} from 'foo';
+		                // export {foo} from 'foo';
+		                this.nextToken();
+		                source = this.parseModuleSpecifier();
+		                this.consumeSemicolon();
+		            }
+		            else if (isExportFromIdentifier) {
+		                // export {default}; // missing fromClause
+		                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+		                this.throwError(message, this.lookahead.value);
+		            }
+		            else {
+		                // export {foo};
+		                this.consumeSemicolon();
+		            }
+		            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(null, specifiers, source));
+		        }
+		        return exportDeclaration;
+		    };
+		    return Parser;
+		}());
+		exports.Parser = Parser;
+
+
+	/***/ },
+	/* 9 */
+	/***/ function(module, exports) {
+		// Ensure the condition is true, otherwise throw an error.
+		// This is only to have a better contract semantic, i.e. another safety net
+		// to catch a logic error. The condition shall be fulfilled in normal case.
+		// Do NOT use this to enforce a certain condition on any user input.
+		Object.defineProperty(exports, "__esModule", { value: true });
+		function assert(condition, message) {
+		    /* istanbul ignore if */
+		    if (!condition) {
+		        throw new Error('ASSERT: ' + message);
+		    }
+		}
+		exports.assert = assert;
+
+
+	/***/ },
+	/* 10 */
+	/***/ function(module, exports) {
+		/* tslint:disable:max-classes-per-file */
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var ErrorHandler = (function () {
+		    function ErrorHandler() {
+		        this.errors = [];
+		        this.tolerant = false;
+		    }
+		    ErrorHandler.prototype.recordError = function (error) {
+		        this.errors.push(error);
+		    };
+		    ErrorHandler.prototype.tolerate = function (error) {
+		        if (this.tolerant) {
+		            this.recordError(error);
+		        }
+		        else {
+		            throw error;
+		        }
+		    };
+		    ErrorHandler.prototype.constructError = function (msg, column) {
+		        var error = new Error(msg);
+		        try {
+		            throw error;
+		        }
+		        catch (base) {
+		            /* istanbul ignore else */
+		            if (Object.create && Object.defineProperty) {
+		                error = Object.create(base);
+		                Object.defineProperty(error, 'column', { value: column });
+		            }
+		        }
+		        /* istanbul ignore next */
+		        return error;
+		    };
+		    ErrorHandler.prototype.createError = function (index, line, col, description) {
+		        var msg = 'Line ' + line + ': ' + description;
+		        var error = this.constructError(msg, col);
+		        error.index = index;
+		        error.lineNumber = line;
+		        error.description = description;
+		        return error;
+		    };
+		    ErrorHandler.prototype.throwError = function (index, line, col, description) {
+		        throw this.createError(index, line, col, description);
+		    };
+		    ErrorHandler.prototype.tolerateError = function (index, line, col, description) {
+		        var error = this.createError(index, line, col, description);
+		        if (this.tolerant) {
+		            this.recordError(error);
+		        }
+		        else {
+		            throw error;
+		        }
+		    };
+		    return ErrorHandler;
+		}());
+		exports.ErrorHandler = ErrorHandler;
+
+
+	/***/ },
+	/* 11 */
+	/***/ function(module, exports) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		// Error messages should be identical to V8.
+		exports.Messages = {
+		    BadGetterArity: 'Getter must not have any formal parameters',
+		    BadSetterArity: 'Setter must have exactly one formal parameter',
+		    BadSetterRestParameter: 'Setter function argument must not be a rest parameter',
+		    ConstructorIsAsync: 'Class constructor may not be an async method',
+		    ConstructorSpecialMethod: 'Class constructor may not be an accessor',
+		    DeclarationMissingInitializer: 'Missing initializer in %0 declaration',
+		    DefaultRestParameter: 'Unexpected token =',
+		    DuplicateBinding: 'Duplicate binding %0',
+		    DuplicateConstructor: 'A class may only have one constructor',
+		    DuplicateProtoProperty: 'Duplicate __proto__ fields are not allowed in object literals',
+		    ForInOfLoopInitializer: '%0 loop variable declaration may not have an initializer',
+		    GeneratorInLegacyContext: 'Generator declarations are not allowed in legacy contexts',
+		    IllegalBreak: 'Illegal break statement',
+		    IllegalContinue: 'Illegal continue statement',
+		    IllegalExportDeclaration: 'Unexpected token',
+		    IllegalImportDeclaration: 'Unexpected token',
+		    IllegalLanguageModeDirective: 'Illegal \'use strict\' directive in function with non-simple parameter list',
+		    IllegalReturn: 'Illegal return statement',
+		    InvalidEscapedReservedWord: 'Keyword must not contain escaped characters',
+		    InvalidHexEscapeSequence: 'Invalid hexadecimal escape sequence',
+		    InvalidLHSInAssignment: 'Invalid left-hand side in assignment',
+		    InvalidLHSInForIn: 'Invalid left-hand side in for-in',
+		    InvalidLHSInForLoop: 'Invalid left-hand side in for-loop',
+		    InvalidModuleSpecifier: 'Unexpected token',
+		    InvalidRegExp: 'Invalid regular expression',
+		    LetInLexicalBinding: 'let is disallowed as a lexically bound name',
+		    MissingFromClause: 'Unexpected token',
+		    MultipleDefaultsInSwitch: 'More than one default clause in switch statement',
+		    NewlineAfterThrow: 'Illegal newline after throw',
+		    NoAsAfterImportNamespace: 'Unexpected token',
+		    NoCatchOrFinally: 'Missing catch or finally after try',
+		    ParameterAfterRestParameter: 'Rest parameter must be last formal parameter',
+		    Redeclaration: '%0 \'%1\' has already been declared',
+		    StaticPrototype: 'Classes may not have static property named prototype',
+		    StrictCatchVariable: 'Catch variable may not be eval or arguments in strict mode',
+		    StrictDelete: 'Delete of an unqualified identifier in strict mode.',
+		    StrictFunction: 'In strict mode code, functions can only be declared at top level or inside a block',
+		    StrictFunctionName: 'Function name may not be eval or arguments in strict mode',
+		    StrictLHSAssignment: 'Assignment to eval or arguments is not allowed in strict mode',
+		    StrictLHSPostfix: 'Postfix increment/decrement may not have eval or arguments operand in strict mode',
+		    StrictLHSPrefix: 'Prefix increment/decrement may not have eval or arguments operand in strict mode',
+		    StrictModeWith: 'Strict mode code may not include a with statement',
+		    StrictOctalLiteral: 'Octal literals are not allowed in strict mode.',
+		    StrictParamDupe: 'Strict mode function may not have duplicate parameter names',
+		    StrictParamName: 'Parameter name eval or arguments is not allowed in strict mode',
+		    StrictReservedWord: 'Use of future reserved word in strict mode',
+		    StrictVarName: 'Variable name may not be eval or arguments in strict mode',
+		    TemplateOctalLiteral: 'Octal literals are not allowed in template strings.',
+		    UnexpectedEOS: 'Unexpected end of input',
+		    UnexpectedIdentifier: 'Unexpected identifier',
+		    UnexpectedNumber: 'Unexpected number',
+		    UnexpectedReserved: 'Unexpected reserved word',
+		    UnexpectedString: 'Unexpected string',
+		    UnexpectedTemplate: 'Unexpected quasi %0',
+		    UnexpectedToken: 'Unexpected token %0',
+		    UnexpectedTokenIllegal: 'Unexpected token ILLEGAL',
+		    UnknownLabel: 'Undefined label \'%0\'',
+		    UnterminatedRegExp: 'Invalid regular expression: missing /'
+		};
+
+
+	/***/ },
+	/* 12 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var assert_1 = __webpack_require__(9);
+		var character_1 = __webpack_require__(4);
+		var messages_1 = __webpack_require__(11);
+		function hexValue(ch) {
+		    return '0123456789abcdef'.indexOf(ch.toLowerCase());
+		}
+		function octalValue(ch) {
+		    return '01234567'.indexOf(ch);
+		}
+		var Scanner = (function () {
+		    function Scanner(code, handler) {
+		        this.source = code;
+		        this.errorHandler = handler;
+		        this.trackComment = false;
+		        this.isModule = false;
+		        this.length = code.length;
+		        this.index = 0;
+		        this.lineNumber = (code.length > 0) ? 1 : 0;
+		        this.lineStart = 0;
+		        this.curlyStack = [];
+		    }
+		    Scanner.prototype.saveState = function () {
+		        return {
+		            index: this.index,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart
+		        };
+		    };
+		    Scanner.prototype.restoreState = function (state) {
+		        this.index = state.index;
+		        this.lineNumber = state.lineNumber;
+		        this.lineStart = state.lineStart;
+		    };
+		    Scanner.prototype.eof = function () {
+		        return this.index >= this.length;
+		    };
+		    Scanner.prototype.throwUnexpectedToken = function (message) {
+		        if (message === void 0) { message = messages_1.Messages.UnexpectedTokenIllegal; }
+		        return this.errorHandler.throwError(this.index, this.lineNumber, this.index - this.lineStart + 1, message);
+		    };
+		    Scanner.prototype.tolerateUnexpectedToken = function (message) {
+		        if (message === void 0) { message = messages_1.Messages.UnexpectedTokenIllegal; }
+		        this.errorHandler.tolerateError(this.index, this.lineNumber, this.index - this.lineStart + 1, message);
+		    };
+		    // https://tc39.github.io/ecma262/#sec-comments
+		    Scanner.prototype.skipSingleLineComment = function (offset) {
+		        var comments = [];
+		        var start, loc;
+		        if (this.trackComment) {
+		            comments = [];
+		            start = this.index - offset;
+		            loc = {
+		                start: {
+		                    line: this.lineNumber,
+		                    column: this.index - this.lineStart - offset
+		                },
+		                end: {}
+		            };
+		        }
+		        while (!this.eof()) {
+		            var ch = this.source.charCodeAt(this.index);
+		            ++this.index;
+		            if (character_1.Character.isLineTerminator(ch)) {
+		                if (this.trackComment) {
+		                    loc.end = {
+		                        line: this.lineNumber,
+		                        column: this.index - this.lineStart - 1
+		                    };
+		                    var entry = {
+		                        multiLine: false,
+		                        slice: [start + offset, this.index - 1],
+		                        range: [start, this.index - 1],
+		                        loc: loc
+		                    };
+		                    comments.push(entry);
+		                }
+		                if (ch === 13 && this.source.charCodeAt(this.index) === 10) {
+		                    ++this.index;
+		                }
+		                ++this.lineNumber;
+		                this.lineStart = this.index;
+		                return comments;
+		            }
+		        }
+		        if (this.trackComment) {
+		            loc.end = {
+		                line: this.lineNumber,
+		                column: this.index - this.lineStart
+		            };
+		            var entry = {
+		                multiLine: false,
+		                slice: [start + offset, this.index],
+		                range: [start, this.index],
+		                loc: loc
+		            };
+		            comments.push(entry);
+		        }
+		        return comments;
+		    };
+		    Scanner.prototype.skipMultiLineComment = function () {
+		        var comments = [];
+		        var start, loc;
+		        if (this.trackComment) {
+		            comments = [];
+		            start = this.index - 2;
+		            loc = {
+		                start: {
+		                    line: this.lineNumber,
+		                    column: this.index - this.lineStart - 2
+		                },
+		                end: {}
+		            };
+		        }
+		        while (!this.eof()) {
+		            var ch = this.source.charCodeAt(this.index);
+		            if (character_1.Character.isLineTerminator(ch)) {
+		                if (ch === 0x0D && this.source.charCodeAt(this.index + 1) === 0x0A) {
+		                    ++this.index;
+		                }
+		                ++this.lineNumber;
+		                ++this.index;
+		                this.lineStart = this.index;
+		            }
+		            else if (ch === 0x2A) {
+		                // Block comment ends with '*/'.
+		                if (this.source.charCodeAt(this.index + 1) === 0x2F) {
+		                    this.index += 2;
+		                    if (this.trackComment) {
+		                        loc.end = {
+		                            line: this.lineNumber,
+		                            column: this.index - this.lineStart
+		                        };
+		                        var entry = {
+		                            multiLine: true,
+		                            slice: [start + 2, this.index - 2],
+		                            range: [start, this.index],
+		                            loc: loc
+		                        };
+		                        comments.push(entry);
+		                    }
+		                    return comments;
+		                }
+		                ++this.index;
+		            }
+		            else {
+		                ++this.index;
+		            }
+		        }
+		        // Ran off the end of the file - the whole thing is a comment
+		        if (this.trackComment) {
+		            loc.end = {
+		                line: this.lineNumber,
+		                column: this.index - this.lineStart
+		            };
+		            var entry = {
+		                multiLine: true,
+		                slice: [start + 2, this.index],
+		                range: [start, this.index],
+		                loc: loc
+		            };
+		            comments.push(entry);
+		        }
+		        this.tolerateUnexpectedToken();
+		        return comments;
+		    };
+		    Scanner.prototype.scanComments = function () {
+		        var comments;
+		        if (this.trackComment) {
+		            comments = [];
+		        }
+		        var start = (this.index === 0);
+		        while (!this.eof()) {
+		            var ch = this.source.charCodeAt(this.index);
+		            if (character_1.Character.isWhiteSpace(ch)) {
+		                ++this.index;
+		            }
+		            else if (character_1.Character.isLineTerminator(ch)) {
+		                ++this.index;
+		                if (ch === 0x0D && this.source.charCodeAt(this.index) === 0x0A) {
+		                    ++this.index;
+		                }
+		                ++this.lineNumber;
+		                this.lineStart = this.index;
+		                start = true;
+		            }
+		            else if (ch === 0x2F) {
+		                ch = this.source.charCodeAt(this.index + 1);
+		                if (ch === 0x2F) {
+		                    this.index += 2;
+		                    var comment = this.skipSingleLineComment(2);
+		                    if (this.trackComment) {
+		                        comments = comments.concat(comment);
+		                    }
+		                    start = true;
+		                }
+		                else if (ch === 0x2A) {
+		                    this.index += 2;
+		                    var comment = this.skipMultiLineComment();
+		                    if (this.trackComment) {
+		                        comments = comments.concat(comment);
+		                    }
+		                }
+		                else {
+		                    break;
+		                }
+		            }
+		            else if (start && ch === 0x2D) {
+		                // U+003E is '>'
+		                if ((this.source.charCodeAt(this.index + 1) === 0x2D) && (this.source.charCodeAt(this.index + 2) === 0x3E)) {
+		                    // '-->' is a single-line comment
+		                    this.index += 3;
+		                    var comment = this.skipSingleLineComment(3);
+		                    if (this.trackComment) {
+		                        comments = comments.concat(comment);
+		                    }
+		                }
+		                else {
+		                    break;
+		                }
+		            }
+		            else if (ch === 0x3C && !this.isModule) {
+		                if (this.source.slice(this.index + 1, this.index + 4) === '!--') {
+		                    this.index += 4; // `<!--`
+		                    var comment = this.skipSingleLineComment(4);
+		                    if (this.trackComment) {
+		                        comments = comments.concat(comment);
+		                    }
+		                }
+		                else {
+		                    break;
+		                }
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        return comments;
+		    };
+		    // https://tc39.github.io/ecma262/#sec-future-reserved-words
+		    Scanner.prototype.isFutureReservedWord = function (id) {
+		        switch (id) {
+		            case 'enum':
+		            case 'export':
+		            case 'import':
+		            case 'super':
+		                return true;
+		            default:
+		                return false;
+		        }
+		    };
+		    Scanner.prototype.isStrictModeReservedWord = function (id) {
+		        switch (id) {
+		            case 'implements':
+		            case 'interface':
+		            case 'package':
+		            case 'private':
+		            case 'protected':
+		            case 'public':
+		            case 'static':
+		            case 'yield':
+		            case 'let':
+		                return true;
+		            default:
+		                return false;
+		        }
+		    };
+		    Scanner.prototype.isRestrictedWord = function (id) {
+		        return id === 'eval' || id === 'arguments';
+		    };
+		    // https://tc39.github.io/ecma262/#sec-keywords
+		    Scanner.prototype.isKeyword = function (id) {
+		        switch (id.length) {
+		            case 2:
+		                return (id === 'if') || (id === 'in') || (id === 'do');
+		            case 3:
+		                return (id === 'var') || (id === 'for') || (id === 'new') ||
+		                    (id === 'try') || (id === 'let');
+		            case 4:
+		                return (id === 'this') || (id === 'else') || (id === 'case') ||
+		                    (id === 'void') || (id === 'with') || (id === 'enum');
+		            case 5:
+		                return (id === 'while') || (id === 'break') || (id === 'catch') ||
+		                    (id === 'throw') || (id === 'const') || (id === 'yield') ||
+		                    (id === 'class') || (id === 'super');
+		            case 6:
+		                return (id === 'return') || (id === 'typeof') || (id === 'delete') ||
+		                    (id === 'switch') || (id === 'export') || (id === 'import');
+		            case 7:
+		                return (id === 'default') || (id === 'finally') || (id === 'extends');
+		            case 8:
+		                return (id === 'function') || (id === 'continue') || (id === 'debugger');
+		            case 10:
+		                return (id === 'instanceof');
+		            default:
+		                return false;
+		        }
+		    };
+		    Scanner.prototype.codePointAt = function (i) {
+		        var cp = this.source.charCodeAt(i);
+		        if (cp >= 0xD800 && cp <= 0xDBFF) {
+		            var second = this.source.charCodeAt(i + 1);
+		            if (second >= 0xDC00 && second <= 0xDFFF) {
+		                var first = cp;
+		                cp = (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
+		            }
+		        }
+		        return cp;
+		    };
+		    Scanner.prototype.scanHexEscape = function (prefix) {
+		        var len = (prefix === 'u') ? 4 : 2;
+		        var code = 0;
+		        for (var i = 0; i < len; ++i) {
+		            if (!this.eof() && character_1.Character.isHexDigit(this.source.charCodeAt(this.index))) {
+		                code = code * 16 + hexValue(this.source[this.index++]);
+		            }
+		            else {
+		                return null;
+		            }
+		        }
+		        return String.fromCharCode(code);
+		    };
+		    Scanner.prototype.scanUnicodeCodePointEscape = function () {
+		        var ch = this.source[this.index];
+		        var code = 0;
+		        // At least, one hex digit is required.
+		        if (ch === '}') {
+		            this.throwUnexpectedToken();
+		        }
+		        while (!this.eof()) {
+		            ch = this.source[this.index++];
+		            if (!character_1.Character.isHexDigit(ch.charCodeAt(0))) {
+		                break;
+		            }
+		            code = code * 16 + hexValue(ch);
+		        }
+		        if (code > 0x10FFFF || ch !== '}') {
+		            this.throwUnexpectedToken();
+		        }
+		        return character_1.Character.fromCodePoint(code);
+		    };
+		    Scanner.prototype.getIdentifier = function () {
+		        var start = this.index++;
+		        while (!this.eof()) {
+		            var ch = this.source.charCodeAt(this.index);
+		            if (ch === 0x5C) {
+		                // Blackslash (U+005C) marks Unicode escape sequence.
+		                this.index = start;
+		                return this.getComplexIdentifier();
+		            }
+		            else if (ch >= 0xD800 && ch < 0xDFFF) {
+		                // Need to handle surrogate pairs.
+		                this.index = start;
+		                return this.getComplexIdentifier();
+		            }
+		            if (character_1.Character.isIdentifierPart(ch)) {
+		                ++this.index;
+		            }
+		            else {
+		                break;
+		            }
+		        }
+		        return this.source.slice(start, this.index);
+		    };
+		    Scanner.prototype.getComplexIdentifier = function () {
+		        var cp = this.codePointAt(this.index);
+		        var id = character_1.Character.fromCodePoint(cp);
+		        this.index += id.length;
+		        // '\u' (U+005C, U+0075) denotes an escaped character.
+		        var ch;
+		        if (cp === 0x5C) {
+		            if (this.source.charCodeAt(this.index) !== 0x75) {
+		                this.throwUnexpectedToken();
+		            }
+		            ++this.index;
+		            if (this.source[this.index] === '{') {
+		                ++this.index;
+		                ch = this.scanUnicodeCodePointEscape();
+		            }
+		            else {
+		                ch = this.scanHexEscape('u');
+		                if (ch === null || ch === '\\' || !character_1.Character.isIdentifierStart(ch.charCodeAt(0))) {
+		                    this.throwUnexpectedToken();
+		                }
+		            }
+		            id = ch;
+		        }
+		        while (!this.eof()) {
+		            cp = this.codePointAt(this.index);
+		            if (!character_1.Character.isIdentifierPart(cp)) {
+		                break;
+		            }
+		            ch = character_1.Character.fromCodePoint(cp);
+		            id += ch;
+		            this.index += ch.length;
+		            // '\u' (U+005C, U+0075) denotes an escaped character.
+		            if (cp === 0x5C) {
+		                id = id.substr(0, id.length - 1);
+		                if (this.source.charCodeAt(this.index) !== 0x75) {
+		                    this.throwUnexpectedToken();
+		                }
+		                ++this.index;
+		                if (this.source[this.index] === '{') {
+		                    ++this.index;
+		                    ch = this.scanUnicodeCodePointEscape();
+		                }
+		                else {
+		                    ch = this.scanHexEscape('u');
+		                    if (ch === null || ch === '\\' || !character_1.Character.isIdentifierPart(ch.charCodeAt(0))) {
+		                        this.throwUnexpectedToken();
+		                    }
+		                }
+		                id += ch;
+		            }
+		        }
+		        return id;
+		    };
+		    Scanner.prototype.octalToDecimal = function (ch) {
+		        // \0 is not octal escape sequence
+		        var octal = (ch !== '0');
+		        var code = octalValue(ch);
+		        if (!this.eof() && character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+		            octal = true;
+		            code = code * 8 + octalValue(this.source[this.index++]);
+		            // 3 digits are only allowed when string starts
+		            // with 0, 1, 2, 3
+		            if ('0123'.indexOf(ch) >= 0 && !this.eof() && character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+		                code = code * 8 + octalValue(this.source[this.index++]);
+		            }
+		        }
+		        return {
+		            code: code,
+		            octal: octal
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-names-and-keywords
+		    Scanner.prototype.scanIdentifier = function () {
+		        var type;
+		        var start = this.index;
+		        // Backslash (U+005C) starts an escaped character.
+		        var id = (this.source.charCodeAt(start) === 0x5C) ? this.getComplexIdentifier() : this.getIdentifier();
+		        // There is no keyword or literal with only one character.
+		        // Thus, it must be an identifier.
+		        if (id.length === 1) {
+		            type = 3 /* Identifier */;
+		        }
+		        else if (this.isKeyword(id)) {
+		            type = 4 /* Keyword */;
+		        }
+		        else if (id === 'null') {
+		            type = 5 /* NullLiteral */;
+		        }
+		        else if (id === 'true' || id === 'false') {
+		            type = 1 /* BooleanLiteral */;
+		        }
+		        else {
+		            type = 3 /* Identifier */;
+		        }
+		        if (type !== 3 /* Identifier */ && (start + id.length !== this.index)) {
+		            var restore = this.index;
+		            this.index = start;
+		            this.tolerateUnexpectedToken(messages_1.Messages.InvalidEscapedReservedWord);
+		            this.index = restore;
+		        }
+		        return {
+		            type: type,
+		            value: id,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-punctuators
+		    Scanner.prototype.scanPunctuator = function () {
+		        var start = this.index;
+		        // Check for most common single-character punctuators.
+		        var str = this.source[this.index];
+		        switch (str) {
+		            case '(':
+		            case '{':
+		                if (str === '{') {
+		                    this.curlyStack.push('{');
+		                }
+		                ++this.index;
+		                break;
+		            case '.':
+		                ++this.index;
+		                if (this.source[this.index] === '.' && this.source[this.index + 1] === '.') {
+		                    // Spread operator: ...
+		                    this.index += 2;
+		                    str = '...';
+		                }
+		                break;
+		            case '}':
+		                ++this.index;
+		                this.curlyStack.pop();
+		                break;
+		            case ')':
+		            case ';':
+		            case ',':
+		            case '[':
+		            case ']':
+		            case ':':
+		            case '?':
+		            case '~':
+		                ++this.index;
+		                break;
+		            default:
+		                // 4-character punctuator.
+		                str = this.source.substr(this.index, 4);
+		                if (str === '>>>=') {
+		                    this.index += 4;
+		                }
+		                else {
+		                    // 3-character punctuators.
+		                    str = str.substr(0, 3);
+		                    if (str === '===' || str === '!==' || str === '>>>' ||
+		                        str === '<<=' || str === '>>=' || str === '**=') {
+		                        this.index += 3;
+		                    }
+		                    else {
+		                        // 2-character punctuators.
+		                        str = str.substr(0, 2);
+		                        if (str === '&&' || str === '||' || str === '==' || str === '!=' ||
+		                            str === '+=' || str === '-=' || str === '*=' || str === '/=' ||
+		                            str === '++' || str === '--' || str === '<<' || str === '>>' ||
+		                            str === '&=' || str === '|=' || str === '^=' || str === '%=' ||
+		                            str === '<=' || str === '>=' || str === '=>' || str === '**') {
+		                            this.index += 2;
+		                        }
+		                        else {
+		                            // 1-character punctuators.
+		                            str = this.source[this.index];
+		                            if ('<>=!+-*%&|^/'.indexOf(str) >= 0) {
+		                                ++this.index;
+		                            }
+		                        }
+		                    }
+		                }
+		        }
+		        if (this.index === start) {
+		            this.throwUnexpectedToken();
+		        }
+		        return {
+		            type: 7 /* Punctuator */,
+		            value: str,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+		    Scanner.prototype.scanHexLiteral = function (start) {
+		        var num = '';
+		        while (!this.eof()) {
+		            if (!character_1.Character.isHexDigit(this.source.charCodeAt(this.index))) {
+		                break;
+		            }
+		            num += this.source[this.index++];
+		        }
+		        if (num.length === 0) {
+		            this.throwUnexpectedToken();
+		        }
+		        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))) {
+		            this.throwUnexpectedToken();
+		        }
+		        return {
+		            type: 6 /* NumericLiteral */,
+		            value: parseInt('0x' + num, 16),
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    Scanner.prototype.scanBinaryLiteral = function (start) {
+		        var num = '';
+		        var ch;
+		        while (!this.eof()) {
+		            ch = this.source[this.index];
+		            if (ch !== '0' && ch !== '1') {
+		                break;
+		            }
+		            num += this.source[this.index++];
+		        }
+		        if (num.length === 0) {
+		            // only 0b or 0B
+		            this.throwUnexpectedToken();
+		        }
+		        if (!this.eof()) {
+		            ch = this.source.charCodeAt(this.index);
+		            /* istanbul ignore else */
+		            if (character_1.Character.isIdentifierStart(ch) || character_1.Character.isDecimalDigit(ch)) {
+		                this.throwUnexpectedToken();
+		            }
+		        }
+		        return {
+		            type: 6 /* NumericLiteral */,
+		            value: parseInt(num, 2),
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    Scanner.prototype.scanOctalLiteral = function (prefix, start) {
+		        var num = '';
+		        var octal = false;
+		        if (character_1.Character.isOctalDigit(prefix.charCodeAt(0))) {
+		            octal = true;
+		            num = '0' + this.source[this.index++];
+		        }
+		        else {
+		            ++this.index;
+		        }
+		        while (!this.eof()) {
+		            if (!character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+		                break;
+		            }
+		            num += this.source[this.index++];
+		        }
+		        if (!octal && num.length === 0) {
+		            // only 0o or 0O
+		            this.throwUnexpectedToken();
+		        }
+		        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index)) || character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		            this.throwUnexpectedToken();
+		        }
+		        return {
+		            type: 6 /* NumericLiteral */,
+		            value: parseInt(num, 8),
+		            octal: octal,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    Scanner.prototype.isImplicitOctalLiteral = function () {
+		        // Implicit octal, unless there is a non-octal digit.
+		        // (Annex B.1.1 on Numeric Literals)
+		        for (var i = this.index + 1; i < this.length; ++i) {
+		            var ch = this.source[i];
+		            if (ch === '8' || ch === '9') {
+		                return false;
+		            }
+		            if (!character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+		                return true;
+		            }
+		        }
+		        return true;
+		    };
+		    Scanner.prototype.scanNumericLiteral = function () {
+		        var start = this.index;
+		        var ch = this.source[start];
+		        assert_1.assert(character_1.Character.isDecimalDigit(ch.charCodeAt(0)) || (ch === '.'), 'Numeric literal must start with a decimal digit or a decimal point');
+		        var num = '';
+		        if (ch !== '.') {
+		            num = this.source[this.index++];
+		            ch = this.source[this.index];
+		            // Hex number starts with '0x'.
+		            // Octal number starts with '0'.
+		            // Octal number in ES6 starts with '0o'.
+		            // Binary number in ES6 starts with '0b'.
+		            if (num === '0') {
+		                if (ch === 'x' || ch === 'X') {
+		                    ++this.index;
+		                    return this.scanHexLiteral(start);
+		                }
+		                if (ch === 'b' || ch === 'B') {
+		                    ++this.index;
+		                    return this.scanBinaryLiteral(start);
+		                }
+		                if (ch === 'o' || ch === 'O') {
+		                    return this.scanOctalLiteral(ch, start);
+		                }
+		                if (ch && character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+		                    if (this.isImplicitOctalLiteral()) {
+		                        return this.scanOctalLiteral(ch, start);
+		                    }
+		                }
+		            }
+		            while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		                num += this.source[this.index++];
+		            }
+		            ch = this.source[this.index];
+		        }
+		        if (ch === '.') {
+		            num += this.source[this.index++];
+		            while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		                num += this.source[this.index++];
+		            }
+		            ch = this.source[this.index];
+		        }
+		        if (ch === 'e' || ch === 'E') {
+		            num += this.source[this.index++];
+		            ch = this.source[this.index];
+		            if (ch === '+' || ch === '-') {
+		                num += this.source[this.index++];
+		            }
+		            if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		                while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		                    num += this.source[this.index++];
+		                }
+		            }
+		            else {
+		                this.throwUnexpectedToken();
+		            }
+		        }
+		        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))) {
+		            this.throwUnexpectedToken();
+		        }
+		        return {
+		            type: 6 /* NumericLiteral */,
+		            value: parseFloat(num),
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-literals-string-literals
+		    Scanner.prototype.scanStringLiteral = function () {
+		        var start = this.index;
+		        var quote = this.source[start];
+		        assert_1.assert((quote === '\'' || quote === '"'), 'String literal must starts with a quote');
+		        ++this.index;
+		        var octal = false;
+		        var str = '';
+		        while (!this.eof()) {
+		            var ch = this.source[this.index++];
+		            if (ch === quote) {
+		                quote = '';
+		                break;
+		            }
+		            else if (ch === '\\') {
+		                ch = this.source[this.index++];
+		                if (!ch || !character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                    switch (ch) {
+		                        case 'u':
+		                            if (this.source[this.index] === '{') {
+		                                ++this.index;
+		                                str += this.scanUnicodeCodePointEscape();
+		                            }
+		                            else {
+		                                var unescaped_1 = this.scanHexEscape(ch);
+		                                if (unescaped_1 === null) {
+		                                    this.throwUnexpectedToken();
+		                                }
+		                                str += unescaped_1;
+		                            }
+		                            break;
+		                        case 'x':
+		                            var unescaped = this.scanHexEscape(ch);
+		                            if (unescaped === null) {
+		                                this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);
+		                            }
+		                            str += unescaped;
+		                            break;
+		                        case 'n':
+		                            str += '\n';
+		                            break;
+		                        case 'r':
+		                            str += '\r';
+		                            break;
+		                        case 't':
+		                            str += '\t';
+		                            break;
+		                        case 'b':
+		                            str += '\b';
+		                            break;
+		                        case 'f':
+		                            str += '\f';
+		                            break;
+		                        case 'v':
+		                            str += '\x0B';
+		                            break;
+		                        case '8':
+		                        case '9':
+		                            str += ch;
+		                            this.tolerateUnexpectedToken();
+		                            break;
+		                        default:
+		                            if (ch && character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+		                                var octToDec = this.octalToDecimal(ch);
+		                                octal = octToDec.octal || octal;
+		                                str += String.fromCharCode(octToDec.code);
+		                            }
+		                            else {
+		                                str += ch;
+		                            }
+		                            break;
+		                    }
+		                }
+		                else {
+		                    ++this.lineNumber;
+		                    if (ch === '\r' && this.source[this.index] === '\n') {
+		                        ++this.index;
+		                    }
+		                    this.lineStart = this.index;
+		                }
+		            }
+		            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                break;
+		            }
+		            else {
+		                str += ch;
+		            }
+		        }
+		        if (quote !== '') {
+		            this.index = start;
+		            this.throwUnexpectedToken();
+		        }
+		        return {
+		            type: 8 /* StringLiteral */,
+		            value: str,
+		            octal: octal,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-template-literal-lexical-components
+		    Scanner.prototype.scanTemplate = function () {
+		        var cooked = '';
+		        var terminated = false;
+		        var start = this.index;
+		        var head = (this.source[start] === '`');
+		        var tail = false;
+		        var rawOffset = 2;
+		        ++this.index;
+		        while (!this.eof()) {
+		            var ch = this.source[this.index++];
+		            if (ch === '`') {
+		                rawOffset = 1;
+		                tail = true;
+		                terminated = true;
+		                break;
+		            }
+		            else if (ch === '$') {
+		                if (this.source[this.index] === '{') {
+		                    this.curlyStack.push('${');
+		                    ++this.index;
+		                    terminated = true;
+		                    break;
+		                }
+		                cooked += ch;
+		            }
+		            else if (ch === '\\') {
+		                ch = this.source[this.index++];
+		                if (!character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                    switch (ch) {
+		                        case 'n':
+		                            cooked += '\n';
+		                            break;
+		                        case 'r':
+		                            cooked += '\r';
+		                            break;
+		                        case 't':
+		                            cooked += '\t';
+		                            break;
+		                        case 'u':
+		                            if (this.source[this.index] === '{') {
+		                                ++this.index;
+		                                cooked += this.scanUnicodeCodePointEscape();
+		                            }
+		                            else {
+		                                var restore = this.index;
+		                                var unescaped_2 = this.scanHexEscape(ch);
+		                                if (unescaped_2 !== null) {
+		                                    cooked += unescaped_2;
+		                                }
+		                                else {
+		                                    this.index = restore;
+		                                    cooked += ch;
+		                                }
+		                            }
+		                            break;
+		                        case 'x':
+		                            var unescaped = this.scanHexEscape(ch);
+		                            if (unescaped === null) {
+		                                this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);
+		                            }
+		                            cooked += unescaped;
+		                            break;
+		                        case 'b':
+		                            cooked += '\b';
+		                            break;
+		                        case 'f':
+		                            cooked += '\f';
+		                            break;
+		                        case 'v':
+		                            cooked += '\v';
+		                            break;
+		                        default:
+		                            if (ch === '0') {
+		                                if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+		                                    // Illegal: \01 \02 and so on
+		                                    this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);
+		                                }
+		                                cooked += '\0';
+		                            }
+		                            else if (character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+		                                // Illegal: \1 \2
+		                                this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);
+		                            }
+		                            else {
+		                                cooked += ch;
+		                            }
+		                            break;
+		                    }
+		                }
+		                else {
+		                    ++this.lineNumber;
+		                    if (ch === '\r' && this.source[this.index] === '\n') {
+		                        ++this.index;
+		                    }
+		                    this.lineStart = this.index;
+		                }
+		            }
+		            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                ++this.lineNumber;
+		                if (ch === '\r' && this.source[this.index] === '\n') {
+		                    ++this.index;
+		                }
+		                this.lineStart = this.index;
+		                cooked += '\n';
+		            }
+		            else {
+		                cooked += ch;
+		            }
+		        }
+		        if (!terminated) {
+		            this.throwUnexpectedToken();
+		        }
+		        if (!head) {
+		            this.curlyStack.pop();
+		        }
+		        return {
+		            type: 10 /* Template */,
+		            value: this.source.slice(start + 1, this.index - rawOffset),
+		            cooked: cooked,
+		            head: head,
+		            tail: tail,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    // https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+		    Scanner.prototype.testRegExp = function (pattern, flags) {
+		        // The BMP character to use as a replacement for astral symbols when
+		        // translating an ES6 "u"-flagged pattern to an ES5-compatible
+		        // approximation.
+		        // Note: replacing with '\uFFFF' enables false positives in unlikely
+		        // scenarios. For example, `[\u{1044f}-\u{10440}]` is an invalid
+		        // pattern that would not be detected by this substitution.
+		        var astralSubstitute = '\uFFFF';
+		        var tmp = pattern;
+		        var self = this;
+		        if (flags.indexOf('u') >= 0) {
+		            tmp = tmp
+		                .replace(/\\u\{([0-9a-fA-F]+)\}|\\u([a-fA-F0-9]{4})/g, function ($0, $1, $2) {
+		                var codePoint = parseInt($1 || $2, 16);
+		                if (codePoint > 0x10FFFF) {
+		                    self.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);
+		                }
+		                if (codePoint <= 0xFFFF) {
+		                    return String.fromCharCode(codePoint);
+		                }
+		                return astralSubstitute;
+		            })
+		                .replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g, astralSubstitute);
+		        }
+		        // First, detect invalid regular expressions.
+		        try {
+		            RegExp(tmp);
+		        }
+		        catch (e) {
+		            this.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);
+		        }
+		        // Return a regular expression object for this pattern-flag pair, or
+		        // `null` in case the current environment doesn't support the flags it
+		        // uses.
+		        try {
+		            return new RegExp(pattern, flags);
+		        }
+		        catch (exception) {
+		            /* istanbul ignore next */
+		            return null;
+		        }
+		    };
+		    Scanner.prototype.scanRegExpBody = function () {
+		        var ch = this.source[this.index];
+		        assert_1.assert(ch === '/', 'Regular expression literal must start with a slash');
+		        var str = this.source[this.index++];
+		        var classMarker = false;
+		        var terminated = false;
+		        while (!this.eof()) {
+		            ch = this.source[this.index++];
+		            str += ch;
+		            if (ch === '\\') {
+		                ch = this.source[this.index++];
+		                // https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+		                if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                    this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+		                }
+		                str += ch;
+		            }
+		            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+		                this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+		            }
+		            else if (classMarker) {
+		                if (ch === ']') {
+		                    classMarker = false;
+		                }
+		            }
+		            else {
+		                if (ch === '/') {
+		                    terminated = true;
+		                    break;
+		                }
+		                else if (ch === '[') {
+		                    classMarker = true;
+		                }
+		            }
+		        }
+		        if (!terminated) {
+		            this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+		        }
+		        // Exclude leading and trailing slash.
+		        return str.substr(1, str.length - 2);
+		    };
+		    Scanner.prototype.scanRegExpFlags = function () {
+		        var str = '';
+		        var flags = '';
+		        while (!this.eof()) {
+		            var ch = this.source[this.index];
+		            if (!character_1.Character.isIdentifierPart(ch.charCodeAt(0))) {
+		                break;
+		            }
+		            ++this.index;
+		            if (ch === '\\' && !this.eof()) {
+		                ch = this.source[this.index];
+		                if (ch === 'u') {
+		                    ++this.index;
+		                    var restore = this.index;
+		                    var char = this.scanHexEscape('u');
+		                    if (char !== null) {
+		                        flags += char;
+		                        for (str += '\\u'; restore < this.index; ++restore) {
+		                            str += this.source[restore];
+		                        }
+		                    }
+		                    else {
+		                        this.index = restore;
+		                        flags += 'u';
+		                        str += '\\u';
+		                    }
+		                    this.tolerateUnexpectedToken();
+		                }
+		                else {
+		                    str += '\\';
+		                    this.tolerateUnexpectedToken();
+		                }
+		            }
+		            else {
+		                flags += ch;
+		                str += ch;
+		            }
+		        }
+		        return flags;
+		    };
+		    Scanner.prototype.scanRegExp = function () {
+		        var start = this.index;
+		        var pattern = this.scanRegExpBody();
+		        var flags = this.scanRegExpFlags();
+		        var value = this.testRegExp(pattern, flags);
+		        return {
+		            type: 9 /* RegularExpression */,
+		            value: '',
+		            pattern: pattern,
+		            flags: flags,
+		            regex: value,
+		            lineNumber: this.lineNumber,
+		            lineStart: this.lineStart,
+		            start: start,
+		            end: this.index
+		        };
+		    };
+		    Scanner.prototype.lex = function () {
+		        if (this.eof()) {
+		            return {
+		                type: 2 /* EOF */,
+		                value: '',
+		                lineNumber: this.lineNumber,
+		                lineStart: this.lineStart,
+		                start: this.index,
+		                end: this.index
+		            };
+		        }
+		        var cp = this.source.charCodeAt(this.index);
+		        if (character_1.Character.isIdentifierStart(cp)) {
+		            return this.scanIdentifier();
+		        }
+		        // Very common: ( and ) and ;
+		        if (cp === 0x28 || cp === 0x29 || cp === 0x3B) {
+		            return this.scanPunctuator();
+		        }
+		        // String literal starts with single quote (U+0027) or double quote (U+0022).
+		        if (cp === 0x27 || cp === 0x22) {
+		            return this.scanStringLiteral();
+		        }
+		        // Dot (.) U+002E can also start a floating-point number, hence the need
+		        // to check the next character.
+		        if (cp === 0x2E) {
+		            if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index + 1))) {
+		                return this.scanNumericLiteral();
+		            }
+		            return this.scanPunctuator();
+		        }
+		        if (character_1.Character.isDecimalDigit(cp)) {
+		            return this.scanNumericLiteral();
+		        }
+		        // Template literals start with ` (U+0060) for template head
+		        // or } (U+007D) for template middle or template tail.
+		        if (cp === 0x60 || (cp === 0x7D && this.curlyStack[this.curlyStack.length - 1] === '${')) {
+		            return this.scanTemplate();
+		        }
+		        // Possible identifier start in a surrogate pair.
+		        if (cp >= 0xD800 && cp < 0xDFFF) {
+		            if (character_1.Character.isIdentifierStart(this.codePointAt(this.index))) {
+		                return this.scanIdentifier();
+		            }
+		        }
+		        return this.scanPunctuator();
+		    };
+		    return Scanner;
+		}());
+		exports.Scanner = Scanner;
+
+
+	/***/ },
+	/* 13 */
+	/***/ function(module, exports) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		exports.TokenName = {};
+		exports.TokenName[1 /* BooleanLiteral */] = 'Boolean';
+		exports.TokenName[2 /* EOF */] = '<end>';
+		exports.TokenName[3 /* Identifier */] = 'Identifier';
+		exports.TokenName[4 /* Keyword */] = 'Keyword';
+		exports.TokenName[5 /* NullLiteral */] = 'Null';
+		exports.TokenName[6 /* NumericLiteral */] = 'Numeric';
+		exports.TokenName[7 /* Punctuator */] = 'Punctuator';
+		exports.TokenName[8 /* StringLiteral */] = 'String';
+		exports.TokenName[9 /* RegularExpression */] = 'RegularExpression';
+		exports.TokenName[10 /* Template */] = 'Template';
+
+
+	/***/ },
+	/* 14 */
+	/***/ function(module, exports) {
+		// Generated by generate-xhtml-entities.js. DO NOT MODIFY!
+		Object.defineProperty(exports, "__esModule", { value: true });
+		exports.XHTMLEntities = {
+		    quot: '\u0022',
+		    amp: '\u0026',
+		    apos: '\u0027',
+		    gt: '\u003E',
+		    nbsp: '\u00A0',
+		    iexcl: '\u00A1',
+		    cent: '\u00A2',
+		    pound: '\u00A3',
+		    curren: '\u00A4',
+		    yen: '\u00A5',
+		    brvbar: '\u00A6',
+		    sect: '\u00A7',
+		    uml: '\u00A8',
+		    copy: '\u00A9',
+		    ordf: '\u00AA',
+		    laquo: '\u00AB',
+		    not: '\u00AC',
+		    shy: '\u00AD',
+		    reg: '\u00AE',
+		    macr: '\u00AF',
+		    deg: '\u00B0',
+		    plusmn: '\u00B1',
+		    sup2: '\u00B2',
+		    sup3: '\u00B3',
+		    acute: '\u00B4',
+		    micro: '\u00B5',
+		    para: '\u00B6',
+		    middot: '\u00B7',
+		    cedil: '\u00B8',
+		    sup1: '\u00B9',
+		    ordm: '\u00BA',
+		    raquo: '\u00BB',
+		    frac14: '\u00BC',
+		    frac12: '\u00BD',
+		    frac34: '\u00BE',
+		    iquest: '\u00BF',
+		    Agrave: '\u00C0',
+		    Aacute: '\u00C1',
+		    Acirc: '\u00C2',
+		    Atilde: '\u00C3',
+		    Auml: '\u00C4',
+		    Aring: '\u00C5',
+		    AElig: '\u00C6',
+		    Ccedil: '\u00C7',
+		    Egrave: '\u00C8',
+		    Eacute: '\u00C9',
+		    Ecirc: '\u00CA',
+		    Euml: '\u00CB',
+		    Igrave: '\u00CC',
+		    Iacute: '\u00CD',
+		    Icirc: '\u00CE',
+		    Iuml: '\u00CF',
+		    ETH: '\u00D0',
+		    Ntilde: '\u00D1',
+		    Ograve: '\u00D2',
+		    Oacute: '\u00D3',
+		    Ocirc: '\u00D4',
+		    Otilde: '\u00D5',
+		    Ouml: '\u00D6',
+		    times: '\u00D7',
+		    Oslash: '\u00D8',
+		    Ugrave: '\u00D9',
+		    Uacute: '\u00DA',
+		    Ucirc: '\u00DB',
+		    Uuml: '\u00DC',
+		    Yacute: '\u00DD',
+		    THORN: '\u00DE',
+		    szlig: '\u00DF',
+		    agrave: '\u00E0',
+		    aacute: '\u00E1',
+		    acirc: '\u00E2',
+		    atilde: '\u00E3',
+		    auml: '\u00E4',
+		    aring: '\u00E5',
+		    aelig: '\u00E6',
+		    ccedil: '\u00E7',
+		    egrave: '\u00E8',
+		    eacute: '\u00E9',
+		    ecirc: '\u00EA',
+		    euml: '\u00EB',
+		    igrave: '\u00EC',
+		    iacute: '\u00ED',
+		    icirc: '\u00EE',
+		    iuml: '\u00EF',
+		    eth: '\u00F0',
+		    ntilde: '\u00F1',
+		    ograve: '\u00F2',
+		    oacute: '\u00F3',
+		    ocirc: '\u00F4',
+		    otilde: '\u00F5',
+		    ouml: '\u00F6',
+		    divide: '\u00F7',
+		    oslash: '\u00F8',
+		    ugrave: '\u00F9',
+		    uacute: '\u00FA',
+		    ucirc: '\u00FB',
+		    uuml: '\u00FC',
+		    yacute: '\u00FD',
+		    thorn: '\u00FE',
+		    yuml: '\u00FF',
+		    OElig: '\u0152',
+		    oelig: '\u0153',
+		    Scaron: '\u0160',
+		    scaron: '\u0161',
+		    Yuml: '\u0178',
+		    fnof: '\u0192',
+		    circ: '\u02C6',
+		    tilde: '\u02DC',
+		    Alpha: '\u0391',
+		    Beta: '\u0392',
+		    Gamma: '\u0393',
+		    Delta: '\u0394',
+		    Epsilon: '\u0395',
+		    Zeta: '\u0396',
+		    Eta: '\u0397',
+		    Theta: '\u0398',
+		    Iota: '\u0399',
+		    Kappa: '\u039A',
+		    Lambda: '\u039B',
+		    Mu: '\u039C',
+		    Nu: '\u039D',
+		    Xi: '\u039E',
+		    Omicron: '\u039F',
+		    Pi: '\u03A0',
+		    Rho: '\u03A1',
+		    Sigma: '\u03A3',
+		    Tau: '\u03A4',
+		    Upsilon: '\u03A5',
+		    Phi: '\u03A6',
+		    Chi: '\u03A7',
+		    Psi: '\u03A8',
+		    Omega: '\u03A9',
+		    alpha: '\u03B1',
+		    beta: '\u03B2',
+		    gamma: '\u03B3',
+		    delta: '\u03B4',
+		    epsilon: '\u03B5',
+		    zeta: '\u03B6',
+		    eta: '\u03B7',
+		    theta: '\u03B8',
+		    iota: '\u03B9',
+		    kappa: '\u03BA',
+		    lambda: '\u03BB',
+		    mu: '\u03BC',
+		    nu: '\u03BD',
+		    xi: '\u03BE',
+		    omicron: '\u03BF',
+		    pi: '\u03C0',
+		    rho: '\u03C1',
+		    sigmaf: '\u03C2',
+		    sigma: '\u03C3',
+		    tau: '\u03C4',
+		    upsilon: '\u03C5',
+		    phi: '\u03C6',
+		    chi: '\u03C7',
+		    psi: '\u03C8',
+		    omega: '\u03C9',
+		    thetasym: '\u03D1',
+		    upsih: '\u03D2',
+		    piv: '\u03D6',
+		    ensp: '\u2002',
+		    emsp: '\u2003',
+		    thinsp: '\u2009',
+		    zwnj: '\u200C',
+		    zwj: '\u200D',
+		    lrm: '\u200E',
+		    rlm: '\u200F',
+		    ndash: '\u2013',
+		    mdash: '\u2014',
+		    lsquo: '\u2018',
+		    rsquo: '\u2019',
+		    sbquo: '\u201A',
+		    ldquo: '\u201C',
+		    rdquo: '\u201D',
+		    bdquo: '\u201E',
+		    dagger: '\u2020',
+		    Dagger: '\u2021',
+		    bull: '\u2022',
+		    hellip: '\u2026',
+		    permil: '\u2030',
+		    prime: '\u2032',
+		    Prime: '\u2033',
+		    lsaquo: '\u2039',
+		    rsaquo: '\u203A',
+		    oline: '\u203E',
+		    frasl: '\u2044',
+		    euro: '\u20AC',
+		    image: '\u2111',
+		    weierp: '\u2118',
+		    real: '\u211C',
+		    trade: '\u2122',
+		    alefsym: '\u2135',
+		    larr: '\u2190',
+		    uarr: '\u2191',
+		    rarr: '\u2192',
+		    darr: '\u2193',
+		    harr: '\u2194',
+		    crarr: '\u21B5',
+		    lArr: '\u21D0',
+		    uArr: '\u21D1',
+		    rArr: '\u21D2',
+		    dArr: '\u21D3',
+		    hArr: '\u21D4',
+		    forall: '\u2200',
+		    part: '\u2202',
+		    exist: '\u2203',
+		    empty: '\u2205',
+		    nabla: '\u2207',
+		    isin: '\u2208',
+		    notin: '\u2209',
+		    ni: '\u220B',
+		    prod: '\u220F',
+		    sum: '\u2211',
+		    minus: '\u2212',
+		    lowast: '\u2217',
+		    radic: '\u221A',
+		    prop: '\u221D',
+		    infin: '\u221E',
+		    ang: '\u2220',
+		    and: '\u2227',
+		    or: '\u2228',
+		    cap: '\u2229',
+		    cup: '\u222A',
+		    int: '\u222B',
+		    there4: '\u2234',
+		    sim: '\u223C',
+		    cong: '\u2245',
+		    asymp: '\u2248',
+		    ne: '\u2260',
+		    equiv: '\u2261',
+		    le: '\u2264',
+		    ge: '\u2265',
+		    sub: '\u2282',
+		    sup: '\u2283',
+		    nsub: '\u2284',
+		    sube: '\u2286',
+		    supe: '\u2287',
+		    oplus: '\u2295',
+		    otimes: '\u2297',
+		    perp: '\u22A5',
+		    sdot: '\u22C5',
+		    lceil: '\u2308',
+		    rceil: '\u2309',
+		    lfloor: '\u230A',
+		    rfloor: '\u230B',
+		    loz: '\u25CA',
+		    spades: '\u2660',
+		    clubs: '\u2663',
+		    hearts: '\u2665',
+		    diams: '\u2666',
+		    lang: '\u27E8',
+		    rang: '\u27E9'
+		};
+
+
+	/***/ },
+	/* 15 */
+	/***/ function(module, exports, __webpack_require__) {
+		Object.defineProperty(exports, "__esModule", { value: true });
+		var error_handler_1 = __webpack_require__(10);
+		var scanner_1 = __webpack_require__(12);
+		var token_1 = __webpack_require__(13);
+		var Reader = (function () {
+		    function Reader() {
+		        this.values = [];
+		        this.curly = this.paren = -1;
+		    }
+		    // A function following one of those tokens is an expression.
+		    Reader.prototype.beforeFunctionExpression = function (t) {
+		        return ['(', '{', '[', 'in', 'typeof', 'instanceof', 'new',
+		            'return', 'case', 'delete', 'throw', 'void',
+		            // assignment operators
+		            '=', '+=', '-=', '*=', '**=', '/=', '%=', '<<=', '>>=', '>>>=',
+		            '&=', '|=', '^=', ',',
+		            // binary/unary operators
+		            '+', '-', '*', '**', '/', '%', '++', '--', '<<', '>>', '>>>', '&',
+		            '|', '^', '!', '~', '&&', '||', '?', ':', '===', '==', '>=',
+		            '<=', '<', '>', '!=', '!=='].indexOf(t) >= 0;
+		    };
+		    // Determine if forward slash (/) is an operator or part of a regular expression
+		    // https://github.com/mozilla/sweet.js/wiki/design
+		    Reader.prototype.isRegexStart = function () {
+		        var previous = this.values[this.values.length - 1];
+		        var regex = (previous !== null);
+		        switch (previous) {
+		            case 'this':
+		            case ']':
+		                regex = false;
+		                break;
+		            case ')':
+		                var keyword = this.values[this.paren - 1];
+		                regex = (keyword === 'if' || keyword === 'while' || keyword === 'for' || keyword === 'with');
+		                break;
+		            case '}':
+		                // Dividing a function by anything makes little sense,
+		                // but we have to check for that.
+		                regex = false;
+		                if (this.values[this.curly - 3] === 'function') {
+		                    // Anonymous function, e.g. function(){} /42
+		                    var check = this.values[this.curly - 4];
+		                    regex = check ? !this.beforeFunctionExpression(check) : false;
+		                }
+		                else if (this.values[this.curly - 4] === 'function') {
+		                    // Named function, e.g. function f(){} /42/
+		                    var check = this.values[this.curly - 5];
+		                    regex = check ? !this.beforeFunctionExpression(check) : true;
+		                }
+		                break;
+		            default:
+		                break;
+		        }
+		        return regex;
+		    };
+		    Reader.prototype.push = function (token) {
+		        if (token.type === 7 /* Punctuator */ || token.type === 4 /* Keyword */) {
+		            if (token.value === '{') {
+		                this.curly = this.values.length;
+		            }
+		            else if (token.value === '(') {
+		                this.paren = this.values.length;
+		            }
+		            this.values.push(token.value);
+		        }
+		        else {
+		            this.values.push(null);
+		        }
+		    };
+		    return Reader;
+		}());
+		var Tokenizer = (function () {
+		    function Tokenizer(code, config) {
+		        this.errorHandler = new error_handler_1.ErrorHandler();
+		        this.errorHandler.tolerant = config ? (typeof config.tolerant === 'boolean' && config.tolerant) : false;
+		        this.scanner = new scanner_1.Scanner(code, this.errorHandler);
+		        this.scanner.trackComment = config ? (typeof config.comment === 'boolean' && config.comment) : false;
+		        this.trackRange = config ? (typeof config.range === 'boolean' && config.range) : false;
+		        this.trackLoc = config ? (typeof config.loc === 'boolean' && config.loc) : false;
+		        this.buffer = [];
+		        this.reader = new Reader();
+		    }
+		    Tokenizer.prototype.errors = function () {
+		        return this.errorHandler.errors;
+		    };
+		    Tokenizer.prototype.getNextToken = function () {
+		        if (this.buffer.length === 0) {
+		            var comments = this.scanner.scanComments();
+		            if (this.scanner.trackComment) {
+		                for (var i = 0; i < comments.length; ++i) {
+		                    var e = comments[i];
+		                    var value = this.scanner.source.slice(e.slice[0], e.slice[1]);
+		                    var comment = {
+		                        type: e.multiLine ? 'BlockComment' : 'LineComment',
+		                        value: value
+		                    };
+		                    if (this.trackRange) {
+		                        comment.range = e.range;
+		                    }
+		                    if (this.trackLoc) {
+		                        comment.loc = e.loc;
+		                    }
+		                    this.buffer.push(comment);
+		                }
+		            }
+		            if (!this.scanner.eof()) {
+		                var loc = void 0;
+		                if (this.trackLoc) {
+		                    loc = {
+		                        start: {
+		                            line: this.scanner.lineNumber,
+		                            column: this.scanner.index - this.scanner.lineStart
+		                        },
+		                        end: {}
+		                    };
+		                }
+		                var startRegex = (this.scanner.source[this.scanner.index] === '/') && this.reader.isRegexStart();
+		                var token = startRegex ? this.scanner.scanRegExp() : this.scanner.lex();
+		                this.reader.push(token);
+		                var entry = {
+		                    type: token_1.TokenName[token.type],
+		                    value: this.scanner.source.slice(token.start, token.end)
+		                };
+		                if (this.trackRange) {
+		                    entry.range = [token.start, token.end];
+		                }
+		                if (this.trackLoc) {
+		                    loc.end = {
+		                        line: this.scanner.lineNumber,
+		                        column: this.scanner.index - this.scanner.lineStart
+		                    };
+		                    entry.loc = loc;
+		                }
+		                if (token.type === 9 /* RegularExpression */) {
+		                    var pattern = token.pattern;
+		                    var flags = token.flags;
+		                    entry.regex = { pattern: pattern, flags: flags };
+		                }
+		                this.buffer.push(entry);
+		            }
+		        }
+		        return this.buffer.shift();
+		    };
+		    return Tokenizer;
+		}());
+		exports.Tokenizer = Tokenizer;
+
+
+	/***/ }
+	/******/ ])
+	});
+	});
+
+	unwrapExports(esprima$1);
+
+	var esprima$2 = createCommonjsModule(function (module, exports) {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	// This module is suitable for passing as options.parser when calling
+	// recast.parse to process ECMAScript code with Esprima:
+	//
+	//   const ast = recast.parse(source, {
+	//     parser: require("recast/parsers/esprima")
+	//   });
+	//
+
+	function parse(source, options) {
+	    var comments = [];
+	    var ast = esprima$1.parse(source, {
+	        loc: true,
+	        locations: true,
+	        comment: true,
+	        onComment: comments,
+	        range: util$1.getOption(options, "range", false),
+	        tolerant: util$1.getOption(options, "tolerant", true),
+	        tokens: true
+	    });
+	    if (!Array.isArray(ast.comments)) {
+	        ast.comments = comments;
+	    }
+	    return ast;
+	}
+	exports.parse = parse;
+	});
+
+	unwrapExports(esprima$2);
+	var esprima_1 = esprima$2.parse;
+
+	/*
+	The MIT License (MIT)
+
+	Copyright (c) 2016 CoderPuppy
+
+	Permission is hereby granted, free of charge, to any person obtaining a copy
+	of this software and associated documentation files (the "Software"), to deal
+	in the Software without restriction, including without limitation the rights
+	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+	copies of the Software, and to permit persons to whom the Software is
+	furnished to do so, subject to the following conditions:
+
+	The above copyright notice and this permission notice shall be included in all
+	copies or substantial portions of the Software.
+
+	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+	SOFTWARE.
+
+	*/
+	var _endianness;
+	function endianness() {
+	  if (typeof _endianness === 'undefined') {
+	    var a = new ArrayBuffer(2);
+	    var b = new Uint8Array(a);
+	    var c = new Uint16Array(a);
+	    b[0] = 1;
+	    b[1] = 2;
+	    if (c[0] === 258) {
+	      _endianness = 'BE';
+	    } else if (c[0] === 513){
+	      _endianness = 'LE';
+	    } else {
+	      throw new Error('unable to figure out endianess');
+	    }
+	  }
+	  return _endianness;
+	}
+
+	function hostname() {
+	  if (typeof global.location !== 'undefined') {
+	    return global.location.hostname
+	  } else return '';
+	}
+
+	function loadavg() {
+	  return [];
+	}
+
+	function uptime() {
+	  return 0;
+	}
+
+	function freemem() {
+	  return Number.MAX_VALUE;
+	}
+
+	function totalmem() {
+	  return Number.MAX_VALUE;
+	}
+
+	function cpus() {
+	  return [];
+	}
+
+	function type() {
+	  return 'Browser';
+	}
+
+	function release () {
+	  if (typeof global.navigator !== 'undefined') {
+	    return global.navigator.appVersion;
+	  }
+	  return '';
+	}
+
+	function networkInterfaces(){}
+	function getNetworkInterfaces(){}
+
+	function tmpDir() {
+	  return '/tmp';
+	}
+	var tmpdir = tmpDir;
+
+	var EOL = '\n';
+	var require$$1 = {
+	  EOL: EOL,
+	  tmpdir: tmpdir,
+	  tmpDir: tmpDir,
+	  networkInterfaces:networkInterfaces,
+	  getNetworkInterfaces: getNetworkInterfaces,
+	  release: release,
+	  type: type,
+	  cpus: cpus,
+	  totalmem: totalmem,
+	  freemem: freemem,
+	  uptime: uptime,
+	  loadavg: loadavg,
+	  hostname: hostname,
+	  endianness: endianness,
+	};
+
+	var options = createCommonjsModule(function (module, exports) {
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var defaults = {
+	    parser: esprima$2,
+	    tabWidth: 4,
+	    useTabs: false,
+	    reuseWhitespace: true,
+	    lineTerminator: require$$1.EOL ,
+	    wrapColumn: 74,
+	    sourceFileName: null,
+	    sourceMapName: null,
+	    sourceRoot: null,
+	    inputSourceMap: null,
+	    range: false,
+	    tolerant: true,
+	    quote: null,
+	    trailingComma: false,
+	    arrayBracketSpacing: false,
+	    objectCurlySpacing: true,
+	    arrowParensAlways: false,
+	    flowObjectCommas: true,
+	    tokens: true
+	}, hasOwn = defaults.hasOwnProperty;
+	// Copy options and fill in default values.
+	function normalize(opts) {
+	    var options = opts || defaults;
+	    function get(key) {
+	        return hasOwn.call(options, key)
+	            ? options[key]
+	            : defaults[key];
+	    }
+	    return {
+	        tabWidth: +get("tabWidth"),
+	        useTabs: !!get("useTabs"),
+	        reuseWhitespace: !!get("reuseWhitespace"),
+	        lineTerminator: get("lineTerminator"),
+	        wrapColumn: Math.max(get("wrapColumn"), 0),
+	        sourceFileName: get("sourceFileName"),
+	        sourceMapName: get("sourceMapName"),
+	        sourceRoot: get("sourceRoot"),
+	        inputSourceMap: get("inputSourceMap"),
+	        parser: get("esprima") || get("parser"),
+	        range: get("range"),
+	        tolerant: get("tolerant"),
+	        quote: get("quote"),
+	        trailingComma: get("trailingComma"),
+	        arrayBracketSpacing: get("arrayBracketSpacing"),
+	        objectCurlySpacing: get("objectCurlySpacing"),
+	        arrowParensAlways: get("arrowParensAlways"),
+	        flowObjectCommas: get("flowObjectCommas"),
+	        tokens: !!get("tokens")
+	    };
+	}
+	exports.normalize = normalize;
+	});
+
+	unwrapExports(options);
+	var options_1 = options.normalize;
+
+	var mapping = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+
+	var Mapping = /** @class */ (function () {
+	    function Mapping(sourceLines, sourceLoc, targetLoc) {
+	        if (targetLoc === void 0) { targetLoc = sourceLoc; }
+	        this.sourceLines = sourceLines;
+	        this.sourceLoc = sourceLoc;
+	        this.targetLoc = targetLoc;
+	    }
+	    Mapping.prototype.slice = function (lines, start, end) {
+	        if (end === void 0) { end = lines.lastPos(); }
+	        var sourceLines = this.sourceLines;
+	        var sourceLoc = this.sourceLoc;
+	        var targetLoc = this.targetLoc;
+	        function skip(name) {
+	            var sourceFromPos = sourceLoc[name];
+	            var targetFromPos = targetLoc[name];
+	            var targetToPos = start;
+	            if (name === "end") {
+	                targetToPos = end;
+	            }
+	            else {
+	                assert_1.default.strictEqual(name, "start");
+	            }
+	            return skipChars(sourceLines, sourceFromPos, lines, targetFromPos, targetToPos);
+	        }
+	        if (util$1.comparePos(start, targetLoc.start) <= 0) {
+	            if (util$1.comparePos(targetLoc.end, end) <= 0) {
+	                targetLoc = {
+	                    start: subtractPos(targetLoc.start, start.line, start.column),
+	                    end: subtractPos(targetLoc.end, start.line, start.column)
+	                };
+	                // The sourceLoc can stay the same because the contents of the
+	                // targetLoc have not changed.
+	            }
+	            else if (util$1.comparePos(end, targetLoc.start) <= 0) {
+	                return null;
+	            }
+	            else {
+	                sourceLoc = {
+	                    start: sourceLoc.start,
+	                    end: skip("end")
+	                };
+	                targetLoc = {
+	                    start: subtractPos(targetLoc.start, start.line, start.column),
+	                    end: subtractPos(end, start.line, start.column)
+	                };
+	            }
+	        }
+	        else {
+	            if (util$1.comparePos(targetLoc.end, start) <= 0) {
+	                return null;
+	            }
+	            if (util$1.comparePos(targetLoc.end, end) <= 0) {
+	                sourceLoc = {
+	                    start: skip("start"),
+	                    end: sourceLoc.end
+	                };
+	                targetLoc = {
+	                    // Same as subtractPos(start, start.line, start.column):
+	                    start: { line: 1, column: 0 },
+	                    end: subtractPos(targetLoc.end, start.line, start.column)
+	                };
+	            }
+	            else {
+	                sourceLoc = {
+	                    start: skip("start"),
+	                    end: skip("end")
+	                };
+	                targetLoc = {
+	                    // Same as subtractPos(start, start.line, start.column):
+	                    start: { line: 1, column: 0 },
+	                    end: subtractPos(end, start.line, start.column)
+	                };
+	            }
+	        }
+	        return new Mapping(this.sourceLines, sourceLoc, targetLoc);
+	    };
+	    Mapping.prototype.add = function (line, column) {
+	        return new Mapping(this.sourceLines, this.sourceLoc, {
+	            start: addPos(this.targetLoc.start, line, column),
+	            end: addPos(this.targetLoc.end, line, column)
+	        });
+	    };
+	    Mapping.prototype.subtract = function (line, column) {
+	        return new Mapping(this.sourceLines, this.sourceLoc, {
+	            start: subtractPos(this.targetLoc.start, line, column),
+	            end: subtractPos(this.targetLoc.end, line, column)
+	        });
+	    };
+	    Mapping.prototype.indent = function (by, skipFirstLine, noNegativeColumns) {
+	        if (skipFirstLine === void 0) { skipFirstLine = false; }
+	        if (noNegativeColumns === void 0) { noNegativeColumns = false; }
+	        if (by === 0) {
+	            return this;
+	        }
+	        var targetLoc = this.targetLoc;
+	        var startLine = targetLoc.start.line;
+	        var endLine = targetLoc.end.line;
+	        if (skipFirstLine && startLine === 1 && endLine === 1) {
+	            return this;
+	        }
+	        targetLoc = {
+	            start: targetLoc.start,
+	            end: targetLoc.end
+	        };
+	        if (!skipFirstLine || startLine > 1) {
+	            var startColumn = targetLoc.start.column + by;
+	            targetLoc.start = {
+	                line: startLine,
+	                column: noNegativeColumns
+	                    ? Math.max(0, startColumn)
+	                    : startColumn
+	            };
+	        }
+	        if (!skipFirstLine || endLine > 1) {
+	            var endColumn = targetLoc.end.column + by;
+	            targetLoc.end = {
+	                line: endLine,
+	                column: noNegativeColumns
+	                    ? Math.max(0, endColumn)
+	                    : endColumn
+	            };
+	        }
+	        return new Mapping(this.sourceLines, this.sourceLoc, targetLoc);
+	    };
+	    return Mapping;
+	}());
+	exports.default = Mapping;
+	function addPos(toPos, line, column) {
+	    return {
+	        line: toPos.line + line - 1,
+	        column: (toPos.line === 1)
+	            ? toPos.column + column
+	            : toPos.column
+	    };
+	}
+	function subtractPos(fromPos, line, column) {
+	    return {
+	        line: fromPos.line - line + 1,
+	        column: (fromPos.line === line)
+	            ? fromPos.column - column
+	            : fromPos.column
+	    };
+	}
+	function skipChars(sourceLines, sourceFromPos, targetLines, targetFromPos, targetToPos) {
+	    var targetComparison = util$1.comparePos(targetFromPos, targetToPos);
+	    if (targetComparison === 0) {
+	        // Trivial case: no characters to skip.
+	        return sourceFromPos;
+	    }
+	    if (targetComparison < 0) {
+	        // Skipping forward.
+	        var sourceCursor = sourceLines.skipSpaces(sourceFromPos) || sourceLines.lastPos();
+	        var targetCursor = targetLines.skipSpaces(targetFromPos) || targetLines.lastPos();
+	        var lineDiff = targetToPos.line - targetCursor.line;
+	        sourceCursor.line += lineDiff;
+	        targetCursor.line += lineDiff;
+	        if (lineDiff > 0) {
+	            // If jumping to later lines, reset columns to the beginnings
+	            // of those lines.
+	            sourceCursor.column = 0;
+	            targetCursor.column = 0;
+	        }
+	        else {
+	            assert_1.default.strictEqual(lineDiff, 0);
+	        }
+	        while (util$1.comparePos(targetCursor, targetToPos) < 0 &&
+	            targetLines.nextPos(targetCursor, true)) {
+	            assert_1.default.ok(sourceLines.nextPos(sourceCursor, true));
+	            assert_1.default.strictEqual(sourceLines.charAt(sourceCursor), targetLines.charAt(targetCursor));
+	        }
+	    }
+	    else {
+	        // Skipping backward.
+	        var sourceCursor = sourceLines.skipSpaces(sourceFromPos, true) || sourceLines.firstPos();
+	        var targetCursor = targetLines.skipSpaces(targetFromPos, true) || targetLines.firstPos();
+	        var lineDiff = targetToPos.line - targetCursor.line;
+	        sourceCursor.line += lineDiff;
+	        targetCursor.line += lineDiff;
+	        if (lineDiff < 0) {
+	            // If jumping to earlier lines, reset columns to the ends of
+	            // those lines.
+	            sourceCursor.column = sourceLines.getLineLength(sourceCursor.line);
+	            targetCursor.column = targetLines.getLineLength(targetCursor.line);
+	        }
+	        else {
+	            assert_1.default.strictEqual(lineDiff, 0);
+	        }
+	        while (util$1.comparePos(targetToPos, targetCursor) < 0 &&
+	            targetLines.prevPos(targetCursor, true)) {
+	            assert_1.default.ok(sourceLines.prevPos(sourceCursor, true));
+	            assert_1.default.strictEqual(sourceLines.charAt(sourceCursor), targetLines.charAt(targetCursor));
+	        }
+	    }
+	    return sourceCursor;
+	}
+	});
+
+	unwrapExports(mapping);
+
+	var lines = createCommonjsModule(function (module, exports) {
+	var __assign = (this && this.__assign) || function () {
+	    __assign = Object.assign || function(t) {
+	        for (var s, i = 1, n = arguments.length; i < n; i++) {
+	            s = arguments[i];
+	            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+	                t[p] = s[p];
+	        }
+	        return t;
+	    };
+	    return __assign.apply(this, arguments);
+	};
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var source_map_1 = __importDefault(sourceMap);
+
+
+	var mapping_1 = __importDefault(mapping);
+	var Lines = /** @class */ (function () {
+	    function Lines(infos, sourceFileName) {
+	        if (sourceFileName === void 0) { sourceFileName = null; }
+	        this.infos = infos;
+	        this.mappings = [];
+	        this.cachedSourceMap = null;
+	        this.cachedTabWidth = void 0;
+	        assert_1.default.ok(infos.length > 0);
+	        this.length = infos.length;
+	        this.name = sourceFileName || null;
+	        if (this.name) {
+	            this.mappings.push(new mapping_1.default(this, {
+	                start: this.firstPos(),
+	                end: this.lastPos(),
+	            }));
+	        }
+	    }
+	    Lines.prototype.toString = function (options) {
+	        return this.sliceString(this.firstPos(), this.lastPos(), options);
+	    };
+	    Lines.prototype.getSourceMap = function (sourceMapName, sourceRoot) {
+	        if (!sourceMapName) {
+	            // Although we could make up a name or generate an anonymous
+	            // source map, instead we assume that any consumer who does not
+	            // provide a name does not actually want a source map.
+	            return null;
+	        }
+	        var targetLines = this;
+	        function updateJSON(json) {
+	            json = json || {};
+	            json.file = sourceMapName;
+	            if (sourceRoot) {
+	                json.sourceRoot = sourceRoot;
+	            }
+	            return json;
+	        }
+	        if (targetLines.cachedSourceMap) {
+	            // Since Lines objects are immutable, we can reuse any source map
+	            // that was previously generated. Nevertheless, we return a new
+	            // JSON object here to protect the cached source map from outside
+	            // modification.
+	            return updateJSON(targetLines.cachedSourceMap.toJSON());
+	        }
+	        var smg = new source_map_1.default.SourceMapGenerator(updateJSON());
+	        var sourcesToContents = {};
+	        targetLines.mappings.forEach(function (mapping) {
+	            var sourceCursor = mapping.sourceLines.skipSpaces(mapping.sourceLoc.start) || mapping.sourceLines.lastPos();
+	            var targetCursor = targetLines.skipSpaces(mapping.targetLoc.start) || targetLines.lastPos();
+	            while (util$1.comparePos(sourceCursor, mapping.sourceLoc.end) < 0 &&
+	                util$1.comparePos(targetCursor, mapping.targetLoc.end) < 0) {
+	                var sourceChar = mapping.sourceLines.charAt(sourceCursor);
+	                var targetChar = targetLines.charAt(targetCursor);
+	                assert_1.default.strictEqual(sourceChar, targetChar);
+	                var sourceName = mapping.sourceLines.name;
+	                // Add mappings one character at a time for maximum resolution.
+	                smg.addMapping({
+	                    source: sourceName,
+	                    original: { line: sourceCursor.line,
+	                        column: sourceCursor.column },
+	                    generated: { line: targetCursor.line,
+	                        column: targetCursor.column }
+	                });
+	                if (!hasOwn.call(sourcesToContents, sourceName)) {
+	                    var sourceContent = mapping.sourceLines.toString();
+	                    smg.setSourceContent(sourceName, sourceContent);
+	                    sourcesToContents[sourceName] = sourceContent;
+	                }
+	                targetLines.nextPos(targetCursor, true);
+	                mapping.sourceLines.nextPos(sourceCursor, true);
+	            }
+	        });
+	        targetLines.cachedSourceMap = smg;
+	        return smg.toJSON();
+	    };
+	    Lines.prototype.bootstrapCharAt = function (pos) {
+	        assert_1.default.strictEqual(typeof pos, "object");
+	        assert_1.default.strictEqual(typeof pos.line, "number");
+	        assert_1.default.strictEqual(typeof pos.column, "number");
+	        var line = pos.line, column = pos.column, strings = this.toString().split(lineTerminatorSeqExp), string = strings[line - 1];
+	        if (typeof string === "undefined")
+	            return "";
+	        if (column === string.length &&
+	            line < strings.length)
+	            return "\n";
+	        if (column >= string.length)
+	            return "";
+	        return string.charAt(column);
+	    };
+	    Lines.prototype.charAt = function (pos) {
+	        assert_1.default.strictEqual(typeof pos, "object");
+	        assert_1.default.strictEqual(typeof pos.line, "number");
+	        assert_1.default.strictEqual(typeof pos.column, "number");
+	        var line = pos.line, column = pos.column, secret = this, infos = secret.infos, info = infos[line - 1], c = column;
+	        if (typeof info === "undefined" || c < 0)
+	            return "";
+	        var indent = this.getIndentAt(line);
+	        if (c < indent)
+	            return " ";
+	        c += info.sliceStart - indent;
+	        if (c === info.sliceEnd &&
+	            line < this.length)
+	            return "\n";
+	        if (c >= info.sliceEnd)
+	            return "";
+	        return info.line.charAt(c);
+	    };
+	    Lines.prototype.stripMargin = function (width, skipFirstLine) {
+	        if (width === 0)
+	            return this;
+	        assert_1.default.ok(width > 0, "negative margin: " + width);
+	        if (skipFirstLine && this.length === 1)
+	            return this;
+	        var lines = new Lines(this.infos.map(function (info, i) {
+	            if (info.line && (i > 0 || !skipFirstLine)) {
+	                info = __assign({}, info, { indent: Math.max(0, info.indent - width) });
+	            }
+	            return info;
+	        }));
+	        if (this.mappings.length > 0) {
+	            var newMappings = lines.mappings;
+	            assert_1.default.strictEqual(newMappings.length, 0);
+	            this.mappings.forEach(function (mapping) {
+	                newMappings.push(mapping.indent(width, skipFirstLine, true));
+	            });
+	        }
+	        return lines;
+	    };
+	    Lines.prototype.indent = function (by) {
+	        if (by === 0) {
+	            return this;
+	        }
+	        var lines = new Lines(this.infos.map(function (info) {
+	            if (info.line && !info.locked) {
+	                info = __assign({}, info, { indent: info.indent + by });
+	            }
+	            return info;
+	        }));
+	        if (this.mappings.length > 0) {
+	            var newMappings = lines.mappings;
+	            assert_1.default.strictEqual(newMappings.length, 0);
+	            this.mappings.forEach(function (mapping) {
+	                newMappings.push(mapping.indent(by));
+	            });
+	        }
+	        return lines;
+	    };
+	    Lines.prototype.indentTail = function (by) {
+	        if (by === 0) {
+	            return this;
+	        }
+	        if (this.length < 2) {
+	            return this;
+	        }
+	        var lines = new Lines(this.infos.map(function (info, i) {
+	            if (i > 0 && info.line && !info.locked) {
+	                info = __assign({}, info, { indent: info.indent + by });
+	            }
+	            return info;
+	        }));
+	        if (this.mappings.length > 0) {
+	            var newMappings = lines.mappings;
+	            assert_1.default.strictEqual(newMappings.length, 0);
+	            this.mappings.forEach(function (mapping) {
+	                newMappings.push(mapping.indent(by, true));
+	            });
+	        }
+	        return lines;
+	    };
+	    Lines.prototype.lockIndentTail = function () {
+	        if (this.length < 2) {
+	            return this;
+	        }
+	        return new Lines(this.infos.map(function (info, i) {
+	            return __assign({}, info, { locked: i > 0 });
+	        }));
+	    };
+	    Lines.prototype.getIndentAt = function (line) {
+	        assert_1.default.ok(line >= 1, "no line " + line + " (line numbers start from 1)");
+	        return Math.max(this.infos[line - 1].indent, 0);
+	    };
+	    Lines.prototype.guessTabWidth = function () {
+	        if (typeof this.cachedTabWidth === "number") {
+	            return this.cachedTabWidth;
+	        }
+	        var counts = []; // Sparse array.
+	        var lastIndent = 0;
+	        for (var line = 1, last = this.length; line <= last; ++line) {
+	            var info = this.infos[line - 1];
+	            var sliced = info.line.slice(info.sliceStart, info.sliceEnd);
+	            // Whitespace-only lines don't tell us much about the likely tab
+	            // width of this code.
+	            if (isOnlyWhitespace(sliced)) {
+	                continue;
+	            }
+	            var diff = Math.abs(info.indent - lastIndent);
+	            counts[diff] = ~~counts[diff] + 1;
+	            lastIndent = info.indent;
+	        }
+	        var maxCount = -1;
+	        var result = 2;
+	        for (var tabWidth = 1; tabWidth < counts.length; tabWidth += 1) {
+	            if (hasOwn.call(counts, tabWidth) &&
+	                counts[tabWidth] > maxCount) {
+	                maxCount = counts[tabWidth];
+	                result = tabWidth;
+	            }
+	        }
+	        return this.cachedTabWidth = result;
+	    };
+	    // Determine if the list of lines has a first line that starts with a //
+	    // or /* comment. If this is the case, the code may need to be wrapped in
+	    // parens to avoid ASI issues.
+	    Lines.prototype.startsWithComment = function () {
+	        if (this.infos.length === 0) {
+	            return false;
+	        }
+	        var firstLineInfo = this.infos[0], sliceStart = firstLineInfo.sliceStart, sliceEnd = firstLineInfo.sliceEnd, firstLine = firstLineInfo.line.slice(sliceStart, sliceEnd).trim();
+	        return firstLine.length === 0 ||
+	            firstLine.slice(0, 2) === "//" ||
+	            firstLine.slice(0, 2) === "/*";
+	    };
+	    Lines.prototype.isOnlyWhitespace = function () {
+	        return isOnlyWhitespace(this.toString());
+	    };
+	    Lines.prototype.isPrecededOnlyByWhitespace = function (pos) {
+	        var info = this.infos[pos.line - 1];
+	        var indent = Math.max(info.indent, 0);
+	        var diff = pos.column - indent;
+	        if (diff <= 0) {
+	            // If pos.column does not exceed the indentation amount, then
+	            // there must be only whitespace before it.
+	            return true;
+	        }
+	        var start = info.sliceStart;
+	        var end = Math.min(start + diff, info.sliceEnd);
+	        var prefix = info.line.slice(start, end);
+	        return isOnlyWhitespace(prefix);
+	    };
+	    Lines.prototype.getLineLength = function (line) {
+	        var info = this.infos[line - 1];
+	        return this.getIndentAt(line) + info.sliceEnd - info.sliceStart;
+	    };
+	    Lines.prototype.nextPos = function (pos, skipSpaces) {
+	        if (skipSpaces === void 0) { skipSpaces = false; }
+	        var l = Math.max(pos.line, 0), c = Math.max(pos.column, 0);
+	        if (c < this.getLineLength(l)) {
+	            pos.column += 1;
+	            return skipSpaces
+	                ? !!this.skipSpaces(pos, false, true)
+	                : true;
+	        }
+	        if (l < this.length) {
+	            pos.line += 1;
+	            pos.column = 0;
+	            return skipSpaces
+	                ? !!this.skipSpaces(pos, false, true)
+	                : true;
+	        }
+	        return false;
+	    };
+	    Lines.prototype.prevPos = function (pos, skipSpaces) {
+	        if (skipSpaces === void 0) { skipSpaces = false; }
+	        var l = pos.line, c = pos.column;
+	        if (c < 1) {
+	            l -= 1;
+	            if (l < 1)
+	                return false;
+	            c = this.getLineLength(l);
+	        }
+	        else {
+	            c = Math.min(c - 1, this.getLineLength(l));
+	        }
+	        pos.line = l;
+	        pos.column = c;
+	        return skipSpaces
+	            ? !!this.skipSpaces(pos, true, true)
+	            : true;
+	    };
+	    Lines.prototype.firstPos = function () {
+	        // Trivial, but provided for completeness.
+	        return { line: 1, column: 0 };
+	    };
+	    Lines.prototype.lastPos = function () {
+	        return {
+	            line: this.length,
+	            column: this.getLineLength(this.length)
+	        };
+	    };
+	    Lines.prototype.skipSpaces = function (pos, backward, modifyInPlace) {
+	        if (backward === void 0) { backward = false; }
+	        if (modifyInPlace === void 0) { modifyInPlace = false; }
+	        if (pos) {
+	            pos = modifyInPlace ? pos : {
+	                line: pos.line,
+	                column: pos.column
+	            };
+	        }
+	        else if (backward) {
+	            pos = this.lastPos();
+	        }
+	        else {
+	            pos = this.firstPos();
+	        }
+	        if (backward) {
+	            while (this.prevPos(pos)) {
+	                if (!isOnlyWhitespace(this.charAt(pos)) &&
+	                    this.nextPos(pos)) {
+	                    return pos;
+	                }
+	            }
+	            return null;
+	        }
+	        else {
+	            while (isOnlyWhitespace(this.charAt(pos))) {
+	                if (!this.nextPos(pos)) {
+	                    return null;
+	                }
+	            }
+	            return pos;
+	        }
+	    };
+	    Lines.prototype.trimLeft = function () {
+	        var pos = this.skipSpaces(this.firstPos(), false, true);
+	        return pos ? this.slice(pos) : emptyLines;
+	    };
+	    Lines.prototype.trimRight = function () {
+	        var pos = this.skipSpaces(this.lastPos(), true, true);
+	        return pos ? this.slice(this.firstPos(), pos) : emptyLines;
+	    };
+	    Lines.prototype.trim = function () {
+	        var start = this.skipSpaces(this.firstPos(), false, true);
+	        if (start === null) {
+	            return emptyLines;
+	        }
+	        var end = this.skipSpaces(this.lastPos(), true, true);
+	        if (end === null) {
+	            return emptyLines;
+	        }
+	        return this.slice(start, end);
+	    };
+	    Lines.prototype.eachPos = function (callback, startPos, skipSpaces) {
+	        if (startPos === void 0) { startPos = this.firstPos(); }
+	        if (skipSpaces === void 0) { skipSpaces = false; }
+	        var pos = this.firstPos();
+	        if (startPos) {
+	            pos.line = startPos.line,
+	                pos.column = startPos.column;
+	        }
+	        if (skipSpaces && !this.skipSpaces(pos, false, true)) {
+	            return; // Encountered nothing but spaces.
+	        }
+	        do
+	            callback.call(this, pos);
+	        while (this.nextPos(pos, skipSpaces));
+	    };
+	    Lines.prototype.bootstrapSlice = function (start, end) {
+	        var strings = this.toString().split(lineTerminatorSeqExp).slice(start.line - 1, end.line);
+	        if (strings.length > 0) {
+	            strings.push(strings.pop().slice(0, end.column));
+	            strings[0] = strings[0].slice(start.column);
+	        }
+	        return fromString(strings.join("\n"));
+	    };
+	    Lines.prototype.slice = function (start, end) {
+	        if (!end) {
+	            if (!start) {
+	                // The client seems to want a copy of this Lines object, but
+	                // Lines objects are immutable, so it's perfectly adequate to
+	                // return the same object.
+	                return this;
+	            }
+	            // Slice to the end if no end position was provided.
+	            end = this.lastPos();
+	        }
+	        if (!start) {
+	            throw new Error("cannot slice with end but not start");
+	        }
+	        var sliced = this.infos.slice(start.line - 1, end.line);
+	        if (start.line === end.line) {
+	            sliced[0] = sliceInfo(sliced[0], start.column, end.column);
+	        }
+	        else {
+	            assert_1.default.ok(start.line < end.line);
+	            sliced[0] = sliceInfo(sliced[0], start.column);
+	            sliced.push(sliceInfo(sliced.pop(), 0, end.column));
+	        }
+	        var lines = new Lines(sliced);
+	        if (this.mappings.length > 0) {
+	            var newMappings = lines.mappings;
+	            assert_1.default.strictEqual(newMappings.length, 0);
+	            this.mappings.forEach(function (mapping) {
+	                var sliced = mapping.slice(this, start, end);
+	                if (sliced) {
+	                    newMappings.push(sliced);
+	                }
+	            }, this);
+	        }
+	        return lines;
+	    };
+	    Lines.prototype.bootstrapSliceString = function (start, end, options) {
+	        return this.slice(start, end).toString(options);
+	    };
+	    Lines.prototype.sliceString = function (start, end, options$1) {
+	        if (start === void 0) { start = this.firstPos(); }
+	        if (end === void 0) { end = this.lastPos(); }
+	        options$1 = options.normalize(options$1);
+	        var parts = [];
+	        var _a = options$1.tabWidth, tabWidth = _a === void 0 ? 2 : _a;
+	        for (var line = start.line; line <= end.line; ++line) {
+	            var info = this.infos[line - 1];
+	            if (line === start.line) {
+	                if (line === end.line) {
+	                    info = sliceInfo(info, start.column, end.column);
+	                }
+	                else {
+	                    info = sliceInfo(info, start.column);
+	                }
+	            }
+	            else if (line === end.line) {
+	                info = sliceInfo(info, 0, end.column);
+	            }
+	            var indent = Math.max(info.indent, 0);
+	            var before = info.line.slice(0, info.sliceStart);
+	            if (options$1.reuseWhitespace &&
+	                isOnlyWhitespace(before) &&
+	                countSpaces(before, options$1.tabWidth) === indent) {
+	                // Reuse original spaces if the indentation is correct.
+	                parts.push(info.line.slice(0, info.sliceEnd));
+	                continue;
+	            }
+	            var tabs = 0;
+	            var spaces = indent;
+	            if (options$1.useTabs) {
+	                tabs = Math.floor(indent / tabWidth);
+	                spaces -= tabs * tabWidth;
+	            }
+	            var result = "";
+	            if (tabs > 0) {
+	                result += new Array(tabs + 1).join("\t");
+	            }
+	            if (spaces > 0) {
+	                result += new Array(spaces + 1).join(" ");
+	            }
+	            result += info.line.slice(info.sliceStart, info.sliceEnd);
+	            parts.push(result);
+	        }
+	        return parts.join(options$1.lineTerminator);
+	    };
+	    Lines.prototype.isEmpty = function () {
+	        return this.length < 2 && this.getLineLength(1) < 1;
+	    };
+	    Lines.prototype.join = function (elements) {
+	        var separator = this;
+	        var infos = [];
+	        var mappings = [];
+	        var prevInfo;
+	        function appendLines(linesOrNull) {
+	            if (linesOrNull === null) {
+	                return;
+	            }
+	            if (prevInfo) {
+	                var info = linesOrNull.infos[0];
+	                var indent = new Array(info.indent + 1).join(" ");
+	                var prevLine = infos.length;
+	                var prevColumn = Math.max(prevInfo.indent, 0) +
+	                    prevInfo.sliceEnd - prevInfo.sliceStart;
+	                prevInfo.line = prevInfo.line.slice(0, prevInfo.sliceEnd) + indent + info.line.slice(info.sliceStart, info.sliceEnd);
+	                // If any part of a line is indentation-locked, the whole line
+	                // will be indentation-locked.
+	                prevInfo.locked = prevInfo.locked || info.locked;
+	                prevInfo.sliceEnd = prevInfo.line.length;
+	                if (linesOrNull.mappings.length > 0) {
+	                    linesOrNull.mappings.forEach(function (mapping) {
+	                        mappings.push(mapping.add(prevLine, prevColumn));
+	                    });
+	                }
+	            }
+	            else if (linesOrNull.mappings.length > 0) {
+	                mappings.push.apply(mappings, linesOrNull.mappings);
+	            }
+	            linesOrNull.infos.forEach(function (info, i) {
+	                if (!prevInfo || i > 0) {
+	                    prevInfo = __assign({}, info);
+	                    infos.push(prevInfo);
+	                }
+	            });
+	        }
+	        function appendWithSeparator(linesOrNull, i) {
+	            if (i > 0)
+	                appendLines(separator);
+	            appendLines(linesOrNull);
+	        }
+	        elements.map(function (elem) {
+	            var lines = fromString(elem);
+	            if (lines.isEmpty())
+	                return null;
+	            return lines;
+	        }).forEach(function (linesOrNull, i) {
+	            if (separator.isEmpty()) {
+	                appendLines(linesOrNull);
+	            }
+	            else {
+	                appendWithSeparator(linesOrNull, i);
+	            }
+	        });
+	        if (infos.length < 1)
+	            return emptyLines;
+	        var lines = new Lines(infos);
+	        lines.mappings = mappings;
+	        return lines;
+	    };
+	    Lines.prototype.concat = function () {
+	        var args = [];
+	        for (var _i = 0; _i < arguments.length; _i++) {
+	            args[_i] = arguments[_i];
+	        }
+	        var list = [this];
+	        list.push.apply(list, args);
+	        assert_1.default.strictEqual(list.length, args.length + 1);
+	        return emptyLines.join(list);
+	    };
+	    return Lines;
+	}());
+	exports.Lines = Lines;
+	var fromStringCache = {};
+	var hasOwn = fromStringCache.hasOwnProperty;
+	var maxCacheKeyLen = 10;
+	function countSpaces(spaces, tabWidth) {
+	    var count = 0;
+	    var len = spaces.length;
+	    for (var i = 0; i < len; ++i) {
+	        switch (spaces.charCodeAt(i)) {
+	            case 9: // '\t'
+	                assert_1.default.strictEqual(typeof tabWidth, "number");
+	                assert_1.default.ok(tabWidth > 0);
+	                var next = Math.ceil(count / tabWidth) * tabWidth;
+	                if (next === count) {
+	                    count += tabWidth;
+	                }
+	                else {
+	                    count = next;
+	                }
+	                break;
+	            case 11: // '\v'
+	            case 12: // '\f'
+	            case 13: // '\r'
+	            case 0xfeff: // zero-width non-breaking space
+	                // These characters contribute nothing to indentation.
+	                break;
+	            case 32: // ' '
+	            default: // Treat all other whitespace like ' '.
+	                count += 1;
+	                break;
+	        }
+	    }
+	    return count;
+	}
+	exports.countSpaces = countSpaces;
+	var leadingSpaceExp = /^\s*/;
+	// As specified here: http://www.ecma-international.org/ecma-262/6.0/#sec-line-terminators
+	var lineTerminatorSeqExp = /\u000D\u000A|\u000D(?!\u000A)|\u000A|\u2028|\u2029/;
+	/**
+	 * @param {Object} options - Options object that configures printing.
+	 */
+	function fromString(string, options$1) {
+	    if (string instanceof Lines)
+	        return string;
+	    string += "";
+	    var tabWidth = options$1 && options$1.tabWidth;
+	    var tabless = string.indexOf("\t") < 0;
+	    var cacheable = !options$1 && tabless && (string.length <= maxCacheKeyLen);
+	    assert_1.default.ok(tabWidth || tabless, "No tab width specified but encountered tabs in string\n" + string);
+	    if (cacheable && hasOwn.call(fromStringCache, string))
+	        return fromStringCache[string];
+	    var lines = new Lines(string.split(lineTerminatorSeqExp).map(function (line) {
+	        // TODO: handle null exec result
+	        var spaces = leadingSpaceExp.exec(line)[0];
+	        return {
+	            line: line,
+	            indent: countSpaces(spaces, tabWidth),
+	            // Boolean indicating whether this line can be reindented.
+	            locked: false,
+	            sliceStart: spaces.length,
+	            sliceEnd: line.length
+	        };
+	    }), options.normalize(options$1).sourceFileName);
+	    if (cacheable)
+	        fromStringCache[string] = lines;
+	    return lines;
+	}
+	exports.fromString = fromString;
+	function isOnlyWhitespace(string) {
+	    return !/\S/.test(string);
+	}
+	function sliceInfo(info, startCol, endCol) {
+	    var sliceStart = info.sliceStart;
+	    var sliceEnd = info.sliceEnd;
+	    var indent = Math.max(info.indent, 0);
+	    var lineLength = indent + sliceEnd - sliceStart;
+	    if (typeof endCol === "undefined") {
+	        endCol = lineLength;
+	    }
+	    startCol = Math.max(startCol, 0);
+	    endCol = Math.min(endCol, lineLength);
+	    endCol = Math.max(endCol, startCol);
+	    if (endCol < indent) {
+	        indent = endCol;
+	        sliceEnd = sliceStart;
+	    }
+	    else {
+	        sliceEnd -= lineLength - endCol;
+	    }
+	    lineLength = endCol;
+	    lineLength -= startCol;
+	    if (startCol < indent) {
+	        indent -= startCol;
+	    }
+	    else {
+	        startCol -= indent;
+	        indent = 0;
+	        sliceStart += startCol;
+	    }
+	    assert_1.default.ok(indent >= 0);
+	    assert_1.default.ok(sliceStart <= sliceEnd);
+	    assert_1.default.strictEqual(lineLength, indent + sliceEnd - sliceStart);
+	    if (info.indent === indent &&
+	        info.sliceStart === sliceStart &&
+	        info.sliceEnd === sliceEnd) {
+	        return info;
+	    }
+	    return {
+	        line: info.line,
+	        indent: indent,
+	        // A destructive slice always unlocks indentation.
+	        locked: false,
+	        sliceStart: sliceStart,
+	        sliceEnd: sliceEnd
+	    };
+	}
+	function concat(elements) {
+	    return emptyLines.join(elements);
+	}
+	exports.concat = concat;
+	// The emptyLines object needs to be created all the way down here so that
+	// Lines.prototype will be fully populated.
+	var emptyLines = fromString("");
+	});
+
+	unwrapExports(lines);
+	var lines_1 = lines.Lines;
+	var lines_2 = lines.countSpaces;
+	var lines_3 = lines.fromString;
+	var lines_4 = lines.concat;
+
+	var originalObject = Object;
+	var originalDefProp = Object.defineProperty;
+	var originalCreate = Object.create;
+
+	function defProp(obj, name, value) {
+	  if (originalDefProp) try {
+	    originalDefProp.call(originalObject, obj, name, { value: value });
+	  } catch (definePropertyIsBrokenInIE8) {
+	    obj[name] = value;
+	  } else {
+	    obj[name] = value;
+	  }
+	}
+
+	// For functions that will be invoked using .call or .apply, we need to
+	// define those methods on the function objects themselves, rather than
+	// inheriting them from Function.prototype, so that a malicious or clumsy
+	// third party cannot interfere with the functionality of this module by
+	// redefining Function.prototype.call or .apply.
+	function makeSafeToCall(fun) {
+	  if (fun) {
+	    defProp(fun, "call", fun.call);
+	    defProp(fun, "apply", fun.apply);
+	  }
+	  return fun;
+	}
+
+	makeSafeToCall(originalDefProp);
+	makeSafeToCall(originalCreate);
+
+	var hasOwn$1 = makeSafeToCall(Object.prototype.hasOwnProperty);
+	var numToStr = makeSafeToCall(Number.prototype.toString);
+	var strSlice = makeSafeToCall(String.prototype.slice);
+
+	var cloner = function(){};
+	function create(prototype) {
+	  if (originalCreate) {
+	    return originalCreate.call(originalObject, prototype);
+	  }
+	  cloner.prototype = prototype || null;
+	  return new cloner;
+	}
+
+	var rand = Math.random;
+	var uniqueKeys = create(null);
+
+	function makeUniqueKey() {
+	  // Collisions are highly unlikely, but this module is in the business of
+	  // making guarantees rather than safe bets.
+	  do var uniqueKey = internString(strSlice.call(numToStr.call(rand(), 36), 2));
+	  while (hasOwn$1.call(uniqueKeys, uniqueKey));
+	  return uniqueKeys[uniqueKey] = uniqueKey;
+	}
+
+	function internString(str) {
+	  var obj = {};
+	  obj[str] = true;
+	  return Object.keys(obj)[0];
+	}
+
+	// External users might find this function useful, but it is not necessary
+	// for the typical use of this module.
+	var makeUniqueKey_1 = makeUniqueKey;
+
+	// Object.getOwnPropertyNames is the only way to enumerate non-enumerable
+	// properties, so if we wrap it to ignore our secret keys, there should be
+	// no way (except guessing) to access those properties.
+	var originalGetOPNs = Object.getOwnPropertyNames;
+	Object.getOwnPropertyNames = function getOwnPropertyNames(object) {
+	  for (var names = originalGetOPNs(object),
+	           src = 0,
+	           dst = 0,
+	           len = names.length;
+	       src < len;
+	       ++src) {
+	    if (!hasOwn$1.call(uniqueKeys, names[src])) {
+	      if (src > dst) {
+	        names[dst] = names[src];
+	      }
+	      ++dst;
+	    }
+	  }
+	  names.length = dst;
+	  return names;
+	};
+
+	function defaultCreatorFn(object) {
+	  return create(null);
+	}
+
+	function makeAccessor(secretCreatorFn) {
+	  var brand = makeUniqueKey();
+	  var passkey = create(null);
+
+	  secretCreatorFn = secretCreatorFn || defaultCreatorFn;
+
+	  function register(object) {
+	    var secret; // Created lazily.
+
+	    function vault(key, forget) {
+	      // Only code that has access to the passkey can retrieve (or forget)
+	      // the secret object.
+	      if (key === passkey) {
+	        return forget
+	          ? secret = null
+	          : secret || (secret = secretCreatorFn(object));
+	      }
+	    }
+
+	    defProp(object, brand, vault);
+	  }
+
+	  function accessor(object) {
+	    if (!hasOwn$1.call(object, brand))
+	      register(object);
+	    return object[brand](passkey);
+	  }
+
+	  accessor.forget = function(object) {
+	    if (hasOwn$1.call(object, brand))
+	      object[brand](passkey, true);
+	  };
+
+	  return accessor;
+	}
+
+	var makeAccessor_1 = makeAccessor;
+
+	var _private = {
+		makeUniqueKey: makeUniqueKey_1,
+		makeAccessor: makeAccessor_1
+	};
+
+	var comments = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var types = __importStar(main);
+	var n = types.namedTypes;
+	var isArray = types.builtInTypes.array;
+	var isObject = types.builtInTypes.object;
+
+
+
+	var childNodesCacheKey = _private.makeUniqueKey();
+	// TODO Move a non-caching implementation of this function into ast-types,
+	// and implement a caching wrapper function here.
+	function getSortedChildNodes(node, lines, resultArray) {
+	    if (!node) {
+	        return;
+	    }
+	    // The .loc checks below are sensitive to some of the problems that
+	    // are fixed by this utility function. Specifically, if it decides to
+	    // set node.loc to null, indicating that the node's .loc information
+	    // is unreliable, then we don't want to add node to the resultArray.
+	    util$1.fixFaultyLocations(node, lines);
+	    if (resultArray) {
+	        if (n.Node.check(node) &&
+	            n.SourceLocation.check(node.loc)) {
+	            // This reverse insertion sort almost always takes constant
+	            // time because we almost always (maybe always?) append the
+	            // nodes in order anyway.
+	            for (var i = resultArray.length - 1; i >= 0; --i) {
+	                if (util$1.comparePos(resultArray[i].loc.end, node.loc.start) <= 0) {
+	                    break;
+	                }
+	            }
+	            resultArray.splice(i + 1, 0, node);
+	            return;
+	        }
+	    }
+	    else if (node[childNodesCacheKey]) {
+	        return node[childNodesCacheKey];
+	    }
+	    var names;
+	    if (isArray.check(node)) {
+	        names = Object.keys(node);
+	    }
+	    else if (isObject.check(node)) {
+	        names = types.getFieldNames(node);
+	    }
+	    else {
+	        return;
+	    }
+	    if (!resultArray) {
+	        Object.defineProperty(node, childNodesCacheKey, {
+	            value: resultArray = [],
+	            enumerable: false
+	        });
+	    }
+	    for (var i = 0, nameCount = names.length; i < nameCount; ++i) {
+	        getSortedChildNodes(node[names[i]], lines, resultArray);
+	    }
+	    return resultArray;
+	}
+	// As efficiently as possible, decorate the comment object with
+	// .precedingNode, .enclosingNode, and/or .followingNode properties, at
+	// least one of which is guaranteed to be defined.
+	function decorateComment(node, comment, lines) {
+	    var childNodes = getSortedChildNodes(node, lines);
+	    // Time to dust off the old binary search robes and wizard hat.
+	    var left = 0, right = childNodes.length;
+	    while (left < right) {
+	        var middle = (left + right) >> 1;
+	        var child = childNodes[middle];
+	        if (util$1.comparePos(child.loc.start, comment.loc.start) <= 0 &&
+	            util$1.comparePos(comment.loc.end, child.loc.end) <= 0) {
+	            // The comment is completely contained by this child node.
+	            decorateComment(comment.enclosingNode = child, comment, lines);
+	            return; // Abandon the binary search at this level.
+	        }
+	        if (util$1.comparePos(child.loc.end, comment.loc.start) <= 0) {
+	            // This child node falls completely before the comment.
+	            // Because we will never consider this node or any nodes
+	            // before it again, this node must be the closest preceding
+	            // node we have encountered so far.
+	            var precedingNode = child;
+	            left = middle + 1;
+	            continue;
+	        }
+	        if (util$1.comparePos(comment.loc.end, child.loc.start) <= 0) {
+	            // This child node falls completely after the comment.
+	            // Because we will never consider this node or any nodes after
+	            // it again, this node must be the closest following node we
+	            // have encountered so far.
+	            var followingNode = child;
+	            right = middle;
+	            continue;
+	        }
+	        throw new Error("Comment location overlaps with node location");
+	    }
+	    if (precedingNode) {
+	        comment.precedingNode = precedingNode;
+	    }
+	    if (followingNode) {
+	        comment.followingNode = followingNode;
+	    }
+	}
+	function attach(comments, ast, lines) {
+	    if (!isArray.check(comments)) {
+	        return;
+	    }
+	    var tiesToBreak = [];
+	    comments.forEach(function (comment) {
+	        comment.loc.lines = lines;
+	        decorateComment(ast, comment, lines);
+	        var pn = comment.precedingNode;
+	        var en = comment.enclosingNode;
+	        var fn = comment.followingNode;
+	        if (pn && fn) {
+	            var tieCount = tiesToBreak.length;
+	            if (tieCount > 0) {
+	                var lastTie = tiesToBreak[tieCount - 1];
+	                assert_1.default.strictEqual(lastTie.precedingNode === comment.precedingNode, lastTie.followingNode === comment.followingNode);
+	                if (lastTie.followingNode !== comment.followingNode) {
+	                    breakTies(tiesToBreak, lines);
+	                }
+	            }
+	            tiesToBreak.push(comment);
+	        }
+	        else if (pn) {
+	            // No contest: we have a trailing comment.
+	            breakTies(tiesToBreak, lines);
+	            addTrailingComment(pn, comment);
+	        }
+	        else if (fn) {
+	            // No contest: we have a leading comment.
+	            breakTies(tiesToBreak, lines);
+	            addLeadingComment(fn, comment);
+	        }
+	        else if (en) {
+	            // The enclosing node has no child nodes at all, so what we
+	            // have here is a dangling comment, e.g. [/* crickets */].
+	            breakTies(tiesToBreak, lines);
+	            addDanglingComment(en, comment);
+	        }
+	        else {
+	            throw new Error("AST contains no nodes at all?");
+	        }
+	    });
+	    breakTies(tiesToBreak, lines);
+	    comments.forEach(function (comment) {
+	        // These node references were useful for breaking ties, but we
+	        // don't need them anymore, and they create cycles in the AST that
+	        // may lead to infinite recursion if we don't delete them here.
+	        delete comment.precedingNode;
+	        delete comment.enclosingNode;
+	        delete comment.followingNode;
+	    });
+	}
+	exports.attach = attach;
+	function breakTies(tiesToBreak, lines) {
+	    var tieCount = tiesToBreak.length;
+	    if (tieCount === 0) {
+	        return;
+	    }
+	    var pn = tiesToBreak[0].precedingNode;
+	    var fn = tiesToBreak[0].followingNode;
+	    var gapEndPos = fn.loc.start;
+	    // Iterate backwards through tiesToBreak, examining the gaps
+	    // between the tied comments. In order to qualify as leading, a
+	    // comment must be separated from fn by an unbroken series of
+	    // whitespace-only gaps (or other comments).
+	    for (var indexOfFirstLeadingComment = tieCount; indexOfFirstLeadingComment > 0; --indexOfFirstLeadingComment) {
+	        var comment = tiesToBreak[indexOfFirstLeadingComment - 1];
+	        assert_1.default.strictEqual(comment.precedingNode, pn);
+	        assert_1.default.strictEqual(comment.followingNode, fn);
+	        var gap = lines.sliceString(comment.loc.end, gapEndPos);
+	        if (/\S/.test(gap)) {
+	            // The gap string contained something other than whitespace.
+	            break;
+	        }
+	        gapEndPos = comment.loc.start;
+	    }
+	    while (indexOfFirstLeadingComment <= tieCount &&
+	        (comment = tiesToBreak[indexOfFirstLeadingComment]) &&
+	        // If the comment is a //-style comment and indented more
+	        // deeply than the node itself, reconsider it as trailing.
+	        (comment.type === "Line" || comment.type === "CommentLine") &&
+	        comment.loc.start.column > fn.loc.start.column) {
+	        ++indexOfFirstLeadingComment;
+	    }
+	    tiesToBreak.forEach(function (comment, i) {
+	        if (i < indexOfFirstLeadingComment) {
+	            addTrailingComment(pn, comment);
+	        }
+	        else {
+	            addLeadingComment(fn, comment);
+	        }
+	    });
+	    tiesToBreak.length = 0;
+	}
+	function addCommentHelper(node, comment) {
+	    var comments = node.comments || (node.comments = []);
+	    comments.push(comment);
+	}
+	function addLeadingComment(node, comment) {
+	    comment.leading = true;
+	    comment.trailing = false;
+	    addCommentHelper(node, comment);
+	}
+	function addDanglingComment(node, comment) {
+	    comment.leading = false;
+	    comment.trailing = false;
+	    addCommentHelper(node, comment);
+	}
+	function addTrailingComment(node, comment) {
+	    comment.leading = false;
+	    comment.trailing = true;
+	    addCommentHelper(node, comment);
+	}
+	function printLeadingComment(commentPath, print) {
+	    var comment = commentPath.getValue();
+	    n.Comment.assert(comment);
+	    var loc = comment.loc;
+	    var lines$1 = loc && loc.lines;
+	    var parts = [print(commentPath)];
+	    if (comment.trailing) {
+	        // When we print trailing comments as leading comments, we don't
+	        // want to bring any trailing spaces along.
+	        parts.push("\n");
+	    }
+	    else if (lines$1 instanceof lines.Lines) {
+	        var trailingSpace = lines$1.slice(loc.end, lines$1.skipSpaces(loc.end) || lines$1.lastPos());
+	        if (trailingSpace.length === 1) {
+	            // If the trailing space contains no newlines, then we want to
+	            // preserve it exactly as we found it.
+	            parts.push(trailingSpace);
+	        }
+	        else {
+	            // If the trailing space contains newlines, then replace it
+	            // with just that many newlines, with all other spaces removed.
+	            parts.push(new Array(trailingSpace.length).join("\n"));
+	        }
+	    }
+	    else {
+	        parts.push("\n");
+	    }
+	    return lines.concat(parts);
+	}
+	function printTrailingComment(commentPath, print) {
+	    var comment = commentPath.getValue(commentPath);
+	    n.Comment.assert(comment);
+	    var loc = comment.loc;
+	    var lines$1 = loc && loc.lines;
+	    var parts = [];
+	    if (lines$1 instanceof lines.Lines) {
+	        var fromPos = lines$1.skipSpaces(loc.start, true) || lines$1.firstPos();
+	        var leadingSpace = lines$1.slice(fromPos, loc.start);
+	        if (leadingSpace.length === 1) {
+	            // If the leading space contains no newlines, then we want to
+	            // preserve it exactly as we found it.
+	            parts.push(leadingSpace);
+	        }
+	        else {
+	            // If the leading space contains newlines, then replace it
+	            // with just that many newlines, sans all other spaces.
+	            parts.push(new Array(leadingSpace.length).join("\n"));
+	        }
+	    }
+	    parts.push(print(commentPath));
+	    return lines.concat(parts);
+	}
+	function printComments(path, print) {
+	    var value = path.getValue();
+	    var innerLines = print(path);
+	    var comments = n.Node.check(value) &&
+	        types.getFieldValue(value, "comments");
+	    if (!comments || comments.length === 0) {
+	        return innerLines;
+	    }
+	    var leadingParts = [];
+	    var trailingParts = [innerLines];
+	    path.each(function (commentPath) {
+	        var comment = commentPath.getValue();
+	        var leading = types.getFieldValue(comment, "leading");
+	        var trailing = types.getFieldValue(comment, "trailing");
+	        if (leading || (trailing && !(n.Statement.check(value) ||
+	            comment.type === "Block" ||
+	            comment.type === "CommentBlock"))) {
+	            leadingParts.push(printLeadingComment(commentPath, print));
+	        }
+	        else if (trailing) {
+	            trailingParts.push(printTrailingComment(commentPath, print));
+	        }
+	    }, "comments");
+	    leadingParts.push.apply(leadingParts, trailingParts);
+	    return lines.concat(leadingParts);
+	}
+	exports.printComments = printComments;
+	});
+
+	unwrapExports(comments);
+	var comments_1 = comments.attach;
+	var comments_2 = comments.printComments;
+
+	var parser = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var types = __importStar(main);
+	var b = types.builders;
+	var isObject = types.builtInTypes.object;
+	var isArray = types.builtInTypes.array;
+
+
+
+	var util = __importStar(util$1);
+	function parse(source, options$1) {
+	    options$1 = options.normalize(options$1);
+	    var lines$1 = lines.fromString(source, options$1);
+	    var sourceWithoutTabs = lines$1.toString({
+	        tabWidth: options$1.tabWidth,
+	        reuseWhitespace: false,
+	        useTabs: false
+	    });
+	    var comments$1 = [];
+	    var ast = options$1.parser.parse(sourceWithoutTabs, {
+	        jsx: true,
+	        loc: true,
+	        locations: true,
+	        range: options$1.range,
+	        comment: true,
+	        onComment: comments$1,
+	        tolerant: util.getOption(options$1, "tolerant", true),
+	        ecmaVersion: 6,
+	        sourceType: util.getOption(options$1, "sourceType", "module")
+	    });
+	    // Use ast.tokens if possible, and otherwise fall back to the Esprima
+	    // tokenizer. All the preconfigured ../parsers/* expose ast.tokens
+	    // automatically, but custom parsers might need additional configuration
+	    // to avoid this fallback.
+	    var tokens = Array.isArray(ast.tokens)
+	        ? ast.tokens
+	        : esprima$1.tokenize(sourceWithoutTabs, {
+	            loc: true
+	        });
+	    // We will reattach the tokens array to the file object below.
+	    delete ast.tokens;
+	    // Make sure every token has a token.value string.
+	    tokens.forEach(function (token) {
+	        if (typeof token.value !== "string") {
+	            token.value = lines$1.sliceString(token.loc.start, token.loc.end);
+	        }
+	    });
+	    if (Array.isArray(ast.comments)) {
+	        comments$1 = ast.comments;
+	        delete ast.comments;
+	    }
+	    if (ast.loc) {
+	        // If the source was empty, some parsers give loc.{start,end}.line
+	        // values of 0, instead of the minimum of 1.
+	        util.fixFaultyLocations(ast, lines$1);
+	    }
+	    else {
+	        ast.loc = {
+	            start: lines$1.firstPos(),
+	            end: lines$1.lastPos()
+	        };
+	    }
+	    ast.loc.lines = lines$1;
+	    ast.loc.indent = 0;
+	    var file;
+	    var program;
+	    if (ast.type === "Program") {
+	        program = ast;
+	        // In order to ensure we reprint leading and trailing program
+	        // comments, wrap the original Program node with a File node. Only
+	        // ESTree parsers (Acorn and Esprima) return a Program as the root AST
+	        // node. Most other (Babylon-like) parsers return a File.
+	        file = b.file(ast, options$1.sourceFileName || null);
+	        file.loc = {
+	            start: lines$1.firstPos(),
+	            end: lines$1.lastPos(),
+	            lines: lines$1,
+	            indent: 0
+	        };
+	    }
+	    else if (ast.type === "File") {
+	        file = ast;
+	        program = file.program;
+	    }
+	    // Expose file.tokens unless the caller passed false for options.tokens.
+	    if (options$1.tokens) {
+	        file.tokens = tokens;
+	    }
+	    // Expand the Program's .loc to include all comments (not just those
+	    // attached to the Program node, as its children may have comments as
+	    // well), since sometimes program.loc.{start,end} will coincide with the
+	    // .loc.{start,end} of the first and last *statements*, mistakenly
+	    // excluding comments that fall outside that region.
+	    var trueProgramLoc = util.getTrueLoc({
+	        type: program.type,
+	        loc: program.loc,
+	        body: [],
+	        comments: comments$1
+	    }, lines$1);
+	    program.loc.start = trueProgramLoc.start;
+	    program.loc.end = trueProgramLoc.end;
+	    // Passing file.program here instead of just file means that initial
+	    // comments will be attached to program.body[0] instead of program.
+	    comments.attach(comments$1, program.body.length ? file.program : file, lines$1);
+	    // Return a copy of the original AST so that any changes made may be
+	    // compared to the original.
+	    return new TreeCopier(lines$1, tokens).copy(file);
+	}
+	exports.parse = parse;
+	var TreeCopier = function TreeCopier(lines, tokens) {
+	    assert_1.default.ok(this instanceof TreeCopier);
+	    this.lines = lines;
+	    this.tokens = tokens;
+	    this.startTokenIndex = 0;
+	    this.endTokenIndex = tokens.length;
+	    this.indent = 0;
+	    this.seen = new Map;
+	};
+	var TCp = TreeCopier.prototype;
+	TCp.copy = function (node) {
+	    if (this.seen.has(node)) {
+	        return this.seen.get(node);
+	    }
+	    if (isArray.check(node)) {
+	        var copy = new Array(node.length);
+	        this.seen.set(node, copy);
+	        node.forEach(function (item, i) {
+	            copy[i] = this.copy(item);
+	        }, this);
+	        return copy;
+	    }
+	    if (!isObject.check(node)) {
+	        return node;
+	    }
+	    util.fixFaultyLocations(node, this.lines);
+	    var copy = Object.create(Object.getPrototypeOf(node), {
+	        original: {
+	            value: node,
+	            configurable: false,
+	            enumerable: false,
+	            writable: true
+	        }
+	    });
+	    this.seen.set(node, copy);
+	    var loc = node.loc;
+	    var oldIndent = this.indent;
+	    var newIndent = oldIndent;
+	    var oldStartTokenIndex = this.startTokenIndex;
+	    var oldEndTokenIndex = this.endTokenIndex;
+	    if (loc) {
+	        // When node is a comment, we set node.loc.indent to
+	        // node.loc.start.column so that, when/if we print the comment by
+	        // itself, we can strip that much whitespace from the left margin of
+	        // the comment. This only really matters for multiline Block comments,
+	        // but it doesn't hurt for Line comments.
+	        if (node.type === "Block" || node.type === "Line" ||
+	            node.type === "CommentBlock" || node.type === "CommentLine" ||
+	            this.lines.isPrecededOnlyByWhitespace(loc.start)) {
+	            newIndent = this.indent = loc.start.column;
+	        }
+	        // Every node.loc has a reference to the original source lines as well
+	        // as a complete list of source tokens.
+	        loc.lines = this.lines;
+	        loc.tokens = this.tokens;
+	        loc.indent = newIndent;
+	        // Set loc.start.token and loc.end.token such that
+	        // loc.tokens.slice(loc.start.token, loc.end.token) returns a list of
+	        // all the tokens that make up this node.
+	        this.findTokenRange(loc);
+	    }
+	    var keys = Object.keys(node);
+	    var keyCount = keys.length;
+	    for (var i = 0; i < keyCount; ++i) {
+	        var key = keys[i];
+	        if (key === "loc") {
+	            copy[key] = node[key];
+	        }
+	        else if (key === "tokens" &&
+	            node.type === "File") {
+	            // Preserve file.tokens (uncopied) in case client code cares about
+	            // it, even though Recast ignores it when reprinting.
+	            copy[key] = node[key];
+	        }
+	        else {
+	            copy[key] = this.copy(node[key]);
+	        }
+	    }
+	    this.indent = oldIndent;
+	    this.startTokenIndex = oldStartTokenIndex;
+	    this.endTokenIndex = oldEndTokenIndex;
+	    return copy;
+	};
+	// If we didn't have any idea where in loc.tokens to look for tokens
+	// contained by this loc, a binary search would be appropriate, but
+	// because we maintain this.startTokenIndex and this.endTokenIndex as we
+	// traverse the AST, we only need to make small (linear) adjustments to
+	// those indexes with each recursive iteration.
+	TCp.findTokenRange = function (loc) {
+	    // In the unlikely event that loc.tokens[this.startTokenIndex] starts
+	    // *after* loc.start, we need to rewind this.startTokenIndex first.
+	    while (this.startTokenIndex > 0) {
+	        var token = loc.tokens[this.startTokenIndex];
+	        if (util.comparePos(loc.start, token.loc.start) < 0) {
+	            --this.startTokenIndex;
+	        }
+	        else
+	            break;
+	    }
+	    // In the unlikely event that loc.tokens[this.endTokenIndex - 1] ends
+	    // *before* loc.end, we need to fast-forward this.endTokenIndex first.
+	    while (this.endTokenIndex < loc.tokens.length) {
+	        var token = loc.tokens[this.endTokenIndex];
+	        if (util.comparePos(token.loc.end, loc.end) < 0) {
+	            ++this.endTokenIndex;
+	        }
+	        else
+	            break;
+	    }
+	    // Increment this.startTokenIndex until we've found the first token
+	    // contained by this node.
+	    while (this.startTokenIndex < this.endTokenIndex) {
+	        var token = loc.tokens[this.startTokenIndex];
+	        if (util.comparePos(token.loc.start, loc.start) < 0) {
+	            ++this.startTokenIndex;
+	        }
+	        else
+	            break;
+	    }
+	    // Index into loc.tokens of the first token within this node.
+	    loc.start.token = this.startTokenIndex;
+	    // Decrement this.endTokenIndex until we've found the first token after
+	    // this node (not contained by the node).
+	    while (this.endTokenIndex > this.startTokenIndex) {
+	        var token = loc.tokens[this.endTokenIndex - 1];
+	        if (util.comparePos(loc.end, token.loc.end) < 0) {
+	            --this.endTokenIndex;
+	        }
+	        else
+	            break;
+	    }
+	    // Index into loc.tokens of the first token *after* this node.
+	    // If loc.start.token === loc.end.token, the node contains no tokens,
+	    // and the index is that of the next token following this node.
+	    loc.end.token = this.endTokenIndex;
+	};
+	});
+
+	unwrapExports(parser);
+	var parser_1 = parser.parse;
+
+	var fastPath = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var types = __importStar(main);
+	var n = types.namedTypes;
+	var isArray = types.builtInTypes.array;
+	var isNumber = types.builtInTypes.number;
+	var util = __importStar(util$1);
+	var FastPath = function FastPath(value) {
+	    assert_1.default.ok(this instanceof FastPath);
+	    this.stack = [value];
+	};
+	var FPp = FastPath.prototype;
+	// Static convenience function for coercing a value to a FastPath.
+	FastPath.from = function (obj) {
+	    if (obj instanceof FastPath) {
+	        // Return a defensive copy of any existing FastPath instances.
+	        return obj.copy();
+	    }
+	    if (obj instanceof types.NodePath) {
+	        // For backwards compatibility, unroll NodePath instances into
+	        // lightweight FastPath [..., name, value] stacks.
+	        var copy = Object.create(FastPath.prototype);
+	        var stack = [obj.value];
+	        for (var pp; (pp = obj.parentPath); obj = pp)
+	            stack.push(obj.name, pp.value);
+	        copy.stack = stack.reverse();
+	        return copy;
+	    }
+	    // Otherwise use obj as the value of the new FastPath instance.
+	    return new FastPath(obj);
+	};
+	FPp.copy = function copy() {
+	    var copy = Object.create(FastPath.prototype);
+	    copy.stack = this.stack.slice(0);
+	    return copy;
+	};
+	// The name of the current property is always the penultimate element of
+	// this.stack, and always a String.
+	FPp.getName = function getName() {
+	    var s = this.stack;
+	    var len = s.length;
+	    if (len > 1) {
+	        return s[len - 2];
+	    }
+	    // Since the name is always a string, null is a safe sentinel value to
+	    // return if we do not know the name of the (root) value.
+	    return null;
+	};
+	// The value of the current property is always the final element of
+	// this.stack.
+	FPp.getValue = function getValue() {
+	    var s = this.stack;
+	    return s[s.length - 1];
+	};
+	FPp.valueIsDuplicate = function () {
+	    var s = this.stack;
+	    var valueIndex = s.length - 1;
+	    return s.lastIndexOf(s[valueIndex], valueIndex - 1) >= 0;
+	};
+	function getNodeHelper(path, count) {
+	    var s = path.stack;
+	    for (var i = s.length - 1; i >= 0; i -= 2) {
+	        var value = s[i];
+	        if (n.Node.check(value) && --count < 0) {
+	            return value;
+	        }
+	    }
+	    return null;
+	}
+	FPp.getNode = function getNode(count) {
+	    if (count === void 0) { count = 0; }
+	    return getNodeHelper(this, ~~count);
+	};
+	FPp.getParentNode = function getParentNode(count) {
+	    if (count === void 0) { count = 0; }
+	    return getNodeHelper(this, ~~count + 1);
+	};
+	// The length of the stack can be either even or odd, depending on whether
+	// or not we have a name for the root value. The difference between the
+	// index of the root value and the index of the final value is always
+	// even, though, which allows us to return the root value in constant time
+	// (i.e. without iterating backwards through the stack).
+	FPp.getRootValue = function getRootValue() {
+	    var s = this.stack;
+	    if (s.length % 2 === 0) {
+	        return s[1];
+	    }
+	    return s[0];
+	};
+	// Temporarily push properties named by string arguments given after the
+	// callback function onto this.stack, then call the callback with a
+	// reference to this (modified) FastPath object. Note that the stack will
+	// be restored to its original state after the callback is finished, so it
+	// is probably a mistake to retain a reference to the path.
+	FPp.call = function call(callback /*, name1, name2, ... */) {
+	    var s = this.stack;
+	    var origLen = s.length;
+	    var value = s[origLen - 1];
+	    var argc = arguments.length;
+	    for (var i = 1; i < argc; ++i) {
+	        var name = arguments[i];
+	        value = value[name];
+	        s.push(name, value);
+	    }
+	    var result = callback(this);
+	    s.length = origLen;
+	    return result;
+	};
+	// Similar to FastPath.prototype.call, except that the value obtained by
+	// accessing this.getValue()[name1][name2]... should be array-like. The
+	// callback will be called with a reference to this path object for each
+	// element of the array.
+	FPp.each = function each(callback /*, name1, name2, ... */) {
+	    var s = this.stack;
+	    var origLen = s.length;
+	    var value = s[origLen - 1];
+	    var argc = arguments.length;
+	    for (var i = 1; i < argc; ++i) {
+	        var name = arguments[i];
+	        value = value[name];
+	        s.push(name, value);
+	    }
+	    for (var i = 0; i < value.length; ++i) {
+	        if (i in value) {
+	            s.push(i, value[i]);
+	            // If the callback needs to know the value of i, call
+	            // path.getName(), assuming path is the parameter name.
+	            callback(this);
+	            s.length -= 2;
+	        }
+	    }
+	    s.length = origLen;
+	};
+	// Similar to FastPath.prototype.each, except that the results of the
+	// callback function invocations are stored in an array and returned at
+	// the end of the iteration.
+	FPp.map = function map(callback /*, name1, name2, ... */) {
+	    var s = this.stack;
+	    var origLen = s.length;
+	    var value = s[origLen - 1];
+	    var argc = arguments.length;
+	    for (var i = 1; i < argc; ++i) {
+	        var name = arguments[i];
+	        value = value[name];
+	        s.push(name, value);
+	    }
+	    var result = new Array(value.length);
+	    for (var i = 0; i < value.length; ++i) {
+	        if (i in value) {
+	            s.push(i, value[i]);
+	            result[i] = callback(this, i);
+	            s.length -= 2;
+	        }
+	    }
+	    s.length = origLen;
+	    return result;
+	};
+	// Returns true if the node at the tip of the path is wrapped with
+	// parentheses, OR if the only reason the node needed parentheses was that
+	// it couldn't be the first expression in the enclosing statement (see
+	// FastPath#canBeFirstInStatement), and it has an opening `(` character.
+	// For example, the FunctionExpression in `(function(){}())` appears to
+	// need parentheses only because it's the first expression in the AST, but
+	// since it happens to be preceded by a `(` (which is not apparent from
+	// the AST but can be determined using FastPath#getPrevToken), there is no
+	// ambiguity about how to parse it, so it counts as having parentheses,
+	// even though it is not immediately followed by a `)`.
+	FPp.hasParens = function () {
+	    var node = this.getNode();
+	    var prevToken = this.getPrevToken(node);
+	    if (!prevToken) {
+	        return false;
+	    }
+	    var nextToken = this.getNextToken(node);
+	    if (!nextToken) {
+	        return false;
+	    }
+	    if (prevToken.value === "(") {
+	        if (nextToken.value === ")") {
+	            // If the node preceded by a `(` token and followed by a `)` token,
+	            // then of course it has parentheses.
+	            return true;
+	        }
+	        // If this is one of the few Expression types that can't come first in
+	        // the enclosing statement because of parsing ambiguities (namely,
+	        // FunctionExpression, ObjectExpression, and ClassExpression) and
+	        // this.firstInStatement() returns true, and the node would not need
+	        // parentheses in an expression context because this.needsParens(true)
+	        // returns false, then it just needs an opening parenthesis to resolve
+	        // the parsing ambiguity that made it appear to need parentheses.
+	        var justNeedsOpeningParen = !this.canBeFirstInStatement() &&
+	            this.firstInStatement() &&
+	            !this.needsParens(true);
+	        if (justNeedsOpeningParen) {
+	            return true;
+	        }
+	    }
+	    return false;
+	};
+	FPp.getPrevToken = function (node) {
+	    node = node || this.getNode();
+	    var loc = node && node.loc;
+	    var tokens = loc && loc.tokens;
+	    if (tokens && loc.start.token > 0) {
+	        var token = tokens[loc.start.token - 1];
+	        if (token) {
+	            // Do not return tokens that fall outside the root subtree.
+	            var rootLoc = this.getRootValue().loc;
+	            if (util.comparePos(rootLoc.start, token.loc.start) <= 0) {
+	                return token;
+	            }
+	        }
+	    }
+	    return null;
+	};
+	FPp.getNextToken = function (node) {
+	    node = node || this.getNode();
+	    var loc = node && node.loc;
+	    var tokens = loc && loc.tokens;
+	    if (tokens && loc.end.token < tokens.length) {
+	        var token = tokens[loc.end.token];
+	        if (token) {
+	            // Do not return tokens that fall outside the root subtree.
+	            var rootLoc = this.getRootValue().loc;
+	            if (util.comparePos(token.loc.end, rootLoc.end) <= 0) {
+	                return token;
+	            }
+	        }
+	    }
+	    return null;
+	};
+	// Inspired by require("ast-types").NodePath.prototype.needsParens, but
+	// more efficient because we're iterating backwards through a stack.
+	FPp.needsParens = function (assumeExpressionContext) {
+	    var node = this.getNode();
+	    // This needs to come before `if (!parent) { return false }` because
+	    // an object destructuring assignment requires parens for
+	    // correctness even when it's the topmost expression.
+	    if (node.type === "AssignmentExpression" && node.left.type === 'ObjectPattern') {
+	        return true;
+	    }
+	    var parent = this.getParentNode();
+	    if (!parent) {
+	        return false;
+	    }
+	    var name = this.getName();
+	    // If the value of this path is some child of a Node and not a Node
+	    // itself, then it doesn't need parentheses. Only Node objects (in fact,
+	    // only Expression nodes) need parentheses.
+	    if (this.getValue() !== node) {
+	        return false;
+	    }
+	    // Only statements don't need parentheses.
+	    if (n.Statement.check(node)) {
+	        return false;
+	    }
+	    // Identifiers never need parentheses.
+	    if (node.type === "Identifier") {
+	        return false;
+	    }
+	    if (parent.type === "ParenthesizedExpression") {
+	        return false;
+	    }
+	    switch (node.type) {
+	        case "UnaryExpression":
+	        case "SpreadElement":
+	        case "SpreadProperty":
+	            return parent.type === "MemberExpression"
+	                && name === "object"
+	                && parent.object === node;
+	        case "BinaryExpression":
+	        case "LogicalExpression":
+	            switch (parent.type) {
+	                case "CallExpression":
+	                    return name === "callee"
+	                        && parent.callee === node;
+	                case "UnaryExpression":
+	                case "SpreadElement":
+	                case "SpreadProperty":
+	                    return true;
+	                case "MemberExpression":
+	                    return name === "object"
+	                        && parent.object === node;
+	                case "BinaryExpression":
+	                case "LogicalExpression":
+	                    var po = parent.operator;
+	                    var pp = PRECEDENCE[po];
+	                    var no = node.operator;
+	                    var np = PRECEDENCE[no];
+	                    if (pp > np) {
+	                        return true;
+	                    }
+	                    if (pp === np && name === "right") {
+	                        assert_1.default.strictEqual(parent.right, node);
+	                        return true;
+	                    }
+	                default:
+	                    return false;
+	            }
+	        case "SequenceExpression":
+	            switch (parent.type) {
+	                case "ReturnStatement":
+	                    return false;
+	                case "ForStatement":
+	                    // Although parentheses wouldn't hurt around sequence expressions in
+	                    // the head of for loops, traditional style dictates that e.g. i++,
+	                    // j++ should not be wrapped with parentheses.
+	                    return false;
+	                case "ExpressionStatement":
+	                    return name !== "expression";
+	                default:
+	                    // Otherwise err on the side of overparenthesization, adding
+	                    // explicit exceptions above if this proves overzealous.
+	                    return true;
+	            }
+	        case "YieldExpression":
+	            switch (parent.type) {
+	                case "BinaryExpression":
+	                case "LogicalExpression":
+	                case "UnaryExpression":
+	                case "SpreadElement":
+	                case "SpreadProperty":
+	                case "CallExpression":
+	                case "MemberExpression":
+	                case "NewExpression":
+	                case "ConditionalExpression":
+	                case "YieldExpression":
+	                    return true;
+	                default:
+	                    return false;
+	            }
+	        case "IntersectionTypeAnnotation":
+	        case "UnionTypeAnnotation":
+	            return parent.type === "NullableTypeAnnotation";
+	        case "Literal":
+	            return parent.type === "MemberExpression"
+	                && isNumber.check(node.value)
+	                && name === "object"
+	                && parent.object === node;
+	        // Babel 6 Literal split
+	        case "NumericLiteral":
+	            return parent.type === "MemberExpression"
+	                && name === "object"
+	                && parent.object === node;
+	        case "AssignmentExpression":
+	        case "ConditionalExpression":
+	            switch (parent.type) {
+	                case "UnaryExpression":
+	                case "SpreadElement":
+	                case "SpreadProperty":
+	                case "BinaryExpression":
+	                case "LogicalExpression":
+	                    return true;
+	                case "CallExpression":
+	                case "NewExpression":
+	                    return name === "callee"
+	                        && parent.callee === node;
+	                case "ConditionalExpression":
+	                    return name === "test"
+	                        && parent.test === node;
+	                case "MemberExpression":
+	                    return name === "object"
+	                        && parent.object === node;
+	                default:
+	                    return false;
+	            }
+	        case "ArrowFunctionExpression":
+	            if (n.CallExpression.check(parent) &&
+	                name === 'callee') {
+	                return true;
+	            }
+	            if (n.MemberExpression.check(parent) &&
+	                name === 'object') {
+	                return true;
+	            }
+	            return isBinary(parent);
+	        case "ObjectExpression":
+	            if (parent.type === "ArrowFunctionExpression" &&
+	                name === "body") {
+	                return true;
+	            }
+	            break;
+	        case "CallExpression":
+	            if (name === "declaration" &&
+	                n.ExportDefaultDeclaration.check(parent) &&
+	                n.FunctionExpression.check(node.callee)) {
+	                return true;
+	            }
+	    }
+	    if (parent.type === "NewExpression" &&
+	        name === "callee" &&
+	        parent.callee === node) {
+	        return containsCallExpression(node);
+	    }
+	    if (assumeExpressionContext !== true &&
+	        !this.canBeFirstInStatement() &&
+	        this.firstInStatement()) {
+	        return true;
+	    }
+	    return false;
+	};
+	function isBinary(node) {
+	    return n.BinaryExpression.check(node)
+	        || n.LogicalExpression.check(node);
+	}
+	var PRECEDENCE = {};
+	[["||"],
+	    ["&&"],
+	    ["|"],
+	    ["^"],
+	    ["&"],
+	    ["==", "===", "!=", "!=="],
+	    ["<", ">", "<=", ">=", "in", "instanceof"],
+	    [">>", "<<", ">>>"],
+	    ["+", "-"],
+	    ["*", "/", "%", "**"]
+	].forEach(function (tier, i) {
+	    tier.forEach(function (op) {
+	        PRECEDENCE[op] = i;
+	    });
+	});
+	function containsCallExpression(node) {
+	    if (n.CallExpression.check(node)) {
+	        return true;
+	    }
+	    if (isArray.check(node)) {
+	        return node.some(containsCallExpression);
+	    }
+	    if (n.Node.check(node)) {
+	        return types.someField(node, function (_name, child) {
+	            return containsCallExpression(child);
+	        });
+	    }
+	    return false;
+	}
+	FPp.canBeFirstInStatement = function () {
+	    var node = this.getNode();
+	    if (n.FunctionExpression.check(node)) {
+	        return false;
+	    }
+	    if (n.ObjectExpression.check(node)) {
+	        return false;
+	    }
+	    if (n.ClassExpression.check(node)) {
+	        return false;
+	    }
+	    return true;
+	};
+	FPp.firstInStatement = function () {
+	    var s = this.stack;
+	    var parentName, parent;
+	    var childName, child;
+	    for (var i = s.length - 1; i >= 0; i -= 2) {
+	        if (n.Node.check(s[i])) {
+	            childName = parentName;
+	            child = parent;
+	            parentName = s[i - 1];
+	            parent = s[i];
+	        }
+	        if (!parent || !child) {
+	            continue;
+	        }
+	        if (n.BlockStatement.check(parent) &&
+	            parentName === "body" &&
+	            childName === 0) {
+	            assert_1.default.strictEqual(parent.body[0], child);
+	            return true;
+	        }
+	        if (n.ExpressionStatement.check(parent) &&
+	            childName === "expression") {
+	            assert_1.default.strictEqual(parent.expression, child);
+	            return true;
+	        }
+	        if (n.AssignmentExpression.check(parent) &&
+	            childName === "left") {
+	            assert_1.default.strictEqual(parent.left, child);
+	            return true;
+	        }
+	        if (n.ArrowFunctionExpression.check(parent) &&
+	            childName === "body") {
+	            assert_1.default.strictEqual(parent.body, child);
+	            return true;
+	        }
+	        if (n.SequenceExpression.check(parent) &&
+	            parentName === "expressions" &&
+	            childName === 0) {
+	            assert_1.default.strictEqual(parent.expressions[0], child);
+	            continue;
+	        }
+	        if (n.CallExpression.check(parent) &&
+	            childName === "callee") {
+	            assert_1.default.strictEqual(parent.callee, child);
+	            continue;
+	        }
+	        if (n.MemberExpression.check(parent) &&
+	            childName === "object") {
+	            assert_1.default.strictEqual(parent.object, child);
+	            continue;
+	        }
+	        if (n.ConditionalExpression.check(parent) &&
+	            childName === "test") {
+	            assert_1.default.strictEqual(parent.test, child);
+	            continue;
+	        }
+	        if (isBinary(parent) &&
+	            childName === "left") {
+	            assert_1.default.strictEqual(parent.left, child);
+	            continue;
+	        }
+	        if (n.UnaryExpression.check(parent) &&
+	            !parent.prefix &&
+	            childName === "argument") {
+	            assert_1.default.strictEqual(parent.argument, child);
+	            continue;
+	        }
+	        return false;
+	    }
+	    return true;
+	};
+	exports.default = FastPath;
+	});
+
+	unwrapExports(fastPath);
+
+	var patcher = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+	var linesModule = __importStar(lines);
+	var types = __importStar(main);
+	var Printable = types.namedTypes.Printable;
+	var Expression = types.namedTypes.Expression;
+	var ReturnStatement = types.namedTypes.ReturnStatement;
+	var SourceLocation = types.namedTypes.SourceLocation;
+
+	var fast_path_1 = __importDefault(fastPath);
+	var isObject = types.builtInTypes.object;
+	var isArray = types.builtInTypes.array;
+	var isString = types.builtInTypes.string;
+	var riskyAdjoiningCharExp = /[0-9a-z_$]/i;
+	var Patcher = function Patcher(lines) {
+	    assert_1.default.ok(this instanceof Patcher);
+	    assert_1.default.ok(lines instanceof linesModule.Lines);
+	    var self = this, replacements = [];
+	    self.replace = function (loc, lines) {
+	        if (isString.check(lines))
+	            lines = linesModule.fromString(lines);
+	        replacements.push({
+	            lines: lines,
+	            start: loc.start,
+	            end: loc.end
+	        });
+	    };
+	    self.get = function (loc) {
+	        // If no location is provided, return the complete Lines object.
+	        loc = loc || {
+	            start: { line: 1, column: 0 },
+	            end: { line: lines.length,
+	                column: lines.getLineLength(lines.length) }
+	        };
+	        var sliceFrom = loc.start, toConcat = [];
+	        function pushSlice(from, to) {
+	            assert_1.default.ok(util$1.comparePos(from, to) <= 0);
+	            toConcat.push(lines.slice(from, to));
+	        }
+	        replacements.sort(function (a, b) {
+	            return util$1.comparePos(a.start, b.start);
+	        }).forEach(function (rep) {
+	            if (util$1.comparePos(sliceFrom, rep.start) > 0) ;
+	            else {
+	                pushSlice(sliceFrom, rep.start);
+	                toConcat.push(rep.lines);
+	                sliceFrom = rep.end;
+	            }
+	        });
+	        pushSlice(sliceFrom, loc.end);
+	        return linesModule.concat(toConcat);
+	    };
+	};
+	exports.Patcher = Patcher;
+	var Pp = Patcher.prototype;
+	Pp.tryToReprintComments = function (newNode, oldNode, print) {
+	    var patcher = this;
+	    if (!newNode.comments &&
+	        !oldNode.comments) {
+	        // We were (vacuously) able to reprint all the comments!
+	        return true;
+	    }
+	    var newPath = fast_path_1.default.from(newNode);
+	    var oldPath = fast_path_1.default.from(oldNode);
+	    newPath.stack.push("comments", getSurroundingComments(newNode));
+	    oldPath.stack.push("comments", getSurroundingComments(oldNode));
+	    var reprints = [];
+	    var ableToReprintComments = findArrayReprints(newPath, oldPath, reprints);
+	    // No need to pop anything from newPath.stack or oldPath.stack, since
+	    // newPath and oldPath are fresh local variables.
+	    if (ableToReprintComments && reprints.length > 0) {
+	        reprints.forEach(function (reprint) {
+	            var oldComment = reprint.oldPath.getValue();
+	            assert_1.default.ok(oldComment.leading || oldComment.trailing);
+	            patcher.replace(oldComment.loc, 
+	            // Comments can't have .comments, so it doesn't matter whether we
+	            // print with comments or without.
+	            print(reprint.newPath).indentTail(oldComment.loc.indent));
+	        });
+	    }
+	    return ableToReprintComments;
+	};
+	// Get all comments that are either leading or trailing, ignoring any
+	// comments that occur inside node.loc. Returns an empty array for nodes
+	// with no leading or trailing comments.
+	function getSurroundingComments(node) {
+	    var result = [];
+	    if (node.comments &&
+	        node.comments.length > 0) {
+	        node.comments.forEach(function (comment) {
+	            if (comment.leading || comment.trailing) {
+	                result.push(comment);
+	            }
+	        });
+	    }
+	    return result;
+	}
+	Pp.deleteComments = function (node) {
+	    if (!node.comments) {
+	        return;
+	    }
+	    var patcher = this;
+	    node.comments.forEach(function (comment) {
+	        if (comment.leading) {
+	            // Delete leading comments along with any trailing whitespace they
+	            // might have.
+	            patcher.replace({
+	                start: comment.loc.start,
+	                end: node.loc.lines.skipSpaces(comment.loc.end, false, false)
+	            }, "");
+	        }
+	        else if (comment.trailing) {
+	            // Delete trailing comments along with any leading whitespace they
+	            // might have.
+	            patcher.replace({
+	                start: node.loc.lines.skipSpaces(comment.loc.start, true, false),
+	                end: comment.loc.end
+	            }, "");
+	        }
+	    });
+	};
+	function getReprinter(path) {
+	    assert_1.default.ok(path instanceof fast_path_1.default);
+	    // Make sure that this path refers specifically to a Node, rather than
+	    // some non-Node subproperty of a Node.
+	    var node = path.getValue();
+	    if (!Printable.check(node))
+	        return;
+	    var orig = node.original;
+	    var origLoc = orig && orig.loc;
+	    var lines = origLoc && origLoc.lines;
+	    var reprints = [];
+	    if (!lines || !findReprints(path, reprints))
+	        return;
+	    return function (print) {
+	        var patcher = new Patcher(lines);
+	        reprints.forEach(function (reprint) {
+	            var newNode = reprint.newPath.getValue();
+	            var oldNode = reprint.oldPath.getValue();
+	            SourceLocation.assert(oldNode.loc, true);
+	            var needToPrintNewPathWithComments = !patcher.tryToReprintComments(newNode, oldNode, print);
+	            if (needToPrintNewPathWithComments) {
+	                // Since we were not able to preserve all leading/trailing
+	                // comments, we delete oldNode's comments, print newPath with
+	                // comments, and then patch the resulting lines where oldNode used
+	                // to be.
+	                patcher.deleteComments(oldNode);
+	            }
+	            var newLines = print(reprint.newPath, {
+	                includeComments: needToPrintNewPathWithComments,
+	                // If the oldNode we're replacing already had parentheses, we may
+	                // not need to print the new node with any extra parentheses,
+	                // because the existing parentheses will suffice. However, if the
+	                // newNode has a different type than the oldNode, let the printer
+	                // decide if reprint.newPath needs parentheses, as usual.
+	                avoidRootParens: (oldNode.type === newNode.type &&
+	                    reprint.oldPath.hasParens())
+	            }).indentTail(oldNode.loc.indent);
+	            var nls = needsLeadingSpace(lines, oldNode.loc, newLines);
+	            var nts = needsTrailingSpace(lines, oldNode.loc, newLines);
+	            // If we try to replace the argument of a ReturnStatement like
+	            // return"asdf" with e.g. a literal null expression, we run the risk
+	            // of ending up with returnnull, so we need to add an extra leading
+	            // space in situations where that might happen. Likewise for
+	            // "asdf"in obj. See #170.
+	            if (nls || nts) {
+	                var newParts = [];
+	                nls && newParts.push(" ");
+	                newParts.push(newLines);
+	                nts && newParts.push(" ");
+	                newLines = linesModule.concat(newParts);
+	            }
+	            patcher.replace(oldNode.loc, newLines);
+	        });
+	        // Recall that origLoc is the .loc of an ancestor node that is
+	        // guaranteed to contain all the reprinted nodes and comments.
+	        var patchedLines = patcher.get(origLoc).indentTail(-orig.loc.indent);
+	        if (path.needsParens()) {
+	            return linesModule.concat(["(", patchedLines, ")"]);
+	        }
+	        return patchedLines;
+	    };
+	}
+	exports.getReprinter = getReprinter;
+	// If the last character before oldLoc and the first character of newLines
+	// are both identifier characters, they must be separated by a space,
+	// otherwise they will most likely get fused together into a single token.
+	function needsLeadingSpace(oldLines, oldLoc, newLines) {
+	    var posBeforeOldLoc = util$1.copyPos(oldLoc.start);
+	    // The character just before the location occupied by oldNode.
+	    var charBeforeOldLoc = oldLines.prevPos(posBeforeOldLoc) &&
+	        oldLines.charAt(posBeforeOldLoc);
+	    // First character of the reprinted node.
+	    var newFirstChar = newLines.charAt(newLines.firstPos());
+	    return charBeforeOldLoc &&
+	        riskyAdjoiningCharExp.test(charBeforeOldLoc) &&
+	        newFirstChar &&
+	        riskyAdjoiningCharExp.test(newFirstChar);
+	}
+	// If the last character of newLines and the first character after oldLoc
+	// are both identifier characters, they must be separated by a space,
+	// otherwise they will most likely get fused together into a single token.
+	function needsTrailingSpace(oldLines, oldLoc, newLines) {
+	    // The character just after the location occupied by oldNode.
+	    var charAfterOldLoc = oldLines.charAt(oldLoc.end);
+	    var newLastPos = newLines.lastPos();
+	    // Last character of the reprinted node.
+	    var newLastChar = newLines.prevPos(newLastPos) &&
+	        newLines.charAt(newLastPos);
+	    return newLastChar &&
+	        riskyAdjoiningCharExp.test(newLastChar) &&
+	        charAfterOldLoc &&
+	        riskyAdjoiningCharExp.test(charAfterOldLoc);
+	}
+	function findReprints(newPath, reprints) {
+	    var newNode = newPath.getValue();
+	    Printable.assert(newNode);
+	    var oldNode = newNode.original;
+	    Printable.assert(oldNode);
+	    assert_1.default.deepEqual(reprints, []);
+	    if (newNode.type !== oldNode.type) {
+	        return false;
+	    }
+	    var oldPath = new fast_path_1.default(oldNode);
+	    var canReprint = findChildReprints(newPath, oldPath, reprints);
+	    if (!canReprint) {
+	        // Make absolutely sure the calling code does not attempt to reprint
+	        // any nodes.
+	        reprints.length = 0;
+	    }
+	    return canReprint;
+	}
+	function findAnyReprints(newPath, oldPath, reprints) {
+	    var newNode = newPath.getValue();
+	    var oldNode = oldPath.getValue();
+	    if (newNode === oldNode)
+	        return true;
+	    if (isArray.check(newNode))
+	        return findArrayReprints(newPath, oldPath, reprints);
+	    if (isObject.check(newNode))
+	        return findObjectReprints(newPath, oldPath, reprints);
+	    return false;
+	}
+	function findArrayReprints(newPath, oldPath, reprints) {
+	    var newNode = newPath.getValue();
+	    var oldNode = oldPath.getValue();
+	    if (newNode === oldNode ||
+	        newPath.valueIsDuplicate() ||
+	        oldPath.valueIsDuplicate()) {
+	        return true;
+	    }
+	    isArray.assert(newNode);
+	    var len = newNode.length;
+	    if (!(isArray.check(oldNode) &&
+	        oldNode.length === len))
+	        return false;
+	    for (var i = 0; i < len; ++i) {
+	        newPath.stack.push(i, newNode[i]);
+	        oldPath.stack.push(i, oldNode[i]);
+	        var canReprint = findAnyReprints(newPath, oldPath, reprints);
+	        newPath.stack.length -= 2;
+	        oldPath.stack.length -= 2;
+	        if (!canReprint) {
+	            return false;
+	        }
+	    }
+	    return true;
+	}
+	function findObjectReprints(newPath, oldPath, reprints) {
+	    var newNode = newPath.getValue();
+	    isObject.assert(newNode);
+	    if (newNode.original === null) {
+	        // If newNode.original node was set to null, reprint the node.
+	        return false;
+	    }
+	    var oldNode = oldPath.getValue();
+	    if (!isObject.check(oldNode))
+	        return false;
+	    if (newNode === oldNode ||
+	        newPath.valueIsDuplicate() ||
+	        oldPath.valueIsDuplicate()) {
+	        return true;
+	    }
+	    if (Printable.check(newNode)) {
+	        if (!Printable.check(oldNode)) {
+	            return false;
+	        }
+	        // Here we need to decide whether the reprinted code for newNode is
+	        // appropriate for patching into the location of oldNode.
+	        if (newNode.type === oldNode.type) {
+	            var childReprints = [];
+	            if (findChildReprints(newPath, oldPath, childReprints)) {
+	                reprints.push.apply(reprints, childReprints);
+	            }
+	            else if (oldNode.loc) {
+	                // If we have no .loc information for oldNode, then we won't be
+	                // able to reprint it.
+	                reprints.push({
+	                    oldPath: oldPath.copy(),
+	                    newPath: newPath.copy()
+	                });
+	            }
+	            else {
+	                return false;
+	            }
+	            return true;
+	        }
+	        if (Expression.check(newNode) &&
+	            Expression.check(oldNode) &&
+	            // If we have no .loc information for oldNode, then we won't be
+	            // able to reprint it.
+	            oldNode.loc) {
+	            // If both nodes are subtypes of Expression, then we should be able
+	            // to fill the location occupied by the old node with code printed
+	            // for the new node with no ill consequences.
+	            reprints.push({
+	                oldPath: oldPath.copy(),
+	                newPath: newPath.copy()
+	            });
+	            return true;
+	        }
+	        // The nodes have different types, and at least one of the types is
+	        // not a subtype of the Expression type, so we cannot safely assume
+	        // the nodes are syntactically interchangeable.
+	        return false;
+	    }
+	    return findChildReprints(newPath, oldPath, reprints);
+	}
+	function findChildReprints(newPath, oldPath, reprints) {
+	    var newNode = newPath.getValue();
+	    var oldNode = oldPath.getValue();
+	    isObject.assert(newNode);
+	    isObject.assert(oldNode);
+	    if (newNode.original === null) {
+	        // If newNode.original node was set to null, reprint the node.
+	        return false;
+	    }
+	    // If this node needs parentheses and will not be wrapped with
+	    // parentheses when reprinted, then return false to skip reprinting and
+	    // let it be printed generically.
+	    if (newPath.needsParens() &&
+	        !oldPath.hasParens()) {
+	        return false;
+	    }
+	    var keys = util$1.getUnionOfKeys(oldNode, newNode);
+	    if (oldNode.type === "File" ||
+	        newNode.type === "File") {
+	        // Don't bother traversing file.tokens, an often very large array
+	        // returned by Babylon, and useless for our purposes.
+	        delete keys.tokens;
+	    }
+	    // Don't bother traversing .loc objects looking for reprintable nodes.
+	    delete keys.loc;
+	    var originalReprintCount = reprints.length;
+	    for (var k in keys) {
+	        if (k.charAt(0) === "_") {
+	            // Ignore "private" AST properties added by e.g. Babel plugins and
+	            // parsers like Babylon.
+	            continue;
+	        }
+	        newPath.stack.push(k, types.getFieldValue(newNode, k));
+	        oldPath.stack.push(k, types.getFieldValue(oldNode, k));
+	        var canReprint = findAnyReprints(newPath, oldPath, reprints);
+	        newPath.stack.length -= 2;
+	        oldPath.stack.length -= 2;
+	        if (!canReprint) {
+	            return false;
+	        }
+	    }
+	    // Return statements might end up running into ASI issues due to
+	    // comments inserted deep within the tree, so reprint them if anything
+	    // changed within them.
+	    if (ReturnStatement.check(newPath.getNode()) &&
+	        reprints.length > originalReprintCount) {
+	        return false;
+	    }
+	    return true;
+	}
+	});
+
+	unwrapExports(patcher);
+	var patcher_1 = patcher.Patcher;
+	var patcher_2 = patcher.getReprinter;
+
+	var printer = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __importDefault(assert);
+
+
+
+
+	var types = __importStar(main);
+	var namedTypes = types.namedTypes;
+	var isString = types.builtInTypes.string;
+	var isObject = types.builtInTypes.object;
+	var fast_path_1 = __importDefault(fastPath);
+	var util = __importStar(util$1);
+	var PrintResult = function PrintResult(code, sourceMap) {
+	    assert_1.default.ok(this instanceof PrintResult);
+	    isString.assert(code);
+	    this.code = code;
+	    if (sourceMap) {
+	        isObject.assert(sourceMap);
+	        this.map = sourceMap;
+	    }
+	};
+	var PRp = PrintResult.prototype;
+	var warnedAboutToString = false;
+	PRp.toString = function () {
+	    if (!warnedAboutToString) {
+	        console.warn("Deprecation warning: recast.print now returns an object with " +
+	            "a .code property. You appear to be treating the object as a " +
+	            "string, which might still work but is strongly discouraged.");
+	        warnedAboutToString = true;
+	    }
+	    return this.code;
+	};
+	var emptyPrintResult = new PrintResult("");
+	var Printer = function Printer(config) {
+	    assert_1.default.ok(this instanceof Printer);
+	    var explicitTabWidth = config && config.tabWidth;
+	    config = options.normalize(config);
+	    // It's common for client code to pass the same options into both
+	    // recast.parse and recast.print, but the Printer doesn't need (and
+	    // can be confused by) config.sourceFileName, so we null it out.
+	    config.sourceFileName = null;
+	    // Non-destructively modifies options with overrides, and returns a
+	    // new print function that uses the modified options.
+	    function makePrintFunctionWith(options, overrides) {
+	        options = Object.assign({}, options, overrides);
+	        return function (path) {
+	            return print(path, options);
+	        };
+	    }
+	    function print(path, options) {
+	        assert_1.default.ok(path instanceof fast_path_1.default);
+	        options = options || {};
+	        if (options.includeComments) {
+	            return comments.printComments(path, makePrintFunctionWith(options, {
+	                includeComments: false
+	            }));
+	        }
+	        var oldTabWidth = config.tabWidth;
+	        if (!explicitTabWidth) {
+	            var loc = path.getNode().loc;
+	            if (loc && loc.lines && loc.lines.guessTabWidth) {
+	                config.tabWidth = loc.lines.guessTabWidth();
+	            }
+	        }
+	        var reprinter = patcher.getReprinter(path);
+	        var lines = reprinter
+	            // Since the print function that we pass to the reprinter will
+	            // be used to print "new" nodes, it's tempting to think we
+	            // should pass printRootGenerically instead of print, to avoid
+	            // calling maybeReprint again, but that would be a mistake
+	            // because the new nodes might not be entirely new, but merely
+	            // moved from elsewhere in the AST. The print function is the
+	            // right choice because it gives us the opportunity to reprint
+	            // such nodes using their original source.
+	            ? reprinter(print)
+	            : genericPrint(path, config, options, makePrintFunctionWith(options, {
+	                includeComments: true,
+	                avoidRootParens: false
+	            }));
+	        config.tabWidth = oldTabWidth;
+	        return lines;
+	    }
+	    this.print = function (ast) {
+	        if (!ast) {
+	            return emptyPrintResult;
+	        }
+	        var lines = print(fast_path_1.default.from(ast), {
+	            includeComments: true,
+	            avoidRootParens: false
+	        });
+	        return new PrintResult(lines.toString(config), util.composeSourceMaps(config.inputSourceMap, lines.getSourceMap(config.sourceMapName, config.sourceRoot)));
+	    };
+	    this.printGenerically = function (ast) {
+	        if (!ast) {
+	            return emptyPrintResult;
+	        }
+	        // Print the entire AST generically.
+	        function printGenerically(path) {
+	            return comments.printComments(path, function (path) {
+	                return genericPrint(path, config, {
+	                    includeComments: true,
+	                    avoidRootParens: false
+	                }, printGenerically);
+	            });
+	        }
+	        var path = fast_path_1.default.from(ast);
+	        var oldReuseWhitespace = config.reuseWhitespace;
+	        // Do not reuse whitespace (or anything else, for that matter)
+	        // when printing generically.
+	        config.reuseWhitespace = false;
+	        // TODO Allow printing of comments?
+	        var pr = new PrintResult(printGenerically(path).toString(config));
+	        config.reuseWhitespace = oldReuseWhitespace;
+	        return pr;
+	    };
+	};
+	exports.Printer = Printer;
+	function genericPrint(path, config, options, printPath) {
+	    assert_1.default.ok(path instanceof fast_path_1.default);
+	    var node = path.getValue();
+	    var parts = [];
+	    var linesWithoutParens = genericPrintNoParens(path, config, printPath);
+	    if (!node || linesWithoutParens.isEmpty()) {
+	        return linesWithoutParens;
+	    }
+	    var shouldAddParens = false;
+	    var decoratorsLines = printDecorators(path, printPath);
+	    if (decoratorsLines.isEmpty()) {
+	        // Nodes with decorators can't have parentheses, so we can avoid
+	        // computing path.needsParens() except in this case.
+	        if (!options.avoidRootParens) {
+	            shouldAddParens = path.needsParens();
+	        }
+	    }
+	    else {
+	        parts.push(decoratorsLines);
+	    }
+	    if (shouldAddParens) {
+	        parts.unshift("(");
+	    }
+	    parts.push(linesWithoutParens);
+	    if (shouldAddParens) {
+	        parts.push(")");
+	    }
+	    return lines.concat(parts);
+	}
+	// Note that the `options` parameter of this function is what other
+	// functions in this file call the `config` object (that is, the
+	// configuration object originally passed into the Printer constructor).
+	// Its properties are documented in lib/options.js.
+	function genericPrintNoParens(path, options, print) {
+	    var n = path.getValue();
+	    if (!n) {
+	        return lines.fromString("");
+	    }
+	    if (typeof n === "string") {
+	        return lines.fromString(n, options);
+	    }
+	    namedTypes.Printable.assert(n);
+	    var parts = [];
+	    switch (n.type) {
+	        case "File":
+	            return path.call(print, "program");
+	        case "Program":
+	            // Babel 6
+	            if (n.directives) {
+	                path.each(function (childPath) {
+	                    parts.push(print(childPath), ";\n");
+	                }, "directives");
+	            }
+	            if (n.interpreter) {
+	                parts.push(path.call(print, "interpreter"));
+	            }
+	            parts.push(path.call(function (bodyPath) {
+	                return printStatementSequence(bodyPath, options, print);
+	            }, "body"));
+	            return lines.concat(parts);
+	        case "Noop": // Babel extension.
+	        case "EmptyStatement":
+	            return lines.fromString("");
+	        case "ExpressionStatement":
+	            return lines.concat([path.call(print, "expression"), ";"]);
+	        case "ParenthesizedExpression": // Babel extension.
+	            return lines.concat(["(", path.call(print, "expression"), ")"]);
+	        case "BinaryExpression":
+	        case "LogicalExpression":
+	        case "AssignmentExpression":
+	            return lines.fromString(" ").join([
+	                path.call(print, "left"),
+	                n.operator,
+	                path.call(print, "right")
+	            ]);
+	        case "AssignmentPattern":
+	            return lines.concat([
+	                path.call(print, "left"),
+	                " = ",
+	                path.call(print, "right")
+	            ]);
+	        case "MemberExpression":
+	        case "OptionalMemberExpression":
+	            parts.push(path.call(print, "object"));
+	            var property = path.call(print, "property");
+	            var optional = n.type === "OptionalMemberExpression" && n.optional;
+	            if (n.computed) {
+	                parts.push(optional ? "?.[" : "[", property, "]");
+	            }
+	            else {
+	                parts.push(optional ? "?." : ".", property);
+	            }
+	            return lines.concat(parts);
+	        case "MetaProperty":
+	            return lines.concat([
+	                path.call(print, "meta"),
+	                ".",
+	                path.call(print, "property")
+	            ]);
+	        case "BindExpression":
+	            if (n.object) {
+	                parts.push(path.call(print, "object"));
+	            }
+	            parts.push("::", path.call(print, "callee"));
+	            return lines.concat(parts);
+	        case "Path":
+	            return lines.fromString(".").join(n.body);
+	        case "Identifier":
+	            return lines.concat([
+	                lines.fromString(n.name, options),
+	                n.optional ? "?" : "",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "SpreadElement":
+	        case "SpreadElementPattern":
+	        case "RestProperty": // Babel 6 for ObjectPattern
+	        case "SpreadProperty":
+	        case "SpreadPropertyPattern":
+	        case "ObjectTypeSpreadProperty":
+	        case "RestElement":
+	            return lines.concat([
+	                "...",
+	                path.call(print, "argument"),
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "FunctionDeclaration":
+	        case "FunctionExpression":
+	        case "TSDeclareFunction":
+	            if (n.declare) {
+	                parts.push("declare ");
+	            }
+	            if (n.async) {
+	                parts.push("async ");
+	            }
+	            parts.push("function");
+	            if (n.generator)
+	                parts.push("*");
+	            if (n.id) {
+	                parts.push(" ", path.call(print, "id"), path.call(print, "typeParameters"));
+	            }
+	            else {
+	                if (n.typeParameters) {
+	                    parts.push(path.call(print, "typeParameters"));
+	                }
+	            }
+	            parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+	            if (n.body) {
+	                parts.push(" ", path.call(print, "body"));
+	            }
+	            return lines.concat(parts);
+	        case "ArrowFunctionExpression":
+	            if (n.async) {
+	                parts.push("async ");
+	            }
+	            if (n.typeParameters) {
+	                parts.push(path.call(print, "typeParameters"));
+	            }
+	            if (!options.arrowParensAlways &&
+	                n.params.length === 1 &&
+	                !n.rest &&
+	                n.params[0].type === 'Identifier' &&
+	                !n.params[0].typeAnnotation &&
+	                !n.returnType) {
+	                parts.push(path.call(print, "params", 0));
+	            }
+	            else {
+	                parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+	            }
+	            parts.push(" => ", path.call(print, "body"));
+	            return lines.concat(parts);
+	        case "MethodDefinition":
+	            return printMethod(path, options, print);
+	        case "YieldExpression":
+	            parts.push("yield");
+	            if (n.delegate)
+	                parts.push("*");
+	            if (n.argument)
+	                parts.push(" ", path.call(print, "argument"));
+	            return lines.concat(parts);
+	        case "AwaitExpression":
+	            parts.push("await");
+	            if (n.all)
+	                parts.push("*");
+	            if (n.argument)
+	                parts.push(" ", path.call(print, "argument"));
+	            return lines.concat(parts);
+	        case "ModuleDeclaration":
+	            parts.push("module", path.call(print, "id"));
+	            if (n.source) {
+	                assert_1.default.ok(!n.body);
+	                parts.push("from", path.call(print, "source"));
+	            }
+	            else {
+	                parts.push(path.call(print, "body"));
+	            }
+	            return lines.fromString(" ").join(parts);
+	        case "ImportSpecifier":
+	            if (n.importKind && n.importKind !== "value") {
+	                parts.push(n.importKind + " ");
+	            }
+	            if (n.imported) {
+	                parts.push(path.call(print, "imported"));
+	                if (n.local &&
+	                    n.local.name !== n.imported.name) {
+	                    parts.push(" as ", path.call(print, "local"));
+	                }
+	            }
+	            else if (n.id) {
+	                parts.push(path.call(print, "id"));
+	                if (n.name) {
+	                    parts.push(" as ", path.call(print, "name"));
+	                }
+	            }
+	            return lines.concat(parts);
+	        case "ExportSpecifier":
+	            if (n.local) {
+	                parts.push(path.call(print, "local"));
+	                if (n.exported &&
+	                    n.exported.name !== n.local.name) {
+	                    parts.push(" as ", path.call(print, "exported"));
+	                }
+	            }
+	            else if (n.id) {
+	                parts.push(path.call(print, "id"));
+	                if (n.name) {
+	                    parts.push(" as ", path.call(print, "name"));
+	                }
+	            }
+	            return lines.concat(parts);
+	        case "ExportBatchSpecifier":
+	            return lines.fromString("*");
+	        case "ImportNamespaceSpecifier":
+	            parts.push("* as ");
+	            if (n.local) {
+	                parts.push(path.call(print, "local"));
+	            }
+	            else if (n.id) {
+	                parts.push(path.call(print, "id"));
+	            }
+	            return lines.concat(parts);
+	        case "ImportDefaultSpecifier":
+	            if (n.local) {
+	                return path.call(print, "local");
+	            }
+	            return path.call(print, "id");
+	        case "TSExportAssignment":
+	            return lines.concat(["export = ", path.call(print, "expression")]);
+	        case "ExportDeclaration":
+	        case "ExportDefaultDeclaration":
+	        case "ExportNamedDeclaration":
+	            return printExportDeclaration(path, options, print);
+	        case "ExportAllDeclaration":
+	            parts.push("export *");
+	            if (n.exported) {
+	                parts.push(" as ", path.call(print, "exported"));
+	            }
+	            parts.push(" from ", path.call(print, "source"), ";");
+	            return lines.concat(parts);
+	        case "TSNamespaceExportDeclaration":
+	            parts.push("export as namespace ", path.call(print, "id"));
+	            return maybeAddSemicolon(lines.concat(parts));
+	        case "ExportNamespaceSpecifier":
+	            return lines.concat(["* as ", path.call(print, "exported")]);
+	        case "ExportDefaultSpecifier":
+	            return path.call(print, "exported");
+	        case "Import":
+	            return lines.fromString("import", options);
+	        case "ImportDeclaration": {
+	            parts.push("import ");
+	            if (n.importKind && n.importKind !== "value") {
+	                parts.push(n.importKind + " ");
+	            }
+	            if (n.specifiers &&
+	                n.specifiers.length > 0) {
+	                var unbracedSpecifiers_1 = [];
+	                var bracedSpecifiers_1 = [];
+	                path.each(function (specifierPath) {
+	                    var spec = specifierPath.getValue();
+	                    if (spec.type === "ImportSpecifier") {
+	                        bracedSpecifiers_1.push(print(specifierPath));
+	                    }
+	                    else if (spec.type === "ImportDefaultSpecifier" ||
+	                        spec.type === "ImportNamespaceSpecifier") {
+	                        unbracedSpecifiers_1.push(print(specifierPath));
+	                    }
+	                }, "specifiers");
+	                unbracedSpecifiers_1.forEach(function (lines, i) {
+	                    if (i > 0) {
+	                        parts.push(", ");
+	                    }
+	                    parts.push(lines);
+	                });
+	                if (bracedSpecifiers_1.length > 0) {
+	                    var lines_2 = lines.fromString(", ").join(bracedSpecifiers_1);
+	                    if (lines_2.getLineLength(1) > options.wrapColumn) {
+	                        lines_2 = lines.concat([
+	                            lines.fromString(",\n").join(bracedSpecifiers_1).indent(options.tabWidth),
+	                            ","
+	                        ]);
+	                    }
+	                    if (unbracedSpecifiers_1.length > 0) {
+	                        parts.push(", ");
+	                    }
+	                    if (lines_2.length > 1) {
+	                        parts.push("{\n", lines_2, "\n}");
+	                    }
+	                    else if (options.objectCurlySpacing) {
+	                        parts.push("{ ", lines_2, " }");
+	                    }
+	                    else {
+	                        parts.push("{", lines_2, "}");
+	                    }
+	                }
+	                parts.push(" from ");
+	            }
+	            parts.push(path.call(print, "source"), ";");
+	            return lines.concat(parts);
+	        }
+	        case "BlockStatement":
+	            var naked = path.call(function (bodyPath) {
+	                return printStatementSequence(bodyPath, options, print);
+	            }, "body");
+	            if (naked.isEmpty()) {
+	                if (!n.directives || n.directives.length === 0) {
+	                    return lines.fromString("{}");
+	                }
+	            }
+	            parts.push("{\n");
+	            // Babel 6
+	            if (n.directives) {
+	                path.each(function (childPath) {
+	                    parts.push(print(childPath).indent(options.tabWidth), ";", n.directives.length > 1 || !naked.isEmpty() ? "\n" : "");
+	                }, "directives");
+	            }
+	            parts.push(naked.indent(options.tabWidth));
+	            parts.push("\n}");
+	            return lines.concat(parts);
+	        case "ReturnStatement":
+	            parts.push("return");
+	            if (n.argument) {
+	                var argLines = path.call(print, "argument");
+	                if (argLines.startsWithComment() ||
+	                    (argLines.length > 1 &&
+	                        namedTypes.JSXElement &&
+	                        namedTypes.JSXElement.check(n.argument))) {
+	                    parts.push(" (\n", argLines.indent(options.tabWidth), "\n)");
+	                }
+	                else {
+	                    parts.push(" ", argLines);
+	                }
+	            }
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "CallExpression":
+	        case "OptionalCallExpression":
+	            parts.push(path.call(print, "callee"));
+	            if (n.typeParameters) {
+	                parts.push(path.call(print, "typeParameters"));
+	            }
+	            if (n.typeArguments) {
+	                parts.push(path.call(print, "typeArguments"));
+	            }
+	            if (n.type === "OptionalCallExpression" &&
+	                n.callee.type !== "OptionalMemberExpression") {
+	                parts.push("?.");
+	            }
+	            parts.push(printArgumentsList(path, options, print));
+	            return lines.concat(parts);
+	        case "ObjectExpression":
+	        case "ObjectPattern":
+	        case "ObjectTypeAnnotation":
+	            var allowBreak = false;
+	            var isTypeAnnotation = n.type === "ObjectTypeAnnotation";
+	            var separator = options.flowObjectCommas ? "," : (isTypeAnnotation ? ";" : ",");
+	            var fields = [];
+	            if (isTypeAnnotation) {
+	                fields.push("indexers", "callProperties");
+	                if (n.internalSlots != null) {
+	                    fields.push("internalSlots");
+	                }
+	            }
+	            fields.push("properties");
+	            var len = 0;
+	            fields.forEach(function (field) {
+	                len += n[field].length;
+	            });
+	            var oneLine = (isTypeAnnotation && len === 1) || len === 0;
+	            var leftBrace = n.exact ? "{|" : "{";
+	            var rightBrace = n.exact ? "|}" : "}";
+	            parts.push(oneLine ? leftBrace : leftBrace + "\n");
+	            var leftBraceIndex = parts.length - 1;
+	            var i = 0;
+	            fields.forEach(function (field) {
+	                path.each(function (childPath) {
+	                    var lines = print(childPath);
+	                    if (!oneLine) {
+	                        lines = lines.indent(options.tabWidth);
+	                    }
+	                    var multiLine = !isTypeAnnotation && lines.length > 1;
+	                    if (multiLine && allowBreak) {
+	                        // Similar to the logic for BlockStatement.
+	                        parts.push("\n");
+	                    }
+	                    parts.push(lines);
+	                    if (i < len - 1) {
+	                        // Add an extra line break if the previous object property
+	                        // had a multi-line value.
+	                        parts.push(separator + (multiLine ? "\n\n" : "\n"));
+	                        allowBreak = !multiLine;
+	                    }
+	                    else if (len !== 1 && isTypeAnnotation) {
+	                        parts.push(separator);
+	                    }
+	                    else if (!oneLine && util.isTrailingCommaEnabled(options, "objects")) {
+	                        parts.push(separator);
+	                    }
+	                    i++;
+	                }, field);
+	            });
+	            if (n.inexact) {
+	                var line = lines.fromString("...", options);
+	                if (oneLine) {
+	                    if (len > 0) {
+	                        parts.push(separator, " ");
+	                    }
+	                    parts.push(line);
+	                }
+	                else {
+	                    // No trailing separator after ... to maintain parity with prettier.
+	                    parts.push("\n", line.indent(options.tabWidth));
+	                }
+	            }
+	            parts.push(oneLine ? rightBrace : "\n" + rightBrace);
+	            if (i !== 0 && oneLine && options.objectCurlySpacing) {
+	                parts[leftBraceIndex] = leftBrace + " ";
+	                parts[parts.length - 1] = " " + rightBrace;
+	            }
+	            if (n.typeAnnotation) {
+	                parts.push(path.call(print, "typeAnnotation"));
+	            }
+	            return lines.concat(parts);
+	        case "PropertyPattern":
+	            return lines.concat([
+	                path.call(print, "key"),
+	                ": ",
+	                path.call(print, "pattern")
+	            ]);
+	        case "ObjectProperty": // Babel 6
+	        case "Property": // Non-standard AST node type.
+	            if (n.method || n.kind === "get" || n.kind === "set") {
+	                return printMethod(path, options, print);
+	            }
+	            var key = path.call(print, "key");
+	            if (n.computed) {
+	                parts.push("[", key, "]");
+	            }
+	            else {
+	                parts.push(key);
+	            }
+	            if (!n.shorthand) {
+	                parts.push(": ", path.call(print, "value"));
+	            }
+	            return lines.concat(parts);
+	        case "ClassMethod": // Babel 6
+	        case "ObjectMethod": // Babel 6
+	        case "ClassPrivateMethod":
+	        case "TSDeclareMethod":
+	            return printMethod(path, options, print);
+	        case "PrivateName":
+	            return lines.concat(["#", path.call(print, "id")]);
+	        case "Decorator":
+	            return lines.concat(["@", path.call(print, "expression")]);
+	        case "ArrayExpression":
+	        case "ArrayPattern":
+	            var elems = n.elements, len = elems.length;
+	            var printed = path.map(print, "elements");
+	            var joined = lines.fromString(", ").join(printed);
+	            var oneLine = joined.getLineLength(1) <= options.wrapColumn;
+	            if (oneLine) {
+	                if (options.arrayBracketSpacing) {
+	                    parts.push("[ ");
+	                }
+	                else {
+	                    parts.push("[");
+	                }
+	            }
+	            else {
+	                parts.push("[\n");
+	            }
+	            path.each(function (elemPath) {
+	                var i = elemPath.getName();
+	                var elem = elemPath.getValue();
+	                if (!elem) {
+	                    // If the array expression ends with a hole, that hole
+	                    // will be ignored by the interpreter, but if it ends with
+	                    // two (or more) holes, we need to write out two (or more)
+	                    // commas so that the resulting code is interpreted with
+	                    // both (all) of the holes.
+	                    parts.push(",");
+	                }
+	                else {
+	                    var lines = printed[i];
+	                    if (oneLine) {
+	                        if (i > 0)
+	                            parts.push(" ");
+	                    }
+	                    else {
+	                        lines = lines.indent(options.tabWidth);
+	                    }
+	                    parts.push(lines);
+	                    if (i < len - 1 || (!oneLine && util.isTrailingCommaEnabled(options, "arrays")))
+	                        parts.push(",");
+	                    if (!oneLine)
+	                        parts.push("\n");
+	                }
+	            }, "elements");
+	            if (oneLine && options.arrayBracketSpacing) {
+	                parts.push(" ]");
+	            }
+	            else {
+	                parts.push("]");
+	            }
+	            return lines.concat(parts);
+	        case "SequenceExpression":
+	            return lines.fromString(", ").join(path.map(print, "expressions"));
+	        case "ThisExpression":
+	            return lines.fromString("this");
+	        case "Super":
+	            return lines.fromString("super");
+	        case "NullLiteral": // Babel 6 Literal split
+	            return lines.fromString("null");
+	        case "RegExpLiteral": // Babel 6 Literal split
+	            return lines.fromString(n.extra.raw);
+	        case "BigIntLiteral": // Babel 7 Literal split
+	            return lines.fromString(n.value + "n");
+	        case "NumericLiteral": // Babel 6 Literal Split
+	            // Keep original representation for numeric values not in base 10.
+	            if (n.extra &&
+	                typeof n.extra.raw === "string" &&
+	                Number(n.extra.raw) === n.value) {
+	                return lines.fromString(n.extra.raw, options);
+	            }
+	            return lines.fromString(n.value, options);
+	        case "BooleanLiteral": // Babel 6 Literal split
+	        case "StringLiteral": // Babel 6 Literal split
+	        case "Literal":
+	            // Numeric values may be in bases other than 10. Use their raw
+	            // representation if equivalent.
+	            if (typeof n.value === "number" &&
+	                typeof n.raw === "string" &&
+	                Number(n.raw) === n.value) {
+	                return lines.fromString(n.raw, options);
+	            }
+	            if (typeof n.value !== "string") {
+	                return lines.fromString(n.value, options);
+	            }
+	            return lines.fromString(nodeStr(n.value, options), options);
+	        case "Directive": // Babel 6
+	            return path.call(print, "value");
+	        case "DirectiveLiteral": // Babel 6
+	            return lines.fromString(nodeStr(n.value, options));
+	        case "InterpreterDirective":
+	            return lines.fromString("#!" + n.value + "\n", options);
+	        case "ModuleSpecifier":
+	            if (n.local) {
+	                throw new Error("The ESTree ModuleSpecifier type should be abstract");
+	            }
+	            // The Esprima ModuleSpecifier type is just a string-valued
+	            // Literal identifying the imported-from module.
+	            return lines.fromString(nodeStr(n.value, options), options);
+	        case "UnaryExpression":
+	            parts.push(n.operator);
+	            if (/[a-z]$/.test(n.operator))
+	                parts.push(" ");
+	            parts.push(path.call(print, "argument"));
+	            return lines.concat(parts);
+	        case "UpdateExpression":
+	            parts.push(path.call(print, "argument"), n.operator);
+	            if (n.prefix)
+	                parts.reverse();
+	            return lines.concat(parts);
+	        case "ConditionalExpression":
+	            return lines.concat([
+	                path.call(print, "test"),
+	                " ? ", path.call(print, "consequent"),
+	                " : ", path.call(print, "alternate")
+	            ]);
+	        case "NewExpression":
+	            parts.push("new ", path.call(print, "callee"));
+	            if (n.typeParameters) {
+	                parts.push(path.call(print, "typeParameters"));
+	            }
+	            if (n.typeArguments) {
+	                parts.push(path.call(print, "typeArguments"));
+	            }
+	            var args = n.arguments;
+	            if (args) {
+	                parts.push(printArgumentsList(path, options, print));
+	            }
+	            return lines.concat(parts);
+	        case "VariableDeclaration":
+	            if (n.declare) {
+	                parts.push("declare ");
+	            }
+	            parts.push(n.kind, " ");
+	            var maxLen = 0;
+	            var printed = path.map(function (childPath) {
+	                var lines = print(childPath);
+	                maxLen = Math.max(lines.length, maxLen);
+	                return lines;
+	            }, "declarations");
+	            if (maxLen === 1) {
+	                parts.push(lines.fromString(", ").join(printed));
+	            }
+	            else if (printed.length > 1) {
+	                parts.push(lines.fromString(",\n").join(printed)
+	                    .indentTail(n.kind.length + 1));
+	            }
+	            else {
+	                parts.push(printed[0]);
+	            }
+	            // We generally want to terminate all variable declarations with a
+	            // semicolon, except when they are children of for loops.
+	            var parentNode = path.getParentNode();
+	            if (!namedTypes.ForStatement.check(parentNode) &&
+	                !namedTypes.ForInStatement.check(parentNode) &&
+	                !(namedTypes.ForOfStatement &&
+	                    namedTypes.ForOfStatement.check(parentNode)) &&
+	                !(namedTypes.ForAwaitStatement &&
+	                    namedTypes.ForAwaitStatement.check(parentNode))) {
+	                parts.push(";");
+	            }
+	            return lines.concat(parts);
+	        case "VariableDeclarator":
+	            return n.init ? lines.fromString(" = ").join([
+	                path.call(print, "id"),
+	                path.call(print, "init")
+	            ]) : path.call(print, "id");
+	        case "WithStatement":
+	            return lines.concat([
+	                "with (",
+	                path.call(print, "object"),
+	                ") ",
+	                path.call(print, "body")
+	            ]);
+	        case "IfStatement":
+	            var con = adjustClause(path.call(print, "consequent"), options);
+	            parts.push("if (", path.call(print, "test"), ")", con);
+	            if (n.alternate)
+	                parts.push(endsWithBrace(con) ? " else" : "\nelse", adjustClause(path.call(print, "alternate"), options));
+	            return lines.concat(parts);
+	        case "ForStatement":
+	            // TODO Get the for (;;) case right.
+	            var init = path.call(print, "init"), sep = init.length > 1 ? ";\n" : "; ", forParen = "for (", indented = lines.fromString(sep).join([
+	                init,
+	                path.call(print, "test"),
+	                path.call(print, "update")
+	            ]).indentTail(forParen.length), head = lines.concat([forParen, indented, ")"]), clause = adjustClause(path.call(print, "body"), options);
+	            parts.push(head);
+	            if (head.length > 1) {
+	                parts.push("\n");
+	                clause = clause.trimLeft();
+	            }
+	            parts.push(clause);
+	            return lines.concat(parts);
+	        case "WhileStatement":
+	            return lines.concat([
+	                "while (",
+	                path.call(print, "test"),
+	                ")",
+	                adjustClause(path.call(print, "body"), options)
+	            ]);
+	        case "ForInStatement":
+	            // Note: esprima can't actually parse "for each (".
+	            return lines.concat([
+	                n.each ? "for each (" : "for (",
+	                path.call(print, "left"),
+	                " in ",
+	                path.call(print, "right"),
+	                ")",
+	                adjustClause(path.call(print, "body"), options)
+	            ]);
+	        case "ForOfStatement":
+	        case "ForAwaitStatement":
+	            parts.push("for ");
+	            if (n.await || n.type === "ForAwaitStatement") {
+	                parts.push("await ");
+	            }
+	            parts.push("(", path.call(print, "left"), " of ", path.call(print, "right"), ")", adjustClause(path.call(print, "body"), options));
+	            return lines.concat(parts);
+	        case "DoWhileStatement":
+	            var doBody = lines.concat([
+	                "do",
+	                adjustClause(path.call(print, "body"), options)
+	            ]);
+	            parts.push(doBody);
+	            if (endsWithBrace(doBody))
+	                parts.push(" while");
+	            else
+	                parts.push("\nwhile");
+	            parts.push(" (", path.call(print, "test"), ");");
+	            return lines.concat(parts);
+	        case "DoExpression":
+	            var statements = path.call(function (bodyPath) {
+	                return printStatementSequence(bodyPath, options, print);
+	            }, "body");
+	            return lines.concat([
+	                "do {\n",
+	                statements.indent(options.tabWidth),
+	                "\n}"
+	            ]);
+	        case "BreakStatement":
+	            parts.push("break");
+	            if (n.label)
+	                parts.push(" ", path.call(print, "label"));
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "ContinueStatement":
+	            parts.push("continue");
+	            if (n.label)
+	                parts.push(" ", path.call(print, "label"));
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "LabeledStatement":
+	            return lines.concat([
+	                path.call(print, "label"),
+	                ":\n",
+	                path.call(print, "body")
+	            ]);
+	        case "TryStatement":
+	            parts.push("try ", path.call(print, "block"));
+	            if (n.handler) {
+	                parts.push(" ", path.call(print, "handler"));
+	            }
+	            else if (n.handlers) {
+	                path.each(function (handlerPath) {
+	                    parts.push(" ", print(handlerPath));
+	                }, "handlers");
+	            }
+	            if (n.finalizer) {
+	                parts.push(" finally ", path.call(print, "finalizer"));
+	            }
+	            return lines.concat(parts);
+	        case "CatchClause":
+	            parts.push("catch ");
+	            if (n.param) {
+	                parts.push("(", path.call(print, "param"));
+	            }
+	            if (n.guard) {
+	                // Note: esprima does not recognize conditional catch clauses.
+	                parts.push(" if ", path.call(print, "guard"));
+	            }
+	            if (n.param) {
+	                parts.push(") ");
+	            }
+	            parts.push(path.call(print, "body"));
+	            return lines.concat(parts);
+	        case "ThrowStatement":
+	            return lines.concat(["throw ", path.call(print, "argument"), ";"]);
+	        case "SwitchStatement":
+	            return lines.concat([
+	                "switch (",
+	                path.call(print, "discriminant"),
+	                ") {\n",
+	                lines.fromString("\n").join(path.map(print, "cases")),
+	                "\n}"
+	            ]);
+	        // Note: ignoring n.lexical because it has no printing consequences.
+	        case "SwitchCase":
+	            if (n.test)
+	                parts.push("case ", path.call(print, "test"), ":");
+	            else
+	                parts.push("default:");
+	            if (n.consequent.length > 0) {
+	                parts.push("\n", path.call(function (consequentPath) {
+	                    return printStatementSequence(consequentPath, options, print);
+	                }, "consequent").indent(options.tabWidth));
+	            }
+	            return lines.concat(parts);
+	        case "DebuggerStatement":
+	            return lines.fromString("debugger;");
+	        // JSX extensions below.
+	        case "JSXAttribute":
+	            parts.push(path.call(print, "name"));
+	            if (n.value)
+	                parts.push("=", path.call(print, "value"));
+	            return lines.concat(parts);
+	        case "JSXIdentifier":
+	            return lines.fromString(n.name, options);
+	        case "JSXNamespacedName":
+	            return lines.fromString(":").join([
+	                path.call(print, "namespace"),
+	                path.call(print, "name")
+	            ]);
+	        case "JSXMemberExpression":
+	            return lines.fromString(".").join([
+	                path.call(print, "object"),
+	                path.call(print, "property")
+	            ]);
+	        case "JSXSpreadAttribute":
+	            return lines.concat(["{...", path.call(print, "argument"), "}"]);
+	        case "JSXSpreadChild":
+	            return lines.concat(["{...", path.call(print, "expression"), "}"]);
+	        case "JSXExpressionContainer":
+	            return lines.concat(["{", path.call(print, "expression"), "}"]);
+	        case "JSXElement":
+	        case "JSXFragment":
+	            var openingPropName = "opening" + (n.type === "JSXElement" ? "Element" : "Fragment");
+	            var closingPropName = "closing" + (n.type === "JSXElement" ? "Element" : "Fragment");
+	            var openingLines = path.call(print, openingPropName);
+	            if (n[openingPropName].selfClosing) {
+	                assert_1.default.ok(!n[closingPropName], "unexpected " + closingPropName + " element in self-closing " + n.type);
+	                return openingLines;
+	            }
+	            var childLines = lines.concat(path.map(function (childPath) {
+	                var child = childPath.getValue();
+	                if (namedTypes.Literal.check(child) &&
+	                    typeof child.value === "string") {
+	                    if (/\S/.test(child.value)) {
+	                        return child.value.replace(/^\s+|\s+$/g, "");
+	                    }
+	                    else if (/\n/.test(child.value)) {
+	                        return "\n";
+	                    }
+	                }
+	                return print(childPath);
+	            }, "children")).indentTail(options.tabWidth);
+	            var closingLines = path.call(print, closingPropName);
+	            return lines.concat([
+	                openingLines,
+	                childLines,
+	                closingLines
+	            ]);
+	        case "JSXOpeningElement":
+	            parts.push("<", path.call(print, "name"));
+	            var attrParts = [];
+	            path.each(function (attrPath) {
+	                attrParts.push(" ", print(attrPath));
+	            }, "attributes");
+	            var attrLines = lines.concat(attrParts);
+	            var needLineWrap = (attrLines.length > 1 ||
+	                attrLines.getLineLength(1) > options.wrapColumn);
+	            if (needLineWrap) {
+	                attrParts.forEach(function (part, i) {
+	                    if (part === " ") {
+	                        assert_1.default.strictEqual(i % 2, 0);
+	                        attrParts[i] = "\n";
+	                    }
+	                });
+	                attrLines = lines.concat(attrParts).indentTail(options.tabWidth);
+	            }
+	            parts.push(attrLines, n.selfClosing ? " />" : ">");
+	            return lines.concat(parts);
+	        case "JSXClosingElement":
+	            return lines.concat(["</", path.call(print, "name"), ">"]);
+	        case "JSXOpeningFragment":
+	            return lines.fromString("<>");
+	        case "JSXClosingFragment":
+	            return lines.fromString("</>");
+	        case "JSXText":
+	            return lines.fromString(n.value, options);
+	        case "JSXEmptyExpression":
+	            return lines.fromString("");
+	        case "TypeAnnotatedIdentifier":
+	            return lines.concat([
+	                path.call(print, "annotation"),
+	                " ",
+	                path.call(print, "identifier")
+	            ]);
+	        case "ClassBody":
+	            if (n.body.length === 0) {
+	                return lines.fromString("{}");
+	            }
+	            return lines.concat([
+	                "{\n",
+	                path.call(function (bodyPath) {
+	                    return printStatementSequence(bodyPath, options, print);
+	                }, "body").indent(options.tabWidth),
+	                "\n}"
+	            ]);
+	        case "ClassPropertyDefinition":
+	            parts.push("static ", path.call(print, "definition"));
+	            if (!namedTypes.MethodDefinition.check(n.definition))
+	                parts.push(";");
+	            return lines.concat(parts);
+	        case "ClassProperty":
+	            var access = n.accessibility || n.access;
+	            if (typeof access === "string") {
+	                parts.push(access, " ");
+	            }
+	            if (n.static) {
+	                parts.push("static ");
+	            }
+	            if (n.abstract) {
+	                parts.push("abstract ");
+	            }
+	            if (n.readonly) {
+	                parts.push("readonly ");
+	            }
+	            var key = path.call(print, "key");
+	            if (n.computed) {
+	                key = lines.concat(["[", key, "]"]);
+	            }
+	            if (n.variance) {
+	                key = lines.concat([printVariance(path, print), key]);
+	            }
+	            parts.push(key);
+	            if (n.optional) {
+	                parts.push("?");
+	            }
+	            if (n.typeAnnotation) {
+	                parts.push(path.call(print, "typeAnnotation"));
+	            }
+	            if (n.value) {
+	                parts.push(" = ", path.call(print, "value"));
+	            }
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "ClassPrivateProperty":
+	            if (n.static) {
+	                parts.push("static ");
+	            }
+	            parts.push(path.call(print, "key"));
+	            if (n.typeAnnotation) {
+	                parts.push(path.call(print, "typeAnnotation"));
+	            }
+	            if (n.value) {
+	                parts.push(" = ", path.call(print, "value"));
+	            }
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "ClassDeclaration":
+	        case "ClassExpression":
+	            if (n.declare) {
+	                parts.push("declare ");
+	            }
+	            if (n.abstract) {
+	                parts.push("abstract ");
+	            }
+	            parts.push("class");
+	            if (n.id) {
+	                parts.push(" ", path.call(print, "id"));
+	            }
+	            if (n.typeParameters) {
+	                parts.push(path.call(print, "typeParameters"));
+	            }
+	            if (n.superClass) {
+	                parts.push(" extends ", path.call(print, "superClass"), path.call(print, "superTypeParameters"));
+	            }
+	            if (n["implements"] && n['implements'].length > 0) {
+	                parts.push(" implements ", lines.fromString(", ").join(path.map(print, "implements")));
+	            }
+	            parts.push(" ", path.call(print, "body"));
+	            return lines.concat(parts);
+	        case "TemplateElement":
+	            return lines.fromString(n.value.raw, options).lockIndentTail();
+	        case "TemplateLiteral":
+	            var expressions = path.map(print, "expressions");
+	            parts.push("`");
+	            path.each(function (childPath) {
+	                var i = childPath.getName();
+	                parts.push(print(childPath));
+	                if (i < expressions.length) {
+	                    parts.push("${", expressions[i], "}");
+	                }
+	            }, "quasis");
+	            parts.push("`");
+	            return lines.concat(parts).lockIndentTail();
+	        case "TaggedTemplateExpression":
+	            return lines.concat([
+	                path.call(print, "tag"),
+	                path.call(print, "quasi")
+	            ]);
+	        // These types are unprintable because they serve as abstract
+	        // supertypes for other (printable) types.
+	        case "Node":
+	        case "Printable":
+	        case "SourceLocation":
+	        case "Position":
+	        case "Statement":
+	        case "Function":
+	        case "Pattern":
+	        case "Expression":
+	        case "Declaration":
+	        case "Specifier":
+	        case "NamedSpecifier":
+	        case "Comment": // Supertype of Block and Line
+	        case "Flow": // Supertype of all Flow AST node types
+	        case "FlowType": // Supertype of all Flow types
+	        case "FlowPredicate": // Supertype of InferredPredicate and DeclaredPredicate
+	        case "MemberTypeAnnotation": // Flow
+	        case "Type": // Flow
+	        case "TSHasOptionalTypeParameterInstantiation":
+	        case "TSHasOptionalTypeParameters":
+	        case "TSHasOptionalTypeAnnotation":
+	            throw new Error("unprintable type: " + JSON.stringify(n.type));
+	        case "CommentBlock": // Babel block comment.
+	        case "Block": // Esprima block comment.
+	            return lines.concat(["/*", lines.fromString(n.value, options), "*/"]);
+	        case "CommentLine": // Babel line comment.
+	        case "Line": // Esprima line comment.
+	            return lines.concat(["//", lines.fromString(n.value, options)]);
+	        // Type Annotations for Facebook Flow, typically stripped out or
+	        // transformed away before printing.
+	        case "TypeAnnotation":
+	            if (n.typeAnnotation) {
+	                if (n.typeAnnotation.type !== "FunctionTypeAnnotation") {
+	                    parts.push(": ");
+	                }
+	                parts.push(path.call(print, "typeAnnotation"));
+	                return lines.concat(parts);
+	            }
+	            return lines.fromString("");
+	        case "ExistentialTypeParam":
+	        case "ExistsTypeAnnotation":
+	            return lines.fromString("*", options);
+	        case "EmptyTypeAnnotation":
+	            return lines.fromString("empty", options);
+	        case "AnyTypeAnnotation":
+	            return lines.fromString("any", options);
+	        case "MixedTypeAnnotation":
+	            return lines.fromString("mixed", options);
+	        case "ArrayTypeAnnotation":
+	            return lines.concat([
+	                path.call(print, "elementType"),
+	                "[]"
+	            ]);
+	        case "TupleTypeAnnotation":
+	            var printed = path.map(print, "types");
+	            var joined = lines.fromString(", ").join(printed);
+	            var oneLine = joined.getLineLength(1) <= options.wrapColumn;
+	            if (oneLine) {
+	                if (options.arrayBracketSpacing) {
+	                    parts.push("[ ");
+	                }
+	                else {
+	                    parts.push("[");
+	                }
+	            }
+	            else {
+	                parts.push("[\n");
+	            }
+	            path.each(function (elemPath) {
+	                var i = elemPath.getName();
+	                var elem = elemPath.getValue();
+	                if (!elem) {
+	                    // If the array expression ends with a hole, that hole
+	                    // will be ignored by the interpreter, but if it ends with
+	                    // two (or more) holes, we need to write out two (or more)
+	                    // commas so that the resulting code is interpreted with
+	                    // both (all) of the holes.
+	                    parts.push(",");
+	                }
+	                else {
+	                    var lines = printed[i];
+	                    if (oneLine) {
+	                        if (i > 0)
+	                            parts.push(" ");
+	                    }
+	                    else {
+	                        lines = lines.indent(options.tabWidth);
+	                    }
+	                    parts.push(lines);
+	                    if (i < n.types.length - 1 || (!oneLine && util.isTrailingCommaEnabled(options, "arrays")))
+	                        parts.push(",");
+	                    if (!oneLine)
+	                        parts.push("\n");
+	                }
+	            }, "types");
+	            if (oneLine && options.arrayBracketSpacing) {
+	                parts.push(" ]");
+	            }
+	            else {
+	                parts.push("]");
+	            }
+	            return lines.concat(parts);
+	        case "BooleanTypeAnnotation":
+	            return lines.fromString("boolean", options);
+	        case "BooleanLiteralTypeAnnotation":
+	            assert_1.default.strictEqual(typeof n.value, "boolean");
+	            return lines.fromString("" + n.value, options);
+	        case "InterfaceTypeAnnotation":
+	            parts.push("interface");
+	            if (n.extends && n.extends.length > 0) {
+	                parts.push(" extends ", lines.fromString(", ").join(path.map(print, "extends")));
+	            }
+	            parts.push(" ", path.call(print, "body"));
+	            return lines.concat(parts);
+	        case "DeclareClass":
+	            return printFlowDeclaration(path, [
+	                "class ",
+	                path.call(print, "id"),
+	                " ",
+	                path.call(print, "body"),
+	            ]);
+	        case "DeclareFunction":
+	            return printFlowDeclaration(path, [
+	                "function ",
+	                path.call(print, "id"),
+	                ";"
+	            ]);
+	        case "DeclareModule":
+	            return printFlowDeclaration(path, [
+	                "module ",
+	                path.call(print, "id"),
+	                " ",
+	                path.call(print, "body"),
+	            ]);
+	        case "DeclareModuleExports":
+	            return printFlowDeclaration(path, [
+	                "module.exports",
+	                path.call(print, "typeAnnotation"),
+	            ]);
+	        case "DeclareVariable":
+	            return printFlowDeclaration(path, [
+	                "var ",
+	                path.call(print, "id"),
+	                ";"
+	            ]);
+	        case "DeclareExportDeclaration":
+	        case "DeclareExportAllDeclaration":
+	            return lines.concat([
+	                "declare ",
+	                printExportDeclaration(path, options, print)
+	            ]);
+	        case "InferredPredicate":
+	            return lines.fromString("%checks", options);
+	        case "DeclaredPredicate":
+	            return lines.concat([
+	                "%checks(",
+	                path.call(print, "value"),
+	                ")"
+	            ]);
+	        case "FunctionTypeAnnotation":
+	            // FunctionTypeAnnotation is ambiguous:
+	            // declare function(a: B): void; OR
+	            // var A: (a: B) => void;
+	            var parent = path.getParentNode(0);
+	            var isArrowFunctionTypeAnnotation = !(namedTypes.ObjectTypeCallProperty.check(parent) ||
+	                (namedTypes.ObjectTypeInternalSlot.check(parent) && parent.method) ||
+	                namedTypes.DeclareFunction.check(path.getParentNode(2)));
+	            var needsColon = isArrowFunctionTypeAnnotation &&
+	                !namedTypes.FunctionTypeParam.check(parent);
+	            if (needsColon) {
+	                parts.push(": ");
+	            }
+	            parts.push("(", printFunctionParams(path, options, print), ")");
+	            // The returnType is not wrapped in a TypeAnnotation, so the colon
+	            // needs to be added separately.
+	            if (n.returnType) {
+	                parts.push(isArrowFunctionTypeAnnotation ? " => " : ": ", path.call(print, "returnType"));
+	            }
+	            return lines.concat(parts);
+	        case "FunctionTypeParam":
+	            return lines.concat([
+	                path.call(print, "name"),
+	                n.optional ? '?' : '',
+	                ": ",
+	                path.call(print, "typeAnnotation"),
+	            ]);
+	        case "GenericTypeAnnotation":
+	            return lines.concat([
+	                path.call(print, "id"),
+	                path.call(print, "typeParameters")
+	            ]);
+	        case "DeclareInterface":
+	            parts.push("declare ");
+	        // Fall through to InterfaceDeclaration...
+	        case "InterfaceDeclaration":
+	        case "TSInterfaceDeclaration":
+	            if (n.declare) {
+	                parts.push("declare ");
+	            }
+	            parts.push("interface ", path.call(print, "id"), path.call(print, "typeParameters"), " ");
+	            if (n["extends"] && n["extends"].length > 0) {
+	                parts.push("extends ", lines.fromString(", ").join(path.map(print, "extends")), " ");
+	            }
+	            if (n.body) {
+	                parts.push(path.call(print, "body"));
+	            }
+	            return lines.concat(parts);
+	        case "ClassImplements":
+	        case "InterfaceExtends":
+	            return lines.concat([
+	                path.call(print, "id"),
+	                path.call(print, "typeParameters")
+	            ]);
+	        case "IntersectionTypeAnnotation":
+	            return lines.fromString(" & ").join(path.map(print, "types"));
+	        case "NullableTypeAnnotation":
+	            return lines.concat([
+	                "?",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "NullLiteralTypeAnnotation":
+	            return lines.fromString("null", options);
+	        case "ThisTypeAnnotation":
+	            return lines.fromString("this", options);
+	        case "NumberTypeAnnotation":
+	            return lines.fromString("number", options);
+	        case "ObjectTypeCallProperty":
+	            return path.call(print, "value");
+	        case "ObjectTypeIndexer":
+	            return lines.concat([
+	                printVariance(path, print),
+	                "[",
+	                path.call(print, "id"),
+	                ": ",
+	                path.call(print, "key"),
+	                "]: ",
+	                path.call(print, "value")
+	            ]);
+	        case "ObjectTypeProperty":
+	            return lines.concat([
+	                printVariance(path, print),
+	                path.call(print, "key"),
+	                n.optional ? "?" : "",
+	                ": ",
+	                path.call(print, "value")
+	            ]);
+	        case "ObjectTypeInternalSlot":
+	            return lines.concat([
+	                n.static ? "static " : "",
+	                "[[",
+	                path.call(print, "id"),
+	                "]]",
+	                n.optional ? "?" : "",
+	                n.value.type !== "FunctionTypeAnnotation" ? ": " : "",
+	                path.call(print, "value")
+	            ]);
+	        case "QualifiedTypeIdentifier":
+	            return lines.concat([
+	                path.call(print, "qualification"),
+	                ".",
+	                path.call(print, "id")
+	            ]);
+	        case "StringLiteralTypeAnnotation":
+	            return lines.fromString(nodeStr(n.value, options), options);
+	        case "NumberLiteralTypeAnnotation":
+	        case "NumericLiteralTypeAnnotation":
+	            assert_1.default.strictEqual(typeof n.value, "number");
+	            return lines.fromString(JSON.stringify(n.value), options);
+	        case "StringTypeAnnotation":
+	            return lines.fromString("string", options);
+	        case "DeclareTypeAlias":
+	            parts.push("declare ");
+	        // Fall through to TypeAlias...
+	        case "TypeAlias":
+	            return lines.concat([
+	                "type ",
+	                path.call(print, "id"),
+	                path.call(print, "typeParameters"),
+	                " = ",
+	                path.call(print, "right"),
+	                ";"
+	            ]);
+	        case "DeclareOpaqueType":
+	            parts.push("declare ");
+	        // Fall through to OpaqueType...
+	        case "OpaqueType":
+	            parts.push("opaque type ", path.call(print, "id"), path.call(print, "typeParameters"));
+	            if (n["supertype"]) {
+	                parts.push(": ", path.call(print, "supertype"));
+	            }
+	            if (n["impltype"]) {
+	                parts.push(" = ", path.call(print, "impltype"));
+	            }
+	            parts.push(";");
+	            return lines.concat(parts);
+	        case "TypeCastExpression":
+	            return lines.concat([
+	                "(",
+	                path.call(print, "expression"),
+	                path.call(print, "typeAnnotation"),
+	                ")"
+	            ]);
+	        case "TypeParameterDeclaration":
+	        case "TypeParameterInstantiation":
+	            return lines.concat([
+	                "<",
+	                lines.fromString(", ").join(path.map(print, "params")),
+	                ">"
+	            ]);
+	        case "Variance":
+	            if (n.kind === "plus") {
+	                return lines.fromString("+");
+	            }
+	            if (n.kind === "minus") {
+	                return lines.fromString("-");
+	            }
+	            return lines.fromString("");
+	        case "TypeParameter":
+	            if (n.variance) {
+	                parts.push(printVariance(path, print));
+	            }
+	            parts.push(path.call(print, 'name'));
+	            if (n.bound) {
+	                parts.push(path.call(print, 'bound'));
+	            }
+	            if (n['default']) {
+	                parts.push('=', path.call(print, 'default'));
+	            }
+	            return lines.concat(parts);
+	        case "TypeofTypeAnnotation":
+	            return lines.concat([
+	                lines.fromString("typeof ", options),
+	                path.call(print, "argument")
+	            ]);
+	        case "UnionTypeAnnotation":
+	            return lines.fromString(" | ").join(path.map(print, "types"));
+	        case "VoidTypeAnnotation":
+	            return lines.fromString("void", options);
+	        case "NullTypeAnnotation":
+	            return lines.fromString("null", options);
+	        // Type Annotations for TypeScript (when using Babylon as parser)
+	        case "TSType":
+	            throw new Error("unprintable type: " + JSON.stringify(n.type));
+	        case "TSNumberKeyword":
+	            return lines.fromString("number", options);
+	        case "TSBigIntKeyword":
+	            return lines.fromString("bigint", options);
+	        case "TSObjectKeyword":
+	            return lines.fromString("object", options);
+	        case "TSBooleanKeyword":
+	            return lines.fromString("boolean", options);
+	        case "TSStringKeyword":
+	            return lines.fromString("string", options);
+	        case "TSSymbolKeyword":
+	            return lines.fromString("symbol", options);
+	        case "TSAnyKeyword":
+	            return lines.fromString("any", options);
+	        case "TSVoidKeyword":
+	            return lines.fromString("void", options);
+	        case "TSThisType":
+	            return lines.fromString("this", options);
+	        case "TSNullKeyword":
+	            return lines.fromString("null", options);
+	        case "TSUndefinedKeyword":
+	            return lines.fromString("undefined", options);
+	        case "TSUnknownKeyword":
+	            return lines.fromString("unknown", options);
+	        case "TSNeverKeyword":
+	            return lines.fromString("never", options);
+	        case "TSArrayType":
+	            return lines.concat([
+	                path.call(print, "elementType"),
+	                "[]"
+	            ]);
+	        case "TSLiteralType":
+	            return path.call(print, "literal");
+	        case "TSUnionType":
+	            return lines.fromString(" | ").join(path.map(print, "types"));
+	        case "TSIntersectionType":
+	            return lines.fromString(" & ").join(path.map(print, "types"));
+	        case "TSConditionalType":
+	            parts.push(path.call(print, "checkType"), " extends ", path.call(print, "extendsType"), " ? ", path.call(print, "trueType"), " : ", path.call(print, "falseType"));
+	            return lines.concat(parts);
+	        case "TSInferType":
+	            parts.push("infer ", path.call(print, "typeParameter"));
+	            return lines.concat(parts);
+	        case "TSParenthesizedType":
+	            return lines.concat([
+	                "(",
+	                path.call(print, "typeAnnotation"),
+	                ")"
+	            ]);
+	        case "TSFunctionType":
+	        case "TSConstructorType":
+	            return lines.concat([
+	                path.call(print, "typeParameters"),
+	                "(",
+	                printFunctionParams(path, options, print),
+	                ")",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "TSMappedType": {
+	            parts.push(n.readonly ? "readonly " : "", "[", path.call(print, "typeParameter"), "]", n.optional ? "?" : "");
+	            if (n.typeAnnotation) {
+	                parts.push(": ", path.call(print, "typeAnnotation"), ";");
+	            }
+	            return lines.concat([
+	                "{\n",
+	                lines.concat(parts).indent(options.tabWidth),
+	                "\n}",
+	            ]);
+	        }
+	        case "TSTupleType":
+	            return lines.concat([
+	                "[",
+	                lines.fromString(", ").join(path.map(print, "elementTypes")),
+	                "]"
+	            ]);
+	        case "TSRestType":
+	            return lines.concat([
+	                "...",
+	                path.call(print, "typeAnnotation"),
+	                "[]"
+	            ]);
+	        case "TSOptionalType":
+	            return lines.concat([
+	                path.call(print, "typeAnnotation"),
+	                "?"
+	            ]);
+	        case "TSIndexedAccessType":
+	            return lines.concat([
+	                path.call(print, "objectType"),
+	                "[",
+	                path.call(print, "indexType"),
+	                "]"
+	            ]);
+	        case "TSTypeOperator":
+	            return lines.concat([
+	                path.call(print, "operator"),
+	                " ",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "TSTypeLiteral": {
+	            var memberLines_1 = lines.fromString(",\n").join(path.map(print, "members"));
+	            if (memberLines_1.isEmpty()) {
+	                return lines.fromString("{}", options);
+	            }
+	            parts.push("{\n", memberLines_1.indent(options.tabWidth), "\n}");
+	            return lines.concat(parts);
+	        }
+	        case "TSEnumMember":
+	            parts.push(path.call(print, "id"));
+	            if (n.initializer) {
+	                parts.push(" = ", path.call(print, "initializer"));
+	            }
+	            return lines.concat(parts);
+	        case "TSTypeQuery":
+	            return lines.concat([
+	                "typeof ",
+	                path.call(print, "exprName"),
+	            ]);
+	        case "TSParameterProperty":
+	            if (n.accessibility) {
+	                parts.push(n.accessibility, " ");
+	            }
+	            if (n.export) {
+	                parts.push("export ");
+	            }
+	            if (n.static) {
+	                parts.push("static ");
+	            }
+	            if (n.readonly) {
+	                parts.push("readonly ");
+	            }
+	            parts.push(path.call(print, "parameter"));
+	            return lines.concat(parts);
+	        case "TSTypeReference":
+	            return lines.concat([
+	                path.call(print, "typeName"),
+	                path.call(print, "typeParameters")
+	            ]);
+	        case "TSQualifiedName":
+	            return lines.concat([
+	                path.call(print, "left"),
+	                ".",
+	                path.call(print, "right")
+	            ]);
+	        case "TSAsExpression": {
+	            var withParens = n.extra && n.extra.parenthesized === true;
+	            if (withParens)
+	                parts.push("(");
+	            parts.push(path.call(print, "expression"), lines.fromString(" as "), path.call(print, "typeAnnotation"));
+	            if (withParens)
+	                parts.push(")");
+	            return lines.concat(parts);
+	        }
+	        case "TSNonNullExpression":
+	            return lines.concat([
+	                path.call(print, "expression"),
+	                "!"
+	            ]);
+	        case "TSTypeAnnotation": {
+	            // similar to flow's FunctionTypeAnnotation, this can be
+	            // ambiguous: it can be prefixed by => or :
+	            // in a type predicate, it takes the for u is U
+	            var parent = path.getParentNode(0);
+	            var prefix = ": ";
+	            if (namedTypes.TSFunctionType.check(parent)) {
+	                prefix = " => ";
+	            }
+	            if (namedTypes.TSTypePredicate.check(parent)) {
+	                prefix = " is ";
+	            }
+	            return lines.concat([
+	                prefix,
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        }
+	        case "TSIndexSignature":
+	            return lines.concat([
+	                n.readonly ? "readonly " : "",
+	                "[",
+	                path.map(print, "parameters"),
+	                "]",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "TSPropertySignature":
+	            parts.push(printVariance(path, print), n.readonly ? "readonly " : "");
+	            if (n.computed) {
+	                parts.push("[", path.call(print, "key"), "]");
+	            }
+	            else {
+	                parts.push(path.call(print, "key"));
+	            }
+	            parts.push(n.optional ? "?" : "", path.call(print, "typeAnnotation"));
+	            return lines.concat(parts);
+	        case "TSMethodSignature":
+	            if (n.computed) {
+	                parts.push("[", path.call(print, "key"), "]");
+	            }
+	            else {
+	                parts.push(path.call(print, "key"));
+	            }
+	            if (n.optional) {
+	                parts.push("?");
+	            }
+	            parts.push(path.call(print, "typeParameters"), "(", printFunctionParams(path, options, print), ")", path.call(print, "typeAnnotation"));
+	            return lines.concat(parts);
+	        case "TSTypePredicate":
+	            return lines.concat([
+	                path.call(print, "parameterName"),
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "TSCallSignatureDeclaration":
+	            return lines.concat([
+	                path.call(print, "typeParameters"),
+	                "(",
+	                printFunctionParams(path, options, print),
+	                ")",
+	                path.call(print, "typeAnnotation")
+	            ]);
+	        case "TSConstructSignatureDeclaration":
+	            if (n.typeParameters) {
+	                parts.push("new", path.call(print, "typeParameters"));
+	            }
+	            else {
+	                parts.push("new ");
+	            }
+	            parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "typeAnnotation"));
+	            return lines.concat(parts);
+	        case "TSTypeAliasDeclaration":
+	            return lines.concat([
+	                n.declare ? "declare " : "",
+	                "type ",
+	                path.call(print, "id"),
+	                path.call(print, "typeParameters"),
+	                " = ",
+	                path.call(print, "typeAnnotation"),
+	                ";"
+	            ]);
+	        case "TSTypeParameter":
+	            parts.push(path.call(print, "name"));
+	            // ambiguous because of TSMappedType
+	            var parent = path.getParentNode(0);
+	            var isInMappedType = namedTypes.TSMappedType.check(parent);
+	            if (n.constraint) {
+	                parts.push(isInMappedType ? " in " : " extends ", path.call(print, "constraint"));
+	            }
+	            if (n["default"]) {
+	                parts.push(" = ", path.call(print, "default"));
+	            }
+	            return lines.concat(parts);
+	        case "TSTypeAssertion":
+	            var withParens = n.extra && n.extra.parenthesized === true;
+	            if (withParens) {
+	                parts.push("(");
+	            }
+	            parts.push("<", path.call(print, "typeAnnotation"), "> ", path.call(print, "expression"));
+	            if (withParens) {
+	                parts.push(")");
+	            }
+	            return lines.concat(parts);
+	        case "TSTypeParameterDeclaration":
+	        case "TSTypeParameterInstantiation":
+	            return lines.concat([
+	                "<",
+	                lines.fromString(", ").join(path.map(print, "params")),
+	                ">"
+	            ]);
+	        case "TSEnumDeclaration":
+	            parts.push(n.declare ? "declare " : "", n.const ? "const " : "", "enum ", path.call(print, "id"));
+	            var memberLines = lines.fromString(",\n").join(path.map(print, "members"));
+	            if (memberLines.isEmpty()) {
+	                parts.push(" {}");
+	            }
+	            else {
+	                parts.push(" {\n", memberLines.indent(options.tabWidth), "\n}");
+	            }
+	            return lines.concat(parts);
+	        case "TSExpressionWithTypeArguments":
+	            return lines.concat([
+	                path.call(print, "expression"),
+	                path.call(print, "typeParameters")
+	            ]);
+	        case "TSInterfaceBody":
+	            var lines$1 = lines.fromString(";\n").join(path.map(print, "body"));
+	            if (lines$1.isEmpty()) {
+	                return lines.fromString("{}", options);
+	            }
+	            return lines.concat([
+	                "{\n",
+	                lines$1.indent(options.tabWidth), ";",
+	                "\n}",
+	            ]);
+	        case "TSImportType":
+	            parts.push("import(", path.call(print, "argument"), ")");
+	            if (n.qualifier) {
+	                parts.push(".", path.call(print, "qualifier"));
+	            }
+	            if (n.typeParameters) {
+	                parts.push(path.call(print, "typeParameters"));
+	            }
+	            return lines.concat(parts);
+	        case "TSImportEqualsDeclaration":
+	            if (n.isExport) {
+	                parts.push("export ");
+	            }
+	            parts.push("import ", path.call(print, "id"), " = ", path.call(print, "moduleReference"));
+	            return maybeAddSemicolon(lines.concat(parts));
+	        case "TSExternalModuleReference":
+	            return lines.concat(["require(", path.call(print, "expression"), ")"]);
+	        case "TSModuleDeclaration": {
+	            var parent_1 = path.getParentNode();
+	            if (parent_1.type === "TSModuleDeclaration") {
+	                parts.push(".");
+	            }
+	            else {
+	                if (n.declare) {
+	                    parts.push("declare ");
+	                }
+	                if (!n.global) {
+	                    var isExternal = n.id.type === "StringLiteral" ||
+	                        (n.id.type === "Literal" &&
+	                            typeof n.id.value === "string");
+	                    if (isExternal) {
+	                        parts.push("module ");
+	                    }
+	                    else if (n.loc &&
+	                        n.loc.lines &&
+	                        n.id.loc) {
+	                        var prefix_1 = n.loc.lines.sliceString(n.loc.start, n.id.loc.start);
+	                        // These keywords are fundamentally ambiguous in the
+	                        // Babylon parser, and not reflected in the AST, so
+	                        // the best we can do is to match the original code,
+	                        // when possible.
+	                        if (prefix_1.indexOf("module") >= 0) {
+	                            parts.push("module ");
+	                        }
+	                        else {
+	                            parts.push("namespace ");
+	                        }
+	                    }
+	                    else {
+	                        parts.push("namespace ");
+	                    }
+	                }
+	            }
+	            parts.push(path.call(print, "id"));
+	            if (n.body && n.body.type === "TSModuleDeclaration") {
+	                parts.push(path.call(print, "body"));
+	            }
+	            else if (n.body) {
+	                var bodyLines = path.call(print, "body");
+	                if (bodyLines.isEmpty()) {
+	                    parts.push(" {}");
+	                }
+	                else {
+	                    parts.push(" {\n", bodyLines.indent(options.tabWidth), "\n}");
+	                }
+	            }
+	            return lines.concat(parts);
+	        }
+	        case "TSModuleBlock":
+	            return path.call(function (bodyPath) {
+	                return printStatementSequence(bodyPath, options, print);
+	            }, "body");
+	        // Unhandled types below. If encountered, nodes of these types should
+	        // be either left alone or desugared into AST types that are fully
+	        // supported by the pretty-printer.
+	        case "ClassHeritage": // TODO
+	        case "ComprehensionBlock": // TODO
+	        case "ComprehensionExpression": // TODO
+	        case "Glob": // TODO
+	        case "GeneratorExpression": // TODO
+	        case "LetStatement": // TODO
+	        case "LetExpression": // TODO
+	        case "GraphExpression": // TODO
+	        case "GraphIndexExpression": // TODO
+	        // XML types that nobody cares about or needs to print.
+	        case "XMLDefaultDeclaration":
+	        case "XMLAnyName":
+	        case "XMLQualifiedIdentifier":
+	        case "XMLFunctionQualifiedIdentifier":
+	        case "XMLAttributeSelector":
+	        case "XMLFilterExpression":
+	        case "XML":
+	        case "XMLElement":
+	        case "XMLList":
+	        case "XMLEscape":
+	        case "XMLText":
+	        case "XMLStartTag":
+	        case "XMLEndTag":
+	        case "XMLPointTag":
+	        case "XMLName":
+	        case "XMLAttribute":
+	        case "XMLCdata":
+	        case "XMLComment":
+	        case "XMLProcessingInstruction":
+	        default:
+	            debugger;
+	            throw new Error("unknown type: " + JSON.stringify(n.type));
+	    }
+	}
+	function printDecorators(path, printPath) {
+	    var parts = [];
+	    var node = path.getValue();
+	    if (node.decorators &&
+	        node.decorators.length > 0 &&
+	        // If the parent node is an export declaration, it will be
+	        // responsible for printing node.decorators.
+	        !util.getParentExportDeclaration(path)) {
+	        path.each(function (decoratorPath) {
+	            parts.push(printPath(decoratorPath), "\n");
+	        }, "decorators");
+	    }
+	    else if (util.isExportDeclaration(node) &&
+	        node.declaration &&
+	        node.declaration.decorators) {
+	        // Export declarations are responsible for printing any decorators
+	        // that logically apply to node.declaration.
+	        path.each(function (decoratorPath) {
+	            parts.push(printPath(decoratorPath), "\n");
+	        }, "declaration", "decorators");
+	    }
+	    return lines.concat(parts);
+	}
+	function printStatementSequence(path, options, print) {
+	    var filtered = [];
+	    var sawComment = false;
+	    var sawStatement = false;
+	    path.each(function (stmtPath) {
+	        var stmt = stmtPath.getValue();
+	        // Just in case the AST has been modified to contain falsy
+	        // "statements," it's safer simply to skip them.
+	        if (!stmt) {
+	            return;
+	        }
+	        // Skip printing EmptyStatement nodes to avoid leaving stray
+	        // semicolons lying around.
+	        if (stmt.type === "EmptyStatement" &&
+	            !(stmt.comments && stmt.comments.length > 0)) {
+	            return;
+	        }
+	        if (namedTypes.Comment.check(stmt)) {
+	            // The pretty printer allows a dangling Comment node to act as
+	            // a Statement when the Comment can't be attached to any other
+	            // non-Comment node in the tree.
+	            sawComment = true;
+	        }
+	        else if (namedTypes.Statement.check(stmt)) {
+	            sawStatement = true;
+	        }
+	        else {
+	            // When the pretty printer encounters a string instead of an
+	            // AST node, it just prints the string. This behavior can be
+	            // useful for fine-grained formatting decisions like inserting
+	            // blank lines.
+	            isString.assert(stmt);
+	        }
+	        // We can't hang onto stmtPath outside of this function, because
+	        // it's just a reference to a mutable FastPath object, so we have
+	        // to go ahead and print it here.
+	        filtered.push({
+	            node: stmt,
+	            printed: print(stmtPath)
+	        });
+	    });
+	    if (sawComment) {
+	        assert_1.default.strictEqual(sawStatement, false, "Comments may appear as statements in otherwise empty statement " +
+	            "lists, but may not coexist with non-Comment nodes.");
+	    }
+	    var prevTrailingSpace = null;
+	    var len = filtered.length;
+	    var parts = [];
+	    filtered.forEach(function (info, i) {
+	        var printed = info.printed;
+	        var stmt = info.node;
+	        var multiLine = printed.length > 1;
+	        var notFirst = i > 0;
+	        var notLast = i < len - 1;
+	        var leadingSpace;
+	        var trailingSpace;
+	        var lines = stmt && stmt.loc && stmt.loc.lines;
+	        var trueLoc = lines && options.reuseWhitespace &&
+	            util.getTrueLoc(stmt, lines);
+	        if (notFirst) {
+	            if (trueLoc) {
+	                var beforeStart = lines.skipSpaces(trueLoc.start, true);
+	                var beforeStartLine = beforeStart ? beforeStart.line : 1;
+	                var leadingGap = trueLoc.start.line - beforeStartLine;
+	                leadingSpace = Array(leadingGap + 1).join("\n");
+	            }
+	            else {
+	                leadingSpace = multiLine ? "\n\n" : "\n";
+	            }
+	        }
+	        else {
+	            leadingSpace = "";
+	        }
+	        if (notLast) {
+	            if (trueLoc) {
+	                var afterEnd = lines.skipSpaces(trueLoc.end);
+	                var afterEndLine = afterEnd ? afterEnd.line : lines.length;
+	                var trailingGap = afterEndLine - trueLoc.end.line;
+	                trailingSpace = Array(trailingGap + 1).join("\n");
+	            }
+	            else {
+	                trailingSpace = multiLine ? "\n\n" : "\n";
+	            }
+	        }
+	        else {
+	            trailingSpace = "";
+	        }
+	        parts.push(maxSpace(prevTrailingSpace, leadingSpace), printed);
+	        if (notLast) {
+	            prevTrailingSpace = trailingSpace;
+	        }
+	        else if (trailingSpace) {
+	            parts.push(trailingSpace);
+	        }
+	    });
+	    return lines.concat(parts);
+	}
+	function maxSpace(s1, s2) {
+	    if (!s1 && !s2) {
+	        return lines.fromString("");
+	    }
+	    if (!s1) {
+	        return lines.fromString(s2);
+	    }
+	    if (!s2) {
+	        return lines.fromString(s1);
+	    }
+	    var spaceLines1 = lines.fromString(s1);
+	    var spaceLines2 = lines.fromString(s2);
+	    if (spaceLines2.length > spaceLines1.length) {
+	        return spaceLines2;
+	    }
+	    return spaceLines1;
+	}
+	function printMethod(path, options, print) {
+	    var node = path.getNode();
+	    var kind = node.kind;
+	    var parts = [];
+	    var nodeValue = node.value;
+	    if (!namedTypes.FunctionExpression.check(nodeValue)) {
+	        nodeValue = node;
+	    }
+	    var access = node.accessibility || node.access;
+	    if (typeof access === "string") {
+	        parts.push(access, " ");
+	    }
+	    if (node.static) {
+	        parts.push("static ");
+	    }
+	    if (node.abstract) {
+	        parts.push("abstract ");
+	    }
+	    if (node.readonly) {
+	        parts.push("readonly ");
+	    }
+	    if (nodeValue.async) {
+	        parts.push("async ");
+	    }
+	    if (nodeValue.generator) {
+	        parts.push("*");
+	    }
+	    if (kind === "get" || kind === "set") {
+	        parts.push(kind, " ");
+	    }
+	    var key = path.call(print, "key");
+	    if (node.computed) {
+	        key = lines.concat(["[", key, "]"]);
+	    }
+	    parts.push(key);
+	    if (node.optional) {
+	        parts.push("?");
+	    }
+	    if (node === nodeValue) {
+	        parts.push(path.call(print, "typeParameters"), "(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+	        if (node.body) {
+	            parts.push(" ", path.call(print, "body"));
+	        }
+	        else {
+	            parts.push(";");
+	        }
+	    }
+	    else {
+	        parts.push(path.call(print, "value", "typeParameters"), "(", path.call(function (valuePath) {
+	            return printFunctionParams(valuePath, options, print);
+	        }, "value"), ")", path.call(print, "value", "returnType"));
+	        if (nodeValue.body) {
+	            parts.push(" ", path.call(print, "value", "body"));
+	        }
+	        else {
+	            parts.push(";");
+	        }
+	    }
+	    return lines.concat(parts);
+	}
+	function printArgumentsList(path, options, print) {
+	    var printed = path.map(print, "arguments");
+	    var trailingComma = util.isTrailingCommaEnabled(options, "parameters");
+	    var joined = lines.fromString(", ").join(printed);
+	    if (joined.getLineLength(1) > options.wrapColumn) {
+	        joined = lines.fromString(",\n").join(printed);
+	        return lines.concat([
+	            "(\n",
+	            joined.indent(options.tabWidth),
+	            trailingComma ? ",\n)" : "\n)"
+	        ]);
+	    }
+	    return lines.concat(["(", joined, ")"]);
+	}
+	function printFunctionParams(path, options, print) {
+	    var fun = path.getValue();
+	    if (fun.params) {
+	        var params = fun.params;
+	        var printed = path.map(print, "params");
+	    }
+	    else if (fun.parameters) {
+	        params = fun.parameters;
+	        printed = path.map(print, "parameters");
+	    }
+	    if (fun.defaults) {
+	        path.each(function (defExprPath) {
+	            var i = defExprPath.getName();
+	            var p = printed[i];
+	            if (p && defExprPath.getValue()) {
+	                printed[i] = lines.concat([p, " = ", print(defExprPath)]);
+	            }
+	        }, "defaults");
+	    }
+	    if (fun.rest) {
+	        printed.push(lines.concat(["...", path.call(print, "rest")]));
+	    }
+	    var joined = lines.fromString(", ").join(printed);
+	    if (joined.length > 1 ||
+	        joined.getLineLength(1) > options.wrapColumn) {
+	        joined = lines.fromString(",\n").join(printed);
+	        if (util.isTrailingCommaEnabled(options, "parameters") &&
+	            !fun.rest &&
+	            params[params.length - 1].type !== 'RestElement') {
+	            joined = lines.concat([joined, ",\n"]);
+	        }
+	        else {
+	            joined = lines.concat([joined, "\n"]);
+	        }
+	        return lines.concat(["\n", joined.indent(options.tabWidth)]);
+	    }
+	    return joined;
+	}
+	function printExportDeclaration(path, options, print) {
+	    var decl = path.getValue();
+	    var parts = ["export "];
+	    if (decl.exportKind && decl.exportKind !== "value") {
+	        parts.push(decl.exportKind + " ");
+	    }
+	    var shouldPrintSpaces = options.objectCurlySpacing;
+	    namedTypes.Declaration.assert(decl);
+	    if (decl["default"] ||
+	        decl.type === "ExportDefaultDeclaration") {
+	        parts.push("default ");
+	    }
+	    if (decl.declaration) {
+	        parts.push(path.call(print, "declaration"));
+	    }
+	    else if (decl.specifiers) {
+	        if (decl.specifiers.length === 1 &&
+	            decl.specifiers[0].type === "ExportBatchSpecifier") {
+	            parts.push("*");
+	        }
+	        else if (decl.specifiers.length === 0) {
+	            parts.push("{}");
+	        }
+	        else if (decl.specifiers[0].type === 'ExportDefaultSpecifier') {
+	            var unbracedSpecifiers_2 = [];
+	            var bracedSpecifiers_2 = [];
+	            path.each(function (specifierPath) {
+	                var spec = specifierPath.getValue();
+	                if (spec.type === "ExportDefaultSpecifier") {
+	                    unbracedSpecifiers_2.push(print(specifierPath));
+	                }
+	                else {
+	                    bracedSpecifiers_2.push(print(specifierPath));
+	                }
+	            }, "specifiers");
+	            unbracedSpecifiers_2.forEach(function (lines, i) {
+	                if (i > 0) {
+	                    parts.push(", ");
+	                }
+	                parts.push(lines);
+	            });
+	            if (bracedSpecifiers_2.length > 0) {
+	                var lines_3 = lines.fromString(", ").join(bracedSpecifiers_2);
+	                if (lines_3.getLineLength(1) > options.wrapColumn) {
+	                    lines_3 = lines.concat([
+	                        lines.fromString(",\n").join(bracedSpecifiers_2).indent(options.tabWidth),
+	                        ","
+	                    ]);
+	                }
+	                if (unbracedSpecifiers_2.length > 0) {
+	                    parts.push(", ");
+	                }
+	                if (lines_3.length > 1) {
+	                    parts.push("{\n", lines_3, "\n}");
+	                }
+	                else if (options.objectCurlySpacing) {
+	                    parts.push("{ ", lines_3, " }");
+	                }
+	                else {
+	                    parts.push("{", lines_3, "}");
+	                }
+	            }
+	        }
+	        else {
+	            parts.push(shouldPrintSpaces ? "{ " : "{", lines.fromString(", ").join(path.map(print, "specifiers")), shouldPrintSpaces ? " }" : "}");
+	        }
+	        if (decl.source) {
+	            parts.push(" from ", path.call(print, "source"));
+	        }
+	    }
+	    var lines$1 = lines.concat(parts);
+	    if (lastNonSpaceCharacter(lines$1) !== ";" &&
+	        !(decl.declaration &&
+	            (decl.declaration.type === "FunctionDeclaration" ||
+	                decl.declaration.type === "ClassDeclaration" ||
+	                decl.declaration.type === "TSModuleDeclaration" ||
+	                decl.declaration.type === "TSInterfaceDeclaration" ||
+	                decl.declaration.type === "TSEnumDeclaration"))) {
+	        lines$1 = lines.concat([lines$1, ";"]);
+	    }
+	    return lines$1;
+	}
+	function printFlowDeclaration(path, parts) {
+	    var parentExportDecl = util.getParentExportDeclaration(path);
+	    if (parentExportDecl) {
+	        assert_1.default.strictEqual(parentExportDecl.type, "DeclareExportDeclaration");
+	    }
+	    else {
+	        // If the parent node has type DeclareExportDeclaration, then it
+	        // will be responsible for printing the "declare" token. Otherwise
+	        // it needs to be printed with this non-exported declaration node.
+	        parts.unshift("declare ");
+	    }
+	    return lines.concat(parts);
+	}
+	function printVariance(path, print) {
+	    return path.call(function (variancePath) {
+	        var value = variancePath.getValue();
+	        if (value) {
+	            if (value === "plus") {
+	                return lines.fromString("+");
+	            }
+	            if (value === "minus") {
+	                return lines.fromString("-");
+	            }
+	            return print(variancePath);
+	        }
+	        return lines.fromString("");
+	    }, "variance");
+	}
+	function adjustClause(clause, options) {
+	    if (clause.length > 1)
+	        return lines.concat([" ", clause]);
+	    return lines.concat([
+	        "\n",
+	        maybeAddSemicolon(clause).indent(options.tabWidth)
+	    ]);
+	}
+	function lastNonSpaceCharacter(lines) {
+	    var pos = lines.lastPos();
+	    do {
+	        var ch = lines.charAt(pos);
+	        if (/\S/.test(ch))
+	            return ch;
+	    } while (lines.prevPos(pos));
+	}
+	function endsWithBrace(lines) {
+	    return lastNonSpaceCharacter(lines) === "}";
+	}
+	function swapQuotes(str) {
+	    return str.replace(/['"]/g, function (m) {
+	        return m === '"' ? '\'' : '"';
+	    });
+	}
+	function nodeStr(str, options) {
+	    isString.assert(str);
+	    switch (options.quote) {
+	        case "auto":
+	            var double = JSON.stringify(str);
+	            var single = swapQuotes(JSON.stringify(swapQuotes(str)));
+	            return double.length > single.length ? single : double;
+	        case "single":
+	            return swapQuotes(JSON.stringify(swapQuotes(str)));
+	        case "double":
+	        default:
+	            return JSON.stringify(str);
+	    }
+	}
+	function maybeAddSemicolon(lines$1) {
+	    var eoc = lastNonSpaceCharacter(lines$1);
+	    if (!eoc || "\n};".indexOf(eoc) < 0)
+	        return lines.concat([lines$1, ";"]);
+	    return lines$1;
+	}
+	});
+
+	unwrapExports(printer);
+	var printer_1 = printer.Printer;
+
+	var main$1 = createCommonjsModule(function (module, exports) {
+	var __importDefault = (this && this.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	var __importStar = (this && this.__importStar) || function (mod) {
+	    if (mod && mod.__esModule) return mod;
+	    var result = {};
+	    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+	    result["default"] = mod;
+	    return result;
+	};
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var fs_1 = __importDefault(fs);
+	var types = __importStar(main);
+	exports.types = types;
+
+	exports.parse = parser.parse;
+
+	/**
+	 * Traverse and potentially modify an abstract syntax tree using a
+	 * convenient visitor syntax:
+	 *
+	 *   recast.visit(ast, {
+	 *     names: [],
+	 *     visitIdentifier: function(path) {
+	 *       var node = path.value;
+	 *       this.visitor.names.push(node.name);
+	 *       this.traverse(path);
+	 *     }
+	 *   });
+	 */
+	var ast_types_1 = main;
+	exports.visit = ast_types_1.visit;
+	/**
+	 * Reprint a modified syntax tree using as much of the original source
+	 * code as possible.
+	 */
+	function print(node, options) {
+	    return new printer.Printer(options).print(node);
+	}
+	exports.print = print;
+	/**
+	 * Print without attempting to reuse any original source code.
+	 */
+	function prettyPrint(node, options) {
+	    return new printer.Printer(options).printGenerically(node);
+	}
+	exports.prettyPrint = prettyPrint;
+	/**
+	 * Convenient command-line interface (see e.g. example/add-braces).
+	 */
+	function run(transformer, options) {
+	    return runFile(process.argv[2], transformer, options);
+	}
+	exports.run = run;
+	function runFile(path, transformer, options) {
+	    fs_1.default.readFile(path, "utf-8", function (err, code) {
+	        if (err) {
+	            console.error(err);
+	            return;
+	        }
+	        runString(code, transformer, options);
+	    });
+	}
+	function defaultWriteback(output) {
+	    process.stdout.write(output);
+	}
+	function runString(code, transformer, options) {
+	    var writeback = options && options.writeback || defaultWriteback;
+	    transformer(parser.parse(code, options), function (node) {
+	        writeback(print(node, options).code);
+	    });
+	}
+	});
+
+	unwrapExports(main$1);
+	var main_1$1 = main$1.types;
+	var main_2$1 = main$1.parse;
+	var main_3$1 = main$1.visit;
+	var main_4$1 = main$1.print;
+	var main_5$1 = main$1.prettyPrint;
+	var main_6$1 = main$1.run;
+
+	const types$1 = main_1$1;
+	const builders = main_1$1.builders;
+	const namedTypes = main_1$1.namedTypes;
+
+	function nullNode() {
+	  return builders.literal(null)
+	}
+
+	function simplePropertyNode(key, value) {
+	  return builders.property('init', builders.literal(key), value, false)
+	}
+
+	/**
+	 * Return a source map as JSON, it it has not the toJSON method it means it can
+	 * be used right the way
+	 * @param   { SourceMapGenerator|Object } map - a sourcemap generator or simply an json object
+	 * @returns { Object } the source map as JSON
+	 */
+	function sourcemapAsJSON(map) {
+	  if (map && map.toJSON) return map.toJSON()
+	  return map
+	}
+
+	/**
+	 * Detect node js environements
+	 * @returns { boolean } true if the runtime is node
+	 */
+	function isNode() {
+	  return typeof process !== 'undefined'
+	}
+
+	/**
+	 * Compose two sourcemaps
+	 * @param   { SourceMapGenerator } formerMap - original sourcemap
+	 * @param   { SourceMapGenerator } latterMap - target sourcemap
+	 * @returns { Object } sourcemap json
+	 */
+	function composeSourcemaps(formerMap, latterMap) {
+	  if (
+	    isNode() &&
+	    formerMap && latterMap && latterMap.mappings
+	  ) {
+	    return util_5$1(sourcemapAsJSON(formerMap), sourcemapAsJSON(latterMap))
+	  } else if (isNode() && formerMap) {
+	    return sourcemapAsJSON(formerMap)
+	  }
+
+	  return {}
+	}
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	const intToCharMap$1 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	var encode$2 = function(number) {
+	  if (0 <= number && number < intToCharMap$1.length) {
+	    return intToCharMap$1[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+
+	var base64$1 = {
+		encode: encode$2
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+
+
+
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+
+	const VLQ_BASE_SHIFT$1 = 5;
+
+	// binary: 100000
+	const VLQ_BASE$1 = 1 << VLQ_BASE_SHIFT$1;
+
+	// binary: 011111
+	const VLQ_BASE_MASK$1 = VLQ_BASE$1 - 1;
+
+	// binary: 100000
+	const VLQ_CONTINUATION_BIT$1 = VLQ_BASE$1;
+
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned$1(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	var encode$3 = function base64VLQ_encode(aValue) {
+	  let encoded = "";
+	  let digit;
+
+	  let vlq = toVLQSigned$1(aValue);
+
+	  do {
+	    digit = vlq & VLQ_BASE_MASK$1;
+	    vlq >>>= VLQ_BASE_SHIFT$1;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT$1;
+	    }
+	    encoded += base64$1.encode(digit);
+	  } while (vlq > 0);
+
+	  return encoded;
+	};
+
+	var base64Vlq$1 = {
+		encode: encode$3
+	};
+
+	var util$2 = createCommonjsModule(function (module, exports) {
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  }
+	    throw new Error('"' + aName + '" is a required argument.');
+
+	}
+	exports.getArg = getArg;
+
+	const urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	const dataUrlRegexp = /^data:.+\,.+$/;
+
+	function urlParse(aUrl) {
+	  const match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+
+	function urlGenerate(aParsedUrl) {
+	  let url = "";
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ":";
+	  }
+	  url += "//";
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + "@";
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port;
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+
+	const MAX_CACHED_INPUTS = 32;
+
+	/**
+	 * Takes some function `f(input) -> result` and returns a memoized version of
+	 * `f`.
+	 *
+	 * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+	 * memoization is a dumb-simple, linear least-recently-used cache.
+	 */
+	function lruMemoize(f) {
+	  const cache = [];
+
+	  return function(input) {
+	    for (let i = 0; i < cache.length; i++) {
+	      if (cache[i].input === input) {
+	        const temp = cache[0];
+	        cache[0] = cache[i];
+	        cache[i] = temp;
+	        return cache[0].result;
+	      }
+	    }
+
+	    const result = f(input);
+
+	    cache.unshift({
+	      input,
+	      result,
+	    });
+
+	    if (cache.length > MAX_CACHED_INPUTS) {
+	      cache.pop();
+	    }
+
+	    return result;
+	  };
+	}
+
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	const normalize = lruMemoize(function normalize(aPath) {
+	  let path = aPath;
+	  const url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  const isAbsolute = exports.isAbsolute(path);
+
+	  // Split the path into parts between `/` characters. This is much faster than
+	  // using `.split(/\/+/g)`.
+	  const parts = [];
+	  let start = 0;
+	  let i = 0;
+	  while (true) {
+	    start = i;
+	    i = path.indexOf("/", start);
+	    if (i === -1) {
+	      parts.push(path.slice(start));
+	      break;
+	    } else {
+	      parts.push(path.slice(start, i));
+	      while (i < path.length && path[i] === "/") {
+	        i++;
+	      }
+	    }
+	  }
+
+	  let up = 0;
+	  for (i = parts.length - 1; i >= 0; i--) {
+	    const part = parts[i];
+	    if (part === ".") {
+	      parts.splice(i, 1);
+	    } else if (part === "..") {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === "") {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join("/");
+
+	  if (path === "") {
+	    path = isAbsolute ? "/" : ".";
+	  }
+
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	});
+	exports.normalize = normalize;
+
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  const aPathUrl = urlParse(aPath);
+	  const aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || "/";
+	  }
+
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+
+	  const joined = aPath.charAt(0) === "/"
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+
+	exports.isAbsolute = function(aPath) {
+	  return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+	};
+
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+
+	  aRoot = aRoot.replace(/\/$/, "");
+
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  let level = 0;
+	  while (aPath.indexOf(aRoot + "/") !== 0) {
+	    const index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+
+	    ++level;
+	  }
+
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+
+	const supportsNullProto = (function() {
+	  const obj = Object.create(null);
+	  return !("__proto__" in obj);
+	}());
+
+	function identity(s) {
+	  return s;
+	}
+
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return "$" + aStr;
+	  }
+
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+
+	  const length = s.length;
+
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+
+	  /* eslint-disable no-multi-spaces */
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+	  /* eslint-enable no-multi-spaces */
+
+	  for (let i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+
+	  return true;
+	}
+
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  let cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+
+	  return -1;
+	}
+
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || "";
+
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") {
+	      sourceRoot += "/";
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    const parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      const index = parsed.path.lastIndexOf("/");
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+	});
+	var util_1$2 = util$2.getArg;
+	var util_2$2 = util$2.urlParse;
+	var util_3$2 = util$2.urlGenerate;
+	var util_4$2 = util$2.normalize;
+	var util_5$2 = util$2.join;
+	var util_6$2 = util$2.isAbsolute;
+	var util_7$2 = util$2.relative;
+	var util_8$2 = util$2.toSetString;
+	var util_9$2 = util$2.fromSetString;
+	var util_10$2 = util$2.compareByOriginalPositions;
+	var util_11$1 = util$2.compareByGeneratedPositionsDeflated;
+	var util_12$1 = util$2.compareByGeneratedPositionsInflated;
+	var util_13$1 = util$2.parseSourceMapInput;
+	var util_14$1 = util$2.computeSourceURL;
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	class ArraySet$3 {
+	  constructor() {
+	    this._array = [];
+	    this._set = new Map();
+	  }
+
+	  /**
+	   * Static method for creating ArraySet instances from an existing array.
+	   */
+	  static fromArray(aArray, aAllowDuplicates) {
+	    const set = new ArraySet$3();
+	    for (let i = 0, len = aArray.length; i < len; i++) {
+	      set.add(aArray[i], aAllowDuplicates);
+	    }
+	    return set;
+	  }
+
+	  /**
+	   * Return how many unique items are in this ArraySet. If duplicates have been
+	   * added, than those do not count towards the size.
+	   *
+	   * @returns Number
+	   */
+	  size() {
+	    return this._set.size;
+	  }
+
+	  /**
+	   * Add the given string to this set.
+	   *
+	   * @param String aStr
+	   */
+	  add(aStr, aAllowDuplicates) {
+	    const isDuplicate = this.has(aStr);
+	    const idx = this._array.length;
+	    if (!isDuplicate || aAllowDuplicates) {
+	      this._array.push(aStr);
+	    }
+	    if (!isDuplicate) {
+	      this._set.set(aStr, idx);
+	    }
+	  }
+
+	  /**
+	   * Is the given string a member of this set?
+	   *
+	   * @param String aStr
+	   */
+	  has(aStr) {
+	      return this._set.has(aStr);
+	  }
+
+	  /**
+	   * What is the index of the given string in the array?
+	   *
+	   * @param String aStr
+	   */
+	  indexOf(aStr) {
+	    const idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	    throw new Error('"' + aStr + '" is not in the set.');
+	  }
+
+	  /**
+	   * What is the element at the given index?
+	   *
+	   * @param Number aIdx
+	   */
+	  at(aIdx) {
+	    if (aIdx >= 0 && aIdx < this._array.length) {
+	      return this._array[aIdx];
+	    }
+	    throw new Error("No element indexed by " + aIdx);
+	  }
+
+	  /**
+	   * Returns the array representation of this set (which has the proper indices
+	   * indicated by indexOf). Note that this is a copy of the internal array used
+	   * for storing the members so that no one can mess with internal state.
+	   */
+	  toArray() {
+	    return this._array.slice();
+	  }
+	}
+	var ArraySet_1$1 = ArraySet$3;
+
+	var arraySet$1 = {
+		ArraySet: ArraySet_1$1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter$1(mappingA, mappingB) {
+	  // Optimized for most common case
+	  const lineA = mappingA.generatedLine;
+	  const lineB = mappingB.generatedLine;
+	  const columnA = mappingA.generatedColumn;
+	  const columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util$2.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a negligible overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	class MappingList$2 {
+	  constructor() {
+	    this._array = [];
+	    this._sorted = true;
+	    // Serves as infimum
+	    this._last = {generatedLine: -1, generatedColumn: 0};
+	  }
+
+	  /**
+	   * Iterate through internal items. This method takes the same arguments that
+	   * `Array.prototype.forEach` takes.
+	   *
+	   * NOTE: The order of the mappings is NOT guaranteed.
+	   */
+	  unsortedForEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  }
+
+	  /**
+	   * Add the given source mapping.
+	   *
+	   * @param Object aMapping
+	   */
+	  add(aMapping) {
+	    if (generatedPositionAfter$1(this._last, aMapping)) {
+	      this._last = aMapping;
+	      this._array.push(aMapping);
+	    } else {
+	      this._sorted = false;
+	      this._array.push(aMapping);
+	    }
+	  }
+
+	  /**
+	   * Returns the flat, sorted array of mappings. The mappings are sorted by
+	   * generated position.
+	   *
+	   * WARNING: This method returns internal data without copying, for
+	   * performance. The return value must NOT be mutated, and should be treated as
+	   * an immutable borrow. If you want to take ownership, you must make your own
+	   * copy.
+	   */
+	  toArray() {
+	    if (!this._sorted) {
+	      this._array.sort(util$2.compareByGeneratedPositionsInflated);
+	      this._sorted = true;
+	    }
+	    return this._array;
+	  }
+	}
+
+	var MappingList_1$1 = MappingList$2;
+
+	var mappingList$1 = {
+		MappingList: MappingList_1$1
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	const ArraySet$4 = arraySet$1.ArraySet;
+	const MappingList$3 = mappingList$1.MappingList;
+
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	class SourceMapGenerator$3 {
+	  constructor(aArgs) {
+	    if (!aArgs) {
+	      aArgs = {};
+	    }
+	    this._file = util$2.getArg(aArgs, "file", null);
+	    this._sourceRoot = util$2.getArg(aArgs, "sourceRoot", null);
+	    this._skipValidation = util$2.getArg(aArgs, "skipValidation", false);
+	    this._sources = new ArraySet$4();
+	    this._names = new ArraySet$4();
+	    this._mappings = new MappingList$3();
+	    this._sourcesContents = null;
+	  }
+
+	  /**
+	   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	   *
+	   * @param aSourceMapConsumer The SourceMap.
+	   */
+	  static fromSourceMap(aSourceMapConsumer) {
+	    const sourceRoot = aSourceMapConsumer.sourceRoot;
+	    const generator = new SourceMapGenerator$3({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function(mapping) {
+	      const newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util$2.relative(sourceRoot, newMapping.source);
+	        }
+
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+	      let sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util$2.relative(sourceRoot, sourceFile);
+	      }
+
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+
+	      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  }
+
+	  /**
+	   * Add a single mapping from original source line and column to the generated
+	   * source's line and column for this source map being created. The mapping
+	   * object should have the following properties:
+	   *
+	   *   - generated: An object with the generated line and column positions.
+	   *   - original: An object with the original line and column positions.
+	   *   - source: The original source file (relative to the sourceRoot).
+	   *   - name: An optional original token name for this mapping.
+	   */
+	  addMapping(aArgs) {
+	    const generated = util$2.getArg(aArgs, "generated");
+	    const original = util$2.getArg(aArgs, "original", null);
+	    let source = util$2.getArg(aArgs, "source", null);
+	    let name = util$2.getArg(aArgs, "name", null);
+
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source,
+	      name
+	    });
+	  }
+
+	  /**
+	   * Set the source content for a source file.
+	   */
+	  setSourceContent(aSourceFile, aSourceContent) {
+	    let source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util$2.relative(this._sourceRoot, source);
+	    }
+
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util$2.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util$2.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  }
+
+	  /**
+	   * Applies the mappings of a sub-source-map for a specific source file to the
+	   * source map being generated. Each mapping to the supplied source file is
+	   * rewritten using the supplied source map. Note: The resolution for the
+	   * resulting mappings is the minimium of this map and the supplied map.
+	   *
+	   * @param aSourceMapConsumer The source map to be applied.
+	   * @param aSourceFile Optional. The filename of the source file.
+	   *        If omitted, SourceMapConsumer's file property will be used.
+	   * @param aSourceMapPath Optional. The dirname of the path to the source map
+	   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	   *        This parameter is needed when the two source maps aren't in the same
+	   *        directory, and the source map to be applied contains relative source
+	   *        paths. If so, those relative source paths need to be rewritten
+	   *        relative to the SourceMapGenerator.
+	   */
+	  applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    let sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          "SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, " +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    const sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util$2.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    const newSources = this._mappings.toArray().length > 0
+	      ? new ArraySet$4()
+	      : this._sources;
+	    const newNames = new ArraySet$4();
+
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function(mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        const original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util$2.join(aSourceMapPath, mapping.source);
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util$2.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+
+	      const source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+
+	      const name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function(srcFile) {
+	      const content = aSourceMapConsumer.sourceContentFor(srcFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          srcFile = util$2.join(aSourceMapPath, srcFile);
+	        }
+	        if (sourceRoot != null) {
+	          srcFile = util$2.relative(sourceRoot, srcFile);
+	        }
+	        this.setSourceContent(srcFile, content);
+	      }
+	    }, this);
+	  }
+
+	  /**
+	   * A mapping can have one of the three levels of data:
+	   *
+	   *   1. Just the generated position.
+	   *   2. The Generated position, original position, and original source.
+	   *   3. Generated and original position, original source, as well as a name
+	   *      token.
+	   *
+	   * To maintain consistency, we validate that any new mapping being added falls
+	   * in to one of these categories.
+	   */
+	  _validateMapping(aGenerated, aOriginal, aSource, aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+	        throw new Error(
+	            "original.line and original.column are not numbers -- you probably meant to omit " +
+	            "the original mapping entirely and only map the generated position. If so, pass " +
+	            "null for the original mapping instead of an object with empty or null values."
+	        );
+	    }
+
+	    if (aGenerated && "line" in aGenerated && "column" in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) ; else if (aGenerated && "line" in aGenerated && "column" in aGenerated
+	             && aOriginal && "line" in aOriginal && "column" in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) ; else {
+	      throw new Error("Invalid mapping: " + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  }
+
+	  /**
+	   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	   * specified by the source map format.
+	   */
+	  _serializeMappings() {
+	    let previousGeneratedColumn = 0;
+	    let previousGeneratedLine = 1;
+	    let previousOriginalColumn = 0;
+	    let previousOriginalLine = 0;
+	    let previousName = 0;
+	    let previousSource = 0;
+	    let result = "";
+	    let next;
+	    let mapping;
+	    let nameIdx;
+	    let sourceIdx;
+
+	    const mappings = this._mappings.toArray();
+	    for (let i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = "";
+
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ";";
+	          previousGeneratedLine++;
+	        }
+	      } else if (i > 0) {
+	        if (!util$2.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	          continue;
+	        }
+	        next += ",";
+	      }
+
+	      next += base64Vlq$1.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64Vlq$1.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64Vlq$1.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+
+	        next += base64Vlq$1.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64Vlq$1.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+
+	      result += next;
+	    }
+
+	    return result;
+	  }
+
+	  _generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function(source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util$2.relative(aSourceRoot, source);
+	      }
+	      const key = util$2.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  }
+
+	  /**
+	   * Externalize the source map.
+	   */
+	  toJSON() {
+	    const map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+
+	    return map;
+	  }
+
+	  /**
+	   * Render the source map being generated to a string.
+	   */
+	  toString() {
+	    return JSON.stringify(this.toJSON());
+	  }
+	}
+
+	SourceMapGenerator$3.prototype._version = 3;
+	var SourceMapGenerator_1$1 = SourceMapGenerator$3;
+
+	var sourceMapGenerator$1 = {
+		SourceMapGenerator: SourceMapGenerator_1$1
+	};
+
+	var binarySearch$1 = createCommonjsModule(function (module, exports) {
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  const mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  const cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  } else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    }
+	    return mid;
+	  }
+
+	  // Our needle is less than aHaystack[mid].
+	  if (mid - aLow > 1) {
+	    // The element is in the lower half.
+	    return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	  }
+
+	  // we are in termination case (3) or (2) and return the appropriate thing.
+	  if (aBias == exports.LEAST_UPPER_BOUND) {
+	    return mid;
+	  }
+	  return aLow < 0 ? -1 : aLow;
+	}
+
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+
+	  let index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+
+	  return index;
+	};
+	});
+	var binarySearch_1$1 = binarySearch$1.GREATEST_LOWER_BOUND;
+	var binarySearch_2$1 = binarySearch$1.LEAST_UPPER_BOUND;
+	var binarySearch_3$1 = binarySearch$1.search;
+
+	var readWasm = createCommonjsModule(function (module) {
+	if (typeof fetch === "function") {
+	  // Web version of reading a wasm file into an array buffer.
+
+	  let mappingsWasmUrl = null;
+
+	  module.exports = function readWasm() {
+	    if (typeof mappingsWasmUrl !== "string") {
+	      throw new Error("You must provide the URL of lib/mappings.wasm by calling " +
+	                      "SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) " +
+	                      "before using SourceMapConsumer");
+	    }
+
+	    return fetch(mappingsWasmUrl)
+	      .then(response => response.arrayBuffer());
+	  };
+
+	  module.exports.initialize = url => mappingsWasmUrl = url;
+	} else {
+	  // Node version of reading a wasm file into an array buffer.
+	  const fs$1 = fs;
+	  const path = path$1;
+
+	  module.exports = function readWasm() {
+	    return new Promise((resolve, reject) => {
+	      const wasmPath = path.join(__dirname, "mappings.wasm");
+	      fs$1.readFile(wasmPath, null, (error, data) => {
+	        if (error) {
+	          reject(error);
+	          return;
+	        }
+
+	        resolve(data.buffer);
+	      });
+	    });
+	  };
+
+	  module.exports.initialize = _ => {
+	    console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");
+	  };
+	}
+	});
+	var readWasm_1 = readWasm.initialize;
+
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping$1() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.lastGeneratedColumn = null;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+
+	let cachedWasm = null;
+
+	var wasm = function wasm() {
+	  if (cachedWasm) {
+	    return cachedWasm;
+	  }
+
+	  const callbackStack = [];
+
+	  cachedWasm = readWasm().then(buffer => {
+	      return WebAssembly.instantiate(buffer, {
+	        env: {
+	          mapping_callback(
+	            generatedLine,
+	            generatedColumn,
+
+	            hasLastGeneratedColumn,
+	            lastGeneratedColumn,
+
+	            hasOriginal,
+	            source,
+	            originalLine,
+	            originalColumn,
+
+	            hasName,
+	            name
+	          ) {
+	            const mapping = new Mapping$1();
+	            // JS uses 1-based line numbers, wasm uses 0-based.
+	            mapping.generatedLine = generatedLine + 1;
+	            mapping.generatedColumn = generatedColumn;
+
+	            if (hasLastGeneratedColumn) {
+	              // JS uses inclusive last generated column, wasm uses exclusive.
+	              mapping.lastGeneratedColumn = lastGeneratedColumn - 1;
+	            }
+
+	            if (hasOriginal) {
+	              mapping.source = source;
+	              // JS uses 1-based line numbers, wasm uses 0-based.
+	              mapping.originalLine = originalLine + 1;
+	              mapping.originalColumn = originalColumn;
+
+	              if (hasName) {
+	                mapping.name = name;
+	              }
+	            }
+
+	            callbackStack[callbackStack.length - 1](mapping);
+	          },
+
+	          start_all_generated_locations_for() { console.time("all_generated_locations_for"); },
+	          end_all_generated_locations_for() { console.timeEnd("all_generated_locations_for"); },
+
+	          start_compute_column_spans() { console.time("compute_column_spans"); },
+	          end_compute_column_spans() { console.timeEnd("compute_column_spans"); },
+
+	          start_generated_location_for() { console.time("generated_location_for"); },
+	          end_generated_location_for() { console.timeEnd("generated_location_for"); },
+
+	          start_original_location_for() { console.time("original_location_for"); },
+	          end_original_location_for() { console.timeEnd("original_location_for"); },
+
+	          start_parse_mappings() { console.time("parse_mappings"); },
+	          end_parse_mappings() { console.timeEnd("parse_mappings"); },
+
+	          start_sort_by_generated_location() { console.time("sort_by_generated_location"); },
+	          end_sort_by_generated_location() { console.timeEnd("sort_by_generated_location"); },
+
+	          start_sort_by_original_location() { console.time("sort_by_original_location"); },
+	          end_sort_by_original_location() { console.timeEnd("sort_by_original_location"); },
+	        }
+	      });
+	  }).then(Wasm => {
+	    return {
+	      exports: Wasm.instance.exports,
+	      withMappingCallback: (mappingCallback, f) => {
+	        callbackStack.push(mappingCallback);
+	        try {
+	          f();
+	        } finally {
+	          callbackStack.pop();
+	        }
+	      }
+	    };
+	  }).then(null, e => {
+	    cachedWasm = null;
+	    throw e;
+	  });
+
+	  return cachedWasm;
+	};
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+
+
+	const ArraySet$5 = arraySet$1.ArraySet;
+	 // eslint-disable-line no-unused-vars
+
+
+
+	const INTERNAL = Symbol("smcInternal");
+
+	class SourceMapConsumer$2 {
+	  constructor(aSourceMap, aSourceMapURL) {
+	    // If the constructor was called by super(), just return Promise<this>.
+	    // Yes, this is a hack to retain the pre-existing API of the base-class
+	    // constructor also being an async factory function.
+	    if (aSourceMap == INTERNAL) {
+	      return Promise.resolve(this);
+	    }
+
+	    return _factory(aSourceMap, aSourceMapURL);
+	  }
+
+	  static initialize(opts) {
+	    readWasm.initialize(opts["lib/mappings.wasm"]);
+	  }
+
+	  static fromSourceMap(aSourceMap, aSourceMapURL) {
+	    return _factoryBSM(aSourceMap, aSourceMapURL);
+	  }
+
+	  /**
+	   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+	   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+	   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+	   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+	   * value.
+	   *
+	   * You must not use the consumer after `f` completes!
+	   *
+	   * By using `with`, you do not have to remember to manually call `destroy` on
+	   * the consumer, since it will be called automatically once `f` completes.
+	   *
+	   * ```js
+	   * const xSquared = await SourceMapConsumer.with(
+	   *   myRawSourceMap,
+	   *   null,
+	   *   async function (consumer) {
+	   *     // Use `consumer` inside here and don't worry about remembering
+	   *     // to call `destroy`.
+	   *
+	   *     const x = await whatever(consumer);
+	   *     return x * x;
+	   *   }
+	   * );
+	   *
+	   * // You may not use that `consumer` anymore out here; it has
+	   * // been destroyed. But you can use `xSquared`.
+	   * console.log(xSquared);
+	   * ```
+	   */
+	  static with(rawSourceMap, sourceMapUrl, f) {
+	    // Note: The `acorn` version that `webpack` currently depends on doesn't
+	    // support `async` functions, and the nodes that we support don't all have
+	    // `.finally`. Therefore, this is written a bit more convolutedly than it
+	    // should really be.
+
+	    let consumer = null;
+	    const promise = new SourceMapConsumer$2(rawSourceMap, sourceMapUrl);
+	    return promise
+	      .then(c => {
+	        consumer = c;
+	        return f(c);
+	      })
+	      .then(x => {
+	        if (consumer) {
+	          consumer.destroy();
+	        }
+	        return x;
+	      }, e => {
+	        if (consumer) {
+	          consumer.destroy();
+	        }
+	        throw e;
+	      });
+	  }
+
+	  /**
+	   * Parse the mappings in a string in to a data structure which we can easily
+	   * query (the ordered arrays in the `this.__generatedMappings` and
+	   * `this.__originalMappings` properties).
+	   */
+	  _parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  }
+
+	  /**
+	   * Iterate over each mapping between an original source/line/column and a
+	   * generated line/column in this source map.
+	   *
+	   * @param Function aCallback
+	   *        The function that is called with each mapping.
+	   * @param Object aContext
+	   *        Optional. If specified, this object will be the value of `this` every
+	   *        time that `aCallback` is called.
+	   * @param aOrder
+	   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	   *        iterate over the mappings sorted by the generated file's line/column
+	   *        order or the original's source/line/column order, respectively. Defaults to
+	   *        `SourceMapConsumer.GENERATED_ORDER`.
+	   */
+	  eachMapping(aCallback, aContext, aOrder) {
+	    throw new Error("Subclasses must implement eachMapping");
+	  }
+
+	  /**
+	   * Returns all generated line and column information for the original source,
+	   * line, and column provided. If no column is provided, returns all mappings
+	   * corresponding to a either the line we are searching for or the next
+	   * closest line that has any mappings. Otherwise, returns all mappings
+	   * corresponding to the given line and either the column we are searching for
+	   * or the next closest column that has any offsets.
+	   *
+	   * The only argument is an object with the following properties:
+	   *
+	   *   - source: The filename of the original source.
+	   *   - line: The line number in the original source.  The line number is 1-based.
+	   *   - column: Optional. the column number in the original source.
+	   *    The column number is 0-based.
+	   *
+	   * and an array of objects is returned, each with the following properties:
+	   *
+	   *   - line: The line number in the generated source, or null.  The
+	   *    line number is 1-based.
+	   *   - column: The column number in the generated source, or null.
+	   *    The column number is 0-based.
+	   */
+	  allGeneratedPositionsFor(aArgs) {
+	    throw new Error("Subclasses must implement allGeneratedPositionsFor");
+	  }
+
+	  destroy() {
+	    throw new Error("Subclasses must implement destroy");
+	  }
+	}
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer$2.prototype._version = 3;
+	SourceMapConsumer$2.GENERATED_ORDER = 1;
+	SourceMapConsumer$2.ORIGINAL_ORDER = 2;
+
+	SourceMapConsumer$2.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer$2.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	class BasicSourceMapConsumer$1 extends SourceMapConsumer$2 {
+	  constructor(aSourceMap, aSourceMapURL) {
+	    return super(INTERNAL).then(that => {
+	      let sourceMap = aSourceMap;
+	      if (typeof aSourceMap === "string") {
+	        sourceMap = util$2.parseSourceMapInput(aSourceMap);
+	      }
+
+	      const version = util$2.getArg(sourceMap, "version");
+	      let sources = util$2.getArg(sourceMap, "sources");
+	      // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	      // requires the array) to play nice here.
+	      const names = util$2.getArg(sourceMap, "names", []);
+	      let sourceRoot = util$2.getArg(sourceMap, "sourceRoot", null);
+	      const sourcesContent = util$2.getArg(sourceMap, "sourcesContent", null);
+	      const mappings = util$2.getArg(sourceMap, "mappings");
+	      const file = util$2.getArg(sourceMap, "file", null);
+
+	      // Once again, Sass deviates from the spec and supplies the version as a
+	      // string rather than a number, so we use loose equality checking here.
+	      if (version != that._version) {
+	        throw new Error("Unsupported version: " + version);
+	      }
+
+	      if (sourceRoot) {
+	        sourceRoot = util$2.normalize(sourceRoot);
+	      }
+
+	      sources = sources
+	        .map(String)
+	        // Some source maps produce relative source paths like "./foo.js" instead of
+	        // "foo.js".  Normalize these first so that future comparisons will succeed.
+	        // See bugzil.la/1090768.
+	        .map(util$2.normalize)
+	        // Always ensure that absolute sources are internally stored relative to
+	        // the source root, if the source root is absolute. Not doing this would
+	        // be particularly problematic when the source root is a prefix of the
+	        // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	        .map(function(source) {
+	          return sourceRoot && util$2.isAbsolute(sourceRoot) && util$2.isAbsolute(source)
+	            ? util$2.relative(sourceRoot, source)
+	            : source;
+	        });
+
+	      // Pass `true` below to allow duplicate names and sources. While source maps
+	      // are intended to be compressed and deduplicated, the TypeScript compiler
+	      // sometimes generates source maps with duplicates in them. See Github issue
+	      // #72 and bugzil.la/889492.
+	      that._names = ArraySet$5.fromArray(names.map(String), true);
+	      that._sources = ArraySet$5.fromArray(sources, true);
+
+	      that._absoluteSources = that._sources.toArray().map(function(s) {
+	        return util$2.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	      });
+
+	      that.sourceRoot = sourceRoot;
+	      that.sourcesContent = sourcesContent;
+	      that._mappings = mappings;
+	      that._sourceMapURL = aSourceMapURL;
+	      that.file = file;
+
+	      that._computedColumnSpans = false;
+	      that._mappingsPtr = 0;
+	      that._wasm = null;
+
+	      return wasm().then(w => {
+	        that._wasm = w;
+	        return that;
+	      });
+	    });
+	  }
+
+	  /**
+	   * Utility function to find the index of a source.  Returns -1 if not
+	   * found.
+	   */
+	  _findSourceIndex(aSource) {
+	    let relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util$2.relative(this.sourceRoot, relativeSource);
+	    }
+
+	    if (this._sources.has(relativeSource)) {
+	      return this._sources.indexOf(relativeSource);
+	    }
+
+	    // Maybe aSource is an absolute URL as returned by |sources|.  In
+	    // this case we can't simply undo the transform.
+	    for (let i = 0; i < this._absoluteSources.length; ++i) {
+	      if (this._absoluteSources[i] == aSource) {
+	        return i;
+	      }
+	    }
+
+	    return -1;
+	  }
+
+	  /**
+	   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	   *
+	   * @param SourceMapGenerator aSourceMap
+	   *        The source map that will be consumed.
+	   * @param String aSourceMapURL
+	   *        The URL at which the source map can be found (optional)
+	   * @returns BasicSourceMapConsumer
+	   */
+	  static fromSourceMap(aSourceMap, aSourceMapURL) {
+	    return new BasicSourceMapConsumer$1(aSourceMap.toString());
+	  }
+
+	  get sources() {
+	    return this._absoluteSources.slice();
+	  }
+
+	  _getMappingsPtr() {
+	    if (this._mappingsPtr === 0) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this._mappingsPtr;
+	  }
+
+	  /**
+	   * Parse the mappings in a string in to a data structure which we can easily
+	   * query (the ordered arrays in the `this.__generatedMappings` and
+	   * `this.__originalMappings` properties).
+	   */
+	  _parseMappings(aStr, aSourceRoot) {
+	    const size = aStr.length;
+
+	    const mappingsBufPtr = this._wasm.exports.allocate_mappings(size);
+	    const mappingsBuf = new Uint8Array(this._wasm.exports.memory.buffer, mappingsBufPtr, size);
+	    for (let i = 0; i < size; i++) {
+	      mappingsBuf[i] = aStr.charCodeAt(i);
+	    }
+
+	    const mappingsPtr = this._wasm.exports.parse_mappings(mappingsBufPtr);
+
+	    if (!mappingsPtr) {
+	      const error = this._wasm.exports.get_last_error();
+	      let msg = `Error parsing mappings (code ${error}): `;
+
+	      // XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+	      switch (error) {
+	        case 1:
+	          msg += "the mappings contained a negative line, column, source index, or name index";
+	          break;
+	        case 2:
+	          msg += "the mappings contained a number larger than 2**32";
+	          break;
+	        case 3:
+	          msg += "reached EOF while in the middle of parsing a VLQ";
+	          break;
+	        case 4:
+	          msg += "invalid base 64 character while parsing a VLQ";
+	          break;
+	        default:
+	          msg += "unknown error code";
+	          break;
+	      }
+
+	      throw new Error(msg);
+	    }
+
+	    this._mappingsPtr = mappingsPtr;
+	  }
+
+	  eachMapping(aCallback, aContext, aOrder) {
+	    const context = aContext || null;
+	    const order = aOrder || SourceMapConsumer$2.GENERATED_ORDER;
+	    const sourceRoot = this.sourceRoot;
+
+	    this._wasm.withMappingCallback(
+	      mapping => {
+	        if (mapping.source !== null) {
+	          mapping.source = this._sources.at(mapping.source);
+	          mapping.source = util$2.computeSourceURL(sourceRoot, mapping.source, this._sourceMapURL);
+
+	          if (mapping.name !== null) {
+	            mapping.name = this._names.at(mapping.name);
+	          }
+	        }
+
+	        aCallback.call(context, mapping);
+	      },
+	      () => {
+	        switch (order) {
+	        case SourceMapConsumer$2.GENERATED_ORDER:
+	          this._wasm.exports.by_generated_location(this._getMappingsPtr());
+	          break;
+	        case SourceMapConsumer$2.ORIGINAL_ORDER:
+	          this._wasm.exports.by_original_location(this._getMappingsPtr());
+	          break;
+	        default:
+	          throw new Error("Unknown order of iteration.");
+	        }
+	      }
+	    );
+	  }
+
+	  allGeneratedPositionsFor(aArgs) {
+	    let source = util$2.getArg(aArgs, "source");
+	    const originalLine = util$2.getArg(aArgs, "line");
+	    const originalColumn = aArgs.column || 0;
+
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return [];
+	    }
+
+	    if (originalLine < 1) {
+	      throw new Error("Line numbers must be >= 1");
+	    }
+
+	    if (originalColumn < 0) {
+	      throw new Error("Column numbers must be >= 0");
+	    }
+
+	    const mappings = [];
+
+	    this._wasm.withMappingCallback(
+	      m => {
+	        let lastColumn = m.lastGeneratedColumn;
+	        if (this._computedColumnSpans && lastColumn === null) {
+	          lastColumn = Infinity;
+	        }
+	        mappings.push({
+	          line: m.generatedLine,
+	          column: m.generatedColumn,
+	          lastColumn,
+	        });
+	      }, () => {
+	        this._wasm.exports.all_generated_locations_for(
+	          this._getMappingsPtr(),
+	          source,
+	          originalLine - 1,
+	          "column" in aArgs,
+	          originalColumn
+	        );
+	      }
+	    );
+
+	    return mappings;
+	  }
+
+	  destroy() {
+	    if (this._mappingsPtr !== 0) {
+	      this._wasm.exports.free_mappings(this._mappingsPtr);
+	      this._mappingsPtr = 0;
+	    }
+	  }
+
+	  /**
+	   * Compute the last column for each generated mapping. The last column is
+	   * inclusive.
+	   */
+	  computeColumnSpans() {
+	    if (this._computedColumnSpans) {
+	      return;
+	    }
+
+	    this._wasm.exports.compute_column_spans(this._getMappingsPtr());
+	    this._computedColumnSpans = true;
+	  }
+
+	  /**
+	   * Returns the original source, line, and column information for the generated
+	   * source's line and column positions provided. The only argument is an object
+	   * with the following properties:
+	   *
+	   *   - line: The line number in the generated source.  The line number
+	   *     is 1-based.
+	   *   - column: The column number in the generated source.  The column
+	   *     number is 0-based.
+	   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	   *     closest element that is smaller than or greater than the one we are
+	   *     searching for, respectively, if the exact element cannot be found.
+	   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	   *
+	   * and an object is returned with the following properties:
+	   *
+	   *   - source: The original source file, or null.
+	   *   - line: The line number in the original source, or null.  The
+	   *     line number is 1-based.
+	   *   - column: The column number in the original source, or null.  The
+	   *     column number is 0-based.
+	   *   - name: The original identifier, or null.
+	   */
+	  originalPositionFor(aArgs) {
+	    const needle = {
+	      generatedLine: util$2.getArg(aArgs, "line"),
+	      generatedColumn: util$2.getArg(aArgs, "column")
+	    };
+
+	    if (needle.generatedLine < 1) {
+	      throw new Error("Line numbers must be >= 1");
+	    }
+
+	    if (needle.generatedColumn < 0) {
+	      throw new Error("Column numbers must be >= 0");
+	    }
+
+	    let bias = util$2.getArg(aArgs, "bias", SourceMapConsumer$2.GREATEST_LOWER_BOUND);
+	    if (bias == null) {
+	      bias = SourceMapConsumer$2.GREATEST_LOWER_BOUND;
+	    }
+
+	    let mapping;
+	    this._wasm.withMappingCallback(m => mapping = m, () => {
+	      this._wasm.exports.original_location_for(
+	        this._getMappingsPtr(),
+	        needle.generatedLine - 1,
+	        needle.generatedColumn,
+	        bias
+	      );
+	    });
+
+	    if (mapping) {
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        let source = util$2.getArg(mapping, "source", null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util$2.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+
+	        let name = util$2.getArg(mapping, "name", null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+
+	        return {
+	          source,
+	          line: util$2.getArg(mapping, "originalLine", null),
+	          column: util$2.getArg(mapping, "originalColumn", null),
+	          name
+	        };
+	      }
+	    }
+
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  }
+
+	  /**
+	   * Return true if we have the source content for every source in the source
+	   * map, false otherwise.
+	   */
+	  hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function(sc) { return sc == null; });
+	  }
+
+	  /**
+	   * Returns the original source content. The only argument is the url of the
+	   * original source file. Returns null if no original source content is
+	   * available.
+	   */
+	  sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+
+	    const index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+
+	    let relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util$2.relative(this.sourceRoot, relativeSource);
+	    }
+
+	    let url;
+	    if (this.sourceRoot != null
+	        && (url = util$2.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      const fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+	      }
+
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+
+	    throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	  }
+
+	  /**
+	   * Returns the generated line and column information for the original source,
+	   * line, and column positions provided. The only argument is an object with
+	   * the following properties:
+	   *
+	   *   - source: The filename of the original source.
+	   *   - line: The line number in the original source.  The line number
+	   *     is 1-based.
+	   *   - column: The column number in the original source.  The column
+	   *     number is 0-based.
+	   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	   *     closest element that is smaller than or greater than the one we are
+	   *     searching for, respectively, if the exact element cannot be found.
+	   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	   *
+	   * and an object is returned with the following properties:
+	   *
+	   *   - line: The line number in the generated source, or null.  The
+	   *     line number is 1-based.
+	   *   - column: The column number in the generated source, or null.
+	   *     The column number is 0-based.
+	   */
+	  generatedPositionFor(aArgs) {
+	    let source = util$2.getArg(aArgs, "source");
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+
+	    const needle = {
+	      source,
+	      originalLine: util$2.getArg(aArgs, "line"),
+	      originalColumn: util$2.getArg(aArgs, "column")
+	    };
+
+	    if (needle.originalLine < 1) {
+	      throw new Error("Line numbers must be >= 1");
+	    }
+
+	    if (needle.originalColumn < 0) {
+	      throw new Error("Column numbers must be >= 0");
+	    }
+
+	    let bias = util$2.getArg(aArgs, "bias", SourceMapConsumer$2.GREATEST_LOWER_BOUND);
+	    if (bias == null) {
+	      bias = SourceMapConsumer$2.GREATEST_LOWER_BOUND;
+	    }
+
+	    let mapping;
+	    this._wasm.withMappingCallback(m => mapping = m, () => {
+	      this._wasm.exports.generated_location_for(
+	        this._getMappingsPtr(),
+	        needle.source,
+	        needle.originalLine - 1,
+	        needle.originalColumn,
+	        bias
+	      );
+	    });
+
+	    if (mapping) {
+	      if (mapping.source === needle.source) {
+	        let lastColumn = mapping.lastGeneratedColumn;
+	        if (this._computedColumnSpans && lastColumn === null) {
+	          lastColumn = Infinity;
+	        }
+	        return {
+	          line: util$2.getArg(mapping, "generatedLine", null),
+	          column: util$2.getArg(mapping, "generatedColumn", null),
+	          lastColumn,
+	        };
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  }
+	}
+
+	BasicSourceMapConsumer$1.prototype.consumer = SourceMapConsumer$2;
+
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	class IndexedSourceMapConsumer$1 extends SourceMapConsumer$2 {
+	  constructor(aSourceMap, aSourceMapURL) {
+	    return super(INTERNAL).then(that => {
+	      let sourceMap = aSourceMap;
+	      if (typeof aSourceMap === "string") {
+	        sourceMap = util$2.parseSourceMapInput(aSourceMap);
+	      }
+
+	      const version = util$2.getArg(sourceMap, "version");
+	      const sections = util$2.getArg(sourceMap, "sections");
+
+	      if (version != that._version) {
+	        throw new Error("Unsupported version: " + version);
+	      }
+
+	      that._sources = new ArraySet$5();
+	      that._names = new ArraySet$5();
+	      that.__generatedMappings = null;
+	      that.__originalMappings = null;
+	      that.__generatedMappingsUnsorted = null;
+	      that.__originalMappingsUnsorted = null;
+
+	      let lastOffset = {
+	        line: -1,
+	        column: 0
+	      };
+	      return Promise.all(sections.map(s => {
+	        if (s.url) {
+	          // The url field will require support for asynchronicity.
+	          // See https://github.com/mozilla/source-map/issues/16
+	          throw new Error("Support for url field in sections not implemented.");
+	        }
+	        const offset = util$2.getArg(s, "offset");
+	        const offsetLine = util$2.getArg(offset, "line");
+	        const offsetColumn = util$2.getArg(offset, "column");
+
+	        if (offsetLine < lastOffset.line ||
+	            (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	          throw new Error("Section offsets must be ordered and non-overlapping.");
+	        }
+	        lastOffset = offset;
+
+	        const cons = new SourceMapConsumer$2(util$2.getArg(s, "map"), aSourceMapURL);
+	        return cons.then(consumer => {
+	          return {
+	            generatedOffset: {
+	              // The offset fields are 0-based, but we use 1-based indices when
+	              // encoding/decoding from VLQ.
+	              generatedLine: offsetLine + 1,
+	              generatedColumn: offsetColumn + 1
+	            },
+	            consumer
+	          };
+	        });
+	      })).then(s => {
+	        that._sections = s;
+	        return that;
+	      });
+	    });
+	  }
+
+	  // `__generatedMappings` and `__originalMappings` are arrays that hold the
+	  // parsed mapping coordinates from the source map's "mappings" attribute. They
+	  // are lazily instantiated, accessed via the `_generatedMappings` and
+	  // `_originalMappings` getters respectively, and we only parse the mappings
+	  // and create these arrays once queried for a source location. We jump through
+	  // these hoops because there can be many thousands of mappings, and parsing
+	  // them is expensive, so we only want to do it if we must.
+	  //
+	  // Each object in the arrays is of the form:
+	  //
+	  //     {
+	  //       generatedLine: The line number in the generated code,
+	  //       generatedColumn: The column number in the generated code,
+	  //       source: The path to the original source file that generated this
+	  //               chunk of code,
+	  //       originalLine: The line number in the original source that
+	  //                     corresponds to this chunk of generated code,
+	  //       originalColumn: The column number in the original source that
+	  //                       corresponds to this chunk of generated code,
+	  //       name: The name of the original symbol which generated this chunk of
+	  //             code.
+	  //     }
+	  //
+	  // All properties except for `generatedLine` and `generatedColumn` can be
+	  // `null`.
+	  //
+	  // `_generatedMappings` is ordered by the generated positions.
+	  //
+	  // `_originalMappings` is ordered by the original positions.
+	  get _generatedMappings() {
+	    if (!this.__generatedMappings) {
+	      this._sortGeneratedMappings();
+	    }
+
+	    return this.__generatedMappings;
+	  }
+
+	  get _originalMappings() {
+	    if (!this.__originalMappings) {
+	      this._sortOriginalMappings();
+	    }
+
+	    return this.__originalMappings;
+	  }
+
+	  get _generatedMappingsUnsorted() {
+	    if (!this.__generatedMappingsUnsorted) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__generatedMappingsUnsorted;
+	  }
+
+	  get _originalMappingsUnsorted() {
+	    if (!this.__originalMappingsUnsorted) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__originalMappingsUnsorted;
+	  }
+
+	  _sortGeneratedMappings() {
+	    const mappings = this._generatedMappingsUnsorted;
+	    mappings.sort(util$2.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = mappings;
+	  }
+
+	  _sortOriginalMappings() {
+	    const mappings = this._originalMappingsUnsorted;
+	    mappings.sort(util$2.compareByOriginalPositions);
+	    this.__originalMappings = mappings;
+	  }
+
+	  /**
+	   * The list of original sources.
+	   */
+	  get sources() {
+	    const sources = [];
+	    for (let i = 0; i < this._sections.length; i++) {
+	      for (let j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+
+	  /**
+	   * Returns the original source, line, and column information for the generated
+	   * source's line and column positions provided. The only argument is an object
+	   * with the following properties:
+	   *
+	   *   - line: The line number in the generated source.  The line number
+	   *     is 1-based.
+	   *   - column: The column number in the generated source.  The column
+	   *     number is 0-based.
+	   *
+	   * and an object is returned with the following properties:
+	   *
+	   *   - source: The original source file, or null.
+	   *   - line: The line number in the original source, or null.  The
+	   *     line number is 1-based.
+	   *   - column: The column number in the original source, or null.  The
+	   *     column number is 0-based.
+	   *   - name: The original identifier, or null.
+	   */
+	  originalPositionFor(aArgs) {
+	    const needle = {
+	      generatedLine: util$2.getArg(aArgs, "line"),
+	      generatedColumn: util$2.getArg(aArgs, "column")
+	    };
+
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    const sectionIndex = binarySearch$1.search(needle, this._sections,
+	      function(aNeedle, section) {
+	        const cmp = aNeedle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+
+	        return (aNeedle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    const section = this._sections[sectionIndex];
+
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  }
+
+	  /**
+	   * Return true if we have the source content for every source in the source
+	   * map, false otherwise.
+	   */
+	  hasContentsOfAllSources() {
+	    return this._sections.every(function(s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  }
+
+	  /**
+	   * Returns the original source content. The only argument is the url of the
+	   * original source file. Returns null if no original source content is
+	   * available.
+	   */
+	  sourceContentFor(aSource, nullOnMissing) {
+	    for (let i = 0; i < this._sections.length; i++) {
+	      const section = this._sections[i];
+
+	      const content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    throw new Error('"' + aSource + '" is not in the SourceMap.');
+	  }
+
+	  /**
+	   * Returns the generated line and column information for the original source,
+	   * line, and column positions provided. The only argument is an object with
+	   * the following properties:
+	   *
+	   *   - source: The filename of the original source.
+	   *   - line: The line number in the original source.  The line number
+	   *     is 1-based.
+	   *   - column: The column number in the original source.  The column
+	   *     number is 0-based.
+	   *
+	   * and an object is returned with the following properties:
+	   *
+	   *   - line: The line number in the generated source, or null.  The
+	   *     line number is 1-based.
+	   *   - column: The column number in the generated source, or null.
+	   *     The column number is 0-based.
+	   */
+	  generatedPositionFor(aArgs) {
+	    for (let i = 0; i < this._sections.length; i++) {
+	      const section = this._sections[i];
+
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util$2.getArg(aArgs, "source")) === -1) {
+	        continue;
+	      }
+	      const generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        const ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  }
+
+	  /**
+	   * Parse the mappings in a string in to a data structure which we can easily
+	   * query (the ordered arrays in the `this.__generatedMappings` and
+	   * `this.__originalMappings` properties).
+	   */
+	  _parseMappings(aStr, aSourceRoot) {
+	    const generatedMappings = this.__generatedMappingsUnsorted = [];
+	    const originalMappings = this.__originalMappingsUnsorted = [];
+	    for (let i = 0; i < this._sections.length; i++) {
+	      const section = this._sections[i];
+
+	      const sectionMappings = [];
+	      section.consumer.eachMapping(m => sectionMappings.push(m));
+
+	      for (let j = 0; j < sectionMappings.length; j++) {
+	        const mapping = sectionMappings[j];
+
+	        // TODO: test if null is correct here.  The original code used
+	        // `source`, which would actually have gotten used as null because
+	        // var's get hoisted.
+	        // See: https://github.com/mozilla/source-map/issues/333
+	        let source = util$2.computeSourceURL(section.consumer.sourceRoot, null, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+
+	        let name = null;
+	        if (mapping.name) {
+	          this._names.add(mapping.name);
+	          name = this._names.indexOf(mapping.name);
+	        }
+
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        const adjustedMapping = {
+	          source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name
+	        };
+
+	        generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === "number") {
+	          originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+	  }
+
+	  eachMapping(aCallback, aContext, aOrder) {
+	    const context = aContext || null;
+	    const order = aOrder || SourceMapConsumer$2.GENERATED_ORDER;
+
+	    let mappings;
+	    switch (order) {
+	    case SourceMapConsumer$2.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer$2.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+
+	    const sourceRoot = this.sourceRoot;
+	    mappings.map(function(mapping) {
+	      let source = null;
+	      if (mapping.source !== null) {
+	        source = this._sources.at(mapping.source);
+	        source = util$2.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      }
+	      return {
+	        source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  }
+
+	  /**
+	   * Find the mapping that best matches the hypothetical "needle" mapping that
+	   * we are searching for in the given "haystack" of mappings.
+	   */
+	  _findMapping(aNeedle, aMappings, aLineName,
+	              aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError("Line must be greater than or equal to 1, got "
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError("Column must be greater than or equal to 0, got "
+	                          + aNeedle[aColumnName]);
+	    }
+
+	    return binarySearch$1.search(aNeedle, aMappings, aComparator, aBias);
+	  }
+
+	  allGeneratedPositionsFor(aArgs) {
+	    const line = util$2.getArg(aArgs, "line");
+
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    const needle = {
+	      source: util$2.getArg(aArgs, "source"),
+	      originalLine: line,
+	      originalColumn: util$2.getArg(aArgs, "column", 0)
+	    };
+
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+
+	    if (needle.originalLine < 1) {
+	      throw new Error("Line numbers must be >= 1");
+	    }
+
+	    if (needle.originalColumn < 0) {
+	      throw new Error("Column numbers must be >= 0");
+	    }
+
+	    const mappings = [];
+
+	    let index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util$2.compareByOriginalPositions,
+	                                  binarySearch$1.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      let mapping = this._originalMappings[index];
+
+	      if (aArgs.column === undefined) {
+	        const originalLine = mapping.originalLine;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          let lastColumn = mapping.lastGeneratedColumn;
+	          if (this._computedColumnSpans && lastColumn === null) {
+	            lastColumn = Infinity;
+	          }
+	          mappings.push({
+	            line: util$2.getArg(mapping, "generatedLine", null),
+	            column: util$2.getArg(mapping, "generatedColumn", null),
+	            lastColumn,
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        const originalColumn = mapping.originalColumn;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          let lastColumn = mapping.lastGeneratedColumn;
+	          if (this._computedColumnSpans && lastColumn === null) {
+	            lastColumn = Infinity;
+	          }
+	          mappings.push({
+	            line: util$2.getArg(mapping, "generatedLine", null),
+	            column: util$2.getArg(mapping, "generatedColumn", null),
+	            lastColumn,
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+
+	    return mappings;
+	  }
+
+	  destroy() {
+	    for (let i = 0; i < this._sections.length; i++) {
+	      this._sections[i].consumer.destroy();
+	    }
+	  }
+	}
+
+	/*
+	 * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+	 * where it has access to non-hoisted classes, but it gets hoisted itself.
+	 */
+	function _factory(aSourceMap, aSourceMapURL) {
+	  let sourceMap = aSourceMap;
+	  if (typeof aSourceMap === "string") {
+	    sourceMap = util$2.parseSourceMapInput(aSourceMap);
+	  }
+
+	  const consumer = sourceMap.sections != null
+	      ? new IndexedSourceMapConsumer$1(sourceMap, aSourceMapURL)
+	      : new BasicSourceMapConsumer$1(sourceMap, aSourceMapURL);
+	  return Promise.resolve(consumer);
+	}
+
+	function _factoryBSM(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer$1.fromSourceMap(aSourceMap, aSourceMapURL);
+	}
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	var SourceMapGenerator$4 = sourceMapGenerator$1.SourceMapGenerator;
+
+	/**
+	 * Create a new sourcemap generator
+	 * @param   { Object } options - sourcemap options
+	 * @returns { SourceMapGenerator } SourceMapGenerator instance
+	 */
+	function createSourcemap(options) {
+	  return new SourceMapGenerator$4(options)
+	}
+
+	const Output = Object.freeze({
+	  code: '',
+	  ast: [],
+	  meta: {},
+	  map: null
+	});
+
+	/**
+	 * Create the right output data result of a parsing
+	 * @param   { Object } data - output data
+	 * @param   { string } data.code - code generated
+	 * @param   { AST } data.ast - ast representing the code
+	 * @param   { SourceMapGenerator } data.map - source map generated along with the code
+	 * @param   { Object } meta - compilation meta infomration
+	 * @returns { Output } output container object
+	 */
+	function createOutput(data, meta) {
+	  const output = {
+	    ...Output,
+	    ...data,
+	    meta
+	  };
+
+	  if (!output.map && meta && meta.options && meta.options.file)
+	    return {
+	      ...output,
+	      map: createSourcemap({ file: meta.options.file })
+	    }
+
+	  return output
+	}
+
+	/**
+	 * Transform the source code received via a compiler function
+	 * @param   { Function } compiler - function needed to generate the output code
+	 * @param   { Object } meta - compilation meta information
+	 * @param   { string } source - source code
+	 * @returns { Output } output - the result of the compiler
+	 */
+	function transform(compiler, meta, source) {
+	  const result = (compiler ? compiler(source, meta) : { code: source });
+	  return createOutput(result, meta)
+	}
+
+	/**
+	 * Throw an error with a descriptive message
+	 * @param   { string } message - error message
+	 * @returns { undefined } hoppla.. at this point the program should stop working
+	 */
+	function panic(message) {
+	  throw new Error(message)
+	}
+
+	const postprocessors = new Set();
+
+	/**
+	 * Register a postprocessor that will be used after the parsing and compilation of the riot tags
+	 * @param { Function } postprocessor - transformer that will receive the output code ans sourcemap
+	 * @returns { Set } the postprocessors collection
+	 */
+	function register(postprocessor) {
+	  if (postprocessors.has(postprocessor)) {
+	    panic(`This postprocessor "${postprocessor.name || postprocessor.toString()}" was already registered`);
+	  }
+
+	  postprocessors.add(postprocessor);
+
+	  return postprocessors
+	}
+
+	/**
+	 * Exec all the postprocessors in sequence combining the sourcemaps generated
+	 * @param   { Output } compilerOutput - output generated by the compiler
+	 * @param   { Object } meta - compiling meta information
+	 * @returns { Output } object containing output code and source map
+	 */
+	function execute(compilerOutput, meta) {
+	  return Array.from(postprocessors).reduce(function(acc, postprocessor) {
+	    const { code, map } = acc;
+	    const output = postprocessor(code, meta);
+
+	    return {
+	      code: output.code,
+	      map: composeSourcemaps(map, output.map)
+	    }
+	  }, createOutput(compilerOutput, meta))
+	}
+
+	/**
+	 * Parsers that can be registered by users to preparse components fragments
+	 * @type { Object }
+	 */
+	const preprocessors = Object.freeze({
+	  javascript: new Map(),
+	  css: new Map(),
+	  template: new Map().set('default', code => ({ code }))
+	});
+
+	// throw a processor type error
+	function preprocessorTypeError(type) {
+	  panic(`No preprocessor of type "${type}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`);
+	}
+
+	// throw an error if the preprocessor was not registered
+	function preprocessorNameNotFoundError(name) {
+	  panic(`No preprocessor named "${name}" was found, are you sure you have registered it?'`);
+	}
+
+	/**
+	 * Register a custom preprocessor
+	 * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+	 * @param   { string } name - unique preprocessor id
+	 * @param   { Function } preprocessor - preprocessor function
+	 * @returns { Map } - the preprocessors map
+	 */
+	function register$1(type, name, preprocessor) {
+	  if (!type) panic('Please define the type of preprocessor you want to register \'javascript\', \'css\' or \'template\'');
+	  if (!name) panic('Please define a name for your preprocessor');
+	  if (!preprocessor) panic('Please provide a preprocessor function');
+	  if (!preprocessors[type]) preprocessorTypeError(type);
+	  if (preprocessors[type].has(name)) panic(`The preprocessor ${name} was already registered before`);
+
+	  preprocessors[type].set(name, preprocessor);
+
+	  return preprocessors
+	}
+
+	/**
+	 * Exec the compilation of a preprocessor
+	 * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+	 * @param   { string } name - unique preprocessor id
+	 * @param   { Object } meta - preprocessor meta information
+	 * @param   { string } source - source code
+	 * @returns { Output } object containing a sourcemap and a code string
+	 */
+	function execute$1(type, name, meta, source) {
+	  if (!preprocessors[type]) preprocessorTypeError(type);
+	  if (!preprocessors[type].has(name)) preprocessorNameNotFoundError(name);
+
+	  return transform(preprocessors[type].get(name), meta, source)
+	}
+
+	/**
+	 * Similar to compose but performs from left-to-right function composition.<br/>
+	 * {@link https://30secondsofcode.org/function#composeright see also}
+	 * @param   {...[function]} fns) - list of unary function
+	 * @returns {*} result of the computation
+	 */
+
+	/**
+	 * Performs right-to-left function composition.<br/>
+	 * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+	 * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+	 * {@link https://30secondsofcode.org/function#compose original source code}
+	 * @param   {...[function]} fns) - list of unary function
+	 * @returns {*} result of the computation
+	 */
+	function compose(...fns) {
+	  return fns.reduce((f, g) => (...args) => f(g(...args)))
+	}
+
+	/*! https://mths.be/cssesc v3.0.0 by @mathias */
+
+	var object = {};
+	var hasOwnProperty$1 = object.hasOwnProperty;
+	var merge = function merge(options, defaults) {
+		if (!options) {
+			return defaults;
+		}
+		var result = {};
+		for (var key in defaults) {
+			// `if (defaults.hasOwnProperty(key) { … }` is not needed here, since
+			// only recognized option names are used.
+			result[key] = hasOwnProperty$1.call(options, key) ? options[key] : defaults[key];
+		}
+		return result;
+	};
+
+	var regexAnySingleEscape = /[ -,\.\/:-@\[-\^`\{-~]/;
+	var regexSingleEscape = /[ -,\.\/:-@\[\]\^`\{-~]/;
+	var regexExcessiveSpaces = /(^|\\+)?(\\[A-F0-9]{1,6})\x20(?![a-fA-F0-9\x20])/g;
+
+	// https://mathiasbynens.be/notes/css-escapes#css
+	var cssesc = function cssesc(string, options) {
+		options = merge(options, cssesc.options);
+		if (options.quotes != 'single' && options.quotes != 'double') {
+			options.quotes = 'single';
+		}
+		var quote = options.quotes == 'double' ? '"' : '\'';
+		var isIdentifier = options.isIdentifier;
+
+		var firstChar = string.charAt(0);
+		var output = '';
+		var counter = 0;
+		var length = string.length;
+		while (counter < length) {
+			var character = string.charAt(counter++);
+			var codePoint = character.charCodeAt();
+			var value = void 0;
+			// If it’s not a printable ASCII character…
+			if (codePoint < 0x20 || codePoint > 0x7E) {
+				if (codePoint >= 0xD800 && codePoint <= 0xDBFF && counter < length) {
+					// It’s a high surrogate, and there is a next character.
+					var extra = string.charCodeAt(counter++);
+					if ((extra & 0xFC00) == 0xDC00) {
+						// next character is low surrogate
+						codePoint = ((codePoint & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000;
+					} else {
+						// It’s an unmatched surrogate; only append this code unit, in case
+						// the next code unit is the high surrogate of a surrogate pair.
+						counter--;
+					}
+				}
+				value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+			} else {
+				if (options.escapeEverything) {
+					if (regexAnySingleEscape.test(character)) {
+						value = '\\' + character;
+					} else {
+						value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+					}
+				} else if (/[\t\n\f\r\x0B]/.test(character)) {
+					value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+				} else if (character == '\\' || !isIdentifier && (character == '"' && quote == character || character == '\'' && quote == character) || isIdentifier && regexSingleEscape.test(character)) {
+					value = '\\' + character;
+				} else {
+					value = character;
+				}
+			}
+			output += value;
+		}
+
+		if (isIdentifier) {
+			if (/^-[-\d]/.test(output)) {
+				output = '\\-' + output.slice(1);
+			} else if (/\d/.test(firstChar)) {
+				output = '\\3' + firstChar + ' ' + output.slice(1);
+			}
+		}
+
+		// Remove spaces after `\HEX` escapes that are not followed by a hex digit,
+		// since they’re redundant. Note that this is only possible if the escape
+		// sequence isn’t preceded by an odd number of backslashes.
+		output = output.replace(regexExcessiveSpaces, function ($0, $1, $2) {
+			if ($1 && $1.length % 2) {
+				// It’s not safe to remove the space, so don’t.
+				return $0;
+			}
+			// Strip the space.
+			return ($1 || '') + $2;
+		});
+
+		if (!isIdentifier && options.wrap) {
+			return quote + output + quote;
+		}
+		return output;
+	};
+
+	// Expose default options (so they can be overridden globally).
+	cssesc.options = {
+		'escapeEverything': false,
+		'isIdentifier': false,
+		'quotes': 'single',
+		'wrap': false
+	};
+
+	cssesc.version = '3.0.0';
+
+	var cssesc_1 = cssesc;
+
+	const ATTRIBUTE_TYPE_NAME = 'type';
+
+	/**
+	 * Get the type attribute from a node generated by the riot parser
+	 * @param   { Object} sourceNode - riot parser node
+	 * @returns { string|null } a valid type to identify the preprocessor to use or nothing
+	 */
+	function getPreprocessorTypeByAttribute(sourceNode) {
+	  const typeAttribute = sourceNode.attributes ?
+	    sourceNode.attributes.find(attribute => attribute.name === ATTRIBUTE_TYPE_NAME) :
+	    null;
+
+	  return typeAttribute ? normalize(typeAttribute.value) : null
+	}
+
+
+	/**
+	 * Remove the noise in case a user has defined the preprocessor type='text/scss'
+	 * @param   { string } value - input string
+	 * @returns { string } normalized string
+	 */
+	function normalize(value) {
+	  return value.replace('text/', '')
+	}
+
+	/**
+	 * Preprocess a riot parser node
+	 * @param   { string } preprocessorType - either css, js
+	 * @param   { string } preprocessorName - preprocessor id
+	 * @param   { Object } meta - compilation meta information
+	 * @param   { RiotParser.nodeTypes } node - css node detected by the parser
+	 * @returns { Output } code and sourcemap generated by the preprocessor
+	 */
+	function preprocess(preprocessorType, preprocessorName, meta, node) {
+	  const code = node.text;
+
+	  return (preprocessorName ?
+	    execute$1(preprocessorType, preprocessorName, meta, code) :
+	    { code }
+	  )
+	}
+
+	/**
+	 * Matches valid, multiline JavaScript comments in almost all its forms.
+	 * @const {RegExp}
+	 * @static
+	 */
+	const R_MLCOMMS = /\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//g;
+
+	/**
+	 * Source for creating regexes matching valid quoted, single-line JavaScript strings.
+	 * It recognizes escape characters, including nested quotes and line continuation.
+	 * @const {string}
+	 */
+	const S_LINESTR = /"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source;
+
+	/**
+	 * Matches CSS selectors, excluding those beginning with '@' and quoted strings.
+	 * @const {RegExp}
+	 */
+
+	const CSS_SELECTOR = RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${S_LINESTR}`, 'g');
+
+	/**
+	 * Parses styles enclosed in a "scoped" tag
+	 * The "css" string is received without comments or surrounding spaces.
+	 *
+	 * @param   {string} tag - Tag name of the root element
+	 * @param   {string} css - The CSS code
+	 * @returns {string} CSS with the styles scoped to the root element
+	 */
+	function scopedCSS(tag, css) {
+	  const host = ':host';
+	  const selectorsBlacklist = ['from', 'to'];
+
+	  return css.replace(CSS_SELECTOR, function(m, p1, p2) {
+	    // skip quoted strings
+	    if (!p2) return m
+
+	    // we have a selector list, parse each individually
+	    p2 = p2.replace(/[^,]+/g, function(sel) {
+	      const s = sel.trim();
+
+	      // skip selectors already using the tag name
+	      if (s.indexOf(tag) === 0) {
+	        return sel
+	      }
+
+	      // skips the keywords and percents of css animations
+	      if (!s || selectorsBlacklist.indexOf(s) > -1 || s.slice(-1) === '%') {
+	        return sel
+	      }
+
+	      // replace the `:host` pseudo-selector, where it is, with the root tag name;
+	      // if `:host` was not included, add the tag name as prefix, and mirror all
+	      // `[data-is]`
+	      if (s.indexOf(host) < 0) {
+	        return `${tag} ${s},[is="${tag}"] ${s}`
+	      } else {
+	        return `${s.replace(host, tag)},${
+          s.replace(host, `[is="${tag}"]`)}`
+	      }
+	    });
+
+	    // add the danling bracket char and return the processed selector list
+	    return p1 ? `${p1} ${p2}` : p2
+	  })
+	}
+
+	/**
+	 * Remove comments, compact and trim whitespace
+	 * @param { string } code - compiled css code
+	 * @returns { string } css code normalized
+	 */
+	function compactCss(code) {
+	  return code.replace(R_MLCOMMS, '').replace(/\s+/g, ' ').trim()
+	}
+
+	const escapeBackslashes = s => s.replace(/\\/g, '\\\\');
+	const escapeIdentifier = identifier => escapeBackslashes(cssesc_1(identifier, {
+	  isIdentifier: true
+	}));
+
+	/**
+	 * Generate the component css
+	 * @param   { Object } sourceNode - node generated by the riot compiler
+	 * @param   { string } source - original component source code
+	 * @param   { Object } meta - compilation meta information
+	 * @param   { AST } ast - current AST output
+	 * @returns { AST } the AST generated
+	 */
+	function css(sourceNode, source, meta, ast) {
+	  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+	  const { options } = meta;
+	  const preprocessorOutput = preprocess('css', preprocessorName, meta, sourceNode.text);
+	  const normalizedCssCode = compactCss(preprocessorOutput.code);
+	  const escapedCssIdentifier = escapeIdentifier(meta.tagName);
+
+	  const cssCode = (options.scopedCss ?
+	    scopedCSS(escapedCssIdentifier, escapeBackslashes(normalizedCssCode)) :
+	    escapeBackslashes(normalizedCssCode)
+	  ).trim();
+
+	  types$1.visit(ast, {
+	    visitProperty(path) {
+	      if (path.value.key.value === TAG_CSS_PROPERTY) {
+	        path.value.value = builders.templateLiteral(
+	          [builders.templateElement({ raw: cssCode, cooked: '' }, false)],
+	          []
+	        );
+
+	        return false
+	      }
+
+	      this.traverse(path);
+	    }
+	  });
+
+	  return ast
+	}
+
+	/**
+	 * Function to curry any javascript method
+	 * @param   {Function}  fn - the target function we want to curry
+	 * @param   {...[args]} acc - initial arguments
+	 * @returns {Function|*} it will return a function until the target function
+	 *                       will receive all of its arguments
+	 */
+	function curry(fn, ...acc) {
+	  return (...args) => {
+	    args = [...acc, ...args];
+
+	    return args.length < fn.length ?
+	      curry(fn, ...args) :
+	      fn(...args)
+	  }
+	}
+
+	/**
+	 * Generate the javascript from an ast source
+	 * @param   {AST} ast - ast object
+	 * @param   {Object} options - printer options
+	 * @returns {Object} code + map
+	 */
+	function generateJavascript(ast, options) {
+	  return main_4$1(ast, {
+	    ...options,
+	    tabWidth: 2,
+	    quote: 'single'
+	  })
+	}
+
+	/**
+	 * True if the sourcemap has no mappings, it is empty
+	 * @param   {Object}  map - sourcemap json
+	 * @returns {boolean} true if empty
+	 */
+	function isEmptySourcemap(map) {
+	  return !map || !map.mappings || !map.mappings.length
+	}
+
+	const LINES_RE = /\r\n?|\n/g;
+
+	/**
+	 * Split a string into a rows array generated from its EOL matches
+	 * @param   { string } string [description]
+	 * @returns { Array } array containing all the string rows
+	 */
+	function splitStringByEOL(string) {
+	  return string.split(LINES_RE)
+	}
+
+	/**
+	 * Get the line and the column of a source text based on its position in the string
+	 * @param   { string } string - target string
+	 * @param   { number } position - target position
+	 * @returns { Object } object containing the source text line and column
+	 */
+	function getLineAndColumnByPosition(string, position) {
+	  const lines = splitStringByEOL(string.slice(0, position));
+
+	  return {
+	    line: lines.length,
+	    column: lines[lines.length - 1].length
+	  }
+	}
+
+	/**
+	 * Add the offset to the code that must be parsed in order to generate properly the sourcemaps
+	 * @param {string} input - input string
+	 * @param {string} source - original source code
+	 * @param {RiotParser.Node} node - node that we are going to transform
+	 * @return {string} the input string with the offset properly set
+	 */
+	function addLineOffset(input, source, node) {
+	  const {column, line} = getLineAndColumnByPosition(source, node.start);
+	  return `${'\n'.repeat(line - 1)}${' '.repeat(column + 1)}${input}`
+	}
+
+	// Reserved word lists for various dialects of the language
+
+	var reservedWords = {
+	  3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",
+	  5: "class enum extends super const export import",
+	  6: "enum",
+	  strict: "implements interface let package private protected public static yield",
+	  strictBind: "eval arguments"
+	};
+
+	// And the keywords
+
+	var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+	var keywords = {
+	  5: ecma5AndLessKeywords,
+	  "5module": ecma5AndLessKeywords + " export import",
+	  6: ecma5AndLessKeywords + " const class extends export import super"
+	};
+
+	var keywordRelationalOperator = /^in(stanceof)?$/;
+
+	// ## Character categories
+
+	// Big ugly regular expressions that match characters in the
+	// whitespace, identifier, and identifier-start categories. These
+	// are only applied when a character is found to actually have a
+	// code point above 128.
+	// Generated by `bin/generate-identifier-regex.js`.
+	var nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u08a0-\u08b4\u08b6-\u08bd\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\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\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fef\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7bf\ua7c2-\ua7c6\ua7f7-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab67\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
+	var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08d3-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1df9\u1dfb-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+
+	var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+	var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+	nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+	// These are a run-length and offset encoded representation of the
+	// >0xffff code points that are a valid part of identifiers. The
+	// offset starts at 0x10000, and each pair of numbers represents an
+	// offset to the next range, and then a size of the range. They were
+	// generated by bin/generate-identifier-regex.js
+
+	// eslint-disable-next-line comma-spacing
+	var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,155,22,13,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,0,33,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,0,161,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,754,9486,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541];
+
+	// eslint-disable-next-line comma-spacing
+	var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,232,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,792487,239];
+
+	// This has a complexity linear to the value of the code. The
+	// assumption is that looking up astral identifier characters is
+	// rare.
+	function isInAstralSet(code, set) {
+	  var pos = 0x10000;
+	  for (var i = 0; i < set.length; i += 2) {
+	    pos += set[i];
+	    if (pos > code) { return false }
+	    pos += set[i + 1];
+	    if (pos >= code) { return true }
+	  }
+	}
+
+	// Test whether a given character code starts an identifier.
+
+	function isIdentifierStart(code, astral) {
+	  if (code < 65) { return code === 36 }
+	  if (code < 91) { return true }
+	  if (code < 97) { return code === 95 }
+	  if (code < 123) { return true }
+	  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
+	  if (astral === false) { return false }
+	  return isInAstralSet(code, astralIdentifierStartCodes)
+	}
+
+	// Test whether a given character is part of an identifier.
+
+	function isIdentifierChar(code, astral) {
+	  if (code < 48) { return code === 36 }
+	  if (code < 58) { return true }
+	  if (code < 65) { return false }
+	  if (code < 91) { return true }
+	  if (code < 97) { return code === 95 }
+	  if (code < 123) { return true }
+	  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }
+	  if (astral === false) { return false }
+	  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)
+	}
+
+	// ## Token types
+
+	// The assignment of fine-grained, information-carrying type objects
+	// allows the tokenizer to store the information it has about a
+	// token in a way that is very cheap for the parser to look up.
+
+	// All token type variables start with an underscore, to make them
+	// easy to recognize.
+
+	// The `beforeExpr` property is used to disambiguate between regular
+	// expressions and divisions. It is set on all token types that can
+	// be followed by an expression (thus, a slash after them would be a
+	// regular expression).
+	//
+	// The `startsExpr` property is used to check if the token ends a
+	// `yield` expression. It is set on all token types that either can
+	// directly start an expression (like a quotation mark) or can
+	// continue an expression (like the body of a string).
+	//
+	// `isLoop` marks a keyword as starting a loop, which is important
+	// to know when parsing a label, in order to allow or disallow
+	// continue jumps to that label.
+
+	var TokenType = function TokenType(label, conf) {
+	  if ( conf === void 0 ) conf = {};
+
+	  this.label = label;
+	  this.keyword = conf.keyword;
+	  this.beforeExpr = !!conf.beforeExpr;
+	  this.startsExpr = !!conf.startsExpr;
+	  this.isLoop = !!conf.isLoop;
+	  this.isAssign = !!conf.isAssign;
+	  this.prefix = !!conf.prefix;
+	  this.postfix = !!conf.postfix;
+	  this.binop = conf.binop || null;
+	  this.updateContext = null;
+	};
+
+	function binop(name, prec) {
+	  return new TokenType(name, {beforeExpr: true, binop: prec})
+	}
+	var beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};
+
+	// Map keyword names to token types.
+
+	var keywords$1 = {};
+
+	// Succinct definitions of keyword token types
+	function kw(name, options) {
+	  if ( options === void 0 ) options = {};
+
+	  options.keyword = name;
+	  return keywords$1[name] = new TokenType(name, options)
+	}
+
+	var types$2 = {
+	  num: new TokenType("num", startsExpr),
+	  regexp: new TokenType("regexp", startsExpr),
+	  string: new TokenType("string", startsExpr),
+	  name: new TokenType("name", startsExpr),
+	  eof: new TokenType("eof"),
+
+	  // Punctuation token types.
+	  bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}),
+	  bracketR: new TokenType("]"),
+	  braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}),
+	  braceR: new TokenType("}"),
+	  parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}),
+	  parenR: new TokenType(")"),
+	  comma: new TokenType(",", beforeExpr),
+	  semi: new TokenType(";", beforeExpr),
+	  colon: new TokenType(":", beforeExpr),
+	  dot: new TokenType("."),
+	  question: new TokenType("?", beforeExpr),
+	  arrow: new TokenType("=>", beforeExpr),
+	  template: new TokenType("template"),
+	  invalidTemplate: new TokenType("invalidTemplate"),
+	  ellipsis: new TokenType("...", beforeExpr),
+	  backQuote: new TokenType("`", startsExpr),
+	  dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}),
+
+	  // Operators. These carry several kinds of properties to help the
+	  // parser use them properly (the presence of these properties is
+	  // what categorizes them as operators).
+	  //
+	  // `binop`, when present, specifies that this operator is a binary
+	  // operator, and will refer to its precedence.
+	  //
+	  // `prefix` and `postfix` mark the operator as a prefix or postfix
+	  // unary operator.
+	  //
+	  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+	  // binary operators with a very low precedence, that should result
+	  // in AssignmentExpression nodes.
+
+	  eq: new TokenType("=", {beforeExpr: true, isAssign: true}),
+	  assign: new TokenType("_=", {beforeExpr: true, isAssign: true}),
+	  incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}),
+	  prefix: new TokenType("!/~", {beforeExpr: true, prefix: true, startsExpr: true}),
+	  logicalOR: binop("||", 1),
+	  logicalAND: binop("&&", 2),
+	  bitwiseOR: binop("|", 3),
+	  bitwiseXOR: binop("^", 4),
+	  bitwiseAND: binop("&", 5),
+	  equality: binop("==/!=/===/!==", 6),
+	  relational: binop("</>/<=/>=", 7),
+	  bitShift: binop("<</>>/>>>", 8),
+	  plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),
+	  modulo: binop("%", 10),
+	  star: binop("*", 10),
+	  slash: binop("/", 10),
+	  starstar: new TokenType("**", {beforeExpr: true}),
+
+	  // Keyword token types.
+	  _break: kw("break"),
+	  _case: kw("case", beforeExpr),
+	  _catch: kw("catch"),
+	  _continue: kw("continue"),
+	  _debugger: kw("debugger"),
+	  _default: kw("default", beforeExpr),
+	  _do: kw("do", {isLoop: true, beforeExpr: true}),
+	  _else: kw("else", beforeExpr),
+	  _finally: kw("finally"),
+	  _for: kw("for", {isLoop: true}),
+	  _function: kw("function", startsExpr),
+	  _if: kw("if"),
+	  _return: kw("return", beforeExpr),
+	  _switch: kw("switch"),
+	  _throw: kw("throw", beforeExpr),
+	  _try: kw("try"),
+	  _var: kw("var"),
+	  _const: kw("const"),
+	  _while: kw("while", {isLoop: true}),
+	  _with: kw("with"),
+	  _new: kw("new", {beforeExpr: true, startsExpr: true}),
+	  _this: kw("this", startsExpr),
+	  _super: kw("super", startsExpr),
+	  _class: kw("class", startsExpr),
+	  _extends: kw("extends", beforeExpr),
+	  _export: kw("export"),
+	  _import: kw("import", startsExpr),
+	  _null: kw("null", startsExpr),
+	  _true: kw("true", startsExpr),
+	  _false: kw("false", startsExpr),
+	  _in: kw("in", {beforeExpr: true, binop: 7}),
+	  _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}),
+	  _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}),
+	  _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}),
+	  _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true})
+	};
+
+	// Matches a whole line break (where CRLF is considered a single
+	// line break). Used to count lines.
+
+	var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+	var lineBreakG = new RegExp(lineBreak.source, "g");
+
+	function isNewLine(code, ecma2019String) {
+	  return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))
+	}
+
+	var nonASCIIwhitespace = /[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+	var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+
+	var ref = Object.prototype;
+	var hasOwnProperty$2 = ref.hasOwnProperty;
+	var toString$1 = ref.toString;
+
+	// Checks if an object has a property.
+
+	function has$1(obj, propName) {
+	  return hasOwnProperty$2.call(obj, propName)
+	}
+
+	var isArray$2 = Array.isArray || (function (obj) { return (
+	  toString$1.call(obj) === "[object Array]"
+	); });
+
+	function wordsRegexp(words) {
+	  return new RegExp("^(?:" + words.replace(/ /g, "|") + ")$")
+	}
+
+	// These are used when `options.locations` is on, for the
+	// `startLoc` and `endLoc` properties.
+
+	var Position = function Position(line, col) {
+	  this.line = line;
+	  this.column = col;
+	};
+
+	Position.prototype.offset = function offset (n) {
+	  return new Position(this.line, this.column + n)
+	};
+
+	var SourceLocation = function SourceLocation(p, start, end) {
+	  this.start = start;
+	  this.end = end;
+	  if (p.sourceFile !== null) { this.source = p.sourceFile; }
+	};
+
+	// The `getLineInfo` function is mostly useful when the
+	// `locations` option is off (for performance reasons) and you
+	// want to find the line/column position for a given character
+	// offset. `input` should be the code string that the offset refers
+	// into.
+
+	function getLineInfo(input, offset) {
+	  for (var line = 1, cur = 0;;) {
+	    lineBreakG.lastIndex = cur;
+	    var match = lineBreakG.exec(input);
+	    if (match && match.index < offset) {
+	      ++line;
+	      cur = match.index + match[0].length;
+	    } else {
+	      return new Position(line, offset - cur)
+	    }
+	  }
+	}
+
+	// A second optional argument can be given to further configure
+	// the parser process. These options are recognized:
+
+	var defaultOptions = {
+	  // `ecmaVersion` indicates the ECMAScript version to parse. Must be
+	  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10
+	  // (2019). This influences support for strict mode, the set of
+	  // reserved words, and support for new syntax features. The default
+	  // is 10.
+	  ecmaVersion: 10,
+	  // `sourceType` indicates the mode the code should be parsed in.
+	  // Can be either `"script"` or `"module"`. This influences global
+	  // strict mode and parsing of `import` and `export` declarations.
+	  sourceType: "script",
+	  // `onInsertedSemicolon` can be a callback that will be called
+	  // when a semicolon is automatically inserted. It will be passed
+	  // the position of the comma as an offset, and if `locations` is
+	  // enabled, it is given the location as a `{line, column}` object
+	  // as second argument.
+	  onInsertedSemicolon: null,
+	  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+	  // trailing commas.
+	  onTrailingComma: null,
+	  // By default, reserved words are only enforced if ecmaVersion >= 5.
+	  // Set `allowReserved` to a boolean value to explicitly turn this on
+	  // an off. When this option has the value "never", reserved words
+	  // and keywords can also not be used as property names.
+	  allowReserved: null,
+	  // When enabled, a return at the top level is not considered an
+	  // error.
+	  allowReturnOutsideFunction: false,
+	  // When enabled, import/export statements are not constrained to
+	  // appearing at the top of the program.
+	  allowImportExportEverywhere: false,
+	  // When enabled, await identifiers are allowed to appear at the top-level scope,
+	  // but they are still not allowed in non-async functions.
+	  allowAwaitOutsideFunction: false,
+	  // When enabled, hashbang directive in the beginning of file
+	  // is allowed and treated as a line comment.
+	  allowHashBang: false,
+	  // When `locations` is on, `loc` properties holding objects with
+	  // `start` and `end` properties in `{line, column}` form (with
+	  // line being 1-based and column 0-based) will be attached to the
+	  // nodes.
+	  locations: false,
+	  // A function can be passed as `onToken` option, which will
+	  // cause Acorn to call that function with object in the same
+	  // format as tokens returned from `tokenizer().getToken()`. Note
+	  // that you are not allowed to call the parser from the
+	  // callback—that will corrupt its internal state.
+	  onToken: null,
+	  // A function can be passed as `onComment` option, which will
+	  // cause Acorn to call that function with `(block, text, start,
+	  // end)` parameters whenever a comment is skipped. `block` is a
+	  // boolean indicating whether this is a block (`/* */`) comment,
+	  // `text` is the content of the comment, and `start` and `end` are
+	  // character offsets that denote the start and end of the comment.
+	  // When the `locations` option is on, two more parameters are
+	  // passed, the full `{line, column}` locations of the start and
+	  // end of the comments. Note that you are not allowed to call the
+	  // parser from the callback—that will corrupt its internal state.
+	  onComment: null,
+	  // Nodes have their start and end characters offsets recorded in
+	  // `start` and `end` properties (directly on the node, rather than
+	  // the `loc` object, which holds line/column data. To also add a
+	  // [semi-standardized][range] `range` property holding a `[start,
+	  // end]` array with the same numbers, set the `ranges` option to
+	  // `true`.
+	  //
+	  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+	  ranges: false,
+	  // It is possible to parse multiple files into a single AST by
+	  // passing the tree produced by parsing the first file as
+	  // `program` option in subsequent parses. This will add the
+	  // toplevel forms of the parsed file to the `Program` (top) node
+	  // of an existing parse tree.
+	  program: null,
+	  // When `locations` is on, you can pass this to record the source
+	  // file in every node's `loc` object.
+	  sourceFile: null,
+	  // This value, if given, is stored in every node, whether
+	  // `locations` is on or off.
+	  directSourceFile: null,
+	  // When enabled, parenthesized expressions are represented by
+	  // (non-standard) ParenthesizedExpression nodes
+	  preserveParens: false
+	};
+
+	// Interpret and default an options object
+
+	function getOptions(opts) {
+	  var options = {};
+
+	  for (var opt in defaultOptions)
+	    { options[opt] = opts && has$1(opts, opt) ? opts[opt] : defaultOptions[opt]; }
+
+	  if (options.ecmaVersion >= 2015)
+	    { options.ecmaVersion -= 2009; }
+
+	  if (options.allowReserved == null)
+	    { options.allowReserved = options.ecmaVersion < 5; }
+
+	  if (isArray$2(options.onToken)) {
+	    var tokens = options.onToken;
+	    options.onToken = function (token) { return tokens.push(token); };
+	  }
+	  if (isArray$2(options.onComment))
+	    { options.onComment = pushComment(options, options.onComment); }
+
+	  return options
+	}
+
+	function pushComment(options, array) {
+	  return function(block, text, start, end, startLoc, endLoc) {
+	    var comment = {
+	      type: block ? "Block" : "Line",
+	      value: text,
+	      start: start,
+	      end: end
+	    };
+	    if (options.locations)
+	      { comment.loc = new SourceLocation(this, startLoc, endLoc); }
+	    if (options.ranges)
+	      { comment.range = [start, end]; }
+	    array.push(comment);
+	  }
+	}
+
+	// Each scope gets a bitset that may contain these flags
+	var
+	    SCOPE_TOP = 1,
+	    SCOPE_FUNCTION = 2,
+	    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,
+	    SCOPE_ASYNC = 4,
+	    SCOPE_GENERATOR = 8,
+	    SCOPE_ARROW = 16,
+	    SCOPE_SIMPLE_CATCH = 32,
+	    SCOPE_SUPER = 64,
+	    SCOPE_DIRECT_SUPER = 128;
+
+	function functionFlags(async, generator) {
+	  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)
+	}
+
+	// Used in checkLVal and declareName to determine the type of a binding
+	var
+	    BIND_NONE = 0, // Not a binding
+	    BIND_VAR = 1, // Var-style binding
+	    BIND_LEXICAL = 2, // Let- or const-style binding
+	    BIND_FUNCTION = 3, // Function declaration
+	    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding
+	    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function
+
+	var Parser = function Parser(options, input, startPos) {
+	  this.options = options = getOptions(options);
+	  this.sourceFile = options.sourceFile;
+	  this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : options.sourceType === "module" ? "5module" : 5]);
+	  var reserved = "";
+	  if (options.allowReserved !== true) {
+	    for (var v = options.ecmaVersion;; v--)
+	      { if (reserved = reservedWords[v]) { break } }
+	    if (options.sourceType === "module") { reserved += " await"; }
+	  }
+	  this.reservedWords = wordsRegexp(reserved);
+	  var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict;
+	  this.reservedWordsStrict = wordsRegexp(reservedStrict);
+	  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + " " + reservedWords.strictBind);
+	  this.input = String(input);
+
+	  // Used to signal to callers of `readWord1` whether the word
+	  // contained any escape sequences. This is needed because words with
+	  // escape sequences must not be interpreted as keywords.
+	  this.containsEsc = false;
+
+	  // Set up token state
+
+	  // The current position of the tokenizer in the input.
+	  if (startPos) {
+	    this.pos = startPos;
+	    this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1;
+	    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;
+	  } else {
+	    this.pos = this.lineStart = 0;
+	    this.curLine = 1;
+	  }
+
+	  // Properties of the current token:
+	  // Its type
+	  this.type = types$2.eof;
+	  // For tokens that include more information than their type, the value
+	  this.value = null;
+	  // Its start and end offset
+	  this.start = this.end = this.pos;
+	  // And, if locations are used, the {line, column} object
+	  // corresponding to those offsets
+	  this.startLoc = this.endLoc = this.curPosition();
+
+	  // Position information for the previous token
+	  this.lastTokEndLoc = this.lastTokStartLoc = null;
+	  this.lastTokStart = this.lastTokEnd = this.pos;
+
+	  // The context stack is used to superficially track syntactic
+	  // context to predict whether a regular expression is allowed in a
+	  // given position.
+	  this.context = this.initialContext();
+	  this.exprAllowed = true;
+
+	  // Figure out if it's a module code.
+	  this.inModule = options.sourceType === "module";
+	  this.strict = this.inModule || this.strictDirective(this.pos);
+
+	  // Used to signify the start of a potential arrow function
+	  this.potentialArrowAt = -1;
+
+	  // Positions to delayed-check that yield/await does not exist in default parameters.
+	  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;
+	  // Labels in scope.
+	  this.labels = [];
+	  // Thus-far undefined exports.
+	  this.undefinedExports = {};
+
+	  // If enabled, skip leading hashbang line.
+	  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!")
+	    { this.skipLineComment(2); }
+
+	  // Scope tracking for duplicate variable names (see scope.js)
+	  this.scopeStack = [];
+	  this.enterScope(SCOPE_TOP);
+
+	  // For RegExp validation
+	  this.regexpState = null;
+	};
+
+	var prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true } };
+
+	Parser.prototype.parse = function parse () {
+	  var node = this.options.program || this.startNode();
+	  this.nextToken();
+	  return this.parseTopLevel(node)
+	};
+
+	prototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };
+	prototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };
+	prototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };
+	prototypeAccessors.allowSuper.get = function () { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 };
+	prototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };
+	prototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };
+
+	// Switch to a getter for 7.0.0.
+	Parser.prototype.inNonArrowFunction = function inNonArrowFunction () { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 };
+
+	Parser.extend = function extend () {
+	    var plugins = [], len = arguments.length;
+	    while ( len-- ) plugins[ len ] = arguments[ len ];
+
+	  var cls = this;
+	  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }
+	  return cls
+	};
+
+	Parser.parse = function parse (input, options) {
+	  return new this(options, input).parse()
+	};
+
+	Parser.parseExpressionAt = function parseExpressionAt (input, pos, options) {
+	  var parser = new this(options, input, pos);
+	  parser.nextToken();
+	  return parser.parseExpression()
+	};
+
+	Parser.tokenizer = function tokenizer (input, options) {
+	  return new this(options, input)
+	};
+
+	Object.defineProperties( Parser.prototype, prototypeAccessors );
+
+	var pp = Parser.prototype;
+
+	// ## Parser utilities
+
+	var literal = /^(?:'((?:\\.|[^'])*?)'|"((?:\\.|[^"])*?)")/;
+	pp.strictDirective = function(start) {
+	  for (;;) {
+	    // Try to find string literal.
+	    skipWhiteSpace.lastIndex = start;
+	    start += skipWhiteSpace.exec(this.input)[0].length;
+	    var match = literal.exec(this.input.slice(start));
+	    if (!match) { return false }
+	    if ((match[1] || match[2]) === "use strict") { return true }
+	    start += match[0].length;
+
+	    // Skip semicolon, if any.
+	    skipWhiteSpace.lastIndex = start;
+	    start += skipWhiteSpace.exec(this.input)[0].length;
+	    if (this.input[start] === ";")
+	      { start++; }
+	  }
+	};
+
+	// Predicate that tests whether the next token is of the given
+	// type, and if yes, consumes it as a side effect.
+
+	pp.eat = function(type) {
+	  if (this.type === type) {
+	    this.next();
+	    return true
+	  } else {
+	    return false
+	  }
+	};
+
+	// Tests whether parsed token is a contextual keyword.
+
+	pp.isContextual = function(name) {
+	  return this.type === types$2.name && this.value === name && !this.containsEsc
+	};
+
+	// Consumes contextual keyword if possible.
+
+	pp.eatContextual = function(name) {
+	  if (!this.isContextual(name)) { return false }
+	  this.next();
+	  return true
+	};
+
+	// Asserts that following token is given contextual keyword.
+
+	pp.expectContextual = function(name) {
+	  if (!this.eatContextual(name)) { this.unexpected(); }
+	};
+
+	// Test whether a semicolon can be inserted at the current position.
+
+	pp.canInsertSemicolon = function() {
+	  return this.type === types$2.eof ||
+	    this.type === types$2.braceR ||
+	    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+	};
+
+	pp.insertSemicolon = function() {
+	  if (this.canInsertSemicolon()) {
+	    if (this.options.onInsertedSemicolon)
+	      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }
+	    return true
+	  }
+	};
+
+	// Consume a semicolon, or, failing that, see if we are allowed to
+	// pretend that there is a semicolon at this position.
+
+	pp.semicolon = function() {
+	  if (!this.eat(types$2.semi) && !this.insertSemicolon()) { this.unexpected(); }
+	};
+
+	pp.afterTrailingComma = function(tokType, notNext) {
+	  if (this.type === tokType) {
+	    if (this.options.onTrailingComma)
+	      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }
+	    if (!notNext)
+	      { this.next(); }
+	    return true
+	  }
+	};
+
+	// Expect a token of a given type. If found, consume it, otherwise,
+	// raise an unexpected token error.
+
+	pp.expect = function(type) {
+	  this.eat(type) || this.unexpected();
+	};
+
+	// Raise an unexpected token error.
+
+	pp.unexpected = function(pos) {
+	  this.raise(pos != null ? pos : this.start, "Unexpected token");
+	};
+
+	function DestructuringErrors() {
+	  this.shorthandAssign =
+	  this.trailingComma =
+	  this.parenthesizedAssign =
+	  this.parenthesizedBind =
+	  this.doubleProto =
+	    -1;
+	}
+
+	pp.checkPatternErrors = function(refDestructuringErrors, isAssign) {
+	  if (!refDestructuringErrors) { return }
+	  if (refDestructuringErrors.trailingComma > -1)
+	    { this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element"); }
+	  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;
+	  if (parens > -1) { this.raiseRecoverable(parens, "Parenthesized pattern"); }
+	};
+
+	pp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {
+	  if (!refDestructuringErrors) { return false }
+	  var shorthandAssign = refDestructuringErrors.shorthandAssign;
+	  var doubleProto = refDestructuringErrors.doubleProto;
+	  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }
+	  if (shorthandAssign >= 0)
+	    { this.raise(shorthandAssign, "Shorthand property assignments are valid only in destructuring patterns"); }
+	  if (doubleProto >= 0)
+	    { this.raiseRecoverable(doubleProto, "Redefinition of __proto__ property"); }
+	};
+
+	pp.checkYieldAwaitInDefaultParams = function() {
+	  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))
+	    { this.raise(this.yieldPos, "Yield expression cannot be a default value"); }
+	  if (this.awaitPos)
+	    { this.raise(this.awaitPos, "Await expression cannot be a default value"); }
+	};
+
+	pp.isSimpleAssignTarget = function(expr) {
+	  if (expr.type === "ParenthesizedExpression")
+	    { return this.isSimpleAssignTarget(expr.expression) }
+	  return expr.type === "Identifier" || expr.type === "MemberExpression"
+	};
+
+	var pp$1 = Parser.prototype;
+
+	// ### Statement parsing
+
+	// Parse a program. Initializes the parser, reads any number of
+	// statements, and wraps them in a Program node.  Optionally takes a
+	// `program` argument.  If present, the statements will be appended
+	// to its body instead of creating a new node.
+
+	pp$1.parseTopLevel = function(node) {
+	  var exports = {};
+	  if (!node.body) { node.body = []; }
+	  while (this.type !== types$2.eof) {
+	    var stmt = this.parseStatement(null, true, exports);
+	    node.body.push(stmt);
+	  }
+	  if (this.inModule)
+	    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)
+	      {
+	        var name = list[i];
+
+	        this.raiseRecoverable(this.undefinedExports[name].start, ("Export '" + name + "' is not defined"));
+	      } }
+	  this.adaptDirectivePrologue(node.body);
+	  this.next();
+	  node.sourceType = this.options.sourceType;
+	  return this.finishNode(node, "Program")
+	};
+
+	var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+
+	pp$1.isLet = function(context) {
+	  if (this.options.ecmaVersion < 6 || !this.isContextual("let")) { return false }
+	  skipWhiteSpace.lastIndex = this.pos;
+	  var skip = skipWhiteSpace.exec(this.input);
+	  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+	  // For ambiguous cases, determine if a LexicalDeclaration (or only a
+	  // Statement) is allowed here. If context is not empty then only a Statement
+	  // is allowed. However, `let [` is an explicit negative lookahead for
+	  // ExpressionStatement, so special-case it first.
+	  if (nextCh === 91) { return true } // '['
+	  if (context) { return false }
+
+	  if (nextCh === 123) { return true } // '{'
+	  if (isIdentifierStart(nextCh, true)) {
+	    var pos = next + 1;
+	    while (isIdentifierChar(this.input.charCodeAt(pos), true)) { ++pos; }
+	    var ident = this.input.slice(next, pos);
+	    if (!keywordRelationalOperator.test(ident)) { return true }
+	  }
+	  return false
+	};
+
+	// check 'async [no LineTerminator here] function'
+	// - 'async /*foo*/ function' is OK.
+	// - 'async /*\n*/ function' is invalid.
+	pp$1.isAsyncFunction = function() {
+	  if (this.options.ecmaVersion < 8 || !this.isContextual("async"))
+	    { return false }
+
+	  skipWhiteSpace.lastIndex = this.pos;
+	  var skip = skipWhiteSpace.exec(this.input);
+	  var next = this.pos + skip[0].length;
+	  return !lineBreak.test(this.input.slice(this.pos, next)) &&
+	    this.input.slice(next, next + 8) === "function" &&
+	    (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))
+	};
+
+	// Parse a single statement.
+	//
+	// If expecting a statement and finding a slash operator, parse a
+	// regular expression literal. This is to handle cases like
+	// `if (foo) /blah/.exec(foo)`, where looking at the previous token
+	// does not help.
+
+	pp$1.parseStatement = function(context, topLevel, exports) {
+	  var starttype = this.type, node = this.startNode(), kind;
+
+	  if (this.isLet(context)) {
+	    starttype = types$2._var;
+	    kind = "let";
+	  }
+
+	  // Most types of statements are recognized by the keyword they
+	  // start with. Many are trivial to parse, some require a bit of
+	  // complexity.
+
+	  switch (starttype) {
+	  case types$2._break: case types$2._continue: return this.parseBreakContinueStatement(node, starttype.keyword)
+	  case types$2._debugger: return this.parseDebuggerStatement(node)
+	  case types$2._do: return this.parseDoStatement(node)
+	  case types$2._for: return this.parseForStatement(node)
+	  case types$2._function:
+	    // Function as sole body of either an if statement or a labeled statement
+	    // works, but not when it is part of a labeled statement that is the sole
+	    // body of an if statement.
+	    if ((context && (this.strict || context !== "if" && context !== "label")) && this.options.ecmaVersion >= 6) { this.unexpected(); }
+	    return this.parseFunctionStatement(node, false, !context)
+	  case types$2._class:
+	    if (context) { this.unexpected(); }
+	    return this.parseClass(node, true)
+	  case types$2._if: return this.parseIfStatement(node)
+	  case types$2._return: return this.parseReturnStatement(node)
+	  case types$2._switch: return this.parseSwitchStatement(node)
+	  case types$2._throw: return this.parseThrowStatement(node)
+	  case types$2._try: return this.parseTryStatement(node)
+	  case types$2._const: case types$2._var:
+	    kind = kind || this.value;
+	    if (context && kind !== "var") { this.unexpected(); }
+	    return this.parseVarStatement(node, kind)
+	  case types$2._while: return this.parseWhileStatement(node)
+	  case types$2._with: return this.parseWithStatement(node)
+	  case types$2.braceL: return this.parseBlock(true, node)
+	  case types$2.semi: return this.parseEmptyStatement(node)
+	  case types$2._export:
+	  case types$2._import:
+	    if (this.options.ecmaVersion > 10 && starttype === types$2._import) {
+	      skipWhiteSpace.lastIndex = this.pos;
+	      var skip = skipWhiteSpace.exec(this.input);
+	      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+	      if (nextCh === 40) // '('
+	        { return this.parseExpressionStatement(node, this.parseExpression()) }
+	    }
+
+	    if (!this.options.allowImportExportEverywhere) {
+	      if (!topLevel)
+	        { this.raise(this.start, "'import' and 'export' may only appear at the top level"); }
+	      if (!this.inModule)
+	        { this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'"); }
+	    }
+	    return starttype === types$2._import ? this.parseImport(node) : this.parseExport(node, exports)
+
+	    // If the statement does not start with a statement keyword or a
+	    // brace, it's an ExpressionStatement or LabeledStatement. We
+	    // simply start parsing an expression, and afterwards, if the
+	    // next token is a colon and the expression was a simple
+	    // Identifier node, we switch to interpreting it as a label.
+	  default:
+	    if (this.isAsyncFunction()) {
+	      if (context) { this.unexpected(); }
+	      this.next();
+	      return this.parseFunctionStatement(node, true, !context)
+	    }
+
+	    var maybeName = this.value, expr = this.parseExpression();
+	    if (starttype === types$2.name && expr.type === "Identifier" && this.eat(types$2.colon))
+	      { return this.parseLabeledStatement(node, maybeName, expr, context) }
+	    else { return this.parseExpressionStatement(node, expr) }
+	  }
+	};
+
+	pp$1.parseBreakContinueStatement = function(node, keyword) {
+	  var isBreak = keyword === "break";
+	  this.next();
+	  if (this.eat(types$2.semi) || this.insertSemicolon()) { node.label = null; }
+	  else if (this.type !== types$2.name) { this.unexpected(); }
+	  else {
+	    node.label = this.parseIdent();
+	    this.semicolon();
+	  }
+
+	  // Verify that there is an actual destination to break or
+	  // continue to.
+	  var i = 0;
+	  for (; i < this.labels.length; ++i) {
+	    var lab = this.labels[i];
+	    if (node.label == null || lab.name === node.label.name) {
+	      if (lab.kind != null && (isBreak || lab.kind === "loop")) { break }
+	      if (node.label && isBreak) { break }
+	    }
+	  }
+	  if (i === this.labels.length) { this.raise(node.start, "Unsyntactic " + keyword); }
+	  return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement")
+	};
+
+	pp$1.parseDebuggerStatement = function(node) {
+	  this.next();
+	  this.semicolon();
+	  return this.finishNode(node, "DebuggerStatement")
+	};
+
+	pp$1.parseDoStatement = function(node) {
+	  this.next();
+	  this.labels.push(loopLabel);
+	  node.body = this.parseStatement("do");
+	  this.labels.pop();
+	  this.expect(types$2._while);
+	  node.test = this.parseParenExpression();
+	  if (this.options.ecmaVersion >= 6)
+	    { this.eat(types$2.semi); }
+	  else
+	    { this.semicolon(); }
+	  return this.finishNode(node, "DoWhileStatement")
+	};
+
+	// Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+	// loop is non-trivial. Basically, we have to parse the init `var`
+	// statement or expression, disallowing the `in` operator (see
+	// the second parameter to `parseExpression`), and then check
+	// whether the next token is `in` or `of`. When there is no init
+	// part (semicolon immediately after the opening parenthesis), it
+	// is a regular `for` loop.
+
+	pp$1.parseForStatement = function(node) {
+	  this.next();
+	  var awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual("await")) ? this.lastTokStart : -1;
+	  this.labels.push(loopLabel);
+	  this.enterScope(0);
+	  this.expect(types$2.parenL);
+	  if (this.type === types$2.semi) {
+	    if (awaitAt > -1) { this.unexpected(awaitAt); }
+	    return this.parseFor(node, null)
+	  }
+	  var isLet = this.isLet();
+	  if (this.type === types$2._var || this.type === types$2._const || isLet) {
+	    var init$1 = this.startNode(), kind = isLet ? "let" : this.value;
+	    this.next();
+	    this.parseVar(init$1, true, kind);
+	    this.finishNode(init$1, "VariableDeclaration");
+	    if ((this.type === types$2._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1) {
+	      if (this.options.ecmaVersion >= 9) {
+	        if (this.type === types$2._in) {
+	          if (awaitAt > -1) { this.unexpected(awaitAt); }
+	        } else { node.await = awaitAt > -1; }
+	      }
+	      return this.parseForIn(node, init$1)
+	    }
+	    if (awaitAt > -1) { this.unexpected(awaitAt); }
+	    return this.parseFor(node, init$1)
+	  }
+	  var refDestructuringErrors = new DestructuringErrors;
+	  var init = this.parseExpression(true, refDestructuringErrors);
+	  if (this.type === types$2._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) {
+	    if (this.options.ecmaVersion >= 9) {
+	      if (this.type === types$2._in) {
+	        if (awaitAt > -1) { this.unexpected(awaitAt); }
+	      } else { node.await = awaitAt > -1; }
+	    }
+	    this.toAssignable(init, false, refDestructuringErrors);
+	    this.checkLVal(init);
+	    return this.parseForIn(node, init)
+	  } else {
+	    this.checkExpressionErrors(refDestructuringErrors, true);
+	  }
+	  if (awaitAt > -1) { this.unexpected(awaitAt); }
+	  return this.parseFor(node, init)
+	};
+
+	pp$1.parseFunctionStatement = function(node, isAsync, declarationPosition) {
+	  this.next();
+	  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)
+	};
+
+	pp$1.parseIfStatement = function(node) {
+	  this.next();
+	  node.test = this.parseParenExpression();
+	  // allow function declarations in branches, but only in non-strict mode
+	  node.consequent = this.parseStatement("if");
+	  node.alternate = this.eat(types$2._else) ? this.parseStatement("if") : null;
+	  return this.finishNode(node, "IfStatement")
+	};
+
+	pp$1.parseReturnStatement = function(node) {
+	  if (!this.inFunction && !this.options.allowReturnOutsideFunction)
+	    { this.raise(this.start, "'return' outside of function"); }
+	  this.next();
+
+	  // In `return` (and `break`/`continue`), the keywords with
+	  // optional arguments, we eagerly look for a semicolon or the
+	  // possibility to insert one.
+
+	  if (this.eat(types$2.semi) || this.insertSemicolon()) { node.argument = null; }
+	  else { node.argument = this.parseExpression(); this.semicolon(); }
+	  return this.finishNode(node, "ReturnStatement")
+	};
+
+	pp$1.parseSwitchStatement = function(node) {
+	  this.next();
+	  node.discriminant = this.parseParenExpression();
+	  node.cases = [];
+	  this.expect(types$2.braceL);
+	  this.labels.push(switchLabel);
+	  this.enterScope(0);
+
+	  // Statements under must be grouped (by label) in SwitchCase
+	  // nodes. `cur` is used to keep the node that we are currently
+	  // adding statements to.
+
+	  var cur;
+	  for (var sawDefault = false; this.type !== types$2.braceR;) {
+	    if (this.type === types$2._case || this.type === types$2._default) {
+	      var isCase = this.type === types$2._case;
+	      if (cur) { this.finishNode(cur, "SwitchCase"); }
+	      node.cases.push(cur = this.startNode());
+	      cur.consequent = [];
+	      this.next();
+	      if (isCase) {
+	        cur.test = this.parseExpression();
+	      } else {
+	        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, "Multiple default clauses"); }
+	        sawDefault = true;
+	        cur.test = null;
+	      }
+	      this.expect(types$2.colon);
+	    } else {
+	      if (!cur) { this.unexpected(); }
+	      cur.consequent.push(this.parseStatement(null));
+	    }
+	  }
+	  this.exitScope();
+	  if (cur) { this.finishNode(cur, "SwitchCase"); }
+	  this.next(); // Closing brace
+	  this.labels.pop();
+	  return this.finishNode(node, "SwitchStatement")
+	};
+
+	pp$1.parseThrowStatement = function(node) {
+	  this.next();
+	  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))
+	    { this.raise(this.lastTokEnd, "Illegal newline after throw"); }
+	  node.argument = this.parseExpression();
+	  this.semicolon();
+	  return this.finishNode(node, "ThrowStatement")
+	};
+
+	// Reused empty array added for node fields that are always empty.
+
+	var empty = [];
+
+	pp$1.parseTryStatement = function(node) {
+	  this.next();
+	  node.block = this.parseBlock();
+	  node.handler = null;
+	  if (this.type === types$2._catch) {
+	    var clause = this.startNode();
+	    this.next();
+	    if (this.eat(types$2.parenL)) {
+	      clause.param = this.parseBindingAtom();
+	      var simple = clause.param.type === "Identifier";
+	      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);
+	      this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);
+	      this.expect(types$2.parenR);
+	    } else {
+	      if (this.options.ecmaVersion < 10) { this.unexpected(); }
+	      clause.param = null;
+	      this.enterScope(0);
+	    }
+	    clause.body = this.parseBlock(false);
+	    this.exitScope();
+	    node.handler = this.finishNode(clause, "CatchClause");
+	  }
+	  node.finalizer = this.eat(types$2._finally) ? this.parseBlock() : null;
+	  if (!node.handler && !node.finalizer)
+	    { this.raise(node.start, "Missing catch or finally clause"); }
+	  return this.finishNode(node, "TryStatement")
+	};
+
+	pp$1.parseVarStatement = function(node, kind) {
+	  this.next();
+	  this.parseVar(node, false, kind);
+	  this.semicolon();
+	  return this.finishNode(node, "VariableDeclaration")
+	};
+
+	pp$1.parseWhileStatement = function(node) {
+	  this.next();
+	  node.test = this.parseParenExpression();
+	  this.labels.push(loopLabel);
+	  node.body = this.parseStatement("while");
+	  this.labels.pop();
+	  return this.finishNode(node, "WhileStatement")
+	};
+
+	pp$1.parseWithStatement = function(node) {
+	  if (this.strict) { this.raise(this.start, "'with' in strict mode"); }
+	  this.next();
+	  node.object = this.parseParenExpression();
+	  node.body = this.parseStatement("with");
+	  return this.finishNode(node, "WithStatement")
+	};
+
+	pp$1.parseEmptyStatement = function(node) {
+	  this.next();
+	  return this.finishNode(node, "EmptyStatement")
+	};
+
+	pp$1.parseLabeledStatement = function(node, maybeName, expr, context) {
+	  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)
+	    {
+	    var label = list[i$1];
+
+	    if (label.name === maybeName)
+	      { this.raise(expr.start, "Label '" + maybeName + "' is already declared");
+	  } }
+	  var kind = this.type.isLoop ? "loop" : this.type === types$2._switch ? "switch" : null;
+	  for (var i = this.labels.length - 1; i >= 0; i--) {
+	    var label$1 = this.labels[i];
+	    if (label$1.statementStart === node.start) {
+	      // Update information about previous labels on this node
+	      label$1.statementStart = this.start;
+	      label$1.kind = kind;
+	    } else { break }
+	  }
+	  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});
+	  node.body = this.parseStatement(context ? context.indexOf("label") === -1 ? context + "label" : context : "label");
+	  this.labels.pop();
+	  node.label = expr;
+	  return this.finishNode(node, "LabeledStatement")
+	};
+
+	pp$1.parseExpressionStatement = function(node, expr) {
+	  node.expression = expr;
+	  this.semicolon();
+	  return this.finishNode(node, "ExpressionStatement")
+	};
+
+	// Parse a semicolon-enclosed block of statements, handling `"use
+	// strict"` declarations when `allowStrict` is true (used for
+	// function bodies).
+
+	pp$1.parseBlock = function(createNewLexicalScope, node) {
+	  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;
+	  if ( node === void 0 ) node = this.startNode();
+
+	  node.body = [];
+	  this.expect(types$2.braceL);
+	  if (createNewLexicalScope) { this.enterScope(0); }
+	  while (!this.eat(types$2.braceR)) {
+	    var stmt = this.parseStatement(null);
+	    node.body.push(stmt);
+	  }
+	  if (createNewLexicalScope) { this.exitScope(); }
+	  return this.finishNode(node, "BlockStatement")
+	};
+
+	// Parse a regular `for` loop. The disambiguation code in
+	// `parseStatement` will already have parsed the init statement or
+	// expression.
+
+	pp$1.parseFor = function(node, init) {
+	  node.init = init;
+	  this.expect(types$2.semi);
+	  node.test = this.type === types$2.semi ? null : this.parseExpression();
+	  this.expect(types$2.semi);
+	  node.update = this.type === types$2.parenR ? null : this.parseExpression();
+	  this.expect(types$2.parenR);
+	  node.body = this.parseStatement("for");
+	  this.exitScope();
+	  this.labels.pop();
+	  return this.finishNode(node, "ForStatement")
+	};
+
+	// Parse a `for`/`in` and `for`/`of` loop, which are almost
+	// same from parser's perspective.
+
+	pp$1.parseForIn = function(node, init) {
+	  var isForIn = this.type === types$2._in;
+	  this.next();
+
+	  if (
+	    init.type === "VariableDeclaration" &&
+	    init.declarations[0].init != null &&
+	    (
+	      !isForIn ||
+	      this.options.ecmaVersion < 8 ||
+	      this.strict ||
+	      init.kind !== "var" ||
+	      init.declarations[0].id.type !== "Identifier"
+	    )
+	  ) {
+	    this.raise(
+	      init.start,
+	      ((isForIn ? "for-in" : "for-of") + " loop variable declaration may not have an initializer")
+	    );
+	  } else if (init.type === "AssignmentPattern") {
+	    this.raise(init.start, "Invalid left-hand side in for-loop");
+	  }
+	  node.left = init;
+	  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();
+	  this.expect(types$2.parenR);
+	  node.body = this.parseStatement("for");
+	  this.exitScope();
+	  this.labels.pop();
+	  return this.finishNode(node, isForIn ? "ForInStatement" : "ForOfStatement")
+	};
+
+	// Parse a list of variable declarations.
+
+	pp$1.parseVar = function(node, isFor, kind) {
+	  node.declarations = [];
+	  node.kind = kind;
+	  for (;;) {
+	    var decl = this.startNode();
+	    this.parseVarId(decl, kind);
+	    if (this.eat(types$2.eq)) {
+	      decl.init = this.parseMaybeAssign(isFor);
+	    } else if (kind === "const" && !(this.type === types$2._in || (this.options.ecmaVersion >= 6 && this.isContextual("of")))) {
+	      this.unexpected();
+	    } else if (decl.id.type !== "Identifier" && !(isFor && (this.type === types$2._in || this.isContextual("of")))) {
+	      this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+	    } else {
+	      decl.init = null;
+	    }
+	    node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+	    if (!this.eat(types$2.comma)) { break }
+	  }
+	  return node
+	};
+
+	pp$1.parseVarId = function(decl, kind) {
+	  decl.id = this.parseBindingAtom();
+	  this.checkLVal(decl.id, kind === "var" ? BIND_VAR : BIND_LEXICAL, false);
+	};
+
+	var FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;
+
+	// Parse a function declaration or literal (depending on the
+	// `statement & FUNC_STATEMENT`).
+
+	// Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+	pp$1.parseFunction = function(node, statement, allowExpressionBody, isAsync) {
+	  this.initFunction(node);
+	  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {
+	    if (this.type === types$2.star && (statement & FUNC_HANGING_STATEMENT))
+	      { this.unexpected(); }
+	    node.generator = this.eat(types$2.star);
+	  }
+	  if (this.options.ecmaVersion >= 8)
+	    { node.async = !!isAsync; }
+
+	  if (statement & FUNC_STATEMENT) {
+	    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types$2.name ? null : this.parseIdent();
+	    if (node.id && !(statement & FUNC_HANGING_STATEMENT))
+	      // If it is a regular function declaration in sloppy mode, then it is
+	      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+	      // mode depends on properties of the current scope (see
+	      // treatFunctionsAsVar).
+	      { this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }
+	  }
+
+	  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+	  this.yieldPos = 0;
+	  this.awaitPos = 0;
+	  this.awaitIdentPos = 0;
+	  this.enterScope(functionFlags(node.async, node.generator));
+
+	  if (!(statement & FUNC_STATEMENT))
+	    { node.id = this.type === types$2.name ? this.parseIdent() : null; }
+
+	  this.parseFunctionParams(node);
+	  this.parseFunctionBody(node, allowExpressionBody, false);
+
+	  this.yieldPos = oldYieldPos;
+	  this.awaitPos = oldAwaitPos;
+	  this.awaitIdentPos = oldAwaitIdentPos;
+	  return this.finishNode(node, (statement & FUNC_STATEMENT) ? "FunctionDeclaration" : "FunctionExpression")
+	};
+
+	pp$1.parseFunctionParams = function(node) {
+	  this.expect(types$2.parenL);
+	  node.params = this.parseBindingList(types$2.parenR, false, this.options.ecmaVersion >= 8);
+	  this.checkYieldAwaitInDefaultParams();
+	};
+
+	// Parse a class declaration or literal (depending on the
+	// `isStatement` parameter).
+
+	pp$1.parseClass = function(node, isStatement) {
+	  this.next();
+
+	  // ecma-262 14.6 Class Definitions
+	  // A class definition is always strict mode code.
+	  var oldStrict = this.strict;
+	  this.strict = true;
+
+	  this.parseClassId(node, isStatement);
+	  this.parseClassSuper(node);
+	  var classBody = this.startNode();
+	  var hadConstructor = false;
+	  classBody.body = [];
+	  this.expect(types$2.braceL);
+	  while (!this.eat(types$2.braceR)) {
+	    var element = this.parseClassElement(node.superClass !== null);
+	    if (element) {
+	      classBody.body.push(element);
+	      if (element.type === "MethodDefinition" && element.kind === "constructor") {
+	        if (hadConstructor) { this.raise(element.start, "Duplicate constructor in the same class"); }
+	        hadConstructor = true;
+	      }
+	    }
+	  }
+	  node.body = this.finishNode(classBody, "ClassBody");
+	  this.strict = oldStrict;
+	  return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression")
+	};
+
+	pp$1.parseClassElement = function(constructorAllowsSuper) {
+	  var this$1 = this;
+
+	  if (this.eat(types$2.semi)) { return null }
+
+	  var method = this.startNode();
+	  var tryContextual = function (k, noLineBreak) {
+	    if ( noLineBreak === void 0 ) noLineBreak = false;
+
+	    var start = this$1.start, startLoc = this$1.startLoc;
+	    if (!this$1.eatContextual(k)) { return false }
+	    if (this$1.type !== types$2.parenL && (!noLineBreak || !this$1.canInsertSemicolon())) { return true }
+	    if (method.key) { this$1.unexpected(); }
+	    method.computed = false;
+	    method.key = this$1.startNodeAt(start, startLoc);
+	    method.key.name = k;
+	    this$1.finishNode(method.key, "Identifier");
+	    return false
+	  };
+
+	  method.kind = "method";
+	  method.static = tryContextual("static");
+	  var isGenerator = this.eat(types$2.star);
+	  var isAsync = false;
+	  if (!isGenerator) {
+	    if (this.options.ecmaVersion >= 8 && tryContextual("async", true)) {
+	      isAsync = true;
+	      isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$2.star);
+	    } else if (tryContextual("get")) {
+	      method.kind = "get";
+	    } else if (tryContextual("set")) {
+	      method.kind = "set";
+	    }
+	  }
+	  if (!method.key) { this.parsePropertyName(method); }
+	  var key = method.key;
+	  var allowsDirectSuper = false;
+	  if (!method.computed && !method.static && (key.type === "Identifier" && key.name === "constructor" ||
+	      key.type === "Literal" && key.value === "constructor")) {
+	    if (method.kind !== "method") { this.raise(key.start, "Constructor can't have get/set modifier"); }
+	    if (isGenerator) { this.raise(key.start, "Constructor can't be a generator"); }
+	    if (isAsync) { this.raise(key.start, "Constructor can't be an async method"); }
+	    method.kind = "constructor";
+	    allowsDirectSuper = constructorAllowsSuper;
+	  } else if (method.static && key.type === "Identifier" && key.name === "prototype") {
+	    this.raise(key.start, "Classes may not have a static property named prototype");
+	  }
+	  this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper);
+	  if (method.kind === "get" && method.value.params.length !== 0)
+	    { this.raiseRecoverable(method.value.start, "getter should have no params"); }
+	  if (method.kind === "set" && method.value.params.length !== 1)
+	    { this.raiseRecoverable(method.value.start, "setter should have exactly one param"); }
+	  if (method.kind === "set" && method.value.params[0].type === "RestElement")
+	    { this.raiseRecoverable(method.value.params[0].start, "Setter cannot use rest params"); }
+	  return method
+	};
+
+	pp$1.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {
+	  method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);
+	  return this.finishNode(method, "MethodDefinition")
+	};
+
+	pp$1.parseClassId = function(node, isStatement) {
+	  if (this.type === types$2.name) {
+	    node.id = this.parseIdent();
+	    if (isStatement)
+	      { this.checkLVal(node.id, BIND_LEXICAL, false); }
+	  } else {
+	    if (isStatement === true)
+	      { this.unexpected(); }
+	    node.id = null;
+	  }
+	};
+
+	pp$1.parseClassSuper = function(node) {
+	  node.superClass = this.eat(types$2._extends) ? this.parseExprSubscripts() : null;
+	};
+
+	// Parses module export declaration.
+
+	pp$1.parseExport = function(node, exports) {
+	  this.next();
+	  // export * from '...'
+	  if (this.eat(types$2.star)) {
+	    this.expectContextual("from");
+	    if (this.type !== types$2.string) { this.unexpected(); }
+	    node.source = this.parseExprAtom();
+	    this.semicolon();
+	    return this.finishNode(node, "ExportAllDeclaration")
+	  }
+	  if (this.eat(types$2._default)) { // export default ...
+	    this.checkExport(exports, "default", this.lastTokStart);
+	    var isAsync;
+	    if (this.type === types$2._function || (isAsync = this.isAsyncFunction())) {
+	      var fNode = this.startNode();
+	      this.next();
+	      if (isAsync) { this.next(); }
+	      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+	    } else if (this.type === types$2._class) {
+	      var cNode = this.startNode();
+	      node.declaration = this.parseClass(cNode, "nullableID");
+	    } else {
+	      node.declaration = this.parseMaybeAssign();
+	      this.semicolon();
+	    }
+	    return this.finishNode(node, "ExportDefaultDeclaration")
+	  }
+	  // export var|const|let|function|class ...
+	  if (this.shouldParseExportStatement()) {
+	    node.declaration = this.parseStatement(null);
+	    if (node.declaration.type === "VariableDeclaration")
+	      { this.checkVariableExport(exports, node.declaration.declarations); }
+	    else
+	      { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+	    node.specifiers = [];
+	    node.source = null;
+	  } else { // export { x, y as z } [from '...']
+	    node.declaration = null;
+	    node.specifiers = this.parseExportSpecifiers(exports);
+	    if (this.eatContextual("from")) {
+	      if (this.type !== types$2.string) { this.unexpected(); }
+	      node.source = this.parseExprAtom();
+	    } else {
+	      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+	        // check for keywords used as local names
+	        var spec = list[i];
+
+	        this.checkUnreserved(spec.local);
+	        // check if export is defined
+	        this.checkLocalExport(spec.local);
+	      }
+
+	      node.source = null;
+	    }
+	    this.semicolon();
+	  }
+	  return this.finishNode(node, "ExportNamedDeclaration")
+	};
+
+	pp$1.checkExport = function(exports, name, pos) {
+	  if (!exports) { return }
+	  if (has$1(exports, name))
+	    { this.raiseRecoverable(pos, "Duplicate export '" + name + "'"); }
+	  exports[name] = true;
+	};
+
+	pp$1.checkPatternExport = function(exports, pat) {
+	  var type = pat.type;
+	  if (type === "Identifier")
+	    { this.checkExport(exports, pat.name, pat.start); }
+	  else if (type === "ObjectPattern")
+	    { for (var i = 0, list = pat.properties; i < list.length; i += 1)
+	      {
+	        var prop = list[i];
+
+	        this.checkPatternExport(exports, prop);
+	      } }
+	  else if (type === "ArrayPattern")
+	    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {
+	      var elt = list$1[i$1];
+
+	        if (elt) { this.checkPatternExport(exports, elt); }
+	    } }
+	  else if (type === "Property")
+	    { this.checkPatternExport(exports, pat.value); }
+	  else if (type === "AssignmentPattern")
+	    { this.checkPatternExport(exports, pat.left); }
+	  else if (type === "RestElement")
+	    { this.checkPatternExport(exports, pat.argument); }
+	  else if (type === "ParenthesizedExpression")
+	    { this.checkPatternExport(exports, pat.expression); }
+	};
+
+	pp$1.checkVariableExport = function(exports, decls) {
+	  if (!exports) { return }
+	  for (var i = 0, list = decls; i < list.length; i += 1)
+	    {
+	    var decl = list[i];
+
+	    this.checkPatternExport(exports, decl.id);
+	  }
+	};
+
+	pp$1.shouldParseExportStatement = function() {
+	  return this.type.keyword === "var" ||
+	    this.type.keyword === "const" ||
+	    this.type.keyword === "class" ||
+	    this.type.keyword === "function" ||
+	    this.isLet() ||
+	    this.isAsyncFunction()
+	};
+
+	// Parses a comma-separated list of module exports.
+
+	pp$1.parseExportSpecifiers = function(exports) {
+	  var nodes = [], first = true;
+	  // export { x, y as z } [from '...']
+	  this.expect(types$2.braceL);
+	  while (!this.eat(types$2.braceR)) {
+	    if (!first) {
+	      this.expect(types$2.comma);
+	      if (this.afterTrailingComma(types$2.braceR)) { break }
+	    } else { first = false; }
+
+	    var node = this.startNode();
+	    node.local = this.parseIdent(true);
+	    node.exported = this.eatContextual("as") ? this.parseIdent(true) : node.local;
+	    this.checkExport(exports, node.exported.name, node.exported.start);
+	    nodes.push(this.finishNode(node, "ExportSpecifier"));
+	  }
+	  return nodes
+	};
+
+	// Parses import declaration.
+
+	pp$1.parseImport = function(node) {
+	  this.next();
+	  // import '...'
+	  if (this.type === types$2.string) {
+	    node.specifiers = empty;
+	    node.source = this.parseExprAtom();
+	  } else {
+	    node.specifiers = this.parseImportSpecifiers();
+	    this.expectContextual("from");
+	    node.source = this.type === types$2.string ? this.parseExprAtom() : this.unexpected();
+	  }
+	  this.semicolon();
+	  return this.finishNode(node, "ImportDeclaration")
+	};
+
+	// Parses a comma-separated list of module imports.
+
+	pp$1.parseImportSpecifiers = function() {
+	  var nodes = [], first = true;
+	  if (this.type === types$2.name) {
+	    // import defaultObj, { x, y as z } from '...'
+	    var node = this.startNode();
+	    node.local = this.parseIdent();
+	    this.checkLVal(node.local, BIND_LEXICAL);
+	    nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+	    if (!this.eat(types$2.comma)) { return nodes }
+	  }
+	  if (this.type === types$2.star) {
+	    var node$1 = this.startNode();
+	    this.next();
+	    this.expectContextual("as");
+	    node$1.local = this.parseIdent();
+	    this.checkLVal(node$1.local, BIND_LEXICAL);
+	    nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier"));
+	    return nodes
+	  }
+	  this.expect(types$2.braceL);
+	  while (!this.eat(types$2.braceR)) {
+	    if (!first) {
+	      this.expect(types$2.comma);
+	      if (this.afterTrailingComma(types$2.braceR)) { break }
+	    } else { first = false; }
+
+	    var node$2 = this.startNode();
+	    node$2.imported = this.parseIdent(true);
+	    if (this.eatContextual("as")) {
+	      node$2.local = this.parseIdent();
+	    } else {
+	      this.checkUnreserved(node$2.imported);
+	      node$2.local = node$2.imported;
+	    }
+	    this.checkLVal(node$2.local, BIND_LEXICAL);
+	    nodes.push(this.finishNode(node$2, "ImportSpecifier"));
+	  }
+	  return nodes
+	};
+
+	// Set `ExpressionStatement#directive` property for directive prologues.
+	pp$1.adaptDirectivePrologue = function(statements) {
+	  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {
+	    statements[i].directive = statements[i].expression.raw.slice(1, -1);
+	  }
+	};
+	pp$1.isDirectiveCandidate = function(statement) {
+	  return (
+	    statement.type === "ExpressionStatement" &&
+	    statement.expression.type === "Literal" &&
+	    typeof statement.expression.value === "string" &&
+	    // Reject parenthesized strings.
+	    (this.input[statement.start] === "\"" || this.input[statement.start] === "'")
+	  )
+	};
+
+	var pp$2 = Parser.prototype;
+
+	// Convert existing expression atom to assignable pattern
+	// if possible.
+
+	pp$2.toAssignable = function(node, isBinding, refDestructuringErrors) {
+	  if (this.options.ecmaVersion >= 6 && node) {
+	    switch (node.type) {
+	    case "Identifier":
+	      if (this.inAsync && node.name === "await")
+	        { this.raise(node.start, "Cannot use 'await' as identifier inside an async function"); }
+	      break
+
+	    case "ObjectPattern":
+	    case "ArrayPattern":
+	    case "RestElement":
+	      break
+
+	    case "ObjectExpression":
+	      node.type = "ObjectPattern";
+	      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+	      for (var i = 0, list = node.properties; i < list.length; i += 1) {
+	        var prop = list[i];
+
+	      this.toAssignable(prop, isBinding);
+	        // Early error:
+	        //   AssignmentRestProperty[Yield, Await] :
+	        //     `...` DestructuringAssignmentTarget[Yield, Await]
+	        //
+	        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+	        if (
+	          prop.type === "RestElement" &&
+	          (prop.argument.type === "ArrayPattern" || prop.argument.type === "ObjectPattern")
+	        ) {
+	          this.raise(prop.argument.start, "Unexpected token");
+	        }
+	      }
+	      break
+
+	    case "Property":
+	      // AssignmentProperty has type === "Property"
+	      if (node.kind !== "init") { this.raise(node.key.start, "Object pattern can't contain getter or setter"); }
+	      this.toAssignable(node.value, isBinding);
+	      break
+
+	    case "ArrayExpression":
+	      node.type = "ArrayPattern";
+	      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+	      this.toAssignableList(node.elements, isBinding);
+	      break
+
+	    case "SpreadElement":
+	      node.type = "RestElement";
+	      this.toAssignable(node.argument, isBinding);
+	      if (node.argument.type === "AssignmentPattern")
+	        { this.raise(node.argument.start, "Rest elements cannot have a default value"); }
+	      break
+
+	    case "AssignmentExpression":
+	      if (node.operator !== "=") { this.raise(node.left.end, "Only '=' operator can be used for specifying default value."); }
+	      node.type = "AssignmentPattern";
+	      delete node.operator;
+	      this.toAssignable(node.left, isBinding);
+	      // falls through to AssignmentPattern
+
+	    case "AssignmentPattern":
+	      break
+
+	    case "ParenthesizedExpression":
+	      this.toAssignable(node.expression, isBinding, refDestructuringErrors);
+	      break
+
+	    case "MemberExpression":
+	      if (!isBinding) { break }
+
+	    default:
+	      this.raise(node.start, "Assigning to rvalue");
+	    }
+	  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+	  return node
+	};
+
+	// Convert list of expression atoms to binding list.
+
+	pp$2.toAssignableList = function(exprList, isBinding) {
+	  var end = exprList.length;
+	  for (var i = 0; i < end; i++) {
+	    var elt = exprList[i];
+	    if (elt) { this.toAssignable(elt, isBinding); }
+	  }
+	  if (end) {
+	    var last = exprList[end - 1];
+	    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier")
+	      { this.unexpected(last.argument.start); }
+	  }
+	  return exprList
+	};
+
+	// Parses spread element.
+
+	pp$2.parseSpread = function(refDestructuringErrors) {
+	  var node = this.startNode();
+	  this.next();
+	  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+	  return this.finishNode(node, "SpreadElement")
+	};
+
+	pp$2.parseRestBinding = function() {
+	  var node = this.startNode();
+	  this.next();
+
+	  // RestElement inside of a function parameter must be an identifier
+	  if (this.options.ecmaVersion === 6 && this.type !== types$2.name)
+	    { this.unexpected(); }
+
+	  node.argument = this.parseBindingAtom();
+
+	  return this.finishNode(node, "RestElement")
+	};
+
+	// Parses lvalue (assignable) atom.
+
+	pp$2.parseBindingAtom = function() {
+	  if (this.options.ecmaVersion >= 6) {
+	    switch (this.type) {
+	    case types$2.bracketL:
+	      var node = this.startNode();
+	      this.next();
+	      node.elements = this.parseBindingList(types$2.bracketR, true, true);
+	      return this.finishNode(node, "ArrayPattern")
+
+	    case types$2.braceL:
+	      return this.parseObj(true)
+	    }
+	  }
+	  return this.parseIdent()
+	};
+
+	pp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma) {
+	  var elts = [], first = true;
+	  while (!this.eat(close)) {
+	    if (first) { first = false; }
+	    else { this.expect(types$2.comma); }
+	    if (allowEmpty && this.type === types$2.comma) {
+	      elts.push(null);
+	    } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+	      break
+	    } else if (this.type === types$2.ellipsis) {
+	      var rest = this.parseRestBinding();
+	      this.parseBindingListItem(rest);
+	      elts.push(rest);
+	      if (this.type === types$2.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+	      this.expect(close);
+	      break
+	    } else {
+	      var elem = this.parseMaybeDefault(this.start, this.startLoc);
+	      this.parseBindingListItem(elem);
+	      elts.push(elem);
+	    }
+	  }
+	  return elts
+	};
+
+	pp$2.parseBindingListItem = function(param) {
+	  return param
+	};
+
+	// Parses assignment pattern around given atom if possible.
+
+	pp$2.parseMaybeDefault = function(startPos, startLoc, left) {
+	  left = left || this.parseBindingAtom();
+	  if (this.options.ecmaVersion < 6 || !this.eat(types$2.eq)) { return left }
+	  var node = this.startNodeAt(startPos, startLoc);
+	  node.left = left;
+	  node.right = this.parseMaybeAssign();
+	  return this.finishNode(node, "AssignmentPattern")
+	};
+
+	// Verify that a node is an lval — something that can be assigned
+	// to.
+	// bindingType can be either:
+	// 'var' indicating that the lval creates a 'var' binding
+	// 'let' indicating that the lval creates a lexical ('let' or 'const') binding
+	// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references
+
+	pp$2.checkLVal = function(expr, bindingType, checkClashes) {
+	  if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+	  switch (expr.type) {
+	  case "Identifier":
+	    if (bindingType === BIND_LEXICAL && expr.name === "let")
+	      { this.raiseRecoverable(expr.start, "let is disallowed as a lexically bound name"); }
+	    if (this.strict && this.reservedWordsStrictBind.test(expr.name))
+	      { this.raiseRecoverable(expr.start, (bindingType ? "Binding " : "Assigning to ") + expr.name + " in strict mode"); }
+	    if (checkClashes) {
+	      if (has$1(checkClashes, expr.name))
+	        { this.raiseRecoverable(expr.start, "Argument name clash"); }
+	      checkClashes[expr.name] = true;
+	    }
+	    if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }
+	    break
+
+	  case "MemberExpression":
+	    if (bindingType) { this.raiseRecoverable(expr.start, "Binding member expression"); }
+	    break
+
+	  case "ObjectPattern":
+	    for (var i = 0, list = expr.properties; i < list.length; i += 1)
+	      {
+	    var prop = list[i];
+
+	    this.checkLVal(prop, bindingType, checkClashes);
+	  }
+	    break
+
+	  case "Property":
+	    // AssignmentProperty has type === "Property"
+	    this.checkLVal(expr.value, bindingType, checkClashes);
+	    break
+
+	  case "ArrayPattern":
+	    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {
+	      var elem = list$1[i$1];
+
+	    if (elem) { this.checkLVal(elem, bindingType, checkClashes); }
+	    }
+	    break
+
+	  case "AssignmentPattern":
+	    this.checkLVal(expr.left, bindingType, checkClashes);
+	    break
+
+	  case "RestElement":
+	    this.checkLVal(expr.argument, bindingType, checkClashes);
+	    break
+
+	  case "ParenthesizedExpression":
+	    this.checkLVal(expr.expression, bindingType, checkClashes);
+	    break
+
+	  default:
+	    this.raise(expr.start, (bindingType ? "Binding" : "Assigning to") + " rvalue");
+	  }
+	};
+
+	// A recursive descent parser operates by defining functions for all
+
+	var pp$3 = Parser.prototype;
+
+	// Check if property name clashes with already added.
+	// Object/class getters and setters are not allowed to clash —
+	// either with each other or with an init property — and in
+	// strict mode, init properties are also not allowed to be repeated.
+
+	pp$3.checkPropClash = function(prop, propHash, refDestructuringErrors) {
+	  if (this.options.ecmaVersion >= 9 && prop.type === "SpreadElement")
+	    { return }
+	  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))
+	    { return }
+	  var key = prop.key;
+	  var name;
+	  switch (key.type) {
+	  case "Identifier": name = key.name; break
+	  case "Literal": name = String(key.value); break
+	  default: return
+	  }
+	  var kind = prop.kind;
+	  if (this.options.ecmaVersion >= 6) {
+	    if (name === "__proto__" && kind === "init") {
+	      if (propHash.proto) {
+	        if (refDestructuringErrors && refDestructuringErrors.doubleProto < 0) { refDestructuringErrors.doubleProto = key.start; }
+	        // Backwards-compat kludge. Can be removed in version 6.0
+	        else { this.raiseRecoverable(key.start, "Redefinition of __proto__ property"); }
+	      }
+	      propHash.proto = true;
+	    }
+	    return
+	  }
+	  name = "$" + name;
+	  var other = propHash[name];
+	  if (other) {
+	    var redefinition;
+	    if (kind === "init") {
+	      redefinition = this.strict && other.init || other.get || other.set;
+	    } else {
+	      redefinition = other.init || other[kind];
+	    }
+	    if (redefinition)
+	      { this.raiseRecoverable(key.start, "Redefinition of property"); }
+	  } else {
+	    other = propHash[name] = {
+	      init: false,
+	      get: false,
+	      set: false
+	    };
+	  }
+	  other[kind] = true;
+	};
+
+	// ### Expression parsing
+
+	// These nest, from the most general expression type at the top to
+	// 'atomic', nondivisible expression types at the bottom. Most of
+	// the functions will simply let the function(s) below them parse,
+	// and, *if* the syntactic construct they handle is present, wrap
+	// the AST node that the inner parser gave them in another node.
+
+	// Parse a full expression. The optional arguments are used to
+	// forbid the `in` operator (in for loops initalization expressions)
+	// and provide reference for storing '=' operator inside shorthand
+	// property assignment in contexts where both object expression
+	// and object pattern might appear (so it's possible to raise
+	// delayed syntax error at correct position).
+
+	pp$3.parseExpression = function(noIn, refDestructuringErrors) {
+	  var startPos = this.start, startLoc = this.startLoc;
+	  var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);
+	  if (this.type === types$2.comma) {
+	    var node = this.startNodeAt(startPos, startLoc);
+	    node.expressions = [expr];
+	    while (this.eat(types$2.comma)) { node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors)); }
+	    return this.finishNode(node, "SequenceExpression")
+	  }
+	  return expr
+	};
+
+	// Parse an assignment expression. This includes applications of
+	// operators like `+=`.
+
+	pp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {
+	  if (this.isContextual("yield")) {
+	    if (this.inGenerator) { return this.parseYield(noIn) }
+	    // The tokenizer will assume an expression is allowed after
+	    // `yield`, but this isn't that kind of yield
+	    else { this.exprAllowed = false; }
+	  }
+
+	  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldShorthandAssign = -1;
+	  if (refDestructuringErrors) {
+	    oldParenAssign = refDestructuringErrors.parenthesizedAssign;
+	    oldTrailingComma = refDestructuringErrors.trailingComma;
+	    oldShorthandAssign = refDestructuringErrors.shorthandAssign;
+	    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.shorthandAssign = -1;
+	  } else {
+	    refDestructuringErrors = new DestructuringErrors;
+	    ownDestructuringErrors = true;
+	  }
+
+	  var startPos = this.start, startLoc = this.startLoc;
+	  if (this.type === types$2.parenL || this.type === types$2.name)
+	    { this.potentialArrowAt = this.start; }
+	  var left = this.parseMaybeConditional(noIn, refDestructuringErrors);
+	  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }
+	  if (this.type.isAssign) {
+	    var node = this.startNodeAt(startPos, startLoc);
+	    node.operator = this.value;
+	    node.left = this.type === types$2.eq ? this.toAssignable(left, false, refDestructuringErrors) : left;
+	    if (!ownDestructuringErrors) { DestructuringErrors.call(refDestructuringErrors); }
+	    refDestructuringErrors.shorthandAssign = -1; // reset because shorthand default was used correctly
+	    this.checkLVal(left);
+	    this.next();
+	    node.right = this.parseMaybeAssign(noIn);
+	    return this.finishNode(node, "AssignmentExpression")
+	  } else {
+	    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }
+	  }
+	  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }
+	  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }
+	  if (oldShorthandAssign > -1) { refDestructuringErrors.shorthandAssign = oldShorthandAssign; }
+	  return left
+	};
+
+	// Parse a ternary conditional (`?:`) operator.
+
+	pp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) {
+	  var startPos = this.start, startLoc = this.startLoc;
+	  var expr = this.parseExprOps(noIn, refDestructuringErrors);
+	  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+	  if (this.eat(types$2.question)) {
+	    var node = this.startNodeAt(startPos, startLoc);
+	    node.test = expr;
+	    node.consequent = this.parseMaybeAssign();
+	    this.expect(types$2.colon);
+	    node.alternate = this.parseMaybeAssign(noIn);
+	    return this.finishNode(node, "ConditionalExpression")
+	  }
+	  return expr
+	};
+
+	// Start the precedence parser.
+
+	pp$3.parseExprOps = function(noIn, refDestructuringErrors) {
+	  var startPos = this.start, startLoc = this.startLoc;
+	  var expr = this.parseMaybeUnary(refDestructuringErrors, false);
+	  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+	  return expr.start === startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)
+	};
+
+	// Parse binary operators with the operator precedence parsing
+	// algorithm. `left` is the left-hand side of the operator.
+	// `minPrec` provides context that allows the function to stop and
+	// defer further parser to one of its callers when it encounters an
+	// operator that has a lower precedence than the set it is parsing.
+
+	pp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {
+	  var prec = this.type.binop;
+	  if (prec != null && (!noIn || this.type !== types$2._in)) {
+	    if (prec > minPrec) {
+	      var logical = this.type === types$2.logicalOR || this.type === types$2.logicalAND;
+	      var op = this.value;
+	      this.next();
+	      var startPos = this.start, startLoc = this.startLoc;
+	      var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);
+	      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical);
+	      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)
+	    }
+	  }
+	  return left
+	};
+
+	pp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) {
+	  var node = this.startNodeAt(startPos, startLoc);
+	  node.left = left;
+	  node.operator = op;
+	  node.right = right;
+	  return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression")
+	};
+
+	// Parse unary operators, both prefix and postfix.
+
+	pp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {
+	  var startPos = this.start, startLoc = this.startLoc, expr;
+	  if (this.isContextual("await") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {
+	    expr = this.parseAwait();
+	    sawUnary = true;
+	  } else if (this.type.prefix) {
+	    var node = this.startNode(), update = this.type === types$2.incDec;
+	    node.operator = this.value;
+	    node.prefix = true;
+	    this.next();
+	    node.argument = this.parseMaybeUnary(null, true);
+	    this.checkExpressionErrors(refDestructuringErrors, true);
+	    if (update) { this.checkLVal(node.argument); }
+	    else if (this.strict && node.operator === "delete" &&
+	             node.argument.type === "Identifier")
+	      { this.raiseRecoverable(node.start, "Deleting local variable in strict mode"); }
+	    else { sawUnary = true; }
+	    expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+	  } else {
+	    expr = this.parseExprSubscripts(refDestructuringErrors);
+	    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+	    while (this.type.postfix && !this.canInsertSemicolon()) {
+	      var node$1 = this.startNodeAt(startPos, startLoc);
+	      node$1.operator = this.value;
+	      node$1.prefix = false;
+	      node$1.argument = expr;
+	      this.checkLVal(expr);
+	      this.next();
+	      expr = this.finishNode(node$1, "UpdateExpression");
+	    }
+	  }
+
+	  if (!sawUnary && this.eat(types$2.starstar))
+	    { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), "**", false) }
+	  else
+	    { return expr }
+	};
+
+	// Parse call, dot, and `[]`-subscript expressions.
+
+	pp$3.parseExprSubscripts = function(refDestructuringErrors) {
+	  var startPos = this.start, startLoc = this.startLoc;
+	  var expr = this.parseExprAtom(refDestructuringErrors);
+	  var skipArrowSubscripts = expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")";
+	  if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) { return expr }
+	  var result = this.parseSubscripts(expr, startPos, startLoc);
+	  if (refDestructuringErrors && result.type === "MemberExpression") {
+	    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }
+	    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }
+	  }
+	  return result
+	};
+
+	pp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) {
+	  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" &&
+	      this.lastTokEnd === base.end && !this.canInsertSemicolon() && this.input.slice(base.start, base.end) === "async";
+	  while (true) {
+	    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow);
+	    if (element === base || element.type === "ArrowFunctionExpression") { return element }
+	    base = element;
+	  }
+	};
+
+	pp$3.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow) {
+	  var computed = this.eat(types$2.bracketL);
+	  if (computed || this.eat(types$2.dot)) {
+	    var node = this.startNodeAt(startPos, startLoc);
+	    node.object = base;
+	    node.property = computed ? this.parseExpression() : this.parseIdent(this.options.allowReserved !== "never");
+	    node.computed = !!computed;
+	    if (computed) { this.expect(types$2.bracketR); }
+	    base = this.finishNode(node, "MemberExpression");
+	  } else if (!noCalls && this.eat(types$2.parenL)) {
+	    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+	    this.yieldPos = 0;
+	    this.awaitPos = 0;
+	    this.awaitIdentPos = 0;
+	    var exprList = this.parseExprList(types$2.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);
+	    if (maybeAsyncArrow && !this.canInsertSemicolon() && this.eat(types$2.arrow)) {
+	      this.checkPatternErrors(refDestructuringErrors, false);
+	      this.checkYieldAwaitInDefaultParams();
+	      if (this.awaitIdentPos > 0)
+	        { this.raise(this.awaitIdentPos, "Cannot use 'await' as identifier inside an async function"); }
+	      this.yieldPos = oldYieldPos;
+	      this.awaitPos = oldAwaitPos;
+	      this.awaitIdentPos = oldAwaitIdentPos;
+	      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)
+	    }
+	    this.checkExpressionErrors(refDestructuringErrors, true);
+	    this.yieldPos = oldYieldPos || this.yieldPos;
+	    this.awaitPos = oldAwaitPos || this.awaitPos;
+	    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;
+	    var node$1 = this.startNodeAt(startPos, startLoc);
+	    node$1.callee = base;
+	    node$1.arguments = exprList;
+	    base = this.finishNode(node$1, "CallExpression");
+	  } else if (this.type === types$2.backQuote) {
+	    var node$2 = this.startNodeAt(startPos, startLoc);
+	    node$2.tag = base;
+	    node$2.quasi = this.parseTemplate({isTagged: true});
+	    base = this.finishNode(node$2, "TaggedTemplateExpression");
+	  }
+	  return base
+	};
+
+	// Parse an atomic expression — either a single token that is an
+	// expression, an expression started by a keyword like `function` or
+	// `new`, or an expression wrapped in punctuation like `()`, `[]`,
+	// or `{}`.
+
+	pp$3.parseExprAtom = function(refDestructuringErrors) {
+	  // If a division operator appears in an expression position, the
+	  // tokenizer got confused, and we force it to read a regexp instead.
+	  if (this.type === types$2.slash) { this.readRegexp(); }
+
+	  var node, canBeArrow = this.potentialArrowAt === this.start;
+	  switch (this.type) {
+	  case types$2._super:
+	    if (!this.allowSuper)
+	      { this.raise(this.start, "'super' keyword outside a method"); }
+	    node = this.startNode();
+	    this.next();
+	    if (this.type === types$2.parenL && !this.allowDirectSuper)
+	      { this.raise(node.start, "super() call outside constructor of a subclass"); }
+	    // The `super` keyword can appear at below:
+	    // SuperProperty:
+	    //     super [ Expression ]
+	    //     super . IdentifierName
+	    // SuperCall:
+	    //     super Arguments
+	    if (this.type !== types$2.dot && this.type !== types$2.bracketL && this.type !== types$2.parenL)
+	      { this.unexpected(); }
+	    return this.finishNode(node, "Super")
+
+	  case types$2._this:
+	    node = this.startNode();
+	    this.next();
+	    return this.finishNode(node, "ThisExpression")
+
+	  case types$2.name:
+	    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;
+	    var id = this.parseIdent(false);
+	    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === "async" && !this.canInsertSemicolon() && this.eat(types$2._function))
+	      { return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true) }
+	    if (canBeArrow && !this.canInsertSemicolon()) {
+	      if (this.eat(types$2.arrow))
+	        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false) }
+	      if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === types$2.name && !containsEsc) {
+	        id = this.parseIdent(false);
+	        if (this.canInsertSemicolon() || !this.eat(types$2.arrow))
+	          { this.unexpected(); }
+	        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)
+	      }
+	    }
+	    return id
+
+	  case types$2.regexp:
+	    var value = this.value;
+	    node = this.parseLiteral(value.value);
+	    node.regex = {pattern: value.pattern, flags: value.flags};
+	    return node
+
+	  case types$2.num: case types$2.string:
+	    return this.parseLiteral(this.value)
+
+	  case types$2._null: case types$2._true: case types$2._false:
+	    node = this.startNode();
+	    node.value = this.type === types$2._null ? null : this.type === types$2._true;
+	    node.raw = this.type.keyword;
+	    this.next();
+	    return this.finishNode(node, "Literal")
+
+	  case types$2.parenL:
+	    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow);
+	    if (refDestructuringErrors) {
+	      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))
+	        { refDestructuringErrors.parenthesizedAssign = start; }
+	      if (refDestructuringErrors.parenthesizedBind < 0)
+	        { refDestructuringErrors.parenthesizedBind = start; }
+	    }
+	    return expr
+
+	  case types$2.bracketL:
+	    node = this.startNode();
+	    this.next();
+	    node.elements = this.parseExprList(types$2.bracketR, true, true, refDestructuringErrors);
+	    return this.finishNode(node, "ArrayExpression")
+
+	  case types$2.braceL:
+	    return this.parseObj(false, refDestructuringErrors)
+
+	  case types$2._function:
+	    node = this.startNode();
+	    this.next();
+	    return this.parseFunction(node, 0)
+
+	  case types$2._class:
+	    return this.parseClass(this.startNode(), false)
+
+	  case types$2._new:
+	    return this.parseNew()
+
+	  case types$2.backQuote:
+	    return this.parseTemplate()
+
+	  case types$2._import:
+	    if (this.options.ecmaVersion >= 11) {
+	      return this.parseExprImport()
+	    } else {
+	      return this.unexpected()
+	    }
+
+	  default:
+	    this.unexpected();
+	  }
+	};
+
+	pp$3.parseExprImport = function() {
+	  var node = this.startNode();
+	  this.next(); // skip `import`
+	  switch (this.type) {
+	  case types$2.parenL:
+	    return this.parseDynamicImport(node)
+	  default:
+	    this.unexpected();
+	  }
+	};
+
+	pp$3.parseDynamicImport = function(node) {
+	  this.next(); // skip `(`
+
+	  // Parse node.source.
+	  node.source = this.parseMaybeAssign();
+
+	  // Verify ending.
+	  if (!this.eat(types$2.parenR)) {
+	    var errorPos = this.start;
+	    if (this.eat(types$2.comma) && this.eat(types$2.parenR)) {
+	      this.raiseRecoverable(errorPos, "Trailing comma is not allowed in import()");
+	    } else {
+	      this.unexpected(errorPos);
+	    }
+	  }
+
+	  return this.finishNode(node, "ImportExpression")
+	};
+
+	pp$3.parseLiteral = function(value) {
+	  var node = this.startNode();
+	  node.value = value;
+	  node.raw = this.input.slice(this.start, this.end);
+	  if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1); }
+	  this.next();
+	  return this.finishNode(node, "Literal")
+	};
+
+	pp$3.parseParenExpression = function() {
+	  this.expect(types$2.parenL);
+	  var val = this.parseExpression();
+	  this.expect(types$2.parenR);
+	  return val
+	};
+
+	pp$3.parseParenAndDistinguishExpression = function(canBeArrow) {
+	  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;
+	  if (this.options.ecmaVersion >= 6) {
+	    this.next();
+
+	    var innerStartPos = this.start, innerStartLoc = this.startLoc;
+	    var exprList = [], first = true, lastIsComma = false;
+	    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;
+	    this.yieldPos = 0;
+	    this.awaitPos = 0;
+	    // Do not save awaitIdentPos to allow checking awaits nested in parameters
+	    while (this.type !== types$2.parenR) {
+	      first ? first = false : this.expect(types$2.comma);
+	      if (allowTrailingComma && this.afterTrailingComma(types$2.parenR, true)) {
+	        lastIsComma = true;
+	        break
+	      } else if (this.type === types$2.ellipsis) {
+	        spreadStart = this.start;
+	        exprList.push(this.parseParenItem(this.parseRestBinding()));
+	        if (this.type === types$2.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+	        break
+	      } else {
+	        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+	      }
+	    }
+	    var innerEndPos = this.start, innerEndLoc = this.startLoc;
+	    this.expect(types$2.parenR);
+
+	    if (canBeArrow && !this.canInsertSemicolon() && this.eat(types$2.arrow)) {
+	      this.checkPatternErrors(refDestructuringErrors, false);
+	      this.checkYieldAwaitInDefaultParams();
+	      this.yieldPos = oldYieldPos;
+	      this.awaitPos = oldAwaitPos;
+	      return this.parseParenArrowList(startPos, startLoc, exprList)
+	    }
+
+	    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }
+	    if (spreadStart) { this.unexpected(spreadStart); }
+	    this.checkExpressionErrors(refDestructuringErrors, true);
+	    this.yieldPos = oldYieldPos || this.yieldPos;
+	    this.awaitPos = oldAwaitPos || this.awaitPos;
+
+	    if (exprList.length > 1) {
+	      val = this.startNodeAt(innerStartPos, innerStartLoc);
+	      val.expressions = exprList;
+	      this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+	    } else {
+	      val = exprList[0];
+	    }
+	  } else {
+	    val = this.parseParenExpression();
+	  }
+
+	  if (this.options.preserveParens) {
+	    var par = this.startNodeAt(startPos, startLoc);
+	    par.expression = val;
+	    return this.finishNode(par, "ParenthesizedExpression")
+	  } else {
+	    return val
+	  }
+	};
+
+	pp$3.parseParenItem = function(item) {
+	  return item
+	};
+
+	pp$3.parseParenArrowList = function(startPos, startLoc, exprList) {
+	  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)
+	};
+
+	// New's precedence is slightly tricky. It must allow its argument to
+	// be a `[]` or dot subscript expression, but not a call — at least,
+	// not without wrapping it in parentheses. Thus, it uses the noCalls
+	// argument to parseSubscripts to prevent it from consuming the
+	// argument list.
+
+	var empty$1 = [];
+
+	pp$3.parseNew = function() {
+	  var node = this.startNode();
+	  var meta = this.parseIdent(true);
+	  if (this.options.ecmaVersion >= 6 && this.eat(types$2.dot)) {
+	    node.meta = meta;
+	    var containsEsc = this.containsEsc;
+	    node.property = this.parseIdent(true);
+	    if (node.property.name !== "target" || containsEsc)
+	      { this.raiseRecoverable(node.property.start, "The only valid meta property for new is new.target"); }
+	    if (!this.inNonArrowFunction())
+	      { this.raiseRecoverable(node.start, "new.target can only be used in functions"); }
+	    return this.finishNode(node, "MetaProperty")
+	  }
+	  var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types$2._import;
+	  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);
+	  if (isImport && node.callee.type === "ImportExpression") {
+	    this.raise(startPos, "Cannot use new with import()");
+	  }
+	  if (this.eat(types$2.parenL)) { node.arguments = this.parseExprList(types$2.parenR, this.options.ecmaVersion >= 8, false); }
+	  else { node.arguments = empty$1; }
+	  return this.finishNode(node, "NewExpression")
+	};
+
+	// Parse template expression.
+
+	pp$3.parseTemplateElement = function(ref) {
+	  var isTagged = ref.isTagged;
+
+	  var elem = this.startNode();
+	  if (this.type === types$2.invalidTemplate) {
+	    if (!isTagged) {
+	      this.raiseRecoverable(this.start, "Bad escape sequence in untagged template literal");
+	    }
+	    elem.value = {
+	      raw: this.value,
+	      cooked: null
+	    };
+	  } else {
+	    elem.value = {
+	      raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"),
+	      cooked: this.value
+	    };
+	  }
+	  this.next();
+	  elem.tail = this.type === types$2.backQuote;
+	  return this.finishNode(elem, "TemplateElement")
+	};
+
+	pp$3.parseTemplate = function(ref) {
+	  if ( ref === void 0 ) ref = {};
+	  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;
+
+	  var node = this.startNode();
+	  this.next();
+	  node.expressions = [];
+	  var curElt = this.parseTemplateElement({isTagged: isTagged});
+	  node.quasis = [curElt];
+	  while (!curElt.tail) {
+	    if (this.type === types$2.eof) { this.raise(this.pos, "Unterminated template literal"); }
+	    this.expect(types$2.dollarBraceL);
+	    node.expressions.push(this.parseExpression());
+	    this.expect(types$2.braceR);
+	    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));
+	  }
+	  this.next();
+	  return this.finishNode(node, "TemplateLiteral")
+	};
+
+	pp$3.isAsyncProp = function(prop) {
+	  return !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" &&
+	    (this.type === types$2.name || this.type === types$2.num || this.type === types$2.string || this.type === types$2.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types$2.star)) &&
+	    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+	};
+
+	// Parse an object literal or binding pattern.
+
+	pp$3.parseObj = function(isPattern, refDestructuringErrors) {
+	  var node = this.startNode(), first = true, propHash = {};
+	  node.properties = [];
+	  this.next();
+	  while (!this.eat(types$2.braceR)) {
+	    if (!first) {
+	      this.expect(types$2.comma);
+	      if (this.afterTrailingComma(types$2.braceR)) { break }
+	    } else { first = false; }
+
+	    var prop = this.parseProperty(isPattern, refDestructuringErrors);
+	    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }
+	    node.properties.push(prop);
+	  }
+	  return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
+	};
+
+	pp$3.parseProperty = function(isPattern, refDestructuringErrors) {
+	  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;
+	  if (this.options.ecmaVersion >= 9 && this.eat(types$2.ellipsis)) {
+	    if (isPattern) {
+	      prop.argument = this.parseIdent(false);
+	      if (this.type === types$2.comma) {
+	        this.raise(this.start, "Comma is not permitted after the rest element");
+	      }
+	      return this.finishNode(prop, "RestElement")
+	    }
+	    // To disallow parenthesized identifier via `this.toAssignable()`.
+	    if (this.type === types$2.parenL && refDestructuringErrors) {
+	      if (refDestructuringErrors.parenthesizedAssign < 0) {
+	        refDestructuringErrors.parenthesizedAssign = this.start;
+	      }
+	      if (refDestructuringErrors.parenthesizedBind < 0) {
+	        refDestructuringErrors.parenthesizedBind = this.start;
+	      }
+	    }
+	    // Parse argument.
+	    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+	    // To disallow trailing comma via `this.toAssignable()`.
+	    if (this.type === types$2.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {
+	      refDestructuringErrors.trailingComma = this.start;
+	    }
+	    // Finish
+	    return this.finishNode(prop, "SpreadElement")
+	  }
+	  if (this.options.ecmaVersion >= 6) {
+	    prop.method = false;
+	    prop.shorthand = false;
+	    if (isPattern || refDestructuringErrors) {
+	      startPos = this.start;
+	      startLoc = this.startLoc;
+	    }
+	    if (!isPattern)
+	      { isGenerator = this.eat(types$2.star); }
+	  }
+	  var containsEsc = this.containsEsc;
+	  this.parsePropertyName(prop);
+	  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {
+	    isAsync = true;
+	    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types$2.star);
+	    this.parsePropertyName(prop, refDestructuringErrors);
+	  } else {
+	    isAsync = false;
+	  }
+	  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);
+	  return this.finishNode(prop, "Property")
+	};
+
+	pp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {
+	  if ((isGenerator || isAsync) && this.type === types$2.colon)
+	    { this.unexpected(); }
+
+	  if (this.eat(types$2.colon)) {
+	    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);
+	    prop.kind = "init";
+	  } else if (this.options.ecmaVersion >= 6 && this.type === types$2.parenL) {
+	    if (isPattern) { this.unexpected(); }
+	    prop.kind = "init";
+	    prop.method = true;
+	    prop.value = this.parseMethod(isGenerator, isAsync);
+	  } else if (!isPattern && !containsEsc &&
+	             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
+	             (prop.key.name === "get" || prop.key.name === "set") &&
+	             (this.type !== types$2.comma && this.type !== types$2.braceR)) {
+	    if (isGenerator || isAsync) { this.unexpected(); }
+	    prop.kind = prop.key.name;
+	    this.parsePropertyName(prop);
+	    prop.value = this.parseMethod(false);
+	    var paramCount = prop.kind === "get" ? 0 : 1;
+	    if (prop.value.params.length !== paramCount) {
+	      var start = prop.value.start;
+	      if (prop.kind === "get")
+	        { this.raiseRecoverable(start, "getter should have no params"); }
+	      else
+	        { this.raiseRecoverable(start, "setter should have exactly one param"); }
+	    } else {
+	      if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
+	        { this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params"); }
+	    }
+	  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+	    if (isGenerator || isAsync) { this.unexpected(); }
+	    this.checkUnreserved(prop.key);
+	    if (prop.key.name === "await" && !this.awaitIdentPos)
+	      { this.awaitIdentPos = startPos; }
+	    prop.kind = "init";
+	    if (isPattern) {
+	      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+	    } else if (this.type === types$2.eq && refDestructuringErrors) {
+	      if (refDestructuringErrors.shorthandAssign < 0)
+	        { refDestructuringErrors.shorthandAssign = this.start; }
+	      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+	    } else {
+	      prop.value = prop.key;
+	    }
+	    prop.shorthand = true;
+	  } else { this.unexpected(); }
+	};
+
+	pp$3.parsePropertyName = function(prop) {
+	  if (this.options.ecmaVersion >= 6) {
+	    if (this.eat(types$2.bracketL)) {
+	      prop.computed = true;
+	      prop.key = this.parseMaybeAssign();
+	      this.expect(types$2.bracketR);
+	      return prop.key
+	    } else {
+	      prop.computed = false;
+	    }
+	  }
+	  return prop.key = this.type === types$2.num || this.type === types$2.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== "never")
+	};
+
+	// Initialize empty function node.
+
+	pp$3.initFunction = function(node) {
+	  node.id = null;
+	  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }
+	  if (this.options.ecmaVersion >= 8) { node.async = false; }
+	};
+
+	// Parse object or class method.
+
+	pp$3.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {
+	  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+	  this.initFunction(node);
+	  if (this.options.ecmaVersion >= 6)
+	    { node.generator = isGenerator; }
+	  if (this.options.ecmaVersion >= 8)
+	    { node.async = !!isAsync; }
+
+	  this.yieldPos = 0;
+	  this.awaitPos = 0;
+	  this.awaitIdentPos = 0;
+	  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));
+
+	  this.expect(types$2.parenL);
+	  node.params = this.parseBindingList(types$2.parenR, false, this.options.ecmaVersion >= 8);
+	  this.checkYieldAwaitInDefaultParams();
+	  this.parseFunctionBody(node, false, true);
+
+	  this.yieldPos = oldYieldPos;
+	  this.awaitPos = oldAwaitPos;
+	  this.awaitIdentPos = oldAwaitIdentPos;
+	  return this.finishNode(node, "FunctionExpression")
+	};
+
+	// Parse arrow function expression with given parameters.
+
+	pp$3.parseArrowExpression = function(node, params, isAsync) {
+	  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+	  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);
+	  this.initFunction(node);
+	  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }
+
+	  this.yieldPos = 0;
+	  this.awaitPos = 0;
+	  this.awaitIdentPos = 0;
+
+	  node.params = this.toAssignableList(params, true);
+	  this.parseFunctionBody(node, true, false);
+
+	  this.yieldPos = oldYieldPos;
+	  this.awaitPos = oldAwaitPos;
+	  this.awaitIdentPos = oldAwaitIdentPos;
+	  return this.finishNode(node, "ArrowFunctionExpression")
+	};
+
+	// Parse function body and check parameters.
+
+	pp$3.parseFunctionBody = function(node, isArrowFunction, isMethod) {
+	  var isExpression = isArrowFunction && this.type !== types$2.braceL;
+	  var oldStrict = this.strict, useStrict = false;
+
+	  if (isExpression) {
+	    node.body = this.parseMaybeAssign();
+	    node.expression = true;
+	    this.checkParams(node, false);
+	  } else {
+	    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);
+	    if (!oldStrict || nonSimple) {
+	      useStrict = this.strictDirective(this.end);
+	      // If this is a strict mode function, verify that argument names
+	      // are not repeated, and it does not try to bind the words `eval`
+	      // or `arguments`.
+	      if (useStrict && nonSimple)
+	        { this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list"); }
+	    }
+	    // Start a new scope with regard to labels and the `inFunction`
+	    // flag (restore them to their old value afterwards).
+	    var oldLabels = this.labels;
+	    this.labels = [];
+	    if (useStrict) { this.strict = true; }
+
+	    // Add the params to varDeclaredNames to ensure that an error is thrown
+	    // if a let/const declaration in the function clashes with one of the params.
+	    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));
+	    node.body = this.parseBlock(false);
+	    node.expression = false;
+	    this.adaptDirectivePrologue(node.body.body);
+	    this.labels = oldLabels;
+	  }
+	  this.exitScope();
+
+	  // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+	  if (this.strict && node.id) { this.checkLVal(node.id, BIND_OUTSIDE); }
+	  this.strict = oldStrict;
+	};
+
+	pp$3.isSimpleParamList = function(params) {
+	  for (var i = 0, list = params; i < list.length; i += 1)
+	    {
+	    var param = list[i];
+
+	    if (param.type !== "Identifier") { return false
+	  } }
+	  return true
+	};
+
+	// Checks function params for various disallowed patterns such as using "eval"
+	// or "arguments" and duplicate parameters.
+
+	pp$3.checkParams = function(node, allowDuplicates) {
+	  var nameHash = {};
+	  for (var i = 0, list = node.params; i < list.length; i += 1)
+	    {
+	    var param = list[i];
+
+	    this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash);
+	  }
+	};
+
+	// Parses a comma-separated list of expressions, and returns them as
+	// an array. `close` is the token type that ends the list, and
+	// `allowEmpty` can be turned on to allow subsequent commas with
+	// nothing in between them to be parsed as `null` (which is needed
+	// for array literals).
+
+	pp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+	  var elts = [], first = true;
+	  while (!this.eat(close)) {
+	    if (!first) {
+	      this.expect(types$2.comma);
+	      if (allowTrailingComma && this.afterTrailingComma(close)) { break }
+	    } else { first = false; }
+
+	    var elt = (void 0);
+	    if (allowEmpty && this.type === types$2.comma)
+	      { elt = null; }
+	    else if (this.type === types$2.ellipsis) {
+	      elt = this.parseSpread(refDestructuringErrors);
+	      if (refDestructuringErrors && this.type === types$2.comma && refDestructuringErrors.trailingComma < 0)
+	        { refDestructuringErrors.trailingComma = this.start; }
+	    } else {
+	      elt = this.parseMaybeAssign(false, refDestructuringErrors);
+	    }
+	    elts.push(elt);
+	  }
+	  return elts
+	};
+
+	pp$3.checkUnreserved = function(ref) {
+	  var start = ref.start;
+	  var end = ref.end;
+	  var name = ref.name;
+
+	  if (this.inGenerator && name === "yield")
+	    { this.raiseRecoverable(start, "Cannot use 'yield' as identifier inside a generator"); }
+	  if (this.inAsync && name === "await")
+	    { this.raiseRecoverable(start, "Cannot use 'await' as identifier inside an async function"); }
+	  if (this.keywords.test(name))
+	    { this.raise(start, ("Unexpected keyword '" + name + "'")); }
+	  if (this.options.ecmaVersion < 6 &&
+	    this.input.slice(start, end).indexOf("\\") !== -1) { return }
+	  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;
+	  if (re.test(name)) {
+	    if (!this.inAsync && name === "await")
+	      { this.raiseRecoverable(start, "Cannot use keyword 'await' outside an async function"); }
+	    this.raiseRecoverable(start, ("The keyword '" + name + "' is reserved"));
+	  }
+	};
+
+	// Parse the next token as an identifier. If `liberal` is true (used
+	// when parsing properties), it will also convert keywords into
+	// identifiers.
+
+	pp$3.parseIdent = function(liberal, isBinding) {
+	  var node = this.startNode();
+	  if (this.type === types$2.name) {
+	    node.name = this.value;
+	  } else if (this.type.keyword) {
+	    node.name = this.type.keyword;
+
+	    // To fix https://github.com/acornjs/acorn/issues/575
+	    // `class` and `function` keywords push new context into this.context.
+	    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+	    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+	    if ((node.name === "class" || node.name === "function") &&
+	        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {
+	      this.context.pop();
+	    }
+	  } else {
+	    this.unexpected();
+	  }
+	  this.next();
+	  this.finishNode(node, "Identifier");
+	  if (!liberal) {
+	    this.checkUnreserved(node);
+	    if (node.name === "await" && !this.awaitIdentPos)
+	      { this.awaitIdentPos = node.start; }
+	  }
+	  return node
+	};
+
+	// Parses yield expression inside generator.
+
+	pp$3.parseYield = function(noIn) {
+	  if (!this.yieldPos) { this.yieldPos = this.start; }
+
+	  var node = this.startNode();
+	  this.next();
+	  if (this.type === types$2.semi || this.canInsertSemicolon() || (this.type !== types$2.star && !this.type.startsExpr)) {
+	    node.delegate = false;
+	    node.argument = null;
+	  } else {
+	    node.delegate = this.eat(types$2.star);
+	    node.argument = this.parseMaybeAssign(noIn);
+	  }
+	  return this.finishNode(node, "YieldExpression")
+	};
+
+	pp$3.parseAwait = function() {
+	  if (!this.awaitPos) { this.awaitPos = this.start; }
+
+	  var node = this.startNode();
+	  this.next();
+	  node.argument = this.parseMaybeUnary(null, true);
+	  return this.finishNode(node, "AwaitExpression")
+	};
+
+	var pp$4 = Parser.prototype;
+
+	// This function is used to raise exceptions on parse errors. It
+	// takes an offset integer (into the current `input`) to indicate
+	// the location of the error, attaches the position to the end
+	// of the error message, and then raises a `SyntaxError` with that
+	// message.
+
+	pp$4.raise = function(pos, message) {
+	  var loc = getLineInfo(this.input, pos);
+	  message += " (" + loc.line + ":" + loc.column + ")";
+	  var err = new SyntaxError(message);
+	  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;
+	  throw err
+	};
+
+	pp$4.raiseRecoverable = pp$4.raise;
+
+	pp$4.curPosition = function() {
+	  if (this.options.locations) {
+	    return new Position(this.curLine, this.pos - this.lineStart)
+	  }
+	};
+
+	var pp$5 = Parser.prototype;
+
+	var Scope = function Scope(flags) {
+	  this.flags = flags;
+	  // A list of var-declared names in the current lexical scope
+	  this.var = [];
+	  // A list of lexically-declared names in the current lexical scope
+	  this.lexical = [];
+	  // A list of lexically-declared FunctionDeclaration names in the current lexical scope
+	  this.functions = [];
+	};
+
+	// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+
+	pp$5.enterScope = function(flags) {
+	  this.scopeStack.push(new Scope(flags));
+	};
+
+	pp$5.exitScope = function() {
+	  this.scopeStack.pop();
+	};
+
+	// The spec says:
+	// > At the top level of a function, or script, function declarations are
+	// > treated like var declarations rather than like lexical declarations.
+	pp$5.treatFunctionsAsVarInScope = function(scope) {
+	  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)
+	};
+
+	pp$5.declareName = function(name, bindingType, pos) {
+	  var redeclared = false;
+	  if (bindingType === BIND_LEXICAL) {
+	    var scope = this.currentScope();
+	    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;
+	    scope.lexical.push(name);
+	    if (this.inModule && (scope.flags & SCOPE_TOP))
+	      { delete this.undefinedExports[name]; }
+	  } else if (bindingType === BIND_SIMPLE_CATCH) {
+	    var scope$1 = this.currentScope();
+	    scope$1.lexical.push(name);
+	  } else if (bindingType === BIND_FUNCTION) {
+	    var scope$2 = this.currentScope();
+	    if (this.treatFunctionsAsVar)
+	      { redeclared = scope$2.lexical.indexOf(name) > -1; }
+	    else
+	      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }
+	    scope$2.functions.push(name);
+	  } else {
+	    for (var i = this.scopeStack.length - 1; i >= 0; --i) {
+	      var scope$3 = this.scopeStack[i];
+	      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||
+	          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {
+	        redeclared = true;
+	        break
+	      }
+	      scope$3.var.push(name);
+	      if (this.inModule && (scope$3.flags & SCOPE_TOP))
+	        { delete this.undefinedExports[name]; }
+	      if (scope$3.flags & SCOPE_VAR) { break }
+	    }
+	  }
+	  if (redeclared) { this.raiseRecoverable(pos, ("Identifier '" + name + "' has already been declared")); }
+	};
+
+	pp$5.checkLocalExport = function(id) {
+	  // scope.functions must be empty as Module code is always strict.
+	  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&
+	      this.scopeStack[0].var.indexOf(id.name) === -1) {
+	    this.undefinedExports[id.name] = id;
+	  }
+	};
+
+	pp$5.currentScope = function() {
+	  return this.scopeStack[this.scopeStack.length - 1]
+	};
+
+	pp$5.currentVarScope = function() {
+	  for (var i = this.scopeStack.length - 1;; i--) {
+	    var scope = this.scopeStack[i];
+	    if (scope.flags & SCOPE_VAR) { return scope }
+	  }
+	};
+
+	// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+	pp$5.currentThisScope = function() {
+	  for (var i = this.scopeStack.length - 1;; i--) {
+	    var scope = this.scopeStack[i];
+	    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }
+	  }
+	};
+
+	var Node = function Node(parser, pos, loc) {
+	  this.type = "";
+	  this.start = pos;
+	  this.end = 0;
+	  if (parser.options.locations)
+	    { this.loc = new SourceLocation(parser, loc); }
+	  if (parser.options.directSourceFile)
+	    { this.sourceFile = parser.options.directSourceFile; }
+	  if (parser.options.ranges)
+	    { this.range = [pos, 0]; }
+	};
+
+	// Start an AST node, attaching a start offset.
+
+	var pp$6 = Parser.prototype;
+
+	pp$6.startNode = function() {
+	  return new Node(this, this.start, this.startLoc)
+	};
+
+	pp$6.startNodeAt = function(pos, loc) {
+	  return new Node(this, pos, loc)
+	};
+
+	// Finish an AST node, adding `type` and `end` properties.
+
+	function finishNodeAt(node, type, pos, loc) {
+	  node.type = type;
+	  node.end = pos;
+	  if (this.options.locations)
+	    { node.loc.end = loc; }
+	  if (this.options.ranges)
+	    { node.range[1] = pos; }
+	  return node
+	}
+
+	pp$6.finishNode = function(node, type) {
+	  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)
+	};
+
+	// Finish node at given position
+
+	pp$6.finishNodeAt = function(node, type, pos, loc) {
+	  return finishNodeAt.call(this, node, type, pos, loc)
+	};
+
+	// The algorithm used to determine whether a regexp can appear at a
+
+	var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {
+	  this.token = token;
+	  this.isExpr = !!isExpr;
+	  this.preserveSpace = !!preserveSpace;
+	  this.override = override;
+	  this.generator = !!generator;
+	};
+
+	var types$1$1 = {
+	  b_stat: new TokContext("{", false),
+	  b_expr: new TokContext("{", true),
+	  b_tmpl: new TokContext("${", false),
+	  p_stat: new TokContext("(", false),
+	  p_expr: new TokContext("(", true),
+	  q_tmpl: new TokContext("`", true, true, function (p) { return p.tryReadTemplateToken(); }),
+	  f_stat: new TokContext("function", false),
+	  f_expr: new TokContext("function", true),
+	  f_expr_gen: new TokContext("function", true, false, null, true),
+	  f_gen: new TokContext("function", false, false, null, true)
+	};
+
+	var pp$7 = Parser.prototype;
+
+	pp$7.initialContext = function() {
+	  return [types$1$1.b_stat]
+	};
+
+	pp$7.braceIsBlock = function(prevType) {
+	  var parent = this.curContext();
+	  if (parent === types$1$1.f_expr || parent === types$1$1.f_stat)
+	    { return true }
+	  if (prevType === types$2.colon && (parent === types$1$1.b_stat || parent === types$1$1.b_expr))
+	    { return !parent.isExpr }
+
+	  // The check for `tt.name && exprAllowed` detects whether we are
+	  // after a `yield` or `of` construct. See the `updateContext` for
+	  // `tt.name`.
+	  if (prevType === types$2._return || prevType === types$2.name && this.exprAllowed)
+	    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }
+	  if (prevType === types$2._else || prevType === types$2.semi || prevType === types$2.eof || prevType === types$2.parenR || prevType === types$2.arrow)
+	    { return true }
+	  if (prevType === types$2.braceL)
+	    { return parent === types$1$1.b_stat }
+	  if (prevType === types$2._var || prevType === types$2._const || prevType === types$2.name)
+	    { return false }
+	  return !this.exprAllowed
+	};
+
+	pp$7.inGeneratorContext = function() {
+	  for (var i = this.context.length - 1; i >= 1; i--) {
+	    var context = this.context[i];
+	    if (context.token === "function")
+	      { return context.generator }
+	  }
+	  return false
+	};
+
+	pp$7.updateContext = function(prevType) {
+	  var update, type = this.type;
+	  if (type.keyword && prevType === types$2.dot)
+	    { this.exprAllowed = false; }
+	  else if (update = type.updateContext)
+	    { update.call(this, prevType); }
+	  else
+	    { this.exprAllowed = type.beforeExpr; }
+	};
+
+	// Token-specific context update code
+
+	types$2.parenR.updateContext = types$2.braceR.updateContext = function() {
+	  if (this.context.length === 1) {
+	    this.exprAllowed = true;
+	    return
+	  }
+	  var out = this.context.pop();
+	  if (out === types$1$1.b_stat && this.curContext().token === "function") {
+	    out = this.context.pop();
+	  }
+	  this.exprAllowed = !out.isExpr;
+	};
+
+	types$2.braceL.updateContext = function(prevType) {
+	  this.context.push(this.braceIsBlock(prevType) ? types$1$1.b_stat : types$1$1.b_expr);
+	  this.exprAllowed = true;
+	};
+
+	types$2.dollarBraceL.updateContext = function() {
+	  this.context.push(types$1$1.b_tmpl);
+	  this.exprAllowed = true;
+	};
+
+	types$2.parenL.updateContext = function(prevType) {
+	  var statementParens = prevType === types$2._if || prevType === types$2._for || prevType === types$2._with || prevType === types$2._while;
+	  this.context.push(statementParens ? types$1$1.p_stat : types$1$1.p_expr);
+	  this.exprAllowed = true;
+	};
+
+	types$2.incDec.updateContext = function() {
+	  // tokExprAllowed stays unchanged
+	};
+
+	types$2._function.updateContext = types$2._class.updateContext = function(prevType) {
+	  if (prevType.beforeExpr && prevType !== types$2.semi && prevType !== types$2._else &&
+	      !(prevType === types$2._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&
+	      !((prevType === types$2.colon || prevType === types$2.braceL) && this.curContext() === types$1$1.b_stat))
+	    { this.context.push(types$1$1.f_expr); }
+	  else
+	    { this.context.push(types$1$1.f_stat); }
+	  this.exprAllowed = false;
+	};
+
+	types$2.backQuote.updateContext = function() {
+	  if (this.curContext() === types$1$1.q_tmpl)
+	    { this.context.pop(); }
+	  else
+	    { this.context.push(types$1$1.q_tmpl); }
+	  this.exprAllowed = false;
+	};
+
+	types$2.star.updateContext = function(prevType) {
+	  if (prevType === types$2._function) {
+	    var index = this.context.length - 1;
+	    if (this.context[index] === types$1$1.f_expr)
+	      { this.context[index] = types$1$1.f_expr_gen; }
+	    else
+	      { this.context[index] = types$1$1.f_gen; }
+	  }
+	  this.exprAllowed = true;
+	};
+
+	types$2.name.updateContext = function(prevType) {
+	  var allowed = false;
+	  if (this.options.ecmaVersion >= 6 && prevType !== types$2.dot) {
+	    if (this.value === "of" && !this.exprAllowed ||
+	        this.value === "yield" && this.inGeneratorContext())
+	      { allowed = true; }
+	  }
+	  this.exprAllowed = allowed;
+	};
+
+	// This file contains Unicode properties extracted from the ECMAScript
+	// specification. The lists are extracted like so:
+	// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+
+	// #table-binary-unicode-properties
+	var ecma9BinaryProperties = "ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";
+	var ecma10BinaryProperties = ecma9BinaryProperties + " Extended_Pictographic";
+	var ecma11BinaryProperties = ecma10BinaryProperties;
+	var unicodeBinaryProperties = {
+	  9: ecma9BinaryProperties,
+	  10: ecma10BinaryProperties,
+	  11: ecma11BinaryProperties
+	};
+
+	// #table-unicode-general-category-values
+	var unicodeGeneralCategoryValues = "Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";
+
+	// #table-unicode-script-values
+	var ecma9ScriptValues = "Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";
+	var ecma10ScriptValues = ecma9ScriptValues + " Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";
+	var ecma11ScriptValues = ecma10ScriptValues + " Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";
+	var unicodeScriptValues = {
+	  9: ecma9ScriptValues,
+	  10: ecma10ScriptValues,
+	  11: ecma11ScriptValues
+	};
+
+	var data = {};
+	function buildUnicodeData(ecmaVersion) {
+	  var d = data[ecmaVersion] = {
+	    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + " " + unicodeGeneralCategoryValues),
+	    nonBinary: {
+	      General_Category: wordsRegexp(unicodeGeneralCategoryValues),
+	      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])
+	    }
+	  };
+	  d.nonBinary.Script_Extensions = d.nonBinary.Script;
+
+	  d.nonBinary.gc = d.nonBinary.General_Category;
+	  d.nonBinary.sc = d.nonBinary.Script;
+	  d.nonBinary.scx = d.nonBinary.Script_Extensions;
+	}
+	buildUnicodeData(9);
+	buildUnicodeData(10);
+	buildUnicodeData(11);
+
+	var pp$8 = Parser.prototype;
+
+	var RegExpValidationState = function RegExpValidationState(parser) {
+	  this.parser = parser;
+	  this.validFlags = "gim" + (parser.options.ecmaVersion >= 6 ? "uy" : "") + (parser.options.ecmaVersion >= 9 ? "s" : "");
+	  this.unicodeProperties = data[parser.options.ecmaVersion >= 11 ? 11 : parser.options.ecmaVersion];
+	  this.source = "";
+	  this.flags = "";
+	  this.start = 0;
+	  this.switchU = false;
+	  this.switchN = false;
+	  this.pos = 0;
+	  this.lastIntValue = 0;
+	  this.lastStringValue = "";
+	  this.lastAssertionIsQuantifiable = false;
+	  this.numCapturingParens = 0;
+	  this.maxBackReference = 0;
+	  this.groupNames = [];
+	  this.backReferenceNames = [];
+	};
+
+	RegExpValidationState.prototype.reset = function reset (start, pattern, flags) {
+	  var unicode = flags.indexOf("u") !== -1;
+	  this.start = start | 0;
+	  this.source = pattern + "";
+	  this.flags = flags;
+	  this.switchU = unicode && this.parser.options.ecmaVersion >= 6;
+	  this.switchN = unicode && this.parser.options.ecmaVersion >= 9;
+	};
+
+	RegExpValidationState.prototype.raise = function raise (message) {
+	  this.parser.raiseRecoverable(this.start, ("Invalid regular expression: /" + (this.source) + "/: " + message));
+	};
+
+	// If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+	// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+	RegExpValidationState.prototype.at = function at (i) {
+	  var s = this.source;
+	  var l = s.length;
+	  if (i >= l) {
+	    return -1
+	  }
+	  var c = s.charCodeAt(i);
+	  if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+	    return c
+	  }
+	  return (c << 10) + s.charCodeAt(i + 1) - 0x35FDC00
+	};
+
+	RegExpValidationState.prototype.nextIndex = function nextIndex (i) {
+	  var s = this.source;
+	  var l = s.length;
+	  if (i >= l) {
+	    return l
+	  }
+	  var c = s.charCodeAt(i);
+	  if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+	    return i + 1
+	  }
+	  return i + 2
+	};
+
+	RegExpValidationState.prototype.current = function current () {
+	  return this.at(this.pos)
+	};
+
+	RegExpValidationState.prototype.lookahead = function lookahead () {
+	  return this.at(this.nextIndex(this.pos))
+	};
+
+	RegExpValidationState.prototype.advance = function advance () {
+	  this.pos = this.nextIndex(this.pos);
+	};
+
+	RegExpValidationState.prototype.eat = function eat (ch) {
+	  if (this.current() === ch) {
+	    this.advance();
+	    return true
+	  }
+	  return false
+	};
+
+	function codePointToString(ch) {
+	  if (ch <= 0xFFFF) { return String.fromCharCode(ch) }
+	  ch -= 0x10000;
+	  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)
+	}
+
+	/**
+	 * Validate the flags part of a given RegExpLiteral.
+	 *
+	 * @param {RegExpValidationState} state The state to validate RegExp.
+	 * @returns {void}
+	 */
+	pp$8.validateRegExpFlags = function(state) {
+	  var validFlags = state.validFlags;
+	  var flags = state.flags;
+
+	  for (var i = 0; i < flags.length; i++) {
+	    var flag = flags.charAt(i);
+	    if (validFlags.indexOf(flag) === -1) {
+	      this.raise(state.start, "Invalid regular expression flag");
+	    }
+	    if (flags.indexOf(flag, i + 1) > -1) {
+	      this.raise(state.start, "Duplicate regular expression flag");
+	    }
+	  }
+	};
+
+	/**
+	 * Validate the pattern part of a given RegExpLiteral.
+	 *
+	 * @param {RegExpValidationState} state The state to validate RegExp.
+	 * @returns {void}
+	 */
+	pp$8.validateRegExpPattern = function(state) {
+	  this.regexp_pattern(state);
+
+	  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+	  // parsing contains a |GroupName|, reparse with the goal symbol
+	  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+	  // exception if _P_ did not conform to the grammar, if any elements of _P_
+	  // were not matched by the parse, or if any Early Error conditions exist.
+	  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {
+	    state.switchN = true;
+	    this.regexp_pattern(state);
+	  }
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+	pp$8.regexp_pattern = function(state) {
+	  state.pos = 0;
+	  state.lastIntValue = 0;
+	  state.lastStringValue = "";
+	  state.lastAssertionIsQuantifiable = false;
+	  state.numCapturingParens = 0;
+	  state.maxBackReference = 0;
+	  state.groupNames.length = 0;
+	  state.backReferenceNames.length = 0;
+
+	  this.regexp_disjunction(state);
+
+	  if (state.pos !== state.source.length) {
+	    // Make the same messages as V8.
+	    if (state.eat(0x29 /* ) */)) {
+	      state.raise("Unmatched ')'");
+	    }
+	    if (state.eat(0x5D /* [ */) || state.eat(0x7D /* } */)) {
+	      state.raise("Lone quantifier brackets");
+	    }
+	  }
+	  if (state.maxBackReference > state.numCapturingParens) {
+	    state.raise("Invalid escape");
+	  }
+	  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {
+	    var name = list[i];
+
+	    if (state.groupNames.indexOf(name) === -1) {
+	      state.raise("Invalid named capture referenced");
+	    }
+	  }
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+	pp$8.regexp_disjunction = function(state) {
+	  this.regexp_alternative(state);
+	  while (state.eat(0x7C /* | */)) {
+	    this.regexp_alternative(state);
+	  }
+
+	  // Make the same message as V8.
+	  if (this.regexp_eatQuantifier(state, true)) {
+	    state.raise("Nothing to repeat");
+	  }
+	  if (state.eat(0x7B /* { */)) {
+	    state.raise("Lone quantifier brackets");
+	  }
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+	pp$8.regexp_alternative = function(state) {
+	  while (state.pos < state.source.length && this.regexp_eatTerm(state))
+	    { }
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+	pp$8.regexp_eatTerm = function(state) {
+	  if (this.regexp_eatAssertion(state)) {
+	    // Handle `QuantifiableAssertion Quantifier` alternative.
+	    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+	    // is a QuantifiableAssertion.
+	    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {
+	      // Make the same message as V8.
+	      if (state.switchU) {
+	        state.raise("Invalid quantifier");
+	      }
+	    }
+	    return true
+	  }
+
+	  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {
+	    this.regexp_eatQuantifier(state);
+	    return true
+	  }
+
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+	pp$8.regexp_eatAssertion = function(state) {
+	  var start = state.pos;
+	  state.lastAssertionIsQuantifiable = false;
+
+	  // ^, $
+	  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {
+	    return true
+	  }
+
+	  // \b \B
+	  if (state.eat(0x5C /* \ */)) {
+	    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {
+	      return true
+	    }
+	    state.pos = start;
+	  }
+
+	  // Lookahead / Lookbehind
+	  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {
+	    var lookbehind = false;
+	    if (this.options.ecmaVersion >= 9) {
+	      lookbehind = state.eat(0x3C /* < */);
+	    }
+	    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {
+	      this.regexp_disjunction(state);
+	      if (!state.eat(0x29 /* ) */)) {
+	        state.raise("Unterminated group");
+	      }
+	      state.lastAssertionIsQuantifiable = !lookbehind;
+	      return true
+	    }
+	  }
+
+	  state.pos = start;
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+	pp$8.regexp_eatQuantifier = function(state, noError) {
+	  if ( noError === void 0 ) noError = false;
+
+	  if (this.regexp_eatQuantifierPrefix(state, noError)) {
+	    state.eat(0x3F /* ? */);
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+	pp$8.regexp_eatQuantifierPrefix = function(state, noError) {
+	  return (
+	    state.eat(0x2A /* * */) ||
+	    state.eat(0x2B /* + */) ||
+	    state.eat(0x3F /* ? */) ||
+	    this.regexp_eatBracedQuantifier(state, noError)
+	  )
+	};
+	pp$8.regexp_eatBracedQuantifier = function(state, noError) {
+	  var start = state.pos;
+	  if (state.eat(0x7B /* { */)) {
+	    var min = 0, max = -1;
+	    if (this.regexp_eatDecimalDigits(state)) {
+	      min = state.lastIntValue;
+	      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {
+	        max = state.lastIntValue;
+	      }
+	      if (state.eat(0x7D /* } */)) {
+	        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+	        if (max !== -1 && max < min && !noError) {
+	          state.raise("numbers out of order in {} quantifier");
+	        }
+	        return true
+	      }
+	    }
+	    if (state.switchU && !noError) {
+	      state.raise("Incomplete quantifier");
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+	pp$8.regexp_eatAtom = function(state) {
+	  return (
+	    this.regexp_eatPatternCharacters(state) ||
+	    state.eat(0x2E /* . */) ||
+	    this.regexp_eatReverseSolidusAtomEscape(state) ||
+	    this.regexp_eatCharacterClass(state) ||
+	    this.regexp_eatUncapturingGroup(state) ||
+	    this.regexp_eatCapturingGroup(state)
+	  )
+	};
+	pp$8.regexp_eatReverseSolidusAtomEscape = function(state) {
+	  var start = state.pos;
+	  if (state.eat(0x5C /* \ */)) {
+	    if (this.regexp_eatAtomEscape(state)) {
+	      return true
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+	pp$8.regexp_eatUncapturingGroup = function(state) {
+	  var start = state.pos;
+	  if (state.eat(0x28 /* ( */)) {
+	    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {
+	      this.regexp_disjunction(state);
+	      if (state.eat(0x29 /* ) */)) {
+	        return true
+	      }
+	      state.raise("Unterminated group");
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+	pp$8.regexp_eatCapturingGroup = function(state) {
+	  if (state.eat(0x28 /* ( */)) {
+	    if (this.options.ecmaVersion >= 9) {
+	      this.regexp_groupSpecifier(state);
+	    } else if (state.current() === 0x3F /* ? */) {
+	      state.raise("Invalid group");
+	    }
+	    this.regexp_disjunction(state);
+	    if (state.eat(0x29 /* ) */)) {
+	      state.numCapturingParens += 1;
+	      return true
+	    }
+	    state.raise("Unterminated group");
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+	pp$8.regexp_eatExtendedAtom = function(state) {
+	  return (
+	    state.eat(0x2E /* . */) ||
+	    this.regexp_eatReverseSolidusAtomEscape(state) ||
+	    this.regexp_eatCharacterClass(state) ||
+	    this.regexp_eatUncapturingGroup(state) ||
+	    this.regexp_eatCapturingGroup(state) ||
+	    this.regexp_eatInvalidBracedQuantifier(state) ||
+	    this.regexp_eatExtendedPatternCharacter(state)
+	  )
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+	pp$8.regexp_eatInvalidBracedQuantifier = function(state) {
+	  if (this.regexp_eatBracedQuantifier(state, true)) {
+	    state.raise("Nothing to repeat");
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+	pp$8.regexp_eatSyntaxCharacter = function(state) {
+	  var ch = state.current();
+	  if (isSyntaxCharacter(ch)) {
+	    state.lastIntValue = ch;
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+	function isSyntaxCharacter(ch) {
+	  return (
+	    ch === 0x24 /* $ */ ||
+	    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||
+	    ch === 0x2E /* . */ ||
+	    ch === 0x3F /* ? */ ||
+	    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||
+	    ch >= 0x7B /* { */ && ch <= 0x7D /* } */
+	  )
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+	// But eat eager.
+	pp$8.regexp_eatPatternCharacters = function(state) {
+	  var start = state.pos;
+	  var ch = 0;
+	  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {
+	    state.advance();
+	  }
+	  return state.pos !== start
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+	pp$8.regexp_eatExtendedPatternCharacter = function(state) {
+	  var ch = state.current();
+	  if (
+	    ch !== -1 &&
+	    ch !== 0x24 /* $ */ &&
+	    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&
+	    ch !== 0x2E /* . */ &&
+	    ch !== 0x3F /* ? */ &&
+	    ch !== 0x5B /* [ */ &&
+	    ch !== 0x5E /* ^ */ &&
+	    ch !== 0x7C /* | */
+	  ) {
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+
+	// GroupSpecifier[U] ::
+	//   [empty]
+	//   `?` GroupName[?U]
+	pp$8.regexp_groupSpecifier = function(state) {
+	  if (state.eat(0x3F /* ? */)) {
+	    if (this.regexp_eatGroupName(state)) {
+	      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {
+	        state.raise("Duplicate capture group name");
+	      }
+	      state.groupNames.push(state.lastStringValue);
+	      return
+	    }
+	    state.raise("Invalid group");
+	  }
+	};
+
+	// GroupName[U] ::
+	//   `<` RegExpIdentifierName[?U] `>`
+	// Note: this updates `state.lastStringValue` property with the eaten name.
+	pp$8.regexp_eatGroupName = function(state) {
+	  state.lastStringValue = "";
+	  if (state.eat(0x3C /* < */)) {
+	    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {
+	      return true
+	    }
+	    state.raise("Invalid capture group name");
+	  }
+	  return false
+	};
+
+	// RegExpIdentifierName[U] ::
+	//   RegExpIdentifierStart[?U]
+	//   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]
+	// Note: this updates `state.lastStringValue` property with the eaten name.
+	pp$8.regexp_eatRegExpIdentifierName = function(state) {
+	  state.lastStringValue = "";
+	  if (this.regexp_eatRegExpIdentifierStart(state)) {
+	    state.lastStringValue += codePointToString(state.lastIntValue);
+	    while (this.regexp_eatRegExpIdentifierPart(state)) {
+	      state.lastStringValue += codePointToString(state.lastIntValue);
+	    }
+	    return true
+	  }
+	  return false
+	};
+
+	// RegExpIdentifierStart[U] ::
+	//   UnicodeIDStart
+	//   `$`
+	//   `_`
+	//   `\` RegExpUnicodeEscapeSequence[?U]
+	pp$8.regexp_eatRegExpIdentifierStart = function(state) {
+	  var start = state.pos;
+	  var ch = state.current();
+	  state.advance();
+
+	  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+	    ch = state.lastIntValue;
+	  }
+	  if (isRegExpIdentifierStart(ch)) {
+	    state.lastIntValue = ch;
+	    return true
+	  }
+
+	  state.pos = start;
+	  return false
+	};
+	function isRegExpIdentifierStart(ch) {
+	  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */
+	}
+
+	// RegExpIdentifierPart[U] ::
+	//   UnicodeIDContinue
+	//   `$`
+	//   `_`
+	//   `\` RegExpUnicodeEscapeSequence[?U]
+	//   <ZWNJ>
+	//   <ZWJ>
+	pp$8.regexp_eatRegExpIdentifierPart = function(state) {
+	  var start = state.pos;
+	  var ch = state.current();
+	  state.advance();
+
+	  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+	    ch = state.lastIntValue;
+	  }
+	  if (isRegExpIdentifierPart(ch)) {
+	    state.lastIntValue = ch;
+	    return true
+	  }
+
+	  state.pos = start;
+	  return false
+	};
+	function isRegExpIdentifierPart(ch) {
+	  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+	pp$8.regexp_eatAtomEscape = function(state) {
+	  if (
+	    this.regexp_eatBackReference(state) ||
+	    this.regexp_eatCharacterClassEscape(state) ||
+	    this.regexp_eatCharacterEscape(state) ||
+	    (state.switchN && this.regexp_eatKGroupName(state))
+	  ) {
+	    return true
+	  }
+	  if (state.switchU) {
+	    // Make the same message as V8.
+	    if (state.current() === 0x63 /* c */) {
+	      state.raise("Invalid unicode escape");
+	    }
+	    state.raise("Invalid escape");
+	  }
+	  return false
+	};
+	pp$8.regexp_eatBackReference = function(state) {
+	  var start = state.pos;
+	  if (this.regexp_eatDecimalEscape(state)) {
+	    var n = state.lastIntValue;
+	    if (state.switchU) {
+	      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+	      if (n > state.maxBackReference) {
+	        state.maxBackReference = n;
+	      }
+	      return true
+	    }
+	    if (n <= state.numCapturingParens) {
+	      return true
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+	pp$8.regexp_eatKGroupName = function(state) {
+	  if (state.eat(0x6B /* k */)) {
+	    if (this.regexp_eatGroupName(state)) {
+	      state.backReferenceNames.push(state.lastStringValue);
+	      return true
+	    }
+	    state.raise("Invalid named reference");
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+	pp$8.regexp_eatCharacterEscape = function(state) {
+	  return (
+	    this.regexp_eatControlEscape(state) ||
+	    this.regexp_eatCControlLetter(state) ||
+	    this.regexp_eatZero(state) ||
+	    this.regexp_eatHexEscapeSequence(state) ||
+	    this.regexp_eatRegExpUnicodeEscapeSequence(state) ||
+	    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||
+	    this.regexp_eatIdentityEscape(state)
+	  )
+	};
+	pp$8.regexp_eatCControlLetter = function(state) {
+	  var start = state.pos;
+	  if (state.eat(0x63 /* c */)) {
+	    if (this.regexp_eatControlLetter(state)) {
+	      return true
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+	pp$8.regexp_eatZero = function(state) {
+	  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {
+	    state.lastIntValue = 0;
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+	pp$8.regexp_eatControlEscape = function(state) {
+	  var ch = state.current();
+	  if (ch === 0x74 /* t */) {
+	    state.lastIntValue = 0x09; /* \t */
+	    state.advance();
+	    return true
+	  }
+	  if (ch === 0x6E /* n */) {
+	    state.lastIntValue = 0x0A; /* \n */
+	    state.advance();
+	    return true
+	  }
+	  if (ch === 0x76 /* v */) {
+	    state.lastIntValue = 0x0B; /* \v */
+	    state.advance();
+	    return true
+	  }
+	  if (ch === 0x66 /* f */) {
+	    state.lastIntValue = 0x0C; /* \f */
+	    state.advance();
+	    return true
+	  }
+	  if (ch === 0x72 /* r */) {
+	    state.lastIntValue = 0x0D; /* \r */
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+	pp$8.regexp_eatControlLetter = function(state) {
+	  var ch = state.current();
+	  if (isControlLetter(ch)) {
+	    state.lastIntValue = ch % 0x20;
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+	function isControlLetter(ch) {
+	  return (
+	    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||
+	    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)
+	  )
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+	pp$8.regexp_eatRegExpUnicodeEscapeSequence = function(state) {
+	  var start = state.pos;
+
+	  if (state.eat(0x75 /* u */)) {
+	    if (this.regexp_eatFixedHexDigits(state, 4)) {
+	      var lead = state.lastIntValue;
+	      if (state.switchU && lead >= 0xD800 && lead <= 0xDBFF) {
+	        var leadSurrogateEnd = state.pos;
+	        if (state.eat(0x5C /* \ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {
+	          var trail = state.lastIntValue;
+	          if (trail >= 0xDC00 && trail <= 0xDFFF) {
+	            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;
+	            return true
+	          }
+	        }
+	        state.pos = leadSurrogateEnd;
+	        state.lastIntValue = lead;
+	      }
+	      return true
+	    }
+	    if (
+	      state.switchU &&
+	      state.eat(0x7B /* { */) &&
+	      this.regexp_eatHexDigits(state) &&
+	      state.eat(0x7D /* } */) &&
+	      isValidUnicode(state.lastIntValue)
+	    ) {
+	      return true
+	    }
+	    if (state.switchU) {
+	      state.raise("Invalid unicode escape");
+	    }
+	    state.pos = start;
+	  }
+
+	  return false
+	};
+	function isValidUnicode(ch) {
+	  return ch >= 0 && ch <= 0x10FFFF
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+	pp$8.regexp_eatIdentityEscape = function(state) {
+	  if (state.switchU) {
+	    if (this.regexp_eatSyntaxCharacter(state)) {
+	      return true
+	    }
+	    if (state.eat(0x2F /* / */)) {
+	      state.lastIntValue = 0x2F; /* / */
+	      return true
+	    }
+	    return false
+	  }
+
+	  var ch = state.current();
+	  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {
+	    state.lastIntValue = ch;
+	    state.advance();
+	    return true
+	  }
+
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+	pp$8.regexp_eatDecimalEscape = function(state) {
+	  state.lastIntValue = 0;
+	  var ch = state.current();
+	  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {
+	    do {
+	      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+	      state.advance();
+	    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+	pp$8.regexp_eatCharacterClassEscape = function(state) {
+	  var ch = state.current();
+
+	  if (isCharacterClassEscape(ch)) {
+	    state.lastIntValue = -1;
+	    state.advance();
+	    return true
+	  }
+
+	  if (
+	    state.switchU &&
+	    this.options.ecmaVersion >= 9 &&
+	    (ch === 0x50 /* P */ || ch === 0x70 /* p */)
+	  ) {
+	    state.lastIntValue = -1;
+	    state.advance();
+	    if (
+	      state.eat(0x7B /* { */) &&
+	      this.regexp_eatUnicodePropertyValueExpression(state) &&
+	      state.eat(0x7D /* } */)
+	    ) {
+	      return true
+	    }
+	    state.raise("Invalid property name");
+	  }
+
+	  return false
+	};
+	function isCharacterClassEscape(ch) {
+	  return (
+	    ch === 0x64 /* d */ ||
+	    ch === 0x44 /* D */ ||
+	    ch === 0x73 /* s */ ||
+	    ch === 0x53 /* S */ ||
+	    ch === 0x77 /* w */ ||
+	    ch === 0x57 /* W */
+	  )
+	}
+
+	// UnicodePropertyValueExpression ::
+	//   UnicodePropertyName `=` UnicodePropertyValue
+	//   LoneUnicodePropertyNameOrValue
+	pp$8.regexp_eatUnicodePropertyValueExpression = function(state) {
+	  var start = state.pos;
+
+	  // UnicodePropertyName `=` UnicodePropertyValue
+	  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {
+	    var name = state.lastStringValue;
+	    if (this.regexp_eatUnicodePropertyValue(state)) {
+	      var value = state.lastStringValue;
+	      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);
+	      return true
+	    }
+	  }
+	  state.pos = start;
+
+	  // LoneUnicodePropertyNameOrValue
+	  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {
+	    var nameOrValue = state.lastStringValue;
+	    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);
+	    return true
+	  }
+	  return false
+	};
+	pp$8.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {
+	  if (!has$1(state.unicodeProperties.nonBinary, name))
+	    { state.raise("Invalid property name"); }
+	  if (!state.unicodeProperties.nonBinary[name].test(value))
+	    { state.raise("Invalid property value"); }
+	};
+	pp$8.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {
+	  if (!state.unicodeProperties.binary.test(nameOrValue))
+	    { state.raise("Invalid property name"); }
+	};
+
+	// UnicodePropertyName ::
+	//   UnicodePropertyNameCharacters
+	pp$8.regexp_eatUnicodePropertyName = function(state) {
+	  var ch = 0;
+	  state.lastStringValue = "";
+	  while (isUnicodePropertyNameCharacter(ch = state.current())) {
+	    state.lastStringValue += codePointToString(ch);
+	    state.advance();
+	  }
+	  return state.lastStringValue !== ""
+	};
+	function isUnicodePropertyNameCharacter(ch) {
+	  return isControlLetter(ch) || ch === 0x5F /* _ */
+	}
+
+	// UnicodePropertyValue ::
+	//   UnicodePropertyValueCharacters
+	pp$8.regexp_eatUnicodePropertyValue = function(state) {
+	  var ch = 0;
+	  state.lastStringValue = "";
+	  while (isUnicodePropertyValueCharacter(ch = state.current())) {
+	    state.lastStringValue += codePointToString(ch);
+	    state.advance();
+	  }
+	  return state.lastStringValue !== ""
+	};
+	function isUnicodePropertyValueCharacter(ch) {
+	  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)
+	}
+
+	// LoneUnicodePropertyNameOrValue ::
+	//   UnicodePropertyValueCharacters
+	pp$8.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {
+	  return this.regexp_eatUnicodePropertyValue(state)
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+	pp$8.regexp_eatCharacterClass = function(state) {
+	  if (state.eat(0x5B /* [ */)) {
+	    state.eat(0x5E /* ^ */);
+	    this.regexp_classRanges(state);
+	    if (state.eat(0x5D /* [ */)) {
+	      return true
+	    }
+	    // Unreachable since it threw "unterminated regular expression" error before.
+	    state.raise("Unterminated character class");
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+	pp$8.regexp_classRanges = function(state) {
+	  while (this.regexp_eatClassAtom(state)) {
+	    var left = state.lastIntValue;
+	    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {
+	      var right = state.lastIntValue;
+	      if (state.switchU && (left === -1 || right === -1)) {
+	        state.raise("Invalid character class");
+	      }
+	      if (left !== -1 && right !== -1 && left > right) {
+	        state.raise("Range out of order in character class");
+	      }
+	    }
+	  }
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+	pp$8.regexp_eatClassAtom = function(state) {
+	  var start = state.pos;
+
+	  if (state.eat(0x5C /* \ */)) {
+	    if (this.regexp_eatClassEscape(state)) {
+	      return true
+	    }
+	    if (state.switchU) {
+	      // Make the same message as V8.
+	      var ch$1 = state.current();
+	      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {
+	        state.raise("Invalid class escape");
+	      }
+	      state.raise("Invalid escape");
+	    }
+	    state.pos = start;
+	  }
+
+	  var ch = state.current();
+	  if (ch !== 0x5D /* [ */) {
+	    state.lastIntValue = ch;
+	    state.advance();
+	    return true
+	  }
+
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+	pp$8.regexp_eatClassEscape = function(state) {
+	  var start = state.pos;
+
+	  if (state.eat(0x62 /* b */)) {
+	    state.lastIntValue = 0x08; /* <BS> */
+	    return true
+	  }
+
+	  if (state.switchU && state.eat(0x2D /* - */)) {
+	    state.lastIntValue = 0x2D; /* - */
+	    return true
+	  }
+
+	  if (!state.switchU && state.eat(0x63 /* c */)) {
+	    if (this.regexp_eatClassControlLetter(state)) {
+	      return true
+	    }
+	    state.pos = start;
+	  }
+
+	  return (
+	    this.regexp_eatCharacterClassEscape(state) ||
+	    this.regexp_eatCharacterEscape(state)
+	  )
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+	pp$8.regexp_eatClassControlLetter = function(state) {
+	  var ch = state.current();
+	  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {
+	    state.lastIntValue = ch % 0x20;
+	    state.advance();
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+	pp$8.regexp_eatHexEscapeSequence = function(state) {
+	  var start = state.pos;
+	  if (state.eat(0x78 /* x */)) {
+	    if (this.regexp_eatFixedHexDigits(state, 2)) {
+	      return true
+	    }
+	    if (state.switchU) {
+	      state.raise("Invalid escape");
+	    }
+	    state.pos = start;
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+	pp$8.regexp_eatDecimalDigits = function(state) {
+	  var start = state.pos;
+	  var ch = 0;
+	  state.lastIntValue = 0;
+	  while (isDecimalDigit(ch = state.current())) {
+	    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+	    state.advance();
+	  }
+	  return state.pos !== start
+	};
+	function isDecimalDigit(ch) {
+	  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+	pp$8.regexp_eatHexDigits = function(state) {
+	  var start = state.pos;
+	  var ch = 0;
+	  state.lastIntValue = 0;
+	  while (isHexDigit(ch = state.current())) {
+	    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+	    state.advance();
+	  }
+	  return state.pos !== start
+	};
+	function isHexDigit(ch) {
+	  return (
+	    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||
+	    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||
+	    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)
+	  )
+	}
+	function hexToInt(ch) {
+	  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {
+	    return 10 + (ch - 0x41 /* A */)
+	  }
+	  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {
+	    return 10 + (ch - 0x61 /* a */)
+	  }
+	  return ch - 0x30 /* 0 */
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+	// Allows only 0-377(octal) i.e. 0-255(decimal).
+	pp$8.regexp_eatLegacyOctalEscapeSequence = function(state) {
+	  if (this.regexp_eatOctalDigit(state)) {
+	    var n1 = state.lastIntValue;
+	    if (this.regexp_eatOctalDigit(state)) {
+	      var n2 = state.lastIntValue;
+	      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {
+	        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;
+	      } else {
+	        state.lastIntValue = n1 * 8 + n2;
+	      }
+	    } else {
+	      state.lastIntValue = n1;
+	    }
+	    return true
+	  }
+	  return false
+	};
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+	pp$8.regexp_eatOctalDigit = function(state) {
+	  var ch = state.current();
+	  if (isOctalDigit(ch)) {
+	    state.lastIntValue = ch - 0x30; /* 0 */
+	    state.advance();
+	    return true
+	  }
+	  state.lastIntValue = 0;
+	  return false
+	};
+	function isOctalDigit(ch) {
+	  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */
+	}
+
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+	// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+	// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+	pp$8.regexp_eatFixedHexDigits = function(state, length) {
+	  var start = state.pos;
+	  state.lastIntValue = 0;
+	  for (var i = 0; i < length; ++i) {
+	    var ch = state.current();
+	    if (!isHexDigit(ch)) {
+	      state.pos = start;
+	      return false
+	    }
+	    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+	    state.advance();
+	  }
+	  return true
+	};
+
+	// Object type used to represent tokens. Note that normally, tokens
+	// simply exist as properties on the parser object. This is only
+	// used for the onToken callback and the external tokenizer.
+
+	var Token = function Token(p) {
+	  this.type = p.type;
+	  this.value = p.value;
+	  this.start = p.start;
+	  this.end = p.end;
+	  if (p.options.locations)
+	    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }
+	  if (p.options.ranges)
+	    { this.range = [p.start, p.end]; }
+	};
+
+	// ## Tokenizer
+
+	var pp$9 = Parser.prototype;
+
+	// Move to the next token
+
+	pp$9.next = function() {
+	  if (this.options.onToken)
+	    { this.options.onToken(new Token(this)); }
+
+	  this.lastTokEnd = this.end;
+	  this.lastTokStart = this.start;
+	  this.lastTokEndLoc = this.endLoc;
+	  this.lastTokStartLoc = this.startLoc;
+	  this.nextToken();
+	};
+
+	pp$9.getToken = function() {
+	  this.next();
+	  return new Token(this)
+	};
+
+	// If we're in an ES6 environment, make parsers iterable
+	if (typeof Symbol !== "undefined")
+	  { pp$9[Symbol.iterator] = function() {
+	    var this$1 = this;
+
+	    return {
+	      next: function () {
+	        var token = this$1.getToken();
+	        return {
+	          done: token.type === types$2.eof,
+	          value: token
+	        }
+	      }
+	    }
+	  }; }
+
+	// Toggle strict mode. Re-reads the next number or string to please
+	// pedantic tests (`"use strict"; 010;` should fail).
+
+	pp$9.curContext = function() {
+	  return this.context[this.context.length - 1]
+	};
+
+	// Read a single token, updating the parser object's token-related
+	// properties.
+
+	pp$9.nextToken = function() {
+	  var curContext = this.curContext();
+	  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }
+
+	  this.start = this.pos;
+	  if (this.options.locations) { this.startLoc = this.curPosition(); }
+	  if (this.pos >= this.input.length) { return this.finishToken(types$2.eof) }
+
+	  if (curContext.override) { return curContext.override(this) }
+	  else { this.readToken(this.fullCharCodeAtPos()); }
+	};
+
+	pp$9.readToken = function(code) {
+	  // Identifier or keyword. '\uXXXX' sequences are allowed in
+	  // identifiers, so '\' also dispatches to that.
+	  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */)
+	    { return this.readWord() }
+
+	  return this.getTokenFromCode(code)
+	};
+
+	pp$9.fullCharCodeAtPos = function() {
+	  var code = this.input.charCodeAt(this.pos);
+	  if (code <= 0xd7ff || code >= 0xe000) { return code }
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  return (code << 10) + next - 0x35fdc00
+	};
+
+	pp$9.skipBlockComment = function() {
+	  var startLoc = this.options.onComment && this.curPosition();
+	  var start = this.pos, end = this.input.indexOf("*/", this.pos += 2);
+	  if (end === -1) { this.raise(this.pos - 2, "Unterminated comment"); }
+	  this.pos = end + 2;
+	  if (this.options.locations) {
+	    lineBreakG.lastIndex = start;
+	    var match;
+	    while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {
+	      ++this.curLine;
+	      this.lineStart = match.index + match[0].length;
+	    }
+	  }
+	  if (this.options.onComment)
+	    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
+	                           startLoc, this.curPosition()); }
+	};
+
+	pp$9.skipLineComment = function(startSkip) {
+	  var start = this.pos;
+	  var startLoc = this.options.onComment && this.curPosition();
+	  var ch = this.input.charCodeAt(this.pos += startSkip);
+	  while (this.pos < this.input.length && !isNewLine(ch)) {
+	    ch = this.input.charCodeAt(++this.pos);
+	  }
+	  if (this.options.onComment)
+	    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
+	                           startLoc, this.curPosition()); }
+	};
+
+	// Called at the start of the parse and after every token. Skips
+	// whitespace and comments, and.
+
+	pp$9.skipSpace = function() {
+	  loop: while (this.pos < this.input.length) {
+	    var ch = this.input.charCodeAt(this.pos);
+	    switch (ch) {
+	    case 32: case 160: // ' '
+	      ++this.pos;
+	      break
+	    case 13:
+	      if (this.input.charCodeAt(this.pos + 1) === 10) {
+	        ++this.pos;
+	      }
+	    case 10: case 8232: case 8233:
+	      ++this.pos;
+	      if (this.options.locations) {
+	        ++this.curLine;
+	        this.lineStart = this.pos;
+	      }
+	      break
+	    case 47: // '/'
+	      switch (this.input.charCodeAt(this.pos + 1)) {
+	      case 42: // '*'
+	        this.skipBlockComment();
+	        break
+	      case 47:
+	        this.skipLineComment(2);
+	        break
+	      default:
+	        break loop
+	      }
+	      break
+	    default:
+	      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
+	        ++this.pos;
+	      } else {
+	        break loop
+	      }
+	    }
+	  }
+	};
+
+	// Called at the end of every token. Sets `end`, `val`, and
+	// maintains `context` and `exprAllowed`, and skips the space after
+	// the token, so that the next one's `start` will point at the
+	// right position.
+
+	pp$9.finishToken = function(type, val) {
+	  this.end = this.pos;
+	  if (this.options.locations) { this.endLoc = this.curPosition(); }
+	  var prevType = this.type;
+	  this.type = type;
+	  this.value = val;
+
+	  this.updateContext(prevType);
+	};
+
+	// ### Token reading
+
+	// This is the function that is called to fetch the next token. It
+	// is somewhat obscure, because it works in character codes rather
+	// than characters, and because operator parsing has been inlined
+	// into it.
+	//
+	// All in the name of speed.
+	//
+	pp$9.readToken_dot = function() {
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (next >= 48 && next <= 57) { return this.readNumber(true) }
+	  var next2 = this.input.charCodeAt(this.pos + 2);
+	  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
+	    this.pos += 3;
+	    return this.finishToken(types$2.ellipsis)
+	  } else {
+	    ++this.pos;
+	    return this.finishToken(types$2.dot)
+	  }
+	};
+
+	pp$9.readToken_slash = function() { // '/'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }
+	  if (next === 61) { return this.finishOp(types$2.assign, 2) }
+	  return this.finishOp(types$2.slash, 1)
+	};
+
+	pp$9.readToken_mult_modulo_exp = function(code) { // '%*'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  var size = 1;
+	  var tokentype = code === 42 ? types$2.star : types$2.modulo;
+
+	  // exponentiation operator ** and **=
+	  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {
+	    ++size;
+	    tokentype = types$2.starstar;
+	    next = this.input.charCodeAt(this.pos + 2);
+	  }
+
+	  if (next === 61) { return this.finishOp(types$2.assign, size + 1) }
+	  return this.finishOp(tokentype, size)
+	};
+
+	pp$9.readToken_pipe_amp = function(code) { // '|&'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (next === code) { return this.finishOp(code === 124 ? types$2.logicalOR : types$2.logicalAND, 2) }
+	  if (next === 61) { return this.finishOp(types$2.assign, 2) }
+	  return this.finishOp(code === 124 ? types$2.bitwiseOR : types$2.bitwiseAND, 1)
+	};
+
+	pp$9.readToken_caret = function() { // '^'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (next === 61) { return this.finishOp(types$2.assign, 2) }
+	  return this.finishOp(types$2.bitwiseXOR, 1)
+	};
+
+	pp$9.readToken_plus_min = function(code) { // '+-'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (next === code) {
+	    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&
+	        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {
+	      // A `-->` line comment
+	      this.skipLineComment(3);
+	      this.skipSpace();
+	      return this.nextToken()
+	    }
+	    return this.finishOp(types$2.incDec, 2)
+	  }
+	  if (next === 61) { return this.finishOp(types$2.assign, 2) }
+	  return this.finishOp(types$2.plusMin, 1)
+	};
+
+	pp$9.readToken_lt_gt = function(code) { // '<>'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  var size = 1;
+	  if (next === code) {
+	    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+	    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types$2.assign, size + 1) }
+	    return this.finishOp(types$2.bitShift, size)
+	  }
+	  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&
+	      this.input.charCodeAt(this.pos + 3) === 45) {
+	    // `<!--`, an XML-style comment that should be interpreted as a line comment
+	    this.skipLineComment(4);
+	    this.skipSpace();
+	    return this.nextToken()
+	  }
+	  if (next === 61) { size = 2; }
+	  return this.finishOp(types$2.relational, size)
+	};
+
+	pp$9.readToken_eq_excl = function(code) { // '=!'
+	  var next = this.input.charCodeAt(this.pos + 1);
+	  if (next === 61) { return this.finishOp(types$2.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }
+	  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
+	    this.pos += 2;
+	    return this.finishToken(types$2.arrow)
+	  }
+	  return this.finishOp(code === 61 ? types$2.eq : types$2.prefix, 1)
+	};
+
+	pp$9.getTokenFromCode = function(code) {
+	  switch (code) {
+	  // The interpretation of a dot depends on whether it is followed
+	  // by a digit or another two dots.
+	  case 46: // '.'
+	    return this.readToken_dot()
+
+	  // Punctuation tokens.
+	  case 40: ++this.pos; return this.finishToken(types$2.parenL)
+	  case 41: ++this.pos; return this.finishToken(types$2.parenR)
+	  case 59: ++this.pos; return this.finishToken(types$2.semi)
+	  case 44: ++this.pos; return this.finishToken(types$2.comma)
+	  case 91: ++this.pos; return this.finishToken(types$2.bracketL)
+	  case 93: ++this.pos; return this.finishToken(types$2.bracketR)
+	  case 123: ++this.pos; return this.finishToken(types$2.braceL)
+	  case 125: ++this.pos; return this.finishToken(types$2.braceR)
+	  case 58: ++this.pos; return this.finishToken(types$2.colon)
+	  case 63: ++this.pos; return this.finishToken(types$2.question)
+
+	  case 96: // '`'
+	    if (this.options.ecmaVersion < 6) { break }
+	    ++this.pos;
+	    return this.finishToken(types$2.backQuote)
+
+	  case 48: // '0'
+	    var next = this.input.charCodeAt(this.pos + 1);
+	    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number
+	    if (this.options.ecmaVersion >= 6) {
+	      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number
+	      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number
+	    }
+
+	  // Anything else beginning with a digit is an integer, octal
+	  // number, or float.
+	  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
+	    return this.readNumber(false)
+
+	  // Quotes produce strings.
+	  case 34: case 39: // '"', "'"
+	    return this.readString(code)
+
+	  // Operators are parsed inline in tiny state machines. '=' (61) is
+	  // often referred to. `finishOp` simply skips the amount of
+	  // characters it is given as second argument, and returns a token
+	  // of the type given by its first argument.
+
+	  case 47: // '/'
+	    return this.readToken_slash()
+
+	  case 37: case 42: // '%*'
+	    return this.readToken_mult_modulo_exp(code)
+
+	  case 124: case 38: // '|&'
+	    return this.readToken_pipe_amp(code)
+
+	  case 94: // '^'
+	    return this.readToken_caret()
+
+	  case 43: case 45: // '+-'
+	    return this.readToken_plus_min(code)
+
+	  case 60: case 62: // '<>'
+	    return this.readToken_lt_gt(code)
+
+	  case 61: case 33: // '=!'
+	    return this.readToken_eq_excl(code)
+
+	  case 126: // '~'
+	    return this.finishOp(types$2.prefix, 1)
+	  }
+
+	  this.raise(this.pos, "Unexpected character '" + codePointToString$1(code) + "'");
+	};
+
+	pp$9.finishOp = function(type, size) {
+	  var str = this.input.slice(this.pos, this.pos + size);
+	  this.pos += size;
+	  return this.finishToken(type, str)
+	};
+
+	pp$9.readRegexp = function() {
+	  var escaped, inClass, start = this.pos;
+	  for (;;) {
+	    if (this.pos >= this.input.length) { this.raise(start, "Unterminated regular expression"); }
+	    var ch = this.input.charAt(this.pos);
+	    if (lineBreak.test(ch)) { this.raise(start, "Unterminated regular expression"); }
+	    if (!escaped) {
+	      if (ch === "[") { inClass = true; }
+	      else if (ch === "]" && inClass) { inClass = false; }
+	      else if (ch === "/" && !inClass) { break }
+	      escaped = ch === "\\";
+	    } else { escaped = false; }
+	    ++this.pos;
+	  }
+	  var pattern = this.input.slice(start, this.pos);
+	  ++this.pos;
+	  var flagsStart = this.pos;
+	  var flags = this.readWord1();
+	  if (this.containsEsc) { this.unexpected(flagsStart); }
+
+	  // Validate pattern
+	  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));
+	  state.reset(start, pattern, flags);
+	  this.validateRegExpFlags(state);
+	  this.validateRegExpPattern(state);
+
+	  // Create Literal#value property value.
+	  var value = null;
+	  try {
+	    value = new RegExp(pattern, flags);
+	  } catch (e) {
+	    // ESTree requires null if it failed to instantiate RegExp object.
+	    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+	  }
+
+	  return this.finishToken(types$2.regexp, {pattern: pattern, flags: flags, value: value})
+	};
+
+	// Read an integer in the given radix. Return null if zero digits
+	// were read, the integer value otherwise. When `len` is given, this
+	// will return `null` unless the integer has exactly `len` digits.
+
+	pp$9.readInt = function(radix, len) {
+	  var start = this.pos, total = 0;
+	  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {
+	    var code = this.input.charCodeAt(this.pos), val = (void 0);
+	    if (code >= 97) { val = code - 97 + 10; } // a
+	    else if (code >= 65) { val = code - 65 + 10; } // A
+	    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9
+	    else { val = Infinity; }
+	    if (val >= radix) { break }
+	    ++this.pos;
+	    total = total * radix + val;
+	  }
+	  if (this.pos === start || len != null && this.pos - start !== len) { return null }
+
+	  return total
+	};
+
+	pp$9.readRadixNumber = function(radix) {
+	  var start = this.pos;
+	  this.pos += 2; // 0x
+	  var val = this.readInt(radix);
+	  if (val == null) { this.raise(this.start + 2, "Expected number in radix " + radix); }
+	  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {
+	    val = typeof BigInt !== "undefined" ? BigInt(this.input.slice(start, this.pos)) : null;
+	    ++this.pos;
+	  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+	  return this.finishToken(types$2.num, val)
+	};
+
+	// Read an integer, octal integer, or floating-point number.
+
+	pp$9.readNumber = function(startsWithDot) {
+	  var start = this.pos;
+	  if (!startsWithDot && this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+	  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;
+	  if (octal && this.strict) { this.raise(start, "Invalid number"); }
+	  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }
+	  var next = this.input.charCodeAt(this.pos);
+	  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {
+	    var str$1 = this.input.slice(start, this.pos);
+	    var val$1 = typeof BigInt !== "undefined" ? BigInt(str$1) : null;
+	    ++this.pos;
+	    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+	    return this.finishToken(types$2.num, val$1)
+	  }
+	  if (next === 46 && !octal) { // '.'
+	    ++this.pos;
+	    this.readInt(10);
+	    next = this.input.charCodeAt(this.pos);
+	  }
+	  if ((next === 69 || next === 101) && !octal) { // 'eE'
+	    next = this.input.charCodeAt(++this.pos);
+	    if (next === 43 || next === 45) { ++this.pos; } // '+-'
+	    if (this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+	  }
+	  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+
+	  var str = this.input.slice(start, this.pos);
+	  var val = octal ? parseInt(str, 8) : parseFloat(str);
+	  return this.finishToken(types$2.num, val)
+	};
+
+	// Read a string value, interpreting backslash-escapes.
+
+	pp$9.readCodePoint = function() {
+	  var ch = this.input.charCodeAt(this.pos), code;
+
+	  if (ch === 123) { // '{'
+	    if (this.options.ecmaVersion < 6) { this.unexpected(); }
+	    var codePos = ++this.pos;
+	    code = this.readHexChar(this.input.indexOf("}", this.pos) - this.pos);
+	    ++this.pos;
+	    if (code > 0x10FFFF) { this.invalidStringToken(codePos, "Code point out of bounds"); }
+	  } else {
+	    code = this.readHexChar(4);
+	  }
+	  return code
+	};
+
+	function codePointToString$1(code) {
+	  // UTF-16 Decoding
+	  if (code <= 0xFFFF) { return String.fromCharCode(code) }
+	  code -= 0x10000;
+	  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
+	}
+
+	pp$9.readString = function(quote) {
+	  var out = "", chunkStart = ++this.pos;
+	  for (;;) {
+	    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated string constant"); }
+	    var ch = this.input.charCodeAt(this.pos);
+	    if (ch === quote) { break }
+	    if (ch === 92) { // '\'
+	      out += this.input.slice(chunkStart, this.pos);
+	      out += this.readEscapedChar(false);
+	      chunkStart = this.pos;
+	    } else {
+	      if (isNewLine(ch, this.options.ecmaVersion >= 10)) { this.raise(this.start, "Unterminated string constant"); }
+	      ++this.pos;
+	    }
+	  }
+	  out += this.input.slice(chunkStart, this.pos++);
+	  return this.finishToken(types$2.string, out)
+	};
+
+	// Reads template string tokens.
+
+	var INVALID_TEMPLATE_ESCAPE_ERROR = {};
+
+	pp$9.tryReadTemplateToken = function() {
+	  this.inTemplateElement = true;
+	  try {
+	    this.readTmplToken();
+	  } catch (err) {
+	    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {
+	      this.readInvalidTemplateToken();
+	    } else {
+	      throw err
+	    }
+	  }
+
+	  this.inTemplateElement = false;
+	};
+
+	pp$9.invalidStringToken = function(position, message) {
+	  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {
+	    throw INVALID_TEMPLATE_ESCAPE_ERROR
+	  } else {
+	    this.raise(position, message);
+	  }
+	};
+
+	pp$9.readTmplToken = function() {
+	  var out = "", chunkStart = this.pos;
+	  for (;;) {
+	    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated template"); }
+	    var ch = this.input.charCodeAt(this.pos);
+	    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
+	      if (this.pos === this.start && (this.type === types$2.template || this.type === types$2.invalidTemplate)) {
+	        if (ch === 36) {
+	          this.pos += 2;
+	          return this.finishToken(types$2.dollarBraceL)
+	        } else {
+	          ++this.pos;
+	          return this.finishToken(types$2.backQuote)
+	        }
+	      }
+	      out += this.input.slice(chunkStart, this.pos);
+	      return this.finishToken(types$2.template, out)
+	    }
+	    if (ch === 92) { // '\'
+	      out += this.input.slice(chunkStart, this.pos);
+	      out += this.readEscapedChar(true);
+	      chunkStart = this.pos;
+	    } else if (isNewLine(ch)) {
+	      out += this.input.slice(chunkStart, this.pos);
+	      ++this.pos;
+	      switch (ch) {
+	      case 13:
+	        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }
+	      case 10:
+	        out += "\n";
+	        break
+	      default:
+	        out += String.fromCharCode(ch);
+	        break
+	      }
+	      if (this.options.locations) {
+	        ++this.curLine;
+	        this.lineStart = this.pos;
+	      }
+	      chunkStart = this.pos;
+	    } else {
+	      ++this.pos;
+	    }
+	  }
+	};
+
+	// Reads a template token to search for the end, without validating any escape sequences
+	pp$9.readInvalidTemplateToken = function() {
+	  for (; this.pos < this.input.length; this.pos++) {
+	    switch (this.input[this.pos]) {
+	    case "\\":
+	      ++this.pos;
+	      break
+
+	    case "$":
+	      if (this.input[this.pos + 1] !== "{") {
+	        break
+	      }
+	    // falls through
+
+	    case "`":
+	      return this.finishToken(types$2.invalidTemplate, this.input.slice(this.start, this.pos))
+
+	    // no default
+	    }
+	  }
+	  this.raise(this.start, "Unterminated template");
+	};
+
+	// Used to read escaped characters
+
+	pp$9.readEscapedChar = function(inTemplate) {
+	  var ch = this.input.charCodeAt(++this.pos);
+	  ++this.pos;
+	  switch (ch) {
+	  case 110: return "\n" // 'n' -> '\n'
+	  case 114: return "\r" // 'r' -> '\r'
+	  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'
+	  case 117: return codePointToString$1(this.readCodePoint()) // 'u'
+	  case 116: return "\t" // 't' -> '\t'
+	  case 98: return "\b" // 'b' -> '\b'
+	  case 118: return "\u000b" // 'v' -> '\u000b'
+	  case 102: return "\f" // 'f' -> '\f'
+	  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\r\n'
+	  case 10: // ' \n'
+	    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }
+	    return ""
+	  default:
+	    if (ch >= 48 && ch <= 55) {
+	      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+	      var octal = parseInt(octalStr, 8);
+	      if (octal > 255) {
+	        octalStr = octalStr.slice(0, -1);
+	        octal = parseInt(octalStr, 8);
+	      }
+	      this.pos += octalStr.length - 1;
+	      ch = this.input.charCodeAt(this.pos);
+	      if ((octalStr !== "0" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {
+	        this.invalidStringToken(
+	          this.pos - 1 - octalStr.length,
+	          inTemplate
+	            ? "Octal literal in template string"
+	            : "Octal literal in strict mode"
+	        );
+	      }
+	      return String.fromCharCode(octal)
+	    }
+	    if (isNewLine(ch)) {
+	      // Unicode new line characters after \ get removed from output in both
+	      // template literals and strings
+	      return ""
+	    }
+	    return String.fromCharCode(ch)
+	  }
+	};
+
+	// Used to read character escape sequences ('\x', '\u', '\U').
+
+	pp$9.readHexChar = function(len) {
+	  var codePos = this.pos;
+	  var n = this.readInt(16, len);
+	  if (n === null) { this.invalidStringToken(codePos, "Bad character escape sequence"); }
+	  return n
+	};
+
+	// Read an identifier, and return it as a string. Sets `this.containsEsc`
+	// to whether the word contained a '\u' escape.
+	//
+	// Incrementally adds only escaped chars, adding other chunks as-is
+	// as a micro-optimization.
+
+	pp$9.readWord1 = function() {
+	  this.containsEsc = false;
+	  var word = "", first = true, chunkStart = this.pos;
+	  var astral = this.options.ecmaVersion >= 6;
+	  while (this.pos < this.input.length) {
+	    var ch = this.fullCharCodeAtPos();
+	    if (isIdentifierChar(ch, astral)) {
+	      this.pos += ch <= 0xffff ? 1 : 2;
+	    } else if (ch === 92) { // "\"
+	      this.containsEsc = true;
+	      word += this.input.slice(chunkStart, this.pos);
+	      var escStart = this.pos;
+	      if (this.input.charCodeAt(++this.pos) !== 117) // "u"
+	        { this.invalidStringToken(this.pos, "Expecting Unicode escape sequence \\uXXXX"); }
+	      ++this.pos;
+	      var esc = this.readCodePoint();
+	      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
+	        { this.invalidStringToken(escStart, "Invalid Unicode escape"); }
+	      word += codePointToString$1(esc);
+	      chunkStart = this.pos;
+	    } else {
+	      break
+	    }
+	    first = false;
+	  }
+	  return word + this.input.slice(chunkStart, this.pos)
+	};
+
+	// Read an identifier or keyword token. Will check for reserved
+	// words when necessary.
+
+	pp$9.readWord = function() {
+	  var word = this.readWord1();
+	  var type = types$2.name;
+	  if (this.keywords.test(word)) {
+	    if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword " + word); }
+	    type = keywords$1[word];
+	  }
+	  return this.finishToken(type, word)
+	};
+
+	/**
+	 * Parse a js source to generate the AST
+	 * @param   {string} source - javascript source
+	 * @param   {Object} options - parser options
+	 * @returns {AST} AST tree
+	 */
+	function generateAST(source, options) {
+	  return main_2$1(source, {
+	    parser: {
+	      parse(source, opts) {
+	        return Parser.parse(source, {
+	          ...opts,
+	          ecmaVersion: 2020
+	        })
+	      }
+	    },
+	    ...options
+	  })
+	}
+
+	var builtin = {
+		"Array": false,
+		"ArrayBuffer": false,
+		Atomics: false,
+		BigInt: false,
+		BigInt64Array: false,
+		BigUint64Array: false,
+		"Boolean": false,
+		constructor: false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		globalThis: false,
+		hasOwnProperty: false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		isPrototypeOf: false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		propertyIsEnumerable: false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		SharedArrayBuffer: false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		toLocaleString: false,
+		toString: false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		valueOf: false,
+		"WeakMap": false,
+		"WeakSet": false
+	};
+	var es5 = {
+		"Array": false,
+		"Boolean": false,
+		constructor: false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Function": false,
+		hasOwnProperty: false,
+		"Infinity": false,
+		"isFinite": false,
+		"isNaN": false,
+		isPrototypeOf: false,
+		"JSON": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		propertyIsEnumerable: false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"RegExp": false,
+		"String": false,
+		"SyntaxError": false,
+		toLocaleString: false,
+		toString: false,
+		"TypeError": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		valueOf: false
+	};
+	var es2015 = {
+		"Array": false,
+		"ArrayBuffer": false,
+		"Boolean": false,
+		constructor: false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		hasOwnProperty: false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		isPrototypeOf: false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		propertyIsEnumerable: false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		toLocaleString: false,
+		toString: false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		valueOf: false,
+		"WeakMap": false,
+		"WeakSet": false
+	};
+	var es2017 = {
+		"Array": false,
+		"ArrayBuffer": false,
+		Atomics: false,
+		"Boolean": false,
+		constructor: false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		hasOwnProperty: false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		isPrototypeOf: false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		propertyIsEnumerable: false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		SharedArrayBuffer: false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		toLocaleString: false,
+		toString: false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		valueOf: false,
+		"WeakMap": false,
+		"WeakSet": false
+	};
+	var browser = {
+		AbortController: false,
+		AbortSignal: false,
+		addEventListener: false,
+		alert: false,
+		AnalyserNode: false,
+		Animation: false,
+		AnimationEffectReadOnly: false,
+		AnimationEffectTiming: false,
+		AnimationEffectTimingReadOnly: false,
+		AnimationEvent: false,
+		AnimationPlaybackEvent: false,
+		AnimationTimeline: false,
+		applicationCache: false,
+		ApplicationCache: false,
+		ApplicationCacheErrorEvent: false,
+		atob: false,
+		Attr: false,
+		Audio: false,
+		AudioBuffer: false,
+		AudioBufferSourceNode: false,
+		AudioContext: false,
+		AudioDestinationNode: false,
+		AudioListener: false,
+		AudioNode: false,
+		AudioParam: false,
+		AudioProcessingEvent: false,
+		AudioScheduledSourceNode: false,
+		"AudioWorkletGlobalScope ": false,
+		AudioWorkletNode: false,
+		AudioWorkletProcessor: false,
+		BarProp: false,
+		BaseAudioContext: false,
+		BatteryManager: false,
+		BeforeUnloadEvent: false,
+		BiquadFilterNode: false,
+		Blob: false,
+		BlobEvent: false,
+		blur: false,
+		BroadcastChannel: false,
+		btoa: false,
+		BudgetService: false,
+		ByteLengthQueuingStrategy: false,
+		Cache: false,
+		caches: false,
+		CacheStorage: false,
+		cancelAnimationFrame: false,
+		cancelIdleCallback: false,
+		CanvasCaptureMediaStreamTrack: false,
+		CanvasGradient: false,
+		CanvasPattern: false,
+		CanvasRenderingContext2D: false,
+		ChannelMergerNode: false,
+		ChannelSplitterNode: false,
+		CharacterData: false,
+		clearInterval: false,
+		clearTimeout: false,
+		clientInformation: false,
+		ClipboardEvent: false,
+		close: false,
+		closed: false,
+		CloseEvent: false,
+		Comment: false,
+		CompositionEvent: false,
+		confirm: false,
+		console: false,
+		ConstantSourceNode: false,
+		ConvolverNode: false,
+		CountQueuingStrategy: false,
+		createImageBitmap: false,
+		Credential: false,
+		CredentialsContainer: false,
+		crypto: false,
+		Crypto: false,
+		CryptoKey: false,
+		CSS: false,
+		CSSConditionRule: false,
+		CSSFontFaceRule: false,
+		CSSGroupingRule: false,
+		CSSImportRule: false,
+		CSSKeyframeRule: false,
+		CSSKeyframesRule: false,
+		CSSMediaRule: false,
+		CSSNamespaceRule: false,
+		CSSPageRule: false,
+		CSSRule: false,
+		CSSRuleList: false,
+		CSSStyleDeclaration: false,
+		CSSStyleRule: false,
+		CSSStyleSheet: false,
+		CSSSupportsRule: false,
+		CustomElementRegistry: false,
+		customElements: false,
+		CustomEvent: false,
+		DataTransfer: false,
+		DataTransferItem: false,
+		DataTransferItemList: false,
+		defaultstatus: false,
+		defaultStatus: false,
+		DelayNode: false,
+		DeviceMotionEvent: false,
+		DeviceOrientationEvent: false,
+		devicePixelRatio: false,
+		dispatchEvent: false,
+		document: false,
+		Document: false,
+		DocumentFragment: false,
+		DocumentType: false,
+		DOMError: false,
+		DOMException: false,
+		DOMImplementation: false,
+		DOMMatrix: false,
+		DOMMatrixReadOnly: false,
+		DOMParser: false,
+		DOMPoint: false,
+		DOMPointReadOnly: false,
+		DOMQuad: false,
+		DOMRect: false,
+		DOMRectReadOnly: false,
+		DOMStringList: false,
+		DOMStringMap: false,
+		DOMTokenList: false,
+		DragEvent: false,
+		DynamicsCompressorNode: false,
+		Element: false,
+		ErrorEvent: false,
+		event: false,
+		Event: false,
+		EventSource: false,
+		EventTarget: false,
+		external: false,
+		fetch: false,
+		File: false,
+		FileList: false,
+		FileReader: false,
+		find: false,
+		focus: false,
+		FocusEvent: false,
+		FontFace: false,
+		FontFaceSetLoadEvent: false,
+		FormData: false,
+		frameElement: false,
+		frames: false,
+		GainNode: false,
+		Gamepad: false,
+		GamepadButton: false,
+		GamepadEvent: false,
+		getComputedStyle: false,
+		getSelection: false,
+		HashChangeEvent: false,
+		Headers: false,
+		history: false,
+		History: false,
+		HTMLAllCollection: false,
+		HTMLAnchorElement: false,
+		HTMLAreaElement: false,
+		HTMLAudioElement: false,
+		HTMLBaseElement: false,
+		HTMLBodyElement: false,
+		HTMLBRElement: false,
+		HTMLButtonElement: false,
+		HTMLCanvasElement: false,
+		HTMLCollection: false,
+		HTMLContentElement: false,
+		HTMLDataElement: false,
+		HTMLDataListElement: false,
+		HTMLDetailsElement: false,
+		HTMLDialogElement: false,
+		HTMLDirectoryElement: false,
+		HTMLDivElement: false,
+		HTMLDListElement: false,
+		HTMLDocument: false,
+		HTMLElement: false,
+		HTMLEmbedElement: false,
+		HTMLFieldSetElement: false,
+		HTMLFontElement: false,
+		HTMLFormControlsCollection: false,
+		HTMLFormElement: false,
+		HTMLFrameElement: false,
+		HTMLFrameSetElement: false,
+		HTMLHeadElement: false,
+		HTMLHeadingElement: false,
+		HTMLHRElement: false,
+		HTMLHtmlElement: false,
+		HTMLIFrameElement: false,
+		HTMLImageElement: false,
+		HTMLInputElement: false,
+		HTMLLabelElement: false,
+		HTMLLegendElement: false,
+		HTMLLIElement: false,
+		HTMLLinkElement: false,
+		HTMLMapElement: false,
+		HTMLMarqueeElement: false,
+		HTMLMediaElement: false,
+		HTMLMenuElement: false,
+		HTMLMetaElement: false,
+		HTMLMeterElement: false,
+		HTMLModElement: false,
+		HTMLObjectElement: false,
+		HTMLOListElement: false,
+		HTMLOptGroupElement: false,
+		HTMLOptionElement: false,
+		HTMLOptionsCollection: false,
+		HTMLOutputElement: false,
+		HTMLParagraphElement: false,
+		HTMLParamElement: false,
+		HTMLPictureElement: false,
+		HTMLPreElement: false,
+		HTMLProgressElement: false,
+		HTMLQuoteElement: false,
+		HTMLScriptElement: false,
+		HTMLSelectElement: false,
+		HTMLShadowElement: false,
+		HTMLSlotElement: false,
+		HTMLSourceElement: false,
+		HTMLSpanElement: false,
+		HTMLStyleElement: false,
+		HTMLTableCaptionElement: false,
+		HTMLTableCellElement: false,
+		HTMLTableColElement: false,
+		HTMLTableElement: false,
+		HTMLTableRowElement: false,
+		HTMLTableSectionElement: false,
+		HTMLTemplateElement: false,
+		HTMLTextAreaElement: false,
+		HTMLTimeElement: false,
+		HTMLTitleElement: false,
+		HTMLTrackElement: false,
+		HTMLUListElement: false,
+		HTMLUnknownElement: false,
+		HTMLVideoElement: false,
+		IDBCursor: false,
+		IDBCursorWithValue: false,
+		IDBDatabase: false,
+		IDBFactory: false,
+		IDBIndex: false,
+		IDBKeyRange: false,
+		IDBObjectStore: false,
+		IDBOpenDBRequest: false,
+		IDBRequest: false,
+		IDBTransaction: false,
+		IDBVersionChangeEvent: false,
+		IdleDeadline: false,
+		IIRFilterNode: false,
+		Image: false,
+		ImageBitmap: false,
+		ImageBitmapRenderingContext: false,
+		ImageCapture: false,
+		ImageData: false,
+		indexedDB: false,
+		innerHeight: false,
+		innerWidth: false,
+		InputEvent: false,
+		IntersectionObserver: false,
+		IntersectionObserverEntry: false,
+		"Intl": false,
+		isSecureContext: false,
+		KeyboardEvent: false,
+		KeyframeEffect: false,
+		KeyframeEffectReadOnly: false,
+		length: false,
+		localStorage: false,
+		location: true,
+		Location: false,
+		locationbar: false,
+		matchMedia: false,
+		MediaDeviceInfo: false,
+		MediaDevices: false,
+		MediaElementAudioSourceNode: false,
+		MediaEncryptedEvent: false,
+		MediaError: false,
+		MediaKeyMessageEvent: false,
+		MediaKeySession: false,
+		MediaKeyStatusMap: false,
+		MediaKeySystemAccess: false,
+		MediaList: false,
+		MediaQueryList: false,
+		MediaQueryListEvent: false,
+		MediaRecorder: false,
+		MediaSettingsRange: false,
+		MediaSource: false,
+		MediaStream: false,
+		MediaStreamAudioDestinationNode: false,
+		MediaStreamAudioSourceNode: false,
+		MediaStreamEvent: false,
+		MediaStreamTrack: false,
+		MediaStreamTrackEvent: false,
+		menubar: false,
+		MessageChannel: false,
+		MessageEvent: false,
+		MessagePort: false,
+		MIDIAccess: false,
+		MIDIConnectionEvent: false,
+		MIDIInput: false,
+		MIDIInputMap: false,
+		MIDIMessageEvent: false,
+		MIDIOutput: false,
+		MIDIOutputMap: false,
+		MIDIPort: false,
+		MimeType: false,
+		MimeTypeArray: false,
+		MouseEvent: false,
+		moveBy: false,
+		moveTo: false,
+		MutationEvent: false,
+		MutationObserver: false,
+		MutationRecord: false,
+		name: false,
+		NamedNodeMap: false,
+		NavigationPreloadManager: false,
+		navigator: false,
+		Navigator: false,
+		NetworkInformation: false,
+		Node: false,
+		NodeFilter: false,
+		NodeIterator: false,
+		NodeList: false,
+		Notification: false,
+		OfflineAudioCompletionEvent: false,
+		OfflineAudioContext: false,
+		offscreenBuffering: false,
+		OffscreenCanvas: true,
+		onabort: true,
+		onafterprint: true,
+		onanimationend: true,
+		onanimationiteration: true,
+		onanimationstart: true,
+		onappinstalled: true,
+		onauxclick: true,
+		onbeforeinstallprompt: true,
+		onbeforeprint: true,
+		onbeforeunload: true,
+		onblur: true,
+		oncancel: true,
+		oncanplay: true,
+		oncanplaythrough: true,
+		onchange: true,
+		onclick: true,
+		onclose: true,
+		oncontextmenu: true,
+		oncuechange: true,
+		ondblclick: true,
+		ondevicemotion: true,
+		ondeviceorientation: true,
+		ondeviceorientationabsolute: true,
+		ondrag: true,
+		ondragend: true,
+		ondragenter: true,
+		ondragleave: true,
+		ondragover: true,
+		ondragstart: true,
+		ondrop: true,
+		ondurationchange: true,
+		onemptied: true,
+		onended: true,
+		onerror: true,
+		onfocus: true,
+		ongotpointercapture: true,
+		onhashchange: true,
+		oninput: true,
+		oninvalid: true,
+		onkeydown: true,
+		onkeypress: true,
+		onkeyup: true,
+		onlanguagechange: true,
+		onload: true,
+		onloadeddata: true,
+		onloadedmetadata: true,
+		onloadstart: true,
+		onlostpointercapture: true,
+		onmessage: true,
+		onmessageerror: true,
+		onmousedown: true,
+		onmouseenter: true,
+		onmouseleave: true,
+		onmousemove: true,
+		onmouseout: true,
+		onmouseover: true,
+		onmouseup: true,
+		onmousewheel: true,
+		onoffline: true,
+		ononline: true,
+		onpagehide: true,
+		onpageshow: true,
+		onpause: true,
+		onplay: true,
+		onplaying: true,
+		onpointercancel: true,
+		onpointerdown: true,
+		onpointerenter: true,
+		onpointerleave: true,
+		onpointermove: true,
+		onpointerout: true,
+		onpointerover: true,
+		onpointerup: true,
+		onpopstate: true,
+		onprogress: true,
+		onratechange: true,
+		onrejectionhandled: true,
+		onreset: true,
+		onresize: true,
+		onscroll: true,
+		onsearch: true,
+		onseeked: true,
+		onseeking: true,
+		onselect: true,
+		onstalled: true,
+		onstorage: true,
+		onsubmit: true,
+		onsuspend: true,
+		ontimeupdate: true,
+		ontoggle: true,
+		ontransitionend: true,
+		onunhandledrejection: true,
+		onunload: true,
+		onvolumechange: true,
+		onwaiting: true,
+		onwheel: true,
+		open: false,
+		openDatabase: false,
+		opener: false,
+		Option: false,
+		origin: false,
+		OscillatorNode: false,
+		outerHeight: false,
+		outerWidth: false,
+		PageTransitionEvent: false,
+		pageXOffset: false,
+		pageYOffset: false,
+		PannerNode: false,
+		parent: false,
+		Path2D: false,
+		PaymentAddress: false,
+		PaymentRequest: false,
+		PaymentRequestUpdateEvent: false,
+		PaymentResponse: false,
+		performance: false,
+		Performance: false,
+		PerformanceEntry: false,
+		PerformanceLongTaskTiming: false,
+		PerformanceMark: false,
+		PerformanceMeasure: false,
+		PerformanceNavigation: false,
+		PerformanceNavigationTiming: false,
+		PerformanceObserver: false,
+		PerformanceObserverEntryList: false,
+		PerformancePaintTiming: false,
+		PerformanceResourceTiming: false,
+		PerformanceTiming: false,
+		PeriodicWave: false,
+		Permissions: false,
+		PermissionStatus: false,
+		personalbar: false,
+		PhotoCapabilities: false,
+		Plugin: false,
+		PluginArray: false,
+		PointerEvent: false,
+		PopStateEvent: false,
+		postMessage: false,
+		Presentation: false,
+		PresentationAvailability: false,
+		PresentationConnection: false,
+		PresentationConnectionAvailableEvent: false,
+		PresentationConnectionCloseEvent: false,
+		PresentationConnectionList: false,
+		PresentationReceiver: false,
+		PresentationRequest: false,
+		print: false,
+		ProcessingInstruction: false,
+		ProgressEvent: false,
+		PromiseRejectionEvent: false,
+		prompt: false,
+		PushManager: false,
+		PushSubscription: false,
+		PushSubscriptionOptions: false,
+		queueMicrotask: false,
+		RadioNodeList: false,
+		Range: false,
+		ReadableStream: false,
+		registerProcessor: false,
+		RemotePlayback: false,
+		removeEventListener: false,
+		Request: false,
+		requestAnimationFrame: false,
+		requestIdleCallback: false,
+		resizeBy: false,
+		ResizeObserver: false,
+		ResizeObserverEntry: false,
+		resizeTo: false,
+		Response: false,
+		RTCCertificate: false,
+		RTCDataChannel: false,
+		RTCDataChannelEvent: false,
+		RTCDtlsTransport: false,
+		RTCIceCandidate: false,
+		RTCIceGatherer: false,
+		RTCIceTransport: false,
+		RTCPeerConnection: false,
+		RTCPeerConnectionIceEvent: false,
+		RTCRtpContributingSource: false,
+		RTCRtpReceiver: false,
+		RTCRtpSender: false,
+		RTCSctpTransport: false,
+		RTCSessionDescription: false,
+		RTCStatsReport: false,
+		RTCTrackEvent: false,
+		screen: false,
+		Screen: false,
+		screenLeft: false,
+		ScreenOrientation: false,
+		screenTop: false,
+		screenX: false,
+		screenY: false,
+		ScriptProcessorNode: false,
+		scroll: false,
+		scrollbars: false,
+		scrollBy: false,
+		scrollTo: false,
+		scrollX: false,
+		scrollY: false,
+		SecurityPolicyViolationEvent: false,
+		Selection: false,
+		self: false,
+		ServiceWorker: false,
+		ServiceWorkerContainer: false,
+		ServiceWorkerRegistration: false,
+		sessionStorage: false,
+		setInterval: false,
+		setTimeout: false,
+		ShadowRoot: false,
+		SharedWorker: false,
+		SourceBuffer: false,
+		SourceBufferList: false,
+		speechSynthesis: false,
+		SpeechSynthesisEvent: false,
+		SpeechSynthesisUtterance: false,
+		StaticRange: false,
+		status: false,
+		statusbar: false,
+		StereoPannerNode: false,
+		stop: false,
+		Storage: false,
+		StorageEvent: false,
+		StorageManager: false,
+		styleMedia: false,
+		StyleSheet: false,
+		StyleSheetList: false,
+		SubtleCrypto: false,
+		SVGAElement: false,
+		SVGAngle: false,
+		SVGAnimatedAngle: false,
+		SVGAnimatedBoolean: false,
+		SVGAnimatedEnumeration: false,
+		SVGAnimatedInteger: false,
+		SVGAnimatedLength: false,
+		SVGAnimatedLengthList: false,
+		SVGAnimatedNumber: false,
+		SVGAnimatedNumberList: false,
+		SVGAnimatedPreserveAspectRatio: false,
+		SVGAnimatedRect: false,
+		SVGAnimatedString: false,
+		SVGAnimatedTransformList: false,
+		SVGAnimateElement: false,
+		SVGAnimateMotionElement: false,
+		SVGAnimateTransformElement: false,
+		SVGAnimationElement: false,
+		SVGCircleElement: false,
+		SVGClipPathElement: false,
+		SVGComponentTransferFunctionElement: false,
+		SVGDefsElement: false,
+		SVGDescElement: false,
+		SVGDiscardElement: false,
+		SVGElement: false,
+		SVGEllipseElement: false,
+		SVGFEBlendElement: false,
+		SVGFEColorMatrixElement: false,
+		SVGFEComponentTransferElement: false,
+		SVGFECompositeElement: false,
+		SVGFEConvolveMatrixElement: false,
+		SVGFEDiffuseLightingElement: false,
+		SVGFEDisplacementMapElement: false,
+		SVGFEDistantLightElement: false,
+		SVGFEDropShadowElement: false,
+		SVGFEFloodElement: false,
+		SVGFEFuncAElement: false,
+		SVGFEFuncBElement: false,
+		SVGFEFuncGElement: false,
+		SVGFEFuncRElement: false,
+		SVGFEGaussianBlurElement: false,
+		SVGFEImageElement: false,
+		SVGFEMergeElement: false,
+		SVGFEMergeNodeElement: false,
+		SVGFEMorphologyElement: false,
+		SVGFEOffsetElement: false,
+		SVGFEPointLightElement: false,
+		SVGFESpecularLightingElement: false,
+		SVGFESpotLightElement: false,
+		SVGFETileElement: false,
+		SVGFETurbulenceElement: false,
+		SVGFilterElement: false,
+		SVGForeignObjectElement: false,
+		SVGGElement: false,
+		SVGGeometryElement: false,
+		SVGGradientElement: false,
+		SVGGraphicsElement: false,
+		SVGImageElement: false,
+		SVGLength: false,
+		SVGLengthList: false,
+		SVGLinearGradientElement: false,
+		SVGLineElement: false,
+		SVGMarkerElement: false,
+		SVGMaskElement: false,
+		SVGMatrix: false,
+		SVGMetadataElement: false,
+		SVGMPathElement: false,
+		SVGNumber: false,
+		SVGNumberList: false,
+		SVGPathElement: false,
+		SVGPatternElement: false,
+		SVGPoint: false,
+		SVGPointList: false,
+		SVGPolygonElement: false,
+		SVGPolylineElement: false,
+		SVGPreserveAspectRatio: false,
+		SVGRadialGradientElement: false,
+		SVGRect: false,
+		SVGRectElement: false,
+		SVGScriptElement: false,
+		SVGSetElement: false,
+		SVGStopElement: false,
+		SVGStringList: false,
+		SVGStyleElement: false,
+		SVGSVGElement: false,
+		SVGSwitchElement: false,
+		SVGSymbolElement: false,
+		SVGTextContentElement: false,
+		SVGTextElement: false,
+		SVGTextPathElement: false,
+		SVGTextPositioningElement: false,
+		SVGTitleElement: false,
+		SVGTransform: false,
+		SVGTransformList: false,
+		SVGTSpanElement: false,
+		SVGUnitTypes: false,
+		SVGUseElement: false,
+		SVGViewElement: false,
+		TaskAttributionTiming: false,
+		Text: false,
+		TextDecoder: false,
+		TextEncoder: false,
+		TextEvent: false,
+		TextMetrics: false,
+		TextTrack: false,
+		TextTrackCue: false,
+		TextTrackCueList: false,
+		TextTrackList: false,
+		TimeRanges: false,
+		toolbar: false,
+		top: false,
+		Touch: false,
+		TouchEvent: false,
+		TouchList: false,
+		TrackEvent: false,
+		TransitionEvent: false,
+		TreeWalker: false,
+		UIEvent: false,
+		URL: false,
+		URLSearchParams: false,
+		ValidityState: false,
+		visualViewport: false,
+		VisualViewport: false,
+		VTTCue: false,
+		WaveShaperNode: false,
+		WebAssembly: false,
+		WebGL2RenderingContext: false,
+		WebGLActiveInfo: false,
+		WebGLBuffer: false,
+		WebGLContextEvent: false,
+		WebGLFramebuffer: false,
+		WebGLProgram: false,
+		WebGLQuery: false,
+		WebGLRenderbuffer: false,
+		WebGLRenderingContext: false,
+		WebGLSampler: false,
+		WebGLShader: false,
+		WebGLShaderPrecisionFormat: false,
+		WebGLSync: false,
+		WebGLTexture: false,
+		WebGLTransformFeedback: false,
+		WebGLUniformLocation: false,
+		WebGLVertexArrayObject: false,
+		WebSocket: false,
+		WheelEvent: false,
+		window: false,
+		Window: false,
+		Worker: false,
+		WritableStream: false,
+		XMLDocument: false,
+		XMLHttpRequest: false,
+		XMLHttpRequestEventTarget: false,
+		XMLHttpRequestUpload: false,
+		XMLSerializer: false,
+		XPathEvaluator: false,
+		XPathExpression: false,
+		XPathResult: false,
+		XSLTProcessor: false
+	};
+	var worker = {
+		addEventListener: false,
+		applicationCache: false,
+		atob: false,
+		Blob: false,
+		BroadcastChannel: false,
+		btoa: false,
+		Cache: false,
+		caches: false,
+		clearInterval: false,
+		clearTimeout: false,
+		close: true,
+		console: false,
+		fetch: false,
+		FileReaderSync: false,
+		FormData: false,
+		Headers: false,
+		IDBCursor: false,
+		IDBCursorWithValue: false,
+		IDBDatabase: false,
+		IDBFactory: false,
+		IDBIndex: false,
+		IDBKeyRange: false,
+		IDBObjectStore: false,
+		IDBOpenDBRequest: false,
+		IDBRequest: false,
+		IDBTransaction: false,
+		IDBVersionChangeEvent: false,
+		ImageData: false,
+		importScripts: true,
+		indexedDB: false,
+		location: false,
+		MessageChannel: false,
+		MessagePort: false,
+		name: false,
+		navigator: false,
+		Notification: false,
+		onclose: true,
+		onconnect: true,
+		onerror: true,
+		onlanguagechange: true,
+		onmessage: true,
+		onoffline: true,
+		ononline: true,
+		onrejectionhandled: true,
+		onunhandledrejection: true,
+		performance: false,
+		Performance: false,
+		PerformanceEntry: false,
+		PerformanceMark: false,
+		PerformanceMeasure: false,
+		PerformanceNavigation: false,
+		PerformanceResourceTiming: false,
+		PerformanceTiming: false,
+		postMessage: true,
+		"Promise": false,
+		queueMicrotask: false,
+		removeEventListener: false,
+		Request: false,
+		Response: false,
+		self: true,
+		ServiceWorkerRegistration: false,
+		setInterval: false,
+		setTimeout: false,
+		TextDecoder: false,
+		TextEncoder: false,
+		URL: false,
+		URLSearchParams: false,
+		WebSocket: false,
+		Worker: false,
+		WorkerGlobalScope: false,
+		XMLHttpRequest: false
+	};
+	var node = {
+		__dirname: false,
+		__filename: false,
+		Buffer: false,
+		clearImmediate: false,
+		clearInterval: false,
+		clearTimeout: false,
+		console: false,
+		exports: true,
+		global: false,
+		"Intl": false,
+		module: false,
+		process: false,
+		queueMicrotask: false,
+		require: false,
+		setImmediate: false,
+		setInterval: false,
+		setTimeout: false,
+		TextDecoder: false,
+		TextEncoder: false,
+		URL: false,
+		URLSearchParams: false
+	};
+	var commonjs = {
+		exports: true,
+		global: false,
+		module: false,
+		require: false
+	};
+	var amd = {
+		define: false,
+		require: false
+	};
+	var mocha = {
+		after: false,
+		afterEach: false,
+		before: false,
+		beforeEach: false,
+		context: false,
+		describe: false,
+		it: false,
+		mocha: false,
+		run: false,
+		setup: false,
+		specify: false,
+		suite: false,
+		suiteSetup: false,
+		suiteTeardown: false,
+		teardown: false,
+		test: false,
+		xcontext: false,
+		xdescribe: false,
+		xit: false,
+		xspecify: false
+	};
+	var jasmine = {
+		afterAll: false,
+		afterEach: false,
+		beforeAll: false,
+		beforeEach: false,
+		describe: false,
+		expect: false,
+		fail: false,
+		fdescribe: false,
+		fit: false,
+		it: false,
+		jasmine: false,
+		pending: false,
+		runs: false,
+		spyOn: false,
+		spyOnProperty: false,
+		waits: false,
+		waitsFor: false,
+		xdescribe: false,
+		xit: false
+	};
+	var jest = {
+		afterAll: false,
+		afterEach: false,
+		beforeAll: false,
+		beforeEach: false,
+		describe: false,
+		expect: false,
+		fdescribe: false,
+		fit: false,
+		it: false,
+		jest: false,
+		pit: false,
+		require: false,
+		test: false,
+		xdescribe: false,
+		xit: false,
+		xtest: false
+	};
+	var qunit = {
+		asyncTest: false,
+		deepEqual: false,
+		equal: false,
+		expect: false,
+		module: false,
+		notDeepEqual: false,
+		notEqual: false,
+		notOk: false,
+		notPropEqual: false,
+		notStrictEqual: false,
+		ok: false,
+		propEqual: false,
+		QUnit: false,
+		raises: false,
+		start: false,
+		stop: false,
+		strictEqual: false,
+		test: false,
+		throws: false
+	};
+	var phantomjs = {
+		console: true,
+		exports: true,
+		phantom: true,
+		require: true,
+		WebPage: true
+	};
+	var couch = {
+		emit: false,
+		exports: false,
+		getRow: false,
+		log: false,
+		module: false,
+		provides: false,
+		require: false,
+		respond: false,
+		send: false,
+		start: false,
+		sum: false
+	};
+	var rhino = {
+		defineClass: false,
+		deserialize: false,
+		gc: false,
+		help: false,
+		importClass: false,
+		importPackage: false,
+		java: false,
+		load: false,
+		loadClass: false,
+		Packages: false,
+		print: false,
+		quit: false,
+		readFile: false,
+		readUrl: false,
+		runCommand: false,
+		seal: false,
+		serialize: false,
+		spawn: false,
+		sync: false,
+		toint32: false,
+		version: false
+	};
+	var nashorn = {
+		__DIR__: false,
+		__FILE__: false,
+		__LINE__: false,
+		com: false,
+		edu: false,
+		exit: false,
+		java: false,
+		Java: false,
+		javafx: false,
+		JavaImporter: false,
+		javax: false,
+		JSAdapter: false,
+		load: false,
+		loadWithNewGlobal: false,
+		org: false,
+		Packages: false,
+		print: false,
+		quit: false
+	};
+	var wsh = {
+		ActiveXObject: true,
+		Enumerator: true,
+		GetObject: true,
+		ScriptEngine: true,
+		ScriptEngineBuildVersion: true,
+		ScriptEngineMajorVersion: true,
+		ScriptEngineMinorVersion: true,
+		VBArray: true,
+		WScript: true,
+		WSH: true,
+		XDomainRequest: true
+	};
+	var jquery = {
+		$: false,
+		jQuery: false
+	};
+	var yui = {
+		YAHOO: false,
+		YAHOO_config: false,
+		YUI: false,
+		YUI_config: false
+	};
+	var shelljs = {
+		cat: false,
+		cd: false,
+		chmod: false,
+		config: false,
+		cp: false,
+		dirs: false,
+		echo: false,
+		env: false,
+		error: false,
+		exec: false,
+		exit: false,
+		find: false,
+		grep: false,
+		ln: false,
+		ls: false,
+		mkdir: false,
+		mv: false,
+		popd: false,
+		pushd: false,
+		pwd: false,
+		rm: false,
+		sed: false,
+		set: false,
+		target: false,
+		tempdir: false,
+		test: false,
+		touch: false,
+		which: false
+	};
+	var prototypejs = {
+		$: false,
+		$$: false,
+		$A: false,
+		$break: false,
+		$continue: false,
+		$F: false,
+		$H: false,
+		$R: false,
+		$w: false,
+		Abstract: false,
+		Ajax: false,
+		Autocompleter: false,
+		Builder: false,
+		Class: false,
+		Control: false,
+		Draggable: false,
+		Draggables: false,
+		Droppables: false,
+		Effect: false,
+		Element: false,
+		Enumerable: false,
+		Event: false,
+		Field: false,
+		Form: false,
+		Hash: false,
+		Insertion: false,
+		ObjectRange: false,
+		PeriodicalExecuter: false,
+		Position: false,
+		Prototype: false,
+		Scriptaculous: false,
+		Selector: false,
+		Sortable: false,
+		SortableObserver: false,
+		Sound: false,
+		Template: false,
+		Toggle: false,
+		Try: false
+	};
+	var meteor = {
+		_: false,
+		$: false,
+		Accounts: false,
+		AccountsClient: false,
+		AccountsCommon: false,
+		AccountsServer: false,
+		App: false,
+		Assets: false,
+		Blaze: false,
+		check: false,
+		Cordova: false,
+		DDP: false,
+		DDPRateLimiter: false,
+		DDPServer: false,
+		Deps: false,
+		EJSON: false,
+		Email: false,
+		HTTP: false,
+		Log: false,
+		Match: false,
+		Meteor: false,
+		Mongo: false,
+		MongoInternals: false,
+		Npm: false,
+		Package: false,
+		Plugin: false,
+		process: false,
+		Random: false,
+		ReactiveDict: false,
+		ReactiveVar: false,
+		Router: false,
+		ServiceConfiguration: false,
+		Session: false,
+		share: false,
+		Spacebars: false,
+		Template: false,
+		Tinytest: false,
+		Tracker: false,
+		UI: false,
+		Utils: false,
+		WebApp: false,
+		WebAppInternals: false
+	};
+	var mongo = {
+		_isWindows: false,
+		_rand: false,
+		BulkWriteResult: false,
+		cat: false,
+		cd: false,
+		connect: false,
+		db: false,
+		getHostName: false,
+		getMemInfo: false,
+		hostname: false,
+		ISODate: false,
+		listFiles: false,
+		load: false,
+		ls: false,
+		md5sumFile: false,
+		mkdir: false,
+		Mongo: false,
+		NumberInt: false,
+		NumberLong: false,
+		ObjectId: false,
+		PlanCache: false,
+		print: false,
+		printjson: false,
+		pwd: false,
+		quit: false,
+		removeFile: false,
+		rs: false,
+		sh: false,
+		UUID: false,
+		version: false,
+		WriteResult: false
+	};
+	var applescript = {
+		$: false,
+		Application: false,
+		Automation: false,
+		console: false,
+		delay: false,
+		Library: false,
+		ObjC: false,
+		ObjectSpecifier: false,
+		Path: false,
+		Progress: false,
+		Ref: false
+	};
+	var serviceworker = {
+		addEventListener: false,
+		applicationCache: false,
+		atob: false,
+		Blob: false,
+		BroadcastChannel: false,
+		btoa: false,
+		Cache: false,
+		caches: false,
+		CacheStorage: false,
+		clearInterval: false,
+		clearTimeout: false,
+		Client: false,
+		clients: false,
+		Clients: false,
+		close: true,
+		console: false,
+		ExtendableEvent: false,
+		ExtendableMessageEvent: false,
+		fetch: false,
+		FetchEvent: false,
+		FileReaderSync: false,
+		FormData: false,
+		Headers: false,
+		IDBCursor: false,
+		IDBCursorWithValue: false,
+		IDBDatabase: false,
+		IDBFactory: false,
+		IDBIndex: false,
+		IDBKeyRange: false,
+		IDBObjectStore: false,
+		IDBOpenDBRequest: false,
+		IDBRequest: false,
+		IDBTransaction: false,
+		IDBVersionChangeEvent: false,
+		ImageData: false,
+		importScripts: false,
+		indexedDB: false,
+		location: false,
+		MessageChannel: false,
+		MessagePort: false,
+		name: false,
+		navigator: false,
+		Notification: false,
+		onclose: true,
+		onconnect: true,
+		onerror: true,
+		onfetch: true,
+		oninstall: true,
+		onlanguagechange: true,
+		onmessage: true,
+		onmessageerror: true,
+		onnotificationclick: true,
+		onnotificationclose: true,
+		onoffline: true,
+		ononline: true,
+		onpush: true,
+		onpushsubscriptionchange: true,
+		onrejectionhandled: true,
+		onsync: true,
+		onunhandledrejection: true,
+		performance: false,
+		Performance: false,
+		PerformanceEntry: false,
+		PerformanceMark: false,
+		PerformanceMeasure: false,
+		PerformanceNavigation: false,
+		PerformanceResourceTiming: false,
+		PerformanceTiming: false,
+		postMessage: true,
+		"Promise": false,
+		queueMicrotask: false,
+		registration: false,
+		removeEventListener: false,
+		Request: false,
+		Response: false,
+		self: false,
+		ServiceWorker: false,
+		ServiceWorkerContainer: false,
+		ServiceWorkerGlobalScope: false,
+		ServiceWorkerMessageEvent: false,
+		ServiceWorkerRegistration: false,
+		setInterval: false,
+		setTimeout: false,
+		skipWaiting: false,
+		TextDecoder: false,
+		TextEncoder: false,
+		URL: false,
+		URLSearchParams: false,
+		WebSocket: false,
+		WindowClient: false,
+		Worker: false,
+		WorkerGlobalScope: false,
+		XMLHttpRequest: false
+	};
+	var atomtest = {
+		advanceClock: false,
+		fakeClearInterval: false,
+		fakeClearTimeout: false,
+		fakeSetInterval: false,
+		fakeSetTimeout: false,
+		resetTimeouts: false,
+		waitsForPromise: false
+	};
+	var embertest = {
+		andThen: false,
+		click: false,
+		currentPath: false,
+		currentRouteName: false,
+		currentURL: false,
+		fillIn: false,
+		find: false,
+		findAll: false,
+		findWithAssert: false,
+		keyEvent: false,
+		pauseTest: false,
+		resumeTest: false,
+		triggerEvent: false,
+		visit: false,
+		wait: false
+	};
+	var protractor = {
+		$: false,
+		$$: false,
+		browser: false,
+		by: false,
+		By: false,
+		DartObject: false,
+		element: false,
+		protractor: false
+	};
+	var webextensions = {
+		browser: false,
+		chrome: false,
+		opr: false
+	};
+	var greasemonkey = {
+		cloneInto: false,
+		createObjectIn: false,
+		exportFunction: false,
+		GM: false,
+		GM_addStyle: false,
+		GM_deleteValue: false,
+		GM_getResourceText: false,
+		GM_getResourceURL: false,
+		GM_getValue: false,
+		GM_info: false,
+		GM_listValues: false,
+		GM_log: false,
+		GM_openInTab: false,
+		GM_registerMenuCommand: false,
+		GM_setClipboard: false,
+		GM_setValue: false,
+		GM_xmlhttpRequest: false,
+		unsafeWindow: false
+	};
+	var devtools = {
+		$: false,
+		$_: false,
+		$$: false,
+		$0: false,
+		$1: false,
+		$2: false,
+		$3: false,
+		$4: false,
+		$x: false,
+		chrome: false,
+		clear: false,
+		copy: false,
+		debug: false,
+		dir: false,
+		dirxml: false,
+		getEventListeners: false,
+		inspect: false,
+		keys: false,
+		monitor: false,
+		monitorEvents: false,
+		profile: false,
+		profileEnd: false,
+		queryObjects: false,
+		table: false,
+		undebug: false,
+		unmonitor: false,
+		unmonitorEvents: false,
+		values: false
+	};
+	var globals = {
+		builtin: builtin,
+		es5: es5,
+		es2015: es2015,
+		es2017: es2017,
+		browser: browser,
+		worker: worker,
+		node: node,
+		commonjs: commonjs,
+		amd: amd,
+		mocha: mocha,
+		jasmine: jasmine,
+		jest: jest,
+		qunit: qunit,
+		phantomjs: phantomjs,
+		couch: couch,
+		rhino: rhino,
+		nashorn: nashorn,
+		wsh: wsh,
+		jquery: jquery,
+		yui: yui,
+		shelljs: shelljs,
+		prototypejs: prototypejs,
+		meteor: meteor,
+		mongo: mongo,
+		applescript: applescript,
+		serviceworker: serviceworker,
+		atomtest: atomtest,
+		embertest: embertest,
+		protractor: protractor,
+		"shared-node-browser": {
+		clearInterval: false,
+		clearTimeout: false,
+		console: false,
+		setInterval: false,
+		setTimeout: false,
+		URL: false,
+		URLSearchParams: false
+	},
+		webextensions: webextensions,
+		greasemonkey: greasemonkey,
+		devtools: devtools
+	};
+
+	var globals$1 = /*#__PURE__*/Object.freeze({
+		builtin: builtin,
+		es5: es5,
+		es2015: es2015,
+		es2017: es2017,
+		browser: browser,
+		worker: worker,
+		node: node,
+		commonjs: commonjs,
+		amd: amd,
+		mocha: mocha,
+		jasmine: jasmine,
+		jest: jest,
+		qunit: qunit,
+		phantomjs: phantomjs,
+		couch: couch,
+		rhino: rhino,
+		nashorn: nashorn,
+		wsh: wsh,
+		jquery: jquery,
+		yui: yui,
+		shelljs: shelljs,
+		prototypejs: prototypejs,
+		meteor: meteor,
+		mongo: mongo,
+		applescript: applescript,
+		serviceworker: serviceworker,
+		atomtest: atomtest,
+		embertest: embertest,
+		protractor: protractor,
+		webextensions: webextensions,
+		greasemonkey: greasemonkey,
+		devtools: devtools,
+		'default': globals
+	});
+
+	var require$$0 = getCjsExportFromNamespace(globals$1);
+
+	var globals$2 = require$$0;
+
+	const browserAPIs = Object.keys(globals$2.browser);
+	const builtinAPIs = Object.keys(globals$2.builtin);
+
+	const isIdentifier = namedTypes.Identifier.check.bind(namedTypes.Identifier);
+	const isLiteral = namedTypes.Literal.check.bind(namedTypes.Literal);
+	const isExpressionStatement = namedTypes.ExpressionStatement.check.bind(namedTypes.ExpressionStatement);
+	const isObjectExpression = namedTypes.ObjectExpression.check.bind(namedTypes.ObjectExpression);
+	const isThisExpression = namedTypes.ThisExpression.check.bind(namedTypes.ThisExpression);
+	const isNewExpression = namedTypes.NewExpression.check.bind(namedTypes.NewExpression);
+	const isSequenceExpression = namedTypes.SequenceExpression.check.bind(namedTypes.SequenceExpression);
+	const isBinaryExpression = namedTypes.BinaryExpression.check.bind(namedTypes.BinaryExpression);
+	const isExportDefaultStatement = namedTypes.ExportDefaultDeclaration.check.bind(namedTypes.ExportDefaultDeclaration);
+
+	const isBrowserAPI = ({name}) => browserAPIs.includes(name);
+	const isBuiltinAPI = ({name}) => builtinAPIs.includes(name);
+	const isRaw = (node) => node && node.raw; // eslint-disable-line
+
+	/**
+	 * Find the export default statement
+	 * @param   { Array } body - tree structure containing the program code
+	 * @returns { Object } node containing only the code of the export default statement
+	 */
+	function findExportDefaultStatement(body) {
+	  return body.find(isExportDefaultStatement)
+	}
+
+	/**
+	 * Find all the code in an ast program except for the export default statements
+	 * @param   { Array } body - tree structure containing the program code
+	 * @returns { Array } array containing all the program code except the export default expressions
+	 */
+	function filterNonExportDefaultStatements(body) {
+	  return body.filter(node => !isExportDefaultStatement(node))
+	}
+
+	/**
+	 * Get the body of the AST structure
+	 * @param   { Object } ast - ast object generated by recast
+	 * @returns { Array } array containing the program code
+	 */
+	function getProgramBody(ast) {
+	  return ast.body || ast.program.body
+	}
+
+	/**
+	 * Extend the AST adding the new tag method containing our tag sourcecode
+	 * @param   { Object } ast - current output ast
+	 * @param   { Object } exportDefaultNode - tag export default node
+	 * @returns { Object } the output ast having the "tag" key extended with the content of the export default
+	 */
+	function extendTagProperty(ast, exportDefaultNode) {
+	  types$1.visit(ast, {
+	    visitProperty(path) {
+	      if (path.value.key.value === TAG_LOGIC_PROPERTY) {
+	        path.value.value = exportDefaultNode.declaration;
+	        return false
+	      }
+
+	      this.traverse(path);
+	    }
+	  });
+
+	  return ast
+	}
+
+	/**
+	 * Generate the component javascript logic
+	 * @param   { Object } sourceNode - node generated by the riot compiler
+	 * @param   { string } source - original component source code
+	 * @param   { Object } meta - compilation meta information
+	 * @param   { AST } ast - current AST output
+	 * @returns { AST } the AST generated
+	 */
+	function javascript(sourceNode, source, meta, ast) {
+	  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+	  const javascriptNode = addLineOffset(sourceNode.text.text, source, sourceNode);
+	  const { options } = meta;
+	  const preprocessorOutput = preprocess('javascript', preprocessorName, meta, {
+	    ...sourceNode,
+	    text: javascriptNode
+	  });
+	  const inputSourceMap = sourcemapAsJSON(preprocessorOutput.map);
+	  const generatedAst = generateAST(preprocessorOutput.code, {
+	    sourceFileName: options.file,
+	    inputSourceMap: isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+	  });
+	  const generatedAstBody = getProgramBody(generatedAst);
+	  const bodyWithoutExportDefault = filterNonExportDefaultStatements(generatedAstBody);
+	  const exportDefaultNode = findExportDefaultStatement(generatedAstBody);
+	  const outputBody = getProgramBody(ast);
+
+	  // add to the ast the "private" javascript content of our tag script node
+	  outputBody.unshift(...bodyWithoutExportDefault);
+
+	  // convert the export default adding its content to the "tag" property exported
+	  if (exportDefaultNode) extendTagProperty(ast, exportDefaultNode);
+
+	  return ast
+	}
+
+	/**
+	 * Not all the types are handled in this module.
+	 *
+	 * @enum {number}
+	 * @readonly
+	 */
+	const TAG = 1; /* TAG */
+	const ATTR = 2; /* ATTR */
+	const TEXT = 3; /* TEXT */
+	const CDATA = 4; /* CDATA */
+	const COMMENT = 8; /* COMMENT */
+	const DOCUMENT = 9; /* DOCUMENT */
+	const DOCTYPE = 10; /* DOCTYPE */
+	const DOCUMENT_FRAGMENT = 11; /* DOCUMENT_FRAGMENT */
+
+	var types$3 = /*#__PURE__*/Object.freeze({
+		TAG: TAG,
+		ATTR: ATTR,
+		TEXT: TEXT,
+		CDATA: CDATA,
+		COMMENT: COMMENT,
+		DOCUMENT: DOCUMENT,
+		DOCTYPE: DOCTYPE,
+		DOCUMENT_FRAGMENT: DOCUMENT_FRAGMENT
+	});
+
+	const rootTagNotFound = 'Root tag not found.';
+	const unclosedTemplateLiteral = 'Unclosed ES6 template literal.';
+	const unexpectedEndOfFile = 'Unexpected end of file.';
+	const unclosedComment = 'Unclosed comment.';
+	const unclosedNamedBlock = 'Unclosed "%1" block.';
+	const duplicatedNamedTag = 'Duplicate tag "<%1>".';
+	const unexpectedCharInExpression = 'Unexpected character %1.';
+	const unclosedExpression = 'Unclosed expression.';
+
+	/**
+	 * Matches the start of valid tags names; used with the first 2 chars after the `'<'`.
+	 * @const
+	 * @private
+	 */
+	const TAG_2C = /^(?:\/[a-zA-Z]|[a-zA-Z][^\s>/]?)/;
+	/**
+	 * Matches valid tags names AFTER the validation with `TAG_2C`.
+	 * $1: tag name including any `'/'`, $2: non self-closing brace (`>`) w/o attributes.
+	 * @const
+	 * @private
+	 */
+	const TAG_NAME = /(\/?[^\s>/]+)\s*(>)?/g;
+	/**
+	 * Matches an attribute name-value pair (both can be empty).
+	 * $1: attribute name, $2: value including any quotes.
+	 * @const
+	 * @private
+	 */
+	const ATTR_START = /(\S[^>/=\s]*)(?:\s*=\s*([^>/])?)?/g;
+
+	/**
+	 * Matches the spread operator
+	 * it will be used for the spread attributes
+	 * @type {RegExp}
+	 */
+	const SPREAD_OPERATOR = /\.\.\./;
+	/**
+	 * Matches the closing tag of a `script` and `style` block.
+	 * Used by parseText fo find the end of the block.
+	 * @const
+	 * @private
+	 */
+	const RE_SCRYLE = {
+	  script: /<\/script\s*>/gi,
+	  style: /<\/style\s*>/gi,
+	  textarea: /<\/textarea\s*>/gi
+	};
+
+	// Do not touch text content inside this tags
+	const RAW_TAGS = /^\/?(?:pre|textarea)$/;
+
+	const JAVASCRIPT_OUTPUT_NAME = 'javascript';
+	const CSS_OUTPUT_NAME = 'css';
+	const TEMPLATE_OUTPUT_NAME = 'template';
+
+	// Tag names
+	const JAVASCRIPT_TAG = 'script';
+	const STYLE_TAG = 'style';
+	const TEXTAREA_TAG = 'textarea';
+
+	// Boolean attributes
+	const IS_RAW = 'isRaw';
+	const IS_SELF_CLOSING = 'isSelfClosing';
+	const IS_VOID = 'isVoid';
+	const IS_BOOLEAN = 'isBoolean';
+	const IS_CUSTOM = 'isCustom';
+	const IS_SPREAD = 'isSpread';
+
+	/**
+	 * Add an item into a collection, if the collection is not an array
+	 * we create one and add the item to it
+	 * @param   {Array} collection - target collection
+	 * @param   {*} item - item to add to the collection
+	 * @returns {Array} array containing the new item added to it
+	 */
+	function addToCollection(collection = [], item) {
+	  collection.push(item);
+	  return collection
+	}
+
+	/**
+	 * Run RegExp.exec starting from a specific position
+	 * @param   {RegExp} re - regex
+	 * @param   {number} pos - last index position
+	 * @param   {string} string - regex target
+	 * @returns {Array} regex result
+	 */
+	function execFromPos(re, pos, string) {
+	  re.lastIndex = pos;
+	  return re.exec(string)
+	}
+
+	/**
+	 * Escape special characters in a given string, in preparation to create a regex.
+	 *
+	 * @param   {string} str - Raw string
+	 * @returns {string} Escaped string.
+	 */
+	var escapeStr = (str) => str.replace(/(?=[-[\](){^*+?.$|\\])/g, '\\');
+
+	function formatError$1(data, message, pos) {
+	  if (!pos) {
+	    pos = data.length;
+	  }
+	  // count unix/mac/win eols
+	  const line = (data.slice(0, pos).match(/\r\n?|\n/g) || '').length + 1;
+	  let col = 0;
+	  while (--pos >= 0 && !/[\r\n]/.test(data[pos])) {
+	    ++col;
+	  }
+	  return `[${line},${col}]: ${message}`
+	}
+
+	const $_ES6_BQ = '`';
+
+	/**
+	 * Searches the next backquote that signals the end of the ES6 Template Literal
+	 * or the "${" sequence that starts a JS expression, skipping any escaped
+	 * character.
+	 *
+	 * @param   {string}    code  - Whole code
+	 * @param   {number}    pos   - The start position of the template
+	 * @param   {string[]}  stack - To save nested ES6 TL count
+	 * @returns {number}    The end of the string (-1 if not found)
+	 */
+	function skipES6TL(code, pos, stack) {
+	  // we are in the char following the backquote (`),
+	  // find the next unescaped backquote or the sequence "${"
+	  const re = /[`$\\]/g;
+	  let c;
+	  while (re.lastIndex = pos, re.exec(code)) {
+	    pos = re.lastIndex;
+	    c = code[pos - 1];
+	    if (c === '`') {
+	      return pos
+	    }
+	    if (c === '$' && code[pos++] === '{') {
+	      stack.push($_ES6_BQ, '}');
+	      return pos
+	    }
+	    // else this is an escaped char
+	  }
+	  throw formatError$1(code, unclosedTemplateLiteral, pos)
+	}
+
+	/**
+	 * Custom error handler can be implemented replacing this method.
+	 * The `state` object includes the buffer (`data`)
+	 * The error position (`loc`) contains line (base 1) and col (base 0).
+	 * @param {string} data - string containing the error
+	 * @param {string} msg - Error message
+	 * @param {number} pos - Position of the error
+	 * @returns {undefined} throw an exception error
+	 */
+	function panic$1(data, msg, pos) {
+	  const message = formatError$1(data, msg, pos);
+	  throw new Error(message)
+	}
+
+	// forked from https://github.com/aMarCruz/skip-regex
+
+	// safe characters to precced a regex (including `=>`, `**`, and `...`)
+	const beforeReChars = '[{(,;:?=|&!^~>%*/';
+	const beforeReSign = `${beforeReChars}+-`;
+
+	// keyword that can preceed a regex (`in` is handled as special case)
+	const beforeReWords = [
+	  'case',
+	  'default',
+	  'do',
+	  'else',
+	  'in',
+	  'instanceof',
+	  'prefix',
+	  'return',
+	  'typeof',
+	  'void',
+	  'yield'
+	];
+
+	// Last chars of all the beforeReWords elements to speed up the process.
+	const wordsEndChar = beforeReWords.reduce((s, w) => s + w.slice(-1), '');
+
+	// Matches literal regex from the start of the buffer.
+	// The buffer to search must not include line-endings.
+	const RE_LIT_REGEX = /^\/(?=[^*>/])[^[/\\]*(?:(?:\\.|\[(?:\\.|[^\]\\]*)*\])[^[\\/]*)*?\/[gimuy]*/;
+
+	// Valid characters for JavaScript variable names and literal numbers.
+	const RE_JS_VCHAR = /[$\w]/;
+
+	// Match dot characters that could be part of tricky regex
+	const RE_DOT_CHAR = /.*/g;
+
+	/**
+	 * Searches the position of the previous non-blank character inside `code`,
+	 * starting with `pos - 1`.
+	 *
+	 * @param   {string} code - Buffer to search
+	 * @param   {number} pos  - Starting position
+	 * @returns {number} Position of the first non-blank character to the left.
+	 * @private
+	 */
+	function _prev(code, pos) {
+	  while (--pos >= 0 && /\s/.test(code[pos]));
+	  return pos
+	}
+
+
+
+	/**
+	 * Check if the character in the `start` position within `code` can be a regex
+	 * and returns the position following this regex or `start+1` if this is not
+	 * one.
+	 *
+	 * NOTE: Ensure `start` points to a slash (this is not checked).
+	 *
+	 * @function skipRegex
+	 * @param   {string} code  - Buffer to test in
+	 * @param   {number} start - Position the first slash inside `code`
+	 * @returns {number} Position of the char following the regex.
+	 *
+	 */
+	/* istanbul ignore next */
+	function skipRegex(code, start) {
+	  let pos = RE_DOT_CHAR.lastIndex = start++;
+
+	  // `exec()` will extract from the slash to the end of the line
+	  //   and the chained `match()` will match the possible regex.
+	  const match = (RE_DOT_CHAR.exec(code) || ' ')[0].match(RE_LIT_REGEX);
+
+	  if (match) {
+	    const next = pos + match[0].length;      // result comes from `re.match`
+
+	    pos = _prev(code, pos);
+	    let c = code[pos];
+
+	    // start of buffer or safe prefix?
+	    if (pos < 0 || beforeReChars.includes(c)) {
+	      return next
+	    }
+
+	    // from here, `pos` is >= 0 and `c` is code[pos]
+	    if (c === '.') {
+	      // can be `...` or something silly like 5./2
+	      if (code[pos - 1] === '.') {
+	        start = next;
+	      }
+
+	    } else {
+
+	      if (c === '+' || c === '-') {
+	        // tricky case
+	        if (code[--pos] !== c ||            // if have a single operator or
+	             (pos = _prev(code, pos)) < 0 ||  // ...have `++` and no previous token
+	             beforeReSign.includes(c = code[pos])) {
+	          return next                       // ...this is a regex
+	        }
+	      }
+
+	      if (wordsEndChar.includes(c)) {  // looks like a keyword?
+	        const end = pos + 1;
+
+	        // get the complete (previous) keyword
+	        while (--pos >= 0 && RE_JS_VCHAR.test(code[pos]));
+
+	        // it is in the allowed keywords list?
+	        if (beforeReWords.includes(code.slice(pos + 1, end))) {
+	          start = next;
+	        }
+	      }
+	    }
+	  }
+
+	  return start
+	}
+
+	/*
+	 * Mini-parser for expressions.
+	 * The main pourpose of this module is to find the end of an expression
+	 * and return its text without the enclosing brackets.
+	 * Does not works with comments, but supports ES6 template strings.
+	 */
+	/**
+	 * @exports exprExtr
+	 */
+	const S_SQ_STR = /'[^'\n\r\\]*(?:\\(?:\r\n?|[\S\s])[^'\n\r\\]*)*'/.source;
+	/**
+	 * Matches double quoted JS strings taking care about nested quotes
+	 * and EOLs (escaped EOLs are Ok).
+	 *
+	 * @const
+	 * @private
+	 */
+	const S_STRING = `${S_SQ_STR}|${S_SQ_STR.replace(/'/g, '"')}`;
+	/**
+	 * Regex cache
+	 *
+	 * @type {Object.<string, RegExp>}
+	 * @const
+	 * @private
+	 */
+	const reBr = {};
+	/**
+	 * Makes an optimal regex that matches quoted strings, brackets, backquotes
+	 * and the closing brackets of an expression.
+	 *
+	 * @param   {string} b - Closing brackets
+	 * @returns {RegExp} - optimized regex
+	 */
+	function _regex(b) {
+	  let re = reBr[b];
+	  if (!re) {
+	    let s = escapeStr(b);
+	    if (b.length > 1) {
+	      s = `${s}|[`;
+	    } else {
+	      s = /[{}[\]()]/.test(b) ? '[' : `[${s}`;
+	    }
+	    reBr[b] = re = new RegExp(`${S_STRING}|${s}\`/\\{}[\\]()]`, 'g');
+	  }
+	  return re
+	}
+
+	/**
+	 * Update the scopes stack removing or adding closures to it
+	 * @param   {Array} stack - array stacking the expression closures
+	 * @param   {string} char - current char to add or remove from the stack
+	 * @param   {string} idx  - matching index
+	 * @param   {string} code - expression code
+	 * @returns {Object} result
+	 * @returns {Object} result.char - either the char received or the closing braces
+	 * @returns {Object} result.index - either a new index to skip part of the source code,
+	 *                                  or 0 to keep from parsing from the old position
+	 */
+	function updateStack(stack, char, idx, code) {
+	  let index = 0;
+
+	  switch (char) {
+	  case '[':
+	  case '(':
+	  case '{':
+	    stack.push(char === '[' ? ']' : char === '(' ? ')' : '}');
+	    break
+	  case ')':
+	  case ']':
+	  case '}':
+	    if (char !== stack.pop()) {
+	      panic$1(code, unexpectedCharInExpression.replace('%1', char), index);
+	    }
+
+	    if (char === '}' && stack[stack.length - 1] === $_ES6_BQ) {
+	      char = stack.pop();
+	    }
+
+	    index = idx + 1;
+	    break
+	  case '/':
+	    index = skipRegex(code, idx);
+	  }
+
+	  return { char, index }
+	}
+
+	/**
+	   * Parses the code string searching the end of the expression.
+	   * It skips braces, quoted strings, regexes, and ES6 template literals.
+	   *
+	   * @function exprExtr
+	   * @param   {string}  code  - Buffer to parse
+	   * @param   {number}  start - Position of the opening brace
+	   * @param   {[string,string]} bp - Brackets pair
+	   * @returns {Object} Expression's end (after the closing brace) or -1
+	   *                            if it is not an expr.
+	   */
+	function exprExtr(code, start, bp) {
+	  const [openingBraces, closingBraces] = bp;
+	  const offset = start + openingBraces.length; // skips the opening brace
+	  const stack = []; // expected closing braces ('`' for ES6 TL)
+	  const re = _regex(closingBraces);
+
+	  re.lastIndex = offset; // begining of the expression
+
+	  let end;
+	  let match;
+
+	  while (match = re.exec(code)) { // eslint-disable-line
+	    const idx = match.index;
+	    const str = match[0];
+	    end = re.lastIndex;
+
+	    // end the iteration
+	    if (str === closingBraces && !stack.length) {
+	      return {
+	        text: code.slice(offset, idx),
+	        start,
+	        end
+	      }
+	    }
+
+	    const { char, index } = updateStack(stack, str[0], idx, code);
+	    // update the end value depending on the new index received
+	    end = index || end;
+	    // update the regex last index
+	    re.lastIndex = char === $_ES6_BQ ? skipES6TL(code, end, stack) : end;
+	  }
+
+	  if (stack.length) {
+	    panic$1(code, unclosedExpression, end);
+	  }
+	}
+
+	/**
+	 * Outputs the last parsed node. Can be used with a builder too.
+	 *
+	 * @param   {ParserStore} store - Parsing store
+	 * @returns {undefined} void function
+	 * @private
+	 */
+	function flush(store) {
+	  const last = store.last;
+	  store.last = null;
+	  if (last && store.root) {
+	    store.builder.push(last);
+	  }
+	}
+
+	/**
+	 * Get the code chunks from start and end range
+	 * @param   {string}  source  - source code
+	 * @param   {number}  start   - Start position of the chunk we want to extract
+	 * @param   {number}  end     - Ending position of the chunk we need
+	 * @returns {string}  chunk of code extracted from the source code received
+	 * @private
+	 */
+	function getChunk(source, start, end) {
+	  return source.slice(start, end)
+	}
+
+	/**
+	 * states text in the last text node, or creates a new one if needed.
+	 *
+	 * @param {ParserState}   state   - Current parser state
+	 * @param {number}  start   - Start position of the tag
+	 * @param {number}  end     - Ending position (last char of the tag)
+	 * @param {Object}  extra   - extra properties to add to the text node
+	 * @param {RawExpr[]} extra.expressions  - Found expressions
+	 * @param {string}    extra.unescape     - Brackets to unescape
+	 * @returns {undefined} - void function
+	 * @private
+	 */
+	function pushText(state, start, end, extra = {}) {
+	  const text = getChunk(state.data, start, end);
+	  const expressions = extra.expressions;
+	  const unescape = extra.unescape;
+
+	  let q = state.last;
+	  state.pos = end;
+
+	  if (q && q.type === TEXT) {
+	    q.text += text;
+	    q.end = end;
+	  } else {
+	    flush(state);
+	    state.last = q = { type: TEXT, text, start, end };
+	  }
+
+	  if (expressions && expressions.length) {
+	    q.expressions = (q.expressions || []).concat(expressions);
+	  }
+
+	  if (unescape) {
+	    q.unescape = unescape;
+	  }
+
+	  return TEXT
+	}
+
+	/**
+	 * Find the end of the attribute value or text node
+	 * Extract expressions.
+	 * Detect if value have escaped brackets.
+	 *
+	 * @param   {ParserState} state  - Parser state
+	 * @param   {HasExpr} node       - Node if attr, info if text
+	 * @param   {string} endingChars - Ends the value or text
+	 * @param   {number} start       - Starting position
+	 * @returns {number} Ending position
+	 * @private
+	 */
+	function expr(state, node, endingChars, start) {
+	  const re = b0re(state, endingChars);
+
+	  re.lastIndex = start; // reset re position
+
+	  const { unescape, expressions, end } = parseExpressions(state, re);
+
+	  if (node) {
+	    if (unescape) {
+	      node.unescape = unescape;
+	    }
+	    if (expressions.length) {
+	      node.expressions = expressions;
+	    }
+	  } else {
+	    pushText(state, start, end, {expressions, unescape});
+	  }
+
+	  return end
+	}
+
+	/**
+	 * Parse a text chunk finding all the expressions in it
+	 * @param   {ParserState} state  - Parser state
+	 * @param   {RegExp} re - regex to match the expressions contents
+	 * @returns {Object} result containing the expression found, the string to unescape and the end position
+	 */
+	function parseExpressions(state, re) {
+	  const { data, options } = state;
+	  const { brackets } = options;
+	  const expressions = [];
+	  let unescape, pos, match;
+
+	  // Anything captured in $1 (closing quote or character) ends the loop...
+	  while ((match = re.exec(data)) && !match[1]) {
+	    // ...else, we have an opening bracket and maybe an expression.
+	    pos = match.index;
+	    if (data[pos - 1] === '\\') {
+	      unescape = match[0]; // it is an escaped opening brace
+	    } else {
+	      const tmpExpr = exprExtr(data, pos, brackets);
+	      if (tmpExpr) {
+	        expressions.push(tmpExpr);
+	        re.lastIndex = tmpExpr.end;
+	      }
+	    }
+	  }
+
+	  // Even for text, the parser needs match a closing char
+	  if (!match) {
+	    panic$1(data, unexpectedEndOfFile, pos);
+	  }
+
+	  return {
+	    unescape,
+	    expressions,
+	    end: match.index
+	  }
+	}
+
+
+
+	/**
+	 * Creates a regex for the given string and the left bracket.
+	 * The string is captured in $1.
+	 *
+	 * @param   {ParserState} state  - Parser state
+	 * @param   {string} str - String to search
+	 * @returns {RegExp} Resulting regex.
+	 * @private
+	 */
+	function b0re(state, str) {
+	  const { brackets } = state.options;
+	  const re = state.regexCache[str];
+
+	  if (re) return re
+
+	  const b0 = escapeStr(brackets[0]);
+	  // cache the regex extending the regexCache object
+	  Object.assign(state.regexCache, { [str]: new RegExp(`(${str})|${b0}`, 'g') });
+
+	  return state.regexCache[str]
+	}
+
+	// similar to _.uniq
+	const uniq = l => l.filter((x, i, a) => a.indexOf(x) === i);
+
+	/**
+	 * SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+	 * @const {Array}
+	 */
+	const VOID_SVG_TAGS_LIST = [
+	  'circle',
+	  'ellipse',
+	  'line',
+	  'path',
+	  'polygon',
+	  'polyline',
+	  'rect',
+	  'stop',
+	  'use'
+	];
+
+	/**
+	 * List of html elements where the value attribute is allowed
+	 * @type {Array}
+	 */
+	const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST = [
+	  'button',
+	  'data',
+	  'input',
+	  'select',
+	  'li',
+	  'meter',
+	  'option',
+	  'output',
+	  'progress',
+	  'textarea',
+	  'param'
+	];
+
+	/**
+	 * List of all the available svg tags
+	 * @const {Array}
+	 * @see {@link https://github.com/wooorm/svg-tag-names}
+	 */
+	const SVG_TAGS_LIST = uniq([
+	  'a',
+	  'altGlyph',
+	  'altGlyphDef',
+	  'altGlyphItem',
+	  'animate',
+	  'animateColor',
+	  'animateMotion',
+	  'animateTransform',
+	  'animation',
+	  'audio',
+	  'canvas',
+	  'clipPath',
+	  'color-profile',
+	  'cursor',
+	  'defs',
+	  'desc',
+	  'discard',
+	  'feBlend',
+	  'feColorMatrix',
+	  'feComponentTransfer',
+	  'feComposite',
+	  'feConvolveMatrix',
+	  'feDiffuseLighting',
+	  'feDisplacementMap',
+	  'feDistantLight',
+	  'feDropShadow',
+	  'feFlood',
+	  'feFuncA',
+	  'feFuncB',
+	  'feFuncG',
+	  'feFuncR',
+	  'feGaussianBlur',
+	  'feImage',
+	  'feMerge',
+	  'feMergeNode',
+	  'feMorphology',
+	  'feOffset',
+	  'fePointLight',
+	  'feSpecularLighting',
+	  'feSpotLight',
+	  'feTile',
+	  'feTurbulence',
+	  'filter',
+	  'font',
+	  'font-face',
+	  'font-face-format',
+	  'font-face-name',
+	  'font-face-src',
+	  'font-face-uri',
+	  'foreignObject',
+	  'g',
+	  'glyph',
+	  'glyphRef',
+	  'handler',
+	  'hatch',
+	  'hatchpath',
+	  'hkern',
+	  'iframe',
+	  'image',
+	  'linearGradient',
+	  'listener',
+	  'marker',
+	  'mask',
+	  'mesh',
+	  'meshgradient',
+	  'meshpatch',
+	  'meshrow',
+	  'metadata',
+	  'missing-glyph',
+	  'mpath',
+	  'pattern',
+	  'prefetch',
+	  'radialGradient',
+	  'script',
+	  'set',
+	  'solidColor',
+	  'solidcolor',
+	  'style',
+	  'svg',
+	  'switch',
+	  'symbol',
+	  'tbreak',
+	  'text',
+	  'textArea',
+	  'textPath',
+	  'title',
+	  'tref',
+	  'tspan',
+	  'unknown',
+	  'video',
+	  'view',
+	  'vkern'
+	].concat(VOID_SVG_TAGS_LIST)).sort();
+
+	/**
+	 * HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+	 * @type {Array}
+	 * @see   {@link http://www.w3.org/TR/html-markup/syntax.html#syntax-elements}
+	 * @see   {@link http://www.w3.org/TR/html5/syntax.html#void-elements}
+	 */
+	const VOID_HTML_TAGS_LIST = [
+	  'area',
+	  'base',
+	  'br',
+	  'col',
+	  'embed',
+	  'hr',
+	  'img',
+	  'input',
+	  'keygen',
+	  'link',
+	  'menuitem',
+	  'meta',
+	  'param',
+	  'source',
+	  'track',
+	  'wbr'
+	];
+
+	/**
+	 * List of all the html tags
+	 * @const {Array}
+	 * @see {@link https://github.com/sindresorhus/html-tags}
+	 */
+	const HTML_TAGS_LIST = uniq([
+	  'a',
+	  'abbr',
+	  'address',
+	  'article',
+	  'aside',
+	  'audio',
+	  'b',
+	  'bdi',
+	  'bdo',
+	  'blockquote',
+	  'body',
+	  'canvas',
+	  'caption',
+	  'cite',
+	  'code',
+	  'colgroup',
+	  'datalist',
+	  'dd',
+	  'del',
+	  'details',
+	  'dfn',
+	  'dialog',
+	  'div',
+	  'dl',
+	  'dt',
+	  'em',
+	  'fieldset',
+	  'figcaption',
+	  'figure',
+	  'footer',
+	  'form',
+	  'h1',
+	  'h2',
+	  'h3',
+	  'h4',
+	  'h5',
+	  'h6',
+	  'head',
+	  'header',
+	  'hgroup',
+	  'html',
+	  'i',
+	  'iframe',
+	  'ins',
+	  'kbd',
+	  'label',
+	  'legend',
+	  'main',
+	  'map',
+	  'mark',
+	  'math',
+	  'menu',
+	  'nav',
+	  'noscript',
+	  'object',
+	  'ol',
+	  'optgroup',
+	  'p',
+	  'picture',
+	  'pre',
+	  'q',
+	  'rb',
+	  'rp',
+	  'rt',
+	  'rtc',
+	  'ruby',
+	  's',
+	  'samp',
+	  'script',
+	  'section',
+	  'select',
+	  'slot',
+	  'small',
+	  'span',
+	  'strong',
+	  'style',
+	  'sub',
+	  'summary',
+	  'sup',
+	  'svg',
+	  'table',
+	  'tbody',
+	  'td',
+	  'template',
+	  'tfoot',
+	  'th',
+	  'thead',
+	  'time',
+	  'title',
+	  'tr',
+	  'u',
+	  'ul',
+	  'var',
+	  'video'
+	]
+	  .concat(VOID_HTML_TAGS_LIST)
+	  .concat(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST)
+	).sort();
+
+	/**
+	 * List of all boolean HTML attributes
+	 * @const {RegExp}
+	 * @see {@link https://www.w3.org/TR/html5/infrastructure.html#sec-boolean-attributes}
+	 */
+	const BOOLEAN_ATTRIBUTES_LIST = [
+	  'disabled',
+	  'visible',
+	  'checked',
+	  'readonly',
+	  'required',
+	  'allowfullscreen',
+	  'autofocus',
+	  'autoplay',
+	  'compact',
+	  'controls',
+	  'default',
+	  'formnovalidate',
+	  'hidden',
+	  'ismap',
+	  'itemscope',
+	  'loop',
+	  'multiple',
+	  'muted',
+	  'noresize',
+	  'noshade',
+	  'novalidate',
+	  'nowrap',
+	  'open',
+	  'reversed',
+	  'seamless',
+	  'selected',
+	  'sortable',
+	  'truespeed',
+	  'typemustmatch'
+	];
+
+	/**
+	 * Join a list of items with the pipe symbol (usefull for regex list concatenation)
+	 * @private
+	 * @param   {Array} list - list of strings
+	 * @returns {string} the list received joined with pipes
+	 */
+	function joinWithPipe(list) {
+	  return list.join('|')
+	}
+
+	/**
+	 * Convert list of strings to regex in order to test against it ignoring the cases
+	 * @private
+	 * @param   {...Array} lists - array of strings
+	 * @returns {RegExp} regex that will match all the strings in the array received ignoring the cases
+	 */
+	function listsToRegex(...lists) {
+	  return new RegExp(`^/?(?:${joinWithPipe(lists.map(joinWithPipe))})$`, 'i')
+	}
+
+	/**
+	 * Regex matching all the html tags ignoring the cases
+	 * @const {RegExp}
+	 */
+	const HTML_TAGS_RE = listsToRegex(HTML_TAGS_LIST);
+
+	/**
+	 * Regex matching all the svg tags ignoring the cases
+	 * @const {RegExp}
+	 */
+	const SVG_TAGS_RE = listsToRegex(SVG_TAGS_LIST);
+
+	/**
+	 * Regex matching all the void html tags ignoring the cases
+	 * @const {RegExp}
+	 */
+	const VOID_HTML_TAGS_RE =  listsToRegex(VOID_HTML_TAGS_LIST);
+
+	/**
+	 * Regex matching all the void svg tags ignoring the cases
+	 * @const {RegExp}
+	 */
+	const VOID_SVG_TAGS_RE =  listsToRegex(VOID_SVG_TAGS_LIST);
+
+	/**
+	 * Regex matching all the html tags where the value tag is allowed
+	 * @const {RegExp}
+	 */
+	const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE = listsToRegex(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST);
+
+	/**
+	 * Regex matching all the boolean attributes
+	 * @const {RegExp}
+	 */
+	const BOOLEAN_ATTRIBUTES_RE =  listsToRegex(BOOLEAN_ATTRIBUTES_LIST);
+
+	/**
+	 * True if it's a self closing tag
+	 * @param   {string}  tag - test tag
+	 * @returns {boolean} true if void
+	 * @example
+	 * isVoid('meta') // true
+	 * isVoid('circle') // true
+	 * isVoid('IMG') // true
+	 * isVoid('div') // false
+	 * isVoid('mask') // false
+	 */
+	function isVoid(tag) {
+	  return [
+	    VOID_HTML_TAGS_RE,
+	    VOID_SVG_TAGS_RE
+	  ].some(r => r.test(tag))
+	}
+
+	/**
+	 * True if it's not SVG nor a HTML known tag
+	 * @param   {string}  tag - test tag
+	 * @returns {boolean} true if custom element
+	 * @example
+	 * isCustom('my-component') // true
+	 * isCustom('div') // false
+	 */
+	function isCustom(tag) {
+	  return [
+	    HTML_TAGS_RE,
+	    SVG_TAGS_RE
+	  ].every(l => !l.test(tag))
+	}
+
+	/**
+	 * True if the value attribute is allowed on this tag
+	 * @param   {string}  tag - test tag
+	 * @returns {boolean} true if the value attribute is allowed
+	 * @example
+	 * hasValueAttribute('input') // true
+	 * hasValueAttribute('div') // false
+	 */
+	function hasValueAttribute(tag) {
+	  return HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE.test(tag)
+	}
+
+	/**
+	 * True if it's a boolean attribute
+	 * @param   {string} attribute - test attribute
+	 * @returns {boolean} true if the attribute is a boolean type
+	 * @example
+	 * isBoolAttribute('selected') // true
+	 * isBoolAttribute('class') // false
+	 */
+	function isBoolAttribute(attribute) {
+	  return BOOLEAN_ATTRIBUTES_RE.test(attribute)
+	}
+
+	/**
+	 * Memoization function
+	 * @param   {Function} fn - function to memoize
+	 * @returns {*} return of the function to memoize
+	 */
+	function memoize(fn) {
+	  const cache = new WeakMap();
+
+	  return (...args) => {
+	    if (cache.has(args[0])) return cache.get(args[0])
+
+	    const ret = fn(...args);
+
+	    cache.set(args[0], ret);
+
+	    return ret
+	  }
+	}
+
+	const expressionsContentRe = memoize(brackets => RegExp(`(${brackets[0]}[^${brackets[1]}]*?${brackets[1]})`, 'g'));
+	const isSpreadAttribute = name => SPREAD_OPERATOR.test(name);
+	const isAttributeExpression = (name, brackets) => name[0] === brackets[0];
+	const getAttributeEnd = (state, attr) => expr(state, attr, '[>/\\s]', attr.start);
+
+	/**
+	 * The more complex parsing is for attributes as it can contain quoted or
+	 * unquoted values or expressions.
+	 *
+	 * @param   {ParserStore} state  - Parser state
+	 * @returns {number} New parser mode.
+	 * @private
+	 */
+	function attr(state) {
+	  const { data, last, pos, root } = state;
+	  const tag = last; // the last (current) tag in the output
+	  const _CH = /\S/g; // matches the first non-space char
+	  const ch = execFromPos(_CH, pos, data);
+
+	  switch (true) {
+	  case !ch:
+	    state.pos = data.length; // reaching the end of the buffer with
+	    // NodeTypes.ATTR will generate error
+	    break
+	  case ch[0] === '>':
+	    // closing char found. If this is a self-closing tag with the name of the
+	    // Root tag, we need decrement the counter as we are changing mode.
+	    state.pos = tag.end = _CH.lastIndex;
+	    if (tag[IS_SELF_CLOSING]) {
+	      state.scryle = null; // allow selfClosing script/style tags
+	      if (root && root.name === tag.name) {
+	        state.count--; // "pop" root tag
+	      }
+	    }
+	    return TEXT
+	  case ch[0] === '/':
+	    state.pos = _CH.lastIndex; // maybe. delegate the validation
+	    tag[IS_SELF_CLOSING] = true; // the next loop
+	    break
+	  default:
+	    delete tag[IS_SELF_CLOSING]; // ensure unmark as selfclosing tag
+	    setAttribute(state, ch.index, tag);
+	  }
+
+	  return ATTR
+	}
+
+	/**
+	 * Parses an attribute and its expressions.
+	 *
+	 * @param   {ParserStore}  state  - Parser state
+	 * @param   {number} pos    - Starting position of the attribute
+	 * @param   {Object} tag    - Current parent tag
+	 * @returns {undefined} void function
+	 * @private
+	 */
+	function setAttribute(state, pos, tag) {
+	  const { data } = state;
+	  const expressionContent = expressionsContentRe(state.options.brackets);
+	  const re = ATTR_START; // (\S[^>/=\s]*)(?:\s*=\s*([^>/])?)? g
+	  const start = re.lastIndex = expressionContent.lastIndex = pos; // first non-whitespace
+	  const attrMatches = re.exec(data);
+	  const isExpressionName = isAttributeExpression(attrMatches[1], state.options.brackets);
+	  const match = isExpressionName ? [null, expressionContent.exec(data)[1], null] : attrMatches;
+
+	  if (match) {
+	    const end = re.lastIndex;
+	    const attr = parseAttribute(state, match, start, end, isExpressionName);
+
+	    //assert(q && q.type === Mode.TAG, 'no previous tag for the attr!')
+	    // Pushes the attribute and shifts the `end` position of the tag (`last`).
+	    state.pos = tag.end = attr.end;
+	    tag.attributes = addToCollection(tag.attributes, attr);
+	  }
+	}
+
+	function parseNomalAttribute(state, attr, quote) {
+	  const { data } = state;
+	  let { end } = attr;
+
+	  if (isBoolAttribute(attr.name)) {
+	    attr[IS_BOOLEAN] = true;
+	  }
+
+	  // parse the whole value (if any) and get any expressions on it
+	  if (quote) {
+	    // Usually, the value's first char (`quote`) is a quote and the lastIndex
+	    // (`end`) is the start of the value.
+	    let valueStart = end;
+	    // If it not, this is an unquoted value and we need adjust the start.
+	    if (quote !== '"' && quote !== '\'') {
+	      quote = ''; // first char of value is not a quote
+	      valueStart--; // adjust the starting position
+	    }
+
+	    end = expr(state, attr, quote || '[>/\\s]', valueStart);
+
+	    // adjust the bounds of the value and save its content
+	    return Object.assign(attr, {
+	      value: getChunk(data, valueStart, end),
+	      valueStart,
+	      end: quote ? ++end : end
+	    })
+	  }
+
+	  return attr
+	}
+
+
+	/**
+	 * Parse expression names <a {href}>
+	 * @param   {ParserStore}  state  - Parser state
+	 * @param   {Object} attr - attribute object parsed
+	 * @returns {Object} normalized attribute object
+	 */
+	function parseSpreadAttribute(state, attr) {
+	  const end = getAttributeEnd(state, attr);
+
+	  return {
+	    [IS_SPREAD]: true,
+	    start: attr.start,
+	    expressions: attr.expressions.map(expr => Object.assign(expr, {
+	      text: expr.text.replace(SPREAD_OPERATOR, '').trim()
+	    })),
+	    end: end
+	  }
+	}
+
+	/**
+	 * Parse expression names <a {href}>
+	 * @param   {ParserStore}  state  - Parser state
+	 * @param   {Object} attr - attribute object parsed
+	 * @returns {Object} normalized attribute object
+	 */
+	function parseExpressionNameAttribute(state, attr) {
+	  const end = getAttributeEnd(state, attr);
+
+	  return {
+	    start: attr.start,
+	    name: attr.expressions[0].text.trim(),
+	    expressions: attr.expressions,
+	    end: end
+	  }
+	}
+
+	/**
+	 * Parse the attribute values normalising the quotes
+	 * @param   {ParserStore}  state  - Parser state
+	 * @param   {Array} match - results of the attributes regex
+	 * @param   {number} start - attribute start position
+	 * @param   {number} end - attribute end position
+	 * @param   {boolean} isExpressionName - true if the attribute name is an expression
+	 * @returns {Object} attribute object
+	 */
+	function parseAttribute(state, match, start, end, isExpressionName) {
+	  const attr = {
+	    name: match[1],
+	    value: '',
+	    start,
+	    end
+	  };
+
+	  const quote = match[2]; // first letter of value or nothing
+
+	  switch (true) {
+	  case isSpreadAttribute(attr.name):
+	    return parseSpreadAttribute(state, attr)
+	  case isExpressionName === true:
+	    return parseExpressionNameAttribute(state, attr)
+	  default:
+	    return parseNomalAttribute(state, attr, quote)
+	  }
+	}
+
+	/**
+	 * Parses comments in long or short form
+	 * (any DOCTYPE & CDATA blocks are parsed as comments).
+	 *
+	 * @param   {ParserState} state  - Parser state
+	 * @param   {string} data       - Buffer to parse
+	 * @param   {number} start      - Position of the '<!' sequence
+	 * @returns {number} node type id
+	 * @private
+	 */
+	function comment(state, data, start) {
+	  const pos = start + 2; // skip '<!'
+	  const str = data.substr(pos, 2) === '--' ? '-->' : '>';
+	  const end = data.indexOf(str, pos);
+	  if (end < 0) {
+	    panic$1(data, unclosedComment, start);
+	  }
+	  pushComment$1(state, start, end + str.length);
+
+	  return TEXT
+	}
+
+	/**
+	 * Parse a comment.
+	 *
+	 * @param   {ParserState}  state - Current parser state
+	 * @param   {number}  start - Start position of the tag
+	 * @param   {number}  end   - Ending position (last char of the tag)
+	 * @returns {undefined} void function
+	 * @private
+	 */
+	function pushComment$1(state, start, end) {
+	  flush(state);
+	  state.pos = end;
+	  if (state.options.comments === true) {
+	    state.last = { type: COMMENT, start, end };
+	  }
+	}
+
+	/**
+	 * Pushes a new *tag* and set `last` to this, so any attributes
+	 * will be included on this and shifts the `end`.
+	 *
+	 * @param   {ParserState} state  - Current parser state
+	 * @param   {string}  name      - Name of the node including any slash
+	 * @param   {number}  start     - Start position of the tag
+	 * @param   {number}  end       - Ending position (last char of the tag + 1)
+	 * @returns {undefined} - void function
+	 * @private
+	 */
+	function pushTag(state, name, start, end) {
+	  const root = state.root;
+	  const last = { type: TAG, name, start, end };
+
+	  if (isCustom(name)) {
+	    last[IS_CUSTOM] = true;
+	  }
+
+	  if (isVoid(name)) {
+	    last[IS_VOID] = true;
+	  }
+
+	  state.pos = end;
+
+	  if (root) {
+	    if (name === root.name) {
+	      state.count++;
+	    } else if (name === root.close) {
+	      state.count--;
+	    }
+	    flush(state);
+	  } else {
+	    // start with root (keep ref to output)
+	    state.root = { name: last.name, close: `/${name}` };
+	    state.count = 1;
+	  }
+
+	  state.last = last;
+	}
+
+	/**
+	 * Parse the tag following a '<' character, or delegate to other parser
+	 * if an invalid tag name is found.
+	 *
+	 * @param   {ParserState} state  - Parser state
+	 * @returns {number} New parser mode
+	 * @private
+	 */
+	function tag(state) {
+	  const { pos, data } = state; // pos of the char following '<'
+	  const start = pos - 1; // pos of '<'
+	  const str = data.substr(pos, 2); // first two chars following '<'
+
+	  switch (true) {
+	  case str[0] === '!':
+	    return comment(state, data, start)
+	  case TAG_2C.test(str):
+	    return parseTag(state, start)
+	  default:
+	    return pushText(state, start, pos) // pushes the '<' as text
+	  }
+	}
+
+	function parseTag(state, start) {
+	  const { data, pos } = state;
+	  const re = TAG_NAME; // (\/?[^\s>/]+)\s*(>)? g
+	  const match = execFromPos(re, pos, data);
+	  const end = re.lastIndex;
+	  const name = match[1].toLowerCase(); // $1: tag name including any '/'
+	  // script/style block is parsed as another tag to extract attributes
+	  if (name in RE_SCRYLE) {
+	    state.scryle = name; // used by parseText
+	  }
+
+	  pushTag(state, name, start, end);
+	  // only '>' can ends the tag here, the '/' is handled in parseAttribute
+	  if (!match[2]) {
+	    return ATTR
+	  }
+
+	  return TEXT
+	}
+
+	/**
+	 * Parses regular text and script/style blocks ...scryle for short :-)
+	 * (the content of script and style is text as well)
+	 *
+	 * @param   {ParserState} state - Parser state
+	 * @returns {number} New parser mode.
+	 * @private
+	 */
+	function text(state) {
+	  const { pos, data, scryle } = state;
+
+	  switch (true) {
+	  case typeof scryle === 'string': {
+	    const name = scryle;
+	    const re = RE_SCRYLE[name];
+	    const match = execFromPos(re, pos, data);
+
+	    if (!match) {
+	      panic$1(data, unclosedNamedBlock.replace('%1', name), pos - 1);
+	    }
+
+	    const start = match.index;
+	    const end = re.lastIndex;
+	    state.scryle = null; // reset the script/style flag now
+	    // write the tag content, if any
+	    if (start > pos) {
+	      parseSpecialTagsContent(state, name, match);
+	    }
+	    // now the closing tag, either </script> or </style>
+	    pushTag(state, `/${name}`, start, end);
+	    break
+	  }
+	  case data[pos] === '<':
+	    state.pos++;
+	    return TAG
+	  default:
+	    expr(state, null, '<', pos);
+	  }
+
+	  return TEXT
+	}
+
+	/**
+	 * Parse the text content depending on the name
+	 * @param   {ParserState} state - Parser state
+	 * @param   {string} name  - one of the tags matched by the RE_SCRYLE regex
+	 * @param   {Array}  match - result of the regex matching the content of the parsed tag
+	 * @returns {undefined} void function
+	 */
+	function parseSpecialTagsContent(state, name, match) {
+	  const { pos } = state;
+	  const start = match.index;
+
+	  if (name === TEXTAREA_TAG) {
+	    expr(state, null, match[0], pos);
+	  } else {
+	    pushText(state, pos, start);
+	  }
+	}
+
+	/*---------------------------------------------------------------------
+	 * Tree builder for the riot tag parser.
+	 *
+	 * The output has a root property and separate arrays for `html`, `css`,
+	 * and `js` tags.
+	 *
+	 * The root tag is included as first element in the `html` array.
+	 * Script tags marked with "defer" are included in `html` instead `js`.
+	 *
+	 * - Mark SVG tags
+	 * - Mark raw tags
+	 * - Mark void tags
+	 * - Split prefixes from expressions
+	 * - Unescape escaped brackets and escape EOLs and backslashes
+	 * - Compact whitespace (option `compact`) for non-raw tags
+	 * - Create an array `parts` for text nodes and attributes
+	 *
+	 * Throws on unclosed tags or closing tags without start tag.
+	 * Selfclosing and void tags has no nodes[] property.
+	 */
+
+	/**
+	 * Escape the carriage return and the line feed from a string
+	 * @param   {string} string - input string
+	 * @returns {string} output string escaped
+	 */
+	function escapeReturn(string) {
+	  return string
+	    .replace(/\r/g, '\\r')
+	    .replace(/\n/g, '\\n')
+	}
+
+	/**
+	 * Escape double slashes in a string
+	 * @param   {string} string - input string
+	 * @returns {string} output string escaped
+	 */
+	function escapeSlashes(string) {
+	  return string.replace(/\\/g, '\\\\')
+	}
+
+	/**
+	 * Replace the multiple spaces with only one
+	 * @param   {string} string - input string
+	 * @returns {string} string without trailing spaces
+	 */
+	function cleanSpaces(string) {
+	  return string.replace(/\s+/g, ' ')
+	}
+
+	const TREE_BUILDER_STRUCT = Object.seal({
+	  get() {
+	    const store = this.store;
+	    // The real root tag is in store.root.nodes[0]
+	    return {
+	      [TEMPLATE_OUTPUT_NAME]: store.root.nodes[0],
+	      [CSS_OUTPUT_NAME]: store[STYLE_TAG],
+	      [JAVASCRIPT_OUTPUT_NAME]: store[JAVASCRIPT_TAG]
+	    }
+	  },
+
+	  /**
+	  * Process the current tag or text.
+	  * @param {Object} node - Raw pseudo-node from the parser
+	  * @returns {undefined} void function
+	  */
+	  push(node) {
+	    const store = this.store;
+
+	    switch (node.type) {
+	    case TEXT:
+	      this.pushText(store, node);
+	      break
+	    case TAG: {
+	      const name = node.name;
+	      const closingTagChar = '/';
+	      const [firstChar] = name;
+
+	      if (firstChar === closingTagChar && !node.isVoid) {
+	        this.closeTag(store, node, name);
+	      } else if (firstChar !== closingTagChar) {
+	        this.openTag(store, node);
+	      }
+	      break
+	    }
+	    }
+	  },
+	  closeTag(store, node) {
+	    const last = store.scryle || store.last;
+
+	    last.end = node.end;
+
+	    if (store.scryle) {
+	      store.scryle = null;
+	    } else {
+	      store.last = store.stack.pop();
+	    }
+	  },
+
+	  openTag(store, node) {
+	    const name = node.name;
+	    const attrs = node.attributes;
+
+	    if ([JAVASCRIPT_TAG, STYLE_TAG].includes(name)) {
+	      // Only accept one of each
+	      if (store[name]) {
+	        panic$1(this.store.data, duplicatedNamedTag.replace('%1', name), node.start);
+	      }
+
+	      store[name] = node;
+	      store.scryle = store[name];
+
+	    } else {
+	      // store.last holds the last tag pushed in the stack and this are
+	      // non-void, non-empty tags, so we are sure the `lastTag` here
+	      // have a `nodes` property.
+	      const lastTag = store.last;
+	      const newNode = node;
+
+	      lastTag.nodes.push(newNode);
+
+	      if (lastTag[IS_RAW] || RAW_TAGS.test(name)) {
+	        node[IS_RAW] = true;
+	      }
+
+	      if (!node[IS_SELF_CLOSING] && !node[IS_VOID]) {
+	        store.stack.push(lastTag);
+	        newNode.nodes = [];
+	        store.last = newNode;
+	      }
+	    }
+
+	    if (attrs) {
+	      this.attrs(attrs);
+	    }
+	  },
+	  attrs(attributes) {
+	    attributes.forEach(attr => {
+	      if (attr.value) {
+	        this.split(attr, attr.value, attr.valueStart, true);
+	      }
+	    });
+	  },
+	  pushText(store, node) {
+	    const text = node.text;
+	    const empty = !/\S/.test(text);
+	    const scryle = store.scryle;
+	    if (!scryle) {
+	      // store.last always have a nodes property
+	      const parent = store.last;
+
+	      const pack = this.compact && !parent[IS_RAW];
+	      if (pack && empty) {
+	        return
+	      }
+	      this.split(node, text, node.start, pack);
+	      parent.nodes.push(node);
+	    } else if (!empty) {
+	      scryle.text = node;
+	    }
+	  },
+	  split(node, source, start, pack) {
+	    const expressions = node.expressions;
+	    const parts = [];
+
+	    if (expressions) {
+	      let pos = 0;
+
+	      expressions.forEach(expr => {
+	        const text = source.slice(pos, expr.start - start);
+	        const code = expr.text;
+	        parts.push(this.sanitise(node, text, pack), escapeReturn(escapeSlashes(code).trim()));
+	        pos = expr.end - start;
+	      });
+
+	      if (pos < node.end) {
+	        parts.push(this.sanitise(node, source.slice(pos), pack));
+	      }
+	    } else {
+	      parts[0] = this.sanitise(node, source, pack);
+	    }
+
+	    node.parts = parts.filter(p => p); // remove the empty strings
+	  },
+	  // unescape escaped brackets and split prefixes of expressions
+	  sanitise(node, text, pack) {
+	    let rep = node.unescape;
+	    if (rep) {
+	      let idx = 0;
+	      rep = `\\${rep}`;
+	      while ((idx = text.indexOf(rep, idx)) !== -1) {
+	        text = text.substr(0, idx) + text.substr(idx + 1);
+	        idx++;
+	      }
+	    }
+
+	    text = escapeSlashes(text);
+
+	    return pack ? cleanSpaces(text) : escapeReturn(text)
+	  }
+	});
+
+	function createTreeBuilder(data, options) {
+	  const root = {
+	    type: TAG,
+	    name: '',
+	    start: 0,
+	    end: 0,
+	    nodes: []
+	  };
+
+	  return Object.assign(Object.create(TREE_BUILDER_STRUCT), {
+	    compact: options.compact !== false,
+	    store: {
+	      last: root,
+	      stack: [],
+	      scryle: null,
+	      root,
+	      style: null,
+	      script: null,
+	      data
+	    }
+	  })
+	}
+
+	/**
+	 * Factory for the Parser class, exposing only the `parse` method.
+	 * The export adds the Parser class as property.
+	 *
+	 * @param   {Object}   options - User Options
+	 * @param   {Function} customBuilder - Tree builder factory
+	 * @returns {Function} Public Parser implementation.
+	 */
+	function parser$1(options, customBuilder) {
+	  const state = curry(createParserState)(options, customBuilder || createTreeBuilder);
+	  return {
+	    parse: (data) => parse(state(data))
+	  }
+	}
+
+	/**
+	 * Create a new state object
+	 * @param   {Object} userOptions - parser options
+	 * @param   {Function} builder - Tree builder factory
+	 * @param   {string} data - data to parse
+	 * @returns {ParserState} it represents the current parser state
+	 */
+	function createParserState(userOptions, builder, data) {
+	  const options = Object.assign({
+	    brackets: ['{', '}']
+	  }, userOptions);
+
+	  return {
+	    options,
+	    regexCache: {},
+	    pos: 0,
+	    count: -1,
+	    root: null,
+	    last: null,
+	    scryle: null,
+	    builder: builder(data, options),
+	    data
+	  }
+	}
+
+	/**
+	 * It creates a raw output of pseudo-nodes with one of three different types,
+	 * all of them having a start/end position:
+	 *
+	 * - TAG     -- Opening or closing tags
+	 * - TEXT    -- Raw text
+	 * - COMMENT -- Comments
+	 *
+	 * @param   {ParserState}  state - Current parser state
+	 * @returns {ParserResult} Result, contains data and output properties.
+	 */
+	function parse(state) {
+	  const { data } = state;
+
+	  walk(state);
+	  flush(state);
+
+	  if (state.count) {
+	    panic$1(data, state.count > 0 ? unexpectedEndOfFile : rootTagNotFound, state.pos);
+	  }
+
+	  return {
+	    data,
+	    output: state.builder.get()
+	  }
+	}
+
+	/**
+	 * Parser walking recursive function
+	 * @param {ParserState}  state - Current parser state
+	 * @param {string} type - current parsing context
+	 * @returns {undefined} void function
+	 */
+	function walk(state, type) {
+	  const { data } = state;
+	  // extend the state adding the tree builder instance and the initial data
+	  const length = data.length;
+
+	  // The "count" property is set to 1 when the first tag is found.
+	  // This becomes the root and precedent text or comments are discarded.
+	  // So, at the end of the parsing count must be zero.
+	  if (state.pos < length && state.count) {
+	    walk(state, eat(state, type));
+	  }
+	}
+
+	/**
+	 * Function to help iterating on the current parser state
+	 * @param {ParserState}  state - Current parser state
+	 * @param   {string} type - current parsing context
+	 * @returns {string} parsing context
+	 */
+	function eat(state, type) {
+	  switch (type) {
+	  case TAG:
+	    return tag(state)
+	  case ATTR:
+	    return attr(state)
+	  default:
+	    return text(state)
+	  }
+	}
+
+	/**
+	 * The nodeTypes definition
+	 */
+	const nodeTypes = types$3;
+
+	// import {IS_BOOLEAN,IS_CUSTOM,IS_RAW,IS_SPREAD,IS_VOID} from '@riotjs/parser/src/constants'
+
+	const BINDING_TYPES = 'bindingTypes';
+	const EACH_BINDING_TYPE = 'EACH';
+	const IF_BINDING_TYPE = 'IF';
+	const TAG_BINDING_TYPE = 'TAG';
+	const SLOT_BINDING_TYPE = 'SLOT';
+
+
+	const EXPRESSION_TYPES = 'expressionTypes';
+	const ATTRIBUTE_EXPRESSION_TYPE = 'ATTRIBUTE';
+	const VALUE_EXPRESSION_TYPE = 'VALUE';
+	const TEXT_EXPRESSION_TYPE = 'TEXT';
+	const EVENT_EXPRESSION_TYPE = 'EVENT';
+
+	const TEMPLATE_FN = 'template';
+	const SCOPE = 'scope';
+	const GET_COMPONENT_FN = 'getComponent';
+
+	// keys needed to create the DOM bindings
+	const BINDING_SELECTOR_KEY = 'selector';
+	const BINDING_GET_COMPONENT_KEY = 'getComponent';
+	const BINDING_TEMPLATE_KEY = 'template';
+	const BINDING_TYPE_KEY = 'type';
+	const BINDING_REDUNDANT_ATTRIBUTE_KEY = 'redundantAttribute';
+	const BINDING_CONDITION_KEY = 'condition';
+	const BINDING_ITEM_NAME_KEY = 'itemName';
+	const BINDING_GET_KEY_KEY = 'getKey';
+	const BINDING_INDEX_NAME_KEY = 'indexName';
+	const BINDING_EVALUATE_KEY = 'evaluate';
+	const BINDING_NAME_KEY = 'name';
+	const BINDING_SLOTS_KEY = 'slots';
+	const BINDING_EXPRESSIONS_KEY = 'expressions';
+	const BINDING_CHILD_NODE_INDEX_KEY = 'childNodeIndex';
+	// slots keys
+	const BINDING_BINDINGS_KEY = 'bindings';
+	const BINDING_ID_KEY = 'id';
+	const BINDING_HTML_KEY = 'html';
+	const BINDING_ATTRIBUTES_KEY = 'attributes';
+
+	// DOM directives
+	const IF_DIRECTIVE = 'if';
+	const EACH_DIRECTIVE = 'each';
+	const KEY_ATTRIBUTE = 'key';
+	const SLOT_ATTRIBUTE = 'slot';
+	const NAME_ATTRIBUTE = 'name';
+	const IS_DIRECTIVE = 'is';
+
+	// Misc
+	const DEFAULT_SLOT_NAME = 'default';
+	const TEXT_NODE_EXPRESSION_PLACEHOLDER = '<!---->';
+	const BINDING_SELECTOR_PREFIX = 'expr';
+	const SLOT_TAG_NODE_NAME = 'slot';
+	const PROGRESS_TAG_NODE_NAME = 'progress';
+	const IS_VOID_NODE = 'isVoid';
+	const IS_CUSTOM_NODE = 'isCustom';
+	const IS_BOOLEAN_ATTRIBUTE = 'isBoolean';
+	const IS_SPREAD_ATTRIBUTE = 'isSpread';
+
+	/**
+	 * True if the node has not expression set nor bindings directives
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only if it's a static node that doesn't need bindings or expressions
+	 */
+	function isStaticNode(node) {
+	  return [
+	    hasExpressions,
+	    findEachAttribute,
+	    findIfAttribute,
+	    isCustomNode,
+	    isSlotNode
+	  ].every(test => !test(node))
+	}
+
+	/**
+	 * Check if a node name is part of the browser or builtin javascript api or it belongs to the current scope
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @returns {boolean} true if it's a global api variable
+	 */
+	function isGlobal({ scope, node }) {
+	  return Boolean(
+	    isRaw(node) ||
+	        isBuiltinAPI(node) ||
+	        isBrowserAPI(node) ||
+	        isNewExpression(node) ||
+	        isNodeInScope(scope, node),
+	  )
+	}
+
+	/**
+	 * Checks if the identifier of a given node exists in a scope
+	 * @param {Scope} scope - scope where to search for the identifier
+	 * @param {types.Node} node - node to search for the identifier
+	 * @returns {boolean} true if the node identifier is defined in the given scope
+	 */
+	function isNodeInScope(scope, node) {
+	  const traverse = (isInScope = false) => {
+	    types$1.visit(node, {
+	      visitIdentifier(path) {
+	        if (scope.lookup(getName$1(path.node))) {
+	          isInScope = true;
+	        }
+
+	        this.abort();
+	      }
+	    });
+
+	    return isInScope
+	  };
+
+	  return traverse()
+	}
+
+	/**
+	 * True if the node has the isCustom attribute set
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true if either it's a riot component or a custom element
+	 */
+	function isCustomNode(node) {
+	  return !!(node[IS_CUSTOM_NODE] || hasIsAttribute(node))
+	}
+
+	/**
+	 * True the node is <slot>
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true if it's a slot node
+	 */
+	function isSlotNode(node) {
+	  return node.name === SLOT_TAG_NODE_NAME
+	}
+
+	/**
+	 * True if the node has the isVoid attribute set
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true if the node is self closing
+	 */
+	function isVoidNode(node) {
+	  return !!node[IS_VOID_NODE]
+	}
+
+	/**
+	 * True if the riot parser did find a tag node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for the tag nodes
+	 */
+	function isTagNode(node) {
+	  return node.type === nodeTypes.TAG
+	}
+
+	/**
+	 * True if the riot parser did find a text node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for the text nodes
+	 */
+	function isTextNode(node) {
+	  return node.type === nodeTypes.TEXT
+	}
+
+	/**
+	 * True if the node parsed is the root one
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for the root nodes
+	 */
+	function isRootNode(node) {
+	  return node.isRoot
+	}
+
+	/**
+	 * True if the attribute parsed is of type spread one
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true if the attribute node is of type spread
+	 */
+	function isSpreadAttribute$1(node) {
+	  return node[IS_SPREAD_ATTRIBUTE]
+	}
+
+	/**
+	 * True if the node is an attribute and its name is "value"
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for value attribute nodes
+	 */
+	function isValueAttribute(node) {
+	  return node.name === 'value'
+	}
+
+	/**
+	 * True if the DOM node is a progress tag
+	 * @param   {RiotParser.Node}  node - riot parser node
+	 * @returns {boolean} true for the progress tags
+	 */
+	function isProgressNode(node) {
+	  return node.name === PROGRESS_TAG_NODE_NAME
+	}
+
+	/**
+	 * True if the node is an attribute and a DOM handler
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for dom listener attribute nodes
+	 */
+	const isEventAttribute = (() => {
+	  const EVENT_ATTR_RE = /^on/;
+	  return node => EVENT_ATTR_RE.test(node.name)
+	})();
+
+	/**
+	 * True if the node has expressions or expression attributes
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} ditto
+	 */
+	function hasExpressions(node) {
+	  return !!(
+	    node.expressions ||
+	        // has expression attributes
+	        (getNodeAttributes(node).some(attribute => hasExpressions(attribute))) ||
+	        // has child text nodes with expressions
+	        (node.nodes && node.nodes.some(node => isTextNode(node) && hasExpressions(node)))
+	  )
+	}
+
+	/**
+	 * True if the node is a directive having its own template
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {boolean} true only for the IF EACH and TAG bindings
+	 */
+	function hasItsOwnTemplate(node) {
+	  return [
+	    findEachAttribute,
+	    findIfAttribute,
+	    isCustomNode
+	  ].some(test => test(node))
+	}
+
+	const hasIfAttribute = compose(Boolean, findIfAttribute);
+	const hasEachAttribute = compose(Boolean, findEachAttribute);
+	const hasIsAttribute = compose(Boolean, findIsAttribute);
+	const hasKeyAttribute = compose(Boolean, findKeyAttribute);
+
+	/**
+	 * Find the attribute node
+	 * @param   { string } name -  name of the attribute we want to find
+	 * @param   { riotParser.nodeTypes.TAG } node - a tag node
+	 * @returns { riotParser.nodeTypes.ATTR } attribute node
+	 */
+	function findAttribute(name, node) {
+	  return node.attributes && node.attributes.find(attr => getName$1(attr) === name)
+	}
+
+	function findIfAttribute(node) {
+	  return findAttribute(IF_DIRECTIVE, node)
+	}
+
+	function findEachAttribute(node) {
+	  return findAttribute(EACH_DIRECTIVE, node)
+	}
+
+	function findKeyAttribute(node) {
+	  return findAttribute(KEY_ATTRIBUTE, node)
+	}
+
+	function findIsAttribute(node) {
+	  return findAttribute(IS_DIRECTIVE, node)
+	}
+
+	/**
+	 * Find all the node attributes that are not expressions
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {Array} list of all the static attributes
+	 */
+	function findStaticAttributes(node) {
+	  return getNodeAttributes(node).filter(attribute => !hasExpressions(attribute))
+	}
+
+	/**
+	 * Find all the node attributes that have expressions
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {Array} list of all the dynamic attributes
+	 */
+	function findDynamicAttributes(node) {
+	  return getNodeAttributes(node).filter(hasExpressions)
+	}
+
+	/**
+	 * Unescape the user escaped chars
+	 * @param   {string} string - input string
+	 * @param   {string} char - probably a '{' or anything the user want's to escape
+	 * @returns {string} cleaned up string
+	 */
+	function unescapeChar(string, char) {
+	  return string.replace(RegExp(`\\\\${char}`, 'gm'), char)
+	}
+
+	const scope$1 = builders.identifier(SCOPE);
+	const getName$1 = node => node && node.name ? node.name : node;
+
+	/**
+	 * Replace the path scope with a member Expression
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @param   { types.Node } property - node we want to prefix with the scope identifier
+	 * @returns {undefined} this is a void function
+	 */
+	function replacePathScope(path, property) {
+	  path.replace(builders.memberExpression(
+	    scope$1,
+	    property,
+	    false
+	  ));
+	}
+
+	/**
+	 * Change the nodes scope adding the `scope` prefix
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @returns { boolean } return false if we want to stop the tree traversal
+	 * @context { types.visit }
+	 */
+	function updateNodeScope(path) {
+	  if (!isGlobal(path)) {
+	    replacePathScope(path, path.node);
+
+	    return false
+	  }
+
+	  this.traverse(path);
+	}
+
+	/**
+	 * Change the scope of the member expressions
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @returns { boolean } return always false because we want to check only the first node object
+	 */
+	function visitMemberExpression(path) {
+	  if (!isGlobal(path) && !isGlobal({ node: path.node.object, scope: path.scope })) {
+	    if (path.value.computed) {
+	      this.traverse(path);
+	    } else if (isBinaryExpression(path.node.object) || path.node.object.computed) {
+	      this.traverse(path.get('object'));
+	    } else if (!path.node.object.callee) {
+	      replacePathScope(path, isThisExpression(path.node.object) ? path.node.property : path.node);
+	    } else {
+	      this.traverse(path.get('object'));
+	    }
+	  }
+
+	  return false
+	}
+
+
+	/**
+	 * Objects properties should be handled a bit differently from the Identifier
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @returns { boolean } return false if we want to stop the tree traversal
+	 */
+	function visitProperty(path) {
+	  const value = path.node.value;
+
+	  if (isIdentifier(value)) {
+	    updateNodeScope(path.get('value'));
+	  } else {
+	    this.traverse(path.get('value'));
+	  }
+
+	  return false
+	}
+
+	/**
+	 * The this expressions should be replaced with the scope
+	 * @param   { types.NodePath } path - containing the current node visited
+	 * @returns { boolean|undefined } return false if we want to stop the tree traversal
+	 */
+	function visitThisExpression(path) {
+	  path.replace(scope$1);
+	  this.traverse(path);
+	}
+
+
+	/**
+	 * Update the scope of the global nodes
+	 * @param   { Object } ast - ast program
+	 * @returns { Object } the ast program with all the global nodes updated
+	 */
+	function updateNodesScope(ast) {
+	  const ignorePath = () => false;
+
+	  types$1.visit(ast, {
+	    visitIdentifier: updateNodeScope,
+	    visitMemberExpression,
+	    visitProperty,
+	    visitThisExpression,
+	    visitClassExpression: ignorePath
+	  });
+
+	  return ast
+	}
+
+	/**
+	 * Convert any expression to an AST tree
+	 * @param   { Object } expression - expression parsed by the riot parser
+	 * @param   { string } sourceFile - original tag file
+	 * @param   { string } sourceCode - original tag source code
+	 * @returns { Object } the ast generated
+	 */
+	function createASTFromExpression(expression, sourceFile, sourceCode) {
+	  const code = sourceFile ?
+	    addLineOffset(expression.text, sourceCode, expression) :
+	    expression.text;
+
+	  return generateAST(`(${code})`, {
+	    sourceFileName: sourceFile
+	  })
+	}
+
+	/**
+	 * Create the bindings template property
+	 * @param   {Array} args - arguments to pass to the template function
+	 * @returns {ASTNode} a binding template key
+	 */
+	function createTemplateProperty(args) {
+	  return simplePropertyNode(
+	    BINDING_TEMPLATE_KEY,
+	    args ? callTemplateFunction(...args) : nullNode()
+	  )
+	}
+
+	/**
+	 * Try to get the expression of an attribute node
+	 * @param   { RiotParser.Node.Attribute } attribute - riot parser attribute node
+	 * @returns { RiotParser.Node.Expression } attribute expression value
+	 */
+	function getAttributeExpression(attribute) {
+	  return attribute.expressions ? attribute.expressions[0] : {
+	    // if no expression was found try to typecast the attribute value
+	    ...attribute,
+	    text: attribute.value
+	  }
+	}
+
+	/**
+	 * Wrap the ast generated in a function call providing the scope argument
+	 * @param   {Object} ast - function body
+	 * @returns {FunctionExpresion} function having the scope argument injected
+	 */
+	function wrapASTInFunctionWithScope(ast) {
+	  return builders.functionExpression(
+	    null,
+	    [scope$1],
+	    builders.blockStatement([builders.returnStatement(
+	      ast
+	    )])
+	  )
+	}
+
+	/**
+	 * Convert any parser option to a valid template one
+	 * @param   { RiotParser.Node.Expression } expression - expression parsed by the riot parser
+	 * @param   { string } sourceFile - original tag file
+	 * @param   { string } sourceCode - original tag source code
+	 * @returns { Object } a FunctionExpression object
+	 *
+	 * @example
+	 *  toScopedFunction('foo + bar') // scope.foo + scope.bar
+	 *
+	 * @example
+	 *  toScopedFunction('foo.baz + bar') // scope.foo.baz + scope.bar
+	 */
+	function toScopedFunction(expression, sourceFile, sourceCode) {
+	  return compose(
+	    wrapASTInFunctionWithScope,
+	    transformExpression,
+	  )(expression, sourceFile, sourceCode)
+	}
+
+	/**
+	 * Transform an expression node updating its global scope
+	 * @param   {RiotParser.Node.Expr} expression - riot parser expression node
+	 * @param   {string} sourceFile - source file
+	 * @param   {string} sourceCode - source code
+	 * @returns {ASTExpression} ast expression generated from the riot parser expression node
+	 */
+	function transformExpression(expression, sourceFile, sourceCode) {
+	  return compose(
+	    getExpressionAST,
+	    updateNodesScope,
+	    createASTFromExpression
+	  )(expression, sourceFile, sourceCode)
+	}
+
+	/**
+	 * Get the parsed AST expression of riot expression node
+	 * @param   {AST.Program} sourceAST - raw node parsed
+	 * @returns {AST.Expression} program expression output
+	 */
+	function getExpressionAST(sourceAST) {
+	  const astBody = sourceAST.program.body;
+
+	  return astBody[0] ? astBody[0].expression : astBody
+	}
+
+	/**
+	 * Create the template call function
+	 * @param   {Array|string|Node.Literal} template - template string
+	 * @param   {Array<AST.Nodes>} bindings - template bindings provided as AST nodes
+	 * @returns {Node.CallExpression} template call expression
+	 */
+	function callTemplateFunction(template, bindings) {
+	  return builders.callExpression(builders.identifier(TEMPLATE_FN), [
+	    template ? builders.literal(template) : nullNode(),
+	    bindings ? builders.arrayExpression(bindings) : nullNode()
+	  ])
+	}
+
+	/**
+	 * Convert any DOM attribute into a valid DOM selector useful for the querySelector API
+	 * @param   { string } attributeName - name of the attribute to query
+	 * @returns { string } the attribute transformed to a query selector
+	 */
+	const attributeNameToDOMQuerySelector = attributeName => `[${attributeName}]`;
+
+	/**
+	 * Create the properties to query a DOM node
+	 * @param   { string } attributeName - attribute name needed to identify a DOM node
+	 * @returns { Array<AST.Node> } array containing the selector properties needed for the binding
+	 */
+	function createSelectorProperties(attributeName) {
+	  return attributeName ? [
+	    simplePropertyNode(BINDING_REDUNDANT_ATTRIBUTE_KEY, builders.literal(attributeName)),
+	    simplePropertyNode(BINDING_SELECTOR_KEY,
+	      compose(builders.literal, attributeNameToDOMQuerySelector)(attributeName)
+	    )
+	  ] : []
+	}
+
+	/**
+	 * Clone the node filtering out the selector attribute from the attributes list
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @param   {string} selectorAttribute - name of the selector attribute to filter out
+	 * @returns {RiotParser.Node} the node with the attribute cleaned up
+	 */
+	function cloneNodeWithoutSelectorAttribute(node, selectorAttribute) {
+	  return {
+	    ...node,
+	    attributes: getAttributesWithoutSelector(getNodeAttributes(node), selectorAttribute)
+	  }
+	}
+
+
+	/**
+	 * Get the node attributes without the selector one
+	 * @param   {Array<RiotParser.Attr>} attributes - attributes list
+	 * @param   {string} selectorAttribute - name of the selector attribute to filter out
+	 * @returns {Array<RiotParser.Attr>} filtered attributes
+	 */
+	function getAttributesWithoutSelector(attributes, selectorAttribute) {
+	  if (selectorAttribute)
+	    return attributes.filter(attribute => attribute.name !== selectorAttribute)
+
+	  return attributes
+	}
+
+	/**
+	 * Clean binding or custom attributes
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {Array<RiotParser.Node.Attr>} only the attributes that are not bindings or directives
+	 */
+	function cleanAttributes(node) {
+	  return getNodeAttributes(node).filter(attribute => ![
+	    IF_DIRECTIVE,
+	    EACH_DIRECTIVE,
+	    KEY_ATTRIBUTE,
+	    SLOT_ATTRIBUTE,
+	    IS_DIRECTIVE
+	  ].includes(attribute.name))
+	}
+
+	/**
+	 * Create a root node proxing only its nodes and attributes
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {RiotParser.Node} root node
+	 */
+	function createRootNode(node) {
+	  return {
+	    nodes: getChildrenNodes(node),
+	    isRoot: true,
+	    // root nodes shuold't have directives
+	    attributes: cleanAttributes(node)
+	  }
+	}
+
+	/**
+	 * Get all the child nodes of a RiotParser.Node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {Array<RiotParser.Node>} all the child nodes found
+	 */
+	function getChildrenNodes(node) {
+	  return node && node.nodes ? node.nodes : []
+	}
+
+	/**
+	 * Get all the attributes of a riot parser node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {Array<RiotParser.Node.Attribute>} all the attributes find
+	 */
+	function getNodeAttributes(node) {
+	  return node.attributes ? node.attributes : []
+	}
+	/**
+	 * Get the name of a custom node transforming it into an expression node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {RiotParser.Node.Attr} the node name as expression attribute
+	 */
+	function getCustomNodeNameAsExpression(node) {
+	  const isAttribute = findIsAttribute(node);
+	  const toRawString = val => `'${val}'`;
+
+	  if (isAttribute) {
+	    return isAttribute.expressions ? isAttribute.expressions[0] : {
+	      ...isAttribute,
+	      text: toRawString(isAttribute.value)
+	    }
+	  }
+
+	  return { ...node, text: toRawString(getName$1(node)) }
+	}
+
+	/**
+	 * Convert all the node static attributes to strings
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {string} all the node static concatenated as string
+	 */
+	function staticAttributesToString(node) {
+	  return findStaticAttributes(node)
+	    .map(attribute => attribute[IS_BOOLEAN_ATTRIBUTE] || !attribute.value ?
+	      attribute.name :
+	      `${attribute.name}="${unescapeNode(attribute, 'value').value}"`
+	    ).join(' ')
+	}
+
+	/**
+	 * Make sure that node escaped chars will be unescaped
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @param   {string} key - key property to unescape
+	 * @returns {RiotParser.Node} node with the text property unescaped
+	 */
+	function unescapeNode(node, key) {
+	  if (node.unescape) {
+	    return {
+	      ...node,
+	      [key]: unescapeChar(node[key], node.unescape)
+	    }
+	  }
+
+	  return node
+	}
+
+
+	/**
+	 * Convert a riot parser opening node into a string
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {string} the node as string
+	 */
+	function nodeToString(node) {
+	  const attributes = staticAttributesToString(node);
+
+	  switch(true) {
+	  case isTagNode(node):
+	    return `<${node.name}${attributes ? ` ${attributes}` : ''}${isVoidNode(node) ? '/' : ''}>`
+	  case isTextNode(node):
+	    return hasExpressions(node) ? TEXT_NODE_EXPRESSION_PLACEHOLDER : unescapeNode(node, 'text').text
+	  default:
+	    return ''
+	  }
+	}
+
+	/**
+	 * Close an html node
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @returns {string} the closing tag of the html tag node passed to this function
+	 */
+	function closeTag(node) {
+	  return node.name ? `</${node.name}>` : ''
+	}
+
+	/**
+	 * Create a strings array with the `join` call to transform it into a string
+	 * @param   {Array} stringsArray - array containing all the strings to concatenate
+	 * @returns {AST.CallExpression} array with a `join` call
+	 */
+	function createArrayString(stringsArray) {
+	  return builders.callExpression(
+	    builders.memberExpression(
+	      builders.arrayExpression(stringsArray),
+	      builders.identifier('join'),
+	      false
+	    ),
+	    [builders.literal('')],
+	  )
+	}
+
+	/**
+	 * Simple expression bindings might contain multiple expressions like for example: "class="{foo} red {bar}""
+	 * This helper aims to merge them in a template literal if it's necessary
+	 * @param   {RiotParser.Attr} node - riot parser node
+	 * @param   {string} sourceFile - original tag file
+	 * @param   {string} sourceCode - original tag source code
+	 * @returns { Object } a template literal expression object
+	 */
+	function mergeAttributeExpressions(node, sourceFile, sourceCode) {
+	  if (!node.parts || node.parts.length === 1) {
+	    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+	  }
+	  const stringsArray = [
+	    ...node.parts.reduce((acc, str) => {
+	      const expression = node.expressions.find(e => e.text.trim() === str);
+
+	      return [
+	        ...acc,
+	        expression ? transformExpression(expression, sourceFile, sourceCode) : builders.literal(str)
+	      ]
+	    }, [])
+	  ].filter(expr => !isLiteral(expr) || expr.value);
+
+
+	  return createArrayString(stringsArray)
+	}
+
+	/**
+	 * Create a selector that will be used to find the node via dom-bindings
+	 * @param   {number} id - temporary variable that will be increased anytime this function will be called
+	 * @returns {string} selector attribute needed to bind a riot expression
+	 */
+	const createBindingSelector = (function createSelector(id = 0) {
+	  return () => `${BINDING_SELECTOR_PREFIX}${id++}`
+	}());
+
+	/**
+	 * Create an attribute evaluation function
+	 * @param   {RiotParser.Attr} sourceNode - riot parser node
+	 * @param   {string} sourceFile - original tag file
+	 * @param   {string} sourceCode - original tag source code
+	 * @returns { AST.Node } an AST function expression to evaluate the attribute value
+	 */
+	function createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode) {
+	  return hasExpressions(sourceNode) ?
+	  // dynamic attribute
+	    wrapASTInFunctionWithScope(mergeAttributeExpressions(sourceNode, sourceFile, sourceCode)) :
+	  // static attribute
+	    builders.functionExpression(
+	      null,
+	      [],
+	      builders.blockStatement([
+	        builders.returnStatement(builders.literal(sourceNode.value || true))
+	      ]),
+	    )
+	}
+
+	/**
+	 * Simple clone deep function, do not use it for classes or recursive objects!
+	 * @param   {*} source - possibily an object to clone
+	 * @returns {*} the object we wanted to clone
+	 */
+	function cloneDeep(source) {
+	  return JSON.parse(JSON.stringify(source))
+	}
+
+	const getEachItemName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[0] : expression.left;
+	const getEachIndexName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[1] : null;
+	const getEachValue = expression => expression.right;
+	const nameToliteral = compose(builders.literal, getName$1);
+
+	const generateEachItemNameKey = expression => simplePropertyNode(
+	  BINDING_ITEM_NAME_KEY,
+	  compose(nameToliteral, getEachItemName)(expression)
+	);
+
+	const generateEachIndexNameKey = expression => simplePropertyNode(
+	  BINDING_INDEX_NAME_KEY,
+	  compose(nameToliteral, getEachIndexName)(expression)
+	);
+
+	const generateEachEvaluateKey = (expression, eachExpression, sourceFile, sourceCode) => simplePropertyNode(
+	  BINDING_EVALUATE_KEY,
+	  compose(
+	    e => toScopedFunction(e, sourceFile, sourceCode),
+	    e => ({
+	      ...eachExpression,
+	      text: generateJavascript(e).code
+	    }),
+	    getEachValue
+	  )(expression)
+	);
+
+	/**
+	 * Get the each expression properties to create properly the template binding
+	 * @param   { DomBinding.Expression } eachExpression - original each expression data
+	 * @param   { string } sourceFile - original tag file
+	 * @param   { string } sourceCode - original tag source code
+	 * @returns { Array } AST nodes that are needed to build an each binding
+	 */
+	function generateEachExpressionProperties(eachExpression, sourceFile, sourceCode) {
+	  const ast = createASTFromExpression(eachExpression, sourceFile, sourceCode);
+	  const body = ast.program.body;
+	  const firstNode = body[0];
+
+	  if (!isExpressionStatement(firstNode)) {
+	    panic(`The each directives supported should be of type "ExpressionStatement",you have provided a "${firstNode.type}"`);
+	  }
+
+	  const { expression } = firstNode;
+
+	  return [
+	    generateEachItemNameKey(expression),
+	    generateEachIndexNameKey(expression),
+	    generateEachEvaluateKey(expression, eachExpression, sourceFile, sourceCode)
+	  ]
+	}
+
+	/**
+	 * Transform a RiotParser.Node.Tag into an each binding
+	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns { AST.Node } an each binding node
+	 */
+	function createEachBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+	  const [ifAttribute, eachAttribute, keyAttribute] = [
+	    findIfAttribute,
+	    findEachAttribute,
+	    findKeyAttribute
+	  ].map(f => f(sourceNode));
+	  const attributeOrNull = attribute => attribute ? toScopedFunction(getAttributeExpression(attribute), sourceFile, sourceCode) : nullNode();
+
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(BINDING_TYPES),
+	        builders.identifier(EACH_BINDING_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(BINDING_GET_KEY_KEY, attributeOrNull(keyAttribute)),
+	    simplePropertyNode(BINDING_CONDITION_KEY, attributeOrNull(ifAttribute)),
+	    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute)),
+	    ...createSelectorProperties(selectorAttribute),
+	    ...compose(generateEachExpressionProperties, getAttributeExpression)(eachAttribute)
+	  ])
+	}
+
+	/**
+	 * Transform a RiotParser.Node.Tag into an if binding
+	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @param   { stiring } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns { AST.Node } an if binding node
+	 */
+	function createIfBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+	  const ifAttribute = findIfAttribute(sourceNode);
+
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(BINDING_TYPES),
+	        builders.identifier(IF_BINDING_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      toScopedFunction(ifAttribute.expressions[0], sourceFile, sourceCode)
+	    ),
+	    ...createSelectorProperties(selectorAttribute),
+	    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute))
+	  ])
+	}
+
+	/**
+	 * Create a simple attribute expression
+	 * @param   {RiotParser.Node.Attr} sourceNode - the custom tag
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @returns {AST.Node} object containing the expression binding keys
+	 */
+	function createAttributeExpression(sourceNode, sourceFile, sourceCode) {
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(EXPRESSION_TYPES),
+	        builders.identifier(ATTRIBUTE_EXPRESSION_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(BINDING_NAME_KEY, isSpreadAttribute$1(sourceNode) ? nullNode() : builders.literal(sourceNode.name)),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+	    )
+	  ])
+	}
+
+	/**
+	 * Create a simple event expression
+	 * @param   {RiotParser.Node.Attr} sourceNode - attribute containing the event handlers
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @returns {AST.Node} object containing the expression binding keys
+	 */
+	function createEventExpression(sourceNode, sourceFile, sourceCode) {
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(EXPRESSION_TYPES),
+	        builders.identifier(EVENT_EXPRESSION_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(BINDING_NAME_KEY, builders.literal(sourceNode.name)),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+	    )
+	  ])
+	}
+
+	/**
+	 * Generate the pure immutable string chunks from a RiotParser.Node.Text
+	 * @param   {RiotParser.Node.Text} node - riot parser text node
+	 * @param   {string} sourceCode sourceCode - source code
+	 * @returns {Array} array containing the immutable string chunks
+	 */
+	function generateLiteralStringChunksFromNode(node, sourceCode) {
+	  return node.expressions.reduce((chunks, expression, index) => {
+	    const start = index ? node.expressions[index - 1].end : node.start;
+
+	    chunks.push(sourceCode.substring(start, expression.start));
+
+	    // add the tail to the string
+	    if (index === node.expressions.length - 1)
+	      chunks.push(sourceCode.substring(expression.end, node.end));
+
+	    return chunks
+	  }, []).map(str => node.unescape ? unescapeChar(str, node.unescape) : str)
+	}
+
+	/**
+	 * Simple bindings might contain multiple expressions like for example: "{foo} and {bar}"
+	 * This helper aims to merge them in a template literal if it's necessary
+	 * @param   {RiotParser.Node} node - riot parser node
+	 * @param   {string} sourceFile - original tag file
+	 * @param   {string} sourceCode - original tag source code
+	 * @returns { Object } a template literal expression object
+	 */
+	function mergeNodeExpressions(node, sourceFile, sourceCode) {
+	  if (node.parts.length === 1)
+	    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+
+	  const pureStringChunks = generateLiteralStringChunksFromNode(node, sourceCode);
+	  const stringsArray = pureStringChunks.reduce((acc, str, index) => {
+	    const expr = node.expressions[index];
+
+	    return [
+	      ...acc,
+	      builders.literal(str),
+	      expr ? transformExpression(expr, sourceFile, sourceCode) : nullNode()
+	    ]
+	  }, [])
+	    // filter the empty literal expressions
+	    .filter(expr => !isLiteral(expr) || expr.value);
+
+	  return createArrayString(stringsArray)
+	}
+
+	/**
+	 * Create a text expression
+	 * @param   {RiotParser.Node.Text} sourceNode - text node to parse
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @param   {number} childNodeIndex - position of the child text node in its parent children nodes
+	 * @returns {AST.Node} object containing the expression binding keys
+	 */
+	function createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex) {
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(EXPRESSION_TYPES),
+	        builders.identifier(TEXT_EXPRESSION_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(
+	      BINDING_CHILD_NODE_INDEX_KEY,
+	      builders.literal(childNodeIndex)
+	    ),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      wrapASTInFunctionWithScope(
+	        mergeNodeExpressions(sourceNode, sourceFile, sourceCode)
+	      )
+	    )
+	  ])
+	}
+
+	function createValueExpression(sourceNode, sourceFile, sourceCode) {
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(EXPRESSION_TYPES),
+	        builders.identifier(VALUE_EXPRESSION_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+	    )
+	  ])
+	}
+
+	function createExpression(sourceNode, sourceFile, sourceCode, childNodeIndex, parentNode) {
+	  switch (true) {
+	  case isTextNode(sourceNode):
+	    return createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex)
+	  // progress nodes value attributes will be rendered as attributes
+	  // see https://github.com/riot/compiler/issues/122
+	  case isValueAttribute(sourceNode) && hasValueAttribute(parentNode.name) && !isProgressNode(parentNode):
+	    return createValueExpression(sourceNode, sourceFile, sourceCode)
+	  case isEventAttribute(sourceNode):
+	    return createEventExpression(sourceNode, sourceFile, sourceCode)
+	  default:
+	    return createAttributeExpression(sourceNode, sourceFile, sourceCode)
+	  }
+	}
+
+	/**
+	 * Create the attribute expressions
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @returns {Array} array containing all the attribute expressions
+	 */
+	function createAttributeExpressions(sourceNode, sourceFile, sourceCode) {
+	  return findDynamicAttributes(sourceNode)
+	    .map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode))
+	}
+
+	/**
+	 * Create the text node expressions
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @returns {Array} array containing all the text node expressions
+	 */
+	function createTextNodeExpressions(sourceNode, sourceFile, sourceCode) {
+	  const childrenNodes = getChildrenNodes(sourceNode);
+
+	  return childrenNodes
+	    .filter(isTextNode)
+	    .filter(hasExpressions)
+	    .map(node => createExpression(
+	      node,
+	      sourceFile,
+	      sourceCode,
+	      childrenNodes.indexOf(node),
+	      sourceNode
+	    ))
+	}
+
+	/**
+	 * Add a simple binding to a riot parser node
+	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns { AST.Node } an each binding node
+	 */
+	function createSimpleBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+	  return builders.objectExpression([
+	    ...createSelectorProperties(selectorAttribute),
+	    simplePropertyNode(
+	      BINDING_EXPRESSIONS_KEY,
+	      builders.arrayExpression([
+	        ...createTextNodeExpressions(sourceNode, sourceFile, sourceCode),
+	        ...createAttributeExpressions(sourceNode, sourceFile, sourceCode)
+	      ])
+	    )
+	  ])
+	}
+
+	/**
+	 * Transform a RiotParser.Node.Tag of type slot into a slot binding
+	 * @param   { RiotParser.Node.Tag } sourceNode - slot node
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @returns { AST.Node } a slot binding node
+	 */
+	function createSlotBinding(sourceNode, selectorAttribute) {
+	  const slotNameAttribute = findAttribute(NAME_ATTRIBUTE, sourceNode);
+	  const slotName = slotNameAttribute ? slotNameAttribute.value : DEFAULT_SLOT_NAME;
+
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(BINDING_TYPES),
+	        builders.identifier(SLOT_BINDING_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(
+	      BINDING_NAME_KEY,
+	      builders.literal(slotName)
+	    ),
+	    ...createSelectorProperties(selectorAttribute)
+	  ])
+	}
+
+	/**
+	 * Find the slots in the current component and group them under the same id
+	 * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+	 * @returns {Object} object containing all the slots grouped by name
+	 */
+	function groupSlots(sourceNode) {
+	  return getChildrenNodes(sourceNode).reduce((acc, node) => {
+	    const slotAttribute = findSlotAttribute(node);
+
+	    if (slotAttribute) {
+	      acc[slotAttribute.value] = node;
+	    } else {
+	      acc.default = createRootNode({
+	        nodes: [...getChildrenNodes(acc.default), node]
+	      });
+	    }
+
+	    return acc
+	  }, {
+	    default: null
+	  })
+	}
+
+	/**
+	 * Create the slot entity to pass to the riot-dom bindings
+	 * @param   {string} id - slot id
+	 * @param   {RiotParser.Node.Tag} sourceNode - slot root node
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @returns {AST.Node} ast node containing the slot object properties
+	 */
+	function buildSlot(id, sourceNode, sourceFile, sourceCode) {
+	  const cloneNode = {
+	    ...sourceNode,
+	    // avoid to render the slot attribute
+	    attributes: getNodeAttributes(sourceNode).filter(attribute => attribute.name !== SLOT_ATTRIBUTE)
+	  };
+	  const [html, bindings] = build(cloneNode, sourceFile, sourceCode);
+
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_ID_KEY, builders.literal(id)),
+	    simplePropertyNode(BINDING_HTML_KEY, builders.literal(html)),
+	    simplePropertyNode(BINDING_BINDINGS_KEY, builders.arrayExpression(bindings))
+	  ])
+	}
+
+	/**
+	 * Create the AST array containing the slots
+	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns {AST.ArrayExpression} array containing the attributes to bind
+	 */
+	function createSlotsArray(sourceNode, sourceFile, sourceCode) {
+	  return builders.arrayExpression([
+	    ...compose(
+	      slots => slots.map(([key, value]) => buildSlot(key, value, sourceFile, sourceCode)),
+	      slots => slots.filter(([,value]) => value),
+	      Object.entries,
+	      groupSlots
+	    )(sourceNode)
+	  ])
+	}
+
+	/**
+	 * Create the AST array containing the attributes to bind to this node
+	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns {AST.ArrayExpression} array containing the slot objects
+	 */
+	function createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+	  return builders.arrayExpression([
+	    ...compose(
+	      attributes => attributes.map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode)),
+	      attributes => getAttributesWithoutSelector(attributes, selectorAttribute), // eslint-disable-line
+	      cleanAttributes
+	    )(sourceNode)
+	  ])
+	}
+
+	/**
+	 * Find the slot attribute if it exists
+	 * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+	 * @returns {RiotParser.Node.Attr|undefined} the slot attribute found
+	 */
+	function findSlotAttribute(sourceNode) {
+	  return getNodeAttributes(sourceNode).find(attribute => attribute.name === SLOT_ATTRIBUTE)
+	}
+
+	/**
+	 * Transform a RiotParser.Node.Tag into a tag binding
+	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+	 * @param   { string } selectorAttribute - attribute needed to select the target node
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns { AST.Node } tag binding node
+	 */
+	function createTagBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+	  return builders.objectExpression([
+	    simplePropertyNode(BINDING_TYPE_KEY,
+	      builders.memberExpression(
+	        builders.identifier(BINDING_TYPES),
+	        builders.identifier(TAG_BINDING_TYPE),
+	        false
+	      ),
+	    ),
+	    simplePropertyNode(BINDING_GET_COMPONENT_KEY, builders.identifier(GET_COMPONENT_FN)),
+	    simplePropertyNode(
+	      BINDING_EVALUATE_KEY,
+	      toScopedFunction(getCustomNodeNameAsExpression(sourceNode), sourceFile, sourceCode)
+	    ),
+	    simplePropertyNode(BINDING_SLOTS_KEY, createSlotsArray(sourceNode, sourceFile, sourceCode)),
+	    simplePropertyNode(
+	      BINDING_ATTRIBUTES_KEY,
+	      createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode)
+	    ),
+	    ...createSelectorProperties(selectorAttribute)
+	  ])
+	}
+
+	const BuildingState = Object.freeze({
+	  html: [],
+	  bindings: [],
+	  parent: null
+	});
+
+	/**
+	 * Nodes having bindings should be cloned and new selector properties should be added to them
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} bindingsSelector - temporary string to identify the current node
+	 * @returns {RiotParser.Node} the original node parsed having the new binding selector attribute
+	 */
+	function createBindingsTag(sourceNode, bindingsSelector) {
+	  if (!bindingsSelector) return sourceNode
+
+	  return {
+	    ...sourceNode,
+	    // inject the selector bindings into the node attributes
+	    attributes: [{
+	      name: bindingsSelector,
+	      value: bindingsSelector
+	    }, ...getNodeAttributes(sourceNode)]
+	  }
+	}
+
+	/**
+	 * Create a generic dynamic node (text or tag) and generate its bindings
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+	 * @returns {Array} array containing the html output and bindings for the current node
+	 */
+	function createDynamicNode(sourceNode, sourceFile, sourceCode, state) {
+	  switch (true) {
+	  case isTextNode(sourceNode):
+	    // text nodes will not have any bindings
+	    return [nodeToString(sourceNode), []]
+	  default:
+	    return createTagWithBindings(sourceNode, sourceFile, sourceCode)
+	  }
+	}
+
+	/**
+	 * Create only a dynamic tag node with generating a custom selector and its bindings
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+	 * @returns {Array} array containing the html output and bindings for the current node
+	 */
+	function createTagWithBindings(sourceNode, sourceFile, sourceCode) {
+	  const bindingsSelector = isRootNode(sourceNode) ? null : createBindingSelector();
+	  const cloneNode = createBindingsTag(sourceNode, bindingsSelector);
+	  const tagOpeningHTML = nodeToString(cloneNode);
+
+	  switch(true) {
+	  // EACH bindings have prio 1
+	  case hasEachAttribute(cloneNode):
+	    return [tagOpeningHTML, [createEachBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+	  // IF bindings have prio 2
+	  case hasIfAttribute(cloneNode):
+	    return [tagOpeningHTML, [createIfBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+	  // TAG bindings have prio 3
+	  case isCustomNode(cloneNode):
+	    return [tagOpeningHTML, [createTagBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+	  // slot tag
+	  case isSlotNode(cloneNode):
+	    return [tagOpeningHTML, [createSlotBinding(cloneNode, bindingsSelector)]]
+	  // this node has expressions bound to it
+	  default:
+	    return [tagOpeningHTML, [createSimpleBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+	  }
+	}
+
+	/**
+	 * Parse a node trying to extract its template and bindings
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+	 * @returns {Array} array containing the html output and bindings for the current node
+	 */
+	function parseNode(sourceNode, sourceFile, sourceCode, state) {
+	  // static nodes have no bindings
+	  if (isStaticNode(sourceNode)) return [nodeToString(sourceNode), []]
+	  return createDynamicNode(sourceNode, sourceFile, sourceCode)
+	}
+
+	/**
+	 * Create the tag binding
+	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @param   { string } selector - binding selector
+	 * @returns { Array } array with only the tag binding AST
+	 */
+	function createNestedBindings(sourceNode, sourceFile, sourceCode, selector) {
+	  const mightBeARiotComponent = isCustomNode(sourceNode);
+
+	  return mightBeARiotComponent ? [null, [
+	    createTagBinding(
+	      cloneNodeWithoutSelectorAttribute(sourceNode, selector),
+	      null,
+	      sourceFile,
+	      sourceCode
+	    )]
+	  ] : build(createRootNode(sourceNode), sourceFile, sourceCode)
+	}
+
+	/**
+	 * Build the template and the bindings
+	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+	 * @param   {string} sourceFile - source file path
+	 * @param   {string} sourceCode - original source
+	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+	 * @returns {Array} array containing the html output and the dom bindings
+	 */
+	function build(
+	  sourceNode,
+	  sourceFile,
+	  sourceCode,
+	  state
+	) {
+	  if (!sourceNode) panic('Something went wrong with your tag DOM parsing, your tag template can\'t be created');
+
+	  const [nodeHTML, nodeBindings] = parseNode(sourceNode, sourceFile, sourceCode);
+	  const childrenNodes = getChildrenNodes(sourceNode);
+	  const currentState = { ...cloneDeep(BuildingState), ...state };
+
+	  // mutate the original arrays
+	  currentState.html.push(...nodeHTML);
+	  currentState.bindings.push(...nodeBindings);
+
+	  // do recursion if
+	  // this tag has children and it has no special directives bound to it
+	  if (childrenNodes.length && !hasItsOwnTemplate(sourceNode)) {
+	    childrenNodes.forEach(node => build(node, sourceFile, sourceCode, { parent: sourceNode, ...currentState }));
+	  }
+
+	  // close the tag if it's not a void one
+	  if (isTagNode(sourceNode) && !isVoidNode(sourceNode)) {
+	    currentState.html.push(closeTag(sourceNode));
+	  }
+
+	  return [
+	    currentState.html.join(''),
+	    currentState.bindings
+	  ]
+	}
+
+	const templateFunctionArguments = [
+	  TEMPLATE_FN,
+	  EXPRESSION_TYPES,
+	  BINDING_TYPES,
+	  GET_COMPONENT_FN
+	].map(builders.identifier);
+
+	/**
+	 * Create the content of the template function
+	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @returns {AST.BlockStatement} the content of the template function
+	 */
+	function createTemplateFunctionContent(sourceNode, sourceFile, sourceCode) {
+	  return builders.blockStatement([
+	    builders.returnStatement(
+	      callTemplateFunction(
+	        ...build(
+	          createRootNode(sourceNode),
+	          sourceFile,
+	          sourceCode
+	        )
+	      )
+	    )
+	  ])
+	}
+
+	/**
+	 * Extend the AST adding the new template property containing our template call to render the component
+	 * @param   { Object } ast - current output ast
+	 * @param   { string } sourceFile - source file path
+	 * @param   { string } sourceCode - original source
+	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+	 * @returns { Object } the output ast having the "template" key
+	 */
+	function extendTemplateProperty(ast, sourceFile, sourceCode, sourceNode) {
+	  types$1.visit(ast, {
+	    visitProperty(path) {
+	      if (path.value.key.value === TAG_TEMPLATE_PROPERTY) {
+	        path.value.value = builders.functionExpression(
+	          null,
+	          templateFunctionArguments,
+	          createTemplateFunctionContent(sourceNode, sourceFile, sourceCode)
+	        );
+
+	        return false
+	      }
+
+	      this.traverse(path);
+	    }
+	  });
+
+	  return ast
+	}
+
+	/**
+	 * Generate the component template logic
+	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+	 * @param   { string } source - original component source code
+	 * @param   { Object } meta - compilation meta information
+	 * @param   { AST } ast - current AST output
+	 * @returns { AST } the AST generated
+	 */
+	function template(sourceNode, source, meta, ast) {
+	  const { options } = meta;
+	  return  extendTemplateProperty(ast, options.file, source, sourceNode)
+	}
+
+	const DEFAULT_OPTIONS = {
+	  template: 'default',
+	  file: '[unknown-source-file]',
+	  scopedCss: true
+	};
+
+	/**
+	 * Create the initial AST
+	 * @param {string} tagName - the name of the component we have compiled
+	 * @returns { AST } the initial AST
+	 *
+	 * @example
+	 * // the output represents the following string in AST
+	 */
+	function createInitialInput({tagName}) {
+	  /*
+	  generates
+	  export default {
+	     ${TAG_CSS_PROPERTY}: null,
+	     ${TAG_LOGIC_PROPERTY}: null,
+	     ${TAG_TEMPLATE_PROPERTY}: null
+	  }
+	  */
+	  return builders.program([
+	    builders.exportDefaultDeclaration(
+	      builders.objectExpression([
+	        simplePropertyNode(TAG_CSS_PROPERTY, nullNode()),
+	        simplePropertyNode(TAG_LOGIC_PROPERTY, nullNode()),
+	        simplePropertyNode(TAG_TEMPLATE_PROPERTY, nullNode()),
+	        simplePropertyNode(TAG_NAME_PROPERTY, builders.literal(tagName))
+	      ])
+	    )]
+	  )
+	}
+
+	/**
+	 * Make sure the input sourcemap is valid otherwise we ignore it
+	 * @param   {SourceMapGenerator} map - preprocessor source map
+	 * @returns {Object} sourcemap as json or nothing
+	 */
+	function normaliseInputSourceMap(map) {
+	  const inputSourceMap = sourcemapAsJSON(map);
+	  return isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+	}
+
+	/**
+	 * Override the sourcemap content making sure it will always contain the tag source code
+	 * @param   {Object} map - sourcemap as json
+	 * @param   {string} source - component source code
+	 * @returns {Object} original source map with the "sourcesContent" property overriden
+	 */
+	function overrideSourcemapContent(map, source) {
+	  return {
+	    ...map,
+	    sourcesContent: [source]
+	  }
+	}
+
+	/**
+	 * Create the compilation meta object
+	 * @param { string } source - source code of the tag we will need to compile
+	 * @param { string } options - compiling options
+	 * @returns {Object} meta object
+	 */
+	function createMeta(source, options) {
+	  return {
+	    tagName: null,
+	    fragments: null,
+	    options: {
+	      ...DEFAULT_OPTIONS,
+	      ...options
+	    },
+	    source
+	  }
+	}
+
+	/**
+	 * Generate the output code source together with the sourcemap
+	 * @param { string } source - source code of the tag we will need to compile
+	 * @param { string } opts - compiling options
+	 * @returns { Output } object containing output code and source map
+	 */
+	function compile(source, opts = {}) {
+	  const meta = createMeta(source, opts);
+	  const {options} = meta;
+	  const { code, map } = execute$1('template', options.template, meta, source);
+	  const { template: template$1, css: css$1, javascript: javascript$1 } = parser$1(options).parse(code).output;
+
+	  // extend the meta object with the result of the parsing
+	  Object.assign(meta, {
+	    tagName: template$1.name,
+	    fragments: { template: template$1, css: css$1, javascript: javascript$1 }
+	  });
+
+	  return compose(
+	    result => ({ ...result, meta }),
+	    result => execute(result, meta),
+	    result => ({
+	      ...result,
+	      map: overrideSourcemapContent(result.map, source)
+	    }),
+	    ast => meta.ast = ast && generateJavascript(ast, {
+	      sourceMapName: `${options.file}.map`,
+	      inputSourceMap: normaliseInputSourceMap(map)
+	    }),
+	    hookGenerator(template, template$1, code, meta),
+	    hookGenerator(javascript, javascript$1, code, meta),
+	    hookGenerator(css, css$1, code, meta),
+	  )(createInitialInput(meta))
+	}
+
+	/**
+	 * Prepare the riot parser node transformers
+	 * @param   { Function } transformer - transformer function
+	 * @param   { Object } sourceNode - riot parser node
+	 * @param   { string } source - component source code
+	 * @param   { Object } meta - compilation meta information
+	 * @returns { Promise<Output> } object containing output code and source map
+	 */
+	function hookGenerator(transformer, sourceNode, source, meta) {
+	  if (
+	    // filter missing nodes
+	    !sourceNode ||
+	    // filter nodes without children
+	    (sourceNode.nodes && !sourceNode.nodes.length) ||
+	    // filter empty javascript and css nodes
+	    (!sourceNode.nodes && !sourceNode.text)) {
+	    return result => result
+	  }
+
+	  return curry(transformer)(sourceNode, source, meta)
+	}
+
+	// This function can be used to register new preprocessors
+	// a preprocessor can target either only the css or javascript nodes
+	// or the complete tag source file ('template')
+	const registerPreprocessor = register$1;
+
+	// This function can allow you to register postprocessors that will parse the output code
+	// here we can run prettifiers, eslint fixes...
+	const registerPostprocessor = register;
+
+	exports.compile = compile;
+	exports.createInitialInput = createInitialInput;
+	exports.registerPostprocessor = registerPostprocessor;
+	exports.registerPreprocessor = registerPreprocessor;
+
+	Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/@riotjs/compiler/dist/index.esm.js b/node_modules/@riotjs/compiler/dist/index.esm.js
new file mode 100644
index 0000000..fc58b59
--- /dev/null
+++ b/node_modules/@riotjs/compiler/dist/index.esm.js
@@ -0,0 +1,2157 @@
+/* Riot Compiler WIP, @license MIT */
+import { types as types$1, print, parse } from 'recast';
+import { composeSourceMaps } from 'recast/lib/util';
+import { SourceMapGenerator } from 'source-map';
+import compose from 'cumpa';
+import cssEscape from 'cssesc';
+import curry from 'curri';
+import { Parser } from 'acorn';
+import globalScope from 'globals';
+import riotParser, { nodeTypes } from '@riotjs/parser';
+import { hasValueAttribute } from 'dom-nodes';
+
+const TAG_LOGIC_PROPERTY = 'exports';
+const TAG_CSS_PROPERTY = 'css';
+const TAG_TEMPLATE_PROPERTY = 'template';
+const TAG_NAME_PROPERTY = 'name';
+
+const types = types$1;
+const builders = types$1.builders;
+const namedTypes = types$1.namedTypes;
+
+function nullNode() {
+  return builders.literal(null)
+}
+
+function simplePropertyNode(key, value) {
+  return builders.property('init', builders.literal(key), value, false)
+}
+
+/**
+ * Return a source map as JSON, it it has not the toJSON method it means it can
+ * be used right the way
+ * @param   { SourceMapGenerator|Object } map - a sourcemap generator or simply an json object
+ * @returns { Object } the source map as JSON
+ */
+function sourcemapAsJSON(map) {
+  if (map && map.toJSON) return map.toJSON()
+  return map
+}
+
+/**
+ * Detect node js environements
+ * @returns { boolean } true if the runtime is node
+ */
+function isNode() {
+  return typeof process !== 'undefined'
+}
+
+/**
+ * Compose two sourcemaps
+ * @param   { SourceMapGenerator } formerMap - original sourcemap
+ * @param   { SourceMapGenerator } latterMap - target sourcemap
+ * @returns { Object } sourcemap json
+ */
+function composeSourcemaps(formerMap, latterMap) {
+  if (
+    isNode() &&
+    formerMap && latterMap && latterMap.mappings
+  ) {
+    return composeSourceMaps(sourcemapAsJSON(formerMap), sourcemapAsJSON(latterMap))
+  } else if (isNode() && formerMap) {
+    return sourcemapAsJSON(formerMap)
+  }
+
+  return {}
+}
+
+/**
+ * Create a new sourcemap generator
+ * @param   { Object } options - sourcemap options
+ * @returns { SourceMapGenerator } SourceMapGenerator instance
+ */
+function createSourcemap(options) {
+  return new SourceMapGenerator(options)
+}
+
+const Output = Object.freeze({
+  code: '',
+  ast: [],
+  meta: {},
+  map: null
+});
+
+/**
+ * Create the right output data result of a parsing
+ * @param   { Object } data - output data
+ * @param   { string } data.code - code generated
+ * @param   { AST } data.ast - ast representing the code
+ * @param   { SourceMapGenerator } data.map - source map generated along with the code
+ * @param   { Object } meta - compilation meta infomration
+ * @returns { Output } output container object
+ */
+function createOutput(data, meta) {
+  const output = {
+    ...Output,
+    ...data,
+    meta
+  };
+
+  if (!output.map && meta && meta.options && meta.options.file)
+    return {
+      ...output,
+      map: createSourcemap({ file: meta.options.file })
+    }
+
+  return output
+}
+
+/**
+ * Transform the source code received via a compiler function
+ * @param   { Function } compiler - function needed to generate the output code
+ * @param   { Object } meta - compilation meta information
+ * @param   { string } source - source code
+ * @returns { Output } output - the result of the compiler
+ */
+function transform(compiler, meta, source) {
+  const result = (compiler ? compiler(source, meta) : { code: source });
+  return createOutput(result, meta)
+}
+
+/**
+ * Throw an error with a descriptive message
+ * @param   { string } message - error message
+ * @returns { undefined } hoppla.. at this point the program should stop working
+ */
+function panic(message) {
+  throw new Error(message)
+}
+
+const postprocessors = new Set();
+
+/**
+ * Register a postprocessor that will be used after the parsing and compilation of the riot tags
+ * @param { Function } postprocessor - transformer that will receive the output code ans sourcemap
+ * @returns { Set } the postprocessors collection
+ */
+function register(postprocessor) {
+  if (postprocessors.has(postprocessor)) {
+    panic(`This postprocessor "${postprocessor.name || postprocessor.toString()}" was already registered`);
+  }
+
+  postprocessors.add(postprocessor);
+
+  return postprocessors
+}
+
+/**
+ * Exec all the postprocessors in sequence combining the sourcemaps generated
+ * @param   { Output } compilerOutput - output generated by the compiler
+ * @param   { Object } meta - compiling meta information
+ * @returns { Output } object containing output code and source map
+ */
+function execute(compilerOutput, meta) {
+  return Array.from(postprocessors).reduce(function(acc, postprocessor) {
+    const { code, map } = acc;
+    const output = postprocessor(code, meta);
+
+    return {
+      code: output.code,
+      map: composeSourcemaps(map, output.map)
+    }
+  }, createOutput(compilerOutput, meta))
+}
+
+/**
+ * Parsers that can be registered by users to preparse components fragments
+ * @type { Object }
+ */
+const preprocessors = Object.freeze({
+  javascript: new Map(),
+  css: new Map(),
+  template: new Map().set('default', code => ({ code }))
+});
+
+// throw a processor type error
+function preprocessorTypeError(type) {
+  panic(`No preprocessor of type "${type}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`);
+}
+
+// throw an error if the preprocessor was not registered
+function preprocessorNameNotFoundError(name) {
+  panic(`No preprocessor named "${name}" was found, are you sure you have registered it?'`);
+}
+
+/**
+ * Register a custom preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Function } preprocessor - preprocessor function
+ * @returns { Map } - the preprocessors map
+ */
+function register$1(type, name, preprocessor) {
+  if (!type) panic('Please define the type of preprocessor you want to register \'javascript\', \'css\' or \'template\'');
+  if (!name) panic('Please define a name for your preprocessor');
+  if (!preprocessor) panic('Please provide a preprocessor function');
+  if (!preprocessors[type]) preprocessorTypeError(type);
+  if (preprocessors[type].has(name)) panic(`The preprocessor ${name} was already registered before`);
+
+  preprocessors[type].set(name, preprocessor);
+
+  return preprocessors
+}
+
+/**
+ * Exec the compilation of a preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Object } meta - preprocessor meta information
+ * @param   { string } source - source code
+ * @returns { Output } object containing a sourcemap and a code string
+ */
+function execute$1(type, name, meta, source) {
+  if (!preprocessors[type]) preprocessorTypeError(type);
+  if (!preprocessors[type].has(name)) preprocessorNameNotFoundError(name);
+
+  return transform(preprocessors[type].get(name), meta, source)
+}
+
+const ATTRIBUTE_TYPE_NAME = 'type';
+
+/**
+ * Get the type attribute from a node generated by the riot parser
+ * @param   { Object} sourceNode - riot parser node
+ * @returns { string|null } a valid type to identify the preprocessor to use or nothing
+ */
+function getPreprocessorTypeByAttribute(sourceNode) {
+  const typeAttribute = sourceNode.attributes ?
+    sourceNode.attributes.find(attribute => attribute.name === ATTRIBUTE_TYPE_NAME) :
+    null;
+
+  return typeAttribute ? normalize(typeAttribute.value) : null
+}
+
+
+/**
+ * Remove the noise in case a user has defined the preprocessor type='text/scss'
+ * @param   { string } value - input string
+ * @returns { string } normalized string
+ */
+function normalize(value) {
+  return value.replace('text/', '')
+}
+
+/**
+ * Preprocess a riot parser node
+ * @param   { string } preprocessorType - either css, js
+ * @param   { string } preprocessorName - preprocessor id
+ * @param   { Object } meta - compilation meta information
+ * @param   { RiotParser.nodeTypes } node - css node detected by the parser
+ * @returns { Output } code and sourcemap generated by the preprocessor
+ */
+function preprocess(preprocessorType, preprocessorName, meta, node) {
+  const code = node.text;
+
+  return (preprocessorName ?
+    execute$1(preprocessorType, preprocessorName, meta, code) :
+    { code }
+  )
+}
+
+/**
+ * Matches valid, multiline JavaScript comments in almost all its forms.
+ * @const {RegExp}
+ * @static
+ */
+const R_MLCOMMS = /\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//g;
+
+/**
+ * Source for creating regexes matching valid quoted, single-line JavaScript strings.
+ * It recognizes escape characters, including nested quotes and line continuation.
+ * @const {string}
+ */
+const S_LINESTR = /"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source;
+
+/**
+ * Matches CSS selectors, excluding those beginning with '@' and quoted strings.
+ * @const {RegExp}
+ */
+
+const CSS_SELECTOR = RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${S_LINESTR}`, 'g');
+
+/**
+ * Parses styles enclosed in a "scoped" tag
+ * The "css" string is received without comments or surrounding spaces.
+ *
+ * @param   {string} tag - Tag name of the root element
+ * @param   {string} css - The CSS code
+ * @returns {string} CSS with the styles scoped to the root element
+ */
+function scopedCSS(tag, css) {
+  const host = ':host';
+  const selectorsBlacklist = ['from', 'to'];
+
+  return css.replace(CSS_SELECTOR, function(m, p1, p2) {
+    // skip quoted strings
+    if (!p2) return m
+
+    // we have a selector list, parse each individually
+    p2 = p2.replace(/[^,]+/g, function(sel) {
+      const s = sel.trim();
+
+      // skip selectors already using the tag name
+      if (s.indexOf(tag) === 0) {
+        return sel
+      }
+
+      // skips the keywords and percents of css animations
+      if (!s || selectorsBlacklist.indexOf(s) > -1 || s.slice(-1) === '%') {
+        return sel
+      }
+
+      // replace the `:host` pseudo-selector, where it is, with the root tag name;
+      // if `:host` was not included, add the tag name as prefix, and mirror all
+      // `[data-is]`
+      if (s.indexOf(host) < 0) {
+        return `${tag} ${s},[is="${tag}"] ${s}`
+      } else {
+        return `${s.replace(host, tag)},${
+          s.replace(host, `[is="${tag}"]`)}`
+      }
+    });
+
+    // add the danling bracket char and return the processed selector list
+    return p1 ? `${p1} ${p2}` : p2
+  })
+}
+
+/**
+ * Remove comments, compact and trim whitespace
+ * @param { string } code - compiled css code
+ * @returns { string } css code normalized
+ */
+function compactCss(code) {
+  return code.replace(R_MLCOMMS, '').replace(/\s+/g, ' ').trim()
+}
+
+const escapeBackslashes = s => s.replace(/\\/g, '\\\\');
+const escapeIdentifier = identifier => escapeBackslashes(cssEscape(identifier, {
+  isIdentifier: true
+}));
+
+/**
+ * Generate the component css
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function css(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+  const { options } = meta;
+  const preprocessorOutput = preprocess('css', preprocessorName, meta, sourceNode.text);
+  const normalizedCssCode = compactCss(preprocessorOutput.code);
+  const escapedCssIdentifier = escapeIdentifier(meta.tagName);
+
+  const cssCode = (options.scopedCss ?
+    scopedCSS(escapedCssIdentifier, escapeBackslashes(normalizedCssCode)) :
+    escapeBackslashes(normalizedCssCode)
+  ).trim();
+
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_CSS_PROPERTY) {
+        path.value.value = builders.templateLiteral(
+          [builders.templateElement({ raw: cssCode, cooked: '' }, false)],
+          []
+        );
+
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the javascript from an ast source
+ * @param   {AST} ast - ast object
+ * @param   {Object} options - printer options
+ * @returns {Object} code + map
+ */
+function generateJavascript(ast, options) {
+  return print(ast, {
+    ...options,
+    tabWidth: 2,
+    quote: 'single'
+  })
+}
+
+/**
+ * True if the sourcemap has no mappings, it is empty
+ * @param   {Object}  map - sourcemap json
+ * @returns {boolean} true if empty
+ */
+function isEmptySourcemap(map) {
+  return !map || !map.mappings || !map.mappings.length
+}
+
+const LINES_RE = /\r\n?|\n/g;
+
+/**
+ * Split a string into a rows array generated from its EOL matches
+ * @param   { string } string [description]
+ * @returns { Array } array containing all the string rows
+ */
+function splitStringByEOL(string) {
+  return string.split(LINES_RE)
+}
+
+/**
+ * Get the line and the column of a source text based on its position in the string
+ * @param   { string } string - target string
+ * @param   { number } position - target position
+ * @returns { Object } object containing the source text line and column
+ */
+function getLineAndColumnByPosition(string, position) {
+  const lines = splitStringByEOL(string.slice(0, position));
+
+  return {
+    line: lines.length,
+    column: lines[lines.length - 1].length
+  }
+}
+
+/**
+ * Add the offset to the code that must be parsed in order to generate properly the sourcemaps
+ * @param {string} input - input string
+ * @param {string} source - original source code
+ * @param {RiotParser.Node} node - node that we are going to transform
+ * @return {string} the input string with the offset properly set
+ */
+function addLineOffset(input, source, node) {
+  const {column, line} = getLineAndColumnByPosition(source, node.start);
+  return `${'\n'.repeat(line - 1)}${' '.repeat(column + 1)}${input}`
+}
+
+/**
+ * Parse a js source to generate the AST
+ * @param   {string} source - javascript source
+ * @param   {Object} options - parser options
+ * @returns {AST} AST tree
+ */
+function generateAST(source, options) {
+  return parse(source, {
+    parser: {
+      parse(source, opts) {
+        return Parser.parse(source, {
+          ...opts,
+          ecmaVersion: 2020
+        })
+      }
+    },
+    ...options
+  })
+}
+
+const browserAPIs = Object.keys(globalScope.browser);
+const builtinAPIs = Object.keys(globalScope.builtin);
+
+const isIdentifier = namedTypes.Identifier.check.bind(namedTypes.Identifier);
+const isLiteral = namedTypes.Literal.check.bind(namedTypes.Literal);
+const isExpressionStatement = namedTypes.ExpressionStatement.check.bind(namedTypes.ExpressionStatement);
+const isObjectExpression = namedTypes.ObjectExpression.check.bind(namedTypes.ObjectExpression);
+const isThisExpression = namedTypes.ThisExpression.check.bind(namedTypes.ThisExpression);
+const isNewExpression = namedTypes.NewExpression.check.bind(namedTypes.NewExpression);
+const isSequenceExpression = namedTypes.SequenceExpression.check.bind(namedTypes.SequenceExpression);
+const isBinaryExpression = namedTypes.BinaryExpression.check.bind(namedTypes.BinaryExpression);
+const isExportDefaultStatement = namedTypes.ExportDefaultDeclaration.check.bind(namedTypes.ExportDefaultDeclaration);
+
+const isBrowserAPI = ({name}) => browserAPIs.includes(name);
+const isBuiltinAPI = ({name}) => builtinAPIs.includes(name);
+const isRaw = (node) => node && node.raw; // eslint-disable-line
+
+/**
+ * Find the export default statement
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Object } node containing only the code of the export default statement
+ */
+function findExportDefaultStatement(body) {
+  return body.find(isExportDefaultStatement)
+}
+
+/**
+ * Find all the code in an ast program except for the export default statements
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Array } array containing all the program code except the export default expressions
+ */
+function filterNonExportDefaultStatements(body) {
+  return body.filter(node => !isExportDefaultStatement(node))
+}
+
+/**
+ * Get the body of the AST structure
+ * @param   { Object } ast - ast object generated by recast
+ * @returns { Array } array containing the program code
+ */
+function getProgramBody(ast) {
+  return ast.body || ast.program.body
+}
+
+/**
+ * Extend the AST adding the new tag method containing our tag sourcecode
+ * @param   { Object } ast - current output ast
+ * @param   { Object } exportDefaultNode - tag export default node
+ * @returns { Object } the output ast having the "tag" key extended with the content of the export default
+ */
+function extendTagProperty(ast, exportDefaultNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_LOGIC_PROPERTY) {
+        path.value.value = exportDefaultNode.declaration;
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the component javascript logic
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function javascript(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+  const javascriptNode = addLineOffset(sourceNode.text.text, source, sourceNode);
+  const { options } = meta;
+  const preprocessorOutput = preprocess('javascript', preprocessorName, meta, {
+    ...sourceNode,
+    text: javascriptNode
+  });
+  const inputSourceMap = sourcemapAsJSON(preprocessorOutput.map);
+  const generatedAst = generateAST(preprocessorOutput.code, {
+    sourceFileName: options.file,
+    inputSourceMap: isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+  });
+  const generatedAstBody = getProgramBody(generatedAst);
+  const bodyWithoutExportDefault = filterNonExportDefaultStatements(generatedAstBody);
+  const exportDefaultNode = findExportDefaultStatement(generatedAstBody);
+  const outputBody = getProgramBody(ast);
+
+  // add to the ast the "private" javascript content of our tag script node
+  outputBody.unshift(...bodyWithoutExportDefault);
+
+  // convert the export default adding its content to the "tag" property exported
+  if (exportDefaultNode) extendTagProperty(ast, exportDefaultNode);
+
+  return ast
+}
+
+// import {IS_BOOLEAN,IS_CUSTOM,IS_RAW,IS_SPREAD,IS_VOID} from '@riotjs/parser/src/constants'
+
+const BINDING_TYPES = 'bindingTypes';
+const EACH_BINDING_TYPE = 'EACH';
+const IF_BINDING_TYPE = 'IF';
+const TAG_BINDING_TYPE = 'TAG';
+const SLOT_BINDING_TYPE = 'SLOT';
+
+
+const EXPRESSION_TYPES = 'expressionTypes';
+const ATTRIBUTE_EXPRESSION_TYPE = 'ATTRIBUTE';
+const VALUE_EXPRESSION_TYPE = 'VALUE';
+const TEXT_EXPRESSION_TYPE = 'TEXT';
+const EVENT_EXPRESSION_TYPE = 'EVENT';
+
+const TEMPLATE_FN = 'template';
+const SCOPE = 'scope';
+const GET_COMPONENT_FN = 'getComponent';
+
+// keys needed to create the DOM bindings
+const BINDING_SELECTOR_KEY = 'selector';
+const BINDING_GET_COMPONENT_KEY = 'getComponent';
+const BINDING_TEMPLATE_KEY = 'template';
+const BINDING_TYPE_KEY = 'type';
+const BINDING_REDUNDANT_ATTRIBUTE_KEY = 'redundantAttribute';
+const BINDING_CONDITION_KEY = 'condition';
+const BINDING_ITEM_NAME_KEY = 'itemName';
+const BINDING_GET_KEY_KEY = 'getKey';
+const BINDING_INDEX_NAME_KEY = 'indexName';
+const BINDING_EVALUATE_KEY = 'evaluate';
+const BINDING_NAME_KEY = 'name';
+const BINDING_SLOTS_KEY = 'slots';
+const BINDING_EXPRESSIONS_KEY = 'expressions';
+const BINDING_CHILD_NODE_INDEX_KEY = 'childNodeIndex';
+// slots keys
+const BINDING_BINDINGS_KEY = 'bindings';
+const BINDING_ID_KEY = 'id';
+const BINDING_HTML_KEY = 'html';
+const BINDING_ATTRIBUTES_KEY = 'attributes';
+
+// DOM directives
+const IF_DIRECTIVE = 'if';
+const EACH_DIRECTIVE = 'each';
+const KEY_ATTRIBUTE = 'key';
+const SLOT_ATTRIBUTE = 'slot';
+const NAME_ATTRIBUTE = 'name';
+const IS_DIRECTIVE = 'is';
+
+// Misc
+const DEFAULT_SLOT_NAME = 'default';
+const TEXT_NODE_EXPRESSION_PLACEHOLDER = '<!---->';
+const BINDING_SELECTOR_PREFIX = 'expr';
+const SLOT_TAG_NODE_NAME = 'slot';
+const PROGRESS_TAG_NODE_NAME = 'progress';
+const IS_VOID_NODE = 'isVoid';
+const IS_CUSTOM_NODE = 'isCustom';
+const IS_BOOLEAN_ATTRIBUTE = 'isBoolean';
+const IS_SPREAD_ATTRIBUTE = 'isSpread';
+
+/**
+ * True if the node has not expression set nor bindings directives
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only if it's a static node that doesn't need bindings or expressions
+ */
+function isStaticNode(node) {
+  return [
+    hasExpressions,
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode,
+    isSlotNode
+  ].every(test => !test(node))
+}
+
+/**
+ * Check if a node name is part of the browser or builtin javascript api or it belongs to the current scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns {boolean} true if it's a global api variable
+ */
+function isGlobal({ scope, node }) {
+  return Boolean(
+    isRaw(node) ||
+        isBuiltinAPI(node) ||
+        isBrowserAPI(node) ||
+        isNewExpression(node) ||
+        isNodeInScope(scope, node),
+  )
+}
+
+/**
+ * Checks if the identifier of a given node exists in a scope
+ * @param {Scope} scope - scope where to search for the identifier
+ * @param {types.Node} node - node to search for the identifier
+ * @returns {boolean} true if the node identifier is defined in the given scope
+ */
+function isNodeInScope(scope, node) {
+  const traverse = (isInScope = false) => {
+    types.visit(node, {
+      visitIdentifier(path) {
+        if (scope.lookup(getName(path.node))) {
+          isInScope = true;
+        }
+
+        this.abort();
+      }
+    });
+
+    return isInScope
+  };
+
+  return traverse()
+}
+
+/**
+ * True if the node has the isCustom attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if either it's a riot component or a custom element
+ */
+function isCustomNode(node) {
+  return !!(node[IS_CUSTOM_NODE] || hasIsAttribute(node))
+}
+
+/**
+ * True the node is <slot>
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if it's a slot node
+ */
+function isSlotNode(node) {
+  return node.name === SLOT_TAG_NODE_NAME
+}
+
+/**
+ * True if the node has the isVoid attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the node is self closing
+ */
+function isVoidNode(node) {
+  return !!node[IS_VOID_NODE]
+}
+
+/**
+ * True if the riot parser did find a tag node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the tag nodes
+ */
+function isTagNode(node) {
+  return node.type === nodeTypes.TAG
+}
+
+/**
+ * True if the riot parser did find a text node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the text nodes
+ */
+function isTextNode(node) {
+  return node.type === nodeTypes.TEXT
+}
+
+/**
+ * True if the node parsed is the root one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the root nodes
+ */
+function isRootNode(node) {
+  return node.isRoot
+}
+
+/**
+ * True if the attribute parsed is of type spread one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the attribute node is of type spread
+ */
+function isSpreadAttribute(node) {
+  return node[IS_SPREAD_ATTRIBUTE]
+}
+
+/**
+ * True if the node is an attribute and its name is "value"
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for value attribute nodes
+ */
+function isValueAttribute(node) {
+  return node.name === 'value'
+}
+
+/**
+ * True if the DOM node is a progress tag
+ * @param   {RiotParser.Node}  node - riot parser node
+ * @returns {boolean} true for the progress tags
+ */
+function isProgressNode(node) {
+  return node.name === PROGRESS_TAG_NODE_NAME
+}
+
+/**
+ * True if the node is an attribute and a DOM handler
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for dom listener attribute nodes
+ */
+const isEventAttribute = (() => {
+  const EVENT_ATTR_RE = /^on/;
+  return node => EVENT_ATTR_RE.test(node.name)
+})();
+
+/**
+ * True if the node has expressions or expression attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} ditto
+ */
+function hasExpressions(node) {
+  return !!(
+    node.expressions ||
+        // has expression attributes
+        (getNodeAttributes(node).some(attribute => hasExpressions(attribute))) ||
+        // has child text nodes with expressions
+        (node.nodes && node.nodes.some(node => isTextNode(node) && hasExpressions(node)))
+  )
+}
+
+/**
+ * True if the node is a directive having its own template
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the IF EACH and TAG bindings
+ */
+function hasItsOwnTemplate(node) {
+  return [
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode
+  ].some(test => test(node))
+}
+
+const hasIfAttribute = compose(Boolean, findIfAttribute);
+const hasEachAttribute = compose(Boolean, findEachAttribute);
+const hasIsAttribute = compose(Boolean, findIsAttribute);
+const hasKeyAttribute = compose(Boolean, findKeyAttribute);
+
+/**
+ * Find the attribute node
+ * @param   { string } name -  name of the attribute we want to find
+ * @param   { riotParser.nodeTypes.TAG } node - a tag node
+ * @returns { riotParser.nodeTypes.ATTR } attribute node
+ */
+function findAttribute(name, node) {
+  return node.attributes && node.attributes.find(attr => getName(attr) === name)
+}
+
+function findIfAttribute(node) {
+  return findAttribute(IF_DIRECTIVE, node)
+}
+
+function findEachAttribute(node) {
+  return findAttribute(EACH_DIRECTIVE, node)
+}
+
+function findKeyAttribute(node) {
+  return findAttribute(KEY_ATTRIBUTE, node)
+}
+
+function findIsAttribute(node) {
+  return findAttribute(IS_DIRECTIVE, node)
+}
+
+/**
+ * Find all the node attributes that are not expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the static attributes
+ */
+function findStaticAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => !hasExpressions(attribute))
+}
+
+/**
+ * Find all the node attributes that have expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the dynamic attributes
+ */
+function findDynamicAttributes(node) {
+  return getNodeAttributes(node).filter(hasExpressions)
+}
+
+/**
+ * Unescape the user escaped chars
+ * @param   {string} string - input string
+ * @param   {string} char - probably a '{' or anything the user want's to escape
+ * @returns {string} cleaned up string
+ */
+function unescapeChar(string, char) {
+  return string.replace(RegExp(`\\\\${char}`, 'gm'), char)
+}
+
+const scope = builders.identifier(SCOPE);
+const getName = node => node && node.name ? node.name : node;
+
+/**
+ * Replace the path scope with a member Expression
+ * @param   { types.NodePath } path - containing the current node visited
+ * @param   { types.Node } property - node we want to prefix with the scope identifier
+ * @returns {undefined} this is a void function
+ */
+function replacePathScope(path, property) {
+  path.replace(builders.memberExpression(
+    scope,
+    property,
+    false
+  ));
+}
+
+/**
+ * Change the nodes scope adding the `scope` prefix
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ * @context { types.visit }
+ */
+function updateNodeScope(path) {
+  if (!isGlobal(path)) {
+    replacePathScope(path, path.node);
+
+    return false
+  }
+
+  this.traverse(path);
+}
+
+/**
+ * Change the scope of the member expressions
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return always false because we want to check only the first node object
+ */
+function visitMemberExpression(path) {
+  if (!isGlobal(path) && !isGlobal({ node: path.node.object, scope: path.scope })) {
+    if (path.value.computed) {
+      this.traverse(path);
+    } else if (isBinaryExpression(path.node.object) || path.node.object.computed) {
+      this.traverse(path.get('object'));
+    } else if (!path.node.object.callee) {
+      replacePathScope(path, isThisExpression(path.node.object) ? path.node.property : path.node);
+    } else {
+      this.traverse(path.get('object'));
+    }
+  }
+
+  return false
+}
+
+
+/**
+ * Objects properties should be handled a bit differently from the Identifier
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ */
+function visitProperty(path) {
+  const value = path.node.value;
+
+  if (isIdentifier(value)) {
+    updateNodeScope(path.get('value'));
+  } else {
+    this.traverse(path.get('value'));
+  }
+
+  return false
+}
+
+/**
+ * The this expressions should be replaced with the scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean|undefined } return false if we want to stop the tree traversal
+ */
+function visitThisExpression(path) {
+  path.replace(scope);
+  this.traverse(path);
+}
+
+
+/**
+ * Update the scope of the global nodes
+ * @param   { Object } ast - ast program
+ * @returns { Object } the ast program with all the global nodes updated
+ */
+function updateNodesScope(ast) {
+  const ignorePath = () => false;
+
+  types.visit(ast, {
+    visitIdentifier: updateNodeScope,
+    visitMemberExpression,
+    visitProperty,
+    visitThisExpression,
+    visitClassExpression: ignorePath
+  });
+
+  return ast
+}
+
+/**
+ * Convert any expression to an AST tree
+ * @param   { Object } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } the ast generated
+ */
+function createASTFromExpression(expression, sourceFile, sourceCode) {
+  const code = sourceFile ?
+    addLineOffset(expression.text, sourceCode, expression) :
+    expression.text;
+
+  return generateAST(`(${code})`, {
+    sourceFileName: sourceFile
+  })
+}
+
+/**
+ * Create the bindings template property
+ * @param   {Array} args - arguments to pass to the template function
+ * @returns {ASTNode} a binding template key
+ */
+function createTemplateProperty(args) {
+  return simplePropertyNode(
+    BINDING_TEMPLATE_KEY,
+    args ? callTemplateFunction(...args) : nullNode()
+  )
+}
+
+/**
+ * Try to get the expression of an attribute node
+ * @param   { RiotParser.Node.Attribute } attribute - riot parser attribute node
+ * @returns { RiotParser.Node.Expression } attribute expression value
+ */
+function getAttributeExpression(attribute) {
+  return attribute.expressions ? attribute.expressions[0] : {
+    // if no expression was found try to typecast the attribute value
+    ...attribute,
+    text: attribute.value
+  }
+}
+
+/**
+ * Wrap the ast generated in a function call providing the scope argument
+ * @param   {Object} ast - function body
+ * @returns {FunctionExpresion} function having the scope argument injected
+ */
+function wrapASTInFunctionWithScope(ast) {
+  return builders.functionExpression(
+    null,
+    [scope],
+    builders.blockStatement([builders.returnStatement(
+      ast
+    )])
+  )
+}
+
+/**
+ * Convert any parser option to a valid template one
+ * @param   { RiotParser.Node.Expression } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } a FunctionExpression object
+ *
+ * @example
+ *  toScopedFunction('foo + bar') // scope.foo + scope.bar
+ *
+ * @example
+ *  toScopedFunction('foo.baz + bar') // scope.foo.baz + scope.bar
+ */
+function toScopedFunction(expression, sourceFile, sourceCode) {
+  return compose(
+    wrapASTInFunctionWithScope,
+    transformExpression,
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Transform an expression node updating its global scope
+ * @param   {RiotParser.Node.Expr} expression - riot parser expression node
+ * @param   {string} sourceFile - source file
+ * @param   {string} sourceCode - source code
+ * @returns {ASTExpression} ast expression generated from the riot parser expression node
+ */
+function transformExpression(expression, sourceFile, sourceCode) {
+  return compose(
+    getExpressionAST,
+    updateNodesScope,
+    createASTFromExpression
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Get the parsed AST expression of riot expression node
+ * @param   {AST.Program} sourceAST - raw node parsed
+ * @returns {AST.Expression} program expression output
+ */
+function getExpressionAST(sourceAST) {
+  const astBody = sourceAST.program.body;
+
+  return astBody[0] ? astBody[0].expression : astBody
+}
+
+/**
+ * Create the template call function
+ * @param   {Array|string|Node.Literal} template - template string
+ * @param   {Array<AST.Nodes>} bindings - template bindings provided as AST nodes
+ * @returns {Node.CallExpression} template call expression
+ */
+function callTemplateFunction(template, bindings) {
+  return builders.callExpression(builders.identifier(TEMPLATE_FN), [
+    template ? builders.literal(template) : nullNode(),
+    bindings ? builders.arrayExpression(bindings) : nullNode()
+  ])
+}
+
+/**
+ * Convert any DOM attribute into a valid DOM selector useful for the querySelector API
+ * @param   { string } attributeName - name of the attribute to query
+ * @returns { string } the attribute transformed to a query selector
+ */
+const attributeNameToDOMQuerySelector = attributeName => `[${attributeName}]`;
+
+/**
+ * Create the properties to query a DOM node
+ * @param   { string } attributeName - attribute name needed to identify a DOM node
+ * @returns { Array<AST.Node> } array containing the selector properties needed for the binding
+ */
+function createSelectorProperties(attributeName) {
+  return attributeName ? [
+    simplePropertyNode(BINDING_REDUNDANT_ATTRIBUTE_KEY, builders.literal(attributeName)),
+    simplePropertyNode(BINDING_SELECTOR_KEY,
+      compose(builders.literal, attributeNameToDOMQuerySelector)(attributeName)
+    )
+  ] : []
+}
+
+/**
+ * Clone the node filtering out the selector attribute from the attributes list
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {RiotParser.Node} the node with the attribute cleaned up
+ */
+function cloneNodeWithoutSelectorAttribute(node, selectorAttribute) {
+  return {
+    ...node,
+    attributes: getAttributesWithoutSelector(getNodeAttributes(node), selectorAttribute)
+  }
+}
+
+
+/**
+ * Get the node attributes without the selector one
+ * @param   {Array<RiotParser.Attr>} attributes - attributes list
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {Array<RiotParser.Attr>} filtered attributes
+ */
+function getAttributesWithoutSelector(attributes, selectorAttribute) {
+  if (selectorAttribute)
+    return attributes.filter(attribute => attribute.name !== selectorAttribute)
+
+  return attributes
+}
+
+/**
+ * Clean binding or custom attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attr>} only the attributes that are not bindings or directives
+ */
+function cleanAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => ![
+    IF_DIRECTIVE,
+    EACH_DIRECTIVE,
+    KEY_ATTRIBUTE,
+    SLOT_ATTRIBUTE,
+    IS_DIRECTIVE
+  ].includes(attribute.name))
+}
+
+/**
+ * Create a root node proxing only its nodes and attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node} root node
+ */
+function createRootNode(node) {
+  return {
+    nodes: getChildrenNodes(node),
+    isRoot: true,
+    // root nodes shuold't have directives
+    attributes: cleanAttributes(node)
+  }
+}
+
+/**
+ * Get all the child nodes of a RiotParser.Node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node>} all the child nodes found
+ */
+function getChildrenNodes(node) {
+  return node && node.nodes ? node.nodes : []
+}
+
+/**
+ * Get all the attributes of a riot parser node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attribute>} all the attributes find
+ */
+function getNodeAttributes(node) {
+  return node.attributes ? node.attributes : []
+}
+/**
+ * Get the name of a custom node transforming it into an expression node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node.Attr} the node name as expression attribute
+ */
+function getCustomNodeNameAsExpression(node) {
+  const isAttribute = findIsAttribute(node);
+  const toRawString = val => `'${val}'`;
+
+  if (isAttribute) {
+    return isAttribute.expressions ? isAttribute.expressions[0] : {
+      ...isAttribute,
+      text: toRawString(isAttribute.value)
+    }
+  }
+
+  return { ...node, text: toRawString(getName(node)) }
+}
+
+/**
+ * Convert all the node static attributes to strings
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} all the node static concatenated as string
+ */
+function staticAttributesToString(node) {
+  return findStaticAttributes(node)
+    .map(attribute => attribute[IS_BOOLEAN_ATTRIBUTE] || !attribute.value ?
+      attribute.name :
+      `${attribute.name}="${unescapeNode(attribute, 'value').value}"`
+    ).join(' ')
+}
+
+/**
+ * Make sure that node escaped chars will be unescaped
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} key - key property to unescape
+ * @returns {RiotParser.Node} node with the text property unescaped
+ */
+function unescapeNode(node, key) {
+  if (node.unescape) {
+    return {
+      ...node,
+      [key]: unescapeChar(node[key], node.unescape)
+    }
+  }
+
+  return node
+}
+
+
+/**
+ * Convert a riot parser opening node into a string
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the node as string
+ */
+function nodeToString(node) {
+  const attributes = staticAttributesToString(node);
+
+  switch(true) {
+  case isTagNode(node):
+    return `<${node.name}${attributes ? ` ${attributes}` : ''}${isVoidNode(node) ? '/' : ''}>`
+  case isTextNode(node):
+    return hasExpressions(node) ? TEXT_NODE_EXPRESSION_PLACEHOLDER : unescapeNode(node, 'text').text
+  default:
+    return ''
+  }
+}
+
+/**
+ * Close an html node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the closing tag of the html tag node passed to this function
+ */
+function closeTag(node) {
+  return node.name ? `</${node.name}>` : ''
+}
+
+/**
+ * Create a strings array with the `join` call to transform it into a string
+ * @param   {Array} stringsArray - array containing all the strings to concatenate
+ * @returns {AST.CallExpression} array with a `join` call
+ */
+function createArrayString(stringsArray) {
+  return builders.callExpression(
+    builders.memberExpression(
+      builders.arrayExpression(stringsArray),
+      builders.identifier('join'),
+      false
+    ),
+    [builders.literal('')],
+  )
+}
+
+/**
+ * Simple expression bindings might contain multiple expressions like for example: "class="{foo} red {bar}""
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Attr} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+function mergeAttributeExpressions(node, sourceFile, sourceCode) {
+  if (!node.parts || node.parts.length === 1) {
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+  }
+  const stringsArray = [
+    ...node.parts.reduce((acc, str) => {
+      const expression = node.expressions.find(e => e.text.trim() === str);
+
+      return [
+        ...acc,
+        expression ? transformExpression(expression, sourceFile, sourceCode) : builders.literal(str)
+      ]
+    }, [])
+  ].filter(expr => !isLiteral(expr) || expr.value);
+
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a selector that will be used to find the node via dom-bindings
+ * @param   {number} id - temporary variable that will be increased anytime this function will be called
+ * @returns {string} selector attribute needed to bind a riot expression
+ */
+const createBindingSelector = (function createSelector(id = 0) {
+  return () => `${BINDING_SELECTOR_PREFIX}${id++}`
+}());
+
+/**
+ * Create an attribute evaluation function
+ * @param   {RiotParser.Attr} sourceNode - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { AST.Node } an AST function expression to evaluate the attribute value
+ */
+function createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode) {
+  return hasExpressions(sourceNode) ?
+  // dynamic attribute
+    wrapASTInFunctionWithScope(mergeAttributeExpressions(sourceNode, sourceFile, sourceCode)) :
+  // static attribute
+    builders.functionExpression(
+      null,
+      [],
+      builders.blockStatement([
+        builders.returnStatement(builders.literal(sourceNode.value || true))
+      ]),
+    )
+}
+
+/**
+ * Simple clone deep function, do not use it for classes or recursive objects!
+ * @param   {*} source - possibily an object to clone
+ * @returns {*} the object we wanted to clone
+ */
+function cloneDeep(source) {
+  return JSON.parse(JSON.stringify(source))
+}
+
+const getEachItemName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[0] : expression.left;
+const getEachIndexName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[1] : null;
+const getEachValue = expression => expression.right;
+const nameToliteral = compose(builders.literal, getName);
+
+const generateEachItemNameKey = expression => simplePropertyNode(
+  BINDING_ITEM_NAME_KEY,
+  compose(nameToliteral, getEachItemName)(expression)
+);
+
+const generateEachIndexNameKey = expression => simplePropertyNode(
+  BINDING_INDEX_NAME_KEY,
+  compose(nameToliteral, getEachIndexName)(expression)
+);
+
+const generateEachEvaluateKey = (expression, eachExpression, sourceFile, sourceCode) => simplePropertyNode(
+  BINDING_EVALUATE_KEY,
+  compose(
+    e => toScopedFunction(e, sourceFile, sourceCode),
+    e => ({
+      ...eachExpression,
+      text: generateJavascript(e).code
+    }),
+    getEachValue
+  )(expression)
+);
+
+/**
+ * Get the each expression properties to create properly the template binding
+ * @param   { DomBinding.Expression } eachExpression - original each expression data
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Array } AST nodes that are needed to build an each binding
+ */
+function generateEachExpressionProperties(eachExpression, sourceFile, sourceCode) {
+  const ast = createASTFromExpression(eachExpression, sourceFile, sourceCode);
+  const body = ast.program.body;
+  const firstNode = body[0];
+
+  if (!isExpressionStatement(firstNode)) {
+    panic(`The each directives supported should be of type "ExpressionStatement",you have provided a "${firstNode.type}"`);
+  }
+
+  const { expression } = firstNode;
+
+  return [
+    generateEachItemNameKey(expression),
+    generateEachIndexNameKey(expression),
+    generateEachEvaluateKey(expression, eachExpression, sourceFile, sourceCode)
+  ]
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into an each binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+function createEachBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const [ifAttribute, eachAttribute, keyAttribute] = [
+    findIfAttribute,
+    findEachAttribute,
+    findKeyAttribute
+  ].map(f => f(sourceNode));
+  const attributeOrNull = attribute => attribute ? toScopedFunction(getAttributeExpression(attribute), sourceFile, sourceCode) : nullNode();
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(EACH_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_KEY_KEY, attributeOrNull(keyAttribute)),
+    simplePropertyNode(BINDING_CONDITION_KEY, attributeOrNull(ifAttribute)),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute)),
+    ...createSelectorProperties(selectorAttribute),
+    ...compose(generateEachExpressionProperties, getAttributeExpression)(eachAttribute)
+  ])
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into an if binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { stiring } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an if binding node
+ */
+function createIfBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const ifAttribute = findIfAttribute(sourceNode);
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(IF_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(ifAttribute.expressions[0], sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute))
+  ])
+}
+
+/**
+ * Create a simple attribute expression
+ * @param   {RiotParser.Node.Attr} sourceNode - the custom tag
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createAttributeExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(ATTRIBUTE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, isSpreadAttribute(sourceNode) ? nullNode() : builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+/**
+ * Create a simple event expression
+ * @param   {RiotParser.Node.Attr} sourceNode - attribute containing the event handlers
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createEventExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(EVENT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+/**
+ * Generate the pure immutable string chunks from a RiotParser.Node.Text
+ * @param   {RiotParser.Node.Text} node - riot parser text node
+ * @param   {string} sourceCode sourceCode - source code
+ * @returns {Array} array containing the immutable string chunks
+ */
+function generateLiteralStringChunksFromNode(node, sourceCode) {
+  return node.expressions.reduce((chunks, expression, index) => {
+    const start = index ? node.expressions[index - 1].end : node.start;
+
+    chunks.push(sourceCode.substring(start, expression.start));
+
+    // add the tail to the string
+    if (index === node.expressions.length - 1)
+      chunks.push(sourceCode.substring(expression.end, node.end));
+
+    return chunks
+  }, []).map(str => node.unescape ? unescapeChar(str, node.unescape) : str)
+}
+
+/**
+ * Simple bindings might contain multiple expressions like for example: "{foo} and {bar}"
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+function mergeNodeExpressions(node, sourceFile, sourceCode) {
+  if (node.parts.length === 1)
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+
+  const pureStringChunks = generateLiteralStringChunksFromNode(node, sourceCode);
+  const stringsArray = pureStringChunks.reduce((acc, str, index) => {
+    const expr = node.expressions[index];
+
+    return [
+      ...acc,
+      builders.literal(str),
+      expr ? transformExpression(expr, sourceFile, sourceCode) : nullNode()
+    ]
+  }, [])
+    // filter the empty literal expressions
+    .filter(expr => !isLiteral(expr) || expr.value);
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a text expression
+ * @param   {RiotParser.Node.Text} sourceNode - text node to parse
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {number} childNodeIndex - position of the child text node in its parent children nodes
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(TEXT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_CHILD_NODE_INDEX_KEY,
+      builders.literal(childNodeIndex)
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      wrapASTInFunctionWithScope(
+        mergeNodeExpressions(sourceNode, sourceFile, sourceCode)
+      )
+    )
+  ])
+}
+
+function createValueExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(VALUE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+function createExpression(sourceNode, sourceFile, sourceCode, childNodeIndex, parentNode) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    return createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex)
+  // progress nodes value attributes will be rendered as attributes
+  // see https://github.com/riot/compiler/issues/122
+  case isValueAttribute(sourceNode) && hasValueAttribute(parentNode.name) && !isProgressNode(parentNode):
+    return createValueExpression(sourceNode, sourceFile, sourceCode)
+  case isEventAttribute(sourceNode):
+    return createEventExpression(sourceNode, sourceFile, sourceCode)
+  default:
+    return createAttributeExpression(sourceNode, sourceFile, sourceCode)
+  }
+}
+
+/**
+ * Create the attribute expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the attribute expressions
+ */
+function createAttributeExpressions(sourceNode, sourceFile, sourceCode) {
+  return findDynamicAttributes(sourceNode)
+    .map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode))
+}
+
+/**
+ * Create the text node expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the text node expressions
+ */
+function createTextNodeExpressions(sourceNode, sourceFile, sourceCode) {
+  const childrenNodes = getChildrenNodes(sourceNode);
+
+  return childrenNodes
+    .filter(isTextNode)
+    .filter(hasExpressions)
+    .map(node => createExpression(
+      node,
+      sourceFile,
+      sourceCode,
+      childrenNodes.indexOf(node),
+      sourceNode
+    ))
+}
+
+/**
+ * Add a simple binding to a riot parser node
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+function createSimpleBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    ...createSelectorProperties(selectorAttribute),
+    simplePropertyNode(
+      BINDING_EXPRESSIONS_KEY,
+      builders.arrayExpression([
+        ...createTextNodeExpressions(sourceNode, sourceFile, sourceCode),
+        ...createAttributeExpressions(sourceNode, sourceFile, sourceCode)
+      ])
+    )
+  ])
+}
+
+/**
+ * Transform a RiotParser.Node.Tag of type slot into a slot binding
+ * @param   { RiotParser.Node.Tag } sourceNode - slot node
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @returns { AST.Node } a slot binding node
+ */
+function createSlotBinding(sourceNode, selectorAttribute) {
+  const slotNameAttribute = findAttribute(NAME_ATTRIBUTE, sourceNode);
+  const slotName = slotNameAttribute ? slotNameAttribute.value : DEFAULT_SLOT_NAME;
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(SLOT_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_NAME_KEY,
+      builders.literal(slotName)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
+
+/**
+ * Find the slots in the current component and group them under the same id
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {Object} object containing all the slots grouped by name
+ */
+function groupSlots(sourceNode) {
+  return getChildrenNodes(sourceNode).reduce((acc, node) => {
+    const slotAttribute = findSlotAttribute(node);
+
+    if (slotAttribute) {
+      acc[slotAttribute.value] = node;
+    } else {
+      acc.default = createRootNode({
+        nodes: [...getChildrenNodes(acc.default), node]
+      });
+    }
+
+    return acc
+  }, {
+    default: null
+  })
+}
+
+/**
+ * Create the slot entity to pass to the riot-dom bindings
+ * @param   {string} id - slot id
+ * @param   {RiotParser.Node.Tag} sourceNode - slot root node
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} ast node containing the slot object properties
+ */
+function buildSlot(id, sourceNode, sourceFile, sourceCode) {
+  const cloneNode = {
+    ...sourceNode,
+    // avoid to render the slot attribute
+    attributes: getNodeAttributes(sourceNode).filter(attribute => attribute.name !== SLOT_ATTRIBUTE)
+  };
+  const [html, bindings] = build(cloneNode, sourceFile, sourceCode);
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_ID_KEY, builders.literal(id)),
+    simplePropertyNode(BINDING_HTML_KEY, builders.literal(html)),
+    simplePropertyNode(BINDING_BINDINGS_KEY, builders.arrayExpression(bindings))
+  ])
+}
+
+/**
+ * Create the AST array containing the slots
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the attributes to bind
+ */
+function createSlotsArray(sourceNode, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      slots => slots.map(([key, value]) => buildSlot(key, value, sourceFile, sourceCode)),
+      slots => slots.filter(([,value]) => value),
+      Object.entries,
+      groupSlots
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Create the AST array containing the attributes to bind to this node
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the slot objects
+ */
+function createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      attributes => attributes.map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode)),
+      attributes => getAttributesWithoutSelector(attributes, selectorAttribute), // eslint-disable-line
+      cleanAttributes
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Find the slot attribute if it exists
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {RiotParser.Node.Attr|undefined} the slot attribute found
+ */
+function findSlotAttribute(sourceNode) {
+  return getNodeAttributes(sourceNode).find(attribute => attribute.name === SLOT_ATTRIBUTE)
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into a tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } tag binding node
+ */
+function createTagBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(TAG_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_COMPONENT_KEY, builders.identifier(GET_COMPONENT_FN)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(getCustomNodeNameAsExpression(sourceNode), sourceFile, sourceCode)
+    ),
+    simplePropertyNode(BINDING_SLOTS_KEY, createSlotsArray(sourceNode, sourceFile, sourceCode)),
+    simplePropertyNode(
+      BINDING_ATTRIBUTES_KEY,
+      createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
+
+const BuildingState = Object.freeze({
+  html: [],
+  bindings: [],
+  parent: null
+});
+
+/**
+ * Nodes having bindings should be cloned and new selector properties should be added to them
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} bindingsSelector - temporary string to identify the current node
+ * @returns {RiotParser.Node} the original node parsed having the new binding selector attribute
+ */
+function createBindingsTag(sourceNode, bindingsSelector) {
+  if (!bindingsSelector) return sourceNode
+
+  return {
+    ...sourceNode,
+    // inject the selector bindings into the node attributes
+    attributes: [{
+      name: bindingsSelector,
+      value: bindingsSelector
+    }, ...getNodeAttributes(sourceNode)]
+  }
+}
+
+/**
+ * Create a generic dynamic node (text or tag) and generate its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createDynamicNode(sourceNode, sourceFile, sourceCode, state) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    // text nodes will not have any bindings
+    return [nodeToString(sourceNode), []]
+  default:
+    return createTagWithBindings(sourceNode, sourceFile, sourceCode)
+  }
+}
+
+/**
+ * Create only a dynamic tag node with generating a custom selector and its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createTagWithBindings(sourceNode, sourceFile, sourceCode) {
+  const bindingsSelector = isRootNode(sourceNode) ? null : createBindingSelector();
+  const cloneNode = createBindingsTag(sourceNode, bindingsSelector);
+  const tagOpeningHTML = nodeToString(cloneNode);
+
+  switch(true) {
+  // EACH bindings have prio 1
+  case hasEachAttribute(cloneNode):
+    return [tagOpeningHTML, [createEachBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // IF bindings have prio 2
+  case hasIfAttribute(cloneNode):
+    return [tagOpeningHTML, [createIfBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // TAG bindings have prio 3
+  case isCustomNode(cloneNode):
+    return [tagOpeningHTML, [createTagBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // slot tag
+  case isSlotNode(cloneNode):
+    return [tagOpeningHTML, [createSlotBinding(cloneNode, bindingsSelector)]]
+  // this node has expressions bound to it
+  default:
+    return [tagOpeningHTML, [createSimpleBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  }
+}
+
+/**
+ * Parse a node trying to extract its template and bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function parseNode(sourceNode, sourceFile, sourceCode, state) {
+  // static nodes have no bindings
+  if (isStaticNode(sourceNode)) return [nodeToString(sourceNode), []]
+  return createDynamicNode(sourceNode, sourceFile, sourceCode)
+}
+
+/**
+ * Create the tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { string } selector - binding selector
+ * @returns { Array } array with only the tag binding AST
+ */
+function createNestedBindings(sourceNode, sourceFile, sourceCode, selector) {
+  const mightBeARiotComponent = isCustomNode(sourceNode);
+
+  return mightBeARiotComponent ? [null, [
+    createTagBinding(
+      cloneNodeWithoutSelectorAttribute(sourceNode, selector),
+      null,
+      sourceFile,
+      sourceCode
+    )]
+  ] : build(createRootNode(sourceNode), sourceFile, sourceCode)
+}
+
+/**
+ * Build the template and the bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and the dom bindings
+ */
+function build(
+  sourceNode,
+  sourceFile,
+  sourceCode,
+  state
+) {
+  if (!sourceNode) panic('Something went wrong with your tag DOM parsing, your tag template can\'t be created');
+
+  const [nodeHTML, nodeBindings] = parseNode(sourceNode, sourceFile, sourceCode);
+  const childrenNodes = getChildrenNodes(sourceNode);
+  const currentState = { ...cloneDeep(BuildingState), ...state };
+
+  // mutate the original arrays
+  currentState.html.push(...nodeHTML);
+  currentState.bindings.push(...nodeBindings);
+
+  // do recursion if
+  // this tag has children and it has no special directives bound to it
+  if (childrenNodes.length && !hasItsOwnTemplate(sourceNode)) {
+    childrenNodes.forEach(node => build(node, sourceFile, sourceCode, { parent: sourceNode, ...currentState }));
+  }
+
+  // close the tag if it's not a void one
+  if (isTagNode(sourceNode) && !isVoidNode(sourceNode)) {
+    currentState.html.push(closeTag(sourceNode));
+  }
+
+  return [
+    currentState.html.join(''),
+    currentState.bindings
+  ]
+}
+
+const templateFunctionArguments = [
+  TEMPLATE_FN,
+  EXPRESSION_TYPES,
+  BINDING_TYPES,
+  GET_COMPONENT_FN
+].map(builders.identifier);
+
+/**
+ * Create the content of the template function
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.BlockStatement} the content of the template function
+ */
+function createTemplateFunctionContent(sourceNode, sourceFile, sourceCode) {
+  return builders.blockStatement([
+    builders.returnStatement(
+      callTemplateFunction(
+        ...build(
+          createRootNode(sourceNode),
+          sourceFile,
+          sourceCode
+        )
+      )
+    )
+  ])
+}
+
+/**
+ * Extend the AST adding the new template property containing our template call to render the component
+ * @param   { Object } ast - current output ast
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @returns { Object } the output ast having the "template" key
+ */
+function extendTemplateProperty(ast, sourceFile, sourceCode, sourceNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_TEMPLATE_PROPERTY) {
+        path.value.value = builders.functionExpression(
+          null,
+          templateFunctionArguments,
+          createTemplateFunctionContent(sourceNode, sourceFile, sourceCode)
+        );
+
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the component template logic
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function template(sourceNode, source, meta, ast) {
+  const { options } = meta;
+  return  extendTemplateProperty(ast, options.file, source, sourceNode)
+}
+
+const DEFAULT_OPTIONS = {
+  template: 'default',
+  file: '[unknown-source-file]',
+  scopedCss: true
+};
+
+/**
+ * Create the initial AST
+ * @param {string} tagName - the name of the component we have compiled
+ * @returns { AST } the initial AST
+ *
+ * @example
+ * // the output represents the following string in AST
+ */
+function createInitialInput({tagName}) {
+  /*
+  generates
+  export default {
+     ${TAG_CSS_PROPERTY}: null,
+     ${TAG_LOGIC_PROPERTY}: null,
+     ${TAG_TEMPLATE_PROPERTY}: null
+  }
+  */
+  return builders.program([
+    builders.exportDefaultDeclaration(
+      builders.objectExpression([
+        simplePropertyNode(TAG_CSS_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_LOGIC_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_TEMPLATE_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_NAME_PROPERTY, builders.literal(tagName))
+      ])
+    )]
+  )
+}
+
+/**
+ * Make sure the input sourcemap is valid otherwise we ignore it
+ * @param   {SourceMapGenerator} map - preprocessor source map
+ * @returns {Object} sourcemap as json or nothing
+ */
+function normaliseInputSourceMap(map) {
+  const inputSourceMap = sourcemapAsJSON(map);
+  return isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+}
+
+/**
+ * Override the sourcemap content making sure it will always contain the tag source code
+ * @param   {Object} map - sourcemap as json
+ * @param   {string} source - component source code
+ * @returns {Object} original source map with the "sourcesContent" property overriden
+ */
+function overrideSourcemapContent(map, source) {
+  return {
+    ...map,
+    sourcesContent: [source]
+  }
+}
+
+/**
+ * Create the compilation meta object
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } options - compiling options
+ * @returns {Object} meta object
+ */
+function createMeta(source, options) {
+  return {
+    tagName: null,
+    fragments: null,
+    options: {
+      ...DEFAULT_OPTIONS,
+      ...options
+    },
+    source
+  }
+}
+
+/**
+ * Generate the output code source together with the sourcemap
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } opts - compiling options
+ * @returns { Output } object containing output code and source map
+ */
+function compile(source, opts = {}) {
+  const meta = createMeta(source, opts);
+  const {options} = meta;
+  const { code, map } = execute$1('template', options.template, meta, source);
+  const { template: template$1, css: css$1, javascript: javascript$1 } = riotParser(options).parse(code).output;
+
+  // extend the meta object with the result of the parsing
+  Object.assign(meta, {
+    tagName: template$1.name,
+    fragments: { template: template$1, css: css$1, javascript: javascript$1 }
+  });
+
+  return compose(
+    result => ({ ...result, meta }),
+    result => execute(result, meta),
+    result => ({
+      ...result,
+      map: overrideSourcemapContent(result.map, source)
+    }),
+    ast => meta.ast = ast && generateJavascript(ast, {
+      sourceMapName: `${options.file}.map`,
+      inputSourceMap: normaliseInputSourceMap(map)
+    }),
+    hookGenerator(template, template$1, code, meta),
+    hookGenerator(javascript, javascript$1, code, meta),
+    hookGenerator(css, css$1, code, meta),
+  )(createInitialInput(meta))
+}
+
+/**
+ * Prepare the riot parser node transformers
+ * @param   { Function } transformer - transformer function
+ * @param   { Object } sourceNode - riot parser node
+ * @param   { string } source - component source code
+ * @param   { Object } meta - compilation meta information
+ * @returns { Promise<Output> } object containing output code and source map
+ */
+function hookGenerator(transformer, sourceNode, source, meta) {
+  if (
+    // filter missing nodes
+    !sourceNode ||
+    // filter nodes without children
+    (sourceNode.nodes && !sourceNode.nodes.length) ||
+    // filter empty javascript and css nodes
+    (!sourceNode.nodes && !sourceNode.text)) {
+    return result => result
+  }
+
+  return curry(transformer)(sourceNode, source, meta)
+}
+
+// This function can be used to register new preprocessors
+// a preprocessor can target either only the css or javascript nodes
+// or the complete tag source file ('template')
+const registerPreprocessor = register$1;
+
+// This function can allow you to register postprocessors that will parse the output code
+// here we can run prettifiers, eslint fixes...
+const registerPostprocessor = register;
+
+export { compile, createInitialInput, registerPostprocessor, registerPreprocessor };
diff --git a/node_modules/@riotjs/compiler/dist/index.js b/node_modules/@riotjs/compiler/dist/index.js
new file mode 100644
index 0000000..12bcdbd
--- /dev/null
+++ b/node_modules/@riotjs/compiler/dist/index.js
@@ -0,0 +1,2167 @@
+/* Riot Compiler WIP, @license MIT */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
+
+var recast = require('recast');
+var util = require('recast/lib/util');
+var sourceMap = require('source-map');
+var compose = _interopDefault(require('cumpa'));
+var cssEscape = _interopDefault(require('cssesc'));
+var curry = _interopDefault(require('curri'));
+var acorn = require('acorn');
+var globalScope = _interopDefault(require('globals'));
+var riotParser = require('@riotjs/parser');
+var riotParser__default = _interopDefault(riotParser);
+var domNodes = require('dom-nodes');
+
+const TAG_LOGIC_PROPERTY = 'exports';
+const TAG_CSS_PROPERTY = 'css';
+const TAG_TEMPLATE_PROPERTY = 'template';
+const TAG_NAME_PROPERTY = 'name';
+
+const types = recast.types;
+const builders = recast.types.builders;
+const namedTypes = recast.types.namedTypes;
+
+function nullNode() {
+  return builders.literal(null)
+}
+
+function simplePropertyNode(key, value) {
+  return builders.property('init', builders.literal(key), value, false)
+}
+
+/**
+ * Return a source map as JSON, it it has not the toJSON method it means it can
+ * be used right the way
+ * @param   { SourceMapGenerator|Object } map - a sourcemap generator or simply an json object
+ * @returns { Object } the source map as JSON
+ */
+function sourcemapAsJSON(map) {
+  if (map && map.toJSON) return map.toJSON()
+  return map
+}
+
+/**
+ * Detect node js environements
+ * @returns { boolean } true if the runtime is node
+ */
+function isNode() {
+  return typeof process !== 'undefined'
+}
+
+/**
+ * Compose two sourcemaps
+ * @param   { SourceMapGenerator } formerMap - original sourcemap
+ * @param   { SourceMapGenerator } latterMap - target sourcemap
+ * @returns { Object } sourcemap json
+ */
+function composeSourcemaps(formerMap, latterMap) {
+  if (
+    isNode() &&
+    formerMap && latterMap && latterMap.mappings
+  ) {
+    return util.composeSourceMaps(sourcemapAsJSON(formerMap), sourcemapAsJSON(latterMap))
+  } else if (isNode() && formerMap) {
+    return sourcemapAsJSON(formerMap)
+  }
+
+  return {}
+}
+
+/**
+ * Create a new sourcemap generator
+ * @param   { Object } options - sourcemap options
+ * @returns { SourceMapGenerator } SourceMapGenerator instance
+ */
+function createSourcemap(options) {
+  return new sourceMap.SourceMapGenerator(options)
+}
+
+const Output = Object.freeze({
+  code: '',
+  ast: [],
+  meta: {},
+  map: null
+});
+
+/**
+ * Create the right output data result of a parsing
+ * @param   { Object } data - output data
+ * @param   { string } data.code - code generated
+ * @param   { AST } data.ast - ast representing the code
+ * @param   { SourceMapGenerator } data.map - source map generated along with the code
+ * @param   { Object } meta - compilation meta infomration
+ * @returns { Output } output container object
+ */
+function createOutput(data, meta) {
+  const output = {
+    ...Output,
+    ...data,
+    meta
+  };
+
+  if (!output.map && meta && meta.options && meta.options.file)
+    return {
+      ...output,
+      map: createSourcemap({ file: meta.options.file })
+    }
+
+  return output
+}
+
+/**
+ * Transform the source code received via a compiler function
+ * @param   { Function } compiler - function needed to generate the output code
+ * @param   { Object } meta - compilation meta information
+ * @param   { string } source - source code
+ * @returns { Output } output - the result of the compiler
+ */
+function transform(compiler, meta, source) {
+  const result = (compiler ? compiler(source, meta) : { code: source });
+  return createOutput(result, meta)
+}
+
+/**
+ * Throw an error with a descriptive message
+ * @param   { string } message - error message
+ * @returns { undefined } hoppla.. at this point the program should stop working
+ */
+function panic(message) {
+  throw new Error(message)
+}
+
+const postprocessors = new Set();
+
+/**
+ * Register a postprocessor that will be used after the parsing and compilation of the riot tags
+ * @param { Function } postprocessor - transformer that will receive the output code ans sourcemap
+ * @returns { Set } the postprocessors collection
+ */
+function register(postprocessor) {
+  if (postprocessors.has(postprocessor)) {
+    panic(`This postprocessor "${postprocessor.name || postprocessor.toString()}" was already registered`);
+  }
+
+  postprocessors.add(postprocessor);
+
+  return postprocessors
+}
+
+/**
+ * Exec all the postprocessors in sequence combining the sourcemaps generated
+ * @param   { Output } compilerOutput - output generated by the compiler
+ * @param   { Object } meta - compiling meta information
+ * @returns { Output } object containing output code and source map
+ */
+function execute(compilerOutput, meta) {
+  return Array.from(postprocessors).reduce(function(acc, postprocessor) {
+    const { code, map } = acc;
+    const output = postprocessor(code, meta);
+
+    return {
+      code: output.code,
+      map: composeSourcemaps(map, output.map)
+    }
+  }, createOutput(compilerOutput, meta))
+}
+
+/**
+ * Parsers that can be registered by users to preparse components fragments
+ * @type { Object }
+ */
+const preprocessors = Object.freeze({
+  javascript: new Map(),
+  css: new Map(),
+  template: new Map().set('default', code => ({ code }))
+});
+
+// throw a processor type error
+function preprocessorTypeError(type) {
+  panic(`No preprocessor of type "${type}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`);
+}
+
+// throw an error if the preprocessor was not registered
+function preprocessorNameNotFoundError(name) {
+  panic(`No preprocessor named "${name}" was found, are you sure you have registered it?'`);
+}
+
+/**
+ * Register a custom preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Function } preprocessor - preprocessor function
+ * @returns { Map } - the preprocessors map
+ */
+function register$1(type, name, preprocessor) {
+  if (!type) panic('Please define the type of preprocessor you want to register \'javascript\', \'css\' or \'template\'');
+  if (!name) panic('Please define a name for your preprocessor');
+  if (!preprocessor) panic('Please provide a preprocessor function');
+  if (!preprocessors[type]) preprocessorTypeError(type);
+  if (preprocessors[type].has(name)) panic(`The preprocessor ${name} was already registered before`);
+
+  preprocessors[type].set(name, preprocessor);
+
+  return preprocessors
+}
+
+/**
+ * Exec the compilation of a preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Object } meta - preprocessor meta information
+ * @param   { string } source - source code
+ * @returns { Output } object containing a sourcemap and a code string
+ */
+function execute$1(type, name, meta, source) {
+  if (!preprocessors[type]) preprocessorTypeError(type);
+  if (!preprocessors[type].has(name)) preprocessorNameNotFoundError(name);
+
+  return transform(preprocessors[type].get(name), meta, source)
+}
+
+const ATTRIBUTE_TYPE_NAME = 'type';
+
+/**
+ * Get the type attribute from a node generated by the riot parser
+ * @param   { Object} sourceNode - riot parser node
+ * @returns { string|null } a valid type to identify the preprocessor to use or nothing
+ */
+function getPreprocessorTypeByAttribute(sourceNode) {
+  const typeAttribute = sourceNode.attributes ?
+    sourceNode.attributes.find(attribute => attribute.name === ATTRIBUTE_TYPE_NAME) :
+    null;
+
+  return typeAttribute ? normalize(typeAttribute.value) : null
+}
+
+
+/**
+ * Remove the noise in case a user has defined the preprocessor type='text/scss'
+ * @param   { string } value - input string
+ * @returns { string } normalized string
+ */
+function normalize(value) {
+  return value.replace('text/', '')
+}
+
+/**
+ * Preprocess a riot parser node
+ * @param   { string } preprocessorType - either css, js
+ * @param   { string } preprocessorName - preprocessor id
+ * @param   { Object } meta - compilation meta information
+ * @param   { RiotParser.nodeTypes } node - css node detected by the parser
+ * @returns { Output } code and sourcemap generated by the preprocessor
+ */
+function preprocess(preprocessorType, preprocessorName, meta, node) {
+  const code = node.text;
+
+  return (preprocessorName ?
+    execute$1(preprocessorType, preprocessorName, meta, code) :
+    { code }
+  )
+}
+
+/**
+ * Matches valid, multiline JavaScript comments in almost all its forms.
+ * @const {RegExp}
+ * @static
+ */
+const R_MLCOMMS = /\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//g;
+
+/**
+ * Source for creating regexes matching valid quoted, single-line JavaScript strings.
+ * It recognizes escape characters, including nested quotes and line continuation.
+ * @const {string}
+ */
+const S_LINESTR = /"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source;
+
+/**
+ * Matches CSS selectors, excluding those beginning with '@' and quoted strings.
+ * @const {RegExp}
+ */
+
+const CSS_SELECTOR = RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${S_LINESTR}`, 'g');
+
+/**
+ * Parses styles enclosed in a "scoped" tag
+ * The "css" string is received without comments or surrounding spaces.
+ *
+ * @param   {string} tag - Tag name of the root element
+ * @param   {string} css - The CSS code
+ * @returns {string} CSS with the styles scoped to the root element
+ */
+function scopedCSS(tag, css) {
+  const host = ':host';
+  const selectorsBlacklist = ['from', 'to'];
+
+  return css.replace(CSS_SELECTOR, function(m, p1, p2) {
+    // skip quoted strings
+    if (!p2) return m
+
+    // we have a selector list, parse each individually
+    p2 = p2.replace(/[^,]+/g, function(sel) {
+      const s = sel.trim();
+
+      // skip selectors already using the tag name
+      if (s.indexOf(tag) === 0) {
+        return sel
+      }
+
+      // skips the keywords and percents of css animations
+      if (!s || selectorsBlacklist.indexOf(s) > -1 || s.slice(-1) === '%') {
+        return sel
+      }
+
+      // replace the `:host` pseudo-selector, where it is, with the root tag name;
+      // if `:host` was not included, add the tag name as prefix, and mirror all
+      // `[data-is]`
+      if (s.indexOf(host) < 0) {
+        return `${tag} ${s},[is="${tag}"] ${s}`
+      } else {
+        return `${s.replace(host, tag)},${
+          s.replace(host, `[is="${tag}"]`)}`
+      }
+    });
+
+    // add the danling bracket char and return the processed selector list
+    return p1 ? `${p1} ${p2}` : p2
+  })
+}
+
+/**
+ * Remove comments, compact and trim whitespace
+ * @param { string } code - compiled css code
+ * @returns { string } css code normalized
+ */
+function compactCss(code) {
+  return code.replace(R_MLCOMMS, '').replace(/\s+/g, ' ').trim()
+}
+
+const escapeBackslashes = s => s.replace(/\\/g, '\\\\');
+const escapeIdentifier = identifier => escapeBackslashes(cssEscape(identifier, {
+  isIdentifier: true
+}));
+
+/**
+ * Generate the component css
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function css(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+  const { options } = meta;
+  const preprocessorOutput = preprocess('css', preprocessorName, meta, sourceNode.text);
+  const normalizedCssCode = compactCss(preprocessorOutput.code);
+  const escapedCssIdentifier = escapeIdentifier(meta.tagName);
+
+  const cssCode = (options.scopedCss ?
+    scopedCSS(escapedCssIdentifier, escapeBackslashes(normalizedCssCode)) :
+    escapeBackslashes(normalizedCssCode)
+  ).trim();
+
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_CSS_PROPERTY) {
+        path.value.value = builders.templateLiteral(
+          [builders.templateElement({ raw: cssCode, cooked: '' }, false)],
+          []
+        );
+
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the javascript from an ast source
+ * @param   {AST} ast - ast object
+ * @param   {Object} options - printer options
+ * @returns {Object} code + map
+ */
+function generateJavascript(ast, options) {
+  return recast.print(ast, {
+    ...options,
+    tabWidth: 2,
+    quote: 'single'
+  })
+}
+
+/**
+ * True if the sourcemap has no mappings, it is empty
+ * @param   {Object}  map - sourcemap json
+ * @returns {boolean} true if empty
+ */
+function isEmptySourcemap(map) {
+  return !map || !map.mappings || !map.mappings.length
+}
+
+const LINES_RE = /\r\n?|\n/g;
+
+/**
+ * Split a string into a rows array generated from its EOL matches
+ * @param   { string } string [description]
+ * @returns { Array } array containing all the string rows
+ */
+function splitStringByEOL(string) {
+  return string.split(LINES_RE)
+}
+
+/**
+ * Get the line and the column of a source text based on its position in the string
+ * @param   { string } string - target string
+ * @param   { number } position - target position
+ * @returns { Object } object containing the source text line and column
+ */
+function getLineAndColumnByPosition(string, position) {
+  const lines = splitStringByEOL(string.slice(0, position));
+
+  return {
+    line: lines.length,
+    column: lines[lines.length - 1].length
+  }
+}
+
+/**
+ * Add the offset to the code that must be parsed in order to generate properly the sourcemaps
+ * @param {string} input - input string
+ * @param {string} source - original source code
+ * @param {RiotParser.Node} node - node that we are going to transform
+ * @return {string} the input string with the offset properly set
+ */
+function addLineOffset(input, source, node) {
+  const {column, line} = getLineAndColumnByPosition(source, node.start);
+  return `${'\n'.repeat(line - 1)}${' '.repeat(column + 1)}${input}`
+}
+
+/**
+ * Parse a js source to generate the AST
+ * @param   {string} source - javascript source
+ * @param   {Object} options - parser options
+ * @returns {AST} AST tree
+ */
+function generateAST(source, options) {
+  return recast.parse(source, {
+    parser: {
+      parse(source, opts) {
+        return acorn.Parser.parse(source, {
+          ...opts,
+          ecmaVersion: 2020
+        })
+      }
+    },
+    ...options
+  })
+}
+
+const browserAPIs = Object.keys(globalScope.browser);
+const builtinAPIs = Object.keys(globalScope.builtin);
+
+const isIdentifier = namedTypes.Identifier.check.bind(namedTypes.Identifier);
+const isLiteral = namedTypes.Literal.check.bind(namedTypes.Literal);
+const isExpressionStatement = namedTypes.ExpressionStatement.check.bind(namedTypes.ExpressionStatement);
+const isObjectExpression = namedTypes.ObjectExpression.check.bind(namedTypes.ObjectExpression);
+const isThisExpression = namedTypes.ThisExpression.check.bind(namedTypes.ThisExpression);
+const isNewExpression = namedTypes.NewExpression.check.bind(namedTypes.NewExpression);
+const isSequenceExpression = namedTypes.SequenceExpression.check.bind(namedTypes.SequenceExpression);
+const isBinaryExpression = namedTypes.BinaryExpression.check.bind(namedTypes.BinaryExpression);
+const isExportDefaultStatement = namedTypes.ExportDefaultDeclaration.check.bind(namedTypes.ExportDefaultDeclaration);
+
+const isBrowserAPI = ({name}) => browserAPIs.includes(name);
+const isBuiltinAPI = ({name}) => builtinAPIs.includes(name);
+const isRaw = (node) => node && node.raw; // eslint-disable-line
+
+/**
+ * Find the export default statement
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Object } node containing only the code of the export default statement
+ */
+function findExportDefaultStatement(body) {
+  return body.find(isExportDefaultStatement)
+}
+
+/**
+ * Find all the code in an ast program except for the export default statements
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Array } array containing all the program code except the export default expressions
+ */
+function filterNonExportDefaultStatements(body) {
+  return body.filter(node => !isExportDefaultStatement(node))
+}
+
+/**
+ * Get the body of the AST structure
+ * @param   { Object } ast - ast object generated by recast
+ * @returns { Array } array containing the program code
+ */
+function getProgramBody(ast) {
+  return ast.body || ast.program.body
+}
+
+/**
+ * Extend the AST adding the new tag method containing our tag sourcecode
+ * @param   { Object } ast - current output ast
+ * @param   { Object } exportDefaultNode - tag export default node
+ * @returns { Object } the output ast having the "tag" key extended with the content of the export default
+ */
+function extendTagProperty(ast, exportDefaultNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_LOGIC_PROPERTY) {
+        path.value.value = exportDefaultNode.declaration;
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the component javascript logic
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function javascript(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode);
+  const javascriptNode = addLineOffset(sourceNode.text.text, source, sourceNode);
+  const { options } = meta;
+  const preprocessorOutput = preprocess('javascript', preprocessorName, meta, {
+    ...sourceNode,
+    text: javascriptNode
+  });
+  const inputSourceMap = sourcemapAsJSON(preprocessorOutput.map);
+  const generatedAst = generateAST(preprocessorOutput.code, {
+    sourceFileName: options.file,
+    inputSourceMap: isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+  });
+  const generatedAstBody = getProgramBody(generatedAst);
+  const bodyWithoutExportDefault = filterNonExportDefaultStatements(generatedAstBody);
+  const exportDefaultNode = findExportDefaultStatement(generatedAstBody);
+  const outputBody = getProgramBody(ast);
+
+  // add to the ast the "private" javascript content of our tag script node
+  outputBody.unshift(...bodyWithoutExportDefault);
+
+  // convert the export default adding its content to the "tag" property exported
+  if (exportDefaultNode) extendTagProperty(ast, exportDefaultNode);
+
+  return ast
+}
+
+// import {IS_BOOLEAN,IS_CUSTOM,IS_RAW,IS_SPREAD,IS_VOID} from '@riotjs/parser/src/constants'
+
+const BINDING_TYPES = 'bindingTypes';
+const EACH_BINDING_TYPE = 'EACH';
+const IF_BINDING_TYPE = 'IF';
+const TAG_BINDING_TYPE = 'TAG';
+const SLOT_BINDING_TYPE = 'SLOT';
+
+
+const EXPRESSION_TYPES = 'expressionTypes';
+const ATTRIBUTE_EXPRESSION_TYPE = 'ATTRIBUTE';
+const VALUE_EXPRESSION_TYPE = 'VALUE';
+const TEXT_EXPRESSION_TYPE = 'TEXT';
+const EVENT_EXPRESSION_TYPE = 'EVENT';
+
+const TEMPLATE_FN = 'template';
+const SCOPE = 'scope';
+const GET_COMPONENT_FN = 'getComponent';
+
+// keys needed to create the DOM bindings
+const BINDING_SELECTOR_KEY = 'selector';
+const BINDING_GET_COMPONENT_KEY = 'getComponent';
+const BINDING_TEMPLATE_KEY = 'template';
+const BINDING_TYPE_KEY = 'type';
+const BINDING_REDUNDANT_ATTRIBUTE_KEY = 'redundantAttribute';
+const BINDING_CONDITION_KEY = 'condition';
+const BINDING_ITEM_NAME_KEY = 'itemName';
+const BINDING_GET_KEY_KEY = 'getKey';
+const BINDING_INDEX_NAME_KEY = 'indexName';
+const BINDING_EVALUATE_KEY = 'evaluate';
+const BINDING_NAME_KEY = 'name';
+const BINDING_SLOTS_KEY = 'slots';
+const BINDING_EXPRESSIONS_KEY = 'expressions';
+const BINDING_CHILD_NODE_INDEX_KEY = 'childNodeIndex';
+// slots keys
+const BINDING_BINDINGS_KEY = 'bindings';
+const BINDING_ID_KEY = 'id';
+const BINDING_HTML_KEY = 'html';
+const BINDING_ATTRIBUTES_KEY = 'attributes';
+
+// DOM directives
+const IF_DIRECTIVE = 'if';
+const EACH_DIRECTIVE = 'each';
+const KEY_ATTRIBUTE = 'key';
+const SLOT_ATTRIBUTE = 'slot';
+const NAME_ATTRIBUTE = 'name';
+const IS_DIRECTIVE = 'is';
+
+// Misc
+const DEFAULT_SLOT_NAME = 'default';
+const TEXT_NODE_EXPRESSION_PLACEHOLDER = '<!---->';
+const BINDING_SELECTOR_PREFIX = 'expr';
+const SLOT_TAG_NODE_NAME = 'slot';
+const PROGRESS_TAG_NODE_NAME = 'progress';
+const IS_VOID_NODE = 'isVoid';
+const IS_CUSTOM_NODE = 'isCustom';
+const IS_BOOLEAN_ATTRIBUTE = 'isBoolean';
+const IS_SPREAD_ATTRIBUTE = 'isSpread';
+
+/**
+ * True if the node has not expression set nor bindings directives
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only if it's a static node that doesn't need bindings or expressions
+ */
+function isStaticNode(node) {
+  return [
+    hasExpressions,
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode,
+    isSlotNode
+  ].every(test => !test(node))
+}
+
+/**
+ * Check if a node name is part of the browser or builtin javascript api or it belongs to the current scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns {boolean} true if it's a global api variable
+ */
+function isGlobal({ scope, node }) {
+  return Boolean(
+    isRaw(node) ||
+        isBuiltinAPI(node) ||
+        isBrowserAPI(node) ||
+        isNewExpression(node) ||
+        isNodeInScope(scope, node),
+  )
+}
+
+/**
+ * Checks if the identifier of a given node exists in a scope
+ * @param {Scope} scope - scope where to search for the identifier
+ * @param {types.Node} node - node to search for the identifier
+ * @returns {boolean} true if the node identifier is defined in the given scope
+ */
+function isNodeInScope(scope, node) {
+  const traverse = (isInScope = false) => {
+    types.visit(node, {
+      visitIdentifier(path) {
+        if (scope.lookup(getName(path.node))) {
+          isInScope = true;
+        }
+
+        this.abort();
+      }
+    });
+
+    return isInScope
+  };
+
+  return traverse()
+}
+
+/**
+ * True if the node has the isCustom attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if either it's a riot component or a custom element
+ */
+function isCustomNode(node) {
+  return !!(node[IS_CUSTOM_NODE] || hasIsAttribute(node))
+}
+
+/**
+ * True the node is <slot>
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if it's a slot node
+ */
+function isSlotNode(node) {
+  return node.name === SLOT_TAG_NODE_NAME
+}
+
+/**
+ * True if the node has the isVoid attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the node is self closing
+ */
+function isVoidNode(node) {
+  return !!node[IS_VOID_NODE]
+}
+
+/**
+ * True if the riot parser did find a tag node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the tag nodes
+ */
+function isTagNode(node) {
+  return node.type === riotParser.nodeTypes.TAG
+}
+
+/**
+ * True if the riot parser did find a text node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the text nodes
+ */
+function isTextNode(node) {
+  return node.type === riotParser.nodeTypes.TEXT
+}
+
+/**
+ * True if the node parsed is the root one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the root nodes
+ */
+function isRootNode(node) {
+  return node.isRoot
+}
+
+/**
+ * True if the attribute parsed is of type spread one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the attribute node is of type spread
+ */
+function isSpreadAttribute(node) {
+  return node[IS_SPREAD_ATTRIBUTE]
+}
+
+/**
+ * True if the node is an attribute and its name is "value"
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for value attribute nodes
+ */
+function isValueAttribute(node) {
+  return node.name === 'value'
+}
+
+/**
+ * True if the DOM node is a progress tag
+ * @param   {RiotParser.Node}  node - riot parser node
+ * @returns {boolean} true for the progress tags
+ */
+function isProgressNode(node) {
+  return node.name === PROGRESS_TAG_NODE_NAME
+}
+
+/**
+ * True if the node is an attribute and a DOM handler
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for dom listener attribute nodes
+ */
+const isEventAttribute = (() => {
+  const EVENT_ATTR_RE = /^on/;
+  return node => EVENT_ATTR_RE.test(node.name)
+})();
+
+/**
+ * True if the node has expressions or expression attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} ditto
+ */
+function hasExpressions(node) {
+  return !!(
+    node.expressions ||
+        // has expression attributes
+        (getNodeAttributes(node).some(attribute => hasExpressions(attribute))) ||
+        // has child text nodes with expressions
+        (node.nodes && node.nodes.some(node => isTextNode(node) && hasExpressions(node)))
+  )
+}
+
+/**
+ * True if the node is a directive having its own template
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the IF EACH and TAG bindings
+ */
+function hasItsOwnTemplate(node) {
+  return [
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode
+  ].some(test => test(node))
+}
+
+const hasIfAttribute = compose(Boolean, findIfAttribute);
+const hasEachAttribute = compose(Boolean, findEachAttribute);
+const hasIsAttribute = compose(Boolean, findIsAttribute);
+const hasKeyAttribute = compose(Boolean, findKeyAttribute);
+
+/**
+ * Find the attribute node
+ * @param   { string } name -  name of the attribute we want to find
+ * @param   { riotParser.nodeTypes.TAG } node - a tag node
+ * @returns { riotParser.nodeTypes.ATTR } attribute node
+ */
+function findAttribute(name, node) {
+  return node.attributes && node.attributes.find(attr => getName(attr) === name)
+}
+
+function findIfAttribute(node) {
+  return findAttribute(IF_DIRECTIVE, node)
+}
+
+function findEachAttribute(node) {
+  return findAttribute(EACH_DIRECTIVE, node)
+}
+
+function findKeyAttribute(node) {
+  return findAttribute(KEY_ATTRIBUTE, node)
+}
+
+function findIsAttribute(node) {
+  return findAttribute(IS_DIRECTIVE, node)
+}
+
+/**
+ * Find all the node attributes that are not expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the static attributes
+ */
+function findStaticAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => !hasExpressions(attribute))
+}
+
+/**
+ * Find all the node attributes that have expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the dynamic attributes
+ */
+function findDynamicAttributes(node) {
+  return getNodeAttributes(node).filter(hasExpressions)
+}
+
+/**
+ * Unescape the user escaped chars
+ * @param   {string} string - input string
+ * @param   {string} char - probably a '{' or anything the user want's to escape
+ * @returns {string} cleaned up string
+ */
+function unescapeChar(string, char) {
+  return string.replace(RegExp(`\\\\${char}`, 'gm'), char)
+}
+
+const scope = builders.identifier(SCOPE);
+const getName = node => node && node.name ? node.name : node;
+
+/**
+ * Replace the path scope with a member Expression
+ * @param   { types.NodePath } path - containing the current node visited
+ * @param   { types.Node } property - node we want to prefix with the scope identifier
+ * @returns {undefined} this is a void function
+ */
+function replacePathScope(path, property) {
+  path.replace(builders.memberExpression(
+    scope,
+    property,
+    false
+  ));
+}
+
+/**
+ * Change the nodes scope adding the `scope` prefix
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ * @context { types.visit }
+ */
+function updateNodeScope(path) {
+  if (!isGlobal(path)) {
+    replacePathScope(path, path.node);
+
+    return false
+  }
+
+  this.traverse(path);
+}
+
+/**
+ * Change the scope of the member expressions
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return always false because we want to check only the first node object
+ */
+function visitMemberExpression(path) {
+  if (!isGlobal(path) && !isGlobal({ node: path.node.object, scope: path.scope })) {
+    if (path.value.computed) {
+      this.traverse(path);
+    } else if (isBinaryExpression(path.node.object) || path.node.object.computed) {
+      this.traverse(path.get('object'));
+    } else if (!path.node.object.callee) {
+      replacePathScope(path, isThisExpression(path.node.object) ? path.node.property : path.node);
+    } else {
+      this.traverse(path.get('object'));
+    }
+  }
+
+  return false
+}
+
+
+/**
+ * Objects properties should be handled a bit differently from the Identifier
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ */
+function visitProperty(path) {
+  const value = path.node.value;
+
+  if (isIdentifier(value)) {
+    updateNodeScope(path.get('value'));
+  } else {
+    this.traverse(path.get('value'));
+  }
+
+  return false
+}
+
+/**
+ * The this expressions should be replaced with the scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean|undefined } return false if we want to stop the tree traversal
+ */
+function visitThisExpression(path) {
+  path.replace(scope);
+  this.traverse(path);
+}
+
+
+/**
+ * Update the scope of the global nodes
+ * @param   { Object } ast - ast program
+ * @returns { Object } the ast program with all the global nodes updated
+ */
+function updateNodesScope(ast) {
+  const ignorePath = () => false;
+
+  types.visit(ast, {
+    visitIdentifier: updateNodeScope,
+    visitMemberExpression,
+    visitProperty,
+    visitThisExpression,
+    visitClassExpression: ignorePath
+  });
+
+  return ast
+}
+
+/**
+ * Convert any expression to an AST tree
+ * @param   { Object } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } the ast generated
+ */
+function createASTFromExpression(expression, sourceFile, sourceCode) {
+  const code = sourceFile ?
+    addLineOffset(expression.text, sourceCode, expression) :
+    expression.text;
+
+  return generateAST(`(${code})`, {
+    sourceFileName: sourceFile
+  })
+}
+
+/**
+ * Create the bindings template property
+ * @param   {Array} args - arguments to pass to the template function
+ * @returns {ASTNode} a binding template key
+ */
+function createTemplateProperty(args) {
+  return simplePropertyNode(
+    BINDING_TEMPLATE_KEY,
+    args ? callTemplateFunction(...args) : nullNode()
+  )
+}
+
+/**
+ * Try to get the expression of an attribute node
+ * @param   { RiotParser.Node.Attribute } attribute - riot parser attribute node
+ * @returns { RiotParser.Node.Expression } attribute expression value
+ */
+function getAttributeExpression(attribute) {
+  return attribute.expressions ? attribute.expressions[0] : {
+    // if no expression was found try to typecast the attribute value
+    ...attribute,
+    text: attribute.value
+  }
+}
+
+/**
+ * Wrap the ast generated in a function call providing the scope argument
+ * @param   {Object} ast - function body
+ * @returns {FunctionExpresion} function having the scope argument injected
+ */
+function wrapASTInFunctionWithScope(ast) {
+  return builders.functionExpression(
+    null,
+    [scope],
+    builders.blockStatement([builders.returnStatement(
+      ast
+    )])
+  )
+}
+
+/**
+ * Convert any parser option to a valid template one
+ * @param   { RiotParser.Node.Expression } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } a FunctionExpression object
+ *
+ * @example
+ *  toScopedFunction('foo + bar') // scope.foo + scope.bar
+ *
+ * @example
+ *  toScopedFunction('foo.baz + bar') // scope.foo.baz + scope.bar
+ */
+function toScopedFunction(expression, sourceFile, sourceCode) {
+  return compose(
+    wrapASTInFunctionWithScope,
+    transformExpression,
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Transform an expression node updating its global scope
+ * @param   {RiotParser.Node.Expr} expression - riot parser expression node
+ * @param   {string} sourceFile - source file
+ * @param   {string} sourceCode - source code
+ * @returns {ASTExpression} ast expression generated from the riot parser expression node
+ */
+function transformExpression(expression, sourceFile, sourceCode) {
+  return compose(
+    getExpressionAST,
+    updateNodesScope,
+    createASTFromExpression
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Get the parsed AST expression of riot expression node
+ * @param   {AST.Program} sourceAST - raw node parsed
+ * @returns {AST.Expression} program expression output
+ */
+function getExpressionAST(sourceAST) {
+  const astBody = sourceAST.program.body;
+
+  return astBody[0] ? astBody[0].expression : astBody
+}
+
+/**
+ * Create the template call function
+ * @param   {Array|string|Node.Literal} template - template string
+ * @param   {Array<AST.Nodes>} bindings - template bindings provided as AST nodes
+ * @returns {Node.CallExpression} template call expression
+ */
+function callTemplateFunction(template, bindings) {
+  return builders.callExpression(builders.identifier(TEMPLATE_FN), [
+    template ? builders.literal(template) : nullNode(),
+    bindings ? builders.arrayExpression(bindings) : nullNode()
+  ])
+}
+
+/**
+ * Convert any DOM attribute into a valid DOM selector useful for the querySelector API
+ * @param   { string } attributeName - name of the attribute to query
+ * @returns { string } the attribute transformed to a query selector
+ */
+const attributeNameToDOMQuerySelector = attributeName => `[${attributeName}]`;
+
+/**
+ * Create the properties to query a DOM node
+ * @param   { string } attributeName - attribute name needed to identify a DOM node
+ * @returns { Array<AST.Node> } array containing the selector properties needed for the binding
+ */
+function createSelectorProperties(attributeName) {
+  return attributeName ? [
+    simplePropertyNode(BINDING_REDUNDANT_ATTRIBUTE_KEY, builders.literal(attributeName)),
+    simplePropertyNode(BINDING_SELECTOR_KEY,
+      compose(builders.literal, attributeNameToDOMQuerySelector)(attributeName)
+    )
+  ] : []
+}
+
+/**
+ * Clone the node filtering out the selector attribute from the attributes list
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {RiotParser.Node} the node with the attribute cleaned up
+ */
+function cloneNodeWithoutSelectorAttribute(node, selectorAttribute) {
+  return {
+    ...node,
+    attributes: getAttributesWithoutSelector(getNodeAttributes(node), selectorAttribute)
+  }
+}
+
+
+/**
+ * Get the node attributes without the selector one
+ * @param   {Array<RiotParser.Attr>} attributes - attributes list
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {Array<RiotParser.Attr>} filtered attributes
+ */
+function getAttributesWithoutSelector(attributes, selectorAttribute) {
+  if (selectorAttribute)
+    return attributes.filter(attribute => attribute.name !== selectorAttribute)
+
+  return attributes
+}
+
+/**
+ * Clean binding or custom attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attr>} only the attributes that are not bindings or directives
+ */
+function cleanAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => ![
+    IF_DIRECTIVE,
+    EACH_DIRECTIVE,
+    KEY_ATTRIBUTE,
+    SLOT_ATTRIBUTE,
+    IS_DIRECTIVE
+  ].includes(attribute.name))
+}
+
+/**
+ * Create a root node proxing only its nodes and attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node} root node
+ */
+function createRootNode(node) {
+  return {
+    nodes: getChildrenNodes(node),
+    isRoot: true,
+    // root nodes shuold't have directives
+    attributes: cleanAttributes(node)
+  }
+}
+
+/**
+ * Get all the child nodes of a RiotParser.Node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node>} all the child nodes found
+ */
+function getChildrenNodes(node) {
+  return node && node.nodes ? node.nodes : []
+}
+
+/**
+ * Get all the attributes of a riot parser node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attribute>} all the attributes find
+ */
+function getNodeAttributes(node) {
+  return node.attributes ? node.attributes : []
+}
+/**
+ * Get the name of a custom node transforming it into an expression node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node.Attr} the node name as expression attribute
+ */
+function getCustomNodeNameAsExpression(node) {
+  const isAttribute = findIsAttribute(node);
+  const toRawString = val => `'${val}'`;
+
+  if (isAttribute) {
+    return isAttribute.expressions ? isAttribute.expressions[0] : {
+      ...isAttribute,
+      text: toRawString(isAttribute.value)
+    }
+  }
+
+  return { ...node, text: toRawString(getName(node)) }
+}
+
+/**
+ * Convert all the node static attributes to strings
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} all the node static concatenated as string
+ */
+function staticAttributesToString(node) {
+  return findStaticAttributes(node)
+    .map(attribute => attribute[IS_BOOLEAN_ATTRIBUTE] || !attribute.value ?
+      attribute.name :
+      `${attribute.name}="${unescapeNode(attribute, 'value').value}"`
+    ).join(' ')
+}
+
+/**
+ * Make sure that node escaped chars will be unescaped
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} key - key property to unescape
+ * @returns {RiotParser.Node} node with the text property unescaped
+ */
+function unescapeNode(node, key) {
+  if (node.unescape) {
+    return {
+      ...node,
+      [key]: unescapeChar(node[key], node.unescape)
+    }
+  }
+
+  return node
+}
+
+
+/**
+ * Convert a riot parser opening node into a string
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the node as string
+ */
+function nodeToString(node) {
+  const attributes = staticAttributesToString(node);
+
+  switch(true) {
+  case isTagNode(node):
+    return `<${node.name}${attributes ? ` ${attributes}` : ''}${isVoidNode(node) ? '/' : ''}>`
+  case isTextNode(node):
+    return hasExpressions(node) ? TEXT_NODE_EXPRESSION_PLACEHOLDER : unescapeNode(node, 'text').text
+  default:
+    return ''
+  }
+}
+
+/**
+ * Close an html node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the closing tag of the html tag node passed to this function
+ */
+function closeTag(node) {
+  return node.name ? `</${node.name}>` : ''
+}
+
+/**
+ * Create a strings array with the `join` call to transform it into a string
+ * @param   {Array} stringsArray - array containing all the strings to concatenate
+ * @returns {AST.CallExpression} array with a `join` call
+ */
+function createArrayString(stringsArray) {
+  return builders.callExpression(
+    builders.memberExpression(
+      builders.arrayExpression(stringsArray),
+      builders.identifier('join'),
+      false
+    ),
+    [builders.literal('')],
+  )
+}
+
+/**
+ * Simple expression bindings might contain multiple expressions like for example: "class="{foo} red {bar}""
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Attr} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+function mergeAttributeExpressions(node, sourceFile, sourceCode) {
+  if (!node.parts || node.parts.length === 1) {
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+  }
+  const stringsArray = [
+    ...node.parts.reduce((acc, str) => {
+      const expression = node.expressions.find(e => e.text.trim() === str);
+
+      return [
+        ...acc,
+        expression ? transformExpression(expression, sourceFile, sourceCode) : builders.literal(str)
+      ]
+    }, [])
+  ].filter(expr => !isLiteral(expr) || expr.value);
+
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a selector that will be used to find the node via dom-bindings
+ * @param   {number} id - temporary variable that will be increased anytime this function will be called
+ * @returns {string} selector attribute needed to bind a riot expression
+ */
+const createBindingSelector = (function createSelector(id = 0) {
+  return () => `${BINDING_SELECTOR_PREFIX}${id++}`
+}());
+
+/**
+ * Create an attribute evaluation function
+ * @param   {RiotParser.Attr} sourceNode - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { AST.Node } an AST function expression to evaluate the attribute value
+ */
+function createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode) {
+  return hasExpressions(sourceNode) ?
+  // dynamic attribute
+    wrapASTInFunctionWithScope(mergeAttributeExpressions(sourceNode, sourceFile, sourceCode)) :
+  // static attribute
+    builders.functionExpression(
+      null,
+      [],
+      builders.blockStatement([
+        builders.returnStatement(builders.literal(sourceNode.value || true))
+      ]),
+    )
+}
+
+/**
+ * Simple clone deep function, do not use it for classes or recursive objects!
+ * @param   {*} source - possibily an object to clone
+ * @returns {*} the object we wanted to clone
+ */
+function cloneDeep(source) {
+  return JSON.parse(JSON.stringify(source))
+}
+
+const getEachItemName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[0] : expression.left;
+const getEachIndexName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[1] : null;
+const getEachValue = expression => expression.right;
+const nameToliteral = compose(builders.literal, getName);
+
+const generateEachItemNameKey = expression => simplePropertyNode(
+  BINDING_ITEM_NAME_KEY,
+  compose(nameToliteral, getEachItemName)(expression)
+);
+
+const generateEachIndexNameKey = expression => simplePropertyNode(
+  BINDING_INDEX_NAME_KEY,
+  compose(nameToliteral, getEachIndexName)(expression)
+);
+
+const generateEachEvaluateKey = (expression, eachExpression, sourceFile, sourceCode) => simplePropertyNode(
+  BINDING_EVALUATE_KEY,
+  compose(
+    e => toScopedFunction(e, sourceFile, sourceCode),
+    e => ({
+      ...eachExpression,
+      text: generateJavascript(e).code
+    }),
+    getEachValue
+  )(expression)
+);
+
+/**
+ * Get the each expression properties to create properly the template binding
+ * @param   { DomBinding.Expression } eachExpression - original each expression data
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Array } AST nodes that are needed to build an each binding
+ */
+function generateEachExpressionProperties(eachExpression, sourceFile, sourceCode) {
+  const ast = createASTFromExpression(eachExpression, sourceFile, sourceCode);
+  const body = ast.program.body;
+  const firstNode = body[0];
+
+  if (!isExpressionStatement(firstNode)) {
+    panic(`The each directives supported should be of type "ExpressionStatement",you have provided a "${firstNode.type}"`);
+  }
+
+  const { expression } = firstNode;
+
+  return [
+    generateEachItemNameKey(expression),
+    generateEachIndexNameKey(expression),
+    generateEachEvaluateKey(expression, eachExpression, sourceFile, sourceCode)
+  ]
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into an each binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+function createEachBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const [ifAttribute, eachAttribute, keyAttribute] = [
+    findIfAttribute,
+    findEachAttribute,
+    findKeyAttribute
+  ].map(f => f(sourceNode));
+  const attributeOrNull = attribute => attribute ? toScopedFunction(getAttributeExpression(attribute), sourceFile, sourceCode) : nullNode();
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(EACH_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_KEY_KEY, attributeOrNull(keyAttribute)),
+    simplePropertyNode(BINDING_CONDITION_KEY, attributeOrNull(ifAttribute)),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute)),
+    ...createSelectorProperties(selectorAttribute),
+    ...compose(generateEachExpressionProperties, getAttributeExpression)(eachAttribute)
+  ])
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into an if binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { stiring } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an if binding node
+ */
+function createIfBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const ifAttribute = findIfAttribute(sourceNode);
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(IF_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(ifAttribute.expressions[0], sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute))
+  ])
+}
+
+/**
+ * Create a simple attribute expression
+ * @param   {RiotParser.Node.Attr} sourceNode - the custom tag
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createAttributeExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(ATTRIBUTE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, isSpreadAttribute(sourceNode) ? nullNode() : builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+/**
+ * Create a simple event expression
+ * @param   {RiotParser.Node.Attr} sourceNode - attribute containing the event handlers
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createEventExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(EVENT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+/**
+ * Generate the pure immutable string chunks from a RiotParser.Node.Text
+ * @param   {RiotParser.Node.Text} node - riot parser text node
+ * @param   {string} sourceCode sourceCode - source code
+ * @returns {Array} array containing the immutable string chunks
+ */
+function generateLiteralStringChunksFromNode(node, sourceCode) {
+  return node.expressions.reduce((chunks, expression, index) => {
+    const start = index ? node.expressions[index - 1].end : node.start;
+
+    chunks.push(sourceCode.substring(start, expression.start));
+
+    // add the tail to the string
+    if (index === node.expressions.length - 1)
+      chunks.push(sourceCode.substring(expression.end, node.end));
+
+    return chunks
+  }, []).map(str => node.unescape ? unescapeChar(str, node.unescape) : str)
+}
+
+/**
+ * Simple bindings might contain multiple expressions like for example: "{foo} and {bar}"
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+function mergeNodeExpressions(node, sourceFile, sourceCode) {
+  if (node.parts.length === 1)
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+
+  const pureStringChunks = generateLiteralStringChunksFromNode(node, sourceCode);
+  const stringsArray = pureStringChunks.reduce((acc, str, index) => {
+    const expr = node.expressions[index];
+
+    return [
+      ...acc,
+      builders.literal(str),
+      expr ? transformExpression(expr, sourceFile, sourceCode) : nullNode()
+    ]
+  }, [])
+    // filter the empty literal expressions
+    .filter(expr => !isLiteral(expr) || expr.value);
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a text expression
+ * @param   {RiotParser.Node.Text} sourceNode - text node to parse
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {number} childNodeIndex - position of the child text node in its parent children nodes
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+function createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(TEXT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_CHILD_NODE_INDEX_KEY,
+      builders.literal(childNodeIndex)
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      wrapASTInFunctionWithScope(
+        mergeNodeExpressions(sourceNode, sourceFile, sourceCode)
+      )
+    )
+  ])
+}
+
+function createValueExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(VALUE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
+
+function createExpression(sourceNode, sourceFile, sourceCode, childNodeIndex, parentNode) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    return createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex)
+  // progress nodes value attributes will be rendered as attributes
+  // see https://github.com/riot/compiler/issues/122
+  case isValueAttribute(sourceNode) && domNodes.hasValueAttribute(parentNode.name) && !isProgressNode(parentNode):
+    return createValueExpression(sourceNode, sourceFile, sourceCode)
+  case isEventAttribute(sourceNode):
+    return createEventExpression(sourceNode, sourceFile, sourceCode)
+  default:
+    return createAttributeExpression(sourceNode, sourceFile, sourceCode)
+  }
+}
+
+/**
+ * Create the attribute expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the attribute expressions
+ */
+function createAttributeExpressions(sourceNode, sourceFile, sourceCode) {
+  return findDynamicAttributes(sourceNode)
+    .map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode))
+}
+
+/**
+ * Create the text node expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the text node expressions
+ */
+function createTextNodeExpressions(sourceNode, sourceFile, sourceCode) {
+  const childrenNodes = getChildrenNodes(sourceNode);
+
+  return childrenNodes
+    .filter(isTextNode)
+    .filter(hasExpressions)
+    .map(node => createExpression(
+      node,
+      sourceFile,
+      sourceCode,
+      childrenNodes.indexOf(node),
+      sourceNode
+    ))
+}
+
+/**
+ * Add a simple binding to a riot parser node
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+function createSimpleBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    ...createSelectorProperties(selectorAttribute),
+    simplePropertyNode(
+      BINDING_EXPRESSIONS_KEY,
+      builders.arrayExpression([
+        ...createTextNodeExpressions(sourceNode, sourceFile, sourceCode),
+        ...createAttributeExpressions(sourceNode, sourceFile, sourceCode)
+      ])
+    )
+  ])
+}
+
+/**
+ * Transform a RiotParser.Node.Tag of type slot into a slot binding
+ * @param   { RiotParser.Node.Tag } sourceNode - slot node
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @returns { AST.Node } a slot binding node
+ */
+function createSlotBinding(sourceNode, selectorAttribute) {
+  const slotNameAttribute = findAttribute(NAME_ATTRIBUTE, sourceNode);
+  const slotName = slotNameAttribute ? slotNameAttribute.value : DEFAULT_SLOT_NAME;
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(SLOT_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_NAME_KEY,
+      builders.literal(slotName)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
+
+/**
+ * Find the slots in the current component and group them under the same id
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {Object} object containing all the slots grouped by name
+ */
+function groupSlots(sourceNode) {
+  return getChildrenNodes(sourceNode).reduce((acc, node) => {
+    const slotAttribute = findSlotAttribute(node);
+
+    if (slotAttribute) {
+      acc[slotAttribute.value] = node;
+    } else {
+      acc.default = createRootNode({
+        nodes: [...getChildrenNodes(acc.default), node]
+      });
+    }
+
+    return acc
+  }, {
+    default: null
+  })
+}
+
+/**
+ * Create the slot entity to pass to the riot-dom bindings
+ * @param   {string} id - slot id
+ * @param   {RiotParser.Node.Tag} sourceNode - slot root node
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} ast node containing the slot object properties
+ */
+function buildSlot(id, sourceNode, sourceFile, sourceCode) {
+  const cloneNode = {
+    ...sourceNode,
+    // avoid to render the slot attribute
+    attributes: getNodeAttributes(sourceNode).filter(attribute => attribute.name !== SLOT_ATTRIBUTE)
+  };
+  const [html, bindings] = build(cloneNode, sourceFile, sourceCode);
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_ID_KEY, builders.literal(id)),
+    simplePropertyNode(BINDING_HTML_KEY, builders.literal(html)),
+    simplePropertyNode(BINDING_BINDINGS_KEY, builders.arrayExpression(bindings))
+  ])
+}
+
+/**
+ * Create the AST array containing the slots
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the attributes to bind
+ */
+function createSlotsArray(sourceNode, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      slots => slots.map(([key, value]) => buildSlot(key, value, sourceFile, sourceCode)),
+      slots => slots.filter(([,value]) => value),
+      Object.entries,
+      groupSlots
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Create the AST array containing the attributes to bind to this node
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the slot objects
+ */
+function createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      attributes => attributes.map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode)),
+      attributes => getAttributesWithoutSelector(attributes, selectorAttribute), // eslint-disable-line
+      cleanAttributes
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Find the slot attribute if it exists
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {RiotParser.Node.Attr|undefined} the slot attribute found
+ */
+function findSlotAttribute(sourceNode) {
+  return getNodeAttributes(sourceNode).find(attribute => attribute.name === SLOT_ATTRIBUTE)
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into a tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } tag binding node
+ */
+function createTagBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(TAG_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_COMPONENT_KEY, builders.identifier(GET_COMPONENT_FN)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(getCustomNodeNameAsExpression(sourceNode), sourceFile, sourceCode)
+    ),
+    simplePropertyNode(BINDING_SLOTS_KEY, createSlotsArray(sourceNode, sourceFile, sourceCode)),
+    simplePropertyNode(
+      BINDING_ATTRIBUTES_KEY,
+      createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
+
+const BuildingState = Object.freeze({
+  html: [],
+  bindings: [],
+  parent: null
+});
+
+/**
+ * Nodes having bindings should be cloned and new selector properties should be added to them
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} bindingsSelector - temporary string to identify the current node
+ * @returns {RiotParser.Node} the original node parsed having the new binding selector attribute
+ */
+function createBindingsTag(sourceNode, bindingsSelector) {
+  if (!bindingsSelector) return sourceNode
+
+  return {
+    ...sourceNode,
+    // inject the selector bindings into the node attributes
+    attributes: [{
+      name: bindingsSelector,
+      value: bindingsSelector
+    }, ...getNodeAttributes(sourceNode)]
+  }
+}
+
+/**
+ * Create a generic dynamic node (text or tag) and generate its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createDynamicNode(sourceNode, sourceFile, sourceCode, state) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    // text nodes will not have any bindings
+    return [nodeToString(sourceNode), []]
+  default:
+    return createTagWithBindings(sourceNode, sourceFile, sourceCode)
+  }
+}
+
+/**
+ * Create only a dynamic tag node with generating a custom selector and its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createTagWithBindings(sourceNode, sourceFile, sourceCode) {
+  const bindingsSelector = isRootNode(sourceNode) ? null : createBindingSelector();
+  const cloneNode = createBindingsTag(sourceNode, bindingsSelector);
+  const tagOpeningHTML = nodeToString(cloneNode);
+
+  switch(true) {
+  // EACH bindings have prio 1
+  case hasEachAttribute(cloneNode):
+    return [tagOpeningHTML, [createEachBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // IF bindings have prio 2
+  case hasIfAttribute(cloneNode):
+    return [tagOpeningHTML, [createIfBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // TAG bindings have prio 3
+  case isCustomNode(cloneNode):
+    return [tagOpeningHTML, [createTagBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // slot tag
+  case isSlotNode(cloneNode):
+    return [tagOpeningHTML, [createSlotBinding(cloneNode, bindingsSelector)]]
+  // this node has expressions bound to it
+  default:
+    return [tagOpeningHTML, [createSimpleBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  }
+}
+
+/**
+ * Parse a node trying to extract its template and bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function parseNode(sourceNode, sourceFile, sourceCode, state) {
+  // static nodes have no bindings
+  if (isStaticNode(sourceNode)) return [nodeToString(sourceNode), []]
+  return createDynamicNode(sourceNode, sourceFile, sourceCode)
+}
+
+/**
+ * Create the tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { string } selector - binding selector
+ * @returns { Array } array with only the tag binding AST
+ */
+function createNestedBindings(sourceNode, sourceFile, sourceCode, selector) {
+  const mightBeARiotComponent = isCustomNode(sourceNode);
+
+  return mightBeARiotComponent ? [null, [
+    createTagBinding(
+      cloneNodeWithoutSelectorAttribute(sourceNode, selector),
+      null,
+      sourceFile,
+      sourceCode
+    )]
+  ] : build(createRootNode(sourceNode), sourceFile, sourceCode)
+}
+
+/**
+ * Build the template and the bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and the dom bindings
+ */
+function build(
+  sourceNode,
+  sourceFile,
+  sourceCode,
+  state
+) {
+  if (!sourceNode) panic('Something went wrong with your tag DOM parsing, your tag template can\'t be created');
+
+  const [nodeHTML, nodeBindings] = parseNode(sourceNode, sourceFile, sourceCode);
+  const childrenNodes = getChildrenNodes(sourceNode);
+  const currentState = { ...cloneDeep(BuildingState), ...state };
+
+  // mutate the original arrays
+  currentState.html.push(...nodeHTML);
+  currentState.bindings.push(...nodeBindings);
+
+  // do recursion if
+  // this tag has children and it has no special directives bound to it
+  if (childrenNodes.length && !hasItsOwnTemplate(sourceNode)) {
+    childrenNodes.forEach(node => build(node, sourceFile, sourceCode, { parent: sourceNode, ...currentState }));
+  }
+
+  // close the tag if it's not a void one
+  if (isTagNode(sourceNode) && !isVoidNode(sourceNode)) {
+    currentState.html.push(closeTag(sourceNode));
+  }
+
+  return [
+    currentState.html.join(''),
+    currentState.bindings
+  ]
+}
+
+const templateFunctionArguments = [
+  TEMPLATE_FN,
+  EXPRESSION_TYPES,
+  BINDING_TYPES,
+  GET_COMPONENT_FN
+].map(builders.identifier);
+
+/**
+ * Create the content of the template function
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.BlockStatement} the content of the template function
+ */
+function createTemplateFunctionContent(sourceNode, sourceFile, sourceCode) {
+  return builders.blockStatement([
+    builders.returnStatement(
+      callTemplateFunction(
+        ...build(
+          createRootNode(sourceNode),
+          sourceFile,
+          sourceCode
+        )
+      )
+    )
+  ])
+}
+
+/**
+ * Extend the AST adding the new template property containing our template call to render the component
+ * @param   { Object } ast - current output ast
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @returns { Object } the output ast having the "template" key
+ */
+function extendTemplateProperty(ast, sourceFile, sourceCode, sourceNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_TEMPLATE_PROPERTY) {
+        path.value.value = builders.functionExpression(
+          null,
+          templateFunctionArguments,
+          createTemplateFunctionContent(sourceNode, sourceFile, sourceCode)
+        );
+
+        return false
+      }
+
+      this.traverse(path);
+    }
+  });
+
+  return ast
+}
+
+/**
+ * Generate the component template logic
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+function template(sourceNode, source, meta, ast) {
+  const { options } = meta;
+  return  extendTemplateProperty(ast, options.file, source, sourceNode)
+}
+
+const DEFAULT_OPTIONS = {
+  template: 'default',
+  file: '[unknown-source-file]',
+  scopedCss: true
+};
+
+/**
+ * Create the initial AST
+ * @param {string} tagName - the name of the component we have compiled
+ * @returns { AST } the initial AST
+ *
+ * @example
+ * // the output represents the following string in AST
+ */
+function createInitialInput({tagName}) {
+  /*
+  generates
+  export default {
+     ${TAG_CSS_PROPERTY}: null,
+     ${TAG_LOGIC_PROPERTY}: null,
+     ${TAG_TEMPLATE_PROPERTY}: null
+  }
+  */
+  return builders.program([
+    builders.exportDefaultDeclaration(
+      builders.objectExpression([
+        simplePropertyNode(TAG_CSS_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_LOGIC_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_TEMPLATE_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_NAME_PROPERTY, builders.literal(tagName))
+      ])
+    )]
+  )
+}
+
+/**
+ * Make sure the input sourcemap is valid otherwise we ignore it
+ * @param   {SourceMapGenerator} map - preprocessor source map
+ * @returns {Object} sourcemap as json or nothing
+ */
+function normaliseInputSourceMap(map) {
+  const inputSourceMap = sourcemapAsJSON(map);
+  return isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+}
+
+/**
+ * Override the sourcemap content making sure it will always contain the tag source code
+ * @param   {Object} map - sourcemap as json
+ * @param   {string} source - component source code
+ * @returns {Object} original source map with the "sourcesContent" property overriden
+ */
+function overrideSourcemapContent(map, source) {
+  return {
+    ...map,
+    sourcesContent: [source]
+  }
+}
+
+/**
+ * Create the compilation meta object
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } options - compiling options
+ * @returns {Object} meta object
+ */
+function createMeta(source, options) {
+  return {
+    tagName: null,
+    fragments: null,
+    options: {
+      ...DEFAULT_OPTIONS,
+      ...options
+    },
+    source
+  }
+}
+
+/**
+ * Generate the output code source together with the sourcemap
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } opts - compiling options
+ * @returns { Output } object containing output code and source map
+ */
+function compile(source, opts = {}) {
+  const meta = createMeta(source, opts);
+  const {options} = meta;
+  const { code, map } = execute$1('template', options.template, meta, source);
+  const { template: template$1, css: css$1, javascript: javascript$1 } = riotParser__default(options).parse(code).output;
+
+  // extend the meta object with the result of the parsing
+  Object.assign(meta, {
+    tagName: template$1.name,
+    fragments: { template: template$1, css: css$1, javascript: javascript$1 }
+  });
+
+  return compose(
+    result => ({ ...result, meta }),
+    result => execute(result, meta),
+    result => ({
+      ...result,
+      map: overrideSourcemapContent(result.map, source)
+    }),
+    ast => meta.ast = ast && generateJavascript(ast, {
+      sourceMapName: `${options.file}.map`,
+      inputSourceMap: normaliseInputSourceMap(map)
+    }),
+    hookGenerator(template, template$1, code, meta),
+    hookGenerator(javascript, javascript$1, code, meta),
+    hookGenerator(css, css$1, code, meta),
+  )(createInitialInput(meta))
+}
+
+/**
+ * Prepare the riot parser node transformers
+ * @param   { Function } transformer - transformer function
+ * @param   { Object } sourceNode - riot parser node
+ * @param   { string } source - component source code
+ * @param   { Object } meta - compilation meta information
+ * @returns { Promise<Output> } object containing output code and source map
+ */
+function hookGenerator(transformer, sourceNode, source, meta) {
+  if (
+    // filter missing nodes
+    !sourceNode ||
+    // filter nodes without children
+    (sourceNode.nodes && !sourceNode.nodes.length) ||
+    // filter empty javascript and css nodes
+    (!sourceNode.nodes && !sourceNode.text)) {
+    return result => result
+  }
+
+  return curry(transformer)(sourceNode, source, meta)
+}
+
+// This function can be used to register new preprocessors
+// a preprocessor can target either only the css or javascript nodes
+// or the complete tag source file ('template')
+const registerPreprocessor = register$1;
+
+// This function can allow you to register postprocessors that will parse the output code
+// here we can run prettifiers, eslint fixes...
+const registerPostprocessor = register;
+
+exports.compile = compile;
+exports.createInitialInput = createInitialInput;
+exports.registerPostprocessor = registerPostprocessor;
+exports.registerPreprocessor = registerPreprocessor;
diff --git a/node_modules/@riotjs/compiler/package.json b/node_modules/@riotjs/compiler/package.json
new file mode 100644
index 0000000..6fbe992
--- /dev/null
+++ b/node_modules/@riotjs/compiler/package.json
@@ -0,0 +1,99 @@
+{
+  "_from": "@riotjs/compiler@^4.3.11",
+  "_id": "@riotjs/compiler@4.3.11",
+  "_inBundle": false,
+  "_integrity": "sha512-3TpOuoiXWSLGvcvZRfhJLdpRpwJihmT+J+NB2nWXA5/8+23x1soUoPmBtRi9Jo2xLInsh3J1/q5tQ8LjXLc2eQ==",
+  "_location": "/@riotjs/compiler",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@riotjs/compiler@^4.3.11",
+    "name": "@riotjs/compiler",
+    "escapedName": "@riotjs%2fcompiler",
+    "scope": "@riotjs",
+    "rawSpec": "^4.3.11",
+    "saveSpec": null,
+    "fetchSpec": "^4.3.11"
+  },
+  "_requiredBy": [
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/@riotjs/compiler/-/compiler-4.3.11.tgz",
+  "_shasum": "b068216c19092d524dc0a7fbce1572a23830607b",
+  "_spec": "@riotjs/compiler@^4.3.11",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/riot/compiler/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "@riotjs/dom-bindings": "^4.2.5",
+    "@riotjs/parser": "^4.0.3",
+    "acorn": "^7.0.0",
+    "cssesc": "^3.0.0",
+    "cumpa": "^1.0.1",
+    "curri": "^1.0.1",
+    "dom-nodes": "^1.1.3",
+    "globals": "^12.0.0",
+    "recast": "^0.18.2",
+    "source-map": "^0.7.3"
+  },
+  "deprecated": false,
+  "description": "Compiler for riot .tag files",
+  "devDependencies": {
+    "chai": "^4.2.0",
+    "coveralls": "^3.0.6",
+    "eslint": "^6.2.1",
+    "eslint-config-riot": "^3.0.0",
+    "esm": "^3.2.25",
+    "mocha": "^6.2.0",
+    "nyc": "^14.1.1",
+    "rollup": "^1.20.1",
+    "rollup-plugin-alias": "^2.0.0",
+    "rollup-plugin-commonjs": "^10.0.2",
+    "rollup-plugin-json": "^4.0.0",
+    "rollup-plugin-node-builtins": "^2.1.2",
+    "rollup-plugin-node-resolve": "^5.2.0",
+    "shelljs": "^0.8.3"
+  },
+  "files": [
+    "dist",
+    "src"
+  ],
+  "homepage": "https://github.com/riot/compiler#readme",
+  "jsnext:main": "dist/index.esm.js",
+  "keywords": [
+    "riot",
+    "Riot.js",
+    "components",
+    "custom components",
+    "custom elements",
+    "compiler"
+  ],
+  "license": "MIT",
+  "main": "dist/index.js",
+  "module": "dist/index.esm.js",
+  "name": "@riotjs/compiler",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/riot/compiler.git"
+  },
+  "scripts": {
+    "build": "rollup -c build/rollup.node.config.js && rollup -c build/rollup.browser.config.js",
+    "cov": "nyc report --reporter=text-lcov | coveralls",
+    "cov-html": "nyc report --reporter=html",
+    "debug": "mocha --inspect --inspect-brk -r esm test/*.spec.js test/**/*.spec.js",
+    "lint": "eslint src/ test/ build/",
+    "postest": "npm run cov-html",
+    "prepare": "npm i pug@2.0.3 node-sass@4.12.0 @babel/core@7 @babel/preset-env@7 --no-save",
+    "prepublishOnly": "npm run build && npm run test",
+    "test": "npm run lint && nyc mocha -r esm test/*.spec.js test/**/*.spec.js"
+  },
+  "version": "4.3.11"
+}
diff --git a/node_modules/@riotjs/compiler/src/.DS_Store b/node_modules/@riotjs/compiler/src/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..57c470d37436d5c7d63bac5106d5c4d0e2dac309
GIT binary patch
literal 6148
zcmeHKyG{c^3>=db5i}_&_ZRqsRTRD;KL8RaO>~jMqrNKN#iucTC?dL0P^3X)$(~)W
zXHPf9`3%5TA1@EU62OA)h@*$8`MLYVZYpC$I`25(8SmH=-zL?U6VAQG7OxoSKlq=U
z!?4>A+r0ZSSy?F{1*Cu!kOETR&kA_&r7i9f6{Ua_kOC(K{QJ=8j=gY9j86wci~z(r
z(_vi4EJ19ZAojvBkr|pLm6%kk5yO(se5<-%I3^|?R>OzYldUEci>LGc7Ui&>s3--b
zz_|jm+%CQUKhl4h|IbO<NdYPFuN1KPdb3{fm8!Q+Ue0@Mqd(ET=8Nvebx;_h9TTG+
hbK~v!K8mug`I_gwa7+w3^Fb%-XTWulNr7uC@D0Qp6~_Po

literal 0
HcmV?d00001

diff --git a/node_modules/@riotjs/compiler/src/constants.js b/node_modules/@riotjs/compiler/src/constants.js
new file mode 100644
index 0000000..0e5b934
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/constants.js
@@ -0,0 +1,4 @@
+export const TAG_LOGIC_PROPERTY = 'exports'
+export const TAG_CSS_PROPERTY = 'css'
+export const TAG_TEMPLATE_PROPERTY = 'template'
+export const TAG_NAME_PROPERTY = 'name'
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/generators/.DS_Store b/node_modules/@riotjs/compiler/src/generators/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..eb030025ac4ca6b7cd632e750bdc6a3a7468dc3a
GIT binary patch
literal 6148
zcmeHKF-`+P475p#lW0<=+%NEhRTN&34}cUz69Pg&eO2DY)0nZXi0DESDGeG+_Uw8+
zd%7vkXEXEF=l0HQVP*rIXa|O=@ti)fo60y4jyrbtXdm|UwRzu9s?R6L9mug4d;87b
zz3!j$-t$CdrGONW0#ZN<NP&wKVDE(uw~2~UKnh5KqXPUsG&r#rj*0Q<K!_0lI7d1R
z>zE~gjR{~c921d&c~XH%^%^le>BzUL>xE-t(#>o5@OrY>gyQjZ+~1<yyeBG30V!~*
zz$~{5_WyhMAM^hyNjoVZ1^$%+K3{LvE4)(m*2&AU*EaYAoHgHY8rDHUh;|H&c8m?%
e@iL0Cu5pd?UN|NO9r>UG^)o<SWK!VT3j6^2y%n1P

literal 0
HcmV?d00001

diff --git a/node_modules/@riotjs/compiler/src/generators/css/index.js b/node_modules/@riotjs/compiler/src/generators/css/index.js
new file mode 100644
index 0000000..77a52ab
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/css/index.js
@@ -0,0 +1,124 @@
+import {builders, types} from '../../utils/build-types'
+import {TAG_CSS_PROPERTY} from '../../constants'
+import cssEscape from 'cssesc'
+import getPreprocessorTypeByAttribute from '../../utils/get-preprocessor-type-by-attribute'
+import preprocess from '../../utils/preprocess-node'
+
+/**
+ * Matches valid, multiline JavaScript comments in almost all its forms.
+ * @const {RegExp}
+ * @static
+ */
+const R_MLCOMMS = /\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//g
+
+/**
+ * Source for creating regexes matching valid quoted, single-line JavaScript strings.
+ * It recognizes escape characters, including nested quotes and line continuation.
+ * @const {string}
+ */
+const S_LINESTR = /"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source
+
+/**
+ * Matches CSS selectors, excluding those beginning with '@' and quoted strings.
+ * @const {RegExp}
+ */
+
+const CSS_SELECTOR = RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${S_LINESTR}`, 'g')
+
+/**
+ * Parses styles enclosed in a "scoped" tag
+ * The "css" string is received without comments or surrounding spaces.
+ *
+ * @param   {string} tag - Tag name of the root element
+ * @param   {string} css - The CSS code
+ * @returns {string} CSS with the styles scoped to the root element
+ */
+function scopedCSS(tag, css) {
+  const host = ':host'
+  const selectorsBlacklist = ['from', 'to']
+
+  return css.replace(CSS_SELECTOR, function(m, p1, p2) {
+    // skip quoted strings
+    if (!p2) return m
+
+    // we have a selector list, parse each individually
+    p2 = p2.replace(/[^,]+/g, function(sel) {
+      const s = sel.trim()
+
+      // skip selectors already using the tag name
+      if (s.indexOf(tag) === 0) {
+        return sel
+      }
+
+      // skips the keywords and percents of css animations
+      if (!s || selectorsBlacklist.indexOf(s) > -1 || s.slice(-1) === '%') {
+        return sel
+      }
+
+      // replace the `:host` pseudo-selector, where it is, with the root tag name;
+      // if `:host` was not included, add the tag name as prefix, and mirror all
+      // `[data-is]`
+      if (s.indexOf(host) < 0) {
+        return `${tag} ${s},[is="${tag}"] ${s}`
+      } else {
+        return `${s.replace(host, tag)},${
+          s.replace(host, `[is="${tag}"]`)}`
+      }
+    })
+
+    // add the danling bracket char and return the processed selector list
+    return p1 ? `${p1} ${p2}` : p2
+  })
+}
+
+/**
+ * Remove comments, compact and trim whitespace
+ * @param { string } code - compiled css code
+ * @returns { string } css code normalized
+ */
+function compactCss(code) {
+  return code.replace(R_MLCOMMS, '').replace(/\s+/g, ' ').trim()
+}
+
+const escapeBackslashes = s => s.replace(/\\/g, '\\\\')
+const escapeIdentifier = identifier => escapeBackslashes(cssEscape(identifier, {
+  isIdentifier: true
+}))
+
+/**
+ * Generate the component css
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+export default function css(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode)
+  const { options } = meta
+  const preprocessorOutput = preprocess('css', preprocessorName, meta, sourceNode.text)
+  const normalizedCssCode = compactCss(preprocessorOutput.code)
+  const escapedCssIdentifier = escapeIdentifier(meta.tagName)
+
+  const cssCode = (options.scopedCss ?
+    scopedCSS(escapedCssIdentifier, escapeBackslashes(normalizedCssCode)) :
+    escapeBackslashes(normalizedCssCode)
+  ).trim()
+
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_CSS_PROPERTY) {
+        path.value.value = builders.templateLiteral(
+          [builders.templateElement({ raw: cssCode, cooked: '' }, false)],
+          []
+        )
+
+        return false
+      }
+
+      this.traverse(path)
+    }
+  })
+
+  return ast
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/generators/javascript/index.js b/node_modules/@riotjs/compiler/src/generators/javascript/index.js
new file mode 100644
index 0000000..49e4e54
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/javascript/index.js
@@ -0,0 +1,92 @@
+import {TAG_LOGIC_PROPERTY} from '../../constants'
+import addLinesOffset from '../../utils/add-lines-offset'
+import generateAST from '../../utils/generate-ast'
+import getPreprocessorTypeByAttribute from '../../utils/get-preprocessor-type-by-attribute'
+import isEmptySourcemap from '../../utils/is-empty-sourcemap'
+import {isExportDefaultStatement} from '../../utils/ast-nodes-checks'
+import preprocess from '../../utils/preprocess-node'
+import sourcemapToJSON from '../../utils/sourcemap-as-json'
+import {types} from '../../utils/build-types'
+
+/**
+ * Find the export default statement
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Object } node containing only the code of the export default statement
+ */
+function findExportDefaultStatement(body) {
+  return body.find(isExportDefaultStatement)
+}
+
+/**
+ * Find all the code in an ast program except for the export default statements
+ * @param   { Array } body - tree structure containing the program code
+ * @returns { Array } array containing all the program code except the export default expressions
+ */
+function filterNonExportDefaultStatements(body) {
+  return body.filter(node => !isExportDefaultStatement(node))
+}
+
+/**
+ * Get the body of the AST structure
+ * @param   { Object } ast - ast object generated by recast
+ * @returns { Array } array containing the program code
+ */
+function getProgramBody(ast) {
+  return ast.body || ast.program.body
+}
+
+/**
+ * Extend the AST adding the new tag method containing our tag sourcecode
+ * @param   { Object } ast - current output ast
+ * @param   { Object } exportDefaultNode - tag export default node
+ * @returns { Object } the output ast having the "tag" key extended with the content of the export default
+ */
+function extendTagProperty(ast, exportDefaultNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_LOGIC_PROPERTY) {
+        path.value.value = exportDefaultNode.declaration
+        return false
+      }
+
+      this.traverse(path)
+    }
+  })
+
+  return ast
+}
+
+/**
+ * Generate the component javascript logic
+ * @param   { Object } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+export default function javascript(sourceNode, source, meta, ast) {
+  const preprocessorName = getPreprocessorTypeByAttribute(sourceNode)
+  const javascriptNode = addLinesOffset(sourceNode.text.text, source, sourceNode)
+  const { options } = meta
+  const preprocessorOutput = preprocess('javascript', preprocessorName, meta, {
+    ...sourceNode,
+    text: javascriptNode
+  })
+  const inputSourceMap = sourcemapToJSON(preprocessorOutput.map)
+  const generatedAst = generateAST(preprocessorOutput.code, {
+    sourceFileName: options.file,
+    inputSourceMap: isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+  })
+  const generatedAstBody = getProgramBody(generatedAst)
+  const bodyWithoutExportDefault = filterNonExportDefaultStatements(generatedAstBody)
+  const exportDefaultNode = findExportDefaultStatement(generatedAstBody)
+  const outputBody = getProgramBody(ast)
+
+  // add to the ast the "private" javascript content of our tag script node
+  outputBody.unshift(...bodyWithoutExportDefault)
+
+  // convert the export default adding its content to the "tag" property exported
+  if (exportDefaultNode) extendTagProperty(ast, exportDefaultNode)
+
+  return ast
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/generators/template/bindings/each.js b/node_modules/@riotjs/compiler/src/generators/template/bindings/each.js
new file mode 100644
index 0000000..240afd1
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/bindings/each.js
@@ -0,0 +1,110 @@
+import {
+  BINDING_CONDITION_KEY,
+  BINDING_EVALUATE_KEY,
+  BINDING_GET_KEY_KEY,
+  BINDING_INDEX_NAME_KEY,
+  BINDING_ITEM_NAME_KEY,
+  BINDING_TYPES,
+  BINDING_TYPE_KEY,
+  EACH_BINDING_TYPE
+} from '../constants'
+import {
+  createASTFromExpression,
+  createSelectorProperties,
+  createTemplateProperty,
+  getAttributeExpression,
+  getName,
+  toScopedFunction
+} from '../utils'
+import { findEachAttribute, findIfAttribute, findKeyAttribute } from '../find'
+import {isExpressionStatement, isSequenceExpression} from '../../../utils/ast-nodes-checks'
+import {nullNode, simplePropertyNode} from '../../../utils/custom-ast-nodes'
+import {builders} from '../../../utils/build-types'
+import compose from 'cumpa'
+import {createNestedBindings} from '../builder'
+import generateJavascript from '../../../utils/generate-javascript'
+import panic from '../../../utils/panic'
+
+const getEachItemName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[0] : expression.left
+const getEachIndexName = expression => isSequenceExpression(expression.left) ? expression.left.expressions[1] : null
+const getEachValue = expression => expression.right
+const nameToliteral = compose(builders.literal, getName)
+
+const generateEachItemNameKey = expression => simplePropertyNode(
+  BINDING_ITEM_NAME_KEY,
+  compose(nameToliteral, getEachItemName)(expression)
+)
+
+const generateEachIndexNameKey = expression => simplePropertyNode(
+  BINDING_INDEX_NAME_KEY,
+  compose(nameToliteral, getEachIndexName)(expression)
+)
+
+const generateEachEvaluateKey = (expression, eachExpression, sourceFile, sourceCode) => simplePropertyNode(
+  BINDING_EVALUATE_KEY,
+  compose(
+    e => toScopedFunction(e, sourceFile, sourceCode),
+    e => ({
+      ...eachExpression,
+      text: generateJavascript(e).code
+    }),
+    getEachValue
+  )(expression)
+)
+
+/**
+ * Get the each expression properties to create properly the template binding
+ * @param   { DomBinding.Expression } eachExpression - original each expression data
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Array } AST nodes that are needed to build an each binding
+ */
+export function generateEachExpressionProperties(eachExpression, sourceFile, sourceCode) {
+  const ast = createASTFromExpression(eachExpression, sourceFile, sourceCode)
+  const body = ast.program.body
+  const firstNode = body[0]
+
+  if (!isExpressionStatement(firstNode)) {
+    panic(`The each directives supported should be of type "ExpressionStatement",you have provided a "${firstNode.type}"`)
+  }
+
+  const { expression } = firstNode
+
+  return [
+    generateEachItemNameKey(expression),
+    generateEachIndexNameKey(expression),
+    generateEachEvaluateKey(expression, eachExpression, sourceFile, sourceCode)
+  ]
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into an each binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+export default function createEachBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const [ifAttribute, eachAttribute, keyAttribute] = [
+    findIfAttribute,
+    findEachAttribute,
+    findKeyAttribute
+  ].map(f => f(sourceNode))
+  const attributeOrNull = attribute => attribute ? toScopedFunction(getAttributeExpression(attribute), sourceFile, sourceCode) : nullNode()
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(EACH_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_KEY_KEY, attributeOrNull(keyAttribute)),
+    simplePropertyNode(BINDING_CONDITION_KEY, attributeOrNull(ifAttribute)),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute)),
+    ...createSelectorProperties(selectorAttribute),
+    ...compose(generateEachExpressionProperties, getAttributeExpression)(eachAttribute)
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/bindings/if.js b/node_modules/@riotjs/compiler/src/generators/template/bindings/if.js
new file mode 100644
index 0000000..58b5cf1
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/bindings/if.js
@@ -0,0 +1,43 @@
+import {
+  BINDING_EVALUATE_KEY,
+  BINDING_TYPES,
+  BINDING_TYPE_KEY,
+  IF_BINDING_TYPE
+} from '../constants'
+import {
+  createSelectorProperties,
+  createTemplateProperty,
+  toScopedFunction
+} from '../utils'
+import {builders} from '../../../utils/build-types'
+import {createNestedBindings} from '../builder'
+import {findIfAttribute} from '../find'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+/**
+ * Transform a RiotParser.Node.Tag into an if binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { stiring } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an if binding node
+ */
+export default function createIfBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  const ifAttribute = findIfAttribute(sourceNode)
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(IF_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(ifAttribute.expressions[0], sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute),
+    createTemplateProperty(createNestedBindings(sourceNode, sourceFile, sourceCode, selectorAttribute))
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/bindings/simple.js b/node_modules/@riotjs/compiler/src/generators/template/bindings/simple.js
new file mode 100644
index 0000000..b9bf99a
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/bindings/simple.js
@@ -0,0 +1,52 @@
+import {createAttributeExpressions, createExpression} from '../expressions/index'
+import {
+  createSelectorProperties,
+  getChildrenNodes
+} from '../utils'
+import { hasExpressions, isTextNode } from '../checks'
+import {BINDING_EXPRESSIONS_KEY} from '../constants'
+import {builders} from '../../../utils/build-types'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+/**
+ * Create the text node expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the text node expressions
+ */
+function createTextNodeExpressions(sourceNode, sourceFile, sourceCode) {
+  const childrenNodes = getChildrenNodes(sourceNode)
+
+  return childrenNodes
+    .filter(isTextNode)
+    .filter(hasExpressions)
+    .map(node => createExpression(
+      node,
+      sourceFile,
+      sourceCode,
+      childrenNodes.indexOf(node),
+      sourceNode
+    ))
+}
+
+/**
+ * Add a simple binding to a riot parser node
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } an each binding node
+ */
+export default function createSimpleBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    ...createSelectorProperties(selectorAttribute),
+    simplePropertyNode(
+      BINDING_EXPRESSIONS_KEY,
+      builders.arrayExpression([
+        ...createTextNodeExpressions(sourceNode, sourceFile, sourceCode),
+        ...createAttributeExpressions(sourceNode, sourceFile, sourceCode)
+      ])
+    )
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/bindings/slot.js b/node_modules/@riotjs/compiler/src/generators/template/bindings/slot.js
new file mode 100644
index 0000000..7198c31
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/bindings/slot.js
@@ -0,0 +1,38 @@
+import {
+  BINDING_NAME_KEY,
+  BINDING_TYPES,
+  BINDING_TYPE_KEY,
+  DEFAULT_SLOT_NAME,
+  NAME_ATTRIBUTE,
+  SLOT_BINDING_TYPE
+} from '../constants'
+import {builders} from '../../../utils/build-types'
+import {createSelectorProperties} from '../utils'
+import {findAttribute} from '../find'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+/**
+ * Transform a RiotParser.Node.Tag of type slot into a slot binding
+ * @param   { RiotParser.Node.Tag } sourceNode - slot node
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @returns { AST.Node } a slot binding node
+ */
+export default function createSlotBinding(sourceNode, selectorAttribute) {
+  const slotNameAttribute = findAttribute(NAME_ATTRIBUTE, sourceNode)
+  const slotName = slotNameAttribute ? slotNameAttribute.value : DEFAULT_SLOT_NAME
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(SLOT_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_NAME_KEY,
+      builders.literal(slotName)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/bindings/tag.js b/node_modules/@riotjs/compiler/src/generators/template/bindings/tag.js
new file mode 100644
index 0000000..bab3524
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/bindings/tag.js
@@ -0,0 +1,151 @@
+import {
+  BINDING_ATTRIBUTES_KEY,
+  BINDING_BINDINGS_KEY,
+  BINDING_EVALUATE_KEY,
+  BINDING_GET_COMPONENT_KEY,
+  BINDING_HTML_KEY,
+  BINDING_ID_KEY,
+  BINDING_SLOTS_KEY,
+  BINDING_TYPES,
+  BINDING_TYPE_KEY,
+  GET_COMPONENT_FN,
+  SLOT_ATTRIBUTE,
+  TAG_BINDING_TYPE
+} from '../constants'
+import {
+  cleanAttributes,
+  createRootNode,
+  createSelectorProperties,
+  getAttributesWithoutSelector,
+  getChildrenNodes,
+  getCustomNodeNameAsExpression,
+  getNodeAttributes,
+  toScopedFunction
+} from '../utils'
+import build from '../builder'
+import {builders} from '../../../utils/build-types'
+import compose from 'cumpa'
+import {createExpression} from '../expressions/index'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+/**
+ * Find the slots in the current component and group them under the same id
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {Object} object containing all the slots grouped by name
+ */
+function groupSlots(sourceNode) {
+  return getChildrenNodes(sourceNode).reduce((acc, node) => {
+    const slotAttribute = findSlotAttribute(node)
+
+    if (slotAttribute) {
+      acc[slotAttribute.value] = node
+    } else {
+      acc.default = createRootNode({
+        nodes: [...getChildrenNodes(acc.default), node]
+      })
+    }
+
+    return acc
+  }, {
+    default: null
+  })
+}
+
+/**
+ * Create the slot entity to pass to the riot-dom bindings
+ * @param   {string} id - slot id
+ * @param   {RiotParser.Node.Tag} sourceNode - slot root node
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} ast node containing the slot object properties
+ */
+function buildSlot(id, sourceNode, sourceFile, sourceCode) {
+  const cloneNode = {
+    ...sourceNode,
+    // avoid to render the slot attribute
+    attributes: getNodeAttributes(sourceNode).filter(attribute => attribute.name !== SLOT_ATTRIBUTE)
+  }
+  const [html, bindings] = build(cloneNode, sourceFile, sourceCode)
+
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_ID_KEY, builders.literal(id)),
+    simplePropertyNode(BINDING_HTML_KEY, builders.literal(html)),
+    simplePropertyNode(BINDING_BINDINGS_KEY, builders.arrayExpression(bindings))
+  ])
+}
+
+/**
+ * Create the AST array containing the slots
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the attributes to bind
+ */
+function createSlotsArray(sourceNode, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      slots => slots.map(([key, value]) => buildSlot(key, value, sourceFile, sourceCode)),
+      slots => slots.filter(([,value]) => value),
+      Object.entries,
+      groupSlots
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Create the AST array containing the attributes to bind to this node
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.ArrayExpression} array containing the slot objects
+ */
+function createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.arrayExpression([
+    ...compose(
+      attributes => attributes.map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode)),
+      attributes => getAttributesWithoutSelector(attributes, selectorAttribute), // eslint-disable-line
+      cleanAttributes
+    )(sourceNode)
+  ])
+}
+
+/**
+ * Find the slot attribute if it exists
+ * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+ * @returns {RiotParser.Node.Attr|undefined} the slot attribute found
+ */
+function findSlotAttribute(sourceNode) {
+  return getNodeAttributes(sourceNode).find(attribute => attribute.name === SLOT_ATTRIBUTE)
+}
+
+/**
+ * Transform a RiotParser.Node.Tag into a tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+ * @param   { string } selectorAttribute - attribute needed to select the target node
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns { AST.Node } tag binding node
+ */
+export default function createTagBinding(sourceNode, selectorAttribute, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(BINDING_TYPES),
+        builders.identifier(TAG_BINDING_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_GET_COMPONENT_KEY, builders.identifier(GET_COMPONENT_FN)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      toScopedFunction(getCustomNodeNameAsExpression(sourceNode), sourceFile, sourceCode)
+    ),
+    simplePropertyNode(BINDING_SLOTS_KEY, createSlotsArray(sourceNode, sourceFile, sourceCode)),
+    simplePropertyNode(
+      BINDING_ATTRIBUTES_KEY,
+      createBindingAttributes(sourceNode, selectorAttribute, sourceFile, sourceCode)
+    ),
+    ...createSelectorProperties(selectorAttribute)
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/builder.js b/node_modules/@riotjs/compiler/src/generators/template/builder.js
new file mode 100644
index 0000000..deb660d
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/builder.js
@@ -0,0 +1,178 @@
+import {
+  cloneNodeWithoutSelectorAttribute,
+  closeTag, createBindingSelector,
+  createRootNode,
+  getChildrenNodes,
+  getNodeAttributes,
+  nodeToString
+} from './utils'
+import {
+  hasEachAttribute, hasIfAttribute,
+  hasItsOwnTemplate,
+  isCustomNode,
+  isRootNode,
+  isSlotNode,
+  isStaticNode,
+  isTagNode,
+  isTextNode,
+  isVoidNode
+} from './checks'
+import cloneDeep from '../../utils/clone-deep'
+import eachBinding from './bindings/each'
+import ifBinding from './bindings/if'
+import panic from '../../utils/panic'
+import simpleBinding from './bindings/simple'
+import slotBinding from './bindings/slot'
+import tagBinding from './bindings/tag'
+
+
+const BuildingState = Object.freeze({
+  html: [],
+  bindings: [],
+  parent: null
+})
+
+/**
+ * Nodes having bindings should be cloned and new selector properties should be added to them
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} bindingsSelector - temporary string to identify the current node
+ * @returns {RiotParser.Node} the original node parsed having the new binding selector attribute
+ */
+function createBindingsTag(sourceNode, bindingsSelector) {
+  if (!bindingsSelector) return sourceNode
+
+  return {
+    ...sourceNode,
+    // inject the selector bindings into the node attributes
+    attributes: [{
+      name: bindingsSelector,
+      value: bindingsSelector
+    }, ...getNodeAttributes(sourceNode)]
+  }
+}
+
+/**
+ * Create a generic dynamic node (text or tag) and generate its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createDynamicNode(sourceNode, sourceFile, sourceCode, state) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    // text nodes will not have any bindings
+    return [nodeToString(sourceNode), []]
+  default:
+    return createTagWithBindings(sourceNode, sourceFile, sourceCode, state)
+  }
+}
+
+/**
+ * Create only a dynamic tag node with generating a custom selector and its bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function createTagWithBindings(sourceNode, sourceFile, sourceCode) {
+  const bindingsSelector = isRootNode(sourceNode) ? null : createBindingSelector()
+  const cloneNode = createBindingsTag(sourceNode, bindingsSelector)
+  const tagOpeningHTML = nodeToString(cloneNode)
+
+  switch(true) {
+  // EACH bindings have prio 1
+  case hasEachAttribute(cloneNode):
+    return [tagOpeningHTML, [eachBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // IF bindings have prio 2
+  case hasIfAttribute(cloneNode):
+    return [tagOpeningHTML, [ifBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // TAG bindings have prio 3
+  case isCustomNode(cloneNode):
+    return [tagOpeningHTML, [tagBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  // slot tag
+  case isSlotNode(cloneNode):
+    return [tagOpeningHTML, [slotBinding(cloneNode, bindingsSelector)]]
+  // this node has expressions bound to it
+  default:
+    return [tagOpeningHTML, [simpleBinding(cloneNode, bindingsSelector, sourceFile, sourceCode)]]
+  }
+}
+
+/**
+ * Parse a node trying to extract its template and bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and bindings for the current node
+ */
+function parseNode(sourceNode, sourceFile, sourceCode, state) {
+  // static nodes have no bindings
+  if (isStaticNode(sourceNode)) return [nodeToString(sourceNode), []]
+  return createDynamicNode(sourceNode, sourceFile, sourceCode, state)
+}
+
+/**
+ * Create the tag binding
+ * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { string } selector - binding selector
+ * @returns { Array } array with only the tag binding AST
+ */
+export function createNestedBindings(sourceNode, sourceFile, sourceCode, selector) {
+  const mightBeARiotComponent = isCustomNode(sourceNode)
+
+  return mightBeARiotComponent ? [null, [
+    tagBinding(
+      cloneNodeWithoutSelectorAttribute(sourceNode, selector),
+      null,
+      sourceFile,
+      sourceCode
+    )]
+  ] : build(createRootNode(sourceNode), sourceFile, sourceCode)
+}
+
+/**
+ * Build the template and the bindings
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {BuildingState} state - state representing the current building tree state during the recursion
+ * @returns {Array} array containing the html output and the dom bindings
+ */
+export default function build(
+  sourceNode,
+  sourceFile,
+  sourceCode,
+  state
+) {
+  if (!sourceNode) panic('Something went wrong with your tag DOM parsing, your tag template can\'t be created')
+
+  const [nodeHTML, nodeBindings] = parseNode(sourceNode, sourceFile, sourceCode, state)
+  const childrenNodes = getChildrenNodes(sourceNode)
+  const currentState = { ...cloneDeep(BuildingState), ...state }
+
+  // mutate the original arrays
+  currentState.html.push(...nodeHTML)
+  currentState.bindings.push(...nodeBindings)
+
+  // do recursion if
+  // this tag has children and it has no special directives bound to it
+  if (childrenNodes.length && !hasItsOwnTemplate(sourceNode)) {
+    childrenNodes.forEach(node => build(node, sourceFile, sourceCode, { parent: sourceNode, ...currentState }))
+  }
+
+  // close the tag if it's not a void one
+  if (isTagNode(sourceNode) && !isVoidNode(sourceNode)) {
+    currentState.html.push(closeTag(sourceNode))
+  }
+
+  return [
+    currentState.html.join(''),
+    currentState.bindings
+  ]
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/checks.js b/node_modules/@riotjs/compiler/src/generators/template/checks.js
new file mode 100644
index 0000000..18f2c44
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/checks.js
@@ -0,0 +1,194 @@
+import {
+  IS_CUSTOM_NODE,
+  IS_SPREAD_ATTRIBUTE,
+  IS_VOID_NODE,
+  PROGRESS_TAG_NODE_NAME,
+  SLOT_TAG_NODE_NAME
+} from './constants'
+import { findEachAttribute, findIfAttribute, findIsAttribute, findKeyAttribute } from './find'
+import {
+  getName,
+  getNodeAttributes
+} from './utils'
+import { isBrowserAPI, isBuiltinAPI, isNewExpression, isRaw } from '../../utils/ast-nodes-checks'
+import compose from 'cumpa'
+import { nodeTypes } from '@riotjs/parser'
+import { types } from '../../utils/build-types'
+
+/**
+ * True if the node has not expression set nor bindings directives
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only if it's a static node that doesn't need bindings or expressions
+ */
+export function isStaticNode(node) {
+  return [
+    hasExpressions,
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode,
+    isSlotNode
+  ].every(test => !test(node))
+}
+
+/**
+ * Check if a node name is part of the browser or builtin javascript api or it belongs to the current scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns {boolean} true if it's a global api variable
+ */
+export function isGlobal({ scope, node }) {
+  return Boolean(
+    isRaw(node) ||
+        isBuiltinAPI(node) ||
+        isBrowserAPI(node) ||
+        isNewExpression(node) ||
+        isNodeInScope(scope, node),
+  )
+}
+
+/**
+ * Checks if the identifier of a given node exists in a scope
+ * @param {Scope} scope - scope where to search for the identifier
+ * @param {types.Node} node - node to search for the identifier
+ * @returns {boolean} true if the node identifier is defined in the given scope
+ */
+function isNodeInScope(scope, node) {
+  const traverse = (isInScope = false) => {
+    types.visit(node, {
+      visitIdentifier(path) {
+        if (scope.lookup(getName(path.node))) {
+          isInScope = true
+        }
+
+        this.abort()
+      }
+    })
+
+    return isInScope
+  }
+
+  return traverse()
+}
+
+/**
+ * True if the node has the isCustom attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if either it's a riot component or a custom element
+ */
+export function isCustomNode(node) {
+  return !!(node[IS_CUSTOM_NODE] || hasIsAttribute(node))
+}
+
+/**
+ * True the node is <slot>
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if it's a slot node
+ */
+export function isSlotNode(node) {
+  return node.name === SLOT_TAG_NODE_NAME
+}
+
+/**
+ * True if the node has the isVoid attribute set
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the node is self closing
+ */
+export function isVoidNode(node) {
+  return !!node[IS_VOID_NODE]
+}
+
+/**
+ * True if the riot parser did find a tag node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the tag nodes
+ */
+export function isTagNode(node) {
+  return node.type === nodeTypes.TAG
+}
+
+/**
+ * True if the riot parser did find a text node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the text nodes
+ */
+export function isTextNode(node) {
+  return node.type === nodeTypes.TEXT
+}
+
+/**
+ * True if the node parsed is the root one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the root nodes
+ */
+export function isRootNode(node) {
+  return node.isRoot
+}
+
+/**
+ * True if the attribute parsed is of type spread one
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true if the attribute node is of type spread
+ */
+export function isSpreadAttribute(node) {
+  return node[IS_SPREAD_ATTRIBUTE]
+}
+
+/**
+ * True if the node is an attribute and its name is "value"
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for value attribute nodes
+ */
+export function isValueAttribute(node) {
+  return node.name === 'value'
+}
+
+/**
+ * True if the DOM node is a progress tag
+ * @param   {RiotParser.Node}  node - riot parser node
+ * @returns {boolean} true for the progress tags
+ */
+export function isProgressNode(node) {
+  return node.name === PROGRESS_TAG_NODE_NAME
+}
+
+/**
+ * True if the node is an attribute and a DOM handler
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for dom listener attribute nodes
+ */
+export const isEventAttribute = (() => {
+  const EVENT_ATTR_RE = /^on/
+  return node => EVENT_ATTR_RE.test(node.name)
+})()
+
+/**
+ * True if the node has expressions or expression attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} ditto
+ */
+export function hasExpressions(node) {
+  return !!(
+    node.expressions ||
+        // has expression attributes
+        (getNodeAttributes(node).some(attribute => hasExpressions(attribute))) ||
+        // has child text nodes with expressions
+        (node.nodes && node.nodes.some(node => isTextNode(node) && hasExpressions(node)))
+  )
+}
+
+/**
+ * True if the node is a directive having its own template
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {boolean} true only for the IF EACH and TAG bindings
+ */
+export function hasItsOwnTemplate(node) {
+  return [
+    findEachAttribute,
+    findIfAttribute,
+    isCustomNode
+  ].some(test => test(node))
+}
+
+export const hasIfAttribute = compose(Boolean, findIfAttribute)
+export const hasEachAttribute = compose(Boolean, findEachAttribute)
+export const hasIsAttribute = compose(Boolean, findIsAttribute)
+export const hasKeyAttribute = compose(Boolean, findKeyAttribute)
diff --git a/node_modules/@riotjs/compiler/src/generators/template/constants.js b/node_modules/@riotjs/compiler/src/generators/template/constants.js
new file mode 100644
index 0000000..6c1d9b0
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/constants.js
@@ -0,0 +1,64 @@
+// import {IS_BOOLEAN,IS_CUSTOM,IS_RAW,IS_SPREAD,IS_VOID} from '@riotjs/parser/src/constants'
+
+export const BINDING_TYPES = 'bindingTypes'
+export const EACH_BINDING_TYPE = 'EACH'
+export const IF_BINDING_TYPE = 'IF'
+export const TAG_BINDING_TYPE = 'TAG'
+export const SLOT_BINDING_TYPE = 'SLOT'
+
+
+export const EXPRESSION_TYPES = 'expressionTypes'
+export const ATTRIBUTE_EXPRESSION_TYPE = 'ATTRIBUTE'
+export const VALUE_EXPRESSION_TYPE = 'VALUE'
+export const TEXT_EXPRESSION_TYPE = 'TEXT'
+export const EVENT_EXPRESSION_TYPE = 'EVENT'
+
+export const TEMPLATE_FN = 'template'
+export const SCOPE = 'scope'
+export const GET_COMPONENT_FN = 'getComponent'
+
+// keys needed to create the DOM bindings
+export const BINDING_SELECTOR_KEY = 'selector'
+export const BINDING_GET_COMPONENT_KEY = 'getComponent'
+export const BINDING_TEMPLATE_KEY = 'template'
+export const BINDING_TYPE_KEY = 'type'
+export const BINDING_REDUNDANT_ATTRIBUTE_KEY = 'redundantAttribute'
+export const BINDING_CONDITION_KEY = 'condition'
+export const BINDING_ITEM_NAME_KEY = 'itemName'
+export const BINDING_GET_KEY_KEY = 'getKey'
+export const BINDING_INDEX_NAME_KEY = 'indexName'
+export const BINDING_EVALUATE_KEY = 'evaluate'
+export const BINDING_NAME_KEY = 'name'
+export const BINDING_SLOTS_KEY = 'slots'
+export const BINDING_EXPRESSIONS_KEY = 'expressions'
+export const BINDING_CHILD_NODE_INDEX_KEY = 'childNodeIndex'
+// slots keys
+export const BINDING_BINDINGS_KEY = 'bindings'
+export const BINDING_ID_KEY = 'id'
+export const BINDING_HTML_KEY = 'html'
+export const BINDING_ATTRIBUTES_KEY = 'attributes'
+
+// DOM directives
+export const IF_DIRECTIVE = 'if'
+export const EACH_DIRECTIVE = 'each'
+export const KEY_ATTRIBUTE = 'key'
+export const SLOT_ATTRIBUTE = 'slot'
+export const NAME_ATTRIBUTE = 'name'
+export const IS_DIRECTIVE = 'is'
+
+// Misc
+export const DEFAULT_SLOT_NAME = 'default'
+export const TEXT_NODE_EXPRESSION_PLACEHOLDER = '<!---->'
+export const BINDING_SELECTOR_PREFIX = 'expr'
+export const SLOT_TAG_NODE_NAME = 'slot'
+export const PROGRESS_TAG_NODE_NAME = 'progress'
+
+// Riot Parser constants
+// TODO: import these values dynamically
+export const IS_RAW_NODE = 'isRaw'
+export const IS_VOID_NODE = 'isVoid'
+export const IS_CUSTOM_NODE = 'isCustom'
+export const IS_BOOLEAN_ATTRIBUTE = 'isBoolean'
+export const IS_SPREAD_ATTRIBUTE = 'isSpread'
+
+
diff --git a/node_modules/@riotjs/compiler/src/generators/template/expressions/attribute.js b/node_modules/@riotjs/compiler/src/generators/template/expressions/attribute.js
new file mode 100644
index 0000000..c55ed53
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/expressions/attribute.js
@@ -0,0 +1,36 @@
+import {
+  ATTRIBUTE_EXPRESSION_TYPE,
+  BINDING_EVALUATE_KEY,
+  BINDING_NAME_KEY,
+  BINDING_TYPE_KEY,
+  EXPRESSION_TYPES
+} from '../constants'
+import {nullNode, simplePropertyNode} from '../../../utils/custom-ast-nodes'
+import {builders} from '../../../utils/build-types'
+import {createAttributeEvaluationFunction} from '../utils'
+import {isSpreadAttribute} from '../checks'
+
+
+/**
+ * Create a simple attribute expression
+ * @param   {RiotParser.Node.Attr} sourceNode - the custom tag
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+export default function createAttributeExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(ATTRIBUTE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, isSpreadAttribute(sourceNode) ? nullNode() : builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/expressions/event.js b/node_modules/@riotjs/compiler/src/generators/template/expressions/event.js
new file mode 100644
index 0000000..c6fc45f
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/expressions/event.js
@@ -0,0 +1,34 @@
+import {
+  BINDING_EVALUATE_KEY,
+  BINDING_NAME_KEY,
+  BINDING_TYPE_KEY,
+  EVENT_EXPRESSION_TYPE,
+  EXPRESSION_TYPES
+} from '../constants'
+import {builders} from '../../../utils/build-types'
+import {createAttributeEvaluationFunction} from '../utils'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+/**
+ * Create a simple event expression
+ * @param   {RiotParser.Node.Attr} sourceNode - attribute containing the event handlers
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+export default function createEventExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(EVENT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(BINDING_NAME_KEY, builders.literal(sourceNode.name)),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/expressions/index.js b/node_modules/@riotjs/compiler/src/generators/template/expressions/index.js
new file mode 100644
index 0000000..09d1b42
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/expressions/index.js
@@ -0,0 +1,34 @@
+import {isEventAttribute, isProgressNode, isTextNode, isValueAttribute} from '../checks'
+import attributeExpression from './attribute'
+import eventExpression from './event'
+import {findDynamicAttributes} from '../find'
+import {hasValueAttribute} from 'dom-nodes'
+import textExpression from './text'
+import valueExpression from './value'
+
+export function createExpression(sourceNode, sourceFile, sourceCode, childNodeIndex, parentNode) {
+  switch (true) {
+  case isTextNode(sourceNode):
+    return textExpression(sourceNode, sourceFile, sourceCode, childNodeIndex)
+  // progress nodes value attributes will be rendered as attributes
+  // see https://github.com/riot/compiler/issues/122
+  case isValueAttribute(sourceNode) && hasValueAttribute(parentNode.name) && !isProgressNode(parentNode):
+    return valueExpression(sourceNode, sourceFile, sourceCode)
+  case isEventAttribute(sourceNode):
+    return eventExpression(sourceNode, sourceFile, sourceCode)
+  default:
+    return attributeExpression(sourceNode, sourceFile, sourceCode)
+  }
+}
+
+/**
+ * Create the attribute expressions
+ * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @returns {Array} array containing all the attribute expressions
+ */
+export function createAttributeExpressions(sourceNode, sourceFile, sourceCode) {
+  return findDynamicAttributes(sourceNode)
+    .map(attribute => createExpression(attribute, sourceFile, sourceCode, 0, sourceNode))
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/expressions/text.js b/node_modules/@riotjs/compiler/src/generators/template/expressions/text.js
new file mode 100644
index 0000000..cb69cd0
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/expressions/text.js
@@ -0,0 +1,90 @@
+import {
+  BINDING_CHILD_NODE_INDEX_KEY,
+  BINDING_EVALUATE_KEY,
+  BINDING_TYPE_KEY,
+  EXPRESSION_TYPES,
+  TEXT_EXPRESSION_TYPE
+} from '../constants'
+import {createArrayString, transformExpression, wrapASTInFunctionWithScope} from '../utils'
+import {nullNode,simplePropertyNode} from '../../../utils/custom-ast-nodes'
+import {builders} from '../../../utils/build-types'
+import {isLiteral} from '../../../utils/ast-nodes-checks'
+import unescapeChar from '../../../utils/unescape-char'
+
+/**
+ * Generate the pure immutable string chunks from a RiotParser.Node.Text
+ * @param   {RiotParser.Node.Text} node - riot parser text node
+ * @param   {string} sourceCode sourceCode - source code
+ * @returns {Array} array containing the immutable string chunks
+ */
+function generateLiteralStringChunksFromNode(node, sourceCode) {
+  return node.expressions.reduce((chunks, expression, index) => {
+    const start = index ? node.expressions[index - 1].end : node.start
+
+    chunks.push(sourceCode.substring(start, expression.start))
+
+    // add the tail to the string
+    if (index === node.expressions.length - 1)
+      chunks.push(sourceCode.substring(expression.end, node.end))
+
+    return chunks
+  }, []).map(str => node.unescape ? unescapeChar(str, node.unescape) : str)
+}
+
+/**
+ * Simple bindings might contain multiple expressions like for example: "{foo} and {bar}"
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+export function mergeNodeExpressions(node, sourceFile, sourceCode) {
+  if (node.parts.length === 1)
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+
+  const pureStringChunks = generateLiteralStringChunksFromNode(node, sourceCode)
+  const stringsArray = pureStringChunks.reduce((acc, str, index) => {
+    const expr = node.expressions[index]
+
+    return [
+      ...acc,
+      builders.literal(str),
+      expr ? transformExpression(expr, sourceFile, sourceCode) : nullNode()
+    ]
+  }, [])
+    // filter the empty literal expressions
+    .filter(expr => !isLiteral(expr) || expr.value)
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a text expression
+ * @param   {RiotParser.Node.Text} sourceNode - text node to parse
+ * @param   {string} sourceFile - source file path
+ * @param   {string} sourceCode - original source
+ * @param   {number} childNodeIndex - position of the child text node in its parent children nodes
+ * @returns {AST.Node} object containing the expression binding keys
+ */
+export default function createTextExpression(sourceNode, sourceFile, sourceCode, childNodeIndex) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(TEXT_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_CHILD_NODE_INDEX_KEY,
+      builders.literal(childNodeIndex)
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      wrapASTInFunctionWithScope(
+        mergeNodeExpressions(sourceNode, sourceFile, sourceCode)
+      )
+    )
+  ])
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/generators/template/expressions/value.js b/node_modules/@riotjs/compiler/src/generators/template/expressions/value.js
new file mode 100644
index 0000000..49ed5d6
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/expressions/value.js
@@ -0,0 +1,25 @@
+import {
+  BINDING_EVALUATE_KEY,
+  BINDING_TYPE_KEY,
+  EXPRESSION_TYPES,
+  VALUE_EXPRESSION_TYPE
+} from '../constants'
+import {builders} from '../../../utils/build-types'
+import {createAttributeEvaluationFunction} from '../utils'
+import {simplePropertyNode} from '../../../utils/custom-ast-nodes'
+
+export default function createValueExpression(sourceNode, sourceFile, sourceCode) {
+  return builders.objectExpression([
+    simplePropertyNode(BINDING_TYPE_KEY,
+      builders.memberExpression(
+        builders.identifier(EXPRESSION_TYPES),
+        builders.identifier(VALUE_EXPRESSION_TYPE),
+        false
+      ),
+    ),
+    simplePropertyNode(
+      BINDING_EVALUATE_KEY,
+      createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode)
+    )
+  ])
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/find.js b/node_modules/@riotjs/compiler/src/generators/template/find.js
new file mode 100644
index 0000000..e88797e
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/find.js
@@ -0,0 +1,47 @@
+import { EACH_DIRECTIVE, IF_DIRECTIVE, IS_DIRECTIVE, KEY_ATTRIBUTE } from './constants'
+import { getName, getNodeAttributes } from './utils'
+import { hasExpressions } from './checks'
+
+/**
+ * Find the attribute node
+ * @param   { string } name -  name of the attribute we want to find
+ * @param   { riotParser.nodeTypes.TAG } node - a tag node
+ * @returns { riotParser.nodeTypes.ATTR } attribute node
+ */
+export function findAttribute(name, node) {
+  return node.attributes && node.attributes.find(attr => getName(attr) === name)
+}
+
+export function findIfAttribute(node) {
+  return findAttribute(IF_DIRECTIVE, node)
+}
+
+export function findEachAttribute(node) {
+  return findAttribute(EACH_DIRECTIVE, node)
+}
+
+export function findKeyAttribute(node) {
+  return findAttribute(KEY_ATTRIBUTE, node)
+}
+
+export function findIsAttribute(node) {
+  return findAttribute(IS_DIRECTIVE, node)
+}
+
+/**
+ * Find all the node attributes that are not expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the static attributes
+ */
+export function findStaticAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => !hasExpressions(attribute))
+}
+
+/**
+ * Find all the node attributes that have expressions
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array} list of all the dynamic attributes
+ */
+export function findDynamicAttributes(node) {
+  return getNodeAttributes(node).filter(hasExpressions)
+}
diff --git a/node_modules/@riotjs/compiler/src/generators/template/index.js b/node_modules/@riotjs/compiler/src/generators/template/index.js
new file mode 100644
index 0000000..60a7bf0
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/index.js
@@ -0,0 +1,74 @@
+import {BINDING_TYPES, EXPRESSION_TYPES, GET_COMPONENT_FN, TEMPLATE_FN} from './constants'
+import {builders, types} from '../../utils/build-types'
+import {callTemplateFunction, createRootNode} from './utils'
+import {TAG_TEMPLATE_PROPERTY} from '../../constants'
+import build from './builder'
+
+const templateFunctionArguments = [
+  TEMPLATE_FN,
+  EXPRESSION_TYPES,
+  BINDING_TYPES,
+  GET_COMPONENT_FN
+].map(builders.identifier)
+
+/**
+ * Create the content of the template function
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @returns {AST.BlockStatement} the content of the template function
+ */
+function createTemplateFunctionContent(sourceNode, sourceFile, sourceCode) {
+  return builders.blockStatement([
+    builders.returnStatement(
+      callTemplateFunction(
+        ...build(
+          createRootNode(sourceNode),
+          sourceFile,
+          sourceCode
+        )
+      )
+    )
+  ])
+}
+
+/**
+ * Extend the AST adding the new template property containing our template call to render the component
+ * @param   { Object } ast - current output ast
+ * @param   { string } sourceFile - source file path
+ * @param   { string } sourceCode - original source
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @returns { Object } the output ast having the "template" key
+ */
+function extendTemplateProperty(ast, sourceFile, sourceCode, sourceNode) {
+  types.visit(ast, {
+    visitProperty(path) {
+      if (path.value.key.value === TAG_TEMPLATE_PROPERTY) {
+        path.value.value = builders.functionExpression(
+          null,
+          templateFunctionArguments,
+          createTemplateFunctionContent(sourceNode, sourceFile, sourceCode)
+        )
+
+        return false
+      }
+
+      this.traverse(path)
+    }
+  })
+
+  return ast
+}
+
+/**
+ * Generate the component template logic
+ * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+ * @param   { string } source - original component source code
+ * @param   { Object } meta - compilation meta information
+ * @param   { AST } ast - current AST output
+ * @returns { AST } the AST generated
+ */
+export default function template(sourceNode, source, meta, ast) {
+  const { options } = meta
+  return  extendTemplateProperty(ast, options.file, source, sourceNode)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/generators/template/utils.js b/node_modules/@riotjs/compiler/src/generators/template/utils.js
new file mode 100644
index 0000000..f67df1b
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/generators/template/utils.js
@@ -0,0 +1,486 @@
+import {
+  BINDING_REDUNDANT_ATTRIBUTE_KEY,
+  BINDING_SELECTOR_KEY,
+  BINDING_SELECTOR_PREFIX,
+  BINDING_TEMPLATE_KEY,
+  EACH_DIRECTIVE,
+  IF_DIRECTIVE,
+  IS_BOOLEAN_ATTRIBUTE,
+  IS_DIRECTIVE,
+  KEY_ATTRIBUTE,
+  SCOPE,
+  SLOT_ATTRIBUTE,
+  TEMPLATE_FN,
+  TEXT_NODE_EXPRESSION_PLACEHOLDER
+} from './constants'
+import { builders, types } from '../../utils/build-types'
+import { findIsAttribute, findStaticAttributes } from './find'
+import { hasExpressions, isGlobal, isTagNode, isTextNode, isVoidNode } from './checks'
+import { isBinaryExpression, isIdentifier, isLiteral, isThisExpression } from '../../utils/ast-nodes-checks'
+import { nullNode, simplePropertyNode } from '../../utils/custom-ast-nodes'
+import addLinesOffset from '../../utils/add-lines-offset'
+import compose from 'cumpa'
+import generateAST from '../../utils/generate-ast'
+import unescapeChar from '../../utils/unescape-char'
+
+const scope = builders.identifier(SCOPE)
+export const getName = node => node && node.name ? node.name : node
+
+/**
+ * Replace the path scope with a member Expression
+ * @param   { types.NodePath } path - containing the current node visited
+ * @param   { types.Node } property - node we want to prefix with the scope identifier
+ * @returns {undefined} this is a void function
+ */
+function replacePathScope(path, property) {
+  path.replace(builders.memberExpression(
+    scope,
+    property,
+    false
+  ))
+}
+
+/**
+ * Change the nodes scope adding the `scope` prefix
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ * @context { types.visit }
+ */
+function updateNodeScope(path) {
+  if (!isGlobal(path)) {
+    replacePathScope(path, path.node)
+
+    return false
+  }
+
+  this.traverse(path)
+}
+
+/**
+ * Change the scope of the member expressions
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return always false because we want to check only the first node object
+ */
+function visitMemberExpression(path) {
+  if (!isGlobal(path) && !isGlobal({ node: path.node.object, scope: path.scope })) {
+    if (path.value.computed) {
+      this.traverse(path)
+    } else if (isBinaryExpression(path.node.object) || path.node.object.computed) {
+      this.traverse(path.get('object'))
+    } else if (!path.node.object.callee) {
+      replacePathScope(path, isThisExpression(path.node.object) ? path.node.property : path.node)
+    } else {
+      this.traverse(path.get('object'))
+    }
+  }
+
+  return false
+}
+
+
+/**
+ * Objects properties should be handled a bit differently from the Identifier
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean } return false if we want to stop the tree traversal
+ */
+function visitProperty(path) {
+  const value = path.node.value
+
+  if (isIdentifier(value)) {
+    updateNodeScope(path.get('value'))
+  } else {
+    this.traverse(path.get('value'))
+  }
+
+  return false
+}
+
+/**
+ * The this expressions should be replaced with the scope
+ * @param   { types.NodePath } path - containing the current node visited
+ * @returns { boolean|undefined } return false if we want to stop the tree traversal
+ */
+function visitThisExpression(path) {
+  path.replace(scope)
+  this.traverse(path)
+}
+
+
+/**
+ * Update the scope of the global nodes
+ * @param   { Object } ast - ast program
+ * @returns { Object } the ast program with all the global nodes updated
+ */
+export function updateNodesScope(ast) {
+  const ignorePath = () => false
+
+  types.visit(ast, {
+    visitIdentifier: updateNodeScope,
+    visitMemberExpression,
+    visitProperty,
+    visitThisExpression,
+    visitClassExpression: ignorePath
+  })
+
+  return ast
+}
+
+/**
+ * Convert any expression to an AST tree
+ * @param   { Object } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } the ast generated
+ */
+export function createASTFromExpression(expression, sourceFile, sourceCode) {
+  const code = sourceFile ?
+    addLinesOffset(expression.text, sourceCode, expression) :
+    expression.text
+
+  return generateAST(`(${code})`, {
+    sourceFileName: sourceFile
+  })
+}
+
+/**
+ * Create the bindings template property
+ * @param   {Array} args - arguments to pass to the template function
+ * @returns {ASTNode} a binding template key
+ */
+export function createTemplateProperty(args) {
+  return simplePropertyNode(
+    BINDING_TEMPLATE_KEY,
+    args ? callTemplateFunction(...args) : nullNode()
+  )
+}
+
+/**
+ * Try to get the expression of an attribute node
+ * @param   { RiotParser.Node.Attribute } attribute - riot parser attribute node
+ * @returns { RiotParser.Node.Expression } attribute expression value
+ */
+export function getAttributeExpression(attribute) {
+  return attribute.expressions ? attribute.expressions[0] : {
+    // if no expression was found try to typecast the attribute value
+    ...attribute,
+    text: attribute.value
+  }
+}
+
+/**
+ * Wrap the ast generated in a function call providing the scope argument
+ * @param   {Object} ast - function body
+ * @returns {FunctionExpresion} function having the scope argument injected
+ */
+export function wrapASTInFunctionWithScope(ast) {
+  return builders.functionExpression(
+    null,
+    [scope],
+    builders.blockStatement([builders.returnStatement(
+      ast
+    )])
+  )
+}
+
+/**
+ * Convert any parser option to a valid template one
+ * @param   { RiotParser.Node.Expression } expression - expression parsed by the riot parser
+ * @param   { string } sourceFile - original tag file
+ * @param   { string } sourceCode - original tag source code
+ * @returns { Object } a FunctionExpression object
+ *
+ * @example
+ *  toScopedFunction('foo + bar') // scope.foo + scope.bar
+ *
+ * @example
+ *  toScopedFunction('foo.baz + bar') // scope.foo.baz + scope.bar
+ */
+export function toScopedFunction(expression, sourceFile, sourceCode) {
+  return compose(
+    wrapASTInFunctionWithScope,
+    transformExpression,
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Transform an expression node updating its global scope
+ * @param   {RiotParser.Node.Expr} expression - riot parser expression node
+ * @param   {string} sourceFile - source file
+ * @param   {string} sourceCode - source code
+ * @returns {ASTExpression} ast expression generated from the riot parser expression node
+ */
+export function transformExpression(expression, sourceFile, sourceCode) {
+  return compose(
+    getExpressionAST,
+    updateNodesScope,
+    createASTFromExpression
+  )(expression, sourceFile, sourceCode)
+}
+
+/**
+ * Get the parsed AST expression of riot expression node
+ * @param   {AST.Program} sourceAST - raw node parsed
+ * @returns {AST.Expression} program expression output
+ */
+export function getExpressionAST(sourceAST) {
+  const astBody = sourceAST.program.body
+
+  return astBody[0] ? astBody[0].expression : astBody
+}
+
+/**
+ * Create the template call function
+ * @param   {Array|string|Node.Literal} template - template string
+ * @param   {Array<AST.Nodes>} bindings - template bindings provided as AST nodes
+ * @returns {Node.CallExpression} template call expression
+ */
+export function callTemplateFunction(template, bindings) {
+  return builders.callExpression(builders.identifier(TEMPLATE_FN), [
+    template ? builders.literal(template) : nullNode(),
+    bindings ? builders.arrayExpression(bindings) : nullNode()
+  ])
+}
+
+/**
+ * Convert any DOM attribute into a valid DOM selector useful for the querySelector API
+ * @param   { string } attributeName - name of the attribute to query
+ * @returns { string } the attribute transformed to a query selector
+ */
+export const attributeNameToDOMQuerySelector = attributeName => `[${attributeName}]`
+
+/**
+ * Create the properties to query a DOM node
+ * @param   { string } attributeName - attribute name needed to identify a DOM node
+ * @returns { Array<AST.Node> } array containing the selector properties needed for the binding
+ */
+export function createSelectorProperties(attributeName) {
+  return attributeName ? [
+    simplePropertyNode(BINDING_REDUNDANT_ATTRIBUTE_KEY, builders.literal(attributeName)),
+    simplePropertyNode(BINDING_SELECTOR_KEY,
+      compose(builders.literal, attributeNameToDOMQuerySelector)(attributeName)
+    )
+  ] : []
+}
+
+/**
+ * Clone the node filtering out the selector attribute from the attributes list
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {RiotParser.Node} the node with the attribute cleaned up
+ */
+export function cloneNodeWithoutSelectorAttribute(node, selectorAttribute) {
+  return {
+    ...node,
+    attributes: getAttributesWithoutSelector(getNodeAttributes(node), selectorAttribute)
+  }
+}
+
+
+/**
+ * Get the node attributes without the selector one
+ * @param   {Array<RiotParser.Attr>} attributes - attributes list
+ * @param   {string} selectorAttribute - name of the selector attribute to filter out
+ * @returns {Array<RiotParser.Attr>} filtered attributes
+ */
+export function getAttributesWithoutSelector(attributes, selectorAttribute) {
+  if (selectorAttribute)
+    return attributes.filter(attribute => attribute.name !== selectorAttribute)
+
+  return attributes
+}
+
+/**
+ * Clean binding or custom attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attr>} only the attributes that are not bindings or directives
+ */
+export function cleanAttributes(node) {
+  return getNodeAttributes(node).filter(attribute => ![
+    IF_DIRECTIVE,
+    EACH_DIRECTIVE,
+    KEY_ATTRIBUTE,
+    SLOT_ATTRIBUTE,
+    IS_DIRECTIVE
+  ].includes(attribute.name))
+}
+
+/**
+ * Create a root node proxing only its nodes and attributes
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node} root node
+ */
+export function createRootNode(node) {
+  return {
+    nodes: getChildrenNodes(node),
+    isRoot: true,
+    // root nodes shuold't have directives
+    attributes: cleanAttributes(node)
+  }
+}
+
+/**
+ * Get all the child nodes of a RiotParser.Node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node>} all the child nodes found
+ */
+export function getChildrenNodes(node) {
+  return node && node.nodes ? node.nodes : []
+}
+
+/**
+ * Get all the attributes of a riot parser node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {Array<RiotParser.Node.Attribute>} all the attributes find
+ */
+export function getNodeAttributes(node) {
+  return node.attributes ? node.attributes : []
+}
+/**
+ * Get the name of a custom node transforming it into an expression node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {RiotParser.Node.Attr} the node name as expression attribute
+ */
+export function getCustomNodeNameAsExpression(node) {
+  const isAttribute = findIsAttribute(node)
+  const toRawString = val => `'${val}'`
+
+  if (isAttribute) {
+    return isAttribute.expressions ? isAttribute.expressions[0] : {
+      ...isAttribute,
+      text: toRawString(isAttribute.value)
+    }
+  }
+
+  return { ...node, text: toRawString(getName(node)) }
+}
+
+/**
+ * Convert all the node static attributes to strings
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} all the node static concatenated as string
+ */
+export function staticAttributesToString(node) {
+  return findStaticAttributes(node)
+    .map(attribute => attribute[IS_BOOLEAN_ATTRIBUTE] || !attribute.value ?
+      attribute.name :
+      `${attribute.name}="${unescapeNode(attribute, 'value').value}"`
+    ).join(' ')
+}
+
+/**
+ * Make sure that node escaped chars will be unescaped
+ * @param   {RiotParser.Node} node - riot parser node
+ * @param   {string} key - key property to unescape
+ * @returns {RiotParser.Node} node with the text property unescaped
+ */
+export function unescapeNode(node, key) {
+  if (node.unescape) {
+    return {
+      ...node,
+      [key]: unescapeChar(node[key], node.unescape)
+    }
+  }
+
+  return node
+}
+
+
+/**
+ * Convert a riot parser opening node into a string
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the node as string
+ */
+export function nodeToString(node) {
+  const attributes = staticAttributesToString(node)
+
+  switch(true) {
+  case isTagNode(node):
+    return `<${node.name}${attributes ? ` ${attributes}` : ''}${isVoidNode(node) ? '/' : ''}>`
+  case isTextNode(node):
+    return hasExpressions(node) ? TEXT_NODE_EXPRESSION_PLACEHOLDER : unescapeNode(node, 'text').text
+  default:
+    return ''
+  }
+}
+
+/**
+ * Close an html node
+ * @param   {RiotParser.Node} node - riot parser node
+ * @returns {string} the closing tag of the html tag node passed to this function
+ */
+export function closeTag(node) {
+  return node.name ? `</${node.name}>` : ''
+}
+
+/**
+ * Create a strings array with the `join` call to transform it into a string
+ * @param   {Array} stringsArray - array containing all the strings to concatenate
+ * @returns {AST.CallExpression} array with a `join` call
+ */
+export function createArrayString(stringsArray) {
+  return builders.callExpression(
+    builders.memberExpression(
+      builders.arrayExpression(stringsArray),
+      builders.identifier('join'),
+      false
+    ),
+    [builders.literal('')],
+  )
+}
+
+/**
+ * Simple expression bindings might contain multiple expressions like for example: "class="{foo} red {bar}""
+ * This helper aims to merge them in a template literal if it's necessary
+ * @param   {RiotParser.Attr} node - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { Object } a template literal expression object
+ */
+export function mergeAttributeExpressions(node, sourceFile, sourceCode) {
+  if (!node.parts || node.parts.length === 1) {
+    return transformExpression(node.expressions[0], sourceFile, sourceCode)
+  }
+  const stringsArray = [
+    ...node.parts.reduce((acc, str) => {
+      const expression = node.expressions.find(e => e.text.trim() === str)
+
+      return [
+        ...acc,
+        expression ? transformExpression(expression, sourceFile, sourceCode) : builders.literal(str)
+      ]
+    }, [])
+  ].filter(expr => !isLiteral(expr) || expr.value)
+
+
+  return createArrayString(stringsArray)
+}
+
+/**
+ * Create a selector that will be used to find the node via dom-bindings
+ * @param   {number} id - temporary variable that will be increased anytime this function will be called
+ * @returns {string} selector attribute needed to bind a riot expression
+ */
+export const createBindingSelector = (function createSelector(id = 0) {
+  return () => `${BINDING_SELECTOR_PREFIX}${id++}`
+}())
+
+/**
+ * Create an attribute evaluation function
+ * @param   {RiotParser.Attr} sourceNode - riot parser node
+ * @param   {string} sourceFile - original tag file
+ * @param   {string} sourceCode - original tag source code
+ * @returns { AST.Node } an AST function expression to evaluate the attribute value
+ */
+export function createAttributeEvaluationFunction(sourceNode, sourceFile, sourceCode) {
+  return hasExpressions(sourceNode) ?
+  // dynamic attribute
+    wrapASTInFunctionWithScope(mergeAttributeExpressions(sourceNode, sourceFile, sourceCode)) :
+  // static attribute
+    builders.functionExpression(
+      null,
+      [],
+      builders.blockStatement([
+        builders.returnStatement(builders.literal(sourceNode.value || true))
+      ]),
+    )
+}
diff --git a/node_modules/@riotjs/compiler/src/index.js b/node_modules/@riotjs/compiler/src/index.js
new file mode 100644
index 0000000..9aab1a2
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/index.js
@@ -0,0 +1,156 @@
+import { TAG_CSS_PROPERTY, TAG_LOGIC_PROPERTY, TAG_NAME_PROPERTY, TAG_TEMPLATE_PROPERTY } from './constants'
+import { nullNode, simplePropertyNode } from './utils/custom-ast-nodes'
+import { register as registerPostproc, execute as runPostprocessors  } from './postprocessors'
+import { register as registerPreproc, execute as runPreprocessor } from './preprocessors'
+import {builders} from './utils/build-types'
+import compose from 'cumpa'
+import cssGenerator from './generators/css/index'
+import curry from 'curri'
+import generateJavascript from './utils/generate-javascript'
+import isEmptySourcemap from './utils/is-empty-sourcemap'
+import javascriptGenerator from './generators/javascript/index'
+import riotParser from '@riotjs/parser'
+import sourcemapAsJSON from './utils/sourcemap-as-json'
+import templateGenerator from './generators/template/index'
+
+const DEFAULT_OPTIONS = {
+  template: 'default',
+  file: '[unknown-source-file]',
+  scopedCss: true
+}
+
+/**
+ * Create the initial AST
+ * @param {string} tagName - the name of the component we have compiled
+ * @returns { AST } the initial AST
+ *
+ * @example
+ * // the output represents the following string in AST
+ */
+export function createInitialInput({tagName}) {
+  /*
+  generates
+  export default {
+     ${TAG_CSS_PROPERTY}: null,
+     ${TAG_LOGIC_PROPERTY}: null,
+     ${TAG_TEMPLATE_PROPERTY}: null
+  }
+  */
+  return builders.program([
+    builders.exportDefaultDeclaration(
+      builders.objectExpression([
+        simplePropertyNode(TAG_CSS_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_LOGIC_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_TEMPLATE_PROPERTY, nullNode()),
+        simplePropertyNode(TAG_NAME_PROPERTY, builders.literal(tagName))
+      ])
+    )]
+  )
+}
+
+/**
+ * Make sure the input sourcemap is valid otherwise we ignore it
+ * @param   {SourceMapGenerator} map - preprocessor source map
+ * @returns {Object} sourcemap as json or nothing
+ */
+function normaliseInputSourceMap(map) {
+  const inputSourceMap = sourcemapAsJSON(map)
+  return isEmptySourcemap(inputSourceMap) ? null : inputSourceMap
+}
+
+/**
+ * Override the sourcemap content making sure it will always contain the tag source code
+ * @param   {Object} map - sourcemap as json
+ * @param   {string} source - component source code
+ * @returns {Object} original source map with the "sourcesContent" property overriden
+ */
+function overrideSourcemapContent(map, source) {
+  return {
+    ...map,
+    sourcesContent: [source]
+  }
+}
+
+/**
+ * Create the compilation meta object
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } options - compiling options
+ * @returns {Object} meta object
+ */
+function createMeta(source, options) {
+  return {
+    tagName: null,
+    fragments: null,
+    options: {
+      ...DEFAULT_OPTIONS,
+      ...options
+    },
+    source
+  }
+}
+
+/**
+ * Generate the output code source together with the sourcemap
+ * @param { string } source - source code of the tag we will need to compile
+ * @param { string } opts - compiling options
+ * @returns { Output } object containing output code and source map
+ */
+export function compile(source, opts = {}) {
+  const meta = createMeta(source, opts)
+  const {options} = meta
+  const { code, map } = runPreprocessor('template', options.template, meta, source)
+  const { template, css, javascript } = riotParser(options).parse(code).output
+
+  // extend the meta object with the result of the parsing
+  Object.assign(meta, {
+    tagName: template.name,
+    fragments: { template, css, javascript }
+  })
+
+  return compose(
+    result => ({ ...result, meta }),
+    result => runPostprocessors(result, meta),
+    result => ({
+      ...result,
+      map: overrideSourcemapContent(result.map, source)
+    }),
+    ast => meta.ast = ast && generateJavascript(ast, {
+      sourceMapName: `${options.file}.map`,
+      inputSourceMap: normaliseInputSourceMap(map)
+    }),
+    hookGenerator(templateGenerator, template, code, meta),
+    hookGenerator(javascriptGenerator, javascript, code, meta),
+    hookGenerator(cssGenerator, css, code, meta),
+  )(createInitialInput(meta))
+}
+
+/**
+ * Prepare the riot parser node transformers
+ * @param   { Function } transformer - transformer function
+ * @param   { Object } sourceNode - riot parser node
+ * @param   { string } source - component source code
+ * @param   { Object } meta - compilation meta information
+ * @returns { Promise<Output> } object containing output code and source map
+ */
+function hookGenerator(transformer, sourceNode, source, meta) {
+  if (
+    // filter missing nodes
+    !sourceNode ||
+    // filter nodes without children
+    (sourceNode.nodes && !sourceNode.nodes.length) ||
+    // filter empty javascript and css nodes
+    (!sourceNode.nodes && !sourceNode.text)) {
+    return result => result
+  }
+
+  return curry(transformer)(sourceNode, source, meta)
+}
+
+// This function can be used to register new preprocessors
+// a preprocessor can target either only the css or javascript nodes
+// or the complete tag source file ('template')
+export const registerPreprocessor = registerPreproc
+
+// This function can allow you to register postprocessors that will parse the output code
+// here we can run prettifiers, eslint fixes...
+export const registerPostprocessor = registerPostproc
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/postprocessors.js b/node_modules/@riotjs/compiler/src/postprocessors.js
new file mode 100644
index 0000000..48b144d
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/postprocessors.js
@@ -0,0 +1,53 @@
+import composeSourcemaps from './utils/compose-sourcemaps'
+import { createOutput } from './transformer'
+import panic from './utils/panic'
+
+export const postprocessors = new Set()
+
+/**
+ * Register a postprocessor that will be used after the parsing and compilation of the riot tags
+ * @param { Function } postprocessor - transformer that will receive the output code ans sourcemap
+ * @returns { Set } the postprocessors collection
+ */
+export function register(postprocessor) {
+  if (postprocessors.has(postprocessor)) {
+    panic(`This postprocessor "${postprocessor.name || postprocessor.toString()}" was already registered`)
+  }
+
+  postprocessors.add(postprocessor)
+
+  return postprocessors
+}
+
+/**
+ * Unregister a postprocessor
+ * @param { Function } postprocessor - possibly a postprocessor previously registered
+ * @returns { Set } the postprocessors collection
+ */
+export function unregister(postprocessor) {
+  if (!postprocessors.has(postprocessor)) {
+    panic(`This postprocessor "${postprocessor.name || postprocessor.toString()}" was never registered`)
+  }
+
+  postprocessors.delete(postprocessor)
+
+  return postprocessors
+}
+
+/**
+ * Exec all the postprocessors in sequence combining the sourcemaps generated
+ * @param   { Output } compilerOutput - output generated by the compiler
+ * @param   { Object } meta - compiling meta information
+ * @returns { Output } object containing output code and source map
+ */
+export function execute(compilerOutput, meta) {
+  return Array.from(postprocessors).reduce(function(acc, postprocessor) {
+    const { code, map } = acc
+    const output = postprocessor(code, meta)
+
+    return {
+      code: output.code,
+      map: composeSourcemaps(map, output.map)
+    }
+  }, createOutput(compilerOutput, meta))
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/preprocessors.js b/node_modules/@riotjs/compiler/src/preprocessors.js
new file mode 100644
index 0000000..648d2dd
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/preprocessors.js
@@ -0,0 +1,72 @@
+import panic from './utils/panic'
+import { transform } from './transformer'
+/**
+ * Parsers that can be registered by users to preparse components fragments
+ * @type { Object }
+ */
+export const preprocessors = Object.freeze({
+  javascript: new Map(),
+  css: new Map(),
+  template: new Map().set('default', code => ({ code }))
+})
+
+// throw a processor type error
+function preprocessorTypeError(type) {
+  panic(`No preprocessor of type "${type}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`)
+}
+
+// throw an error if the preprocessor was not registered
+function preprocessorNameNotFoundError(name) {
+  panic(`No preprocessor named "${name}" was found, are you sure you have registered it?'`)
+}
+
+/**
+ * Register a custom preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Function } preprocessor - preprocessor function
+ * @returns { Map } - the preprocessors map
+ */
+export function register(type, name, preprocessor) {
+  if (!type) panic('Please define the type of preprocessor you want to register \'javascript\', \'css\' or \'template\'')
+  if (!name) panic('Please define a name for your preprocessor')
+  if (!preprocessor) panic('Please provide a preprocessor function')
+  if (!preprocessors[type]) preprocessorTypeError(type)
+  if (preprocessors[type].has(name)) panic(`The preprocessor ${name} was already registered before`)
+
+  preprocessors[type].set(name, preprocessor)
+
+  return preprocessors
+}
+
+/**
+ * Register a custom preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @returns { Map } - the preprocessors map
+ */
+export function unregister(type, name) {
+  if (!type) panic('Please define the type of preprocessor you want to unregister \'javascript\', \'css\' or \'template\'')
+  if (!name) panic('Please define the name of the preprocessor you want to unregister')
+  if (!preprocessors[type]) preprocessorTypeError(type)
+  if (!preprocessors[type].has(name)) preprocessorNameNotFoundError(name)
+
+  preprocessors[type].delete(name)
+
+  return preprocessors
+}
+
+/**
+ * Exec the compilation of a preprocessor
+ * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+ * @param   { string } name - unique preprocessor id
+ * @param   { Object } meta - preprocessor meta information
+ * @param   { string } source - source code
+ * @returns { Output } object containing a sourcemap and a code string
+ */
+export function execute(type, name, meta, source) {
+  if (!preprocessors[type]) preprocessorTypeError(type)
+  if (!preprocessors[type].has(name)) preprocessorNameNotFoundError(name)
+
+  return transform(preprocessors[type].get(name), meta, source)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/transformer.js b/node_modules/@riotjs/compiler/src/transformer.js
new file mode 100644
index 0000000..c5cae26
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/transformer.js
@@ -0,0 +1,45 @@
+import createSourcemap from './utils/create-sourcemap'
+
+export const Output = Object.freeze({
+  code: '',
+  ast: [],
+  meta: {},
+  map: null
+})
+
+/**
+ * Create the right output data result of a parsing
+ * @param   { Object } data - output data
+ * @param   { string } data.code - code generated
+ * @param   { AST } data.ast - ast representing the code
+ * @param   { SourceMapGenerator } data.map - source map generated along with the code
+ * @param   { Object } meta - compilation meta infomration
+ * @returns { Output } output container object
+ */
+export function createOutput(data, meta) {
+  const output = {
+    ...Output,
+    ...data,
+    meta
+  }
+
+  if (!output.map && meta && meta.options && meta.options.file)
+    return {
+      ...output,
+      map: createSourcemap({ file: meta.options.file })
+    }
+
+  return output
+}
+
+/**
+ * Transform the source code received via a compiler function
+ * @param   { Function } compiler - function needed to generate the output code
+ * @param   { Object } meta - compilation meta information
+ * @param   { string } source - source code
+ * @returns { Output } output - the result of the compiler
+ */
+export function transform(compiler, meta, source) {
+  const result = (compiler ? compiler(source, meta) : { code: source })
+  return createOutput(result, meta)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/add-lines-offset.js b/node_modules/@riotjs/compiler/src/utils/add-lines-offset.js
new file mode 100644
index 0000000..4e9028e
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/add-lines-offset.js
@@ -0,0 +1,13 @@
+import getLineAndColumnByPosition from './get-line-and-column-by-position'
+
+/**
+ * Add the offset to the code that must be parsed in order to generate properly the sourcemaps
+ * @param {string} input - input string
+ * @param {string} source - original source code
+ * @param {RiotParser.Node} node - node that we are going to transform
+ * @return {string} the input string with the offset properly set
+ */
+export default function addLineOffset(input, source, node) {
+  const {column, line} = getLineAndColumnByPosition(source, node.start)
+  return `${'\n'.repeat(line - 1)}${' '.repeat(column + 1)}${input}`
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/ast-nodes-checks.js b/node_modules/@riotjs/compiler/src/utils/ast-nodes-checks.js
new file mode 100644
index 0000000..699d2d9
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/ast-nodes-checks.js
@@ -0,0 +1,19 @@
+import globalScope from 'globals'
+import {namedTypes} from './build-types'
+
+const browserAPIs = Object.keys(globalScope.browser)
+const builtinAPIs = Object.keys(globalScope.builtin)
+
+export const isIdentifier = namedTypes.Identifier.check.bind(namedTypes.Identifier)
+export const isLiteral = namedTypes.Literal.check.bind(namedTypes.Literal)
+export const isExpressionStatement = namedTypes.ExpressionStatement.check.bind(namedTypes.ExpressionStatement)
+export const isObjectExpression = namedTypes.ObjectExpression.check.bind(namedTypes.ObjectExpression)
+export const isThisExpression = namedTypes.ThisExpression.check.bind(namedTypes.ThisExpression)
+export const isNewExpression = namedTypes.NewExpression.check.bind(namedTypes.NewExpression)
+export const isSequenceExpression = namedTypes.SequenceExpression.check.bind(namedTypes.SequenceExpression)
+export const isBinaryExpression = namedTypes.BinaryExpression.check.bind(namedTypes.BinaryExpression)
+export const isExportDefaultStatement = namedTypes.ExportDefaultDeclaration.check.bind(namedTypes.ExportDefaultDeclaration)
+
+export const isBrowserAPI = ({name}) => browserAPIs.includes(name)
+export const isBuiltinAPI = ({name}) => builtinAPIs.includes(name)
+export const isRaw = (node) => node && node.raw // eslint-disable-line
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/build-types.js b/node_modules/@riotjs/compiler/src/utils/build-types.js
new file mode 100644
index 0000000..67573df
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/build-types.js
@@ -0,0 +1,5 @@
+import {types as astTypes} from 'recast'
+
+export const types = astTypes
+export const builders = astTypes.builders
+export const namedTypes = astTypes.namedTypes
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/clone-deep.js b/node_modules/@riotjs/compiler/src/utils/clone-deep.js
new file mode 100644
index 0000000..9a118b3
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/clone-deep.js
@@ -0,0 +1,8 @@
+/**
+ * Simple clone deep function, do not use it for classes or recursive objects!
+ * @param   {*} source - possibily an object to clone
+ * @returns {*} the object we wanted to clone
+ */
+export default function cloneDeep(source) {
+  return JSON.parse(JSON.stringify(source))
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/compose-sourcemaps.js b/node_modules/@riotjs/compiler/src/utils/compose-sourcemaps.js
new file mode 100644
index 0000000..c83395a
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/compose-sourcemaps.js
@@ -0,0 +1,22 @@
+import asJSON from './sourcemap-as-json'
+import {composeSourceMaps} from 'recast/lib/util'
+import isNode from './is-node'
+
+/**
+ * Compose two sourcemaps
+ * @param   { SourceMapGenerator } formerMap - original sourcemap
+ * @param   { SourceMapGenerator } latterMap - target sourcemap
+ * @returns { Object } sourcemap json
+ */
+export default function composeSourcemaps(formerMap, latterMap) {
+  if (
+    isNode() &&
+    formerMap && latterMap && latterMap.mappings
+  ) {
+    return composeSourceMaps(asJSON(formerMap), asJSON(latterMap))
+  } else if (isNode() && formerMap) {
+    return asJSON(formerMap)
+  }
+
+  return {}
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/create-sourcemap.js b/node_modules/@riotjs/compiler/src/utils/create-sourcemap.js
new file mode 100644
index 0000000..95d92ff
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/create-sourcemap.js
@@ -0,0 +1,10 @@
+import { SourceMapGenerator } from 'source-map'
+
+/**
+ * Create a new sourcemap generator
+ * @param   { Object } options - sourcemap options
+ * @returns { SourceMapGenerator } SourceMapGenerator instance
+ */
+export default function createSourcemap(options) {
+  return new SourceMapGenerator(options)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/custom-ast-nodes.js b/node_modules/@riotjs/compiler/src/utils/custom-ast-nodes.js
new file mode 100644
index 0000000..b817d38
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/custom-ast-nodes.js
@@ -0,0 +1,9 @@
+import {builders} from './build-types'
+
+export function nullNode() {
+  return builders.literal(null)
+}
+
+export function simplePropertyNode(key, value) {
+  return builders.property('init', builders.literal(key), value, false)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/generate-ast.js b/node_modules/@riotjs/compiler/src/utils/generate-ast.js
new file mode 100644
index 0000000..8295dab
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/generate-ast.js
@@ -0,0 +1,22 @@
+import {Parser} from 'acorn'
+import {parse} from 'recast'
+
+/**
+ * Parse a js source to generate the AST
+ * @param   {string} source - javascript source
+ * @param   {Object} options - parser options
+ * @returns {AST} AST tree
+ */
+export default function generateAST(source, options) {
+  return parse(source, {
+    parser: {
+      parse(source, opts) {
+        return Parser.parse(source, {
+          ...opts,
+          ecmaVersion: 2020
+        })
+      }
+    },
+    ...options
+  })
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/generate-javascript.js b/node_modules/@riotjs/compiler/src/utils/generate-javascript.js
new file mode 100644
index 0000000..5eaec9b
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/generate-javascript.js
@@ -0,0 +1,15 @@
+import {print} from 'recast'
+
+/**
+ * Generate the javascript from an ast source
+ * @param   {AST} ast - ast object
+ * @param   {Object} options - printer options
+ * @returns {Object} code + map
+ */
+export default function generateJavascript(ast, options) {
+  return print(ast, {
+    ...options,
+    tabWidth: 2,
+    quote: 'single'
+  })
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/get-line-and-column-by-position.js b/node_modules/@riotjs/compiler/src/utils/get-line-and-column-by-position.js
new file mode 100644
index 0000000..057409f
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/get-line-and-column-by-position.js
@@ -0,0 +1,16 @@
+import splitStringByEOL from './split-string-by-EOL'
+
+/**
+ * Get the line and the column of a source text based on its position in the string
+ * @param   { string } string - target string
+ * @param   { number } position - target position
+ * @returns { Object } object containing the source text line and column
+ */
+export default function getLineAndColumnByPosition(string, position) {
+  const lines = splitStringByEOL(string.slice(0, position))
+
+  return {
+    line: lines.length,
+    column: lines[lines.length - 1].length
+  }
+}
diff --git a/node_modules/@riotjs/compiler/src/utils/get-preprocessor-type-by-attribute.js b/node_modules/@riotjs/compiler/src/utils/get-preprocessor-type-by-attribute.js
new file mode 100644
index 0000000..582232e
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/get-preprocessor-type-by-attribute.js
@@ -0,0 +1,24 @@
+const ATTRIBUTE_TYPE_NAME = 'type'
+
+/**
+ * Get the type attribute from a node generated by the riot parser
+ * @param   { Object} sourceNode - riot parser node
+ * @returns { string|null } a valid type to identify the preprocessor to use or nothing
+ */
+export default function getPreprocessorTypeByAttribute(sourceNode) {
+  const typeAttribute = sourceNode.attributes ?
+    sourceNode.attributes.find(attribute => attribute.name === ATTRIBUTE_TYPE_NAME) :
+    null
+
+  return typeAttribute ? normalize(typeAttribute.value) : null
+}
+
+
+/**
+ * Remove the noise in case a user has defined the preprocessor type='text/scss'
+ * @param   { string } value - input string
+ * @returns { string } normalized string
+ */
+function normalize(value) {
+  return value.replace('text/', '')
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/is-empty-sourcemap.js b/node_modules/@riotjs/compiler/src/utils/is-empty-sourcemap.js
new file mode 100644
index 0000000..b96e078
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/is-empty-sourcemap.js
@@ -0,0 +1,8 @@
+/**
+ * True if the sourcemap has no mappings, it is empty
+ * @param   {Object}  map - sourcemap json
+ * @returns {boolean} true if empty
+ */
+export default function isEmptySourcemap(map) {
+  return !map || !map.mappings || !map.mappings.length
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/is-node.js b/node_modules/@riotjs/compiler/src/utils/is-node.js
new file mode 100644
index 0000000..176fab7
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/is-node.js
@@ -0,0 +1,7 @@
+/**
+ * Detect node js environements
+ * @returns { boolean } true if the runtime is node
+ */
+export default function isNode() {
+  return typeof process !== 'undefined'
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/panic.js b/node_modules/@riotjs/compiler/src/utils/panic.js
new file mode 100644
index 0000000..5c966ac
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/panic.js
@@ -0,0 +1,8 @@
+/**
+ * Throw an error with a descriptive message
+ * @param   { string } message - error message
+ * @returns { undefined } hoppla.. at this point the program should stop working
+ */
+export default function panic(message) {
+  throw new Error(message)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/preprocess-node.js b/node_modules/@riotjs/compiler/src/utils/preprocess-node.js
new file mode 100644
index 0000000..d9ef32a
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/preprocess-node.js
@@ -0,0 +1,18 @@
+import {execute as runPreprocessor} from '../preprocessors'
+
+/**
+ * Preprocess a riot parser node
+ * @param   { string } preprocessorType - either css, js
+ * @param   { string } preprocessorName - preprocessor id
+ * @param   { Object } meta - compilation meta information
+ * @param   { RiotParser.nodeTypes } node - css node detected by the parser
+ * @returns { Output } code and sourcemap generated by the preprocessor
+ */
+export default function preprocess(preprocessorType, preprocessorName, meta, node) {
+  const code = node.text
+
+  return (preprocessorName ?
+    runPreprocessor(preprocessorType, preprocessorName, meta, code) :
+    { code }
+  )
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/sourcemap-as-json.js b/node_modules/@riotjs/compiler/src/utils/sourcemap-as-json.js
new file mode 100644
index 0000000..7395d00
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/sourcemap-as-json.js
@@ -0,0 +1,10 @@
+/**
+ * Return a source map as JSON, it it has not the toJSON method it means it can
+ * be used right the way
+ * @param   { SourceMapGenerator|Object } map - a sourcemap generator or simply an json object
+ * @returns { Object } the source map as JSON
+ */
+export default function sourcemapAsJSON(map) {
+  if (map && map.toJSON) return map.toJSON()
+  return map
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/split-string-by-EOL.js b/node_modules/@riotjs/compiler/src/utils/split-string-by-EOL.js
new file mode 100644
index 0000000..2e34e63
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/split-string-by-EOL.js
@@ -0,0 +1,10 @@
+const LINES_RE = /\r\n?|\n/g
+
+/**
+ * Split a string into a rows array generated from its EOL matches
+ * @param   { string } string [description]
+ * @returns { Array } array containing all the string rows
+ */
+export default function splitStringByEOL(string) {
+  return string.split(LINES_RE)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/compiler/src/utils/unescape-char.js b/node_modules/@riotjs/compiler/src/utils/unescape-char.js
new file mode 100644
index 0000000..9cab2d3
--- /dev/null
+++ b/node_modules/@riotjs/compiler/src/utils/unescape-char.js
@@ -0,0 +1,9 @@
+/**
+ * Unescape the user escaped chars
+ * @param   {string} string - input string
+ * @param   {string} char - probably a '{' or anything the user want's to escape
+ * @returns {string} cleaned up string
+ */
+export default function unescapeChar(string, char) {
+  return string.replace(RegExp(`\\\\${char}`, 'gm'), char)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/dom-bindings/LICENSE b/node_modules/@riotjs/dom-bindings/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/@riotjs/dom-bindings/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/@riotjs/dom-bindings/README.md b/node_modules/@riotjs/dom-bindings/README.md
new file mode 100644
index 0000000..1e00c5e
--- /dev/null
+++ b/node_modules/@riotjs/dom-bindings/README.md
@@ -0,0 +1,546 @@
+# dom-bindings
+
+[![Build Status][travis-image]][travis-url]
+[![Code Quality][codeclimate-image]][codeclimate-url]
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+[![Coverage Status][coverage-image]][coverage-url]
+
+## Usage
+
+```js
+import { template, expressionTypes } from '@riotjs/dom-bindings'
+
+// Create the app template
+const tmpl = template('<p><!----></p>', [{
+  selector: 'p',
+  expressions: [
+    {
+      type: expressionTypes.TEXT,
+      childNodeIndex: 0,
+      evaluate: scope => scope.greeting,
+    },
+  ],
+}])
+
+// Mount the template to any DOM node
+const target = document.getElementById('app')
+
+const app = tmpl.mount(target, {
+  greeting: 'Hello World'
+})
+```
+
+[travis-image]:https://img.shields.io/travis/riot/dom-bindings.svg?style=flat-square
+[travis-url]:https://travis-ci.org/riot/dom-bindings
+
+[license-image]:http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+[license-url]:LICENSE
+
+[npm-version-image]:http://img.shields.io/npm/v/@riotjs/dom-bindings.svg?style=flat-square
+[npm-downloads-image]:http://img.shields.io/npm/dm/@riotjs/dom-bindings.svg?style=flat-square
+[npm-url]:https://npmjs.org/package/@riotjs/dom-bindings
+
+[coverage-image]:https://img.shields.io/coveralls/riot/dom-bindings/master.svg?style=flat-square
+[coverage-url]:https://coveralls.io/r/riot/dom-bindings/?branch=master
+
+[codeclimate-image]:https://api.codeclimate.com/v1/badges/d0b7c555a1673354d66f/maintainability
+[codeclimate-url]:https://codeclimate.com/github/riot/dom-bindings/maintainability
+
+## API
+
+### template(String, Array)
+
+The template method is the most important of this package.
+It will create a `TemplateChunk` that could be mounted, updated and unmounted to any DOM node.
+
+<details>
+  <summary>Details</summary>
+
+A template will always need a string as first argument and a list of `Bindings` to work properly.
+Consider the following example:
+
+```js
+const tmpl = template('<p><!----></p>', [{
+  selector: 'p',
+  expressions: [
+    {
+      type: expressionTypes.TEXT,
+      childNodeIndex: 0,
+      evaluate: scope => scope.greeting
+    }
+  ],
+}])
+```
+
+The template object above will bind a [simple binding](#simple-binding) to the `<p>` tag.
+
+</details>
+
+### bindingTypes
+
+Object containing all the type of bindings supported
+
+### expressionTypes
+
+Object containing all the expressions types supported
+
+## Bindings
+
+A binding is simply an object that will be used internally to map the data structure provided to a DOM tree.
+
+<details>
+  <summary>Details</summary>
+To create a binding object you might use the following  properties:
+
+- `expressions`
+  - type: `Array<Expression>`
+  - required: `true`
+  - description: array containing instructions to execute DOM manipulation on the node queried
+- `type`
+  - type: `Number`
+  - default:`bindingTypes.SIMPLE`
+  - optional: `true`
+  - description: id of the binding to use on the node queried. This id must be one of the keys available in the `bindingTypes` object
+- `selector`
+  - type: `String`
+  - default: binding root **HTMLElement**
+  - optional: `true`
+  - description: property to query the node element that needs to updated
+
+The bindings supported are only of 4 different types:
+
+- [`simple`](#simple-binding) to bind simply the expressions to a DOM structure
+- [`each`](#each-binding) to render DOM lists
+- [`if`](#if-binding) to handle conditional DOM structures
+- [`tag`](#tag-binding) to mount a coustom tag template to any DOM node
+
+Combining the bindings above we can map any javascript object to a DOM template.
+
+</details>
+
+### Simple Binding
+
+These kind of bindings will be only used to connect the expressions to DOM nodes in order to manipulate them.
+
+<details>
+  <summary>Details</summary>
+
+**Simple bindings will never modify the DOM tree structure, they will only target a single node.**<br/>
+A simple binding must always contain at least one of the following expression:
+
+- `attribute` to update the node attributes
+- `event` to set the event handling
+- `text` to update the node content
+- `value` to update the node value
+
+For example, let's consider the following binding:
+
+```js
+const pGreetingBinding = {
+  selector: 'p',
+  expressions: [{
+    type: expressionTypes.Text,
+    childNodeIndex: 0,
+    evaluate: scope => scope.greeting,
+  }]
+}
+
+template('<article><p><!----></p></article>', [pGreeting])
+```
+
+In this case we have created a binding to update only the content of a `p` tag.<br/>
+*Notice that the `p` tag has an empty comment that will be replaced with the value of the binding expression whenever the template will be mounted*
+
+</details>
+
+#### Simple Binding Expressions
+
+The simple binding supports DOM manipulations only via expressions.
+
+<details>
+  <summary>Details</summary>
+An expression object must have always at least the following properties:
+
+- `evaluate`
+  - type: `Function`
+  - description: function that will receive the current template scope and will return the current expression value
+- `type`
+  - type: `Number`
+  - description: id to find the expression we need to apply to the node. This id must be one of the keys available in the `expressionTypes` object
+
+</details>
+
+##### Attribute Expression
+
+The attribute expression allows to update all the DOM node attributes.
+
+<details>
+  <summary>Details</summary>
+  This expression might contain the optional `name` key to update a single attribute for example:
+
+  ```js
+  // update only the class attribute
+  { type: expressionTypes.ATTRIBUTE, name: 'class', evaluate(scope) { return scope.attr }}
+  ```
+
+  If the `name` key will not be defined and the return of the `evaluate` function will be an object, this expression will set all the pairs `key, value` as DOM attributes. <br/>
+  Given the current scope `{ attr: { class: 'hello', 'name': 'world' }}`, the following expression will allow to set all the object attributes:
+
+  ```js
+  { type: expressionTypes.ATTRIBUTE, evaluate(scope) { return scope.attr }}
+  ```
+
+  If the return value of the evaluate function will be a `Boolean` the attribute will be considered a boolean attribute like `checked` or `selected`...
+</details>
+
+##### Event Expression
+
+The event expression is really simple, It must contain the `name` attribute and it will set the callback as `dom[name] = callback`.
+
+<details>
+  <summary>Details</summary>
+For example:
+
+```js
+// add an event listener
+{ type: expressionTypes.EVENT, name: 'onclick', evaluate(scope) { return function() { console.log('Hello There') } }}
+```
+
+To remove an event listener you should only `return null` via evaluate function:
+
+```js
+// remove an event listener
+{ type: expressionTypes.EVENT, name: 'onclick', evaluate(scope) { return null } }}
+```
+
+</details>
+
+##### Text Expression
+
+The text expression must contain the `childNodeIndex` that will be used to identify which childNode from the `element.childNodes` collection will need to update its text content.
+
+<details>
+  <summary>Details</summary>
+Given for example the following template:
+
+```html
+<p><b>Your name is:</b><i>user_icon</i><!----></p>
+```
+
+we could use the following text expression to replace the CommentNode with a TextNode
+
+```js
+{ type: expressionTypes.TEXT, childNodeIndex: 2, evaluate(scope) { return 'Gianluca' } }}
+```
+</details>
+
+##### Value Expression
+
+The value expression will just set the `element.value` with the value received from the evaluate function.
+
+<details>
+  <summary>Details</summary>
+It should be used only for form elements and it might look like the example below:
+
+```js
+{ type: expressionTypes.VALUE, evaluate(scope) { return scope.val }}
+```
+
+</details>
+
+### Each Binding
+
+The `each` binding is used to create multiple DOM nodes of the same type. This binding is typically used in to render javascript collections.
+
+<details>
+  <summary>Details</summary>
+
+**`each` bindings will need a template that will be cloned, mounted and updated for all the instances of the collection.**<br/>
+An each binding should contain the following properties:
+
+- `itemName`
+  - type: `String`
+  - required: `true`
+  - description: name to identify the item object of the current iteration
+- `indexName`
+  - type: `Number`
+  - optional: `true`
+  - description: name to identify the current item index
+- `evaluate`
+  - type: `Function`
+  - required: `true`
+  - description: function that will return the collection to iterate
+- `template`
+  - type: `TemplateChunk`
+  - required: `true`
+  - description: a dom-bindings template that will be used as skeleton for the DOM elements created
+- `condition`
+  - type: `Function`
+  - optional: `true`
+  - description: function that can be used to filter the items from the collection
+
+The each bindings have the highest [hierarchical priority](#bindings-hierarchy) compared to the other riot bindings.
+The following binding will loop through the `scope.items` collection creating several `p` tags having as TextNode child value dependent loop item received
+
+```js
+const eachBinding = {
+  type: bindingTypes.EACH,
+  itemName: 'val',
+  indexName: 'index'
+  evaluate: scope => scope.items,
+  template: template('<!---->', [{
+    expressions: [
+      {
+        type: expressionTypes.TEXT,
+        childNodeIndex: 0,
+        evaluate: scope => `${scope.val} - ${scope.index}`
+      }
+    ]
+  }
+}
+
+template('<p></p>', [eachBinding])
+```
+</details>
+
+### If Binding
+
+The `if` bindings are needed to handle conditionally entire parts of your components templates
+
+<details>
+  <summary>Details</summary>
+
+**`if` bindings will need a template that will be mounted and unmounted depending on the return value of the evaluate function.**<br/>
+An if binding should contain the following properties:
+
+- `evaluate`
+  - type: `Function`
+  - required: `true`
+  - description: if this function will return truthy values the template will be mounted otherwise unmounted
+- `template`
+  - type: `TemplateChunk`
+  - required: `true`
+  - description: a dom-bindings template that will be used as skeleton for the DOM element created
+
+The following binding will render the `b` tag only if the `scope.isVisible` property will be truthy. Otherwise the `b` tag will be removed from the template
+
+```js
+const ifBinding = {
+  type: bindingTypes.IF,
+  evaluate: scope => scope.isVisible,
+  selector: 'b'
+  template: template('<!---->', [{
+    expressions: [
+      {
+        type: expressionTypes.TEXT,
+        childNodeIndex: 0,
+        evaluate: scope => scope.name
+      }
+    ]
+  }])
+}
+
+template('<p>Hello there <b></b></p>', [ifBinding])
+```
+</details>
+
+### Tag Binding
+
+The `tag` bindings are needed to mount custom components implementations
+
+<details>
+  <summary>Details</summary>
+
+`tag` bindings will enhance any child node with a custom component factory function. These bindings are likely riot components that must be mounted as children in a parent component template
+
+A tag binding might contain the following properties:
+
+- `getComponent`
+  - type: `Function`
+  - required: `true`
+  - description: the factory function responsible for the tag creation
+- `evaluate`
+  - type: `Function`
+  - required: `true`
+  - description: it will receive the current scope and it must return the component id that will be passed as first argument to the `getComponent` function
+- `slots`
+  - type: `Array<Slot>`
+  - optional: `true`
+  - description: array containing the slots that must be mounted into the child tag
+- `attributes`
+  - type: `Array<AttributeExpression>`
+  - optional: `true`
+  - description: array containing the attribute values that should be passed to the child tag
+
+The following tag binding will upgrade the `time` tag using the `human-readable-time` template.
+This is how the `human-readable-time` template might look like
+
+```js
+import moment from 'moment'
+
+export default function HumanReadableTime({ attributes }) {
+  const dateTimeAttr = attributes.find(({ name }) => name === 'datetime')
+
+  return template('<!---->', [{
+    expressions: [{
+      type: expressionTypes.TEXT,
+      childNodeIndex: 0,
+      evaluate(scope) {
+        const dateTimeValue = dateTimeAttr.evaluate(scope)
+        return moment(new Date(dateTimeValue)).fromNow()
+      }
+    }, ...attributes.map(attr => {
+      return {
+        ...attr,
+        type: expressionTypes.ATTRIBUTE
+      }
+    })]
+  }])
+}
+```
+
+Here it's how the previous tag might be used in a `tag` binding
+```js
+import HumanReadableTime from './human-readable-time'
+
+const tagBinding = {
+  type: bindingTypes.TAG,
+  evaluate: () => 'human-readable-time',
+  getComponent: () => HumanReadableTime,
+  selector: 'time',
+  attributes: [{
+    evaluate: scope => scope.time,
+    name: 'datetime'
+  }]
+}
+
+template('<p>Your last commit was: <time></time></p>', [tagBinding]).mount(app, {
+  time: '2017-02-14'
+})
+```
+
+The `tag` bindings have always a lower priority compared to the `if` and `each` bindings
+</details>
+
+#### Slot Binding
+
+The slot binding will be used to manage nested slotted templates that will be update using parent scope
+
+<details>
+  <summary>Details</summary>
+An expression object must have always at least the following properties:
+
+- `evaluate`
+  - type: `Function`
+  - description: function that will receive the current template scope and will return the current expression value
+- `type`
+  - type: `Number`
+  - description: id to find the expression we need to apply to the node. This id must be one of the keys available in the `expressionTypes` object
+- `name`
+  - type: `String`
+  - description: the name to identify the binding html we need to mount in this node
+
+
+```js
+// slots array that will be mounted receiving the scope of the parent template
+const slots = [{
+  id: 'foo',
+  bindings: [{
+    selector: '[expr1]',
+    expressions: [{
+      type: expressionTypes.TEXT,
+      childNodeIndex: 0,
+      evaluate: scope => scope.text
+    }]
+  }],
+  html: '<p expr1><!----></p>'
+}]
+
+const el = template('<article><slot expr0/></article>', [{
+  type: bindingTypes.SLOT,
+  selector: '[expr0]',
+  name: 'foo'
+}]).mount(app, {
+  slots
+}, { text: 'hello' })
+```
+
+</details>
+
+## Bindings Hierarchy
+
+If the same DOM node has multiple bindings bound to it, they should be created following the order below:
+
+1. Each Binding
+2. If Binding
+3. Tag Binding
+
+<details>
+  <summary>Details</summary>
+
+Let's see some cases where we might combine multiple bindings on the same DOM node and how to handle them properly.
+
+### Each and If Bindings
+Let's consider for example a DOM node that sould handle in parallel the Each and If bindings.
+In that case we could skip the `If Binding` and just use the `condition` function provided by the [`Each Binding`](#each-binding)
+Each bindings will handle conditional rendering internally without the need of extra logic.
+
+### Each and Tag Bindings
+A custom tag having an Each Binding bound to it should be handled giving the priority to the Eeach Binding. For example:
+
+```js
+const components = {
+  'my-tag': function({ slots, attributes }) {
+    return {
+      mount(el, scope) {
+        // do stuff on the mount
+      },
+      unmount() {
+        // do stuff on the unmount
+      }
+    }
+  }
+}
+const el = template('<ul><li expr0></li></ul>', [{
+  type: bindingTypes.EACH,
+  itemName: 'val',
+  selector: '[expr0]',
+  evaluate: scope => scope.items,
+  template: template(null, [{
+    type: bindingTypes.TAG,
+    name: 'my-tag',
+    getComponent(name) {
+      // name here will be 'my-tag'
+      return components[name]
+    }
+  }])
+}]).mount(target, { items: [1, 2] })
+```
+
+The template for the Each Binding above will be created receiving `null` as first argument because we suppose that the custom tag template was already stored and registered somewhere else.
+
+### If and Tag Bindings
+Similar to the previous example, If Bindings have always the priority on the Tag Bindings. For example:
+
+```js
+const el = template('<ul><li expr0></li></ul>', [{
+  type: bindingTypes.IF,
+  selector: '[expr0]',
+  evaluate: scope => scope.isVisible,
+  template: template(null, [{
+    type: bindingTypes.TAG,
+    evaluate: () => 'my-tag',
+    getComponent(name) {
+      // name here will be 'my-tag'
+      return components[name]
+    }
+  }])
+}]).mount(target, { isVisible: true })
+```
+
+The template for the IF Binding will mount/unmount the Tag Binding on its own DOM node.
+
+</details>
+
diff --git a/node_modules/@riotjs/dom-bindings/dist/esm.dom-bindings.js b/node_modules/@riotjs/dom-bindings/dist/esm.dom-bindings.js
new file mode 100644
index 0000000..9d677fb
--- /dev/null
+++ b/node_modules/@riotjs/dom-bindings/dist/esm.dom-bindings.js
@@ -0,0 +1,1657 @@
+/**
+ * Remove the child nodes from any DOM node
+ * @param   {HTMLElement} node - target node
+ * @returns {undefined}
+ */
+function cleanNode(node) {
+  clearChildren(node.childNodes);
+}
+
+/**
+ * Clear multiple children in a node
+ * @param   {HTMLElement[]} children - direct children nodes
+ * @returns {undefined}
+ */
+function clearChildren(children) {
+  Array.from(children).forEach(n => n.parentNode && n.parentNode.removeChild(n));
+}
+
+const EACH = 0;
+const IF = 1;
+const SIMPLE = 2;
+const TAG = 3;
+const SLOT = 4;
+
+var bindingTypes = {
+  EACH,
+  IF,
+  SIMPLE,
+  TAG,
+  SLOT
+};
+
+/**
+ * Create the template meta object in case of <template> fragments
+ * @param   {TemplateChunk} componentTemplate - template chunk object
+ * @returns {Object} the meta property that will be passed to the mount function of the TemplateChunk
+ */
+function createTemplateMeta(componentTemplate) {
+  const fragment = componentTemplate.dom.cloneNode(true);
+
+  return {
+    avoidDOMInjection: true,
+    fragment,
+    children: Array.from(fragment.childNodes)
+  }
+}
+
+/* get rid of the @ungap/essential-map polyfill */
+
+const {indexOf: iOF} = [];
+const append = (get, parent, children, start, end, before) => {
+  const isSelect = 'selectedIndex' in parent;
+  let noSelection = isSelect;
+  while (start < end) {
+    const child = get(children[start], 1);
+    parent.insertBefore(child, before);
+    if (isSelect && noSelection && child.selected) {
+      noSelection = !noSelection;
+      let {selectedIndex} = parent;
+      parent.selectedIndex = selectedIndex < 0 ?
+        start :
+        iOF.call(parent.querySelectorAll('option'), child);
+    }
+    start++;
+  }
+};
+
+const eqeq = (a, b) => a == b;
+
+const identity = O => O;
+
+const indexOf = (
+  moreNodes,
+  moreStart,
+  moreEnd,
+  lessNodes,
+  lessStart,
+  lessEnd,
+  compare
+) => {
+  const length = lessEnd - lessStart;
+  /* istanbul ignore if */
+  if (length < 1)
+    return -1;
+  while ((moreEnd - moreStart) >= length) {
+    let m = moreStart;
+    let l = lessStart;
+    while (
+      m < moreEnd &&
+      l < lessEnd &&
+      compare(moreNodes[m], lessNodes[l])
+    ) {
+      m++;
+      l++;
+    }
+    if (l === lessEnd)
+      return moreStart;
+    moreStart = m + 1;
+  }
+  return -1;
+};
+
+const isReversed = (
+  futureNodes,
+  futureEnd,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  compare
+) => {
+  while (
+    currentStart < currentEnd &&
+    compare(
+      currentNodes[currentStart],
+      futureNodes[futureEnd - 1]
+    )) {
+      currentStart++;
+      futureEnd--;
+    }  return futureEnd === 0;
+};
+
+const next = (get, list, i, length, before) => i < length ?
+              get(list[i], 0) :
+              (0 < i ?
+                get(list[i - 1], -0).nextSibling :
+                before);
+
+const remove = (get, parent, children, start, end) => {
+  if ((end - start) < 2)
+    parent.removeChild(get(children[start], -1));
+  else {
+    const range = parent.ownerDocument.createRange();
+    range.setStartBefore(get(children[start], -1));
+    range.setEndAfter(get(children[end - 1], -1));
+    range.deleteContents();
+  }
+};
+
+// - - - - - - - - - - - - - - - - - - -
+// diff related constants and utilities
+// - - - - - - - - - - - - - - - - - - -
+
+const DELETION = -1;
+const INSERTION = 1;
+const SKIP = 0;
+const SKIP_OND = 50;
+
+const HS = (
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges
+) => {
+
+  let k = 0;
+  /* istanbul ignore next */
+  let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+  const link = Array(minLen++);
+  const tresh = Array(minLen);
+  tresh[0] = -1;
+
+  for (let i = 1; i < minLen; i++)
+    tresh[i] = currentEnd;
+
+  const keymap = new Map;
+  for (let i = currentStart; i < currentEnd; i++)
+    keymap.set(currentNodes[i], i);
+
+  for (let i = futureStart; i < futureEnd; i++) {
+    const idxInOld = keymap.get(futureNodes[i]);
+    if (idxInOld != null) {
+      k = findK(tresh, minLen, idxInOld);
+      /* istanbul ignore else */
+      if (-1 < k) {
+        tresh[k] = idxInOld;
+        link[k] = {
+          newi: i,
+          oldi: idxInOld,
+          prev: link[k - 1]
+        };
+      }
+    }
+  }
+
+  k = --minLen;
+  --currentEnd;
+  while (tresh[k] > currentEnd) --k;
+
+  minLen = currentChanges + futureChanges - k;
+  const diff = Array(minLen);
+  let ptr = link[k];
+  --futureEnd;
+  while (ptr) {
+    const {newi, oldi} = ptr;
+    while (futureEnd > newi) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+    while (currentEnd > oldi) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+    diff[--minLen] = SKIP;
+    --futureEnd;
+    --currentEnd;
+    ptr = ptr.prev;
+  }
+  while (futureEnd >= futureStart) {
+    diff[--minLen] = INSERTION;
+    --futureEnd;
+  }
+  while (currentEnd >= currentStart) {
+    diff[--minLen] = DELETION;
+    --currentEnd;
+  }
+  return diff;
+};
+
+// this is pretty much the same petit-dom code without the delete map part
+// https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+const OND = (
+  futureNodes,
+  futureStart,
+  rows,
+  currentNodes,
+  currentStart,
+  cols,
+  compare
+) => {
+  const length = rows + cols;
+  const v = [];
+  let d, k, r, c, pv, cv, pd;
+  outer: for (d = 0; d <= length; d++) {
+    /* istanbul ignore if */
+    if (d > SKIP_OND)
+      return null;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    cv = v[d] = [];
+    for (k = -d; k <= d; k += 2) {
+      if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+        c = pv[pd + k + 1];
+      } else {
+        c = pv[pd + k - 1] + 1;
+      }
+      r = c - k;
+      while (
+        c < cols &&
+        r < rows &&
+        compare(
+          currentNodes[currentStart + c],
+          futureNodes[futureStart + r]
+        )
+      ) {
+        c++;
+        r++;
+      }
+      if (c === cols && r === rows) {
+        break outer;
+      }
+      cv[d + k] = c;
+    }
+  }
+
+  const diff = Array(d / 2 + length / 2);
+  let diffIdx = diff.length - 1;
+  for (d = v.length - 1; d >= 0; d--) {
+    while (
+      c > 0 &&
+      r > 0 &&
+      compare(
+        currentNodes[currentStart + c - 1],
+        futureNodes[futureStart + r - 1]
+      )
+    ) {
+      // diagonal edge = equality
+      diff[diffIdx--] = SKIP;
+      c--;
+      r--;
+    }
+    if (!d)
+      break;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    k = c - r;
+    if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+      // vertical edge = insertion
+      r--;
+      diff[diffIdx--] = INSERTION;
+    } else {
+      // horizontal edge = deletion
+      c--;
+      diff[diffIdx--] = DELETION;
+    }
+  }
+  return diff;
+};
+
+const applyDiff = (
+  diff,
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  currentNodes,
+  currentStart,
+  currentLength,
+  before
+) => {
+  const live = new Map;
+  const length = diff.length;
+  let currentIndex = currentStart;
+  let i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        futureStart++;
+        currentIndex++;
+        break;
+      case INSERTION:
+        // TODO: bulk appends for sequential nodes
+        live.set(futureNodes[futureStart], 1);
+        append(
+          get,
+          parentNode,
+          futureNodes,
+          futureStart++,
+          futureStart,
+          currentIndex < currentLength ?
+            get(currentNodes[currentIndex], 0) :
+            before
+        );
+        break;
+      case DELETION:
+        currentIndex++;
+        break;
+    }
+  }
+  i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        currentStart++;
+        break;
+      case DELETION:
+        // TODO: bulk removes for sequential nodes
+        if (live.has(currentNodes[currentStart]))
+          currentStart++;
+        else
+          remove(
+            get,
+            parentNode,
+            currentNodes,
+            currentStart++,
+            currentStart
+          );
+        break;
+    }
+  }
+};
+
+const findK = (ktr, length, j) => {
+  let lo = 1;
+  let hi = length;
+  while (lo < hi) {
+    const mid = ((lo + hi) / 2) >>> 0;
+    if (j < ktr[mid])
+      hi = mid;
+    else
+      lo = mid + 1;
+  }
+  return lo;
+};
+
+const smartDiff = (
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges,
+  currentLength,
+  compare,
+  before
+) => {
+  applyDiff(
+    OND(
+      futureNodes,
+      futureStart,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentChanges,
+      compare
+    ) ||
+    HS(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      currentChanges
+    ),
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    currentNodes,
+    currentStart,
+    currentLength,
+    before
+  );
+};
+
+/*! (c) 2018 Andrea Giammarchi (ISC) */
+
+const domdiff = (
+  parentNode,     // where changes happen
+  currentNodes,   // Array of current items/nodes
+  futureNodes,    // Array of future items/nodes
+  options         // optional object with one of the following properties
+                  //  before: domNode
+                  //  compare(generic, generic) => true if same generic
+                  //  node(generic) => Node
+) => {
+  if (!options)
+    options = {};
+
+  const compare = options.compare || eqeq;
+  const get = options.node || identity;
+  const before = options.before == null ? null : get(options.before, 0);
+
+  const currentLength = currentNodes.length;
+  let currentEnd = currentLength;
+  let currentStart = 0;
+
+  let futureEnd = futureNodes.length;
+  let futureStart = 0;
+
+  // common prefix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentStart], futureNodes[futureStart])
+  ) {
+    currentStart++;
+    futureStart++;
+  }
+
+  // common suffix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])
+  ) {
+    currentEnd--;
+    futureEnd--;
+  }
+
+  const currentSame = currentStart === currentEnd;
+  const futureSame = futureStart === futureEnd;
+
+  // same list
+  if (currentSame && futureSame)
+    return futureNodes;
+
+  // only stuff to add
+  if (currentSame && futureStart < futureEnd) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentStart, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // only stuff to remove
+  if (futureSame && currentStart < currentEnd) {
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  const currentChanges = currentEnd - currentStart;
+  const futureChanges = futureEnd - futureStart;
+  let i = -1;
+
+  // 2 simple indels: the shortest sequence is a subsequence of the longest
+  if (currentChanges < futureChanges) {
+    i = indexOf(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    );
+    // inner diff
+    if (-1 < i) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        i,
+        get(currentNodes[currentStart], 0)
+      );
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        i + currentChanges,
+        futureEnd,
+        next(get, currentNodes, currentEnd, currentLength, before)
+      );
+      return futureNodes;
+    }
+  }
+  /* istanbul ignore else */
+  else if (futureChanges < currentChanges) {
+    i = indexOf(
+      currentNodes,
+      currentStart,
+      currentEnd,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      compare
+    );
+    // outer diff
+    if (-1 < i) {
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        currentStart,
+        i
+      );
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        i + futureChanges,
+        currentEnd
+      );
+      return futureNodes;
+    }
+  }
+
+  // common case with one replacement for many nodes
+  // or many nodes replaced for a single one
+  /* istanbul ignore else */
+  if ((currentChanges < 2 || futureChanges < 2)) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      get(currentNodes[currentStart], 0)
+    );
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  // the half match diff part has been skipped in petit-dom
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+  // accordingly, I think it's safe to skip in here too
+  // if one day it'll come out like the speediest thing ever to do
+  // then I might add it in here too
+
+  // Extra: before going too fancy, what about reversed lists ?
+  //        This should bail out pretty quickly if that's not the case.
+  if (
+    currentChanges === futureChanges &&
+    isReversed(
+      futureNodes,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    )
+  ) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentEnd, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // last resort through a smart diff
+  smartDiff(
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    futureEnd,
+    futureChanges,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    currentChanges,
+    currentLength,
+    compare,
+    before
+  );
+
+  return futureNodes;
+};
+
+/**
+ * Check if a value is null or undefined
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the 'undefined' and 'null' types
+ */
+function isNil(value) {
+  return value === null || value === undefined
+}
+
+/**
+ * Check if an element is a template tag
+ * @param   {HTMLElement}  el - element to check
+ * @returns {boolean} true if it's a <template>
+ */
+function isTemplate(el) {
+  return !isNil(el.content)
+}
+
+const EachBinding = Object.seal({
+  // dynamic binding properties
+  childrenMap: null,
+  node: null,
+  root: null,
+  condition: null,
+  evaluate: null,
+  template: null,
+  isTemplateTag: false,
+  nodes: [],
+  getKey: null,
+  indexName: null,
+  itemName: null,
+  afterPlaceholder: null,
+  placeholder: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    return this.update(scope, parentScope)
+  },
+  update(scope, parentScope) {
+    const { placeholder } = this;
+    const collection = this.evaluate(scope);
+    const items = collection ? Array.from(collection) : [];
+    const parent = placeholder.parentNode;
+
+    // prepare the diffing
+    const {
+      newChildrenMap,
+      batches,
+      futureNodes
+    } = createPatch(items, scope, parentScope, this);
+
+    // patch the DOM only if there are new nodes
+    if (futureNodes.length) {
+      domdiff(parent, this.nodes, futureNodes, {
+        before: placeholder,
+        node: patch(
+          Array.from(this.childrenMap.values()),
+          parentScope
+        )
+      });
+    } else {
+      // remove all redundant templates
+      unmountRedundant(this.childrenMap);
+    }
+
+    // trigger the mounts and the updates
+    batches.forEach(fn => fn());
+
+    // update the children map
+    this.childrenMap = newChildrenMap;
+    this.nodes = futureNodes;
+
+    return this
+  },
+  unmount(scope, parentScope) {
+    unmountRedundant(this.childrenMap, parentScope);
+
+    this.childrenMap = new Map();
+    this.nodes = [];
+
+    return this
+  }
+});
+
+/**
+ * Patch the DOM while diffing
+ * @param   {TemplateChunk[]} redundant - redundant tepmplate chunks
+ * @param   {*} parentScope - scope of the parent template
+ * @returns {Function} patch function used by domdiff
+ */
+function patch(redundant, parentScope) {
+  return (item, info) => {
+    if (info < 0) {
+      const {template, context} = redundant.pop();
+      // notice that we pass null as last argument because
+      // the root node and its children will be removed by domdiff
+      template.unmount(context, parentScope, null);
+    }
+
+    return item
+  }
+}
+
+/**
+ * Unmount the remaining template instances
+ * @param   {Map} childrenMap - map containing the children template to unmount
+ * @param   {*} parentScope - scope of the parent template
+ * @returns {TemplateChunk[]} collection containing the template chunks unmounted
+ */
+function unmountRedundant(childrenMap, parentScope) {
+  return Array
+    .from(childrenMap.values())
+    .map(({template, context}) => {
+      return template.unmount(context, parentScope, true)
+    })
+}
+
+/**
+ * Check whether a template must be filtered from a loop
+ * @param   {Function} condition - filter function
+ * @param   {Object} context - argument passed to the filter function
+ * @returns {boolean} true if this item should be skipped
+ */
+function mustFilterItem(condition, context) {
+  return condition ? Boolean(condition(context)) === false : false
+}
+
+/**
+ * Extend the scope of the looped template
+ * @param   {Object} scope - current template scope
+ * @param   {string} options.itemName - key to identify the looped item in the new context
+ * @param   {string} options.indexName - key to identify the index of the looped item
+ * @param   {number} options.index - current index
+ * @param   {*} options.item - collection item looped
+ * @returns {Object} enhanced scope object
+ */
+function extendScope(scope, {itemName, indexName, index, item}) {
+  scope[itemName] = item;
+  if (indexName) scope[indexName] = index;
+  return scope
+}
+
+/**
+ * Loop the current template items
+ * @param   {Array} items - expression collection value
+ * @param   {*} scope - template scope
+ * @param   {*} parentScope - scope of the parent template
+ * @param   {EeachBinding} binding - each binding object instance
+ * @returns {Object} data
+ * @returns {Map} data.newChildrenMap - a Map containing the new children template structure
+ * @returns {Array} data.batches - array containing the template lifecycle functions to trigger
+ * @returns {Array} data.futureNodes - array containing the nodes we need to diff
+ */
+function createPatch(items, scope, parentScope, binding) {
+  const { condition, template, childrenMap, itemName, getKey, indexName, root, isTemplateTag } = binding;
+  const newChildrenMap = new Map();
+  const batches = [];
+  const futureNodes = [];
+
+  items.forEach((item, index) => {
+    const context = extendScope(Object.create(scope), {itemName, indexName, index, item});
+    const key = getKey ? getKey(context) : index;
+    const oldItem = childrenMap.get(key);
+
+    if (mustFilterItem(condition, context)) {
+      return
+    }
+
+    const componentTemplate = oldItem ? oldItem.template : template.clone();
+    const el = oldItem ? componentTemplate.el : root.cloneNode();
+    const mustMount = !oldItem;
+    const meta = isTemplateTag && mustMount ? createTemplateMeta(componentTemplate) : {};
+
+    if (mustMount) {
+      batches.push(() => componentTemplate.mount(el, context, parentScope, meta));
+    } else {
+      componentTemplate.update(context, parentScope);
+    }
+
+    // create the collection of nodes to update or to add
+    // in case of template tags we need to add all its children nodes
+    if (isTemplateTag) {
+      futureNodes.push(...meta.children || componentTemplate.children);
+    } else {
+      futureNodes.push(el);
+    }
+
+    // delete the old item from the children map
+    childrenMap.delete(key);
+
+    // update the children map
+    newChildrenMap.set(key, {
+      template: componentTemplate,
+      context,
+      index
+    });
+  });
+
+  return {
+    newChildrenMap,
+    batches,
+    futureNodes
+  }
+}
+
+function create(node, { evaluate, condition, itemName, indexName, getKey, template }) {
+  const placeholder = document.createTextNode('');
+  const parent = node.parentNode;
+  const root = node.cloneNode();
+
+  parent.insertBefore(placeholder, node);
+  parent.removeChild(node);
+
+  return {
+    ...EachBinding,
+    childrenMap: new Map(),
+    node,
+    root,
+    condition,
+    evaluate,
+    isTemplateTag: isTemplate(root),
+    template: template.createDOM(node),
+    getKey,
+    indexName,
+    itemName,
+    placeholder
+  }
+}
+
+/**
+ * Binding responsible for the `if` directive
+ */
+const IfBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  evaluate: null,
+  parent: null,
+  isTemplateTag: false,
+  placeholder: null,
+  template: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    this.parent.insertBefore(this.placeholder, this.node);
+    this.parent.removeChild(this.node);
+
+    return this.update(scope, parentScope)
+  },
+  update(scope, parentScope) {
+    const value = !!this.evaluate(scope);
+    const mustMount = !this.value && value;
+    const mustUnmount = this.value && !value;
+    const mount = () => {
+      const pristine = this.node.cloneNode();
+
+      this.parent.insertBefore(pristine, this.placeholder);
+
+      this.template = this.template.clone();
+      this.template.mount(pristine, scope, parentScope);
+    };
+
+    switch (true) {
+    case mustMount:
+      mount();
+      break
+    case mustUnmount:
+      this.unmount(scope);
+      break
+    default:
+      if (value) this.template.update(scope, parentScope);
+    }
+
+    this.value = value;
+
+    return this
+  },
+  unmount(scope, parentScope) {
+    this.template.unmount(scope, parentScope, true);
+
+    return this
+  }
+});
+
+function create$1(node, { evaluate, template }) {
+  return {
+    ...IfBinding,
+    node,
+    evaluate,
+    parent: node.parentNode,
+    placeholder: document.createTextNode(''),
+    template: template.createDOM(node)
+  }
+}
+
+const ATTRIBUTE = 0;
+const EVENT = 1;
+const TEXT = 2;
+const VALUE = 3;
+
+var expressionTypes = {
+  ATTRIBUTE,
+  EVENT,
+  TEXT,
+  VALUE
+};
+
+/**
+ * Check if a value is a Boolean
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the value is a boolean
+ */
+function isBoolean(value) {
+  return typeof value === 'boolean'
+}
+
+/**
+ * Check if a value is an Object
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the value is an object
+ */
+function isObject(value) {
+  return typeof value === 'object'
+}
+
+const REMOVE_ATTRIBUTE = 'removeAttribute';
+const SET_ATTIBUTE = 'setAttribute';
+
+/**
+ * Add all the attributes provided
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} attributes - object containing the attributes names and values
+ * @returns {undefined} sorry it's a void function :(
+ */
+function setAllAttributes(node, attributes) {
+  Object
+    .entries(attributes)
+    .forEach(([name, value]) => attributeExpression(node, { name }, value));
+}
+
+/**
+ * Remove all the attributes provided
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} attributes - object containing all the attribute names
+ * @returns {undefined} sorry it's a void function :(
+ */
+function removeAllAttributes(node, attributes) {
+  Object
+    .keys(attributes)
+    .forEach(attribute => node.removeAttribute(attribute));
+}
+
+/**
+ * This methods handles the DOM attributes updates
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {string} expression.name - attribute name
+ * @param   {*} value - new expression value
+ * @param   {*} oldValue - the old expression cached value
+ * @returns {undefined}
+ */
+function attributeExpression(node, { name }, value, oldValue) {
+  // is it a spread operator? {...attributes}
+  if (!name) {
+    // is the value still truthy?
+    if (value) {
+      setAllAttributes(node, value);
+    } else if (oldValue) {
+      // otherwise remove all the old attributes
+      removeAllAttributes(node, oldValue);
+    }
+
+    return
+  }
+
+  // handle boolean attributes
+  if (isBoolean(value) || isObject(value)) {
+    node[name] = value;
+  }
+
+  node[getMethod(value)](name, normalizeValue(name, value));
+}
+
+/**
+ * Get the attribute modifier method
+ * @param   {*} value - if truthy we return `setAttribute` othewise `removeAttribute`
+ * @returns {string} the node attribute modifier method name
+ */
+function getMethod(value) {
+  return isNil(value) || value === false || value === '' || isObject(value) ?
+    REMOVE_ATTRIBUTE :
+    SET_ATTIBUTE
+}
+
+/**
+ * Get the value as string
+ * @param   {string} name - attribute name
+ * @param   {*} value - user input value
+ * @returns {string} input value as string
+ */
+function normalizeValue(name, value) {
+  // be sure that expressions like selected={ true } will be always rendered as selected='selected'
+  if (value === true) return name
+
+  return value
+}
+
+const RE_EVENTS_PREFIX = /^on/;
+
+/**
+ * Set a new event listener
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {string} expression.name - event name
+ * @param   {*} value - new expression value
+ * @param   {*} oldValue - old expression value
+ * @returns {value} the callback just received
+ */
+function eventExpression(node, { name }, value, oldValue) {
+  const normalizedEventName = name.replace(RE_EVENTS_PREFIX, '');
+
+  if (oldValue) {
+    node.removeEventListener(normalizedEventName, oldValue);
+  }
+
+  if (value) {
+    node.addEventListener(normalizedEventName, value, false);
+  }
+
+  return value
+}
+
+/**
+ * This methods handles a simple text expression update
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {number} expression.childNodeIndex - index to find the text node to update
+ * @param   {*} value - new expression value
+ * @returns {undefined}
+ */
+function textExpression(node, { childNodeIndex }, value) {
+  const target = node.childNodes[childNodeIndex];
+  const val = normalizeValue$1(value);
+
+  // replace the target if it's a placeholder comment
+  if (target.nodeType === Node.COMMENT_NODE) {
+    const textNode = document.createTextNode(val);
+    node.replaceChild(textNode, target);
+  } else {
+    target.data = normalizeValue$1(val);
+  }
+}
+
+/**
+ * Normalize the user value in order to render a empty string in case of falsy values
+ * @param   {*} value - user input value
+ * @returns {string} hopefully a string
+ */
+function normalizeValue$1(value) {
+  return isNil(value) ? '' : value
+}
+
+/**
+ * This methods handles the input fileds value updates
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {*} value - new expression value
+ * @returns {undefined}
+ */
+function valueExpression(node, expression, value) {
+  node.value = value;
+}
+
+var expressions = {
+  [ATTRIBUTE]: attributeExpression,
+  [EVENT]: eventExpression,
+  [TEXT]: textExpression,
+  [VALUE]: valueExpression
+};
+
+const Expression = Object.seal({
+  // Static props
+  node: null,
+  value: null,
+
+  // API methods
+  /**
+   * Mount the expression evaluating its initial value
+   * @param   {*} scope - argument passed to the expression to evaluate its current values
+   * @returns {Expression} self
+   */
+  mount(scope) {
+    // hopefully a pure function
+    this.value = this.evaluate(scope);
+
+    // IO() DOM updates
+    apply(this, this.value);
+
+    return this
+  },
+  /**
+   * Update the expression if its value changed
+   * @param   {*} scope - argument passed to the expression to evaluate its current values
+   * @returns {Expression} self
+   */
+  update(scope) {
+    // pure function
+    const value = this.evaluate(scope);
+
+    if (this.value !== value) {
+      // IO() DOM updates
+      apply(this, value);
+      this.value = value;
+    }
+
+    return this
+  },
+  /**
+   * Expression teardown method
+   * @returns {Expression} self
+   */
+  unmount() {
+    // unmount only the event handling expressions
+    if (this.type === EVENT) apply(this, null);
+
+    return this
+  }
+});
+
+/**
+ * IO() function to handle the DOM updates
+ * @param {Expression} expression - expression object
+ * @param {*} value - current expression value
+ * @returns {undefined}
+ */
+function apply(expression, value) {
+  return expressions[expression.type](expression.node, expression, value, expression.value)
+}
+
+function create$2(node, data) {
+  return {
+    ...Expression,
+    ...data,
+    node
+  }
+}
+
+/**
+ * Create a flat object having as keys a list of methods that if dispatched will propagate
+ * on the whole collection
+ * @param   {Array} collection - collection to iterate
+ * @param   {Array<string>} methods - methods to execute on each item of the collection
+ * @param   {*} context - context returned by the new methods created
+ * @returns {Object} a new object to simplify the the nested methods dispatching
+ */
+function flattenCollectionMethods(collection, methods, context) {
+  return methods.reduce((acc, method) => {
+    return {
+      ...acc,
+      [method]: (scope) => {
+        return collection.map(item => item[method](scope)) && context
+      }
+    }
+  }, {})
+}
+
+function create$3(node, { expressions }) {
+  return {
+    ...flattenCollectionMethods(
+      expressions.map(expression => create$2(node, expression)),
+      ['mount', 'update', 'unmount']
+    )
+  }
+}
+
+const SlotBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  name: null,
+  template: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    const templateData = scope.slots ? scope.slots.find(({id}) => id === this.name) : false;
+    const {parentNode} = this.node;
+
+    this.template = templateData && create$6(
+      templateData.html,
+      templateData.bindings
+    ).createDOM(parentNode);
+
+    if (this.template) {
+      this.template.mount(this.node, parentScope);
+      moveSlotInnerContent(this.node);
+    }
+
+    parentNode.removeChild(this.node);
+
+    return this
+  },
+  update(scope, parentScope) {
+    if (this.template && parentScope) {
+      this.template.update(parentScope);
+    }
+
+    return this
+  },
+  unmount(scope, parentScope, mustRemoveRoot) {
+    if (this.template) {
+      this.template.unmount(parentScope, null, mustRemoveRoot);
+    }
+
+    return this
+  }
+});
+
+/**
+ * Move the inner content of the slots outside of them
+ * @param   {HTMLNode} slot - slot node
+ * @returns {undefined} it's a void function
+ */
+function moveSlotInnerContent(slot) {
+  if (slot.firstChild) {
+    slot.parentNode.insertBefore(slot.firstChild, slot);
+    moveSlotInnerContent(slot);
+  }
+}
+
+/**
+ * Create a single slot binding
+ * @param   {HTMLElement} node - slot node
+ * @param   {string} options.name - slot id
+ * @returns {Object} Slot binding object
+ */
+function createSlot(node, { name }) {
+  return {
+    ...SlotBinding,
+    node,
+    name
+  }
+}
+
+/**
+ * Create a new tag object if it was registered before, otherwise fallback to the simple
+ * template chunk
+ * @param   {Function} component - component factory function
+ * @param   {Array<Object>} slots - array containing the slots markup
+ * @param   {Array} attributes - dynamic attributes that will be received by the tag element
+ * @returns {TagImplementation|TemplateChunk} a tag implementation or a template chunk as fallback
+ */
+function getTag(component, slots = [], attributes = []) {
+  // if this tag was registered before we will return its implementation
+  if (component) {
+    return component({ slots, attributes })
+  }
+
+  // otherwise we return a template chunk
+  return create$6(slotsToMarkup(slots), [
+    ...slotBindings(slots), {
+    // the attributes should be registered as binding
+    // if we fallback to a normal template chunk
+      expressions: attributes.map(attr => {
+        return {
+          type: ATTRIBUTE,
+          ...attr
+        }
+      })
+    }
+  ])
+}
+
+
+/**
+ * Merge all the slots bindings into a single array
+ * @param   {Array<Object>} slots - slots collection
+ * @returns {Array<Bindings>} flatten bindings array
+ */
+function slotBindings(slots) {
+  return slots.reduce((acc, { bindings }) => acc.concat(bindings), [])
+}
+
+/**
+ * Merge all the slots together in a single markup string
+ * @param   {Array<Object>} slots - slots collection
+ * @returns {string} markup of all the slots in a single string
+ */
+function slotsToMarkup(slots) {
+  return slots.reduce((acc, slot) => {
+    return acc + slot.html
+  }, '')
+}
+
+
+const TagBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  evaluate: null,
+  name: null,
+  slots: null,
+  tag: null,
+  attributes: null,
+  getComponent: null,
+
+  mount(scope) {
+    return this.update(scope)
+  },
+  update(scope, parentScope) {
+    const name = this.evaluate(scope);
+
+    // simple update
+    if (name === this.name) {
+      this.tag.update(scope);
+    } else {
+      // unmount the old tag if it exists
+      this.unmount(scope, parentScope, true);
+
+      // mount the new tag
+      this.name = name;
+      this.tag = getTag(this.getComponent(name), this.slots, this.attributes);
+      this.tag.mount(this.node, scope);
+    }
+
+    return this
+  },
+  unmount(scope, parentScope, keepRootTag) {
+    if (this.tag) {
+      // keep the root tag
+      this.tag.unmount(keepRootTag);
+    }
+
+    return this
+  }
+});
+
+function create$4(node, { evaluate, getComponent, slots, attributes }) {
+  return {
+    ...TagBinding,
+    node,
+    evaluate,
+    slots,
+    attributes,
+    getComponent
+  }
+}
+
+var bindings = {
+  [IF]: create$1,
+  [SIMPLE]: create$3,
+  [EACH]: create,
+  [TAG]: create$4,
+  [SLOT]: createSlot
+};
+
+/**
+ * Bind a new expression object to a DOM node
+ * @param   {HTMLElement} root - DOM node where to bind the expression
+ * @param   {Object} binding - binding data
+ * @returns {Expression} Expression object
+ */
+function create$5(root, binding) {
+  const { selector, type, redundantAttribute, expressions } = binding;
+  // find the node to apply the bindings
+  const node = selector ? root.querySelector(selector) : root;
+  // remove eventually additional attributes created only to select this node
+  if (redundantAttribute) node.removeAttribute(redundantAttribute);
+
+  // init the binding
+  return (bindings[type] || bindings[SIMPLE])(
+    node,
+    {
+      ...binding,
+      expressions: expressions || []
+    }
+  )
+}
+
+/**
+ * Check if an element is part of an svg
+ * @param   {HTMLElement}  el - element to check
+ * @returns {boolean} true if we are in an svg context
+ */
+function isSvg(el) {
+  const owner = el.ownerSVGElement;
+
+  return !!owner || owner === null
+}
+
+// in this case a simple innerHTML is enough
+function createHTMLTree(html, root) {
+  const template = isTemplate(root) ? root : document.createElement('template');
+  template.innerHTML = html;
+  return template.content
+}
+
+// for svg nodes we need a bit more work
+function createSVGTree(html, container) {
+  // create the SVGNode
+  const svgNode = container.ownerDocument.importNode(
+    new window.DOMParser()
+      .parseFromString(
+        `<svg xmlns="http://www.w3.org/2000/svg">${html}</svg>`,
+        'application/xml'
+      )
+      .documentElement,
+    true
+  );
+
+  return svgNode
+}
+
+/**
+ * Create the DOM that will be injected
+ * @param {Object} root - DOM node to find out the context where the fragment will be created
+ * @param   {string} html - DOM to create as string
+ * @returns {HTMLDocumentFragment|HTMLElement} a new html fragment
+ */
+function createDOMTree(root, html) {
+  if (isSvg(root)) return createSVGTree(html, root)
+
+  return createHTMLTree(html, root)
+}
+
+/**
+ * Move all the child nodes from a source tag to another
+ * @param   {HTMLElement} source - source node
+ * @param   {HTMLElement} target - target node
+ * @returns {undefined} it's a void method ¯\_(ツ)_/¯
+ */
+
+// Ignore this helper because it's needed only for svg tags
+/* istanbul ignore next */
+function moveChildren(source, target) {
+  if (source.firstChild) {
+    target.appendChild(source.firstChild);
+    moveChildren(source, target);
+  }
+}
+
+/**
+ * Inject the DOM tree into a target node
+ * @param   {HTMLElement} el - target element
+ * @param   {HTMLFragment|SVGElement} dom - dom tree to inject
+ * @returns {undefined}
+ */
+function injectDOM(el, dom) {
+  switch (true) {
+  case isSvg(el):
+    moveChildren(dom, el);
+    break
+  case isTemplate(el):
+    el.parentNode.replaceChild(dom, el);
+    break
+  default:
+    el.appendChild(dom);
+  }
+}
+
+/**
+ * Create the Template DOM skeleton
+ * @param   {HTMLElement} el - root node where the DOM will be injected
+ * @param   {string} html - markup that will be injected into the root node
+ * @returns {HTMLFragment} fragment that will be injected into the root node
+ */
+function createTemplateDOM(el, html) {
+  return html && (typeof html === 'string' ?
+    createDOMTree(el, html) :
+    html)
+}
+
+/**
+ * Template Chunk model
+ * @type {Object}
+ */
+const TemplateChunk = Object.freeze({
+  // Static props
+  bindings: null,
+  bindingsData: null,
+  html: null,
+  isTemplateTag: false,
+  fragment: null,
+  children: null,
+  dom: null,
+  el: null,
+
+  /**
+   * Create the template DOM structure that will be cloned on each mount
+   * @param   {HTMLElement} el - the root node
+   * @returns {TemplateChunk} self
+   */
+  createDOM(el) {
+    // make sure that the DOM gets created before cloning the template
+    this.dom = this.dom || createTemplateDOM(el, this.html);
+
+    return this
+  },
+
+  // API methods
+  /**
+   * Attach the template to a DOM node
+   * @param   {HTMLElement} el - target DOM node
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @param   {Object} meta - meta properties needed to handle the <template> tags in loops
+   * @returns {TemplateChunk} self
+   */
+  mount(el, scope, parentScope, meta = {}) {
+    if (!el) throw new Error('Please provide DOM node to mount properly your template')
+
+    if (this.el) this.unmount(scope);
+
+    // <template> tags require a bit more work
+    // the template fragment might be already created via meta outside of this call
+    const {fragment, children, avoidDOMInjection} = meta;
+    // <template> bindings of course can not have a root element
+    // so we check the parent node to set the query selector bindings
+    const {parentNode} = children ? children[0] : el;
+
+    this.isTemplateTag = isTemplate(el);
+
+    // create the DOM if it wasn't created before
+    this.createDOM(el);
+
+    if (this.dom) {
+      // create the new template dom fragment if it want already passed in via meta
+      this.fragment = fragment || this.dom.cloneNode(true);
+    }
+
+    // store root node
+    // notice that for template tags the root note will be the parent tag
+    this.el = this.isTemplateTag ? parentNode : el;
+    // create the children array only for the <template> fragments
+    this.children = this.isTemplateTag ? children || Array.from(this.fragment.childNodes) : null;
+
+    // inject the DOM into the el only if a fragment is available
+    if (!avoidDOMInjection && this.fragment) injectDOM(el, this.fragment);
+
+    // create the bindings
+    this.bindings = this.bindingsData.map(binding => create$5(this.el, binding));
+    this.bindings.forEach(b => b.mount(scope, parentScope));
+
+    return this
+  },
+  /**
+   * Update the template with fresh data
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @returns {TemplateChunk} self
+   */
+  update(scope, parentScope) {
+    this.bindings.forEach(b => b.update(scope, parentScope));
+
+    return this
+  },
+  /**
+   * Remove the template from the node where it was initially mounted
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @param   {boolean|null} mustRemoveRoot - if true remove the root element,
+   * if false or undefined clean the root tag content, if null don't touch the DOM
+   * @returns {TemplateChunk} self
+   */
+  unmount(scope, parentScope, mustRemoveRoot) {
+    if (this.el) {
+      this.bindings.forEach(b => b.unmount(scope, parentScope, mustRemoveRoot));
+
+      switch (true) {
+      // <template> tags should be treated a bit differently
+      // we need to clear their children only if it's explicitly required by the caller
+      // via mustRemoveRoot !== null
+      case this.isTemplateTag === true && mustRemoveRoot !== null:
+        clearChildren(this.children);
+        break
+
+      // remove the root node only if the mustRemoveRoot === true
+      case mustRemoveRoot === true && this.el.parentNode !== null:
+        this.el.parentNode.removeChild(this.el);
+        break
+
+      // otherwise we clean the node children
+      case mustRemoveRoot !== null:
+        cleanNode(this.el);
+        break
+      }
+
+      this.el = null;
+    }
+
+    return this
+  },
+  /**
+   * Clone the template chunk
+   * @returns {TemplateChunk} a clone of this object resetting the this.el property
+   */
+  clone() {
+    return {
+      ...this,
+      el: null
+    }
+  }
+});
+
+/**
+ * Create a template chunk wiring also the bindings
+ * @param   {string|HTMLElement} html - template string
+ * @param   {Array} bindings - bindings collection
+ * @returns {TemplateChunk} a new TemplateChunk copy
+ */
+function create$6(html, bindings = []) {
+  return {
+    ...TemplateChunk,
+    html,
+    bindingsData: bindings
+  }
+}
+
+export { bindingTypes, create$5 as createBinding, create$2 as createExpression, expressionTypes, create$6 as template };
diff --git a/node_modules/@riotjs/dom-bindings/dist/umd.dom-bindings.js b/node_modules/@riotjs/dom-bindings/dist/umd.dom-bindings.js
new file mode 100644
index 0000000..fe7ecbb
--- /dev/null
+++ b/node_modules/@riotjs/dom-bindings/dist/umd.dom-bindings.js
@@ -0,0 +1,1671 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = global || self, factory(global.riotDOMBindings = {}));
+}(this, function (exports) { 'use strict';
+
+  /**
+   * Remove the child nodes from any DOM node
+   * @param   {HTMLElement} node - target node
+   * @returns {undefined}
+   */
+  function cleanNode(node) {
+    clearChildren(node.childNodes);
+  }
+
+  /**
+   * Clear multiple children in a node
+   * @param   {HTMLElement[]} children - direct children nodes
+   * @returns {undefined}
+   */
+  function clearChildren(children) {
+    Array.from(children).forEach(n => n.parentNode && n.parentNode.removeChild(n));
+  }
+
+  const EACH = 0;
+  const IF = 1;
+  const SIMPLE = 2;
+  const TAG = 3;
+  const SLOT = 4;
+
+  var bindingTypes = {
+    EACH,
+    IF,
+    SIMPLE,
+    TAG,
+    SLOT
+  };
+
+  /**
+   * Create the template meta object in case of <template> fragments
+   * @param   {TemplateChunk} componentTemplate - template chunk object
+   * @returns {Object} the meta property that will be passed to the mount function of the TemplateChunk
+   */
+  function createTemplateMeta(componentTemplate) {
+    const fragment = componentTemplate.dom.cloneNode(true);
+
+    return {
+      avoidDOMInjection: true,
+      fragment,
+      children: Array.from(fragment.childNodes)
+    }
+  }
+
+  /* get rid of the @ungap/essential-map polyfill */
+
+  const {indexOf: iOF} = [];
+  const append = (get, parent, children, start, end, before) => {
+    const isSelect = 'selectedIndex' in parent;
+    let noSelection = isSelect;
+    while (start < end) {
+      const child = get(children[start], 1);
+      parent.insertBefore(child, before);
+      if (isSelect && noSelection && child.selected) {
+        noSelection = !noSelection;
+        let {selectedIndex} = parent;
+        parent.selectedIndex = selectedIndex < 0 ?
+          start :
+          iOF.call(parent.querySelectorAll('option'), child);
+      }
+      start++;
+    }
+  };
+
+  const eqeq = (a, b) => a == b;
+
+  const identity = O => O;
+
+  const indexOf = (
+    moreNodes,
+    moreStart,
+    moreEnd,
+    lessNodes,
+    lessStart,
+    lessEnd,
+    compare
+  ) => {
+    const length = lessEnd - lessStart;
+    /* istanbul ignore if */
+    if (length < 1)
+      return -1;
+    while ((moreEnd - moreStart) >= length) {
+      let m = moreStart;
+      let l = lessStart;
+      while (
+        m < moreEnd &&
+        l < lessEnd &&
+        compare(moreNodes[m], lessNodes[l])
+      ) {
+        m++;
+        l++;
+      }
+      if (l === lessEnd)
+        return moreStart;
+      moreStart = m + 1;
+    }
+    return -1;
+  };
+
+  const isReversed = (
+    futureNodes,
+    futureEnd,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    compare
+  ) => {
+    while (
+      currentStart < currentEnd &&
+      compare(
+        currentNodes[currentStart],
+        futureNodes[futureEnd - 1]
+      )) {
+        currentStart++;
+        futureEnd--;
+      }  return futureEnd === 0;
+  };
+
+  const next = (get, list, i, length, before) => i < length ?
+                get(list[i], 0) :
+                (0 < i ?
+                  get(list[i - 1], -0).nextSibling :
+                  before);
+
+  const remove = (get, parent, children, start, end) => {
+    if ((end - start) < 2)
+      parent.removeChild(get(children[start], -1));
+    else {
+      const range = parent.ownerDocument.createRange();
+      range.setStartBefore(get(children[start], -1));
+      range.setEndAfter(get(children[end - 1], -1));
+      range.deleteContents();
+    }
+  };
+
+  // - - - - - - - - - - - - - - - - - - -
+  // diff related constants and utilities
+  // - - - - - - - - - - - - - - - - - - -
+
+  const DELETION = -1;
+  const INSERTION = 1;
+  const SKIP = 0;
+  const SKIP_OND = 50;
+
+  const HS = (
+    futureNodes,
+    futureStart,
+    futureEnd,
+    futureChanges,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    currentChanges
+  ) => {
+
+    let k = 0;
+    /* istanbul ignore next */
+    let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+    const link = Array(minLen++);
+    const tresh = Array(minLen);
+    tresh[0] = -1;
+
+    for (let i = 1; i < minLen; i++)
+      tresh[i] = currentEnd;
+
+    const keymap = new Map;
+    for (let i = currentStart; i < currentEnd; i++)
+      keymap.set(currentNodes[i], i);
+
+    for (let i = futureStart; i < futureEnd; i++) {
+      const idxInOld = keymap.get(futureNodes[i]);
+      if (idxInOld != null) {
+        k = findK(tresh, minLen, idxInOld);
+        /* istanbul ignore else */
+        if (-1 < k) {
+          tresh[k] = idxInOld;
+          link[k] = {
+            newi: i,
+            oldi: idxInOld,
+            prev: link[k - 1]
+          };
+        }
+      }
+    }
+
+    k = --minLen;
+    --currentEnd;
+    while (tresh[k] > currentEnd) --k;
+
+    minLen = currentChanges + futureChanges - k;
+    const diff = Array(minLen);
+    let ptr = link[k];
+    --futureEnd;
+    while (ptr) {
+      const {newi, oldi} = ptr;
+      while (futureEnd > newi) {
+        diff[--minLen] = INSERTION;
+        --futureEnd;
+      }
+      while (currentEnd > oldi) {
+        diff[--minLen] = DELETION;
+        --currentEnd;
+      }
+      diff[--minLen] = SKIP;
+      --futureEnd;
+      --currentEnd;
+      ptr = ptr.prev;
+    }
+    while (futureEnd >= futureStart) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+    while (currentEnd >= currentStart) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+    return diff;
+  };
+
+  // this is pretty much the same petit-dom code without the delete map part
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+  const OND = (
+    futureNodes,
+    futureStart,
+    rows,
+    currentNodes,
+    currentStart,
+    cols,
+    compare
+  ) => {
+    const length = rows + cols;
+    const v = [];
+    let d, k, r, c, pv, cv, pd;
+    outer: for (d = 0; d <= length; d++) {
+      /* istanbul ignore if */
+      if (d > SKIP_OND)
+        return null;
+      pd = d - 1;
+      /* istanbul ignore next */
+      pv = d ? v[d - 1] : [0, 0];
+      cv = v[d] = [];
+      for (k = -d; k <= d; k += 2) {
+        if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+          c = pv[pd + k + 1];
+        } else {
+          c = pv[pd + k - 1] + 1;
+        }
+        r = c - k;
+        while (
+          c < cols &&
+          r < rows &&
+          compare(
+            currentNodes[currentStart + c],
+            futureNodes[futureStart + r]
+          )
+        ) {
+          c++;
+          r++;
+        }
+        if (c === cols && r === rows) {
+          break outer;
+        }
+        cv[d + k] = c;
+      }
+    }
+
+    const diff = Array(d / 2 + length / 2);
+    let diffIdx = diff.length - 1;
+    for (d = v.length - 1; d >= 0; d--) {
+      while (
+        c > 0 &&
+        r > 0 &&
+        compare(
+          currentNodes[currentStart + c - 1],
+          futureNodes[futureStart + r - 1]
+        )
+      ) {
+        // diagonal edge = equality
+        diff[diffIdx--] = SKIP;
+        c--;
+        r--;
+      }
+      if (!d)
+        break;
+      pd = d - 1;
+      /* istanbul ignore next */
+      pv = d ? v[d - 1] : [0, 0];
+      k = c - r;
+      if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+        // vertical edge = insertion
+        r--;
+        diff[diffIdx--] = INSERTION;
+      } else {
+        // horizontal edge = deletion
+        c--;
+        diff[diffIdx--] = DELETION;
+      }
+    }
+    return diff;
+  };
+
+  const applyDiff = (
+    diff,
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    currentNodes,
+    currentStart,
+    currentLength,
+    before
+  ) => {
+    const live = new Map;
+    const length = diff.length;
+    let currentIndex = currentStart;
+    let i = 0;
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          futureStart++;
+          currentIndex++;
+          break;
+        case INSERTION:
+          // TODO: bulk appends for sequential nodes
+          live.set(futureNodes[futureStart], 1);
+          append(
+            get,
+            parentNode,
+            futureNodes,
+            futureStart++,
+            futureStart,
+            currentIndex < currentLength ?
+              get(currentNodes[currentIndex], 0) :
+              before
+          );
+          break;
+        case DELETION:
+          currentIndex++;
+          break;
+      }
+    }
+    i = 0;
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          currentStart++;
+          break;
+        case DELETION:
+          // TODO: bulk removes for sequential nodes
+          if (live.has(currentNodes[currentStart]))
+            currentStart++;
+          else
+            remove(
+              get,
+              parentNode,
+              currentNodes,
+              currentStart++,
+              currentStart
+            );
+          break;
+      }
+    }
+  };
+
+  const findK = (ktr, length, j) => {
+    let lo = 1;
+    let hi = length;
+    while (lo < hi) {
+      const mid = ((lo + hi) / 2) >>> 0;
+      if (j < ktr[mid])
+        hi = mid;
+      else
+        lo = mid + 1;
+    }
+    return lo;
+  };
+
+  const smartDiff = (
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    futureEnd,
+    futureChanges,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    currentChanges,
+    currentLength,
+    compare,
+    before
+  ) => {
+    applyDiff(
+      OND(
+        futureNodes,
+        futureStart,
+        futureChanges,
+        currentNodes,
+        currentStart,
+        currentChanges,
+        compare
+      ) ||
+      HS(
+        futureNodes,
+        futureStart,
+        futureEnd,
+        futureChanges,
+        currentNodes,
+        currentStart,
+        currentEnd,
+        currentChanges
+      ),
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      currentNodes,
+      currentStart,
+      currentLength,
+      before
+    );
+  };
+
+  /*! (c) 2018 Andrea Giammarchi (ISC) */
+
+  const domdiff = (
+    parentNode,     // where changes happen
+    currentNodes,   // Array of current items/nodes
+    futureNodes,    // Array of future items/nodes
+    options         // optional object with one of the following properties
+                    //  before: domNode
+                    //  compare(generic, generic) => true if same generic
+                    //  node(generic) => Node
+  ) => {
+    if (!options)
+      options = {};
+
+    const compare = options.compare || eqeq;
+    const get = options.node || identity;
+    const before = options.before == null ? null : get(options.before, 0);
+
+    const currentLength = currentNodes.length;
+    let currentEnd = currentLength;
+    let currentStart = 0;
+
+    let futureEnd = futureNodes.length;
+    let futureStart = 0;
+
+    // common prefix
+    while (
+      currentStart < currentEnd &&
+      futureStart < futureEnd &&
+      compare(currentNodes[currentStart], futureNodes[futureStart])
+    ) {
+      currentStart++;
+      futureStart++;
+    }
+
+    // common suffix
+    while (
+      currentStart < currentEnd &&
+      futureStart < futureEnd &&
+      compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])
+    ) {
+      currentEnd--;
+      futureEnd--;
+    }
+
+    const currentSame = currentStart === currentEnd;
+    const futureSame = futureStart === futureEnd;
+
+    // same list
+    if (currentSame && futureSame)
+      return futureNodes;
+
+    // only stuff to add
+    if (currentSame && futureStart < futureEnd) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        futureEnd,
+        next(get, currentNodes, currentStart, currentLength, before)
+      );
+      return futureNodes;
+    }
+
+    // only stuff to remove
+    if (futureSame && currentStart < currentEnd) {
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        currentStart,
+        currentEnd
+      );
+      return futureNodes;
+    }
+
+    const currentChanges = currentEnd - currentStart;
+    const futureChanges = futureEnd - futureStart;
+    let i = -1;
+
+    // 2 simple indels: the shortest sequence is a subsequence of the longest
+    if (currentChanges < futureChanges) {
+      i = indexOf(
+        futureNodes,
+        futureStart,
+        futureEnd,
+        currentNodes,
+        currentStart,
+        currentEnd,
+        compare
+      );
+      // inner diff
+      if (-1 < i) {
+        append(
+          get,
+          parentNode,
+          futureNodes,
+          futureStart,
+          i,
+          get(currentNodes[currentStart], 0)
+        );
+        append(
+          get,
+          parentNode,
+          futureNodes,
+          i + currentChanges,
+          futureEnd,
+          next(get, currentNodes, currentEnd, currentLength, before)
+        );
+        return futureNodes;
+      }
+    }
+    /* istanbul ignore else */
+    else if (futureChanges < currentChanges) {
+      i = indexOf(
+        currentNodes,
+        currentStart,
+        currentEnd,
+        futureNodes,
+        futureStart,
+        futureEnd,
+        compare
+      );
+      // outer diff
+      if (-1 < i) {
+        remove(
+          get,
+          parentNode,
+          currentNodes,
+          currentStart,
+          i
+        );
+        remove(
+          get,
+          parentNode,
+          currentNodes,
+          i + futureChanges,
+          currentEnd
+        );
+        return futureNodes;
+      }
+    }
+
+    // common case with one replacement for many nodes
+    // or many nodes replaced for a single one
+    /* istanbul ignore else */
+    if ((currentChanges < 2 || futureChanges < 2)) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        futureEnd,
+        get(currentNodes[currentStart], 0)
+      );
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        currentStart,
+        currentEnd
+      );
+      return futureNodes;
+    }
+
+    // the half match diff part has been skipped in petit-dom
+    // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+    // accordingly, I think it's safe to skip in here too
+    // if one day it'll come out like the speediest thing ever to do
+    // then I might add it in here too
+
+    // Extra: before going too fancy, what about reversed lists ?
+    //        This should bail out pretty quickly if that's not the case.
+    if (
+      currentChanges === futureChanges &&
+      isReversed(
+        futureNodes,
+        futureEnd,
+        currentNodes,
+        currentStart,
+        currentEnd,
+        compare
+      )
+    ) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        futureEnd,
+        next(get, currentNodes, currentEnd, currentLength, before)
+      );
+      return futureNodes;
+    }
+
+    // last resort through a smart diff
+    smartDiff(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      currentChanges,
+      currentLength,
+      compare,
+      before
+    );
+
+    return futureNodes;
+  };
+
+  /**
+   * Check if a value is null or undefined
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the 'undefined' and 'null' types
+   */
+  function isNil(value) {
+    return value === null || value === undefined
+  }
+
+  /**
+   * Check if an element is a template tag
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if it's a <template>
+   */
+  function isTemplate(el) {
+    return !isNil(el.content)
+  }
+
+  const EachBinding = Object.seal({
+    // dynamic binding properties
+    childrenMap: null,
+    node: null,
+    root: null,
+    condition: null,
+    evaluate: null,
+    template: null,
+    isTemplateTag: false,
+    nodes: [],
+    getKey: null,
+    indexName: null,
+    itemName: null,
+    afterPlaceholder: null,
+    placeholder: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      return this.update(scope, parentScope)
+    },
+    update(scope, parentScope) {
+      const { placeholder } = this;
+      const collection = this.evaluate(scope);
+      const items = collection ? Array.from(collection) : [];
+      const parent = placeholder.parentNode;
+
+      // prepare the diffing
+      const {
+        newChildrenMap,
+        batches,
+        futureNodes
+      } = createPatch(items, scope, parentScope, this);
+
+      // patch the DOM only if there are new nodes
+      if (futureNodes.length) {
+        domdiff(parent, this.nodes, futureNodes, {
+          before: placeholder,
+          node: patch(
+            Array.from(this.childrenMap.values()),
+            parentScope
+          )
+        });
+      } else {
+        // remove all redundant templates
+        unmountRedundant(this.childrenMap);
+      }
+
+      // trigger the mounts and the updates
+      batches.forEach(fn => fn());
+
+      // update the children map
+      this.childrenMap = newChildrenMap;
+      this.nodes = futureNodes;
+
+      return this
+    },
+    unmount(scope, parentScope) {
+      unmountRedundant(this.childrenMap, parentScope);
+
+      this.childrenMap = new Map();
+      this.nodes = [];
+
+      return this
+    }
+  });
+
+  /**
+   * Patch the DOM while diffing
+   * @param   {TemplateChunk[]} redundant - redundant tepmplate chunks
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {Function} patch function used by domdiff
+   */
+  function patch(redundant, parentScope) {
+    return (item, info) => {
+      if (info < 0) {
+        const {template, context} = redundant.pop();
+        // notice that we pass null as last argument because
+        // the root node and its children will be removed by domdiff
+        template.unmount(context, parentScope, null);
+      }
+
+      return item
+    }
+  }
+
+  /**
+   * Unmount the remaining template instances
+   * @param   {Map} childrenMap - map containing the children template to unmount
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {TemplateChunk[]} collection containing the template chunks unmounted
+   */
+  function unmountRedundant(childrenMap, parentScope) {
+    return Array
+      .from(childrenMap.values())
+      .map(({template, context}) => {
+        return template.unmount(context, parentScope, true)
+      })
+  }
+
+  /**
+   * Check whether a template must be filtered from a loop
+   * @param   {Function} condition - filter function
+   * @param   {Object} context - argument passed to the filter function
+   * @returns {boolean} true if this item should be skipped
+   */
+  function mustFilterItem(condition, context) {
+    return condition ? Boolean(condition(context)) === false : false
+  }
+
+  /**
+   * Extend the scope of the looped template
+   * @param   {Object} scope - current template scope
+   * @param   {string} options.itemName - key to identify the looped item in the new context
+   * @param   {string} options.indexName - key to identify the index of the looped item
+   * @param   {number} options.index - current index
+   * @param   {*} options.item - collection item looped
+   * @returns {Object} enhanced scope object
+   */
+  function extendScope(scope, {itemName, indexName, index, item}) {
+    scope[itemName] = item;
+    if (indexName) scope[indexName] = index;
+    return scope
+  }
+
+  /**
+   * Loop the current template items
+   * @param   {Array} items - expression collection value
+   * @param   {*} scope - template scope
+   * @param   {*} parentScope - scope of the parent template
+   * @param   {EeachBinding} binding - each binding object instance
+   * @returns {Object} data
+   * @returns {Map} data.newChildrenMap - a Map containing the new children template structure
+   * @returns {Array} data.batches - array containing the template lifecycle functions to trigger
+   * @returns {Array} data.futureNodes - array containing the nodes we need to diff
+   */
+  function createPatch(items, scope, parentScope, binding) {
+    const { condition, template, childrenMap, itemName, getKey, indexName, root, isTemplateTag } = binding;
+    const newChildrenMap = new Map();
+    const batches = [];
+    const futureNodes = [];
+
+    items.forEach((item, index) => {
+      const context = extendScope(Object.create(scope), {itemName, indexName, index, item});
+      const key = getKey ? getKey(context) : index;
+      const oldItem = childrenMap.get(key);
+
+      if (mustFilterItem(condition, context)) {
+        return
+      }
+
+      const componentTemplate = oldItem ? oldItem.template : template.clone();
+      const el = oldItem ? componentTemplate.el : root.cloneNode();
+      const mustMount = !oldItem;
+      const meta = isTemplateTag && mustMount ? createTemplateMeta(componentTemplate) : {};
+
+      if (mustMount) {
+        batches.push(() => componentTemplate.mount(el, context, parentScope, meta));
+      } else {
+        componentTemplate.update(context, parentScope);
+      }
+
+      // create the collection of nodes to update or to add
+      // in case of template tags we need to add all its children nodes
+      if (isTemplateTag) {
+        futureNodes.push(...meta.children || componentTemplate.children);
+      } else {
+        futureNodes.push(el);
+      }
+
+      // delete the old item from the children map
+      childrenMap.delete(key);
+
+      // update the children map
+      newChildrenMap.set(key, {
+        template: componentTemplate,
+        context,
+        index
+      });
+    });
+
+    return {
+      newChildrenMap,
+      batches,
+      futureNodes
+    }
+  }
+
+  function create(node, { evaluate, condition, itemName, indexName, getKey, template }) {
+    const placeholder = document.createTextNode('');
+    const parent = node.parentNode;
+    const root = node.cloneNode();
+
+    parent.insertBefore(placeholder, node);
+    parent.removeChild(node);
+
+    return {
+      ...EachBinding,
+      childrenMap: new Map(),
+      node,
+      root,
+      condition,
+      evaluate,
+      isTemplateTag: isTemplate(root),
+      template: template.createDOM(node),
+      getKey,
+      indexName,
+      itemName,
+      placeholder
+    }
+  }
+
+  /**
+   * Binding responsible for the `if` directive
+   */
+  const IfBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    parent: null,
+    isTemplateTag: false,
+    placeholder: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      this.parent.insertBefore(this.placeholder, this.node);
+      this.parent.removeChild(this.node);
+
+      return this.update(scope, parentScope)
+    },
+    update(scope, parentScope) {
+      const value = !!this.evaluate(scope);
+      const mustMount = !this.value && value;
+      const mustUnmount = this.value && !value;
+      const mount = () => {
+        const pristine = this.node.cloneNode();
+
+        this.parent.insertBefore(pristine, this.placeholder);
+
+        this.template = this.template.clone();
+        this.template.mount(pristine, scope, parentScope);
+      };
+
+      switch (true) {
+      case mustMount:
+        mount();
+        break
+      case mustUnmount:
+        this.unmount(scope);
+        break
+      default:
+        if (value) this.template.update(scope, parentScope);
+      }
+
+      this.value = value;
+
+      return this
+    },
+    unmount(scope, parentScope) {
+      this.template.unmount(scope, parentScope, true);
+
+      return this
+    }
+  });
+
+  function create$1(node, { evaluate, template }) {
+    return {
+      ...IfBinding,
+      node,
+      evaluate,
+      parent: node.parentNode,
+      placeholder: document.createTextNode(''),
+      template: template.createDOM(node)
+    }
+  }
+
+  const ATTRIBUTE = 0;
+  const EVENT = 1;
+  const TEXT = 2;
+  const VALUE = 3;
+
+  var expressionTypes = {
+    ATTRIBUTE,
+    EVENT,
+    TEXT,
+    VALUE
+  };
+
+  /**
+   * Check if a value is a Boolean
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is a boolean
+   */
+  function isBoolean(value) {
+    return typeof value === 'boolean'
+  }
+
+  /**
+   * Check if a value is an Object
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is an object
+   */
+  function isObject(value) {
+    return typeof value === 'object'
+  }
+
+  const REMOVE_ATTRIBUTE = 'removeAttribute';
+  const SET_ATTIBUTE = 'setAttribute';
+
+  /**
+   * Add all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing the attributes names and values
+   * @returns {undefined} sorry it's a void function :(
+   */
+  function setAllAttributes(node, attributes) {
+    Object
+      .entries(attributes)
+      .forEach(([name, value]) => attributeExpression(node, { name }, value));
+  }
+
+  /**
+   * Remove all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing all the attribute names
+   * @returns {undefined} sorry it's a void function :(
+   */
+  function removeAllAttributes(node, attributes) {
+    Object
+      .keys(attributes)
+      .forEach(attribute => node.removeAttribute(attribute));
+  }
+
+  /**
+   * This methods handles the DOM attributes updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - attribute name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - the old expression cached value
+   * @returns {undefined}
+   */
+  function attributeExpression(node, { name }, value, oldValue) {
+    // is it a spread operator? {...attributes}
+    if (!name) {
+      // is the value still truthy?
+      if (value) {
+        setAllAttributes(node, value);
+      } else if (oldValue) {
+        // otherwise remove all the old attributes
+        removeAllAttributes(node, oldValue);
+      }
+
+      return
+    }
+
+    // handle boolean attributes
+    if (isBoolean(value) || isObject(value)) {
+      node[name] = value;
+    }
+
+    node[getMethod(value)](name, normalizeValue(name, value));
+  }
+
+  /**
+   * Get the attribute modifier method
+   * @param   {*} value - if truthy we return `setAttribute` othewise `removeAttribute`
+   * @returns {string} the node attribute modifier method name
+   */
+  function getMethod(value) {
+    return isNil(value) || value === false || value === '' || isObject(value) ?
+      REMOVE_ATTRIBUTE :
+      SET_ATTIBUTE
+  }
+
+  /**
+   * Get the value as string
+   * @param   {string} name - attribute name
+   * @param   {*} value - user input value
+   * @returns {string} input value as string
+   */
+  function normalizeValue(name, value) {
+    // be sure that expressions like selected={ true } will be always rendered as selected='selected'
+    if (value === true) return name
+
+    return value
+  }
+
+  const RE_EVENTS_PREFIX = /^on/;
+
+  /**
+   * Set a new event listener
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - event name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - old expression value
+   * @returns {value} the callback just received
+   */
+  function eventExpression(node, { name }, value, oldValue) {
+    const normalizedEventName = name.replace(RE_EVENTS_PREFIX, '');
+
+    if (oldValue) {
+      node.removeEventListener(normalizedEventName, oldValue);
+    }
+
+    if (value) {
+      node.addEventListener(normalizedEventName, value, false);
+    }
+
+    return value
+  }
+
+  /**
+   * This methods handles a simple text expression update
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {number} expression.childNodeIndex - index to find the text node to update
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+  function textExpression(node, { childNodeIndex }, value) {
+    const target = node.childNodes[childNodeIndex];
+    const val = normalizeValue$1(value);
+
+    // replace the target if it's a placeholder comment
+    if (target.nodeType === Node.COMMENT_NODE) {
+      const textNode = document.createTextNode(val);
+      node.replaceChild(textNode, target);
+    } else {
+      target.data = normalizeValue$1(val);
+    }
+  }
+
+  /**
+   * Normalize the user value in order to render a empty string in case of falsy values
+   * @param   {*} value - user input value
+   * @returns {string} hopefully a string
+   */
+  function normalizeValue$1(value) {
+    return isNil(value) ? '' : value
+  }
+
+  /**
+   * This methods handles the input fileds value updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+  function valueExpression(node, expression, value) {
+    node.value = value;
+  }
+
+  var expressions = {
+    [ATTRIBUTE]: attributeExpression,
+    [EVENT]: eventExpression,
+    [TEXT]: textExpression,
+    [VALUE]: valueExpression
+  };
+
+  const Expression = Object.seal({
+    // Static props
+    node: null,
+    value: null,
+
+    // API methods
+    /**
+     * Mount the expression evaluating its initial value
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    mount(scope) {
+      // hopefully a pure function
+      this.value = this.evaluate(scope);
+
+      // IO() DOM updates
+      apply(this, this.value);
+
+      return this
+    },
+    /**
+     * Update the expression if its value changed
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    update(scope) {
+      // pure function
+      const value = this.evaluate(scope);
+
+      if (this.value !== value) {
+        // IO() DOM updates
+        apply(this, value);
+        this.value = value;
+      }
+
+      return this
+    },
+    /**
+     * Expression teardown method
+     * @returns {Expression} self
+     */
+    unmount() {
+      // unmount only the event handling expressions
+      if (this.type === EVENT) apply(this, null);
+
+      return this
+    }
+  });
+
+  /**
+   * IO() function to handle the DOM updates
+   * @param {Expression} expression - expression object
+   * @param {*} value - current expression value
+   * @returns {undefined}
+   */
+  function apply(expression, value) {
+    return expressions[expression.type](expression.node, expression, value, expression.value)
+  }
+
+  function create$2(node, data) {
+    return {
+      ...Expression,
+      ...data,
+      node
+    }
+  }
+
+  /**
+   * Create a flat object having as keys a list of methods that if dispatched will propagate
+   * on the whole collection
+   * @param   {Array} collection - collection to iterate
+   * @param   {Array<string>} methods - methods to execute on each item of the collection
+   * @param   {*} context - context returned by the new methods created
+   * @returns {Object} a new object to simplify the the nested methods dispatching
+   */
+  function flattenCollectionMethods(collection, methods, context) {
+    return methods.reduce((acc, method) => {
+      return {
+        ...acc,
+        [method]: (scope) => {
+          return collection.map(item => item[method](scope)) && context
+        }
+      }
+    }, {})
+  }
+
+  function create$3(node, { expressions }) {
+    return {
+      ...flattenCollectionMethods(
+        expressions.map(expression => create$2(node, expression)),
+        ['mount', 'update', 'unmount']
+      )
+    }
+  }
+
+  const SlotBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    name: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      const templateData = scope.slots ? scope.slots.find(({id}) => id === this.name) : false;
+      const {parentNode} = this.node;
+
+      this.template = templateData && create$6(
+        templateData.html,
+        templateData.bindings
+      ).createDOM(parentNode);
+
+      if (this.template) {
+        this.template.mount(this.node, parentScope);
+        moveSlotInnerContent(this.node);
+      }
+
+      parentNode.removeChild(this.node);
+
+      return this
+    },
+    update(scope, parentScope) {
+      if (this.template && parentScope) {
+        this.template.update(parentScope);
+      }
+
+      return this
+    },
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.template) {
+        this.template.unmount(parentScope, null, mustRemoveRoot);
+      }
+
+      return this
+    }
+  });
+
+  /**
+   * Move the inner content of the slots outside of them
+   * @param   {HTMLNode} slot - slot node
+   * @returns {undefined} it's a void function
+   */
+  function moveSlotInnerContent(slot) {
+    if (slot.firstChild) {
+      slot.parentNode.insertBefore(slot.firstChild, slot);
+      moveSlotInnerContent(slot);
+    }
+  }
+
+  /**
+   * Create a single slot binding
+   * @param   {HTMLElement} node - slot node
+   * @param   {string} options.name - slot id
+   * @returns {Object} Slot binding object
+   */
+  function createSlot(node, { name }) {
+    return {
+      ...SlotBinding,
+      node,
+      name
+    }
+  }
+
+  /**
+   * Create a new tag object if it was registered before, otherwise fallback to the simple
+   * template chunk
+   * @param   {Function} component - component factory function
+   * @param   {Array<Object>} slots - array containing the slots markup
+   * @param   {Array} attributes - dynamic attributes that will be received by the tag element
+   * @returns {TagImplementation|TemplateChunk} a tag implementation or a template chunk as fallback
+   */
+  function getTag(component, slots = [], attributes = []) {
+    // if this tag was registered before we will return its implementation
+    if (component) {
+      return component({ slots, attributes })
+    }
+
+    // otherwise we return a template chunk
+    return create$6(slotsToMarkup(slots), [
+      ...slotBindings(slots), {
+      // the attributes should be registered as binding
+      // if we fallback to a normal template chunk
+        expressions: attributes.map(attr => {
+          return {
+            type: ATTRIBUTE,
+            ...attr
+          }
+        })
+      }
+    ])
+  }
+
+
+  /**
+   * Merge all the slots bindings into a single array
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {Array<Bindings>} flatten bindings array
+   */
+  function slotBindings(slots) {
+    return slots.reduce((acc, { bindings }) => acc.concat(bindings), [])
+  }
+
+  /**
+   * Merge all the slots together in a single markup string
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {string} markup of all the slots in a single string
+   */
+  function slotsToMarkup(slots) {
+    return slots.reduce((acc, slot) => {
+      return acc + slot.html
+    }, '')
+  }
+
+
+  const TagBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    name: null,
+    slots: null,
+    tag: null,
+    attributes: null,
+    getComponent: null,
+
+    mount(scope) {
+      return this.update(scope)
+    },
+    update(scope, parentScope) {
+      const name = this.evaluate(scope);
+
+      // simple update
+      if (name === this.name) {
+        this.tag.update(scope);
+      } else {
+        // unmount the old tag if it exists
+        this.unmount(scope, parentScope, true);
+
+        // mount the new tag
+        this.name = name;
+        this.tag = getTag(this.getComponent(name), this.slots, this.attributes);
+        this.tag.mount(this.node, scope);
+      }
+
+      return this
+    },
+    unmount(scope, parentScope, keepRootTag) {
+      if (this.tag) {
+        // keep the root tag
+        this.tag.unmount(keepRootTag);
+      }
+
+      return this
+    }
+  });
+
+  function create$4(node, { evaluate, getComponent, slots, attributes }) {
+    return {
+      ...TagBinding,
+      node,
+      evaluate,
+      slots,
+      attributes,
+      getComponent
+    }
+  }
+
+  var bindings = {
+    [IF]: create$1,
+    [SIMPLE]: create$3,
+    [EACH]: create,
+    [TAG]: create$4,
+    [SLOT]: createSlot
+  };
+
+  /**
+   * Bind a new expression object to a DOM node
+   * @param   {HTMLElement} root - DOM node where to bind the expression
+   * @param   {Object} binding - binding data
+   * @returns {Expression} Expression object
+   */
+  function create$5(root, binding) {
+    const { selector, type, redundantAttribute, expressions } = binding;
+    // find the node to apply the bindings
+    const node = selector ? root.querySelector(selector) : root;
+    // remove eventually additional attributes created only to select this node
+    if (redundantAttribute) node.removeAttribute(redundantAttribute);
+
+    // init the binding
+    return (bindings[type] || bindings[SIMPLE])(
+      node,
+      {
+        ...binding,
+        expressions: expressions || []
+      }
+    )
+  }
+
+  /**
+   * Check if an element is part of an svg
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if we are in an svg context
+   */
+  function isSvg(el) {
+    const owner = el.ownerSVGElement;
+
+    return !!owner || owner === null
+  }
+
+  // in this case a simple innerHTML is enough
+  function createHTMLTree(html, root) {
+    const template = isTemplate(root) ? root : document.createElement('template');
+    template.innerHTML = html;
+    return template.content
+  }
+
+  // for svg nodes we need a bit more work
+  function createSVGTree(html, container) {
+    // create the SVGNode
+    const svgNode = container.ownerDocument.importNode(
+      new window.DOMParser()
+        .parseFromString(
+          `<svg xmlns="http://www.w3.org/2000/svg">${html}</svg>`,
+          'application/xml'
+        )
+        .documentElement,
+      true
+    );
+
+    return svgNode
+  }
+
+  /**
+   * Create the DOM that will be injected
+   * @param {Object} root - DOM node to find out the context where the fragment will be created
+   * @param   {string} html - DOM to create as string
+   * @returns {HTMLDocumentFragment|HTMLElement} a new html fragment
+   */
+  function createDOMTree(root, html) {
+    if (isSvg(root)) return createSVGTree(html, root)
+
+    return createHTMLTree(html, root)
+  }
+
+  /**
+   * Move all the child nodes from a source tag to another
+   * @param   {HTMLElement} source - source node
+   * @param   {HTMLElement} target - target node
+   * @returns {undefined} it's a void method ¯\_(ツ)_/¯
+   */
+
+  // Ignore this helper because it's needed only for svg tags
+  /* istanbul ignore next */
+  function moveChildren(source, target) {
+    if (source.firstChild) {
+      target.appendChild(source.firstChild);
+      moveChildren(source, target);
+    }
+  }
+
+  /**
+   * Inject the DOM tree into a target node
+   * @param   {HTMLElement} el - target element
+   * @param   {HTMLFragment|SVGElement} dom - dom tree to inject
+   * @returns {undefined}
+   */
+  function injectDOM(el, dom) {
+    switch (true) {
+    case isSvg(el):
+      moveChildren(dom, el);
+      break
+    case isTemplate(el):
+      el.parentNode.replaceChild(dom, el);
+      break
+    default:
+      el.appendChild(dom);
+    }
+  }
+
+  /**
+   * Create the Template DOM skeleton
+   * @param   {HTMLElement} el - root node where the DOM will be injected
+   * @param   {string} html - markup that will be injected into the root node
+   * @returns {HTMLFragment} fragment that will be injected into the root node
+   */
+  function createTemplateDOM(el, html) {
+    return html && (typeof html === 'string' ?
+      createDOMTree(el, html) :
+      html)
+  }
+
+  /**
+   * Template Chunk model
+   * @type {Object}
+   */
+  const TemplateChunk = Object.freeze({
+    // Static props
+    bindings: null,
+    bindingsData: null,
+    html: null,
+    isTemplateTag: false,
+    fragment: null,
+    children: null,
+    dom: null,
+    el: null,
+
+    /**
+     * Create the template DOM structure that will be cloned on each mount
+     * @param   {HTMLElement} el - the root node
+     * @returns {TemplateChunk} self
+     */
+    createDOM(el) {
+      // make sure that the DOM gets created before cloning the template
+      this.dom = this.dom || createTemplateDOM(el, this.html);
+
+      return this
+    },
+
+    // API methods
+    /**
+     * Attach the template to a DOM node
+     * @param   {HTMLElement} el - target DOM node
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {Object} meta - meta properties needed to handle the <template> tags in loops
+     * @returns {TemplateChunk} self
+     */
+    mount(el, scope, parentScope, meta = {}) {
+      if (!el) throw new Error('Please provide DOM node to mount properly your template')
+
+      if (this.el) this.unmount(scope);
+
+      // <template> tags require a bit more work
+      // the template fragment might be already created via meta outside of this call
+      const {fragment, children, avoidDOMInjection} = meta;
+      // <template> bindings of course can not have a root element
+      // so we check the parent node to set the query selector bindings
+      const {parentNode} = children ? children[0] : el;
+
+      this.isTemplateTag = isTemplate(el);
+
+      // create the DOM if it wasn't created before
+      this.createDOM(el);
+
+      if (this.dom) {
+        // create the new template dom fragment if it want already passed in via meta
+        this.fragment = fragment || this.dom.cloneNode(true);
+      }
+
+      // store root node
+      // notice that for template tags the root note will be the parent tag
+      this.el = this.isTemplateTag ? parentNode : el;
+      // create the children array only for the <template> fragments
+      this.children = this.isTemplateTag ? children || Array.from(this.fragment.childNodes) : null;
+
+      // inject the DOM into the el only if a fragment is available
+      if (!avoidDOMInjection && this.fragment) injectDOM(el, this.fragment);
+
+      // create the bindings
+      this.bindings = this.bindingsData.map(binding => create$5(this.el, binding));
+      this.bindings.forEach(b => b.mount(scope, parentScope));
+
+      return this
+    },
+    /**
+     * Update the template with fresh data
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @returns {TemplateChunk} self
+     */
+    update(scope, parentScope) {
+      this.bindings.forEach(b => b.update(scope, parentScope));
+
+      return this
+    },
+    /**
+     * Remove the template from the node where it was initially mounted
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {boolean|null} mustRemoveRoot - if true remove the root element,
+     * if false or undefined clean the root tag content, if null don't touch the DOM
+     * @returns {TemplateChunk} self
+     */
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.el) {
+        this.bindings.forEach(b => b.unmount(scope, parentScope, mustRemoveRoot));
+
+        switch (true) {
+        // <template> tags should be treated a bit differently
+        // we need to clear their children only if it's explicitly required by the caller
+        // via mustRemoveRoot !== null
+        case this.isTemplateTag === true && mustRemoveRoot !== null:
+          clearChildren(this.children);
+          break
+
+        // remove the root node only if the mustRemoveRoot === true
+        case mustRemoveRoot === true && this.el.parentNode !== null:
+          this.el.parentNode.removeChild(this.el);
+          break
+
+        // otherwise we clean the node children
+        case mustRemoveRoot !== null:
+          cleanNode(this.el);
+          break
+        }
+
+        this.el = null;
+      }
+
+      return this
+    },
+    /**
+     * Clone the template chunk
+     * @returns {TemplateChunk} a clone of this object resetting the this.el property
+     */
+    clone() {
+      return {
+        ...this,
+        el: null
+      }
+    }
+  });
+
+  /**
+   * Create a template chunk wiring also the bindings
+   * @param   {string|HTMLElement} html - template string
+   * @param   {Array} bindings - bindings collection
+   * @returns {TemplateChunk} a new TemplateChunk copy
+   */
+  function create$6(html, bindings = []) {
+    return {
+      ...TemplateChunk,
+      html,
+      bindingsData: bindings
+    }
+  }
+
+  exports.bindingTypes = bindingTypes;
+  exports.createBinding = create$5;
+  exports.createExpression = create$2;
+  exports.expressionTypes = expressionTypes;
+  exports.template = create$6;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/@riotjs/dom-bindings/package.json b/node_modules/@riotjs/dom-bindings/package.json
new file mode 100644
index 0000000..4f5a025
--- /dev/null
+++ b/node_modules/@riotjs/dom-bindings/package.json
@@ -0,0 +1,88 @@
+{
+  "_from": "@riotjs/dom-bindings@^4.2.5",
+  "_id": "@riotjs/dom-bindings@4.3.0",
+  "_inBundle": false,
+  "_integrity": "sha512-SxcuWgW9wdUlJnMiyNgeC6n/Olo1SyiDmhSpR+Ss+iUKCnfjbl5lpq6AoBqpUiO++PMUIRZqsDsvkI+pilMSqw==",
+  "_location": "/@riotjs/dom-bindings",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@riotjs/dom-bindings@^4.2.5",
+    "name": "@riotjs/dom-bindings",
+    "escapedName": "@riotjs%2fdom-bindings",
+    "scope": "@riotjs",
+    "rawSpec": "^4.2.5",
+    "saveSpec": null,
+    "fetchSpec": "^4.2.5"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler",
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/@riotjs/dom-bindings/-/dom-bindings-4.3.0.tgz",
+  "_shasum": "38dd567814f4150f1fd6e3a94762d532d278b879",
+  "_spec": "@riotjs/dom-bindings@^4.2.5",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/GianlucaGuarini/dom-bindings/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "domdiff": "^2.0.7"
+  },
+  "deprecated": false,
+  "description": "Riot.js DOM bindings",
+  "devDependencies": {
+    "benchmark": "^2.1.4",
+    "chai": "^4.2.0",
+    "coveralls": "^3.0.6",
+    "eslint": "^6.3.0",
+    "eslint-config-riot": "^3.0.0",
+    "esm": "^3.2.25",
+    "jsdom": "15.1.1",
+    "jsdom-global": "3.0.2",
+    "mocha": "^6.2.0",
+    "nyc": "^14.1.1",
+    "rollup": "^1.20.3",
+    "rollup-plugin-alias": "^2.0.0",
+    "rollup-plugin-node-resolve": "^5.2.0",
+    "sinon": "^7.4.1",
+    "sinon-chai": "^3.3.0"
+  },
+  "files": [
+    "dist"
+  ],
+  "homepage": "https://github.com/GianlucaGuarini/dom-bindings#readme",
+  "jsnext:main": "dist/esm.dom-bindings.js",
+  "keywords": [
+    "riot",
+    "dom-bindings"
+  ],
+  "license": "MIT",
+  "main": "dist/umd.dom-bindings.js",
+  "module": "dist/esm.dom-bindings.js",
+  "name": "@riotjs/dom-bindings",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/GianlucaGuarini/dom-bindings.git"
+  },
+  "scripts": {
+    "bench": "node benchmarks",
+    "build": "rollup -c",
+    "cov": "nyc report --reporter=text-lcov | coveralls",
+    "cov-html": "nyc report --reporter=html",
+    "lint": "eslint src/ test/ rollup.config.js",
+    "postest": "npm run cov-html",
+    "prepublishOnly": "npm test",
+    "pretest": "npm run build",
+    "test": "npm run lint && nyc mocha -r esm test/index.js",
+    "test-debug": "mocha -r esm --inspect --inspect-brk test/index.js"
+  },
+  "version": "4.3.0"
+}
diff --git a/node_modules/@riotjs/parser/CHANGELOG.md b/node_modules/@riotjs/parser/CHANGELOG.md
new file mode 100644
index 0000000..bb42370
--- /dev/null
+++ b/node_modules/@riotjs/parser/CHANGELOG.md
@@ -0,0 +1,89 @@
+# Changes for riot-parser
+
+### v4.0.3
+- Fix https://github.com/riot/riot/issues/2723 for real this time
+
+### v4.0.2
+- Fix parsing of nested svg nodes https://github.com/riot/riot/issues/2723
+
+### v4.0.1
+- Fix the creation of the `parts` array in nodes containing expressions
+
+### v4.0.0
+- Stable release
+- Add more tests for the new feautures listed below
+
+### v4.0.0-rc.2
+- Fix: support spread attributes together with other attribute expressions on the same DOM node
+
+### v4.0.0-rc.1
+- Fix https://github.com/riot/riot/issues/2679
+- Add support for `<a {href}>` expression attributes shortcuts
+
+### v0.8.1
+- Add the `src` folder to the npm publishing files
+
+### v0.8.0
+- Add support for the spread attributes `<a {...foo.bar}>`
+- Fixed the `isCustom` boolean that will be added also to the root nodes
+
+### v0.6.9
+- Remove the unecessary PUBLIC_JAVASCRIPT and PRIVATE_JAVASCRIPT nodes
+
+### v0.5.0
+- Remove the the useless prefix option
+- Improve the coverage
+- Improve the quality of the source code
+
+### v0.4.0
+- Add the [`dom-nodes`](https://github.com/riot/dom-nodes) dependecy to improve the output
+- Add the `isCustom`, `isBoolean`, `isVoid`, `isSelfClosing` and `isRaw` boolean node attributes
+
+### v0.3.0
+- Fix treeBuilder issues
+- Improve coverage
+- Improve code maintainability
+
+### v0.2.0
+- Add `voidTags` to the exports
+
+### v0.1.0
+- Enhance the javascript parsing: the javascript node will contain nested nodes containing the private and the public javascript methods
+- Add the PUBLIC_JAVASCRIPT and PRIVATE_JAVASCRIPT nodes
+- Change the `attr` to `attributes` and `expr` to `expressions` keys
+
+### v0.0.6
+- Tree-builder support for 'if/else/elseif' tags (avoid unexpected closing tag errors).
+- Fix to text nodes only escaping the fist block of whitespace.
+
+### v0.0.5
+- Now, attribute names are lowercased in the builder, only for empty namespaces (i.e. not svg).
+
+### v0.0.4
+- Included TEXTAREA as special tag that can contain only raw text and expressions.
+- For SVG tags, now the `ns` property is the full URI http://www.w3.org/2000/svg.
+- The `children` property of TAGs is renamed to `nodes`.
+
+### v0.0.3
+- The default builder is integrated in this module and injected in the parser.
+- Only two versions, node CommonJS (transpiled to ES5) and ES6 modules (untranspiled).
+- The `nodeTypes` property of TagParser is removed, now is in a separated submodule.
+- Exposing `skipES6TL` to skip ES6 Template Literals.
+- Reduction of code size, `skipRegex` is imported from npm.
+- Source files (ES6) are moved to the "lib/" directory.
+- Remove dependency on `Object.assign`.
+- Updated devDependencies.
+
+### v0.0.2 (UNPUBLISHED)
+- Added suport for SVG en the tests.
+- Added test/builder/tree-builder2.js as sample.
+- Support for self-closing script/style tags.
+- The `replace` property of attributes and text is discarded and there's a new property `unescape` is an array containing the positions of the escape characters (relative to the whole buffer).
+- Matching literal regexes is a bit faster now.
+- Fixes incorrect regex that matches literal regexes.
+
+### v0.0.1
+- First public release
+
+# TODO
+- Support for case sensitive properties in SVG elements.
diff --git a/node_modules/@riotjs/parser/LICENSE b/node_modules/@riotjs/parser/LICENSE
new file mode 100644
index 0000000..bdf1caa
--- /dev/null
+++ b/node_modules/@riotjs/parser/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 Riot
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/@riotjs/parser/README.md b/node_modules/@riotjs/parser/README.md
new file mode 100644
index 0000000..f8349f5
--- /dev/null
+++ b/node_modules/@riotjs/parser/README.md
@@ -0,0 +1,140 @@
+# parser
+
+[![Build Status][travis-image]][travis-url]
+[![Code Quality][codeclimate-image]][codeclimate-url]
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+[![Coverage Status][coverage-image]][coverage-url]
+
+Minimal, loose html parser for Riot tags
+
+### Install
+
+```bash
+npm i @riotjs/parser --save
+```
+
+The package has two modules:
+
+```js
+// Use as: parser(options).parse(code, startPosition)
+const parser = require('@riotjs/parser').default
+
+// The enum NodeTypes (a plain JS object) that contains the values of the
+// type property of the nodes emited by tagParser (and more).
+const nodeTypes = require('@riotjs/parser').nodeTypes
+```
+
+ES6 modules export:
+
+```js
+import parser, { nodeTypes } from '@riotjs/parser'
+```
+
+This parser is a low-level tool that builds a simple array of objects with information about the given html fragment, readed secuencially. It is designed to parse one single tag and not entire html pages, the tag closing the root element ends the parsing.
+
+There are 3 main node types:
+
+* Tags - HTMLElements, including SCRIPT and STYLE elements.
+* Comments - Ignored by default.
+* Text - Text nodes.
+
+Opening tags can contain attributes. Text and attribute values can contain expressions.
+
+There's no support for untagged JavaScript block.
+
+The value returned by the parser is an object like this:
+
+```js
+{
+  data,         // String of the given html fragment with no changes.
+  output        // Array of objects with information about the parsed tags.
+}
+```
+
+The first element of `output` is the opening tag of the root element.
+
+The parsing stops when the closing tag of the root is found, so the last node have the ending position.
+
+
+### Commands
+
+* Build: `npm run build`
+* Test: `npm t`
+* Samples: `npm run samples`
+
+## Tag names
+
+Both, html and Riot tag names must start with a 7 bit letter (`[a-zA-Z]`) followed by zero o more ISO-8859-1 characters, except those in `[\x00-\x2F\x7F-\xA0>/]`.
+
+If the first letter is not found, it becomes simple text.
+Any non-recognized character ends the tag name (`'/'` behaves like whitespace).
+
+All the tag names are converted to lower case.
+
+## Openning Tags
+
+Start with a `'<'` followed by a [tag name](#tag-names) or the character `'!'` that signals the start of a [comment](#comments), `DOCTYPE` or `CDATA` declaration (last two are parsed as comments).
+
+Against the html5 specs, tags ending with `'/>'` are preserved as self-closing tags (the builder must handle this).
+
+## Closing tags
+
+They are included in the output, except for void or self-closing tags, and its name include the first slash.
+
+## Attributes
+
+Accepts all characters as the tag names and more.
+
+An equal sign (`'='`) separates the name of the value. If there's no name, this `'='` is the first character of the name (yes). The value can be empty.
+
+One or more slashes (`'/'`) behaves like whitespace. In the name, the slash splits the name generating two attributes, even if the name was quoted.
+
+The first `>` anywhere in the openning tag ends the attribute list, except if this is in a quoted value.
+
+All attribute names are converted to lowercase and the unquoted values are trimmed.
+
+## Comments
+
+Must start with `'<!--'`. The next following `'-->'` or the end of file ends the comment.
+
+Comments in short notation, starting with `'<!'` (without `'--'`), ends at the first `'>'`.
+
+By default, comments are discarted.
+
+## Expressions
+
+Expressions may be contained in attribute values or text nodes.
+The default delimiters are `'{'` and `'}'`.
+
+There may be more tan one expression as part of one attribute value or text node, or only one replacing the entire value or node.
+
+When used as the whole attribute value, there's no need to enclose the expression inside quotes, even if the expression contains whitespace.
+
+Single and double quotes can be nested inside the expression.
+
+To emit opening (left) brackets as literal text wherever an opening bracket is expected, the bracket must be prefixed with a backslash (the JS escape char `'\'`).
+This character is preserved in the output, but the parser will add a `replace` property for the attribute or node containing the escaped bracket, whose value is the bracket itself.
+
+## Options
+
+* `comments` - Pass `true` to preserve the comments.
+* `brackets` - Array of two string with the left/right brackets used to extract expressions.
+
+[travis-image]:https://img.shields.io/travis/riot/parser.svg?style=flat-square
+[travis-url]:https://travis-ci.org/riot/parser
+
+[license-image]:http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+[license-url]:LICENSE.txt
+
+[npm-version-image]:http://img.shields.io/npm/v/@riotjs/parser.svg?style=flat-square
+[npm-downloads-image]:http://img.shields.io/npm/dm/@riotjs/parser.svg?style=flat-square
+[npm-url]:https://npmjs.org/package/@riotjs/parser
+
+[coverage-image]:https://img.shields.io/coveralls/riot/parser/master.svg?style=flat-square
+[coverage-url]:https://coveralls.io/r/riot/parser/?branch=master
+
+[codeclimate-image]:https://api.codeclimate.com/v1/badges/5db4f1c96a43e3736cf0/maintainability
+[codeclimate-url]:https://codeclimate.com/github/riot/parser
+
diff --git a/node_modules/@riotjs/parser/index.js b/node_modules/@riotjs/parser/index.js
new file mode 100644
index 0000000..32845c0
--- /dev/null
+++ b/node_modules/@riotjs/parser/index.js
@@ -0,0 +1,1715 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+/**
+ * Not all the types are handled in this module.
+ *
+ * @enum {number}
+ * @readonly
+ */
+const TAG = 1; /* TAG */
+const ATTR = 2; /* ATTR */
+const TEXT = 3; /* TEXT */
+const CDATA = 4; /* CDATA */
+const COMMENT = 8; /* COMMENT */
+const DOCUMENT = 9; /* DOCUMENT */
+const DOCTYPE = 10; /* DOCTYPE */
+const DOCUMENT_FRAGMENT = 11; /* DOCUMENT_FRAGMENT */
+
+var types = /*#__PURE__*/Object.freeze({
+  TAG: TAG,
+  ATTR: ATTR,
+  TEXT: TEXT,
+  CDATA: CDATA,
+  COMMENT: COMMENT,
+  DOCUMENT: DOCUMENT,
+  DOCTYPE: DOCTYPE,
+  DOCUMENT_FRAGMENT: DOCUMENT_FRAGMENT
+});
+
+const rootTagNotFound = 'Root tag not found.';
+const unclosedTemplateLiteral = 'Unclosed ES6 template literal.';
+const unexpectedEndOfFile = 'Unexpected end of file.';
+const unclosedComment = 'Unclosed comment.';
+const unclosedNamedBlock = 'Unclosed "%1" block.';
+const duplicatedNamedTag = 'Duplicate tag "<%1>".';
+const unexpectedCharInExpression = 'Unexpected character %1.';
+const unclosedExpression = 'Unclosed expression.';
+
+/**
+ * Matches the start of valid tags names; used with the first 2 chars after the `'<'`.
+ * @const
+ * @private
+ */
+const TAG_2C = /^(?:\/[a-zA-Z]|[a-zA-Z][^\s>/]?)/;
+/**
+ * Matches valid tags names AFTER the validation with `TAG_2C`.
+ * $1: tag name including any `'/'`, $2: non self-closing brace (`>`) w/o attributes.
+ * @const
+ * @private
+ */
+const TAG_NAME = /(\/?[^\s>/]+)\s*(>)?/g;
+/**
+ * Matches an attribute name-value pair (both can be empty).
+ * $1: attribute name, $2: value including any quotes.
+ * @const
+ * @private
+ */
+const ATTR_START = /(\S[^>/=\s]*)(?:\s*=\s*([^>/])?)?/g;
+
+/**
+ * Matches the spread operator
+ * it will be used for the spread attributes
+ * @type {RegExp}
+ */
+const SPREAD_OPERATOR = /\.\.\./;
+/**
+ * Matches the closing tag of a `script` and `style` block.
+ * Used by parseText fo find the end of the block.
+ * @const
+ * @private
+ */
+const RE_SCRYLE = {
+  script: /<\/script\s*>/gi,
+  style: /<\/style\s*>/gi,
+  textarea: /<\/textarea\s*>/gi
+};
+
+// Do not touch text content inside this tags
+const RAW_TAGS = /^\/?(?:pre|textarea)$/;
+
+const JAVASCRIPT_OUTPUT_NAME = 'javascript';
+const CSS_OUTPUT_NAME = 'css';
+const TEMPLATE_OUTPUT_NAME = 'template';
+
+// Tag names
+const JAVASCRIPT_TAG = 'script';
+const STYLE_TAG = 'style';
+const TEXTAREA_TAG = 'textarea';
+
+// Boolean attributes
+const IS_RAW = 'isRaw';
+const IS_SELF_CLOSING = 'isSelfClosing';
+const IS_VOID = 'isVoid';
+const IS_BOOLEAN = 'isBoolean';
+const IS_CUSTOM = 'isCustom';
+const IS_SPREAD = 'isSpread';
+
+/**
+ * Add an item into a collection, if the collection is not an array
+ * we create one and add the item to it
+ * @param   {Array} collection - target collection
+ * @param   {*} item - item to add to the collection
+ * @returns {Array} array containing the new item added to it
+ */
+function addToCollection(collection = [], item) {
+  collection.push(item);
+  return collection
+}
+
+/**
+ * Run RegExp.exec starting from a specific position
+ * @param   {RegExp} re - regex
+ * @param   {number} pos - last index position
+ * @param   {string} string - regex target
+ * @returns {Array} regex result
+ */
+function execFromPos(re, pos, string) {
+  re.lastIndex = pos;
+  return re.exec(string)
+}
+
+/**
+ * Escape special characters in a given string, in preparation to create a regex.
+ *
+ * @param   {string} str - Raw string
+ * @returns {string} Escaped string.
+ */
+var escapeStr = (str) => str.replace(/(?=[-[\](){^*+?.$|\\])/g, '\\');
+
+function formatError(data, message, pos) {
+  if (!pos) {
+    pos = data.length;
+  }
+  // count unix/mac/win eols
+  const line = (data.slice(0, pos).match(/\r\n?|\n/g) || '').length + 1;
+  let col = 0;
+  while (--pos >= 0 && !/[\r\n]/.test(data[pos])) {
+    ++col;
+  }
+  return `[${line},${col}]: ${message}`
+}
+
+const $_ES6_BQ = '`';
+
+/**
+ * Searches the next backquote that signals the end of the ES6 Template Literal
+ * or the "${" sequence that starts a JS expression, skipping any escaped
+ * character.
+ *
+ * @param   {string}    code  - Whole code
+ * @param   {number}    pos   - The start position of the template
+ * @param   {string[]}  stack - To save nested ES6 TL count
+ * @returns {number}    The end of the string (-1 if not found)
+ */
+function skipES6TL(code, pos, stack) {
+  // we are in the char following the backquote (`),
+  // find the next unescaped backquote or the sequence "${"
+  const re = /[`$\\]/g;
+  let c;
+  while (re.lastIndex = pos, re.exec(code)) {
+    pos = re.lastIndex;
+    c = code[pos - 1];
+    if (c === '`') {
+      return pos
+    }
+    if (c === '$' && code[pos++] === '{') {
+      stack.push($_ES6_BQ, '}');
+      return pos
+    }
+    // else this is an escaped char
+  }
+  throw formatError(code, unclosedTemplateLiteral, pos)
+}
+
+/**
+ * Custom error handler can be implemented replacing this method.
+ * The `state` object includes the buffer (`data`)
+ * The error position (`loc`) contains line (base 1) and col (base 0).
+ * @param {string} data - string containing the error
+ * @param {string} msg - Error message
+ * @param {number} pos - Position of the error
+ * @returns {undefined} throw an exception error
+ */
+function panic(data, msg, pos) {
+  const message = formatError(data, msg, pos);
+  throw new Error(message)
+}
+
+// forked from https://github.com/aMarCruz/skip-regex
+
+// safe characters to precced a regex (including `=>`, `**`, and `...`)
+const beforeReChars = '[{(,;:?=|&!^~>%*/';
+const beforeReSign = `${beforeReChars}+-`;
+
+// keyword that can preceed a regex (`in` is handled as special case)
+const beforeReWords = [
+  'case',
+  'default',
+  'do',
+  'else',
+  'in',
+  'instanceof',
+  'prefix',
+  'return',
+  'typeof',
+  'void',
+  'yield'
+];
+
+// Last chars of all the beforeReWords elements to speed up the process.
+const wordsEndChar = beforeReWords.reduce((s, w) => s + w.slice(-1), '');
+
+// Matches literal regex from the start of the buffer.
+// The buffer to search must not include line-endings.
+const RE_LIT_REGEX = /^\/(?=[^*>/])[^[/\\]*(?:(?:\\.|\[(?:\\.|[^\]\\]*)*\])[^[\\/]*)*?\/[gimuy]*/;
+
+// Valid characters for JavaScript variable names and literal numbers.
+const RE_JS_VCHAR = /[$\w]/;
+
+// Match dot characters that could be part of tricky regex
+const RE_DOT_CHAR = /.*/g;
+
+/**
+ * Searches the position of the previous non-blank character inside `code`,
+ * starting with `pos - 1`.
+ *
+ * @param   {string} code - Buffer to search
+ * @param   {number} pos  - Starting position
+ * @returns {number} Position of the first non-blank character to the left.
+ * @private
+ */
+function _prev(code, pos) {
+  while (--pos >= 0 && /\s/.test(code[pos]));
+  return pos
+}
+
+
+
+/**
+ * Check if the character in the `start` position within `code` can be a regex
+ * and returns the position following this regex or `start+1` if this is not
+ * one.
+ *
+ * NOTE: Ensure `start` points to a slash (this is not checked).
+ *
+ * @function skipRegex
+ * @param   {string} code  - Buffer to test in
+ * @param   {number} start - Position the first slash inside `code`
+ * @returns {number} Position of the char following the regex.
+ *
+ */
+/* istanbul ignore next */
+function skipRegex(code, start) {
+  let pos = RE_DOT_CHAR.lastIndex = start++;
+
+  // `exec()` will extract from the slash to the end of the line
+  //   and the chained `match()` will match the possible regex.
+  const match = (RE_DOT_CHAR.exec(code) || ' ')[0].match(RE_LIT_REGEX);
+
+  if (match) {
+    const next = pos + match[0].length;      // result comes from `re.match`
+
+    pos = _prev(code, pos);
+    let c = code[pos];
+
+    // start of buffer or safe prefix?
+    if (pos < 0 || beforeReChars.includes(c)) {
+      return next
+    }
+
+    // from here, `pos` is >= 0 and `c` is code[pos]
+    if (c === '.') {
+      // can be `...` or something silly like 5./2
+      if (code[pos - 1] === '.') {
+        start = next;
+      }
+
+    } else {
+
+      if (c === '+' || c === '-') {
+        // tricky case
+        if (code[--pos] !== c ||            // if have a single operator or
+             (pos = _prev(code, pos)) < 0 ||  // ...have `++` and no previous token
+             beforeReSign.includes(c = code[pos])) {
+          return next                       // ...this is a regex
+        }
+      }
+
+      if (wordsEndChar.includes(c)) {  // looks like a keyword?
+        const end = pos + 1;
+
+        // get the complete (previous) keyword
+        while (--pos >= 0 && RE_JS_VCHAR.test(code[pos]));
+
+        // it is in the allowed keywords list?
+        if (beforeReWords.includes(code.slice(pos + 1, end))) {
+          start = next;
+        }
+      }
+    }
+  }
+
+  return start
+}
+
+/*
+ * Mini-parser for expressions.
+ * The main pourpose of this module is to find the end of an expression
+ * and return its text without the enclosing brackets.
+ * Does not works with comments, but supports ES6 template strings.
+ */
+/**
+ * @exports exprExtr
+ */
+const S_SQ_STR = /'[^'\n\r\\]*(?:\\(?:\r\n?|[\S\s])[^'\n\r\\]*)*'/.source;
+/**
+ * Matches double quoted JS strings taking care about nested quotes
+ * and EOLs (escaped EOLs are Ok).
+ *
+ * @const
+ * @private
+ */
+const S_STRING = `${S_SQ_STR}|${S_SQ_STR.replace(/'/g, '"')}`;
+/**
+ * Regex cache
+ *
+ * @type {Object.<string, RegExp>}
+ * @const
+ * @private
+ */
+const reBr = {};
+/**
+ * Makes an optimal regex that matches quoted strings, brackets, backquotes
+ * and the closing brackets of an expression.
+ *
+ * @param   {string} b - Closing brackets
+ * @returns {RegExp} - optimized regex
+ */
+function _regex(b) {
+  let re = reBr[b];
+  if (!re) {
+    let s = escapeStr(b);
+    if (b.length > 1) {
+      s = `${s}|[`;
+    } else {
+      s = /[{}[\]()]/.test(b) ? '[' : `[${s}`;
+    }
+    reBr[b] = re = new RegExp(`${S_STRING}|${s}\`/\\{}[\\]()]`, 'g');
+  }
+  return re
+}
+
+/**
+ * Update the scopes stack removing or adding closures to it
+ * @param   {Array} stack - array stacking the expression closures
+ * @param   {string} char - current char to add or remove from the stack
+ * @param   {string} idx  - matching index
+ * @param   {string} code - expression code
+ * @returns {Object} result
+ * @returns {Object} result.char - either the char received or the closing braces
+ * @returns {Object} result.index - either a new index to skip part of the source code,
+ *                                  or 0 to keep from parsing from the old position
+ */
+function updateStack(stack, char, idx, code) {
+  let index = 0;
+
+  switch (char) {
+  case '[':
+  case '(':
+  case '{':
+    stack.push(char === '[' ? ']' : char === '(' ? ')' : '}');
+    break
+  case ')':
+  case ']':
+  case '}':
+    if (char !== stack.pop()) {
+      panic(code, unexpectedCharInExpression.replace('%1', char), index);
+    }
+
+    if (char === '}' && stack[stack.length - 1] === $_ES6_BQ) {
+      char = stack.pop();
+    }
+
+    index = idx + 1;
+    break
+  case '/':
+    index = skipRegex(code, idx);
+  }
+
+  return { char, index }
+}
+
+/**
+   * Parses the code string searching the end of the expression.
+   * It skips braces, quoted strings, regexes, and ES6 template literals.
+   *
+   * @function exprExtr
+   * @param   {string}  code  - Buffer to parse
+   * @param   {number}  start - Position of the opening brace
+   * @param   {[string,string]} bp - Brackets pair
+   * @returns {Object} Expression's end (after the closing brace) or -1
+   *                            if it is not an expr.
+   */
+function exprExtr(code, start, bp) {
+  const [openingBraces, closingBraces] = bp;
+  const offset = start + openingBraces.length; // skips the opening brace
+  const stack = []; // expected closing braces ('`' for ES6 TL)
+  const re = _regex(closingBraces);
+
+  re.lastIndex = offset; // begining of the expression
+
+  let end;
+  let match;
+
+  while (match = re.exec(code)) { // eslint-disable-line
+    const idx = match.index;
+    const str = match[0];
+    end = re.lastIndex;
+
+    // end the iteration
+    if (str === closingBraces && !stack.length) {
+      return {
+        text: code.slice(offset, idx),
+        start,
+        end
+      }
+    }
+
+    const { char, index } = updateStack(stack, str[0], idx, code);
+    // update the end value depending on the new index received
+    end = index || end;
+    // update the regex last index
+    re.lastIndex = char === $_ES6_BQ ? skipES6TL(code, end, stack) : end;
+  }
+
+  if (stack.length) {
+    panic(code, unclosedExpression, end);
+  }
+}
+
+/**
+ * Outputs the last parsed node. Can be used with a builder too.
+ *
+ * @param   {ParserStore} store - Parsing store
+ * @returns {undefined} void function
+ * @private
+ */
+function flush(store) {
+  const last = store.last;
+  store.last = null;
+  if (last && store.root) {
+    store.builder.push(last);
+  }
+}
+
+/**
+ * Get the code chunks from start and end range
+ * @param   {string}  source  - source code
+ * @param   {number}  start   - Start position of the chunk we want to extract
+ * @param   {number}  end     - Ending position of the chunk we need
+ * @returns {string}  chunk of code extracted from the source code received
+ * @private
+ */
+function getChunk(source, start, end) {
+  return source.slice(start, end)
+}
+
+/**
+ * states text in the last text node, or creates a new one if needed.
+ *
+ * @param {ParserState}   state   - Current parser state
+ * @param {number}  start   - Start position of the tag
+ * @param {number}  end     - Ending position (last char of the tag)
+ * @param {Object}  extra   - extra properties to add to the text node
+ * @param {RawExpr[]} extra.expressions  - Found expressions
+ * @param {string}    extra.unescape     - Brackets to unescape
+ * @returns {undefined} - void function
+ * @private
+ */
+function pushText(state, start, end, extra = {}) {
+  const text = getChunk(state.data, start, end);
+  const expressions = extra.expressions;
+  const unescape = extra.unescape;
+
+  let q = state.last;
+  state.pos = end;
+
+  if (q && q.type === TEXT) {
+    q.text += text;
+    q.end = end;
+  } else {
+    flush(state);
+    state.last = q = { type: TEXT, text, start, end };
+  }
+
+  if (expressions && expressions.length) {
+    q.expressions = (q.expressions || []).concat(expressions);
+  }
+
+  if (unescape) {
+    q.unescape = unescape;
+  }
+
+  return TEXT
+}
+
+/**
+ * Find the end of the attribute value or text node
+ * Extract expressions.
+ * Detect if value have escaped brackets.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {HasExpr} node       - Node if attr, info if text
+ * @param   {string} endingChars - Ends the value or text
+ * @param   {number} start       - Starting position
+ * @returns {number} Ending position
+ * @private
+ */
+function expr(state, node, endingChars, start) {
+  const re = b0re(state, endingChars);
+
+  re.lastIndex = start; // reset re position
+
+  const { unescape, expressions, end } = parseExpressions(state, re);
+
+  if (node) {
+    if (unescape) {
+      node.unescape = unescape;
+    }
+    if (expressions.length) {
+      node.expressions = expressions;
+    }
+  } else {
+    pushText(state, start, end, {expressions, unescape});
+  }
+
+  return end
+}
+
+/**
+ * Parse a text chunk finding all the expressions in it
+ * @param   {ParserState} state  - Parser state
+ * @param   {RegExp} re - regex to match the expressions contents
+ * @returns {Object} result containing the expression found, the string to unescape and the end position
+ */
+function parseExpressions(state, re) {
+  const { data, options } = state;
+  const { brackets } = options;
+  const expressions = [];
+  let unescape, pos, match;
+
+  // Anything captured in $1 (closing quote or character) ends the loop...
+  while ((match = re.exec(data)) && !match[1]) {
+    // ...else, we have an opening bracket and maybe an expression.
+    pos = match.index;
+    if (data[pos - 1] === '\\') {
+      unescape = match[0]; // it is an escaped opening brace
+    } else {
+      const tmpExpr = exprExtr(data, pos, brackets);
+      if (tmpExpr) {
+        expressions.push(tmpExpr);
+        re.lastIndex = tmpExpr.end;
+      }
+    }
+  }
+
+  // Even for text, the parser needs match a closing char
+  if (!match) {
+    panic(data, unexpectedEndOfFile, pos);
+  }
+
+  return {
+    unescape,
+    expressions,
+    end: match.index
+  }
+}
+
+
+
+/**
+ * Creates a regex for the given string and the left bracket.
+ * The string is captured in $1.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {string} str - String to search
+ * @returns {RegExp} Resulting regex.
+ * @private
+ */
+function b0re(state, str) {
+  const { brackets } = state.options;
+  const re = state.regexCache[str];
+
+  if (re) return re
+
+  const b0 = escapeStr(brackets[0]);
+  // cache the regex extending the regexCache object
+  Object.assign(state.regexCache, { [str]: new RegExp(`(${str})|${b0}`, 'g') });
+
+  return state.regexCache[str]
+}
+
+/**
+ * SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+ * @const {Array}
+ */
+const VOID_SVG_TAGS_LIST = [
+  'circle',
+  'ellipse',
+  'line',
+  'path',
+  'polygon',
+  'polyline',
+  'rect',
+  'stop',
+  'use'
+];
+
+/**
+ * List of all the available svg tags
+ * @const {Array}
+ * @see {@link https://github.com/wooorm/svg-tag-names}
+ */
+const SVG_TAGS_LIST = [
+  'a',
+  'altGlyph',
+  'altGlyphDef',
+  'altGlyphItem',
+  'animate',
+  'animateColor',
+  'animateMotion',
+  'animateTransform',
+  'animation',
+  'audio',
+  'canvas',
+  'clipPath',
+  'color-profile',
+  'cursor',
+  'defs',
+  'desc',
+  'discard',
+  'feBlend',
+  'feColorMatrix',
+  'feComponentTransfer',
+  'feComposite',
+  'feConvolveMatrix',
+  'feDiffuseLighting',
+  'feDisplacementMap',
+  'feDistantLight',
+  'feDropShadow',
+  'feFlood',
+  'feFuncA',
+  'feFuncB',
+  'feFuncG',
+  'feFuncR',
+  'feGaussianBlur',
+  'feImage',
+  'feMerge',
+  'feMergeNode',
+  'feMorphology',
+  'feOffset',
+  'fePointLight',
+  'feSpecularLighting',
+  'feSpotLight',
+  'feTile',
+  'feTurbulence',
+  'filter',
+  'font',
+  'font-face',
+  'font-face-format',
+  'font-face-name',
+  'font-face-src',
+  'font-face-uri',
+  'foreignObject',
+  'g',
+  'glyph',
+  'glyphRef',
+  'handler',
+  'hatch',
+  'hatchpath',
+  'hkern',
+  'iframe',
+  'image',
+  'linearGradient',
+  'listener',
+  'marker',
+  'mask',
+  'mesh',
+  'meshgradient',
+  'meshpatch',
+  'meshrow',
+  'metadata',
+  'missing-glyph',
+  'mpath',
+  'pattern',
+  'prefetch',
+  'radialGradient',
+  'script',
+  'set',
+  'solidColor',
+  'solidcolor',
+  'style',
+  'svg',
+  'switch',
+  'symbol',
+  'tbreak',
+  'text',
+  'textArea',
+  'textPath',
+  'title',
+  'tref',
+  'tspan',
+  'unknown',
+  'video',
+  'view',
+  'vkern'
+].concat(VOID_SVG_TAGS_LIST).sort();
+
+/**
+ * HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+ * @type {Array}
+ * @see   {@link http://www.w3.org/TR/html-markup/syntax.html#syntax-elements}
+ * @see   {@link http://www.w3.org/TR/html5/syntax.html#void-elements}
+ */
+const VOID_HTML_TAGS_LIST = [
+  'area',
+  'base',
+  'br',
+  'col',
+  'embed',
+  'hr',
+  'img',
+  'input',
+  'keygen',
+  'link',
+  'menuitem',
+  'meta',
+  'param',
+  'source',
+  'track',
+  'wbr'
+];
+
+/**
+ * List of all the html tags
+ * @const {Array}
+ * @see {@link https://github.com/sindresorhus/html-tags}
+ */
+const HTML_TAGS_LIST = [
+  'a',
+  'abbr',
+  'address',
+  'article',
+  'aside',
+  'audio',
+  'b',
+  'bdi',
+  'bdo',
+  'blockquote',
+  'body',
+  'button',
+  'canvas',
+  'caption',
+  'cite',
+  'code',
+  'colgroup',
+  'data',
+  'datalist',
+  'dd',
+  'del',
+  'details',
+  'dfn',
+  'dialog',
+  'div',
+  'dl',
+  'dt',
+  'em',
+  'fieldset',
+  'figcaption',
+  'figure',
+  'footer',
+  'form',
+  'h1',
+  'h2',
+  'h3',
+  'h4',
+  'h5',
+  'h6',
+  'head',
+  'header',
+  'hgroup',
+  'html',
+  'i',
+  'iframe',
+  'ins',
+  'kbd',
+  'label',
+  'legend',
+  'li',
+  'main',
+  'map',
+  'mark',
+  'math',
+  'menu',
+  'meter',
+  'nav',
+  'noscript',
+  'object',
+  'ol',
+  'optgroup',
+  'option',
+  'output',
+  'p',
+  'picture',
+  'pre',
+  'progress',
+  'q',
+  'rb',
+  'rp',
+  'rt',
+  'rtc',
+  'ruby',
+  's',
+  'samp',
+  'script',
+  'section',
+  'select',
+  'slot',
+  'small',
+  'span',
+  'strong',
+  'style',
+  'sub',
+  'summary',
+  'sup',
+  'svg',
+  'table',
+  'tbody',
+  'td',
+  'template',
+  'textarea',
+  'tfoot',
+  'th',
+  'thead',
+  'time',
+  'title',
+  'tr',
+  'u',
+  'ul',
+  'var',
+  'video'
+].concat(VOID_HTML_TAGS_LIST).sort();
+
+/**
+ * Matches boolean HTML attributes in the riot tag definition.
+ * With a long list like this, a regex is faster than `[].indexOf` in most browsers.
+ * @const {RegExp}
+ * @see [attributes.md](https://github.com/riot/compiler/blob/dev/doc/attributes.md)
+ */
+const BOOLEAN_ATTRIBUTES_LIST = [
+  'disabled',
+  'visible',
+  'checked',
+  'readonly',
+  'required',
+  'allowfullscreen',
+  'autofocus',
+  'autoplay',
+  'compact',
+  'controls',
+  'default',
+  'formnovalidate',
+  'hidden',
+  'ismap',
+  'itemscope',
+  'loop',
+  'multiple',
+  'muted',
+  'noresize',
+  'noshade',
+  'novalidate',
+  'nowrap',
+  'open',
+  'reversed',
+  'seamless',
+  'selected',
+  'sortable',
+  'truespeed',
+  'typemustmatch'
+];
+
+/**
+ * Join a list of items with the pipe symbol (usefull for regex list concatenation)
+ * @private
+ * @param   {Array} list - list of strings
+ * @returns {String} the list received joined with pipes
+ */
+function joinWithPipe(list) {
+  return list.join('|')
+}
+
+/**
+ * Convert list of strings to regex in order to test against it ignoring the cases
+ * @private
+ * @param   {...Array} lists - array of strings
+ * @returns {RegExp} regex that will match all the strings in the array received ignoring the cases
+ */
+function listsToRegex(...lists) {
+  return new RegExp(`^/?(?:${joinWithPipe(lists.map(joinWithPipe))})$`, 'i')
+}
+
+/**
+ * Regex matching all the html tags ignoring the cases
+ * @const {RegExp}
+ */
+const HTML_TAGS_RE = listsToRegex(HTML_TAGS_LIST);
+
+/**
+ * Regex matching all the svg tags ignoring the cases
+ * @const {RegExp}
+ */
+const SVG_TAGS_RE = listsToRegex(SVG_TAGS_LIST);
+
+/**
+ * Regex matching all the void html tags ignoring the cases
+ * @const {RegExp}
+ */
+const VOID_HTML_TAGS_RE =  listsToRegex(VOID_HTML_TAGS_LIST);
+
+/**
+ * Regex matching all the void svg tags ignoring the cases
+ * @const {RegExp}
+ */
+const VOID_SVG_TAGS_RE =  listsToRegex(VOID_SVG_TAGS_LIST);
+
+/**
+ * Regex matching all the boolean attributes
+ * @const {RegExp}
+ */
+const BOOLEAN_ATTRIBUTES_RE =  listsToRegex(BOOLEAN_ATTRIBUTES_LIST);
+
+/**
+ * True if it's a self closing tag
+ * @param   {String}  tag - test tag
+ * @returns {Boolean}
+ * @example
+ * isVoid('meta') // true
+ * isVoid('circle') // true
+ * isVoid('IMG') // true
+ * isVoid('div') // false
+ * isVoid('mask') // false
+ */
+function isVoid(tag) {
+  return [
+    VOID_HTML_TAGS_RE,
+    VOID_SVG_TAGS_RE
+  ].some(r => r.test(tag))
+}
+
+/**
+ * True if it's not SVG nor a HTML known tag
+ * @param   {String}  tag - test tag
+ * @returns {Boolean}
+ * @example
+ * isCustom('my-component') // true
+ * isCustom('div') // false
+ */
+function isCustom(tag) {
+  return [
+    HTML_TAGS_RE,
+    SVG_TAGS_RE
+  ].every(l => !l.test(tag))
+}
+
+/**
+ * True if it's a boolean attribute
+ * @param   {String} attribute - test attribute
+ * @returns {Boolean}
+ * @example
+ * isBoolAttribute('selected') // true
+ * isBoolAttribute('class') // false
+ */
+function isBoolAttribute(attribute) {
+  return BOOLEAN_ATTRIBUTES_RE.test(attribute)
+}
+
+/**
+ * Memoization function
+ * @param   {Function} fn - function to memoize
+ * @returns {*} return of the function to memoize
+ */
+function memoize(fn) {
+  const cache = new WeakMap();
+
+  return (...args) => {
+    if (cache.has(args[0])) return cache.get(args[0])
+
+    const ret = fn(...args);
+
+    cache.set(args[0], ret);
+
+    return ret
+  }
+}
+
+const expressionsContentRe = memoize(brackets => RegExp(`(${brackets[0]}[^${brackets[1]}]*?${brackets[1]})`, 'g'));
+const isSpreadAttribute = name => SPREAD_OPERATOR.test(name);
+const isAttributeExpression = (name, brackets) => name[0] === brackets[0];
+const getAttributeEnd = (state, attr) => expr(state, attr, '[>/\\s]', attr.start);
+
+/**
+ * The more complex parsing is for attributes as it can contain quoted or
+ * unquoted values or expressions.
+ *
+ * @param   {ParserStore} state  - Parser state
+ * @returns {number} New parser mode.
+ * @private
+ */
+function attr(state) {
+  const { data, last, pos, root } = state;
+  const tag = last; // the last (current) tag in the output
+  const _CH = /\S/g; // matches the first non-space char
+  const ch = execFromPos(_CH, pos, data);
+
+  switch (true) {
+  case !ch:
+    state.pos = data.length; // reaching the end of the buffer with
+    // NodeTypes.ATTR will generate error
+    break
+  case ch[0] === '>':
+    // closing char found. If this is a self-closing tag with the name of the
+    // Root tag, we need decrement the counter as we are changing mode.
+    state.pos = tag.end = _CH.lastIndex;
+    if (tag[IS_SELF_CLOSING]) {
+      state.scryle = null; // allow selfClosing script/style tags
+      if (root && root.name === tag.name) {
+        state.count--; // "pop" root tag
+      }
+    }
+    return TEXT
+  case ch[0] === '/':
+    state.pos = _CH.lastIndex; // maybe. delegate the validation
+    tag[IS_SELF_CLOSING] = true; // the next loop
+    break
+  default:
+    delete tag[IS_SELF_CLOSING]; // ensure unmark as selfclosing tag
+    setAttribute(state, ch.index, tag);
+  }
+
+  return ATTR
+}
+
+/**
+ * Parses an attribute and its expressions.
+ *
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {number} pos    - Starting position of the attribute
+ * @param   {Object} tag    - Current parent tag
+ * @returns {undefined} void function
+ * @private
+ */
+function setAttribute(state, pos, tag) {
+  const { data } = state;
+  const expressionContent = expressionsContentRe(state.options.brackets);
+  const re = ATTR_START; // (\S[^>/=\s]*)(?:\s*=\s*([^>/])?)? g
+  const start = re.lastIndex = expressionContent.lastIndex = pos; // first non-whitespace
+  const attrMatches = re.exec(data);
+  const isExpressionName = isAttributeExpression(attrMatches[1], state.options.brackets);
+  const match = isExpressionName ? [null, expressionContent.exec(data)[1], null] : attrMatches;
+
+  if (match) {
+    const end = re.lastIndex;
+    const attr = parseAttribute(state, match, start, end, isExpressionName);
+
+    //assert(q && q.type === Mode.TAG, 'no previous tag for the attr!')
+    // Pushes the attribute and shifts the `end` position of the tag (`last`).
+    state.pos = tag.end = attr.end;
+    tag.attributes = addToCollection(tag.attributes, attr);
+  }
+}
+
+function parseNomalAttribute(state, attr, quote) {
+  const { data } = state;
+  let { end } = attr;
+
+  if (isBoolAttribute(attr.name)) {
+    attr[IS_BOOLEAN] = true;
+  }
+
+  // parse the whole value (if any) and get any expressions on it
+  if (quote) {
+    // Usually, the value's first char (`quote`) is a quote and the lastIndex
+    // (`end`) is the start of the value.
+    let valueStart = end;
+    // If it not, this is an unquoted value and we need adjust the start.
+    if (quote !== '"' && quote !== '\'') {
+      quote = ''; // first char of value is not a quote
+      valueStart--; // adjust the starting position
+    }
+
+    end = expr(state, attr, quote || '[>/\\s]', valueStart);
+
+    // adjust the bounds of the value and save its content
+    return Object.assign(attr, {
+      value: getChunk(data, valueStart, end),
+      valueStart,
+      end: quote ? ++end : end
+    })
+  }
+
+  return attr
+}
+
+
+/**
+ * Parse expression names <a {href}>
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Object} attr - attribute object parsed
+ * @returns {Object} normalized attribute object
+ */
+function parseSpreadAttribute(state, attr) {
+  const end = getAttributeEnd(state, attr);
+
+  return {
+    [IS_SPREAD]: true,
+    start: attr.start,
+    expressions: attr.expressions.map(expr => Object.assign(expr, {
+      text: expr.text.replace(SPREAD_OPERATOR, '').trim()
+    })),
+    end: end
+  }
+}
+
+/**
+ * Parse expression names <a {href}>
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Object} attr - attribute object parsed
+ * @returns {Object} normalized attribute object
+ */
+function parseExpressionNameAttribute(state, attr) {
+  const end = getAttributeEnd(state, attr);
+
+  return {
+    start: attr.start,
+    name: attr.expressions[0].text.trim(),
+    expressions: attr.expressions,
+    end: end
+  }
+}
+
+/**
+ * Parse the attribute values normalising the quotes
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Array} match - results of the attributes regex
+ * @param   {number} start - attribute start position
+ * @param   {number} end - attribute end position
+ * @param   {boolean} isExpressionName - true if the attribute name is an expression
+ * @returns {Object} attribute object
+ */
+function parseAttribute(state, match, start, end, isExpressionName) {
+  const attr = {
+    name: match[1],
+    value: '',
+    start,
+    end
+  };
+
+  const quote = match[2]; // first letter of value or nothing
+
+  switch (true) {
+  case isSpreadAttribute(attr.name):
+    return parseSpreadAttribute(state, attr)
+  case isExpressionName === true:
+    return parseExpressionNameAttribute(state, attr)
+  default:
+    return parseNomalAttribute(state, attr, quote)
+  }
+}
+
+/**
+ * Function to curry any javascript method
+ * @param   {Function}  fn - the target function we want to curry
+ * @param   {...[args]} acc - initial arguments
+ * @returns {Function|*} it will return a function until the target function
+ *                       will receive all of its arguments
+ */
+function curry(fn, ...acc) {
+  return (...args) => {
+    args = [...acc, ...args];
+
+    return args.length < fn.length ?
+      curry(fn, ...args) :
+      fn(...args)
+  }
+}
+
+/**
+ * Parses comments in long or short form
+ * (any DOCTYPE & CDATA blocks are parsed as comments).
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {string} data       - Buffer to parse
+ * @param   {number} start      - Position of the '<!' sequence
+ * @returns {number} node type id
+ * @private
+ */
+function comment(state, data, start) {
+  const pos = start + 2; // skip '<!'
+  const str = data.substr(pos, 2) === '--' ? '-->' : '>';
+  const end = data.indexOf(str, pos);
+  if (end < 0) {
+    panic(data, unclosedComment, start);
+  }
+  pushComment(state, start, end + str.length);
+
+  return TEXT
+}
+
+/**
+ * Parse a comment.
+ *
+ * @param   {ParserState}  state - Current parser state
+ * @param   {number}  start - Start position of the tag
+ * @param   {number}  end   - Ending position (last char of the tag)
+ * @returns {undefined} void function
+ * @private
+ */
+function pushComment(state, start, end) {
+  flush(state);
+  state.pos = end;
+  if (state.options.comments === true) {
+    state.last = { type: COMMENT, start, end };
+  }
+}
+
+/**
+ * Pushes a new *tag* and set `last` to this, so any attributes
+ * will be included on this and shifts the `end`.
+ *
+ * @param   {ParserState} state  - Current parser state
+ * @param   {string}  name      - Name of the node including any slash
+ * @param   {number}  start     - Start position of the tag
+ * @param   {number}  end       - Ending position (last char of the tag + 1)
+ * @returns {undefined} - void function
+ * @private
+ */
+function pushTag(state, name, start, end) {
+  const root = state.root;
+  const last = { type: TAG, name, start, end };
+
+  if (isCustom(name)) {
+    last[IS_CUSTOM] = true;
+  }
+
+  if (isVoid(name)) {
+    last[IS_VOID] = true;
+  }
+
+  state.pos = end;
+
+  if (root) {
+    if (name === root.name) {
+      state.count++;
+    } else if (name === root.close) {
+      state.count--;
+    }
+    flush(state);
+  } else {
+    // start with root (keep ref to output)
+    state.root = { name: last.name, close: `/${name}` };
+    state.count = 1;
+  }
+
+  state.last = last;
+}
+
+/**
+ * Parse the tag following a '<' character, or delegate to other parser
+ * if an invalid tag name is found.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @returns {number} New parser mode
+ * @private
+ */
+function tag(state) {
+  const { pos, data } = state; // pos of the char following '<'
+  const start = pos - 1; // pos of '<'
+  const str = data.substr(pos, 2); // first two chars following '<'
+
+  switch (true) {
+  case str[0] === '!':
+    return comment(state, data, start)
+  case TAG_2C.test(str):
+    return parseTag(state, start)
+  default:
+    return pushText(state, start, pos) // pushes the '<' as text
+  }
+}
+
+function parseTag(state, start) {
+  const { data, pos } = state;
+  const re = TAG_NAME; // (\/?[^\s>/]+)\s*(>)? g
+  const match = execFromPos(re, pos, data);
+  const end = re.lastIndex;
+  const name = match[1].toLowerCase(); // $1: tag name including any '/'
+  // script/style block is parsed as another tag to extract attributes
+  if (name in RE_SCRYLE) {
+    state.scryle = name; // used by parseText
+  }
+
+  pushTag(state, name, start, end);
+  // only '>' can ends the tag here, the '/' is handled in parseAttribute
+  if (!match[2]) {
+    return ATTR
+  }
+
+  return TEXT
+}
+
+/**
+ * Parses regular text and script/style blocks ...scryle for short :-)
+ * (the content of script and style is text as well)
+ *
+ * @param   {ParserState} state - Parser state
+ * @returns {number} New parser mode.
+ * @private
+ */
+function text(state) {
+  const { pos, data, scryle } = state;
+
+  switch (true) {
+  case typeof scryle === 'string': {
+    const name = scryle;
+    const re = RE_SCRYLE[name];
+    const match = execFromPos(re, pos, data);
+
+    if (!match) {
+      panic(data, unclosedNamedBlock.replace('%1', name), pos - 1);
+    }
+
+    const start = match.index;
+    const end = re.lastIndex;
+    state.scryle = null; // reset the script/style flag now
+    // write the tag content, if any
+    if (start > pos) {
+      parseSpecialTagsContent(state, name, match);
+    }
+    // now the closing tag, either </script> or </style>
+    pushTag(state, `/${name}`, start, end);
+    break
+  }
+  case data[pos] === '<':
+    state.pos++;
+    return TAG
+  default:
+    expr(state, null, '<', pos);
+  }
+
+  return TEXT
+}
+
+/**
+ * Parse the text content depending on the name
+ * @param   {ParserState} state - Parser state
+ * @param   {string} name  - one of the tags matched by the RE_SCRYLE regex
+ * @param   {Array}  match - result of the regex matching the content of the parsed tag
+ * @returns {undefined} void function
+ */
+function parseSpecialTagsContent(state, name, match) {
+  const { pos } = state;
+  const start = match.index;
+
+  if (name === TEXTAREA_TAG) {
+    expr(state, null, match[0], pos);
+  } else {
+    pushText(state, pos, start);
+  }
+}
+
+/*---------------------------------------------------------------------
+ * Tree builder for the riot tag parser.
+ *
+ * The output has a root property and separate arrays for `html`, `css`,
+ * and `js` tags.
+ *
+ * The root tag is included as first element in the `html` array.
+ * Script tags marked with "defer" are included in `html` instead `js`.
+ *
+ * - Mark SVG tags
+ * - Mark raw tags
+ * - Mark void tags
+ * - Split prefixes from expressions
+ * - Unescape escaped brackets and escape EOLs and backslashes
+ * - Compact whitespace (option `compact`) for non-raw tags
+ * - Create an array `parts` for text nodes and attributes
+ *
+ * Throws on unclosed tags or closing tags without start tag.
+ * Selfclosing and void tags has no nodes[] property.
+ */
+
+/**
+ * Escape the carriage return and the line feed from a string
+ * @param   {string} string - input string
+ * @returns {string} output string escaped
+ */
+function escapeReturn(string) {
+  return string
+    .replace(/\r/g, '\\r')
+    .replace(/\n/g, '\\n')
+}
+
+/**
+ * Escape double slashes in a string
+ * @param   {string} string - input string
+ * @returns {string} output string escaped
+ */
+function escapeSlashes(string) {
+  return string.replace(/\\/g, '\\\\')
+}
+
+/**
+ * Replace the multiple spaces with only one
+ * @param   {string} string - input string
+ * @returns {string} string without trailing spaces
+ */
+function cleanSpaces(string) {
+  return string.replace(/\s+/g, ' ')
+}
+
+const TREE_BUILDER_STRUCT = Object.seal({
+  get() {
+    const store = this.store;
+    // The real root tag is in store.root.nodes[0]
+    return {
+      [TEMPLATE_OUTPUT_NAME]: store.root.nodes[0],
+      [CSS_OUTPUT_NAME]: store[STYLE_TAG],
+      [JAVASCRIPT_OUTPUT_NAME]: store[JAVASCRIPT_TAG]
+    }
+  },
+
+  /**
+  * Process the current tag or text.
+  * @param {Object} node - Raw pseudo-node from the parser
+  * @returns {undefined} void function
+  */
+  push(node) {
+    const store = this.store;
+
+    switch (node.type) {
+    case TEXT:
+      this.pushText(store, node);
+      break
+    case TAG: {
+      const name = node.name;
+      const closingTagChar = '/';
+      const [firstChar] = name;
+
+      if (firstChar === closingTagChar && !node.isVoid) {
+        this.closeTag(store, node, name);
+      } else if (firstChar !== closingTagChar) {
+        this.openTag(store, node);
+      }
+      break
+    }
+    }
+  },
+  closeTag(store, node) {
+    const last = store.scryle || store.last;
+
+    last.end = node.end;
+
+    if (store.scryle) {
+      store.scryle = null;
+    } else {
+      store.last = store.stack.pop();
+    }
+  },
+
+  openTag(store, node) {
+    const name = node.name;
+    const attrs = node.attributes;
+
+    if ([JAVASCRIPT_TAG, STYLE_TAG].includes(name)) {
+      // Only accept one of each
+      if (store[name]) {
+        panic(this.store.data, duplicatedNamedTag.replace('%1', name), node.start);
+      }
+
+      store[name] = node;
+      store.scryle = store[name];
+
+    } else {
+      // store.last holds the last tag pushed in the stack and this are
+      // non-void, non-empty tags, so we are sure the `lastTag` here
+      // have a `nodes` property.
+      const lastTag = store.last;
+      const newNode = node;
+
+      lastTag.nodes.push(newNode);
+
+      if (lastTag[IS_RAW] || RAW_TAGS.test(name)) {
+        node[IS_RAW] = true;
+      }
+
+      if (!node[IS_SELF_CLOSING] && !node[IS_VOID]) {
+        store.stack.push(lastTag);
+        newNode.nodes = [];
+        store.last = newNode;
+      }
+    }
+
+    if (attrs) {
+      this.attrs(attrs);
+    }
+  },
+  attrs(attributes) {
+    attributes.forEach(attr => {
+      if (attr.value) {
+        this.split(attr, attr.value, attr.valueStart, true);
+      }
+    });
+  },
+  pushText(store, node) {
+    const text = node.text;
+    const empty = !/\S/.test(text);
+    const scryle = store.scryle;
+    if (!scryle) {
+      // store.last always have a nodes property
+      const parent = store.last;
+
+      const pack = this.compact && !parent[IS_RAW];
+      if (pack && empty) {
+        return
+      }
+      this.split(node, text, node.start, pack);
+      parent.nodes.push(node);
+    } else if (!empty) {
+      scryle.text = node;
+    }
+  },
+  split(node, source, start, pack) {
+    const expressions = node.expressions;
+    const parts = [];
+
+    if (expressions) {
+      let pos = 0;
+
+      expressions.forEach(expr => {
+        const text = source.slice(pos, expr.start - start);
+        const code = expr.text;
+        parts.push(this.sanitise(node, text, pack), escapeReturn(escapeSlashes(code).trim()));
+        pos = expr.end - start;
+      });
+
+      if (pos < node.end) {
+        parts.push(this.sanitise(node, source.slice(pos), pack));
+      }
+    } else {
+      parts[0] = this.sanitise(node, source, pack);
+    }
+
+    node.parts = parts.filter(p => p); // remove the empty strings
+  },
+  // unescape escaped brackets and split prefixes of expressions
+  sanitise(node, text, pack) {
+    let rep = node.unescape;
+    if (rep) {
+      let idx = 0;
+      rep = `\\${rep}`;
+      while ((idx = text.indexOf(rep, idx)) !== -1) {
+        text = text.substr(0, idx) + text.substr(idx + 1);
+        idx++;
+      }
+    }
+
+    text = escapeSlashes(text);
+
+    return pack ? cleanSpaces(text) : escapeReturn(text)
+  }
+});
+
+function createTreeBuilder(data, options) {
+  const root = {
+    type: TAG,
+    name: '',
+    start: 0,
+    end: 0,
+    nodes: []
+  };
+
+  return Object.assign(Object.create(TREE_BUILDER_STRUCT), {
+    compact: options.compact !== false,
+    store: {
+      last: root,
+      stack: [],
+      scryle: null,
+      root,
+      style: null,
+      script: null,
+      data
+    }
+  })
+}
+
+/**
+ * Factory for the Parser class, exposing only the `parse` method.
+ * The export adds the Parser class as property.
+ *
+ * @param   {Object}   options - User Options
+ * @param   {Function} customBuilder - Tree builder factory
+ * @returns {Function} Public Parser implementation.
+ */
+function parser(options, customBuilder) {
+  const state = curry(createParserState)(options, customBuilder || createTreeBuilder);
+  return {
+    parse: (data) => parse(state(data))
+  }
+}
+
+/**
+ * Create a new state object
+ * @param   {Object} userOptions - parser options
+ * @param   {Function} builder - Tree builder factory
+ * @param   {string} data - data to parse
+ * @returns {ParserState} it represents the current parser state
+ */
+function createParserState(userOptions, builder, data) {
+  const options = Object.assign({
+    brackets: ['{', '}']
+  }, userOptions);
+
+  return {
+    options,
+    regexCache: {},
+    pos: 0,
+    count: -1,
+    root: null,
+    last: null,
+    scryle: null,
+    builder: builder(data, options),
+    data
+  }
+}
+
+/**
+ * It creates a raw output of pseudo-nodes with one of three different types,
+ * all of them having a start/end position:
+ *
+ * - TAG     -- Opening or closing tags
+ * - TEXT    -- Raw text
+ * - COMMENT -- Comments
+ *
+ * @param   {ParserState}  state - Current parser state
+ * @returns {ParserResult} Result, contains data and output properties.
+ */
+function parse(state) {
+  const { data } = state;
+
+  walk(state);
+  flush(state);
+
+  if (state.count) {
+    panic(data, state.count > 0 ? unexpectedEndOfFile : rootTagNotFound, state.pos);
+  }
+
+  return {
+    data,
+    output: state.builder.get()
+  }
+}
+
+/**
+ * Parser walking recursive function
+ * @param {ParserState}  state - Current parser state
+ * @param {string} type - current parsing context
+ * @returns {undefined} void function
+ */
+function walk(state, type) {
+  const { data } = state;
+  // extend the state adding the tree builder instance and the initial data
+  const length = data.length;
+
+  // The "count" property is set to 1 when the first tag is found.
+  // This becomes the root and precedent text or comments are discarded.
+  // So, at the end of the parsing count must be zero.
+  if (state.pos < length && state.count) {
+    walk(state, eat(state, type));
+  }
+}
+
+/**
+ * Function to help iterating on the current parser state
+ * @param {ParserState}  state - Current parser state
+ * @param   {string} type - current parsing context
+ * @returns {string} parsing context
+ */
+function eat(state, type) {
+  switch (type) {
+  case TAG:
+    return tag(state)
+  case ATTR:
+    return attr(state)
+  default:
+    return text(state)
+  }
+}
+
+/**
+ * The nodeTypes definition
+ */
+const nodeTypes = types;
+
+exports.default = parser;
+exports.nodeTypes = nodeTypes;
diff --git a/node_modules/@riotjs/parser/package.json b/node_modules/@riotjs/parser/package.json
new file mode 100755
index 0000000..9abc61f
--- /dev/null
+++ b/node_modules/@riotjs/parser/package.json
@@ -0,0 +1,89 @@
+{
+  "_from": "@riotjs/parser@^4.0.3",
+  "_id": "@riotjs/parser@4.0.3",
+  "_inBundle": false,
+  "_integrity": "sha512-mP10ljXVJ2T0uD6FD9ZKRs1TZZiL6LcXRQJYUCbQ2tNePaKDfcsteuL3O+rk77zNwSgYfEPMSwk9gkcqCy7L7w==",
+  "_location": "/@riotjs/parser",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@riotjs/parser@^4.0.3",
+    "name": "@riotjs/parser",
+    "escapedName": "@riotjs%2fparser",
+    "scope": "@riotjs",
+    "rawSpec": "^4.0.3",
+    "saveSpec": null,
+    "fetchSpec": "^4.0.3"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/@riotjs/parser/-/parser-4.0.3.tgz",
+  "_shasum": "0d8bbd3067cfc3d3984c8921d9e4a257b977ac9e",
+  "_spec": "@riotjs/parser@^4.0.3",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "aMarCruz",
+    "email": "amarcruz@yahoo.com",
+    "url": "https://github.com/aMarCruz"
+  },
+  "bugs": {
+    "url": "https://github.com/riot/parser/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "curri": "^1.0.1",
+    "dom-nodes": "^1.0.0"
+  },
+  "deprecated": false,
+  "description": "The parser for Riot tags",
+  "devDependencies": {
+    "chai": "^4.2.0",
+    "coveralls": "^3.0.4",
+    "eslint": "^6.0.1",
+    "eslint-config-riot": "^2.0.0",
+    "mocha": "^6.1.4",
+    "nyc": "^14.1.1",
+    "rollup": "^1.16.3",
+    "rollup-plugin-node-resolve": "^5.2.0"
+  },
+  "engines": {
+    "node": ">=4.2",
+    "npm": ">=3.0"
+  },
+  "files": [
+    "*.js",
+    "dist",
+    "src"
+  ],
+  "homepage": "https://github.com/riot/parser",
+  "jsnext:main": "./src/index.js",
+  "keywords": [
+    "html",
+    "html5",
+    "tag",
+    "parser",
+    "javascript"
+  ],
+  "license": "MIT",
+  "main": "./index.js",
+  "module": "./src/index.js",
+  "name": "@riotjs/parser",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/riot/parser.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "cov": "nyc report --reporter=text-lcov | coveralls",
+    "cov-html": "nyc report --reporter=html",
+    "lint": "eslint src test",
+    "prepublish": "npm run build",
+    "pretest": "npm run build",
+    "samples": "node ./test/samples.js",
+    "test": "nyc mocha ./test/index",
+    "test-debug": "mocha --inspect-brk ./test"
+  },
+  "version": "4.0.3"
+}
diff --git a/node_modules/@riotjs/parser/rollup.config.js b/node_modules/@riotjs/parser/rollup.config.js
new file mode 100644
index 0000000..2097730
--- /dev/null
+++ b/node_modules/@riotjs/parser/rollup.config.js
@@ -0,0 +1,11 @@
+import resolve from 'rollup-plugin-node-resolve'
+
+export default {
+  input: 'src/index.js',
+  output: {
+    name: 'parser',
+    format: 'cjs',
+    file: './index.js'
+  },
+  plugins: [resolve()]
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/.DS_Store b/node_modules/@riotjs/parser/src/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..5008ddfcf53c02e82d7eee2e57c38e5672ef89f6
GIT binary patch
literal 6148
zcmeH~Jr2S!425mzP>H1@V-^m;4Wg<&0T*E43hX&L&p$$qDprKhvt+--jT7}7np#A3
zem<@ulZcFPQ@L2!n>{z**<q8>++&mCkOWA81W14cNZ<zv;LbK1Poaz?KmsK2CSc!(
z0ynLxE!0092;Krf2c+FF_Fe*7ECH>lEfg7;MkzE(HCqgga^y>{tEnwC%0;vJ&^%eQ
zLs35+`xjp>T0<F0fCPF1$Cyrb|F7^5{eNG?83~ZUUlGt@xh*qZDeu<Z%US-OSsOPv
j)R!Z4KLME7ReXlK;d!wEw5GODWMKRea10D2@KpjYNUI8I

literal 0
HcmV?d00001

diff --git a/node_modules/@riotjs/parser/src/constants.js b/node_modules/@riotjs/parser/src/constants.js
new file mode 100644
index 0000000..ffc8727
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/constants.js
@@ -0,0 +1,16 @@
+export const JAVASCRIPT_OUTPUT_NAME = 'javascript'
+export const CSS_OUTPUT_NAME = 'css'
+export const TEMPLATE_OUTPUT_NAME = 'template'
+
+// Tag names
+export const JAVASCRIPT_TAG = 'script'
+export const STYLE_TAG = 'style'
+export const TEXTAREA_TAG = 'textarea'
+
+// Boolean attributes
+export const IS_RAW = 'isRaw'
+export const IS_SELF_CLOSING = 'isSelfClosing'
+export const IS_VOID = 'isVoid'
+export const IS_BOOLEAN = 'isBoolean'
+export const IS_CUSTOM = 'isCustom'
+export const IS_SPREAD = 'isSpread'
diff --git a/node_modules/@riotjs/parser/src/index.js b/node_modules/@riotjs/parser/src/index.js
new file mode 100644
index 0000000..221f8d9
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/index.js
@@ -0,0 +1,12 @@
+import * as types from './node-types'
+import parser from './parser'
+
+/**
+ * The nodeTypes definition
+ */
+export const nodeTypes = types
+
+/*
+ * Factory function to create instances of the parser
+ */
+export default parser
diff --git a/node_modules/@riotjs/parser/src/messages.js b/node_modules/@riotjs/parser/src/messages.js
new file mode 100644
index 0000000..db0a3af
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/messages.js
@@ -0,0 +1,10 @@
+export const rootTagNotFound = 'Root tag not found.'
+export const unclosedTemplateLiteral = 'Unclosed ES6 template literal.'
+export const unexpectedEndOfFile = 'Unexpected end of file.'
+export const unexpectedNamedTag = 'Unexpected tag <%1>'
+export const unclosedComment = 'Unclosed comment.'
+export const unclosedNamedBlock = 'Unclosed "%1" block.'
+export const duplicatedNamedTag = 'Duplicate tag "<%1>".'
+export const expectedAndInsteadSaw = 'Expected "</%1>" and instead saw "<%2>".'
+export const unexpectedCharInExpression = 'Unexpected character %1.'
+export const unclosedExpression = 'Unclosed expression.'
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/node-types.js b/node_modules/@riotjs/parser/src/node-types.js
new file mode 100644
index 0000000..be18ab8
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/node-types.js
@@ -0,0 +1,14 @@
+/**
+ * Not all the types are handled in this module.
+ *
+ * @enum {number}
+ * @readonly
+ */
+export const TAG = 1 /* TAG */
+export const ATTR = 2 /* ATTR */
+export const TEXT = 3 /* TEXT */
+export const CDATA = 4 /* CDATA */
+export const COMMENT = 8 /* COMMENT */
+export const DOCUMENT = 9 /* DOCUMENT */
+export const DOCTYPE = 10 /* DOCTYPE */
+export const DOCUMENT_FRAGMENT = 11 /* DOCUMENT_FRAGMENT */
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/parser.js b/node_modules/@riotjs/parser/src/parser.js
new file mode 100644
index 0000000..7705b67
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parser.js
@@ -0,0 +1,112 @@
+import {ATTR, TAG} from './node-types'
+import {rootTagNotFound, unexpectedEndOfFile} from './messages'
+import attr from './parsers/attribute'
+import curry from 'curri'
+import flush from './utils/flush-parser-state'
+import panic from './utils/panic'
+import tag from './parsers/tag'
+import text from './parsers/text'
+import treeBuilder from './tree-builder'
+
+/**
+ * Factory for the Parser class, exposing only the `parse` method.
+ * The export adds the Parser class as property.
+ *
+ * @param   {Object}   options - User Options
+ * @param   {Function} customBuilder - Tree builder factory
+ * @returns {Function} Public Parser implementation.
+ */
+export default function parser(options, customBuilder) {
+  const state = curry(createParserState)(options, customBuilder || treeBuilder)
+  return {
+    parse: (data) => parse(state(data))
+  }
+}
+
+/**
+ * Create a new state object
+ * @param   {Object} userOptions - parser options
+ * @param   {Function} builder - Tree builder factory
+ * @param   {string} data - data to parse
+ * @returns {ParserState} it represents the current parser state
+ */
+function createParserState(userOptions, builder, data) {
+  const options = Object.assign({
+    brackets: ['{', '}']
+  }, userOptions)
+
+  return {
+    options,
+    regexCache: {},
+    pos: 0,
+    count: -1,
+    root: null,
+    last: null,
+    scryle: null,
+    builder: builder(data, options),
+    data
+  }
+}
+
+/**
+ * It creates a raw output of pseudo-nodes with one of three different types,
+ * all of them having a start/end position:
+ *
+ * - TAG     -- Opening or closing tags
+ * - TEXT    -- Raw text
+ * - COMMENT -- Comments
+ *
+ * @param   {ParserState}  state - Current parser state
+ * @returns {ParserResult} Result, contains data and output properties.
+ */
+function parse(state) {
+  const { data } = state
+
+  walk(state)
+  flush(state)
+
+  if (state.count) {
+    panic(data, state.count > 0 ? unexpectedEndOfFile : rootTagNotFound, state.pos)
+  }
+
+  return {
+    data,
+    output: state.builder.get()
+  }
+}
+
+/**
+ * Parser walking recursive function
+ * @param {ParserState}  state - Current parser state
+ * @param {string} type - current parsing context
+ * @returns {undefined} void function
+ */
+function walk(state, type) {
+  const { data } = state
+  // extend the state adding the tree builder instance and the initial data
+  const length = data.length
+
+  // The "count" property is set to 1 when the first tag is found.
+  // This becomes the root and precedent text or comments are discarded.
+  // So, at the end of the parsing count must be zero.
+  if (state.pos < length && state.count) {
+    walk(state, eat(state, type))
+  }
+}
+
+/**
+ * Function to help iterating on the current parser state
+ * @param {ParserState}  state - Current parser state
+ * @param   {string} type - current parsing context
+ * @returns {string} parsing context
+ */
+function eat(state, type) {
+  switch (type) {
+  case TAG:
+    return tag(state)
+  case ATTR:
+    return attr(state)
+  default:
+    return text(state)
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/parsers/attribute.js b/node_modules/@riotjs/parser/src/parsers/attribute.js
new file mode 100644
index 0000000..07592bc
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parsers/attribute.js
@@ -0,0 +1,183 @@
+import {ATTR, TEXT} from '../node-types'
+import {ATTR_START, SPREAD_OPERATOR} from '../regex'
+import {IS_BOOLEAN, IS_SELF_CLOSING, IS_SPREAD} from '../constants'
+import addToCollection from '../utils/add-to-collection'
+import execFromPos from '../utils/exec-from-pos'
+import expr from './expression'
+import getChunk from '../utils/get-chunk'
+import {isBoolAttribute} from 'dom-nodes'
+import memoize from '../utils/memoize'
+
+const expressionsContentRe = memoize(brackets => RegExp(`(${brackets[0]}[^${brackets[1]}]*?${brackets[1]})`, 'g'))
+const isSpreadAttribute = name => SPREAD_OPERATOR.test(name)
+const isAttributeExpression = (name, brackets) => name[0] === brackets[0]
+const getAttributeEnd = (state, attr) => expr(state, attr, '[>/\\s]', attr.start)
+
+/**
+ * The more complex parsing is for attributes as it can contain quoted or
+ * unquoted values or expressions.
+ *
+ * @param   {ParserStore} state  - Parser state
+ * @returns {number} New parser mode.
+ * @private
+ */
+export default function attr(state) {
+  const { data, last, pos, root } = state
+  const tag = last // the last (current) tag in the output
+  const _CH = /\S/g // matches the first non-space char
+  const ch = execFromPos(_CH, pos, data)
+
+  switch (true) {
+  case !ch:
+    state.pos = data.length // reaching the end of the buffer with
+    // NodeTypes.ATTR will generate error
+    break
+  case ch[0] === '>':
+    // closing char found. If this is a self-closing tag with the name of the
+    // Root tag, we need decrement the counter as we are changing mode.
+    state.pos = tag.end = _CH.lastIndex
+    if (tag[IS_SELF_CLOSING]) {
+      state.scryle = null // allow selfClosing script/style tags
+      if (root && root.name === tag.name) {
+        state.count-- // "pop" root tag
+      }
+    }
+    return TEXT
+  case ch[0] === '/':
+    state.pos = _CH.lastIndex // maybe. delegate the validation
+    tag[IS_SELF_CLOSING] = true // the next loop
+    break
+  default:
+    delete tag[IS_SELF_CLOSING] // ensure unmark as selfclosing tag
+    setAttribute(state, ch.index, tag)
+  }
+
+  return ATTR
+}
+
+/**
+ * Parses an attribute and its expressions.
+ *
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {number} pos    - Starting position of the attribute
+ * @param   {Object} tag    - Current parent tag
+ * @returns {undefined} void function
+ * @private
+ */
+function setAttribute(state, pos, tag) {
+  const { data } = state
+  const expressionContent = expressionsContentRe(state.options.brackets)
+  const re = ATTR_START // (\S[^>/=\s]*)(?:\s*=\s*([^>/])?)? g
+  const start = re.lastIndex = expressionContent.lastIndex = pos // first non-whitespace
+  const attrMatches = re.exec(data)
+  const isExpressionName = isAttributeExpression(attrMatches[1], state.options.brackets)
+  const match = isExpressionName ? [null, expressionContent.exec(data)[1], null] : attrMatches
+
+  if (match) {
+    const end = re.lastIndex
+    const attr = parseAttribute(state, match, start, end, isExpressionName)
+
+    //assert(q && q.type === Mode.TAG, 'no previous tag for the attr!')
+    // Pushes the attribute and shifts the `end` position of the tag (`last`).
+    state.pos = tag.end = attr.end
+    tag.attributes = addToCollection(tag.attributes, attr)
+  }
+}
+
+function parseNomalAttribute(state, attr, quote) {
+  const { data } = state
+  let { end } = attr
+
+  if (isBoolAttribute(attr.name)) {
+    attr[IS_BOOLEAN] = true
+  }
+
+  // parse the whole value (if any) and get any expressions on it
+  if (quote) {
+    // Usually, the value's first char (`quote`) is a quote and the lastIndex
+    // (`end`) is the start of the value.
+    let valueStart = end
+    // If it not, this is an unquoted value and we need adjust the start.
+    if (quote !== '"' && quote !== '\'') {
+      quote = '' // first char of value is not a quote
+      valueStart-- // adjust the starting position
+    }
+
+    end = expr(state, attr, quote || '[>/\\s]', valueStart)
+
+    // adjust the bounds of the value and save its content
+    return Object.assign(attr, {
+      value: getChunk(data, valueStart, end),
+      valueStart,
+      end: quote ? ++end : end
+    })
+  }
+
+  return attr
+}
+
+
+/**
+ * Parse expression names <a {href}>
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Object} attr - attribute object parsed
+ * @returns {Object} normalized attribute object
+ */
+function parseSpreadAttribute(state, attr) {
+  const end = getAttributeEnd(state, attr)
+
+  return {
+    [IS_SPREAD]: true,
+    start: attr.start,
+    expressions: attr.expressions.map(expr => Object.assign(expr, {
+      text: expr.text.replace(SPREAD_OPERATOR, '').trim()
+    })),
+    end: end
+  }
+}
+
+/**
+ * Parse expression names <a {href}>
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Object} attr - attribute object parsed
+ * @returns {Object} normalized attribute object
+ */
+function parseExpressionNameAttribute(state, attr) {
+  const end = getAttributeEnd(state, attr)
+
+  return {
+    start: attr.start,
+    name: attr.expressions[0].text.trim(),
+    expressions: attr.expressions,
+    end: end
+  }
+}
+
+/**
+ * Parse the attribute values normalising the quotes
+ * @param   {ParserStore}  state  - Parser state
+ * @param   {Array} match - results of the attributes regex
+ * @param   {number} start - attribute start position
+ * @param   {number} end - attribute end position
+ * @param   {boolean} isExpressionName - true if the attribute name is an expression
+ * @returns {Object} attribute object
+ */
+function parseAttribute(state, match, start, end, isExpressionName) {
+  const attr = {
+    name: match[1],
+    value: '',
+    start,
+    end
+  }
+
+  const quote = match[2] // first letter of value or nothing
+
+  switch (true) {
+  case isSpreadAttribute(attr.name):
+    return parseSpreadAttribute(state, attr)
+  case isExpressionName === true:
+    return parseExpressionNameAttribute(state, attr)
+  default:
+    return parseNomalAttribute(state, attr, quote)
+  }
+}
diff --git a/node_modules/@riotjs/parser/src/parsers/comment.js b/node_modules/@riotjs/parser/src/parsers/comment.js
new file mode 100644
index 0000000..6fae0ca
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parsers/comment.js
@@ -0,0 +1,43 @@
+import {COMMENT, TEXT} from '../node-types'
+import flush from '../utils/flush-parser-state'
+import panic from '../utils/panic'
+import {unclosedComment} from '../messages'
+
+/**
+ * Parses comments in long or short form
+ * (any DOCTYPE & CDATA blocks are parsed as comments).
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {string} data       - Buffer to parse
+ * @param   {number} start      - Position of the '<!' sequence
+ * @returns {number} node type id
+ * @private
+ */
+export default function comment(state, data, start) {
+  const pos = start + 2 // skip '<!'
+  const str = data.substr(pos, 2) === '--' ? '-->' : '>'
+  const end = data.indexOf(str, pos)
+  if (end < 0) {
+    panic(data, unclosedComment, start)
+  }
+  pushComment(state, start, end + str.length)
+
+  return TEXT
+}
+
+/**
+ * Parse a comment.
+ *
+ * @param   {ParserState}  state - Current parser state
+ * @param   {number}  start - Start position of the tag
+ * @param   {number}  end   - Ending position (last char of the tag)
+ * @returns {undefined} void function
+ * @private
+ */
+export function pushComment(state, start, end) {
+  flush(state)
+  state.pos = end
+  if (state.options.comments === true) {
+    state.last = { type: COMMENT, start, end }
+  }
+}
diff --git a/node_modules/@riotjs/parser/src/parsers/expression.js b/node_modules/@riotjs/parser/src/parsers/expression.js
new file mode 100644
index 0000000..9a4e7e9
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parsers/expression.js
@@ -0,0 +1,100 @@
+import escapeStr from '../utils/escape-str'
+import exprExtr from '../utils/expr-extr'
+import panic from '../utils/panic'
+import pushText from '../utils/push-text'
+import {unexpectedEndOfFile} from '../messages'
+/**
+ * Find the end of the attribute value or text node
+ * Extract expressions.
+ * Detect if value have escaped brackets.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {HasExpr} node       - Node if attr, info if text
+ * @param   {string} endingChars - Ends the value or text
+ * @param   {number} start       - Starting position
+ * @returns {number} Ending position
+ * @private
+ */
+export default function expr(state, node, endingChars, start) {
+  const re = b0re(state, endingChars)
+
+  re.lastIndex = start // reset re position
+
+  const { unescape, expressions, end } = parseExpressions(state, re)
+
+  if (node) {
+    if (unescape) {
+      node.unescape = unescape
+    }
+    if (expressions.length) {
+      node.expressions = expressions
+    }
+  } else {
+    pushText(state, start, end, {expressions, unescape})
+  }
+
+  return end
+}
+
+/**
+ * Parse a text chunk finding all the expressions in it
+ * @param   {ParserState} state  - Parser state
+ * @param   {RegExp} re - regex to match the expressions contents
+ * @returns {Object} result containing the expression found, the string to unescape and the end position
+ */
+function parseExpressions(state, re) {
+  const { data, options } = state
+  const { brackets } = options
+  const expressions = []
+  let unescape, pos, match
+
+  // Anything captured in $1 (closing quote or character) ends the loop...
+  while ((match = re.exec(data)) && !match[1]) {
+    // ...else, we have an opening bracket and maybe an expression.
+    pos = match.index
+    if (data[pos - 1] === '\\') {
+      unescape = match[0] // it is an escaped opening brace
+    } else {
+      const tmpExpr = exprExtr(data, pos, brackets)
+      if (tmpExpr) {
+        expressions.push(tmpExpr)
+        re.lastIndex = tmpExpr.end
+      }
+    }
+  }
+
+  // Even for text, the parser needs match a closing char
+  if (!match) {
+    panic(data, unexpectedEndOfFile, pos)
+  }
+
+  return {
+    unescape,
+    expressions,
+    end: match.index
+  }
+}
+
+
+
+/**
+ * Creates a regex for the given string and the left bracket.
+ * The string is captured in $1.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @param   {string} str - String to search
+ * @returns {RegExp} Resulting regex.
+ * @private
+ */
+function b0re(state, str) {
+  const { brackets } = state.options
+  const re = state.regexCache[str]
+
+  if (re) return re
+
+  const b0 = escapeStr(brackets[0])
+  // cache the regex extending the regexCache object
+  Object.assign(state.regexCache, { [str]: new RegExp(`(${str})|${b0}`, 'g') })
+
+  return state.regexCache[str]
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/parsers/tag.js b/node_modules/@riotjs/parser/src/parsers/tag.js
new file mode 100644
index 0000000..1097427
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parsers/tag.js
@@ -0,0 +1,49 @@
+import {ATTR, TEXT} from '../node-types'
+import {RE_SCRYLE, TAG_2C, TAG_NAME} from '../regex'
+import comment from './comment'
+import execFromPos from '../utils/exec-from-pos'
+import pushTag from '../utils/push-tag'
+import pushText from '../utils/push-text'
+
+/**
+ * Parse the tag following a '<' character, or delegate to other parser
+ * if an invalid tag name is found.
+ *
+ * @param   {ParserState} state  - Parser state
+ * @returns {number} New parser mode
+ * @private
+ */
+export default function tag(state) {
+  const { pos, data } = state // pos of the char following '<'
+  const start = pos - 1 // pos of '<'
+  const str = data.substr(pos, 2) // first two chars following '<'
+
+  switch (true) {
+  case str[0] === '!':
+    return comment(state, data, start)
+  case TAG_2C.test(str):
+    return parseTag(state, start)
+  default:
+    return pushText(state, start, pos) // pushes the '<' as text
+  }
+}
+
+function parseTag(state, start) {
+  const { data, pos } = state
+  const re = TAG_NAME // (\/?[^\s>/]+)\s*(>)? g
+  const match = execFromPos(re, pos, data)
+  const end = re.lastIndex
+  const name = match[1].toLowerCase() // $1: tag name including any '/'
+  // script/style block is parsed as another tag to extract attributes
+  if (name in RE_SCRYLE) {
+    state.scryle = name // used by parseText
+  }
+
+  pushTag(state, name, start, end)
+  // only '>' can ends the tag here, the '/' is handled in parseAttribute
+  if (!match[2]) {
+    return ATTR
+  }
+
+  return TEXT
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/parsers/text.js b/node_modules/@riotjs/parser/src/parsers/text.js
new file mode 100644
index 0000000..9b9d002
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/parsers/text.js
@@ -0,0 +1,69 @@
+import {TAG, TEXT} from '../node-types'
+import {RE_SCRYLE} from '../regex'
+import {TEXTAREA_TAG} from '../constants'
+import execFromPos from '../utils/exec-from-pos'
+import expr from './expression'
+import panic from '../utils/panic'
+import pushTag from '../utils/push-tag'
+import pushText from '../utils/push-text'
+import {unclosedNamedBlock} from '../messages'
+
+/**
+ * Parses regular text and script/style blocks ...scryle for short :-)
+ * (the content of script and style is text as well)
+ *
+ * @param   {ParserState} state - Parser state
+ * @returns {number} New parser mode.
+ * @private
+ */
+export default function text(state) {
+  const { pos, data, scryle } = state
+
+  switch (true) {
+  case typeof scryle === 'string': {
+    const name = scryle
+    const re = RE_SCRYLE[name]
+    const match = execFromPos(re, pos, data)
+
+    if (!match) {
+      panic(data, unclosedNamedBlock.replace('%1', name), pos - 1)
+    }
+
+    const start = match.index
+    const end = re.lastIndex
+    state.scryle = null // reset the script/style flag now
+    // write the tag content, if any
+    if (start > pos) {
+      parseSpecialTagsContent(state, name, match)
+    }
+    // now the closing tag, either </script> or </style>
+    pushTag(state, `/${name}`, start, end)
+    break
+  }
+  case data[pos] === '<':
+    state.pos++
+    return TAG
+  default:
+    expr(state, null, '<', pos)
+  }
+
+  return TEXT
+}
+
+/**
+ * Parse the text content depending on the name
+ * @param   {ParserState} state - Parser state
+ * @param   {string} name  - one of the tags matched by the RE_SCRYLE regex
+ * @param   {Array}  match - result of the regex matching the content of the parsed tag
+ * @returns {undefined} void function
+ */
+function parseSpecialTagsContent(state, name, match) {
+  const { pos } = state
+  const start = match.index
+
+  if (name === TEXTAREA_TAG) {
+    expr(state, null, match[0], pos)
+  } else {
+    pushText(state, pos, start)
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/regex.js b/node_modules/@riotjs/parser/src/regex.js
new file mode 100644
index 0000000..117f6ba
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/regex.js
@@ -0,0 +1,41 @@
+/**
+ * Matches the start of valid tags names; used with the first 2 chars after the `'<'`.
+ * @const
+ * @private
+ */
+export const TAG_2C = /^(?:\/[a-zA-Z]|[a-zA-Z][^\s>/]?)/
+/**
+ * Matches valid tags names AFTER the validation with `TAG_2C`.
+ * $1: tag name including any `'/'`, $2: non self-closing brace (`>`) w/o attributes.
+ * @const
+ * @private
+ */
+export const TAG_NAME = /(\/?[^\s>/]+)\s*(>)?/g
+/**
+ * Matches an attribute name-value pair (both can be empty).
+ * $1: attribute name, $2: value including any quotes.
+ * @const
+ * @private
+ */
+export const ATTR_START = /(\S[^>/=\s]*)(?:\s*=\s*([^>/])?)?/g
+
+/**
+ * Matches the spread operator
+ * it will be used for the spread attributes
+ * @type {RegExp}
+ */
+export const SPREAD_OPERATOR = /\.\.\./
+/**
+ * Matches the closing tag of a `script` and `style` block.
+ * Used by parseText fo find the end of the block.
+ * @const
+ * @private
+ */
+export const RE_SCRYLE = {
+  script: /<\/script\s*>/gi,
+  style: /<\/style\s*>/gi,
+  textarea: /<\/textarea\s*>/gi
+}
+
+// Do not touch text content inside this tags
+export const RAW_TAGS = /^\/?(?:pre|textarea)$/
diff --git a/node_modules/@riotjs/parser/src/tree-builder.js b/node_modules/@riotjs/parser/src/tree-builder.js
new file mode 100644
index 0000000..6b94b53
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/tree-builder.js
@@ -0,0 +1,238 @@
+/*---------------------------------------------------------------------
+ * Tree builder for the riot tag parser.
+ *
+ * The output has a root property and separate arrays for `html`, `css`,
+ * and `js` tags.
+ *
+ * The root tag is included as first element in the `html` array.
+ * Script tags marked with "defer" are included in `html` instead `js`.
+ *
+ * - Mark SVG tags
+ * - Mark raw tags
+ * - Mark void tags
+ * - Split prefixes from expressions
+ * - Unescape escaped brackets and escape EOLs and backslashes
+ * - Compact whitespace (option `compact`) for non-raw tags
+ * - Create an array `parts` for text nodes and attributes
+ *
+ * Throws on unclosed tags or closing tags without start tag.
+ * Selfclosing and void tags has no nodes[] property.
+ */
+import {
+  CSS_OUTPUT_NAME,
+  IS_RAW,
+  IS_SELF_CLOSING,
+  IS_VOID,
+  JAVASCRIPT_OUTPUT_NAME,
+  JAVASCRIPT_TAG,
+  STYLE_TAG,
+  TEMPLATE_OUTPUT_NAME
+} from './constants'
+import {TAG, TEXT} from './node-types'
+import {RAW_TAGS} from './regex'
+import {duplicatedNamedTag} from './messages'
+import panic from './utils/panic'
+
+/**
+ * Escape the carriage return and the line feed from a string
+ * @param   {string} string - input string
+ * @returns {string} output string escaped
+ */
+function escapeReturn(string) {
+  return string
+    .replace(/\r/g, '\\r')
+    .replace(/\n/g, '\\n')
+}
+
+/**
+ * Escape double slashes in a string
+ * @param   {string} string - input string
+ * @returns {string} output string escaped
+ */
+function escapeSlashes(string) {
+  return string.replace(/\\/g, '\\\\')
+}
+
+/**
+ * Replace the multiple spaces with only one
+ * @param   {string} string - input string
+ * @returns {string} string without trailing spaces
+ */
+function cleanSpaces(string) {
+  return string.replace(/\s+/g, ' ')
+}
+
+const TREE_BUILDER_STRUCT = Object.seal({
+  get() {
+    const store = this.store
+    // The real root tag is in store.root.nodes[0]
+    return {
+      [TEMPLATE_OUTPUT_NAME]: store.root.nodes[0],
+      [CSS_OUTPUT_NAME]: store[STYLE_TAG],
+      [JAVASCRIPT_OUTPUT_NAME]: store[JAVASCRIPT_TAG]
+    }
+  },
+
+  /**
+  * Process the current tag or text.
+  * @param {Object} node - Raw pseudo-node from the parser
+  * @returns {undefined} void function
+  */
+  push(node) {
+    const store = this.store
+
+    switch (node.type) {
+    case TEXT:
+      this.pushText(store, node)
+      break
+    case TAG: {
+      const name = node.name
+      const closingTagChar = '/'
+      const [firstChar] = name
+
+      if (firstChar === closingTagChar && !node.isVoid) {
+        this.closeTag(store, node, name)
+      } else if (firstChar !== closingTagChar) {
+        this.openTag(store, node)
+      }
+      break
+    }
+    }
+  },
+  closeTag(store, node) {
+    const last = store.scryle || store.last
+
+    last.end = node.end
+
+    if (store.scryle) {
+      store.scryle = null
+    } else {
+      store.last = store.stack.pop()
+    }
+  },
+
+  openTag(store, node) {
+    const name = node.name
+    const attrs = node.attributes
+
+    if ([JAVASCRIPT_TAG, STYLE_TAG].includes(name)) {
+      // Only accept one of each
+      if (store[name]) {
+        panic(this.store.data, duplicatedNamedTag.replace('%1', name), node.start)
+      }
+
+      store[name] = node
+      store.scryle = store[name]
+
+    } else {
+      // store.last holds the last tag pushed in the stack and this are
+      // non-void, non-empty tags, so we are sure the `lastTag` here
+      // have a `nodes` property.
+      const lastTag = store.last
+      const newNode = node
+
+      lastTag.nodes.push(newNode)
+
+      if (lastTag[IS_RAW] || RAW_TAGS.test(name)) {
+        node[IS_RAW] = true
+      }
+
+      if (!node[IS_SELF_CLOSING] && !node[IS_VOID]) {
+        store.stack.push(lastTag)
+        newNode.nodes = []
+        store.last = newNode
+      }
+    }
+
+    if (attrs) {
+      this.attrs(attrs)
+    }
+  },
+  attrs(attributes) {
+    attributes.forEach(attr => {
+      if (attr.value) {
+        this.split(attr, attr.value, attr.valueStart, true)
+      }
+    })
+  },
+  pushText(store, node) {
+    const text = node.text
+    const empty = !/\S/.test(text)
+    const scryle = store.scryle
+    if (!scryle) {
+      // store.last always have a nodes property
+      const parent = store.last
+
+      const pack = this.compact && !parent[IS_RAW]
+      if (pack && empty) {
+        return
+      }
+      this.split(node, text, node.start, pack)
+      parent.nodes.push(node)
+    } else if (!empty) {
+      scryle.text = node
+    }
+  },
+  split(node, source, start, pack) {
+    const expressions = node.expressions
+    const parts = []
+
+    if (expressions) {
+      let pos = 0
+
+      expressions.forEach(expr => {
+        const text = source.slice(pos, expr.start - start)
+        const code = expr.text
+        parts.push(this.sanitise(node, text, pack), escapeReturn(escapeSlashes(code).trim()))
+        pos = expr.end - start
+      })
+
+      if (pos < node.end) {
+        parts.push(this.sanitise(node, source.slice(pos), pack))
+      }
+    } else {
+      parts[0] = this.sanitise(node, source, pack)
+    }
+
+    node.parts = parts.filter(p => p) // remove the empty strings
+  },
+  // unescape escaped brackets and split prefixes of expressions
+  sanitise(node, text, pack) {
+    let rep = node.unescape
+    if (rep) {
+      let idx = 0
+      rep = `\\${rep}`
+      while ((idx = text.indexOf(rep, idx)) !== -1) {
+        text = text.substr(0, idx) + text.substr(idx + 1)
+        idx++
+      }
+    }
+
+    text = escapeSlashes(text)
+
+    return pack ? cleanSpaces(text) : escapeReturn(text)
+  }
+})
+
+export default function createTreeBuilder(data, options) {
+  const root = {
+    type: TAG,
+    name: '',
+    start: 0,
+    end: 0,
+    nodes: []
+  }
+
+  return Object.assign(Object.create(TREE_BUILDER_STRUCT), {
+    compact: options.compact !== false,
+    store: {
+      last: root,
+      stack: [],
+      scryle: null,
+      root,
+      style: null,
+      script: null,
+      data
+    }
+  })
+}
diff --git a/node_modules/@riotjs/parser/src/utils/add-to-collection.js b/node_modules/@riotjs/parser/src/utils/add-to-collection.js
new file mode 100644
index 0000000..2f83d4b
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/add-to-collection.js
@@ -0,0 +1,11 @@
+/**
+ * Add an item into a collection, if the collection is not an array
+ * we create one and add the item to it
+ * @param   {Array} collection - target collection
+ * @param   {*} item - item to add to the collection
+ * @returns {Array} array containing the new item added to it
+ */
+export default function addToCollection(collection = [], item) {
+  collection.push(item)
+  return collection
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/escape-str.js b/node_modules/@riotjs/parser/src/utils/escape-str.js
new file mode 100644
index 0000000..368c73c
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/escape-str.js
@@ -0,0 +1,7 @@
+/**
+ * Escape special characters in a given string, in preparation to create a regex.
+ *
+ * @param   {string} str - Raw string
+ * @returns {string} Escaped string.
+ */
+export default (str) => str.replace(/(?=[-[\](){^*+?.$|\\])/g, '\\')
diff --git a/node_modules/@riotjs/parser/src/utils/exec-from-pos.js b/node_modules/@riotjs/parser/src/utils/exec-from-pos.js
new file mode 100644
index 0000000..f8659e5
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/exec-from-pos.js
@@ -0,0 +1,11 @@
+/**
+ * Run RegExp.exec starting from a specific position
+ * @param   {RegExp} re - regex
+ * @param   {number} pos - last index position
+ * @param   {string} string - regex target
+ * @returns {Array} regex result
+ */
+export default function execFromPos(re, pos, string) {
+  re.lastIndex = pos
+  return re.exec(string)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/expr-extr.js b/node_modules/@riotjs/parser/src/utils/expr-extr.js
new file mode 100644
index 0000000..173045f
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/expr-extr.js
@@ -0,0 +1,139 @@
+/*
+ * Mini-parser for expressions.
+ * The main pourpose of this module is to find the end of an expression
+ * and return its text without the enclosing brackets.
+ * Does not works with comments, but supports ES6 template strings.
+ */
+import skipES6TL, {$_ES6_BQ} from './skip-es6-tl'
+import {unclosedExpression, unexpectedCharInExpression} from '../messages'
+import escapeStr from './escape-str'
+import panic from './panic'
+import skipRegex from './skip-regex'
+/**
+ * @exports exprExtr
+ */
+const S_SQ_STR = /'[^'\n\r\\]*(?:\\(?:\r\n?|[\S\s])[^'\n\r\\]*)*'/.source
+/**
+ * Matches double quoted JS strings taking care about nested quotes
+ * and EOLs (escaped EOLs are Ok).
+ *
+ * @const
+ * @private
+ */
+const S_STRING = `${S_SQ_STR}|${S_SQ_STR.replace(/'/g, '"')}`
+/**
+ * Regex cache
+ *
+ * @type {Object.<string, RegExp>}
+ * @const
+ * @private
+ */
+const reBr = {}
+/**
+ * Makes an optimal regex that matches quoted strings, brackets, backquotes
+ * and the closing brackets of an expression.
+ *
+ * @param   {string} b - Closing brackets
+ * @returns {RegExp} - optimized regex
+ */
+function _regex(b) {
+  let re = reBr[b]
+  if (!re) {
+    let s = escapeStr(b)
+    if (b.length > 1) {
+      s = `${s}|[`
+    } else {
+      s = /[{}[\]()]/.test(b) ? '[' : `[${s}`
+    }
+    reBr[b] = re = new RegExp(`${S_STRING}|${s}\`/\\{}[\\]()]`, 'g')
+  }
+  return re
+}
+
+/**
+ * Update the scopes stack removing or adding closures to it
+ * @param   {Array} stack - array stacking the expression closures
+ * @param   {string} char - current char to add or remove from the stack
+ * @param   {string} idx  - matching index
+ * @param   {string} code - expression code
+ * @returns {Object} result
+ * @returns {Object} result.char - either the char received or the closing braces
+ * @returns {Object} result.index - either a new index to skip part of the source code,
+ *                                  or 0 to keep from parsing from the old position
+ */
+function updateStack(stack, char, idx, code) {
+  let index = 0
+
+  switch (char) {
+  case '[':
+  case '(':
+  case '{':
+    stack.push(char === '[' ? ']' : char === '(' ? ')' : '}')
+    break
+  case ')':
+  case ']':
+  case '}':
+    if (char !== stack.pop()) {
+      panic(code, unexpectedCharInExpression.replace('%1', char), index)
+    }
+
+    if (char === '}' && stack[stack.length - 1] === $_ES6_BQ) {
+      char = stack.pop()
+    }
+
+    index = idx + 1
+    break
+  case '/':
+    index = skipRegex(code, idx)
+  }
+
+  return { char, index }
+}
+
+/**
+   * Parses the code string searching the end of the expression.
+   * It skips braces, quoted strings, regexes, and ES6 template literals.
+   *
+   * @function exprExtr
+   * @param   {string}  code  - Buffer to parse
+   * @param   {number}  start - Position of the opening brace
+   * @param   {[string,string]} bp - Brackets pair
+   * @returns {Object} Expression's end (after the closing brace) or -1
+   *                            if it is not an expr.
+   */
+export default function exprExtr(code, start, bp) {
+  const [openingBraces, closingBraces] = bp
+  const offset = start + openingBraces.length // skips the opening brace
+  const stack = [] // expected closing braces ('`' for ES6 TL)
+  const re = _regex(closingBraces)
+
+  re.lastIndex = offset // begining of the expression
+
+  let end
+  let match
+
+  while (match = re.exec(code)) { // eslint-disable-line
+    const idx = match.index
+    const str = match[0]
+    end = re.lastIndex
+
+    // end the iteration
+    if (str === closingBraces && !stack.length) {
+      return {
+        text: code.slice(offset, idx),
+        start,
+        end
+      }
+    }
+
+    const { char, index } = updateStack(stack, str[0], idx, code)
+    // update the end value depending on the new index received
+    end = index || end
+    // update the regex last index
+    re.lastIndex = char === $_ES6_BQ ? skipES6TL(code, end, stack) : end
+  }
+
+  if (stack.length) {
+    panic(code, unclosedExpression, end)
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/flush-parser-state.js b/node_modules/@riotjs/parser/src/utils/flush-parser-state.js
new file mode 100644
index 0000000..a0dce7e
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/flush-parser-state.js
@@ -0,0 +1,14 @@
+/**
+ * Outputs the last parsed node. Can be used with a builder too.
+ *
+ * @param   {ParserStore} store - Parsing store
+ * @returns {undefined} void function
+ * @private
+ */
+export default function flush(store) {
+  const last = store.last
+  store.last = null
+  if (last && store.root) {
+    store.builder.push(last)
+  }
+}
diff --git a/node_modules/@riotjs/parser/src/utils/format-error.js b/node_modules/@riotjs/parser/src/utils/format-error.js
new file mode 100644
index 0000000..d9811d4
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/format-error.js
@@ -0,0 +1,12 @@
+export default function formatError(data, message, pos) {
+  if (!pos) {
+    pos = data.length
+  }
+  // count unix/mac/win eols
+  const line = (data.slice(0, pos).match(/\r\n?|\n/g) || '').length + 1
+  let col = 0
+  while (--pos >= 0 && !/[\r\n]/.test(data[pos])) {
+    ++col
+  }
+  return `[${line},${col}]: ${message}`
+}
diff --git a/node_modules/@riotjs/parser/src/utils/get-chunk.js b/node_modules/@riotjs/parser/src/utils/get-chunk.js
new file mode 100644
index 0000000..b866423
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/get-chunk.js
@@ -0,0 +1,11 @@
+/**
+ * Get the code chunks from start and end range
+ * @param   {string}  source  - source code
+ * @param   {number}  start   - Start position of the chunk we want to extract
+ * @param   {number}  end     - Ending position of the chunk we need
+ * @returns {string}  chunk of code extracted from the source code received
+ * @private
+ */
+export default function getChunk(source, start, end) {
+  return source.slice(start, end)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/memoize.js b/node_modules/@riotjs/parser/src/utils/memoize.js
new file mode 100644
index 0000000..dffea9e
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/memoize.js
@@ -0,0 +1,18 @@
+/**
+ * Memoization function
+ * @param   {Function} fn - function to memoize
+ * @returns {*} return of the function to memoize
+ */
+export default function memoize(fn) {
+  const cache = new WeakMap()
+
+  return (...args) => {
+    if (cache.has(args[0])) return cache.get(args[0])
+
+    const ret = fn(...args)
+
+    cache.set(args[0], ret)
+
+    return ret
+  }
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/panic.js b/node_modules/@riotjs/parser/src/utils/panic.js
new file mode 100644
index 0000000..af5a4ae
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/panic.js
@@ -0,0 +1,15 @@
+import formatError from './format-error'
+
+/**
+ * Custom error handler can be implemented replacing this method.
+ * The `state` object includes the buffer (`data`)
+ * The error position (`loc`) contains line (base 1) and col (base 0).
+ * @param {string} data - string containing the error
+ * @param {string} msg - Error message
+ * @param {number} pos - Position of the error
+ * @returns {undefined} throw an exception error
+ */
+export default function panic(data, msg, pos) {
+  const message = formatError(data, msg, pos)
+  throw new Error(message)
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/push-tag.js b/node_modules/@riotjs/parser/src/utils/push-tag.js
new file mode 100644
index 0000000..23bd312
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/push-tag.js
@@ -0,0 +1,48 @@
+import {
+  IS_CUSTOM,
+  IS_VOID
+} from '../constants'
+import {isCustom, isVoid} from 'dom-nodes'
+import {TAG} from '../node-types'
+import flush from './flush-parser-state'
+
+/**
+ * Pushes a new *tag* and set `last` to this, so any attributes
+ * will be included on this and shifts the `end`.
+ *
+ * @param   {ParserState} state  - Current parser state
+ * @param   {string}  name      - Name of the node including any slash
+ * @param   {number}  start     - Start position of the tag
+ * @param   {number}  end       - Ending position (last char of the tag + 1)
+ * @returns {undefined} - void function
+ * @private
+ */
+export default function pushTag(state, name, start, end) {
+  const root = state.root
+  const last = { type: TAG, name, start, end }
+
+  if (isCustom(name)) {
+    last[IS_CUSTOM] = true
+  }
+
+  if (isVoid(name)) {
+    last[IS_VOID] = true
+  }
+
+  state.pos = end
+
+  if (root) {
+    if (name === root.name) {
+      state.count++
+    } else if (name === root.close) {
+      state.count--
+    }
+    flush(state)
+  } else {
+    // start with root (keep ref to output)
+    state.root = { name: last.name, close: `/${name}` }
+    state.count = 1
+  }
+
+  state.last = last
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/push-text.js b/node_modules/@riotjs/parser/src/utils/push-text.js
new file mode 100644
index 0000000..845af75
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/push-text.js
@@ -0,0 +1,42 @@
+import {TEXT} from '../node-types'
+import flush from './flush-parser-state'
+import getChunk from './get-chunk'
+
+/**
+ * states text in the last text node, or creates a new one if needed.
+ *
+ * @param {ParserState}   state   - Current parser state
+ * @param {number}  start   - Start position of the tag
+ * @param {number}  end     - Ending position (last char of the tag)
+ * @param {Object}  extra   - extra properties to add to the text node
+ * @param {RawExpr[]} extra.expressions  - Found expressions
+ * @param {string}    extra.unescape     - Brackets to unescape
+ * @returns {undefined} - void function
+ * @private
+ */
+export default function pushText(state, start, end, extra = {}) {
+  const text = getChunk(state.data, start, end)
+  const expressions = extra.expressions
+  const unescape = extra.unescape
+
+  let q = state.last
+  state.pos = end
+
+  if (q && q.type === TEXT) {
+    q.text += text
+    q.end = end
+  } else {
+    flush(state)
+    state.last = q = { type: TEXT, text, start, end }
+  }
+
+  if (expressions && expressions.length) {
+    q.expressions = (q.expressions || []).concat(expressions)
+  }
+
+  if (unescape) {
+    q.unescape = unescape
+  }
+
+  return TEXT
+}
\ No newline at end of file
diff --git a/node_modules/@riotjs/parser/src/utils/skip-es6-tl.js b/node_modules/@riotjs/parser/src/utils/skip-es6-tl.js
new file mode 100644
index 0000000..320d2bb
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/skip-es6-tl.js
@@ -0,0 +1,33 @@
+import formatError from './format-error'
+import {unclosedTemplateLiteral} from '../messages'
+export const $_ES6_BQ = '`'
+
+/**
+ * Searches the next backquote that signals the end of the ES6 Template Literal
+ * or the "${" sequence that starts a JS expression, skipping any escaped
+ * character.
+ *
+ * @param   {string}    code  - Whole code
+ * @param   {number}    pos   - The start position of the template
+ * @param   {string[]}  stack - To save nested ES6 TL count
+ * @returns {number}    The end of the string (-1 if not found)
+ */
+export default function skipES6TL(code, pos, stack) {
+  // we are in the char following the backquote (`),
+  // find the next unescaped backquote or the sequence "${"
+  const re = /[`$\\]/g
+  let c
+  while (re.lastIndex = pos, re.exec(code)) {
+    pos = re.lastIndex
+    c = code[pos - 1]
+    if (c === '`') {
+      return pos
+    }
+    if (c === '$' && code[pos++] === '{') {
+      stack.push($_ES6_BQ, '}')
+      return pos
+    }
+    // else this is an escaped char
+  }
+  throw formatError(code, unclosedTemplateLiteral, pos)
+}
diff --git a/node_modules/@riotjs/parser/src/utils/skip-regex.js b/node_modules/@riotjs/parser/src/utils/skip-regex.js
new file mode 100644
index 0000000..38ea8c9
--- /dev/null
+++ b/node_modules/@riotjs/parser/src/utils/skip-regex.js
@@ -0,0 +1,116 @@
+// forked from https://github.com/aMarCruz/skip-regex
+
+// safe characters to precced a regex (including `=>`, `**`, and `...`)
+const beforeReChars = '[{(,;:?=|&!^~>%*/'
+const beforeReSign = `${beforeReChars}+-`
+
+// keyword that can preceed a regex (`in` is handled as special case)
+const beforeReWords = [
+  'case',
+  'default',
+  'do',
+  'else',
+  'in',
+  'instanceof',
+  'prefix',
+  'return',
+  'typeof',
+  'void',
+  'yield'
+]
+
+// Last chars of all the beforeReWords elements to speed up the process.
+const wordsEndChar = beforeReWords.reduce((s, w) => s + w.slice(-1), '')
+
+// Matches literal regex from the start of the buffer.
+// The buffer to search must not include line-endings.
+const RE_LIT_REGEX = /^\/(?=[^*>/])[^[/\\]*(?:(?:\\.|\[(?:\\.|[^\]\\]*)*\])[^[\\/]*)*?\/[gimuy]*/
+
+// Valid characters for JavaScript variable names and literal numbers.
+const RE_JS_VCHAR = /[$\w]/
+
+// Match dot characters that could be part of tricky regex
+const RE_DOT_CHAR = /.*/g
+
+/**
+ * Searches the position of the previous non-blank character inside `code`,
+ * starting with `pos - 1`.
+ *
+ * @param   {string} code - Buffer to search
+ * @param   {number} pos  - Starting position
+ * @returns {number} Position of the first non-blank character to the left.
+ * @private
+ */
+function _prev(code, pos) {
+  while (--pos >= 0 && /\s/.test(code[pos]));
+  return pos
+}
+
+
+
+/**
+ * Check if the character in the `start` position within `code` can be a regex
+ * and returns the position following this regex or `start+1` if this is not
+ * one.
+ *
+ * NOTE: Ensure `start` points to a slash (this is not checked).
+ *
+ * @function skipRegex
+ * @param   {string} code  - Buffer to test in
+ * @param   {number} start - Position the first slash inside `code`
+ * @returns {number} Position of the char following the regex.
+ *
+ */
+/* istanbul ignore next */
+export default function skipRegex(code, start) {
+  let pos = RE_DOT_CHAR.lastIndex = start++
+
+  // `exec()` will extract from the slash to the end of the line
+  //   and the chained `match()` will match the possible regex.
+  const match = (RE_DOT_CHAR.exec(code) || ' ')[0].match(RE_LIT_REGEX)
+
+  if (match) {
+    const next = pos + match[0].length      // result comes from `re.match`
+
+    pos = _prev(code, pos)
+    let c = code[pos]
+
+    // start of buffer or safe prefix?
+    if (pos < 0 || beforeReChars.includes(c)) {
+      return next
+    }
+
+    // from here, `pos` is >= 0 and `c` is code[pos]
+    if (c === '.') {
+      // can be `...` or something silly like 5./2
+      if (code[pos - 1] === '.') {
+        start = next
+      }
+
+    } else {
+
+      if (c === '+' || c === '-') {
+        // tricky case
+        if (code[--pos] !== c ||            // if have a single operator or
+             (pos = _prev(code, pos)) < 0 ||  // ...have `++` and no previous token
+             beforeReSign.includes(c = code[pos])) {
+          return next                       // ...this is a regex
+        }
+      }
+
+      if (wordsEndChar.includes(c)) {  // looks like a keyword?
+        const end = pos + 1
+
+        // get the complete (previous) keyword
+        while (--pos >= 0 && RE_JS_VCHAR.test(code[pos]));
+
+        // it is in the allowed keywords list?
+        if (beforeReWords.includes(code.slice(pos + 1, end))) {
+          start = next
+        }
+      }
+    }
+  }
+
+  return start
+}
diff --git a/node_modules/@ungap/essential-map/LICENSE b/node_modules/@ungap/essential-map/LICENSE
new file mode 100644
index 0000000..c850830
--- /dev/null
+++ b/node_modules/@ungap/essential-map/LICENSE
@@ -0,0 +1,15 @@
+ISC License
+
+Copyright (c) 2018, Andrea Giammarchi, @WebReflection
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
+OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/@ungap/essential-map/README.md b/node_modules/@ungap/essential-map/README.md
new file mode 100644
index 0000000..16d334d
--- /dev/null
+++ b/node_modules/@ungap/essential-map/README.md
@@ -0,0 +1,15 @@
+# Essential Map
+
+[![Build Status](https://travis-ci.com/ungap/essential-map.svg?branch=master)](https://travis-ci.com/ungap/essential-map) [![Coverage Status](https://coveralls.io/repos/github/ungap/essential-map/badge.svg?branch=master)](https://coveralls.io/github/ungap/essential-map?branch=master) [![Greenkeeper badge](https://badges.greenkeeper.io/ungap/essential-map.svg)](https://greenkeeper.io/) ![WebReflection status](https://offline.report/status/webreflection.svg)
+
+An essential [Map](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map) poorlyfill for legacy browsers.
+
+Only methods are `delete`, `forEach`, `get`, `has`, and `set`.
+
+  * CDN via https://unpkg.com/@ungap/essential-map
+  * ESM via `import Map from '@ungap/essential-map'`
+  * CJS via `const Map = require('@ungap/essential-map')`
+
+Compatible down to IE9, works well with ES5 shim upfront in IE8 (and maybe lower too).
+
+[Live test](https://ungap.github.io/essential-map/test/)
diff --git a/node_modules/@ungap/essential-map/cjs/index.js b/node_modules/@ungap/essential-map/cjs/index.js
new file mode 100644
index 0000000..fd7e7c0
--- /dev/null
+++ b/node_modules/@ungap/essential-map/cjs/index.js
@@ -0,0 +1,43 @@
+/*! (c) Andrea Giammarchi - ISC */
+var self = this || /* istanbul ignore next */ {};
+try { self.Map = Map; }
+catch (Map) {
+  self.Map = function Map() {
+    var i = 0;
+    var k = [];
+    var v = [];
+    return {
+      delete: function (key) {
+        var had = contains(key);
+        if (had) {
+          k.splice(i, 1);
+          v.splice(i, 1);
+        }
+        return had;
+      },
+      forEach: function forEach(callback, context) {
+        k.forEach(
+          function (key, i)  {
+            callback.call(context, v[i], key, this);
+          },
+          this
+        );
+      },
+      get: function get(key) {
+        return contains(key) ? v[i] : void 0;
+      },
+      has: function has(key) {
+        return contains(key);
+      },
+      set: function set(key, value) {
+        v[contains(key) ? i : (k.push(key) - 1)] = value;
+        return this;
+      }
+    };
+    function contains(v) {
+      i = k.indexOf(v);
+      return -1 < i;
+    }
+  };
+}
+module.exports = self.Map;
diff --git a/node_modules/@ungap/essential-map/esm/index.js b/node_modules/@ungap/essential-map/esm/index.js
new file mode 100644
index 0000000..797d042
--- /dev/null
+++ b/node_modules/@ungap/essential-map/esm/index.js
@@ -0,0 +1,43 @@
+/*! (c) Andrea Giammarchi - ISC */
+var self = this || /* istanbul ignore next */ {};
+try { self.Map = Map; }
+catch (Map) {
+  self.Map = function Map() {
+    var i = 0;
+    var k = [];
+    var v = [];
+    return {
+      delete: function (key) {
+        var had = contains(key);
+        if (had) {
+          k.splice(i, 1);
+          v.splice(i, 1);
+        }
+        return had;
+      },
+      forEach: function forEach(callback, context) {
+        k.forEach(
+          function (key, i)  {
+            callback.call(context, v[i], key, this);
+          },
+          this
+        );
+      },
+      get: function get(key) {
+        return contains(key) ? v[i] : void 0;
+      },
+      has: function has(key) {
+        return contains(key);
+      },
+      set: function set(key, value) {
+        v[contains(key) ? i : (k.push(key) - 1)] = value;
+        return this;
+      }
+    };
+    function contains(v) {
+      i = k.indexOf(v);
+      return -1 < i;
+    }
+  };
+}
+export default self.Map;
diff --git a/node_modules/@ungap/essential-map/index.js b/node_modules/@ungap/essential-map/index.js
new file mode 100644
index 0000000..f556ae7
--- /dev/null
+++ b/node_modules/@ungap/essential-map/index.js
@@ -0,0 +1,42 @@
+/*! (c) Andrea Giammarchi - ISC */
+var self = this || /* istanbul ignore next */ {};
+try { self.Map = Map; }
+catch (Map) {
+  self.Map = function Map() {
+    var i = 0;
+    var k = [];
+    var v = [];
+    return {
+      delete: function (key) {
+        var had = contains(key);
+        if (had) {
+          k.splice(i, 1);
+          v.splice(i, 1);
+        }
+        return had;
+      },
+      forEach: function forEach(callback, context) {
+        k.forEach(
+          function (key, i)  {
+            callback.call(context, v[i], key, this);
+          },
+          this
+        );
+      },
+      get: function get(key) {
+        return contains(key) ? v[i] : void 0;
+      },
+      has: function has(key) {
+        return contains(key);
+      },
+      set: function set(key, value) {
+        v[contains(key) ? i : (k.push(key) - 1)] = value;
+        return this;
+      }
+    };
+    function contains(v) {
+      i = k.indexOf(v);
+      return -1 < i;
+    }
+  };
+}
diff --git a/node_modules/@ungap/essential-map/min.js b/node_modules/@ungap/essential-map/min.js
new file mode 100644
index 0000000..f09dff2
--- /dev/null
+++ b/node_modules/@ungap/essential-map/min.js
@@ -0,0 +1,2 @@
+/*! (c) Andrea Giammarchi - ISC */
+var self=this||{};try{self.Map=Map}catch(n){self.Map=function(){var r=0,i=[],c=[];return{delete:function(n){var t=e(n);return t&&(i.splice(r,1),c.splice(r,1)),t},forEach:function(r,e){i.forEach(function(n,t){r.call(e,c[t],n,this)},this)},get:function(n){return e(n)?c[r]:void 0},has:function(n){return e(n)},set:function(n,t){return c[e(n)?r:i.push(n)-1]=t,this}};function e(n){return-1<(r=i.indexOf(n))}}}
\ No newline at end of file
diff --git a/node_modules/@ungap/essential-map/package.json b/node_modules/@ungap/essential-map/package.json
new file mode 100644
index 0000000..8035fdd
--- /dev/null
+++ b/node_modules/@ungap/essential-map/package.json
@@ -0,0 +1,68 @@
+{
+  "_from": "@ungap/essential-map@^0.2.0",
+  "_id": "@ungap/essential-map@0.2.0",
+  "_inBundle": false,
+  "_integrity": "sha512-PM7rUPhH2IAeDZXGjMi1KwNVW/4b/wxfzlPkZSXacHA5A98n+PdCou+HD2EaeXlO8pY5Tp81Ysg+J2xB7J/mjw==",
+  "_location": "/@ungap/essential-map",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@ungap/essential-map@^0.2.0",
+    "name": "@ungap/essential-map",
+    "escapedName": "@ungap%2fessential-map",
+    "scope": "@ungap",
+    "rawSpec": "^0.2.0",
+    "saveSpec": null,
+    "fetchSpec": "^0.2.0"
+  },
+  "_requiredBy": [
+    "/domdiff"
+  ],
+  "_resolved": "https://registry.npmjs.org/@ungap/essential-map/-/essential-map-0.2.0.tgz",
+  "_shasum": "c8721ac3512331c9b80382be99fff1b04eedba1d",
+  "_spec": "@ungap/essential-map@^0.2.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/domdiff",
+  "author": {
+    "name": "Andrea Giammarchi"
+  },
+  "bugs": {
+    "url": "https://github.com/ungap/essential-map/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "An essential Map poorlyfill for legacy browsers.",
+  "devDependencies": {
+    "coveralls": "^3.0.2",
+    "istanbul": "^0.4.5",
+    "uglify-js": "^3.4.9"
+  },
+  "homepage": "https://github.com/ungap/essential-map#readme",
+  "keywords": [
+    "Map",
+    "essential",
+    "poorlyfill",
+    "polyfill",
+    "legacy",
+    "ungap"
+  ],
+  "license": "ISC",
+  "main": "cjs/index.js",
+  "module": "esm/index.js",
+  "name": "@ungap/essential-map",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/ungap/essential-map.git"
+  },
+  "scripts": {
+    "build": "npm run cjs && npm run esm && npm run min && npm run test && npm run size",
+    "cjs": "cp index.js cjs/ && echo 'module.exports = self.Map;' >> cjs/index.js",
+    "coveralls": "cat ./coverage/lcov.info | coveralls",
+    "esm": "cp index.js esm/ && echo 'export default self.Map;' >> esm/index.js",
+    "min": "uglifyjs index.js --support-ie8 --comments=/^!/ -c -m -o min.js",
+    "size": "cat index.js | wc -c && cat min.js | wc -c && gzip -c9 min.js | wc -c && cat min.js | brotli | wc -c",
+    "test": "istanbul cover test/index.js"
+  },
+  "unpkg": "min.js",
+  "version": "0.2.0"
+}
diff --git a/node_modules/acorn/CHANGELOG.md b/node_modules/acorn/CHANGELOG.md
new file mode 100644
index 0000000..2d6115e
--- /dev/null
+++ b/node_modules/acorn/CHANGELOG.md
@@ -0,0 +1,552 @@
+## 7.0.0 (2019-08-13)
+
+### Breaking changes
+
+Changes the node format for dynamic imports to use the `ImportExpression` node type, as defined in [ESTree](https://github.com/estree/estree/blob/master/es2020.md#importexpression).
+
+Makes 10 (ES2019) the default value for the `ecmaVersion` option.
+
+## 6.3.0 (2019-08-12)
+
+### New features
+
+`sourceType: "module"` can now be used even when `ecmaVersion` is less than 6, to parse module-style code that otherwise conforms to an older standard.
+
+## 6.2.1 (2019-07-21)
+
+### Bug fixes
+
+Fix bug causing Acorn to treat some characters as identifier characters that shouldn't be treated as such.
+
+Fix issue where setting the `allowReserved` option to `"never"` allowed reserved words in some circumstances.
+
+## 6.2.0 (2019-07-04)
+
+### Bug fixes
+
+Improve valid assignment checking in `for`/`in` and `for`/`of` loops.
+
+Disallow binding `let` in patterns.
+
+### New features
+
+Support bigint syntax with `ecmaVersion` >= 10.
+
+Support dynamic `import` syntax with `ecmaVersion` >= 10.
+
+Upgrade to Unicode version 12.
+
+## 6.1.1 (2019-02-27)
+
+### Bug fixes
+
+Fix bug that caused parsing default exports of with names to fail.
+
+## 6.1.0 (2019-02-08)
+
+### Bug fixes
+
+Fix scope checking when redefining a `var` as a lexical binding.
+
+### New features
+
+Split up `parseSubscripts` to use an internal `parseSubscript` method to make it easier to extend with plugins.
+
+## 6.0.7 (2019-02-04)
+
+### Bug fixes
+
+Check that exported bindings are defined.
+
+Don't treat `\u180e` as a whitespace character.
+
+Check for duplicate parameter names in methods.
+
+Don't allow shorthand properties when they are generators or async methods.
+
+Forbid binding `await` in async arrow function's parameter list.
+
+## 6.0.6 (2019-01-30)
+
+### Bug fixes
+
+The content of class declarations and expressions is now always parsed in strict mode.
+
+Don't allow `let` or `const` to bind the variable name `let`.
+
+Treat class declarations as lexical.
+
+Don't allow a generator function declaration as the sole body of an `if` or `else`.
+
+Ignore `"use strict"` when after an empty statement.
+
+Allow string line continuations with special line terminator characters.
+
+Treat `for` bodies as part of the `for` scope when checking for conflicting bindings.
+
+Fix bug with parsing `yield` in a `for` loop initializer.
+
+Implement special cases around scope checking for functions.
+
+## 6.0.5 (2019-01-02)
+
+### Bug fixes
+
+Fix TypeScript type for `Parser.extend` and add `allowAwaitOutsideFunction` to options type.
+
+Don't treat `let` as a keyword when the next token is `{` on the next line.
+
+Fix bug that broke checking for parentheses around an object pattern in a destructuring assignment when `preserveParens` was on.
+
+## 6.0.4 (2018-11-05)
+
+### Bug fixes
+
+Further improvements to tokenizing regular expressions in corner cases.
+
+## 6.0.3 (2018-11-04)
+
+### Bug fixes
+
+Fix bug in tokenizing an expression-less return followed by a function followed by a regular expression.
+
+Remove stray symlink in the package tarball.
+
+## 6.0.2 (2018-09-26)
+
+### Bug fixes
+
+Fix bug where default expressions could fail to parse inside an object destructuring assignment expression.
+
+## 6.0.1 (2018-09-14)
+
+### Bug fixes
+
+Fix wrong value in `version` export.
+
+## 6.0.0 (2018-09-14)
+
+### Bug fixes
+
+Better handle variable-redefinition checks for catch bindings and functions directly under if statements.
+
+Forbid `new.target` in top-level arrow functions.
+
+Fix issue with parsing a regexp after `yield` in some contexts.
+
+### New features
+
+The package now comes with TypeScript definitions.
+
+### Breaking changes
+
+The default value of the `ecmaVersion` option is now 9 (2018).
+
+Plugins work differently, and will have to be rewritten to work with this version.
+
+The loose parser and walker have been moved into separate packages (`acorn-loose` and `acorn-walk`).
+
+## 5.7.3 (2018-09-10)
+
+### Bug fixes
+
+Fix failure to tokenize regexps after expressions like `x.of`.
+
+Better error message for unterminated template literals.
+
+## 5.7.2 (2018-08-24)
+
+### Bug fixes
+
+Properly handle `allowAwaitOutsideFunction` in for statements.
+
+Treat function declarations at the top level of modules like let bindings.
+
+Don't allow async function declarations as the only statement under a label.
+
+## 5.7.0 (2018-06-15)
+
+### New features
+
+Upgraded to Unicode 11.
+
+## 5.6.0 (2018-05-31)
+
+### New features
+
+Allow U+2028 and U+2029 in string when ECMAVersion >= 10.
+
+Allow binding-less catch statements when ECMAVersion >= 10.
+
+Add `allowAwaitOutsideFunction` option for parsing top-level `await`.
+
+## 5.5.3 (2018-03-08)
+
+### Bug fixes
+
+A _second_ republish of the code in 5.5.1, this time with yarn, to hopefully get valid timestamps.
+
+## 5.5.2 (2018-03-08)
+
+### Bug fixes
+
+A republish of the code in 5.5.1 in an attempt to solve an issue with the file timestamps in the npm package being 0.
+
+## 5.5.1 (2018-03-06)
+
+### Bug fixes
+
+Fix misleading error message for octal escapes in template strings.
+
+## 5.5.0 (2018-02-27)
+
+### New features
+
+The identifier character categorization is now based on Unicode version 10.
+
+Acorn will now validate the content of regular expressions, including new ES9 features.
+
+## 5.4.0 (2018-02-01)
+
+### Bug fixes
+
+Disallow duplicate or escaped flags on regular expressions.
+
+Disallow octal escapes in strings in strict mode.
+
+### New features
+
+Add support for async iteration.
+
+Add support for object spread and rest.
+
+## 5.3.0 (2017-12-28)
+
+### Bug fixes
+
+Fix parsing of floating point literals with leading zeroes in loose mode.
+
+Allow duplicate property names in object patterns.
+
+Don't allow static class methods named `prototype`.
+
+Disallow async functions directly under `if` or `else`.
+
+Parse right-hand-side of `for`/`of` as an assignment expression.
+
+Stricter parsing of `for`/`in`.
+
+Don't allow unicode escapes in contextual keywords.
+
+### New features
+
+Parsing class members was factored into smaller methods to allow plugins to hook into it.
+
+## 5.2.1 (2017-10-30)
+
+### Bug fixes
+
+Fix a token context corruption bug.
+
+## 5.2.0 (2017-10-30)
+
+### Bug fixes
+
+Fix token context tracking for `class` and `function` in property-name position.
+
+Make sure `%*` isn't parsed as a valid operator.
+
+Allow shorthand properties `get` and `set` to be followed by default values.
+
+Disallow `super` when not in callee or object position.
+
+### New features
+
+Support [`directive` property](https://github.com/estree/estree/compare/b3de58c9997504d6fba04b72f76e6dd1619ee4eb...1da8e603237144f44710360f8feb7a9977e905e0) on directive expression statements.
+
+## 5.1.2 (2017-09-04)
+
+### Bug fixes
+
+Disable parsing of legacy HTML-style comments in modules.
+
+Fix parsing of async methods whose names are keywords.
+
+## 5.1.1 (2017-07-06)
+
+### Bug fixes
+
+Fix problem with disambiguating regexp and division after a class.
+
+## 5.1.0 (2017-07-05)
+
+### Bug fixes
+
+Fix tokenizing of regexps in an object-desctructuring `for`/`of` loop and after `yield`.
+
+Parse zero-prefixed numbers with non-octal digits as decimal.
+
+Allow object/array patterns in rest parameters.
+
+Don't error when `yield` is used as a property name.
+
+Allow `async` as a shorthand object property.
+
+### New features
+
+Implement the [template literal revision proposal](https://github.com/tc39/proposal-template-literal-revision) for ES9.
+
+## 5.0.3 (2017-04-01)
+
+### Bug fixes
+
+Fix spurious duplicate variable definition errors for named functions.
+
+## 5.0.2 (2017-03-30)
+
+### Bug fixes
+
+A binary operator after a parenthesized arrow expression is no longer incorrectly treated as an error.
+
+## 5.0.0 (2017-03-28)
+
+### Bug fixes
+
+Raise an error for duplicated lexical bindings.
+
+Fix spurious error when an assignement expression occurred after a spread expression.
+
+Accept regular expressions after `of` (in `for`/`of`), `yield` (in a generator), and braced arrow functions.
+
+Allow labels in front or `var` declarations, even in strict mode.
+
+### Breaking changes
+
+Parse declarations following `export default` as declaration nodes, not expressions. This means that class and function declarations nodes can now have `null` as their `id`.
+
+## 4.0.11 (2017-02-07)
+
+### Bug fixes
+
+Allow all forms of member expressions to be parenthesized as lvalue.
+
+## 4.0.10 (2017-02-07)
+
+### Bug fixes
+
+Don't expect semicolons after default-exported functions or classes, even when they are expressions.
+
+Check for use of `'use strict'` directives in non-simple parameter functions, even when already in strict mode.
+
+## 4.0.9 (2017-02-06)
+
+### Bug fixes
+
+Fix incorrect error raised for parenthesized simple assignment targets, so that `(x) = 1` parses again.
+
+## 4.0.8 (2017-02-03)
+
+### Bug fixes
+
+Solve spurious parenthesized pattern errors by temporarily erring on the side of accepting programs that our delayed errors don't handle correctly yet.
+
+## 4.0.7 (2017-02-02)
+
+### Bug fixes
+
+Accept invalidly rejected code like `(x).y = 2` again.
+
+Don't raise an error when a function _inside_ strict code has a non-simple parameter list.
+
+## 4.0.6 (2017-02-02)
+
+### Bug fixes
+
+Fix exponential behavior (manifesting itself as a complete hang for even relatively small source files) introduced by the new 'use strict' check.
+
+## 4.0.5 (2017-02-02)
+
+### Bug fixes
+
+Disallow parenthesized pattern expressions.
+
+Allow keywords as export names.
+
+Don't allow the `async` keyword to be parenthesized.
+
+Properly raise an error when a keyword contains a character escape.
+
+Allow `"use strict"` to appear after other string literal expressions.
+
+Disallow labeled declarations.
+
+## 4.0.4 (2016-12-19)
+
+### Bug fixes
+
+Fix crash when `export` was followed by a keyword that can't be
+exported.
+
+## 4.0.3 (2016-08-16)
+
+### Bug fixes
+
+Allow regular function declarations inside single-statement `if` branches in loose mode. Forbid them entirely in strict mode.
+
+Properly parse properties named `async` in ES2017 mode.
+
+Fix bug where reserved words were broken in ES2017 mode.
+
+## 4.0.2 (2016-08-11)
+
+### Bug fixes
+
+Don't ignore period or 'e' characters after octal numbers.
+
+Fix broken parsing for call expressions in default parameter values of arrow functions.
+
+## 4.0.1 (2016-08-08)
+
+### Bug fixes
+
+Fix false positives in duplicated export name errors.
+
+## 4.0.0 (2016-08-07)
+
+### Breaking changes
+
+The default `ecmaVersion` option value is now 7.
+
+A number of internal method signatures changed, so plugins might need to be updated.
+
+### Bug fixes
+
+The parser now raises errors on duplicated export names.
+
+`arguments` and `eval` can now be used in shorthand properties.
+
+Duplicate parameter names in non-simple argument lists now always produce an error.
+
+### New features
+
+The `ecmaVersion` option now also accepts year-style version numbers
+(2015, etc).
+
+Support for `async`/`await` syntax when `ecmaVersion` is >= 8.
+
+Support for trailing commas in call expressions when `ecmaVersion` is >= 8.
+
+## 3.3.0 (2016-07-25)
+
+### Bug fixes
+
+Fix bug in tokenizing of regexp operator after a function declaration.
+
+Fix parser crash when parsing an array pattern with a hole.
+
+### New features
+
+Implement check against complex argument lists in functions that enable strict mode in ES7.
+
+## 3.2.0 (2016-06-07)
+
+### Bug fixes
+
+Improve handling of lack of unicode regexp support in host
+environment.
+
+Properly reject shorthand properties whose name is a keyword.
+
+### New features
+
+Visitors created with `visit.make` now have their base as _prototype_, rather than copying properties into a fresh object.
+
+## 3.1.0 (2016-04-18)
+
+### Bug fixes
+
+Properly tokenize the division operator directly after a function expression.
+
+Allow trailing comma in destructuring arrays.
+
+## 3.0.4 (2016-02-25)
+
+### Fixes
+
+Allow update expressions as left-hand-side of the ES7 exponential operator.
+
+## 3.0.2 (2016-02-10)
+
+### Fixes
+
+Fix bug that accidentally made `undefined` a reserved word when parsing ES7.
+
+## 3.0.0 (2016-02-10)
+
+### Breaking changes
+
+The default value of the `ecmaVersion` option is now 6 (used to be 5).
+
+Support for comprehension syntax (which was dropped from the draft spec) has been removed.
+
+### Fixes
+
+`let` and `yield` are now “contextual keywords”, meaning you can mostly use them as identifiers in ES5 non-strict code.
+
+A parenthesized class or function expression after `export default` is now parsed correctly.
+
+### New features
+
+When `ecmaVersion` is set to 7, Acorn will parse the exponentiation operator (`**`).
+
+The identifier character ranges are now based on Unicode 8.0.0.
+
+Plugins can now override the `raiseRecoverable` method to override the way non-critical errors are handled.
+
+## 2.7.0 (2016-01-04)
+
+### Fixes
+
+Stop allowing rest parameters in setters.
+
+Disallow `y` rexexp flag in ES5.
+
+Disallow `\00` and `\000` escapes in strict mode.
+
+Raise an error when an import name is a reserved word.
+
+## 2.6.2 (2015-11-10)
+
+### Fixes
+
+Don't crash when no options object is passed.
+
+## 2.6.0 (2015-11-09)
+
+### Fixes
+
+Add `await` as a reserved word in module sources.
+
+Disallow `yield` in a parameter default value for a generator.
+
+Forbid using a comma after a rest pattern in an array destructuring.
+
+### New features
+
+Support parsing stdin in command-line tool.
+
+## 2.5.0 (2015-10-27)
+
+### Fixes
+
+Fix tokenizer support in the command-line tool.
+
+Stop allowing `new.target` outside of functions.
+
+Remove legacy `guard` and `guardedHandler` properties from try nodes.
+
+Stop allowing multiple `__proto__` properties on an object literal in strict mode.
+
+Don't allow rest parameters to be non-identifier patterns.
+
+Check for duplicate paramter names in arrow functions.
diff --git a/node_modules/acorn/LICENSE b/node_modules/acorn/LICENSE
new file mode 100644
index 0000000..2c0632b
--- /dev/null
+++ b/node_modules/acorn/LICENSE
@@ -0,0 +1,19 @@
+Copyright (C) 2012-2018 by various contributors (see AUTHORS)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/acorn/README.md b/node_modules/acorn/README.md
new file mode 100644
index 0000000..9b7c0ba
--- /dev/null
+++ b/node_modules/acorn/README.md
@@ -0,0 +1,269 @@
+# Acorn
+
+A tiny, fast JavaScript parser written in JavaScript.
+
+## Community
+
+Acorn is open source software released under an
+[MIT license](https://github.com/acornjs/acorn/blob/master/acorn/LICENSE).
+
+You are welcome to
+[report bugs](https://github.com/acornjs/acorn/issues) or create pull
+requests on [github](https://github.com/acornjs/acorn). For questions
+and discussion, please use the
+[Tern discussion forum](https://discuss.ternjs.net).
+
+## Installation
+
+The easiest way to install acorn is from [`npm`](https://www.npmjs.com/):
+
+```sh
+npm install acorn
+```
+
+Alternately, you can download the source and build acorn yourself:
+
+```sh
+git clone https://github.com/acornjs/acorn.git
+cd acorn
+npm install
+```
+
+## Interface
+
+**parse**`(input, options)` is the main interface to the library. The
+`input` parameter is a string, `options` can be undefined or an object
+setting some of the options listed below. The return value will be an
+abstract syntax tree object as specified by the [ESTree
+spec](https://github.com/estree/estree).
+
+```javascript
+let acorn = require("acorn");
+console.log(acorn.parse("1 + 1"));
+```
+
+When encountering a syntax error, the parser will raise a
+`SyntaxError` object with a meaningful message. The error object will
+have a `pos` property that indicates the string offset at which the
+error occurred, and a `loc` object that contains a `{line, column}`
+object referring to that same position.
+
+Options can be provided by passing a second argument, which should be
+an object containing any of these fields:
+
+- **ecmaVersion**: Indicates the ECMAScript version to parse. Must be
+  either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018) or 10 (2019, partial
+  support). This influences support for strict mode, the set of
+  reserved words, and support for new syntax features. Default is 10.
+
+  **NOTE**: Only 'stage 4' (finalized) ECMAScript features are being
+  implemented by Acorn. Other proposed new features can be implemented
+  through plugins.
+
+- **sourceType**: Indicate the mode the code should be parsed in. Can be
+  either `"script"` or `"module"`. This influences global strict mode
+  and parsing of `import` and `export` declarations.
+
+  **NOTE**: If set to `"module"`, then static `import` / `export` syntax
+  will be valid, even if `ecmaVersion` is less than 6.
+
+- **onInsertedSemicolon**: If given a callback, that callback will be
+  called whenever a missing semicolon is inserted by the parser. The
+  callback will be given the character offset of the point where the
+  semicolon is inserted as argument, and if `locations` is on, also a
+  `{line, column}` object representing this position.
+
+- **onTrailingComma**: Like `onInsertedSemicolon`, but for trailing
+  commas.
+
+- **allowReserved**: If `false`, using a reserved word will generate
+  an error. Defaults to `true` for `ecmaVersion` 3, `false` for higher
+  versions. When given the value `"never"`, reserved words and
+  keywords can also not be used as property names (as in Internet
+  Explorer's old parser).
+
+- **allowReturnOutsideFunction**: By default, a return statement at
+  the top level raises an error. Set this to `true` to accept such
+  code.
+
+- **allowImportExportEverywhere**: By default, `import` and `export`
+  declarations can only appear at a program's top level. Setting this
+  option to `true` allows them anywhere where a statement is allowed.
+  
+- **allowAwaitOutsideFunction**: By default, `await` expressions can
+  only appear inside `async` functions. Setting this option to
+  `true` allows to have top-level `await` expressions. They are
+  still not allowed in non-`async` functions, though.
+
+- **allowHashBang**: When this is enabled (off by default), if the
+  code starts with the characters `#!` (as in a shellscript), the
+  first line will be treated as a comment.
+
+- **locations**: When `true`, each node has a `loc` object attached
+  with `start` and `end` subobjects, each of which contains the
+  one-based line and zero-based column numbers in `{line, column}`
+  form. Default is `false`.
+
+- **onToken**: If a function is passed for this option, each found
+  token will be passed in same format as tokens returned from
+  `tokenizer().getToken()`.
+
+  If array is passed, each found token is pushed to it.
+
+  Note that you are not allowed to call the parser from the
+  callback—that will corrupt its internal state.
+
+- **onComment**: If a function is passed for this option, whenever a
+  comment is encountered the function will be called with the
+  following parameters:
+
+  - `block`: `true` if the comment is a block comment, false if it
+    is a line comment.
+  - `text`: The content of the comment.
+  - `start`: Character offset of the start of the comment.
+  - `end`: Character offset of the end of the comment.
+
+  When the `locations` options is on, the `{line, column}` locations
+  of the comment’s start and end are passed as two additional
+  parameters.
+
+  If array is passed for this option, each found comment is pushed
+  to it as object in Esprima format:
+
+  ```javascript
+  {
+    "type": "Line" | "Block",
+    "value": "comment text",
+    "start": Number,
+    "end": Number,
+    // If `locations` option is on:
+    "loc": {
+      "start": {line: Number, column: Number}
+      "end": {line: Number, column: Number}
+    },
+    // If `ranges` option is on:
+    "range": [Number, Number]
+  }
+  ```
+
+  Note that you are not allowed to call the parser from the
+  callback—that will corrupt its internal state.
+
+- **ranges**: Nodes have their start and end characters offsets
+  recorded in `start` and `end` properties (directly on the node,
+  rather than the `loc` object, which holds line/column data. To also
+  add a
+  [semi-standardized](https://bugzilla.mozilla.org/show_bug.cgi?id=745678)
+  `range` property holding a `[start, end]` array with the same
+  numbers, set the `ranges` option to `true`.
+
+- **program**: It is possible to parse multiple files into a single
+  AST by passing the tree produced by parsing the first file as the
+  `program` option in subsequent parses. This will add the toplevel
+  forms of the parsed file to the "Program" (top) node of an existing
+  parse tree.
+
+- **sourceFile**: When the `locations` option is `true`, you can pass
+  this option to add a `source` attribute in every node’s `loc`
+  object. Note that the contents of this option are not examined or
+  processed in any way; you are free to use whatever format you
+  choose.
+
+- **directSourceFile**: Like `sourceFile`, but a `sourceFile` property
+  will be added (regardless of the `location` option) directly to the
+  nodes, rather than the `loc` object.
+
+- **preserveParens**: If this option is `true`, parenthesized expressions
+  are represented by (non-standard) `ParenthesizedExpression` nodes
+  that have a single `expression` property containing the expression
+  inside parentheses.
+
+**parseExpressionAt**`(input, offset, options)` will parse a single
+expression in a string, and return its AST. It will not complain if
+there is more of the string left after the expression.
+
+**tokenizer**`(input, options)` returns an object with a `getToken`
+method that can be called repeatedly to get the next token, a `{start,
+end, type, value}` object (with added `loc` property when the
+`locations` option is enabled and `range` property when the `ranges`
+option is enabled). When the token's type is `tokTypes.eof`, you
+should stop calling the method, since it will keep returning that same
+token forever.
+
+In ES6 environment, returned result can be used as any other
+protocol-compliant iterable:
+
+```javascript
+for (let token of acorn.tokenizer(str)) {
+  // iterate over the tokens
+}
+
+// transform code to array of tokens:
+var tokens = [...acorn.tokenizer(str)];
+```
+
+**tokTypes** holds an object mapping names to the token type objects
+that end up in the `type` properties of tokens.
+
+**getLineInfo**`(input, offset)` can be used to get a `{line,
+column}` object for a given program string and offset.
+
+### The `Parser` class
+
+Instances of the **`Parser`** class contain all the state and logic
+that drives a parse. It has static methods `parse`,
+`parseExpressionAt`, and `tokenizer` that match the top-level
+functions by the same name.
+
+When extending the parser with plugins, you need to call these methods
+on the extended version of the class. To extend a parser with plugins,
+you can use its static `extend` method.
+
+```javascript
+var acorn = require("acorn");
+var jsx = require("acorn-jsx");
+var JSXParser = acorn.Parser.extend(jsx());
+JSXParser.parse("foo(<bar/>)");
+```
+
+The `extend` method takes any number of plugin values, and returns a
+new `Parser` class that includes the extra parser logic provided by
+the plugins.
+
+## Command line interface
+
+The `bin/acorn` utility can be used to parse a file from the command
+line. It accepts as arguments its input file and the following
+options:
+
+- `--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|--ecma10`: Sets the ECMAScript version
+  to parse. Default is version 9.
+
+- `--module`: Sets the parsing mode to `"module"`. Is set to `"script"` otherwise.
+
+- `--locations`: Attaches a "loc" object to each node with "start" and
+  "end" subobjects, each of which contains the one-based line and
+  zero-based column numbers in `{line, column}` form.
+
+- `--allow-hash-bang`: If the code starts with the characters #! (as
+  in a shellscript), the first line will be treated as a comment.
+
+- `--compact`: No whitespace is used in the AST output.
+
+- `--silent`: Do not output the AST, just return the exit status.
+
+- `--help`: Print the usage information and quit.
+
+The utility spits out the syntax tree as JSON data.
+
+## Existing plugins
+
+ - [`acorn-jsx`](https://github.com/RReverser/acorn-jsx): Parse [Facebook JSX syntax extensions](https://github.com/facebook/jsx)
+ 
+Plugins for ECMAScript proposals:
+ 
+ - [`acorn-stage3`](https://github.com/acornjs/acorn-stage3): Parse most stage 3 proposals, bundling:
+   - [`acorn-class-fields`](https://github.com/acornjs/acorn-class-fields): Parse [class fields proposal](https://github.com/tc39/proposal-class-fields)
+   - [`acorn-import-meta`](https://github.com/acornjs/acorn-import-meta): Parse [import.meta proposal](https://github.com/tc39/proposal-import-meta)
+   - [`acorn-numeric-separator`](https://github.com/acornjs/acorn-numeric-separator): Parse [numeric separator proposal](https://github.com/tc39/proposal-numeric-separator)
+   - [`acorn-private-methods`](https://github.com/acornjs/acorn-private-methods): parse [private methods, getters and setters proposal](https://github.com/tc39/proposal-private-methods)n
diff --git a/node_modules/acorn/bin/acorn b/node_modules/acorn/bin/acorn
new file mode 100755
index 0000000..cf7df46
--- /dev/null
+++ b/node_modules/acorn/bin/acorn
@@ -0,0 +1,4 @@
+#!/usr/bin/env node
+'use strict';
+
+require('../dist/bin.js');
diff --git a/node_modules/acorn/dist/acorn.d.ts b/node_modules/acorn/dist/acorn.d.ts
new file mode 100644
index 0000000..c68e239
--- /dev/null
+++ b/node_modules/acorn/dist/acorn.d.ts
@@ -0,0 +1,209 @@
+export as namespace acorn
+export = acorn
+
+declare namespace acorn {
+  function parse(input: string, options?: Options): Node
+
+  function parseExpressionAt(input: string, pos?: number, options?: Options): Node
+
+  function tokenizer(input: string, options?: Options): {
+    getToken(): Token
+    [Symbol.iterator](): Iterator<Token>
+  }
+
+  interface Options {
+    ecmaVersion?: 3 | 5 | 6 | 7 | 8 | 9 | 10 | 2015 | 2016 | 2017 | 2018 | 2019
+    sourceType?: 'script' | 'module'
+    onInsertedSemicolon?: (lastTokEnd: number, lastTokEndLoc?: Position) => void
+    onTrailingComma?: (lastTokEnd: number, lastTokEndLoc?: Position) => void
+    allowReserved?: boolean | 'never'
+    allowReturnOutsideFunction?: boolean
+    allowImportExportEverywhere?: boolean
+    allowAwaitOutsideFunction?: boolean
+    allowHashBang?: boolean
+    locations?: boolean
+    onToken?: ((token: Token) => any) | Token[]
+    onComment?: ((
+      isBlock: boolean, text: string, start: number, end: number, startLoc?: Position,
+      endLoc?: Position
+    ) => void) | Comment[]
+    ranges?: boolean
+    program?: Node
+    sourceFile?: string
+    directSourceFile?: string
+    preserveParens?: boolean
+  }
+
+  class Parser {
+    constructor(options: Options, input: string, startPos?: number)
+    parse(this: Parser): Node
+    static parse(this: typeof Parser, input: string, options?: Options): Node
+    static parseExpressionAt(this: typeof Parser, input: string, pos: number, options?: Options): Node
+    static tokenizer(this: typeof Parser, input: string, options?: Options): {
+      getToken(): Token
+      [Symbol.iterator](): Iterator<Token>
+    }
+    static extend(this: typeof Parser, ...plugins: ((BaseParser: typeof Parser) => typeof Parser)[]): typeof Parser
+  }
+
+  interface Position { line: number; column: number; offset: number }
+
+  const defaultOptions: Options
+
+  function getLineInfo(input: string, offset: number): Position
+
+  class SourceLocation {
+    start: Position
+    end: Position
+    source?: string | null
+    constructor(p: Parser, start: Position, end: Position)
+  }
+
+  class Node {
+    type: string
+    start: number
+    end: number
+    loc?: SourceLocation
+    sourceFile?: string
+    range?: [number, number]
+    constructor(parser: Parser, pos: number, loc?: SourceLocation)
+  }
+
+  class TokenType {
+    label: string
+    keyword: string
+    beforeExpr: boolean
+    startsExpr: boolean
+    isLoop: boolean
+    isAssign: boolean
+    prefix: boolean
+    postfix: boolean
+    binop: number
+    updateContext?: (prevType: TokenType) => void
+    constructor(label: string, conf?: any)
+  }
+
+  const tokTypes: {
+    num: TokenType
+    regexp: TokenType
+    string: TokenType
+    name: TokenType
+    eof: TokenType
+    bracketL: TokenType
+    bracketR: TokenType
+    braceL: TokenType
+    braceR: TokenType
+    parenL: TokenType
+    parenR: TokenType
+    comma: TokenType
+    semi: TokenType
+    colon: TokenType
+    dot: TokenType
+    question: TokenType
+    arrow: TokenType
+    template: TokenType
+    ellipsis: TokenType
+    backQuote: TokenType
+    dollarBraceL: TokenType
+    eq: TokenType
+    assign: TokenType
+    incDec: TokenType
+    prefix: TokenType
+    logicalOR: TokenType
+    logicalAND: TokenType
+    bitwiseOR: TokenType
+    bitwiseXOR: TokenType
+    bitwiseAND: TokenType
+    equality: TokenType
+    relational: TokenType
+    bitShift: TokenType
+    plusMin: TokenType
+    modulo: TokenType
+    star: TokenType
+    slash: TokenType
+    starstar: TokenType
+    _break: TokenType
+    _case: TokenType
+    _catch: TokenType
+    _continue: TokenType
+    _debugger: TokenType
+    _default: TokenType
+    _do: TokenType
+    _else: TokenType
+    _finally: TokenType
+    _for: TokenType
+    _function: TokenType
+    _if: TokenType
+    _return: TokenType
+    _switch: TokenType
+    _throw: TokenType
+    _try: TokenType
+    _var: TokenType
+    _const: TokenType
+    _while: TokenType
+    _with: TokenType
+    _new: TokenType
+    _this: TokenType
+    _super: TokenType
+    _class: TokenType
+    _extends: TokenType
+    _export: TokenType
+    _import: TokenType
+    _null: TokenType
+    _true: TokenType
+    _false: TokenType
+    _in: TokenType
+    _instanceof: TokenType
+    _typeof: TokenType
+    _void: TokenType
+    _delete: TokenType
+  }
+
+  class TokContext {
+    constructor(token: string, isExpr: boolean, preserveSpace: boolean, override?: (p: Parser) => void)
+  }
+
+  const tokContexts: {
+    b_stat: TokContext
+    b_expr: TokContext
+    b_tmpl: TokContext
+    p_stat: TokContext
+    p_expr: TokContext
+    q_tmpl: TokContext
+    f_expr: TokContext
+  }
+
+  function isIdentifierStart(code: number, astral?: boolean): boolean
+
+  function isIdentifierChar(code: number, astral?: boolean): boolean
+
+  interface AbstractToken {
+  }
+
+  interface Comment extends AbstractToken {
+    type: string
+    value: string
+    start: number
+    end: number
+    loc?: SourceLocation
+    range?: [number, number]
+  }
+
+  class Token {
+    type: TokenType
+    value: any
+    start: number
+    end: number
+    loc?: SourceLocation
+    range?: [number, number]
+    constructor(p: Parser)
+  }
+
+  function isNewLine(code: number): boolean
+
+  const lineBreak: RegExp
+
+  const lineBreakG: RegExp
+
+  const version: string
+}
diff --git a/node_modules/acorn/dist/acorn.js b/node_modules/acorn/dist/acorn.js
new file mode 100644
index 0000000..e4d9e76
--- /dev/null
+++ b/node_modules/acorn/dist/acorn.js
@@ -0,0 +1,4979 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = global || self, factory(global.acorn = {}));
+}(this, function (exports) { 'use strict';
+
+  // Reserved word lists for various dialects of the language
+
+  var reservedWords = {
+    3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",
+    5: "class enum extends super const export import",
+    6: "enum",
+    strict: "implements interface let package private protected public static yield",
+    strictBind: "eval arguments"
+  };
+
+  // And the keywords
+
+  var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+  var keywords = {
+    5: ecma5AndLessKeywords,
+    "5module": ecma5AndLessKeywords + " export import",
+    6: ecma5AndLessKeywords + " const class extends export import super"
+  };
+
+  var keywordRelationalOperator = /^in(stanceof)?$/;
+
+  // ## Character categories
+
+  // Big ugly regular expressions that match characters in the
+  // whitespace, identifier, and identifier-start categories. These
+  // are only applied when a character is found to actually have a
+  // code point above 128.
+  // Generated by `bin/generate-identifier-regex.js`.
+  var nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u08a0-\u08b4\u08b6-\u08bd\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\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\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fef\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7bf\ua7c2-\ua7c6\ua7f7-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab67\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
+  var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08d3-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1df9\u1dfb-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+
+  var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+  var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+  nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+  // These are a run-length and offset encoded representation of the
+  // >0xffff code points that are a valid part of identifiers. The
+  // offset starts at 0x10000, and each pair of numbers represents an
+  // offset to the next range, and then a size of the range. They were
+  // generated by bin/generate-identifier-regex.js
+
+  // eslint-disable-next-line comma-spacing
+  var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,155,22,13,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,0,33,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,0,161,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,754,9486,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541];
+
+  // eslint-disable-next-line comma-spacing
+  var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,232,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,792487,239];
+
+  // This has a complexity linear to the value of the code. The
+  // assumption is that looking up astral identifier characters is
+  // rare.
+  function isInAstralSet(code, set) {
+    var pos = 0x10000;
+    for (var i = 0; i < set.length; i += 2) {
+      pos += set[i];
+      if (pos > code) { return false }
+      pos += set[i + 1];
+      if (pos >= code) { return true }
+    }
+  }
+
+  // Test whether a given character code starts an identifier.
+
+  function isIdentifierStart(code, astral) {
+    if (code < 65) { return code === 36 }
+    if (code < 91) { return true }
+    if (code < 97) { return code === 95 }
+    if (code < 123) { return true }
+    if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
+    if (astral === false) { return false }
+    return isInAstralSet(code, astralIdentifierStartCodes)
+  }
+
+  // Test whether a given character is part of an identifier.
+
+  function isIdentifierChar(code, astral) {
+    if (code < 48) { return code === 36 }
+    if (code < 58) { return true }
+    if (code < 65) { return false }
+    if (code < 91) { return true }
+    if (code < 97) { return code === 95 }
+    if (code < 123) { return true }
+    if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }
+    if (astral === false) { return false }
+    return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)
+  }
+
+  // ## Token types
+
+  // The assignment of fine-grained, information-carrying type objects
+  // allows the tokenizer to store the information it has about a
+  // token in a way that is very cheap for the parser to look up.
+
+  // All token type variables start with an underscore, to make them
+  // easy to recognize.
+
+  // The `beforeExpr` property is used to disambiguate between regular
+  // expressions and divisions. It is set on all token types that can
+  // be followed by an expression (thus, a slash after them would be a
+  // regular expression).
+  //
+  // The `startsExpr` property is used to check if the token ends a
+  // `yield` expression. It is set on all token types that either can
+  // directly start an expression (like a quotation mark) or can
+  // continue an expression (like the body of a string).
+  //
+  // `isLoop` marks a keyword as starting a loop, which is important
+  // to know when parsing a label, in order to allow or disallow
+  // continue jumps to that label.
+
+  var TokenType = function TokenType(label, conf) {
+    if ( conf === void 0 ) conf = {};
+
+    this.label = label;
+    this.keyword = conf.keyword;
+    this.beforeExpr = !!conf.beforeExpr;
+    this.startsExpr = !!conf.startsExpr;
+    this.isLoop = !!conf.isLoop;
+    this.isAssign = !!conf.isAssign;
+    this.prefix = !!conf.prefix;
+    this.postfix = !!conf.postfix;
+    this.binop = conf.binop || null;
+    this.updateContext = null;
+  };
+
+  function binop(name, prec) {
+    return new TokenType(name, {beforeExpr: true, binop: prec})
+  }
+  var beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};
+
+  // Map keyword names to token types.
+
+  var keywords$1 = {};
+
+  // Succinct definitions of keyword token types
+  function kw(name, options) {
+    if ( options === void 0 ) options = {};
+
+    options.keyword = name;
+    return keywords$1[name] = new TokenType(name, options)
+  }
+
+  var types = {
+    num: new TokenType("num", startsExpr),
+    regexp: new TokenType("regexp", startsExpr),
+    string: new TokenType("string", startsExpr),
+    name: new TokenType("name", startsExpr),
+    eof: new TokenType("eof"),
+
+    // Punctuation token types.
+    bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}),
+    bracketR: new TokenType("]"),
+    braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}),
+    braceR: new TokenType("}"),
+    parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}),
+    parenR: new TokenType(")"),
+    comma: new TokenType(",", beforeExpr),
+    semi: new TokenType(";", beforeExpr),
+    colon: new TokenType(":", beforeExpr),
+    dot: new TokenType("."),
+    question: new TokenType("?", beforeExpr),
+    arrow: new TokenType("=>", beforeExpr),
+    template: new TokenType("template"),
+    invalidTemplate: new TokenType("invalidTemplate"),
+    ellipsis: new TokenType("...", beforeExpr),
+    backQuote: new TokenType("`", startsExpr),
+    dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}),
+
+    // Operators. These carry several kinds of properties to help the
+    // parser use them properly (the presence of these properties is
+    // what categorizes them as operators).
+    //
+    // `binop`, when present, specifies that this operator is a binary
+    // operator, and will refer to its precedence.
+    //
+    // `prefix` and `postfix` mark the operator as a prefix or postfix
+    // unary operator.
+    //
+    // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+    // binary operators with a very low precedence, that should result
+    // in AssignmentExpression nodes.
+
+    eq: new TokenType("=", {beforeExpr: true, isAssign: true}),
+    assign: new TokenType("_=", {beforeExpr: true, isAssign: true}),
+    incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}),
+    prefix: new TokenType("!/~", {beforeExpr: true, prefix: true, startsExpr: true}),
+    logicalOR: binop("||", 1),
+    logicalAND: binop("&&", 2),
+    bitwiseOR: binop("|", 3),
+    bitwiseXOR: binop("^", 4),
+    bitwiseAND: binop("&", 5),
+    equality: binop("==/!=/===/!==", 6),
+    relational: binop("</>/<=/>=", 7),
+    bitShift: binop("<</>>/>>>", 8),
+    plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),
+    modulo: binop("%", 10),
+    star: binop("*", 10),
+    slash: binop("/", 10),
+    starstar: new TokenType("**", {beforeExpr: true}),
+
+    // Keyword token types.
+    _break: kw("break"),
+    _case: kw("case", beforeExpr),
+    _catch: kw("catch"),
+    _continue: kw("continue"),
+    _debugger: kw("debugger"),
+    _default: kw("default", beforeExpr),
+    _do: kw("do", {isLoop: true, beforeExpr: true}),
+    _else: kw("else", beforeExpr),
+    _finally: kw("finally"),
+    _for: kw("for", {isLoop: true}),
+    _function: kw("function", startsExpr),
+    _if: kw("if"),
+    _return: kw("return", beforeExpr),
+    _switch: kw("switch"),
+    _throw: kw("throw", beforeExpr),
+    _try: kw("try"),
+    _var: kw("var"),
+    _const: kw("const"),
+    _while: kw("while", {isLoop: true}),
+    _with: kw("with"),
+    _new: kw("new", {beforeExpr: true, startsExpr: true}),
+    _this: kw("this", startsExpr),
+    _super: kw("super", startsExpr),
+    _class: kw("class", startsExpr),
+    _extends: kw("extends", beforeExpr),
+    _export: kw("export"),
+    _import: kw("import", startsExpr),
+    _null: kw("null", startsExpr),
+    _true: kw("true", startsExpr),
+    _false: kw("false", startsExpr),
+    _in: kw("in", {beforeExpr: true, binop: 7}),
+    _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}),
+    _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}),
+    _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}),
+    _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true})
+  };
+
+  // Matches a whole line break (where CRLF is considered a single
+  // line break). Used to count lines.
+
+  var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+  var lineBreakG = new RegExp(lineBreak.source, "g");
+
+  function isNewLine(code, ecma2019String) {
+    return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))
+  }
+
+  var nonASCIIwhitespace = /[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+  var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+
+  var ref = Object.prototype;
+  var hasOwnProperty = ref.hasOwnProperty;
+  var toString = ref.toString;
+
+  // Checks if an object has a property.
+
+  function has(obj, propName) {
+    return hasOwnProperty.call(obj, propName)
+  }
+
+  var isArray = Array.isArray || (function (obj) { return (
+    toString.call(obj) === "[object Array]"
+  ); });
+
+  function wordsRegexp(words) {
+    return new RegExp("^(?:" + words.replace(/ /g, "|") + ")$")
+  }
+
+  // These are used when `options.locations` is on, for the
+  // `startLoc` and `endLoc` properties.
+
+  var Position = function Position(line, col) {
+    this.line = line;
+    this.column = col;
+  };
+
+  Position.prototype.offset = function offset (n) {
+    return new Position(this.line, this.column + n)
+  };
+
+  var SourceLocation = function SourceLocation(p, start, end) {
+    this.start = start;
+    this.end = end;
+    if (p.sourceFile !== null) { this.source = p.sourceFile; }
+  };
+
+  // The `getLineInfo` function is mostly useful when the
+  // `locations` option is off (for performance reasons) and you
+  // want to find the line/column position for a given character
+  // offset. `input` should be the code string that the offset refers
+  // into.
+
+  function getLineInfo(input, offset) {
+    for (var line = 1, cur = 0;;) {
+      lineBreakG.lastIndex = cur;
+      var match = lineBreakG.exec(input);
+      if (match && match.index < offset) {
+        ++line;
+        cur = match.index + match[0].length;
+      } else {
+        return new Position(line, offset - cur)
+      }
+    }
+  }
+
+  // A second optional argument can be given to further configure
+  // the parser process. These options are recognized:
+
+  var defaultOptions = {
+    // `ecmaVersion` indicates the ECMAScript version to parse. Must be
+    // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10
+    // (2019). This influences support for strict mode, the set of
+    // reserved words, and support for new syntax features. The default
+    // is 10.
+    ecmaVersion: 10,
+    // `sourceType` indicates the mode the code should be parsed in.
+    // Can be either `"script"` or `"module"`. This influences global
+    // strict mode and parsing of `import` and `export` declarations.
+    sourceType: "script",
+    // `onInsertedSemicolon` can be a callback that will be called
+    // when a semicolon is automatically inserted. It will be passed
+    // the position of the comma as an offset, and if `locations` is
+    // enabled, it is given the location as a `{line, column}` object
+    // as second argument.
+    onInsertedSemicolon: null,
+    // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+    // trailing commas.
+    onTrailingComma: null,
+    // By default, reserved words are only enforced if ecmaVersion >= 5.
+    // Set `allowReserved` to a boolean value to explicitly turn this on
+    // an off. When this option has the value "never", reserved words
+    // and keywords can also not be used as property names.
+    allowReserved: null,
+    // When enabled, a return at the top level is not considered an
+    // error.
+    allowReturnOutsideFunction: false,
+    // When enabled, import/export statements are not constrained to
+    // appearing at the top of the program.
+    allowImportExportEverywhere: false,
+    // When enabled, await identifiers are allowed to appear at the top-level scope,
+    // but they are still not allowed in non-async functions.
+    allowAwaitOutsideFunction: false,
+    // When enabled, hashbang directive in the beginning of file
+    // is allowed and treated as a line comment.
+    allowHashBang: false,
+    // When `locations` is on, `loc` properties holding objects with
+    // `start` and `end` properties in `{line, column}` form (with
+    // line being 1-based and column 0-based) will be attached to the
+    // nodes.
+    locations: false,
+    // A function can be passed as `onToken` option, which will
+    // cause Acorn to call that function with object in the same
+    // format as tokens returned from `tokenizer().getToken()`. Note
+    // that you are not allowed to call the parser from the
+    // callback—that will corrupt its internal state.
+    onToken: null,
+    // A function can be passed as `onComment` option, which will
+    // cause Acorn to call that function with `(block, text, start,
+    // end)` parameters whenever a comment is skipped. `block` is a
+    // boolean indicating whether this is a block (`/* */`) comment,
+    // `text` is the content of the comment, and `start` and `end` are
+    // character offsets that denote the start and end of the comment.
+    // When the `locations` option is on, two more parameters are
+    // passed, the full `{line, column}` locations of the start and
+    // end of the comments. Note that you are not allowed to call the
+    // parser from the callback—that will corrupt its internal state.
+    onComment: null,
+    // Nodes have their start and end characters offsets recorded in
+    // `start` and `end` properties (directly on the node, rather than
+    // the `loc` object, which holds line/column data. To also add a
+    // [semi-standardized][range] `range` property holding a `[start,
+    // end]` array with the same numbers, set the `ranges` option to
+    // `true`.
+    //
+    // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+    ranges: false,
+    // It is possible to parse multiple files into a single AST by
+    // passing the tree produced by parsing the first file as
+    // `program` option in subsequent parses. This will add the
+    // toplevel forms of the parsed file to the `Program` (top) node
+    // of an existing parse tree.
+    program: null,
+    // When `locations` is on, you can pass this to record the source
+    // file in every node's `loc` object.
+    sourceFile: null,
+    // This value, if given, is stored in every node, whether
+    // `locations` is on or off.
+    directSourceFile: null,
+    // When enabled, parenthesized expressions are represented by
+    // (non-standard) ParenthesizedExpression nodes
+    preserveParens: false
+  };
+
+  // Interpret and default an options object
+
+  function getOptions(opts) {
+    var options = {};
+
+    for (var opt in defaultOptions)
+      { options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]; }
+
+    if (options.ecmaVersion >= 2015)
+      { options.ecmaVersion -= 2009; }
+
+    if (options.allowReserved == null)
+      { options.allowReserved = options.ecmaVersion < 5; }
+
+    if (isArray(options.onToken)) {
+      var tokens = options.onToken;
+      options.onToken = function (token) { return tokens.push(token); };
+    }
+    if (isArray(options.onComment))
+      { options.onComment = pushComment(options, options.onComment); }
+
+    return options
+  }
+
+  function pushComment(options, array) {
+    return function(block, text, start, end, startLoc, endLoc) {
+      var comment = {
+        type: block ? "Block" : "Line",
+        value: text,
+        start: start,
+        end: end
+      };
+      if (options.locations)
+        { comment.loc = new SourceLocation(this, startLoc, endLoc); }
+      if (options.ranges)
+        { comment.range = [start, end]; }
+      array.push(comment);
+    }
+  }
+
+  // Each scope gets a bitset that may contain these flags
+  var
+      SCOPE_TOP = 1,
+      SCOPE_FUNCTION = 2,
+      SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,
+      SCOPE_ASYNC = 4,
+      SCOPE_GENERATOR = 8,
+      SCOPE_ARROW = 16,
+      SCOPE_SIMPLE_CATCH = 32,
+      SCOPE_SUPER = 64,
+      SCOPE_DIRECT_SUPER = 128;
+
+  function functionFlags(async, generator) {
+    return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)
+  }
+
+  // Used in checkLVal and declareName to determine the type of a binding
+  var
+      BIND_NONE = 0, // Not a binding
+      BIND_VAR = 1, // Var-style binding
+      BIND_LEXICAL = 2, // Let- or const-style binding
+      BIND_FUNCTION = 3, // Function declaration
+      BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding
+      BIND_OUTSIDE = 5; // Special case for function names as bound inside the function
+
+  var Parser = function Parser(options, input, startPos) {
+    this.options = options = getOptions(options);
+    this.sourceFile = options.sourceFile;
+    this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : options.sourceType === "module" ? "5module" : 5]);
+    var reserved = "";
+    if (options.allowReserved !== true) {
+      for (var v = options.ecmaVersion;; v--)
+        { if (reserved = reservedWords[v]) { break } }
+      if (options.sourceType === "module") { reserved += " await"; }
+    }
+    this.reservedWords = wordsRegexp(reserved);
+    var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict;
+    this.reservedWordsStrict = wordsRegexp(reservedStrict);
+    this.reservedWordsStrictBind = wordsRegexp(reservedStrict + " " + reservedWords.strictBind);
+    this.input = String(input);
+
+    // Used to signal to callers of `readWord1` whether the word
+    // contained any escape sequences. This is needed because words with
+    // escape sequences must not be interpreted as keywords.
+    this.containsEsc = false;
+
+    // Set up token state
+
+    // The current position of the tokenizer in the input.
+    if (startPos) {
+      this.pos = startPos;
+      this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1;
+      this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;
+    } else {
+      this.pos = this.lineStart = 0;
+      this.curLine = 1;
+    }
+
+    // Properties of the current token:
+    // Its type
+    this.type = types.eof;
+    // For tokens that include more information than their type, the value
+    this.value = null;
+    // Its start and end offset
+    this.start = this.end = this.pos;
+    // And, if locations are used, the {line, column} object
+    // corresponding to those offsets
+    this.startLoc = this.endLoc = this.curPosition();
+
+    // Position information for the previous token
+    this.lastTokEndLoc = this.lastTokStartLoc = null;
+    this.lastTokStart = this.lastTokEnd = this.pos;
+
+    // The context stack is used to superficially track syntactic
+    // context to predict whether a regular expression is allowed in a
+    // given position.
+    this.context = this.initialContext();
+    this.exprAllowed = true;
+
+    // Figure out if it's a module code.
+    this.inModule = options.sourceType === "module";
+    this.strict = this.inModule || this.strictDirective(this.pos);
+
+    // Used to signify the start of a potential arrow function
+    this.potentialArrowAt = -1;
+
+    // Positions to delayed-check that yield/await does not exist in default parameters.
+    this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;
+    // Labels in scope.
+    this.labels = [];
+    // Thus-far undefined exports.
+    this.undefinedExports = {};
+
+    // If enabled, skip leading hashbang line.
+    if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!")
+      { this.skipLineComment(2); }
+
+    // Scope tracking for duplicate variable names (see scope.js)
+    this.scopeStack = [];
+    this.enterScope(SCOPE_TOP);
+
+    // For RegExp validation
+    this.regexpState = null;
+  };
+
+  var prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true } };
+
+  Parser.prototype.parse = function parse () {
+    var node = this.options.program || this.startNode();
+    this.nextToken();
+    return this.parseTopLevel(node)
+  };
+
+  prototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };
+  prototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };
+  prototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };
+  prototypeAccessors.allowSuper.get = function () { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 };
+  prototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };
+  prototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };
+
+  // Switch to a getter for 7.0.0.
+  Parser.prototype.inNonArrowFunction = function inNonArrowFunction () { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 };
+
+  Parser.extend = function extend () {
+      var plugins = [], len = arguments.length;
+      while ( len-- ) plugins[ len ] = arguments[ len ];
+
+    var cls = this;
+    for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }
+    return cls
+  };
+
+  Parser.parse = function parse (input, options) {
+    return new this(options, input).parse()
+  };
+
+  Parser.parseExpressionAt = function parseExpressionAt (input, pos, options) {
+    var parser = new this(options, input, pos);
+    parser.nextToken();
+    return parser.parseExpression()
+  };
+
+  Parser.tokenizer = function tokenizer (input, options) {
+    return new this(options, input)
+  };
+
+  Object.defineProperties( Parser.prototype, prototypeAccessors );
+
+  var pp = Parser.prototype;
+
+  // ## Parser utilities
+
+  var literal = /^(?:'((?:\\.|[^'])*?)'|"((?:\\.|[^"])*?)")/;
+  pp.strictDirective = function(start) {
+    for (;;) {
+      // Try to find string literal.
+      skipWhiteSpace.lastIndex = start;
+      start += skipWhiteSpace.exec(this.input)[0].length;
+      var match = literal.exec(this.input.slice(start));
+      if (!match) { return false }
+      if ((match[1] || match[2]) === "use strict") { return true }
+      start += match[0].length;
+
+      // Skip semicolon, if any.
+      skipWhiteSpace.lastIndex = start;
+      start += skipWhiteSpace.exec(this.input)[0].length;
+      if (this.input[start] === ";")
+        { start++; }
+    }
+  };
+
+  // Predicate that tests whether the next token is of the given
+  // type, and if yes, consumes it as a side effect.
+
+  pp.eat = function(type) {
+    if (this.type === type) {
+      this.next();
+      return true
+    } else {
+      return false
+    }
+  };
+
+  // Tests whether parsed token is a contextual keyword.
+
+  pp.isContextual = function(name) {
+    return this.type === types.name && this.value === name && !this.containsEsc
+  };
+
+  // Consumes contextual keyword if possible.
+
+  pp.eatContextual = function(name) {
+    if (!this.isContextual(name)) { return false }
+    this.next();
+    return true
+  };
+
+  // Asserts that following token is given contextual keyword.
+
+  pp.expectContextual = function(name) {
+    if (!this.eatContextual(name)) { this.unexpected(); }
+  };
+
+  // Test whether a semicolon can be inserted at the current position.
+
+  pp.canInsertSemicolon = function() {
+    return this.type === types.eof ||
+      this.type === types.braceR ||
+      lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+  };
+
+  pp.insertSemicolon = function() {
+    if (this.canInsertSemicolon()) {
+      if (this.options.onInsertedSemicolon)
+        { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }
+      return true
+    }
+  };
+
+  // Consume a semicolon, or, failing that, see if we are allowed to
+  // pretend that there is a semicolon at this position.
+
+  pp.semicolon = function() {
+    if (!this.eat(types.semi) && !this.insertSemicolon()) { this.unexpected(); }
+  };
+
+  pp.afterTrailingComma = function(tokType, notNext) {
+    if (this.type === tokType) {
+      if (this.options.onTrailingComma)
+        { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }
+      if (!notNext)
+        { this.next(); }
+      return true
+    }
+  };
+
+  // Expect a token of a given type. If found, consume it, otherwise,
+  // raise an unexpected token error.
+
+  pp.expect = function(type) {
+    this.eat(type) || this.unexpected();
+  };
+
+  // Raise an unexpected token error.
+
+  pp.unexpected = function(pos) {
+    this.raise(pos != null ? pos : this.start, "Unexpected token");
+  };
+
+  function DestructuringErrors() {
+    this.shorthandAssign =
+    this.trailingComma =
+    this.parenthesizedAssign =
+    this.parenthesizedBind =
+    this.doubleProto =
+      -1;
+  }
+
+  pp.checkPatternErrors = function(refDestructuringErrors, isAssign) {
+    if (!refDestructuringErrors) { return }
+    if (refDestructuringErrors.trailingComma > -1)
+      { this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element"); }
+    var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;
+    if (parens > -1) { this.raiseRecoverable(parens, "Parenthesized pattern"); }
+  };
+
+  pp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {
+    if (!refDestructuringErrors) { return false }
+    var shorthandAssign = refDestructuringErrors.shorthandAssign;
+    var doubleProto = refDestructuringErrors.doubleProto;
+    if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }
+    if (shorthandAssign >= 0)
+      { this.raise(shorthandAssign, "Shorthand property assignments are valid only in destructuring patterns"); }
+    if (doubleProto >= 0)
+      { this.raiseRecoverable(doubleProto, "Redefinition of __proto__ property"); }
+  };
+
+  pp.checkYieldAwaitInDefaultParams = function() {
+    if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))
+      { this.raise(this.yieldPos, "Yield expression cannot be a default value"); }
+    if (this.awaitPos)
+      { this.raise(this.awaitPos, "Await expression cannot be a default value"); }
+  };
+
+  pp.isSimpleAssignTarget = function(expr) {
+    if (expr.type === "ParenthesizedExpression")
+      { return this.isSimpleAssignTarget(expr.expression) }
+    return expr.type === "Identifier" || expr.type === "MemberExpression"
+  };
+
+  var pp$1 = Parser.prototype;
+
+  // ### Statement parsing
+
+  // Parse a program. Initializes the parser, reads any number of
+  // statements, and wraps them in a Program node.  Optionally takes a
+  // `program` argument.  If present, the statements will be appended
+  // to its body instead of creating a new node.
+
+  pp$1.parseTopLevel = function(node) {
+    var exports = {};
+    if (!node.body) { node.body = []; }
+    while (this.type !== types.eof) {
+      var stmt = this.parseStatement(null, true, exports);
+      node.body.push(stmt);
+    }
+    if (this.inModule)
+      { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)
+        {
+          var name = list[i];
+
+          this.raiseRecoverable(this.undefinedExports[name].start, ("Export '" + name + "' is not defined"));
+        } }
+    this.adaptDirectivePrologue(node.body);
+    this.next();
+    node.sourceType = this.options.sourceType;
+    return this.finishNode(node, "Program")
+  };
+
+  var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+
+  pp$1.isLet = function(context) {
+    if (this.options.ecmaVersion < 6 || !this.isContextual("let")) { return false }
+    skipWhiteSpace.lastIndex = this.pos;
+    var skip = skipWhiteSpace.exec(this.input);
+    var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+    // For ambiguous cases, determine if a LexicalDeclaration (or only a
+    // Statement) is allowed here. If context is not empty then only a Statement
+    // is allowed. However, `let [` is an explicit negative lookahead for
+    // ExpressionStatement, so special-case it first.
+    if (nextCh === 91) { return true } // '['
+    if (context) { return false }
+
+    if (nextCh === 123) { return true } // '{'
+    if (isIdentifierStart(nextCh, true)) {
+      var pos = next + 1;
+      while (isIdentifierChar(this.input.charCodeAt(pos), true)) { ++pos; }
+      var ident = this.input.slice(next, pos);
+      if (!keywordRelationalOperator.test(ident)) { return true }
+    }
+    return false
+  };
+
+  // check 'async [no LineTerminator here] function'
+  // - 'async /*foo*/ function' is OK.
+  // - 'async /*\n*/ function' is invalid.
+  pp$1.isAsyncFunction = function() {
+    if (this.options.ecmaVersion < 8 || !this.isContextual("async"))
+      { return false }
+
+    skipWhiteSpace.lastIndex = this.pos;
+    var skip = skipWhiteSpace.exec(this.input);
+    var next = this.pos + skip[0].length;
+    return !lineBreak.test(this.input.slice(this.pos, next)) &&
+      this.input.slice(next, next + 8) === "function" &&
+      (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))
+  };
+
+  // Parse a single statement.
+  //
+  // If expecting a statement and finding a slash operator, parse a
+  // regular expression literal. This is to handle cases like
+  // `if (foo) /blah/.exec(foo)`, where looking at the previous token
+  // does not help.
+
+  pp$1.parseStatement = function(context, topLevel, exports) {
+    var starttype = this.type, node = this.startNode(), kind;
+
+    if (this.isLet(context)) {
+      starttype = types._var;
+      kind = "let";
+    }
+
+    // Most types of statements are recognized by the keyword they
+    // start with. Many are trivial to parse, some require a bit of
+    // complexity.
+
+    switch (starttype) {
+    case types._break: case types._continue: return this.parseBreakContinueStatement(node, starttype.keyword)
+    case types._debugger: return this.parseDebuggerStatement(node)
+    case types._do: return this.parseDoStatement(node)
+    case types._for: return this.parseForStatement(node)
+    case types._function:
+      // Function as sole body of either an if statement or a labeled statement
+      // works, but not when it is part of a labeled statement that is the sole
+      // body of an if statement.
+      if ((context && (this.strict || context !== "if" && context !== "label")) && this.options.ecmaVersion >= 6) { this.unexpected(); }
+      return this.parseFunctionStatement(node, false, !context)
+    case types._class:
+      if (context) { this.unexpected(); }
+      return this.parseClass(node, true)
+    case types._if: return this.parseIfStatement(node)
+    case types._return: return this.parseReturnStatement(node)
+    case types._switch: return this.parseSwitchStatement(node)
+    case types._throw: return this.parseThrowStatement(node)
+    case types._try: return this.parseTryStatement(node)
+    case types._const: case types._var:
+      kind = kind || this.value;
+      if (context && kind !== "var") { this.unexpected(); }
+      return this.parseVarStatement(node, kind)
+    case types._while: return this.parseWhileStatement(node)
+    case types._with: return this.parseWithStatement(node)
+    case types.braceL: return this.parseBlock(true, node)
+    case types.semi: return this.parseEmptyStatement(node)
+    case types._export:
+    case types._import:
+      if (this.options.ecmaVersion > 10 && starttype === types._import) {
+        skipWhiteSpace.lastIndex = this.pos;
+        var skip = skipWhiteSpace.exec(this.input);
+        var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+        if (nextCh === 40) // '('
+          { return this.parseExpressionStatement(node, this.parseExpression()) }
+      }
+
+      if (!this.options.allowImportExportEverywhere) {
+        if (!topLevel)
+          { this.raise(this.start, "'import' and 'export' may only appear at the top level"); }
+        if (!this.inModule)
+          { this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'"); }
+      }
+      return starttype === types._import ? this.parseImport(node) : this.parseExport(node, exports)
+
+      // If the statement does not start with a statement keyword or a
+      // brace, it's an ExpressionStatement or LabeledStatement. We
+      // simply start parsing an expression, and afterwards, if the
+      // next token is a colon and the expression was a simple
+      // Identifier node, we switch to interpreting it as a label.
+    default:
+      if (this.isAsyncFunction()) {
+        if (context) { this.unexpected(); }
+        this.next();
+        return this.parseFunctionStatement(node, true, !context)
+      }
+
+      var maybeName = this.value, expr = this.parseExpression();
+      if (starttype === types.name && expr.type === "Identifier" && this.eat(types.colon))
+        { return this.parseLabeledStatement(node, maybeName, expr, context) }
+      else { return this.parseExpressionStatement(node, expr) }
+    }
+  };
+
+  pp$1.parseBreakContinueStatement = function(node, keyword) {
+    var isBreak = keyword === "break";
+    this.next();
+    if (this.eat(types.semi) || this.insertSemicolon()) { node.label = null; }
+    else if (this.type !== types.name) { this.unexpected(); }
+    else {
+      node.label = this.parseIdent();
+      this.semicolon();
+    }
+
+    // Verify that there is an actual destination to break or
+    // continue to.
+    var i = 0;
+    for (; i < this.labels.length; ++i) {
+      var lab = this.labels[i];
+      if (node.label == null || lab.name === node.label.name) {
+        if (lab.kind != null && (isBreak || lab.kind === "loop")) { break }
+        if (node.label && isBreak) { break }
+      }
+    }
+    if (i === this.labels.length) { this.raise(node.start, "Unsyntactic " + keyword); }
+    return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement")
+  };
+
+  pp$1.parseDebuggerStatement = function(node) {
+    this.next();
+    this.semicolon();
+    return this.finishNode(node, "DebuggerStatement")
+  };
+
+  pp$1.parseDoStatement = function(node) {
+    this.next();
+    this.labels.push(loopLabel);
+    node.body = this.parseStatement("do");
+    this.labels.pop();
+    this.expect(types._while);
+    node.test = this.parseParenExpression();
+    if (this.options.ecmaVersion >= 6)
+      { this.eat(types.semi); }
+    else
+      { this.semicolon(); }
+    return this.finishNode(node, "DoWhileStatement")
+  };
+
+  // Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+  // loop is non-trivial. Basically, we have to parse the init `var`
+  // statement or expression, disallowing the `in` operator (see
+  // the second parameter to `parseExpression`), and then check
+  // whether the next token is `in` or `of`. When there is no init
+  // part (semicolon immediately after the opening parenthesis), it
+  // is a regular `for` loop.
+
+  pp$1.parseForStatement = function(node) {
+    this.next();
+    var awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual("await")) ? this.lastTokStart : -1;
+    this.labels.push(loopLabel);
+    this.enterScope(0);
+    this.expect(types.parenL);
+    if (this.type === types.semi) {
+      if (awaitAt > -1) { this.unexpected(awaitAt); }
+      return this.parseFor(node, null)
+    }
+    var isLet = this.isLet();
+    if (this.type === types._var || this.type === types._const || isLet) {
+      var init$1 = this.startNode(), kind = isLet ? "let" : this.value;
+      this.next();
+      this.parseVar(init$1, true, kind);
+      this.finishNode(init$1, "VariableDeclaration");
+      if ((this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1) {
+        if (this.options.ecmaVersion >= 9) {
+          if (this.type === types._in) {
+            if (awaitAt > -1) { this.unexpected(awaitAt); }
+          } else { node.await = awaitAt > -1; }
+        }
+        return this.parseForIn(node, init$1)
+      }
+      if (awaitAt > -1) { this.unexpected(awaitAt); }
+      return this.parseFor(node, init$1)
+    }
+    var refDestructuringErrors = new DestructuringErrors;
+    var init = this.parseExpression(true, refDestructuringErrors);
+    if (this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) {
+      if (this.options.ecmaVersion >= 9) {
+        if (this.type === types._in) {
+          if (awaitAt > -1) { this.unexpected(awaitAt); }
+        } else { node.await = awaitAt > -1; }
+      }
+      this.toAssignable(init, false, refDestructuringErrors);
+      this.checkLVal(init);
+      return this.parseForIn(node, init)
+    } else {
+      this.checkExpressionErrors(refDestructuringErrors, true);
+    }
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, init)
+  };
+
+  pp$1.parseFunctionStatement = function(node, isAsync, declarationPosition) {
+    this.next();
+    return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)
+  };
+
+  pp$1.parseIfStatement = function(node) {
+    this.next();
+    node.test = this.parseParenExpression();
+    // allow function declarations in branches, but only in non-strict mode
+    node.consequent = this.parseStatement("if");
+    node.alternate = this.eat(types._else) ? this.parseStatement("if") : null;
+    return this.finishNode(node, "IfStatement")
+  };
+
+  pp$1.parseReturnStatement = function(node) {
+    if (!this.inFunction && !this.options.allowReturnOutsideFunction)
+      { this.raise(this.start, "'return' outside of function"); }
+    this.next();
+
+    // In `return` (and `break`/`continue`), the keywords with
+    // optional arguments, we eagerly look for a semicolon or the
+    // possibility to insert one.
+
+    if (this.eat(types.semi) || this.insertSemicolon()) { node.argument = null; }
+    else { node.argument = this.parseExpression(); this.semicolon(); }
+    return this.finishNode(node, "ReturnStatement")
+  };
+
+  pp$1.parseSwitchStatement = function(node) {
+    this.next();
+    node.discriminant = this.parseParenExpression();
+    node.cases = [];
+    this.expect(types.braceL);
+    this.labels.push(switchLabel);
+    this.enterScope(0);
+
+    // Statements under must be grouped (by label) in SwitchCase
+    // nodes. `cur` is used to keep the node that we are currently
+    // adding statements to.
+
+    var cur;
+    for (var sawDefault = false; this.type !== types.braceR;) {
+      if (this.type === types._case || this.type === types._default) {
+        var isCase = this.type === types._case;
+        if (cur) { this.finishNode(cur, "SwitchCase"); }
+        node.cases.push(cur = this.startNode());
+        cur.consequent = [];
+        this.next();
+        if (isCase) {
+          cur.test = this.parseExpression();
+        } else {
+          if (sawDefault) { this.raiseRecoverable(this.lastTokStart, "Multiple default clauses"); }
+          sawDefault = true;
+          cur.test = null;
+        }
+        this.expect(types.colon);
+      } else {
+        if (!cur) { this.unexpected(); }
+        cur.consequent.push(this.parseStatement(null));
+      }
+    }
+    this.exitScope();
+    if (cur) { this.finishNode(cur, "SwitchCase"); }
+    this.next(); // Closing brace
+    this.labels.pop();
+    return this.finishNode(node, "SwitchStatement")
+  };
+
+  pp$1.parseThrowStatement = function(node) {
+    this.next();
+    if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))
+      { this.raise(this.lastTokEnd, "Illegal newline after throw"); }
+    node.argument = this.parseExpression();
+    this.semicolon();
+    return this.finishNode(node, "ThrowStatement")
+  };
+
+  // Reused empty array added for node fields that are always empty.
+
+  var empty = [];
+
+  pp$1.parseTryStatement = function(node) {
+    this.next();
+    node.block = this.parseBlock();
+    node.handler = null;
+    if (this.type === types._catch) {
+      var clause = this.startNode();
+      this.next();
+      if (this.eat(types.parenL)) {
+        clause.param = this.parseBindingAtom();
+        var simple = clause.param.type === "Identifier";
+        this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);
+        this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);
+        this.expect(types.parenR);
+      } else {
+        if (this.options.ecmaVersion < 10) { this.unexpected(); }
+        clause.param = null;
+        this.enterScope(0);
+      }
+      clause.body = this.parseBlock(false);
+      this.exitScope();
+      node.handler = this.finishNode(clause, "CatchClause");
+    }
+    node.finalizer = this.eat(types._finally) ? this.parseBlock() : null;
+    if (!node.handler && !node.finalizer)
+      { this.raise(node.start, "Missing catch or finally clause"); }
+    return this.finishNode(node, "TryStatement")
+  };
+
+  pp$1.parseVarStatement = function(node, kind) {
+    this.next();
+    this.parseVar(node, false, kind);
+    this.semicolon();
+    return this.finishNode(node, "VariableDeclaration")
+  };
+
+  pp$1.parseWhileStatement = function(node) {
+    this.next();
+    node.test = this.parseParenExpression();
+    this.labels.push(loopLabel);
+    node.body = this.parseStatement("while");
+    this.labels.pop();
+    return this.finishNode(node, "WhileStatement")
+  };
+
+  pp$1.parseWithStatement = function(node) {
+    if (this.strict) { this.raise(this.start, "'with' in strict mode"); }
+    this.next();
+    node.object = this.parseParenExpression();
+    node.body = this.parseStatement("with");
+    return this.finishNode(node, "WithStatement")
+  };
+
+  pp$1.parseEmptyStatement = function(node) {
+    this.next();
+    return this.finishNode(node, "EmptyStatement")
+  };
+
+  pp$1.parseLabeledStatement = function(node, maybeName, expr, context) {
+    for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)
+      {
+      var label = list[i$1];
+
+      if (label.name === maybeName)
+        { this.raise(expr.start, "Label '" + maybeName + "' is already declared");
+    } }
+    var kind = this.type.isLoop ? "loop" : this.type === types._switch ? "switch" : null;
+    for (var i = this.labels.length - 1; i >= 0; i--) {
+      var label$1 = this.labels[i];
+      if (label$1.statementStart === node.start) {
+        // Update information about previous labels on this node
+        label$1.statementStart = this.start;
+        label$1.kind = kind;
+      } else { break }
+    }
+    this.labels.push({name: maybeName, kind: kind, statementStart: this.start});
+    node.body = this.parseStatement(context ? context.indexOf("label") === -1 ? context + "label" : context : "label");
+    this.labels.pop();
+    node.label = expr;
+    return this.finishNode(node, "LabeledStatement")
+  };
+
+  pp$1.parseExpressionStatement = function(node, expr) {
+    node.expression = expr;
+    this.semicolon();
+    return this.finishNode(node, "ExpressionStatement")
+  };
+
+  // Parse a semicolon-enclosed block of statements, handling `"use
+  // strict"` declarations when `allowStrict` is true (used for
+  // function bodies).
+
+  pp$1.parseBlock = function(createNewLexicalScope, node) {
+    if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;
+    if ( node === void 0 ) node = this.startNode();
+
+    node.body = [];
+    this.expect(types.braceL);
+    if (createNewLexicalScope) { this.enterScope(0); }
+    while (!this.eat(types.braceR)) {
+      var stmt = this.parseStatement(null);
+      node.body.push(stmt);
+    }
+    if (createNewLexicalScope) { this.exitScope(); }
+    return this.finishNode(node, "BlockStatement")
+  };
+
+  // Parse a regular `for` loop. The disambiguation code in
+  // `parseStatement` will already have parsed the init statement or
+  // expression.
+
+  pp$1.parseFor = function(node, init) {
+    node.init = init;
+    this.expect(types.semi);
+    node.test = this.type === types.semi ? null : this.parseExpression();
+    this.expect(types.semi);
+    node.update = this.type === types.parenR ? null : this.parseExpression();
+    this.expect(types.parenR);
+    node.body = this.parseStatement("for");
+    this.exitScope();
+    this.labels.pop();
+    return this.finishNode(node, "ForStatement")
+  };
+
+  // Parse a `for`/`in` and `for`/`of` loop, which are almost
+  // same from parser's perspective.
+
+  pp$1.parseForIn = function(node, init) {
+    var isForIn = this.type === types._in;
+    this.next();
+
+    if (
+      init.type === "VariableDeclaration" &&
+      init.declarations[0].init != null &&
+      (
+        !isForIn ||
+        this.options.ecmaVersion < 8 ||
+        this.strict ||
+        init.kind !== "var" ||
+        init.declarations[0].id.type !== "Identifier"
+      )
+    ) {
+      this.raise(
+        init.start,
+        ((isForIn ? "for-in" : "for-of") + " loop variable declaration may not have an initializer")
+      );
+    } else if (init.type === "AssignmentPattern") {
+      this.raise(init.start, "Invalid left-hand side in for-loop");
+    }
+    node.left = init;
+    node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();
+    this.expect(types.parenR);
+    node.body = this.parseStatement("for");
+    this.exitScope();
+    this.labels.pop();
+    return this.finishNode(node, isForIn ? "ForInStatement" : "ForOfStatement")
+  };
+
+  // Parse a list of variable declarations.
+
+  pp$1.parseVar = function(node, isFor, kind) {
+    node.declarations = [];
+    node.kind = kind;
+    for (;;) {
+      var decl = this.startNode();
+      this.parseVarId(decl, kind);
+      if (this.eat(types.eq)) {
+        decl.init = this.parseMaybeAssign(isFor);
+      } else if (kind === "const" && !(this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of")))) {
+        this.unexpected();
+      } else if (decl.id.type !== "Identifier" && !(isFor && (this.type === types._in || this.isContextual("of")))) {
+        this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+      } else {
+        decl.init = null;
+      }
+      node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+      if (!this.eat(types.comma)) { break }
+    }
+    return node
+  };
+
+  pp$1.parseVarId = function(decl, kind) {
+    decl.id = this.parseBindingAtom();
+    this.checkLVal(decl.id, kind === "var" ? BIND_VAR : BIND_LEXICAL, false);
+  };
+
+  var FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;
+
+  // Parse a function declaration or literal (depending on the
+  // `statement & FUNC_STATEMENT`).
+
+  // Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+  pp$1.parseFunction = function(node, statement, allowExpressionBody, isAsync) {
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {
+      if (this.type === types.star && (statement & FUNC_HANGING_STATEMENT))
+        { this.unexpected(); }
+      node.generator = this.eat(types.star);
+    }
+    if (this.options.ecmaVersion >= 8)
+      { node.async = !!isAsync; }
+
+    if (statement & FUNC_STATEMENT) {
+      node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types.name ? null : this.parseIdent();
+      if (node.id && !(statement & FUNC_HANGING_STATEMENT))
+        // If it is a regular function declaration in sloppy mode, then it is
+        // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+        // mode depends on properties of the current scope (see
+        // treatFunctionsAsVar).
+        { this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }
+    }
+
+    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    this.enterScope(functionFlags(node.async, node.generator));
+
+    if (!(statement & FUNC_STATEMENT))
+      { node.id = this.type === types.name ? this.parseIdent() : null; }
+
+    this.parseFunctionParams(node);
+    this.parseFunctionBody(node, allowExpressionBody, false);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, (statement & FUNC_STATEMENT) ? "FunctionDeclaration" : "FunctionExpression")
+  };
+
+  pp$1.parseFunctionParams = function(node) {
+    this.expect(types.parenL);
+    node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);
+    this.checkYieldAwaitInDefaultParams();
+  };
+
+  // Parse a class declaration or literal (depending on the
+  // `isStatement` parameter).
+
+  pp$1.parseClass = function(node, isStatement) {
+    this.next();
+
+    // ecma-262 14.6 Class Definitions
+    // A class definition is always strict mode code.
+    var oldStrict = this.strict;
+    this.strict = true;
+
+    this.parseClassId(node, isStatement);
+    this.parseClassSuper(node);
+    var classBody = this.startNode();
+    var hadConstructor = false;
+    classBody.body = [];
+    this.expect(types.braceL);
+    while (!this.eat(types.braceR)) {
+      var element = this.parseClassElement(node.superClass !== null);
+      if (element) {
+        classBody.body.push(element);
+        if (element.type === "MethodDefinition" && element.kind === "constructor") {
+          if (hadConstructor) { this.raise(element.start, "Duplicate constructor in the same class"); }
+          hadConstructor = true;
+        }
+      }
+    }
+    node.body = this.finishNode(classBody, "ClassBody");
+    this.strict = oldStrict;
+    return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression")
+  };
+
+  pp$1.parseClassElement = function(constructorAllowsSuper) {
+    var this$1 = this;
+
+    if (this.eat(types.semi)) { return null }
+
+    var method = this.startNode();
+    var tryContextual = function (k, noLineBreak) {
+      if ( noLineBreak === void 0 ) noLineBreak = false;
+
+      var start = this$1.start, startLoc = this$1.startLoc;
+      if (!this$1.eatContextual(k)) { return false }
+      if (this$1.type !== types.parenL && (!noLineBreak || !this$1.canInsertSemicolon())) { return true }
+      if (method.key) { this$1.unexpected(); }
+      method.computed = false;
+      method.key = this$1.startNodeAt(start, startLoc);
+      method.key.name = k;
+      this$1.finishNode(method.key, "Identifier");
+      return false
+    };
+
+    method.kind = "method";
+    method.static = tryContextual("static");
+    var isGenerator = this.eat(types.star);
+    var isAsync = false;
+    if (!isGenerator) {
+      if (this.options.ecmaVersion >= 8 && tryContextual("async", true)) {
+        isAsync = true;
+        isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);
+      } else if (tryContextual("get")) {
+        method.kind = "get";
+      } else if (tryContextual("set")) {
+        method.kind = "set";
+      }
+    }
+    if (!method.key) { this.parsePropertyName(method); }
+    var key = method.key;
+    var allowsDirectSuper = false;
+    if (!method.computed && !method.static && (key.type === "Identifier" && key.name === "constructor" ||
+        key.type === "Literal" && key.value === "constructor")) {
+      if (method.kind !== "method") { this.raise(key.start, "Constructor can't have get/set modifier"); }
+      if (isGenerator) { this.raise(key.start, "Constructor can't be a generator"); }
+      if (isAsync) { this.raise(key.start, "Constructor can't be an async method"); }
+      method.kind = "constructor";
+      allowsDirectSuper = constructorAllowsSuper;
+    } else if (method.static && key.type === "Identifier" && key.name === "prototype") {
+      this.raise(key.start, "Classes may not have a static property named prototype");
+    }
+    this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper);
+    if (method.kind === "get" && method.value.params.length !== 0)
+      { this.raiseRecoverable(method.value.start, "getter should have no params"); }
+    if (method.kind === "set" && method.value.params.length !== 1)
+      { this.raiseRecoverable(method.value.start, "setter should have exactly one param"); }
+    if (method.kind === "set" && method.value.params[0].type === "RestElement")
+      { this.raiseRecoverable(method.value.params[0].start, "Setter cannot use rest params"); }
+    return method
+  };
+
+  pp$1.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {
+    method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);
+    return this.finishNode(method, "MethodDefinition")
+  };
+
+  pp$1.parseClassId = function(node, isStatement) {
+    if (this.type === types.name) {
+      node.id = this.parseIdent();
+      if (isStatement)
+        { this.checkLVal(node.id, BIND_LEXICAL, false); }
+    } else {
+      if (isStatement === true)
+        { this.unexpected(); }
+      node.id = null;
+    }
+  };
+
+  pp$1.parseClassSuper = function(node) {
+    node.superClass = this.eat(types._extends) ? this.parseExprSubscripts() : null;
+  };
+
+  // Parses module export declaration.
+
+  pp$1.parseExport = function(node, exports) {
+    this.next();
+    // export * from '...'
+    if (this.eat(types.star)) {
+      this.expectContextual("from");
+      if (this.type !== types.string) { this.unexpected(); }
+      node.source = this.parseExprAtom();
+      this.semicolon();
+      return this.finishNode(node, "ExportAllDeclaration")
+    }
+    if (this.eat(types._default)) { // export default ...
+      this.checkExport(exports, "default", this.lastTokStart);
+      var isAsync;
+      if (this.type === types._function || (isAsync = this.isAsyncFunction())) {
+        var fNode = this.startNode();
+        this.next();
+        if (isAsync) { this.next(); }
+        node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+      } else if (this.type === types._class) {
+        var cNode = this.startNode();
+        node.declaration = this.parseClass(cNode, "nullableID");
+      } else {
+        node.declaration = this.parseMaybeAssign();
+        this.semicolon();
+      }
+      return this.finishNode(node, "ExportDefaultDeclaration")
+    }
+    // export var|const|let|function|class ...
+    if (this.shouldParseExportStatement()) {
+      node.declaration = this.parseStatement(null);
+      if (node.declaration.type === "VariableDeclaration")
+        { this.checkVariableExport(exports, node.declaration.declarations); }
+      else
+        { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+      node.specifiers = [];
+      node.source = null;
+    } else { // export { x, y as z } [from '...']
+      node.declaration = null;
+      node.specifiers = this.parseExportSpecifiers(exports);
+      if (this.eatContextual("from")) {
+        if (this.type !== types.string) { this.unexpected(); }
+        node.source = this.parseExprAtom();
+      } else {
+        for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+          // check for keywords used as local names
+          var spec = list[i];
+
+          this.checkUnreserved(spec.local);
+          // check if export is defined
+          this.checkLocalExport(spec.local);
+        }
+
+        node.source = null;
+      }
+      this.semicolon();
+    }
+    return this.finishNode(node, "ExportNamedDeclaration")
+  };
+
+  pp$1.checkExport = function(exports, name, pos) {
+    if (!exports) { return }
+    if (has(exports, name))
+      { this.raiseRecoverable(pos, "Duplicate export '" + name + "'"); }
+    exports[name] = true;
+  };
+
+  pp$1.checkPatternExport = function(exports, pat) {
+    var type = pat.type;
+    if (type === "Identifier")
+      { this.checkExport(exports, pat.name, pat.start); }
+    else if (type === "ObjectPattern")
+      { for (var i = 0, list = pat.properties; i < list.length; i += 1)
+        {
+          var prop = list[i];
+
+          this.checkPatternExport(exports, prop);
+        } }
+    else if (type === "ArrayPattern")
+      { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {
+        var elt = list$1[i$1];
+
+          if (elt) { this.checkPatternExport(exports, elt); }
+      } }
+    else if (type === "Property")
+      { this.checkPatternExport(exports, pat.value); }
+    else if (type === "AssignmentPattern")
+      { this.checkPatternExport(exports, pat.left); }
+    else if (type === "RestElement")
+      { this.checkPatternExport(exports, pat.argument); }
+    else if (type === "ParenthesizedExpression")
+      { this.checkPatternExport(exports, pat.expression); }
+  };
+
+  pp$1.checkVariableExport = function(exports, decls) {
+    if (!exports) { return }
+    for (var i = 0, list = decls; i < list.length; i += 1)
+      {
+      var decl = list[i];
+
+      this.checkPatternExport(exports, decl.id);
+    }
+  };
+
+  pp$1.shouldParseExportStatement = function() {
+    return this.type.keyword === "var" ||
+      this.type.keyword === "const" ||
+      this.type.keyword === "class" ||
+      this.type.keyword === "function" ||
+      this.isLet() ||
+      this.isAsyncFunction()
+  };
+
+  // Parses a comma-separated list of module exports.
+
+  pp$1.parseExportSpecifiers = function(exports) {
+    var nodes = [], first = true;
+    // export { x, y as z } [from '...']
+    this.expect(types.braceL);
+    while (!this.eat(types.braceR)) {
+      if (!first) {
+        this.expect(types.comma);
+        if (this.afterTrailingComma(types.braceR)) { break }
+      } else { first = false; }
+
+      var node = this.startNode();
+      node.local = this.parseIdent(true);
+      node.exported = this.eatContextual("as") ? this.parseIdent(true) : node.local;
+      this.checkExport(exports, node.exported.name, node.exported.start);
+      nodes.push(this.finishNode(node, "ExportSpecifier"));
+    }
+    return nodes
+  };
+
+  // Parses import declaration.
+
+  pp$1.parseImport = function(node) {
+    this.next();
+    // import '...'
+    if (this.type === types.string) {
+      node.specifiers = empty;
+      node.source = this.parseExprAtom();
+    } else {
+      node.specifiers = this.parseImportSpecifiers();
+      this.expectContextual("from");
+      node.source = this.type === types.string ? this.parseExprAtom() : this.unexpected();
+    }
+    this.semicolon();
+    return this.finishNode(node, "ImportDeclaration")
+  };
+
+  // Parses a comma-separated list of module imports.
+
+  pp$1.parseImportSpecifiers = function() {
+    var nodes = [], first = true;
+    if (this.type === types.name) {
+      // import defaultObj, { x, y as z } from '...'
+      var node = this.startNode();
+      node.local = this.parseIdent();
+      this.checkLVal(node.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+      if (!this.eat(types.comma)) { return nodes }
+    }
+    if (this.type === types.star) {
+      var node$1 = this.startNode();
+      this.next();
+      this.expectContextual("as");
+      node$1.local = this.parseIdent();
+      this.checkLVal(node$1.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier"));
+      return nodes
+    }
+    this.expect(types.braceL);
+    while (!this.eat(types.braceR)) {
+      if (!first) {
+        this.expect(types.comma);
+        if (this.afterTrailingComma(types.braceR)) { break }
+      } else { first = false; }
+
+      var node$2 = this.startNode();
+      node$2.imported = this.parseIdent(true);
+      if (this.eatContextual("as")) {
+        node$2.local = this.parseIdent();
+      } else {
+        this.checkUnreserved(node$2.imported);
+        node$2.local = node$2.imported;
+      }
+      this.checkLVal(node$2.local, BIND_LEXICAL);
+      nodes.push(this.finishNode(node$2, "ImportSpecifier"));
+    }
+    return nodes
+  };
+
+  // Set `ExpressionStatement#directive` property for directive prologues.
+  pp$1.adaptDirectivePrologue = function(statements) {
+    for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {
+      statements[i].directive = statements[i].expression.raw.slice(1, -1);
+    }
+  };
+  pp$1.isDirectiveCandidate = function(statement) {
+    return (
+      statement.type === "ExpressionStatement" &&
+      statement.expression.type === "Literal" &&
+      typeof statement.expression.value === "string" &&
+      // Reject parenthesized strings.
+      (this.input[statement.start] === "\"" || this.input[statement.start] === "'")
+    )
+  };
+
+  var pp$2 = Parser.prototype;
+
+  // Convert existing expression atom to assignable pattern
+  // if possible.
+
+  pp$2.toAssignable = function(node, isBinding, refDestructuringErrors) {
+    if (this.options.ecmaVersion >= 6 && node) {
+      switch (node.type) {
+      case "Identifier":
+        if (this.inAsync && node.name === "await")
+          { this.raise(node.start, "Cannot use 'await' as identifier inside an async function"); }
+        break
+
+      case "ObjectPattern":
+      case "ArrayPattern":
+      case "RestElement":
+        break
+
+      case "ObjectExpression":
+        node.type = "ObjectPattern";
+        if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+        for (var i = 0, list = node.properties; i < list.length; i += 1) {
+          var prop = list[i];
+
+        this.toAssignable(prop, isBinding);
+          // Early error:
+          //   AssignmentRestProperty[Yield, Await] :
+          //     `...` DestructuringAssignmentTarget[Yield, Await]
+          //
+          //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+          if (
+            prop.type === "RestElement" &&
+            (prop.argument.type === "ArrayPattern" || prop.argument.type === "ObjectPattern")
+          ) {
+            this.raise(prop.argument.start, "Unexpected token");
+          }
+        }
+        break
+
+      case "Property":
+        // AssignmentProperty has type === "Property"
+        if (node.kind !== "init") { this.raise(node.key.start, "Object pattern can't contain getter or setter"); }
+        this.toAssignable(node.value, isBinding);
+        break
+
+      case "ArrayExpression":
+        node.type = "ArrayPattern";
+        if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+        this.toAssignableList(node.elements, isBinding);
+        break
+
+      case "SpreadElement":
+        node.type = "RestElement";
+        this.toAssignable(node.argument, isBinding);
+        if (node.argument.type === "AssignmentPattern")
+          { this.raise(node.argument.start, "Rest elements cannot have a default value"); }
+        break
+
+      case "AssignmentExpression":
+        if (node.operator !== "=") { this.raise(node.left.end, "Only '=' operator can be used for specifying default value."); }
+        node.type = "AssignmentPattern";
+        delete node.operator;
+        this.toAssignable(node.left, isBinding);
+        // falls through to AssignmentPattern
+
+      case "AssignmentPattern":
+        break
+
+      case "ParenthesizedExpression":
+        this.toAssignable(node.expression, isBinding, refDestructuringErrors);
+        break
+
+      case "MemberExpression":
+        if (!isBinding) { break }
+
+      default:
+        this.raise(node.start, "Assigning to rvalue");
+      }
+    } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+    return node
+  };
+
+  // Convert list of expression atoms to binding list.
+
+  pp$2.toAssignableList = function(exprList, isBinding) {
+    var end = exprList.length;
+    for (var i = 0; i < end; i++) {
+      var elt = exprList[i];
+      if (elt) { this.toAssignable(elt, isBinding); }
+    }
+    if (end) {
+      var last = exprList[end - 1];
+      if (this.options.ecmaVersion === 6 && isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier")
+        { this.unexpected(last.argument.start); }
+    }
+    return exprList
+  };
+
+  // Parses spread element.
+
+  pp$2.parseSpread = function(refDestructuringErrors) {
+    var node = this.startNode();
+    this.next();
+    node.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+    return this.finishNode(node, "SpreadElement")
+  };
+
+  pp$2.parseRestBinding = function() {
+    var node = this.startNode();
+    this.next();
+
+    // RestElement inside of a function parameter must be an identifier
+    if (this.options.ecmaVersion === 6 && this.type !== types.name)
+      { this.unexpected(); }
+
+    node.argument = this.parseBindingAtom();
+
+    return this.finishNode(node, "RestElement")
+  };
+
+  // Parses lvalue (assignable) atom.
+
+  pp$2.parseBindingAtom = function() {
+    if (this.options.ecmaVersion >= 6) {
+      switch (this.type) {
+      case types.bracketL:
+        var node = this.startNode();
+        this.next();
+        node.elements = this.parseBindingList(types.bracketR, true, true);
+        return this.finishNode(node, "ArrayPattern")
+
+      case types.braceL:
+        return this.parseObj(true)
+      }
+    }
+    return this.parseIdent()
+  };
+
+  pp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma) {
+    var elts = [], first = true;
+    while (!this.eat(close)) {
+      if (first) { first = false; }
+      else { this.expect(types.comma); }
+      if (allowEmpty && this.type === types.comma) {
+        elts.push(null);
+      } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+        break
+      } else if (this.type === types.ellipsis) {
+        var rest = this.parseRestBinding();
+        this.parseBindingListItem(rest);
+        elts.push(rest);
+        if (this.type === types.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+        this.expect(close);
+        break
+      } else {
+        var elem = this.parseMaybeDefault(this.start, this.startLoc);
+        this.parseBindingListItem(elem);
+        elts.push(elem);
+      }
+    }
+    return elts
+  };
+
+  pp$2.parseBindingListItem = function(param) {
+    return param
+  };
+
+  // Parses assignment pattern around given atom if possible.
+
+  pp$2.parseMaybeDefault = function(startPos, startLoc, left) {
+    left = left || this.parseBindingAtom();
+    if (this.options.ecmaVersion < 6 || !this.eat(types.eq)) { return left }
+    var node = this.startNodeAt(startPos, startLoc);
+    node.left = left;
+    node.right = this.parseMaybeAssign();
+    return this.finishNode(node, "AssignmentPattern")
+  };
+
+  // Verify that a node is an lval — something that can be assigned
+  // to.
+  // bindingType can be either:
+  // 'var' indicating that the lval creates a 'var' binding
+  // 'let' indicating that the lval creates a lexical ('let' or 'const') binding
+  // 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references
+
+  pp$2.checkLVal = function(expr, bindingType, checkClashes) {
+    if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+    switch (expr.type) {
+    case "Identifier":
+      if (bindingType === BIND_LEXICAL && expr.name === "let")
+        { this.raiseRecoverable(expr.start, "let is disallowed as a lexically bound name"); }
+      if (this.strict && this.reservedWordsStrictBind.test(expr.name))
+        { this.raiseRecoverable(expr.start, (bindingType ? "Binding " : "Assigning to ") + expr.name + " in strict mode"); }
+      if (checkClashes) {
+        if (has(checkClashes, expr.name))
+          { this.raiseRecoverable(expr.start, "Argument name clash"); }
+        checkClashes[expr.name] = true;
+      }
+      if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }
+      break
+
+    case "MemberExpression":
+      if (bindingType) { this.raiseRecoverable(expr.start, "Binding member expression"); }
+      break
+
+    case "ObjectPattern":
+      for (var i = 0, list = expr.properties; i < list.length; i += 1)
+        {
+      var prop = list[i];
+
+      this.checkLVal(prop, bindingType, checkClashes);
+    }
+      break
+
+    case "Property":
+      // AssignmentProperty has type === "Property"
+      this.checkLVal(expr.value, bindingType, checkClashes);
+      break
+
+    case "ArrayPattern":
+      for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {
+        var elem = list$1[i$1];
+
+      if (elem) { this.checkLVal(elem, bindingType, checkClashes); }
+      }
+      break
+
+    case "AssignmentPattern":
+      this.checkLVal(expr.left, bindingType, checkClashes);
+      break
+
+    case "RestElement":
+      this.checkLVal(expr.argument, bindingType, checkClashes);
+      break
+
+    case "ParenthesizedExpression":
+      this.checkLVal(expr.expression, bindingType, checkClashes);
+      break
+
+    default:
+      this.raise(expr.start, (bindingType ? "Binding" : "Assigning to") + " rvalue");
+    }
+  };
+
+  // A recursive descent parser operates by defining functions for all
+
+  var pp$3 = Parser.prototype;
+
+  // Check if property name clashes with already added.
+  // Object/class getters and setters are not allowed to clash —
+  // either with each other or with an init property — and in
+  // strict mode, init properties are also not allowed to be repeated.
+
+  pp$3.checkPropClash = function(prop, propHash, refDestructuringErrors) {
+    if (this.options.ecmaVersion >= 9 && prop.type === "SpreadElement")
+      { return }
+    if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))
+      { return }
+    var key = prop.key;
+    var name;
+    switch (key.type) {
+    case "Identifier": name = key.name; break
+    case "Literal": name = String(key.value); break
+    default: return
+    }
+    var kind = prop.kind;
+    if (this.options.ecmaVersion >= 6) {
+      if (name === "__proto__" && kind === "init") {
+        if (propHash.proto) {
+          if (refDestructuringErrors && refDestructuringErrors.doubleProto < 0) { refDestructuringErrors.doubleProto = key.start; }
+          // Backwards-compat kludge. Can be removed in version 6.0
+          else { this.raiseRecoverable(key.start, "Redefinition of __proto__ property"); }
+        }
+        propHash.proto = true;
+      }
+      return
+    }
+    name = "$" + name;
+    var other = propHash[name];
+    if (other) {
+      var redefinition;
+      if (kind === "init") {
+        redefinition = this.strict && other.init || other.get || other.set;
+      } else {
+        redefinition = other.init || other[kind];
+      }
+      if (redefinition)
+        { this.raiseRecoverable(key.start, "Redefinition of property"); }
+    } else {
+      other = propHash[name] = {
+        init: false,
+        get: false,
+        set: false
+      };
+    }
+    other[kind] = true;
+  };
+
+  // ### Expression parsing
+
+  // These nest, from the most general expression type at the top to
+  // 'atomic', nondivisible expression types at the bottom. Most of
+  // the functions will simply let the function(s) below them parse,
+  // and, *if* the syntactic construct they handle is present, wrap
+  // the AST node that the inner parser gave them in another node.
+
+  // Parse a full expression. The optional arguments are used to
+  // forbid the `in` operator (in for loops initalization expressions)
+  // and provide reference for storing '=' operator inside shorthand
+  // property assignment in contexts where both object expression
+  // and object pattern might appear (so it's possible to raise
+  // delayed syntax error at correct position).
+
+  pp$3.parseExpression = function(noIn, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);
+    if (this.type === types.comma) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.expressions = [expr];
+      while (this.eat(types.comma)) { node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors)); }
+      return this.finishNode(node, "SequenceExpression")
+    }
+    return expr
+  };
+
+  // Parse an assignment expression. This includes applications of
+  // operators like `+=`.
+
+  pp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {
+    if (this.isContextual("yield")) {
+      if (this.inGenerator) { return this.parseYield(noIn) }
+      // The tokenizer will assume an expression is allowed after
+      // `yield`, but this isn't that kind of yield
+      else { this.exprAllowed = false; }
+    }
+
+    var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldShorthandAssign = -1;
+    if (refDestructuringErrors) {
+      oldParenAssign = refDestructuringErrors.parenthesizedAssign;
+      oldTrailingComma = refDestructuringErrors.trailingComma;
+      oldShorthandAssign = refDestructuringErrors.shorthandAssign;
+      refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.shorthandAssign = -1;
+    } else {
+      refDestructuringErrors = new DestructuringErrors;
+      ownDestructuringErrors = true;
+    }
+
+    var startPos = this.start, startLoc = this.startLoc;
+    if (this.type === types.parenL || this.type === types.name)
+      { this.potentialArrowAt = this.start; }
+    var left = this.parseMaybeConditional(noIn, refDestructuringErrors);
+    if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }
+    if (this.type.isAssign) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.operator = this.value;
+      node.left = this.type === types.eq ? this.toAssignable(left, false, refDestructuringErrors) : left;
+      if (!ownDestructuringErrors) { DestructuringErrors.call(refDestructuringErrors); }
+      refDestructuringErrors.shorthandAssign = -1; // reset because shorthand default was used correctly
+      this.checkLVal(left);
+      this.next();
+      node.right = this.parseMaybeAssign(noIn);
+      return this.finishNode(node, "AssignmentExpression")
+    } else {
+      if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }
+    }
+    if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }
+    if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }
+    if (oldShorthandAssign > -1) { refDestructuringErrors.shorthandAssign = oldShorthandAssign; }
+    return left
+  };
+
+  // Parse a ternary conditional (`?:`) operator.
+
+  pp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseExprOps(noIn, refDestructuringErrors);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    if (this.eat(types.question)) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.test = expr;
+      node.consequent = this.parseMaybeAssign();
+      this.expect(types.colon);
+      node.alternate = this.parseMaybeAssign(noIn);
+      return this.finishNode(node, "ConditionalExpression")
+    }
+    return expr
+  };
+
+  // Start the precedence parser.
+
+  pp$3.parseExprOps = function(noIn, refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseMaybeUnary(refDestructuringErrors, false);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    return expr.start === startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)
+  };
+
+  // Parse binary operators with the operator precedence parsing
+  // algorithm. `left` is the left-hand side of the operator.
+  // `minPrec` provides context that allows the function to stop and
+  // defer further parser to one of its callers when it encounters an
+  // operator that has a lower precedence than the set it is parsing.
+
+  pp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {
+    var prec = this.type.binop;
+    if (prec != null && (!noIn || this.type !== types._in)) {
+      if (prec > minPrec) {
+        var logical = this.type === types.logicalOR || this.type === types.logicalAND;
+        var op = this.value;
+        this.next();
+        var startPos = this.start, startLoc = this.startLoc;
+        var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);
+        var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical);
+        return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)
+      }
+    }
+    return left
+  };
+
+  pp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.left = left;
+    node.operator = op;
+    node.right = right;
+    return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression")
+  };
+
+  // Parse unary operators, both prefix and postfix.
+
+  pp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {
+    var startPos = this.start, startLoc = this.startLoc, expr;
+    if (this.isContextual("await") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {
+      expr = this.parseAwait();
+      sawUnary = true;
+    } else if (this.type.prefix) {
+      var node = this.startNode(), update = this.type === types.incDec;
+      node.operator = this.value;
+      node.prefix = true;
+      this.next();
+      node.argument = this.parseMaybeUnary(null, true);
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      if (update) { this.checkLVal(node.argument); }
+      else if (this.strict && node.operator === "delete" &&
+               node.argument.type === "Identifier")
+        { this.raiseRecoverable(node.start, "Deleting local variable in strict mode"); }
+      else { sawUnary = true; }
+      expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+    } else {
+      expr = this.parseExprSubscripts(refDestructuringErrors);
+      if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+      while (this.type.postfix && !this.canInsertSemicolon()) {
+        var node$1 = this.startNodeAt(startPos, startLoc);
+        node$1.operator = this.value;
+        node$1.prefix = false;
+        node$1.argument = expr;
+        this.checkLVal(expr);
+        this.next();
+        expr = this.finishNode(node$1, "UpdateExpression");
+      }
+    }
+
+    if (!sawUnary && this.eat(types.starstar))
+      { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), "**", false) }
+    else
+      { return expr }
+  };
+
+  // Parse call, dot, and `[]`-subscript expressions.
+
+  pp$3.parseExprSubscripts = function(refDestructuringErrors) {
+    var startPos = this.start, startLoc = this.startLoc;
+    var expr = this.parseExprAtom(refDestructuringErrors);
+    var skipArrowSubscripts = expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")";
+    if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) { return expr }
+    var result = this.parseSubscripts(expr, startPos, startLoc);
+    if (refDestructuringErrors && result.type === "MemberExpression") {
+      if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }
+      if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }
+    }
+    return result
+  };
+
+  pp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) {
+    var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" &&
+        this.lastTokEnd === base.end && !this.canInsertSemicolon() && this.input.slice(base.start, base.end) === "async";
+    while (true) {
+      var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow);
+      if (element === base || element.type === "ArrowFunctionExpression") { return element }
+      base = element;
+    }
+  };
+
+  pp$3.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow) {
+    var computed = this.eat(types.bracketL);
+    if (computed || this.eat(types.dot)) {
+      var node = this.startNodeAt(startPos, startLoc);
+      node.object = base;
+      node.property = computed ? this.parseExpression() : this.parseIdent(this.options.allowReserved !== "never");
+      node.computed = !!computed;
+      if (computed) { this.expect(types.bracketR); }
+      base = this.finishNode(node, "MemberExpression");
+    } else if (!noCalls && this.eat(types.parenL)) {
+      var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+      this.yieldPos = 0;
+      this.awaitPos = 0;
+      this.awaitIdentPos = 0;
+      var exprList = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);
+      if (maybeAsyncArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {
+        this.checkPatternErrors(refDestructuringErrors, false);
+        this.checkYieldAwaitInDefaultParams();
+        if (this.awaitIdentPos > 0)
+          { this.raise(this.awaitIdentPos, "Cannot use 'await' as identifier inside an async function"); }
+        this.yieldPos = oldYieldPos;
+        this.awaitPos = oldAwaitPos;
+        this.awaitIdentPos = oldAwaitIdentPos;
+        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)
+      }
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      this.yieldPos = oldYieldPos || this.yieldPos;
+      this.awaitPos = oldAwaitPos || this.awaitPos;
+      this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;
+      var node$1 = this.startNodeAt(startPos, startLoc);
+      node$1.callee = base;
+      node$1.arguments = exprList;
+      base = this.finishNode(node$1, "CallExpression");
+    } else if (this.type === types.backQuote) {
+      var node$2 = this.startNodeAt(startPos, startLoc);
+      node$2.tag = base;
+      node$2.quasi = this.parseTemplate({isTagged: true});
+      base = this.finishNode(node$2, "TaggedTemplateExpression");
+    }
+    return base
+  };
+
+  // Parse an atomic expression — either a single token that is an
+  // expression, an expression started by a keyword like `function` or
+  // `new`, or an expression wrapped in punctuation like `()`, `[]`,
+  // or `{}`.
+
+  pp$3.parseExprAtom = function(refDestructuringErrors) {
+    // If a division operator appears in an expression position, the
+    // tokenizer got confused, and we force it to read a regexp instead.
+    if (this.type === types.slash) { this.readRegexp(); }
+
+    var node, canBeArrow = this.potentialArrowAt === this.start;
+    switch (this.type) {
+    case types._super:
+      if (!this.allowSuper)
+        { this.raise(this.start, "'super' keyword outside a method"); }
+      node = this.startNode();
+      this.next();
+      if (this.type === types.parenL && !this.allowDirectSuper)
+        { this.raise(node.start, "super() call outside constructor of a subclass"); }
+      // The `super` keyword can appear at below:
+      // SuperProperty:
+      //     super [ Expression ]
+      //     super . IdentifierName
+      // SuperCall:
+      //     super Arguments
+      if (this.type !== types.dot && this.type !== types.bracketL && this.type !== types.parenL)
+        { this.unexpected(); }
+      return this.finishNode(node, "Super")
+
+    case types._this:
+      node = this.startNode();
+      this.next();
+      return this.finishNode(node, "ThisExpression")
+
+    case types.name:
+      var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;
+      var id = this.parseIdent(false);
+      if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === "async" && !this.canInsertSemicolon() && this.eat(types._function))
+        { return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true) }
+      if (canBeArrow && !this.canInsertSemicolon()) {
+        if (this.eat(types.arrow))
+          { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false) }
+        if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === types.name && !containsEsc) {
+          id = this.parseIdent(false);
+          if (this.canInsertSemicolon() || !this.eat(types.arrow))
+            { this.unexpected(); }
+          return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)
+        }
+      }
+      return id
+
+    case types.regexp:
+      var value = this.value;
+      node = this.parseLiteral(value.value);
+      node.regex = {pattern: value.pattern, flags: value.flags};
+      return node
+
+    case types.num: case types.string:
+      return this.parseLiteral(this.value)
+
+    case types._null: case types._true: case types._false:
+      node = this.startNode();
+      node.value = this.type === types._null ? null : this.type === types._true;
+      node.raw = this.type.keyword;
+      this.next();
+      return this.finishNode(node, "Literal")
+
+    case types.parenL:
+      var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow);
+      if (refDestructuringErrors) {
+        if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))
+          { refDestructuringErrors.parenthesizedAssign = start; }
+        if (refDestructuringErrors.parenthesizedBind < 0)
+          { refDestructuringErrors.parenthesizedBind = start; }
+      }
+      return expr
+
+    case types.bracketL:
+      node = this.startNode();
+      this.next();
+      node.elements = this.parseExprList(types.bracketR, true, true, refDestructuringErrors);
+      return this.finishNode(node, "ArrayExpression")
+
+    case types.braceL:
+      return this.parseObj(false, refDestructuringErrors)
+
+    case types._function:
+      node = this.startNode();
+      this.next();
+      return this.parseFunction(node, 0)
+
+    case types._class:
+      return this.parseClass(this.startNode(), false)
+
+    case types._new:
+      return this.parseNew()
+
+    case types.backQuote:
+      return this.parseTemplate()
+
+    case types._import:
+      if (this.options.ecmaVersion >= 11) {
+        return this.parseExprImport()
+      } else {
+        return this.unexpected()
+      }
+
+    default:
+      this.unexpected();
+    }
+  };
+
+  pp$3.parseExprImport = function() {
+    var node = this.startNode();
+    this.next(); // skip `import`
+    switch (this.type) {
+    case types.parenL:
+      return this.parseDynamicImport(node)
+    default:
+      this.unexpected();
+    }
+  };
+
+  pp$3.parseDynamicImport = function(node) {
+    this.next(); // skip `(`
+
+    // Parse node.source.
+    node.source = this.parseMaybeAssign();
+
+    // Verify ending.
+    if (!this.eat(types.parenR)) {
+      var errorPos = this.start;
+      if (this.eat(types.comma) && this.eat(types.parenR)) {
+        this.raiseRecoverable(errorPos, "Trailing comma is not allowed in import()");
+      } else {
+        this.unexpected(errorPos);
+      }
+    }
+
+    return this.finishNode(node, "ImportExpression")
+  };
+
+  pp$3.parseLiteral = function(value) {
+    var node = this.startNode();
+    node.value = value;
+    node.raw = this.input.slice(this.start, this.end);
+    if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1); }
+    this.next();
+    return this.finishNode(node, "Literal")
+  };
+
+  pp$3.parseParenExpression = function() {
+    this.expect(types.parenL);
+    var val = this.parseExpression();
+    this.expect(types.parenR);
+    return val
+  };
+
+  pp$3.parseParenAndDistinguishExpression = function(canBeArrow) {
+    var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;
+    if (this.options.ecmaVersion >= 6) {
+      this.next();
+
+      var innerStartPos = this.start, innerStartLoc = this.startLoc;
+      var exprList = [], first = true, lastIsComma = false;
+      var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;
+      this.yieldPos = 0;
+      this.awaitPos = 0;
+      // Do not save awaitIdentPos to allow checking awaits nested in parameters
+      while (this.type !== types.parenR) {
+        first ? first = false : this.expect(types.comma);
+        if (allowTrailingComma && this.afterTrailingComma(types.parenR, true)) {
+          lastIsComma = true;
+          break
+        } else if (this.type === types.ellipsis) {
+          spreadStart = this.start;
+          exprList.push(this.parseParenItem(this.parseRestBinding()));
+          if (this.type === types.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+          break
+        } else {
+          exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+        }
+      }
+      var innerEndPos = this.start, innerEndLoc = this.startLoc;
+      this.expect(types.parenR);
+
+      if (canBeArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {
+        this.checkPatternErrors(refDestructuringErrors, false);
+        this.checkYieldAwaitInDefaultParams();
+        this.yieldPos = oldYieldPos;
+        this.awaitPos = oldAwaitPos;
+        return this.parseParenArrowList(startPos, startLoc, exprList)
+      }
+
+      if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }
+      if (spreadStart) { this.unexpected(spreadStart); }
+      this.checkExpressionErrors(refDestructuringErrors, true);
+      this.yieldPos = oldYieldPos || this.yieldPos;
+      this.awaitPos = oldAwaitPos || this.awaitPos;
+
+      if (exprList.length > 1) {
+        val = this.startNodeAt(innerStartPos, innerStartLoc);
+        val.expressions = exprList;
+        this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+      } else {
+        val = exprList[0];
+      }
+    } else {
+      val = this.parseParenExpression();
+    }
+
+    if (this.options.preserveParens) {
+      var par = this.startNodeAt(startPos, startLoc);
+      par.expression = val;
+      return this.finishNode(par, "ParenthesizedExpression")
+    } else {
+      return val
+    }
+  };
+
+  pp$3.parseParenItem = function(item) {
+    return item
+  };
+
+  pp$3.parseParenArrowList = function(startPos, startLoc, exprList) {
+    return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)
+  };
+
+  // New's precedence is slightly tricky. It must allow its argument to
+  // be a `[]` or dot subscript expression, but not a call — at least,
+  // not without wrapping it in parentheses. Thus, it uses the noCalls
+  // argument to parseSubscripts to prevent it from consuming the
+  // argument list.
+
+  var empty$1 = [];
+
+  pp$3.parseNew = function() {
+    var node = this.startNode();
+    var meta = this.parseIdent(true);
+    if (this.options.ecmaVersion >= 6 && this.eat(types.dot)) {
+      node.meta = meta;
+      var containsEsc = this.containsEsc;
+      node.property = this.parseIdent(true);
+      if (node.property.name !== "target" || containsEsc)
+        { this.raiseRecoverable(node.property.start, "The only valid meta property for new is new.target"); }
+      if (!this.inNonArrowFunction())
+        { this.raiseRecoverable(node.start, "new.target can only be used in functions"); }
+      return this.finishNode(node, "MetaProperty")
+    }
+    var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types._import;
+    node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);
+    if (isImport && node.callee.type === "ImportExpression") {
+      this.raise(startPos, "Cannot use new with import()");
+    }
+    if (this.eat(types.parenL)) { node.arguments = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false); }
+    else { node.arguments = empty$1; }
+    return this.finishNode(node, "NewExpression")
+  };
+
+  // Parse template expression.
+
+  pp$3.parseTemplateElement = function(ref) {
+    var isTagged = ref.isTagged;
+
+    var elem = this.startNode();
+    if (this.type === types.invalidTemplate) {
+      if (!isTagged) {
+        this.raiseRecoverable(this.start, "Bad escape sequence in untagged template literal");
+      }
+      elem.value = {
+        raw: this.value,
+        cooked: null
+      };
+    } else {
+      elem.value = {
+        raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"),
+        cooked: this.value
+      };
+    }
+    this.next();
+    elem.tail = this.type === types.backQuote;
+    return this.finishNode(elem, "TemplateElement")
+  };
+
+  pp$3.parseTemplate = function(ref) {
+    if ( ref === void 0 ) ref = {};
+    var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;
+
+    var node = this.startNode();
+    this.next();
+    node.expressions = [];
+    var curElt = this.parseTemplateElement({isTagged: isTagged});
+    node.quasis = [curElt];
+    while (!curElt.tail) {
+      if (this.type === types.eof) { this.raise(this.pos, "Unterminated template literal"); }
+      this.expect(types.dollarBraceL);
+      node.expressions.push(this.parseExpression());
+      this.expect(types.braceR);
+      node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));
+    }
+    this.next();
+    return this.finishNode(node, "TemplateLiteral")
+  };
+
+  pp$3.isAsyncProp = function(prop) {
+    return !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" &&
+      (this.type === types.name || this.type === types.num || this.type === types.string || this.type === types.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types.star)) &&
+      !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+  };
+
+  // Parse an object literal or binding pattern.
+
+  pp$3.parseObj = function(isPattern, refDestructuringErrors) {
+    var node = this.startNode(), first = true, propHash = {};
+    node.properties = [];
+    this.next();
+    while (!this.eat(types.braceR)) {
+      if (!first) {
+        this.expect(types.comma);
+        if (this.afterTrailingComma(types.braceR)) { break }
+      } else { first = false; }
+
+      var prop = this.parseProperty(isPattern, refDestructuringErrors);
+      if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }
+      node.properties.push(prop);
+    }
+    return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
+  };
+
+  pp$3.parseProperty = function(isPattern, refDestructuringErrors) {
+    var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;
+    if (this.options.ecmaVersion >= 9 && this.eat(types.ellipsis)) {
+      if (isPattern) {
+        prop.argument = this.parseIdent(false);
+        if (this.type === types.comma) {
+          this.raise(this.start, "Comma is not permitted after the rest element");
+        }
+        return this.finishNode(prop, "RestElement")
+      }
+      // To disallow parenthesized identifier via `this.toAssignable()`.
+      if (this.type === types.parenL && refDestructuringErrors) {
+        if (refDestructuringErrors.parenthesizedAssign < 0) {
+          refDestructuringErrors.parenthesizedAssign = this.start;
+        }
+        if (refDestructuringErrors.parenthesizedBind < 0) {
+          refDestructuringErrors.parenthesizedBind = this.start;
+        }
+      }
+      // Parse argument.
+      prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+      // To disallow trailing comma via `this.toAssignable()`.
+      if (this.type === types.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {
+        refDestructuringErrors.trailingComma = this.start;
+      }
+      // Finish
+      return this.finishNode(prop, "SpreadElement")
+    }
+    if (this.options.ecmaVersion >= 6) {
+      prop.method = false;
+      prop.shorthand = false;
+      if (isPattern || refDestructuringErrors) {
+        startPos = this.start;
+        startLoc = this.startLoc;
+      }
+      if (!isPattern)
+        { isGenerator = this.eat(types.star); }
+    }
+    var containsEsc = this.containsEsc;
+    this.parsePropertyName(prop);
+    if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {
+      isAsync = true;
+      isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);
+      this.parsePropertyName(prop, refDestructuringErrors);
+    } else {
+      isAsync = false;
+    }
+    this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);
+    return this.finishNode(prop, "Property")
+  };
+
+  pp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {
+    if ((isGenerator || isAsync) && this.type === types.colon)
+      { this.unexpected(); }
+
+    if (this.eat(types.colon)) {
+      prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);
+      prop.kind = "init";
+    } else if (this.options.ecmaVersion >= 6 && this.type === types.parenL) {
+      if (isPattern) { this.unexpected(); }
+      prop.kind = "init";
+      prop.method = true;
+      prop.value = this.parseMethod(isGenerator, isAsync);
+    } else if (!isPattern && !containsEsc &&
+               this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
+               (prop.key.name === "get" || prop.key.name === "set") &&
+               (this.type !== types.comma && this.type !== types.braceR)) {
+      if (isGenerator || isAsync) { this.unexpected(); }
+      prop.kind = prop.key.name;
+      this.parsePropertyName(prop);
+      prop.value = this.parseMethod(false);
+      var paramCount = prop.kind === "get" ? 0 : 1;
+      if (prop.value.params.length !== paramCount) {
+        var start = prop.value.start;
+        if (prop.kind === "get")
+          { this.raiseRecoverable(start, "getter should have no params"); }
+        else
+          { this.raiseRecoverable(start, "setter should have exactly one param"); }
+      } else {
+        if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
+          { this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params"); }
+      }
+    } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+      if (isGenerator || isAsync) { this.unexpected(); }
+      this.checkUnreserved(prop.key);
+      if (prop.key.name === "await" && !this.awaitIdentPos)
+        { this.awaitIdentPos = startPos; }
+      prop.kind = "init";
+      if (isPattern) {
+        prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+      } else if (this.type === types.eq && refDestructuringErrors) {
+        if (refDestructuringErrors.shorthandAssign < 0)
+          { refDestructuringErrors.shorthandAssign = this.start; }
+        prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+      } else {
+        prop.value = prop.key;
+      }
+      prop.shorthand = true;
+    } else { this.unexpected(); }
+  };
+
+  pp$3.parsePropertyName = function(prop) {
+    if (this.options.ecmaVersion >= 6) {
+      if (this.eat(types.bracketL)) {
+        prop.computed = true;
+        prop.key = this.parseMaybeAssign();
+        this.expect(types.bracketR);
+        return prop.key
+      } else {
+        prop.computed = false;
+      }
+    }
+    return prop.key = this.type === types.num || this.type === types.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== "never")
+  };
+
+  // Initialize empty function node.
+
+  pp$3.initFunction = function(node) {
+    node.id = null;
+    if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }
+    if (this.options.ecmaVersion >= 8) { node.async = false; }
+  };
+
+  // Parse object or class method.
+
+  pp$3.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {
+    var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 6)
+      { node.generator = isGenerator; }
+    if (this.options.ecmaVersion >= 8)
+      { node.async = !!isAsync; }
+
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));
+
+    this.expect(types.parenL);
+    node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);
+    this.checkYieldAwaitInDefaultParams();
+    this.parseFunctionBody(node, false, true);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, "FunctionExpression")
+  };
+
+  // Parse arrow function expression with given parameters.
+
+  pp$3.parseArrowExpression = function(node, params, isAsync) {
+    var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+    this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);
+    this.initFunction(node);
+    if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }
+
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+
+    node.params = this.toAssignableList(params, true);
+    this.parseFunctionBody(node, true, false);
+
+    this.yieldPos = oldYieldPos;
+    this.awaitPos = oldAwaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos;
+    return this.finishNode(node, "ArrowFunctionExpression")
+  };
+
+  // Parse function body and check parameters.
+
+  pp$3.parseFunctionBody = function(node, isArrowFunction, isMethod) {
+    var isExpression = isArrowFunction && this.type !== types.braceL;
+    var oldStrict = this.strict, useStrict = false;
+
+    if (isExpression) {
+      node.body = this.parseMaybeAssign();
+      node.expression = true;
+      this.checkParams(node, false);
+    } else {
+      var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);
+      if (!oldStrict || nonSimple) {
+        useStrict = this.strictDirective(this.end);
+        // If this is a strict mode function, verify that argument names
+        // are not repeated, and it does not try to bind the words `eval`
+        // or `arguments`.
+        if (useStrict && nonSimple)
+          { this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list"); }
+      }
+      // Start a new scope with regard to labels and the `inFunction`
+      // flag (restore them to their old value afterwards).
+      var oldLabels = this.labels;
+      this.labels = [];
+      if (useStrict) { this.strict = true; }
+
+      // Add the params to varDeclaredNames to ensure that an error is thrown
+      // if a let/const declaration in the function clashes with one of the params.
+      this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));
+      node.body = this.parseBlock(false);
+      node.expression = false;
+      this.adaptDirectivePrologue(node.body.body);
+      this.labels = oldLabels;
+    }
+    this.exitScope();
+
+    // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+    if (this.strict && node.id) { this.checkLVal(node.id, BIND_OUTSIDE); }
+    this.strict = oldStrict;
+  };
+
+  pp$3.isSimpleParamList = function(params) {
+    for (var i = 0, list = params; i < list.length; i += 1)
+      {
+      var param = list[i];
+
+      if (param.type !== "Identifier") { return false
+    } }
+    return true
+  };
+
+  // Checks function params for various disallowed patterns such as using "eval"
+  // or "arguments" and duplicate parameters.
+
+  pp$3.checkParams = function(node, allowDuplicates) {
+    var nameHash = {};
+    for (var i = 0, list = node.params; i < list.length; i += 1)
+      {
+      var param = list[i];
+
+      this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash);
+    }
+  };
+
+  // Parses a comma-separated list of expressions, and returns them as
+  // an array. `close` is the token type that ends the list, and
+  // `allowEmpty` can be turned on to allow subsequent commas with
+  // nothing in between them to be parsed as `null` (which is needed
+  // for array literals).
+
+  pp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+    var elts = [], first = true;
+    while (!this.eat(close)) {
+      if (!first) {
+        this.expect(types.comma);
+        if (allowTrailingComma && this.afterTrailingComma(close)) { break }
+      } else { first = false; }
+
+      var elt = (void 0);
+      if (allowEmpty && this.type === types.comma)
+        { elt = null; }
+      else if (this.type === types.ellipsis) {
+        elt = this.parseSpread(refDestructuringErrors);
+        if (refDestructuringErrors && this.type === types.comma && refDestructuringErrors.trailingComma < 0)
+          { refDestructuringErrors.trailingComma = this.start; }
+      } else {
+        elt = this.parseMaybeAssign(false, refDestructuringErrors);
+      }
+      elts.push(elt);
+    }
+    return elts
+  };
+
+  pp$3.checkUnreserved = function(ref) {
+    var start = ref.start;
+    var end = ref.end;
+    var name = ref.name;
+
+    if (this.inGenerator && name === "yield")
+      { this.raiseRecoverable(start, "Cannot use 'yield' as identifier inside a generator"); }
+    if (this.inAsync && name === "await")
+      { this.raiseRecoverable(start, "Cannot use 'await' as identifier inside an async function"); }
+    if (this.keywords.test(name))
+      { this.raise(start, ("Unexpected keyword '" + name + "'")); }
+    if (this.options.ecmaVersion < 6 &&
+      this.input.slice(start, end).indexOf("\\") !== -1) { return }
+    var re = this.strict ? this.reservedWordsStrict : this.reservedWords;
+    if (re.test(name)) {
+      if (!this.inAsync && name === "await")
+        { this.raiseRecoverable(start, "Cannot use keyword 'await' outside an async function"); }
+      this.raiseRecoverable(start, ("The keyword '" + name + "' is reserved"));
+    }
+  };
+
+  // Parse the next token as an identifier. If `liberal` is true (used
+  // when parsing properties), it will also convert keywords into
+  // identifiers.
+
+  pp$3.parseIdent = function(liberal, isBinding) {
+    var node = this.startNode();
+    if (this.type === types.name) {
+      node.name = this.value;
+    } else if (this.type.keyword) {
+      node.name = this.type.keyword;
+
+      // To fix https://github.com/acornjs/acorn/issues/575
+      // `class` and `function` keywords push new context into this.context.
+      // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+      // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+      if ((node.name === "class" || node.name === "function") &&
+          (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {
+        this.context.pop();
+      }
+    } else {
+      this.unexpected();
+    }
+    this.next();
+    this.finishNode(node, "Identifier");
+    if (!liberal) {
+      this.checkUnreserved(node);
+      if (node.name === "await" && !this.awaitIdentPos)
+        { this.awaitIdentPos = node.start; }
+    }
+    return node
+  };
+
+  // Parses yield expression inside generator.
+
+  pp$3.parseYield = function(noIn) {
+    if (!this.yieldPos) { this.yieldPos = this.start; }
+
+    var node = this.startNode();
+    this.next();
+    if (this.type === types.semi || this.canInsertSemicolon() || (this.type !== types.star && !this.type.startsExpr)) {
+      node.delegate = false;
+      node.argument = null;
+    } else {
+      node.delegate = this.eat(types.star);
+      node.argument = this.parseMaybeAssign(noIn);
+    }
+    return this.finishNode(node, "YieldExpression")
+  };
+
+  pp$3.parseAwait = function() {
+    if (!this.awaitPos) { this.awaitPos = this.start; }
+
+    var node = this.startNode();
+    this.next();
+    node.argument = this.parseMaybeUnary(null, true);
+    return this.finishNode(node, "AwaitExpression")
+  };
+
+  var pp$4 = Parser.prototype;
+
+  // This function is used to raise exceptions on parse errors. It
+  // takes an offset integer (into the current `input`) to indicate
+  // the location of the error, attaches the position to the end
+  // of the error message, and then raises a `SyntaxError` with that
+  // message.
+
+  pp$4.raise = function(pos, message) {
+    var loc = getLineInfo(this.input, pos);
+    message += " (" + loc.line + ":" + loc.column + ")";
+    var err = new SyntaxError(message);
+    err.pos = pos; err.loc = loc; err.raisedAt = this.pos;
+    throw err
+  };
+
+  pp$4.raiseRecoverable = pp$4.raise;
+
+  pp$4.curPosition = function() {
+    if (this.options.locations) {
+      return new Position(this.curLine, this.pos - this.lineStart)
+    }
+  };
+
+  var pp$5 = Parser.prototype;
+
+  var Scope = function Scope(flags) {
+    this.flags = flags;
+    // A list of var-declared names in the current lexical scope
+    this.var = [];
+    // A list of lexically-declared names in the current lexical scope
+    this.lexical = [];
+    // A list of lexically-declared FunctionDeclaration names in the current lexical scope
+    this.functions = [];
+  };
+
+  // The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+
+  pp$5.enterScope = function(flags) {
+    this.scopeStack.push(new Scope(flags));
+  };
+
+  pp$5.exitScope = function() {
+    this.scopeStack.pop();
+  };
+
+  // The spec says:
+  // > At the top level of a function, or script, function declarations are
+  // > treated like var declarations rather than like lexical declarations.
+  pp$5.treatFunctionsAsVarInScope = function(scope) {
+    return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)
+  };
+
+  pp$5.declareName = function(name, bindingType, pos) {
+    var redeclared = false;
+    if (bindingType === BIND_LEXICAL) {
+      var scope = this.currentScope();
+      redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;
+      scope.lexical.push(name);
+      if (this.inModule && (scope.flags & SCOPE_TOP))
+        { delete this.undefinedExports[name]; }
+    } else if (bindingType === BIND_SIMPLE_CATCH) {
+      var scope$1 = this.currentScope();
+      scope$1.lexical.push(name);
+    } else if (bindingType === BIND_FUNCTION) {
+      var scope$2 = this.currentScope();
+      if (this.treatFunctionsAsVar)
+        { redeclared = scope$2.lexical.indexOf(name) > -1; }
+      else
+        { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }
+      scope$2.functions.push(name);
+    } else {
+      for (var i = this.scopeStack.length - 1; i >= 0; --i) {
+        var scope$3 = this.scopeStack[i];
+        if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||
+            !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {
+          redeclared = true;
+          break
+        }
+        scope$3.var.push(name);
+        if (this.inModule && (scope$3.flags & SCOPE_TOP))
+          { delete this.undefinedExports[name]; }
+        if (scope$3.flags & SCOPE_VAR) { break }
+      }
+    }
+    if (redeclared) { this.raiseRecoverable(pos, ("Identifier '" + name + "' has already been declared")); }
+  };
+
+  pp$5.checkLocalExport = function(id) {
+    // scope.functions must be empty as Module code is always strict.
+    if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&
+        this.scopeStack[0].var.indexOf(id.name) === -1) {
+      this.undefinedExports[id.name] = id;
+    }
+  };
+
+  pp$5.currentScope = function() {
+    return this.scopeStack[this.scopeStack.length - 1]
+  };
+
+  pp$5.currentVarScope = function() {
+    for (var i = this.scopeStack.length - 1;; i--) {
+      var scope = this.scopeStack[i];
+      if (scope.flags & SCOPE_VAR) { return scope }
+    }
+  };
+
+  // Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+  pp$5.currentThisScope = function() {
+    for (var i = this.scopeStack.length - 1;; i--) {
+      var scope = this.scopeStack[i];
+      if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }
+    }
+  };
+
+  var Node = function Node(parser, pos, loc) {
+    this.type = "";
+    this.start = pos;
+    this.end = 0;
+    if (parser.options.locations)
+      { this.loc = new SourceLocation(parser, loc); }
+    if (parser.options.directSourceFile)
+      { this.sourceFile = parser.options.directSourceFile; }
+    if (parser.options.ranges)
+      { this.range = [pos, 0]; }
+  };
+
+  // Start an AST node, attaching a start offset.
+
+  var pp$6 = Parser.prototype;
+
+  pp$6.startNode = function() {
+    return new Node(this, this.start, this.startLoc)
+  };
+
+  pp$6.startNodeAt = function(pos, loc) {
+    return new Node(this, pos, loc)
+  };
+
+  // Finish an AST node, adding `type` and `end` properties.
+
+  function finishNodeAt(node, type, pos, loc) {
+    node.type = type;
+    node.end = pos;
+    if (this.options.locations)
+      { node.loc.end = loc; }
+    if (this.options.ranges)
+      { node.range[1] = pos; }
+    return node
+  }
+
+  pp$6.finishNode = function(node, type) {
+    return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)
+  };
+
+  // Finish node at given position
+
+  pp$6.finishNodeAt = function(node, type, pos, loc) {
+    return finishNodeAt.call(this, node, type, pos, loc)
+  };
+
+  // The algorithm used to determine whether a regexp can appear at a
+
+  var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {
+    this.token = token;
+    this.isExpr = !!isExpr;
+    this.preserveSpace = !!preserveSpace;
+    this.override = override;
+    this.generator = !!generator;
+  };
+
+  var types$1 = {
+    b_stat: new TokContext("{", false),
+    b_expr: new TokContext("{", true),
+    b_tmpl: new TokContext("${", false),
+    p_stat: new TokContext("(", false),
+    p_expr: new TokContext("(", true),
+    q_tmpl: new TokContext("`", true, true, function (p) { return p.tryReadTemplateToken(); }),
+    f_stat: new TokContext("function", false),
+    f_expr: new TokContext("function", true),
+    f_expr_gen: new TokContext("function", true, false, null, true),
+    f_gen: new TokContext("function", false, false, null, true)
+  };
+
+  var pp$7 = Parser.prototype;
+
+  pp$7.initialContext = function() {
+    return [types$1.b_stat]
+  };
+
+  pp$7.braceIsBlock = function(prevType) {
+    var parent = this.curContext();
+    if (parent === types$1.f_expr || parent === types$1.f_stat)
+      { return true }
+    if (prevType === types.colon && (parent === types$1.b_stat || parent === types$1.b_expr))
+      { return !parent.isExpr }
+
+    // The check for `tt.name && exprAllowed` detects whether we are
+    // after a `yield` or `of` construct. See the `updateContext` for
+    // `tt.name`.
+    if (prevType === types._return || prevType === types.name && this.exprAllowed)
+      { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }
+    if (prevType === types._else || prevType === types.semi || prevType === types.eof || prevType === types.parenR || prevType === types.arrow)
+      { return true }
+    if (prevType === types.braceL)
+      { return parent === types$1.b_stat }
+    if (prevType === types._var || prevType === types._const || prevType === types.name)
+      { return false }
+    return !this.exprAllowed
+  };
+
+  pp$7.inGeneratorContext = function() {
+    for (var i = this.context.length - 1; i >= 1; i--) {
+      var context = this.context[i];
+      if (context.token === "function")
+        { return context.generator }
+    }
+    return false
+  };
+
+  pp$7.updateContext = function(prevType) {
+    var update, type = this.type;
+    if (type.keyword && prevType === types.dot)
+      { this.exprAllowed = false; }
+    else if (update = type.updateContext)
+      { update.call(this, prevType); }
+    else
+      { this.exprAllowed = type.beforeExpr; }
+  };
+
+  // Token-specific context update code
+
+  types.parenR.updateContext = types.braceR.updateContext = function() {
+    if (this.context.length === 1) {
+      this.exprAllowed = true;
+      return
+    }
+    var out = this.context.pop();
+    if (out === types$1.b_stat && this.curContext().token === "function") {
+      out = this.context.pop();
+    }
+    this.exprAllowed = !out.isExpr;
+  };
+
+  types.braceL.updateContext = function(prevType) {
+    this.context.push(this.braceIsBlock(prevType) ? types$1.b_stat : types$1.b_expr);
+    this.exprAllowed = true;
+  };
+
+  types.dollarBraceL.updateContext = function() {
+    this.context.push(types$1.b_tmpl);
+    this.exprAllowed = true;
+  };
+
+  types.parenL.updateContext = function(prevType) {
+    var statementParens = prevType === types._if || prevType === types._for || prevType === types._with || prevType === types._while;
+    this.context.push(statementParens ? types$1.p_stat : types$1.p_expr);
+    this.exprAllowed = true;
+  };
+
+  types.incDec.updateContext = function() {
+    // tokExprAllowed stays unchanged
+  };
+
+  types._function.updateContext = types._class.updateContext = function(prevType) {
+    if (prevType.beforeExpr && prevType !== types.semi && prevType !== types._else &&
+        !(prevType === types._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&
+        !((prevType === types.colon || prevType === types.braceL) && this.curContext() === types$1.b_stat))
+      { this.context.push(types$1.f_expr); }
+    else
+      { this.context.push(types$1.f_stat); }
+    this.exprAllowed = false;
+  };
+
+  types.backQuote.updateContext = function() {
+    if (this.curContext() === types$1.q_tmpl)
+      { this.context.pop(); }
+    else
+      { this.context.push(types$1.q_tmpl); }
+    this.exprAllowed = false;
+  };
+
+  types.star.updateContext = function(prevType) {
+    if (prevType === types._function) {
+      var index = this.context.length - 1;
+      if (this.context[index] === types$1.f_expr)
+        { this.context[index] = types$1.f_expr_gen; }
+      else
+        { this.context[index] = types$1.f_gen; }
+    }
+    this.exprAllowed = true;
+  };
+
+  types.name.updateContext = function(prevType) {
+    var allowed = false;
+    if (this.options.ecmaVersion >= 6 && prevType !== types.dot) {
+      if (this.value === "of" && !this.exprAllowed ||
+          this.value === "yield" && this.inGeneratorContext())
+        { allowed = true; }
+    }
+    this.exprAllowed = allowed;
+  };
+
+  // This file contains Unicode properties extracted from the ECMAScript
+  // specification. The lists are extracted like so:
+  // $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+
+  // #table-binary-unicode-properties
+  var ecma9BinaryProperties = "ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";
+  var ecma10BinaryProperties = ecma9BinaryProperties + " Extended_Pictographic";
+  var ecma11BinaryProperties = ecma10BinaryProperties;
+  var unicodeBinaryProperties = {
+    9: ecma9BinaryProperties,
+    10: ecma10BinaryProperties,
+    11: ecma11BinaryProperties
+  };
+
+  // #table-unicode-general-category-values
+  var unicodeGeneralCategoryValues = "Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";
+
+  // #table-unicode-script-values
+  var ecma9ScriptValues = "Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";
+  var ecma10ScriptValues = ecma9ScriptValues + " Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";
+  var ecma11ScriptValues = ecma10ScriptValues + " Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";
+  var unicodeScriptValues = {
+    9: ecma9ScriptValues,
+    10: ecma10ScriptValues,
+    11: ecma11ScriptValues
+  };
+
+  var data = {};
+  function buildUnicodeData(ecmaVersion) {
+    var d = data[ecmaVersion] = {
+      binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + " " + unicodeGeneralCategoryValues),
+      nonBinary: {
+        General_Category: wordsRegexp(unicodeGeneralCategoryValues),
+        Script: wordsRegexp(unicodeScriptValues[ecmaVersion])
+      }
+    };
+    d.nonBinary.Script_Extensions = d.nonBinary.Script;
+
+    d.nonBinary.gc = d.nonBinary.General_Category;
+    d.nonBinary.sc = d.nonBinary.Script;
+    d.nonBinary.scx = d.nonBinary.Script_Extensions;
+  }
+  buildUnicodeData(9);
+  buildUnicodeData(10);
+  buildUnicodeData(11);
+
+  var pp$8 = Parser.prototype;
+
+  var RegExpValidationState = function RegExpValidationState(parser) {
+    this.parser = parser;
+    this.validFlags = "gim" + (parser.options.ecmaVersion >= 6 ? "uy" : "") + (parser.options.ecmaVersion >= 9 ? "s" : "");
+    this.unicodeProperties = data[parser.options.ecmaVersion >= 11 ? 11 : parser.options.ecmaVersion];
+    this.source = "";
+    this.flags = "";
+    this.start = 0;
+    this.switchU = false;
+    this.switchN = false;
+    this.pos = 0;
+    this.lastIntValue = 0;
+    this.lastStringValue = "";
+    this.lastAssertionIsQuantifiable = false;
+    this.numCapturingParens = 0;
+    this.maxBackReference = 0;
+    this.groupNames = [];
+    this.backReferenceNames = [];
+  };
+
+  RegExpValidationState.prototype.reset = function reset (start, pattern, flags) {
+    var unicode = flags.indexOf("u") !== -1;
+    this.start = start | 0;
+    this.source = pattern + "";
+    this.flags = flags;
+    this.switchU = unicode && this.parser.options.ecmaVersion >= 6;
+    this.switchN = unicode && this.parser.options.ecmaVersion >= 9;
+  };
+
+  RegExpValidationState.prototype.raise = function raise (message) {
+    this.parser.raiseRecoverable(this.start, ("Invalid regular expression: /" + (this.source) + "/: " + message));
+  };
+
+  // If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+  // Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+  RegExpValidationState.prototype.at = function at (i) {
+    var s = this.source;
+    var l = s.length;
+    if (i >= l) {
+      return -1
+    }
+    var c = s.charCodeAt(i);
+    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+      return c
+    }
+    return (c << 10) + s.charCodeAt(i + 1) - 0x35FDC00
+  };
+
+  RegExpValidationState.prototype.nextIndex = function nextIndex (i) {
+    var s = this.source;
+    var l = s.length;
+    if (i >= l) {
+      return l
+    }
+    var c = s.charCodeAt(i);
+    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+      return i + 1
+    }
+    return i + 2
+  };
+
+  RegExpValidationState.prototype.current = function current () {
+    return this.at(this.pos)
+  };
+
+  RegExpValidationState.prototype.lookahead = function lookahead () {
+    return this.at(this.nextIndex(this.pos))
+  };
+
+  RegExpValidationState.prototype.advance = function advance () {
+    this.pos = this.nextIndex(this.pos);
+  };
+
+  RegExpValidationState.prototype.eat = function eat (ch) {
+    if (this.current() === ch) {
+      this.advance();
+      return true
+    }
+    return false
+  };
+
+  function codePointToString(ch) {
+    if (ch <= 0xFFFF) { return String.fromCharCode(ch) }
+    ch -= 0x10000;
+    return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)
+  }
+
+  /**
+   * Validate the flags part of a given RegExpLiteral.
+   *
+   * @param {RegExpValidationState} state The state to validate RegExp.
+   * @returns {void}
+   */
+  pp$8.validateRegExpFlags = function(state) {
+    var validFlags = state.validFlags;
+    var flags = state.flags;
+
+    for (var i = 0; i < flags.length; i++) {
+      var flag = flags.charAt(i);
+      if (validFlags.indexOf(flag) === -1) {
+        this.raise(state.start, "Invalid regular expression flag");
+      }
+      if (flags.indexOf(flag, i + 1) > -1) {
+        this.raise(state.start, "Duplicate regular expression flag");
+      }
+    }
+  };
+
+  /**
+   * Validate the pattern part of a given RegExpLiteral.
+   *
+   * @param {RegExpValidationState} state The state to validate RegExp.
+   * @returns {void}
+   */
+  pp$8.validateRegExpPattern = function(state) {
+    this.regexp_pattern(state);
+
+    // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+    // parsing contains a |GroupName|, reparse with the goal symbol
+    // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+    // exception if _P_ did not conform to the grammar, if any elements of _P_
+    // were not matched by the parse, or if any Early Error conditions exist.
+    if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {
+      state.switchN = true;
+      this.regexp_pattern(state);
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+  pp$8.regexp_pattern = function(state) {
+    state.pos = 0;
+    state.lastIntValue = 0;
+    state.lastStringValue = "";
+    state.lastAssertionIsQuantifiable = false;
+    state.numCapturingParens = 0;
+    state.maxBackReference = 0;
+    state.groupNames.length = 0;
+    state.backReferenceNames.length = 0;
+
+    this.regexp_disjunction(state);
+
+    if (state.pos !== state.source.length) {
+      // Make the same messages as V8.
+      if (state.eat(0x29 /* ) */)) {
+        state.raise("Unmatched ')'");
+      }
+      if (state.eat(0x5D /* [ */) || state.eat(0x7D /* } */)) {
+        state.raise("Lone quantifier brackets");
+      }
+    }
+    if (state.maxBackReference > state.numCapturingParens) {
+      state.raise("Invalid escape");
+    }
+    for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {
+      var name = list[i];
+
+      if (state.groupNames.indexOf(name) === -1) {
+        state.raise("Invalid named capture referenced");
+      }
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+  pp$8.regexp_disjunction = function(state) {
+    this.regexp_alternative(state);
+    while (state.eat(0x7C /* | */)) {
+      this.regexp_alternative(state);
+    }
+
+    // Make the same message as V8.
+    if (this.regexp_eatQuantifier(state, true)) {
+      state.raise("Nothing to repeat");
+    }
+    if (state.eat(0x7B /* { */)) {
+      state.raise("Lone quantifier brackets");
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+  pp$8.regexp_alternative = function(state) {
+    while (state.pos < state.source.length && this.regexp_eatTerm(state))
+      { }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+  pp$8.regexp_eatTerm = function(state) {
+    if (this.regexp_eatAssertion(state)) {
+      // Handle `QuantifiableAssertion Quantifier` alternative.
+      // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+      // is a QuantifiableAssertion.
+      if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {
+        // Make the same message as V8.
+        if (state.switchU) {
+          state.raise("Invalid quantifier");
+        }
+      }
+      return true
+    }
+
+    if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {
+      this.regexp_eatQuantifier(state);
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+  pp$8.regexp_eatAssertion = function(state) {
+    var start = state.pos;
+    state.lastAssertionIsQuantifiable = false;
+
+    // ^, $
+    if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {
+      return true
+    }
+
+    // \b \B
+    if (state.eat(0x5C /* \ */)) {
+      if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {
+        return true
+      }
+      state.pos = start;
+    }
+
+    // Lookahead / Lookbehind
+    if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {
+      var lookbehind = false;
+      if (this.options.ecmaVersion >= 9) {
+        lookbehind = state.eat(0x3C /* < */);
+      }
+      if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {
+        this.regexp_disjunction(state);
+        if (!state.eat(0x29 /* ) */)) {
+          state.raise("Unterminated group");
+        }
+        state.lastAssertionIsQuantifiable = !lookbehind;
+        return true
+      }
+    }
+
+    state.pos = start;
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+  pp$8.regexp_eatQuantifier = function(state, noError) {
+    if ( noError === void 0 ) noError = false;
+
+    if (this.regexp_eatQuantifierPrefix(state, noError)) {
+      state.eat(0x3F /* ? */);
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+  pp$8.regexp_eatQuantifierPrefix = function(state, noError) {
+    return (
+      state.eat(0x2A /* * */) ||
+      state.eat(0x2B /* + */) ||
+      state.eat(0x3F /* ? */) ||
+      this.regexp_eatBracedQuantifier(state, noError)
+    )
+  };
+  pp$8.regexp_eatBracedQuantifier = function(state, noError) {
+    var start = state.pos;
+    if (state.eat(0x7B /* { */)) {
+      var min = 0, max = -1;
+      if (this.regexp_eatDecimalDigits(state)) {
+        min = state.lastIntValue;
+        if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {
+          max = state.lastIntValue;
+        }
+        if (state.eat(0x7D /* } */)) {
+          // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+          if (max !== -1 && max < min && !noError) {
+            state.raise("numbers out of order in {} quantifier");
+          }
+          return true
+        }
+      }
+      if (state.switchU && !noError) {
+        state.raise("Incomplete quantifier");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+  pp$8.regexp_eatAtom = function(state) {
+    return (
+      this.regexp_eatPatternCharacters(state) ||
+      state.eat(0x2E /* . */) ||
+      this.regexp_eatReverseSolidusAtomEscape(state) ||
+      this.regexp_eatCharacterClass(state) ||
+      this.regexp_eatUncapturingGroup(state) ||
+      this.regexp_eatCapturingGroup(state)
+    )
+  };
+  pp$8.regexp_eatReverseSolidusAtomEscape = function(state) {
+    var start = state.pos;
+    if (state.eat(0x5C /* \ */)) {
+      if (this.regexp_eatAtomEscape(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$8.regexp_eatUncapturingGroup = function(state) {
+    var start = state.pos;
+    if (state.eat(0x28 /* ( */)) {
+      if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {
+        this.regexp_disjunction(state);
+        if (state.eat(0x29 /* ) */)) {
+          return true
+        }
+        state.raise("Unterminated group");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$8.regexp_eatCapturingGroup = function(state) {
+    if (state.eat(0x28 /* ( */)) {
+      if (this.options.ecmaVersion >= 9) {
+        this.regexp_groupSpecifier(state);
+      } else if (state.current() === 0x3F /* ? */) {
+        state.raise("Invalid group");
+      }
+      this.regexp_disjunction(state);
+      if (state.eat(0x29 /* ) */)) {
+        state.numCapturingParens += 1;
+        return true
+      }
+      state.raise("Unterminated group");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+  pp$8.regexp_eatExtendedAtom = function(state) {
+    return (
+      state.eat(0x2E /* . */) ||
+      this.regexp_eatReverseSolidusAtomEscape(state) ||
+      this.regexp_eatCharacterClass(state) ||
+      this.regexp_eatUncapturingGroup(state) ||
+      this.regexp_eatCapturingGroup(state) ||
+      this.regexp_eatInvalidBracedQuantifier(state) ||
+      this.regexp_eatExtendedPatternCharacter(state)
+    )
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+  pp$8.regexp_eatInvalidBracedQuantifier = function(state) {
+    if (this.regexp_eatBracedQuantifier(state, true)) {
+      state.raise("Nothing to repeat");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+  pp$8.regexp_eatSyntaxCharacter = function(state) {
+    var ch = state.current();
+    if (isSyntaxCharacter(ch)) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+    return false
+  };
+  function isSyntaxCharacter(ch) {
+    return (
+      ch === 0x24 /* $ */ ||
+      ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||
+      ch === 0x2E /* . */ ||
+      ch === 0x3F /* ? */ ||
+      ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||
+      ch >= 0x7B /* { */ && ch <= 0x7D /* } */
+    )
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+  // But eat eager.
+  pp$8.regexp_eatPatternCharacters = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {
+      state.advance();
+    }
+    return state.pos !== start
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+  pp$8.regexp_eatExtendedPatternCharacter = function(state) {
+    var ch = state.current();
+    if (
+      ch !== -1 &&
+      ch !== 0x24 /* $ */ &&
+      !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&
+      ch !== 0x2E /* . */ &&
+      ch !== 0x3F /* ? */ &&
+      ch !== 0x5B /* [ */ &&
+      ch !== 0x5E /* ^ */ &&
+      ch !== 0x7C /* | */
+    ) {
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // GroupSpecifier[U] ::
+  //   [empty]
+  //   `?` GroupName[?U]
+  pp$8.regexp_groupSpecifier = function(state) {
+    if (state.eat(0x3F /* ? */)) {
+      if (this.regexp_eatGroupName(state)) {
+        if (state.groupNames.indexOf(state.lastStringValue) !== -1) {
+          state.raise("Duplicate capture group name");
+        }
+        state.groupNames.push(state.lastStringValue);
+        return
+      }
+      state.raise("Invalid group");
+    }
+  };
+
+  // GroupName[U] ::
+  //   `<` RegExpIdentifierName[?U] `>`
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$8.regexp_eatGroupName = function(state) {
+    state.lastStringValue = "";
+    if (state.eat(0x3C /* < */)) {
+      if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {
+        return true
+      }
+      state.raise("Invalid capture group name");
+    }
+    return false
+  };
+
+  // RegExpIdentifierName[U] ::
+  //   RegExpIdentifierStart[?U]
+  //   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$8.regexp_eatRegExpIdentifierName = function(state) {
+    state.lastStringValue = "";
+    if (this.regexp_eatRegExpIdentifierStart(state)) {
+      state.lastStringValue += codePointToString(state.lastIntValue);
+      while (this.regexp_eatRegExpIdentifierPart(state)) {
+        state.lastStringValue += codePointToString(state.lastIntValue);
+      }
+      return true
+    }
+    return false
+  };
+
+  // RegExpIdentifierStart[U] ::
+  //   UnicodeIDStart
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[?U]
+  pp$8.regexp_eatRegExpIdentifierStart = function(state) {
+    var start = state.pos;
+    var ch = state.current();
+    state.advance();
+
+    if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+      ch = state.lastIntValue;
+    }
+    if (isRegExpIdentifierStart(ch)) {
+      state.lastIntValue = ch;
+      return true
+    }
+
+    state.pos = start;
+    return false
+  };
+  function isRegExpIdentifierStart(ch) {
+    return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */
+  }
+
+  // RegExpIdentifierPart[U] ::
+  //   UnicodeIDContinue
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[?U]
+  //   <ZWNJ>
+  //   <ZWJ>
+  pp$8.regexp_eatRegExpIdentifierPart = function(state) {
+    var start = state.pos;
+    var ch = state.current();
+    state.advance();
+
+    if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+      ch = state.lastIntValue;
+    }
+    if (isRegExpIdentifierPart(ch)) {
+      state.lastIntValue = ch;
+      return true
+    }
+
+    state.pos = start;
+    return false
+  };
+  function isRegExpIdentifierPart(ch) {
+    return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+  pp$8.regexp_eatAtomEscape = function(state) {
+    if (
+      this.regexp_eatBackReference(state) ||
+      this.regexp_eatCharacterClassEscape(state) ||
+      this.regexp_eatCharacterEscape(state) ||
+      (state.switchN && this.regexp_eatKGroupName(state))
+    ) {
+      return true
+    }
+    if (state.switchU) {
+      // Make the same message as V8.
+      if (state.current() === 0x63 /* c */) {
+        state.raise("Invalid unicode escape");
+      }
+      state.raise("Invalid escape");
+    }
+    return false
+  };
+  pp$8.regexp_eatBackReference = function(state) {
+    var start = state.pos;
+    if (this.regexp_eatDecimalEscape(state)) {
+      var n = state.lastIntValue;
+      if (state.switchU) {
+        // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+        if (n > state.maxBackReference) {
+          state.maxBackReference = n;
+        }
+        return true
+      }
+      if (n <= state.numCapturingParens) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$8.regexp_eatKGroupName = function(state) {
+    if (state.eat(0x6B /* k */)) {
+      if (this.regexp_eatGroupName(state)) {
+        state.backReferenceNames.push(state.lastStringValue);
+        return true
+      }
+      state.raise("Invalid named reference");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+  pp$8.regexp_eatCharacterEscape = function(state) {
+    return (
+      this.regexp_eatControlEscape(state) ||
+      this.regexp_eatCControlLetter(state) ||
+      this.regexp_eatZero(state) ||
+      this.regexp_eatHexEscapeSequence(state) ||
+      this.regexp_eatRegExpUnicodeEscapeSequence(state) ||
+      (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||
+      this.regexp_eatIdentityEscape(state)
+    )
+  };
+  pp$8.regexp_eatCControlLetter = function(state) {
+    var start = state.pos;
+    if (state.eat(0x63 /* c */)) {
+      if (this.regexp_eatControlLetter(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+    return false
+  };
+  pp$8.regexp_eatZero = function(state) {
+    if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {
+      state.lastIntValue = 0;
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+  pp$8.regexp_eatControlEscape = function(state) {
+    var ch = state.current();
+    if (ch === 0x74 /* t */) {
+      state.lastIntValue = 0x09; /* \t */
+      state.advance();
+      return true
+    }
+    if (ch === 0x6E /* n */) {
+      state.lastIntValue = 0x0A; /* \n */
+      state.advance();
+      return true
+    }
+    if (ch === 0x76 /* v */) {
+      state.lastIntValue = 0x0B; /* \v */
+      state.advance();
+      return true
+    }
+    if (ch === 0x66 /* f */) {
+      state.lastIntValue = 0x0C; /* \f */
+      state.advance();
+      return true
+    }
+    if (ch === 0x72 /* r */) {
+      state.lastIntValue = 0x0D; /* \r */
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+  pp$8.regexp_eatControlLetter = function(state) {
+    var ch = state.current();
+    if (isControlLetter(ch)) {
+      state.lastIntValue = ch % 0x20;
+      state.advance();
+      return true
+    }
+    return false
+  };
+  function isControlLetter(ch) {
+    return (
+      (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||
+      (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)
+    )
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+  pp$8.regexp_eatRegExpUnicodeEscapeSequence = function(state) {
+    var start = state.pos;
+
+    if (state.eat(0x75 /* u */)) {
+      if (this.regexp_eatFixedHexDigits(state, 4)) {
+        var lead = state.lastIntValue;
+        if (state.switchU && lead >= 0xD800 && lead <= 0xDBFF) {
+          var leadSurrogateEnd = state.pos;
+          if (state.eat(0x5C /* \ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {
+            var trail = state.lastIntValue;
+            if (trail >= 0xDC00 && trail <= 0xDFFF) {
+              state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;
+              return true
+            }
+          }
+          state.pos = leadSurrogateEnd;
+          state.lastIntValue = lead;
+        }
+        return true
+      }
+      if (
+        state.switchU &&
+        state.eat(0x7B /* { */) &&
+        this.regexp_eatHexDigits(state) &&
+        state.eat(0x7D /* } */) &&
+        isValidUnicode(state.lastIntValue)
+      ) {
+        return true
+      }
+      if (state.switchU) {
+        state.raise("Invalid unicode escape");
+      }
+      state.pos = start;
+    }
+
+    return false
+  };
+  function isValidUnicode(ch) {
+    return ch >= 0 && ch <= 0x10FFFF
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+  pp$8.regexp_eatIdentityEscape = function(state) {
+    if (state.switchU) {
+      if (this.regexp_eatSyntaxCharacter(state)) {
+        return true
+      }
+      if (state.eat(0x2F /* / */)) {
+        state.lastIntValue = 0x2F; /* / */
+        return true
+      }
+      return false
+    }
+
+    var ch = state.current();
+    if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+  pp$8.regexp_eatDecimalEscape = function(state) {
+    state.lastIntValue = 0;
+    var ch = state.current();
+    if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {
+      do {
+        state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+        state.advance();
+      } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+  pp$8.regexp_eatCharacterClassEscape = function(state) {
+    var ch = state.current();
+
+    if (isCharacterClassEscape(ch)) {
+      state.lastIntValue = -1;
+      state.advance();
+      return true
+    }
+
+    if (
+      state.switchU &&
+      this.options.ecmaVersion >= 9 &&
+      (ch === 0x50 /* P */ || ch === 0x70 /* p */)
+    ) {
+      state.lastIntValue = -1;
+      state.advance();
+      if (
+        state.eat(0x7B /* { */) &&
+        this.regexp_eatUnicodePropertyValueExpression(state) &&
+        state.eat(0x7D /* } */)
+      ) {
+        return true
+      }
+      state.raise("Invalid property name");
+    }
+
+    return false
+  };
+  function isCharacterClassEscape(ch) {
+    return (
+      ch === 0x64 /* d */ ||
+      ch === 0x44 /* D */ ||
+      ch === 0x73 /* s */ ||
+      ch === 0x53 /* S */ ||
+      ch === 0x77 /* w */ ||
+      ch === 0x57 /* W */
+    )
+  }
+
+  // UnicodePropertyValueExpression ::
+  //   UnicodePropertyName `=` UnicodePropertyValue
+  //   LoneUnicodePropertyNameOrValue
+  pp$8.regexp_eatUnicodePropertyValueExpression = function(state) {
+    var start = state.pos;
+
+    // UnicodePropertyName `=` UnicodePropertyValue
+    if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {
+      var name = state.lastStringValue;
+      if (this.regexp_eatUnicodePropertyValue(state)) {
+        var value = state.lastStringValue;
+        this.regexp_validateUnicodePropertyNameAndValue(state, name, value);
+        return true
+      }
+    }
+    state.pos = start;
+
+    // LoneUnicodePropertyNameOrValue
+    if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {
+      var nameOrValue = state.lastStringValue;
+      this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);
+      return true
+    }
+    return false
+  };
+  pp$8.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {
+    if (!has(state.unicodeProperties.nonBinary, name))
+      { state.raise("Invalid property name"); }
+    if (!state.unicodeProperties.nonBinary[name].test(value))
+      { state.raise("Invalid property value"); }
+  };
+  pp$8.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {
+    if (!state.unicodeProperties.binary.test(nameOrValue))
+      { state.raise("Invalid property name"); }
+  };
+
+  // UnicodePropertyName ::
+  //   UnicodePropertyNameCharacters
+  pp$8.regexp_eatUnicodePropertyName = function(state) {
+    var ch = 0;
+    state.lastStringValue = "";
+    while (isUnicodePropertyNameCharacter(ch = state.current())) {
+      state.lastStringValue += codePointToString(ch);
+      state.advance();
+    }
+    return state.lastStringValue !== ""
+  };
+  function isUnicodePropertyNameCharacter(ch) {
+    return isControlLetter(ch) || ch === 0x5F /* _ */
+  }
+
+  // UnicodePropertyValue ::
+  //   UnicodePropertyValueCharacters
+  pp$8.regexp_eatUnicodePropertyValue = function(state) {
+    var ch = 0;
+    state.lastStringValue = "";
+    while (isUnicodePropertyValueCharacter(ch = state.current())) {
+      state.lastStringValue += codePointToString(ch);
+      state.advance();
+    }
+    return state.lastStringValue !== ""
+  };
+  function isUnicodePropertyValueCharacter(ch) {
+    return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)
+  }
+
+  // LoneUnicodePropertyNameOrValue ::
+  //   UnicodePropertyValueCharacters
+  pp$8.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {
+    return this.regexp_eatUnicodePropertyValue(state)
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+  pp$8.regexp_eatCharacterClass = function(state) {
+    if (state.eat(0x5B /* [ */)) {
+      state.eat(0x5E /* ^ */);
+      this.regexp_classRanges(state);
+      if (state.eat(0x5D /* [ */)) {
+        return true
+      }
+      // Unreachable since it threw "unterminated regular expression" error before.
+      state.raise("Unterminated character class");
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+  pp$8.regexp_classRanges = function(state) {
+    while (this.regexp_eatClassAtom(state)) {
+      var left = state.lastIntValue;
+      if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {
+        var right = state.lastIntValue;
+        if (state.switchU && (left === -1 || right === -1)) {
+          state.raise("Invalid character class");
+        }
+        if (left !== -1 && right !== -1 && left > right) {
+          state.raise("Range out of order in character class");
+        }
+      }
+    }
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+  pp$8.regexp_eatClassAtom = function(state) {
+    var start = state.pos;
+
+    if (state.eat(0x5C /* \ */)) {
+      if (this.regexp_eatClassEscape(state)) {
+        return true
+      }
+      if (state.switchU) {
+        // Make the same message as V8.
+        var ch$1 = state.current();
+        if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {
+          state.raise("Invalid class escape");
+        }
+        state.raise("Invalid escape");
+      }
+      state.pos = start;
+    }
+
+    var ch = state.current();
+    if (ch !== 0x5D /* [ */) {
+      state.lastIntValue = ch;
+      state.advance();
+      return true
+    }
+
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+  pp$8.regexp_eatClassEscape = function(state) {
+    var start = state.pos;
+
+    if (state.eat(0x62 /* b */)) {
+      state.lastIntValue = 0x08; /* <BS> */
+      return true
+    }
+
+    if (state.switchU && state.eat(0x2D /* - */)) {
+      state.lastIntValue = 0x2D; /* - */
+      return true
+    }
+
+    if (!state.switchU && state.eat(0x63 /* c */)) {
+      if (this.regexp_eatClassControlLetter(state)) {
+        return true
+      }
+      state.pos = start;
+    }
+
+    return (
+      this.regexp_eatCharacterClassEscape(state) ||
+      this.regexp_eatCharacterEscape(state)
+    )
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+  pp$8.regexp_eatClassControlLetter = function(state) {
+    var ch = state.current();
+    if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {
+      state.lastIntValue = ch % 0x20;
+      state.advance();
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$8.regexp_eatHexEscapeSequence = function(state) {
+    var start = state.pos;
+    if (state.eat(0x78 /* x */)) {
+      if (this.regexp_eatFixedHexDigits(state, 2)) {
+        return true
+      }
+      if (state.switchU) {
+        state.raise("Invalid escape");
+      }
+      state.pos = start;
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+  pp$8.regexp_eatDecimalDigits = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    state.lastIntValue = 0;
+    while (isDecimalDigit(ch = state.current())) {
+      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+      state.advance();
+    }
+    return state.pos !== start
+  };
+  function isDecimalDigit(ch) {
+    return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+  pp$8.regexp_eatHexDigits = function(state) {
+    var start = state.pos;
+    var ch = 0;
+    state.lastIntValue = 0;
+    while (isHexDigit(ch = state.current())) {
+      state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+      state.advance();
+    }
+    return state.pos !== start
+  };
+  function isHexDigit(ch) {
+    return (
+      (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||
+      (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||
+      (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)
+    )
+  }
+  function hexToInt(ch) {
+    if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {
+      return 10 + (ch - 0x41 /* A */)
+    }
+    if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {
+      return 10 + (ch - 0x61 /* a */)
+    }
+    return ch - 0x30 /* 0 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+  // Allows only 0-377(octal) i.e. 0-255(decimal).
+  pp$8.regexp_eatLegacyOctalEscapeSequence = function(state) {
+    if (this.regexp_eatOctalDigit(state)) {
+      var n1 = state.lastIntValue;
+      if (this.regexp_eatOctalDigit(state)) {
+        var n2 = state.lastIntValue;
+        if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {
+          state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;
+        } else {
+          state.lastIntValue = n1 * 8 + n2;
+        }
+      } else {
+        state.lastIntValue = n1;
+      }
+      return true
+    }
+    return false
+  };
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+  pp$8.regexp_eatOctalDigit = function(state) {
+    var ch = state.current();
+    if (isOctalDigit(ch)) {
+      state.lastIntValue = ch - 0x30; /* 0 */
+      state.advance();
+      return true
+    }
+    state.lastIntValue = 0;
+    return false
+  };
+  function isOctalDigit(ch) {
+    return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */
+  }
+
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+  // And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$8.regexp_eatFixedHexDigits = function(state, length) {
+    var start = state.pos;
+    state.lastIntValue = 0;
+    for (var i = 0; i < length; ++i) {
+      var ch = state.current();
+      if (!isHexDigit(ch)) {
+        state.pos = start;
+        return false
+      }
+      state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+      state.advance();
+    }
+    return true
+  };
+
+  // Object type used to represent tokens. Note that normally, tokens
+  // simply exist as properties on the parser object. This is only
+  // used for the onToken callback and the external tokenizer.
+
+  var Token = function Token(p) {
+    this.type = p.type;
+    this.value = p.value;
+    this.start = p.start;
+    this.end = p.end;
+    if (p.options.locations)
+      { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }
+    if (p.options.ranges)
+      { this.range = [p.start, p.end]; }
+  };
+
+  // ## Tokenizer
+
+  var pp$9 = Parser.prototype;
+
+  // Move to the next token
+
+  pp$9.next = function() {
+    if (this.options.onToken)
+      { this.options.onToken(new Token(this)); }
+
+    this.lastTokEnd = this.end;
+    this.lastTokStart = this.start;
+    this.lastTokEndLoc = this.endLoc;
+    this.lastTokStartLoc = this.startLoc;
+    this.nextToken();
+  };
+
+  pp$9.getToken = function() {
+    this.next();
+    return new Token(this)
+  };
+
+  // If we're in an ES6 environment, make parsers iterable
+  if (typeof Symbol !== "undefined")
+    { pp$9[Symbol.iterator] = function() {
+      var this$1 = this;
+
+      return {
+        next: function () {
+          var token = this$1.getToken();
+          return {
+            done: token.type === types.eof,
+            value: token
+          }
+        }
+      }
+    }; }
+
+  // Toggle strict mode. Re-reads the next number or string to please
+  // pedantic tests (`"use strict"; 010;` should fail).
+
+  pp$9.curContext = function() {
+    return this.context[this.context.length - 1]
+  };
+
+  // Read a single token, updating the parser object's token-related
+  // properties.
+
+  pp$9.nextToken = function() {
+    var curContext = this.curContext();
+    if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }
+
+    this.start = this.pos;
+    if (this.options.locations) { this.startLoc = this.curPosition(); }
+    if (this.pos >= this.input.length) { return this.finishToken(types.eof) }
+
+    if (curContext.override) { return curContext.override(this) }
+    else { this.readToken(this.fullCharCodeAtPos()); }
+  };
+
+  pp$9.readToken = function(code) {
+    // Identifier or keyword. '\uXXXX' sequences are allowed in
+    // identifiers, so '\' also dispatches to that.
+    if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */)
+      { return this.readWord() }
+
+    return this.getTokenFromCode(code)
+  };
+
+  pp$9.fullCharCodeAtPos = function() {
+    var code = this.input.charCodeAt(this.pos);
+    if (code <= 0xd7ff || code >= 0xe000) { return code }
+    var next = this.input.charCodeAt(this.pos + 1);
+    return (code << 10) + next - 0x35fdc00
+  };
+
+  pp$9.skipBlockComment = function() {
+    var startLoc = this.options.onComment && this.curPosition();
+    var start = this.pos, end = this.input.indexOf("*/", this.pos += 2);
+    if (end === -1) { this.raise(this.pos - 2, "Unterminated comment"); }
+    this.pos = end + 2;
+    if (this.options.locations) {
+      lineBreakG.lastIndex = start;
+      var match;
+      while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {
+        ++this.curLine;
+        this.lineStart = match.index + match[0].length;
+      }
+    }
+    if (this.options.onComment)
+      { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
+                             startLoc, this.curPosition()); }
+  };
+
+  pp$9.skipLineComment = function(startSkip) {
+    var start = this.pos;
+    var startLoc = this.options.onComment && this.curPosition();
+    var ch = this.input.charCodeAt(this.pos += startSkip);
+    while (this.pos < this.input.length && !isNewLine(ch)) {
+      ch = this.input.charCodeAt(++this.pos);
+    }
+    if (this.options.onComment)
+      { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
+                             startLoc, this.curPosition()); }
+  };
+
+  // Called at the start of the parse and after every token. Skips
+  // whitespace and comments, and.
+
+  pp$9.skipSpace = function() {
+    loop: while (this.pos < this.input.length) {
+      var ch = this.input.charCodeAt(this.pos);
+      switch (ch) {
+      case 32: case 160: // ' '
+        ++this.pos;
+        break
+      case 13:
+        if (this.input.charCodeAt(this.pos + 1) === 10) {
+          ++this.pos;
+        }
+      case 10: case 8232: case 8233:
+        ++this.pos;
+        if (this.options.locations) {
+          ++this.curLine;
+          this.lineStart = this.pos;
+        }
+        break
+      case 47: // '/'
+        switch (this.input.charCodeAt(this.pos + 1)) {
+        case 42: // '*'
+          this.skipBlockComment();
+          break
+        case 47:
+          this.skipLineComment(2);
+          break
+        default:
+          break loop
+        }
+        break
+      default:
+        if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
+          ++this.pos;
+        } else {
+          break loop
+        }
+      }
+    }
+  };
+
+  // Called at the end of every token. Sets `end`, `val`, and
+  // maintains `context` and `exprAllowed`, and skips the space after
+  // the token, so that the next one's `start` will point at the
+  // right position.
+
+  pp$9.finishToken = function(type, val) {
+    this.end = this.pos;
+    if (this.options.locations) { this.endLoc = this.curPosition(); }
+    var prevType = this.type;
+    this.type = type;
+    this.value = val;
+
+    this.updateContext(prevType);
+  };
+
+  // ### Token reading
+
+  // This is the function that is called to fetch the next token. It
+  // is somewhat obscure, because it works in character codes rather
+  // than characters, and because operator parsing has been inlined
+  // into it.
+  //
+  // All in the name of speed.
+  //
+  pp$9.readToken_dot = function() {
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next >= 48 && next <= 57) { return this.readNumber(true) }
+    var next2 = this.input.charCodeAt(this.pos + 2);
+    if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
+      this.pos += 3;
+      return this.finishToken(types.ellipsis)
+    } else {
+      ++this.pos;
+      return this.finishToken(types.dot)
+    }
+  };
+
+  pp$9.readToken_slash = function() { // '/'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (this.exprAllowed) { ++this.pos; return this.readRegexp() }
+    if (next === 61) { return this.finishOp(types.assign, 2) }
+    return this.finishOp(types.slash, 1)
+  };
+
+  pp$9.readToken_mult_modulo_exp = function(code) { // '%*'
+    var next = this.input.charCodeAt(this.pos + 1);
+    var size = 1;
+    var tokentype = code === 42 ? types.star : types.modulo;
+
+    // exponentiation operator ** and **=
+    if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {
+      ++size;
+      tokentype = types.starstar;
+      next = this.input.charCodeAt(this.pos + 2);
+    }
+
+    if (next === 61) { return this.finishOp(types.assign, size + 1) }
+    return this.finishOp(tokentype, size)
+  };
+
+  pp$9.readToken_pipe_amp = function(code) { // '|&'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === code) { return this.finishOp(code === 124 ? types.logicalOR : types.logicalAND, 2) }
+    if (next === 61) { return this.finishOp(types.assign, 2) }
+    return this.finishOp(code === 124 ? types.bitwiseOR : types.bitwiseAND, 1)
+  };
+
+  pp$9.readToken_caret = function() { // '^'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 61) { return this.finishOp(types.assign, 2) }
+    return this.finishOp(types.bitwiseXOR, 1)
+  };
+
+  pp$9.readToken_plus_min = function(code) { // '+-'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === code) {
+      if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&
+          (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {
+        // A `-->` line comment
+        this.skipLineComment(3);
+        this.skipSpace();
+        return this.nextToken()
+      }
+      return this.finishOp(types.incDec, 2)
+    }
+    if (next === 61) { return this.finishOp(types.assign, 2) }
+    return this.finishOp(types.plusMin, 1)
+  };
+
+  pp$9.readToken_lt_gt = function(code) { // '<>'
+    var next = this.input.charCodeAt(this.pos + 1);
+    var size = 1;
+    if (next === code) {
+      size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+      if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types.assign, size + 1) }
+      return this.finishOp(types.bitShift, size)
+    }
+    if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&
+        this.input.charCodeAt(this.pos + 3) === 45) {
+      // `<!--`, an XML-style comment that should be interpreted as a line comment
+      this.skipLineComment(4);
+      this.skipSpace();
+      return this.nextToken()
+    }
+    if (next === 61) { size = 2; }
+    return this.finishOp(types.relational, size)
+  };
+
+  pp$9.readToken_eq_excl = function(code) { // '=!'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 61) { return this.finishOp(types.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }
+    if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
+      this.pos += 2;
+      return this.finishToken(types.arrow)
+    }
+    return this.finishOp(code === 61 ? types.eq : types.prefix, 1)
+  };
+
+  pp$9.getTokenFromCode = function(code) {
+    switch (code) {
+    // The interpretation of a dot depends on whether it is followed
+    // by a digit or another two dots.
+    case 46: // '.'
+      return this.readToken_dot()
+
+    // Punctuation tokens.
+    case 40: ++this.pos; return this.finishToken(types.parenL)
+    case 41: ++this.pos; return this.finishToken(types.parenR)
+    case 59: ++this.pos; return this.finishToken(types.semi)
+    case 44: ++this.pos; return this.finishToken(types.comma)
+    case 91: ++this.pos; return this.finishToken(types.bracketL)
+    case 93: ++this.pos; return this.finishToken(types.bracketR)
+    case 123: ++this.pos; return this.finishToken(types.braceL)
+    case 125: ++this.pos; return this.finishToken(types.braceR)
+    case 58: ++this.pos; return this.finishToken(types.colon)
+    case 63: ++this.pos; return this.finishToken(types.question)
+
+    case 96: // '`'
+      if (this.options.ecmaVersion < 6) { break }
+      ++this.pos;
+      return this.finishToken(types.backQuote)
+
+    case 48: // '0'
+      var next = this.input.charCodeAt(this.pos + 1);
+      if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number
+      if (this.options.ecmaVersion >= 6) {
+        if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number
+        if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number
+      }
+
+    // Anything else beginning with a digit is an integer, octal
+    // number, or float.
+    case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
+      return this.readNumber(false)
+
+    // Quotes produce strings.
+    case 34: case 39: // '"', "'"
+      return this.readString(code)
+
+    // Operators are parsed inline in tiny state machines. '=' (61) is
+    // often referred to. `finishOp` simply skips the amount of
+    // characters it is given as second argument, and returns a token
+    // of the type given by its first argument.
+
+    case 47: // '/'
+      return this.readToken_slash()
+
+    case 37: case 42: // '%*'
+      return this.readToken_mult_modulo_exp(code)
+
+    case 124: case 38: // '|&'
+      return this.readToken_pipe_amp(code)
+
+    case 94: // '^'
+      return this.readToken_caret()
+
+    case 43: case 45: // '+-'
+      return this.readToken_plus_min(code)
+
+    case 60: case 62: // '<>'
+      return this.readToken_lt_gt(code)
+
+    case 61: case 33: // '=!'
+      return this.readToken_eq_excl(code)
+
+    case 126: // '~'
+      return this.finishOp(types.prefix, 1)
+    }
+
+    this.raise(this.pos, "Unexpected character '" + codePointToString$1(code) + "'");
+  };
+
+  pp$9.finishOp = function(type, size) {
+    var str = this.input.slice(this.pos, this.pos + size);
+    this.pos += size;
+    return this.finishToken(type, str)
+  };
+
+  pp$9.readRegexp = function() {
+    var escaped, inClass, start = this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(start, "Unterminated regular expression"); }
+      var ch = this.input.charAt(this.pos);
+      if (lineBreak.test(ch)) { this.raise(start, "Unterminated regular expression"); }
+      if (!escaped) {
+        if (ch === "[") { inClass = true; }
+        else if (ch === "]" && inClass) { inClass = false; }
+        else if (ch === "/" && !inClass) { break }
+        escaped = ch === "\\";
+      } else { escaped = false; }
+      ++this.pos;
+    }
+    var pattern = this.input.slice(start, this.pos);
+    ++this.pos;
+    var flagsStart = this.pos;
+    var flags = this.readWord1();
+    if (this.containsEsc) { this.unexpected(flagsStart); }
+
+    // Validate pattern
+    var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));
+    state.reset(start, pattern, flags);
+    this.validateRegExpFlags(state);
+    this.validateRegExpPattern(state);
+
+    // Create Literal#value property value.
+    var value = null;
+    try {
+      value = new RegExp(pattern, flags);
+    } catch (e) {
+      // ESTree requires null if it failed to instantiate RegExp object.
+      // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+    }
+
+    return this.finishToken(types.regexp, {pattern: pattern, flags: flags, value: value})
+  };
+
+  // Read an integer in the given radix. Return null if zero digits
+  // were read, the integer value otherwise. When `len` is given, this
+  // will return `null` unless the integer has exactly `len` digits.
+
+  pp$9.readInt = function(radix, len) {
+    var start = this.pos, total = 0;
+    for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {
+      var code = this.input.charCodeAt(this.pos), val = (void 0);
+      if (code >= 97) { val = code - 97 + 10; } // a
+      else if (code >= 65) { val = code - 65 + 10; } // A
+      else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9
+      else { val = Infinity; }
+      if (val >= radix) { break }
+      ++this.pos;
+      total = total * radix + val;
+    }
+    if (this.pos === start || len != null && this.pos - start !== len) { return null }
+
+    return total
+  };
+
+  pp$9.readRadixNumber = function(radix) {
+    var start = this.pos;
+    this.pos += 2; // 0x
+    var val = this.readInt(radix);
+    if (val == null) { this.raise(this.start + 2, "Expected number in radix " + radix); }
+    if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {
+      val = typeof BigInt !== "undefined" ? BigInt(this.input.slice(start, this.pos)) : null;
+      ++this.pos;
+    } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+    return this.finishToken(types.num, val)
+  };
+
+  // Read an integer, octal integer, or floating-point number.
+
+  pp$9.readNumber = function(startsWithDot) {
+    var start = this.pos;
+    if (!startsWithDot && this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+    var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;
+    if (octal && this.strict) { this.raise(start, "Invalid number"); }
+    if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }
+    var next = this.input.charCodeAt(this.pos);
+    if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {
+      var str$1 = this.input.slice(start, this.pos);
+      var val$1 = typeof BigInt !== "undefined" ? BigInt(str$1) : null;
+      ++this.pos;
+      if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+      return this.finishToken(types.num, val$1)
+    }
+    if (next === 46 && !octal) { // '.'
+      ++this.pos;
+      this.readInt(10);
+      next = this.input.charCodeAt(this.pos);
+    }
+    if ((next === 69 || next === 101) && !octal) { // 'eE'
+      next = this.input.charCodeAt(++this.pos);
+      if (next === 43 || next === 45) { ++this.pos; } // '+-'
+      if (this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+    }
+    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+
+    var str = this.input.slice(start, this.pos);
+    var val = octal ? parseInt(str, 8) : parseFloat(str);
+    return this.finishToken(types.num, val)
+  };
+
+  // Read a string value, interpreting backslash-escapes.
+
+  pp$9.readCodePoint = function() {
+    var ch = this.input.charCodeAt(this.pos), code;
+
+    if (ch === 123) { // '{'
+      if (this.options.ecmaVersion < 6) { this.unexpected(); }
+      var codePos = ++this.pos;
+      code = this.readHexChar(this.input.indexOf("}", this.pos) - this.pos);
+      ++this.pos;
+      if (code > 0x10FFFF) { this.invalidStringToken(codePos, "Code point out of bounds"); }
+    } else {
+      code = this.readHexChar(4);
+    }
+    return code
+  };
+
+  function codePointToString$1(code) {
+    // UTF-16 Decoding
+    if (code <= 0xFFFF) { return String.fromCharCode(code) }
+    code -= 0x10000;
+    return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
+  }
+
+  pp$9.readString = function(quote) {
+    var out = "", chunkStart = ++this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated string constant"); }
+      var ch = this.input.charCodeAt(this.pos);
+      if (ch === quote) { break }
+      if (ch === 92) { // '\'
+        out += this.input.slice(chunkStart, this.pos);
+        out += this.readEscapedChar(false);
+        chunkStart = this.pos;
+      } else {
+        if (isNewLine(ch, this.options.ecmaVersion >= 10)) { this.raise(this.start, "Unterminated string constant"); }
+        ++this.pos;
+      }
+    }
+    out += this.input.slice(chunkStart, this.pos++);
+    return this.finishToken(types.string, out)
+  };
+
+  // Reads template string tokens.
+
+  var INVALID_TEMPLATE_ESCAPE_ERROR = {};
+
+  pp$9.tryReadTemplateToken = function() {
+    this.inTemplateElement = true;
+    try {
+      this.readTmplToken();
+    } catch (err) {
+      if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {
+        this.readInvalidTemplateToken();
+      } else {
+        throw err
+      }
+    }
+
+    this.inTemplateElement = false;
+  };
+
+  pp$9.invalidStringToken = function(position, message) {
+    if (this.inTemplateElement && this.options.ecmaVersion >= 9) {
+      throw INVALID_TEMPLATE_ESCAPE_ERROR
+    } else {
+      this.raise(position, message);
+    }
+  };
+
+  pp$9.readTmplToken = function() {
+    var out = "", chunkStart = this.pos;
+    for (;;) {
+      if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated template"); }
+      var ch = this.input.charCodeAt(this.pos);
+      if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
+        if (this.pos === this.start && (this.type === types.template || this.type === types.invalidTemplate)) {
+          if (ch === 36) {
+            this.pos += 2;
+            return this.finishToken(types.dollarBraceL)
+          } else {
+            ++this.pos;
+            return this.finishToken(types.backQuote)
+          }
+        }
+        out += this.input.slice(chunkStart, this.pos);
+        return this.finishToken(types.template, out)
+      }
+      if (ch === 92) { // '\'
+        out += this.input.slice(chunkStart, this.pos);
+        out += this.readEscapedChar(true);
+        chunkStart = this.pos;
+      } else if (isNewLine(ch)) {
+        out += this.input.slice(chunkStart, this.pos);
+        ++this.pos;
+        switch (ch) {
+        case 13:
+          if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }
+        case 10:
+          out += "\n";
+          break
+        default:
+          out += String.fromCharCode(ch);
+          break
+        }
+        if (this.options.locations) {
+          ++this.curLine;
+          this.lineStart = this.pos;
+        }
+        chunkStart = this.pos;
+      } else {
+        ++this.pos;
+      }
+    }
+  };
+
+  // Reads a template token to search for the end, without validating any escape sequences
+  pp$9.readInvalidTemplateToken = function() {
+    for (; this.pos < this.input.length; this.pos++) {
+      switch (this.input[this.pos]) {
+      case "\\":
+        ++this.pos;
+        break
+
+      case "$":
+        if (this.input[this.pos + 1] !== "{") {
+          break
+        }
+      // falls through
+
+      case "`":
+        return this.finishToken(types.invalidTemplate, this.input.slice(this.start, this.pos))
+
+      // no default
+      }
+    }
+    this.raise(this.start, "Unterminated template");
+  };
+
+  // Used to read escaped characters
+
+  pp$9.readEscapedChar = function(inTemplate) {
+    var ch = this.input.charCodeAt(++this.pos);
+    ++this.pos;
+    switch (ch) {
+    case 110: return "\n" // 'n' -> '\n'
+    case 114: return "\r" // 'r' -> '\r'
+    case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'
+    case 117: return codePointToString$1(this.readCodePoint()) // 'u'
+    case 116: return "\t" // 't' -> '\t'
+    case 98: return "\b" // 'b' -> '\b'
+    case 118: return "\u000b" // 'v' -> '\u000b'
+    case 102: return "\f" // 'f' -> '\f'
+    case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\r\n'
+    case 10: // ' \n'
+      if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }
+      return ""
+    default:
+      if (ch >= 48 && ch <= 55) {
+        var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+        var octal = parseInt(octalStr, 8);
+        if (octal > 255) {
+          octalStr = octalStr.slice(0, -1);
+          octal = parseInt(octalStr, 8);
+        }
+        this.pos += octalStr.length - 1;
+        ch = this.input.charCodeAt(this.pos);
+        if ((octalStr !== "0" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {
+          this.invalidStringToken(
+            this.pos - 1 - octalStr.length,
+            inTemplate
+              ? "Octal literal in template string"
+              : "Octal literal in strict mode"
+          );
+        }
+        return String.fromCharCode(octal)
+      }
+      if (isNewLine(ch)) {
+        // Unicode new line characters after \ get removed from output in both
+        // template literals and strings
+        return ""
+      }
+      return String.fromCharCode(ch)
+    }
+  };
+
+  // Used to read character escape sequences ('\x', '\u', '\U').
+
+  pp$9.readHexChar = function(len) {
+    var codePos = this.pos;
+    var n = this.readInt(16, len);
+    if (n === null) { this.invalidStringToken(codePos, "Bad character escape sequence"); }
+    return n
+  };
+
+  // Read an identifier, and return it as a string. Sets `this.containsEsc`
+  // to whether the word contained a '\u' escape.
+  //
+  // Incrementally adds only escaped chars, adding other chunks as-is
+  // as a micro-optimization.
+
+  pp$9.readWord1 = function() {
+    this.containsEsc = false;
+    var word = "", first = true, chunkStart = this.pos;
+    var astral = this.options.ecmaVersion >= 6;
+    while (this.pos < this.input.length) {
+      var ch = this.fullCharCodeAtPos();
+      if (isIdentifierChar(ch, astral)) {
+        this.pos += ch <= 0xffff ? 1 : 2;
+      } else if (ch === 92) { // "\"
+        this.containsEsc = true;
+        word += this.input.slice(chunkStart, this.pos);
+        var escStart = this.pos;
+        if (this.input.charCodeAt(++this.pos) !== 117) // "u"
+          { this.invalidStringToken(this.pos, "Expecting Unicode escape sequence \\uXXXX"); }
+        ++this.pos;
+        var esc = this.readCodePoint();
+        if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
+          { this.invalidStringToken(escStart, "Invalid Unicode escape"); }
+        word += codePointToString$1(esc);
+        chunkStart = this.pos;
+      } else {
+        break
+      }
+      first = false;
+    }
+    return word + this.input.slice(chunkStart, this.pos)
+  };
+
+  // Read an identifier or keyword token. Will check for reserved
+  // words when necessary.
+
+  pp$9.readWord = function() {
+    var word = this.readWord1();
+    var type = types.name;
+    if (this.keywords.test(word)) {
+      if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword " + word); }
+      type = keywords$1[word];
+    }
+    return this.finishToken(type, word)
+  };
+
+  // Acorn is a tiny, fast JavaScript parser written in JavaScript.
+
+  var version = "7.0.0";
+
+  // The main exported interface (under `self.acorn` when in the
+  // browser) is a `parse` function that takes a code string and
+  // returns an abstract syntax tree as specified by [Mozilla parser
+  // API][api].
+  //
+  // [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
+
+  function parse(input, options) {
+    return Parser.parse(input, options)
+  }
+
+  // This function tries to parse a single expression at a given
+  // offset in a string. Useful for parsing mixed-language formats
+  // that embed JavaScript expressions.
+
+  function parseExpressionAt(input, pos, options) {
+    return Parser.parseExpressionAt(input, pos, options)
+  }
+
+  // Acorn is organized as a tokenizer and a recursive-descent parser.
+  // The `tokenizer` export provides an interface to the tokenizer.
+
+  function tokenizer(input, options) {
+    return Parser.tokenizer(input, options)
+  }
+
+  exports.Node = Node;
+  exports.Parser = Parser;
+  exports.Position = Position;
+  exports.SourceLocation = SourceLocation;
+  exports.TokContext = TokContext;
+  exports.Token = Token;
+  exports.TokenType = TokenType;
+  exports.defaultOptions = defaultOptions;
+  exports.getLineInfo = getLineInfo;
+  exports.isIdentifierChar = isIdentifierChar;
+  exports.isIdentifierStart = isIdentifierStart;
+  exports.isNewLine = isNewLine;
+  exports.keywordTypes = keywords$1;
+  exports.lineBreak = lineBreak;
+  exports.lineBreakG = lineBreakG;
+  exports.nonASCIIwhitespace = nonASCIIwhitespace;
+  exports.parse = parse;
+  exports.parseExpressionAt = parseExpressionAt;
+  exports.tokContexts = types$1;
+  exports.tokTypes = types;
+  exports.tokenizer = tokenizer;
+  exports.version = version;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/acorn/dist/acorn.js.map b/node_modules/acorn/dist/acorn.js.map
new file mode 100644
index 0000000..7b366e9
--- /dev/null
+++ b/node_modules/acorn/dist/acorn.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"acorn.js","sources":["../src/identifier.js","../src/tokentype.js","../src/whitespace.js","../src/util.js","../src/locutil.js","../src/options.js","../src/scopeflags.js","../src/state.js","../src/parseutil.js","../src/statement.js","../src/lval.js","../src/expression.js","../src/location.js","../src/scope.js","../src/node.js","../src/tokencontext.js","../src/unicode-property-data.js","../src/regexp.js","../src/tokenize.js","../src/index.js"],"sourcesContent":["// Reserved word lists for various dialects of the language\n\nexport const reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n}\n\n// And the keywords\n\nconst ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\"\n\nexport const keywords = {\n  5: ecma5AndLessKeywords,\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n}\n\nexport const keywordRelationalOperator = /^in(stanceof)?$/\n\n// ## Character categories\n\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point above 128.\n// Generated by `bin/generate-identifier-regex.js`.\n\nlet nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u08a0-\\u08b4\\u08b6-\\u08bd\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d05-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e87\\u0e88\\u0e8a\\u0e8d\\u0e94-\\u0e97\\u0e99-\\u0e9f\\u0ea1-\\u0ea3\\u0ea5\\u0ea7\\u0eaa\\u0eab\\u0ead-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u170c\\u170e-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4b\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf1\\u1cf5\\u1cf6\\u1d00-\\u1dbf\\u1e00-\\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\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2c2e\\u2c30-\\u2c5e\\u2c60-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31ba\\u31f0-\\u31ff\\u3400-\\u4db5\\u4e00-\\u9fef\\ua000-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7b9\\ua7f7-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab65\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\"\nlet nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u08d3-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b56\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d82\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0eb9\\u0ebb\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u1810-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf2-\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1df9\\u1dfb-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\"\n\nconst nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\")\nconst nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\")\n\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by bin/generate-identifier-regex.js\n\n// eslint-disable-next-line comma-spacing\nconst astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,190,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,54,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,86,26,230,43,117,63,32,0,257,0,11,39,8,0,22,0,12,39,3,3,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,68,12,0,67,12,65,1,31,6129,15,754,9486,286,82,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,4149,196,60,67,1213,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541]\n\n// eslint-disable-next-line comma-spacing\nconst astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,280,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1016,45,17,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,2214,6,110,6,6,9,792487,239]\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  let pos = 0x10000\n  for (let i = 0; i < set.length; i += 2) {\n    pos += set[i]\n    if (pos > code) return false\n    pos += set[i + 1]\n    if (pos >= code) return true\n  }\n}\n\n// Test whether a given character code starts an identifier.\n\nexport function isIdentifierStart(code, astral) {\n  if (code < 65) return code === 36\n  if (code < 91) return true\n  if (code < 97) return code === 95\n  if (code < 123) return true\n  if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code))\n  if (astral === false) return false\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nexport function isIdentifierChar(code, astral) {\n  if (code < 48) return code === 36\n  if (code < 58) return true\n  if (code < 65) return false\n  if (code < 91) return true\n  if (code < 97) return code === 95\n  if (code < 123) return true\n  if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code))\n  if (astral === false) return false\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n","// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nexport class TokenType {\n  constructor(label, conf = {}) {\n    this.label = label\n    this.keyword = conf.keyword\n    this.beforeExpr = !!conf.beforeExpr\n    this.startsExpr = !!conf.startsExpr\n    this.isLoop = !!conf.isLoop\n    this.isAssign = !!conf.isAssign\n    this.prefix = !!conf.prefix\n    this.postfix = !!conf.postfix\n    this.binop = conf.binop || null\n    this.updateContext = null\n  }\n}\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nconst beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true}\n\n// Map keyword names to token types.\n\nexport const keywords = {}\n\n// Succinct definitions of keyword token types\nfunction kw(name, options = {}) {\n  options.keyword = name\n  return keywords[name] = new TokenType(name, options)\n}\n\nexport const types = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\"),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n}\n","// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nexport const lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/\nexport const lineBreakG = new RegExp(lineBreak.source, \"g\")\n\nexport function isNewLine(code, ecma2019String) {\n  return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))\n}\n\nexport const nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/\n\nexport const skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g\n","const {hasOwnProperty, toString} = Object.prototype\n\n// Checks if an object has a property.\n\nexport function has(obj, propName) {\n  return hasOwnProperty.call(obj, propName)\n}\n\nexport const isArray = Array.isArray || ((obj) => (\n  toString.call(obj) === \"[object Array]\"\n))\n\nexport function wordsRegexp(words) {\n  return new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\")\n}\n","import {lineBreakG} from \"./whitespace\"\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nexport class Position {\n  constructor(line, col) {\n    this.line = line\n    this.column = col\n  }\n\n  offset(n) {\n    return new Position(this.line, this.column + n)\n  }\n}\n\nexport class SourceLocation {\n  constructor(p, start, end) {\n    this.start = start\n    this.end = end\n    if (p.sourceFile !== null) this.source = p.sourceFile\n  }\n}\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nexport function getLineInfo(input, offset) {\n  for (let line = 1, cur = 0;;) {\n    lineBreakG.lastIndex = cur\n    let match = lineBreakG.exec(input)\n    if (match && match.index < offset) {\n      ++line\n      cur = match.index + match[0].length\n    } else {\n      return new Position(line, offset - cur)\n    }\n  }\n}\n","import {has, isArray} from \"./util\"\nimport {SourceLocation} from \"./locutil\"\n\n// A second optional argument can be given to further configure\n// the parser process. These options are recognized:\n\nexport const defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10\n  // (2019). This influences support for strict mode, the set of\n  // reserved words, and support for new syntax features. The default\n  // is 9.\n  ecmaVersion: 9,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called\n  // when a semicolon is automatically inserted. It will be passed\n  // the position of the comma as an offset, and if `locations` is\n  // enabled, it is given the location as a `{line, column}` object\n  // as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program.\n  allowImportExportEverywhere: false,\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: false,\n  // When enabled, hashbang directive in the beginning of file\n  // is allowed and treated as a line comment.\n  allowHashBang: false,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback—that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback—that will corrupt its internal state.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n}\n\n// Interpret and default an options object\n\nexport function getOptions(opts) {\n  let options = {}\n\n  for (let opt in defaultOptions)\n    options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]\n\n  if (options.ecmaVersion >= 2015)\n    options.ecmaVersion -= 2009\n\n  if (options.allowReserved == null)\n    options.allowReserved = options.ecmaVersion < 5\n\n  if (isArray(options.onToken)) {\n    let tokens = options.onToken\n    options.onToken = (token) => tokens.push(token)\n  }\n  if (isArray(options.onComment))\n    options.onComment = pushComment(options, options.onComment)\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    let comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    }\n    if (options.locations)\n      comment.loc = new SourceLocation(this, startLoc, endLoc)\n    if (options.ranges)\n      comment.range = [start, end]\n    array.push(comment)\n  }\n}\n","// Each scope gets a bitset that may contain these flags\nexport const\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128\n\nexport function functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal and declareName to determine the type of a binding\nexport const\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5 // Special case for function names as bound inside the function\n","import {reservedWords, keywords} from \"./identifier\"\nimport {types as tt} from \"./tokentype\"\nimport {lineBreak} from \"./whitespace\"\nimport {getOptions} from \"./options\"\nimport {wordsRegexp} from \"./util\"\nimport {SCOPE_TOP, SCOPE_FUNCTION, SCOPE_ASYNC, SCOPE_GENERATOR, SCOPE_SUPER, SCOPE_DIRECT_SUPER} from \"./scopeflags\"\n\nexport class Parser {\n  constructor(options, input, startPos) {\n    this.options = options = getOptions(options)\n    this.sourceFile = options.sourceFile\n    this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : 5])\n    let reserved = \"\"\n    if (!options.allowReserved) {\n      for (let v = options.ecmaVersion;; v--)\n        if (reserved = reservedWords[v]) break\n      if (options.sourceType === \"module\") reserved += \" await\"\n    }\n    this.reservedWords = wordsRegexp(reserved)\n    let reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict\n    this.reservedWordsStrict = wordsRegexp(reservedStrict)\n    this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind)\n    this.input = String(input)\n\n    // Used to signal to callers of `readWord1` whether the word\n    // contained any escape sequences. This is needed because words with\n    // escape sequences must not be interpreted as keywords.\n    this.containsEsc = false\n\n    // Set up token state\n\n    // The current position of the tokenizer in the input.\n    if (startPos) {\n      this.pos = startPos\n      this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1\n      this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length\n    } else {\n      this.pos = this.lineStart = 0\n      this.curLine = 1\n    }\n\n    // Properties of the current token:\n    // Its type\n    this.type = tt.eof\n    // For tokens that include more information than their type, the value\n    this.value = null\n    // Its start and end offset\n    this.start = this.end = this.pos\n    // And, if locations are used, the {line, column} object\n    // corresponding to those offsets\n    this.startLoc = this.endLoc = this.curPosition()\n\n    // Position information for the previous token\n    this.lastTokEndLoc = this.lastTokStartLoc = null\n    this.lastTokStart = this.lastTokEnd = this.pos\n\n    // The context stack is used to superficially track syntactic\n    // context to predict whether a regular expression is allowed in a\n    // given position.\n    this.context = this.initialContext()\n    this.exprAllowed = true\n\n    // Figure out if it's a module code.\n    this.inModule = options.sourceType === \"module\"\n    this.strict = this.inModule || this.strictDirective(this.pos)\n\n    // Used to signify the start of a potential arrow function\n    this.potentialArrowAt = -1\n\n    // Positions to delayed-check that yield/await does not exist in default parameters.\n    this.yieldPos = this.awaitPos = this.awaitIdentPos = 0\n    // Labels in scope.\n    this.labels = []\n    // Thus-far undefined exports.\n    this.undefinedExports = {}\n\n    // If enabled, skip leading hashbang line.\n    if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n      this.skipLineComment(2)\n\n    // Scope tracking for duplicate variable names (see scope.js)\n    this.scopeStack = []\n    this.enterScope(SCOPE_TOP)\n\n    // For RegExp validation\n    this.regexpState = null\n  }\n\n  parse() {\n    let node = this.options.program || this.startNode()\n    this.nextToken()\n    return this.parseTopLevel(node)\n  }\n\n  get inFunction() { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 }\n  get inGenerator() { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 }\n  get inAsync() { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 }\n  get allowSuper() { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 }\n  get allowDirectSuper() { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 }\n  get treatFunctionsAsVar() { return this.treatFunctionsAsVarInScope(this.currentScope()) }\n\n  // Switch to a getter for 7.0.0.\n  inNonArrowFunction() { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 }\n\n  static extend(...plugins) {\n    let cls = this\n    for (let i = 0; i < plugins.length; i++) cls = plugins[i](cls)\n    return cls\n  }\n\n  static parse(input, options) {\n    return new this(options, input).parse()\n  }\n\n  static parseExpressionAt(input, pos, options) {\n    let parser = new this(options, input, pos)\n    parser.nextToken()\n    return parser.parseExpression()\n  }\n\n  static tokenizer(input, options) {\n    return new this(options, input)\n  }\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {lineBreak, skipWhiteSpace} from \"./whitespace\"\n\nconst pp = Parser.prototype\n\n// ## Parser utilities\n\nconst literal = /^(?:'((?:\\\\.|[^'])*?)'|\"((?:\\\\.|[^\"])*?)\")/\npp.strictDirective = function(start) {\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start\n    start += skipWhiteSpace.exec(this.input)[0].length\n    let match = literal.exec(this.input.slice(start))\n    if (!match) return false\n    if ((match[1] || match[2]) === \"use strict\") return true\n    start += match[0].length\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start\n    start += skipWhiteSpace.exec(this.input)[0].length\n    if (this.input[start] === \";\")\n      start++\n  }\n}\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp.eat = function(type) {\n  if (this.type === type) {\n    this.next()\n    return true\n  } else {\n    return false\n  }\n}\n\n// Tests whether parsed token is a contextual keyword.\n\npp.isContextual = function(name) {\n  return this.type === tt.name && this.value === name && !this.containsEsc\n}\n\n// Consumes contextual keyword if possible.\n\npp.eatContextual = function(name) {\n  if (!this.isContextual(name)) return false\n  this.next()\n  return true\n}\n\n// Asserts that following token is given contextual keyword.\n\npp.expectContextual = function(name) {\n  if (!this.eatContextual(name)) this.unexpected()\n}\n\n// Test whether a semicolon can be inserted at the current position.\n\npp.canInsertSemicolon = function() {\n  return this.type === tt.eof ||\n    this.type === tt.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n}\n\npp.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc)\n    return true\n  }\n}\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp.semicolon = function() {\n  if (!this.eat(tt.semi) && !this.insertSemicolon()) this.unexpected()\n}\n\npp.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc)\n    if (!notNext)\n      this.next()\n    return true\n  }\n}\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp.expect = function(type) {\n  this.eat(type) || this.unexpected()\n}\n\n// Raise an unexpected token error.\n\npp.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\")\n}\n\nexport function DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1\n}\n\npp.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) return\n  if (refDestructuringErrors.trailingComma > -1)\n    this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\")\n  let parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind\n  if (parens > -1) this.raiseRecoverable(parens, \"Parenthesized pattern\")\n}\n\npp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) return false\n  let {shorthandAssign, doubleProto} = refDestructuringErrors\n  if (!andThrow) return shorthandAssign >= 0 || doubleProto >= 0\n  if (shorthandAssign >= 0)\n    this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\")\n  if (doubleProto >= 0)\n    this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\")\n}\n\npp.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    this.raise(this.yieldPos, \"Yield expression cannot be a default value\")\n  if (this.awaitPos)\n    this.raise(this.awaitPos, \"Await expression cannot be a default value\")\n}\n\npp.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    return this.isSimpleAssignTarget(expr.expression)\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {lineBreak, skipWhiteSpace} from \"./whitespace\"\nimport {isIdentifierStart, isIdentifierChar, keywordRelationalOperator} from \"./identifier\"\nimport {has} from \"./util\"\nimport {DestructuringErrors} from \"./parseutil\"\nimport {functionFlags, SCOPE_SIMPLE_CATCH, BIND_SIMPLE_CATCH, BIND_LEXICAL, BIND_VAR, BIND_FUNCTION} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp.parseTopLevel = function(node) {\n  let exports = {}\n  if (!node.body) node.body = []\n  while (this.type !== tt.eof) {\n    let stmt = this.parseStatement(null, true, exports)\n    node.body.push(stmt)\n  }\n  if (this.inModule)\n    for (let name of Object.keys(this.undefinedExports))\n      this.raiseRecoverable(this.undefinedExports[name].start, `Export '${name}' is not defined`)\n  this.adaptDirectivePrologue(node.body)\n  this.next()\n  if (this.options.ecmaVersion >= 6) {\n    node.sourceType = this.options.sourceType\n  }\n  return this.finishNode(node, \"Program\")\n}\n\nconst loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"}\n\npp.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) return false\n  skipWhiteSpace.lastIndex = this.pos\n  let skip = skipWhiteSpace.exec(this.input)\n  let next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next)\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91) return true // '['\n  if (context) return false\n\n  if (nextCh === 123) return true // '{'\n  if (isIdentifierStart(nextCh, true)) {\n    let pos = next + 1\n    while (isIdentifierChar(this.input.charCodeAt(pos), true)) ++pos\n    let ident = this.input.slice(next, pos)\n    if (!keywordRelationalOperator.test(ident)) return true\n  }\n  return false\n}\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    return false\n\n  skipWhiteSpace.lastIndex = this.pos\n  let skip = skipWhiteSpace.exec(this.input)\n  let next = this.pos + skip[0].length\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))\n}\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp.parseStatement = function(context, topLevel, exports) {\n  let starttype = this.type, node = this.startNode(), kind\n\n  if (this.isLet(context)) {\n    starttype = tt._var\n    kind = \"let\"\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case tt._break: case tt._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case tt._debugger: return this.parseDebuggerStatement(node)\n  case tt._do: return this.parseDoStatement(node)\n  case tt._for: return this.parseForStatement(node)\n  case tt._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) this.unexpected()\n    return this.parseFunctionStatement(node, false, !context)\n  case tt._class:\n    if (context) this.unexpected()\n    return this.parseClass(node, true)\n  case tt._if: return this.parseIfStatement(node)\n  case tt._return: return this.parseReturnStatement(node)\n  case tt._switch: return this.parseSwitchStatement(node)\n  case tt._throw: return this.parseThrowStatement(node)\n  case tt._try: return this.parseTryStatement(node)\n  case tt._const: case tt._var:\n    kind = kind || this.value\n    if (context && kind !== \"var\") this.unexpected()\n    return this.parseVarStatement(node, kind)\n  case tt._while: return this.parseWhileStatement(node)\n  case tt._with: return this.parseWithStatement(node)\n  case tt.braceL: return this.parseBlock(true, node)\n  case tt.semi: return this.parseEmptyStatement(node)\n  case tt._export:\n  case tt._import:\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        this.raise(this.start, \"'import' and 'export' may only appear at the top level\")\n      if (!this.inModule)\n        this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\")\n    }\n    return starttype === tt._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) this.unexpected()\n      this.next()\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    let maybeName = this.value, expr = this.parseExpression()\n    if (starttype === tt.name && expr.type === \"Identifier\" && this.eat(tt.colon))\n      return this.parseLabeledStatement(node, maybeName, expr, context)\n    else return this.parseExpressionStatement(node, expr)\n  }\n}\n\npp.parseBreakContinueStatement = function(node, keyword) {\n  let isBreak = keyword === \"break\"\n  this.next()\n  if (this.eat(tt.semi) || this.insertSemicolon()) node.label = null\n  else if (this.type !== tt.name) this.unexpected()\n  else {\n    node.label = this.parseIdent()\n    this.semicolon()\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  let i = 0\n  for (; i < this.labels.length; ++i) {\n    let lab = this.labels[i]\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) break\n      if (node.label && isBreak) break\n    }\n  }\n  if (i === this.labels.length) this.raise(node.start, \"Unsyntactic \" + keyword)\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n}\n\npp.parseDebuggerStatement = function(node) {\n  this.next()\n  this.semicolon()\n  return this.finishNode(node, \"DebuggerStatement\")\n}\n\npp.parseDoStatement = function(node) {\n  this.next()\n  this.labels.push(loopLabel)\n  node.body = this.parseStatement(\"do\")\n  this.labels.pop()\n  this.expect(tt._while)\n  node.test = this.parseParenExpression()\n  if (this.options.ecmaVersion >= 6)\n    this.eat(tt.semi)\n  else\n    this.semicolon()\n  return this.finishNode(node, \"DoWhileStatement\")\n}\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp.parseForStatement = function(node) {\n  this.next()\n  let awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual(\"await\")) ? this.lastTokStart : -1\n  this.labels.push(loopLabel)\n  this.enterScope(0)\n  this.expect(tt.parenL)\n  if (this.type === tt.semi) {\n    if (awaitAt > -1) this.unexpected(awaitAt)\n    return this.parseFor(node, null)\n  }\n  let isLet = this.isLet()\n  if (this.type === tt._var || this.type === tt._const || isLet) {\n    let init = this.startNode(), kind = isLet ? \"let\" : this.value\n    this.next()\n    this.parseVar(init, true, kind)\n    this.finishNode(init, \"VariableDeclaration\")\n    if ((this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init.declarations.length === 1 &&\n        !(kind !== \"var\" && init.declarations[0].init)) {\n      if (this.options.ecmaVersion >= 9) {\n        if (this.type === tt._in) {\n          if (awaitAt > -1) this.unexpected(awaitAt)\n        } else node.await = awaitAt > -1\n      }\n      return this.parseForIn(node, init)\n    }\n    if (awaitAt > -1) this.unexpected(awaitAt)\n    return this.parseFor(node, init)\n  }\n  let refDestructuringErrors = new DestructuringErrors\n  let init = this.parseExpression(true, refDestructuringErrors)\n  if (this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === tt._in) {\n        if (awaitAt > -1) this.unexpected(awaitAt)\n      } else node.await = awaitAt > -1\n    }\n    this.toAssignable(init, false, refDestructuringErrors)\n    this.checkLVal(init)\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true)\n  }\n  if (awaitAt > -1) this.unexpected(awaitAt)\n  return this.parseFor(node, init)\n}\n\npp.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next()\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n}\n\npp.parseIfStatement = function(node) {\n  this.next()\n  node.test = this.parseParenExpression()\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\")\n  node.alternate = this.eat(tt._else) ? this.parseStatement(\"if\") : null\n  return this.finishNode(node, \"IfStatement\")\n}\n\npp.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    this.raise(this.start, \"'return' outside of function\")\n  this.next()\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(tt.semi) || this.insertSemicolon()) node.argument = null\n  else { node.argument = this.parseExpression(); this.semicolon() }\n  return this.finishNode(node, \"ReturnStatement\")\n}\n\npp.parseSwitchStatement = function(node) {\n  this.next()\n  node.discriminant = this.parseParenExpression()\n  node.cases = []\n  this.expect(tt.braceL)\n  this.labels.push(switchLabel)\n  this.enterScope(0)\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  let cur\n  for (let sawDefault = false; this.type !== tt.braceR;) {\n    if (this.type === tt._case || this.type === tt._default) {\n      let isCase = this.type === tt._case\n      if (cur) this.finishNode(cur, \"SwitchCase\")\n      node.cases.push(cur = this.startNode())\n      cur.consequent = []\n      this.next()\n      if (isCase) {\n        cur.test = this.parseExpression()\n      } else {\n        if (sawDefault) this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\")\n        sawDefault = true\n        cur.test = null\n      }\n      this.expect(tt.colon)\n    } else {\n      if (!cur) this.unexpected()\n      cur.consequent.push(this.parseStatement(null))\n    }\n  }\n  this.exitScope()\n  if (cur) this.finishNode(cur, \"SwitchCase\")\n  this.next() // Closing brace\n  this.labels.pop()\n  return this.finishNode(node, \"SwitchStatement\")\n}\n\npp.parseThrowStatement = function(node) {\n  this.next()\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    this.raise(this.lastTokEnd, \"Illegal newline after throw\")\n  node.argument = this.parseExpression()\n  this.semicolon()\n  return this.finishNode(node, \"ThrowStatement\")\n}\n\n// Reused empty array added for node fields that are always empty.\n\nconst empty = []\n\npp.parseTryStatement = function(node) {\n  this.next()\n  node.block = this.parseBlock()\n  node.handler = null\n  if (this.type === tt._catch) {\n    let clause = this.startNode()\n    this.next()\n    if (this.eat(tt.parenL)) {\n      clause.param = this.parseBindingAtom()\n      let simple = clause.param.type === \"Identifier\"\n      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0)\n      this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL)\n      this.expect(tt.parenR)\n    } else {\n      if (this.options.ecmaVersion < 10) this.unexpected()\n      clause.param = null\n      this.enterScope(0)\n    }\n    clause.body = this.parseBlock(false)\n    this.exitScope()\n    node.handler = this.finishNode(clause, \"CatchClause\")\n  }\n  node.finalizer = this.eat(tt._finally) ? this.parseBlock() : null\n  if (!node.handler && !node.finalizer)\n    this.raise(node.start, \"Missing catch or finally clause\")\n  return this.finishNode(node, \"TryStatement\")\n}\n\npp.parseVarStatement = function(node, kind) {\n  this.next()\n  this.parseVar(node, false, kind)\n  this.semicolon()\n  return this.finishNode(node, \"VariableDeclaration\")\n}\n\npp.parseWhileStatement = function(node) {\n  this.next()\n  node.test = this.parseParenExpression()\n  this.labels.push(loopLabel)\n  node.body = this.parseStatement(\"while\")\n  this.labels.pop()\n  return this.finishNode(node, \"WhileStatement\")\n}\n\npp.parseWithStatement = function(node) {\n  if (this.strict) this.raise(this.start, \"'with' in strict mode\")\n  this.next()\n  node.object = this.parseParenExpression()\n  node.body = this.parseStatement(\"with\")\n  return this.finishNode(node, \"WithStatement\")\n}\n\npp.parseEmptyStatement = function(node) {\n  this.next()\n  return this.finishNode(node, \"EmptyStatement\")\n}\n\npp.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (let label of this.labels)\n    if (label.name === maybeName)\n      this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\")\n  let kind = this.type.isLoop ? \"loop\" : this.type === tt._switch ? \"switch\" : null\n  for (let i = this.labels.length - 1; i >= 0; i--) {\n    let label = this.labels[i]\n    if (label.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label.statementStart = this.start\n      label.kind = kind\n    } else break\n  }\n  this.labels.push({name: maybeName, kind, statementStart: this.start})\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\")\n  this.labels.pop()\n  node.label = expr\n  return this.finishNode(node, \"LabeledStatement\")\n}\n\npp.parseExpressionStatement = function(node, expr) {\n  node.expression = expr\n  this.semicolon()\n  return this.finishNode(node, \"ExpressionStatement\")\n}\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp.parseBlock = function(createNewLexicalScope = true, node = this.startNode()) {\n  node.body = []\n  this.expect(tt.braceL)\n  if (createNewLexicalScope) this.enterScope(0)\n  while (!this.eat(tt.braceR)) {\n    let stmt = this.parseStatement(null)\n    node.body.push(stmt)\n  }\n  if (createNewLexicalScope) this.exitScope()\n  return this.finishNode(node, \"BlockStatement\")\n}\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp.parseFor = function(node, init) {\n  node.init = init\n  this.expect(tt.semi)\n  node.test = this.type === tt.semi ? null : this.parseExpression()\n  this.expect(tt.semi)\n  node.update = this.type === tt.parenR ? null : this.parseExpression()\n  this.expect(tt.parenR)\n  node.body = this.parseStatement(\"for\")\n  this.exitScope()\n  this.labels.pop()\n  return this.finishNode(node, \"ForStatement\")\n}\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp.parseForIn = function(node, init) {\n  let type = this.type === tt._in ? \"ForInStatement\" : \"ForOfStatement\"\n  this.next()\n  if (type === \"ForInStatement\") {\n    if (init.type === \"AssignmentPattern\" ||\n      (init.type === \"VariableDeclaration\" && init.declarations[0].init != null &&\n       (this.strict || init.declarations[0].id.type !== \"Identifier\")))\n      this.raise(init.start, \"Invalid assignment in for-in loop head\")\n  }\n  node.left = init\n  node.right = type === \"ForInStatement\" ? this.parseExpression() : this.parseMaybeAssign()\n  this.expect(tt.parenR)\n  node.body = this.parseStatement(\"for\")\n  this.exitScope()\n  this.labels.pop()\n  return this.finishNode(node, type)\n}\n\n// Parse a list of variable declarations.\n\npp.parseVar = function(node, isFor, kind) {\n  node.declarations = []\n  node.kind = kind\n  for (;;) {\n    let decl = this.startNode()\n    this.parseVarId(decl, kind)\n    if (this.eat(tt.eq)) {\n      decl.init = this.parseMaybeAssign(isFor)\n    } else if (kind === \"const\" && !(this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected()\n    } else if (decl.id.type !== \"Identifier\" && !(isFor && (this.type === tt._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\")\n    } else {\n      decl.init = null\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"))\n    if (!this.eat(tt.comma)) break\n  }\n  return node\n}\n\npp.parseVarId = function(decl, kind) {\n  if ((kind === \"const\" || kind === \"let\") && this.isContextual(\"let\")) {\n    this.raiseRecoverable(this.start, \"let is disallowed as a lexically bound name\")\n  }\n  decl.id = this.parseBindingAtom()\n  this.checkLVal(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false)\n}\n\nconst FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp.parseFunction = function(node, statement, allowExpressionBody, isAsync) {\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === tt.star && (statement & FUNC_HANGING_STATEMENT))\n      this.unexpected()\n    node.generator = this.eat(tt.star)\n  }\n  if (this.options.ecmaVersion >= 8)\n    node.async = !!isAsync\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== tt.name ? null : this.parseIdent()\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION)\n  }\n\n  let oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n  this.enterScope(functionFlags(node.async, node.generator))\n\n  if (!(statement & FUNC_STATEMENT))\n    node.id = this.type === tt.name ? this.parseIdent() : null\n\n  this.parseFunctionParams(node)\n  this.parseFunctionBody(node, allowExpressionBody, false)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n}\n\npp.parseFunctionParams = function(node) {\n  this.expect(tt.parenL)\n  node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8)\n  this.checkYieldAwaitInDefaultParams()\n}\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp.parseClass = function(node, isStatement) {\n  this.next()\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  const oldStrict = this.strict\n  this.strict = true\n\n  this.parseClassId(node, isStatement)\n  this.parseClassSuper(node)\n  let classBody = this.startNode()\n  let hadConstructor = false\n  classBody.body = []\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    const element = this.parseClassElement(node.superClass !== null)\n    if (element) {\n      classBody.body.push(element)\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) this.raise(element.start, \"Duplicate constructor in the same class\")\n        hadConstructor = true\n      }\n    }\n  }\n  node.body = this.finishNode(classBody, \"ClassBody\")\n  this.strict = oldStrict\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n}\n\npp.parseClassElement = function(constructorAllowsSuper) {\n  if (this.eat(tt.semi)) return null\n\n  let method = this.startNode()\n  const tryContextual = (k, noLineBreak = false) => {\n    const start = this.start, startLoc = this.startLoc\n    if (!this.eatContextual(k)) return false\n    if (this.type !== tt.parenL && (!noLineBreak || !this.canInsertSemicolon())) return true\n    if (method.key) this.unexpected()\n    method.computed = false\n    method.key = this.startNodeAt(start, startLoc)\n    method.key.name = k\n    this.finishNode(method.key, \"Identifier\")\n    return false\n  }\n\n  method.kind = \"method\"\n  method.static = tryContextual(\"static\")\n  let isGenerator = this.eat(tt.star)\n  let isAsync = false\n  if (!isGenerator) {\n    if (this.options.ecmaVersion >= 8 && tryContextual(\"async\", true)) {\n      isAsync = true\n      isGenerator = this.options.ecmaVersion >= 9 && this.eat(tt.star)\n    } else if (tryContextual(\"get\")) {\n      method.kind = \"get\"\n    } else if (tryContextual(\"set\")) {\n      method.kind = \"set\"\n    }\n  }\n  if (!method.key) this.parsePropertyName(method)\n  let {key} = method\n  let allowsDirectSuper = false\n  if (!method.computed && !method.static && (key.type === \"Identifier\" && key.name === \"constructor\" ||\n      key.type === \"Literal\" && key.value === \"constructor\")) {\n    if (method.kind !== \"method\") this.raise(key.start, \"Constructor can't have get/set modifier\")\n    if (isGenerator) this.raise(key.start, \"Constructor can't be a generator\")\n    if (isAsync) this.raise(key.start, \"Constructor can't be an async method\")\n    method.kind = \"constructor\"\n    allowsDirectSuper = constructorAllowsSuper\n  } else if (method.static && key.type === \"Identifier\" && key.name === \"prototype\") {\n    this.raise(key.start, \"Classes may not have a static property named prototype\")\n  }\n  this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper)\n  if (method.kind === \"get\" && method.value.params.length !== 0)\n    this.raiseRecoverable(method.value.start, \"getter should have no params\")\n  if (method.kind === \"set\" && method.value.params.length !== 1)\n    this.raiseRecoverable(method.value.start, \"setter should have exactly one param\")\n  if (method.kind === \"set\" && method.value.params[0].type === \"RestElement\")\n    this.raiseRecoverable(method.value.params[0].start, \"Setter cannot use rest params\")\n  return method\n}\n\npp.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper)\n  return this.finishNode(method, \"MethodDefinition\")\n}\n\npp.parseClassId = function(node, isStatement) {\n  if (this.type === tt.name) {\n    node.id = this.parseIdent()\n    if (isStatement)\n      this.checkLVal(node.id, BIND_LEXICAL, false)\n  } else {\n    if (isStatement === true)\n      this.unexpected()\n    node.id = null\n  }\n}\n\npp.parseClassSuper = function(node) {\n  node.superClass = this.eat(tt._extends) ? this.parseExprSubscripts() : null\n}\n\n// Parses module export declaration.\n\npp.parseExport = function(node, exports) {\n  this.next()\n  // export * from '...'\n  if (this.eat(tt.star)) {\n    this.expectContextual(\"from\")\n    if (this.type !== tt.string) this.unexpected()\n    node.source = this.parseExprAtom()\n    this.semicolon()\n    return this.finishNode(node, \"ExportAllDeclaration\")\n  }\n  if (this.eat(tt._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart)\n    let isAsync\n    if (this.type === tt._function || (isAsync = this.isAsyncFunction())) {\n      let fNode = this.startNode()\n      this.next()\n      if (isAsync) this.next()\n      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync)\n    } else if (this.type === tt._class) {\n      let cNode = this.startNode()\n      node.declaration = this.parseClass(cNode, \"nullableID\")\n    } else {\n      node.declaration = this.parseMaybeAssign()\n      this.semicolon()\n    }\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseStatement(null)\n    if (node.declaration.type === \"VariableDeclaration\")\n      this.checkVariableExport(exports, node.declaration.declarations)\n    else\n      this.checkExport(exports, node.declaration.id.name, node.declaration.id.start)\n    node.specifiers = []\n    node.source = null\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null\n    node.specifiers = this.parseExportSpecifiers(exports)\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== tt.string) this.unexpected()\n      node.source = this.parseExprAtom()\n    } else {\n      for (let spec of node.specifiers) {\n        // check for keywords used as local names\n        this.checkUnreserved(spec.local)\n        // check if export is defined\n        this.checkLocalExport(spec.local)\n      }\n\n      node.source = null\n    }\n    this.semicolon()\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n}\n\npp.checkExport = function(exports, name, pos) {\n  if (!exports) return\n  if (has(exports, name))\n    this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\")\n  exports[name] = true\n}\n\npp.checkPatternExport = function(exports, pat) {\n  let type = pat.type\n  if (type === \"Identifier\")\n    this.checkExport(exports, pat.name, pat.start)\n  else if (type === \"ObjectPattern\")\n    for (let prop of pat.properties)\n      this.checkPatternExport(exports, prop)\n  else if (type === \"ArrayPattern\")\n    for (let elt of pat.elements) {\n      if (elt) this.checkPatternExport(exports, elt)\n    }\n  else if (type === \"Property\")\n    this.checkPatternExport(exports, pat.value)\n  else if (type === \"AssignmentPattern\")\n    this.checkPatternExport(exports, pat.left)\n  else if (type === \"RestElement\")\n    this.checkPatternExport(exports, pat.argument)\n  else if (type === \"ParenthesizedExpression\")\n    this.checkPatternExport(exports, pat.expression)\n}\n\npp.checkVariableExport = function(exports, decls) {\n  if (!exports) return\n  for (let decl of decls)\n    this.checkPatternExport(exports, decl.id)\n}\n\npp.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n}\n\n// Parses a comma-separated list of module exports.\n\npp.parseExportSpecifiers = function(exports) {\n  let nodes = [], first = true\n  // export { x, y as z } [from '...']\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    let node = this.startNode()\n    node.local = this.parseIdent(true)\n    node.exported = this.eatContextual(\"as\") ? this.parseIdent(true) : node.local\n    this.checkExport(exports, node.exported.name, node.exported.start)\n    nodes.push(this.finishNode(node, \"ExportSpecifier\"))\n  }\n  return nodes\n}\n\n// Parses import declaration.\n\npp.parseImport = function(node) {\n  this.next()\n  // import '...'\n  if (this.type === tt.string) {\n    node.specifiers = empty\n    node.source = this.parseExprAtom()\n  } else {\n    node.specifiers = this.parseImportSpecifiers()\n    this.expectContextual(\"from\")\n    node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected()\n  }\n  this.semicolon()\n  return this.finishNode(node, \"ImportDeclaration\")\n}\n\n// Parses a comma-separated list of module imports.\n\npp.parseImportSpecifiers = function() {\n  let nodes = [], first = true\n  if (this.type === tt.name) {\n    // import defaultObj, { x, y as z } from '...'\n    let node = this.startNode()\n    node.local = this.parseIdent()\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportDefaultSpecifier\"))\n    if (!this.eat(tt.comma)) return nodes\n  }\n  if (this.type === tt.star) {\n    let node = this.startNode()\n    this.next()\n    this.expectContextual(\"as\")\n    node.local = this.parseIdent()\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportNamespaceSpecifier\"))\n    return nodes\n  }\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    let node = this.startNode()\n    node.imported = this.parseIdent(true)\n    if (this.eatContextual(\"as\")) {\n      node.local = this.parseIdent()\n    } else {\n      this.checkUnreserved(node.imported)\n      node.local = node.imported\n    }\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportSpecifier\"))\n  }\n  return nodes\n}\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp.adaptDirectivePrologue = function(statements) {\n  for (let i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1)\n  }\n}\npp.isDirectiveCandidate = function(statement) {\n  return (\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {has} from \"./util\"\nimport {BIND_NONE, BIND_OUTSIDE} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\")\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\"\n      if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n      for (let prop of node.properties) {\n        this.toAssignable(prop, isBinding)\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\")\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") this.raise(node.key.start, \"Object pattern can't contain getter or setter\")\n      this.toAssignable(node.value, isBinding)\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\"\n      if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n      this.toAssignableList(node.elements, isBinding)\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\"\n      this.toAssignable(node.argument, isBinding)\n      if (node.argument.type === \"AssignmentPattern\")\n        this.raise(node.argument.start, \"Rest elements cannot have a default value\")\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\")\n      node.type = \"AssignmentPattern\"\n      delete node.operator\n      this.toAssignable(node.left, isBinding)\n      // falls through to AssignmentPattern\n\n    case \"AssignmentPattern\":\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors)\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) break\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\")\n    }\n  } else if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n  return node\n}\n\n// Convert list of expression atoms to binding list.\n\npp.toAssignableList = function(exprList, isBinding) {\n  let end = exprList.length\n  for (let i = 0; i < end; i++) {\n    let elt = exprList[i]\n    if (elt) this.toAssignable(elt, isBinding)\n  }\n  if (end) {\n    let last = exprList[end - 1]\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      this.unexpected(last.argument.start)\n  }\n  return exprList\n}\n\n// Parses spread element.\n\npp.parseSpread = function(refDestructuringErrors) {\n  let node = this.startNode()\n  this.next()\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors)\n  return this.finishNode(node, \"SpreadElement\")\n}\n\npp.parseRestBinding = function() {\n  let node = this.startNode()\n  this.next()\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== tt.name)\n    this.unexpected()\n\n  node.argument = this.parseBindingAtom()\n\n  return this.finishNode(node, \"RestElement\")\n}\n\n// Parses lvalue (assignable) atom.\n\npp.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case tt.bracketL:\n      let node = this.startNode()\n      this.next()\n      node.elements = this.parseBindingList(tt.bracketR, true, true)\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case tt.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n}\n\npp.parseBindingList = function(close, allowEmpty, allowTrailingComma) {\n  let elts = [], first = true\n  while (!this.eat(close)) {\n    if (first) first = false\n    else this.expect(tt.comma)\n    if (allowEmpty && this.type === tt.comma) {\n      elts.push(null)\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === tt.ellipsis) {\n      let rest = this.parseRestBinding()\n      this.parseBindingListItem(rest)\n      elts.push(rest)\n      if (this.type === tt.comma) this.raise(this.start, \"Comma is not permitted after the rest element\")\n      this.expect(close)\n      break\n    } else {\n      let elem = this.parseMaybeDefault(this.start, this.startLoc)\n      this.parseBindingListItem(elem)\n      elts.push(elem)\n    }\n  }\n  return elts\n}\n\npp.parseBindingListItem = function(param) {\n  return param\n}\n\n// Parses assignment pattern around given atom if possible.\n\npp.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom()\n  if (this.options.ecmaVersion < 6 || !this.eat(tt.eq)) return left\n  let node = this.startNodeAt(startPos, startLoc)\n  node.left = left\n  node.right = this.parseMaybeAssign()\n  return this.finishNode(node, \"AssignmentPattern\")\n}\n\n// Verify that a node is an lval — something that can be assigned\n// to.\n// bindingType can be either:\n// 'var' indicating that the lval creates a 'var' binding\n// 'let' indicating that the lval creates a lexical ('let' or 'const') binding\n// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references\n\npp.checkLVal = function(expr, bindingType = BIND_NONE, checkClashes) {\n  switch (expr.type) {\n  case \"Identifier\":\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      this.raiseRecoverable(expr.start, (bindingType ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\")\n    if (checkClashes) {\n      if (has(checkClashes, expr.name))\n        this.raiseRecoverable(expr.start, \"Argument name clash\")\n      checkClashes[expr.name] = true\n    }\n    if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) this.declareName(expr.name, bindingType, expr.start)\n    break\n\n  case \"MemberExpression\":\n    if (bindingType) this.raiseRecoverable(expr.start, \"Binding member expression\")\n    break\n\n  case \"ObjectPattern\":\n    for (let prop of expr.properties)\n      this.checkLVal(prop, bindingType, checkClashes)\n    break\n\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLVal(expr.value, bindingType, checkClashes)\n    break\n\n  case \"ArrayPattern\":\n    for (let elem of expr.elements) {\n      if (elem) this.checkLVal(elem, bindingType, checkClashes)\n    }\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLVal(expr.left, bindingType, checkClashes)\n    break\n\n  case \"RestElement\":\n    this.checkLVal(expr.argument, bindingType, checkClashes)\n    break\n\n  case \"ParenthesizedExpression\":\n    this.checkLVal(expr.expression, bindingType, checkClashes)\n    break\n\n  default:\n    this.raise(expr.start, (bindingType ? \"Binding\" : \"Assigning to\") + \" rvalue\")\n  }\n}\n","// A recursive descent parser operates by defining functions for all\n// syntactic elements, and recursively calling those, each function\n// advancing the input stream and returning an AST node. Precedence\n// of constructs (for example, the fact that `!x[1]` means `!(x[1])`\n// instead of `(!x)[1]` is handled by the fact that the parser\n// function that parses unary prefix operators is called first, and\n// in turn calls the function that parses `[]` subscripts — that\n// way, it'll receive the node for `x[1]` already parsed, and wraps\n// *that* in the unary operator node.\n//\n// Acorn uses an [operator precedence parser][opp] to handle binary\n// operator precedence, because it is much more compact than using\n// the technique outlined above, which uses different, nesting\n// functions to specify precedence, for all of the ten binary\n// precedence levels that JavaScript defines.\n//\n// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser\n\nimport {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {DestructuringErrors} from \"./parseutil\"\nimport {lineBreak} from \"./whitespace\"\nimport {functionFlags, SCOPE_ARROW, SCOPE_SUPER, SCOPE_DIRECT_SUPER, BIND_OUTSIDE, BIND_VAR} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    return\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    return\n  let {key} = prop, name\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  let {kind} = prop\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors && refDestructuringErrors.doubleProto < 0) refDestructuringErrors.doubleProto = key.start\n        // Backwards-compat kludge. Can be removed in version 6.0\n        else this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\")\n      }\n      propHash.proto = true\n    }\n    return\n  }\n  name = \"$\" + name\n  let other = propHash[name]\n  if (other) {\n    let redefinition\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set\n    } else {\n      redefinition = other.init || other[kind]\n    }\n    if (redefinition)\n      this.raiseRecoverable(key.start, \"Redefinition of property\")\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    }\n  }\n  other[kind] = true\n}\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp.parseExpression = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseMaybeAssign(noIn, refDestructuringErrors)\n  if (this.type === tt.comma) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.expressions = [expr]\n    while (this.eat(tt.comma)) node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors))\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n}\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) return this.parseYield(noIn)\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else this.exprAllowed = false\n  }\n\n  let ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldShorthandAssign = -1\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign\n    oldTrailingComma = refDestructuringErrors.trailingComma\n    oldShorthandAssign = refDestructuringErrors.shorthandAssign\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.shorthandAssign = -1\n  } else {\n    refDestructuringErrors = new DestructuringErrors\n    ownDestructuringErrors = true\n  }\n\n  let startPos = this.start, startLoc = this.startLoc\n  if (this.type === tt.parenL || this.type === tt.name)\n    this.potentialArrowAt = this.start\n  let left = this.parseMaybeConditional(noIn, refDestructuringErrors)\n  if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc)\n  if (this.type.isAssign) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.operator = this.value\n    node.left = this.type === tt.eq ? this.toAssignable(left, false, refDestructuringErrors) : left\n    if (!ownDestructuringErrors) DestructuringErrors.call(refDestructuringErrors)\n    refDestructuringErrors.shorthandAssign = -1 // reset because shorthand default was used correctly\n    this.checkLVal(left)\n    this.next()\n    node.right = this.parseMaybeAssign(noIn)\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) this.checkExpressionErrors(refDestructuringErrors, true)\n  }\n  if (oldParenAssign > -1) refDestructuringErrors.parenthesizedAssign = oldParenAssign\n  if (oldTrailingComma > -1) refDestructuringErrors.trailingComma = oldTrailingComma\n  if (oldShorthandAssign > -1) refDestructuringErrors.shorthandAssign = oldShorthandAssign\n  return left\n}\n\n// Parse a ternary conditional (`?:`) operator.\n\npp.parseMaybeConditional = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseExprOps(noIn, refDestructuringErrors)\n  if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n  if (this.eat(tt.question)) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.test = expr\n    node.consequent = this.parseMaybeAssign()\n    this.expect(tt.colon)\n    node.alternate = this.parseMaybeAssign(noIn)\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n}\n\n// Start the precedence parser.\n\npp.parseExprOps = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseMaybeUnary(refDestructuringErrors, false)\n  if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)\n}\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {\n  let prec = this.type.binop\n  if (prec != null && (!noIn || this.type !== tt._in)) {\n    if (prec > minPrec) {\n      let logical = this.type === tt.logicalOR || this.type === tt.logicalAND\n      let op = this.value\n      this.next()\n      let startPos = this.start, startLoc = this.startLoc\n      let right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn)\n      let node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical)\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)\n    }\n  }\n  return left\n}\n\npp.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  let node = this.startNodeAt(startPos, startLoc)\n  node.left = left\n  node.operator = op\n  node.right = right\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n}\n\n// Parse unary operators, both prefix and postfix.\n\npp.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {\n  let startPos = this.start, startLoc = this.startLoc, expr\n  if (this.isContextual(\"await\") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {\n    expr = this.parseAwait()\n    sawUnary = true\n  } else if (this.type.prefix) {\n    let node = this.startNode(), update = this.type === tt.incDec\n    node.operator = this.value\n    node.prefix = true\n    this.next()\n    node.argument = this.parseMaybeUnary(null, true)\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    if (update) this.checkLVal(node.argument)\n    else if (this.strict && node.operator === \"delete\" &&\n             node.argument.type === \"Identifier\")\n      this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\")\n    else sawUnary = true\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\")\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors)\n    if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      let node = this.startNodeAt(startPos, startLoc)\n      node.operator = this.value\n      node.prefix = false\n      node.argument = expr\n      this.checkLVal(expr)\n      this.next()\n      expr = this.finishNode(node, \"UpdateExpression\")\n    }\n  }\n\n  if (!sawUnary && this.eat(tt.starstar))\n    return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), \"**\", false)\n  else\n    return expr\n}\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp.parseExprSubscripts = function(refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseExprAtom(refDestructuringErrors)\n  let skipArrowSubscripts = expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\"\n  if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) return expr\n  let result = this.parseSubscripts(expr, startPos, startLoc)\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) refDestructuringErrors.parenthesizedAssign = -1\n    if (refDestructuringErrors.parenthesizedBind >= result.start) refDestructuringErrors.parenthesizedBind = -1\n  }\n  return result\n}\n\npp.parseSubscripts = function(base, startPos, startLoc, noCalls) {\n  let maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && this.input.slice(base.start, base.end) === \"async\"\n  while (true) {\n    let element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow)\n    if (element === base || element.type === \"ArrowFunctionExpression\") return element\n    base = element\n  }\n}\n\npp.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow) {\n  let computed = this.eat(tt.bracketL)\n  if (computed || this.eat(tt.dot)) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.object = base\n    node.property = computed ? this.parseExpression() : this.parseIdent(true)\n    node.computed = !!computed\n    if (computed) this.expect(tt.bracketR)\n    base = this.finishNode(node, \"MemberExpression\")\n  } else if (!noCalls && this.eat(tt.parenL)) {\n    let refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n    this.yieldPos = 0\n    this.awaitPos = 0\n    this.awaitIdentPos = 0\n    let exprList = this.parseExprList(tt.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors)\n    if (maybeAsyncArrow && !this.canInsertSemicolon() && this.eat(tt.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false)\n      this.checkYieldAwaitInDefaultParams()\n      if (this.awaitIdentPos > 0)\n        this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\")\n      this.yieldPos = oldYieldPos\n      this.awaitPos = oldAwaitPos\n      this.awaitIdentPos = oldAwaitIdentPos\n      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    this.yieldPos = oldYieldPos || this.yieldPos\n    this.awaitPos = oldAwaitPos || this.awaitPos\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos\n    let node = this.startNodeAt(startPos, startLoc)\n    node.callee = base\n    node.arguments = exprList\n    base = this.finishNode(node, \"CallExpression\")\n  } else if (this.type === tt.backQuote) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.tag = base\n    node.quasi = this.parseTemplate({isTagged: true})\n    base = this.finishNode(node, \"TaggedTemplateExpression\")\n  }\n  return base\n}\n\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp.parseExprAtom = function(refDestructuringErrors) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === tt.slash) this.readRegexp()\n\n  let node, canBeArrow = this.potentialArrowAt === this.start\n  switch (this.type) {\n  case tt._super:\n    if (!this.allowSuper)\n      this.raise(this.start, \"'super' keyword outside a method\")\n    node = this.startNode()\n    this.next()\n    if (this.type === tt.parenL && !this.allowDirectSuper)\n      this.raise(node.start, \"super() call outside constructor of a subclass\")\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super Arguments\n    if (this.type !== tt.dot && this.type !== tt.bracketL && this.type !== tt.parenL)\n      this.unexpected()\n    return this.finishNode(node, \"Super\")\n\n  case tt._this:\n    node = this.startNode()\n    this.next()\n    return this.finishNode(node, \"ThisExpression\")\n\n  case tt.name:\n    let startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc\n    let id = this.parseIdent(false)\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(tt._function))\n      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true)\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(tt.arrow))\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false)\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === tt.name && !containsEsc) {\n        id = this.parseIdent(false)\n        if (this.canInsertSemicolon() || !this.eat(tt.arrow))\n          this.unexpected()\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)\n      }\n    }\n    return id\n\n  case tt.regexp:\n    let value = this.value\n    node = this.parseLiteral(value.value)\n    node.regex = {pattern: value.pattern, flags: value.flags}\n    return node\n\n  case tt.num: case tt.string:\n    return this.parseLiteral(this.value)\n\n  case tt._null: case tt._true: case tt._false:\n    node = this.startNode()\n    node.value = this.type === tt._null ? null : this.type === tt._true\n    node.raw = this.type.keyword\n    this.next()\n    return this.finishNode(node, \"Literal\")\n\n  case tt.parenL:\n    let start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow)\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        refDestructuringErrors.parenthesizedAssign = start\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        refDestructuringErrors.parenthesizedBind = start\n    }\n    return expr\n\n  case tt.bracketL:\n    node = this.startNode()\n    this.next()\n    node.elements = this.parseExprList(tt.bracketR, true, true, refDestructuringErrors)\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case tt.braceL:\n    return this.parseObj(false, refDestructuringErrors)\n\n  case tt._function:\n    node = this.startNode()\n    this.next()\n    return this.parseFunction(node, 0)\n\n  case tt._class:\n    return this.parseClass(this.startNode(), false)\n\n  case tt._new:\n    return this.parseNew()\n\n  case tt.backQuote:\n    return this.parseTemplate()\n\n  default:\n    this.unexpected()\n  }\n}\n\npp.parseLiteral = function(value) {\n  let node = this.startNode()\n  node.value = value\n  node.raw = this.input.slice(this.start, this.end)\n  this.next()\n  return this.finishNode(node, \"Literal\")\n}\n\npp.parseParenExpression = function() {\n  this.expect(tt.parenL)\n  let val = this.parseExpression()\n  this.expect(tt.parenR)\n  return val\n}\n\npp.parseParenAndDistinguishExpression = function(canBeArrow) {\n  let startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8\n  if (this.options.ecmaVersion >= 6) {\n    this.next()\n\n    let innerStartPos = this.start, innerStartLoc = this.startLoc\n    let exprList = [], first = true, lastIsComma = false\n    let refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart\n    this.yieldPos = 0\n    this.awaitPos = 0\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== tt.parenR) {\n      first ? first = false : this.expect(tt.comma)\n      if (allowTrailingComma && this.afterTrailingComma(tt.parenR, true)) {\n        lastIsComma = true\n        break\n      } else if (this.type === tt.ellipsis) {\n        spreadStart = this.start\n        exprList.push(this.parseParenItem(this.parseRestBinding()))\n        if (this.type === tt.comma) this.raise(this.start, \"Comma is not permitted after the rest element\")\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem))\n      }\n    }\n    let innerEndPos = this.start, innerEndLoc = this.startLoc\n    this.expect(tt.parenR)\n\n    if (canBeArrow && !this.canInsertSemicolon() && this.eat(tt.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false)\n      this.checkYieldAwaitInDefaultParams()\n      this.yieldPos = oldYieldPos\n      this.awaitPos = oldAwaitPos\n      return this.parseParenArrowList(startPos, startLoc, exprList)\n    }\n\n    if (!exprList.length || lastIsComma) this.unexpected(this.lastTokStart)\n    if (spreadStart) this.unexpected(spreadStart)\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    this.yieldPos = oldYieldPos || this.yieldPos\n    this.awaitPos = oldAwaitPos || this.awaitPos\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc)\n      val.expressions = exprList\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc)\n    } else {\n      val = exprList[0]\n    }\n  } else {\n    val = this.parseParenExpression()\n  }\n\n  if (this.options.preserveParens) {\n    let par = this.startNodeAt(startPos, startLoc)\n    par.expression = val\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n}\n\npp.parseParenItem = function(item) {\n  return item\n}\n\npp.parseParenArrowList = function(startPos, startLoc, exprList) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)\n}\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nconst empty = []\n\npp.parseNew = function() {\n  let node = this.startNode()\n  let meta = this.parseIdent(true)\n  if (this.options.ecmaVersion >= 6 && this.eat(tt.dot)) {\n    node.meta = meta\n    let containsEsc = this.containsEsc\n    node.property = this.parseIdent(true)\n    if (node.property.name !== \"target\" || containsEsc)\n      this.raiseRecoverable(node.property.start, \"The only valid meta property for new is new.target\")\n    if (!this.inNonArrowFunction())\n      this.raiseRecoverable(node.start, \"new.target can only be used in functions\")\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  let startPos = this.start, startLoc = this.startLoc\n  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true)\n  if (this.eat(tt.parenL)) node.arguments = this.parseExprList(tt.parenR, this.options.ecmaVersion >= 8, false)\n  else node.arguments = empty\n  return this.finishNode(node, \"NewExpression\")\n}\n\n// Parse template expression.\n\npp.parseTemplateElement = function({isTagged}) {\n  let elem = this.startNode()\n  if (this.type === tt.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\")\n    }\n    elem.value = {\n      raw: this.value,\n      cooked: null\n    }\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    }\n  }\n  this.next()\n  elem.tail = this.type === tt.backQuote\n  return this.finishNode(elem, \"TemplateElement\")\n}\n\npp.parseTemplate = function({isTagged = false} = {}) {\n  let node = this.startNode()\n  this.next()\n  node.expressions = []\n  let curElt = this.parseTemplateElement({isTagged})\n  node.quasis = [curElt]\n  while (!curElt.tail) {\n    if (this.type === tt.eof) this.raise(this.pos, \"Unterminated template literal\")\n    this.expect(tt.dollarBraceL)\n    node.expressions.push(this.parseExpression())\n    this.expect(tt.braceR)\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged}))\n  }\n  this.next()\n  return this.finishNode(node, \"TemplateLiteral\")\n}\n\npp.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === tt.name || this.type === tt.num || this.type === tt.string || this.type === tt.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === tt.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n}\n\n// Parse an object literal or binding pattern.\n\npp.parseObj = function(isPattern, refDestructuringErrors) {\n  let node = this.startNode(), first = true, propHash = {}\n  node.properties = []\n  this.next()\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    const prop = this.parseProperty(isPattern, refDestructuringErrors)\n    if (!isPattern) this.checkPropClash(prop, propHash, refDestructuringErrors)\n    node.properties.push(prop)\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n}\n\npp.parseProperty = function(isPattern, refDestructuringErrors) {\n  let prop = this.startNode(), isGenerator, isAsync, startPos, startLoc\n  if (this.options.ecmaVersion >= 9 && this.eat(tt.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false)\n      if (this.type === tt.comma) {\n        this.raise(this.start, \"Comma is not permitted after the rest element\")\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // To disallow parenthesized identifier via `this.toAssignable()`.\n    if (this.type === tt.parenL && refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0) {\n        refDestructuringErrors.parenthesizedAssign = this.start\n      }\n      if (refDestructuringErrors.parenthesizedBind < 0) {\n        refDestructuringErrors.parenthesizedBind = this.start\n      }\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors)\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === tt.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false\n    prop.shorthand = false\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start\n      startLoc = this.startLoc\n    }\n    if (!isPattern)\n      isGenerator = this.eat(tt.star)\n  }\n  let containsEsc = this.containsEsc\n  this.parsePropertyName(prop)\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(tt.star)\n    this.parsePropertyName(prop, refDestructuringErrors)\n  } else {\n    isAsync = false\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc)\n  return this.finishNode(prop, \"Property\")\n}\n\npp.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === tt.colon)\n    this.unexpected()\n\n  if (this.eat(tt.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors)\n    prop.kind = \"init\"\n  } else if (this.options.ecmaVersion >= 6 && this.type === tt.parenL) {\n    if (isPattern) this.unexpected()\n    prop.kind = \"init\"\n    prop.method = true\n    prop.value = this.parseMethod(isGenerator, isAsync)\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== tt.comma && this.type !== tt.braceR)) {\n    if (isGenerator || isAsync) this.unexpected()\n    prop.kind = prop.key.name\n    this.parsePropertyName(prop)\n    prop.value = this.parseMethod(false)\n    let paramCount = prop.kind === \"get\" ? 0 : 1\n    if (prop.value.params.length !== paramCount) {\n      let start = prop.value.start\n      if (prop.kind === \"get\")\n        this.raiseRecoverable(start, \"getter should have no params\")\n      else\n        this.raiseRecoverable(start, \"setter should have exactly one param\")\n    } else {\n      if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n        this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\")\n    }\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) this.unexpected()\n    this.checkUnreserved(prop.key)\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      this.awaitIdentPos = startPos\n    prop.kind = \"init\"\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key)\n    } else if (this.type === tt.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        refDestructuringErrors.shorthandAssign = this.start\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key)\n    } else {\n      prop.value = prop.key\n    }\n    prop.shorthand = true\n  } else this.unexpected()\n}\n\npp.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(tt.bracketL)) {\n      prop.computed = true\n      prop.key = this.parseMaybeAssign()\n      this.expect(tt.bracketR)\n      return prop.key\n    } else {\n      prop.computed = false\n    }\n  }\n  return prop.key = this.type === tt.num || this.type === tt.string ? this.parseExprAtom() : this.parseIdent(true)\n}\n\n// Initialize empty function node.\n\npp.initFunction = function(node) {\n  node.id = null\n  if (this.options.ecmaVersion >= 6) node.generator = node.expression = false\n  if (this.options.ecmaVersion >= 8) node.async = false\n}\n\n// Parse object or class method.\n\npp.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  let node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 6)\n    node.generator = isGenerator\n  if (this.options.ecmaVersion >= 8)\n    node.async = !!isAsync\n\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0))\n\n  this.expect(tt.parenL)\n  node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8)\n  this.checkYieldAwaitInDefaultParams()\n  this.parseFunctionBody(node, false, true)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, \"FunctionExpression\")\n}\n\n// Parse arrow function expression with given parameters.\n\npp.parseArrowExpression = function(node, params, isAsync) {\n  let oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW)\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 8) node.async = !!isAsync\n\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n\n  node.params = this.toAssignableList(params, true)\n  this.parseFunctionBody(node, true, false)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n}\n\n// Parse function body and check parameters.\n\npp.parseFunctionBody = function(node, isArrowFunction, isMethod) {\n  let isExpression = isArrowFunction && this.type !== tt.braceL\n  let oldStrict = this.strict, useStrict = false\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign()\n    node.expression = true\n    this.checkParams(node, false)\n  } else {\n    let nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params)\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end)\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\")\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    let oldLabels = this.labels\n    this.labels = []\n    if (useStrict) this.strict = true\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params))\n    node.body = this.parseBlock(false)\n    node.expression = false\n    this.adaptDirectivePrologue(node.body.body)\n    this.labels = oldLabels\n  }\n  this.exitScope()\n\n  // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n  if (this.strict && node.id) this.checkLVal(node.id, BIND_OUTSIDE)\n  this.strict = oldStrict\n}\n\npp.isSimpleParamList = function(params) {\n  for (let param of params)\n    if (param.type !== \"Identifier\") return false\n  return true\n}\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp.checkParams = function(node, allowDuplicates) {\n  let nameHash = {}\n  for (let param of node.params)\n    this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash)\n}\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  let elts = [], first = true\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (allowTrailingComma && this.afterTrailingComma(close)) break\n    } else first = false\n\n    let elt\n    if (allowEmpty && this.type === tt.comma)\n      elt = null\n    else if (this.type === tt.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors)\n      if (refDestructuringErrors && this.type === tt.comma && refDestructuringErrors.trailingComma < 0)\n        refDestructuringErrors.trailingComma = this.start\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors)\n    }\n    elts.push(elt)\n  }\n  return elts\n}\n\npp.checkUnreserved = function({start, end, name}) {\n  if (this.inGenerator && name === \"yield\")\n    this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\")\n  if (this.inAsync && name === \"await\")\n    this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\")\n  if (this.keywords.test(name))\n    this.raise(start, `Unexpected keyword '${name}'`)\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) return\n  const re = this.strict ? this.reservedWordsStrict : this.reservedWords\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\")\n    this.raiseRecoverable(start, `The keyword '${name}' is reserved`)\n  }\n}\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp.parseIdent = function(liberal, isBinding) {\n  let node = this.startNode()\n  if (liberal && this.options.allowReserved === \"never\") liberal = false\n  if (this.type === tt.name) {\n    node.name = this.value\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop()\n    }\n  } else {\n    this.unexpected()\n  }\n  this.next()\n  this.finishNode(node, \"Identifier\")\n  if (!liberal) {\n    this.checkUnreserved(node)\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      this.awaitIdentPos = node.start\n  }\n  return node\n}\n\n// Parses yield expression inside generator.\n\npp.parseYield = function(noIn) {\n  if (!this.yieldPos) this.yieldPos = this.start\n\n  let node = this.startNode()\n  this.next()\n  if (this.type === tt.semi || this.canInsertSemicolon() || (this.type !== tt.star && !this.type.startsExpr)) {\n    node.delegate = false\n    node.argument = null\n  } else {\n    node.delegate = this.eat(tt.star)\n    node.argument = this.parseMaybeAssign(noIn)\n  }\n  return this.finishNode(node, \"YieldExpression\")\n}\n\npp.parseAwait = function() {\n  if (!this.awaitPos) this.awaitPos = this.start\n\n  let node = this.startNode()\n  this.next()\n  node.argument = this.parseMaybeUnary(null, true)\n  return this.finishNode(node, \"AwaitExpression\")\n}\n","import {Parser} from \"./state\"\nimport {Position, getLineInfo} from \"./locutil\"\n\nconst pp = Parser.prototype\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp.raise = function(pos, message) {\n  let loc = getLineInfo(this.input, pos)\n  message += \" (\" + loc.line + \":\" + loc.column + \")\"\n  let err = new SyntaxError(message)\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos\n  throw err\n}\n\npp.raiseRecoverable = pp.raise\n\npp.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n}\n","import {Parser} from \"./state\"\nimport {SCOPE_VAR, SCOPE_FUNCTION, SCOPE_TOP, SCOPE_ARROW, SCOPE_SIMPLE_CATCH, BIND_LEXICAL, BIND_SIMPLE_CATCH, BIND_FUNCTION} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\nclass Scope {\n  constructor(flags) {\n    this.flags = flags\n    // A list of var-declared names in the current lexical scope\n    this.var = []\n    // A list of lexically-declared names in the current lexical scope\n    this.lexical = []\n    // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n    this.functions = []\n  }\n}\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags))\n}\n\npp.exitScope = function() {\n  this.scopeStack.pop()\n}\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n}\n\npp.declareName = function(name, bindingType, pos) {\n  let redeclared = false\n  if (bindingType === BIND_LEXICAL) {\n    const scope = this.currentScope()\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1\n    scope.lexical.push(name)\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      delete this.undefinedExports[name]\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    const scope = this.currentScope()\n    scope.lexical.push(name)\n  } else if (bindingType === BIND_FUNCTION) {\n    const scope = this.currentScope()\n    if (this.treatFunctionsAsVar)\n      redeclared = scope.lexical.indexOf(name) > -1\n    else\n      redeclared = scope.lexical.indexOf(name) > -1 || scope.var.indexOf(name) > -1\n    scope.functions.push(name)\n  } else {\n    for (let i = this.scopeStack.length - 1; i >= 0; --i) {\n      const scope = this.scopeStack[i]\n      if (scope.lexical.indexOf(name) > -1 && !((scope.flags & SCOPE_SIMPLE_CATCH) && scope.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope) && scope.functions.indexOf(name) > -1) {\n        redeclared = true\n        break\n      }\n      scope.var.push(name)\n      if (this.inModule && (scope.flags & SCOPE_TOP))\n        delete this.undefinedExports[name]\n      if (scope.flags & SCOPE_VAR) break\n    }\n  }\n  if (redeclared) this.raiseRecoverable(pos, `Identifier '${name}' has already been declared`)\n}\n\npp.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id\n  }\n}\n\npp.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n}\n\npp.currentVarScope = function() {\n  for (let i = this.scopeStack.length - 1;; i--) {\n    let scope = this.scopeStack[i]\n    if (scope.flags & SCOPE_VAR) return scope\n  }\n}\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp.currentThisScope = function() {\n  for (let i = this.scopeStack.length - 1;; i--) {\n    let scope = this.scopeStack[i]\n    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) return scope\n  }\n}\n","import {Parser} from \"./state\"\nimport {SourceLocation} from \"./locutil\"\n\nexport class Node {\n  constructor(parser, pos, loc) {\n    this.type = \"\"\n    this.start = pos\n    this.end = 0\n    if (parser.options.locations)\n      this.loc = new SourceLocation(parser, loc)\n    if (parser.options.directSourceFile)\n      this.sourceFile = parser.options.directSourceFile\n    if (parser.options.ranges)\n      this.range = [pos, 0]\n  }\n}\n\n// Start an AST node, attaching a start offset.\n\nconst pp = Parser.prototype\n\npp.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n}\n\npp.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n}\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type\n  node.end = pos\n  if (this.options.locations)\n    node.loc.end = loc\n  if (this.options.ranges)\n    node.range[1] = pos\n  return node\n}\n\npp.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n}\n\n// Finish node at given position\n\npp.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n}\n","// The algorithm used to determine whether a regexp can appear at a\n// given point in the program is loosely based on sweet.js' approach.\n// See https://github.com/mozilla/sweet.js/wiki/design\n\nimport {Parser} from \"./state\"\nimport {types as tt} from \"./tokentype\"\nimport {lineBreak} from \"./whitespace\"\n\nexport class TokContext {\n  constructor(token, isExpr, preserveSpace, override, generator) {\n    this.token = token\n    this.isExpr = !!isExpr\n    this.preserveSpace = !!preserveSpace\n    this.override = override\n    this.generator = !!generator\n  }\n}\n\nexport const types = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, p => p.tryReadTemplateToken()),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n}\n\nconst pp = Parser.prototype\n\npp.initialContext = function() {\n  return [types.b_stat]\n}\n\npp.braceIsBlock = function(prevType) {\n  let parent = this.curContext()\n  if (parent === types.f_expr || parent === types.f_stat)\n    return true\n  if (prevType === tt.colon && (parent === types.b_stat || parent === types.b_expr))\n    return !parent.isExpr\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === tt._return || prevType === tt.name && this.exprAllowed)\n    return lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n  if (prevType === tt._else || prevType === tt.semi || prevType === tt.eof || prevType === tt.parenR || prevType === tt.arrow)\n    return true\n  if (prevType === tt.braceL)\n    return parent === types.b_stat\n  if (prevType === tt._var || prevType === tt._const || prevType === tt.name)\n    return false\n  return !this.exprAllowed\n}\n\npp.inGeneratorContext = function() {\n  for (let i = this.context.length - 1; i >= 1; i--) {\n    let context = this.context[i]\n    if (context.token === \"function\")\n      return context.generator\n  }\n  return false\n}\n\npp.updateContext = function(prevType) {\n  let update, type = this.type\n  if (type.keyword && prevType === tt.dot)\n    this.exprAllowed = false\n  else if (update = type.updateContext)\n    update.call(this, prevType)\n  else\n    this.exprAllowed = type.beforeExpr\n}\n\n// Token-specific context update code\n\ntt.parenR.updateContext = tt.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true\n    return\n  }\n  let out = this.context.pop()\n  if (out === types.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop()\n  }\n  this.exprAllowed = !out.isExpr\n}\n\ntt.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr)\n  this.exprAllowed = true\n}\n\ntt.dollarBraceL.updateContext = function() {\n  this.context.push(types.b_tmpl)\n  this.exprAllowed = true\n}\n\ntt.parenL.updateContext = function(prevType) {\n  let statementParens = prevType === tt._if || prevType === tt._for || prevType === tt._with || prevType === tt._while\n  this.context.push(statementParens ? types.p_stat : types.p_expr)\n  this.exprAllowed = true\n}\n\ntt.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n}\n\ntt._function.updateContext = tt._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== tt.semi && prevType !== tt._else &&\n      !(prevType === tt._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === tt.colon || prevType === tt.braceL) && this.curContext() === types.b_stat))\n    this.context.push(types.f_expr)\n  else\n    this.context.push(types.f_stat)\n  this.exprAllowed = false\n}\n\ntt.backQuote.updateContext = function() {\n  if (this.curContext() === types.q_tmpl)\n    this.context.pop()\n  else\n    this.context.push(types.q_tmpl)\n  this.exprAllowed = false\n}\n\ntt.star.updateContext = function(prevType) {\n  if (prevType === tt._function) {\n    let index = this.context.length - 1\n    if (this.context[index] === types.f_expr)\n      this.context[index] = types.f_expr_gen\n    else\n      this.context[index] = types.f_gen\n  }\n  this.exprAllowed = true\n}\n\ntt.name.updateContext = function(prevType) {\n  let allowed = false\n  if (this.options.ecmaVersion >= 6 && prevType !== tt.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      allowed = true\n  }\n  this.exprAllowed = allowed\n}\n","import {wordsRegexp} from \"./util.js\"\n\n// This file contains Unicode properties extracted from the ECMAScript\n// specification. The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nconst ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\"\nconst unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma9BinaryProperties + \" Extended_Pictographic\"\n}\n\n// #table-unicode-general-category-values\nconst unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\"\n\n// #table-unicode-script-values\nconst ecma9ScriptValues = \"Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\"\nconst unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\"\n}\n\nconst data = {}\nfunction buildUnicodeData(ecmaVersion) {\n  let d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  }\n  d.nonBinary.Script_Extensions = d.nonBinary.Script\n\n  d.nonBinary.gc = d.nonBinary.General_Category\n  d.nonBinary.sc = d.nonBinary.Script\n  d.nonBinary.scx = d.nonBinary.Script_Extensions\n}\nbuildUnicodeData(9)\nbuildUnicodeData(10)\n\nexport default data\n","import {isIdentifierStart, isIdentifierChar} from \"./identifier.js\"\nimport {Parser} from \"./state.js\"\nimport UNICODE_PROPERTY_VALUES from \"./unicode-property-data.js\"\nimport {has} from \"./util.js\"\n\nconst pp = Parser.prototype\n\nexport class RegExpValidationState {\n  constructor(parser) {\n    this.parser = parser\n    this.validFlags = `gim${parser.options.ecmaVersion >= 6 ? \"uy\" : \"\"}${parser.options.ecmaVersion >= 9 ? \"s\" : \"\"}`\n    this.unicodeProperties = UNICODE_PROPERTY_VALUES[parser.options.ecmaVersion >= 10 ? 10 : parser.options.ecmaVersion]\n    this.source = \"\"\n    this.flags = \"\"\n    this.start = 0\n    this.switchU = false\n    this.switchN = false\n    this.pos = 0\n    this.lastIntValue = 0\n    this.lastStringValue = \"\"\n    this.lastAssertionIsQuantifiable = false\n    this.numCapturingParens = 0\n    this.maxBackReference = 0\n    this.groupNames = []\n    this.backReferenceNames = []\n  }\n\n  reset(start, pattern, flags) {\n    const unicode = flags.indexOf(\"u\") !== -1\n    this.start = start | 0\n    this.source = pattern + \"\"\n    this.flags = flags\n    this.switchU = unicode && this.parser.options.ecmaVersion >= 6\n    this.switchN = unicode && this.parser.options.ecmaVersion >= 9\n  }\n\n  raise(message) {\n    this.parser.raiseRecoverable(this.start, `Invalid regular expression: /${this.source}/: ${message}`)\n  }\n\n  // If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n  // Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\n  at(i) {\n    const s = this.source\n    const l = s.length\n    if (i >= l) {\n      return -1\n    }\n    const c = s.charCodeAt(i)\n    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n      return c\n    }\n    return (c << 10) + s.charCodeAt(i + 1) - 0x35FDC00\n  }\n\n  nextIndex(i) {\n    const s = this.source\n    const l = s.length\n    if (i >= l) {\n      return l\n    }\n    const c = s.charCodeAt(i)\n    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n      return i + 1\n    }\n    return i + 2\n  }\n\n  current() {\n    return this.at(this.pos)\n  }\n\n  lookahead() {\n    return this.at(this.nextIndex(this.pos))\n  }\n\n  advance() {\n    this.pos = this.nextIndex(this.pos)\n  }\n\n  eat(ch) {\n    if (this.current() === ch) {\n      this.advance()\n      return true\n    }\n    return false\n  }\n}\n\nfunction codePointToString(ch) {\n  if (ch <= 0xFFFF) return String.fromCharCode(ch)\n  ch -= 0x10000\n  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)\n}\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp.validateRegExpFlags = function(state) {\n  const validFlags = state.validFlags\n  const flags = state.flags\n\n  for (let i = 0; i < flags.length; i++) {\n    const flag = flags.charAt(i)\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\")\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\")\n    }\n  }\n}\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state)\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {\n    state.switchN = true\n    this.regexp_pattern(state)\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp.regexp_pattern = function(state) {\n  state.pos = 0\n  state.lastIntValue = 0\n  state.lastStringValue = \"\"\n  state.lastAssertionIsQuantifiable = false\n  state.numCapturingParens = 0\n  state.maxBackReference = 0\n  state.groupNames.length = 0\n  state.backReferenceNames.length = 0\n\n  this.regexp_disjunction(state)\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\")\n    }\n    if (state.eat(0x5D /* [ */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\")\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\")\n  }\n  for (const name of state.backReferenceNames) {\n    if (state.groupNames.indexOf(name) === -1) {\n      state.raise(\"Invalid named capture referenced\")\n    }\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp.regexp_disjunction = function(state) {\n  this.regexp_alternative(state)\n  while (state.eat(0x7C /* | */)) {\n    this.regexp_alternative(state)\n  }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\")\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\")\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state))\n    ;\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\")\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state)\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp.regexp_eatAssertion = function(state) {\n  const start = state.pos\n  state.lastAssertionIsQuantifiable = false\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    let lookbehind = false\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */)\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state)\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\")\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind\n      return true\n    }\n  }\n\n  state.pos = start\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp.regexp_eatQuantifier = function(state, noError = false) {\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */)\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n}\npp.regexp_eatBracedQuantifier = function(state, noError) {\n  const start = state.pos\n  if (state.eat(0x7B /* { */)) {\n    let min = 0, max = -1\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\")\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\")\n    }\n    state.pos = start\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n}\npp.regexp_eatReverseSolidusAtomEscape = function(state) {\n  const start = state.pos\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatUncapturingGroup = function(state) {\n  const start = state.pos\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {\n      this.regexp_disjunction(state)\n      if (state.eat(0x29 /* ) */)) {\n        return true\n      }\n      state.raise(\"Unterminated group\")\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state)\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\")\n    }\n    this.regexp_disjunction(state)\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1\n      return true\n    }\n    state.raise(\"Unterminated group\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp.regexp_eatSyntaxCharacter = function(state) {\n  const ch = state.current()\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n  return false\n}\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp.regexp_eatPatternCharacters = function(state) {\n  const start = state.pos\n  let ch = 0\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance()\n  }\n  return state.pos !== start\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp.regexp_eatExtendedPatternCharacter = function(state) {\n  const ch = state.current()\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// GroupSpecifier[U] ::\n//   [empty]\n//   `?` GroupName[?U]\npp.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (this.regexp_eatGroupName(state)) {\n      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {\n        state.raise(\"Duplicate capture group name\")\n      }\n      state.groupNames.push(state.lastStringValue)\n      return\n    }\n    state.raise(\"Invalid group\")\n  }\n}\n\n// GroupName[U] ::\n//   `<` RegExpIdentifierName[?U] `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\"\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\")\n  }\n  return false\n}\n\n// RegExpIdentifierName[U] ::\n//   RegExpIdentifierStart[?U]\n//   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\"\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString(state.lastIntValue)\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString(state.lastIntValue)\n    }\n    return true\n  }\n  return false\n}\n\n// RegExpIdentifierStart[U] ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[?U]\npp.regexp_eatRegExpIdentifierStart = function(state) {\n  const start = state.pos\n  let ch = state.current()\n  state.advance()\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {\n    ch = state.lastIntValue\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch\n    return true\n  }\n\n  state.pos = start\n  return false\n}\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart[U] ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[?U]\n//   <ZWNJ>\n//   <ZWJ>\npp.regexp_eatRegExpIdentifierPart = function(state) {\n  const start = state.pos\n  let ch = state.current()\n  state.advance()\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {\n    ch = state.lastIntValue\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch\n    return true\n  }\n\n  state.pos = start\n  return false\n}\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\")\n    }\n    state.raise(\"Invalid escape\")\n  }\n  return false\n}\npp.regexp_eatBackReference = function(state) {\n  const start = state.pos\n  if (this.regexp_eatDecimalEscape(state)) {\n    const n = state.lastIntValue\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue)\n      return true\n    }\n    state.raise(\"Invalid named reference\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n}\npp.regexp_eatCControlLetter = function(state) {\n  const start = state.pos\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp.regexp_eatControlEscape = function(state) {\n  const ch = state.current()\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09 /* \\t */\n    state.advance()\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A /* \\n */\n    state.advance()\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B /* \\v */\n    state.advance()\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C /* \\f */\n    state.advance()\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D /* \\r */\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp.regexp_eatControlLetter = function(state) {\n  const ch = state.current()\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20\n    state.advance()\n    return true\n  }\n  return false\n}\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp.regexp_eatRegExpUnicodeEscapeSequence = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      const lead = state.lastIntValue\n      if (state.switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        const leadSurrogateEnd = state.pos\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          const trail = state.lastIntValue\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd\n        state.lastIntValue = lead\n      }\n      return true\n    }\n    if (\n      state.switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid unicode escape\")\n    }\n    state.pos = start\n  }\n\n  return false\n}\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F /* / */\n      return true\n    }\n    return false\n  }\n\n  const ch = state.current()\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0\n  let ch = state.current()\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */)\n      state.advance()\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp.regexp_eatCharacterClassEscape = function(state) {\n  const ch = state.current()\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1\n    state.advance()\n    return true\n  }\n\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    (ch === 0x50 /* P */ || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1\n    state.advance()\n    if (\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatUnicodePropertyValueExpression(state) &&\n      state.eat(0x7D /* } */)\n    ) {\n      return true\n    }\n    state.raise(\"Invalid property name\")\n  }\n\n  return false\n}\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp.regexp_eatUnicodePropertyValueExpression = function(state) {\n  const start = state.pos\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    const name = state.lastStringValue\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      const value = state.lastStringValue\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value)\n      return true\n    }\n  }\n  state.pos = start\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    const nameOrValue = state.lastStringValue\n    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue)\n    return true\n  }\n  return false\n}\npp.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!has(state.unicodeProperties.nonBinary, name))\n    state.raise(\"Invalid property name\")\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    state.raise(\"Invalid property value\")\n}\npp.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (!state.unicodeProperties.binary.test(nameOrValue))\n    state.raise(\"Invalid property name\")\n}\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp.regexp_eatUnicodePropertyName = function(state) {\n  let ch = 0\n  state.lastStringValue = \"\"\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch)\n    state.advance()\n  }\n  return state.lastStringValue !== \"\"\n}\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp.regexp_eatUnicodePropertyValue = function(state) {\n  let ch = 0\n  state.lastStringValue = \"\"\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch)\n    state.advance()\n  }\n  return state.lastStringValue !== \"\"\n}\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    state.eat(0x5E /* ^ */)\n    this.regexp_classRanges(state)\n    if (state.eat(0x5D /* [ */)) {\n      return true\n    }\n    // Unreachable since it threw \"unterminated regular expression\" error before.\n    state.raise(\"Unterminated character class\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp.regexp_classRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    const left = state.lastIntValue\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      const right = state.lastIntValue\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\")\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\")\n      }\n    }\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp.regexp_eatClassAtom = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      const ch = state.current()\n      if (ch === 0x63 /* c */ || isOctalDigit(ch)) {\n        state.raise(\"Invalid class escape\")\n      }\n      state.raise(\"Invalid escape\")\n    }\n    state.pos = start\n  }\n\n  const ch = state.current()\n  if (ch !== 0x5D /* [ */) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp.regexp_eatClassEscape = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08 /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp.regexp_eatClassControlLetter = function(state) {\n  const ch = state.current()\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp.regexp_eatHexEscapeSequence = function(state) {\n  const start = state.pos\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\")\n    }\n    state.pos = start\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp.regexp_eatDecimalDigits = function(state) {\n  const start = state.pos\n  let ch = 0\n  state.lastIntValue = 0\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */)\n    state.advance()\n  }\n  return state.pos !== start\n}\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp.regexp_eatHexDigits = function(state) {\n  const start = state.pos\n  let ch = 0\n  state.lastIntValue = 0\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch)\n    state.advance()\n  }\n  return state.pos !== start\n}\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    const n1 = state.lastIntValue\n    if (this.regexp_eatOctalDigit(state)) {\n      const n2 = state.lastIntValue\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue\n      } else {\n        state.lastIntValue = n1 * 8 + n2\n      }\n    } else {\n      state.lastIntValue = n1\n    }\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp.regexp_eatOctalDigit = function(state) {\n  const ch = state.current()\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30 /* 0 */\n    state.advance()\n    return true\n  }\n  state.lastIntValue = 0\n  return false\n}\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp.regexp_eatFixedHexDigits = function(state, length) {\n  const start = state.pos\n  state.lastIntValue = 0\n  for (let i = 0; i < length; ++i) {\n    const ch = state.current()\n    if (!isHexDigit(ch)) {\n      state.pos = start\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch)\n    state.advance()\n  }\n  return true\n}\n","import {isIdentifierStart, isIdentifierChar} from \"./identifier\"\nimport {types as tt, keywords as keywordTypes} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {SourceLocation} from \"./locutil\"\nimport {RegExpValidationState} from \"./regexp\"\nimport {lineBreak, lineBreakG, isNewLine, nonASCIIwhitespace} from \"./whitespace\"\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nexport class Token {\n  constructor(p) {\n    this.type = p.type\n    this.value = p.value\n    this.start = p.start\n    this.end = p.end\n    if (p.options.locations)\n      this.loc = new SourceLocation(p, p.startLoc, p.endLoc)\n    if (p.options.ranges)\n      this.range = [p.start, p.end]\n  }\n}\n\n// ## Tokenizer\n\nconst pp = Parser.prototype\n\n// Move to the next token\n\npp.next = function() {\n  if (this.options.onToken)\n    this.options.onToken(new Token(this))\n\n  this.lastTokEnd = this.end\n  this.lastTokStart = this.start\n  this.lastTokEndLoc = this.endLoc\n  this.lastTokStartLoc = this.startLoc\n  this.nextToken()\n}\n\npp.getToken = function() {\n  this.next()\n  return new Token(this)\n}\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  pp[Symbol.iterator] = function() {\n    return {\n      next: () => {\n        let token = this.getToken()\n        return {\n          done: token.type === tt.eof,\n          value: token\n        }\n      }\n    }\n  }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\npp.curContext = function() {\n  return this.context[this.context.length - 1]\n}\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp.nextToken = function() {\n  let curContext = this.curContext()\n  if (!curContext || !curContext.preserveSpace) this.skipSpace()\n\n  this.start = this.pos\n  if (this.options.locations) this.startLoc = this.curPosition()\n  if (this.pos >= this.input.length) return this.finishToken(tt.eof)\n\n  if (curContext.override) return curContext.override(this)\n  else this.readToken(this.fullCharCodeAtPos())\n}\n\npp.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    return this.readWord()\n\n  return this.getTokenFromCode(code)\n}\n\npp.fullCharCodeAtPos = function() {\n  let code = this.input.charCodeAt(this.pos)\n  if (code <= 0xd7ff || code >= 0xe000) return code\n  let next = this.input.charCodeAt(this.pos + 1)\n  return (code << 10) + next - 0x35fdc00\n}\n\npp.skipBlockComment = function() {\n  let startLoc = this.options.onComment && this.curPosition()\n  let start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2)\n  if (end === -1) this.raise(this.pos - 2, \"Unterminated comment\")\n  this.pos = end + 2\n  if (this.options.locations) {\n    lineBreakG.lastIndex = start\n    let match\n    while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {\n      ++this.curLine\n      this.lineStart = match.index + match[0].length\n    }\n  }\n  if (this.options.onComment)\n    this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition())\n}\n\npp.skipLineComment = function(startSkip) {\n  let start = this.pos\n  let startLoc = this.options.onComment && this.curPosition()\n  let ch = this.input.charCodeAt(this.pos += startSkip)\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos)\n  }\n  if (this.options.onComment)\n    this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition())\n}\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    let ch = this.input.charCodeAt(this.pos)\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos\n      if (this.options.locations) {\n        ++this.curLine\n        this.lineStart = this.pos\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment()\n        break\n      case 47:\n        this.skipLineComment(2)\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos\n      } else {\n        break loop\n      }\n    }\n  }\n}\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp.finishToken = function(type, val) {\n  this.end = this.pos\n  if (this.options.locations) this.endLoc = this.curPosition()\n  let prevType = this.type\n  this.type = type\n  this.value = val\n\n  this.updateContext(prevType)\n}\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp.readToken_dot = function() {\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next >= 48 && next <= 57) return this.readNumber(true)\n  let next2 = this.input.charCodeAt(this.pos + 2)\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3\n    return this.finishToken(tt.ellipsis)\n  } else {\n    ++this.pos\n    return this.finishToken(tt.dot)\n  }\n}\n\npp.readToken_slash = function() { // '/'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.slash, 1)\n}\n\npp.readToken_mult_modulo_exp = function(code) { // '%*'\n  let next = this.input.charCodeAt(this.pos + 1)\n  let size = 1\n  let tokentype = code === 42 ? tt.star : tt.modulo\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size\n    tokentype = tt.starstar\n    next = this.input.charCodeAt(this.pos + 2)\n  }\n\n  if (next === 61) return this.finishOp(tt.assign, size + 1)\n  return this.finishOp(tokentype, size)\n}\n\npp.readToken_pipe_amp = function(code) { // '|&'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === code) return this.finishOp(code === 124 ? tt.logicalOR : tt.logicalAND, 2)\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(code === 124 ? tt.bitwiseOR : tt.bitwiseAND, 1)\n}\n\npp.readToken_caret = function() { // '^'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.bitwiseXOR, 1)\n}\n\npp.readToken_plus_min = function(code) { // '+-'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3)\n      this.skipSpace()\n      return this.nextToken()\n    }\n    return this.finishOp(tt.incDec, 2)\n  }\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.plusMin, 1)\n}\n\npp.readToken_lt_gt = function(code) { // '<>'\n  let next = this.input.charCodeAt(this.pos + 1)\n  let size = 1\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2\n    if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(tt.assign, size + 1)\n    return this.finishOp(tt.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4)\n    this.skipSpace()\n    return this.nextToken()\n  }\n  if (next === 61) size = 2\n  return this.finishOp(tt.relational, size)\n}\n\npp.readToken_eq_excl = function(code) { // '=!'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === 61) return this.finishOp(tt.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2)\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2\n    return this.finishToken(tt.arrow)\n  }\n  return this.finishOp(code === 61 ? tt.eq : tt.prefix, 1)\n}\n\npp.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(tt.parenL)\n  case 41: ++this.pos; return this.finishToken(tt.parenR)\n  case 59: ++this.pos; return this.finishToken(tt.semi)\n  case 44: ++this.pos; return this.finishToken(tt.comma)\n  case 91: ++this.pos; return this.finishToken(tt.bracketL)\n  case 93: ++this.pos; return this.finishToken(tt.bracketR)\n  case 123: ++this.pos; return this.finishToken(tt.braceL)\n  case 125: ++this.pos; return this.finishToken(tt.braceR)\n  case 58: ++this.pos; return this.finishToken(tt.colon)\n  case 63: ++this.pos; return this.finishToken(tt.question)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) break\n    ++this.pos\n    return this.finishToken(tt.backQuote)\n\n  case 48: // '0'\n    let next = this.input.charCodeAt(this.pos + 1)\n    if (next === 120 || next === 88) return this.readRadixNumber(16) // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) return this.readRadixNumber(8) // '0o', '0O' - octal number\n      if (next === 98 || next === 66) return this.readRadixNumber(2) // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 126: // '~'\n    return this.finishOp(tt.prefix, 1)\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\")\n}\n\npp.finishOp = function(type, size) {\n  let str = this.input.slice(this.pos, this.pos + size)\n  this.pos += size\n  return this.finishToken(type, str)\n}\n\npp.readRegexp = function() {\n  let escaped, inClass, start = this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(start, \"Unterminated regular expression\")\n    let ch = this.input.charAt(this.pos)\n    if (lineBreak.test(ch)) this.raise(start, \"Unterminated regular expression\")\n    if (!escaped) {\n      if (ch === \"[\") inClass = true\n      else if (ch === \"]\" && inClass) inClass = false\n      else if (ch === \"/\" && !inClass) break\n      escaped = ch === \"\\\\\"\n    } else escaped = false\n    ++this.pos\n  }\n  let pattern = this.input.slice(start, this.pos)\n  ++this.pos\n  let flagsStart = this.pos\n  let flags = this.readWord1()\n  if (this.containsEsc) this.unexpected(flagsStart)\n\n  // Validate pattern\n  const state = this.regexpState || (this.regexpState = new RegExpValidationState(this))\n  state.reset(start, pattern, flags)\n  this.validateRegExpFlags(state)\n  this.validateRegExpPattern(state)\n\n  // Create Literal#value property value.\n  let value = null\n  try {\n    value = new RegExp(pattern, flags)\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(tt.regexp, {pattern, flags, value})\n}\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp.readInt = function(radix, len) {\n  let start = this.pos, total = 0\n  for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {\n    let code = this.input.charCodeAt(this.pos), val\n    if (code >= 97) val = code - 97 + 10 // a\n    else if (code >= 65) val = code - 65 + 10 // A\n    else if (code >= 48 && code <= 57) val = code - 48 // 0-9\n    else val = Infinity\n    if (val >= radix) break\n    ++this.pos\n    total = total * radix + val\n  }\n  if (this.pos === start || len != null && this.pos - start !== len) return null\n\n  return total\n}\n\npp.readRadixNumber = function(radix) {\n  this.pos += 2 // 0x\n  let val = this.readInt(radix)\n  if (val == null) this.raise(this.start + 2, \"Expected number in radix \" + radix)\n  if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\")\n  return this.finishToken(tt.num, val)\n}\n\n// Read an integer, octal integer, or floating-point number.\n\npp.readNumber = function(startsWithDot) {\n  let start = this.pos\n  if (!startsWithDot && this.readInt(10) === null) this.raise(start, \"Invalid number\")\n  let octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48\n  if (octal && this.strict) this.raise(start, \"Invalid number\")\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) octal = false\n  let next = this.input.charCodeAt(this.pos)\n  if (next === 46 && !octal) { // '.'\n    ++this.pos\n    this.readInt(10)\n    next = this.input.charCodeAt(this.pos)\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos)\n    if (next === 43 || next === 45) ++this.pos // '+-'\n    if (this.readInt(10) === null) this.raise(start, \"Invalid number\")\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\")\n\n  let str = this.input.slice(start, this.pos)\n  let val = octal ? parseInt(str, 8) : parseFloat(str)\n  return this.finishToken(tt.num, val)\n}\n\n// Read a string value, interpreting backslash-escapes.\n\npp.readCodePoint = function() {\n  let ch = this.input.charCodeAt(this.pos), code\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) this.unexpected()\n    let codePos = ++this.pos\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos)\n    ++this.pos\n    if (code > 0x10FFFF) this.invalidStringToken(codePos, \"Code point out of bounds\")\n  } else {\n    code = this.readHexChar(4)\n  }\n  return code\n}\n\nfunction codePointToString(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) return String.fromCharCode(code)\n  code -= 0x10000\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\npp.readString = function(quote) {\n  let out = \"\", chunkStart = ++this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated string constant\")\n    let ch = this.input.charCodeAt(this.pos)\n    if (ch === quote) break\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos)\n      out += this.readEscapedChar(false)\n      chunkStart = this.pos\n    } else {\n      if (isNewLine(ch, this.options.ecmaVersion >= 10)) this.raise(this.start, \"Unterminated string constant\")\n      ++this.pos\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++)\n  return this.finishToken(tt.string, out)\n}\n\n// Reads template string tokens.\n\nconst INVALID_TEMPLATE_ESCAPE_ERROR = {}\n\npp.tryReadTemplateToken = function() {\n  this.inTemplateElement = true\n  try {\n    this.readTmplToken()\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken()\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false\n}\n\npp.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message)\n  }\n}\n\npp.readTmplToken = function() {\n  let out = \"\", chunkStart = this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated template\")\n    let ch = this.input.charCodeAt(this.pos)\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === tt.template || this.type === tt.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2\n          return this.finishToken(tt.dollarBraceL)\n        } else {\n          ++this.pos\n          return this.finishToken(tt.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos)\n      return this.finishToken(tt.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos)\n      out += this.readEscapedChar(true)\n      chunkStart = this.pos\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos)\n      ++this.pos\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) ++this.pos\n      case 10:\n        out += \"\\n\"\n        break\n      default:\n        out += String.fromCharCode(ch)\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine\n        this.lineStart = this.pos\n      }\n      chunkStart = this.pos\n    } else {\n      ++this.pos\n    }\n  }\n}\n\n// Reads a template token to search for the end, without validating any escape sequences\npp.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") {\n        break\n      }\n    // falls through\n\n    case \"`\":\n      return this.finishToken(tt.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    // no default\n    }\n  }\n  this.raise(this.start, \"Unterminated template\")\n}\n\n// Used to read escaped characters\n\npp.readEscapedChar = function(inTemplate) {\n  let ch = this.input.charCodeAt(++this.pos)\n  ++this.pos\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) ++this.pos // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine }\n    return \"\"\n  default:\n    if (ch >= 48 && ch <= 55) {\n      let octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0]\n      let octal = parseInt(octalStr, 8)\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1)\n        octal = parseInt(octalStr, 8)\n      }\n      this.pos += octalStr.length - 1\n      ch = this.input.charCodeAt(this.pos)\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        )\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n}\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp.readHexChar = function(len) {\n  let codePos = this.pos\n  let n = this.readInt(16, len)\n  if (n === null) this.invalidStringToken(codePos, \"Bad character escape sequence\")\n  return n\n}\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp.readWord1 = function() {\n  this.containsEsc = false\n  let word = \"\", first = true, chunkStart = this.pos\n  let astral = this.options.ecmaVersion >= 6\n  while (this.pos < this.input.length) {\n    let ch = this.fullCharCodeAtPos()\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true\n      word += this.input.slice(chunkStart, this.pos)\n      let escStart = this.pos\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\")\n      ++this.pos\n      let esc = this.readCodePoint()\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        this.invalidStringToken(escStart, \"Invalid Unicode escape\")\n      word += codePointToString(esc)\n      chunkStart = this.pos\n    } else {\n      break\n    }\n    first = false\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n}\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp.readWord = function() {\n  let word = this.readWord1()\n  let type = tt.name\n  if (this.keywords.test(word)) {\n    if (this.containsEsc) this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + word)\n    type = keywordTypes[word]\n  }\n  return this.finishToken(type, word)\n}\n","// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n//\n// Acorn was written by Marijn Haverbeke, Ingvar Stepanyan, and\n// various contributors and released under an MIT license.\n//\n// Git repositories for Acorn are available at\n//\n//     http://marijnhaverbeke.nl/git/acorn\n//     https://github.com/acornjs/acorn.git\n//\n// Please use the [github bug tracker][ghbt] to report issues.\n//\n// [ghbt]: https://github.com/acornjs/acorn/issues\n//\n// [walk]: util/walk.js\n\nimport {Parser} from \"./state\"\nimport \"./parseutil\"\nimport \"./statement\"\nimport \"./lval\"\nimport \"./expression\"\nimport \"./location\"\nimport \"./scope\"\n\nexport {Parser} from \"./state\"\nexport {defaultOptions} from \"./options\"\nexport {Position, SourceLocation, getLineInfo} from \"./locutil\"\nexport {Node} from \"./node\"\nexport {TokenType, types as tokTypes, keywords as keywordTypes} from \"./tokentype\"\nexport {TokContext, types as tokContexts} from \"./tokencontext\"\nexport {isIdentifierChar, isIdentifierStart} from \"./identifier\"\nexport {Token} from \"./tokenize\"\nexport {isNewLine, lineBreak, lineBreakG, nonASCIIwhitespace} from \"./whitespace\"\n\nexport const version = \"6.1.1\"\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and\n// returns an abstract syntax tree as specified by [Mozilla parser\n// API][api].\n//\n// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API\n\nexport function parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nexport function parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nexport function tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n"],"names":["const","let","keywords","tt","this","pp","init","label","node","empty","scope","types","UNICODE_PROPERTY_VALUES","codePointToString","ch","keywordTypes"],"mappings":";;;;;;AAAA;;AAEA,AAAOA,IAAM,aAAa,GAAG;EAC3B,CAAC,EAAE,qNAAqN;EACxN,CAAC,EAAE,8CAA8C;EACjD,CAAC,EAAE,MAAM;EACT,MAAM,EAAE,wEAAwE;EAChF,UAAU,EAAE,gBAAgB;EAC7B;;;;AAIDA,IAAM,oBAAoB,GAAG,8KAA6K;;AAE1M,AAAOA,IAAM,QAAQ,GAAG;EACtB,CAAC,EAAE,oBAAoB;EACvB,CAAC,EAAE,oBAAoB,GAAG,0CAA0C;EACrE;;AAED,AAAOA,IAAM,yBAAyB,GAAG,kBAAiB;;;;;;;;;;AAU1DC,IAAI,4BAA4B,GAAG,4tIAA2tI;AAC9vIA,IAAI,uBAAuB,GAAG,sjFAAqjF;;AAEnlFD,IAAM,uBAAuB,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,4BAA4B,GAAG,GAAG,EAAC;AACpFA,IAAM,kBAAkB,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,4BAA4B,GAAG,uBAAuB,GAAG,GAAG,EAAC;;AAEzG,4BAA4B,GAAG,uBAAuB,GAAG,KAAI;;;;;;;;;AAS7DA,IAAM,0BAA0B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAC;;;AAGvqCA,IAAM,qBAAqB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAC;;;;;AAKnlB,SAAS,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE;EAChCC,IAAI,GAAG,GAAG,QAAO;EACjB,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;IACtC,GAAG,IAAI,GAAG,CAAC,CAAC,EAAC;IACb,IAAI,GAAG,GAAG,IAAI,EAAE,EAAA,OAAO,KAAK,EAAA;IAC5B,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAC;IACjB,IAAI,GAAG,IAAI,IAAI,EAAE,EAAA,OAAO,IAAI,EAAA;GAC7B;CACF;;;;AAID,AAAO,SAAS,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE;EAC9C,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC3B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,IAAI,IAAI,IAAI,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAA;EAClG,IAAI,MAAM,KAAK,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;EAClC,OAAO,aAAa,CAAC,IAAI,EAAE,0BAA0B,CAAC;CACvD;;;;AAID,AAAO,SAAS,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE;EAC7C,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,KAAK,EAAA;EAC3B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC3B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,IAAI,IAAI,IAAI,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAA;EAC7F,IAAI,MAAM,KAAK,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;EAClC,OAAO,aAAa,CAAC,IAAI,EAAE,0BAA0B,CAAC,IAAI,aAAa,CAAC,IAAI,EAAE,qBAAqB,CAAC;CACrG;;ACtFD;;;;;;;;;;;;;;;;;;;;;;;AAuBA,AAAO,IAAM,SAAS,GAAC,kBACV,CAAC,KAAK,EAAE,IAAS,EAAE;6BAAP,GAAG,EAAE;;EAC5B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,QAAO;EAC7B,IAAM,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,WAAU;EACrC,IAAM,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,WAAU;EACrC,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAM;EAC7B,IAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,SAAQ;EACjC,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAM;EAC7B,IAAM,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,QAAO;EAC/B,IAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAI;EACjC,IAAM,CAAC,aAAa,GAAG,KAAI;CAC1B,CAAA;;AAGH,SAAS,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE;EACzB,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;CAC5D;AACDD,IAAM,UAAU,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC;IAAE,UAAU,GAAG,CAAC,UAAU,EAAE,IAAI,EAAC;;;;AAItE,AAAOA,IAAME,UAAQ,GAAG,GAAE;;;AAG1B,SAAS,EAAE,CAAC,IAAI,EAAE,OAAY,EAAE;mCAAP,GAAG,EAAE;;EAC5B,OAAO,CAAC,OAAO,GAAG,KAAI;EACtB,OAAOA,UAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC;CACrD;;AAED,AAAOF,IAAM,KAAK,GAAG;EACnB,GAAG,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC;EACrC,MAAM,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC;EAC3C,MAAM,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC;EAC3C,IAAI,EAAE,IAAI,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC;EACvC,GAAG,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC;;;EAGzB,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAClE,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC5B,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChE,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC1B,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChE,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC1B,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACrC,IAAI,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACpC,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACrC,GAAG,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EACvB,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACxC,KAAK,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC;EACtC,QAAQ,EAAE,IAAI,SAAS,CAAC,UAAU,CAAC;EACnC,eAAe,EAAE,IAAI,SAAS,CAAC,iBAAiB,CAAC;EACjD,QAAQ,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC;EAC1C,SAAS,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACzC,YAAY,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;;;;;;;;;;;;;;;;EAgBvE,EAAE,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;EAC1D,MAAM,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;EAC/D,MAAM,EAAE,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC/E,MAAM,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChF,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;EACzB,UAAU,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;EAC1B,SAAS,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACxB,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACzB,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACzB,QAAQ,EAAE,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC;EACnC,UAAU,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;EACjC,QAAQ,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;EAC/B,OAAO,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC3F,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACtB,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACpB,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACrB,QAAQ,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;;;EAGjD,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC;EACzB,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC;EACzB,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;EACnC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC/C,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC;EACvB,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;EAC/B,SAAS,EAAE,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;EACrC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;EACb,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;EACjC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC;EACf,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC;EACf,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;EACnC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC;EACjB,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACrD,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;EACnC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;EAC3C,WAAW,EAAE,EAAE,CAAC,YAAY,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;EAC3D,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACzE,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACrE,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;CAC1E;;ACnJD;;;AAGA,AAAOA,IAAM,SAAS,GAAG,yBAAwB;AACjD,AAAOA,IAAM,UAAU,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,EAAC;;AAE3D,AAAO,SAAS,SAAS,CAAC,IAAI,EAAE,cAAc,EAAE;EAC9C,OAAO,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,KAAK,CAAC,cAAc,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC;CAC/F;;AAED,AAAOA,IAAM,kBAAkB,GAAG,gDAA+C;;AAEjF,AAAOA,IAAM,cAAc,GAAG,+BAA+B;;ACZxD,OAA2B,GAAG,MAAM,CAAC,SAAS;AAA5C,IAAA,cAAc;AAAE,IAAA,QAAQ,gBAAzB;;;;AAIN,AAAO,SAAS,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE;EACjC,OAAO,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC;CAC1C;;AAED,AAAOA,IAAM,OAAO,GAAG,KAAK,CAAC,OAAO,KAAK,UAAC,GAAG,EAAE;EAC7C,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,gBAAgB;IACxC,EAAC;;AAEF,AAAO,SAAS,WAAW,CAAC,KAAK,EAAE;EACjC,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;CAC5D;;;;;ACTD,AAAO,IAAM,QAAQ,GAAC,iBACT,CAAC,IAAI,EAAE,GAAG,EAAE;EACvB,IAAM,CAAC,IAAI,GAAG,KAAI;EAClB,IAAM,CAAC,MAAM,GAAG,IAAG;CAClB,CAAA;;AAEH,mBAAE,MAAM,oBAAC,CAAC,EAAE;EACV,OAAS,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;CAChD,CAAA;;AAGH,AAAO,IAAM,cAAc,GAAC,uBACf,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;EAC3B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,GAAG,GAAG,IAAG;EAChB,IAAM,CAAC,CAAC,UAAU,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,WAAU,EAAA;CACtD,CAAA;;;;;;;;AASH,AAAO,SAAS,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE;EACzC,KAAKC,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI;IAC5B,UAAU,CAAC,SAAS,GAAG,IAAG;IAC1BA,IAAI,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAC;IAClC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,GAAG,MAAM,EAAE;MACjC,EAAE,KAAI;MACN,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;KACpC,MAAM;MACL,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC;KACxC;GACF;CACF;;;;;ACnCD,AAAOD,IAAM,cAAc,GAAG;;;;;;EAM5B,WAAW,EAAE,CAAC;;;;EAId,UAAU,EAAE,QAAQ;;;;;;EAMpB,mBAAmB,EAAE,IAAI;;;EAGzB,eAAe,EAAE,IAAI;;;;;EAKrB,aAAa,EAAE,IAAI;;;EAGnB,0BAA0B,EAAE,KAAK;;;EAGjC,2BAA2B,EAAE,KAAK;;;EAGlC,yBAAyB,EAAE,KAAK;;;EAGhC,aAAa,EAAE,KAAK;;;;;EAKpB,SAAS,EAAE,KAAK;;;;;;EAMhB,OAAO,EAAE,IAAI;;;;;;;;;;;EAWb,SAAS,EAAE,IAAI;;;;;;;;;EASf,MAAM,EAAE,KAAK;;;;;;EAMb,OAAO,EAAE,IAAI;;;EAGb,UAAU,EAAE,IAAI;;;EAGhB,gBAAgB,EAAE,IAAI;;;EAGtB,cAAc,EAAE,KAAK;EACtB;;;;AAID,AAAO,SAAS,UAAU,CAAC,IAAI,EAAE;EAC/BC,IAAI,OAAO,GAAG,GAAE;;EAEhB,KAAKA,IAAI,GAAG,IAAI,cAAc;IAC5B,EAAA,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,EAAC,EAAA;;EAEzE,IAAI,OAAO,CAAC,WAAW,IAAI,IAAI;IAC7B,EAAA,OAAO,CAAC,WAAW,IAAI,KAAI,EAAA;;EAE7B,IAAI,OAAO,CAAC,aAAa,IAAI,IAAI;IAC/B,EAAA,OAAO,CAAC,aAAa,GAAG,OAAO,CAAC,WAAW,GAAG,EAAC,EAAA;;EAEjD,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;IAC5BA,IAAI,MAAM,GAAG,OAAO,CAAC,QAAO;IAC5B,OAAO,CAAC,OAAO,GAAG,UAAC,KAAK,EAAE,SAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAA;GAChD;EACD,IAAI,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC;IAC5B,EAAA,OAAO,CAAC,SAAS,GAAG,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,SAAS,EAAC,EAAA;;EAE7D,OAAO,OAAO;CACf;;AAED,SAAS,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE;EACnC,OAAO,SAAS,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE;IACzDA,IAAI,OAAO,GAAG;MACZ,IAAI,EAAE,KAAK,GAAG,OAAO,GAAG,MAAM;MAC9B,KAAK,EAAE,IAAI;MACX,KAAK,EAAE,KAAK;MACZ,GAAG,EAAE,GAAG;MACT;IACD,IAAI,OAAO,CAAC,SAAS;MACnB,EAAA,OAAO,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAC,EAAA;IAC1D,IAAI,OAAO,CAAC,MAAM;MAChB,EAAA,OAAO,CAAC,KAAK,GAAG,CAAC,KAAK,EAAE,GAAG,EAAC,EAAA;IAC9B,KAAK,CAAC,IAAI,CAAC,OAAO,EAAC;GACpB;CACF;;ACjID;AACA,AAAOD,IACH,SAAS,GAAG,CAAC;IACb,cAAc,GAAG,CAAC;IAClB,SAAS,GAAG,SAAS,GAAG,cAAc;IACtC,WAAW,GAAG,CAAC;IACf,eAAe,GAAG,CAAC;IACnB,WAAW,GAAG,EAAE;IAChB,kBAAkB,GAAG,EAAE;IACvB,WAAW,GAAG,EAAE;IAChB,kBAAkB,GAAG,IAAG;;AAE5B,AAAO,SAAS,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE;EAC9C,OAAO,cAAc,IAAI,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,eAAe,GAAG,CAAC,CAAC;CACtF;;;AAGD,AAAOA,IACH,SAAS,GAAG,CAAC;IACb,QAAQ,GAAG,CAAC;IACZ,YAAY,GAAG,CAAC;IAChB,aAAa,GAAG,CAAC;IACjB,iBAAiB,GAAG,CAAC;IACrB,YAAY,GAAG,EAAC;;AChBb,IAAM,MAAM,GAAC,eACP,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE;EACtC,IAAM,CAAC,OAAO,GAAG,OAAO,GAAG,UAAU,CAAC,OAAO,EAAC;EAC9C,IAAM,CAAC,UAAU,GAAG,OAAO,CAAC,WAAU;EACtC,IAAM,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAC;EACzE,IAAM,QAAQ,GAAG,GAAE;EACnB,IAAM,CAAC,OAAO,CAAC,aAAa,EAAE;IAC5B,KAAOC,IAAI,CAAC,GAAG,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE;MACtC,EAAE,IAAI,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,EAAA,KAAK,IAAA;IAC1C,IAAM,OAAO,CAAC,UAAU,KAAK,QAAQ,EAAE,EAAA,QAAQ,IAAI,SAAQ,EAAA;GAC1D;EACH,IAAM,CAAC,aAAa,GAAG,WAAW,CAAC,QAAQ,EAAC;EAC5C,IAAM,cAAc,GAAG,CAAC,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,EAAE,IAAI,aAAa,CAAC,OAAM;EAC9E,IAAM,CAAC,mBAAmB,GAAG,WAAW,CAAC,cAAc,EAAC;EACxD,IAAM,CAAC,uBAAuB,GAAG,WAAW,CAAC,cAAc,GAAG,GAAG,GAAG,aAAa,CAAC,UAAU,EAAC;EAC7F,IAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAC;;;;;EAK5B,IAAM,CAAC,WAAW,GAAG,MAAK;;;;;EAK1B,IAAM,QAAQ,EAAE;IACd,IAAM,CAAC,GAAG,GAAG,SAAQ;IACrB,IAAM,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAC;IACjE,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAM;GAC3E,MAAM;IACP,IAAM,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,GAAG,EAAC;IAC/B,IAAM,CAAC,OAAO,GAAG,EAAC;GACjB;;;;EAIH,IAAM,CAAC,IAAI,GAAGE,KAAE,CAAC,IAAG;;EAEpB,IAAM,CAAC,KAAK,GAAG,KAAI;;EAEnB,IAAM,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAG;;;EAGlC,IAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,GAAE;;;EAGlD,IAAM,CAAC,aAAa,GAAG,IAAI,CAAC,eAAe,GAAG,KAAI;EAClD,IAAM,CAAC,YAAY,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,IAAG;;;;;EAKhD,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,GAAE;EACtC,IAAM,CAAC,WAAW,GAAG,KAAI;;;EAGzB,IAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,UAAU,KAAK,SAAQ;EACjD,IAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;;;EAG/D,IAAM,CAAC,gBAAgB,GAAG,CAAC,EAAC;;;EAG5B,IAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,EAAC;;EAExD,IAAM,CAAC,MAAM,GAAG,GAAE;;EAElB,IAAM,CAAC,gBAAgB,GAAG,GAAE;;;EAG5B,IAAM,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;IAC9E,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC,EAAA;;;EAG3B,IAAM,CAAC,UAAU,GAAG,GAAE;EACtB,IAAM,CAAC,UAAU,CAAC,SAAS,EAAC;;;EAG5B,IAAM,CAAC,WAAW,GAAG,KAAI;CACxB;;4PAAA;;AAEH,iBAAE,KAAK,qBAAG;EACR,IAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,GAAE;EACrD,IAAM,CAAC,SAAS,GAAE;EAClB,OAAS,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;CAChC,CAAA;;AAEH,mBAAE,UAAc,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,cAAc,IAAI,CAAC,EAAE,CAAA;AACjF,mBAAE,WAAe,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,eAAe,IAAI,CAAC,EAAE,CAAA;AACnF,mBAAE,OAAW,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,WAAW,IAAI,CAAC,EAAE,CAAA;AAC3E,mBAAE,UAAc,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,WAAW,IAAI,CAAC,EAAE,CAAA;AAC/E,mBAAE,gBAAoB,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,kBAAkB,IAAI,CAAC,EAAE,CAAA;AAC5F,mBAAE,mBAAuB,mBAAG,EAAE,OAAO,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,CAAA;;;AAG3F,iBAAE,kBAAkB,kCAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,cAAc,IAAI,CAAC,EAAE,CAAA;;AAEtF,OAAE,MAAa,sBAAa;;;;EAC1B,IAAM,GAAG,GAAG,KAAI;EAChB,KAAOF,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAA,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAC,EAAA;EAChE,OAAS,GAAG;CACX,CAAA;;AAEH,OAAE,KAAY,mBAAC,KAAK,EAAE,OAAO,EAAE;EAC7B,OAAS,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE;CACxC,CAAA;;AAEH,OAAE,iBAAwB,+BAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE;EAC9C,IAAM,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAC;EAC5C,MAAQ,CAAC,SAAS,GAAE;EACpB,OAAS,MAAM,CAAC,eAAe,EAAE;CAChC,CAAA;;AAEH,OAAE,SAAgB,uBAAC,KAAK,EAAE,OAAO,EAAE;EACjC,OAAS,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC;CAChC,CAAA;;gEACF;;ACvHDD,IAAM,EAAE,GAAG,MAAM,CAAC,UAAS;;;;AAI3BA,IAAM,OAAO,GAAG,6CAA4C;AAC5D,EAAE,CAAC,eAAe,GAAG,SAAS,KAAK,EAAE;;;EACnC,SAAS;;IAEP,cAAc,CAAC,SAAS,GAAG,MAAK;IAChC,KAAK,IAAI,cAAc,CAAC,IAAI,CAACI,MAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAM;IAClDH,IAAI,KAAK,GAAG,OAAO,CAAC,IAAI,CAACG,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAC;IACjD,IAAI,CAAC,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;IACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,YAAY,EAAE,EAAA,OAAO,IAAI,EAAA;IACxD,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;;;IAGxB,cAAc,CAAC,SAAS,GAAG,MAAK;IAChC,KAAK,IAAI,cAAc,CAAC,IAAI,CAACA,MAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAM;IAClD,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG;MAC3B,EAAA,KAAK,GAAE,EAAA;GACV;EACF;;;;;AAKD,EAAE,CAAC,GAAG,GAAG,SAAS,IAAI,EAAE;EACtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;IACtB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI;GACZ,MAAM;IACL,OAAO,KAAK;GACb;EACF;;;;AAID,EAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE;EAC/B,OAAO,IAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW;EACzE;;;;AAID,EAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;EAC1C,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI;EACZ;;;;AAID,EAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACjD;;;;AAID,EAAE,CAAC,kBAAkB,GAAG,WAAW;EACjC,OAAO,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG;IACzB,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM;IACvB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;EAChE;;AAED,EAAE,CAAC,eAAe,GAAG,WAAW;EAC9B,IAAI,IAAI,CAAC,kBAAkB,EAAE,EAAE;IAC7B,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB;MAClC,EAAA,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,EAAC,EAAA;IACvE,OAAO,IAAI;GACZ;EACF;;;;;AAKD,EAAE,CAAC,SAAS,GAAG,WAAW;EACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACrE;;AAED,EAAE,CAAC,kBAAkB,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE;EACjD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;IACzB,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe;MAC9B,EAAA,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,eAAe,EAAC,EAAA;IACvE,IAAI,CAAC,OAAO;MACV,EAAA,IAAI,CAAC,IAAI,GAAE,EAAA;IACb,OAAO,IAAI;GACZ;EACF;;;;;AAKD,EAAE,CAAC,MAAM,GAAG,SAAS,IAAI,EAAE;EACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,GAAE;EACpC;;;;AAID,EAAE,CAAC,UAAU,GAAG,SAAS,GAAG,EAAE;EAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,kBAAkB,EAAC;EAC/D;;AAED,AAAO,SAAS,mBAAmB,GAAG;EACpC,IAAI,CAAC,eAAe;EACpB,IAAI,CAAC,aAAa;EAClB,IAAI,CAAC,mBAAmB;EACxB,IAAI,CAAC,iBAAiB;EACtB,IAAI,CAAC,WAAW;IACd,CAAC,EAAC;CACL;;AAED,EAAE,CAAC,kBAAkB,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;EACjE,IAAI,CAAC,sBAAsB,EAAE,EAAA,MAAM,EAAA;EACnC,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC,CAAC;IAC3C,EAAA,IAAI,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,aAAa,EAAE,+CAA+C,EAAC,EAAA;EAC9GF,IAAI,MAAM,GAAG,QAAQ,GAAG,sBAAsB,CAAC,mBAAmB,GAAG,sBAAsB,CAAC,kBAAiB;EAC7G,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,uBAAuB,EAAC,EAAA;EACxE;;AAED,EAAE,CAAC,qBAAqB,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;EACpE,IAAI,CAAC,sBAAsB,EAAE,EAAA,OAAO,KAAK,EAAA;EACzC,IAAK,eAAe;EAAE,IAAA,WAAW,sCAA7B;EACJ,IAAI,CAAC,QAAQ,EAAE,EAAA,OAAO,eAAe,IAAI,CAAC,IAAI,WAAW,IAAI,CAAC,EAAA;EAC9D,IAAI,eAAe,IAAI,CAAC;IACtB,EAAA,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,yEAAyE,EAAC,EAAA;EACxG,IAAI,WAAW,IAAI,CAAC;IAClB,EAAA,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,oCAAoC,EAAC,EAAA;EAC3E;;AAED,EAAE,CAAC,8BAA8B,GAAG,WAAW;EAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IACpE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,4CAA4C,EAAC,EAAA;EACzE,IAAI,IAAI,CAAC,QAAQ;IACf,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,4CAA4C,EAAC,EAAA;EAC1E;;AAED,EAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;EACvC,IAAI,IAAI,CAAC,IAAI,KAAK,yBAAyB;IACzC,EAAA,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB;CACtE;;ACvIDD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;;;AAS3BA,IAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE;;;EAChCJ,IAAI,OAAO,GAAG,GAAE;EAChB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAA,IAAI,CAAC,IAAI,GAAG,GAAE,EAAA;EAC9B,OAAO,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,EAAE;IAC3BF,IAAI,IAAI,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAC;IACnD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;GACrB;EACD,IAAI,IAAI,CAAC,QAAQ;IACf,EAAA,KAAa,kBAAI,MAAM,CAAC,IAAI,CAACA,MAAI,CAAC,gBAAgB,CAAC,yBAAA;MAA9C;QAAAH,IAAI,IAAI;;QACXG,MAAI,CAAC,gBAAgB,CAACA,MAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,GAAE,UAAS,GAAE,IAAI,qBAAiB,GAAE;OAAA,EAAA;EAC/F,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAC;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAU;GAC1C;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;EACxC;;AAEDJ,IAAM,SAAS,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC;IAAE,WAAW,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAC;;AAEhEK,IAAE,CAAC,KAAK,GAAG,SAAS,OAAO,EAAE;EAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;EAC3E,cAAc,CAAC,SAAS,GAAG,IAAI,CAAC,IAAG;EACnCJ,IAAI,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAC;EAC1CA,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAC;;;;;EAK1E,IAAI,MAAM,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC9B,IAAI,OAAO,EAAE,EAAA,OAAO,KAAK,EAAA;;EAEzB,IAAI,MAAM,KAAK,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC/B,IAAI,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;IACnCA,IAAI,GAAG,GAAG,IAAI,GAAG,EAAC;IAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,EAAA,EAAE,IAAG,EAAA;IAChEA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAC;IACvC,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;GACxD;EACD,OAAO,KAAK;EACb;;;;;AAKDI,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAC7D,EAAA,OAAO,KAAK,EAAA;;EAEd,cAAc,CAAC,SAAS,GAAG,IAAI,CAAC,IAAG;EACnCJ,IAAI,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAC;EAC1CA,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,OAAM;EACpC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,UAAU;KAC9C,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;EACrF;;;;;;;;;AASDI,IAAE,CAAC,cAAc,GAAG,SAAS,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;EACvDJ,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,KAAI;;EAExD,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE;IACvB,SAAS,GAAGE,KAAE,CAAC,KAAI;IACnB,IAAI,GAAG,MAAK;GACb;;;;;;EAMD,QAAQ,SAAS;EACjB,KAAKA,KAAE,CAAC,MAAM,CAAC,CAAC,KAAKA,KAAE,CAAC,SAAS,EAAE,OAAO,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,OAAO,CAAC;EACnG,KAAKA,KAAE,CAAC,SAAS,EAAE,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC;EAC3D,KAAKA,KAAE,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EAC/C,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;EACjD,KAAKA,KAAE,CAAC,SAAS;;;;IAIf,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,MAAM,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7H,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC;EAC3D,KAAKA,KAAE,CAAC,MAAM;IACZ,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC9B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EACpC,KAAKA,KAAE,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EAC/C,KAAKA,KAAE,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;EACvD,KAAKA,KAAE,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;EACvD,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACrD,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;EACjD,KAAKA,KAAE,CAAC,MAAM,CAAC,CAAC,KAAKA,KAAE,CAAC,IAAI;IAC1B,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,MAAK;IACzB,IAAI,OAAO,IAAI,IAAI,KAAK,KAAK,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAChD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC;EAC3C,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACrD,KAAKA,KAAE,CAAC,KAAK,EAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;EACnD,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EAClD,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACnD,KAAKA,KAAE,CAAC,OAAO,CAAC;EAChB,KAAKA,KAAE,CAAC,OAAO;IACb,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,2BAA2B,EAAE;MAC7C,IAAI,CAAC,QAAQ;QACX,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,wDAAwD,EAAC,EAAA;MAClF,IAAI,CAAC,IAAI,CAAC,QAAQ;QAChB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,iEAAiE,EAAC,EAAA;KAC5F;IACD,OAAO,SAAS,KAAKA,KAAE,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC;;;;;;;EAO5F;IACE,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE;MAC1B,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MAC9B,IAAI,CAAC,IAAI,GAAE;MACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC;KACzD;;IAEDF,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;IACzD,IAAI,SAAS,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;MAC3E,EAAA,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,EAAA;SAC9D,EAAA,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAA;GACtD;EACF;;AAEDE,IAAE,CAAC,2BAA2B,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE;;;EACvDJ,IAAI,OAAO,GAAG,OAAO,KAAK,QAAO;EACjC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,KAAI,EAAA;OAC7D,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;OAC5C;IACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,GAAE;GACjB;;;;EAIDF,IAAI,CAAC,GAAG,EAAC;EACT,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;IAClCA,IAAI,GAAG,GAAGG,MAAI,CAAC,MAAM,CAAC,CAAC,EAAC;IACxB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;MACtD,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;MAC/D,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,EAAE,EAAA,KAAK,EAAA;KACjC;GACF;EACD,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,EAAC,EAAA;EAC9E,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,gBAAgB,GAAG,mBAAmB,CAAC;EAC/E;;AAEDC,IAAE,CAAC,sBAAsB,GAAG,SAAS,IAAI,EAAE;EACzC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;AAEDA,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;EACrC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACvC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC,EAAA;;IAEjB,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;EAClB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC;EACjD;;;;;;;;;;AAUDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,CAAC,IAAI,GAAE;EACXJ,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAC;EACvL,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;EAClB,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;GACjC;EACDF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAE;EACxB,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,KAAK,EAAE;IAC7DF,IAAIK,MAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,MAAK;IAC9D,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,CAACA,MAAI,EAAE,IAAI,EAAE,IAAI,EAAC;IAC/B,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,qBAAqB,EAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,IAAI,KAAKH,KAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,KAAKG,MAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QACtH,EAAE,IAAI,KAAK,KAAK,IAAIA,MAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;MAClD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;QACjC,IAAI,IAAI,CAAC,IAAI,KAAKH,KAAE,CAAC,GAAG,EAAE;UACxB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;SAC3C,MAAM,EAAA,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAC,EAAA;OACjC;MACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAEG,MAAI,CAAC;KACnC;IACD,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAEA,MAAI,CAAC;GACjC;EACDL,IAAI,sBAAsB,GAAG,IAAI,oBAAmB;EACpDA,IAAI,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC7D,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE;IACtF,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,EAAE;QACxB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;OAC3C,MAAM,EAAA,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAC,EAAA;KACjC;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,EAAC;IACtD,IAAI,CAAC,SAAS,CAAC,IAAI,EAAC;IACpB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;GACnC,MAAM;IACL,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;GACzD;EACD,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;EAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;EACjC;;AAEDE,IAAE,CAAC,sBAAsB,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE,mBAAmB,EAAE;EACvE,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,cAAc,IAAI,mBAAmB,GAAG,CAAC,GAAG,sBAAsB,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC;EACrH;;AAEDA,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;;EAEvC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;EAC3C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,KAAI;EACtE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;EAC5C;;AAEDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;EACvC,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,0BAA0B;IAC9D,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;EACxD,IAAI,CAAC,IAAI,GAAE;;;;;;EAMX,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,KAAI,EAAA;OAChE,EAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,GAAE,EAAE;EACjE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;;;EACvC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,oBAAoB,GAAE;EAC/C,IAAI,CAAC,KAAK,GAAG,GAAE;EACf,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAC;EAC7B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;;;;;;EAMlBF,IAAI,IAAG;EACP,KAAKA,IAAI,UAAU,GAAG,KAAK,EAAE,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,GAAG;IACrD,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MACvDF,IAAI,MAAM,GAAGG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,MAAK;MACnC,IAAI,GAAG,EAAE,EAAAC,MAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,EAAC,EAAA;MAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAGA,MAAI,CAAC,SAAS,EAAE,EAAC;MACvC,GAAG,CAAC,UAAU,GAAG,GAAE;MACnBA,MAAI,CAAC,IAAI,GAAE;MACX,IAAI,MAAM,EAAE;QACV,GAAG,CAAC,IAAI,GAAGA,MAAI,CAAC,eAAe,GAAE;OAClC,MAAM;QACL,IAAI,UAAU,EAAE,EAAAA,MAAI,CAAC,gBAAgB,CAACA,MAAI,CAAC,YAAY,EAAE,0BAA0B,EAAC,EAAA;QACpF,UAAU,GAAG,KAAI;QACjB,GAAG,CAAC,IAAI,GAAG,KAAI;OAChB;MACDA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;KACtB,MAAM;MACL,IAAI,CAAC,GAAG,EAAE,EAAAC,MAAI,CAAC,UAAU,GAAE,EAAA;MAC3B,GAAG,CAAC,UAAU,CAAC,IAAI,CAACA,MAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAC;KAC/C;GACF;EACD,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,GAAG,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,EAAC,EAAA;EAC3C,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDC,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,6BAA6B,EAAC,EAAA;EAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,GAAE;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;;;AAIDL,IAAM,KAAK,GAAG,GAAE;;AAEhBK,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;EAC9B,IAAI,CAAC,OAAO,GAAG,KAAI;EACnB,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,MAAM,EAAE;IAC3BF,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,GAAE;IAC7B,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE;MACvB,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAE;MACtCF,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,aAAY;MAC/C,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,kBAAkB,GAAG,CAAC,EAAC;MAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,iBAAiB,GAAG,YAAY,EAAC;MACvE,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;KACvB,MAAM;MACL,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,EAAE,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MACpD,MAAM,CAAC,KAAK,GAAG,KAAI;MACnB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;KACnB;IACD,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IACpC,IAAI,CAAC,SAAS,GAAE;IAChB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,EAAC;GACtD;EACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAI;EACjE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;IAClC,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;EAC3D,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;EAC7C;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EAC1C,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC;EAChC,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,qBAAqB,CAAC;EACpD;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAC;EACxC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC,EAAA;EAChE,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAC;EACvC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;AAEDA,IAAE,CAAC,qBAAqB,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE;;;EAClE,KAAc,oBAAID,MAAI,CAAC,MAAM,6BAAA;IAAxB;IAAAH,IAAI,KAAK;;IACZ,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;MAC1B,EAAAG,MAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,uBAAuB,EAAC;GAAA,EAAA;EAC3EH,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAO,GAAG,QAAQ,GAAG,KAAI;EACjF,KAAKF,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;IAChDA,IAAIM,OAAK,GAAGH,MAAI,CAAC,MAAM,CAAC,CAAC,EAAC;IAC1B,IAAIG,OAAK,CAAC,cAAc,KAAK,IAAI,CAAC,KAAK,EAAE;;MAEvCA,OAAK,CAAC,cAAc,GAAGH,MAAI,CAAC,MAAK;MACjCG,OAAK,CAAC,IAAI,GAAG,KAAI;KAClB,MAAM,EAAA,KAAK,EAAA;GACb;EACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,MAAA,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAC;EACrE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,EAAC;EAClH,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,IAAI,CAAC,KAAK,GAAG,KAAI;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC;EACjD;;AAEDF,IAAE,CAAC,wBAAwB,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjD,IAAI,CAAC,UAAU,GAAG,KAAI;EACtB,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,qBAAqB,CAAC;EACpD;;;;;;AAMDA,IAAE,CAAC,UAAU,GAAG,SAAS,qBAA4B,EAAE,IAAuB,EAAE;oBAAlC;+DAAA,GAAG,IAAI,CAAM;6BAAA,GAAG,IAAI,CAAC,SAAS,EAAE;;EAC5E,IAAI,CAAC,IAAI,GAAG,GAAE;EACd,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,qBAAqB,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC,EAAA;EAC7C,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3BF,IAAI,IAAI,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAC;IACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;GACrB;EACD,IAAI,qBAAqB,EAAE,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;EAC3C,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;;;;;AAMDC,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjC,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,IAAI,EAAC;EACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;EACjE,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,IAAI,EAAC;EACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;EACrE,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;EAC7C;;;;;AAKDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnCJ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,GAAG,gBAAgB,GAAG,iBAAgB;EACrE,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,KAAK,gBAAgB,EAAE;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB;OAClC,IAAI,CAAC,IAAI,KAAK,qBAAqB,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI;QACvE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;MAChE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,wCAAwC,EAAC,EAAA;GACnE;EACD,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,gBAAgB,GAAG,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACzF,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EACnC;;;;AAIDE,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;;;EACxC,IAAI,CAAC,YAAY,GAAG,GAAE;EACtB,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,SAAS;IACPJ,IAAI,IAAI,GAAGG,MAAI,CAAC,SAAS,GAAE;IAC3BA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAC;IAC3B,IAAIA,MAAI,CAAC,GAAG,CAACD,KAAE,CAAC,EAAE,CAAC,EAAE;MACnB,IAAI,CAAC,IAAI,GAAGC,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAC;KACzC,MAAM,IAAI,IAAI,KAAK,OAAO,IAAI,EAAEA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,KAAKC,MAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAIA,MAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;MACpHA,MAAI,CAAC,UAAU,GAAE;KAClB,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,YAAY,IAAI,EAAE,KAAK,KAAKA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,IAAIC,MAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;MACzGA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,UAAU,EAAE,0DAA0D,EAAC;KACxF,MAAM;MACL,IAAI,CAAC,IAAI,GAAG,KAAI;KACjB;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAACA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAC;IACnE,IAAI,CAACA,MAAI,CAAC,GAAG,CAACD,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,KAAK,EAAA;GAC/B;EACD,OAAO,IAAI;EACZ;;AAEDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;IACpE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,6CAA6C,EAAC;GACjF;EACD,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACjC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,KAAK,KAAK,GAAG,QAAQ,GAAG,YAAY,EAAE,KAAK,EAAC;EACzE;;AAEDL,IAAM,cAAc,GAAG,CAAC;IAAE,sBAAsB,GAAG,CAAC;IAAE,gBAAgB,GAAG,EAAC;;;;;;AAM1EK,IAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,mBAAmB,EAAE,OAAO,EAAE;EACzE,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;IAC9E,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,KAAK,SAAS,GAAG,sBAAsB,CAAC;MAC/D,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC;GACnC;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAExB,IAAI,SAAS,GAAG,cAAc,EAAE;IAC9B,IAAI,CAAC,EAAE,GAAG,CAAC,SAAS,GAAG,gBAAgB,KAAK,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,UAAU,GAAE;IAC5F,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,GAAG,sBAAsB,CAAC;;;;;MAKlD,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,mBAAmB,GAAG,QAAQ,GAAG,YAAY,GAAG,aAAa,EAAC,EAAA;GAC9I;;EAEDF,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;EACnG,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;EACtB,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAC;;EAE1D,IAAI,EAAE,SAAS,GAAG,cAAc,CAAC;IAC/B,EAAA,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAI,EAAA;;EAE5D,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAC;EAC9B,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAC;;EAExD,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,SAAS,GAAG,cAAc,IAAI,qBAAqB,GAAG,oBAAoB,CAAC;EAC1G;;AAEDE,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAACA,KAAE,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAC;EACpF,IAAI,CAAC,8BAA8B,GAAE;EACtC;;;;;AAKDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE;;;EAC1C,IAAI,CAAC,IAAI,GAAE;;;;EAIXL,IAAM,SAAS,GAAG,IAAI,CAAC,OAAM;EAC7B,IAAI,CAAC,MAAM,GAAG,KAAI;;EAElB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,EAAC;EACpC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAC;EAC1BC,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,GAAE;EAChCA,IAAI,cAAc,GAAG,MAAK;EAC1B,SAAS,CAAC,IAAI,GAAG,GAAE;EACnB,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3BH,IAAM,OAAO,GAAGI,MAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,EAAC;IAChE,IAAI,OAAO,EAAE;MACX,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAC;MAC5B,IAAI,OAAO,CAAC,IAAI,KAAK,kBAAkB,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;QACzE,IAAI,cAAc,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,yCAAyC,EAAC,EAAA;QACxF,cAAc,GAAG,KAAI;OACtB;KACF;GACF;EACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,EAAC;EACnD,IAAI,CAAC,MAAM,GAAG,UAAS;EACvB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,WAAW,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;EACnF;;AAEDC,IAAE,CAAC,iBAAiB,GAAG,SAAS,sBAAsB,EAAE;;;EACtD,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;;EAElCF,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,GAAE;EAC7BD,IAAM,aAAa,GAAG,UAAC,CAAC,EAAE,WAAmB,EAAE;6CAAV,GAAG,KAAK;;IAC3CA,IAAM,KAAK,GAAGI,MAAI,CAAC,KAAK,EAAE,QAAQ,GAAGA,MAAI,CAAC,SAAQ;IAClD,IAAI,CAACA,MAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;IACxC,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,MAAM,KAAK,CAAC,WAAW,IAAI,CAACC,MAAI,CAAC,kBAAkB,EAAE,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;IACxF,IAAI,MAAM,CAAC,GAAG,EAAE,EAAAA,MAAI,CAAC,UAAU,GAAE,EAAA;IACjC,MAAM,CAAC,QAAQ,GAAG,MAAK;IACvB,MAAM,CAAC,GAAG,GAAGA,MAAI,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAC;IAC9C,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,EAAC;IACnBA,MAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,YAAY,EAAC;IACzC,OAAO,KAAK;IACb;;EAED,MAAM,CAAC,IAAI,GAAG,SAAQ;EACtB,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,EAAC;EACvCH,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;EACnCF,IAAI,OAAO,GAAG,MAAK;EACnB,IAAI,CAAC,WAAW,EAAE;IAChB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE;MACjE,OAAO,GAAG,KAAI;MACd,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;KACjE,MAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;MAC/B,MAAM,CAAC,IAAI,GAAG,MAAK;KACpB,MAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;MAC/B,MAAM,CAAC,IAAI,GAAG,MAAK;KACpB;GACF;EACD,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAA,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAC,EAAA;EAC/C,IAAK,GAAG,cAAJ;EACJF,IAAI,iBAAiB,GAAG,MAAK;EAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;MAC9F,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,KAAK,aAAa,CAAC,EAAE;IAC1D,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,yCAAyC,EAAC,EAAA;IAC9F,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,kCAAkC,EAAC,EAAA;IAC1E,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;IAC1E,MAAM,CAAC,IAAI,GAAG,cAAa;IAC3B,iBAAiB,GAAG,uBAAsB;GAC3C,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE;IACjF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,wDAAwD,EAAC;GAChF;EACD,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAC;EACtE,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;IAC3D,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;EAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;IAC3D,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;EACnF,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa;IACxE,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,+BAA+B,EAAC,EAAA;EACtF,OAAO,MAAM;EACd;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,SAAS,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAE;EAC9E,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAC;EACxE,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,kBAAkB,CAAC;EACnD;;AAEDA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE;EAC5C,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,UAAU,GAAE;IAC3B,IAAI,WAAW;MACb,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAC,EAAA;GAC/C,MAAM;IACL,IAAI,WAAW,KAAK,IAAI;MACtB,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,IAAI,CAAC,EAAE,GAAG,KAAI;GACf;EACF;;AAEDE,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE;EAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,GAAG,KAAI;EAC5E;;;;AAIDE,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE;;;EACvC,IAAI,CAAC,IAAI,GAAE;;EAEX,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,EAAE;IACrB,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAC;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;IAClC,IAAI,CAAC,SAAS,GAAE;IAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,sBAAsB,CAAC;GACrD;EACD,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,QAAQ,CAAC,EAAE;IACzB,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,YAAY,EAAC;IACvDF,IAAI,QAAO;IACX,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,SAAS,KAAK,OAAO,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE;MACpEF,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;MAC5B,IAAI,CAAC,IAAI,GAAE;MACX,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,IAAI,GAAE,EAAA;MACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,cAAc,GAAG,gBAAgB,EAAE,KAAK,EAAE,OAAO,EAAC;KAChG,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE;MAClCF,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;MAC5B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,YAAY,EAAC;KACxD,MAAM;MACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,GAAE;MAC1C,IAAI,CAAC,SAAS,GAAE;KACjB;IACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,0BAA0B,CAAC;GACzD;;EAED,IAAI,IAAI,CAAC,0BAA0B,EAAE,EAAE;IACrC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;IAC5C,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,qBAAqB;MACjD,EAAA,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,YAAY,EAAC,EAAA;;MAEhE,EAAA,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAC,EAAA;IAChF,IAAI,CAAC,UAAU,GAAG,GAAE;IACpB,IAAI,CAAC,MAAM,GAAG,KAAI;GACnB,MAAM;IACL,IAAI,CAAC,WAAW,GAAG,KAAI;IACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAC;IACrD,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;MAC9B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;KACnC,MAAM;MACL,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA,EAAE;;QAA7BF,IAAI,IAAI;;QAEXG,MAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAC;;QAEhCA,MAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAC;OAClC;;MAED,IAAI,CAAC,MAAM,GAAG,KAAI;KACnB;IACD,IAAI,CAAC,SAAS,GAAE;GACjB;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,wBAAwB,CAAC;EACvD;;AAEDC,IAAE,CAAC,WAAW,GAAG,SAAS,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;EAC5C,IAAI,CAAC,OAAO,EAAE,EAAA,MAAM,EAAA;EACpB,IAAI,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC;IACpB,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,oBAAoB,GAAG,IAAI,GAAG,GAAG,EAAC,EAAA;EAC/D,OAAO,CAAC,IAAI,CAAC,GAAG,KAAI;EACrB;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,OAAO,EAAE,GAAG,EAAE;;;EAC7CJ,IAAI,IAAI,GAAG,GAAG,CAAC,KAAI;EACnB,IAAI,IAAI,KAAK,YAAY;IACvB,EAAA,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAC,EAAA;OAC3C,IAAI,IAAI,KAAK,eAAe;IAC/B,EAAA,KAAa,kBAAI,GAAG,CAAC,UAAU,yBAAA;MAA1B;QAAAA,IAAI,IAAI;;QACXG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAC;OAAA,EAAA;OACrC,IAAI,IAAI,KAAK,cAAc;IAC9B,EAAA,KAAY,sBAAI,GAAG,CAAC,QAAQ,+BAAA,EAAE;MAAzBH,IAAI,GAAG;;QACV,IAAI,GAAG,EAAE,EAAAG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAC,EAAA;KAC/C,EAAA;OACE,IAAI,IAAI,KAAK,UAAU;IAC1B,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,EAAC,EAAA;OACxC,IAAI,IAAI,KAAK,mBAAmB;IACnC,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAC,EAAA;OACvC,IAAI,IAAI,KAAK,aAAa;IAC7B,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,QAAQ,EAAC,EAAA;OAC3C,IAAI,IAAI,KAAK,yBAAyB;IACzC,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,UAAU,EAAC,EAAA;EACnD;;AAEDC,IAAE,CAAC,mBAAmB,GAAG,SAAS,OAAO,EAAE,KAAK,EAAE;;;EAChD,IAAI,CAAC,OAAO,EAAE,EAAA,MAAM,EAAA;EACpB,KAAa,kBAAI,KAAK,yBAAA;IAAjB;IAAAJ,IAAI,IAAI;;IACXG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAC;GAAA;EAC5C;;AAEDC,IAAE,CAAC,0BAA0B,GAAG,WAAW;EACzC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK;IAChC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;IAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;IAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,UAAU;IAChC,IAAI,CAAC,KAAK,EAAE;IACZ,IAAI,CAAC,eAAe,EAAE;EACzB;;;;AAIDA,IAAE,CAAC,qBAAqB,GAAG,SAAS,OAAO,EAAE;;;EAC3CJ,IAAI,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;;EAE5B,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBF,IAAI,IAAI,GAAGG,MAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,KAAK,GAAGA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IAClC,IAAI,CAAC,QAAQ,GAAGA,MAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAGA,MAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;IAC7EA,MAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAC;IAClE,KAAK,CAAC,IAAI,CAACA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC,EAAC;GACrD;EACD,OAAO,KAAK;EACb;;;;AAIDC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE;EAC9B,IAAI,CAAC,IAAI,GAAE;;EAEX,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,MAAM,EAAE;IAC3B,IAAI,CAAC,UAAU,GAAG,MAAK;IACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;GACnC,MAAM;IACL,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,qBAAqB,GAAE;IAC9C,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAC;IAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,UAAU,GAAE;GACjF;EACD,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;;;AAIDE,IAAE,CAAC,qBAAqB,GAAG,WAAW;;;EACpCJ,IAAI,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC5B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,EAAE;;IAEzBF,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,wBAAwB,CAAC,EAAC;IAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;GACtC;EACD,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE;IACzBF,IAAIO,MAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IAC3BA,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,CAACA,MAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,0BAA0B,CAAC,EAAC;IAC7D,OAAO,KAAK;GACb;EACD,IAAI,CAAC,MAAM,CAACL,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBF,IAAIO,MAAI,GAAGJ,MAAI,CAAC,SAAS,GAAE;IAC3BI,MAAI,CAAC,QAAQ,GAAGJ,MAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACrC,IAAIA,MAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;MAC5BI,MAAI,CAAC,KAAK,GAAGJ,MAAI,CAAC,UAAU,GAAE;KAC/B,MAAM;MACLA,MAAI,CAAC,eAAe,CAACI,MAAI,CAAC,QAAQ,EAAC;MACnCA,MAAI,CAAC,KAAK,GAAGA,MAAI,CAAC,SAAQ;KAC3B;IACDJ,MAAI,CAAC,SAAS,CAACI,MAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAACJ,MAAI,CAAC,UAAU,CAACI,MAAI,EAAE,iBAAiB,CAAC,EAAC;GACrD;EACD,OAAO,KAAK;EACb;;;AAGDH,IAAE,CAAC,sBAAsB,GAAG,SAAS,UAAU,EAAE;EAC/C,KAAKJ,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;IACtF,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;GACpE;EACF;AACDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,SAAS,EAAE;EAC5C;IACE,SAAS,CAAC,IAAI,KAAK,qBAAqB;IACxC,SAAS,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS;IACvC,OAAO,SAAS,CAAC,UAAU,CAAC,KAAK,KAAK,QAAQ;;KAE7C,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;GAC9E;CACF;;AC30BDL,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;AAK3BA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,sBAAsB,EAAE;;;EAClE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,EAAE;IACzC,QAAQ,IAAI,CAAC,IAAI;IACjB,KAAK,YAAY;MACf,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QACvC,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,2DAA2D,EAAC,EAAA;MACrF,KAAK;;IAEP,KAAK,eAAe,CAAC;IACrB,KAAK,cAAc,CAAC;IACpB,KAAK,aAAa;MAChB,KAAK;;IAEP,KAAK,kBAAkB;MACrB,IAAI,CAAC,IAAI,GAAG,gBAAe;MAC3B,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;MACjF,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA,EAAE;QAA7BJ,IAAI,IAAI;;MACXG,MAAI,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,EAAC;;;;;;QAMlC;UACE,IAAI,CAAC,IAAI,KAAK,aAAa;WAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,eAAe,CAAC;UACjF;UACAA,MAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,kBAAkB,EAAC;SACpD;OACF;MACD,KAAK;;IAEP,KAAK,UAAU;;MAEb,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;MACrG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAC;MACxC,KAAK;;IAEP,KAAK,iBAAiB;MACpB,IAAI,CAAC,IAAI,GAAG,eAAc;MAC1B,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;MACjF,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAC;MAC/C,KAAK;;IAEP,KAAK,eAAe;MAClB,IAAI,CAAC,IAAI,GAAG,cAAa;MACzB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAC;MAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,mBAAmB;QAC5C,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,2CAA2C,EAAC,EAAA;MAC9E,KAAK;;IAEP,KAAK,sBAAsB;MACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,6DAA6D,EAAC,EAAA;MACnH,IAAI,CAAC,IAAI,GAAG,oBAAmB;MAC/B,OAAO,IAAI,CAAC,SAAQ;MACpB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAC;;;IAGzC,KAAK,mBAAmB;MACtB,KAAK;;IAEP,KAAK,yBAAyB;MAC5B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,EAAE,sBAAsB,EAAC;MACrE,KAAK;;IAEP,KAAK,kBAAkB;MACrB,IAAI,CAAC,SAAS,EAAE,EAAA,KAAK,EAAA;;IAEvB;MACE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,qBAAqB,EAAC;KAC9C;GACF,MAAM,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;EACxF,OAAO,IAAI;EACZ;;;;AAIDC,IAAE,CAAC,gBAAgB,GAAG,SAAS,QAAQ,EAAE,SAAS,EAAE;;;EAClDJ,IAAI,GAAG,GAAG,QAAQ,CAAC,OAAM;EACzB,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;IAC5BA,IAAI,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAC;IACrB,IAAI,GAAG,EAAE,EAAAG,MAAI,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAC,EAAA;GAC3C;EACD,IAAI,GAAG,EAAE;IACPH,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,EAAC;IAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,KAAK,CAAC,IAAI,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY;MAC3H,EAAA,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAC,EAAA;GACvC;EACD,OAAO,QAAQ;EAChB;;;;AAIDI,IAAE,CAAC,WAAW,GAAG,SAAS,sBAAsB,EAAE;EAChDJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;EACpE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,WAAW;EAC/BJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;;;EAGX,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI;IACzD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAEnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,GAAE;;EAEvC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;EAC5C;;;;AAIDE,IAAE,CAAC,gBAAgB,GAAG,WAAW;EAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,QAAQ,IAAI,CAAC,IAAI;IACjB,KAAKF,KAAE,CAAC,QAAQ;MACdF,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;MAC3B,IAAI,CAAC,IAAI,GAAE;MACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAACE,KAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAC;MAC9D,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;;IAE9C,KAAKA,KAAE,CAAC,MAAM;MACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;KAC3B;GACF;EACD,OAAO,IAAI,CAAC,UAAU,EAAE;EACzB;;AAEDE,IAAE,CAAC,gBAAgB,GAAG,SAAS,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE;;;EACpEJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;IACvB,IAAI,KAAK,EAAE,EAAA,KAAK,GAAG,MAAK,EAAA;SACnB,EAAAG,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC,EAAA;IAC1B,IAAI,UAAU,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE;MACxC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;KAChB,MAAM,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE;MAC/D,KAAK;KACN,MAAM,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MACpCF,IAAI,IAAI,GAAGG,MAAI,CAAC,gBAAgB,GAAE;MAClCA,MAAI,CAAC,oBAAoB,CAAC,IAAI,EAAC;MAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;MACf,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;MACnGA,MAAI,CAAC,MAAM,CAAC,KAAK,EAAC;MAClB,KAAK;KACN,MAAM;MACLH,IAAI,IAAI,GAAGG,MAAI,CAAC,iBAAiB,CAACA,MAAI,CAAC,KAAK,EAAEA,MAAI,CAAC,QAAQ,EAAC;MAC5DA,MAAI,CAAC,oBAAoB,CAAC,IAAI,EAAC;MAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;KAChB;GACF;EACD,OAAO,IAAI;EACZ;;AAEDC,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC,OAAO,KAAK;EACb;;;;AAIDA,IAAE,CAAC,iBAAiB,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;EACxD,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,gBAAgB,GAAE;EACtC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,EAAE,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACjEF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;EAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACpC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;;;;;;;;AASDI,IAAE,CAAC,SAAS,GAAG,SAAS,IAAI,EAAE,WAAuB,EAAE,YAAY,EAAE;oBAA5B;2CAAA,GAAG,SAAS;;EACnD,QAAQ,IAAI,CAAC,IAAI;EACjB,KAAK,YAAY;IACf,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;MAC7D,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,UAAU,GAAG,eAAe,IAAI,IAAI,CAAC,IAAI,GAAG,iBAAiB,EAAC,EAAA;IACjH,IAAI,YAAY,EAAE;MAChB,IAAI,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC;QAC9B,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,qBAAqB,EAAC,EAAA;MAC1D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAI;KAC/B;IACD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,YAAY,EAAE,EAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAC,EAAA;IACnH,KAAK;;EAEP,KAAK,kBAAkB;IACrB,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,2BAA2B,EAAC,EAAA;IAC/E,KAAK;;EAEP,KAAK,eAAe;IAClB,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA;MAA3B;IAAAJ,IAAI,IAAI;;IACXG,MAAI,CAAC,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC;GAAA;IACjD,KAAK;;EAEP,KAAK,UAAU;;IAEb,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,EAAC;IACrD,KAAK;;EAEP,KAAK,cAAc;IACjB,KAAa,sBAAI,IAAI,CAAC,QAAQ,+BAAA,EAAE;MAA3BH,IAAI,IAAI;;IACX,IAAI,IAAI,EAAE,EAAAG,MAAI,CAAC,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC,EAAA;KAC1D;IACD,KAAK;;EAEP,KAAK,mBAAmB;IACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC;IACpD,KAAK;;EAEP,KAAK,aAAa;IAChB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAC;IACxD,KAAK;;EAEP,KAAK,yBAAyB;IAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,EAAC;IAC1D,KAAK;;EAEP;IACE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,SAAS,GAAG,cAAc,IAAI,SAAS,EAAC;GAC/E;CACF;;AC5OD;;;;;;;;;;;;;;;;;;AAkBA,AAMAJ,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;AAO3BA,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,sBAAsB,EAAE;EACnE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe;IAChE,EAAA,MAAM,EAAA;EACR,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC;IACnF,EAAA,MAAM,EAAA;EACR,IAAK,GAAG;EAAJ,IAAc,KAAI;EACtB,QAAQ,GAAG,CAAC,IAAI;EAChB,KAAK,YAAY,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK;EACzC,KAAK,SAAS,EAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK;EAC/C,SAAS,MAAM;GACd;EACD,IAAK,IAAI,aAAL;EACJ,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,EAAE;MAC3C,IAAI,QAAQ,CAAC,KAAK,EAAE;QAClB,IAAI,sBAAsB,IAAI,sBAAsB,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,sBAAsB,CAAC,WAAW,GAAG,GAAG,CAAC,MAAK,EAAA;;aAE/G,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,oCAAoC,EAAC,EAAA;OAC5E;MACD,QAAQ,CAAC,KAAK,GAAG,KAAI;KACtB;IACD,MAAM;GACP;EACD,IAAI,GAAG,GAAG,GAAG,KAAI;EACjBJ,IAAI,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAC;EAC1B,IAAI,KAAK,EAAE;IACTA,IAAI,aAAY;IAChB,IAAI,IAAI,KAAK,MAAM,EAAE;MACnB,YAAY,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,IAAG;KACnE,MAAM;MACL,YAAY,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAC;KACzC;IACD,IAAI,YAAY;MACd,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,0BAA0B,EAAC,EAAA;GAC/D,MAAM;IACL,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG;MACvB,IAAI,EAAE,KAAK;MACX,GAAG,EAAE,KAAK;MACV,GAAG,EAAE,KAAK;MACX;GACF;EACD,KAAK,CAAC,IAAI,CAAC,GAAG,KAAI;EACnB;;;;;;;;;;;;;;;;;AAiBDI,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;;;EAC1DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC9D,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,KAAK,EAAE;IAC1BF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,EAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAACC,MAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,sBAAsB,CAAC,EAAC,EAAA;IACrG,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC;GACnD;EACD,OAAO,IAAI;EACZ;;;;;AAKDC,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE,cAAc,EAAE;EAC3E,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE;IAC9B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAA;;;SAG7C,EAAA,IAAI,CAAC,WAAW,GAAG,MAAK,EAAA;GAC9B;;EAEDJ,IAAI,sBAAsB,GAAG,KAAK,EAAE,cAAc,GAAG,CAAC,CAAC,EAAE,gBAAgB,GAAG,CAAC,CAAC,EAAE,kBAAkB,GAAG,CAAC,EAAC;EACvG,IAAI,sBAAsB,EAAE;IAC1B,cAAc,GAAG,sBAAsB,CAAC,oBAAmB;IAC3D,gBAAgB,GAAG,sBAAsB,CAAC,cAAa;IACvD,kBAAkB,GAAG,sBAAsB,CAAC,gBAAe;IAC3D,sBAAsB,CAAC,mBAAmB,GAAG,sBAAsB,CAAC,aAAa,GAAG,sBAAsB,CAAC,eAAe,GAAG,CAAC,EAAC;GAChI,MAAM;IACL,sBAAsB,GAAG,IAAI,oBAAmB;IAChD,sBAAsB,GAAG,KAAI;GAC9B;;EAEDA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnD,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI;IAClD,EAAA,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,MAAK,EAAA;EACpCF,IAAI,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,sBAAsB,EAAC;EACnE,IAAI,cAAc,EAAE,EAAA,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAC,EAAA;EAC9E,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;IACtBA,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK;IAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,CAAC,GAAG,KAAI;IAC/F,IAAI,CAAC,sBAAsB,EAAE,EAAA,mBAAmB,CAAC,IAAI,CAAC,sBAAsB,EAAC,EAAA;IAC7E,sBAAsB,CAAC,eAAe,GAAG,CAAC,EAAC;IAC3C,IAAI,CAAC,SAAS,CAAC,IAAI,EAAC;IACpB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IACxC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,sBAAsB,CAAC;GACrD,MAAM;IACL,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;GACrF;EACD,IAAI,cAAc,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,eAAc,EAAA;EACpF,IAAI,gBAAgB,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,aAAa,GAAG,iBAAgB,EAAA;EAClF,IAAI,kBAAkB,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,eAAe,GAAG,mBAAkB,EAAA;EACxF,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,qBAAqB,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;EAChEJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC1D,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACnE,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,CAAC,EAAE;IACzBF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;IAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAE;IACzC,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,KAAK,EAAC;IACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IAC5C,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,uBAAuB,CAAC;GACtD;EACD,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;EACvDJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,sBAAsB,EAAE,KAAK,EAAC;EAC9D,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACnE,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,yBAAyB,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;EACxI;;;;;;;;AAQDI,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE;EACzEJ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAK;EAC1B,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,CAAC,EAAE;IACnD,IAAI,IAAI,GAAG,OAAO,EAAE;MAClBF,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,WAAU;MACvEF,IAAI,EAAE,GAAG,IAAI,CAAC,MAAK;MACnB,IAAI,CAAC,IAAI,GAAE;MACXA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;MACnDA,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAC;MAC/FA,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAC;MACjF,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC;KACzE;GACF;EACD,OAAO,IAAI;EACZ;;AAEDI,IAAE,CAAC,WAAW,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE;EACtEJ,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;EAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,QAAQ,GAAG,GAAE;EAClB,IAAI,CAAC,KAAK,GAAG,MAAK;EAClB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,mBAAmB,GAAG,kBAAkB,CAAC;EACjF;;;;AAIDI,IAAE,CAAC,eAAe,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;;;EAC9DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAI;EACzD,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,EAAE;IAChH,IAAI,GAAG,IAAI,CAAC,UAAU,GAAE;IACxB,QAAQ,GAAG,KAAI;GAChB,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;IAC3BA,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAM;IAC7D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK;IAC1B,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAC;IAChD,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,MAAM,EAAE,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAC,EAAA;SACpC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;aACzC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY;MAC1C,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,wCAAwC,EAAC,EAAA;SACxE,EAAA,QAAQ,GAAG,KAAI,EAAA;IACpB,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,kBAAkB,GAAG,iBAAiB,EAAC;GAC9E,MAAM;IACL,IAAI,GAAG,IAAI,CAAC,mBAAmB,CAAC,sBAAsB,EAAC;IACvD,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;IACnE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE;MACtDF,IAAIO,MAAI,GAAGJ,MAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;MAC/CI,MAAI,CAAC,QAAQ,GAAGJ,MAAI,CAAC,MAAK;MAC1BI,MAAI,CAAC,MAAM,GAAG,MAAK;MACnBA,MAAI,CAAC,QAAQ,GAAG,KAAI;MACpBJ,MAAI,CAAC,SAAS,CAAC,IAAI,EAAC;MACpBA,MAAI,CAAC,IAAI,GAAE;MACX,IAAI,GAAGA,MAAI,CAAC,UAAU,CAACI,MAAI,EAAE,kBAAkB,EAAC;KACjD;GACF;;EAED,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAACL,KAAE,CAAC,QAAQ,CAAC;IACpC,EAAA,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,EAAA;;IAEjG,EAAA,OAAO,IAAI,EAAA;EACd;;;;AAIDE,IAAE,CAAC,mBAAmB,GAAG,SAAS,sBAAsB,EAAE;EACxDJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,EAAC;EACrDA,IAAI,mBAAmB,GAAG,IAAI,CAAC,IAAI,KAAK,yBAAyB,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,IAAG;EACjI,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,IAAI,mBAAmB,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1FA,IAAI,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAC;EAC3D,IAAI,sBAAsB,IAAI,MAAM,CAAC,IAAI,KAAK,kBAAkB,EAAE;IAChE,IAAI,sBAAsB,CAAC,mBAAmB,IAAI,MAAM,CAAC,KAAK,EAAE,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,EAAC,EAAA;IAC/G,IAAI,sBAAsB,CAAC,iBAAiB,IAAI,MAAM,CAAC,KAAK,EAAE,EAAA,sBAAsB,CAAC,iBAAiB,GAAG,CAAC,EAAC,EAAA;GAC5G;EACD,OAAO,MAAM;EACd;;AAEDI,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE;;;EAC/DJ,IAAI,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;MACtG,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,QAAO;EACpH,OAAO,IAAI,EAAE;IACXA,IAAI,OAAO,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAC;IACrF,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,yBAAyB,EAAE,EAAA,OAAO,OAAO,EAAA;IAClF,IAAI,GAAG,QAAO;GACf;EACF;;AAEDC,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE;EAC/EJ,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,EAAC;EACpC,IAAI,QAAQ,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,GAAG,CAAC,EAAE;IAChCF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACzE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAQ;IAC1B,IAAI,QAAQ,EAAE,EAAA,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,QAAQ,EAAC,EAAA;IACtC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,EAAC;GACjD,MAAM,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC1CF,IAAI,sBAAsB,GAAG,IAAI,mBAAmB,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;IACrJ,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,aAAa,GAAG,EAAC;IACtBA,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAACE,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAC;IAC1G,IAAI,eAAe,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;MACvE,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,KAAK,EAAC;MACtD,IAAI,CAAC,8BAA8B,GAAE;MACrC,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;QACxB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,2DAA2D,EAAC,EAAA;MAC7F,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;MACrC,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC;KACvF;IACD,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,aAAa,GAAG,gBAAgB,IAAI,IAAI,CAAC,cAAa;IAC3DF,IAAIO,MAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/CA,MAAI,CAAC,MAAM,GAAG,KAAI;IAClBA,MAAI,CAAC,SAAS,GAAG,SAAQ;IACzB,IAAI,GAAG,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,gBAAgB,EAAC;GAC/C,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKL,KAAE,CAAC,SAAS,EAAE;IACrCF,IAAIO,MAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/CA,MAAI,CAAC,GAAG,GAAG,KAAI;IACfA,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAC;IACjD,IAAI,GAAG,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,0BAA0B,EAAC;GACzD;EACD,OAAO,IAAI;EACZ;;;;;;;AAODH,IAAE,CAAC,aAAa,GAAG,SAAS,sBAAsB,EAAE;;;EAGlD,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,KAAK,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAE7CF,IAAI,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC,gBAAgB,KAAK,IAAI,CAAC,MAAK;EAC3D,QAAQ,IAAI,CAAC,IAAI;EACjB,KAAKE,KAAE,CAAC,MAAM;IACZ,IAAI,CAAC,IAAI,CAAC,UAAU;MAClB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,kCAAkC,EAAC,EAAA;IAC5D,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB;MACnD,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,gDAAgD,EAAC,EAAA;;;;;;;IAO1E,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM;MAC9E,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC;;EAEvC,KAAKA,KAAE,CAAC,KAAK;IACX,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;;EAEhD,KAAKA,KAAE,CAAC,IAAI;IACVF,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,YAAW;IACnFA,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,SAAS,CAAC;MAC9H,EAAA,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAA;IACjF,IAAI,UAAU,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE;MAC5C,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;QACpB,EAAA,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAA;MACrF,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE;QACjG,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;QAC3B,IAAI,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;UAClD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;QACnB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;OACnF;KACF;IACD,OAAO,EAAE;;EAEX,KAAKA,KAAE,CAAC,MAAM;IACZF,IAAI,KAAK,GAAG,IAAI,CAAC,MAAK;IACtB,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAC;IACrC,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAC;IACzD,OAAO,IAAI;;EAEb,KAAKE,KAAE,CAAC,GAAG,CAAC,CAAC,KAAKA,KAAE,CAAC,MAAM;IACzB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;;EAEtC,KAAKA,KAAE,CAAC,KAAK,CAAC,CAAC,KAAKA,KAAE,CAAC,KAAK,CAAC,CAAC,KAAKA,KAAE,CAAC,MAAM;IAC1C,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAK;IACnE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAO;IAC5B,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;;EAEzC,KAAKA,KAAE,CAAC,MAAM;IACZF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,kCAAkC,CAAC,UAAU,EAAC;IAClF,IAAI,sBAAsB,EAAE;MAC1B,IAAI,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;QACpF,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,MAAK,EAAA;MACpD,IAAI,sBAAsB,CAAC,iBAAiB,GAAG,CAAC;QAC9C,EAAA,sBAAsB,CAAC,iBAAiB,GAAG,MAAK,EAAA;KACnD;IACD,OAAO,IAAI;;EAEb,KAAKE,KAAE,CAAC,QAAQ;IACd,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,CAACA,KAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,sBAAsB,EAAC;IACnF,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;;EAEjD,KAAKA,KAAE,CAAC,MAAM;IACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,sBAAsB,CAAC;;EAErD,KAAKA,KAAE,CAAC,SAAS;IACf,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;;EAEpC,KAAKA,KAAE,CAAC,MAAM;IACZ,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;;EAEjD,KAAKA,KAAE,CAAC,IAAI;IACV,OAAO,IAAI,CAAC,QAAQ,EAAE;;EAExB,KAAKA,KAAE,CAAC,SAAS;IACf,OAAO,IAAI,CAAC,aAAa,EAAE;;EAE7B;IACE,IAAI,CAAC,UAAU,GAAE;GAClB;EACF;;AAEDE,IAAE,CAAC,YAAY,GAAG,SAAS,KAAK,EAAE;EAChCJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,KAAK,GAAG,MAAK;EAClB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EACjD,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;EACxC;;AAEDI,IAAE,CAAC,oBAAoB,GAAG,WAAW;EACnC,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtBF,IAAI,GAAG,GAAG,IAAI,CAAC,eAAe,GAAE;EAChC,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,GAAG;EACX;;AAEDE,IAAE,CAAC,kCAAkC,GAAG,SAAS,UAAU,EAAE;;;EAC3DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,kBAAkB,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAC5G,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,IAAI,GAAE;;IAEXA,IAAI,aAAa,GAAG,IAAI,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,CAAC,SAAQ;IAC7DA,IAAI,QAAQ,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,MAAK;IACpDA,IAAI,sBAAsB,GAAG,IAAI,mBAAmB,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,YAAW;IAC3H,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;;IAEjB,OAAO,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE;MAC9B,KAAK,GAAG,KAAK,GAAG,KAAK,GAAGC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MAC7C,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;QAClE,WAAW,GAAG,KAAI;QAClB,KAAK;OACN,MAAM,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;QACpC,WAAW,GAAGC,MAAI,CAAC,MAAK;QACxB,QAAQ,CAAC,IAAI,CAACA,MAAI,CAAC,cAAc,CAACA,MAAI,CAAC,gBAAgB,EAAE,CAAC,EAAC;QAC3D,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;QACnG,KAAK;OACN,MAAM;QACL,QAAQ,CAAC,IAAI,CAACA,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAEA,MAAI,CAAC,cAAc,CAAC,EAAC;OACzF;KACF;IACDH,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,CAAC,SAAQ;IACzD,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;;IAEtB,IAAI,UAAU,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;MAClE,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,KAAK,EAAC;MACtD,IAAI,CAAC,8BAA8B,GAAE;MACrC,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,OAAO,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC;KAC9D;;IAED,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,EAAC,EAAA;IACvE,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,WAAW,EAAC,EAAA;IAC7C,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;;IAE5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;MACvB,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,EAAE,aAAa,EAAC;MACpD,GAAG,CAAC,WAAW,GAAG,SAAQ;MAC1B,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,oBAAoB,EAAE,WAAW,EAAE,WAAW,EAAC;KACvE,MAAM;MACL,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAC;KAClB;GACF,MAAM;IACL,GAAG,GAAG,IAAI,CAAC,oBAAoB,GAAE;GAClC;;EAED,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE;IAC/BF,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC9C,GAAG,CAAC,UAAU,GAAG,IAAG;IACpB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,yBAAyB,CAAC;GACvD,MAAM;IACL,OAAO,GAAG;GACX;EACF;;AAEDI,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE;EACjC,OAAO,IAAI;EACZ;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE;EAC9D,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACjF;;;;;;;;AAQDL,IAAMS,OAAK,GAAG,GAAE;;AAEhBJ,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvBJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3BA,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;EAChC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,GAAG,CAAC,EAAE;IACrD,IAAI,CAAC,IAAI,GAAG,KAAI;IAChBF,IAAI,WAAW,GAAG,IAAI,CAAC,YAAW;IAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,IAAI,WAAW;MAChD,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,oDAAoD,EAAC,EAAA;IAClG,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE;MAC5B,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,0CAA0C,EAAC,EAAA;IAC/E,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;GAC7C;EACDA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAC;EAClF,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAACA,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,KAAK,EAAC,EAAA;OACxG,EAAA,IAAI,CAAC,SAAS,GAAGM,QAAK,EAAA;EAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;;;AAIDJ,IAAE,CAAC,oBAAoB,GAAG,SAAS,GAAA,EAAY;MAAX,QAAQ;;EAC1CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,eAAe,EAAE;IACpC,IAAI,CAAC,QAAQ,EAAE;MACb,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,kDAAkD,EAAC;KACtF;IACD,IAAI,CAAC,KAAK,GAAG;MACX,GAAG,EAAE,IAAI,CAAC,KAAK;MACf,MAAM,EAAE,IAAI;MACb;GACF,MAAM;IACL,IAAI,CAAC,KAAK,GAAG;MACX,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;MACnE,MAAM,EAAE,IAAI,CAAC,KAAK;MACnB;GACF;EACD,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,UAAS;EACtC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,aAAa,GAAG,SAAS,GAAA,EAAyB;oBAAP;2BAAA,GAAG,EAAE,CAAX;qEAAA,KAAK;;EAC3CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,WAAW,GAAG,GAAE;EACrBA,IAAI,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,UAAA,QAAQ,CAAC,EAAC;EAClD,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE;IACnB,IAAIG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,EAAE,+BAA+B,EAAC,EAAA;IAC/EA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,YAAY,EAAC;IAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAACC,MAAI,CAAC,eAAe,EAAE,EAAC;IAC7CA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,MAAM,EAAC;IACtB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAGC,MAAI,CAAC,oBAAoB,CAAC,CAAC,UAAA,QAAQ,CAAC,CAAC,EAAC;GACjE;EACD,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE;EAC9B,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO;KACjF,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,CAAC,CAAC;IACxL,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;EACjE;;;;AAIDE,IAAE,CAAC,QAAQ,GAAG,SAAS,SAAS,EAAE,sBAAsB,EAAE;;;EACxDJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,QAAQ,GAAG,GAAE;EACxD,IAAI,CAAC,UAAU,GAAG,GAAE;EACpB,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,CAAC,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBH,IAAM,IAAI,GAAGI,MAAI,CAAC,aAAa,CAAC,SAAS,EAAE,sBAAsB,EAAC;IAClE,IAAI,CAAC,SAAS,EAAE,EAAAA,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,sBAAsB,EAAC,EAAA;IAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAC;GAC3B;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,eAAe,GAAG,kBAAkB,CAAC;EAC/E;;AAEDC,IAAE,CAAC,aAAa,GAAG,SAAS,SAAS,EAAE,sBAAsB,EAAE;EAC7DJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAQ;EACrE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,CAAC,EAAE;IAC1D,IAAI,SAAS,EAAE;MACb,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;MACtC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,EAAE;QAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC;OACxE;MACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;KAC5C;;IAED,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,sBAAsB,EAAE;MACrD,IAAI,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,EAAE;QAClD,sBAAsB,CAAC,mBAAmB,GAAG,IAAI,CAAC,MAAK;OACxD;MACD,IAAI,sBAAsB,CAAC,iBAAiB,GAAG,CAAC,EAAE;QAChD,sBAAsB,CAAC,iBAAiB,GAAG,IAAI,CAAC,MAAK;OACtD;KACF;;IAED,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;;IAEpE,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,IAAI,sBAAsB,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC,EAAE;MAChG,sBAAsB,CAAC,aAAa,GAAG,IAAI,CAAC,MAAK;KAClD;;IAED,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;GAC9C;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,MAAM,GAAG,MAAK;IACnB,IAAI,CAAC,SAAS,GAAG,MAAK;IACtB,IAAI,SAAS,IAAI,sBAAsB,EAAE;MACvC,QAAQ,GAAG,IAAI,CAAC,MAAK;MACrB,QAAQ,GAAG,IAAI,CAAC,SAAQ;KACzB;IACD,IAAI,CAAC,SAAS;MACZ,EAAA,WAAW,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC,EAAA;GAClC;EACDF,IAAI,WAAW,GAAG,IAAI,CAAC,YAAW;EAClC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAC;EAC5B,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;IACzG,OAAO,GAAG,KAAI;IACd,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;IAChE,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,sBAAsB,EAAC;GACrD,MAAM;IACL,OAAO,GAAG,MAAK;GAChB;EACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,sBAAsB,EAAE,WAAW,EAAC;EACvH,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC;EACzC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,sBAAsB,EAAE,WAAW,EAAE;EAC/H,IAAI,CAAC,WAAW,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,KAAK;IACpD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAEnB,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;IACtB,IAAI,CAAC,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;IACjI,IAAI,CAAC,IAAI,GAAG,OAAM;GACnB,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,EAAE;IACnE,IAAI,SAAS,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAChC,IAAI,CAAC,IAAI,GAAG,OAAM;IAClB,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,EAAC;GACpD,MAAM,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW;aAC1B,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY;cAChF,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC;cACnD,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC9D,IAAI,WAAW,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAI;IACzB,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAC;IAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAC;IACpCF,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,KAAK,GAAG,CAAC,GAAG,EAAC;IAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE;MAC3CA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAK;MAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QACrB,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;;QAE5D,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;KACvE,MAAM;MACL,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa;QACpE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,+BAA+B,EAAC,EAAA;KACrF;GACF,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY,EAAE;IAC5F,IAAI,WAAW,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;IAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa;MAClD,EAAA,IAAI,CAAC,aAAa,GAAG,SAAQ,EAAA;IAC/B,IAAI,CAAC,IAAI,GAAG,OAAM;IAClB,IAAI,SAAS,EAAE;MACb,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAC;KAClE,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,EAAE,IAAI,sBAAsB,EAAE;MACxD,IAAI,sBAAsB,CAAC,eAAe,GAAG,CAAC;QAC5C,EAAA,sBAAsB,CAAC,eAAe,GAAG,IAAI,CAAC,MAAK,EAAA;MACrD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAC;KAClE,MAAM;MACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAG;KACtB;IACD,IAAI,CAAC,SAAS,GAAG,KAAI;GACtB,MAAM,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACzB;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,QAAQ,CAAC,EAAE;MACzB,IAAI,CAAC,QAAQ,GAAG,KAAI;MACpB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,gBAAgB,GAAE;MAClC,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,QAAQ,EAAC;MACxB,OAAO,IAAI,CAAC,GAAG;KAChB,MAAM;MACL,IAAI,CAAC,QAAQ,GAAG,MAAK;KACtB;GACF;EACD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;EACjH;;;;AAIDE,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE;EAC/B,IAAI,CAAC,EAAE,GAAG,KAAI;EACd,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,GAAG,MAAK,EAAA;EAC3E,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,MAAK,EAAA;EACtD;;;;AAIDA,IAAE,CAAC,WAAW,GAAG,SAAS,WAAW,EAAE,OAAO,EAAE,gBAAgB,EAAE;EAChEJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;;EAE5H,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,SAAS,GAAG,YAAW,EAAA;EAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAExB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;EACtB,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,WAAW,IAAI,gBAAgB,GAAG,kBAAkB,GAAG,CAAC,CAAC,EAAC;;EAEnH,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAACA,KAAE,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAC;EACpF,IAAI,CAAC,8BAA8B,GAAE;EACrC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC;;EAEzC,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC;EACnD;;;;AAIDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE;EACxDJ,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;;EAEnG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,WAAW,EAAC;EAC5D,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAEzD,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;;EAEtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAC;EACjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAC;;EAEzC,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,yBAAyB,CAAC;EACxD;;;;AAIDI,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE;EAC/DJ,IAAI,YAAY,GAAG,eAAe,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAM;EAC7DF,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,MAAK;;EAE9C,IAAI,YAAY,EAAE;IAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,gBAAgB,GAAE;IACnC,IAAI,CAAC,UAAU,GAAG,KAAI;IACtB,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAC;GAC9B,MAAM;IACLA,IAAI,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAC;IACrF,IAAI,CAAC,SAAS,IAAI,SAAS,EAAE;MAC3B,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;;;;MAI1C,IAAI,SAAS,IAAI,SAAS;QACxB,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,2EAA2E,EAAC,EAAA;KACjH;;;IAGDA,IAAI,SAAS,GAAG,IAAI,CAAC,OAAM;IAC3B,IAAI,CAAC,MAAM,GAAG,GAAE;IAChB,IAAI,SAAS,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,KAAI,EAAA;;;;IAIjC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,SAAS,IAAI,CAAC,SAAS,IAAI,CAAC,eAAe,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAC;IACxH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IAClC,IAAI,CAAC,UAAU,GAAG,MAAK;IACvB,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;IAC3C,IAAI,CAAC,MAAM,GAAG,UAAS;GACxB;EACD,IAAI,CAAC,SAAS,GAAE;;;EAGhB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAC,EAAA;EACjE,IAAI,CAAC,MAAM,GAAG,UAAS;EACxB;;AAEDI,IAAE,CAAC,iBAAiB,GAAG,SAAS,MAAM,EAAE;EACtC,KAAc,kBAAI,MAAM,yBAAA;IAAnB;IAAAJ,IAAI,KAAK;;IACZ,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,EAAA,OAAO,KAAK;GAAA,EAAA;EAC/C,OAAO,IAAI;EACZ;;;;;AAKDI,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,eAAe,EAAE;;;EAC/CJ,IAAI,QAAQ,GAAG,GAAE;EACjB,KAAc,kBAAI,IAAI,CAAC,MAAM,yBAAA;IAAxB;IAAAA,IAAI,KAAK;;IACZG,MAAI,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,eAAe,GAAG,IAAI,GAAG,QAAQ,EAAC;GAAA;EACrE;;;;;;;;AAQDC,IAAE,CAAC,aAAa,GAAG,SAAS,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,sBAAsB,EAAE;;;EACzFJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;IACvB,IAAI,CAAC,KAAK,EAAE;MACVG,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,EAAA,KAAK,EAAA;KAChE,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBH,IAAI,GAAG,YAAA;IACP,IAAI,UAAU,IAAIG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK;MACtC,EAAA,GAAG,GAAG,KAAI,EAAA;SACP,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MAClC,GAAG,GAAGC,MAAI,CAAC,WAAW,CAAC,sBAAsB,EAAC;MAC9C,IAAI,sBAAsB,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC;QAC9F,EAAA,sBAAsB,CAAC,aAAa,GAAGC,MAAI,CAAC,MAAK,EAAA;KACpD,MAAM;MACL,GAAG,GAAGA,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;KAC3D;IACD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAC;GACf;EACD,OAAO,IAAI;EACZ;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,GAAA,EAAoB;MAAnB,KAAK,aAAE;MAAA,GAAG,WAAE;MAAA,IAAI;;EAC7C,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,KAAK,OAAO;IACtC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,qDAAqD,EAAC,EAAA;EACrF,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,KAAK,OAAO;IAClC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,2DAA2D,EAAC,EAAA;EAC3F,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1B,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,GAAE,sBAAqB,GAAE,IAAI,MAAE,GAAE,EAAA;EACnD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC;IAC9B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAA,MAAM,EAAA;EAC3DL,IAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,cAAa;EACtE,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IACjB,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,KAAK,OAAO;MACnC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sDAAsD,EAAC,EAAA;IACtF,IAAI,CAAC,gBAAgB,CAAC,KAAK,GAAE,eAAc,GAAE,IAAI,kBAAc,GAAE;GAClE;EACF;;;;;;AAMDK,IAAE,CAAC,UAAU,GAAG,SAAS,OAAO,EAAE,SAAS,EAAE;EAC3CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,KAAK,OAAO,EAAE,EAAA,OAAO,GAAG,MAAK,EAAA;EACtE,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAK;GACvB,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;IAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAO;;;;;;IAM7B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;SACjD,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE;MAClG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;KACnB;GACF,MAAM;IACL,IAAI,CAAC,UAAU,GAAE;GAClB;EACD,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,YAAY,EAAC;EACnC,IAAI,CAAC,OAAO,EAAE;IACZ,IAAI,CAAC,eAAe,CAAC,IAAI,EAAC;IAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa;MAC9C,EAAA,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,MAAK,EAAA;GAClC;EACD,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE;EAC7B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK,EAAA;;EAE9CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,kBAAkB,EAAE,KAAK,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;IAC1G,IAAI,CAAC,QAAQ,GAAG,MAAK;IACrB,IAAI,CAAC,QAAQ,GAAG,KAAI;GACrB,MAAM;IACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC;IACjC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;GAC5C;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,UAAU,GAAG,WAAW;EACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK,EAAA;;EAE9CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAC;EAChD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;CAChD;;AC15BDD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;;AAQ3BA,IAAE,CAAC,KAAK,GAAG,SAAS,GAAG,EAAE,OAAO,EAAE;EAChCJ,IAAI,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAC;EACtC,OAAO,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,IAAG;EACnDA,IAAI,GAAG,GAAG,IAAI,WAAW,CAAC,OAAO,EAAC;EAClC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAG;EACrD,MAAM,GAAG;EACV;;AAEDI,IAAE,CAAC,gBAAgB,GAAGA,IAAE,CAAC,MAAK;;AAE9BA,IAAE,CAAC,WAAW,GAAG,WAAW;EAC1B,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;IAC1B,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;GAC7D;CACF;;ACtBDL,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3B,IAAM,KAAK,GAAC,cACC,CAAC,KAAK,EAAE;EACnB,IAAM,CAAC,KAAK,GAAG,MAAK;;EAEpB,IAAM,CAAC,GAAG,GAAG,GAAE;;EAEf,IAAM,CAAC,OAAO,GAAG,GAAE;;EAEnB,IAAM,CAAC,SAAS,GAAG,GAAE;CACpB,CAAA;;;;AAKHA,IAAE,CAAC,UAAU,GAAG,SAAS,KAAK,EAAE;EAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,EAAC;EACvC;;AAEDA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxB,IAAI,CAAC,UAAU,CAAC,GAAG,GAAE;EACtB;;;;;AAKDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE;EAC9C,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,cAAc,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;EACrF;;AAEDA,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE;;;EAChDJ,IAAI,UAAU,GAAG,MAAK;EACtB,IAAI,WAAW,KAAK,YAAY,EAAE;IAChCD,IAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC;IACnH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC;IACxB,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;MAC5C,EAAA,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC,EAAA;GACrC,MAAM,IAAI,WAAW,KAAK,iBAAiB,EAAE;IAC5CA,IAAMU,OAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjCA,OAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC;GACzB,MAAM,IAAI,WAAW,KAAK,aAAa,EAAE;IACxCV,IAAMU,OAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjC,IAAI,IAAI,CAAC,mBAAmB;MAC1B,EAAA,UAAU,GAAGA,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,EAAA;;MAE7C,EAAA,UAAU,GAAGA,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAIA,OAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,EAAA;IAC/EA,OAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAC;GAC3B,MAAM;IACL,KAAKT,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;MACpDD,IAAMU,OAAK,GAAGN,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;MAChC,IAAIM,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAACA,OAAK,CAAC,KAAK,GAAG,kBAAkB,KAAKA,OAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;UACtG,CAACN,MAAI,CAAC,0BAA0B,CAACM,OAAK,CAAC,IAAIA,OAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;QACjF,UAAU,GAAG,KAAI;QACjB,KAAK;OACN;MACDA,OAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAC;MACpB,IAAIN,MAAI,CAAC,QAAQ,KAAKM,OAAK,CAAC,KAAK,GAAG,SAAS,CAAC;QAC5C,EAAA,OAAON,MAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC,EAAA;MACpC,IAAIM,OAAK,CAAC,KAAK,GAAG,SAAS,EAAE,EAAA,KAAK,EAAA;KACnC;GACF;EACD,IAAI,UAAU,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,GAAE,cAAa,GAAE,IAAI,gCAA4B,GAAE,EAAA;EAC7F;;AAEDL,IAAE,CAAC,gBAAgB,GAAG,SAAS,EAAE,EAAE;;EAEjC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;MAClD,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;IAClD,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,GAAE;GACpC;EACF;;AAEDA,IAAE,CAAC,YAAY,GAAG,WAAW;EAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;EACnD;;AAEDA,IAAE,CAAC,eAAe,GAAG,WAAW;;;EAC9B,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;IAC7CA,IAAI,KAAK,GAAGG,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;IAC9B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,EAAE,EAAA,OAAO,KAAK,EAAA;GAC1C;EACF;;;AAGDC,IAAE,CAAC,gBAAgB,GAAG,WAAW;;;EAC/B,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;IAC7CA,IAAI,KAAK,GAAGG,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;IAC9B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,IAAI,EAAE,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;GAC1E;CACF;;AC3FM,IAAM,IAAI,GAAC,aACL,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;EAC9B,IAAM,CAAC,IAAI,GAAG,GAAE;EAChB,IAAM,CAAC,KAAK,GAAG,IAAG;EAClB,IAAM,CAAC,GAAG,GAAG,EAAC;EACd,IAAM,MAAM,CAAC,OAAO,CAAC,SAAS;IAC5B,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,MAAM,EAAE,GAAG,EAAC,EAAA;EAC9C,IAAM,MAAM,CAAC,OAAO,CAAC,gBAAgB;IACnC,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,iBAAgB,EAAA;EACrD,IAAM,MAAM,CAAC,OAAO,CAAC,MAAM;IACzB,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,EAAC,EAAA;CACxB,CAAA;;;;AAKHJ,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3BA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxB,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC;EACjD;;AAEDA,IAAE,CAAC,WAAW,GAAG,SAAS,GAAG,EAAE,GAAG,EAAE;EAClC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;EAChC;;;;AAID,SAAS,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;EAC1C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,GAAG,GAAG,IAAG;EACd,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAG,EAAA;EACpB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;IACrB,EAAA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAG,EAAA;EACrB,OAAO,IAAI;CACZ;;AAEDA,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnC,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC;EAChF;;;;AAIDA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;EAC/C,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;CACrD;;ACjDD;;;;AAIA,AAIO,IAAM,UAAU,GAAC,mBACX,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE;EAC/D,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,OAAM;EACxB,IAAM,CAAC,aAAa,GAAG,CAAC,CAAC,cAAa;EACtC,IAAM,CAAC,QAAQ,GAAG,SAAQ;EAC1B,IAAM,CAAC,SAAS,GAAG,CAAC,CAAC,UAAS;CAC7B,CAAA;;AAGH,AAAOL,IAAMW,OAAK,GAAG;EACnB,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;EAClC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC;EACjC,MAAM,EAAE,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;EACnC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;EAClC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC;EACjC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,UAAA,CAAC,EAAC,SAAG,CAAC,CAAC,oBAAoB,EAAE,GAAA,CAAC;EACtE,MAAM,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC;EACzC,MAAM,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;EACxC,UAAU,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;EAC/D,KAAK,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;EAC5D;;AAEDX,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3BA,IAAE,CAAC,cAAc,GAAG,WAAW;EAC7B,OAAO,CAACM,OAAK,CAAC,MAAM,CAAC;EACtB;;AAEDN,IAAE,CAAC,YAAY,GAAG,SAAS,QAAQ,EAAE;EACnCJ,IAAI,MAAM,GAAG,IAAI,CAAC,UAAU,GAAE;EAC9B,IAAI,MAAM,KAAKU,OAAK,CAAC,MAAM,IAAI,MAAM,KAAKA,OAAK,CAAC,MAAM;IACpD,EAAA,OAAO,IAAI,EAAA;EACb,IAAI,QAAQ,KAAKR,KAAE,CAAC,KAAK,KAAK,MAAM,KAAKQ,OAAK,CAAC,MAAM,IAAI,MAAM,KAAKA,OAAK,CAAC,MAAM,CAAC;IAC/E,EAAA,OAAO,CAAC,MAAM,CAAC,MAAM,EAAA;;;;;EAKvB,IAAI,QAAQ,KAAKR,KAAE,CAAC,OAAO,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW;IACrE,EAAA,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAA;EACtE,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,GAAG,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK;IACzH,EAAA,OAAO,IAAI,EAAA;EACb,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM;IACxB,EAAA,OAAO,MAAM,KAAKQ,OAAK,CAAC,MAAM,EAAA;EAChC,IAAI,QAAQ,KAAKR,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI;IACxE,EAAA,OAAO,KAAK,EAAA;EACd,OAAO,CAAC,IAAI,CAAC,WAAW;EACzB;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,WAAW;;;EACjC,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;IACjDA,IAAI,OAAO,GAAGG,MAAI,CAAC,OAAO,CAAC,CAAC,EAAC;IAC7B,IAAI,OAAO,CAAC,KAAK,KAAK,UAAU;MAC9B,EAAA,OAAO,OAAO,CAAC,SAAS,EAAA;GAC3B;EACD,OAAO,KAAK;EACb;;AAEDC,IAAE,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACpCJ,IAAI,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,KAAI;EAC5B,IAAI,IAAI,CAAC,OAAO,IAAI,QAAQ,KAAKE,KAAE,CAAC,GAAG;IACrC,EAAA,IAAI,CAAC,WAAW,GAAG,MAAK,EAAA;OACrB,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa;IAClC,EAAA,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAC,EAAA;;IAE3B,EAAA,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAU,EAAA;EACrC;;;;AAIDA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAGA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,WAAW;EAC7D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;IAC7B,IAAI,CAAC,WAAW,GAAG,KAAI;IACvB,MAAM;GACP;EACDF,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;EAC5B,IAAI,GAAG,KAAKU,OAAK,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,KAAK,UAAU,EAAE;IAClE,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;GACzB;EACD,IAAI,CAAC,WAAW,GAAG,CAAC,GAAG,CAAC,OAAM;EAC/B;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAGQ,OAAK,CAAC,MAAM,GAAGA,OAAK,CAAC,MAAM,EAAC;EAC5E,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,YAAY,CAAC,aAAa,GAAG,WAAW;EACzC,IAAI,CAAC,OAAO,CAAC,IAAI,CAACQ,OAAK,CAAC,MAAM,EAAC;EAC/B,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EAC3CF,IAAI,eAAe,GAAG,QAAQ,KAAKE,KAAE,CAAC,GAAG,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,OAAM;EACpH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,GAAGQ,OAAK,CAAC,MAAM,GAAGA,OAAK,CAAC,MAAM,EAAC;EAChE,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,WAAW;;EAEpC;;AAEDA,KAAE,CAAC,SAAS,CAAC,aAAa,GAAGA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACxE,IAAI,QAAQ,CAAC,UAAU,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK;MACpE,EAAE,QAAQ,KAAKA,KAAE,CAAC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;MAC3F,EAAE,CAAC,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,KAAKQ,OAAK,CAAC,MAAM,CAAC;IAC5F,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;;IAE/B,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;EACjC,IAAI,CAAC,WAAW,GAAG,MAAK;EACzB;;AAEDR,KAAE,CAAC,SAAS,CAAC,aAAa,GAAG,WAAW;EACtC,IAAI,IAAI,CAAC,UAAU,EAAE,KAAKQ,OAAK,CAAC,MAAM;IACpC,EAAA,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE,EAAA;;IAElB,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;EACjC,IAAI,CAAC,WAAW,GAAG,MAAK;EACzB;;AAEDR,KAAE,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACzC,IAAI,QAAQ,KAAKA,KAAE,CAAC,SAAS,EAAE;IAC7BF,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,EAAC;IACnC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAKU,OAAK,CAAC,MAAM;MACtC,EAAA,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAGA,OAAK,CAAC,WAAU,EAAA;;MAEtC,EAAA,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAGA,OAAK,CAAC,MAAK,EAAA;GACpC;EACD,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACzCF,IAAI,OAAO,GAAG,MAAK;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,QAAQ,KAAKE,KAAE,CAAC,GAAG,EAAE;IACxD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW;QACxC,IAAI,CAAC,KAAK,KAAK,OAAO,IAAI,IAAI,CAAC,kBAAkB,EAAE;MACrD,EAAA,OAAO,GAAG,KAAI,EAAA;GACjB;EACD,IAAI,CAAC,WAAW,GAAG,QAAO;CAC3B;;;;;;;AC7IDH,IAAM,qBAAqB,GAAG,89BAA69B;AAC3/BA,IAAM,uBAAuB,GAAG;EAC9B,CAAC,EAAE,qBAAqB;EACxB,EAAE,EAAE,qBAAqB,GAAG,wBAAwB;EACrD;;;AAGDA,IAAM,4BAA4B,GAAG,qpBAAopB;;;AAGzrBA,IAAM,iBAAiB,GAAG,2+DAA0+D;AACpgEA,IAAM,mBAAmB,GAAG;EAC1B,CAAC,EAAE,iBAAiB;EACpB,EAAE,EAAE,iBAAiB,GAAG,iHAAiH;EAC1I;;AAEDA,IAAM,IAAI,GAAG,GAAE;AACf,SAAS,gBAAgB,CAAC,WAAW,EAAE;EACrCC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG;IAC1B,MAAM,EAAE,WAAW,CAAC,uBAAuB,CAAC,WAAW,CAAC,GAAG,GAAG,GAAG,4BAA4B,CAAC;IAC9F,SAAS,EAAE;MACT,gBAAgB,EAAE,WAAW,CAAC,4BAA4B,CAAC;MAC3D,MAAM,EAAE,WAAW,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;KACtD;IACF;EACD,CAAC,CAAC,SAAS,CAAC,iBAAiB,GAAG,CAAC,CAAC,SAAS,CAAC,OAAM;;EAElD,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,iBAAgB;EAC7C,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAM;EACnC,CAAC,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,kBAAiB;CAChD;AACD,gBAAgB,CAAC,CAAC,EAAC;AACnB,gBAAgB,CAAC,EAAE,CAAC;;AClCpBD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3B,AAAO,IAAM,qBAAqB,GAAC,8BACtB,CAAC,MAAM,EAAE;EACpB,IAAM,CAAC,MAAM,GAAG,OAAM;EACtB,IAAM,CAAC,UAAU,GAAG,KAAI,IAAE,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,IAAI,GAAG,EAAE,CAAA,IAAG,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,EAAA;EAClH,IAAM,CAAC,iBAAiB,GAAGO,IAAuB,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,EAAC;EACtH,IAAM,CAAC,MAAM,GAAG,GAAE;EAClB,IAAM,CAAC,KAAK,GAAG,GAAE;EACjB,IAAM,CAAC,KAAK,GAAG,EAAC;EAChB,IAAM,CAAC,OAAO,GAAG,MAAK;EACtB,IAAM,CAAC,OAAO,GAAG,MAAK;EACtB,IAAM,CAAC,GAAG,GAAG,EAAC;EACd,IAAM,CAAC,YAAY,GAAG,EAAC;EACvB,IAAM,CAAC,eAAe,GAAG,GAAE;EAC3B,IAAM,CAAC,2BAA2B,GAAG,MAAK;EAC1C,IAAM,CAAC,kBAAkB,GAAG,EAAC;EAC7B,IAAM,CAAC,gBAAgB,GAAG,EAAC;EAC3B,IAAM,CAAC,UAAU,GAAG,GAAE;EACtB,IAAM,CAAC,kBAAkB,GAAG,GAAE;CAC7B,CAAA;;AAEH,gCAAE,KAAK,mBAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;EAC7B,IAAQ,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAC;EAC3C,IAAM,CAAC,KAAK,GAAG,KAAK,GAAG,EAAC;EACxB,IAAM,CAAC,MAAM,GAAG,OAAO,GAAG,GAAE;EAC5B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAChE,IAAM,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;CAC/D,CAAA;;AAEH,gCAAE,KAAK,mBAAC,OAAO,EAAE;EACf,IAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,GAAE,+BAA8B,IAAE,IAAI,CAAC,MAAM,CAAA,QAAI,GAAE,OAAO,GAAG;CACrG,CAAA;;;;AAIH,gCAAE,EAAE,gBAAC,CAAC,EAAE;EACN,IAAQ,CAAC,GAAG,IAAI,CAAC,OAAM;EACvB,IAAQ,CAAC,GAAG,CAAC,CAAC,OAAM;EACpB,IAAM,CAAC,IAAI,CAAC,EAAE;IACZ,OAAS,CAAC,CAAC;GACV;EACH,IAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,EAAC;EAC3B,IAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IAC/D,OAAS,CAAC;GACT;EACH,OAAS,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;CACnD,CAAA;;AAEH,gCAAE,SAAS,uBAAC,CAAC,EAAE;EACb,IAAQ,CAAC,GAAG,IAAI,CAAC,OAAM;EACvB,IAAQ,CAAC,GAAG,CAAC,CAAC,OAAM;EACpB,IAAM,CAAC,IAAI,CAAC,EAAE;IACZ,OAAS,CAAC;GACT;EACH,IAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,EAAC;EAC3B,IAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IAC/D,OAAS,CAAC,GAAG,CAAC;GACb;EACH,OAAS,CAAC,GAAG,CAAC;CACb,CAAA;;AAEH,gCAAE,OAAO,uBAAG;EACV,OAAS,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;CACzB,CAAA;;AAEH,gCAAE,SAAS,yBAAG;EACZ,OAAS,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACzC,CAAA;;AAEH,gCAAE,OAAO,uBAAG;EACV,IAAM,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAC;CACpC,CAAA;;AAEH,gCAAE,GAAG,iBAAC,EAAE,EAAE;EACR,IAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;IAC3B,IAAM,CAAC,OAAO,GAAE;IAChB,OAAS,IAAI;GACZ;EACH,OAAS,KAAK;CACb,CAAA;;AAGH,SAASC,mBAAiB,CAAC,EAAE,EAAE;EAC7B,IAAI,EAAE,IAAI,MAAM,EAAE,EAAA,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,EAAA;EAChD,EAAE,IAAI,QAAO;EACb,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,IAAI,MAAM,CAAC;CACxE;;;;;;;;AAQDR,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;;;EACvCL,IAAM,UAAU,GAAG,KAAK,CAAC,WAAU;EACnCA,IAAM,KAAK,GAAG,KAAK,CAAC,MAAK;;EAEzB,KAAKC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACrCD,IAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAC;IAC5B,IAAI,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;MACnCI,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC;KAC3D;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;MACnCA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,mCAAmC,EAAC;KAC7D;GACF;EACF;;;;;;;;AAQDC,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;;;;;;;EAO1B,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;IAClF,KAAK,CAAC,OAAO,GAAG,KAAI;IACpB,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;GAC3B;EACF;;;AAGDA,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,KAAK,CAAC,GAAG,GAAG,EAAC;EACb,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,KAAK,CAAC,2BAA2B,GAAG,MAAK;EACzC,KAAK,CAAC,kBAAkB,GAAG,EAAC;EAC5B,KAAK,CAAC,gBAAgB,GAAG,EAAC;EAC1B,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,EAAC;EAC3B,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,EAAC;;EAEnC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;;EAE9B,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE;;IAErC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;KAC7B;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,KAAK,CAAC,KAAK,CAAC,0BAA0B,EAAC;KACxC;GACF;EACD,IAAI,KAAK,CAAC,gBAAgB,GAAG,KAAK,CAAC,kBAAkB,EAAE;IACrD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;GAC9B;EACD,KAAe,kBAAI,KAAK,CAAC,kBAAkB,yBAAA,EAAE;IAAxCL,IAAM,IAAI;;IACb,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;MACzC,KAAK,CAAC,KAAK,CAAC,kCAAkC,EAAC;KAChD;GACF;EACF;;;AAGDK,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;;;EACtC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;EAC9B,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC9BD,MAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;GAC/B;;;EAGD,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;IAC1C,KAAK,CAAC,KAAK,CAAC,mBAAmB,EAAC;GACjC;EACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,KAAK,CAAC,0BAA0B,EAAC;GACxC;EACF;;;AAGDC,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;EACtC,OAAO,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;IAClE,EAAA,AAAC,EAAA;EACJ;;;AAGDA,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;;;;IAInC,IAAI,KAAK,CAAC,2BAA2B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;;MAEzE,IAAI,KAAK,CAAC,OAAO,EAAE;QACjB,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;OAClC;KACF;IACD,OAAO,IAAI;GACZ;;EAED,IAAI,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE;IACnF,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAC;IAChC,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,KAAK,CAAC,2BAA2B,GAAG,MAAK;;;EAGzC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACtD,OAAO,IAAI;GACZ;;;EAGD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;;EAGD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACtDC,IAAI,UAAU,GAAG,MAAK;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;KACrC;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;MAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;QAC5B,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;OAClC;MACD,KAAK,CAAC,2BAA2B,GAAG,CAAC,WAAU;MAC/C,OAAO,IAAI;KACZ;GACF;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE,OAAe,EAAE;mCAAV,GAAG,KAAK;;EACvD,IAAI,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE;IACnD,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;IACvB,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE,OAAO,EAAE;EACvD;IACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC;GAChD;EACF;AACDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE,OAAO,EAAE;EACvDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3BC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAC;IACrB,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;MACvC,GAAG,GAAG,KAAK,CAAC,aAAY;MACxB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;QAClE,GAAG,GAAG,KAAK,CAAC,aAAY;OACzB;MACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;;QAE3B,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE;UACvC,KAAK,CAAC,KAAK,CAAC,uCAAuC,EAAC;SACrD;QACD,OAAO,IAAI;OACZ;KACF;IACD,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE;MAC7B,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC;KACrC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC;IACE,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC;IACvC,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;IAC9C,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC;IACtC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;GACrC;EACF;AACDA,IAAE,CAAC,kCAAkC,GAAG,SAAS,KAAK,EAAE;EACtDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;MACpC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE;EAC9CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;MAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;QAC3B,OAAO,IAAI;OACZ;MACD,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;KAClC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAC;KAClC,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,UAAU;MAC3C,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;KAC7B;IACD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;IAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,kBAAkB,IAAI,EAAC;MAC7B,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;GAClC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,sBAAsB,GAAG,SAAS,KAAK,EAAE;EAC1C;IACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;IAC9C,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC;IACtC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,iCAAiC,CAAC,KAAK,CAAC;IAC7C,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;GAC/C;EACF;;;AAGDA,IAAE,CAAC,iCAAiC,GAAG,SAAS,KAAK,EAAE;EACrD,IAAI,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;IAChD,KAAK,CAAC,KAAK,CAAC,mBAAmB,EAAC;GACjC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,yBAAyB,GAAG,SAAS,KAAK,EAAE;EAC7CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,iBAAiB,CAAC,EAAE,CAAC,EAAE;IACzB,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACD,SAAS,iBAAiB,CAAC,EAAE,EAAE;EAC7B;IACE,EAAE,KAAK,IAAI;IACX,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;IAChC,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;IAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;GACjC;CACF;;;;AAIDK,IAAE,CAAC,2BAA2B,GAAG,SAAS,KAAK,EAAE;EAC/CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,EAAE;IAC9D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;;;AAGDI,IAAE,CAAC,kCAAkC,GAAG,SAAS,KAAK,EAAE;EACtDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B;IACE,EAAE,KAAK,CAAC,CAAC;IACT,EAAE,KAAK,IAAI;IACX,EAAE,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;IAC3C,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX;IACA,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;;;AAKDK,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MACnC,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE;QAC1D,KAAK,CAAC,KAAK,CAAC,8BAA8B,EAAC;OAC5C;MACD,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAC;MAC5C,MAAM;KACP;IACD,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;GAC7B;EACF;;;;;AAKDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvC,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACzE,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,4BAA4B,EAAC;GAC1C;EACD,OAAO,KAAK;EACb;;;;;;AAMDA,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClD,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,IAAI,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,EAAE;IAC/C,KAAK,CAAC,eAAe,IAAIQ,mBAAiB,CAAC,KAAK,CAAC,YAAY,EAAC;IAC9D,OAAO,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,EAAE;MACjD,KAAK,CAAC,eAAe,IAAIA,mBAAiB,CAAC,KAAK,CAAC,YAAY,EAAC;KAC/D;IACD,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;;;;;AAODR,IAAE,CAAC,+BAA+B,GAAG,SAAS,KAAK,EAAE;EACnDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,KAAK,CAAC,OAAO,GAAE;;EAEf,IAAI,EAAE,KAAK,IAAI,YAAY,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC,EAAE;IAC5E,EAAE,GAAG,KAAK,CAAC,aAAY;GACxB;EACD,IAAI,uBAAuB,CAAC,EAAE,CAAC,EAAE;IAC/B,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,OAAO,IAAI;GACZ;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;AACD,SAAS,uBAAuB,CAAC,EAAE,EAAE;EACnC,OAAO,iBAAiB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI;CACzE;;;;;;;;;AASDI,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,KAAK,CAAC,OAAO,GAAE;;EAEf,IAAI,EAAE,KAAK,IAAI,YAAY,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC,EAAE;IAC5E,EAAE,GAAG,KAAK,CAAC,aAAY;GACxB;EACD,IAAI,sBAAsB,CAAC,EAAE,CAAC,EAAE;IAC9B,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,OAAO,IAAI;GACZ;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;AACD,SAAS,sBAAsB,CAAC,EAAE,EAAE;EAClC,OAAO,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,MAAM,iBAAiB,EAAE,KAAK,MAAM;CAC/H;;;AAGDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC;IACE,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC;IACnC,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;IAC1C,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;KACpC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;IACnD;IACA,OAAO,IAAI;GACZ;EACD,IAAI,KAAK,CAAC,OAAO,EAAE;;IAEjB,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,UAAU;MACpC,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC;KACtC;IACD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;GAC9B;EACD,OAAO,KAAK;EACb;AACDA,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;IACvCA,IAAM,CAAC,GAAG,KAAK,CAAC,aAAY;IAC5B,IAAI,KAAK,CAAC,OAAO,EAAE;;MAEjB,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,EAAE;QAC9B,KAAK,CAAC,gBAAgB,GAAG,EAAC;OAC3B;MACD,OAAO,IAAI;KACZ;IACD,IAAI,CAAC,IAAI,KAAK,CAAC,kBAAkB,EAAE;MACjC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MACnC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAC;MACpD,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,yBAAyB,EAAC;GACvC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,yBAAyB,GAAG,SAAS,KAAK,EAAE;EAC7C;IACE,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC;IACnC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;IAC1B,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC;IACvC,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC;KAChD,CAAC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,mCAAmC,CAAC,KAAK,CAAC,CAAC;IACnE,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;GACrC;EACF;AACDA,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;MACvC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE;IAC1E,KAAK,CAAC,YAAY,GAAG,EAAC;IACtB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE;IACvB,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACD,SAAS,eAAe,CAAC,EAAE,EAAE;EAC3B;IACE,CAAC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;KAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;GAC3C;CACF;;;AAGDK,IAAE,CAAC,qCAAqC,GAAG,SAAS,KAAK,EAAE;EACzDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;MAC3CA,IAAM,IAAI,GAAG,KAAK,CAAC,aAAY;MAC/B,IAAI,KAAK,CAAC,OAAO,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE;QACrDA,IAAM,gBAAgB,GAAG,KAAK,CAAC,IAAG;QAClC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;UACjGA,IAAM,KAAK,GAAG,KAAK,CAAC,aAAY;UAChC,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,EAAE;YACtC,KAAK,CAAC,YAAY,GAAG,CAAC,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,QAAO;YACzE,OAAO,IAAI;WACZ;SACF;QACD,KAAK,CAAC,GAAG,GAAG,iBAAgB;QAC5B,KAAK,CAAC,YAAY,GAAG,KAAI;OAC1B;MACD,OAAO,IAAI;KACZ;IACD;MACE,KAAK,CAAC,OAAO;MACb,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC;MAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,cAAc,CAAC,KAAK,CAAC,YAAY,CAAC;MAClC;MACA,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;MACjB,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC;KACtC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAED,OAAO,KAAK;EACb;AACD,SAAS,cAAc,CAAC,EAAE,EAAE;EAC1B,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ;CACjC;;;AAGDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,OAAO,EAAE;IACjB,IAAI,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE;MACzC,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,YAAY,GAAG,KAAI;MACzB,OAAO,IAAI;KACZ;IACD,OAAO,KAAK;GACb;;EAEDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,aAAa,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE;IAClE,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3C,KAAK,CAAC,YAAY,GAAG,EAAC;EACtBJ,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,GAAG;MACD,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,GAAG,IAAI,UAAS;MAClE,KAAK,CAAC,OAAO,GAAE;KAChB,QAAQ,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;IACtE,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;;EAE1B,IAAI,sBAAsB,CAAC,EAAE,CAAC,EAAE;IAC9B,KAAK,CAAC,YAAY,GAAG,CAAC,EAAC;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED;IACE,KAAK,CAAC,OAAO;IACb,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;KAC5B,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI,SAAS;IAC5C;IACA,KAAK,CAAC,YAAY,GAAG,CAAC,EAAC;IACvB,KAAK,CAAC,OAAO,GAAE;IACf;MACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,IAAI,CAAC,wCAAwC,CAAC,KAAK,CAAC;MACpD,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB;MACA,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC;GACrC;;EAED,OAAO,KAAK;EACb;AACD,SAAS,sBAAsB,CAAC,EAAE,EAAE;EAClC;IACE,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;GACZ;CACF;;;;;AAKDK,IAAE,CAAC,wCAAwC,GAAG,SAAS,KAAK,EAAE;EAC5DL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;;EAGvB,IAAI,IAAI,CAAC,6BAA6B,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACxEA,IAAM,IAAI,GAAG,KAAK,CAAC,gBAAe;IAClC,IAAI,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,EAAE;MAC9CA,IAAM,KAAK,GAAG,KAAK,CAAC,gBAAe;MACnC,IAAI,CAAC,0CAA0C,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAC;MACnE,OAAO,IAAI;KACZ;GACF;EACD,KAAK,CAAC,GAAG,GAAG,MAAK;;;EAGjB,IAAI,IAAI,CAAC,wCAAwC,CAAC,KAAK,CAAC,EAAE;IACxDA,IAAM,WAAW,GAAG,KAAK,CAAC,gBAAe;IACzC,IAAI,CAAC,yCAAyC,CAAC,KAAK,EAAE,WAAW,EAAC;IAClE,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,0CAA0C,GAAG,SAAS,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;EAC3E,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;IAC/C,EAAA,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC,EAAA;EACtC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACtD,EAAA,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC,EAAA;EACxC;AACDA,IAAE,CAAC,yCAAyC,GAAG,SAAS,KAAK,EAAE,WAAW,EAAE;EAC1E,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACnD,EAAA,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC,EAAA;EACvC;;;;AAIDA,IAAE,CAAC,6BAA6B,GAAG,SAAS,KAAK,EAAE;EACjDJ,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,OAAO,8BAA8B,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC3D,KAAK,CAAC,eAAe,IAAIY,mBAAiB,CAAC,EAAE,EAAC;IAC9C,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,eAAe,KAAK,EAAE;EACpC;AACD,SAAS,8BAA8B,CAAC,EAAE,EAAE;EAC1C,OAAO,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI;CAC1C;;;;AAIDR,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDJ,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,OAAO,+BAA+B,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC5D,KAAK,CAAC,eAAe,IAAIY,mBAAiB,CAAC,EAAE,EAAC;IAC9C,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,eAAe,KAAK,EAAE;EACpC;AACD,SAAS,+BAA+B,CAAC,EAAE,EAAE;EAC3C,OAAO,8BAA8B,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC;CAChE;;;;AAIDR,IAAE,CAAC,wCAAwC,GAAG,SAAS,KAAK,EAAE;EAC5D,OAAO,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;EAClD;;;AAGDA,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;IACvB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;IAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,OAAO,IAAI;KACZ;;IAED,KAAK,CAAC,KAAK,CAAC,8BAA8B,EAAC;GAC5C;EACD,OAAO,KAAK;EACb;;;;;AAKDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;;;EACtC,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;IACtCL,IAAM,IAAI,GAAG,KAAK,CAAC,aAAY;IAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAII,MAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MAC9DJ,IAAM,KAAK,GAAG,KAAK,CAAC,aAAY;MAChC,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE;QAClD,KAAK,CAAC,KAAK,CAAC,yBAAyB,EAAC;OACvC;MACD,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,KAAK,EAAE;QAC/C,KAAK,CAAC,KAAK,CAAC,uCAAuC,EAAC;OACrD;KACF;GACF;EACF;;;;AAIDK,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE;MACrC,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;;MAEjBA,IAAMc,IAAE,GAAG,KAAK,CAAC,OAAO,GAAE;MAC1B,IAAIA,IAAE,KAAK,IAAI,YAAY,YAAY,CAACA,IAAE,CAAC,EAAE;QAC3C,KAAK,CAAC,KAAK,CAAC,sBAAsB,EAAC;OACpC;MACD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;KAC9B;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAEDd,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,OAAO,IAAI;GACZ;;EAED,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC5C,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,OAAO,IAAI;GACZ;;EAED,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC7C,IAAI,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE;MAC5C,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAED;IACE,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;IAC1C,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;GACtC;EACF;;;AAGDK,IAAE,CAAC,4BAA4B,GAAG,SAAS,KAAK,EAAE;EAChDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU;IAC7C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,2BAA2B,GAAG,SAAS,KAAK,EAAE;EAC/CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;MAC3C,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;MACjB,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;KAC9B;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,cAAc,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC3C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,GAAG,IAAI,UAAS;IAClE,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;AACD,SAAS,cAAc,CAAC,EAAE,EAAE;EAC1B,OAAO,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;CACxC;;;AAGDI,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,UAAU,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IACvC,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,EAAE,EAAC;IAC3D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;AACD,SAAS,UAAU,CAAC,EAAE,EAAE;EACtB;IACE,CAAC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;KAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;KACzC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;GAC3C;CACF;AACD,SAAS,QAAQ,CAAC,EAAE,EAAE;EACpB,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS;GAChC;EACD,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS;GAChC;EACD,OAAO,EAAE,GAAG,IAAI;CACjB;;;;AAIDI,IAAE,CAAC,mCAAmC,GAAG,SAAS,KAAK,EAAE;EACvD,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;IACpCL,IAAM,EAAE,GAAG,KAAK,CAAC,aAAY;IAC7B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;MACpCA,IAAM,EAAE,GAAG,KAAK,CAAC,aAAY;MAC7B,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;QAC/C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,aAAY;OAC3D,MAAM;QACL,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,CAAC,GAAG,GAAE;OACjC;KACF,MAAM;MACL,KAAK,CAAC,YAAY,GAAG,GAAE;KACxB;IACD,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxCL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE;IACpB,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,KAAK;EACb;AACD,SAAS,YAAY,CAAC,EAAE,EAAE;EACxB,OAAO,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;CACxC;;;;;AAKDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE,MAAM,EAAE;EACpDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,KAAKC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;IAC/BD,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;IAC1B,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE;MACnB,KAAK,CAAC,GAAG,GAAG,MAAK;MACjB,OAAO,KAAK;KACb;IACD,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,EAAE,EAAC;IAC3D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,IAAI;CACZ;;;;;;ACxgCD,AAAO,IAAM,KAAK,GAAC,cACN,CAAC,CAAC,EAAE;EACf,IAAM,CAAC,IAAI,GAAG,CAAC,CAAC,KAAI;EACpB,IAAM,CAAC,KAAK,GAAG,CAAC,CAAC,MAAK;EACtB,IAAM,CAAC,KAAK,GAAG,CAAC,CAAC,MAAK;EACtB,IAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAG;EAClB,IAAM,CAAC,CAAC,OAAO,CAAC,SAAS;IACvB,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAC,EAAA;EAC1D,IAAM,CAAC,CAAC,OAAO,CAAC,MAAM;IACpB,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAC,EAAA;CAChC,CAAA;;;;AAKHA,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;AAI3BA,IAAE,CAAC,IAAI,GAAG,WAAW;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO;IACtB,EAAA,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAC,EAAA;;EAEvC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,IAAG;EAC1B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAK;EAC9B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,OAAM;EAChC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,SAAQ;EACpC,IAAI,CAAC,SAAS,GAAE;EACjB;;AAEDA,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvB,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC;EACvB;;;AAGD,IAAI,OAAO,MAAM,KAAK,WAAW;EAC/B,EAAAA,IAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,WAAW;;;IAC/B,OAAO;MACL,IAAI,EAAE,YAAG;QACPJ,IAAI,KAAK,GAAGG,MAAI,CAAC,QAAQ,GAAE;QAC3B,OAAO;UACL,IAAI,EAAE,KAAK,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG;UAC3B,KAAK,EAAE,KAAK;SACb;OACF;KACF;IACF,EAAA;;;;;AAKHE,IAAE,CAAC,UAAU,GAAG,WAAW;EACzB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;EAC7C;;;;;AAKDA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxBJ,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,GAAE;EAClC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;;EAE9D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAG;EACrB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,GAAE,EAAA;EAC9D,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAA,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,CAAC,EAAA;;EAElE,IAAI,UAAU,CAAC,QAAQ,EAAE,EAAA,OAAO,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAA;OACpD,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAC,EAAA;EAC9C;;AAEDE,IAAE,CAAC,SAAS,GAAG,SAAS,IAAI,EAAE;;;EAG5B,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,EAAE;IACvE,EAAA,OAAO,IAAI,CAAC,QAAQ,EAAE,EAAA;;EAExB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EACnC;;AAEDA,IAAE,CAAC,iBAAiB,GAAG,WAAW;EAChCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;EAC1C,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,EAAA;EACjDA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,OAAO,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,GAAG,SAAS;EACvC;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,WAAW;;;EAC/BJ,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,GAAE;EAC3DA,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAC;EACnE,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,sBAAsB,EAAC,EAAA;EAChE,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,EAAC;EAClB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;IAC1B,UAAU,CAAC,SAAS,GAAG,MAAK;IAC5BA,IAAI,MAAK;IACT,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE;MACtE,EAAEG,MAAI,CAAC,QAAO;MACdA,MAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;KAC/C;GACF;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG;2BACvD,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,EAAC,EAAA;EACvD;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,SAAS,EAAE;;;EACvCJ,IAAI,KAAK,GAAG,IAAI,CAAC,IAAG;EACpBA,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,GAAE;EAC3DA,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,EAAC;EACrD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE;IACrD,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAEA,MAAI,CAAC,GAAG,EAAC;GACvC;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG;2BACrE,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,EAAC,EAAA;EACvD;;;;;AAKDC,IAAE,CAAC,SAAS,GAAG,WAAW;;;EACxB,IAAI,EAAE,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;IACzCJ,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,QAAQ,EAAE;IACV,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG;MACf,EAAEA,MAAI,CAAC,IAAG;MACV,KAAK;IACP,KAAK,EAAE;MACL,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9C,EAAEA,MAAI,CAAC,IAAG;OACX;IACH,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI;MAC3B,EAAEA,MAAI,CAAC,IAAG;MACV,IAAIA,MAAI,CAAC,OAAO,CAAC,SAAS,EAAE;QAC1B,EAAEA,MAAI,CAAC,QAAO;QACdA,MAAI,CAAC,SAAS,GAAGA,MAAI,CAAC,IAAG;OAC1B;MACD,KAAK;IACP,KAAK,EAAE;MACL,QAAQA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC;MAC3C,KAAK,EAAE;QACLA,MAAI,CAAC,gBAAgB,GAAE;QACvB,KAAK;MACP,KAAK,EAAE;QACLA,MAAI,CAAC,eAAe,CAAC,CAAC,EAAC;QACvB,KAAK;MACP;QACE,MAAM,IAAI;OACX;MACD,KAAK;IACP;MACE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,EAAE;QACvF,EAAEA,MAAI,CAAC,IAAG;OACX,MAAM;QACL,MAAM,IAAI;OACX;KACF;GACF;EACF;;;;;;;AAODC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,GAAG,EAAE;EACnC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAG;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,GAAE,EAAA;EAC5DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAI;EACxB,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAG;;EAEhB,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAC;EAC7B;;;;;;;;;;;AAWDI,IAAE,CAAC,aAAa,GAAG,WAAW;EAC5BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAA;EAC1DA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC/C,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE,EAAE;IAChE,IAAI,CAAC,GAAG,IAAI,EAAC;IACb,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,QAAQ,CAAC;GACrC,MAAM;IACL,EAAE,IAAI,CAAC,IAAG;IACV,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,GAAG,CAAC;GAChC;EACF;;AAEDE,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,UAAU,EAAE,EAAE;EAC9D,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,KAAK,EAAE,CAAC,CAAC;EAClC;;AAEDE,IAAE,CAAC,yBAAyB,GAAG,SAAS,IAAI,EAAE;EAC5CJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9CA,IAAI,IAAI,GAAG,EAAC;EACZA,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,GAAGE,KAAE,CAAC,IAAI,GAAGA,KAAE,CAAC,OAAM;;;EAGjD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE;IAC/D,EAAE,KAAI;IACN,SAAS,GAAGA,KAAE,CAAC,SAAQ;IACvB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;GAC3C;;EAED,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,EAAA;EAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;EACtC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,IAAI,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,GAAG,GAAGE,KAAE,CAAC,SAAS,GAAGA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC,EAAA;EACvF,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,GAAG,GAAGA,KAAE,CAAC,SAAS,GAAGA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC;EACrE;;AAEDE,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC;EACvC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,IAAI,EAAE;IACjB,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;SAC1E,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;;MAE1F,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC;MACvB,IAAI,CAAC,SAAS,GAAE;MAChB,OAAO,IAAI,CAAC,SAAS,EAAE;KACxB;IACD,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;GACnC;EACD,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,OAAO,EAAE,CAAC,CAAC;EACpC;;AAEDE,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE;EAClCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9CA,IAAI,IAAI,GAAG,EAAC;EACZ,IAAI,IAAI,KAAK,IAAI,EAAE;IACjB,IAAI,GAAG,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAC;IACxE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,EAAA;IAC5F,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,QAAQ,EAAE,IAAI,CAAC;GACxC;EACD,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;MAC1F,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;;IAE9C,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC;IACvB,IAAI,CAAC,SAAS,GAAE;IAChB,OAAO,IAAI,CAAC,SAAS,EAAE;GACxB;EACD,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,IAAI,GAAG,EAAC,EAAA;EACzB,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,UAAU,EAAE,IAAI,CAAC;EAC1C;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAA;EACtG,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IAC/D,IAAI,CAAC,GAAG,IAAI,EAAC;IACb,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;GAClC;EACD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,EAAE,GAAGA,KAAE,CAAC,EAAE,GAAGA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;EACzD;;AAEDE,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,QAAQ,IAAI;;;EAGZ,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,aAAa,EAAE;;;EAG7B,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACF,KAAE,CAAC,MAAM,CAAC;EACvD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACvD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,IAAI,CAAC;EACrD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;EACtD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;EACzD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;EACzD,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACxD,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACxD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;EACtD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;;EAEzD,KAAK,EAAE;IACL,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,KAAK,EAAA;IACvC,EAAE,IAAI,CAAC,IAAG;IACV,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,SAAS,CAAC;;EAEvC,KAAK,EAAE;IACLF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;IAC9C,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAA;IAChE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAA;MAC/D,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAA;KAC/D;;;;EAIH,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IAC7E,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;;;EAG/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;;;;;;;EAO9B,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,eAAe,EAAE;;EAE/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC;;EAE7C,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;IACf,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;;EAEtC,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,eAAe,EAAE;;EAE/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;;EAEtC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;;EAEnC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;;EAErC,KAAK,GAAG;IACN,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;GACnC;;EAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,wBAAwB,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,GAAG,EAAC;EAC/E;;AAEDE,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjCJ,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,EAAC;EACrD,IAAI,CAAC,GAAG,IAAI,KAAI;EAChB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC;EACnC;;AAEDI,IAAE,CAAC,UAAU,GAAG,WAAW;;;EACzBJ,IAAI,OAAO,EAAE,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,IAAG;EACtC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;IACvFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,MAAM,CAACA,MAAI,CAAC,GAAG,EAAC;IACpC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;IAC5E,IAAI,CAAC,OAAO,EAAE;MACZ,IAAI,EAAE,KAAK,GAAG,EAAE,EAAA,OAAO,GAAG,KAAI,EAAA;WACzB,IAAI,EAAE,KAAK,GAAG,IAAI,OAAO,EAAE,EAAA,OAAO,GAAG,MAAK,EAAA;WAC1C,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,EAAA,KAAK,EAAA;MACtC,OAAO,GAAG,EAAE,KAAK,KAAI;KACtB,MAAM,EAAA,OAAO,GAAG,MAAK,EAAA;IACtB,EAAEA,MAAI,CAAC,IAAG;GACX;EACDH,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EAC/C,EAAE,IAAI,CAAC,IAAG;EACVA,IAAI,UAAU,GAAG,IAAI,CAAC,IAAG;EACzBA,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;EAC5B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,UAAU,EAAC,EAAA;;;EAGjDD,IAAM,KAAK,GAAG,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,EAAC;EACtF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAC;EAClC,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAC;EAC/B,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAC;;;EAGjCC,IAAI,KAAK,GAAG,KAAI;EAChB,IAAI;IACF,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,KAAK,EAAC;GACnC,CAAC,OAAO,CAAC,EAAE;;;GAGX;;EAED,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,SAAA,OAAO,EAAE,OAAA,KAAK,EAAE,OAAA,KAAK,CAAC,CAAC;EAC5D;;;;;;AAMDE,IAAE,CAAC,OAAO,GAAG,SAAS,KAAK,EAAE,GAAG,EAAE;;;EAChCJ,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG,EAAC;EAC/B,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,QAAQ,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;IAC5DA,IAAI,IAAI,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,CAAC,EAAE,GAAG,YAAA;IAC/C,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAE,EAAA;SAC/B,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAE,EAAA;SACpC,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,GAAE,EAAA;SAC7C,EAAA,GAAG,GAAG,SAAQ,EAAA;IACnB,IAAI,GAAG,IAAI,KAAK,EAAE,EAAA,KAAK,EAAA;IACvB,EAAEA,MAAI,CAAC,IAAG;IACV,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,IAAG;GAC5B;EACD,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;;EAE9E,OAAO,KAAK;EACb;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,KAAK,EAAE;EACnC,IAAI,CAAC,GAAG,IAAI,EAAC;EACbJ,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAC;EAC7B,IAAI,GAAG,IAAI,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,2BAA2B,GAAG,KAAK,EAAC,EAAA;EAChF,IAAI,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,kCAAkC,EAAC,EAAA;EACzG,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,EAAE,GAAG,CAAC;EACrC;;;;AAIDE,IAAE,CAAC,UAAU,GAAG,SAAS,aAAa,EAAE;EACtCJ,IAAI,KAAK,GAAG,IAAI,CAAC,IAAG;EACpB,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;EACpFA,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,GAAE;EACxE,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;EAC7D,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAA,KAAK,GAAG,MAAK,EAAA;EAC1EA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;EAC1C,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;IACzB,EAAE,IAAI,CAAC,IAAG;IACV,IAAI,CAAC,OAAO,CAAC,EAAE,EAAC;IAChB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;GACvC;EACD,IAAI,CAAC,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;IAC3C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,EAAC;IACxC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,EAAE,IAAI,CAAC,IAAG,EAAA;IAC1C,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;GACnE;EACD,IAAI,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,kCAAkC,EAAC,EAAA;;EAEzGA,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EAC3CA,IAAI,GAAG,GAAG,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,EAAC;EACpD,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,EAAE,GAAG,CAAC;EACrC;;;;AAIDE,IAAE,CAAC,aAAa,GAAG,WAAW;EAC5BJ,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAI;;EAE9C,IAAI,EAAE,KAAK,GAAG,EAAE;IACd,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnDA,IAAI,OAAO,GAAG,EAAE,IAAI,CAAC,IAAG;IACxB,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,EAAC;IACrE,EAAE,IAAI,CAAC,IAAG;IACV,IAAI,IAAI,GAAG,QAAQ,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,0BAA0B,EAAC,EAAA;GAClF,MAAM;IACL,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAC;GAC3B;EACD,OAAO,IAAI;EACZ;;AAED,SAAS,iBAAiB,CAAC,IAAI,EAAE;;EAE/B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAA;EACpD,IAAI,IAAI,QAAO;EACf,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC,IAAI,GAAG,IAAI,IAAI,MAAM,CAAC;CAC1E;;AAEDI,IAAE,CAAC,UAAU,GAAG,SAAS,KAAK,EAAE;;;EAC9BJ,IAAI,GAAG,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,IAAI,CAAC,IAAG;EACrC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;IACzFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,IAAI,EAAE,KAAK,KAAK,EAAE,EAAA,KAAK,EAAA;IACvB,IAAI,EAAE,KAAK,EAAE,EAAE;MACb,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,GAAG,IAAIA,MAAI,CAAC,eAAe,CAAC,KAAK,EAAC;MAClC,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,IAAI,SAAS,CAAC,EAAE,EAAEA,MAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;MACzG,EAAEA,MAAI,CAAC,IAAG;KACX;GACF;EACD,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAC;EAC/C,OAAO,IAAI,CAAC,WAAW,CAACD,KAAE,CAAC,MAAM,EAAE,GAAG,CAAC;EACxC;;;;AAIDH,IAAM,6BAA6B,GAAG,GAAE;;AAExCK,IAAE,CAAC,oBAAoB,GAAG,WAAW;EACnC,IAAI,CAAC,iBAAiB,GAAG,KAAI;EAC7B,IAAI;IACF,IAAI,CAAC,aAAa,GAAE;GACrB,CAAC,OAAO,GAAG,EAAE;IACZ,IAAI,GAAG,KAAK,6BAA6B,EAAE;MACzC,IAAI,CAAC,wBAAwB,GAAE;KAChC,MAAM;MACL,MAAM,GAAG;KACV;GACF;;EAED,IAAI,CAAC,iBAAiB,GAAG,MAAK;EAC/B;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,QAAQ,EAAE,OAAO,EAAE;EAClD,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IAC3D,MAAM,6BAA6B;GACpC,MAAM;IACL,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,EAAC;GAC9B;EACF;;AAEDA,IAAE,CAAC,aAAa,GAAG,WAAW;;;EAC5BJ,IAAI,GAAG,GAAG,EAAE,EAAE,UAAU,GAAG,IAAI,CAAC,IAAG;EACnC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC,EAAA;IAClFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;MACzE,IAAIA,MAAI,CAAC,GAAG,KAAKA,MAAI,CAAC,KAAK,KAAKA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,eAAe,CAAC,EAAE;QAC9F,IAAI,EAAE,KAAK,EAAE,EAAE;UACbC,MAAI,CAAC,GAAG,IAAI,EAAC;UACb,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,YAAY,CAAC;SACzC,MAAM;UACL,EAAEC,MAAI,CAAC,IAAG;UACV,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,SAAS,CAAC;SACtC;OACF;MACD,GAAG,IAAIC,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,QAAQ,EAAE,GAAG,CAAC;KAC1C;IACD,IAAI,EAAE,KAAK,EAAE,EAAE;MACb,GAAG,IAAIC,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,GAAG,IAAIA,MAAI,CAAC,eAAe,CAAC,IAAI,EAAC;MACjC,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;MACxB,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,EAAEA,MAAI,CAAC,IAAG;MACV,QAAQ,EAAE;MACV,KAAK,EAAE;QACL,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAA,EAAEA,MAAI,CAAC,IAAG,EAAA;MACxD,KAAK,EAAE;QACL,GAAG,IAAI,KAAI;QACX,KAAK;MACP;QACE,GAAG,IAAI,MAAM,CAAC,YAAY,CAAC,EAAE,EAAC;QAC9B,KAAK;OACN;MACD,IAAIA,MAAI,CAAC,OAAO,CAAC,SAAS,EAAE;QAC1B,EAAEA,MAAI,CAAC,QAAO;QACdA,MAAI,CAAC,SAAS,GAAGA,MAAI,CAAC,IAAG;OAC1B;MACD,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,EAAEA,MAAI,CAAC,IAAG;KACX;GACF;EACF;;;AAGDC,IAAE,CAAC,wBAAwB,GAAG,WAAW;;;EACvC,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;IAC/C,QAAQD,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,CAAC;IAC5B,KAAK,IAAI;MACP,EAAEA,MAAI,CAAC,IAAG;MACV,KAAK;;IAEP,KAAK,GAAG;MACN,IAAIA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;QACpC,KAAK;OACN;;;IAGH,KAAK,GAAG;MACN,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,eAAe,EAAEC,MAAI,CAAC,KAAK,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAEA,MAAI,CAAC,GAAG,CAAC,CAAC;;;KAGpF;GACF;EACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC;EAChD;;;;AAIDC,IAAE,CAAC,eAAe,GAAG,SAAS,UAAU,EAAE;EACxCJ,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,EAAC;EAC1C,EAAE,IAAI,CAAC,IAAG;EACV,QAAQ,EAAE;EACV,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,GAAG,EAAE,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;EACzD,KAAK,GAAG,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;EACxD,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,EAAE,EAAE,OAAO,IAAI;EACpB,KAAK,GAAG,EAAE,OAAO,QAAQ;EACzB,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,EAAE,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAA,EAAE,IAAI,CAAC,IAAG,EAAA;EAC/D,KAAK,EAAE;IACL,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAO,EAAE;IACzE,OAAO,EAAE;EACX;IACE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;MACxBA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC;MACrEA,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAC;MACjC,IAAI,KAAK,GAAG,GAAG,EAAE;QACf,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;QAChC,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAC;OAC9B;MACD,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,GAAG,EAAC;MAC/B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;MACpC,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,EAAE;QAC/E,IAAI,CAAC,kBAAkB;UACrB,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM;UAC9B,UAAU;cACN,kCAAkC;cAClC,8BAA8B;UACnC;OACF;MACD,OAAO,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC;KAClC;IACD,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;;;MAGjB,OAAO,EAAE;KACV;IACD,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;GAC/B;EACF;;;;AAIDI,IAAE,CAAC,WAAW,GAAG,SAAS,GAAG,EAAE;EAC7BJ,IAAI,OAAO,GAAG,IAAI,CAAC,IAAG;EACtBA,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAC;EAC7B,IAAI,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,+BAA+B,EAAC,EAAA;EACjF,OAAO,CAAC;EACT;;;;;;;;AAQDI,IAAE,CAAC,SAAS,GAAG,WAAW;;;EACxB,IAAI,CAAC,WAAW,GAAG,MAAK;EACxBJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC,IAAG;EAClDA,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAC1C,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;IACnCA,IAAI,EAAE,GAAGG,MAAI,CAAC,iBAAiB,GAAE;IACjC,IAAI,gBAAgB,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;MAChCA,MAAI,CAAC,GAAG,IAAI,EAAE,IAAI,MAAM,GAAG,CAAC,GAAG,EAAC;KACjC,MAAM,IAAI,EAAE,KAAK,EAAE,EAAE;MACpBA,MAAI,CAAC,WAAW,GAAG,KAAI;MACvB,IAAI,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC9CH,IAAI,QAAQ,GAAGG,MAAI,CAAC,IAAG;MACvB,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAEA,MAAI,CAAC,GAAG,CAAC,KAAK,GAAG;QAC3C,EAAAA,MAAI,CAAC,kBAAkB,CAACA,MAAI,CAAC,GAAG,EAAE,2CAA2C,EAAC,EAAA;MAChF,EAAEA,MAAI,CAAC,IAAG;MACVH,IAAI,GAAG,GAAGG,MAAI,CAAC,aAAa,GAAE;MAC9B,IAAI,CAAC,CAAC,KAAK,GAAG,iBAAiB,GAAG,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC;QAC9D,EAAAA,MAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,wBAAwB,EAAC,EAAA;MAC7D,IAAI,IAAI,iBAAiB,CAAC,GAAG,EAAC;MAC9B,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,KAAK;KACN;IACD,KAAK,GAAG,MAAK;GACd;EACD,OAAO,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC;EACrD;;;;;AAKDC,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvBJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3BA,IAAI,IAAI,GAAGE,KAAE,CAAC,KAAI;EAClB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IAC5B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,6BAA6B,GAAG,IAAI,EAAC,EAAA;IAC7F,IAAI,GAAGY,UAAY,CAAC,IAAI,EAAC;GAC1B;EACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC;CACpC;;AC9rBD;;;;;;;;;;;;;;;;AAgBA,AAkBOf,IAAM,OAAO,GAAG,QAAO;;;;;;;;;AAS9B,AAAO,SAAS,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE;EACpC,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC;CACpC;;;;;;AAMD,AAAO,SAAS,iBAAiB,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE;EACrD,OAAO,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC;CACrD;;;;;AAKD,AAAO,SAAS,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE;EACxC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC;CACxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/acorn/dist/acorn.mjs b/node_modules/acorn/dist/acorn.mjs
new file mode 100644
index 0000000..3e8e6f1
--- /dev/null
+++ b/node_modules/acorn/dist/acorn.mjs
@@ -0,0 +1,4948 @@
+// Reserved word lists for various dialects of the language
+
+var reservedWords = {
+  3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",
+  5: "class enum extends super const export import",
+  6: "enum",
+  strict: "implements interface let package private protected public static yield",
+  strictBind: "eval arguments"
+};
+
+// And the keywords
+
+var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";
+
+var keywords = {
+  5: ecma5AndLessKeywords,
+  "5module": ecma5AndLessKeywords + " export import",
+  6: ecma5AndLessKeywords + " const class extends export import super"
+};
+
+var keywordRelationalOperator = /^in(stanceof)?$/;
+
+// ## Character categories
+
+// Big ugly regular expressions that match characters in the
+// whitespace, identifier, and identifier-start categories. These
+// are only applied when a character is found to actually have a
+// code point above 128.
+// Generated by `bin/generate-identifier-regex.js`.
+var nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u08a0-\u08b4\u08b6-\u08bd\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\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\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fef\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7bf\ua7c2-\ua7c6\ua7f7-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab67\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
+var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08d3-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1df9\u1dfb-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+
+var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
+var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
+
+nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
+
+// These are a run-length and offset encoded representation of the
+// >0xffff code points that are a valid part of identifiers. The
+// offset starts at 0x10000, and each pair of numbers represents an
+// offset to the next range, and then a size of the range. They were
+// generated by bin/generate-identifier-regex.js
+
+// eslint-disable-next-line comma-spacing
+var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,155,22,13,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,0,33,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,0,161,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,754,9486,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541];
+
+// eslint-disable-next-line comma-spacing
+var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,232,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,792487,239];
+
+// This has a complexity linear to the value of the code. The
+// assumption is that looking up astral identifier characters is
+// rare.
+function isInAstralSet(code, set) {
+  var pos = 0x10000;
+  for (var i = 0; i < set.length; i += 2) {
+    pos += set[i];
+    if (pos > code) { return false }
+    pos += set[i + 1];
+    if (pos >= code) { return true }
+  }
+}
+
+// Test whether a given character code starts an identifier.
+
+function isIdentifierStart(code, astral) {
+  if (code < 65) { return code === 36 }
+  if (code < 91) { return true }
+  if (code < 97) { return code === 95 }
+  if (code < 123) { return true }
+  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) }
+  if (astral === false) { return false }
+  return isInAstralSet(code, astralIdentifierStartCodes)
+}
+
+// Test whether a given character is part of an identifier.
+
+function isIdentifierChar(code, astral) {
+  if (code < 48) { return code === 36 }
+  if (code < 58) { return true }
+  if (code < 65) { return false }
+  if (code < 91) { return true }
+  if (code < 97) { return code === 95 }
+  if (code < 123) { return true }
+  if (code <= 0xffff) { return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) }
+  if (astral === false) { return false }
+  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)
+}
+
+// ## Token types
+
+// The assignment of fine-grained, information-carrying type objects
+// allows the tokenizer to store the information it has about a
+// token in a way that is very cheap for the parser to look up.
+
+// All token type variables start with an underscore, to make them
+// easy to recognize.
+
+// The `beforeExpr` property is used to disambiguate between regular
+// expressions and divisions. It is set on all token types that can
+// be followed by an expression (thus, a slash after them would be a
+// regular expression).
+//
+// The `startsExpr` property is used to check if the token ends a
+// `yield` expression. It is set on all token types that either can
+// directly start an expression (like a quotation mark) or can
+// continue an expression (like the body of a string).
+//
+// `isLoop` marks a keyword as starting a loop, which is important
+// to know when parsing a label, in order to allow or disallow
+// continue jumps to that label.
+
+var TokenType = function TokenType(label, conf) {
+  if ( conf === void 0 ) conf = {};
+
+  this.label = label;
+  this.keyword = conf.keyword;
+  this.beforeExpr = !!conf.beforeExpr;
+  this.startsExpr = !!conf.startsExpr;
+  this.isLoop = !!conf.isLoop;
+  this.isAssign = !!conf.isAssign;
+  this.prefix = !!conf.prefix;
+  this.postfix = !!conf.postfix;
+  this.binop = conf.binop || null;
+  this.updateContext = null;
+};
+
+function binop(name, prec) {
+  return new TokenType(name, {beforeExpr: true, binop: prec})
+}
+var beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true};
+
+// Map keyword names to token types.
+
+var keywords$1 = {};
+
+// Succinct definitions of keyword token types
+function kw(name, options) {
+  if ( options === void 0 ) options = {};
+
+  options.keyword = name;
+  return keywords$1[name] = new TokenType(name, options)
+}
+
+var types = {
+  num: new TokenType("num", startsExpr),
+  regexp: new TokenType("regexp", startsExpr),
+  string: new TokenType("string", startsExpr),
+  name: new TokenType("name", startsExpr),
+  eof: new TokenType("eof"),
+
+  // Punctuation token types.
+  bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}),
+  bracketR: new TokenType("]"),
+  braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}),
+  braceR: new TokenType("}"),
+  parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}),
+  parenR: new TokenType(")"),
+  comma: new TokenType(",", beforeExpr),
+  semi: new TokenType(";", beforeExpr),
+  colon: new TokenType(":", beforeExpr),
+  dot: new TokenType("."),
+  question: new TokenType("?", beforeExpr),
+  arrow: new TokenType("=>", beforeExpr),
+  template: new TokenType("template"),
+  invalidTemplate: new TokenType("invalidTemplate"),
+  ellipsis: new TokenType("...", beforeExpr),
+  backQuote: new TokenType("`", startsExpr),
+  dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}),
+
+  // Operators. These carry several kinds of properties to help the
+  // parser use them properly (the presence of these properties is
+  // what categorizes them as operators).
+  //
+  // `binop`, when present, specifies that this operator is a binary
+  // operator, and will refer to its precedence.
+  //
+  // `prefix` and `postfix` mark the operator as a prefix or postfix
+  // unary operator.
+  //
+  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+  // binary operators with a very low precedence, that should result
+  // in AssignmentExpression nodes.
+
+  eq: new TokenType("=", {beforeExpr: true, isAssign: true}),
+  assign: new TokenType("_=", {beforeExpr: true, isAssign: true}),
+  incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}),
+  prefix: new TokenType("!/~", {beforeExpr: true, prefix: true, startsExpr: true}),
+  logicalOR: binop("||", 1),
+  logicalAND: binop("&&", 2),
+  bitwiseOR: binop("|", 3),
+  bitwiseXOR: binop("^", 4),
+  bitwiseAND: binop("&", 5),
+  equality: binop("==/!=/===/!==", 6),
+  relational: binop("</>/<=/>=", 7),
+  bitShift: binop("<</>>/>>>", 8),
+  plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),
+  modulo: binop("%", 10),
+  star: binop("*", 10),
+  slash: binop("/", 10),
+  starstar: new TokenType("**", {beforeExpr: true}),
+
+  // Keyword token types.
+  _break: kw("break"),
+  _case: kw("case", beforeExpr),
+  _catch: kw("catch"),
+  _continue: kw("continue"),
+  _debugger: kw("debugger"),
+  _default: kw("default", beforeExpr),
+  _do: kw("do", {isLoop: true, beforeExpr: true}),
+  _else: kw("else", beforeExpr),
+  _finally: kw("finally"),
+  _for: kw("for", {isLoop: true}),
+  _function: kw("function", startsExpr),
+  _if: kw("if"),
+  _return: kw("return", beforeExpr),
+  _switch: kw("switch"),
+  _throw: kw("throw", beforeExpr),
+  _try: kw("try"),
+  _var: kw("var"),
+  _const: kw("const"),
+  _while: kw("while", {isLoop: true}),
+  _with: kw("with"),
+  _new: kw("new", {beforeExpr: true, startsExpr: true}),
+  _this: kw("this", startsExpr),
+  _super: kw("super", startsExpr),
+  _class: kw("class", startsExpr),
+  _extends: kw("extends", beforeExpr),
+  _export: kw("export"),
+  _import: kw("import", startsExpr),
+  _null: kw("null", startsExpr),
+  _true: kw("true", startsExpr),
+  _false: kw("false", startsExpr),
+  _in: kw("in", {beforeExpr: true, binop: 7}),
+  _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}),
+  _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}),
+  _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}),
+  _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true})
+};
+
+// Matches a whole line break (where CRLF is considered a single
+// line break). Used to count lines.
+
+var lineBreak = /\r\n?|\n|\u2028|\u2029/;
+var lineBreakG = new RegExp(lineBreak.source, "g");
+
+function isNewLine(code, ecma2019String) {
+  return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))
+}
+
+var nonASCIIwhitespace = /[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;
+
+var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;
+
+var ref = Object.prototype;
+var hasOwnProperty = ref.hasOwnProperty;
+var toString = ref.toString;
+
+// Checks if an object has a property.
+
+function has(obj, propName) {
+  return hasOwnProperty.call(obj, propName)
+}
+
+var isArray = Array.isArray || (function (obj) { return (
+  toString.call(obj) === "[object Array]"
+); });
+
+function wordsRegexp(words) {
+  return new RegExp("^(?:" + words.replace(/ /g, "|") + ")$")
+}
+
+// These are used when `options.locations` is on, for the
+// `startLoc` and `endLoc` properties.
+
+var Position = function Position(line, col) {
+  this.line = line;
+  this.column = col;
+};
+
+Position.prototype.offset = function offset (n) {
+  return new Position(this.line, this.column + n)
+};
+
+var SourceLocation = function SourceLocation(p, start, end) {
+  this.start = start;
+  this.end = end;
+  if (p.sourceFile !== null) { this.source = p.sourceFile; }
+};
+
+// The `getLineInfo` function is mostly useful when the
+// `locations` option is off (for performance reasons) and you
+// want to find the line/column position for a given character
+// offset. `input` should be the code string that the offset refers
+// into.
+
+function getLineInfo(input, offset) {
+  for (var line = 1, cur = 0;;) {
+    lineBreakG.lastIndex = cur;
+    var match = lineBreakG.exec(input);
+    if (match && match.index < offset) {
+      ++line;
+      cur = match.index + match[0].length;
+    } else {
+      return new Position(line, offset - cur)
+    }
+  }
+}
+
+// A second optional argument can be given to further configure
+// the parser process. These options are recognized:
+
+var defaultOptions = {
+  // `ecmaVersion` indicates the ECMAScript version to parse. Must be
+  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10
+  // (2019). This influences support for strict mode, the set of
+  // reserved words, and support for new syntax features. The default
+  // is 10.
+  ecmaVersion: 10,
+  // `sourceType` indicates the mode the code should be parsed in.
+  // Can be either `"script"` or `"module"`. This influences global
+  // strict mode and parsing of `import` and `export` declarations.
+  sourceType: "script",
+  // `onInsertedSemicolon` can be a callback that will be called
+  // when a semicolon is automatically inserted. It will be passed
+  // the position of the comma as an offset, and if `locations` is
+  // enabled, it is given the location as a `{line, column}` object
+  // as second argument.
+  onInsertedSemicolon: null,
+  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+  // trailing commas.
+  onTrailingComma: null,
+  // By default, reserved words are only enforced if ecmaVersion >= 5.
+  // Set `allowReserved` to a boolean value to explicitly turn this on
+  // an off. When this option has the value "never", reserved words
+  // and keywords can also not be used as property names.
+  allowReserved: null,
+  // When enabled, a return at the top level is not considered an
+  // error.
+  allowReturnOutsideFunction: false,
+  // When enabled, import/export statements are not constrained to
+  // appearing at the top of the program.
+  allowImportExportEverywhere: false,
+  // When enabled, await identifiers are allowed to appear at the top-level scope,
+  // but they are still not allowed in non-async functions.
+  allowAwaitOutsideFunction: false,
+  // When enabled, hashbang directive in the beginning of file
+  // is allowed and treated as a line comment.
+  allowHashBang: false,
+  // When `locations` is on, `loc` properties holding objects with
+  // `start` and `end` properties in `{line, column}` form (with
+  // line being 1-based and column 0-based) will be attached to the
+  // nodes.
+  locations: false,
+  // A function can be passed as `onToken` option, which will
+  // cause Acorn to call that function with object in the same
+  // format as tokens returned from `tokenizer().getToken()`. Note
+  // that you are not allowed to call the parser from the
+  // callback—that will corrupt its internal state.
+  onToken: null,
+  // A function can be passed as `onComment` option, which will
+  // cause Acorn to call that function with `(block, text, start,
+  // end)` parameters whenever a comment is skipped. `block` is a
+  // boolean indicating whether this is a block (`/* */`) comment,
+  // `text` is the content of the comment, and `start` and `end` are
+  // character offsets that denote the start and end of the comment.
+  // When the `locations` option is on, two more parameters are
+  // passed, the full `{line, column}` locations of the start and
+  // end of the comments. Note that you are not allowed to call the
+  // parser from the callback—that will corrupt its internal state.
+  onComment: null,
+  // Nodes have their start and end characters offsets recorded in
+  // `start` and `end` properties (directly on the node, rather than
+  // the `loc` object, which holds line/column data. To also add a
+  // [semi-standardized][range] `range` property holding a `[start,
+  // end]` array with the same numbers, set the `ranges` option to
+  // `true`.
+  //
+  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+  ranges: false,
+  // It is possible to parse multiple files into a single AST by
+  // passing the tree produced by parsing the first file as
+  // `program` option in subsequent parses. This will add the
+  // toplevel forms of the parsed file to the `Program` (top) node
+  // of an existing parse tree.
+  program: null,
+  // When `locations` is on, you can pass this to record the source
+  // file in every node's `loc` object.
+  sourceFile: null,
+  // This value, if given, is stored in every node, whether
+  // `locations` is on or off.
+  directSourceFile: null,
+  // When enabled, parenthesized expressions are represented by
+  // (non-standard) ParenthesizedExpression nodes
+  preserveParens: false
+};
+
+// Interpret and default an options object
+
+function getOptions(opts) {
+  var options = {};
+
+  for (var opt in defaultOptions)
+    { options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]; }
+
+  if (options.ecmaVersion >= 2015)
+    { options.ecmaVersion -= 2009; }
+
+  if (options.allowReserved == null)
+    { options.allowReserved = options.ecmaVersion < 5; }
+
+  if (isArray(options.onToken)) {
+    var tokens = options.onToken;
+    options.onToken = function (token) { return tokens.push(token); };
+  }
+  if (isArray(options.onComment))
+    { options.onComment = pushComment(options, options.onComment); }
+
+  return options
+}
+
+function pushComment(options, array) {
+  return function(block, text, start, end, startLoc, endLoc) {
+    var comment = {
+      type: block ? "Block" : "Line",
+      value: text,
+      start: start,
+      end: end
+    };
+    if (options.locations)
+      { comment.loc = new SourceLocation(this, startLoc, endLoc); }
+    if (options.ranges)
+      { comment.range = [start, end]; }
+    array.push(comment);
+  }
+}
+
+// Each scope gets a bitset that may contain these flags
+var
+    SCOPE_TOP = 1,
+    SCOPE_FUNCTION = 2,
+    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,
+    SCOPE_ASYNC = 4,
+    SCOPE_GENERATOR = 8,
+    SCOPE_ARROW = 16,
+    SCOPE_SIMPLE_CATCH = 32,
+    SCOPE_SUPER = 64,
+    SCOPE_DIRECT_SUPER = 128;
+
+function functionFlags(async, generator) {
+  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)
+}
+
+// Used in checkLVal and declareName to determine the type of a binding
+var
+    BIND_NONE = 0, // Not a binding
+    BIND_VAR = 1, // Var-style binding
+    BIND_LEXICAL = 2, // Let- or const-style binding
+    BIND_FUNCTION = 3, // Function declaration
+    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding
+    BIND_OUTSIDE = 5; // Special case for function names as bound inside the function
+
+var Parser = function Parser(options, input, startPos) {
+  this.options = options = getOptions(options);
+  this.sourceFile = options.sourceFile;
+  this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : options.sourceType === "module" ? "5module" : 5]);
+  var reserved = "";
+  if (options.allowReserved !== true) {
+    for (var v = options.ecmaVersion;; v--)
+      { if (reserved = reservedWords[v]) { break } }
+    if (options.sourceType === "module") { reserved += " await"; }
+  }
+  this.reservedWords = wordsRegexp(reserved);
+  var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict;
+  this.reservedWordsStrict = wordsRegexp(reservedStrict);
+  this.reservedWordsStrictBind = wordsRegexp(reservedStrict + " " + reservedWords.strictBind);
+  this.input = String(input);
+
+  // Used to signal to callers of `readWord1` whether the word
+  // contained any escape sequences. This is needed because words with
+  // escape sequences must not be interpreted as keywords.
+  this.containsEsc = false;
+
+  // Set up token state
+
+  // The current position of the tokenizer in the input.
+  if (startPos) {
+    this.pos = startPos;
+    this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1;
+    this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length;
+  } else {
+    this.pos = this.lineStart = 0;
+    this.curLine = 1;
+  }
+
+  // Properties of the current token:
+  // Its type
+  this.type = types.eof;
+  // For tokens that include more information than their type, the value
+  this.value = null;
+  // Its start and end offset
+  this.start = this.end = this.pos;
+  // And, if locations are used, the {line, column} object
+  // corresponding to those offsets
+  this.startLoc = this.endLoc = this.curPosition();
+
+  // Position information for the previous token
+  this.lastTokEndLoc = this.lastTokStartLoc = null;
+  this.lastTokStart = this.lastTokEnd = this.pos;
+
+  // The context stack is used to superficially track syntactic
+  // context to predict whether a regular expression is allowed in a
+  // given position.
+  this.context = this.initialContext();
+  this.exprAllowed = true;
+
+  // Figure out if it's a module code.
+  this.inModule = options.sourceType === "module";
+  this.strict = this.inModule || this.strictDirective(this.pos);
+
+  // Used to signify the start of a potential arrow function
+  this.potentialArrowAt = -1;
+
+  // Positions to delayed-check that yield/await does not exist in default parameters.
+  this.yieldPos = this.awaitPos = this.awaitIdentPos = 0;
+  // Labels in scope.
+  this.labels = [];
+  // Thus-far undefined exports.
+  this.undefinedExports = {};
+
+  // If enabled, skip leading hashbang line.
+  if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!")
+    { this.skipLineComment(2); }
+
+  // Scope tracking for duplicate variable names (see scope.js)
+  this.scopeStack = [];
+  this.enterScope(SCOPE_TOP);
+
+  // For RegExp validation
+  this.regexpState = null;
+};
+
+var prototypeAccessors = { inFunction: { configurable: true },inGenerator: { configurable: true },inAsync: { configurable: true },allowSuper: { configurable: true },allowDirectSuper: { configurable: true },treatFunctionsAsVar: { configurable: true } };
+
+Parser.prototype.parse = function parse () {
+  var node = this.options.program || this.startNode();
+  this.nextToken();
+  return this.parseTopLevel(node)
+};
+
+prototypeAccessors.inFunction.get = function () { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 };
+prototypeAccessors.inGenerator.get = function () { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 };
+prototypeAccessors.inAsync.get = function () { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 };
+prototypeAccessors.allowSuper.get = function () { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 };
+prototypeAccessors.allowDirectSuper.get = function () { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 };
+prototypeAccessors.treatFunctionsAsVar.get = function () { return this.treatFunctionsAsVarInScope(this.currentScope()) };
+
+// Switch to a getter for 7.0.0.
+Parser.prototype.inNonArrowFunction = function inNonArrowFunction () { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 };
+
+Parser.extend = function extend () {
+    var plugins = [], len = arguments.length;
+    while ( len-- ) plugins[ len ] = arguments[ len ];
+
+  var cls = this;
+  for (var i = 0; i < plugins.length; i++) { cls = plugins[i](cls); }
+  return cls
+};
+
+Parser.parse = function parse (input, options) {
+  return new this(options, input).parse()
+};
+
+Parser.parseExpressionAt = function parseExpressionAt (input, pos, options) {
+  var parser = new this(options, input, pos);
+  parser.nextToken();
+  return parser.parseExpression()
+};
+
+Parser.tokenizer = function tokenizer (input, options) {
+  return new this(options, input)
+};
+
+Object.defineProperties( Parser.prototype, prototypeAccessors );
+
+var pp = Parser.prototype;
+
+// ## Parser utilities
+
+var literal = /^(?:'((?:\\.|[^'])*?)'|"((?:\\.|[^"])*?)")/;
+pp.strictDirective = function(start) {
+  for (;;) {
+    // Try to find string literal.
+    skipWhiteSpace.lastIndex = start;
+    start += skipWhiteSpace.exec(this.input)[0].length;
+    var match = literal.exec(this.input.slice(start));
+    if (!match) { return false }
+    if ((match[1] || match[2]) === "use strict") { return true }
+    start += match[0].length;
+
+    // Skip semicolon, if any.
+    skipWhiteSpace.lastIndex = start;
+    start += skipWhiteSpace.exec(this.input)[0].length;
+    if (this.input[start] === ";")
+      { start++; }
+  }
+};
+
+// Predicate that tests whether the next token is of the given
+// type, and if yes, consumes it as a side effect.
+
+pp.eat = function(type) {
+  if (this.type === type) {
+    this.next();
+    return true
+  } else {
+    return false
+  }
+};
+
+// Tests whether parsed token is a contextual keyword.
+
+pp.isContextual = function(name) {
+  return this.type === types.name && this.value === name && !this.containsEsc
+};
+
+// Consumes contextual keyword if possible.
+
+pp.eatContextual = function(name) {
+  if (!this.isContextual(name)) { return false }
+  this.next();
+  return true
+};
+
+// Asserts that following token is given contextual keyword.
+
+pp.expectContextual = function(name) {
+  if (!this.eatContextual(name)) { this.unexpected(); }
+};
+
+// Test whether a semicolon can be inserted at the current position.
+
+pp.canInsertSemicolon = function() {
+  return this.type === types.eof ||
+    this.type === types.braceR ||
+    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+};
+
+pp.insertSemicolon = function() {
+  if (this.canInsertSemicolon()) {
+    if (this.options.onInsertedSemicolon)
+      { this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc); }
+    return true
+  }
+};
+
+// Consume a semicolon, or, failing that, see if we are allowed to
+// pretend that there is a semicolon at this position.
+
+pp.semicolon = function() {
+  if (!this.eat(types.semi) && !this.insertSemicolon()) { this.unexpected(); }
+};
+
+pp.afterTrailingComma = function(tokType, notNext) {
+  if (this.type === tokType) {
+    if (this.options.onTrailingComma)
+      { this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc); }
+    if (!notNext)
+      { this.next(); }
+    return true
+  }
+};
+
+// Expect a token of a given type. If found, consume it, otherwise,
+// raise an unexpected token error.
+
+pp.expect = function(type) {
+  this.eat(type) || this.unexpected();
+};
+
+// Raise an unexpected token error.
+
+pp.unexpected = function(pos) {
+  this.raise(pos != null ? pos : this.start, "Unexpected token");
+};
+
+function DestructuringErrors() {
+  this.shorthandAssign =
+  this.trailingComma =
+  this.parenthesizedAssign =
+  this.parenthesizedBind =
+  this.doubleProto =
+    -1;
+}
+
+pp.checkPatternErrors = function(refDestructuringErrors, isAssign) {
+  if (!refDestructuringErrors) { return }
+  if (refDestructuringErrors.trailingComma > -1)
+    { this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element"); }
+  var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind;
+  if (parens > -1) { this.raiseRecoverable(parens, "Parenthesized pattern"); }
+};
+
+pp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {
+  if (!refDestructuringErrors) { return false }
+  var shorthandAssign = refDestructuringErrors.shorthandAssign;
+  var doubleProto = refDestructuringErrors.doubleProto;
+  if (!andThrow) { return shorthandAssign >= 0 || doubleProto >= 0 }
+  if (shorthandAssign >= 0)
+    { this.raise(shorthandAssign, "Shorthand property assignments are valid only in destructuring patterns"); }
+  if (doubleProto >= 0)
+    { this.raiseRecoverable(doubleProto, "Redefinition of __proto__ property"); }
+};
+
+pp.checkYieldAwaitInDefaultParams = function() {
+  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))
+    { this.raise(this.yieldPos, "Yield expression cannot be a default value"); }
+  if (this.awaitPos)
+    { this.raise(this.awaitPos, "Await expression cannot be a default value"); }
+};
+
+pp.isSimpleAssignTarget = function(expr) {
+  if (expr.type === "ParenthesizedExpression")
+    { return this.isSimpleAssignTarget(expr.expression) }
+  return expr.type === "Identifier" || expr.type === "MemberExpression"
+};
+
+var pp$1 = Parser.prototype;
+
+// ### Statement parsing
+
+// Parse a program. Initializes the parser, reads any number of
+// statements, and wraps them in a Program node.  Optionally takes a
+// `program` argument.  If present, the statements will be appended
+// to its body instead of creating a new node.
+
+pp$1.parseTopLevel = function(node) {
+  var exports = {};
+  if (!node.body) { node.body = []; }
+  while (this.type !== types.eof) {
+    var stmt = this.parseStatement(null, true, exports);
+    node.body.push(stmt);
+  }
+  if (this.inModule)
+    { for (var i = 0, list = Object.keys(this.undefinedExports); i < list.length; i += 1)
+      {
+        var name = list[i];
+
+        this.raiseRecoverable(this.undefinedExports[name].start, ("Export '" + name + "' is not defined"));
+      } }
+  this.adaptDirectivePrologue(node.body);
+  this.next();
+  node.sourceType = this.options.sourceType;
+  return this.finishNode(node, "Program")
+};
+
+var loopLabel = {kind: "loop"}, switchLabel = {kind: "switch"};
+
+pp$1.isLet = function(context) {
+  if (this.options.ecmaVersion < 6 || !this.isContextual("let")) { return false }
+  skipWhiteSpace.lastIndex = this.pos;
+  var skip = skipWhiteSpace.exec(this.input);
+  var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+  // For ambiguous cases, determine if a LexicalDeclaration (or only a
+  // Statement) is allowed here. If context is not empty then only a Statement
+  // is allowed. However, `let [` is an explicit negative lookahead for
+  // ExpressionStatement, so special-case it first.
+  if (nextCh === 91) { return true } // '['
+  if (context) { return false }
+
+  if (nextCh === 123) { return true } // '{'
+  if (isIdentifierStart(nextCh, true)) {
+    var pos = next + 1;
+    while (isIdentifierChar(this.input.charCodeAt(pos), true)) { ++pos; }
+    var ident = this.input.slice(next, pos);
+    if (!keywordRelationalOperator.test(ident)) { return true }
+  }
+  return false
+};
+
+// check 'async [no LineTerminator here] function'
+// - 'async /*foo*/ function' is OK.
+// - 'async /*\n*/ function' is invalid.
+pp$1.isAsyncFunction = function() {
+  if (this.options.ecmaVersion < 8 || !this.isContextual("async"))
+    { return false }
+
+  skipWhiteSpace.lastIndex = this.pos;
+  var skip = skipWhiteSpace.exec(this.input);
+  var next = this.pos + skip[0].length;
+  return !lineBreak.test(this.input.slice(this.pos, next)) &&
+    this.input.slice(next, next + 8) === "function" &&
+    (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))
+};
+
+// Parse a single statement.
+//
+// If expecting a statement and finding a slash operator, parse a
+// regular expression literal. This is to handle cases like
+// `if (foo) /blah/.exec(foo)`, where looking at the previous token
+// does not help.
+
+pp$1.parseStatement = function(context, topLevel, exports) {
+  var starttype = this.type, node = this.startNode(), kind;
+
+  if (this.isLet(context)) {
+    starttype = types._var;
+    kind = "let";
+  }
+
+  // Most types of statements are recognized by the keyword they
+  // start with. Many are trivial to parse, some require a bit of
+  // complexity.
+
+  switch (starttype) {
+  case types._break: case types._continue: return this.parseBreakContinueStatement(node, starttype.keyword)
+  case types._debugger: return this.parseDebuggerStatement(node)
+  case types._do: return this.parseDoStatement(node)
+  case types._for: return this.parseForStatement(node)
+  case types._function:
+    // Function as sole body of either an if statement or a labeled statement
+    // works, but not when it is part of a labeled statement that is the sole
+    // body of an if statement.
+    if ((context && (this.strict || context !== "if" && context !== "label")) && this.options.ecmaVersion >= 6) { this.unexpected(); }
+    return this.parseFunctionStatement(node, false, !context)
+  case types._class:
+    if (context) { this.unexpected(); }
+    return this.parseClass(node, true)
+  case types._if: return this.parseIfStatement(node)
+  case types._return: return this.parseReturnStatement(node)
+  case types._switch: return this.parseSwitchStatement(node)
+  case types._throw: return this.parseThrowStatement(node)
+  case types._try: return this.parseTryStatement(node)
+  case types._const: case types._var:
+    kind = kind || this.value;
+    if (context && kind !== "var") { this.unexpected(); }
+    return this.parseVarStatement(node, kind)
+  case types._while: return this.parseWhileStatement(node)
+  case types._with: return this.parseWithStatement(node)
+  case types.braceL: return this.parseBlock(true, node)
+  case types.semi: return this.parseEmptyStatement(node)
+  case types._export:
+  case types._import:
+    if (this.options.ecmaVersion > 10 && starttype === types._import) {
+      skipWhiteSpace.lastIndex = this.pos;
+      var skip = skipWhiteSpace.exec(this.input);
+      var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next);
+      if (nextCh === 40) // '('
+        { return this.parseExpressionStatement(node, this.parseExpression()) }
+    }
+
+    if (!this.options.allowImportExportEverywhere) {
+      if (!topLevel)
+        { this.raise(this.start, "'import' and 'export' may only appear at the top level"); }
+      if (!this.inModule)
+        { this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'"); }
+    }
+    return starttype === types._import ? this.parseImport(node) : this.parseExport(node, exports)
+
+    // If the statement does not start with a statement keyword or a
+    // brace, it's an ExpressionStatement or LabeledStatement. We
+    // simply start parsing an expression, and afterwards, if the
+    // next token is a colon and the expression was a simple
+    // Identifier node, we switch to interpreting it as a label.
+  default:
+    if (this.isAsyncFunction()) {
+      if (context) { this.unexpected(); }
+      this.next();
+      return this.parseFunctionStatement(node, true, !context)
+    }
+
+    var maybeName = this.value, expr = this.parseExpression();
+    if (starttype === types.name && expr.type === "Identifier" && this.eat(types.colon))
+      { return this.parseLabeledStatement(node, maybeName, expr, context) }
+    else { return this.parseExpressionStatement(node, expr) }
+  }
+};
+
+pp$1.parseBreakContinueStatement = function(node, keyword) {
+  var isBreak = keyword === "break";
+  this.next();
+  if (this.eat(types.semi) || this.insertSemicolon()) { node.label = null; }
+  else if (this.type !== types.name) { this.unexpected(); }
+  else {
+    node.label = this.parseIdent();
+    this.semicolon();
+  }
+
+  // Verify that there is an actual destination to break or
+  // continue to.
+  var i = 0;
+  for (; i < this.labels.length; ++i) {
+    var lab = this.labels[i];
+    if (node.label == null || lab.name === node.label.name) {
+      if (lab.kind != null && (isBreak || lab.kind === "loop")) { break }
+      if (node.label && isBreak) { break }
+    }
+  }
+  if (i === this.labels.length) { this.raise(node.start, "Unsyntactic " + keyword); }
+  return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement")
+};
+
+pp$1.parseDebuggerStatement = function(node) {
+  this.next();
+  this.semicolon();
+  return this.finishNode(node, "DebuggerStatement")
+};
+
+pp$1.parseDoStatement = function(node) {
+  this.next();
+  this.labels.push(loopLabel);
+  node.body = this.parseStatement("do");
+  this.labels.pop();
+  this.expect(types._while);
+  node.test = this.parseParenExpression();
+  if (this.options.ecmaVersion >= 6)
+    { this.eat(types.semi); }
+  else
+    { this.semicolon(); }
+  return this.finishNode(node, "DoWhileStatement")
+};
+
+// Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+// loop is non-trivial. Basically, we have to parse the init `var`
+// statement or expression, disallowing the `in` operator (see
+// the second parameter to `parseExpression`), and then check
+// whether the next token is `in` or `of`. When there is no init
+// part (semicolon immediately after the opening parenthesis), it
+// is a regular `for` loop.
+
+pp$1.parseForStatement = function(node) {
+  this.next();
+  var awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual("await")) ? this.lastTokStart : -1;
+  this.labels.push(loopLabel);
+  this.enterScope(0);
+  this.expect(types.parenL);
+  if (this.type === types.semi) {
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, null)
+  }
+  var isLet = this.isLet();
+  if (this.type === types._var || this.type === types._const || isLet) {
+    var init$1 = this.startNode(), kind = isLet ? "let" : this.value;
+    this.next();
+    this.parseVar(init$1, true, kind);
+    this.finishNode(init$1, "VariableDeclaration");
+    if ((this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1) {
+      if (this.options.ecmaVersion >= 9) {
+        if (this.type === types._in) {
+          if (awaitAt > -1) { this.unexpected(awaitAt); }
+        } else { node.await = awaitAt > -1; }
+      }
+      return this.parseForIn(node, init$1)
+    }
+    if (awaitAt > -1) { this.unexpected(awaitAt); }
+    return this.parseFor(node, init$1)
+  }
+  var refDestructuringErrors = new DestructuringErrors;
+  var init = this.parseExpression(true, refDestructuringErrors);
+  if (this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) {
+    if (this.options.ecmaVersion >= 9) {
+      if (this.type === types._in) {
+        if (awaitAt > -1) { this.unexpected(awaitAt); }
+      } else { node.await = awaitAt > -1; }
+    }
+    this.toAssignable(init, false, refDestructuringErrors);
+    this.checkLVal(init);
+    return this.parseForIn(node, init)
+  } else {
+    this.checkExpressionErrors(refDestructuringErrors, true);
+  }
+  if (awaitAt > -1) { this.unexpected(awaitAt); }
+  return this.parseFor(node, init)
+};
+
+pp$1.parseFunctionStatement = function(node, isAsync, declarationPosition) {
+  this.next();
+  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)
+};
+
+pp$1.parseIfStatement = function(node) {
+  this.next();
+  node.test = this.parseParenExpression();
+  // allow function declarations in branches, but only in non-strict mode
+  node.consequent = this.parseStatement("if");
+  node.alternate = this.eat(types._else) ? this.parseStatement("if") : null;
+  return this.finishNode(node, "IfStatement")
+};
+
+pp$1.parseReturnStatement = function(node) {
+  if (!this.inFunction && !this.options.allowReturnOutsideFunction)
+    { this.raise(this.start, "'return' outside of function"); }
+  this.next();
+
+  // In `return` (and `break`/`continue`), the keywords with
+  // optional arguments, we eagerly look for a semicolon or the
+  // possibility to insert one.
+
+  if (this.eat(types.semi) || this.insertSemicolon()) { node.argument = null; }
+  else { node.argument = this.parseExpression(); this.semicolon(); }
+  return this.finishNode(node, "ReturnStatement")
+};
+
+pp$1.parseSwitchStatement = function(node) {
+  this.next();
+  node.discriminant = this.parseParenExpression();
+  node.cases = [];
+  this.expect(types.braceL);
+  this.labels.push(switchLabel);
+  this.enterScope(0);
+
+  // Statements under must be grouped (by label) in SwitchCase
+  // nodes. `cur` is used to keep the node that we are currently
+  // adding statements to.
+
+  var cur;
+  for (var sawDefault = false; this.type !== types.braceR;) {
+    if (this.type === types._case || this.type === types._default) {
+      var isCase = this.type === types._case;
+      if (cur) { this.finishNode(cur, "SwitchCase"); }
+      node.cases.push(cur = this.startNode());
+      cur.consequent = [];
+      this.next();
+      if (isCase) {
+        cur.test = this.parseExpression();
+      } else {
+        if (sawDefault) { this.raiseRecoverable(this.lastTokStart, "Multiple default clauses"); }
+        sawDefault = true;
+        cur.test = null;
+      }
+      this.expect(types.colon);
+    } else {
+      if (!cur) { this.unexpected(); }
+      cur.consequent.push(this.parseStatement(null));
+    }
+  }
+  this.exitScope();
+  if (cur) { this.finishNode(cur, "SwitchCase"); }
+  this.next(); // Closing brace
+  this.labels.pop();
+  return this.finishNode(node, "SwitchStatement")
+};
+
+pp$1.parseThrowStatement = function(node) {
+  this.next();
+  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))
+    { this.raise(this.lastTokEnd, "Illegal newline after throw"); }
+  node.argument = this.parseExpression();
+  this.semicolon();
+  return this.finishNode(node, "ThrowStatement")
+};
+
+// Reused empty array added for node fields that are always empty.
+
+var empty = [];
+
+pp$1.parseTryStatement = function(node) {
+  this.next();
+  node.block = this.parseBlock();
+  node.handler = null;
+  if (this.type === types._catch) {
+    var clause = this.startNode();
+    this.next();
+    if (this.eat(types.parenL)) {
+      clause.param = this.parseBindingAtom();
+      var simple = clause.param.type === "Identifier";
+      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0);
+      this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL);
+      this.expect(types.parenR);
+    } else {
+      if (this.options.ecmaVersion < 10) { this.unexpected(); }
+      clause.param = null;
+      this.enterScope(0);
+    }
+    clause.body = this.parseBlock(false);
+    this.exitScope();
+    node.handler = this.finishNode(clause, "CatchClause");
+  }
+  node.finalizer = this.eat(types._finally) ? this.parseBlock() : null;
+  if (!node.handler && !node.finalizer)
+    { this.raise(node.start, "Missing catch or finally clause"); }
+  return this.finishNode(node, "TryStatement")
+};
+
+pp$1.parseVarStatement = function(node, kind) {
+  this.next();
+  this.parseVar(node, false, kind);
+  this.semicolon();
+  return this.finishNode(node, "VariableDeclaration")
+};
+
+pp$1.parseWhileStatement = function(node) {
+  this.next();
+  node.test = this.parseParenExpression();
+  this.labels.push(loopLabel);
+  node.body = this.parseStatement("while");
+  this.labels.pop();
+  return this.finishNode(node, "WhileStatement")
+};
+
+pp$1.parseWithStatement = function(node) {
+  if (this.strict) { this.raise(this.start, "'with' in strict mode"); }
+  this.next();
+  node.object = this.parseParenExpression();
+  node.body = this.parseStatement("with");
+  return this.finishNode(node, "WithStatement")
+};
+
+pp$1.parseEmptyStatement = function(node) {
+  this.next();
+  return this.finishNode(node, "EmptyStatement")
+};
+
+pp$1.parseLabeledStatement = function(node, maybeName, expr, context) {
+  for (var i$1 = 0, list = this.labels; i$1 < list.length; i$1 += 1)
+    {
+    var label = list[i$1];
+
+    if (label.name === maybeName)
+      { this.raise(expr.start, "Label '" + maybeName + "' is already declared");
+  } }
+  var kind = this.type.isLoop ? "loop" : this.type === types._switch ? "switch" : null;
+  for (var i = this.labels.length - 1; i >= 0; i--) {
+    var label$1 = this.labels[i];
+    if (label$1.statementStart === node.start) {
+      // Update information about previous labels on this node
+      label$1.statementStart = this.start;
+      label$1.kind = kind;
+    } else { break }
+  }
+  this.labels.push({name: maybeName, kind: kind, statementStart: this.start});
+  node.body = this.parseStatement(context ? context.indexOf("label") === -1 ? context + "label" : context : "label");
+  this.labels.pop();
+  node.label = expr;
+  return this.finishNode(node, "LabeledStatement")
+};
+
+pp$1.parseExpressionStatement = function(node, expr) {
+  node.expression = expr;
+  this.semicolon();
+  return this.finishNode(node, "ExpressionStatement")
+};
+
+// Parse a semicolon-enclosed block of statements, handling `"use
+// strict"` declarations when `allowStrict` is true (used for
+// function bodies).
+
+pp$1.parseBlock = function(createNewLexicalScope, node) {
+  if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true;
+  if ( node === void 0 ) node = this.startNode();
+
+  node.body = [];
+  this.expect(types.braceL);
+  if (createNewLexicalScope) { this.enterScope(0); }
+  while (!this.eat(types.braceR)) {
+    var stmt = this.parseStatement(null);
+    node.body.push(stmt);
+  }
+  if (createNewLexicalScope) { this.exitScope(); }
+  return this.finishNode(node, "BlockStatement")
+};
+
+// Parse a regular `for` loop. The disambiguation code in
+// `parseStatement` will already have parsed the init statement or
+// expression.
+
+pp$1.parseFor = function(node, init) {
+  node.init = init;
+  this.expect(types.semi);
+  node.test = this.type === types.semi ? null : this.parseExpression();
+  this.expect(types.semi);
+  node.update = this.type === types.parenR ? null : this.parseExpression();
+  this.expect(types.parenR);
+  node.body = this.parseStatement("for");
+  this.exitScope();
+  this.labels.pop();
+  return this.finishNode(node, "ForStatement")
+};
+
+// Parse a `for`/`in` and `for`/`of` loop, which are almost
+// same from parser's perspective.
+
+pp$1.parseForIn = function(node, init) {
+  var isForIn = this.type === types._in;
+  this.next();
+
+  if (
+    init.type === "VariableDeclaration" &&
+    init.declarations[0].init != null &&
+    (
+      !isForIn ||
+      this.options.ecmaVersion < 8 ||
+      this.strict ||
+      init.kind !== "var" ||
+      init.declarations[0].id.type !== "Identifier"
+    )
+  ) {
+    this.raise(
+      init.start,
+      ((isForIn ? "for-in" : "for-of") + " loop variable declaration may not have an initializer")
+    );
+  } else if (init.type === "AssignmentPattern") {
+    this.raise(init.start, "Invalid left-hand side in for-loop");
+  }
+  node.left = init;
+  node.right = isForIn ? this.parseExpression() : this.parseMaybeAssign();
+  this.expect(types.parenR);
+  node.body = this.parseStatement("for");
+  this.exitScope();
+  this.labels.pop();
+  return this.finishNode(node, isForIn ? "ForInStatement" : "ForOfStatement")
+};
+
+// Parse a list of variable declarations.
+
+pp$1.parseVar = function(node, isFor, kind) {
+  node.declarations = [];
+  node.kind = kind;
+  for (;;) {
+    var decl = this.startNode();
+    this.parseVarId(decl, kind);
+    if (this.eat(types.eq)) {
+      decl.init = this.parseMaybeAssign(isFor);
+    } else if (kind === "const" && !(this.type === types._in || (this.options.ecmaVersion >= 6 && this.isContextual("of")))) {
+      this.unexpected();
+    } else if (decl.id.type !== "Identifier" && !(isFor && (this.type === types._in || this.isContextual("of")))) {
+      this.raise(this.lastTokEnd, "Complex binding patterns require an initialization value");
+    } else {
+      decl.init = null;
+    }
+    node.declarations.push(this.finishNode(decl, "VariableDeclarator"));
+    if (!this.eat(types.comma)) { break }
+  }
+  return node
+};
+
+pp$1.parseVarId = function(decl, kind) {
+  decl.id = this.parseBindingAtom();
+  this.checkLVal(decl.id, kind === "var" ? BIND_VAR : BIND_LEXICAL, false);
+};
+
+var FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4;
+
+// Parse a function declaration or literal (depending on the
+// `statement & FUNC_STATEMENT`).
+
+// Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+pp$1.parseFunction = function(node, statement, allowExpressionBody, isAsync) {
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {
+    if (this.type === types.star && (statement & FUNC_HANGING_STATEMENT))
+      { this.unexpected(); }
+    node.generator = this.eat(types.star);
+  }
+  if (this.options.ecmaVersion >= 8)
+    { node.async = !!isAsync; }
+
+  if (statement & FUNC_STATEMENT) {
+    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== types.name ? null : this.parseIdent();
+    if (node.id && !(statement & FUNC_HANGING_STATEMENT))
+      // If it is a regular function declaration in sloppy mode, then it is
+      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+      // mode depends on properties of the current scope (see
+      // treatFunctionsAsVar).
+      { this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION); }
+  }
+
+  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+  this.enterScope(functionFlags(node.async, node.generator));
+
+  if (!(statement & FUNC_STATEMENT))
+    { node.id = this.type === types.name ? this.parseIdent() : null; }
+
+  this.parseFunctionParams(node);
+  this.parseFunctionBody(node, allowExpressionBody, false);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, (statement & FUNC_STATEMENT) ? "FunctionDeclaration" : "FunctionExpression")
+};
+
+pp$1.parseFunctionParams = function(node) {
+  this.expect(types.parenL);
+  node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);
+  this.checkYieldAwaitInDefaultParams();
+};
+
+// Parse a class declaration or literal (depending on the
+// `isStatement` parameter).
+
+pp$1.parseClass = function(node, isStatement) {
+  this.next();
+
+  // ecma-262 14.6 Class Definitions
+  // A class definition is always strict mode code.
+  var oldStrict = this.strict;
+  this.strict = true;
+
+  this.parseClassId(node, isStatement);
+  this.parseClassSuper(node);
+  var classBody = this.startNode();
+  var hadConstructor = false;
+  classBody.body = [];
+  this.expect(types.braceL);
+  while (!this.eat(types.braceR)) {
+    var element = this.parseClassElement(node.superClass !== null);
+    if (element) {
+      classBody.body.push(element);
+      if (element.type === "MethodDefinition" && element.kind === "constructor") {
+        if (hadConstructor) { this.raise(element.start, "Duplicate constructor in the same class"); }
+        hadConstructor = true;
+      }
+    }
+  }
+  node.body = this.finishNode(classBody, "ClassBody");
+  this.strict = oldStrict;
+  return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression")
+};
+
+pp$1.parseClassElement = function(constructorAllowsSuper) {
+  var this$1 = this;
+
+  if (this.eat(types.semi)) { return null }
+
+  var method = this.startNode();
+  var tryContextual = function (k, noLineBreak) {
+    if ( noLineBreak === void 0 ) noLineBreak = false;
+
+    var start = this$1.start, startLoc = this$1.startLoc;
+    if (!this$1.eatContextual(k)) { return false }
+    if (this$1.type !== types.parenL && (!noLineBreak || !this$1.canInsertSemicolon())) { return true }
+    if (method.key) { this$1.unexpected(); }
+    method.computed = false;
+    method.key = this$1.startNodeAt(start, startLoc);
+    method.key.name = k;
+    this$1.finishNode(method.key, "Identifier");
+    return false
+  };
+
+  method.kind = "method";
+  method.static = tryContextual("static");
+  var isGenerator = this.eat(types.star);
+  var isAsync = false;
+  if (!isGenerator) {
+    if (this.options.ecmaVersion >= 8 && tryContextual("async", true)) {
+      isAsync = true;
+      isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);
+    } else if (tryContextual("get")) {
+      method.kind = "get";
+    } else if (tryContextual("set")) {
+      method.kind = "set";
+    }
+  }
+  if (!method.key) { this.parsePropertyName(method); }
+  var key = method.key;
+  var allowsDirectSuper = false;
+  if (!method.computed && !method.static && (key.type === "Identifier" && key.name === "constructor" ||
+      key.type === "Literal" && key.value === "constructor")) {
+    if (method.kind !== "method") { this.raise(key.start, "Constructor can't have get/set modifier"); }
+    if (isGenerator) { this.raise(key.start, "Constructor can't be a generator"); }
+    if (isAsync) { this.raise(key.start, "Constructor can't be an async method"); }
+    method.kind = "constructor";
+    allowsDirectSuper = constructorAllowsSuper;
+  } else if (method.static && key.type === "Identifier" && key.name === "prototype") {
+    this.raise(key.start, "Classes may not have a static property named prototype");
+  }
+  this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper);
+  if (method.kind === "get" && method.value.params.length !== 0)
+    { this.raiseRecoverable(method.value.start, "getter should have no params"); }
+  if (method.kind === "set" && method.value.params.length !== 1)
+    { this.raiseRecoverable(method.value.start, "setter should have exactly one param"); }
+  if (method.kind === "set" && method.value.params[0].type === "RestElement")
+    { this.raiseRecoverable(method.value.params[0].start, "Setter cannot use rest params"); }
+  return method
+};
+
+pp$1.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {
+  method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper);
+  return this.finishNode(method, "MethodDefinition")
+};
+
+pp$1.parseClassId = function(node, isStatement) {
+  if (this.type === types.name) {
+    node.id = this.parseIdent();
+    if (isStatement)
+      { this.checkLVal(node.id, BIND_LEXICAL, false); }
+  } else {
+    if (isStatement === true)
+      { this.unexpected(); }
+    node.id = null;
+  }
+};
+
+pp$1.parseClassSuper = function(node) {
+  node.superClass = this.eat(types._extends) ? this.parseExprSubscripts() : null;
+};
+
+// Parses module export declaration.
+
+pp$1.parseExport = function(node, exports) {
+  this.next();
+  // export * from '...'
+  if (this.eat(types.star)) {
+    this.expectContextual("from");
+    if (this.type !== types.string) { this.unexpected(); }
+    node.source = this.parseExprAtom();
+    this.semicolon();
+    return this.finishNode(node, "ExportAllDeclaration")
+  }
+  if (this.eat(types._default)) { // export default ...
+    this.checkExport(exports, "default", this.lastTokStart);
+    var isAsync;
+    if (this.type === types._function || (isAsync = this.isAsyncFunction())) {
+      var fNode = this.startNode();
+      this.next();
+      if (isAsync) { this.next(); }
+      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync);
+    } else if (this.type === types._class) {
+      var cNode = this.startNode();
+      node.declaration = this.parseClass(cNode, "nullableID");
+    } else {
+      node.declaration = this.parseMaybeAssign();
+      this.semicolon();
+    }
+    return this.finishNode(node, "ExportDefaultDeclaration")
+  }
+  // export var|const|let|function|class ...
+  if (this.shouldParseExportStatement()) {
+    node.declaration = this.parseStatement(null);
+    if (node.declaration.type === "VariableDeclaration")
+      { this.checkVariableExport(exports, node.declaration.declarations); }
+    else
+      { this.checkExport(exports, node.declaration.id.name, node.declaration.id.start); }
+    node.specifiers = [];
+    node.source = null;
+  } else { // export { x, y as z } [from '...']
+    node.declaration = null;
+    node.specifiers = this.parseExportSpecifiers(exports);
+    if (this.eatContextual("from")) {
+      if (this.type !== types.string) { this.unexpected(); }
+      node.source = this.parseExprAtom();
+    } else {
+      for (var i = 0, list = node.specifiers; i < list.length; i += 1) {
+        // check for keywords used as local names
+        var spec = list[i];
+
+        this.checkUnreserved(spec.local);
+        // check if export is defined
+        this.checkLocalExport(spec.local);
+      }
+
+      node.source = null;
+    }
+    this.semicolon();
+  }
+  return this.finishNode(node, "ExportNamedDeclaration")
+};
+
+pp$1.checkExport = function(exports, name, pos) {
+  if (!exports) { return }
+  if (has(exports, name))
+    { this.raiseRecoverable(pos, "Duplicate export '" + name + "'"); }
+  exports[name] = true;
+};
+
+pp$1.checkPatternExport = function(exports, pat) {
+  var type = pat.type;
+  if (type === "Identifier")
+    { this.checkExport(exports, pat.name, pat.start); }
+  else if (type === "ObjectPattern")
+    { for (var i = 0, list = pat.properties; i < list.length; i += 1)
+      {
+        var prop = list[i];
+
+        this.checkPatternExport(exports, prop);
+      } }
+  else if (type === "ArrayPattern")
+    { for (var i$1 = 0, list$1 = pat.elements; i$1 < list$1.length; i$1 += 1) {
+      var elt = list$1[i$1];
+
+        if (elt) { this.checkPatternExport(exports, elt); }
+    } }
+  else if (type === "Property")
+    { this.checkPatternExport(exports, pat.value); }
+  else if (type === "AssignmentPattern")
+    { this.checkPatternExport(exports, pat.left); }
+  else if (type === "RestElement")
+    { this.checkPatternExport(exports, pat.argument); }
+  else if (type === "ParenthesizedExpression")
+    { this.checkPatternExport(exports, pat.expression); }
+};
+
+pp$1.checkVariableExport = function(exports, decls) {
+  if (!exports) { return }
+  for (var i = 0, list = decls; i < list.length; i += 1)
+    {
+    var decl = list[i];
+
+    this.checkPatternExport(exports, decl.id);
+  }
+};
+
+pp$1.shouldParseExportStatement = function() {
+  return this.type.keyword === "var" ||
+    this.type.keyword === "const" ||
+    this.type.keyword === "class" ||
+    this.type.keyword === "function" ||
+    this.isLet() ||
+    this.isAsyncFunction()
+};
+
+// Parses a comma-separated list of module exports.
+
+pp$1.parseExportSpecifiers = function(exports) {
+  var nodes = [], first = true;
+  // export { x, y as z } [from '...']
+  this.expect(types.braceL);
+  while (!this.eat(types.braceR)) {
+    if (!first) {
+      this.expect(types.comma);
+      if (this.afterTrailingComma(types.braceR)) { break }
+    } else { first = false; }
+
+    var node = this.startNode();
+    node.local = this.parseIdent(true);
+    node.exported = this.eatContextual("as") ? this.parseIdent(true) : node.local;
+    this.checkExport(exports, node.exported.name, node.exported.start);
+    nodes.push(this.finishNode(node, "ExportSpecifier"));
+  }
+  return nodes
+};
+
+// Parses import declaration.
+
+pp$1.parseImport = function(node) {
+  this.next();
+  // import '...'
+  if (this.type === types.string) {
+    node.specifiers = empty;
+    node.source = this.parseExprAtom();
+  } else {
+    node.specifiers = this.parseImportSpecifiers();
+    this.expectContextual("from");
+    node.source = this.type === types.string ? this.parseExprAtom() : this.unexpected();
+  }
+  this.semicolon();
+  return this.finishNode(node, "ImportDeclaration")
+};
+
+// Parses a comma-separated list of module imports.
+
+pp$1.parseImportSpecifiers = function() {
+  var nodes = [], first = true;
+  if (this.type === types.name) {
+    // import defaultObj, { x, y as z } from '...'
+    var node = this.startNode();
+    node.local = this.parseIdent();
+    this.checkLVal(node.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node, "ImportDefaultSpecifier"));
+    if (!this.eat(types.comma)) { return nodes }
+  }
+  if (this.type === types.star) {
+    var node$1 = this.startNode();
+    this.next();
+    this.expectContextual("as");
+    node$1.local = this.parseIdent();
+    this.checkLVal(node$1.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier"));
+    return nodes
+  }
+  this.expect(types.braceL);
+  while (!this.eat(types.braceR)) {
+    if (!first) {
+      this.expect(types.comma);
+      if (this.afterTrailingComma(types.braceR)) { break }
+    } else { first = false; }
+
+    var node$2 = this.startNode();
+    node$2.imported = this.parseIdent(true);
+    if (this.eatContextual("as")) {
+      node$2.local = this.parseIdent();
+    } else {
+      this.checkUnreserved(node$2.imported);
+      node$2.local = node$2.imported;
+    }
+    this.checkLVal(node$2.local, BIND_LEXICAL);
+    nodes.push(this.finishNode(node$2, "ImportSpecifier"));
+  }
+  return nodes
+};
+
+// Set `ExpressionStatement#directive` property for directive prologues.
+pp$1.adaptDirectivePrologue = function(statements) {
+  for (var i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {
+    statements[i].directive = statements[i].expression.raw.slice(1, -1);
+  }
+};
+pp$1.isDirectiveCandidate = function(statement) {
+  return (
+    statement.type === "ExpressionStatement" &&
+    statement.expression.type === "Literal" &&
+    typeof statement.expression.value === "string" &&
+    // Reject parenthesized strings.
+    (this.input[statement.start] === "\"" || this.input[statement.start] === "'")
+  )
+};
+
+var pp$2 = Parser.prototype;
+
+// Convert existing expression atom to assignable pattern
+// if possible.
+
+pp$2.toAssignable = function(node, isBinding, refDestructuringErrors) {
+  if (this.options.ecmaVersion >= 6 && node) {
+    switch (node.type) {
+    case "Identifier":
+      if (this.inAsync && node.name === "await")
+        { this.raise(node.start, "Cannot use 'await' as identifier inside an async function"); }
+      break
+
+    case "ObjectPattern":
+    case "ArrayPattern":
+    case "RestElement":
+      break
+
+    case "ObjectExpression":
+      node.type = "ObjectPattern";
+      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+      for (var i = 0, list = node.properties; i < list.length; i += 1) {
+        var prop = list[i];
+
+      this.toAssignable(prop, isBinding);
+        // Early error:
+        //   AssignmentRestProperty[Yield, Await] :
+        //     `...` DestructuringAssignmentTarget[Yield, Await]
+        //
+        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+        if (
+          prop.type === "RestElement" &&
+          (prop.argument.type === "ArrayPattern" || prop.argument.type === "ObjectPattern")
+        ) {
+          this.raise(prop.argument.start, "Unexpected token");
+        }
+      }
+      break
+
+    case "Property":
+      // AssignmentProperty has type === "Property"
+      if (node.kind !== "init") { this.raise(node.key.start, "Object pattern can't contain getter or setter"); }
+      this.toAssignable(node.value, isBinding);
+      break
+
+    case "ArrayExpression":
+      node.type = "ArrayPattern";
+      if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+      this.toAssignableList(node.elements, isBinding);
+      break
+
+    case "SpreadElement":
+      node.type = "RestElement";
+      this.toAssignable(node.argument, isBinding);
+      if (node.argument.type === "AssignmentPattern")
+        { this.raise(node.argument.start, "Rest elements cannot have a default value"); }
+      break
+
+    case "AssignmentExpression":
+      if (node.operator !== "=") { this.raise(node.left.end, "Only '=' operator can be used for specifying default value."); }
+      node.type = "AssignmentPattern";
+      delete node.operator;
+      this.toAssignable(node.left, isBinding);
+      // falls through to AssignmentPattern
+
+    case "AssignmentPattern":
+      break
+
+    case "ParenthesizedExpression":
+      this.toAssignable(node.expression, isBinding, refDestructuringErrors);
+      break
+
+    case "MemberExpression":
+      if (!isBinding) { break }
+
+    default:
+      this.raise(node.start, "Assigning to rvalue");
+    }
+  } else if (refDestructuringErrors) { this.checkPatternErrors(refDestructuringErrors, true); }
+  return node
+};
+
+// Convert list of expression atoms to binding list.
+
+pp$2.toAssignableList = function(exprList, isBinding) {
+  var end = exprList.length;
+  for (var i = 0; i < end; i++) {
+    var elt = exprList[i];
+    if (elt) { this.toAssignable(elt, isBinding); }
+  }
+  if (end) {
+    var last = exprList[end - 1];
+    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier")
+      { this.unexpected(last.argument.start); }
+  }
+  return exprList
+};
+
+// Parses spread element.
+
+pp$2.parseSpread = function(refDestructuringErrors) {
+  var node = this.startNode();
+  this.next();
+  node.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+  return this.finishNode(node, "SpreadElement")
+};
+
+pp$2.parseRestBinding = function() {
+  var node = this.startNode();
+  this.next();
+
+  // RestElement inside of a function parameter must be an identifier
+  if (this.options.ecmaVersion === 6 && this.type !== types.name)
+    { this.unexpected(); }
+
+  node.argument = this.parseBindingAtom();
+
+  return this.finishNode(node, "RestElement")
+};
+
+// Parses lvalue (assignable) atom.
+
+pp$2.parseBindingAtom = function() {
+  if (this.options.ecmaVersion >= 6) {
+    switch (this.type) {
+    case types.bracketL:
+      var node = this.startNode();
+      this.next();
+      node.elements = this.parseBindingList(types.bracketR, true, true);
+      return this.finishNode(node, "ArrayPattern")
+
+    case types.braceL:
+      return this.parseObj(true)
+    }
+  }
+  return this.parseIdent()
+};
+
+pp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma) {
+  var elts = [], first = true;
+  while (!this.eat(close)) {
+    if (first) { first = false; }
+    else { this.expect(types.comma); }
+    if (allowEmpty && this.type === types.comma) {
+      elts.push(null);
+    } else if (allowTrailingComma && this.afterTrailingComma(close)) {
+      break
+    } else if (this.type === types.ellipsis) {
+      var rest = this.parseRestBinding();
+      this.parseBindingListItem(rest);
+      elts.push(rest);
+      if (this.type === types.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+      this.expect(close);
+      break
+    } else {
+      var elem = this.parseMaybeDefault(this.start, this.startLoc);
+      this.parseBindingListItem(elem);
+      elts.push(elem);
+    }
+  }
+  return elts
+};
+
+pp$2.parseBindingListItem = function(param) {
+  return param
+};
+
+// Parses assignment pattern around given atom if possible.
+
+pp$2.parseMaybeDefault = function(startPos, startLoc, left) {
+  left = left || this.parseBindingAtom();
+  if (this.options.ecmaVersion < 6 || !this.eat(types.eq)) { return left }
+  var node = this.startNodeAt(startPos, startLoc);
+  node.left = left;
+  node.right = this.parseMaybeAssign();
+  return this.finishNode(node, "AssignmentPattern")
+};
+
+// Verify that a node is an lval — something that can be assigned
+// to.
+// bindingType can be either:
+// 'var' indicating that the lval creates a 'var' binding
+// 'let' indicating that the lval creates a lexical ('let' or 'const') binding
+// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references
+
+pp$2.checkLVal = function(expr, bindingType, checkClashes) {
+  if ( bindingType === void 0 ) bindingType = BIND_NONE;
+
+  switch (expr.type) {
+  case "Identifier":
+    if (bindingType === BIND_LEXICAL && expr.name === "let")
+      { this.raiseRecoverable(expr.start, "let is disallowed as a lexically bound name"); }
+    if (this.strict && this.reservedWordsStrictBind.test(expr.name))
+      { this.raiseRecoverable(expr.start, (bindingType ? "Binding " : "Assigning to ") + expr.name + " in strict mode"); }
+    if (checkClashes) {
+      if (has(checkClashes, expr.name))
+        { this.raiseRecoverable(expr.start, "Argument name clash"); }
+      checkClashes[expr.name] = true;
+    }
+    if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) { this.declareName(expr.name, bindingType, expr.start); }
+    break
+
+  case "MemberExpression":
+    if (bindingType) { this.raiseRecoverable(expr.start, "Binding member expression"); }
+    break
+
+  case "ObjectPattern":
+    for (var i = 0, list = expr.properties; i < list.length; i += 1)
+      {
+    var prop = list[i];
+
+    this.checkLVal(prop, bindingType, checkClashes);
+  }
+    break
+
+  case "Property":
+    // AssignmentProperty has type === "Property"
+    this.checkLVal(expr.value, bindingType, checkClashes);
+    break
+
+  case "ArrayPattern":
+    for (var i$1 = 0, list$1 = expr.elements; i$1 < list$1.length; i$1 += 1) {
+      var elem = list$1[i$1];
+
+    if (elem) { this.checkLVal(elem, bindingType, checkClashes); }
+    }
+    break
+
+  case "AssignmentPattern":
+    this.checkLVal(expr.left, bindingType, checkClashes);
+    break
+
+  case "RestElement":
+    this.checkLVal(expr.argument, bindingType, checkClashes);
+    break
+
+  case "ParenthesizedExpression":
+    this.checkLVal(expr.expression, bindingType, checkClashes);
+    break
+
+  default:
+    this.raise(expr.start, (bindingType ? "Binding" : "Assigning to") + " rvalue");
+  }
+};
+
+// A recursive descent parser operates by defining functions for all
+
+var pp$3 = Parser.prototype;
+
+// Check if property name clashes with already added.
+// Object/class getters and setters are not allowed to clash —
+// either with each other or with an init property — and in
+// strict mode, init properties are also not allowed to be repeated.
+
+pp$3.checkPropClash = function(prop, propHash, refDestructuringErrors) {
+  if (this.options.ecmaVersion >= 9 && prop.type === "SpreadElement")
+    { return }
+  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))
+    { return }
+  var key = prop.key;
+  var name;
+  switch (key.type) {
+  case "Identifier": name = key.name; break
+  case "Literal": name = String(key.value); break
+  default: return
+  }
+  var kind = prop.kind;
+  if (this.options.ecmaVersion >= 6) {
+    if (name === "__proto__" && kind === "init") {
+      if (propHash.proto) {
+        if (refDestructuringErrors && refDestructuringErrors.doubleProto < 0) { refDestructuringErrors.doubleProto = key.start; }
+        // Backwards-compat kludge. Can be removed in version 6.0
+        else { this.raiseRecoverable(key.start, "Redefinition of __proto__ property"); }
+      }
+      propHash.proto = true;
+    }
+    return
+  }
+  name = "$" + name;
+  var other = propHash[name];
+  if (other) {
+    var redefinition;
+    if (kind === "init") {
+      redefinition = this.strict && other.init || other.get || other.set;
+    } else {
+      redefinition = other.init || other[kind];
+    }
+    if (redefinition)
+      { this.raiseRecoverable(key.start, "Redefinition of property"); }
+  } else {
+    other = propHash[name] = {
+      init: false,
+      get: false,
+      set: false
+    };
+  }
+  other[kind] = true;
+};
+
+// ### Expression parsing
+
+// These nest, from the most general expression type at the top to
+// 'atomic', nondivisible expression types at the bottom. Most of
+// the functions will simply let the function(s) below them parse,
+// and, *if* the syntactic construct they handle is present, wrap
+// the AST node that the inner parser gave them in another node.
+
+// Parse a full expression. The optional arguments are used to
+// forbid the `in` operator (in for loops initalization expressions)
+// and provide reference for storing '=' operator inside shorthand
+// property assignment in contexts where both object expression
+// and object pattern might appear (so it's possible to raise
+// delayed syntax error at correct position).
+
+pp$3.parseExpression = function(noIn, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseMaybeAssign(noIn, refDestructuringErrors);
+  if (this.type === types.comma) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.expressions = [expr];
+    while (this.eat(types.comma)) { node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors)); }
+    return this.finishNode(node, "SequenceExpression")
+  }
+  return expr
+};
+
+// Parse an assignment expression. This includes applications of
+// operators like `+=`.
+
+pp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {
+  if (this.isContextual("yield")) {
+    if (this.inGenerator) { return this.parseYield(noIn) }
+    // The tokenizer will assume an expression is allowed after
+    // `yield`, but this isn't that kind of yield
+    else { this.exprAllowed = false; }
+  }
+
+  var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldShorthandAssign = -1;
+  if (refDestructuringErrors) {
+    oldParenAssign = refDestructuringErrors.parenthesizedAssign;
+    oldTrailingComma = refDestructuringErrors.trailingComma;
+    oldShorthandAssign = refDestructuringErrors.shorthandAssign;
+    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.shorthandAssign = -1;
+  } else {
+    refDestructuringErrors = new DestructuringErrors;
+    ownDestructuringErrors = true;
+  }
+
+  var startPos = this.start, startLoc = this.startLoc;
+  if (this.type === types.parenL || this.type === types.name)
+    { this.potentialArrowAt = this.start; }
+  var left = this.parseMaybeConditional(noIn, refDestructuringErrors);
+  if (afterLeftParse) { left = afterLeftParse.call(this, left, startPos, startLoc); }
+  if (this.type.isAssign) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.operator = this.value;
+    node.left = this.type === types.eq ? this.toAssignable(left, false, refDestructuringErrors) : left;
+    if (!ownDestructuringErrors) { DestructuringErrors.call(refDestructuringErrors); }
+    refDestructuringErrors.shorthandAssign = -1; // reset because shorthand default was used correctly
+    this.checkLVal(left);
+    this.next();
+    node.right = this.parseMaybeAssign(noIn);
+    return this.finishNode(node, "AssignmentExpression")
+  } else {
+    if (ownDestructuringErrors) { this.checkExpressionErrors(refDestructuringErrors, true); }
+  }
+  if (oldParenAssign > -1) { refDestructuringErrors.parenthesizedAssign = oldParenAssign; }
+  if (oldTrailingComma > -1) { refDestructuringErrors.trailingComma = oldTrailingComma; }
+  if (oldShorthandAssign > -1) { refDestructuringErrors.shorthandAssign = oldShorthandAssign; }
+  return left
+};
+
+// Parse a ternary conditional (`?:`) operator.
+
+pp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseExprOps(noIn, refDestructuringErrors);
+  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+  if (this.eat(types.question)) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.test = expr;
+    node.consequent = this.parseMaybeAssign();
+    this.expect(types.colon);
+    node.alternate = this.parseMaybeAssign(noIn);
+    return this.finishNode(node, "ConditionalExpression")
+  }
+  return expr
+};
+
+// Start the precedence parser.
+
+pp$3.parseExprOps = function(noIn, refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseMaybeUnary(refDestructuringErrors, false);
+  if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+  return expr.start === startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)
+};
+
+// Parse binary operators with the operator precedence parsing
+// algorithm. `left` is the left-hand side of the operator.
+// `minPrec` provides context that allows the function to stop and
+// defer further parser to one of its callers when it encounters an
+// operator that has a lower precedence than the set it is parsing.
+
+pp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {
+  var prec = this.type.binop;
+  if (prec != null && (!noIn || this.type !== types._in)) {
+    if (prec > minPrec) {
+      var logical = this.type === types.logicalOR || this.type === types.logicalAND;
+      var op = this.value;
+      this.next();
+      var startPos = this.start, startLoc = this.startLoc;
+      var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn);
+      var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical);
+      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)
+    }
+  }
+  return left
+};
+
+pp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) {
+  var node = this.startNodeAt(startPos, startLoc);
+  node.left = left;
+  node.operator = op;
+  node.right = right;
+  return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression")
+};
+
+// Parse unary operators, both prefix and postfix.
+
+pp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {
+  var startPos = this.start, startLoc = this.startLoc, expr;
+  if (this.isContextual("await") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {
+    expr = this.parseAwait();
+    sawUnary = true;
+  } else if (this.type.prefix) {
+    var node = this.startNode(), update = this.type === types.incDec;
+    node.operator = this.value;
+    node.prefix = true;
+    this.next();
+    node.argument = this.parseMaybeUnary(null, true);
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    if (update) { this.checkLVal(node.argument); }
+    else if (this.strict && node.operator === "delete" &&
+             node.argument.type === "Identifier")
+      { this.raiseRecoverable(node.start, "Deleting local variable in strict mode"); }
+    else { sawUnary = true; }
+    expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
+  } else {
+    expr = this.parseExprSubscripts(refDestructuringErrors);
+    if (this.checkExpressionErrors(refDestructuringErrors)) { return expr }
+    while (this.type.postfix && !this.canInsertSemicolon()) {
+      var node$1 = this.startNodeAt(startPos, startLoc);
+      node$1.operator = this.value;
+      node$1.prefix = false;
+      node$1.argument = expr;
+      this.checkLVal(expr);
+      this.next();
+      expr = this.finishNode(node$1, "UpdateExpression");
+    }
+  }
+
+  if (!sawUnary && this.eat(types.starstar))
+    { return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), "**", false) }
+  else
+    { return expr }
+};
+
+// Parse call, dot, and `[]`-subscript expressions.
+
+pp$3.parseExprSubscripts = function(refDestructuringErrors) {
+  var startPos = this.start, startLoc = this.startLoc;
+  var expr = this.parseExprAtom(refDestructuringErrors);
+  var skipArrowSubscripts = expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")";
+  if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) { return expr }
+  var result = this.parseSubscripts(expr, startPos, startLoc);
+  if (refDestructuringErrors && result.type === "MemberExpression") {
+    if (refDestructuringErrors.parenthesizedAssign >= result.start) { refDestructuringErrors.parenthesizedAssign = -1; }
+    if (refDestructuringErrors.parenthesizedBind >= result.start) { refDestructuringErrors.parenthesizedBind = -1; }
+  }
+  return result
+};
+
+pp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) {
+  var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" &&
+      this.lastTokEnd === base.end && !this.canInsertSemicolon() && this.input.slice(base.start, base.end) === "async";
+  while (true) {
+    var element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow);
+    if (element === base || element.type === "ArrowFunctionExpression") { return element }
+    base = element;
+  }
+};
+
+pp$3.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow) {
+  var computed = this.eat(types.bracketL);
+  if (computed || this.eat(types.dot)) {
+    var node = this.startNodeAt(startPos, startLoc);
+    node.object = base;
+    node.property = computed ? this.parseExpression() : this.parseIdent(this.options.allowReserved !== "never");
+    node.computed = !!computed;
+    if (computed) { this.expect(types.bracketR); }
+    base = this.finishNode(node, "MemberExpression");
+  } else if (!noCalls && this.eat(types.parenL)) {
+    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    this.awaitIdentPos = 0;
+    var exprList = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors);
+    if (maybeAsyncArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {
+      this.checkPatternErrors(refDestructuringErrors, false);
+      this.checkYieldAwaitInDefaultParams();
+      if (this.awaitIdentPos > 0)
+        { this.raise(this.awaitIdentPos, "Cannot use 'await' as identifier inside an async function"); }
+      this.yieldPos = oldYieldPos;
+      this.awaitPos = oldAwaitPos;
+      this.awaitIdentPos = oldAwaitIdentPos;
+      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)
+    }
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    this.yieldPos = oldYieldPos || this.yieldPos;
+    this.awaitPos = oldAwaitPos || this.awaitPos;
+    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos;
+    var node$1 = this.startNodeAt(startPos, startLoc);
+    node$1.callee = base;
+    node$1.arguments = exprList;
+    base = this.finishNode(node$1, "CallExpression");
+  } else if (this.type === types.backQuote) {
+    var node$2 = this.startNodeAt(startPos, startLoc);
+    node$2.tag = base;
+    node$2.quasi = this.parseTemplate({isTagged: true});
+    base = this.finishNode(node$2, "TaggedTemplateExpression");
+  }
+  return base
+};
+
+// Parse an atomic expression — either a single token that is an
+// expression, an expression started by a keyword like `function` or
+// `new`, or an expression wrapped in punctuation like `()`, `[]`,
+// or `{}`.
+
+pp$3.parseExprAtom = function(refDestructuringErrors) {
+  // If a division operator appears in an expression position, the
+  // tokenizer got confused, and we force it to read a regexp instead.
+  if (this.type === types.slash) { this.readRegexp(); }
+
+  var node, canBeArrow = this.potentialArrowAt === this.start;
+  switch (this.type) {
+  case types._super:
+    if (!this.allowSuper)
+      { this.raise(this.start, "'super' keyword outside a method"); }
+    node = this.startNode();
+    this.next();
+    if (this.type === types.parenL && !this.allowDirectSuper)
+      { this.raise(node.start, "super() call outside constructor of a subclass"); }
+    // The `super` keyword can appear at below:
+    // SuperProperty:
+    //     super [ Expression ]
+    //     super . IdentifierName
+    // SuperCall:
+    //     super Arguments
+    if (this.type !== types.dot && this.type !== types.bracketL && this.type !== types.parenL)
+      { this.unexpected(); }
+    return this.finishNode(node, "Super")
+
+  case types._this:
+    node = this.startNode();
+    this.next();
+    return this.finishNode(node, "ThisExpression")
+
+  case types.name:
+    var startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc;
+    var id = this.parseIdent(false);
+    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === "async" && !this.canInsertSemicolon() && this.eat(types._function))
+      { return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true) }
+    if (canBeArrow && !this.canInsertSemicolon()) {
+      if (this.eat(types.arrow))
+        { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false) }
+      if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === types.name && !containsEsc) {
+        id = this.parseIdent(false);
+        if (this.canInsertSemicolon() || !this.eat(types.arrow))
+          { this.unexpected(); }
+        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)
+      }
+    }
+    return id
+
+  case types.regexp:
+    var value = this.value;
+    node = this.parseLiteral(value.value);
+    node.regex = {pattern: value.pattern, flags: value.flags};
+    return node
+
+  case types.num: case types.string:
+    return this.parseLiteral(this.value)
+
+  case types._null: case types._true: case types._false:
+    node = this.startNode();
+    node.value = this.type === types._null ? null : this.type === types._true;
+    node.raw = this.type.keyword;
+    this.next();
+    return this.finishNode(node, "Literal")
+
+  case types.parenL:
+    var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow);
+    if (refDestructuringErrors) {
+      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))
+        { refDestructuringErrors.parenthesizedAssign = start; }
+      if (refDestructuringErrors.parenthesizedBind < 0)
+        { refDestructuringErrors.parenthesizedBind = start; }
+    }
+    return expr
+
+  case types.bracketL:
+    node = this.startNode();
+    this.next();
+    node.elements = this.parseExprList(types.bracketR, true, true, refDestructuringErrors);
+    return this.finishNode(node, "ArrayExpression")
+
+  case types.braceL:
+    return this.parseObj(false, refDestructuringErrors)
+
+  case types._function:
+    node = this.startNode();
+    this.next();
+    return this.parseFunction(node, 0)
+
+  case types._class:
+    return this.parseClass(this.startNode(), false)
+
+  case types._new:
+    return this.parseNew()
+
+  case types.backQuote:
+    return this.parseTemplate()
+
+  case types._import:
+    if (this.options.ecmaVersion >= 11) {
+      return this.parseExprImport()
+    } else {
+      return this.unexpected()
+    }
+
+  default:
+    this.unexpected();
+  }
+};
+
+pp$3.parseExprImport = function() {
+  var node = this.startNode();
+  this.next(); // skip `import`
+  switch (this.type) {
+  case types.parenL:
+    return this.parseDynamicImport(node)
+  default:
+    this.unexpected();
+  }
+};
+
+pp$3.parseDynamicImport = function(node) {
+  this.next(); // skip `(`
+
+  // Parse node.source.
+  node.source = this.parseMaybeAssign();
+
+  // Verify ending.
+  if (!this.eat(types.parenR)) {
+    var errorPos = this.start;
+    if (this.eat(types.comma) && this.eat(types.parenR)) {
+      this.raiseRecoverable(errorPos, "Trailing comma is not allowed in import()");
+    } else {
+      this.unexpected(errorPos);
+    }
+  }
+
+  return this.finishNode(node, "ImportExpression")
+};
+
+pp$3.parseLiteral = function(value) {
+  var node = this.startNode();
+  node.value = value;
+  node.raw = this.input.slice(this.start, this.end);
+  if (node.raw.charCodeAt(node.raw.length - 1) === 110) { node.bigint = node.raw.slice(0, -1); }
+  this.next();
+  return this.finishNode(node, "Literal")
+};
+
+pp$3.parseParenExpression = function() {
+  this.expect(types.parenL);
+  var val = this.parseExpression();
+  this.expect(types.parenR);
+  return val
+};
+
+pp$3.parseParenAndDistinguishExpression = function(canBeArrow) {
+  var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8;
+  if (this.options.ecmaVersion >= 6) {
+    this.next();
+
+    var innerStartPos = this.start, innerStartLoc = this.startLoc;
+    var exprList = [], first = true, lastIsComma = false;
+    var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart;
+    this.yieldPos = 0;
+    this.awaitPos = 0;
+    // Do not save awaitIdentPos to allow checking awaits nested in parameters
+    while (this.type !== types.parenR) {
+      first ? first = false : this.expect(types.comma);
+      if (allowTrailingComma && this.afterTrailingComma(types.parenR, true)) {
+        lastIsComma = true;
+        break
+      } else if (this.type === types.ellipsis) {
+        spreadStart = this.start;
+        exprList.push(this.parseParenItem(this.parseRestBinding()));
+        if (this.type === types.comma) { this.raise(this.start, "Comma is not permitted after the rest element"); }
+        break
+      } else {
+        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem));
+      }
+    }
+    var innerEndPos = this.start, innerEndLoc = this.startLoc;
+    this.expect(types.parenR);
+
+    if (canBeArrow && !this.canInsertSemicolon() && this.eat(types.arrow)) {
+      this.checkPatternErrors(refDestructuringErrors, false);
+      this.checkYieldAwaitInDefaultParams();
+      this.yieldPos = oldYieldPos;
+      this.awaitPos = oldAwaitPos;
+      return this.parseParenArrowList(startPos, startLoc, exprList)
+    }
+
+    if (!exprList.length || lastIsComma) { this.unexpected(this.lastTokStart); }
+    if (spreadStart) { this.unexpected(spreadStart); }
+    this.checkExpressionErrors(refDestructuringErrors, true);
+    this.yieldPos = oldYieldPos || this.yieldPos;
+    this.awaitPos = oldAwaitPos || this.awaitPos;
+
+    if (exprList.length > 1) {
+      val = this.startNodeAt(innerStartPos, innerStartLoc);
+      val.expressions = exprList;
+      this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
+    } else {
+      val = exprList[0];
+    }
+  } else {
+    val = this.parseParenExpression();
+  }
+
+  if (this.options.preserveParens) {
+    var par = this.startNodeAt(startPos, startLoc);
+    par.expression = val;
+    return this.finishNode(par, "ParenthesizedExpression")
+  } else {
+    return val
+  }
+};
+
+pp$3.parseParenItem = function(item) {
+  return item
+};
+
+pp$3.parseParenArrowList = function(startPos, startLoc, exprList) {
+  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)
+};
+
+// New's precedence is slightly tricky. It must allow its argument to
+// be a `[]` or dot subscript expression, but not a call — at least,
+// not without wrapping it in parentheses. Thus, it uses the noCalls
+// argument to parseSubscripts to prevent it from consuming the
+// argument list.
+
+var empty$1 = [];
+
+pp$3.parseNew = function() {
+  var node = this.startNode();
+  var meta = this.parseIdent(true);
+  if (this.options.ecmaVersion >= 6 && this.eat(types.dot)) {
+    node.meta = meta;
+    var containsEsc = this.containsEsc;
+    node.property = this.parseIdent(true);
+    if (node.property.name !== "target" || containsEsc)
+      { this.raiseRecoverable(node.property.start, "The only valid meta property for new is new.target"); }
+    if (!this.inNonArrowFunction())
+      { this.raiseRecoverable(node.start, "new.target can only be used in functions"); }
+    return this.finishNode(node, "MetaProperty")
+  }
+  var startPos = this.start, startLoc = this.startLoc, isImport = this.type === types._import;
+  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);
+  if (isImport && node.callee.type === "ImportExpression") {
+    this.raise(startPos, "Cannot use new with import()");
+  }
+  if (this.eat(types.parenL)) { node.arguments = this.parseExprList(types.parenR, this.options.ecmaVersion >= 8, false); }
+  else { node.arguments = empty$1; }
+  return this.finishNode(node, "NewExpression")
+};
+
+// Parse template expression.
+
+pp$3.parseTemplateElement = function(ref) {
+  var isTagged = ref.isTagged;
+
+  var elem = this.startNode();
+  if (this.type === types.invalidTemplate) {
+    if (!isTagged) {
+      this.raiseRecoverable(this.start, "Bad escape sequence in untagged template literal");
+    }
+    elem.value = {
+      raw: this.value,
+      cooked: null
+    };
+  } else {
+    elem.value = {
+      raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"),
+      cooked: this.value
+    };
+  }
+  this.next();
+  elem.tail = this.type === types.backQuote;
+  return this.finishNode(elem, "TemplateElement")
+};
+
+pp$3.parseTemplate = function(ref) {
+  if ( ref === void 0 ) ref = {};
+  var isTagged = ref.isTagged; if ( isTagged === void 0 ) isTagged = false;
+
+  var node = this.startNode();
+  this.next();
+  node.expressions = [];
+  var curElt = this.parseTemplateElement({isTagged: isTagged});
+  node.quasis = [curElt];
+  while (!curElt.tail) {
+    if (this.type === types.eof) { this.raise(this.pos, "Unterminated template literal"); }
+    this.expect(types.dollarBraceL);
+    node.expressions.push(this.parseExpression());
+    this.expect(types.braceR);
+    node.quasis.push(curElt = this.parseTemplateElement({isTagged: isTagged}));
+  }
+  this.next();
+  return this.finishNode(node, "TemplateLiteral")
+};
+
+pp$3.isAsyncProp = function(prop) {
+  return !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" &&
+    (this.type === types.name || this.type === types.num || this.type === types.string || this.type === types.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === types.star)) &&
+    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))
+};
+
+// Parse an object literal or binding pattern.
+
+pp$3.parseObj = function(isPattern, refDestructuringErrors) {
+  var node = this.startNode(), first = true, propHash = {};
+  node.properties = [];
+  this.next();
+  while (!this.eat(types.braceR)) {
+    if (!first) {
+      this.expect(types.comma);
+      if (this.afterTrailingComma(types.braceR)) { break }
+    } else { first = false; }
+
+    var prop = this.parseProperty(isPattern, refDestructuringErrors);
+    if (!isPattern) { this.checkPropClash(prop, propHash, refDestructuringErrors); }
+    node.properties.push(prop);
+  }
+  return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
+};
+
+pp$3.parseProperty = function(isPattern, refDestructuringErrors) {
+  var prop = this.startNode(), isGenerator, isAsync, startPos, startLoc;
+  if (this.options.ecmaVersion >= 9 && this.eat(types.ellipsis)) {
+    if (isPattern) {
+      prop.argument = this.parseIdent(false);
+      if (this.type === types.comma) {
+        this.raise(this.start, "Comma is not permitted after the rest element");
+      }
+      return this.finishNode(prop, "RestElement")
+    }
+    // To disallow parenthesized identifier via `this.toAssignable()`.
+    if (this.type === types.parenL && refDestructuringErrors) {
+      if (refDestructuringErrors.parenthesizedAssign < 0) {
+        refDestructuringErrors.parenthesizedAssign = this.start;
+      }
+      if (refDestructuringErrors.parenthesizedBind < 0) {
+        refDestructuringErrors.parenthesizedBind = this.start;
+      }
+    }
+    // Parse argument.
+    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors);
+    // To disallow trailing comma via `this.toAssignable()`.
+    if (this.type === types.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {
+      refDestructuringErrors.trailingComma = this.start;
+    }
+    // Finish
+    return this.finishNode(prop, "SpreadElement")
+  }
+  if (this.options.ecmaVersion >= 6) {
+    prop.method = false;
+    prop.shorthand = false;
+    if (isPattern || refDestructuringErrors) {
+      startPos = this.start;
+      startLoc = this.startLoc;
+    }
+    if (!isPattern)
+      { isGenerator = this.eat(types.star); }
+  }
+  var containsEsc = this.containsEsc;
+  this.parsePropertyName(prop);
+  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {
+    isAsync = true;
+    isGenerator = this.options.ecmaVersion >= 9 && this.eat(types.star);
+    this.parsePropertyName(prop, refDestructuringErrors);
+  } else {
+    isAsync = false;
+  }
+  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc);
+  return this.finishNode(prop, "Property")
+};
+
+pp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {
+  if ((isGenerator || isAsync) && this.type === types.colon)
+    { this.unexpected(); }
+
+  if (this.eat(types.colon)) {
+    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors);
+    prop.kind = "init";
+  } else if (this.options.ecmaVersion >= 6 && this.type === types.parenL) {
+    if (isPattern) { this.unexpected(); }
+    prop.kind = "init";
+    prop.method = true;
+    prop.value = this.parseMethod(isGenerator, isAsync);
+  } else if (!isPattern && !containsEsc &&
+             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" &&
+             (prop.key.name === "get" || prop.key.name === "set") &&
+             (this.type !== types.comma && this.type !== types.braceR)) {
+    if (isGenerator || isAsync) { this.unexpected(); }
+    prop.kind = prop.key.name;
+    this.parsePropertyName(prop);
+    prop.value = this.parseMethod(false);
+    var paramCount = prop.kind === "get" ? 0 : 1;
+    if (prop.value.params.length !== paramCount) {
+      var start = prop.value.start;
+      if (prop.kind === "get")
+        { this.raiseRecoverable(start, "getter should have no params"); }
+      else
+        { this.raiseRecoverable(start, "setter should have exactly one param"); }
+    } else {
+      if (prop.kind === "set" && prop.value.params[0].type === "RestElement")
+        { this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params"); }
+    }
+  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") {
+    if (isGenerator || isAsync) { this.unexpected(); }
+    this.checkUnreserved(prop.key);
+    if (prop.key.name === "await" && !this.awaitIdentPos)
+      { this.awaitIdentPos = startPos; }
+    prop.kind = "init";
+    if (isPattern) {
+      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+    } else if (this.type === types.eq && refDestructuringErrors) {
+      if (refDestructuringErrors.shorthandAssign < 0)
+        { refDestructuringErrors.shorthandAssign = this.start; }
+      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key);
+    } else {
+      prop.value = prop.key;
+    }
+    prop.shorthand = true;
+  } else { this.unexpected(); }
+};
+
+pp$3.parsePropertyName = function(prop) {
+  if (this.options.ecmaVersion >= 6) {
+    if (this.eat(types.bracketL)) {
+      prop.computed = true;
+      prop.key = this.parseMaybeAssign();
+      this.expect(types.bracketR);
+      return prop.key
+    } else {
+      prop.computed = false;
+    }
+  }
+  return prop.key = this.type === types.num || this.type === types.string ? this.parseExprAtom() : this.parseIdent(this.options.allowReserved !== "never")
+};
+
+// Initialize empty function node.
+
+pp$3.initFunction = function(node) {
+  node.id = null;
+  if (this.options.ecmaVersion >= 6) { node.generator = node.expression = false; }
+  if (this.options.ecmaVersion >= 8) { node.async = false; }
+};
+
+// Parse object or class method.
+
+pp$3.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {
+  var node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 6)
+    { node.generator = isGenerator; }
+  if (this.options.ecmaVersion >= 8)
+    { node.async = !!isAsync; }
+
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0));
+
+  this.expect(types.parenL);
+  node.params = this.parseBindingList(types.parenR, false, this.options.ecmaVersion >= 8);
+  this.checkYieldAwaitInDefaultParams();
+  this.parseFunctionBody(node, false, true);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, "FunctionExpression")
+};
+
+// Parse arrow function expression with given parameters.
+
+pp$3.parseArrowExpression = function(node, params, isAsync) {
+  var oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos;
+
+  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW);
+  this.initFunction(node);
+  if (this.options.ecmaVersion >= 8) { node.async = !!isAsync; }
+
+  this.yieldPos = 0;
+  this.awaitPos = 0;
+  this.awaitIdentPos = 0;
+
+  node.params = this.toAssignableList(params, true);
+  this.parseFunctionBody(node, true, false);
+
+  this.yieldPos = oldYieldPos;
+  this.awaitPos = oldAwaitPos;
+  this.awaitIdentPos = oldAwaitIdentPos;
+  return this.finishNode(node, "ArrowFunctionExpression")
+};
+
+// Parse function body and check parameters.
+
+pp$3.parseFunctionBody = function(node, isArrowFunction, isMethod) {
+  var isExpression = isArrowFunction && this.type !== types.braceL;
+  var oldStrict = this.strict, useStrict = false;
+
+  if (isExpression) {
+    node.body = this.parseMaybeAssign();
+    node.expression = true;
+    this.checkParams(node, false);
+  } else {
+    var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params);
+    if (!oldStrict || nonSimple) {
+      useStrict = this.strictDirective(this.end);
+      // If this is a strict mode function, verify that argument names
+      // are not repeated, and it does not try to bind the words `eval`
+      // or `arguments`.
+      if (useStrict && nonSimple)
+        { this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list"); }
+    }
+    // Start a new scope with regard to labels and the `inFunction`
+    // flag (restore them to their old value afterwards).
+    var oldLabels = this.labels;
+    this.labels = [];
+    if (useStrict) { this.strict = true; }
+
+    // Add the params to varDeclaredNames to ensure that an error is thrown
+    // if a let/const declaration in the function clashes with one of the params.
+    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params));
+    node.body = this.parseBlock(false);
+    node.expression = false;
+    this.adaptDirectivePrologue(node.body.body);
+    this.labels = oldLabels;
+  }
+  this.exitScope();
+
+  // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+  if (this.strict && node.id) { this.checkLVal(node.id, BIND_OUTSIDE); }
+  this.strict = oldStrict;
+};
+
+pp$3.isSimpleParamList = function(params) {
+  for (var i = 0, list = params; i < list.length; i += 1)
+    {
+    var param = list[i];
+
+    if (param.type !== "Identifier") { return false
+  } }
+  return true
+};
+
+// Checks function params for various disallowed patterns such as using "eval"
+// or "arguments" and duplicate parameters.
+
+pp$3.checkParams = function(node, allowDuplicates) {
+  var nameHash = {};
+  for (var i = 0, list = node.params; i < list.length; i += 1)
+    {
+    var param = list[i];
+
+    this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash);
+  }
+};
+
+// Parses a comma-separated list of expressions, and returns them as
+// an array. `close` is the token type that ends the list, and
+// `allowEmpty` can be turned on to allow subsequent commas with
+// nothing in between them to be parsed as `null` (which is needed
+// for array literals).
+
+pp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {
+  var elts = [], first = true;
+  while (!this.eat(close)) {
+    if (!first) {
+      this.expect(types.comma);
+      if (allowTrailingComma && this.afterTrailingComma(close)) { break }
+    } else { first = false; }
+
+    var elt = (void 0);
+    if (allowEmpty && this.type === types.comma)
+      { elt = null; }
+    else if (this.type === types.ellipsis) {
+      elt = this.parseSpread(refDestructuringErrors);
+      if (refDestructuringErrors && this.type === types.comma && refDestructuringErrors.trailingComma < 0)
+        { refDestructuringErrors.trailingComma = this.start; }
+    } else {
+      elt = this.parseMaybeAssign(false, refDestructuringErrors);
+    }
+    elts.push(elt);
+  }
+  return elts
+};
+
+pp$3.checkUnreserved = function(ref) {
+  var start = ref.start;
+  var end = ref.end;
+  var name = ref.name;
+
+  if (this.inGenerator && name === "yield")
+    { this.raiseRecoverable(start, "Cannot use 'yield' as identifier inside a generator"); }
+  if (this.inAsync && name === "await")
+    { this.raiseRecoverable(start, "Cannot use 'await' as identifier inside an async function"); }
+  if (this.keywords.test(name))
+    { this.raise(start, ("Unexpected keyword '" + name + "'")); }
+  if (this.options.ecmaVersion < 6 &&
+    this.input.slice(start, end).indexOf("\\") !== -1) { return }
+  var re = this.strict ? this.reservedWordsStrict : this.reservedWords;
+  if (re.test(name)) {
+    if (!this.inAsync && name === "await")
+      { this.raiseRecoverable(start, "Cannot use keyword 'await' outside an async function"); }
+    this.raiseRecoverable(start, ("The keyword '" + name + "' is reserved"));
+  }
+};
+
+// Parse the next token as an identifier. If `liberal` is true (used
+// when parsing properties), it will also convert keywords into
+// identifiers.
+
+pp$3.parseIdent = function(liberal, isBinding) {
+  var node = this.startNode();
+  if (this.type === types.name) {
+    node.name = this.value;
+  } else if (this.type.keyword) {
+    node.name = this.type.keyword;
+
+    // To fix https://github.com/acornjs/acorn/issues/575
+    // `class` and `function` keywords push new context into this.context.
+    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+    if ((node.name === "class" || node.name === "function") &&
+        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {
+      this.context.pop();
+    }
+  } else {
+    this.unexpected();
+  }
+  this.next();
+  this.finishNode(node, "Identifier");
+  if (!liberal) {
+    this.checkUnreserved(node);
+    if (node.name === "await" && !this.awaitIdentPos)
+      { this.awaitIdentPos = node.start; }
+  }
+  return node
+};
+
+// Parses yield expression inside generator.
+
+pp$3.parseYield = function(noIn) {
+  if (!this.yieldPos) { this.yieldPos = this.start; }
+
+  var node = this.startNode();
+  this.next();
+  if (this.type === types.semi || this.canInsertSemicolon() || (this.type !== types.star && !this.type.startsExpr)) {
+    node.delegate = false;
+    node.argument = null;
+  } else {
+    node.delegate = this.eat(types.star);
+    node.argument = this.parseMaybeAssign(noIn);
+  }
+  return this.finishNode(node, "YieldExpression")
+};
+
+pp$3.parseAwait = function() {
+  if (!this.awaitPos) { this.awaitPos = this.start; }
+
+  var node = this.startNode();
+  this.next();
+  node.argument = this.parseMaybeUnary(null, true);
+  return this.finishNode(node, "AwaitExpression")
+};
+
+var pp$4 = Parser.prototype;
+
+// This function is used to raise exceptions on parse errors. It
+// takes an offset integer (into the current `input`) to indicate
+// the location of the error, attaches the position to the end
+// of the error message, and then raises a `SyntaxError` with that
+// message.
+
+pp$4.raise = function(pos, message) {
+  var loc = getLineInfo(this.input, pos);
+  message += " (" + loc.line + ":" + loc.column + ")";
+  var err = new SyntaxError(message);
+  err.pos = pos; err.loc = loc; err.raisedAt = this.pos;
+  throw err
+};
+
+pp$4.raiseRecoverable = pp$4.raise;
+
+pp$4.curPosition = function() {
+  if (this.options.locations) {
+    return new Position(this.curLine, this.pos - this.lineStart)
+  }
+};
+
+var pp$5 = Parser.prototype;
+
+var Scope = function Scope(flags) {
+  this.flags = flags;
+  // A list of var-declared names in the current lexical scope
+  this.var = [];
+  // A list of lexically-declared names in the current lexical scope
+  this.lexical = [];
+  // A list of lexically-declared FunctionDeclaration names in the current lexical scope
+  this.functions = [];
+};
+
+// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+
+pp$5.enterScope = function(flags) {
+  this.scopeStack.push(new Scope(flags));
+};
+
+pp$5.exitScope = function() {
+  this.scopeStack.pop();
+};
+
+// The spec says:
+// > At the top level of a function, or script, function declarations are
+// > treated like var declarations rather than like lexical declarations.
+pp$5.treatFunctionsAsVarInScope = function(scope) {
+  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)
+};
+
+pp$5.declareName = function(name, bindingType, pos) {
+  var redeclared = false;
+  if (bindingType === BIND_LEXICAL) {
+    var scope = this.currentScope();
+    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1;
+    scope.lexical.push(name);
+    if (this.inModule && (scope.flags & SCOPE_TOP))
+      { delete this.undefinedExports[name]; }
+  } else if (bindingType === BIND_SIMPLE_CATCH) {
+    var scope$1 = this.currentScope();
+    scope$1.lexical.push(name);
+  } else if (bindingType === BIND_FUNCTION) {
+    var scope$2 = this.currentScope();
+    if (this.treatFunctionsAsVar)
+      { redeclared = scope$2.lexical.indexOf(name) > -1; }
+    else
+      { redeclared = scope$2.lexical.indexOf(name) > -1 || scope$2.var.indexOf(name) > -1; }
+    scope$2.functions.push(name);
+  } else {
+    for (var i = this.scopeStack.length - 1; i >= 0; --i) {
+      var scope$3 = this.scopeStack[i];
+      if (scope$3.lexical.indexOf(name) > -1 && !((scope$3.flags & SCOPE_SIMPLE_CATCH) && scope$3.lexical[0] === name) ||
+          !this.treatFunctionsAsVarInScope(scope$3) && scope$3.functions.indexOf(name) > -1) {
+        redeclared = true;
+        break
+      }
+      scope$3.var.push(name);
+      if (this.inModule && (scope$3.flags & SCOPE_TOP))
+        { delete this.undefinedExports[name]; }
+      if (scope$3.flags & SCOPE_VAR) { break }
+    }
+  }
+  if (redeclared) { this.raiseRecoverable(pos, ("Identifier '" + name + "' has already been declared")); }
+};
+
+pp$5.checkLocalExport = function(id) {
+  // scope.functions must be empty as Module code is always strict.
+  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&
+      this.scopeStack[0].var.indexOf(id.name) === -1) {
+    this.undefinedExports[id.name] = id;
+  }
+};
+
+pp$5.currentScope = function() {
+  return this.scopeStack[this.scopeStack.length - 1]
+};
+
+pp$5.currentVarScope = function() {
+  for (var i = this.scopeStack.length - 1;; i--) {
+    var scope = this.scopeStack[i];
+    if (scope.flags & SCOPE_VAR) { return scope }
+  }
+};
+
+// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+pp$5.currentThisScope = function() {
+  for (var i = this.scopeStack.length - 1;; i--) {
+    var scope = this.scopeStack[i];
+    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) { return scope }
+  }
+};
+
+var Node = function Node(parser, pos, loc) {
+  this.type = "";
+  this.start = pos;
+  this.end = 0;
+  if (parser.options.locations)
+    { this.loc = new SourceLocation(parser, loc); }
+  if (parser.options.directSourceFile)
+    { this.sourceFile = parser.options.directSourceFile; }
+  if (parser.options.ranges)
+    { this.range = [pos, 0]; }
+};
+
+// Start an AST node, attaching a start offset.
+
+var pp$6 = Parser.prototype;
+
+pp$6.startNode = function() {
+  return new Node(this, this.start, this.startLoc)
+};
+
+pp$6.startNodeAt = function(pos, loc) {
+  return new Node(this, pos, loc)
+};
+
+// Finish an AST node, adding `type` and `end` properties.
+
+function finishNodeAt(node, type, pos, loc) {
+  node.type = type;
+  node.end = pos;
+  if (this.options.locations)
+    { node.loc.end = loc; }
+  if (this.options.ranges)
+    { node.range[1] = pos; }
+  return node
+}
+
+pp$6.finishNode = function(node, type) {
+  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)
+};
+
+// Finish node at given position
+
+pp$6.finishNodeAt = function(node, type, pos, loc) {
+  return finishNodeAt.call(this, node, type, pos, loc)
+};
+
+// The algorithm used to determine whether a regexp can appear at a
+
+var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) {
+  this.token = token;
+  this.isExpr = !!isExpr;
+  this.preserveSpace = !!preserveSpace;
+  this.override = override;
+  this.generator = !!generator;
+};
+
+var types$1 = {
+  b_stat: new TokContext("{", false),
+  b_expr: new TokContext("{", true),
+  b_tmpl: new TokContext("${", false),
+  p_stat: new TokContext("(", false),
+  p_expr: new TokContext("(", true),
+  q_tmpl: new TokContext("`", true, true, function (p) { return p.tryReadTemplateToken(); }),
+  f_stat: new TokContext("function", false),
+  f_expr: new TokContext("function", true),
+  f_expr_gen: new TokContext("function", true, false, null, true),
+  f_gen: new TokContext("function", false, false, null, true)
+};
+
+var pp$7 = Parser.prototype;
+
+pp$7.initialContext = function() {
+  return [types$1.b_stat]
+};
+
+pp$7.braceIsBlock = function(prevType) {
+  var parent = this.curContext();
+  if (parent === types$1.f_expr || parent === types$1.f_stat)
+    { return true }
+  if (prevType === types.colon && (parent === types$1.b_stat || parent === types$1.b_expr))
+    { return !parent.isExpr }
+
+  // The check for `tt.name && exprAllowed` detects whether we are
+  // after a `yield` or `of` construct. See the `updateContext` for
+  // `tt.name`.
+  if (prevType === types._return || prevType === types.name && this.exprAllowed)
+    { return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) }
+  if (prevType === types._else || prevType === types.semi || prevType === types.eof || prevType === types.parenR || prevType === types.arrow)
+    { return true }
+  if (prevType === types.braceL)
+    { return parent === types$1.b_stat }
+  if (prevType === types._var || prevType === types._const || prevType === types.name)
+    { return false }
+  return !this.exprAllowed
+};
+
+pp$7.inGeneratorContext = function() {
+  for (var i = this.context.length - 1; i >= 1; i--) {
+    var context = this.context[i];
+    if (context.token === "function")
+      { return context.generator }
+  }
+  return false
+};
+
+pp$7.updateContext = function(prevType) {
+  var update, type = this.type;
+  if (type.keyword && prevType === types.dot)
+    { this.exprAllowed = false; }
+  else if (update = type.updateContext)
+    { update.call(this, prevType); }
+  else
+    { this.exprAllowed = type.beforeExpr; }
+};
+
+// Token-specific context update code
+
+types.parenR.updateContext = types.braceR.updateContext = function() {
+  if (this.context.length === 1) {
+    this.exprAllowed = true;
+    return
+  }
+  var out = this.context.pop();
+  if (out === types$1.b_stat && this.curContext().token === "function") {
+    out = this.context.pop();
+  }
+  this.exprAllowed = !out.isExpr;
+};
+
+types.braceL.updateContext = function(prevType) {
+  this.context.push(this.braceIsBlock(prevType) ? types$1.b_stat : types$1.b_expr);
+  this.exprAllowed = true;
+};
+
+types.dollarBraceL.updateContext = function() {
+  this.context.push(types$1.b_tmpl);
+  this.exprAllowed = true;
+};
+
+types.parenL.updateContext = function(prevType) {
+  var statementParens = prevType === types._if || prevType === types._for || prevType === types._with || prevType === types._while;
+  this.context.push(statementParens ? types$1.p_stat : types$1.p_expr);
+  this.exprAllowed = true;
+};
+
+types.incDec.updateContext = function() {
+  // tokExprAllowed stays unchanged
+};
+
+types._function.updateContext = types._class.updateContext = function(prevType) {
+  if (prevType.beforeExpr && prevType !== types.semi && prevType !== types._else &&
+      !(prevType === types._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&
+      !((prevType === types.colon || prevType === types.braceL) && this.curContext() === types$1.b_stat))
+    { this.context.push(types$1.f_expr); }
+  else
+    { this.context.push(types$1.f_stat); }
+  this.exprAllowed = false;
+};
+
+types.backQuote.updateContext = function() {
+  if (this.curContext() === types$1.q_tmpl)
+    { this.context.pop(); }
+  else
+    { this.context.push(types$1.q_tmpl); }
+  this.exprAllowed = false;
+};
+
+types.star.updateContext = function(prevType) {
+  if (prevType === types._function) {
+    var index = this.context.length - 1;
+    if (this.context[index] === types$1.f_expr)
+      { this.context[index] = types$1.f_expr_gen; }
+    else
+      { this.context[index] = types$1.f_gen; }
+  }
+  this.exprAllowed = true;
+};
+
+types.name.updateContext = function(prevType) {
+  var allowed = false;
+  if (this.options.ecmaVersion >= 6 && prevType !== types.dot) {
+    if (this.value === "of" && !this.exprAllowed ||
+        this.value === "yield" && this.inGeneratorContext())
+      { allowed = true; }
+  }
+  this.exprAllowed = allowed;
+};
+
+// This file contains Unicode properties extracted from the ECMAScript
+// specification. The lists are extracted like so:
+// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+
+// #table-binary-unicode-properties
+var ecma9BinaryProperties = "ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";
+var ecma10BinaryProperties = ecma9BinaryProperties + " Extended_Pictographic";
+var ecma11BinaryProperties = ecma10BinaryProperties;
+var unicodeBinaryProperties = {
+  9: ecma9BinaryProperties,
+  10: ecma10BinaryProperties,
+  11: ecma11BinaryProperties
+};
+
+// #table-unicode-general-category-values
+var unicodeGeneralCategoryValues = "Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";
+
+// #table-unicode-script-values
+var ecma9ScriptValues = "Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";
+var ecma10ScriptValues = ecma9ScriptValues + " Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";
+var ecma11ScriptValues = ecma10ScriptValues + " Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";
+var unicodeScriptValues = {
+  9: ecma9ScriptValues,
+  10: ecma10ScriptValues,
+  11: ecma11ScriptValues
+};
+
+var data = {};
+function buildUnicodeData(ecmaVersion) {
+  var d = data[ecmaVersion] = {
+    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + " " + unicodeGeneralCategoryValues),
+    nonBinary: {
+      General_Category: wordsRegexp(unicodeGeneralCategoryValues),
+      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])
+    }
+  };
+  d.nonBinary.Script_Extensions = d.nonBinary.Script;
+
+  d.nonBinary.gc = d.nonBinary.General_Category;
+  d.nonBinary.sc = d.nonBinary.Script;
+  d.nonBinary.scx = d.nonBinary.Script_Extensions;
+}
+buildUnicodeData(9);
+buildUnicodeData(10);
+buildUnicodeData(11);
+
+var pp$8 = Parser.prototype;
+
+var RegExpValidationState = function RegExpValidationState(parser) {
+  this.parser = parser;
+  this.validFlags = "gim" + (parser.options.ecmaVersion >= 6 ? "uy" : "") + (parser.options.ecmaVersion >= 9 ? "s" : "");
+  this.unicodeProperties = data[parser.options.ecmaVersion >= 11 ? 11 : parser.options.ecmaVersion];
+  this.source = "";
+  this.flags = "";
+  this.start = 0;
+  this.switchU = false;
+  this.switchN = false;
+  this.pos = 0;
+  this.lastIntValue = 0;
+  this.lastStringValue = "";
+  this.lastAssertionIsQuantifiable = false;
+  this.numCapturingParens = 0;
+  this.maxBackReference = 0;
+  this.groupNames = [];
+  this.backReferenceNames = [];
+};
+
+RegExpValidationState.prototype.reset = function reset (start, pattern, flags) {
+  var unicode = flags.indexOf("u") !== -1;
+  this.start = start | 0;
+  this.source = pattern + "";
+  this.flags = flags;
+  this.switchU = unicode && this.parser.options.ecmaVersion >= 6;
+  this.switchN = unicode && this.parser.options.ecmaVersion >= 9;
+};
+
+RegExpValidationState.prototype.raise = function raise (message) {
+  this.parser.raiseRecoverable(this.start, ("Invalid regular expression: /" + (this.source) + "/: " + message));
+};
+
+// If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+// Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+RegExpValidationState.prototype.at = function at (i) {
+  var s = this.source;
+  var l = s.length;
+  if (i >= l) {
+    return -1
+  }
+  var c = s.charCodeAt(i);
+  if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+    return c
+  }
+  return (c << 10) + s.charCodeAt(i + 1) - 0x35FDC00
+};
+
+RegExpValidationState.prototype.nextIndex = function nextIndex (i) {
+  var s = this.source;
+  var l = s.length;
+  if (i >= l) {
+    return l
+  }
+  var c = s.charCodeAt(i);
+  if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {
+    return i + 1
+  }
+  return i + 2
+};
+
+RegExpValidationState.prototype.current = function current () {
+  return this.at(this.pos)
+};
+
+RegExpValidationState.prototype.lookahead = function lookahead () {
+  return this.at(this.nextIndex(this.pos))
+};
+
+RegExpValidationState.prototype.advance = function advance () {
+  this.pos = this.nextIndex(this.pos);
+};
+
+RegExpValidationState.prototype.eat = function eat (ch) {
+  if (this.current() === ch) {
+    this.advance();
+    return true
+  }
+  return false
+};
+
+function codePointToString(ch) {
+  if (ch <= 0xFFFF) { return String.fromCharCode(ch) }
+  ch -= 0x10000;
+  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)
+}
+
+/**
+ * Validate the flags part of a given RegExpLiteral.
+ *
+ * @param {RegExpValidationState} state The state to validate RegExp.
+ * @returns {void}
+ */
+pp$8.validateRegExpFlags = function(state) {
+  var validFlags = state.validFlags;
+  var flags = state.flags;
+
+  for (var i = 0; i < flags.length; i++) {
+    var flag = flags.charAt(i);
+    if (validFlags.indexOf(flag) === -1) {
+      this.raise(state.start, "Invalid regular expression flag");
+    }
+    if (flags.indexOf(flag, i + 1) > -1) {
+      this.raise(state.start, "Duplicate regular expression flag");
+    }
+  }
+};
+
+/**
+ * Validate the pattern part of a given RegExpLiteral.
+ *
+ * @param {RegExpValidationState} state The state to validate RegExp.
+ * @returns {void}
+ */
+pp$8.validateRegExpPattern = function(state) {
+  this.regexp_pattern(state);
+
+  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+  // parsing contains a |GroupName|, reparse with the goal symbol
+  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+  // exception if _P_ did not conform to the grammar, if any elements of _P_
+  // were not matched by the parse, or if any Early Error conditions exist.
+  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {
+    state.switchN = true;
+    this.regexp_pattern(state);
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+pp$8.regexp_pattern = function(state) {
+  state.pos = 0;
+  state.lastIntValue = 0;
+  state.lastStringValue = "";
+  state.lastAssertionIsQuantifiable = false;
+  state.numCapturingParens = 0;
+  state.maxBackReference = 0;
+  state.groupNames.length = 0;
+  state.backReferenceNames.length = 0;
+
+  this.regexp_disjunction(state);
+
+  if (state.pos !== state.source.length) {
+    // Make the same messages as V8.
+    if (state.eat(0x29 /* ) */)) {
+      state.raise("Unmatched ')'");
+    }
+    if (state.eat(0x5D /* [ */) || state.eat(0x7D /* } */)) {
+      state.raise("Lone quantifier brackets");
+    }
+  }
+  if (state.maxBackReference > state.numCapturingParens) {
+    state.raise("Invalid escape");
+  }
+  for (var i = 0, list = state.backReferenceNames; i < list.length; i += 1) {
+    var name = list[i];
+
+    if (state.groupNames.indexOf(name) === -1) {
+      state.raise("Invalid named capture referenced");
+    }
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+pp$8.regexp_disjunction = function(state) {
+  this.regexp_alternative(state);
+  while (state.eat(0x7C /* | */)) {
+    this.regexp_alternative(state);
+  }
+
+  // Make the same message as V8.
+  if (this.regexp_eatQuantifier(state, true)) {
+    state.raise("Nothing to repeat");
+  }
+  if (state.eat(0x7B /* { */)) {
+    state.raise("Lone quantifier brackets");
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+pp$8.regexp_alternative = function(state) {
+  while (state.pos < state.source.length && this.regexp_eatTerm(state))
+    { }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+pp$8.regexp_eatTerm = function(state) {
+  if (this.regexp_eatAssertion(state)) {
+    // Handle `QuantifiableAssertion Quantifier` alternative.
+    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+    // is a QuantifiableAssertion.
+    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {
+      // Make the same message as V8.
+      if (state.switchU) {
+        state.raise("Invalid quantifier");
+      }
+    }
+    return true
+  }
+
+  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {
+    this.regexp_eatQuantifier(state);
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+pp$8.regexp_eatAssertion = function(state) {
+  var start = state.pos;
+  state.lastAssertionIsQuantifiable = false;
+
+  // ^, $
+  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {
+    return true
+  }
+
+  // \b \B
+  if (state.eat(0x5C /* \ */)) {
+    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {
+      return true
+    }
+    state.pos = start;
+  }
+
+  // Lookahead / Lookbehind
+  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {
+    var lookbehind = false;
+    if (this.options.ecmaVersion >= 9) {
+      lookbehind = state.eat(0x3C /* < */);
+    }
+    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {
+      this.regexp_disjunction(state);
+      if (!state.eat(0x29 /* ) */)) {
+        state.raise("Unterminated group");
+      }
+      state.lastAssertionIsQuantifiable = !lookbehind;
+      return true
+    }
+  }
+
+  state.pos = start;
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+pp$8.regexp_eatQuantifier = function(state, noError) {
+  if ( noError === void 0 ) noError = false;
+
+  if (this.regexp_eatQuantifierPrefix(state, noError)) {
+    state.eat(0x3F /* ? */);
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+pp$8.regexp_eatQuantifierPrefix = function(state, noError) {
+  return (
+    state.eat(0x2A /* * */) ||
+    state.eat(0x2B /* + */) ||
+    state.eat(0x3F /* ? */) ||
+    this.regexp_eatBracedQuantifier(state, noError)
+  )
+};
+pp$8.regexp_eatBracedQuantifier = function(state, noError) {
+  var start = state.pos;
+  if (state.eat(0x7B /* { */)) {
+    var min = 0, max = -1;
+    if (this.regexp_eatDecimalDigits(state)) {
+      min = state.lastIntValue;
+      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {
+        max = state.lastIntValue;
+      }
+      if (state.eat(0x7D /* } */)) {
+        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+        if (max !== -1 && max < min && !noError) {
+          state.raise("numbers out of order in {} quantifier");
+        }
+        return true
+      }
+    }
+    if (state.switchU && !noError) {
+      state.raise("Incomplete quantifier");
+    }
+    state.pos = start;
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+pp$8.regexp_eatAtom = function(state) {
+  return (
+    this.regexp_eatPatternCharacters(state) ||
+    state.eat(0x2E /* . */) ||
+    this.regexp_eatReverseSolidusAtomEscape(state) ||
+    this.regexp_eatCharacterClass(state) ||
+    this.regexp_eatUncapturingGroup(state) ||
+    this.regexp_eatCapturingGroup(state)
+  )
+};
+pp$8.regexp_eatReverseSolidusAtomEscape = function(state) {
+  var start = state.pos;
+  if (state.eat(0x5C /* \ */)) {
+    if (this.regexp_eatAtomEscape(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$8.regexp_eatUncapturingGroup = function(state) {
+  var start = state.pos;
+  if (state.eat(0x28 /* ( */)) {
+    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {
+      this.regexp_disjunction(state);
+      if (state.eat(0x29 /* ) */)) {
+        return true
+      }
+      state.raise("Unterminated group");
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$8.regexp_eatCapturingGroup = function(state) {
+  if (state.eat(0x28 /* ( */)) {
+    if (this.options.ecmaVersion >= 9) {
+      this.regexp_groupSpecifier(state);
+    } else if (state.current() === 0x3F /* ? */) {
+      state.raise("Invalid group");
+    }
+    this.regexp_disjunction(state);
+    if (state.eat(0x29 /* ) */)) {
+      state.numCapturingParens += 1;
+      return true
+    }
+    state.raise("Unterminated group");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+pp$8.regexp_eatExtendedAtom = function(state) {
+  return (
+    state.eat(0x2E /* . */) ||
+    this.regexp_eatReverseSolidusAtomEscape(state) ||
+    this.regexp_eatCharacterClass(state) ||
+    this.regexp_eatUncapturingGroup(state) ||
+    this.regexp_eatCapturingGroup(state) ||
+    this.regexp_eatInvalidBracedQuantifier(state) ||
+    this.regexp_eatExtendedPatternCharacter(state)
+  )
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+pp$8.regexp_eatInvalidBracedQuantifier = function(state) {
+  if (this.regexp_eatBracedQuantifier(state, true)) {
+    state.raise("Nothing to repeat");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+pp$8.regexp_eatSyntaxCharacter = function(state) {
+  var ch = state.current();
+  if (isSyntaxCharacter(ch)) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+  return false
+};
+function isSyntaxCharacter(ch) {
+  return (
+    ch === 0x24 /* $ */ ||
+    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||
+    ch === 0x2E /* . */ ||
+    ch === 0x3F /* ? */ ||
+    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||
+    ch >= 0x7B /* { */ && ch <= 0x7D /* } */
+  )
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+// But eat eager.
+pp$8.regexp_eatPatternCharacters = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {
+    state.advance();
+  }
+  return state.pos !== start
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+pp$8.regexp_eatExtendedPatternCharacter = function(state) {
+  var ch = state.current();
+  if (
+    ch !== -1 &&
+    ch !== 0x24 /* $ */ &&
+    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&
+    ch !== 0x2E /* . */ &&
+    ch !== 0x3F /* ? */ &&
+    ch !== 0x5B /* [ */ &&
+    ch !== 0x5E /* ^ */ &&
+    ch !== 0x7C /* | */
+  ) {
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// GroupSpecifier[U] ::
+//   [empty]
+//   `?` GroupName[?U]
+pp$8.regexp_groupSpecifier = function(state) {
+  if (state.eat(0x3F /* ? */)) {
+    if (this.regexp_eatGroupName(state)) {
+      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {
+        state.raise("Duplicate capture group name");
+      }
+      state.groupNames.push(state.lastStringValue);
+      return
+    }
+    state.raise("Invalid group");
+  }
+};
+
+// GroupName[U] ::
+//   `<` RegExpIdentifierName[?U] `>`
+// Note: this updates `state.lastStringValue` property with the eaten name.
+pp$8.regexp_eatGroupName = function(state) {
+  state.lastStringValue = "";
+  if (state.eat(0x3C /* < */)) {
+    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {
+      return true
+    }
+    state.raise("Invalid capture group name");
+  }
+  return false
+};
+
+// RegExpIdentifierName[U] ::
+//   RegExpIdentifierStart[?U]
+//   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]
+// Note: this updates `state.lastStringValue` property with the eaten name.
+pp$8.regexp_eatRegExpIdentifierName = function(state) {
+  state.lastStringValue = "";
+  if (this.regexp_eatRegExpIdentifierStart(state)) {
+    state.lastStringValue += codePointToString(state.lastIntValue);
+    while (this.regexp_eatRegExpIdentifierPart(state)) {
+      state.lastStringValue += codePointToString(state.lastIntValue);
+    }
+    return true
+  }
+  return false
+};
+
+// RegExpIdentifierStart[U] ::
+//   UnicodeIDStart
+//   `$`
+//   `_`
+//   `\` RegExpUnicodeEscapeSequence[?U]
+pp$8.regexp_eatRegExpIdentifierStart = function(state) {
+  var start = state.pos;
+  var ch = state.current();
+  state.advance();
+
+  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+    ch = state.lastIntValue;
+  }
+  if (isRegExpIdentifierStart(ch)) {
+    state.lastIntValue = ch;
+    return true
+  }
+
+  state.pos = start;
+  return false
+};
+function isRegExpIdentifierStart(ch) {
+  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */
+}
+
+// RegExpIdentifierPart[U] ::
+//   UnicodeIDContinue
+//   `$`
+//   `_`
+//   `\` RegExpUnicodeEscapeSequence[?U]
+//   <ZWNJ>
+//   <ZWJ>
+pp$8.regexp_eatRegExpIdentifierPart = function(state) {
+  var start = state.pos;
+  var ch = state.current();
+  state.advance();
+
+  if (ch === 0x5C /* \ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {
+    ch = state.lastIntValue;
+  }
+  if (isRegExpIdentifierPart(ch)) {
+    state.lastIntValue = ch;
+    return true
+  }
+
+  state.pos = start;
+  return false
+};
+function isRegExpIdentifierPart(ch) {
+  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+pp$8.regexp_eatAtomEscape = function(state) {
+  if (
+    this.regexp_eatBackReference(state) ||
+    this.regexp_eatCharacterClassEscape(state) ||
+    this.regexp_eatCharacterEscape(state) ||
+    (state.switchN && this.regexp_eatKGroupName(state))
+  ) {
+    return true
+  }
+  if (state.switchU) {
+    // Make the same message as V8.
+    if (state.current() === 0x63 /* c */) {
+      state.raise("Invalid unicode escape");
+    }
+    state.raise("Invalid escape");
+  }
+  return false
+};
+pp$8.regexp_eatBackReference = function(state) {
+  var start = state.pos;
+  if (this.regexp_eatDecimalEscape(state)) {
+    var n = state.lastIntValue;
+    if (state.switchU) {
+      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+      if (n > state.maxBackReference) {
+        state.maxBackReference = n;
+      }
+      return true
+    }
+    if (n <= state.numCapturingParens) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$8.regexp_eatKGroupName = function(state) {
+  if (state.eat(0x6B /* k */)) {
+    if (this.regexp_eatGroupName(state)) {
+      state.backReferenceNames.push(state.lastStringValue);
+      return true
+    }
+    state.raise("Invalid named reference");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+pp$8.regexp_eatCharacterEscape = function(state) {
+  return (
+    this.regexp_eatControlEscape(state) ||
+    this.regexp_eatCControlLetter(state) ||
+    this.regexp_eatZero(state) ||
+    this.regexp_eatHexEscapeSequence(state) ||
+    this.regexp_eatRegExpUnicodeEscapeSequence(state) ||
+    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||
+    this.regexp_eatIdentityEscape(state)
+  )
+};
+pp$8.regexp_eatCControlLetter = function(state) {
+  var start = state.pos;
+  if (state.eat(0x63 /* c */)) {
+    if (this.regexp_eatControlLetter(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+  return false
+};
+pp$8.regexp_eatZero = function(state) {
+  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {
+    state.lastIntValue = 0;
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+pp$8.regexp_eatControlEscape = function(state) {
+  var ch = state.current();
+  if (ch === 0x74 /* t */) {
+    state.lastIntValue = 0x09; /* \t */
+    state.advance();
+    return true
+  }
+  if (ch === 0x6E /* n */) {
+    state.lastIntValue = 0x0A; /* \n */
+    state.advance();
+    return true
+  }
+  if (ch === 0x76 /* v */) {
+    state.lastIntValue = 0x0B; /* \v */
+    state.advance();
+    return true
+  }
+  if (ch === 0x66 /* f */) {
+    state.lastIntValue = 0x0C; /* \f */
+    state.advance();
+    return true
+  }
+  if (ch === 0x72 /* r */) {
+    state.lastIntValue = 0x0D; /* \r */
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+pp$8.regexp_eatControlLetter = function(state) {
+  var ch = state.current();
+  if (isControlLetter(ch)) {
+    state.lastIntValue = ch % 0x20;
+    state.advance();
+    return true
+  }
+  return false
+};
+function isControlLetter(ch) {
+  return (
+    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||
+    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)
+  )
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+pp$8.regexp_eatRegExpUnicodeEscapeSequence = function(state) {
+  var start = state.pos;
+
+  if (state.eat(0x75 /* u */)) {
+    if (this.regexp_eatFixedHexDigits(state, 4)) {
+      var lead = state.lastIntValue;
+      if (state.switchU && lead >= 0xD800 && lead <= 0xDBFF) {
+        var leadSurrogateEnd = state.pos;
+        if (state.eat(0x5C /* \ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {
+          var trail = state.lastIntValue;
+          if (trail >= 0xDC00 && trail <= 0xDFFF) {
+            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000;
+            return true
+          }
+        }
+        state.pos = leadSurrogateEnd;
+        state.lastIntValue = lead;
+      }
+      return true
+    }
+    if (
+      state.switchU &&
+      state.eat(0x7B /* { */) &&
+      this.regexp_eatHexDigits(state) &&
+      state.eat(0x7D /* } */) &&
+      isValidUnicode(state.lastIntValue)
+    ) {
+      return true
+    }
+    if (state.switchU) {
+      state.raise("Invalid unicode escape");
+    }
+    state.pos = start;
+  }
+
+  return false
+};
+function isValidUnicode(ch) {
+  return ch >= 0 && ch <= 0x10FFFF
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+pp$8.regexp_eatIdentityEscape = function(state) {
+  if (state.switchU) {
+    if (this.regexp_eatSyntaxCharacter(state)) {
+      return true
+    }
+    if (state.eat(0x2F /* / */)) {
+      state.lastIntValue = 0x2F; /* / */
+      return true
+    }
+    return false
+  }
+
+  var ch = state.current();
+  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+pp$8.regexp_eatDecimalEscape = function(state) {
+  state.lastIntValue = 0;
+  var ch = state.current();
+  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {
+    do {
+      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+      state.advance();
+    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+pp$8.regexp_eatCharacterClassEscape = function(state) {
+  var ch = state.current();
+
+  if (isCharacterClassEscape(ch)) {
+    state.lastIntValue = -1;
+    state.advance();
+    return true
+  }
+
+  if (
+    state.switchU &&
+    this.options.ecmaVersion >= 9 &&
+    (ch === 0x50 /* P */ || ch === 0x70 /* p */)
+  ) {
+    state.lastIntValue = -1;
+    state.advance();
+    if (
+      state.eat(0x7B /* { */) &&
+      this.regexp_eatUnicodePropertyValueExpression(state) &&
+      state.eat(0x7D /* } */)
+    ) {
+      return true
+    }
+    state.raise("Invalid property name");
+  }
+
+  return false
+};
+function isCharacterClassEscape(ch) {
+  return (
+    ch === 0x64 /* d */ ||
+    ch === 0x44 /* D */ ||
+    ch === 0x73 /* s */ ||
+    ch === 0x53 /* S */ ||
+    ch === 0x77 /* w */ ||
+    ch === 0x57 /* W */
+  )
+}
+
+// UnicodePropertyValueExpression ::
+//   UnicodePropertyName `=` UnicodePropertyValue
+//   LoneUnicodePropertyNameOrValue
+pp$8.regexp_eatUnicodePropertyValueExpression = function(state) {
+  var start = state.pos;
+
+  // UnicodePropertyName `=` UnicodePropertyValue
+  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {
+    var name = state.lastStringValue;
+    if (this.regexp_eatUnicodePropertyValue(state)) {
+      var value = state.lastStringValue;
+      this.regexp_validateUnicodePropertyNameAndValue(state, name, value);
+      return true
+    }
+  }
+  state.pos = start;
+
+  // LoneUnicodePropertyNameOrValue
+  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {
+    var nameOrValue = state.lastStringValue;
+    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue);
+    return true
+  }
+  return false
+};
+pp$8.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {
+  if (!has(state.unicodeProperties.nonBinary, name))
+    { state.raise("Invalid property name"); }
+  if (!state.unicodeProperties.nonBinary[name].test(value))
+    { state.raise("Invalid property value"); }
+};
+pp$8.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {
+  if (!state.unicodeProperties.binary.test(nameOrValue))
+    { state.raise("Invalid property name"); }
+};
+
+// UnicodePropertyName ::
+//   UnicodePropertyNameCharacters
+pp$8.regexp_eatUnicodePropertyName = function(state) {
+  var ch = 0;
+  state.lastStringValue = "";
+  while (isUnicodePropertyNameCharacter(ch = state.current())) {
+    state.lastStringValue += codePointToString(ch);
+    state.advance();
+  }
+  return state.lastStringValue !== ""
+};
+function isUnicodePropertyNameCharacter(ch) {
+  return isControlLetter(ch) || ch === 0x5F /* _ */
+}
+
+// UnicodePropertyValue ::
+//   UnicodePropertyValueCharacters
+pp$8.regexp_eatUnicodePropertyValue = function(state) {
+  var ch = 0;
+  state.lastStringValue = "";
+  while (isUnicodePropertyValueCharacter(ch = state.current())) {
+    state.lastStringValue += codePointToString(ch);
+    state.advance();
+  }
+  return state.lastStringValue !== ""
+};
+function isUnicodePropertyValueCharacter(ch) {
+  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)
+}
+
+// LoneUnicodePropertyNameOrValue ::
+//   UnicodePropertyValueCharacters
+pp$8.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {
+  return this.regexp_eatUnicodePropertyValue(state)
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+pp$8.regexp_eatCharacterClass = function(state) {
+  if (state.eat(0x5B /* [ */)) {
+    state.eat(0x5E /* ^ */);
+    this.regexp_classRanges(state);
+    if (state.eat(0x5D /* [ */)) {
+      return true
+    }
+    // Unreachable since it threw "unterminated regular expression" error before.
+    state.raise("Unterminated character class");
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+pp$8.regexp_classRanges = function(state) {
+  while (this.regexp_eatClassAtom(state)) {
+    var left = state.lastIntValue;
+    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {
+      var right = state.lastIntValue;
+      if (state.switchU && (left === -1 || right === -1)) {
+        state.raise("Invalid character class");
+      }
+      if (left !== -1 && right !== -1 && left > right) {
+        state.raise("Range out of order in character class");
+      }
+    }
+  }
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+pp$8.regexp_eatClassAtom = function(state) {
+  var start = state.pos;
+
+  if (state.eat(0x5C /* \ */)) {
+    if (this.regexp_eatClassEscape(state)) {
+      return true
+    }
+    if (state.switchU) {
+      // Make the same message as V8.
+      var ch$1 = state.current();
+      if (ch$1 === 0x63 /* c */ || isOctalDigit(ch$1)) {
+        state.raise("Invalid class escape");
+      }
+      state.raise("Invalid escape");
+    }
+    state.pos = start;
+  }
+
+  var ch = state.current();
+  if (ch !== 0x5D /* [ */) {
+    state.lastIntValue = ch;
+    state.advance();
+    return true
+  }
+
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+pp$8.regexp_eatClassEscape = function(state) {
+  var start = state.pos;
+
+  if (state.eat(0x62 /* b */)) {
+    state.lastIntValue = 0x08; /* <BS> */
+    return true
+  }
+
+  if (state.switchU && state.eat(0x2D /* - */)) {
+    state.lastIntValue = 0x2D; /* - */
+    return true
+  }
+
+  if (!state.switchU && state.eat(0x63 /* c */)) {
+    if (this.regexp_eatClassControlLetter(state)) {
+      return true
+    }
+    state.pos = start;
+  }
+
+  return (
+    this.regexp_eatCharacterClassEscape(state) ||
+    this.regexp_eatCharacterEscape(state)
+  )
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+pp$8.regexp_eatClassControlLetter = function(state) {
+  var ch = state.current();
+  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {
+    state.lastIntValue = ch % 0x20;
+    state.advance();
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+pp$8.regexp_eatHexEscapeSequence = function(state) {
+  var start = state.pos;
+  if (state.eat(0x78 /* x */)) {
+    if (this.regexp_eatFixedHexDigits(state, 2)) {
+      return true
+    }
+    if (state.switchU) {
+      state.raise("Invalid escape");
+    }
+    state.pos = start;
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+pp$8.regexp_eatDecimalDigits = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  state.lastIntValue = 0;
+  while (isDecimalDigit(ch = state.current())) {
+    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */);
+    state.advance();
+  }
+  return state.pos !== start
+};
+function isDecimalDigit(ch) {
+  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+pp$8.regexp_eatHexDigits = function(state) {
+  var start = state.pos;
+  var ch = 0;
+  state.lastIntValue = 0;
+  while (isHexDigit(ch = state.current())) {
+    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+    state.advance();
+  }
+  return state.pos !== start
+};
+function isHexDigit(ch) {
+  return (
+    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||
+    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||
+    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)
+  )
+}
+function hexToInt(ch) {
+  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {
+    return 10 + (ch - 0x41 /* A */)
+  }
+  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {
+    return 10 + (ch - 0x61 /* a */)
+  }
+  return ch - 0x30 /* 0 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+// Allows only 0-377(octal) i.e. 0-255(decimal).
+pp$8.regexp_eatLegacyOctalEscapeSequence = function(state) {
+  if (this.regexp_eatOctalDigit(state)) {
+    var n1 = state.lastIntValue;
+    if (this.regexp_eatOctalDigit(state)) {
+      var n2 = state.lastIntValue;
+      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {
+        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue;
+      } else {
+        state.lastIntValue = n1 * 8 + n2;
+      }
+    } else {
+      state.lastIntValue = n1;
+    }
+    return true
+  }
+  return false
+};
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+pp$8.regexp_eatOctalDigit = function(state) {
+  var ch = state.current();
+  if (isOctalDigit(ch)) {
+    state.lastIntValue = ch - 0x30; /* 0 */
+    state.advance();
+    return true
+  }
+  state.lastIntValue = 0;
+  return false
+};
+function isOctalDigit(ch) {
+  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */
+}
+
+// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+pp$8.regexp_eatFixedHexDigits = function(state, length) {
+  var start = state.pos;
+  state.lastIntValue = 0;
+  for (var i = 0; i < length; ++i) {
+    var ch = state.current();
+    if (!isHexDigit(ch)) {
+      state.pos = start;
+      return false
+    }
+    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch);
+    state.advance();
+  }
+  return true
+};
+
+// Object type used to represent tokens. Note that normally, tokens
+// simply exist as properties on the parser object. This is only
+// used for the onToken callback and the external tokenizer.
+
+var Token = function Token(p) {
+  this.type = p.type;
+  this.value = p.value;
+  this.start = p.start;
+  this.end = p.end;
+  if (p.options.locations)
+    { this.loc = new SourceLocation(p, p.startLoc, p.endLoc); }
+  if (p.options.ranges)
+    { this.range = [p.start, p.end]; }
+};
+
+// ## Tokenizer
+
+var pp$9 = Parser.prototype;
+
+// Move to the next token
+
+pp$9.next = function() {
+  if (this.options.onToken)
+    { this.options.onToken(new Token(this)); }
+
+  this.lastTokEnd = this.end;
+  this.lastTokStart = this.start;
+  this.lastTokEndLoc = this.endLoc;
+  this.lastTokStartLoc = this.startLoc;
+  this.nextToken();
+};
+
+pp$9.getToken = function() {
+  this.next();
+  return new Token(this)
+};
+
+// If we're in an ES6 environment, make parsers iterable
+if (typeof Symbol !== "undefined")
+  { pp$9[Symbol.iterator] = function() {
+    var this$1 = this;
+
+    return {
+      next: function () {
+        var token = this$1.getToken();
+        return {
+          done: token.type === types.eof,
+          value: token
+        }
+      }
+    }
+  }; }
+
+// Toggle strict mode. Re-reads the next number or string to please
+// pedantic tests (`"use strict"; 010;` should fail).
+
+pp$9.curContext = function() {
+  return this.context[this.context.length - 1]
+};
+
+// Read a single token, updating the parser object's token-related
+// properties.
+
+pp$9.nextToken = function() {
+  var curContext = this.curContext();
+  if (!curContext || !curContext.preserveSpace) { this.skipSpace(); }
+
+  this.start = this.pos;
+  if (this.options.locations) { this.startLoc = this.curPosition(); }
+  if (this.pos >= this.input.length) { return this.finishToken(types.eof) }
+
+  if (curContext.override) { return curContext.override(this) }
+  else { this.readToken(this.fullCharCodeAtPos()); }
+};
+
+pp$9.readToken = function(code) {
+  // Identifier or keyword. '\uXXXX' sequences are allowed in
+  // identifiers, so '\' also dispatches to that.
+  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */)
+    { return this.readWord() }
+
+  return this.getTokenFromCode(code)
+};
+
+pp$9.fullCharCodeAtPos = function() {
+  var code = this.input.charCodeAt(this.pos);
+  if (code <= 0xd7ff || code >= 0xe000) { return code }
+  var next = this.input.charCodeAt(this.pos + 1);
+  return (code << 10) + next - 0x35fdc00
+};
+
+pp$9.skipBlockComment = function() {
+  var startLoc = this.options.onComment && this.curPosition();
+  var start = this.pos, end = this.input.indexOf("*/", this.pos += 2);
+  if (end === -1) { this.raise(this.pos - 2, "Unterminated comment"); }
+  this.pos = end + 2;
+  if (this.options.locations) {
+    lineBreakG.lastIndex = start;
+    var match;
+    while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {
+      ++this.curLine;
+      this.lineStart = match.index + match[0].length;
+    }
+  }
+  if (this.options.onComment)
+    { this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,
+                           startLoc, this.curPosition()); }
+};
+
+pp$9.skipLineComment = function(startSkip) {
+  var start = this.pos;
+  var startLoc = this.options.onComment && this.curPosition();
+  var ch = this.input.charCodeAt(this.pos += startSkip);
+  while (this.pos < this.input.length && !isNewLine(ch)) {
+    ch = this.input.charCodeAt(++this.pos);
+  }
+  if (this.options.onComment)
+    { this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,
+                           startLoc, this.curPosition()); }
+};
+
+// Called at the start of the parse and after every token. Skips
+// whitespace and comments, and.
+
+pp$9.skipSpace = function() {
+  loop: while (this.pos < this.input.length) {
+    var ch = this.input.charCodeAt(this.pos);
+    switch (ch) {
+    case 32: case 160: // ' '
+      ++this.pos;
+      break
+    case 13:
+      if (this.input.charCodeAt(this.pos + 1) === 10) {
+        ++this.pos;
+      }
+    case 10: case 8232: case 8233:
+      ++this.pos;
+      if (this.options.locations) {
+        ++this.curLine;
+        this.lineStart = this.pos;
+      }
+      break
+    case 47: // '/'
+      switch (this.input.charCodeAt(this.pos + 1)) {
+      case 42: // '*'
+        this.skipBlockComment();
+        break
+      case 47:
+        this.skipLineComment(2);
+        break
+      default:
+        break loop
+      }
+      break
+    default:
+      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {
+        ++this.pos;
+      } else {
+        break loop
+      }
+    }
+  }
+};
+
+// Called at the end of every token. Sets `end`, `val`, and
+// maintains `context` and `exprAllowed`, and skips the space after
+// the token, so that the next one's `start` will point at the
+// right position.
+
+pp$9.finishToken = function(type, val) {
+  this.end = this.pos;
+  if (this.options.locations) { this.endLoc = this.curPosition(); }
+  var prevType = this.type;
+  this.type = type;
+  this.value = val;
+
+  this.updateContext(prevType);
+};
+
+// ### Token reading
+
+// This is the function that is called to fetch the next token. It
+// is somewhat obscure, because it works in character codes rather
+// than characters, and because operator parsing has been inlined
+// into it.
+//
+// All in the name of speed.
+//
+pp$9.readToken_dot = function() {
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next >= 48 && next <= 57) { return this.readNumber(true) }
+  var next2 = this.input.charCodeAt(this.pos + 2);
+  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'
+    this.pos += 3;
+    return this.finishToken(types.ellipsis)
+  } else {
+    ++this.pos;
+    return this.finishToken(types.dot)
+  }
+};
+
+pp$9.readToken_slash = function() { // '/'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }
+  if (next === 61) { return this.finishOp(types.assign, 2) }
+  return this.finishOp(types.slash, 1)
+};
+
+pp$9.readToken_mult_modulo_exp = function(code) { // '%*'
+  var next = this.input.charCodeAt(this.pos + 1);
+  var size = 1;
+  var tokentype = code === 42 ? types.star : types.modulo;
+
+  // exponentiation operator ** and **=
+  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {
+    ++size;
+    tokentype = types.starstar;
+    next = this.input.charCodeAt(this.pos + 2);
+  }
+
+  if (next === 61) { return this.finishOp(types.assign, size + 1) }
+  return this.finishOp(tokentype, size)
+};
+
+pp$9.readToken_pipe_amp = function(code) { // '|&'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === code) { return this.finishOp(code === 124 ? types.logicalOR : types.logicalAND, 2) }
+  if (next === 61) { return this.finishOp(types.assign, 2) }
+  return this.finishOp(code === 124 ? types.bitwiseOR : types.bitwiseAND, 1)
+};
+
+pp$9.readToken_caret = function() { // '^'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === 61) { return this.finishOp(types.assign, 2) }
+  return this.finishOp(types.bitwiseXOR, 1)
+};
+
+pp$9.readToken_plus_min = function(code) { // '+-'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === code) {
+    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&
+        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {
+      // A `-->` line comment
+      this.skipLineComment(3);
+      this.skipSpace();
+      return this.nextToken()
+    }
+    return this.finishOp(types.incDec, 2)
+  }
+  if (next === 61) { return this.finishOp(types.assign, 2) }
+  return this.finishOp(types.plusMin, 1)
+};
+
+pp$9.readToken_lt_gt = function(code) { // '<>'
+  var next = this.input.charCodeAt(this.pos + 1);
+  var size = 1;
+  if (next === code) {
+    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2;
+    if (this.input.charCodeAt(this.pos + size) === 61) { return this.finishOp(types.assign, size + 1) }
+    return this.finishOp(types.bitShift, size)
+  }
+  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&
+      this.input.charCodeAt(this.pos + 3) === 45) {
+    // `<!--`, an XML-style comment that should be interpreted as a line comment
+    this.skipLineComment(4);
+    this.skipSpace();
+    return this.nextToken()
+  }
+  if (next === 61) { size = 2; }
+  return this.finishOp(types.relational, size)
+};
+
+pp$9.readToken_eq_excl = function(code) { // '=!'
+  var next = this.input.charCodeAt(this.pos + 1);
+  if (next === 61) { return this.finishOp(types.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2) }
+  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'
+    this.pos += 2;
+    return this.finishToken(types.arrow)
+  }
+  return this.finishOp(code === 61 ? types.eq : types.prefix, 1)
+};
+
+pp$9.getTokenFromCode = function(code) {
+  switch (code) {
+  // The interpretation of a dot depends on whether it is followed
+  // by a digit or another two dots.
+  case 46: // '.'
+    return this.readToken_dot()
+
+  // Punctuation tokens.
+  case 40: ++this.pos; return this.finishToken(types.parenL)
+  case 41: ++this.pos; return this.finishToken(types.parenR)
+  case 59: ++this.pos; return this.finishToken(types.semi)
+  case 44: ++this.pos; return this.finishToken(types.comma)
+  case 91: ++this.pos; return this.finishToken(types.bracketL)
+  case 93: ++this.pos; return this.finishToken(types.bracketR)
+  case 123: ++this.pos; return this.finishToken(types.braceL)
+  case 125: ++this.pos; return this.finishToken(types.braceR)
+  case 58: ++this.pos; return this.finishToken(types.colon)
+  case 63: ++this.pos; return this.finishToken(types.question)
+
+  case 96: // '`'
+    if (this.options.ecmaVersion < 6) { break }
+    ++this.pos;
+    return this.finishToken(types.backQuote)
+
+  case 48: // '0'
+    var next = this.input.charCodeAt(this.pos + 1);
+    if (next === 120 || next === 88) { return this.readRadixNumber(16) } // '0x', '0X' - hex number
+    if (this.options.ecmaVersion >= 6) {
+      if (next === 111 || next === 79) { return this.readRadixNumber(8) } // '0o', '0O' - octal number
+      if (next === 98 || next === 66) { return this.readRadixNumber(2) } // '0b', '0B' - binary number
+    }
+
+  // Anything else beginning with a digit is an integer, octal
+  // number, or float.
+  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9
+    return this.readNumber(false)
+
+  // Quotes produce strings.
+  case 34: case 39: // '"', "'"
+    return this.readString(code)
+
+  // Operators are parsed inline in tiny state machines. '=' (61) is
+  // often referred to. `finishOp` simply skips the amount of
+  // characters it is given as second argument, and returns a token
+  // of the type given by its first argument.
+
+  case 47: // '/'
+    return this.readToken_slash()
+
+  case 37: case 42: // '%*'
+    return this.readToken_mult_modulo_exp(code)
+
+  case 124: case 38: // '|&'
+    return this.readToken_pipe_amp(code)
+
+  case 94: // '^'
+    return this.readToken_caret()
+
+  case 43: case 45: // '+-'
+    return this.readToken_plus_min(code)
+
+  case 60: case 62: // '<>'
+    return this.readToken_lt_gt(code)
+
+  case 61: case 33: // '=!'
+    return this.readToken_eq_excl(code)
+
+  case 126: // '~'
+    return this.finishOp(types.prefix, 1)
+  }
+
+  this.raise(this.pos, "Unexpected character '" + codePointToString$1(code) + "'");
+};
+
+pp$9.finishOp = function(type, size) {
+  var str = this.input.slice(this.pos, this.pos + size);
+  this.pos += size;
+  return this.finishToken(type, str)
+};
+
+pp$9.readRegexp = function() {
+  var escaped, inClass, start = this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(start, "Unterminated regular expression"); }
+    var ch = this.input.charAt(this.pos);
+    if (lineBreak.test(ch)) { this.raise(start, "Unterminated regular expression"); }
+    if (!escaped) {
+      if (ch === "[") { inClass = true; }
+      else if (ch === "]" && inClass) { inClass = false; }
+      else if (ch === "/" && !inClass) { break }
+      escaped = ch === "\\";
+    } else { escaped = false; }
+    ++this.pos;
+  }
+  var pattern = this.input.slice(start, this.pos);
+  ++this.pos;
+  var flagsStart = this.pos;
+  var flags = this.readWord1();
+  if (this.containsEsc) { this.unexpected(flagsStart); }
+
+  // Validate pattern
+  var state = this.regexpState || (this.regexpState = new RegExpValidationState(this));
+  state.reset(start, pattern, flags);
+  this.validateRegExpFlags(state);
+  this.validateRegExpPattern(state);
+
+  // Create Literal#value property value.
+  var value = null;
+  try {
+    value = new RegExp(pattern, flags);
+  } catch (e) {
+    // ESTree requires null if it failed to instantiate RegExp object.
+    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+  }
+
+  return this.finishToken(types.regexp, {pattern: pattern, flags: flags, value: value})
+};
+
+// Read an integer in the given radix. Return null if zero digits
+// were read, the integer value otherwise. When `len` is given, this
+// will return `null` unless the integer has exactly `len` digits.
+
+pp$9.readInt = function(radix, len) {
+  var start = this.pos, total = 0;
+  for (var i = 0, e = len == null ? Infinity : len; i < e; ++i) {
+    var code = this.input.charCodeAt(this.pos), val = (void 0);
+    if (code >= 97) { val = code - 97 + 10; } // a
+    else if (code >= 65) { val = code - 65 + 10; } // A
+    else if (code >= 48 && code <= 57) { val = code - 48; } // 0-9
+    else { val = Infinity; }
+    if (val >= radix) { break }
+    ++this.pos;
+    total = total * radix + val;
+  }
+  if (this.pos === start || len != null && this.pos - start !== len) { return null }
+
+  return total
+};
+
+pp$9.readRadixNumber = function(radix) {
+  var start = this.pos;
+  this.pos += 2; // 0x
+  var val = this.readInt(radix);
+  if (val == null) { this.raise(this.start + 2, "Expected number in radix " + radix); }
+  if (this.options.ecmaVersion >= 11 && this.input.charCodeAt(this.pos) === 110) {
+    val = typeof BigInt !== "undefined" ? BigInt(this.input.slice(start, this.pos)) : null;
+    ++this.pos;
+  } else if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+  return this.finishToken(types.num, val)
+};
+
+// Read an integer, octal integer, or floating-point number.
+
+pp$9.readNumber = function(startsWithDot) {
+  var start = this.pos;
+  if (!startsWithDot && this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+  var octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48;
+  if (octal && this.strict) { this.raise(start, "Invalid number"); }
+  if (octal && /[89]/.test(this.input.slice(start, this.pos))) { octal = false; }
+  var next = this.input.charCodeAt(this.pos);
+  if (!octal && !startsWithDot && this.options.ecmaVersion >= 11 && next === 110) {
+    var str$1 = this.input.slice(start, this.pos);
+    var val$1 = typeof BigInt !== "undefined" ? BigInt(str$1) : null;
+    ++this.pos;
+    if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+    return this.finishToken(types.num, val$1)
+  }
+  if (next === 46 && !octal) { // '.'
+    ++this.pos;
+    this.readInt(10);
+    next = this.input.charCodeAt(this.pos);
+  }
+  if ((next === 69 || next === 101) && !octal) { // 'eE'
+    next = this.input.charCodeAt(++this.pos);
+    if (next === 43 || next === 45) { ++this.pos; } // '+-'
+    if (this.readInt(10) === null) { this.raise(start, "Invalid number"); }
+  }
+  if (isIdentifierStart(this.fullCharCodeAtPos())) { this.raise(this.pos, "Identifier directly after number"); }
+
+  var str = this.input.slice(start, this.pos);
+  var val = octal ? parseInt(str, 8) : parseFloat(str);
+  return this.finishToken(types.num, val)
+};
+
+// Read a string value, interpreting backslash-escapes.
+
+pp$9.readCodePoint = function() {
+  var ch = this.input.charCodeAt(this.pos), code;
+
+  if (ch === 123) { // '{'
+    if (this.options.ecmaVersion < 6) { this.unexpected(); }
+    var codePos = ++this.pos;
+    code = this.readHexChar(this.input.indexOf("}", this.pos) - this.pos);
+    ++this.pos;
+    if (code > 0x10FFFF) { this.invalidStringToken(codePos, "Code point out of bounds"); }
+  } else {
+    code = this.readHexChar(4);
+  }
+  return code
+};
+
+function codePointToString$1(code) {
+  // UTF-16 Decoding
+  if (code <= 0xFFFF) { return String.fromCharCode(code) }
+  code -= 0x10000;
+  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)
+}
+
+pp$9.readString = function(quote) {
+  var out = "", chunkStart = ++this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated string constant"); }
+    var ch = this.input.charCodeAt(this.pos);
+    if (ch === quote) { break }
+    if (ch === 92) { // '\'
+      out += this.input.slice(chunkStart, this.pos);
+      out += this.readEscapedChar(false);
+      chunkStart = this.pos;
+    } else {
+      if (isNewLine(ch, this.options.ecmaVersion >= 10)) { this.raise(this.start, "Unterminated string constant"); }
+      ++this.pos;
+    }
+  }
+  out += this.input.slice(chunkStart, this.pos++);
+  return this.finishToken(types.string, out)
+};
+
+// Reads template string tokens.
+
+var INVALID_TEMPLATE_ESCAPE_ERROR = {};
+
+pp$9.tryReadTemplateToken = function() {
+  this.inTemplateElement = true;
+  try {
+    this.readTmplToken();
+  } catch (err) {
+    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {
+      this.readInvalidTemplateToken();
+    } else {
+      throw err
+    }
+  }
+
+  this.inTemplateElement = false;
+};
+
+pp$9.invalidStringToken = function(position, message) {
+  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {
+    throw INVALID_TEMPLATE_ESCAPE_ERROR
+  } else {
+    this.raise(position, message);
+  }
+};
+
+pp$9.readTmplToken = function() {
+  var out = "", chunkStart = this.pos;
+  for (;;) {
+    if (this.pos >= this.input.length) { this.raise(this.start, "Unterminated template"); }
+    var ch = this.input.charCodeAt(this.pos);
+    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'
+      if (this.pos === this.start && (this.type === types.template || this.type === types.invalidTemplate)) {
+        if (ch === 36) {
+          this.pos += 2;
+          return this.finishToken(types.dollarBraceL)
+        } else {
+          ++this.pos;
+          return this.finishToken(types.backQuote)
+        }
+      }
+      out += this.input.slice(chunkStart, this.pos);
+      return this.finishToken(types.template, out)
+    }
+    if (ch === 92) { // '\'
+      out += this.input.slice(chunkStart, this.pos);
+      out += this.readEscapedChar(true);
+      chunkStart = this.pos;
+    } else if (isNewLine(ch)) {
+      out += this.input.slice(chunkStart, this.pos);
+      ++this.pos;
+      switch (ch) {
+      case 13:
+        if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; }
+      case 10:
+        out += "\n";
+        break
+      default:
+        out += String.fromCharCode(ch);
+        break
+      }
+      if (this.options.locations) {
+        ++this.curLine;
+        this.lineStart = this.pos;
+      }
+      chunkStart = this.pos;
+    } else {
+      ++this.pos;
+    }
+  }
+};
+
+// Reads a template token to search for the end, without validating any escape sequences
+pp$9.readInvalidTemplateToken = function() {
+  for (; this.pos < this.input.length; this.pos++) {
+    switch (this.input[this.pos]) {
+    case "\\":
+      ++this.pos;
+      break
+
+    case "$":
+      if (this.input[this.pos + 1] !== "{") {
+        break
+      }
+    // falls through
+
+    case "`":
+      return this.finishToken(types.invalidTemplate, this.input.slice(this.start, this.pos))
+
+    // no default
+    }
+  }
+  this.raise(this.start, "Unterminated template");
+};
+
+// Used to read escaped characters
+
+pp$9.readEscapedChar = function(inTemplate) {
+  var ch = this.input.charCodeAt(++this.pos);
+  ++this.pos;
+  switch (ch) {
+  case 110: return "\n" // 'n' -> '\n'
+  case 114: return "\r" // 'r' -> '\r'
+  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'
+  case 117: return codePointToString$1(this.readCodePoint()) // 'u'
+  case 116: return "\t" // 't' -> '\t'
+  case 98: return "\b" // 'b' -> '\b'
+  case 118: return "\u000b" // 'v' -> '\u000b'
+  case 102: return "\f" // 'f' -> '\f'
+  case 13: if (this.input.charCodeAt(this.pos) === 10) { ++this.pos; } // '\r\n'
+  case 10: // ' \n'
+    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine; }
+    return ""
+  default:
+    if (ch >= 48 && ch <= 55) {
+      var octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0];
+      var octal = parseInt(octalStr, 8);
+      if (octal > 255) {
+        octalStr = octalStr.slice(0, -1);
+        octal = parseInt(octalStr, 8);
+      }
+      this.pos += octalStr.length - 1;
+      ch = this.input.charCodeAt(this.pos);
+      if ((octalStr !== "0" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {
+        this.invalidStringToken(
+          this.pos - 1 - octalStr.length,
+          inTemplate
+            ? "Octal literal in template string"
+            : "Octal literal in strict mode"
+        );
+      }
+      return String.fromCharCode(octal)
+    }
+    if (isNewLine(ch)) {
+      // Unicode new line characters after \ get removed from output in both
+      // template literals and strings
+      return ""
+    }
+    return String.fromCharCode(ch)
+  }
+};
+
+// Used to read character escape sequences ('\x', '\u', '\U').
+
+pp$9.readHexChar = function(len) {
+  var codePos = this.pos;
+  var n = this.readInt(16, len);
+  if (n === null) { this.invalidStringToken(codePos, "Bad character escape sequence"); }
+  return n
+};
+
+// Read an identifier, and return it as a string. Sets `this.containsEsc`
+// to whether the word contained a '\u' escape.
+//
+// Incrementally adds only escaped chars, adding other chunks as-is
+// as a micro-optimization.
+
+pp$9.readWord1 = function() {
+  this.containsEsc = false;
+  var word = "", first = true, chunkStart = this.pos;
+  var astral = this.options.ecmaVersion >= 6;
+  while (this.pos < this.input.length) {
+    var ch = this.fullCharCodeAtPos();
+    if (isIdentifierChar(ch, astral)) {
+      this.pos += ch <= 0xffff ? 1 : 2;
+    } else if (ch === 92) { // "\"
+      this.containsEsc = true;
+      word += this.input.slice(chunkStart, this.pos);
+      var escStart = this.pos;
+      if (this.input.charCodeAt(++this.pos) !== 117) // "u"
+        { this.invalidStringToken(this.pos, "Expecting Unicode escape sequence \\uXXXX"); }
+      ++this.pos;
+      var esc = this.readCodePoint();
+      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))
+        { this.invalidStringToken(escStart, "Invalid Unicode escape"); }
+      word += codePointToString$1(esc);
+      chunkStart = this.pos;
+    } else {
+      break
+    }
+    first = false;
+  }
+  return word + this.input.slice(chunkStart, this.pos)
+};
+
+// Read an identifier or keyword token. Will check for reserved
+// words when necessary.
+
+pp$9.readWord = function() {
+  var word = this.readWord1();
+  var type = types.name;
+  if (this.keywords.test(word)) {
+    if (this.containsEsc) { this.raiseRecoverable(this.start, "Escape sequence in keyword " + word); }
+    type = keywords$1[word];
+  }
+  return this.finishToken(type, word)
+};
+
+// Acorn is a tiny, fast JavaScript parser written in JavaScript.
+
+var version = "7.0.0";
+
+// The main exported interface (under `self.acorn` when in the
+// browser) is a `parse` function that takes a code string and
+// returns an abstract syntax tree as specified by [Mozilla parser
+// API][api].
+//
+// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API
+
+function parse(input, options) {
+  return Parser.parse(input, options)
+}
+
+// This function tries to parse a single expression at a given
+// offset in a string. Useful for parsing mixed-language formats
+// that embed JavaScript expressions.
+
+function parseExpressionAt(input, pos, options) {
+  return Parser.parseExpressionAt(input, pos, options)
+}
+
+// Acorn is organized as a tokenizer and a recursive-descent parser.
+// The `tokenizer` export provides an interface to the tokenizer.
+
+function tokenizer(input, options) {
+  return Parser.tokenizer(input, options)
+}
+
+export { Node, Parser, Position, SourceLocation, TokContext, Token, TokenType, defaultOptions, getLineInfo, isIdentifierChar, isIdentifierStart, isNewLine, keywords$1 as keywordTypes, lineBreak, lineBreakG, nonASCIIwhitespace, parse, parseExpressionAt, types$1 as tokContexts, types as tokTypes, tokenizer, version };
diff --git a/node_modules/acorn/dist/acorn.mjs.map b/node_modules/acorn/dist/acorn.mjs.map
new file mode 100644
index 0000000..76ec4d5
--- /dev/null
+++ b/node_modules/acorn/dist/acorn.mjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"acorn.mjs","sources":["../src/identifier.js","../src/tokentype.js","../src/whitespace.js","../src/util.js","../src/locutil.js","../src/options.js","../src/scopeflags.js","../src/state.js","../src/parseutil.js","../src/statement.js","../src/lval.js","../src/expression.js","../src/location.js","../src/scope.js","../src/node.js","../src/tokencontext.js","../src/unicode-property-data.js","../src/regexp.js","../src/tokenize.js","../src/index.js"],"sourcesContent":["// Reserved word lists for various dialects of the language\n\nexport const reservedWords = {\n  3: \"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile\",\n  5: \"class enum extends super const export import\",\n  6: \"enum\",\n  strict: \"implements interface let package private protected public static yield\",\n  strictBind: \"eval arguments\"\n}\n\n// And the keywords\n\nconst ecma5AndLessKeywords = \"break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this\"\n\nexport const keywords = {\n  5: ecma5AndLessKeywords,\n  6: ecma5AndLessKeywords + \" const class extends export import super\"\n}\n\nexport const keywordRelationalOperator = /^in(stanceof)?$/\n\n// ## Character categories\n\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point above 128.\n// Generated by `bin/generate-identifier-regex.js`.\n\nlet nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u08a0-\\u08b4\\u08b6-\\u08bd\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d05-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e87\\u0e88\\u0e8a\\u0e8d\\u0e94-\\u0e97\\u0e99-\\u0e9f\\u0ea1-\\u0ea3\\u0ea5\\u0ea7\\u0eaa\\u0eab\\u0ead-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u170c\\u170e-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4b\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf1\\u1cf5\\u1cf6\\u1d00-\\u1dbf\\u1e00-\\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\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2c2e\\u2c30-\\u2c5e\\u2c60-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31ba\\u31f0-\\u31ff\\u3400-\\u4db5\\u4e00-\\u9fef\\ua000-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7b9\\ua7f7-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab65\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\"\nlet nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u08d3-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b56\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d82\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0eb9\\u0ebb\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u1810-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf2-\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1df9\\u1dfb-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\"\n\nconst nonASCIIidentifierStart = new RegExp(\"[\" + nonASCIIidentifierStartChars + \"]\")\nconst nonASCIIidentifier = new RegExp(\"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\")\n\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null\n\n// These are a run-length and offset encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by bin/generate-identifier-regex.js\n\n// eslint-disable-next-line comma-spacing\nconst astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,190,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,54,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,86,26,230,43,117,63,32,0,257,0,11,39,8,0,22,0,12,39,3,3,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,68,12,0,67,12,65,1,31,6129,15,754,9486,286,82,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,4149,196,60,67,1213,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541]\n\n// eslint-disable-next-line comma-spacing\nconst astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,280,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1016,45,17,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,2214,6,110,6,6,9,792487,239]\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code, set) {\n  let pos = 0x10000\n  for (let i = 0; i < set.length; i += 2) {\n    pos += set[i]\n    if (pos > code) return false\n    pos += set[i + 1]\n    if (pos >= code) return true\n  }\n}\n\n// Test whether a given character code starts an identifier.\n\nexport function isIdentifierStart(code, astral) {\n  if (code < 65) return code === 36\n  if (code < 91) return true\n  if (code < 97) return code === 95\n  if (code < 123) return true\n  if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code))\n  if (astral === false) return false\n  return isInAstralSet(code, astralIdentifierStartCodes)\n}\n\n// Test whether a given character is part of an identifier.\n\nexport function isIdentifierChar(code, astral) {\n  if (code < 48) return code === 36\n  if (code < 58) return true\n  if (code < 65) return false\n  if (code < 91) return true\n  if (code < 97) return code === 95\n  if (code < 123) return true\n  if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code))\n  if (astral === false) return false\n  return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes)\n}\n","// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between regular\n// expressions and divisions. It is set on all token types that can\n// be followed by an expression (thus, a slash after them would be a\n// regular expression).\n//\n// The `startsExpr` property is used to check if the token ends a\n// `yield` expression. It is set on all token types that either can\n// directly start an expression (like a quotation mark) or can\n// continue an expression (like the body of a string).\n//\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nexport class TokenType {\n  constructor(label, conf = {}) {\n    this.label = label\n    this.keyword = conf.keyword\n    this.beforeExpr = !!conf.beforeExpr\n    this.startsExpr = !!conf.startsExpr\n    this.isLoop = !!conf.isLoop\n    this.isAssign = !!conf.isAssign\n    this.prefix = !!conf.prefix\n    this.postfix = !!conf.postfix\n    this.binop = conf.binop || null\n    this.updateContext = null\n  }\n}\n\nfunction binop(name, prec) {\n  return new TokenType(name, {beforeExpr: true, binop: prec})\n}\nconst beforeExpr = {beforeExpr: true}, startsExpr = {startsExpr: true}\n\n// Map keyword names to token types.\n\nexport const keywords = {}\n\n// Succinct definitions of keyword token types\nfunction kw(name, options = {}) {\n  options.keyword = name\n  return keywords[name] = new TokenType(name, options)\n}\n\nexport const types = {\n  num: new TokenType(\"num\", startsExpr),\n  regexp: new TokenType(\"regexp\", startsExpr),\n  string: new TokenType(\"string\", startsExpr),\n  name: new TokenType(\"name\", startsExpr),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", {beforeExpr: true, startsExpr: true}),\n  bracketR: new TokenType(\"]\"),\n  braceL: new TokenType(\"{\", {beforeExpr: true, startsExpr: true}),\n  braceR: new TokenType(\"}\"),\n  parenL: new TokenType(\"(\", {beforeExpr: true, startsExpr: true}),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", beforeExpr),\n  semi: new TokenType(\";\", beforeExpr),\n  colon: new TokenType(\":\", beforeExpr),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", beforeExpr),\n  arrow: new TokenType(\"=>\", beforeExpr),\n  template: new TokenType(\"template\"),\n  invalidTemplate: new TokenType(\"invalidTemplate\"),\n  ellipsis: new TokenType(\"...\", beforeExpr),\n  backQuote: new TokenType(\"`\", startsExpr),\n  dollarBraceL: new TokenType(\"${\", {beforeExpr: true, startsExpr: true}),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", {beforeExpr: true, isAssign: true}),\n  assign: new TokenType(\"_=\", {beforeExpr: true, isAssign: true}),\n  incDec: new TokenType(\"++/--\", {prefix: true, postfix: true, startsExpr: true}),\n  prefix: new TokenType(\"!/~\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  logicalOR: binop(\"||\", 1),\n  logicalAND: binop(\"&&\", 2),\n  bitwiseOR: binop(\"|\", 3),\n  bitwiseXOR: binop(\"^\", 4),\n  bitwiseAND: binop(\"&\", 5),\n  equality: binop(\"==/!=/===/!==\", 6),\n  relational: binop(\"</>/<=/>=\", 7),\n  bitShift: binop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}),\n  modulo: binop(\"%\", 10),\n  star: binop(\"*\", 10),\n  slash: binop(\"/\", 10),\n  starstar: new TokenType(\"**\", {beforeExpr: true}),\n\n  // Keyword token types.\n  _break: kw(\"break\"),\n  _case: kw(\"case\", beforeExpr),\n  _catch: kw(\"catch\"),\n  _continue: kw(\"continue\"),\n  _debugger: kw(\"debugger\"),\n  _default: kw(\"default\", beforeExpr),\n  _do: kw(\"do\", {isLoop: true, beforeExpr: true}),\n  _else: kw(\"else\", beforeExpr),\n  _finally: kw(\"finally\"),\n  _for: kw(\"for\", {isLoop: true}),\n  _function: kw(\"function\", startsExpr),\n  _if: kw(\"if\"),\n  _return: kw(\"return\", beforeExpr),\n  _switch: kw(\"switch\"),\n  _throw: kw(\"throw\", beforeExpr),\n  _try: kw(\"try\"),\n  _var: kw(\"var\"),\n  _const: kw(\"const\"),\n  _while: kw(\"while\", {isLoop: true}),\n  _with: kw(\"with\"),\n  _new: kw(\"new\", {beforeExpr: true, startsExpr: true}),\n  _this: kw(\"this\", startsExpr),\n  _super: kw(\"super\", startsExpr),\n  _class: kw(\"class\", startsExpr),\n  _extends: kw(\"extends\", beforeExpr),\n  _export: kw(\"export\"),\n  _import: kw(\"import\"),\n  _null: kw(\"null\", startsExpr),\n  _true: kw(\"true\", startsExpr),\n  _false: kw(\"false\", startsExpr),\n  _in: kw(\"in\", {beforeExpr: true, binop: 7}),\n  _instanceof: kw(\"instanceof\", {beforeExpr: true, binop: 7}),\n  _typeof: kw(\"typeof\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _void: kw(\"void\", {beforeExpr: true, prefix: true, startsExpr: true}),\n  _delete: kw(\"delete\", {beforeExpr: true, prefix: true, startsExpr: true})\n}\n","// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\n\nexport const lineBreak = /\\r\\n?|\\n|\\u2028|\\u2029/\nexport const lineBreakG = new RegExp(lineBreak.source, \"g\")\n\nexport function isNewLine(code, ecma2019String) {\n  return code === 10 || code === 13 || (!ecma2019String && (code === 0x2028 || code === 0x2029))\n}\n\nexport const nonASCIIwhitespace = /[\\u1680\\u2000-\\u200a\\u202f\\u205f\\u3000\\ufeff]/\n\nexport const skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g\n","const {hasOwnProperty, toString} = Object.prototype\n\n// Checks if an object has a property.\n\nexport function has(obj, propName) {\n  return hasOwnProperty.call(obj, propName)\n}\n\nexport const isArray = Array.isArray || ((obj) => (\n  toString.call(obj) === \"[object Array]\"\n))\n\nexport function wordsRegexp(words) {\n  return new RegExp(\"^(?:\" + words.replace(/ /g, \"|\") + \")$\")\n}\n","import {lineBreakG} from \"./whitespace\"\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nexport class Position {\n  constructor(line, col) {\n    this.line = line\n    this.column = col\n  }\n\n  offset(n) {\n    return new Position(this.line, this.column + n)\n  }\n}\n\nexport class SourceLocation {\n  constructor(p, start, end) {\n    this.start = start\n    this.end = end\n    if (p.sourceFile !== null) this.source = p.sourceFile\n  }\n}\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nexport function getLineInfo(input, offset) {\n  for (let line = 1, cur = 0;;) {\n    lineBreakG.lastIndex = cur\n    let match = lineBreakG.exec(input)\n    if (match && match.index < offset) {\n      ++line\n      cur = match.index + match[0].length\n    } else {\n      return new Position(line, offset - cur)\n    }\n  }\n}\n","import {has, isArray} from \"./util\"\nimport {SourceLocation} from \"./locutil\"\n\n// A second optional argument can be given to further configure\n// the parser process. These options are recognized:\n\nexport const defaultOptions = {\n  // `ecmaVersion` indicates the ECMAScript version to parse. Must be\n  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10\n  // (2019). This influences support for strict mode, the set of\n  // reserved words, and support for new syntax features. The default\n  // is 9.\n  ecmaVersion: 9,\n  // `sourceType` indicates the mode the code should be parsed in.\n  // Can be either `\"script\"` or `\"module\"`. This influences global\n  // strict mode and parsing of `import` and `export` declarations.\n  sourceType: \"script\",\n  // `onInsertedSemicolon` can be a callback that will be called\n  // when a semicolon is automatically inserted. It will be passed\n  // the position of the comma as an offset, and if `locations` is\n  // enabled, it is given the location as a `{line, column}` object\n  // as second argument.\n  onInsertedSemicolon: null,\n  // `onTrailingComma` is similar to `onInsertedSemicolon`, but for\n  // trailing commas.\n  onTrailingComma: null,\n  // By default, reserved words are only enforced if ecmaVersion >= 5.\n  // Set `allowReserved` to a boolean value to explicitly turn this on\n  // an off. When this option has the value \"never\", reserved words\n  // and keywords can also not be used as property names.\n  allowReserved: null,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program.\n  allowImportExportEverywhere: false,\n  // When enabled, await identifiers are allowed to appear at the top-level scope,\n  // but they are still not allowed in non-async functions.\n  allowAwaitOutsideFunction: false,\n  // When enabled, hashbang directive in the beginning of file\n  // is allowed and treated as a line comment.\n  allowHashBang: false,\n  // When `locations` is on, `loc` properties holding objects with\n  // `start` and `end` properties in `{line, column}` form (with\n  // line being 1-based and column 0-based) will be attached to the\n  // nodes.\n  locations: false,\n  // A function can be passed as `onToken` option, which will\n  // cause Acorn to call that function with object in the same\n  // format as tokens returned from `tokenizer().getToken()`. Note\n  // that you are not allowed to call the parser from the\n  // callback—that will corrupt its internal state.\n  onToken: null,\n  // A function can be passed as `onComment` option, which will\n  // cause Acorn to call that function with `(block, text, start,\n  // end)` parameters whenever a comment is skipped. `block` is a\n  // boolean indicating whether this is a block (`/* */`) comment,\n  // `text` is the content of the comment, and `start` and `end` are\n  // character offsets that denote the start and end of the comment.\n  // When the `locations` option is on, two more parameters are\n  // passed, the full `{line, column}` locations of the start and\n  // end of the comments. Note that you are not allowed to call the\n  // parser from the callback—that will corrupt its internal state.\n  onComment: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // It is possible to parse multiple files into a single AST by\n  // passing the tree produced by parsing the first file as\n  // `program` option in subsequent parses. This will add the\n  // toplevel forms of the parsed file to the `Program` (top) node\n  // of an existing parse tree.\n  program: null,\n  // When `locations` is on, you can pass this to record the source\n  // file in every node's `loc` object.\n  sourceFile: null,\n  // This value, if given, is stored in every node, whether\n  // `locations` is on or off.\n  directSourceFile: null,\n  // When enabled, parenthesized expressions are represented by\n  // (non-standard) ParenthesizedExpression nodes\n  preserveParens: false\n}\n\n// Interpret and default an options object\n\nexport function getOptions(opts) {\n  let options = {}\n\n  for (let opt in defaultOptions)\n    options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt]\n\n  if (options.ecmaVersion >= 2015)\n    options.ecmaVersion -= 2009\n\n  if (options.allowReserved == null)\n    options.allowReserved = options.ecmaVersion < 5\n\n  if (isArray(options.onToken)) {\n    let tokens = options.onToken\n    options.onToken = (token) => tokens.push(token)\n  }\n  if (isArray(options.onComment))\n    options.onComment = pushComment(options, options.onComment)\n\n  return options\n}\n\nfunction pushComment(options, array) {\n  return function(block, text, start, end, startLoc, endLoc) {\n    let comment = {\n      type: block ? \"Block\" : \"Line\",\n      value: text,\n      start: start,\n      end: end\n    }\n    if (options.locations)\n      comment.loc = new SourceLocation(this, startLoc, endLoc)\n    if (options.ranges)\n      comment.range = [start, end]\n    array.push(comment)\n  }\n}\n","// Each scope gets a bitset that may contain these flags\nexport const\n    SCOPE_TOP = 1,\n    SCOPE_FUNCTION = 2,\n    SCOPE_VAR = SCOPE_TOP | SCOPE_FUNCTION,\n    SCOPE_ASYNC = 4,\n    SCOPE_GENERATOR = 8,\n    SCOPE_ARROW = 16,\n    SCOPE_SIMPLE_CATCH = 32,\n    SCOPE_SUPER = 64,\n    SCOPE_DIRECT_SUPER = 128\n\nexport function functionFlags(async, generator) {\n  return SCOPE_FUNCTION | (async ? SCOPE_ASYNC : 0) | (generator ? SCOPE_GENERATOR : 0)\n}\n\n// Used in checkLVal and declareName to determine the type of a binding\nexport const\n    BIND_NONE = 0, // Not a binding\n    BIND_VAR = 1, // Var-style binding\n    BIND_LEXICAL = 2, // Let- or const-style binding\n    BIND_FUNCTION = 3, // Function declaration\n    BIND_SIMPLE_CATCH = 4, // Simple (identifier pattern) catch binding\n    BIND_OUTSIDE = 5 // Special case for function names as bound inside the function\n","import {reservedWords, keywords} from \"./identifier\"\nimport {types as tt} from \"./tokentype\"\nimport {lineBreak} from \"./whitespace\"\nimport {getOptions} from \"./options\"\nimport {wordsRegexp} from \"./util\"\nimport {SCOPE_TOP, SCOPE_FUNCTION, SCOPE_ASYNC, SCOPE_GENERATOR, SCOPE_SUPER, SCOPE_DIRECT_SUPER} from \"./scopeflags\"\n\nexport class Parser {\n  constructor(options, input, startPos) {\n    this.options = options = getOptions(options)\n    this.sourceFile = options.sourceFile\n    this.keywords = wordsRegexp(keywords[options.ecmaVersion >= 6 ? 6 : 5])\n    let reserved = \"\"\n    if (!options.allowReserved) {\n      for (let v = options.ecmaVersion;; v--)\n        if (reserved = reservedWords[v]) break\n      if (options.sourceType === \"module\") reserved += \" await\"\n    }\n    this.reservedWords = wordsRegexp(reserved)\n    let reservedStrict = (reserved ? reserved + \" \" : \"\") + reservedWords.strict\n    this.reservedWordsStrict = wordsRegexp(reservedStrict)\n    this.reservedWordsStrictBind = wordsRegexp(reservedStrict + \" \" + reservedWords.strictBind)\n    this.input = String(input)\n\n    // Used to signal to callers of `readWord1` whether the word\n    // contained any escape sequences. This is needed because words with\n    // escape sequences must not be interpreted as keywords.\n    this.containsEsc = false\n\n    // Set up token state\n\n    // The current position of the tokenizer in the input.\n    if (startPos) {\n      this.pos = startPos\n      this.lineStart = this.input.lastIndexOf(\"\\n\", startPos - 1) + 1\n      this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length\n    } else {\n      this.pos = this.lineStart = 0\n      this.curLine = 1\n    }\n\n    // Properties of the current token:\n    // Its type\n    this.type = tt.eof\n    // For tokens that include more information than their type, the value\n    this.value = null\n    // Its start and end offset\n    this.start = this.end = this.pos\n    // And, if locations are used, the {line, column} object\n    // corresponding to those offsets\n    this.startLoc = this.endLoc = this.curPosition()\n\n    // Position information for the previous token\n    this.lastTokEndLoc = this.lastTokStartLoc = null\n    this.lastTokStart = this.lastTokEnd = this.pos\n\n    // The context stack is used to superficially track syntactic\n    // context to predict whether a regular expression is allowed in a\n    // given position.\n    this.context = this.initialContext()\n    this.exprAllowed = true\n\n    // Figure out if it's a module code.\n    this.inModule = options.sourceType === \"module\"\n    this.strict = this.inModule || this.strictDirective(this.pos)\n\n    // Used to signify the start of a potential arrow function\n    this.potentialArrowAt = -1\n\n    // Positions to delayed-check that yield/await does not exist in default parameters.\n    this.yieldPos = this.awaitPos = this.awaitIdentPos = 0\n    // Labels in scope.\n    this.labels = []\n    // Thus-far undefined exports.\n    this.undefinedExports = {}\n\n    // If enabled, skip leading hashbang line.\n    if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === \"#!\")\n      this.skipLineComment(2)\n\n    // Scope tracking for duplicate variable names (see scope.js)\n    this.scopeStack = []\n    this.enterScope(SCOPE_TOP)\n\n    // For RegExp validation\n    this.regexpState = null\n  }\n\n  parse() {\n    let node = this.options.program || this.startNode()\n    this.nextToken()\n    return this.parseTopLevel(node)\n  }\n\n  get inFunction() { return (this.currentVarScope().flags & SCOPE_FUNCTION) > 0 }\n  get inGenerator() { return (this.currentVarScope().flags & SCOPE_GENERATOR) > 0 }\n  get inAsync() { return (this.currentVarScope().flags & SCOPE_ASYNC) > 0 }\n  get allowSuper() { return (this.currentThisScope().flags & SCOPE_SUPER) > 0 }\n  get allowDirectSuper() { return (this.currentThisScope().flags & SCOPE_DIRECT_SUPER) > 0 }\n  get treatFunctionsAsVar() { return this.treatFunctionsAsVarInScope(this.currentScope()) }\n\n  // Switch to a getter for 7.0.0.\n  inNonArrowFunction() { return (this.currentThisScope().flags & SCOPE_FUNCTION) > 0 }\n\n  static extend(...plugins) {\n    let cls = this\n    for (let i = 0; i < plugins.length; i++) cls = plugins[i](cls)\n    return cls\n  }\n\n  static parse(input, options) {\n    return new this(options, input).parse()\n  }\n\n  static parseExpressionAt(input, pos, options) {\n    let parser = new this(options, input, pos)\n    parser.nextToken()\n    return parser.parseExpression()\n  }\n\n  static tokenizer(input, options) {\n    return new this(options, input)\n  }\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {lineBreak, skipWhiteSpace} from \"./whitespace\"\n\nconst pp = Parser.prototype\n\n// ## Parser utilities\n\nconst literal = /^(?:'((?:\\\\.|[^'])*?)'|\"((?:\\\\.|[^\"])*?)\")/\npp.strictDirective = function(start) {\n  for (;;) {\n    // Try to find string literal.\n    skipWhiteSpace.lastIndex = start\n    start += skipWhiteSpace.exec(this.input)[0].length\n    let match = literal.exec(this.input.slice(start))\n    if (!match) return false\n    if ((match[1] || match[2]) === \"use strict\") return true\n    start += match[0].length\n\n    // Skip semicolon, if any.\n    skipWhiteSpace.lastIndex = start\n    start += skipWhiteSpace.exec(this.input)[0].length\n    if (this.input[start] === \";\")\n      start++\n  }\n}\n\n// Predicate that tests whether the next token is of the given\n// type, and if yes, consumes it as a side effect.\n\npp.eat = function(type) {\n  if (this.type === type) {\n    this.next()\n    return true\n  } else {\n    return false\n  }\n}\n\n// Tests whether parsed token is a contextual keyword.\n\npp.isContextual = function(name) {\n  return this.type === tt.name && this.value === name && !this.containsEsc\n}\n\n// Consumes contextual keyword if possible.\n\npp.eatContextual = function(name) {\n  if (!this.isContextual(name)) return false\n  this.next()\n  return true\n}\n\n// Asserts that following token is given contextual keyword.\n\npp.expectContextual = function(name) {\n  if (!this.eatContextual(name)) this.unexpected()\n}\n\n// Test whether a semicolon can be inserted at the current position.\n\npp.canInsertSemicolon = function() {\n  return this.type === tt.eof ||\n    this.type === tt.braceR ||\n    lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n}\n\npp.insertSemicolon = function() {\n  if (this.canInsertSemicolon()) {\n    if (this.options.onInsertedSemicolon)\n      this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc)\n    return true\n  }\n}\n\n// Consume a semicolon, or, failing that, see if we are allowed to\n// pretend that there is a semicolon at this position.\n\npp.semicolon = function() {\n  if (!this.eat(tt.semi) && !this.insertSemicolon()) this.unexpected()\n}\n\npp.afterTrailingComma = function(tokType, notNext) {\n  if (this.type === tokType) {\n    if (this.options.onTrailingComma)\n      this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc)\n    if (!notNext)\n      this.next()\n    return true\n  }\n}\n\n// Expect a token of a given type. If found, consume it, otherwise,\n// raise an unexpected token error.\n\npp.expect = function(type) {\n  this.eat(type) || this.unexpected()\n}\n\n// Raise an unexpected token error.\n\npp.unexpected = function(pos) {\n  this.raise(pos != null ? pos : this.start, \"Unexpected token\")\n}\n\nexport function DestructuringErrors() {\n  this.shorthandAssign =\n  this.trailingComma =\n  this.parenthesizedAssign =\n  this.parenthesizedBind =\n  this.doubleProto =\n    -1\n}\n\npp.checkPatternErrors = function(refDestructuringErrors, isAssign) {\n  if (!refDestructuringErrors) return\n  if (refDestructuringErrors.trailingComma > -1)\n    this.raiseRecoverable(refDestructuringErrors.trailingComma, \"Comma is not permitted after the rest element\")\n  let parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind\n  if (parens > -1) this.raiseRecoverable(parens, \"Parenthesized pattern\")\n}\n\npp.checkExpressionErrors = function(refDestructuringErrors, andThrow) {\n  if (!refDestructuringErrors) return false\n  let {shorthandAssign, doubleProto} = refDestructuringErrors\n  if (!andThrow) return shorthandAssign >= 0 || doubleProto >= 0\n  if (shorthandAssign >= 0)\n    this.raise(shorthandAssign, \"Shorthand property assignments are valid only in destructuring patterns\")\n  if (doubleProto >= 0)\n    this.raiseRecoverable(doubleProto, \"Redefinition of __proto__ property\")\n}\n\npp.checkYieldAwaitInDefaultParams = function() {\n  if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos))\n    this.raise(this.yieldPos, \"Yield expression cannot be a default value\")\n  if (this.awaitPos)\n    this.raise(this.awaitPos, \"Await expression cannot be a default value\")\n}\n\npp.isSimpleAssignTarget = function(expr) {\n  if (expr.type === \"ParenthesizedExpression\")\n    return this.isSimpleAssignTarget(expr.expression)\n  return expr.type === \"Identifier\" || expr.type === \"MemberExpression\"\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {lineBreak, skipWhiteSpace} from \"./whitespace\"\nimport {isIdentifierStart, isIdentifierChar, keywordRelationalOperator} from \"./identifier\"\nimport {has} from \"./util\"\nimport {DestructuringErrors} from \"./parseutil\"\nimport {functionFlags, SCOPE_SIMPLE_CATCH, BIND_SIMPLE_CATCH, BIND_LEXICAL, BIND_VAR, BIND_FUNCTION} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// ### Statement parsing\n\n// Parse a program. Initializes the parser, reads any number of\n// statements, and wraps them in a Program node.  Optionally takes a\n// `program` argument.  If present, the statements will be appended\n// to its body instead of creating a new node.\n\npp.parseTopLevel = function(node) {\n  let exports = {}\n  if (!node.body) node.body = []\n  while (this.type !== tt.eof) {\n    let stmt = this.parseStatement(null, true, exports)\n    node.body.push(stmt)\n  }\n  if (this.inModule)\n    for (let name of Object.keys(this.undefinedExports))\n      this.raiseRecoverable(this.undefinedExports[name].start, `Export '${name}' is not defined`)\n  this.adaptDirectivePrologue(node.body)\n  this.next()\n  if (this.options.ecmaVersion >= 6) {\n    node.sourceType = this.options.sourceType\n  }\n  return this.finishNode(node, \"Program\")\n}\n\nconst loopLabel = {kind: \"loop\"}, switchLabel = {kind: \"switch\"}\n\npp.isLet = function(context) {\n  if (this.options.ecmaVersion < 6 || !this.isContextual(\"let\")) return false\n  skipWhiteSpace.lastIndex = this.pos\n  let skip = skipWhiteSpace.exec(this.input)\n  let next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next)\n  // For ambiguous cases, determine if a LexicalDeclaration (or only a\n  // Statement) is allowed here. If context is not empty then only a Statement\n  // is allowed. However, `let [` is an explicit negative lookahead for\n  // ExpressionStatement, so special-case it first.\n  if (nextCh === 91) return true // '['\n  if (context) return false\n\n  if (nextCh === 123) return true // '{'\n  if (isIdentifierStart(nextCh, true)) {\n    let pos = next + 1\n    while (isIdentifierChar(this.input.charCodeAt(pos), true)) ++pos\n    let ident = this.input.slice(next, pos)\n    if (!keywordRelationalOperator.test(ident)) return true\n  }\n  return false\n}\n\n// check 'async [no LineTerminator here] function'\n// - 'async /*foo*/ function' is OK.\n// - 'async /*\\n*/ function' is invalid.\npp.isAsyncFunction = function() {\n  if (this.options.ecmaVersion < 8 || !this.isContextual(\"async\"))\n    return false\n\n  skipWhiteSpace.lastIndex = this.pos\n  let skip = skipWhiteSpace.exec(this.input)\n  let next = this.pos + skip[0].length\n  return !lineBreak.test(this.input.slice(this.pos, next)) &&\n    this.input.slice(next, next + 8) === \"function\" &&\n    (next + 8 === this.input.length || !isIdentifierChar(this.input.charAt(next + 8)))\n}\n\n// Parse a single statement.\n//\n// If expecting a statement and finding a slash operator, parse a\n// regular expression literal. This is to handle cases like\n// `if (foo) /blah/.exec(foo)`, where looking at the previous token\n// does not help.\n\npp.parseStatement = function(context, topLevel, exports) {\n  let starttype = this.type, node = this.startNode(), kind\n\n  if (this.isLet(context)) {\n    starttype = tt._var\n    kind = \"let\"\n  }\n\n  // Most types of statements are recognized by the keyword they\n  // start with. Many are trivial to parse, some require a bit of\n  // complexity.\n\n  switch (starttype) {\n  case tt._break: case tt._continue: return this.parseBreakContinueStatement(node, starttype.keyword)\n  case tt._debugger: return this.parseDebuggerStatement(node)\n  case tt._do: return this.parseDoStatement(node)\n  case tt._for: return this.parseForStatement(node)\n  case tt._function:\n    // Function as sole body of either an if statement or a labeled statement\n    // works, but not when it is part of a labeled statement that is the sole\n    // body of an if statement.\n    if ((context && (this.strict || context !== \"if\" && context !== \"label\")) && this.options.ecmaVersion >= 6) this.unexpected()\n    return this.parseFunctionStatement(node, false, !context)\n  case tt._class:\n    if (context) this.unexpected()\n    return this.parseClass(node, true)\n  case tt._if: return this.parseIfStatement(node)\n  case tt._return: return this.parseReturnStatement(node)\n  case tt._switch: return this.parseSwitchStatement(node)\n  case tt._throw: return this.parseThrowStatement(node)\n  case tt._try: return this.parseTryStatement(node)\n  case tt._const: case tt._var:\n    kind = kind || this.value\n    if (context && kind !== \"var\") this.unexpected()\n    return this.parseVarStatement(node, kind)\n  case tt._while: return this.parseWhileStatement(node)\n  case tt._with: return this.parseWithStatement(node)\n  case tt.braceL: return this.parseBlock(true, node)\n  case tt.semi: return this.parseEmptyStatement(node)\n  case tt._export:\n  case tt._import:\n    if (!this.options.allowImportExportEverywhere) {\n      if (!topLevel)\n        this.raise(this.start, \"'import' and 'export' may only appear at the top level\")\n      if (!this.inModule)\n        this.raise(this.start, \"'import' and 'export' may appear only with 'sourceType: module'\")\n    }\n    return starttype === tt._import ? this.parseImport(node) : this.parseExport(node, exports)\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n  default:\n    if (this.isAsyncFunction()) {\n      if (context) this.unexpected()\n      this.next()\n      return this.parseFunctionStatement(node, true, !context)\n    }\n\n    let maybeName = this.value, expr = this.parseExpression()\n    if (starttype === tt.name && expr.type === \"Identifier\" && this.eat(tt.colon))\n      return this.parseLabeledStatement(node, maybeName, expr, context)\n    else return this.parseExpressionStatement(node, expr)\n  }\n}\n\npp.parseBreakContinueStatement = function(node, keyword) {\n  let isBreak = keyword === \"break\"\n  this.next()\n  if (this.eat(tt.semi) || this.insertSemicolon()) node.label = null\n  else if (this.type !== tt.name) this.unexpected()\n  else {\n    node.label = this.parseIdent()\n    this.semicolon()\n  }\n\n  // Verify that there is an actual destination to break or\n  // continue to.\n  let i = 0\n  for (; i < this.labels.length; ++i) {\n    let lab = this.labels[i]\n    if (node.label == null || lab.name === node.label.name) {\n      if (lab.kind != null && (isBreak || lab.kind === \"loop\")) break\n      if (node.label && isBreak) break\n    }\n  }\n  if (i === this.labels.length) this.raise(node.start, \"Unsyntactic \" + keyword)\n  return this.finishNode(node, isBreak ? \"BreakStatement\" : \"ContinueStatement\")\n}\n\npp.parseDebuggerStatement = function(node) {\n  this.next()\n  this.semicolon()\n  return this.finishNode(node, \"DebuggerStatement\")\n}\n\npp.parseDoStatement = function(node) {\n  this.next()\n  this.labels.push(loopLabel)\n  node.body = this.parseStatement(\"do\")\n  this.labels.pop()\n  this.expect(tt._while)\n  node.test = this.parseParenExpression()\n  if (this.options.ecmaVersion >= 6)\n    this.eat(tt.semi)\n  else\n    this.semicolon()\n  return this.finishNode(node, \"DoWhileStatement\")\n}\n\n// Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n// loop is non-trivial. Basically, we have to parse the init `var`\n// statement or expression, disallowing the `in` operator (see\n// the second parameter to `parseExpression`), and then check\n// whether the next token is `in` or `of`. When there is no init\n// part (semicolon immediately after the opening parenthesis), it\n// is a regular `for` loop.\n\npp.parseForStatement = function(node) {\n  this.next()\n  let awaitAt = (this.options.ecmaVersion >= 9 && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction)) && this.eatContextual(\"await\")) ? this.lastTokStart : -1\n  this.labels.push(loopLabel)\n  this.enterScope(0)\n  this.expect(tt.parenL)\n  if (this.type === tt.semi) {\n    if (awaitAt > -1) this.unexpected(awaitAt)\n    return this.parseFor(node, null)\n  }\n  let isLet = this.isLet()\n  if (this.type === tt._var || this.type === tt._const || isLet) {\n    let init = this.startNode(), kind = isLet ? \"let\" : this.value\n    this.next()\n    this.parseVar(init, true, kind)\n    this.finishNode(init, \"VariableDeclaration\")\n    if ((this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) && init.declarations.length === 1 &&\n        !(kind !== \"var\" && init.declarations[0].init)) {\n      if (this.options.ecmaVersion >= 9) {\n        if (this.type === tt._in) {\n          if (awaitAt > -1) this.unexpected(awaitAt)\n        } else node.await = awaitAt > -1\n      }\n      return this.parseForIn(node, init)\n    }\n    if (awaitAt > -1) this.unexpected(awaitAt)\n    return this.parseFor(node, init)\n  }\n  let refDestructuringErrors = new DestructuringErrors\n  let init = this.parseExpression(true, refDestructuringErrors)\n  if (this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\"))) {\n    if (this.options.ecmaVersion >= 9) {\n      if (this.type === tt._in) {\n        if (awaitAt > -1) this.unexpected(awaitAt)\n      } else node.await = awaitAt > -1\n    }\n    this.toAssignable(init, false, refDestructuringErrors)\n    this.checkLVal(init)\n    return this.parseForIn(node, init)\n  } else {\n    this.checkExpressionErrors(refDestructuringErrors, true)\n  }\n  if (awaitAt > -1) this.unexpected(awaitAt)\n  return this.parseFor(node, init)\n}\n\npp.parseFunctionStatement = function(node, isAsync, declarationPosition) {\n  this.next()\n  return this.parseFunction(node, FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT), false, isAsync)\n}\n\npp.parseIfStatement = function(node) {\n  this.next()\n  node.test = this.parseParenExpression()\n  // allow function declarations in branches, but only in non-strict mode\n  node.consequent = this.parseStatement(\"if\")\n  node.alternate = this.eat(tt._else) ? this.parseStatement(\"if\") : null\n  return this.finishNode(node, \"IfStatement\")\n}\n\npp.parseReturnStatement = function(node) {\n  if (!this.inFunction && !this.options.allowReturnOutsideFunction)\n    this.raise(this.start, \"'return' outside of function\")\n  this.next()\n\n  // In `return` (and `break`/`continue`), the keywords with\n  // optional arguments, we eagerly look for a semicolon or the\n  // possibility to insert one.\n\n  if (this.eat(tt.semi) || this.insertSemicolon()) node.argument = null\n  else { node.argument = this.parseExpression(); this.semicolon() }\n  return this.finishNode(node, \"ReturnStatement\")\n}\n\npp.parseSwitchStatement = function(node) {\n  this.next()\n  node.discriminant = this.parseParenExpression()\n  node.cases = []\n  this.expect(tt.braceL)\n  this.labels.push(switchLabel)\n  this.enterScope(0)\n\n  // Statements under must be grouped (by label) in SwitchCase\n  // nodes. `cur` is used to keep the node that we are currently\n  // adding statements to.\n\n  let cur\n  for (let sawDefault = false; this.type !== tt.braceR;) {\n    if (this.type === tt._case || this.type === tt._default) {\n      let isCase = this.type === tt._case\n      if (cur) this.finishNode(cur, \"SwitchCase\")\n      node.cases.push(cur = this.startNode())\n      cur.consequent = []\n      this.next()\n      if (isCase) {\n        cur.test = this.parseExpression()\n      } else {\n        if (sawDefault) this.raiseRecoverable(this.lastTokStart, \"Multiple default clauses\")\n        sawDefault = true\n        cur.test = null\n      }\n      this.expect(tt.colon)\n    } else {\n      if (!cur) this.unexpected()\n      cur.consequent.push(this.parseStatement(null))\n    }\n  }\n  this.exitScope()\n  if (cur) this.finishNode(cur, \"SwitchCase\")\n  this.next() // Closing brace\n  this.labels.pop()\n  return this.finishNode(node, \"SwitchStatement\")\n}\n\npp.parseThrowStatement = function(node) {\n  this.next()\n  if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start)))\n    this.raise(this.lastTokEnd, \"Illegal newline after throw\")\n  node.argument = this.parseExpression()\n  this.semicolon()\n  return this.finishNode(node, \"ThrowStatement\")\n}\n\n// Reused empty array added for node fields that are always empty.\n\nconst empty = []\n\npp.parseTryStatement = function(node) {\n  this.next()\n  node.block = this.parseBlock()\n  node.handler = null\n  if (this.type === tt._catch) {\n    let clause = this.startNode()\n    this.next()\n    if (this.eat(tt.parenL)) {\n      clause.param = this.parseBindingAtom()\n      let simple = clause.param.type === \"Identifier\"\n      this.enterScope(simple ? SCOPE_SIMPLE_CATCH : 0)\n      this.checkLVal(clause.param, simple ? BIND_SIMPLE_CATCH : BIND_LEXICAL)\n      this.expect(tt.parenR)\n    } else {\n      if (this.options.ecmaVersion < 10) this.unexpected()\n      clause.param = null\n      this.enterScope(0)\n    }\n    clause.body = this.parseBlock(false)\n    this.exitScope()\n    node.handler = this.finishNode(clause, \"CatchClause\")\n  }\n  node.finalizer = this.eat(tt._finally) ? this.parseBlock() : null\n  if (!node.handler && !node.finalizer)\n    this.raise(node.start, \"Missing catch or finally clause\")\n  return this.finishNode(node, \"TryStatement\")\n}\n\npp.parseVarStatement = function(node, kind) {\n  this.next()\n  this.parseVar(node, false, kind)\n  this.semicolon()\n  return this.finishNode(node, \"VariableDeclaration\")\n}\n\npp.parseWhileStatement = function(node) {\n  this.next()\n  node.test = this.parseParenExpression()\n  this.labels.push(loopLabel)\n  node.body = this.parseStatement(\"while\")\n  this.labels.pop()\n  return this.finishNode(node, \"WhileStatement\")\n}\n\npp.parseWithStatement = function(node) {\n  if (this.strict) this.raise(this.start, \"'with' in strict mode\")\n  this.next()\n  node.object = this.parseParenExpression()\n  node.body = this.parseStatement(\"with\")\n  return this.finishNode(node, \"WithStatement\")\n}\n\npp.parseEmptyStatement = function(node) {\n  this.next()\n  return this.finishNode(node, \"EmptyStatement\")\n}\n\npp.parseLabeledStatement = function(node, maybeName, expr, context) {\n  for (let label of this.labels)\n    if (label.name === maybeName)\n      this.raise(expr.start, \"Label '\" + maybeName + \"' is already declared\")\n  let kind = this.type.isLoop ? \"loop\" : this.type === tt._switch ? \"switch\" : null\n  for (let i = this.labels.length - 1; i >= 0; i--) {\n    let label = this.labels[i]\n    if (label.statementStart === node.start) {\n      // Update information about previous labels on this node\n      label.statementStart = this.start\n      label.kind = kind\n    } else break\n  }\n  this.labels.push({name: maybeName, kind, statementStart: this.start})\n  node.body = this.parseStatement(context ? context.indexOf(\"label\") === -1 ? context + \"label\" : context : \"label\")\n  this.labels.pop()\n  node.label = expr\n  return this.finishNode(node, \"LabeledStatement\")\n}\n\npp.parseExpressionStatement = function(node, expr) {\n  node.expression = expr\n  this.semicolon()\n  return this.finishNode(node, \"ExpressionStatement\")\n}\n\n// Parse a semicolon-enclosed block of statements, handling `\"use\n// strict\"` declarations when `allowStrict` is true (used for\n// function bodies).\n\npp.parseBlock = function(createNewLexicalScope = true, node = this.startNode()) {\n  node.body = []\n  this.expect(tt.braceL)\n  if (createNewLexicalScope) this.enterScope(0)\n  while (!this.eat(tt.braceR)) {\n    let stmt = this.parseStatement(null)\n    node.body.push(stmt)\n  }\n  if (createNewLexicalScope) this.exitScope()\n  return this.finishNode(node, \"BlockStatement\")\n}\n\n// Parse a regular `for` loop. The disambiguation code in\n// `parseStatement` will already have parsed the init statement or\n// expression.\n\npp.parseFor = function(node, init) {\n  node.init = init\n  this.expect(tt.semi)\n  node.test = this.type === tt.semi ? null : this.parseExpression()\n  this.expect(tt.semi)\n  node.update = this.type === tt.parenR ? null : this.parseExpression()\n  this.expect(tt.parenR)\n  node.body = this.parseStatement(\"for\")\n  this.exitScope()\n  this.labels.pop()\n  return this.finishNode(node, \"ForStatement\")\n}\n\n// Parse a `for`/`in` and `for`/`of` loop, which are almost\n// same from parser's perspective.\n\npp.parseForIn = function(node, init) {\n  let type = this.type === tt._in ? \"ForInStatement\" : \"ForOfStatement\"\n  this.next()\n  if (type === \"ForInStatement\") {\n    if (init.type === \"AssignmentPattern\" ||\n      (init.type === \"VariableDeclaration\" && init.declarations[0].init != null &&\n       (this.strict || init.declarations[0].id.type !== \"Identifier\")))\n      this.raise(init.start, \"Invalid assignment in for-in loop head\")\n  }\n  node.left = init\n  node.right = type === \"ForInStatement\" ? this.parseExpression() : this.parseMaybeAssign()\n  this.expect(tt.parenR)\n  node.body = this.parseStatement(\"for\")\n  this.exitScope()\n  this.labels.pop()\n  return this.finishNode(node, type)\n}\n\n// Parse a list of variable declarations.\n\npp.parseVar = function(node, isFor, kind) {\n  node.declarations = []\n  node.kind = kind\n  for (;;) {\n    let decl = this.startNode()\n    this.parseVarId(decl, kind)\n    if (this.eat(tt.eq)) {\n      decl.init = this.parseMaybeAssign(isFor)\n    } else if (kind === \"const\" && !(this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual(\"of\")))) {\n      this.unexpected()\n    } else if (decl.id.type !== \"Identifier\" && !(isFor && (this.type === tt._in || this.isContextual(\"of\")))) {\n      this.raise(this.lastTokEnd, \"Complex binding patterns require an initialization value\")\n    } else {\n      decl.init = null\n    }\n    node.declarations.push(this.finishNode(decl, \"VariableDeclarator\"))\n    if (!this.eat(tt.comma)) break\n  }\n  return node\n}\n\npp.parseVarId = function(decl, kind) {\n  if ((kind === \"const\" || kind === \"let\") && this.isContextual(\"let\")) {\n    this.raiseRecoverable(this.start, \"let is disallowed as a lexically bound name\")\n  }\n  decl.id = this.parseBindingAtom()\n  this.checkLVal(decl.id, kind === \"var\" ? BIND_VAR : BIND_LEXICAL, false)\n}\n\nconst FUNC_STATEMENT = 1, FUNC_HANGING_STATEMENT = 2, FUNC_NULLABLE_ID = 4\n\n// Parse a function declaration or literal (depending on the\n// `statement & FUNC_STATEMENT`).\n\n// Remove `allowExpressionBody` for 7.0.0, as it is only called with false\npp.parseFunction = function(node, statement, allowExpressionBody, isAsync) {\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 9 || this.options.ecmaVersion >= 6 && !isAsync) {\n    if (this.type === tt.star && (statement & FUNC_HANGING_STATEMENT))\n      this.unexpected()\n    node.generator = this.eat(tt.star)\n  }\n  if (this.options.ecmaVersion >= 8)\n    node.async = !!isAsync\n\n  if (statement & FUNC_STATEMENT) {\n    node.id = (statement & FUNC_NULLABLE_ID) && this.type !== tt.name ? null : this.parseIdent()\n    if (node.id && !(statement & FUNC_HANGING_STATEMENT))\n      // If it is a regular function declaration in sloppy mode, then it is\n      // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n      // mode depends on properties of the current scope (see\n      // treatFunctionsAsVar).\n      this.checkLVal(node.id, (this.strict || node.generator || node.async) ? this.treatFunctionsAsVar ? BIND_VAR : BIND_LEXICAL : BIND_FUNCTION)\n  }\n\n  let oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n  this.enterScope(functionFlags(node.async, node.generator))\n\n  if (!(statement & FUNC_STATEMENT))\n    node.id = this.type === tt.name ? this.parseIdent() : null\n\n  this.parseFunctionParams(node)\n  this.parseFunctionBody(node, allowExpressionBody, false)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, (statement & FUNC_STATEMENT) ? \"FunctionDeclaration\" : \"FunctionExpression\")\n}\n\npp.parseFunctionParams = function(node) {\n  this.expect(tt.parenL)\n  node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8)\n  this.checkYieldAwaitInDefaultParams()\n}\n\n// Parse a class declaration or literal (depending on the\n// `isStatement` parameter).\n\npp.parseClass = function(node, isStatement) {\n  this.next()\n\n  // ecma-262 14.6 Class Definitions\n  // A class definition is always strict mode code.\n  const oldStrict = this.strict\n  this.strict = true\n\n  this.parseClassId(node, isStatement)\n  this.parseClassSuper(node)\n  let classBody = this.startNode()\n  let hadConstructor = false\n  classBody.body = []\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    const element = this.parseClassElement(node.superClass !== null)\n    if (element) {\n      classBody.body.push(element)\n      if (element.type === \"MethodDefinition\" && element.kind === \"constructor\") {\n        if (hadConstructor) this.raise(element.start, \"Duplicate constructor in the same class\")\n        hadConstructor = true\n      }\n    }\n  }\n  node.body = this.finishNode(classBody, \"ClassBody\")\n  this.strict = oldStrict\n  return this.finishNode(node, isStatement ? \"ClassDeclaration\" : \"ClassExpression\")\n}\n\npp.parseClassElement = function(constructorAllowsSuper) {\n  if (this.eat(tt.semi)) return null\n\n  let method = this.startNode()\n  const tryContextual = (k, noLineBreak = false) => {\n    const start = this.start, startLoc = this.startLoc\n    if (!this.eatContextual(k)) return false\n    if (this.type !== tt.parenL && (!noLineBreak || !this.canInsertSemicolon())) return true\n    if (method.key) this.unexpected()\n    method.computed = false\n    method.key = this.startNodeAt(start, startLoc)\n    method.key.name = k\n    this.finishNode(method.key, \"Identifier\")\n    return false\n  }\n\n  method.kind = \"method\"\n  method.static = tryContextual(\"static\")\n  let isGenerator = this.eat(tt.star)\n  let isAsync = false\n  if (!isGenerator) {\n    if (this.options.ecmaVersion >= 8 && tryContextual(\"async\", true)) {\n      isAsync = true\n      isGenerator = this.options.ecmaVersion >= 9 && this.eat(tt.star)\n    } else if (tryContextual(\"get\")) {\n      method.kind = \"get\"\n    } else if (tryContextual(\"set\")) {\n      method.kind = \"set\"\n    }\n  }\n  if (!method.key) this.parsePropertyName(method)\n  let {key} = method\n  let allowsDirectSuper = false\n  if (!method.computed && !method.static && (key.type === \"Identifier\" && key.name === \"constructor\" ||\n      key.type === \"Literal\" && key.value === \"constructor\")) {\n    if (method.kind !== \"method\") this.raise(key.start, \"Constructor can't have get/set modifier\")\n    if (isGenerator) this.raise(key.start, \"Constructor can't be a generator\")\n    if (isAsync) this.raise(key.start, \"Constructor can't be an async method\")\n    method.kind = \"constructor\"\n    allowsDirectSuper = constructorAllowsSuper\n  } else if (method.static && key.type === \"Identifier\" && key.name === \"prototype\") {\n    this.raise(key.start, \"Classes may not have a static property named prototype\")\n  }\n  this.parseClassMethod(method, isGenerator, isAsync, allowsDirectSuper)\n  if (method.kind === \"get\" && method.value.params.length !== 0)\n    this.raiseRecoverable(method.value.start, \"getter should have no params\")\n  if (method.kind === \"set\" && method.value.params.length !== 1)\n    this.raiseRecoverable(method.value.start, \"setter should have exactly one param\")\n  if (method.kind === \"set\" && method.value.params[0].type === \"RestElement\")\n    this.raiseRecoverable(method.value.params[0].start, \"Setter cannot use rest params\")\n  return method\n}\n\npp.parseClassMethod = function(method, isGenerator, isAsync, allowsDirectSuper) {\n  method.value = this.parseMethod(isGenerator, isAsync, allowsDirectSuper)\n  return this.finishNode(method, \"MethodDefinition\")\n}\n\npp.parseClassId = function(node, isStatement) {\n  if (this.type === tt.name) {\n    node.id = this.parseIdent()\n    if (isStatement)\n      this.checkLVal(node.id, BIND_LEXICAL, false)\n  } else {\n    if (isStatement === true)\n      this.unexpected()\n    node.id = null\n  }\n}\n\npp.parseClassSuper = function(node) {\n  node.superClass = this.eat(tt._extends) ? this.parseExprSubscripts() : null\n}\n\n// Parses module export declaration.\n\npp.parseExport = function(node, exports) {\n  this.next()\n  // export * from '...'\n  if (this.eat(tt.star)) {\n    this.expectContextual(\"from\")\n    if (this.type !== tt.string) this.unexpected()\n    node.source = this.parseExprAtom()\n    this.semicolon()\n    return this.finishNode(node, \"ExportAllDeclaration\")\n  }\n  if (this.eat(tt._default)) { // export default ...\n    this.checkExport(exports, \"default\", this.lastTokStart)\n    let isAsync\n    if (this.type === tt._function || (isAsync = this.isAsyncFunction())) {\n      let fNode = this.startNode()\n      this.next()\n      if (isAsync) this.next()\n      node.declaration = this.parseFunction(fNode, FUNC_STATEMENT | FUNC_NULLABLE_ID, false, isAsync)\n    } else if (this.type === tt._class) {\n      let cNode = this.startNode()\n      node.declaration = this.parseClass(cNode, \"nullableID\")\n    } else {\n      node.declaration = this.parseMaybeAssign()\n      this.semicolon()\n    }\n    return this.finishNode(node, \"ExportDefaultDeclaration\")\n  }\n  // export var|const|let|function|class ...\n  if (this.shouldParseExportStatement()) {\n    node.declaration = this.parseStatement(null)\n    if (node.declaration.type === \"VariableDeclaration\")\n      this.checkVariableExport(exports, node.declaration.declarations)\n    else\n      this.checkExport(exports, node.declaration.id.name, node.declaration.id.start)\n    node.specifiers = []\n    node.source = null\n  } else { // export { x, y as z } [from '...']\n    node.declaration = null\n    node.specifiers = this.parseExportSpecifiers(exports)\n    if (this.eatContextual(\"from\")) {\n      if (this.type !== tt.string) this.unexpected()\n      node.source = this.parseExprAtom()\n    } else {\n      for (let spec of node.specifiers) {\n        // check for keywords used as local names\n        this.checkUnreserved(spec.local)\n        // check if export is defined\n        this.checkLocalExport(spec.local)\n      }\n\n      node.source = null\n    }\n    this.semicolon()\n  }\n  return this.finishNode(node, \"ExportNamedDeclaration\")\n}\n\npp.checkExport = function(exports, name, pos) {\n  if (!exports) return\n  if (has(exports, name))\n    this.raiseRecoverable(pos, \"Duplicate export '\" + name + \"'\")\n  exports[name] = true\n}\n\npp.checkPatternExport = function(exports, pat) {\n  let type = pat.type\n  if (type === \"Identifier\")\n    this.checkExport(exports, pat.name, pat.start)\n  else if (type === \"ObjectPattern\")\n    for (let prop of pat.properties)\n      this.checkPatternExport(exports, prop)\n  else if (type === \"ArrayPattern\")\n    for (let elt of pat.elements) {\n      if (elt) this.checkPatternExport(exports, elt)\n    }\n  else if (type === \"Property\")\n    this.checkPatternExport(exports, pat.value)\n  else if (type === \"AssignmentPattern\")\n    this.checkPatternExport(exports, pat.left)\n  else if (type === \"RestElement\")\n    this.checkPatternExport(exports, pat.argument)\n  else if (type === \"ParenthesizedExpression\")\n    this.checkPatternExport(exports, pat.expression)\n}\n\npp.checkVariableExport = function(exports, decls) {\n  if (!exports) return\n  for (let decl of decls)\n    this.checkPatternExport(exports, decl.id)\n}\n\npp.shouldParseExportStatement = function() {\n  return this.type.keyword === \"var\" ||\n    this.type.keyword === \"const\" ||\n    this.type.keyword === \"class\" ||\n    this.type.keyword === \"function\" ||\n    this.isLet() ||\n    this.isAsyncFunction()\n}\n\n// Parses a comma-separated list of module exports.\n\npp.parseExportSpecifiers = function(exports) {\n  let nodes = [], first = true\n  // export { x, y as z } [from '...']\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    let node = this.startNode()\n    node.local = this.parseIdent(true)\n    node.exported = this.eatContextual(\"as\") ? this.parseIdent(true) : node.local\n    this.checkExport(exports, node.exported.name, node.exported.start)\n    nodes.push(this.finishNode(node, \"ExportSpecifier\"))\n  }\n  return nodes\n}\n\n// Parses import declaration.\n\npp.parseImport = function(node) {\n  this.next()\n  // import '...'\n  if (this.type === tt.string) {\n    node.specifiers = empty\n    node.source = this.parseExprAtom()\n  } else {\n    node.specifiers = this.parseImportSpecifiers()\n    this.expectContextual(\"from\")\n    node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected()\n  }\n  this.semicolon()\n  return this.finishNode(node, \"ImportDeclaration\")\n}\n\n// Parses a comma-separated list of module imports.\n\npp.parseImportSpecifiers = function() {\n  let nodes = [], first = true\n  if (this.type === tt.name) {\n    // import defaultObj, { x, y as z } from '...'\n    let node = this.startNode()\n    node.local = this.parseIdent()\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportDefaultSpecifier\"))\n    if (!this.eat(tt.comma)) return nodes\n  }\n  if (this.type === tt.star) {\n    let node = this.startNode()\n    this.next()\n    this.expectContextual(\"as\")\n    node.local = this.parseIdent()\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportNamespaceSpecifier\"))\n    return nodes\n  }\n  this.expect(tt.braceL)\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    let node = this.startNode()\n    node.imported = this.parseIdent(true)\n    if (this.eatContextual(\"as\")) {\n      node.local = this.parseIdent()\n    } else {\n      this.checkUnreserved(node.imported)\n      node.local = node.imported\n    }\n    this.checkLVal(node.local, BIND_LEXICAL)\n    nodes.push(this.finishNode(node, \"ImportSpecifier\"))\n  }\n  return nodes\n}\n\n// Set `ExpressionStatement#directive` property for directive prologues.\npp.adaptDirectivePrologue = function(statements) {\n  for (let i = 0; i < statements.length && this.isDirectiveCandidate(statements[i]); ++i) {\n    statements[i].directive = statements[i].expression.raw.slice(1, -1)\n  }\n}\npp.isDirectiveCandidate = function(statement) {\n  return (\n    statement.type === \"ExpressionStatement\" &&\n    statement.expression.type === \"Literal\" &&\n    typeof statement.expression.value === \"string\" &&\n    // Reject parenthesized strings.\n    (this.input[statement.start] === \"\\\"\" || this.input[statement.start] === \"'\")\n  )\n}\n","import {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {has} from \"./util\"\nimport {BIND_NONE, BIND_OUTSIDE} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// Convert existing expression atom to assignable pattern\n// if possible.\n\npp.toAssignable = function(node, isBinding, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 6 && node) {\n    switch (node.type) {\n    case \"Identifier\":\n      if (this.inAsync && node.name === \"await\")\n        this.raise(node.start, \"Cannot use 'await' as identifier inside an async function\")\n      break\n\n    case \"ObjectPattern\":\n    case \"ArrayPattern\":\n    case \"RestElement\":\n      break\n\n    case \"ObjectExpression\":\n      node.type = \"ObjectPattern\"\n      if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n      for (let prop of node.properties) {\n        this.toAssignable(prop, isBinding)\n        // Early error:\n        //   AssignmentRestProperty[Yield, Await] :\n        //     `...` DestructuringAssignmentTarget[Yield, Await]\n        //\n        //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.\n        if (\n          prop.type === \"RestElement\" &&\n          (prop.argument.type === \"ArrayPattern\" || prop.argument.type === \"ObjectPattern\")\n        ) {\n          this.raise(prop.argument.start, \"Unexpected token\")\n        }\n      }\n      break\n\n    case \"Property\":\n      // AssignmentProperty has type === \"Property\"\n      if (node.kind !== \"init\") this.raise(node.key.start, \"Object pattern can't contain getter or setter\")\n      this.toAssignable(node.value, isBinding)\n      break\n\n    case \"ArrayExpression\":\n      node.type = \"ArrayPattern\"\n      if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n      this.toAssignableList(node.elements, isBinding)\n      break\n\n    case \"SpreadElement\":\n      node.type = \"RestElement\"\n      this.toAssignable(node.argument, isBinding)\n      if (node.argument.type === \"AssignmentPattern\")\n        this.raise(node.argument.start, \"Rest elements cannot have a default value\")\n      break\n\n    case \"AssignmentExpression\":\n      if (node.operator !== \"=\") this.raise(node.left.end, \"Only '=' operator can be used for specifying default value.\")\n      node.type = \"AssignmentPattern\"\n      delete node.operator\n      this.toAssignable(node.left, isBinding)\n      // falls through to AssignmentPattern\n\n    case \"AssignmentPattern\":\n      break\n\n    case \"ParenthesizedExpression\":\n      this.toAssignable(node.expression, isBinding, refDestructuringErrors)\n      break\n\n    case \"MemberExpression\":\n      if (!isBinding) break\n\n    default:\n      this.raise(node.start, \"Assigning to rvalue\")\n    }\n  } else if (refDestructuringErrors) this.checkPatternErrors(refDestructuringErrors, true)\n  return node\n}\n\n// Convert list of expression atoms to binding list.\n\npp.toAssignableList = function(exprList, isBinding) {\n  let end = exprList.length\n  for (let i = 0; i < end; i++) {\n    let elt = exprList[i]\n    if (elt) this.toAssignable(elt, isBinding)\n  }\n  if (end) {\n    let last = exprList[end - 1]\n    if (this.options.ecmaVersion === 6 && isBinding && last && last.type === \"RestElement\" && last.argument.type !== \"Identifier\")\n      this.unexpected(last.argument.start)\n  }\n  return exprList\n}\n\n// Parses spread element.\n\npp.parseSpread = function(refDestructuringErrors) {\n  let node = this.startNode()\n  this.next()\n  node.argument = this.parseMaybeAssign(false, refDestructuringErrors)\n  return this.finishNode(node, \"SpreadElement\")\n}\n\npp.parseRestBinding = function() {\n  let node = this.startNode()\n  this.next()\n\n  // RestElement inside of a function parameter must be an identifier\n  if (this.options.ecmaVersion === 6 && this.type !== tt.name)\n    this.unexpected()\n\n  node.argument = this.parseBindingAtom()\n\n  return this.finishNode(node, \"RestElement\")\n}\n\n// Parses lvalue (assignable) atom.\n\npp.parseBindingAtom = function() {\n  if (this.options.ecmaVersion >= 6) {\n    switch (this.type) {\n    case tt.bracketL:\n      let node = this.startNode()\n      this.next()\n      node.elements = this.parseBindingList(tt.bracketR, true, true)\n      return this.finishNode(node, \"ArrayPattern\")\n\n    case tt.braceL:\n      return this.parseObj(true)\n    }\n  }\n  return this.parseIdent()\n}\n\npp.parseBindingList = function(close, allowEmpty, allowTrailingComma) {\n  let elts = [], first = true\n  while (!this.eat(close)) {\n    if (first) first = false\n    else this.expect(tt.comma)\n    if (allowEmpty && this.type === tt.comma) {\n      elts.push(null)\n    } else if (allowTrailingComma && this.afterTrailingComma(close)) {\n      break\n    } else if (this.type === tt.ellipsis) {\n      let rest = this.parseRestBinding()\n      this.parseBindingListItem(rest)\n      elts.push(rest)\n      if (this.type === tt.comma) this.raise(this.start, \"Comma is not permitted after the rest element\")\n      this.expect(close)\n      break\n    } else {\n      let elem = this.parseMaybeDefault(this.start, this.startLoc)\n      this.parseBindingListItem(elem)\n      elts.push(elem)\n    }\n  }\n  return elts\n}\n\npp.parseBindingListItem = function(param) {\n  return param\n}\n\n// Parses assignment pattern around given atom if possible.\n\npp.parseMaybeDefault = function(startPos, startLoc, left) {\n  left = left || this.parseBindingAtom()\n  if (this.options.ecmaVersion < 6 || !this.eat(tt.eq)) return left\n  let node = this.startNodeAt(startPos, startLoc)\n  node.left = left\n  node.right = this.parseMaybeAssign()\n  return this.finishNode(node, \"AssignmentPattern\")\n}\n\n// Verify that a node is an lval — something that can be assigned\n// to.\n// bindingType can be either:\n// 'var' indicating that the lval creates a 'var' binding\n// 'let' indicating that the lval creates a lexical ('let' or 'const') binding\n// 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references\n\npp.checkLVal = function(expr, bindingType = BIND_NONE, checkClashes) {\n  switch (expr.type) {\n  case \"Identifier\":\n    if (this.strict && this.reservedWordsStrictBind.test(expr.name))\n      this.raiseRecoverable(expr.start, (bindingType ? \"Binding \" : \"Assigning to \") + expr.name + \" in strict mode\")\n    if (checkClashes) {\n      if (has(checkClashes, expr.name))\n        this.raiseRecoverable(expr.start, \"Argument name clash\")\n      checkClashes[expr.name] = true\n    }\n    if (bindingType !== BIND_NONE && bindingType !== BIND_OUTSIDE) this.declareName(expr.name, bindingType, expr.start)\n    break\n\n  case \"MemberExpression\":\n    if (bindingType) this.raiseRecoverable(expr.start, \"Binding member expression\")\n    break\n\n  case \"ObjectPattern\":\n    for (let prop of expr.properties)\n      this.checkLVal(prop, bindingType, checkClashes)\n    break\n\n  case \"Property\":\n    // AssignmentProperty has type === \"Property\"\n    this.checkLVal(expr.value, bindingType, checkClashes)\n    break\n\n  case \"ArrayPattern\":\n    for (let elem of expr.elements) {\n      if (elem) this.checkLVal(elem, bindingType, checkClashes)\n    }\n    break\n\n  case \"AssignmentPattern\":\n    this.checkLVal(expr.left, bindingType, checkClashes)\n    break\n\n  case \"RestElement\":\n    this.checkLVal(expr.argument, bindingType, checkClashes)\n    break\n\n  case \"ParenthesizedExpression\":\n    this.checkLVal(expr.expression, bindingType, checkClashes)\n    break\n\n  default:\n    this.raise(expr.start, (bindingType ? \"Binding\" : \"Assigning to\") + \" rvalue\")\n  }\n}\n","// A recursive descent parser operates by defining functions for all\n// syntactic elements, and recursively calling those, each function\n// advancing the input stream and returning an AST node. Precedence\n// of constructs (for example, the fact that `!x[1]` means `!(x[1])`\n// instead of `(!x)[1]` is handled by the fact that the parser\n// function that parses unary prefix operators is called first, and\n// in turn calls the function that parses `[]` subscripts — that\n// way, it'll receive the node for `x[1]` already parsed, and wraps\n// *that* in the unary operator node.\n//\n// Acorn uses an [operator precedence parser][opp] to handle binary\n// operator precedence, because it is much more compact than using\n// the technique outlined above, which uses different, nesting\n// functions to specify precedence, for all of the ten binary\n// precedence levels that JavaScript defines.\n//\n// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser\n\nimport {types as tt} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {DestructuringErrors} from \"./parseutil\"\nimport {lineBreak} from \"./whitespace\"\nimport {functionFlags, SCOPE_ARROW, SCOPE_SUPER, SCOPE_DIRECT_SUPER, BIND_OUTSIDE, BIND_VAR} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\n// Check if property name clashes with already added.\n// Object/class getters and setters are not allowed to clash —\n// either with each other or with an init property — and in\n// strict mode, init properties are also not allowed to be repeated.\n\npp.checkPropClash = function(prop, propHash, refDestructuringErrors) {\n  if (this.options.ecmaVersion >= 9 && prop.type === \"SpreadElement\")\n    return\n  if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand))\n    return\n  let {key} = prop, name\n  switch (key.type) {\n  case \"Identifier\": name = key.name; break\n  case \"Literal\": name = String(key.value); break\n  default: return\n  }\n  let {kind} = prop\n  if (this.options.ecmaVersion >= 6) {\n    if (name === \"__proto__\" && kind === \"init\") {\n      if (propHash.proto) {\n        if (refDestructuringErrors && refDestructuringErrors.doubleProto < 0) refDestructuringErrors.doubleProto = key.start\n        // Backwards-compat kludge. Can be removed in version 6.0\n        else this.raiseRecoverable(key.start, \"Redefinition of __proto__ property\")\n      }\n      propHash.proto = true\n    }\n    return\n  }\n  name = \"$\" + name\n  let other = propHash[name]\n  if (other) {\n    let redefinition\n    if (kind === \"init\") {\n      redefinition = this.strict && other.init || other.get || other.set\n    } else {\n      redefinition = other.init || other[kind]\n    }\n    if (redefinition)\n      this.raiseRecoverable(key.start, \"Redefinition of property\")\n  } else {\n    other = propHash[name] = {\n      init: false,\n      get: false,\n      set: false\n    }\n  }\n  other[kind] = true\n}\n\n// ### Expression parsing\n\n// These nest, from the most general expression type at the top to\n// 'atomic', nondivisible expression types at the bottom. Most of\n// the functions will simply let the function(s) below them parse,\n// and, *if* the syntactic construct they handle is present, wrap\n// the AST node that the inner parser gave them in another node.\n\n// Parse a full expression. The optional arguments are used to\n// forbid the `in` operator (in for loops initalization expressions)\n// and provide reference for storing '=' operator inside shorthand\n// property assignment in contexts where both object expression\n// and object pattern might appear (so it's possible to raise\n// delayed syntax error at correct position).\n\npp.parseExpression = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseMaybeAssign(noIn, refDestructuringErrors)\n  if (this.type === tt.comma) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.expressions = [expr]\n    while (this.eat(tt.comma)) node.expressions.push(this.parseMaybeAssign(noIn, refDestructuringErrors))\n    return this.finishNode(node, \"SequenceExpression\")\n  }\n  return expr\n}\n\n// Parse an assignment expression. This includes applications of\n// operators like `+=`.\n\npp.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) {\n  if (this.isContextual(\"yield\")) {\n    if (this.inGenerator) return this.parseYield(noIn)\n    // The tokenizer will assume an expression is allowed after\n    // `yield`, but this isn't that kind of yield\n    else this.exprAllowed = false\n  }\n\n  let ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1, oldShorthandAssign = -1\n  if (refDestructuringErrors) {\n    oldParenAssign = refDestructuringErrors.parenthesizedAssign\n    oldTrailingComma = refDestructuringErrors.trailingComma\n    oldShorthandAssign = refDestructuringErrors.shorthandAssign\n    refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = refDestructuringErrors.shorthandAssign = -1\n  } else {\n    refDestructuringErrors = new DestructuringErrors\n    ownDestructuringErrors = true\n  }\n\n  let startPos = this.start, startLoc = this.startLoc\n  if (this.type === tt.parenL || this.type === tt.name)\n    this.potentialArrowAt = this.start\n  let left = this.parseMaybeConditional(noIn, refDestructuringErrors)\n  if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc)\n  if (this.type.isAssign) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.operator = this.value\n    node.left = this.type === tt.eq ? this.toAssignable(left, false, refDestructuringErrors) : left\n    if (!ownDestructuringErrors) DestructuringErrors.call(refDestructuringErrors)\n    refDestructuringErrors.shorthandAssign = -1 // reset because shorthand default was used correctly\n    this.checkLVal(left)\n    this.next()\n    node.right = this.parseMaybeAssign(noIn)\n    return this.finishNode(node, \"AssignmentExpression\")\n  } else {\n    if (ownDestructuringErrors) this.checkExpressionErrors(refDestructuringErrors, true)\n  }\n  if (oldParenAssign > -1) refDestructuringErrors.parenthesizedAssign = oldParenAssign\n  if (oldTrailingComma > -1) refDestructuringErrors.trailingComma = oldTrailingComma\n  if (oldShorthandAssign > -1) refDestructuringErrors.shorthandAssign = oldShorthandAssign\n  return left\n}\n\n// Parse a ternary conditional (`?:`) operator.\n\npp.parseMaybeConditional = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseExprOps(noIn, refDestructuringErrors)\n  if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n  if (this.eat(tt.question)) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.test = expr\n    node.consequent = this.parseMaybeAssign()\n    this.expect(tt.colon)\n    node.alternate = this.parseMaybeAssign(noIn)\n    return this.finishNode(node, \"ConditionalExpression\")\n  }\n  return expr\n}\n\n// Start the precedence parser.\n\npp.parseExprOps = function(noIn, refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseMaybeUnary(refDestructuringErrors, false)\n  if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n  return expr.start === startPos && expr.type === \"ArrowFunctionExpression\" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn)\n}\n\n// Parse binary operators with the operator precedence parsing\n// algorithm. `left` is the left-hand side of the operator.\n// `minPrec` provides context that allows the function to stop and\n// defer further parser to one of its callers when it encounters an\n// operator that has a lower precedence than the set it is parsing.\n\npp.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) {\n  let prec = this.type.binop\n  if (prec != null && (!noIn || this.type !== tt._in)) {\n    if (prec > minPrec) {\n      let logical = this.type === tt.logicalOR || this.type === tt.logicalAND\n      let op = this.value\n      this.next()\n      let startPos = this.start, startLoc = this.startLoc\n      let right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn)\n      let node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical)\n      return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn)\n    }\n  }\n  return left\n}\n\npp.buildBinary = function(startPos, startLoc, left, right, op, logical) {\n  let node = this.startNodeAt(startPos, startLoc)\n  node.left = left\n  node.operator = op\n  node.right = right\n  return this.finishNode(node, logical ? \"LogicalExpression\" : \"BinaryExpression\")\n}\n\n// Parse unary operators, both prefix and postfix.\n\npp.parseMaybeUnary = function(refDestructuringErrors, sawUnary) {\n  let startPos = this.start, startLoc = this.startLoc, expr\n  if (this.isContextual(\"await\") && (this.inAsync || (!this.inFunction && this.options.allowAwaitOutsideFunction))) {\n    expr = this.parseAwait()\n    sawUnary = true\n  } else if (this.type.prefix) {\n    let node = this.startNode(), update = this.type === tt.incDec\n    node.operator = this.value\n    node.prefix = true\n    this.next()\n    node.argument = this.parseMaybeUnary(null, true)\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    if (update) this.checkLVal(node.argument)\n    else if (this.strict && node.operator === \"delete\" &&\n             node.argument.type === \"Identifier\")\n      this.raiseRecoverable(node.start, \"Deleting local variable in strict mode\")\n    else sawUnary = true\n    expr = this.finishNode(node, update ? \"UpdateExpression\" : \"UnaryExpression\")\n  } else {\n    expr = this.parseExprSubscripts(refDestructuringErrors)\n    if (this.checkExpressionErrors(refDestructuringErrors)) return expr\n    while (this.type.postfix && !this.canInsertSemicolon()) {\n      let node = this.startNodeAt(startPos, startLoc)\n      node.operator = this.value\n      node.prefix = false\n      node.argument = expr\n      this.checkLVal(expr)\n      this.next()\n      expr = this.finishNode(node, \"UpdateExpression\")\n    }\n  }\n\n  if (!sawUnary && this.eat(tt.starstar))\n    return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), \"**\", false)\n  else\n    return expr\n}\n\n// Parse call, dot, and `[]`-subscript expressions.\n\npp.parseExprSubscripts = function(refDestructuringErrors) {\n  let startPos = this.start, startLoc = this.startLoc\n  let expr = this.parseExprAtom(refDestructuringErrors)\n  let skipArrowSubscripts = expr.type === \"ArrowFunctionExpression\" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== \")\"\n  if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) return expr\n  let result = this.parseSubscripts(expr, startPos, startLoc)\n  if (refDestructuringErrors && result.type === \"MemberExpression\") {\n    if (refDestructuringErrors.parenthesizedAssign >= result.start) refDestructuringErrors.parenthesizedAssign = -1\n    if (refDestructuringErrors.parenthesizedBind >= result.start) refDestructuringErrors.parenthesizedBind = -1\n  }\n  return result\n}\n\npp.parseSubscripts = function(base, startPos, startLoc, noCalls) {\n  let maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === \"Identifier\" && base.name === \"async\" &&\n      this.lastTokEnd === base.end && !this.canInsertSemicolon() && this.input.slice(base.start, base.end) === \"async\"\n  while (true) {\n    let element = this.parseSubscript(base, startPos, startLoc, noCalls, maybeAsyncArrow)\n    if (element === base || element.type === \"ArrowFunctionExpression\") return element\n    base = element\n  }\n}\n\npp.parseSubscript = function(base, startPos, startLoc, noCalls, maybeAsyncArrow) {\n  let computed = this.eat(tt.bracketL)\n  if (computed || this.eat(tt.dot)) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.object = base\n    node.property = computed ? this.parseExpression() : this.parseIdent(true)\n    node.computed = !!computed\n    if (computed) this.expect(tt.bracketR)\n    base = this.finishNode(node, \"MemberExpression\")\n  } else if (!noCalls && this.eat(tt.parenL)) {\n    let refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n    this.yieldPos = 0\n    this.awaitPos = 0\n    this.awaitIdentPos = 0\n    let exprList = this.parseExprList(tt.parenR, this.options.ecmaVersion >= 8, false, refDestructuringErrors)\n    if (maybeAsyncArrow && !this.canInsertSemicolon() && this.eat(tt.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false)\n      this.checkYieldAwaitInDefaultParams()\n      if (this.awaitIdentPos > 0)\n        this.raise(this.awaitIdentPos, \"Cannot use 'await' as identifier inside an async function\")\n      this.yieldPos = oldYieldPos\n      this.awaitPos = oldAwaitPos\n      this.awaitIdentPos = oldAwaitIdentPos\n      return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, true)\n    }\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    this.yieldPos = oldYieldPos || this.yieldPos\n    this.awaitPos = oldAwaitPos || this.awaitPos\n    this.awaitIdentPos = oldAwaitIdentPos || this.awaitIdentPos\n    let node = this.startNodeAt(startPos, startLoc)\n    node.callee = base\n    node.arguments = exprList\n    base = this.finishNode(node, \"CallExpression\")\n  } else if (this.type === tt.backQuote) {\n    let node = this.startNodeAt(startPos, startLoc)\n    node.tag = base\n    node.quasi = this.parseTemplate({isTagged: true})\n    base = this.finishNode(node, \"TaggedTemplateExpression\")\n  }\n  return base\n}\n\n// Parse an atomic expression — either a single token that is an\n// expression, an expression started by a keyword like `function` or\n// `new`, or an expression wrapped in punctuation like `()`, `[]`,\n// or `{}`.\n\npp.parseExprAtom = function(refDestructuringErrors) {\n  // If a division operator appears in an expression position, the\n  // tokenizer got confused, and we force it to read a regexp instead.\n  if (this.type === tt.slash) this.readRegexp()\n\n  let node, canBeArrow = this.potentialArrowAt === this.start\n  switch (this.type) {\n  case tt._super:\n    if (!this.allowSuper)\n      this.raise(this.start, \"'super' keyword outside a method\")\n    node = this.startNode()\n    this.next()\n    if (this.type === tt.parenL && !this.allowDirectSuper)\n      this.raise(node.start, \"super() call outside constructor of a subclass\")\n    // The `super` keyword can appear at below:\n    // SuperProperty:\n    //     super [ Expression ]\n    //     super . IdentifierName\n    // SuperCall:\n    //     super Arguments\n    if (this.type !== tt.dot && this.type !== tt.bracketL && this.type !== tt.parenL)\n      this.unexpected()\n    return this.finishNode(node, \"Super\")\n\n  case tt._this:\n    node = this.startNode()\n    this.next()\n    return this.finishNode(node, \"ThisExpression\")\n\n  case tt.name:\n    let startPos = this.start, startLoc = this.startLoc, containsEsc = this.containsEsc\n    let id = this.parseIdent(false)\n    if (this.options.ecmaVersion >= 8 && !containsEsc && id.name === \"async\" && !this.canInsertSemicolon() && this.eat(tt._function))\n      return this.parseFunction(this.startNodeAt(startPos, startLoc), 0, false, true)\n    if (canBeArrow && !this.canInsertSemicolon()) {\n      if (this.eat(tt.arrow))\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false)\n      if (this.options.ecmaVersion >= 8 && id.name === \"async\" && this.type === tt.name && !containsEsc) {\n        id = this.parseIdent(false)\n        if (this.canInsertSemicolon() || !this.eat(tt.arrow))\n          this.unexpected()\n        return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true)\n      }\n    }\n    return id\n\n  case tt.regexp:\n    let value = this.value\n    node = this.parseLiteral(value.value)\n    node.regex = {pattern: value.pattern, flags: value.flags}\n    return node\n\n  case tt.num: case tt.string:\n    return this.parseLiteral(this.value)\n\n  case tt._null: case tt._true: case tt._false:\n    node = this.startNode()\n    node.value = this.type === tt._null ? null : this.type === tt._true\n    node.raw = this.type.keyword\n    this.next()\n    return this.finishNode(node, \"Literal\")\n\n  case tt.parenL:\n    let start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow)\n    if (refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr))\n        refDestructuringErrors.parenthesizedAssign = start\n      if (refDestructuringErrors.parenthesizedBind < 0)\n        refDestructuringErrors.parenthesizedBind = start\n    }\n    return expr\n\n  case tt.bracketL:\n    node = this.startNode()\n    this.next()\n    node.elements = this.parseExprList(tt.bracketR, true, true, refDestructuringErrors)\n    return this.finishNode(node, \"ArrayExpression\")\n\n  case tt.braceL:\n    return this.parseObj(false, refDestructuringErrors)\n\n  case tt._function:\n    node = this.startNode()\n    this.next()\n    return this.parseFunction(node, 0)\n\n  case tt._class:\n    return this.parseClass(this.startNode(), false)\n\n  case tt._new:\n    return this.parseNew()\n\n  case tt.backQuote:\n    return this.parseTemplate()\n\n  default:\n    this.unexpected()\n  }\n}\n\npp.parseLiteral = function(value) {\n  let node = this.startNode()\n  node.value = value\n  node.raw = this.input.slice(this.start, this.end)\n  this.next()\n  return this.finishNode(node, \"Literal\")\n}\n\npp.parseParenExpression = function() {\n  this.expect(tt.parenL)\n  let val = this.parseExpression()\n  this.expect(tt.parenR)\n  return val\n}\n\npp.parseParenAndDistinguishExpression = function(canBeArrow) {\n  let startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8\n  if (this.options.ecmaVersion >= 6) {\n    this.next()\n\n    let innerStartPos = this.start, innerStartLoc = this.startLoc\n    let exprList = [], first = true, lastIsComma = false\n    let refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart\n    this.yieldPos = 0\n    this.awaitPos = 0\n    // Do not save awaitIdentPos to allow checking awaits nested in parameters\n    while (this.type !== tt.parenR) {\n      first ? first = false : this.expect(tt.comma)\n      if (allowTrailingComma && this.afterTrailingComma(tt.parenR, true)) {\n        lastIsComma = true\n        break\n      } else if (this.type === tt.ellipsis) {\n        spreadStart = this.start\n        exprList.push(this.parseParenItem(this.parseRestBinding()))\n        if (this.type === tt.comma) this.raise(this.start, \"Comma is not permitted after the rest element\")\n        break\n      } else {\n        exprList.push(this.parseMaybeAssign(false, refDestructuringErrors, this.parseParenItem))\n      }\n    }\n    let innerEndPos = this.start, innerEndLoc = this.startLoc\n    this.expect(tt.parenR)\n\n    if (canBeArrow && !this.canInsertSemicolon() && this.eat(tt.arrow)) {\n      this.checkPatternErrors(refDestructuringErrors, false)\n      this.checkYieldAwaitInDefaultParams()\n      this.yieldPos = oldYieldPos\n      this.awaitPos = oldAwaitPos\n      return this.parseParenArrowList(startPos, startLoc, exprList)\n    }\n\n    if (!exprList.length || lastIsComma) this.unexpected(this.lastTokStart)\n    if (spreadStart) this.unexpected(spreadStart)\n    this.checkExpressionErrors(refDestructuringErrors, true)\n    this.yieldPos = oldYieldPos || this.yieldPos\n    this.awaitPos = oldAwaitPos || this.awaitPos\n\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc)\n      val.expressions = exprList\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc)\n    } else {\n      val = exprList[0]\n    }\n  } else {\n    val = this.parseParenExpression()\n  }\n\n  if (this.options.preserveParens) {\n    let par = this.startNodeAt(startPos, startLoc)\n    par.expression = val\n    return this.finishNode(par, \"ParenthesizedExpression\")\n  } else {\n    return val\n  }\n}\n\npp.parseParenItem = function(item) {\n  return item\n}\n\npp.parseParenArrowList = function(startPos, startLoc, exprList) {\n  return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList)\n}\n\n// New's precedence is slightly tricky. It must allow its argument to\n// be a `[]` or dot subscript expression, but not a call — at least,\n// not without wrapping it in parentheses. Thus, it uses the noCalls\n// argument to parseSubscripts to prevent it from consuming the\n// argument list.\n\nconst empty = []\n\npp.parseNew = function() {\n  let node = this.startNode()\n  let meta = this.parseIdent(true)\n  if (this.options.ecmaVersion >= 6 && this.eat(tt.dot)) {\n    node.meta = meta\n    let containsEsc = this.containsEsc\n    node.property = this.parseIdent(true)\n    if (node.property.name !== \"target\" || containsEsc)\n      this.raiseRecoverable(node.property.start, \"The only valid meta property for new is new.target\")\n    if (!this.inNonArrowFunction())\n      this.raiseRecoverable(node.start, \"new.target can only be used in functions\")\n    return this.finishNode(node, \"MetaProperty\")\n  }\n  let startPos = this.start, startLoc = this.startLoc\n  node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true)\n  if (this.eat(tt.parenL)) node.arguments = this.parseExprList(tt.parenR, this.options.ecmaVersion >= 8, false)\n  else node.arguments = empty\n  return this.finishNode(node, \"NewExpression\")\n}\n\n// Parse template expression.\n\npp.parseTemplateElement = function({isTagged}) {\n  let elem = this.startNode()\n  if (this.type === tt.invalidTemplate) {\n    if (!isTagged) {\n      this.raiseRecoverable(this.start, \"Bad escape sequence in untagged template literal\")\n    }\n    elem.value = {\n      raw: this.value,\n      cooked: null\n    }\n  } else {\n    elem.value = {\n      raw: this.input.slice(this.start, this.end).replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.value\n    }\n  }\n  this.next()\n  elem.tail = this.type === tt.backQuote\n  return this.finishNode(elem, \"TemplateElement\")\n}\n\npp.parseTemplate = function({isTagged = false} = {}) {\n  let node = this.startNode()\n  this.next()\n  node.expressions = []\n  let curElt = this.parseTemplateElement({isTagged})\n  node.quasis = [curElt]\n  while (!curElt.tail) {\n    if (this.type === tt.eof) this.raise(this.pos, \"Unterminated template literal\")\n    this.expect(tt.dollarBraceL)\n    node.expressions.push(this.parseExpression())\n    this.expect(tt.braceR)\n    node.quasis.push(curElt = this.parseTemplateElement({isTagged}))\n  }\n  this.next()\n  return this.finishNode(node, \"TemplateLiteral\")\n}\n\npp.isAsyncProp = function(prop) {\n  return !prop.computed && prop.key.type === \"Identifier\" && prop.key.name === \"async\" &&\n    (this.type === tt.name || this.type === tt.num || this.type === tt.string || this.type === tt.bracketL || this.type.keyword || (this.options.ecmaVersion >= 9 && this.type === tt.star)) &&\n    !lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n}\n\n// Parse an object literal or binding pattern.\n\npp.parseObj = function(isPattern, refDestructuringErrors) {\n  let node = this.startNode(), first = true, propHash = {}\n  node.properties = []\n  this.next()\n  while (!this.eat(tt.braceR)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (this.afterTrailingComma(tt.braceR)) break\n    } else first = false\n\n    const prop = this.parseProperty(isPattern, refDestructuringErrors)\n    if (!isPattern) this.checkPropClash(prop, propHash, refDestructuringErrors)\n    node.properties.push(prop)\n  }\n  return this.finishNode(node, isPattern ? \"ObjectPattern\" : \"ObjectExpression\")\n}\n\npp.parseProperty = function(isPattern, refDestructuringErrors) {\n  let prop = this.startNode(), isGenerator, isAsync, startPos, startLoc\n  if (this.options.ecmaVersion >= 9 && this.eat(tt.ellipsis)) {\n    if (isPattern) {\n      prop.argument = this.parseIdent(false)\n      if (this.type === tt.comma) {\n        this.raise(this.start, \"Comma is not permitted after the rest element\")\n      }\n      return this.finishNode(prop, \"RestElement\")\n    }\n    // To disallow parenthesized identifier via `this.toAssignable()`.\n    if (this.type === tt.parenL && refDestructuringErrors) {\n      if (refDestructuringErrors.parenthesizedAssign < 0) {\n        refDestructuringErrors.parenthesizedAssign = this.start\n      }\n      if (refDestructuringErrors.parenthesizedBind < 0) {\n        refDestructuringErrors.parenthesizedBind = this.start\n      }\n    }\n    // Parse argument.\n    prop.argument = this.parseMaybeAssign(false, refDestructuringErrors)\n    // To disallow trailing comma via `this.toAssignable()`.\n    if (this.type === tt.comma && refDestructuringErrors && refDestructuringErrors.trailingComma < 0) {\n      refDestructuringErrors.trailingComma = this.start\n    }\n    // Finish\n    return this.finishNode(prop, \"SpreadElement\")\n  }\n  if (this.options.ecmaVersion >= 6) {\n    prop.method = false\n    prop.shorthand = false\n    if (isPattern || refDestructuringErrors) {\n      startPos = this.start\n      startLoc = this.startLoc\n    }\n    if (!isPattern)\n      isGenerator = this.eat(tt.star)\n  }\n  let containsEsc = this.containsEsc\n  this.parsePropertyName(prop)\n  if (!isPattern && !containsEsc && this.options.ecmaVersion >= 8 && !isGenerator && this.isAsyncProp(prop)) {\n    isAsync = true\n    isGenerator = this.options.ecmaVersion >= 9 && this.eat(tt.star)\n    this.parsePropertyName(prop, refDestructuringErrors)\n  } else {\n    isAsync = false\n  }\n  this.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc)\n  return this.finishNode(prop, \"Property\")\n}\n\npp.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors, containsEsc) {\n  if ((isGenerator || isAsync) && this.type === tt.colon)\n    this.unexpected()\n\n  if (this.eat(tt.colon)) {\n    prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors)\n    prop.kind = \"init\"\n  } else if (this.options.ecmaVersion >= 6 && this.type === tt.parenL) {\n    if (isPattern) this.unexpected()\n    prop.kind = \"init\"\n    prop.method = true\n    prop.value = this.parseMethod(isGenerator, isAsync)\n  } else if (!isPattern && !containsEsc &&\n             this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === \"Identifier\" &&\n             (prop.key.name === \"get\" || prop.key.name === \"set\") &&\n             (this.type !== tt.comma && this.type !== tt.braceR)) {\n    if (isGenerator || isAsync) this.unexpected()\n    prop.kind = prop.key.name\n    this.parsePropertyName(prop)\n    prop.value = this.parseMethod(false)\n    let paramCount = prop.kind === \"get\" ? 0 : 1\n    if (prop.value.params.length !== paramCount) {\n      let start = prop.value.start\n      if (prop.kind === \"get\")\n        this.raiseRecoverable(start, \"getter should have no params\")\n      else\n        this.raiseRecoverable(start, \"setter should have exactly one param\")\n    } else {\n      if (prop.kind === \"set\" && prop.value.params[0].type === \"RestElement\")\n        this.raiseRecoverable(prop.value.params[0].start, \"Setter cannot use rest params\")\n    }\n  } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === \"Identifier\") {\n    if (isGenerator || isAsync) this.unexpected()\n    this.checkUnreserved(prop.key)\n    if (prop.key.name === \"await\" && !this.awaitIdentPos)\n      this.awaitIdentPos = startPos\n    prop.kind = \"init\"\n    if (isPattern) {\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key)\n    } else if (this.type === tt.eq && refDestructuringErrors) {\n      if (refDestructuringErrors.shorthandAssign < 0)\n        refDestructuringErrors.shorthandAssign = this.start\n      prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key)\n    } else {\n      prop.value = prop.key\n    }\n    prop.shorthand = true\n  } else this.unexpected()\n}\n\npp.parsePropertyName = function(prop) {\n  if (this.options.ecmaVersion >= 6) {\n    if (this.eat(tt.bracketL)) {\n      prop.computed = true\n      prop.key = this.parseMaybeAssign()\n      this.expect(tt.bracketR)\n      return prop.key\n    } else {\n      prop.computed = false\n    }\n  }\n  return prop.key = this.type === tt.num || this.type === tt.string ? this.parseExprAtom() : this.parseIdent(true)\n}\n\n// Initialize empty function node.\n\npp.initFunction = function(node) {\n  node.id = null\n  if (this.options.ecmaVersion >= 6) node.generator = node.expression = false\n  if (this.options.ecmaVersion >= 8) node.async = false\n}\n\n// Parse object or class method.\n\npp.parseMethod = function(isGenerator, isAsync, allowDirectSuper) {\n  let node = this.startNode(), oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 6)\n    node.generator = isGenerator\n  if (this.options.ecmaVersion >= 8)\n    node.async = !!isAsync\n\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n  this.enterScope(functionFlags(isAsync, node.generator) | SCOPE_SUPER | (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0))\n\n  this.expect(tt.parenL)\n  node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8)\n  this.checkYieldAwaitInDefaultParams()\n  this.parseFunctionBody(node, false, true)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, \"FunctionExpression\")\n}\n\n// Parse arrow function expression with given parameters.\n\npp.parseArrowExpression = function(node, params, isAsync) {\n  let oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldAwaitIdentPos = this.awaitIdentPos\n\n  this.enterScope(functionFlags(isAsync, false) | SCOPE_ARROW)\n  this.initFunction(node)\n  if (this.options.ecmaVersion >= 8) node.async = !!isAsync\n\n  this.yieldPos = 0\n  this.awaitPos = 0\n  this.awaitIdentPos = 0\n\n  node.params = this.toAssignableList(params, true)\n  this.parseFunctionBody(node, true, false)\n\n  this.yieldPos = oldYieldPos\n  this.awaitPos = oldAwaitPos\n  this.awaitIdentPos = oldAwaitIdentPos\n  return this.finishNode(node, \"ArrowFunctionExpression\")\n}\n\n// Parse function body and check parameters.\n\npp.parseFunctionBody = function(node, isArrowFunction, isMethod) {\n  let isExpression = isArrowFunction && this.type !== tt.braceL\n  let oldStrict = this.strict, useStrict = false\n\n  if (isExpression) {\n    node.body = this.parseMaybeAssign()\n    node.expression = true\n    this.checkParams(node, false)\n  } else {\n    let nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params)\n    if (!oldStrict || nonSimple) {\n      useStrict = this.strictDirective(this.end)\n      // If this is a strict mode function, verify that argument names\n      // are not repeated, and it does not try to bind the words `eval`\n      // or `arguments`.\n      if (useStrict && nonSimple)\n        this.raiseRecoverable(node.start, \"Illegal 'use strict' directive in function with non-simple parameter list\")\n    }\n    // Start a new scope with regard to labels and the `inFunction`\n    // flag (restore them to their old value afterwards).\n    let oldLabels = this.labels\n    this.labels = []\n    if (useStrict) this.strict = true\n\n    // Add the params to varDeclaredNames to ensure that an error is thrown\n    // if a let/const declaration in the function clashes with one of the params.\n    this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && !isMethod && this.isSimpleParamList(node.params))\n    node.body = this.parseBlock(false)\n    node.expression = false\n    this.adaptDirectivePrologue(node.body.body)\n    this.labels = oldLabels\n  }\n  this.exitScope()\n\n  // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n  if (this.strict && node.id) this.checkLVal(node.id, BIND_OUTSIDE)\n  this.strict = oldStrict\n}\n\npp.isSimpleParamList = function(params) {\n  for (let param of params)\n    if (param.type !== \"Identifier\") return false\n  return true\n}\n\n// Checks function params for various disallowed patterns such as using \"eval\"\n// or \"arguments\" and duplicate parameters.\n\npp.checkParams = function(node, allowDuplicates) {\n  let nameHash = {}\n  for (let param of node.params)\n    this.checkLVal(param, BIND_VAR, allowDuplicates ? null : nameHash)\n}\n\n// Parses a comma-separated list of expressions, and returns them as\n// an array. `close` is the token type that ends the list, and\n// `allowEmpty` can be turned on to allow subsequent commas with\n// nothing in between them to be parsed as `null` (which is needed\n// for array literals).\n\npp.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) {\n  let elts = [], first = true\n  while (!this.eat(close)) {\n    if (!first) {\n      this.expect(tt.comma)\n      if (allowTrailingComma && this.afterTrailingComma(close)) break\n    } else first = false\n\n    let elt\n    if (allowEmpty && this.type === tt.comma)\n      elt = null\n    else if (this.type === tt.ellipsis) {\n      elt = this.parseSpread(refDestructuringErrors)\n      if (refDestructuringErrors && this.type === tt.comma && refDestructuringErrors.trailingComma < 0)\n        refDestructuringErrors.trailingComma = this.start\n    } else {\n      elt = this.parseMaybeAssign(false, refDestructuringErrors)\n    }\n    elts.push(elt)\n  }\n  return elts\n}\n\npp.checkUnreserved = function({start, end, name}) {\n  if (this.inGenerator && name === \"yield\")\n    this.raiseRecoverable(start, \"Cannot use 'yield' as identifier inside a generator\")\n  if (this.inAsync && name === \"await\")\n    this.raiseRecoverable(start, \"Cannot use 'await' as identifier inside an async function\")\n  if (this.keywords.test(name))\n    this.raise(start, `Unexpected keyword '${name}'`)\n  if (this.options.ecmaVersion < 6 &&\n    this.input.slice(start, end).indexOf(\"\\\\\") !== -1) return\n  const re = this.strict ? this.reservedWordsStrict : this.reservedWords\n  if (re.test(name)) {\n    if (!this.inAsync && name === \"await\")\n      this.raiseRecoverable(start, \"Cannot use keyword 'await' outside an async function\")\n    this.raiseRecoverable(start, `The keyword '${name}' is reserved`)\n  }\n}\n\n// Parse the next token as an identifier. If `liberal` is true (used\n// when parsing properties), it will also convert keywords into\n// identifiers.\n\npp.parseIdent = function(liberal, isBinding) {\n  let node = this.startNode()\n  if (liberal && this.options.allowReserved === \"never\") liberal = false\n  if (this.type === tt.name) {\n    node.name = this.value\n  } else if (this.type.keyword) {\n    node.name = this.type.keyword\n\n    // To fix https://github.com/acornjs/acorn/issues/575\n    // `class` and `function` keywords push new context into this.context.\n    // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.\n    // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword\n    if ((node.name === \"class\" || node.name === \"function\") &&\n        (this.lastTokEnd !== this.lastTokStart + 1 || this.input.charCodeAt(this.lastTokStart) !== 46)) {\n      this.context.pop()\n    }\n  } else {\n    this.unexpected()\n  }\n  this.next()\n  this.finishNode(node, \"Identifier\")\n  if (!liberal) {\n    this.checkUnreserved(node)\n    if (node.name === \"await\" && !this.awaitIdentPos)\n      this.awaitIdentPos = node.start\n  }\n  return node\n}\n\n// Parses yield expression inside generator.\n\npp.parseYield = function(noIn) {\n  if (!this.yieldPos) this.yieldPos = this.start\n\n  let node = this.startNode()\n  this.next()\n  if (this.type === tt.semi || this.canInsertSemicolon() || (this.type !== tt.star && !this.type.startsExpr)) {\n    node.delegate = false\n    node.argument = null\n  } else {\n    node.delegate = this.eat(tt.star)\n    node.argument = this.parseMaybeAssign(noIn)\n  }\n  return this.finishNode(node, \"YieldExpression\")\n}\n\npp.parseAwait = function() {\n  if (!this.awaitPos) this.awaitPos = this.start\n\n  let node = this.startNode()\n  this.next()\n  node.argument = this.parseMaybeUnary(null, true)\n  return this.finishNode(node, \"AwaitExpression\")\n}\n","import {Parser} from \"./state\"\nimport {Position, getLineInfo} from \"./locutil\"\n\nconst pp = Parser.prototype\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\npp.raise = function(pos, message) {\n  let loc = getLineInfo(this.input, pos)\n  message += \" (\" + loc.line + \":\" + loc.column + \")\"\n  let err = new SyntaxError(message)\n  err.pos = pos; err.loc = loc; err.raisedAt = this.pos\n  throw err\n}\n\npp.raiseRecoverable = pp.raise\n\npp.curPosition = function() {\n  if (this.options.locations) {\n    return new Position(this.curLine, this.pos - this.lineStart)\n  }\n}\n","import {Parser} from \"./state\"\nimport {SCOPE_VAR, SCOPE_FUNCTION, SCOPE_TOP, SCOPE_ARROW, SCOPE_SIMPLE_CATCH, BIND_LEXICAL, BIND_SIMPLE_CATCH, BIND_FUNCTION} from \"./scopeflags\"\n\nconst pp = Parser.prototype\n\nclass Scope {\n  constructor(flags) {\n    this.flags = flags\n    // A list of var-declared names in the current lexical scope\n    this.var = []\n    // A list of lexically-declared names in the current lexical scope\n    this.lexical = []\n    // A list of lexically-declared FunctionDeclaration names in the current lexical scope\n    this.functions = []\n  }\n}\n\n// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.\n\npp.enterScope = function(flags) {\n  this.scopeStack.push(new Scope(flags))\n}\n\npp.exitScope = function() {\n  this.scopeStack.pop()\n}\n\n// The spec says:\n// > At the top level of a function, or script, function declarations are\n// > treated like var declarations rather than like lexical declarations.\npp.treatFunctionsAsVarInScope = function(scope) {\n  return (scope.flags & SCOPE_FUNCTION) || !this.inModule && (scope.flags & SCOPE_TOP)\n}\n\npp.declareName = function(name, bindingType, pos) {\n  let redeclared = false\n  if (bindingType === BIND_LEXICAL) {\n    const scope = this.currentScope()\n    redeclared = scope.lexical.indexOf(name) > -1 || scope.functions.indexOf(name) > -1 || scope.var.indexOf(name) > -1\n    scope.lexical.push(name)\n    if (this.inModule && (scope.flags & SCOPE_TOP))\n      delete this.undefinedExports[name]\n  } else if (bindingType === BIND_SIMPLE_CATCH) {\n    const scope = this.currentScope()\n    scope.lexical.push(name)\n  } else if (bindingType === BIND_FUNCTION) {\n    const scope = this.currentScope()\n    if (this.treatFunctionsAsVar)\n      redeclared = scope.lexical.indexOf(name) > -1\n    else\n      redeclared = scope.lexical.indexOf(name) > -1 || scope.var.indexOf(name) > -1\n    scope.functions.push(name)\n  } else {\n    for (let i = this.scopeStack.length - 1; i >= 0; --i) {\n      const scope = this.scopeStack[i]\n      if (scope.lexical.indexOf(name) > -1 && !((scope.flags & SCOPE_SIMPLE_CATCH) && scope.lexical[0] === name) ||\n          !this.treatFunctionsAsVarInScope(scope) && scope.functions.indexOf(name) > -1) {\n        redeclared = true\n        break\n      }\n      scope.var.push(name)\n      if (this.inModule && (scope.flags & SCOPE_TOP))\n        delete this.undefinedExports[name]\n      if (scope.flags & SCOPE_VAR) break\n    }\n  }\n  if (redeclared) this.raiseRecoverable(pos, `Identifier '${name}' has already been declared`)\n}\n\npp.checkLocalExport = function(id) {\n  // scope.functions must be empty as Module code is always strict.\n  if (this.scopeStack[0].lexical.indexOf(id.name) === -1 &&\n      this.scopeStack[0].var.indexOf(id.name) === -1) {\n    this.undefinedExports[id.name] = id\n  }\n}\n\npp.currentScope = function() {\n  return this.scopeStack[this.scopeStack.length - 1]\n}\n\npp.currentVarScope = function() {\n  for (let i = this.scopeStack.length - 1;; i--) {\n    let scope = this.scopeStack[i]\n    if (scope.flags & SCOPE_VAR) return scope\n  }\n}\n\n// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\npp.currentThisScope = function() {\n  for (let i = this.scopeStack.length - 1;; i--) {\n    let scope = this.scopeStack[i]\n    if (scope.flags & SCOPE_VAR && !(scope.flags & SCOPE_ARROW)) return scope\n  }\n}\n","import {Parser} from \"./state\"\nimport {SourceLocation} from \"./locutil\"\n\nexport class Node {\n  constructor(parser, pos, loc) {\n    this.type = \"\"\n    this.start = pos\n    this.end = 0\n    if (parser.options.locations)\n      this.loc = new SourceLocation(parser, loc)\n    if (parser.options.directSourceFile)\n      this.sourceFile = parser.options.directSourceFile\n    if (parser.options.ranges)\n      this.range = [pos, 0]\n  }\n}\n\n// Start an AST node, attaching a start offset.\n\nconst pp = Parser.prototype\n\npp.startNode = function() {\n  return new Node(this, this.start, this.startLoc)\n}\n\npp.startNodeAt = function(pos, loc) {\n  return new Node(this, pos, loc)\n}\n\n// Finish an AST node, adding `type` and `end` properties.\n\nfunction finishNodeAt(node, type, pos, loc) {\n  node.type = type\n  node.end = pos\n  if (this.options.locations)\n    node.loc.end = loc\n  if (this.options.ranges)\n    node.range[1] = pos\n  return node\n}\n\npp.finishNode = function(node, type) {\n  return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc)\n}\n\n// Finish node at given position\n\npp.finishNodeAt = function(node, type, pos, loc) {\n  return finishNodeAt.call(this, node, type, pos, loc)\n}\n","// The algorithm used to determine whether a regexp can appear at a\n// given point in the program is loosely based on sweet.js' approach.\n// See https://github.com/mozilla/sweet.js/wiki/design\n\nimport {Parser} from \"./state\"\nimport {types as tt} from \"./tokentype\"\nimport {lineBreak} from \"./whitespace\"\n\nexport class TokContext {\n  constructor(token, isExpr, preserveSpace, override, generator) {\n    this.token = token\n    this.isExpr = !!isExpr\n    this.preserveSpace = !!preserveSpace\n    this.override = override\n    this.generator = !!generator\n  }\n}\n\nexport const types = {\n  b_stat: new TokContext(\"{\", false),\n  b_expr: new TokContext(\"{\", true),\n  b_tmpl: new TokContext(\"${\", false),\n  p_stat: new TokContext(\"(\", false),\n  p_expr: new TokContext(\"(\", true),\n  q_tmpl: new TokContext(\"`\", true, true, p => p.tryReadTemplateToken()),\n  f_stat: new TokContext(\"function\", false),\n  f_expr: new TokContext(\"function\", true),\n  f_expr_gen: new TokContext(\"function\", true, false, null, true),\n  f_gen: new TokContext(\"function\", false, false, null, true)\n}\n\nconst pp = Parser.prototype\n\npp.initialContext = function() {\n  return [types.b_stat]\n}\n\npp.braceIsBlock = function(prevType) {\n  let parent = this.curContext()\n  if (parent === types.f_expr || parent === types.f_stat)\n    return true\n  if (prevType === tt.colon && (parent === types.b_stat || parent === types.b_expr))\n    return !parent.isExpr\n\n  // The check for `tt.name && exprAllowed` detects whether we are\n  // after a `yield` or `of` construct. See the `updateContext` for\n  // `tt.name`.\n  if (prevType === tt._return || prevType === tt.name && this.exprAllowed)\n    return lineBreak.test(this.input.slice(this.lastTokEnd, this.start))\n  if (prevType === tt._else || prevType === tt.semi || prevType === tt.eof || prevType === tt.parenR || prevType === tt.arrow)\n    return true\n  if (prevType === tt.braceL)\n    return parent === types.b_stat\n  if (prevType === tt._var || prevType === tt._const || prevType === tt.name)\n    return false\n  return !this.exprAllowed\n}\n\npp.inGeneratorContext = function() {\n  for (let i = this.context.length - 1; i >= 1; i--) {\n    let context = this.context[i]\n    if (context.token === \"function\")\n      return context.generator\n  }\n  return false\n}\n\npp.updateContext = function(prevType) {\n  let update, type = this.type\n  if (type.keyword && prevType === tt.dot)\n    this.exprAllowed = false\n  else if (update = type.updateContext)\n    update.call(this, prevType)\n  else\n    this.exprAllowed = type.beforeExpr\n}\n\n// Token-specific context update code\n\ntt.parenR.updateContext = tt.braceR.updateContext = function() {\n  if (this.context.length === 1) {\n    this.exprAllowed = true\n    return\n  }\n  let out = this.context.pop()\n  if (out === types.b_stat && this.curContext().token === \"function\") {\n    out = this.context.pop()\n  }\n  this.exprAllowed = !out.isExpr\n}\n\ntt.braceL.updateContext = function(prevType) {\n  this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr)\n  this.exprAllowed = true\n}\n\ntt.dollarBraceL.updateContext = function() {\n  this.context.push(types.b_tmpl)\n  this.exprAllowed = true\n}\n\ntt.parenL.updateContext = function(prevType) {\n  let statementParens = prevType === tt._if || prevType === tt._for || prevType === tt._with || prevType === tt._while\n  this.context.push(statementParens ? types.p_stat : types.p_expr)\n  this.exprAllowed = true\n}\n\ntt.incDec.updateContext = function() {\n  // tokExprAllowed stays unchanged\n}\n\ntt._function.updateContext = tt._class.updateContext = function(prevType) {\n  if (prevType.beforeExpr && prevType !== tt.semi && prevType !== tt._else &&\n      !(prevType === tt._return && lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) &&\n      !((prevType === tt.colon || prevType === tt.braceL) && this.curContext() === types.b_stat))\n    this.context.push(types.f_expr)\n  else\n    this.context.push(types.f_stat)\n  this.exprAllowed = false\n}\n\ntt.backQuote.updateContext = function() {\n  if (this.curContext() === types.q_tmpl)\n    this.context.pop()\n  else\n    this.context.push(types.q_tmpl)\n  this.exprAllowed = false\n}\n\ntt.star.updateContext = function(prevType) {\n  if (prevType === tt._function) {\n    let index = this.context.length - 1\n    if (this.context[index] === types.f_expr)\n      this.context[index] = types.f_expr_gen\n    else\n      this.context[index] = types.f_gen\n  }\n  this.exprAllowed = true\n}\n\ntt.name.updateContext = function(prevType) {\n  let allowed = false\n  if (this.options.ecmaVersion >= 6 && prevType !== tt.dot) {\n    if (this.value === \"of\" && !this.exprAllowed ||\n        this.value === \"yield\" && this.inGeneratorContext())\n      allowed = true\n  }\n  this.exprAllowed = allowed\n}\n","import {wordsRegexp} from \"./util.js\"\n\n// This file contains Unicode properties extracted from the ECMAScript\n// specification. The lists are extracted like so:\n// $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)\n\n// #table-binary-unicode-properties\nconst ecma9BinaryProperties = \"ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS\"\nconst unicodeBinaryProperties = {\n  9: ecma9BinaryProperties,\n  10: ecma9BinaryProperties + \" Extended_Pictographic\"\n}\n\n// #table-unicode-general-category-values\nconst unicodeGeneralCategoryValues = \"Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu\"\n\n// #table-unicode-script-values\nconst ecma9ScriptValues = \"Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb\"\nconst unicodeScriptValues = {\n  9: ecma9ScriptValues,\n  10: ecma9ScriptValues + \" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd\"\n}\n\nconst data = {}\nfunction buildUnicodeData(ecmaVersion) {\n  let d = data[ecmaVersion] = {\n    binary: wordsRegexp(unicodeBinaryProperties[ecmaVersion] + \" \" + unicodeGeneralCategoryValues),\n    nonBinary: {\n      General_Category: wordsRegexp(unicodeGeneralCategoryValues),\n      Script: wordsRegexp(unicodeScriptValues[ecmaVersion])\n    }\n  }\n  d.nonBinary.Script_Extensions = d.nonBinary.Script\n\n  d.nonBinary.gc = d.nonBinary.General_Category\n  d.nonBinary.sc = d.nonBinary.Script\n  d.nonBinary.scx = d.nonBinary.Script_Extensions\n}\nbuildUnicodeData(9)\nbuildUnicodeData(10)\n\nexport default data\n","import {isIdentifierStart, isIdentifierChar} from \"./identifier.js\"\nimport {Parser} from \"./state.js\"\nimport UNICODE_PROPERTY_VALUES from \"./unicode-property-data.js\"\nimport {has} from \"./util.js\"\n\nconst pp = Parser.prototype\n\nexport class RegExpValidationState {\n  constructor(parser) {\n    this.parser = parser\n    this.validFlags = `gim${parser.options.ecmaVersion >= 6 ? \"uy\" : \"\"}${parser.options.ecmaVersion >= 9 ? \"s\" : \"\"}`\n    this.unicodeProperties = UNICODE_PROPERTY_VALUES[parser.options.ecmaVersion >= 10 ? 10 : parser.options.ecmaVersion]\n    this.source = \"\"\n    this.flags = \"\"\n    this.start = 0\n    this.switchU = false\n    this.switchN = false\n    this.pos = 0\n    this.lastIntValue = 0\n    this.lastStringValue = \"\"\n    this.lastAssertionIsQuantifiable = false\n    this.numCapturingParens = 0\n    this.maxBackReference = 0\n    this.groupNames = []\n    this.backReferenceNames = []\n  }\n\n  reset(start, pattern, flags) {\n    const unicode = flags.indexOf(\"u\") !== -1\n    this.start = start | 0\n    this.source = pattern + \"\"\n    this.flags = flags\n    this.switchU = unicode && this.parser.options.ecmaVersion >= 6\n    this.switchN = unicode && this.parser.options.ecmaVersion >= 9\n  }\n\n  raise(message) {\n    this.parser.raiseRecoverable(this.start, `Invalid regular expression: /${this.source}/: ${message}`)\n  }\n\n  // If u flag is given, this returns the code point at the index (it combines a surrogate pair).\n  // Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).\n  at(i) {\n    const s = this.source\n    const l = s.length\n    if (i >= l) {\n      return -1\n    }\n    const c = s.charCodeAt(i)\n    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n      return c\n    }\n    return (c << 10) + s.charCodeAt(i + 1) - 0x35FDC00\n  }\n\n  nextIndex(i) {\n    const s = this.source\n    const l = s.length\n    if (i >= l) {\n      return l\n    }\n    const c = s.charCodeAt(i)\n    if (!this.switchU || c <= 0xD7FF || c >= 0xE000 || i + 1 >= l) {\n      return i + 1\n    }\n    return i + 2\n  }\n\n  current() {\n    return this.at(this.pos)\n  }\n\n  lookahead() {\n    return this.at(this.nextIndex(this.pos))\n  }\n\n  advance() {\n    this.pos = this.nextIndex(this.pos)\n  }\n\n  eat(ch) {\n    if (this.current() === ch) {\n      this.advance()\n      return true\n    }\n    return false\n  }\n}\n\nfunction codePointToString(ch) {\n  if (ch <= 0xFFFF) return String.fromCharCode(ch)\n  ch -= 0x10000\n  return String.fromCharCode((ch >> 10) + 0xD800, (ch & 0x03FF) + 0xDC00)\n}\n\n/**\n * Validate the flags part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp.validateRegExpFlags = function(state) {\n  const validFlags = state.validFlags\n  const flags = state.flags\n\n  for (let i = 0; i < flags.length; i++) {\n    const flag = flags.charAt(i)\n    if (validFlags.indexOf(flag) === -1) {\n      this.raise(state.start, \"Invalid regular expression flag\")\n    }\n    if (flags.indexOf(flag, i + 1) > -1) {\n      this.raise(state.start, \"Duplicate regular expression flag\")\n    }\n  }\n}\n\n/**\n * Validate the pattern part of a given RegExpLiteral.\n *\n * @param {RegExpValidationState} state The state to validate RegExp.\n * @returns {void}\n */\npp.validateRegExpPattern = function(state) {\n  this.regexp_pattern(state)\n\n  // The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of\n  // parsing contains a |GroupName|, reparse with the goal symbol\n  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*\n  // exception if _P_ did not conform to the grammar, if any elements of _P_\n  // were not matched by the parse, or if any Early Error conditions exist.\n  if (!state.switchN && this.options.ecmaVersion >= 9 && state.groupNames.length > 0) {\n    state.switchN = true\n    this.regexp_pattern(state)\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern\npp.regexp_pattern = function(state) {\n  state.pos = 0\n  state.lastIntValue = 0\n  state.lastStringValue = \"\"\n  state.lastAssertionIsQuantifiable = false\n  state.numCapturingParens = 0\n  state.maxBackReference = 0\n  state.groupNames.length = 0\n  state.backReferenceNames.length = 0\n\n  this.regexp_disjunction(state)\n\n  if (state.pos !== state.source.length) {\n    // Make the same messages as V8.\n    if (state.eat(0x29 /* ) */)) {\n      state.raise(\"Unmatched ')'\")\n    }\n    if (state.eat(0x5D /* [ */) || state.eat(0x7D /* } */)) {\n      state.raise(\"Lone quantifier brackets\")\n    }\n  }\n  if (state.maxBackReference > state.numCapturingParens) {\n    state.raise(\"Invalid escape\")\n  }\n  for (const name of state.backReferenceNames) {\n    if (state.groupNames.indexOf(name) === -1) {\n      state.raise(\"Invalid named capture referenced\")\n    }\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction\npp.regexp_disjunction = function(state) {\n  this.regexp_alternative(state)\n  while (state.eat(0x7C /* | */)) {\n    this.regexp_alternative(state)\n  }\n\n  // Make the same message as V8.\n  if (this.regexp_eatQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\")\n  }\n  if (state.eat(0x7B /* { */)) {\n    state.raise(\"Lone quantifier brackets\")\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative\npp.regexp_alternative = function(state) {\n  while (state.pos < state.source.length && this.regexp_eatTerm(state))\n    ;\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term\npp.regexp_eatTerm = function(state) {\n  if (this.regexp_eatAssertion(state)) {\n    // Handle `QuantifiableAssertion Quantifier` alternative.\n    // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion\n    // is a QuantifiableAssertion.\n    if (state.lastAssertionIsQuantifiable && this.regexp_eatQuantifier(state)) {\n      // Make the same message as V8.\n      if (state.switchU) {\n        state.raise(\"Invalid quantifier\")\n      }\n    }\n    return true\n  }\n\n  if (state.switchU ? this.regexp_eatAtom(state) : this.regexp_eatExtendedAtom(state)) {\n    this.regexp_eatQuantifier(state)\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion\npp.regexp_eatAssertion = function(state) {\n  const start = state.pos\n  state.lastAssertionIsQuantifiable = false\n\n  // ^, $\n  if (state.eat(0x5E /* ^ */) || state.eat(0x24 /* $ */)) {\n    return true\n  }\n\n  // \\b \\B\n  if (state.eat(0x5C /* \\ */)) {\n    if (state.eat(0x42 /* B */) || state.eat(0x62 /* b */)) {\n      return true\n    }\n    state.pos = start\n  }\n\n  // Lookahead / Lookbehind\n  if (state.eat(0x28 /* ( */) && state.eat(0x3F /* ? */)) {\n    let lookbehind = false\n    if (this.options.ecmaVersion >= 9) {\n      lookbehind = state.eat(0x3C /* < */)\n    }\n    if (state.eat(0x3D /* = */) || state.eat(0x21 /* ! */)) {\n      this.regexp_disjunction(state)\n      if (!state.eat(0x29 /* ) */)) {\n        state.raise(\"Unterminated group\")\n      }\n      state.lastAssertionIsQuantifiable = !lookbehind\n      return true\n    }\n  }\n\n  state.pos = start\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier\npp.regexp_eatQuantifier = function(state, noError = false) {\n  if (this.regexp_eatQuantifierPrefix(state, noError)) {\n    state.eat(0x3F /* ? */)\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix\npp.regexp_eatQuantifierPrefix = function(state, noError) {\n  return (\n    state.eat(0x2A /* * */) ||\n    state.eat(0x2B /* + */) ||\n    state.eat(0x3F /* ? */) ||\n    this.regexp_eatBracedQuantifier(state, noError)\n  )\n}\npp.regexp_eatBracedQuantifier = function(state, noError) {\n  const start = state.pos\n  if (state.eat(0x7B /* { */)) {\n    let min = 0, max = -1\n    if (this.regexp_eatDecimalDigits(state)) {\n      min = state.lastIntValue\n      if (state.eat(0x2C /* , */) && this.regexp_eatDecimalDigits(state)) {\n        max = state.lastIntValue\n      }\n      if (state.eat(0x7D /* } */)) {\n        // SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term\n        if (max !== -1 && max < min && !noError) {\n          state.raise(\"numbers out of order in {} quantifier\")\n        }\n        return true\n      }\n    }\n    if (state.switchU && !noError) {\n      state.raise(\"Incomplete quantifier\")\n    }\n    state.pos = start\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom\npp.regexp_eatAtom = function(state) {\n  return (\n    this.regexp_eatPatternCharacters(state) ||\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state)\n  )\n}\npp.regexp_eatReverseSolidusAtomEscape = function(state) {\n  const start = state.pos\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatAtomEscape(state)) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatUncapturingGroup = function(state) {\n  const start = state.pos\n  if (state.eat(0x28 /* ( */)) {\n    if (state.eat(0x3F /* ? */) && state.eat(0x3A /* : */)) {\n      this.regexp_disjunction(state)\n      if (state.eat(0x29 /* ) */)) {\n        return true\n      }\n      state.raise(\"Unterminated group\")\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatCapturingGroup = function(state) {\n  if (state.eat(0x28 /* ( */)) {\n    if (this.options.ecmaVersion >= 9) {\n      this.regexp_groupSpecifier(state)\n    } else if (state.current() === 0x3F /* ? */) {\n      state.raise(\"Invalid group\")\n    }\n    this.regexp_disjunction(state)\n    if (state.eat(0x29 /* ) */)) {\n      state.numCapturingParens += 1\n      return true\n    }\n    state.raise(\"Unterminated group\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom\npp.regexp_eatExtendedAtom = function(state) {\n  return (\n    state.eat(0x2E /* . */) ||\n    this.regexp_eatReverseSolidusAtomEscape(state) ||\n    this.regexp_eatCharacterClass(state) ||\n    this.regexp_eatUncapturingGroup(state) ||\n    this.regexp_eatCapturingGroup(state) ||\n    this.regexp_eatInvalidBracedQuantifier(state) ||\n    this.regexp_eatExtendedPatternCharacter(state)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier\npp.regexp_eatInvalidBracedQuantifier = function(state) {\n  if (this.regexp_eatBracedQuantifier(state, true)) {\n    state.raise(\"Nothing to repeat\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter\npp.regexp_eatSyntaxCharacter = function(state) {\n  const ch = state.current()\n  if (isSyntaxCharacter(ch)) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n  return false\n}\nfunction isSyntaxCharacter(ch) {\n  return (\n    ch === 0x24 /* $ */ ||\n    ch >= 0x28 /* ( */ && ch <= 0x2B /* + */ ||\n    ch === 0x2E /* . */ ||\n    ch === 0x3F /* ? */ ||\n    ch >= 0x5B /* [ */ && ch <= 0x5E /* ^ */ ||\n    ch >= 0x7B /* { */ && ch <= 0x7D /* } */\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter\n// But eat eager.\npp.regexp_eatPatternCharacters = function(state) {\n  const start = state.pos\n  let ch = 0\n  while ((ch = state.current()) !== -1 && !isSyntaxCharacter(ch)) {\n    state.advance()\n  }\n  return state.pos !== start\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter\npp.regexp_eatExtendedPatternCharacter = function(state) {\n  const ch = state.current()\n  if (\n    ch !== -1 &&\n    ch !== 0x24 /* $ */ &&\n    !(ch >= 0x28 /* ( */ && ch <= 0x2B /* + */) &&\n    ch !== 0x2E /* . */ &&\n    ch !== 0x3F /* ? */ &&\n    ch !== 0x5B /* [ */ &&\n    ch !== 0x5E /* ^ */ &&\n    ch !== 0x7C /* | */\n  ) {\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// GroupSpecifier[U] ::\n//   [empty]\n//   `?` GroupName[?U]\npp.regexp_groupSpecifier = function(state) {\n  if (state.eat(0x3F /* ? */)) {\n    if (this.regexp_eatGroupName(state)) {\n      if (state.groupNames.indexOf(state.lastStringValue) !== -1) {\n        state.raise(\"Duplicate capture group name\")\n      }\n      state.groupNames.push(state.lastStringValue)\n      return\n    }\n    state.raise(\"Invalid group\")\n  }\n}\n\n// GroupName[U] ::\n//   `<` RegExpIdentifierName[?U] `>`\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp.regexp_eatGroupName = function(state) {\n  state.lastStringValue = \"\"\n  if (state.eat(0x3C /* < */)) {\n    if (this.regexp_eatRegExpIdentifierName(state) && state.eat(0x3E /* > */)) {\n      return true\n    }\n    state.raise(\"Invalid capture group name\")\n  }\n  return false\n}\n\n// RegExpIdentifierName[U] ::\n//   RegExpIdentifierStart[?U]\n//   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]\n// Note: this updates `state.lastStringValue` property with the eaten name.\npp.regexp_eatRegExpIdentifierName = function(state) {\n  state.lastStringValue = \"\"\n  if (this.regexp_eatRegExpIdentifierStart(state)) {\n    state.lastStringValue += codePointToString(state.lastIntValue)\n    while (this.regexp_eatRegExpIdentifierPart(state)) {\n      state.lastStringValue += codePointToString(state.lastIntValue)\n    }\n    return true\n  }\n  return false\n}\n\n// RegExpIdentifierStart[U] ::\n//   UnicodeIDStart\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[?U]\npp.regexp_eatRegExpIdentifierStart = function(state) {\n  const start = state.pos\n  let ch = state.current()\n  state.advance()\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {\n    ch = state.lastIntValue\n  }\n  if (isRegExpIdentifierStart(ch)) {\n    state.lastIntValue = ch\n    return true\n  }\n\n  state.pos = start\n  return false\n}\nfunction isRegExpIdentifierStart(ch) {\n  return isIdentifierStart(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */\n}\n\n// RegExpIdentifierPart[U] ::\n//   UnicodeIDContinue\n//   `$`\n//   `_`\n//   `\\` RegExpUnicodeEscapeSequence[?U]\n//   <ZWNJ>\n//   <ZWJ>\npp.regexp_eatRegExpIdentifierPart = function(state) {\n  const start = state.pos\n  let ch = state.current()\n  state.advance()\n\n  if (ch === 0x5C /* \\ */ && this.regexp_eatRegExpUnicodeEscapeSequence(state)) {\n    ch = state.lastIntValue\n  }\n  if (isRegExpIdentifierPart(ch)) {\n    state.lastIntValue = ch\n    return true\n  }\n\n  state.pos = start\n  return false\n}\nfunction isRegExpIdentifierPart(ch) {\n  return isIdentifierChar(ch, true) || ch === 0x24 /* $ */ || ch === 0x5F /* _ */ || ch === 0x200C /* <ZWNJ> */ || ch === 0x200D /* <ZWJ> */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape\npp.regexp_eatAtomEscape = function(state) {\n  if (\n    this.regexp_eatBackReference(state) ||\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state) ||\n    (state.switchN && this.regexp_eatKGroupName(state))\n  ) {\n    return true\n  }\n  if (state.switchU) {\n    // Make the same message as V8.\n    if (state.current() === 0x63 /* c */) {\n      state.raise(\"Invalid unicode escape\")\n    }\n    state.raise(\"Invalid escape\")\n  }\n  return false\n}\npp.regexp_eatBackReference = function(state) {\n  const start = state.pos\n  if (this.regexp_eatDecimalEscape(state)) {\n    const n = state.lastIntValue\n    if (state.switchU) {\n      // For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape\n      if (n > state.maxBackReference) {\n        state.maxBackReference = n\n      }\n      return true\n    }\n    if (n <= state.numCapturingParens) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatKGroupName = function(state) {\n  if (state.eat(0x6B /* k */)) {\n    if (this.regexp_eatGroupName(state)) {\n      state.backReferenceNames.push(state.lastStringValue)\n      return true\n    }\n    state.raise(\"Invalid named reference\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape\npp.regexp_eatCharacterEscape = function(state) {\n  return (\n    this.regexp_eatControlEscape(state) ||\n    this.regexp_eatCControlLetter(state) ||\n    this.regexp_eatZero(state) ||\n    this.regexp_eatHexEscapeSequence(state) ||\n    this.regexp_eatRegExpUnicodeEscapeSequence(state) ||\n    (!state.switchU && this.regexp_eatLegacyOctalEscapeSequence(state)) ||\n    this.regexp_eatIdentityEscape(state)\n  )\n}\npp.regexp_eatCControlLetter = function(state) {\n  const start = state.pos\n  if (state.eat(0x63 /* c */)) {\n    if (this.regexp_eatControlLetter(state)) {\n      return true\n    }\n    state.pos = start\n  }\n  return false\n}\npp.regexp_eatZero = function(state) {\n  if (state.current() === 0x30 /* 0 */ && !isDecimalDigit(state.lookahead())) {\n    state.lastIntValue = 0\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape\npp.regexp_eatControlEscape = function(state) {\n  const ch = state.current()\n  if (ch === 0x74 /* t */) {\n    state.lastIntValue = 0x09 /* \\t */\n    state.advance()\n    return true\n  }\n  if (ch === 0x6E /* n */) {\n    state.lastIntValue = 0x0A /* \\n */\n    state.advance()\n    return true\n  }\n  if (ch === 0x76 /* v */) {\n    state.lastIntValue = 0x0B /* \\v */\n    state.advance()\n    return true\n  }\n  if (ch === 0x66 /* f */) {\n    state.lastIntValue = 0x0C /* \\f */\n    state.advance()\n    return true\n  }\n  if (ch === 0x72 /* r */) {\n    state.lastIntValue = 0x0D /* \\r */\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter\npp.regexp_eatControlLetter = function(state) {\n  const ch = state.current()\n  if (isControlLetter(ch)) {\n    state.lastIntValue = ch % 0x20\n    state.advance()\n    return true\n  }\n  return false\n}\nfunction isControlLetter(ch) {\n  return (\n    (ch >= 0x41 /* A */ && ch <= 0x5A /* Z */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x7A /* z */)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence\npp.regexp_eatRegExpUnicodeEscapeSequence = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x75 /* u */)) {\n    if (this.regexp_eatFixedHexDigits(state, 4)) {\n      const lead = state.lastIntValue\n      if (state.switchU && lead >= 0xD800 && lead <= 0xDBFF) {\n        const leadSurrogateEnd = state.pos\n        if (state.eat(0x5C /* \\ */) && state.eat(0x75 /* u */) && this.regexp_eatFixedHexDigits(state, 4)) {\n          const trail = state.lastIntValue\n          if (trail >= 0xDC00 && trail <= 0xDFFF) {\n            state.lastIntValue = (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000\n            return true\n          }\n        }\n        state.pos = leadSurrogateEnd\n        state.lastIntValue = lead\n      }\n      return true\n    }\n    if (\n      state.switchU &&\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatHexDigits(state) &&\n      state.eat(0x7D /* } */) &&\n      isValidUnicode(state.lastIntValue)\n    ) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid unicode escape\")\n    }\n    state.pos = start\n  }\n\n  return false\n}\nfunction isValidUnicode(ch) {\n  return ch >= 0 && ch <= 0x10FFFF\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape\npp.regexp_eatIdentityEscape = function(state) {\n  if (state.switchU) {\n    if (this.regexp_eatSyntaxCharacter(state)) {\n      return true\n    }\n    if (state.eat(0x2F /* / */)) {\n      state.lastIntValue = 0x2F /* / */\n      return true\n    }\n    return false\n  }\n\n  const ch = state.current()\n  if (ch !== 0x63 /* c */ && (!state.switchN || ch !== 0x6B /* k */)) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape\npp.regexp_eatDecimalEscape = function(state) {\n  state.lastIntValue = 0\n  let ch = state.current()\n  if (ch >= 0x31 /* 1 */ && ch <= 0x39 /* 9 */) {\n    do {\n      state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */)\n      state.advance()\n    } while ((ch = state.current()) >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */)\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape\npp.regexp_eatCharacterClassEscape = function(state) {\n  const ch = state.current()\n\n  if (isCharacterClassEscape(ch)) {\n    state.lastIntValue = -1\n    state.advance()\n    return true\n  }\n\n  if (\n    state.switchU &&\n    this.options.ecmaVersion >= 9 &&\n    (ch === 0x50 /* P */ || ch === 0x70 /* p */)\n  ) {\n    state.lastIntValue = -1\n    state.advance()\n    if (\n      state.eat(0x7B /* { */) &&\n      this.regexp_eatUnicodePropertyValueExpression(state) &&\n      state.eat(0x7D /* } */)\n    ) {\n      return true\n    }\n    state.raise(\"Invalid property name\")\n  }\n\n  return false\n}\nfunction isCharacterClassEscape(ch) {\n  return (\n    ch === 0x64 /* d */ ||\n    ch === 0x44 /* D */ ||\n    ch === 0x73 /* s */ ||\n    ch === 0x53 /* S */ ||\n    ch === 0x77 /* w */ ||\n    ch === 0x57 /* W */\n  )\n}\n\n// UnicodePropertyValueExpression ::\n//   UnicodePropertyName `=` UnicodePropertyValue\n//   LoneUnicodePropertyNameOrValue\npp.regexp_eatUnicodePropertyValueExpression = function(state) {\n  const start = state.pos\n\n  // UnicodePropertyName `=` UnicodePropertyValue\n  if (this.regexp_eatUnicodePropertyName(state) && state.eat(0x3D /* = */)) {\n    const name = state.lastStringValue\n    if (this.regexp_eatUnicodePropertyValue(state)) {\n      const value = state.lastStringValue\n      this.regexp_validateUnicodePropertyNameAndValue(state, name, value)\n      return true\n    }\n  }\n  state.pos = start\n\n  // LoneUnicodePropertyNameOrValue\n  if (this.regexp_eatLoneUnicodePropertyNameOrValue(state)) {\n    const nameOrValue = state.lastStringValue\n    this.regexp_validateUnicodePropertyNameOrValue(state, nameOrValue)\n    return true\n  }\n  return false\n}\npp.regexp_validateUnicodePropertyNameAndValue = function(state, name, value) {\n  if (!has(state.unicodeProperties.nonBinary, name))\n    state.raise(\"Invalid property name\")\n  if (!state.unicodeProperties.nonBinary[name].test(value))\n    state.raise(\"Invalid property value\")\n}\npp.regexp_validateUnicodePropertyNameOrValue = function(state, nameOrValue) {\n  if (!state.unicodeProperties.binary.test(nameOrValue))\n    state.raise(\"Invalid property name\")\n}\n\n// UnicodePropertyName ::\n//   UnicodePropertyNameCharacters\npp.regexp_eatUnicodePropertyName = function(state) {\n  let ch = 0\n  state.lastStringValue = \"\"\n  while (isUnicodePropertyNameCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch)\n    state.advance()\n  }\n  return state.lastStringValue !== \"\"\n}\nfunction isUnicodePropertyNameCharacter(ch) {\n  return isControlLetter(ch) || ch === 0x5F /* _ */\n}\n\n// UnicodePropertyValue ::\n//   UnicodePropertyValueCharacters\npp.regexp_eatUnicodePropertyValue = function(state) {\n  let ch = 0\n  state.lastStringValue = \"\"\n  while (isUnicodePropertyValueCharacter(ch = state.current())) {\n    state.lastStringValue += codePointToString(ch)\n    state.advance()\n  }\n  return state.lastStringValue !== \"\"\n}\nfunction isUnicodePropertyValueCharacter(ch) {\n  return isUnicodePropertyNameCharacter(ch) || isDecimalDigit(ch)\n}\n\n// LoneUnicodePropertyNameOrValue ::\n//   UnicodePropertyValueCharacters\npp.regexp_eatLoneUnicodePropertyNameOrValue = function(state) {\n  return this.regexp_eatUnicodePropertyValue(state)\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass\npp.regexp_eatCharacterClass = function(state) {\n  if (state.eat(0x5B /* [ */)) {\n    state.eat(0x5E /* ^ */)\n    this.regexp_classRanges(state)\n    if (state.eat(0x5D /* [ */)) {\n      return true\n    }\n    // Unreachable since it threw \"unterminated regular expression\" error before.\n    state.raise(\"Unterminated character class\")\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges\n// https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash\npp.regexp_classRanges = function(state) {\n  while (this.regexp_eatClassAtom(state)) {\n    const left = state.lastIntValue\n    if (state.eat(0x2D /* - */) && this.regexp_eatClassAtom(state)) {\n      const right = state.lastIntValue\n      if (state.switchU && (left === -1 || right === -1)) {\n        state.raise(\"Invalid character class\")\n      }\n      if (left !== -1 && right !== -1 && left > right) {\n        state.raise(\"Range out of order in character class\")\n      }\n    }\n  }\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom\n// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash\npp.regexp_eatClassAtom = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x5C /* \\ */)) {\n    if (this.regexp_eatClassEscape(state)) {\n      return true\n    }\n    if (state.switchU) {\n      // Make the same message as V8.\n      const ch = state.current()\n      if (ch === 0x63 /* c */ || isOctalDigit(ch)) {\n        state.raise(\"Invalid class escape\")\n      }\n      state.raise(\"Invalid escape\")\n    }\n    state.pos = start\n  }\n\n  const ch = state.current()\n  if (ch !== 0x5D /* [ */) {\n    state.lastIntValue = ch\n    state.advance()\n    return true\n  }\n\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape\npp.regexp_eatClassEscape = function(state) {\n  const start = state.pos\n\n  if (state.eat(0x62 /* b */)) {\n    state.lastIntValue = 0x08 /* <BS> */\n    return true\n  }\n\n  if (state.switchU && state.eat(0x2D /* - */)) {\n    state.lastIntValue = 0x2D /* - */\n    return true\n  }\n\n  if (!state.switchU && state.eat(0x63 /* c */)) {\n    if (this.regexp_eatClassControlLetter(state)) {\n      return true\n    }\n    state.pos = start\n  }\n\n  return (\n    this.regexp_eatCharacterClassEscape(state) ||\n    this.regexp_eatCharacterEscape(state)\n  )\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter\npp.regexp_eatClassControlLetter = function(state) {\n  const ch = state.current()\n  if (isDecimalDigit(ch) || ch === 0x5F /* _ */) {\n    state.lastIntValue = ch % 0x20\n    state.advance()\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp.regexp_eatHexEscapeSequence = function(state) {\n  const start = state.pos\n  if (state.eat(0x78 /* x */)) {\n    if (this.regexp_eatFixedHexDigits(state, 2)) {\n      return true\n    }\n    if (state.switchU) {\n      state.raise(\"Invalid escape\")\n    }\n    state.pos = start\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits\npp.regexp_eatDecimalDigits = function(state) {\n  const start = state.pos\n  let ch = 0\n  state.lastIntValue = 0\n  while (isDecimalDigit(ch = state.current())) {\n    state.lastIntValue = 10 * state.lastIntValue + (ch - 0x30 /* 0 */)\n    state.advance()\n  }\n  return state.pos !== start\n}\nfunction isDecimalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits\npp.regexp_eatHexDigits = function(state) {\n  const start = state.pos\n  let ch = 0\n  state.lastIntValue = 0\n  while (isHexDigit(ch = state.current())) {\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch)\n    state.advance()\n  }\n  return state.pos !== start\n}\nfunction isHexDigit(ch) {\n  return (\n    (ch >= 0x30 /* 0 */ && ch <= 0x39 /* 9 */) ||\n    (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) ||\n    (ch >= 0x61 /* a */ && ch <= 0x66 /* f */)\n  )\n}\nfunction hexToInt(ch) {\n  if (ch >= 0x41 /* A */ && ch <= 0x46 /* F */) {\n    return 10 + (ch - 0x41 /* A */)\n  }\n  if (ch >= 0x61 /* a */ && ch <= 0x66 /* f */) {\n    return 10 + (ch - 0x61 /* a */)\n  }\n  return ch - 0x30 /* 0 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence\n// Allows only 0-377(octal) i.e. 0-255(decimal).\npp.regexp_eatLegacyOctalEscapeSequence = function(state) {\n  if (this.regexp_eatOctalDigit(state)) {\n    const n1 = state.lastIntValue\n    if (this.regexp_eatOctalDigit(state)) {\n      const n2 = state.lastIntValue\n      if (n1 <= 3 && this.regexp_eatOctalDigit(state)) {\n        state.lastIntValue = n1 * 64 + n2 * 8 + state.lastIntValue\n      } else {\n        state.lastIntValue = n1 * 8 + n2\n      }\n    } else {\n      state.lastIntValue = n1\n    }\n    return true\n  }\n  return false\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit\npp.regexp_eatOctalDigit = function(state) {\n  const ch = state.current()\n  if (isOctalDigit(ch)) {\n    state.lastIntValue = ch - 0x30 /* 0 */\n    state.advance()\n    return true\n  }\n  state.lastIntValue = 0\n  return false\n}\nfunction isOctalDigit(ch) {\n  return ch >= 0x30 /* 0 */ && ch <= 0x37 /* 7 */\n}\n\n// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits\n// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit\n// And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence\npp.regexp_eatFixedHexDigits = function(state, length) {\n  const start = state.pos\n  state.lastIntValue = 0\n  for (let i = 0; i < length; ++i) {\n    const ch = state.current()\n    if (!isHexDigit(ch)) {\n      state.pos = start\n      return false\n    }\n    state.lastIntValue = 16 * state.lastIntValue + hexToInt(ch)\n    state.advance()\n  }\n  return true\n}\n","import {isIdentifierStart, isIdentifierChar} from \"./identifier\"\nimport {types as tt, keywords as keywordTypes} from \"./tokentype\"\nimport {Parser} from \"./state\"\nimport {SourceLocation} from \"./locutil\"\nimport {RegExpValidationState} from \"./regexp\"\nimport {lineBreak, lineBreakG, isNewLine, nonASCIIwhitespace} from \"./whitespace\"\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nexport class Token {\n  constructor(p) {\n    this.type = p.type\n    this.value = p.value\n    this.start = p.start\n    this.end = p.end\n    if (p.options.locations)\n      this.loc = new SourceLocation(p, p.startLoc, p.endLoc)\n    if (p.options.ranges)\n      this.range = [p.start, p.end]\n  }\n}\n\n// ## Tokenizer\n\nconst pp = Parser.prototype\n\n// Move to the next token\n\npp.next = function() {\n  if (this.options.onToken)\n    this.options.onToken(new Token(this))\n\n  this.lastTokEnd = this.end\n  this.lastTokStart = this.start\n  this.lastTokEndLoc = this.endLoc\n  this.lastTokStartLoc = this.startLoc\n  this.nextToken()\n}\n\npp.getToken = function() {\n  this.next()\n  return new Token(this)\n}\n\n// If we're in an ES6 environment, make parsers iterable\nif (typeof Symbol !== \"undefined\")\n  pp[Symbol.iterator] = function() {\n    return {\n      next: () => {\n        let token = this.getToken()\n        return {\n          done: token.type === tt.eof,\n          value: token\n        }\n      }\n    }\n  }\n\n// Toggle strict mode. Re-reads the next number or string to please\n// pedantic tests (`\"use strict\"; 010;` should fail).\n\npp.curContext = function() {\n  return this.context[this.context.length - 1]\n}\n\n// Read a single token, updating the parser object's token-related\n// properties.\n\npp.nextToken = function() {\n  let curContext = this.curContext()\n  if (!curContext || !curContext.preserveSpace) this.skipSpace()\n\n  this.start = this.pos\n  if (this.options.locations) this.startLoc = this.curPosition()\n  if (this.pos >= this.input.length) return this.finishToken(tt.eof)\n\n  if (curContext.override) return curContext.override(this)\n  else this.readToken(this.fullCharCodeAtPos())\n}\n\npp.readToken = function(code) {\n  // Identifier or keyword. '\\uXXXX' sequences are allowed in\n  // identifiers, so '\\' also dispatches to that.\n  if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\\' */)\n    return this.readWord()\n\n  return this.getTokenFromCode(code)\n}\n\npp.fullCharCodeAtPos = function() {\n  let code = this.input.charCodeAt(this.pos)\n  if (code <= 0xd7ff || code >= 0xe000) return code\n  let next = this.input.charCodeAt(this.pos + 1)\n  return (code << 10) + next - 0x35fdc00\n}\n\npp.skipBlockComment = function() {\n  let startLoc = this.options.onComment && this.curPosition()\n  let start = this.pos, end = this.input.indexOf(\"*/\", this.pos += 2)\n  if (end === -1) this.raise(this.pos - 2, \"Unterminated comment\")\n  this.pos = end + 2\n  if (this.options.locations) {\n    lineBreakG.lastIndex = start\n    let match\n    while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) {\n      ++this.curLine\n      this.lineStart = match.index + match[0].length\n    }\n  }\n  if (this.options.onComment)\n    this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos,\n                           startLoc, this.curPosition())\n}\n\npp.skipLineComment = function(startSkip) {\n  let start = this.pos\n  let startLoc = this.options.onComment && this.curPosition()\n  let ch = this.input.charCodeAt(this.pos += startSkip)\n  while (this.pos < this.input.length && !isNewLine(ch)) {\n    ch = this.input.charCodeAt(++this.pos)\n  }\n  if (this.options.onComment)\n    this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos,\n                           startLoc, this.curPosition())\n}\n\n// Called at the start of the parse and after every token. Skips\n// whitespace and comments, and.\n\npp.skipSpace = function() {\n  loop: while (this.pos < this.input.length) {\n    let ch = this.input.charCodeAt(this.pos)\n    switch (ch) {\n    case 32: case 160: // ' '\n      ++this.pos\n      break\n    case 13:\n      if (this.input.charCodeAt(this.pos + 1) === 10) {\n        ++this.pos\n      }\n    case 10: case 8232: case 8233:\n      ++this.pos\n      if (this.options.locations) {\n        ++this.curLine\n        this.lineStart = this.pos\n      }\n      break\n    case 47: // '/'\n      switch (this.input.charCodeAt(this.pos + 1)) {\n      case 42: // '*'\n        this.skipBlockComment()\n        break\n      case 47:\n        this.skipLineComment(2)\n        break\n      default:\n        break loop\n      }\n      break\n    default:\n      if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) {\n        ++this.pos\n      } else {\n        break loop\n      }\n    }\n  }\n}\n\n// Called at the end of every token. Sets `end`, `val`, and\n// maintains `context` and `exprAllowed`, and skips the space after\n// the token, so that the next one's `start` will point at the\n// right position.\n\npp.finishToken = function(type, val) {\n  this.end = this.pos\n  if (this.options.locations) this.endLoc = this.curPosition()\n  let prevType = this.type\n  this.type = type\n  this.value = val\n\n  this.updateContext(prevType)\n}\n\n// ### Token reading\n\n// This is the function that is called to fetch the next token. It\n// is somewhat obscure, because it works in character codes rather\n// than characters, and because operator parsing has been inlined\n// into it.\n//\n// All in the name of speed.\n//\npp.readToken_dot = function() {\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next >= 48 && next <= 57) return this.readNumber(true)\n  let next2 = this.input.charCodeAt(this.pos + 2)\n  if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.'\n    this.pos += 3\n    return this.finishToken(tt.ellipsis)\n  } else {\n    ++this.pos\n    return this.finishToken(tt.dot)\n  }\n}\n\npp.readToken_slash = function() { // '/'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (this.exprAllowed) { ++this.pos; return this.readRegexp() }\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.slash, 1)\n}\n\npp.readToken_mult_modulo_exp = function(code) { // '%*'\n  let next = this.input.charCodeAt(this.pos + 1)\n  let size = 1\n  let tokentype = code === 42 ? tt.star : tt.modulo\n\n  // exponentiation operator ** and **=\n  if (this.options.ecmaVersion >= 7 && code === 42 && next === 42) {\n    ++size\n    tokentype = tt.starstar\n    next = this.input.charCodeAt(this.pos + 2)\n  }\n\n  if (next === 61) return this.finishOp(tt.assign, size + 1)\n  return this.finishOp(tokentype, size)\n}\n\npp.readToken_pipe_amp = function(code) { // '|&'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === code) return this.finishOp(code === 124 ? tt.logicalOR : tt.logicalAND, 2)\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(code === 124 ? tt.bitwiseOR : tt.bitwiseAND, 1)\n}\n\npp.readToken_caret = function() { // '^'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.bitwiseXOR, 1)\n}\n\npp.readToken_plus_min = function(code) { // '+-'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === code) {\n    if (next === 45 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 62 &&\n        (this.lastTokEnd === 0 || lineBreak.test(this.input.slice(this.lastTokEnd, this.pos)))) {\n      // A `-->` line comment\n      this.skipLineComment(3)\n      this.skipSpace()\n      return this.nextToken()\n    }\n    return this.finishOp(tt.incDec, 2)\n  }\n  if (next === 61) return this.finishOp(tt.assign, 2)\n  return this.finishOp(tt.plusMin, 1)\n}\n\npp.readToken_lt_gt = function(code) { // '<>'\n  let next = this.input.charCodeAt(this.pos + 1)\n  let size = 1\n  if (next === code) {\n    size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2\n    if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(tt.assign, size + 1)\n    return this.finishOp(tt.bitShift, size)\n  }\n  if (next === 33 && code === 60 && !this.inModule && this.input.charCodeAt(this.pos + 2) === 45 &&\n      this.input.charCodeAt(this.pos + 3) === 45) {\n    // `<!--`, an XML-style comment that should be interpreted as a line comment\n    this.skipLineComment(4)\n    this.skipSpace()\n    return this.nextToken()\n  }\n  if (next === 61) size = 2\n  return this.finishOp(tt.relational, size)\n}\n\npp.readToken_eq_excl = function(code) { // '=!'\n  let next = this.input.charCodeAt(this.pos + 1)\n  if (next === 61) return this.finishOp(tt.equality, this.input.charCodeAt(this.pos + 2) === 61 ? 3 : 2)\n  if (code === 61 && next === 62 && this.options.ecmaVersion >= 6) { // '=>'\n    this.pos += 2\n    return this.finishToken(tt.arrow)\n  }\n  return this.finishOp(code === 61 ? tt.eq : tt.prefix, 1)\n}\n\npp.getTokenFromCode = function(code) {\n  switch (code) {\n  // The interpretation of a dot depends on whether it is followed\n  // by a digit or another two dots.\n  case 46: // '.'\n    return this.readToken_dot()\n\n  // Punctuation tokens.\n  case 40: ++this.pos; return this.finishToken(tt.parenL)\n  case 41: ++this.pos; return this.finishToken(tt.parenR)\n  case 59: ++this.pos; return this.finishToken(tt.semi)\n  case 44: ++this.pos; return this.finishToken(tt.comma)\n  case 91: ++this.pos; return this.finishToken(tt.bracketL)\n  case 93: ++this.pos; return this.finishToken(tt.bracketR)\n  case 123: ++this.pos; return this.finishToken(tt.braceL)\n  case 125: ++this.pos; return this.finishToken(tt.braceR)\n  case 58: ++this.pos; return this.finishToken(tt.colon)\n  case 63: ++this.pos; return this.finishToken(tt.question)\n\n  case 96: // '`'\n    if (this.options.ecmaVersion < 6) break\n    ++this.pos\n    return this.finishToken(tt.backQuote)\n\n  case 48: // '0'\n    let next = this.input.charCodeAt(this.pos + 1)\n    if (next === 120 || next === 88) return this.readRadixNumber(16) // '0x', '0X' - hex number\n    if (this.options.ecmaVersion >= 6) {\n      if (next === 111 || next === 79) return this.readRadixNumber(8) // '0o', '0O' - octal number\n      if (next === 98 || next === 66) return this.readRadixNumber(2) // '0b', '0B' - binary number\n    }\n\n  // Anything else beginning with a digit is an integer, octal\n  // number, or float.\n  case 49: case 50: case 51: case 52: case 53: case 54: case 55: case 56: case 57: // 1-9\n    return this.readNumber(false)\n\n  // Quotes produce strings.\n  case 34: case 39: // '\"', \"'\"\n    return this.readString(code)\n\n  // Operators are parsed inline in tiny state machines. '=' (61) is\n  // often referred to. `finishOp` simply skips the amount of\n  // characters it is given as second argument, and returns a token\n  // of the type given by its first argument.\n\n  case 47: // '/'\n    return this.readToken_slash()\n\n  case 37: case 42: // '%*'\n    return this.readToken_mult_modulo_exp(code)\n\n  case 124: case 38: // '|&'\n    return this.readToken_pipe_amp(code)\n\n  case 94: // '^'\n    return this.readToken_caret()\n\n  case 43: case 45: // '+-'\n    return this.readToken_plus_min(code)\n\n  case 60: case 62: // '<>'\n    return this.readToken_lt_gt(code)\n\n  case 61: case 33: // '=!'\n    return this.readToken_eq_excl(code)\n\n  case 126: // '~'\n    return this.finishOp(tt.prefix, 1)\n  }\n\n  this.raise(this.pos, \"Unexpected character '\" + codePointToString(code) + \"'\")\n}\n\npp.finishOp = function(type, size) {\n  let str = this.input.slice(this.pos, this.pos + size)\n  this.pos += size\n  return this.finishToken(type, str)\n}\n\npp.readRegexp = function() {\n  let escaped, inClass, start = this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(start, \"Unterminated regular expression\")\n    let ch = this.input.charAt(this.pos)\n    if (lineBreak.test(ch)) this.raise(start, \"Unterminated regular expression\")\n    if (!escaped) {\n      if (ch === \"[\") inClass = true\n      else if (ch === \"]\" && inClass) inClass = false\n      else if (ch === \"/\" && !inClass) break\n      escaped = ch === \"\\\\\"\n    } else escaped = false\n    ++this.pos\n  }\n  let pattern = this.input.slice(start, this.pos)\n  ++this.pos\n  let flagsStart = this.pos\n  let flags = this.readWord1()\n  if (this.containsEsc) this.unexpected(flagsStart)\n\n  // Validate pattern\n  const state = this.regexpState || (this.regexpState = new RegExpValidationState(this))\n  state.reset(start, pattern, flags)\n  this.validateRegExpFlags(state)\n  this.validateRegExpPattern(state)\n\n  // Create Literal#value property value.\n  let value = null\n  try {\n    value = new RegExp(pattern, flags)\n  } catch (e) {\n    // ESTree requires null if it failed to instantiate RegExp object.\n    // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral\n  }\n\n  return this.finishToken(tt.regexp, {pattern, flags, value})\n}\n\n// Read an integer in the given radix. Return null if zero digits\n// were read, the integer value otherwise. When `len` is given, this\n// will return `null` unless the integer has exactly `len` digits.\n\npp.readInt = function(radix, len) {\n  let start = this.pos, total = 0\n  for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {\n    let code = this.input.charCodeAt(this.pos), val\n    if (code >= 97) val = code - 97 + 10 // a\n    else if (code >= 65) val = code - 65 + 10 // A\n    else if (code >= 48 && code <= 57) val = code - 48 // 0-9\n    else val = Infinity\n    if (val >= radix) break\n    ++this.pos\n    total = total * radix + val\n  }\n  if (this.pos === start || len != null && this.pos - start !== len) return null\n\n  return total\n}\n\npp.readRadixNumber = function(radix) {\n  this.pos += 2 // 0x\n  let val = this.readInt(radix)\n  if (val == null) this.raise(this.start + 2, \"Expected number in radix \" + radix)\n  if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\")\n  return this.finishToken(tt.num, val)\n}\n\n// Read an integer, octal integer, or floating-point number.\n\npp.readNumber = function(startsWithDot) {\n  let start = this.pos\n  if (!startsWithDot && this.readInt(10) === null) this.raise(start, \"Invalid number\")\n  let octal = this.pos - start >= 2 && this.input.charCodeAt(start) === 48\n  if (octal && this.strict) this.raise(start, \"Invalid number\")\n  if (octal && /[89]/.test(this.input.slice(start, this.pos))) octal = false\n  let next = this.input.charCodeAt(this.pos)\n  if (next === 46 && !octal) { // '.'\n    ++this.pos\n    this.readInt(10)\n    next = this.input.charCodeAt(this.pos)\n  }\n  if ((next === 69 || next === 101) && !octal) { // 'eE'\n    next = this.input.charCodeAt(++this.pos)\n    if (next === 43 || next === 45) ++this.pos // '+-'\n    if (this.readInt(10) === null) this.raise(start, \"Invalid number\")\n  }\n  if (isIdentifierStart(this.fullCharCodeAtPos())) this.raise(this.pos, \"Identifier directly after number\")\n\n  let str = this.input.slice(start, this.pos)\n  let val = octal ? parseInt(str, 8) : parseFloat(str)\n  return this.finishToken(tt.num, val)\n}\n\n// Read a string value, interpreting backslash-escapes.\n\npp.readCodePoint = function() {\n  let ch = this.input.charCodeAt(this.pos), code\n\n  if (ch === 123) { // '{'\n    if (this.options.ecmaVersion < 6) this.unexpected()\n    let codePos = ++this.pos\n    code = this.readHexChar(this.input.indexOf(\"}\", this.pos) - this.pos)\n    ++this.pos\n    if (code > 0x10FFFF) this.invalidStringToken(codePos, \"Code point out of bounds\")\n  } else {\n    code = this.readHexChar(4)\n  }\n  return code\n}\n\nfunction codePointToString(code) {\n  // UTF-16 Decoding\n  if (code <= 0xFFFF) return String.fromCharCode(code)\n  code -= 0x10000\n  return String.fromCharCode((code >> 10) + 0xD800, (code & 1023) + 0xDC00)\n}\n\npp.readString = function(quote) {\n  let out = \"\", chunkStart = ++this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated string constant\")\n    let ch = this.input.charCodeAt(this.pos)\n    if (ch === quote) break\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos)\n      out += this.readEscapedChar(false)\n      chunkStart = this.pos\n    } else {\n      if (isNewLine(ch, this.options.ecmaVersion >= 10)) this.raise(this.start, \"Unterminated string constant\")\n      ++this.pos\n    }\n  }\n  out += this.input.slice(chunkStart, this.pos++)\n  return this.finishToken(tt.string, out)\n}\n\n// Reads template string tokens.\n\nconst INVALID_TEMPLATE_ESCAPE_ERROR = {}\n\npp.tryReadTemplateToken = function() {\n  this.inTemplateElement = true\n  try {\n    this.readTmplToken()\n  } catch (err) {\n    if (err === INVALID_TEMPLATE_ESCAPE_ERROR) {\n      this.readInvalidTemplateToken()\n    } else {\n      throw err\n    }\n  }\n\n  this.inTemplateElement = false\n}\n\npp.invalidStringToken = function(position, message) {\n  if (this.inTemplateElement && this.options.ecmaVersion >= 9) {\n    throw INVALID_TEMPLATE_ESCAPE_ERROR\n  } else {\n    this.raise(position, message)\n  }\n}\n\npp.readTmplToken = function() {\n  let out = \"\", chunkStart = this.pos\n  for (;;) {\n    if (this.pos >= this.input.length) this.raise(this.start, \"Unterminated template\")\n    let ch = this.input.charCodeAt(this.pos)\n    if (ch === 96 || ch === 36 && this.input.charCodeAt(this.pos + 1) === 123) { // '`', '${'\n      if (this.pos === this.start && (this.type === tt.template || this.type === tt.invalidTemplate)) {\n        if (ch === 36) {\n          this.pos += 2\n          return this.finishToken(tt.dollarBraceL)\n        } else {\n          ++this.pos\n          return this.finishToken(tt.backQuote)\n        }\n      }\n      out += this.input.slice(chunkStart, this.pos)\n      return this.finishToken(tt.template, out)\n    }\n    if (ch === 92) { // '\\'\n      out += this.input.slice(chunkStart, this.pos)\n      out += this.readEscapedChar(true)\n      chunkStart = this.pos\n    } else if (isNewLine(ch)) {\n      out += this.input.slice(chunkStart, this.pos)\n      ++this.pos\n      switch (ch) {\n      case 13:\n        if (this.input.charCodeAt(this.pos) === 10) ++this.pos\n      case 10:\n        out += \"\\n\"\n        break\n      default:\n        out += String.fromCharCode(ch)\n        break\n      }\n      if (this.options.locations) {\n        ++this.curLine\n        this.lineStart = this.pos\n      }\n      chunkStart = this.pos\n    } else {\n      ++this.pos\n    }\n  }\n}\n\n// Reads a template token to search for the end, without validating any escape sequences\npp.readInvalidTemplateToken = function() {\n  for (; this.pos < this.input.length; this.pos++) {\n    switch (this.input[this.pos]) {\n    case \"\\\\\":\n      ++this.pos\n      break\n\n    case \"$\":\n      if (this.input[this.pos + 1] !== \"{\") {\n        break\n      }\n    // falls through\n\n    case \"`\":\n      return this.finishToken(tt.invalidTemplate, this.input.slice(this.start, this.pos))\n\n    // no default\n    }\n  }\n  this.raise(this.start, \"Unterminated template\")\n}\n\n// Used to read escaped characters\n\npp.readEscapedChar = function(inTemplate) {\n  let ch = this.input.charCodeAt(++this.pos)\n  ++this.pos\n  switch (ch) {\n  case 110: return \"\\n\" // 'n' -> '\\n'\n  case 114: return \"\\r\" // 'r' -> '\\r'\n  case 120: return String.fromCharCode(this.readHexChar(2)) // 'x'\n  case 117: return codePointToString(this.readCodePoint()) // 'u'\n  case 116: return \"\\t\" // 't' -> '\\t'\n  case 98: return \"\\b\" // 'b' -> '\\b'\n  case 118: return \"\\u000b\" // 'v' -> '\\u000b'\n  case 102: return \"\\f\" // 'f' -> '\\f'\n  case 13: if (this.input.charCodeAt(this.pos) === 10) ++this.pos // '\\r\\n'\n  case 10: // ' \\n'\n    if (this.options.locations) { this.lineStart = this.pos; ++this.curLine }\n    return \"\"\n  default:\n    if (ch >= 48 && ch <= 55) {\n      let octalStr = this.input.substr(this.pos - 1, 3).match(/^[0-7]+/)[0]\n      let octal = parseInt(octalStr, 8)\n      if (octal > 255) {\n        octalStr = octalStr.slice(0, -1)\n        octal = parseInt(octalStr, 8)\n      }\n      this.pos += octalStr.length - 1\n      ch = this.input.charCodeAt(this.pos)\n      if ((octalStr !== \"0\" || ch === 56 || ch === 57) && (this.strict || inTemplate)) {\n        this.invalidStringToken(\n          this.pos - 1 - octalStr.length,\n          inTemplate\n            ? \"Octal literal in template string\"\n            : \"Octal literal in strict mode\"\n        )\n      }\n      return String.fromCharCode(octal)\n    }\n    if (isNewLine(ch)) {\n      // Unicode new line characters after \\ get removed from output in both\n      // template literals and strings\n      return \"\"\n    }\n    return String.fromCharCode(ch)\n  }\n}\n\n// Used to read character escape sequences ('\\x', '\\u', '\\U').\n\npp.readHexChar = function(len) {\n  let codePos = this.pos\n  let n = this.readInt(16, len)\n  if (n === null) this.invalidStringToken(codePos, \"Bad character escape sequence\")\n  return n\n}\n\n// Read an identifier, and return it as a string. Sets `this.containsEsc`\n// to whether the word contained a '\\u' escape.\n//\n// Incrementally adds only escaped chars, adding other chunks as-is\n// as a micro-optimization.\n\npp.readWord1 = function() {\n  this.containsEsc = false\n  let word = \"\", first = true, chunkStart = this.pos\n  let astral = this.options.ecmaVersion >= 6\n  while (this.pos < this.input.length) {\n    let ch = this.fullCharCodeAtPos()\n    if (isIdentifierChar(ch, astral)) {\n      this.pos += ch <= 0xffff ? 1 : 2\n    } else if (ch === 92) { // \"\\\"\n      this.containsEsc = true\n      word += this.input.slice(chunkStart, this.pos)\n      let escStart = this.pos\n      if (this.input.charCodeAt(++this.pos) !== 117) // \"u\"\n        this.invalidStringToken(this.pos, \"Expecting Unicode escape sequence \\\\uXXXX\")\n      ++this.pos\n      let esc = this.readCodePoint()\n      if (!(first ? isIdentifierStart : isIdentifierChar)(esc, astral))\n        this.invalidStringToken(escStart, \"Invalid Unicode escape\")\n      word += codePointToString(esc)\n      chunkStart = this.pos\n    } else {\n      break\n    }\n    first = false\n  }\n  return word + this.input.slice(chunkStart, this.pos)\n}\n\n// Read an identifier or keyword token. Will check for reserved\n// words when necessary.\n\npp.readWord = function() {\n  let word = this.readWord1()\n  let type = tt.name\n  if (this.keywords.test(word)) {\n    if (this.containsEsc) this.raiseRecoverable(this.start, \"Escape sequence in keyword \" + word)\n    type = keywordTypes[word]\n  }\n  return this.finishToken(type, word)\n}\n","// Acorn is a tiny, fast JavaScript parser written in JavaScript.\n//\n// Acorn was written by Marijn Haverbeke, Ingvar Stepanyan, and\n// various contributors and released under an MIT license.\n//\n// Git repositories for Acorn are available at\n//\n//     http://marijnhaverbeke.nl/git/acorn\n//     https://github.com/acornjs/acorn.git\n//\n// Please use the [github bug tracker][ghbt] to report issues.\n//\n// [ghbt]: https://github.com/acornjs/acorn/issues\n//\n// [walk]: util/walk.js\n\nimport {Parser} from \"./state\"\nimport \"./parseutil\"\nimport \"./statement\"\nimport \"./lval\"\nimport \"./expression\"\nimport \"./location\"\nimport \"./scope\"\n\nexport {Parser} from \"./state\"\nexport {defaultOptions} from \"./options\"\nexport {Position, SourceLocation, getLineInfo} from \"./locutil\"\nexport {Node} from \"./node\"\nexport {TokenType, types as tokTypes, keywords as keywordTypes} from \"./tokentype\"\nexport {TokContext, types as tokContexts} from \"./tokencontext\"\nexport {isIdentifierChar, isIdentifierStart} from \"./identifier\"\nexport {Token} from \"./tokenize\"\nexport {isNewLine, lineBreak, lineBreakG, nonASCIIwhitespace} from \"./whitespace\"\n\nexport const version = \"6.1.1\"\n\n// The main exported interface (under `self.acorn` when in the\n// browser) is a `parse` function that takes a code string and\n// returns an abstract syntax tree as specified by [Mozilla parser\n// API][api].\n//\n// [api]: https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API\n\nexport function parse(input, options) {\n  return Parser.parse(input, options)\n}\n\n// This function tries to parse a single expression at a given\n// offset in a string. Useful for parsing mixed-language formats\n// that embed JavaScript expressions.\n\nexport function parseExpressionAt(input, pos, options) {\n  return Parser.parseExpressionAt(input, pos, options)\n}\n\n// Acorn is organized as a tokenizer and a recursive-descent parser.\n// The `tokenizer` export provides an interface to the tokenizer.\n\nexport function tokenizer(input, options) {\n  return Parser.tokenizer(input, options)\n}\n"],"names":["const","let","keywords","tt","this","pp","init","label","node","empty","scope","types","UNICODE_PROPERTY_VALUES","codePointToString","ch","keywordTypes"],"mappings":"AAAA;;AAEA,AAAOA,IAAM,aAAa,GAAG;EAC3B,CAAC,EAAE,qNAAqN;EACxN,CAAC,EAAE,8CAA8C;EACjD,CAAC,EAAE,MAAM;EACT,MAAM,EAAE,wEAAwE;EAChF,UAAU,EAAE,gBAAgB;EAC7B;;;;AAIDA,IAAM,oBAAoB,GAAG,8KAA6K;;AAE1M,AAAOA,IAAM,QAAQ,GAAG;EACtB,CAAC,EAAE,oBAAoB;EACvB,CAAC,EAAE,oBAAoB,GAAG,0CAA0C;EACrE;;AAED,AAAOA,IAAM,yBAAyB,GAAG,kBAAiB;;;;;;;;;;AAU1DC,IAAI,4BAA4B,GAAG,4tIAA2tI;AAC9vIA,IAAI,uBAAuB,GAAG,sjFAAqjF;;AAEnlFD,IAAM,uBAAuB,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,4BAA4B,GAAG,GAAG,EAAC;AACpFA,IAAM,kBAAkB,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,4BAA4B,GAAG,uBAAuB,GAAG,GAAG,EAAC;;AAEzG,4BAA4B,GAAG,uBAAuB,GAAG,KAAI;;;;;;;;;AAS7DA,IAAM,0BAA0B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAC;;;AAGvqCA,IAAM,qBAAqB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAC;;;;;AAKnlB,SAAS,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE;EAChCC,IAAI,GAAG,GAAG,QAAO;EACjB,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;IACtC,GAAG,IAAI,GAAG,CAAC,CAAC,EAAC;IACb,IAAI,GAAG,GAAG,IAAI,EAAE,EAAA,OAAO,KAAK,EAAA;IAC5B,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAC;IACjB,IAAI,GAAG,IAAI,IAAI,EAAE,EAAA,OAAO,IAAI,EAAA;GAC7B;CACF;;;;AAID,AAAO,SAAS,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE;EAC9C,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC3B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,IAAI,IAAI,IAAI,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAA;EAClG,IAAI,MAAM,KAAK,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;EAClC,OAAO,aAAa,CAAC,IAAI,EAAE,0BAA0B,CAAC;CACvD;;;;AAID,AAAO,SAAS,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE;EAC7C,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,KAAK,EAAA;EAC3B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1B,IAAI,IAAI,GAAG,EAAE,EAAE,EAAA,OAAO,IAAI,KAAK,EAAE,EAAA;EACjC,IAAI,IAAI,GAAG,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC3B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,IAAI,IAAI,IAAI,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAA;EAC7F,IAAI,MAAM,KAAK,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;EAClC,OAAO,aAAa,CAAC,IAAI,EAAE,0BAA0B,CAAC,IAAI,aAAa,CAAC,IAAI,EAAE,qBAAqB,CAAC;CACrG;;ACtFD;;;;;;;;;;;;;;;;;;;;;;;AAuBA,AAAO,IAAM,SAAS,GAAC,kBACV,CAAC,KAAK,EAAE,IAAS,EAAE;6BAAP,GAAG,EAAE;;EAC5B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,QAAO;EAC7B,IAAM,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,WAAU;EACrC,IAAM,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,WAAU;EACrC,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAM;EAC7B,IAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,SAAQ;EACjC,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAM;EAC7B,IAAM,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,QAAO;EAC/B,IAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAI;EACjC,IAAM,CAAC,aAAa,GAAG,KAAI;CAC1B,CAAA;;AAGH,SAAS,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE;EACzB,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;CAC5D;AACDD,IAAM,UAAU,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC;IAAE,UAAU,GAAG,CAAC,UAAU,EAAE,IAAI,EAAC;;;;AAItE,AAAOA,IAAME,UAAQ,GAAG,GAAE;;;AAG1B,SAAS,EAAE,CAAC,IAAI,EAAE,OAAY,EAAE;mCAAP,GAAG,EAAE;;EAC5B,OAAO,CAAC,OAAO,GAAG,KAAI;EACtB,OAAOA,UAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC;CACrD;;AAED,AAAOF,IAAM,KAAK,GAAG;EACnB,GAAG,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC;EACrC,MAAM,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC;EAC3C,MAAM,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC;EAC3C,IAAI,EAAE,IAAI,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC;EACvC,GAAG,EAAE,IAAI,SAAS,CAAC,KAAK,CAAC;;;EAGzB,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAClE,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC5B,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChE,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC1B,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChE,MAAM,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EAC1B,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACrC,IAAI,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACpC,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACrC,GAAG,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC;EACvB,QAAQ,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACxC,KAAK,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC;EACtC,QAAQ,EAAE,IAAI,SAAS,CAAC,UAAU,CAAC;EACnC,eAAe,EAAE,IAAI,SAAS,CAAC,iBAAiB,CAAC;EACjD,QAAQ,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC;EAC1C,SAAS,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC;EACzC,YAAY,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;;;;;;;;;;;;;;;;EAgBvE,EAAE,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;EAC1D,MAAM,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;EAC/D,MAAM,EAAE,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC/E,MAAM,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAChF,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;EACzB,UAAU,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;EAC1B,SAAS,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACxB,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACzB,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EACzB,QAAQ,EAAE,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC;EACnC,UAAU,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;EACjC,QAAQ,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;EAC/B,OAAO,EAAE,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC3F,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACtB,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACpB,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;EACrB,QAAQ,EAAE,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;;;EAGjD,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC;EACzB,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC;EACzB,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;EACnC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EAC/C,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,QAAQ,EAAE,EAAE,CAAC,SAAS,CAAC;EACvB,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;EAC/B,SAAS,EAAE,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;EACrC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC;EACb,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC;EACjC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC;EACf,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC;EACf,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC;EACnB,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;EACnC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC;EACjB,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACrD,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,QAAQ,EAAE,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;EACnC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC;EACrB,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;EAC7B,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;EAC/B,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;EAC3C,WAAW,EAAE,EAAE,CAAC,YAAY,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;EAC3D,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACzE,KAAK,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;EACrE,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;CAC1E;;ACnJD;;;AAGA,AAAOA,IAAM,SAAS,GAAG,yBAAwB;AACjD,AAAOA,IAAM,UAAU,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,EAAC;;AAE3D,AAAO,SAAS,SAAS,CAAC,IAAI,EAAE,cAAc,EAAE;EAC9C,OAAO,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,KAAK,CAAC,cAAc,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC;CAC/F;;AAED,AAAOA,IAAM,kBAAkB,GAAG,gDAA+C;;AAEjF,AAAOA,IAAM,cAAc,GAAG,+BAA+B;;ACZxD,OAA2B,GAAG,MAAM,CAAC,SAAS;AAA5C,IAAA,cAAc;AAAE,IAAA,QAAQ,gBAAzB;;;;AAIN,AAAO,SAAS,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE;EACjC,OAAO,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC;CAC1C;;AAED,AAAOA,IAAM,OAAO,GAAG,KAAK,CAAC,OAAO,KAAK,UAAC,GAAG,EAAE;EAC7C,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,gBAAgB;IACxC,EAAC;;AAEF,AAAO,SAAS,WAAW,CAAC,KAAK,EAAE;EACjC,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;CAC5D;;;;;ACTD,AAAO,IAAM,QAAQ,GAAC,iBACT,CAAC,IAAI,EAAE,GAAG,EAAE;EACvB,IAAM,CAAC,IAAI,GAAG,KAAI;EAClB,IAAM,CAAC,MAAM,GAAG,IAAG;CAClB,CAAA;;AAEH,mBAAE,MAAM,oBAAC,CAAC,EAAE;EACV,OAAS,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;CAChD,CAAA;;AAGH,AAAO,IAAM,cAAc,GAAC,uBACf,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;EAC3B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,GAAG,GAAG,IAAG;EAChB,IAAM,CAAC,CAAC,UAAU,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,WAAU,EAAA;CACtD,CAAA;;;;;;;;AASH,AAAO,SAAS,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE;EACzC,KAAKC,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI;IAC5B,UAAU,CAAC,SAAS,GAAG,IAAG;IAC1BA,IAAI,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAC;IAClC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,GAAG,MAAM,EAAE;MACjC,EAAE,KAAI;MACN,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;KACpC,MAAM;MACL,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC;KACxC;GACF;CACF;;;;;ACnCD,AAAOD,IAAM,cAAc,GAAG;;;;;;EAM5B,WAAW,EAAE,CAAC;;;;EAId,UAAU,EAAE,QAAQ;;;;;;EAMpB,mBAAmB,EAAE,IAAI;;;EAGzB,eAAe,EAAE,IAAI;;;;;EAKrB,aAAa,EAAE,IAAI;;;EAGnB,0BAA0B,EAAE,KAAK;;;EAGjC,2BAA2B,EAAE,KAAK;;;EAGlC,yBAAyB,EAAE,KAAK;;;EAGhC,aAAa,EAAE,KAAK;;;;;EAKpB,SAAS,EAAE,KAAK;;;;;;EAMhB,OAAO,EAAE,IAAI;;;;;;;;;;;EAWb,SAAS,EAAE,IAAI;;;;;;;;;EASf,MAAM,EAAE,KAAK;;;;;;EAMb,OAAO,EAAE,IAAI;;;EAGb,UAAU,EAAE,IAAI;;;EAGhB,gBAAgB,EAAE,IAAI;;;EAGtB,cAAc,EAAE,KAAK;EACtB;;;;AAID,AAAO,SAAS,UAAU,CAAC,IAAI,EAAE;EAC/BC,IAAI,OAAO,GAAG,GAAE;;EAEhB,KAAKA,IAAI,GAAG,IAAI,cAAc;IAC5B,EAAA,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,EAAC,EAAA;;EAEzE,IAAI,OAAO,CAAC,WAAW,IAAI,IAAI;IAC7B,EAAA,OAAO,CAAC,WAAW,IAAI,KAAI,EAAA;;EAE7B,IAAI,OAAO,CAAC,aAAa,IAAI,IAAI;IAC/B,EAAA,OAAO,CAAC,aAAa,GAAG,OAAO,CAAC,WAAW,GAAG,EAAC,EAAA;;EAEjD,IAAI,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;IAC5BA,IAAI,MAAM,GAAG,OAAO,CAAC,QAAO;IAC5B,OAAO,CAAC,OAAO,GAAG,UAAC,KAAK,EAAE,SAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAA;GAChD;EACD,IAAI,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC;IAC5B,EAAA,OAAO,CAAC,SAAS,GAAG,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,SAAS,EAAC,EAAA;;EAE7D,OAAO,OAAO;CACf;;AAED,SAAS,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE;EACnC,OAAO,SAAS,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE;IACzDA,IAAI,OAAO,GAAG;MACZ,IAAI,EAAE,KAAK,GAAG,OAAO,GAAG,MAAM;MAC9B,KAAK,EAAE,IAAI;MACX,KAAK,EAAE,KAAK;MACZ,GAAG,EAAE,GAAG;MACT;IACD,IAAI,OAAO,CAAC,SAAS;MACnB,EAAA,OAAO,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAC,EAAA;IAC1D,IAAI,OAAO,CAAC,MAAM;MAChB,EAAA,OAAO,CAAC,KAAK,GAAG,CAAC,KAAK,EAAE,GAAG,EAAC,EAAA;IAC9B,KAAK,CAAC,IAAI,CAAC,OAAO,EAAC;GACpB;CACF;;ACjID;AACA,AAAOD,IACH,SAAS,GAAG,CAAC;IACb,cAAc,GAAG,CAAC;IAClB,SAAS,GAAG,SAAS,GAAG,cAAc;IACtC,WAAW,GAAG,CAAC;IACf,eAAe,GAAG,CAAC;IACnB,WAAW,GAAG,EAAE;IAChB,kBAAkB,GAAG,EAAE;IACvB,WAAW,GAAG,EAAE;IAChB,kBAAkB,GAAG,IAAG;;AAE5B,AAAO,SAAS,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE;EAC9C,OAAO,cAAc,IAAI,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,eAAe,GAAG,CAAC,CAAC;CACtF;;;AAGD,AAAOA,IACH,SAAS,GAAG,CAAC;IACb,QAAQ,GAAG,CAAC;IACZ,YAAY,GAAG,CAAC;IAChB,aAAa,GAAG,CAAC;IACjB,iBAAiB,GAAG,CAAC;IACrB,YAAY,GAAG,EAAC;;AChBb,IAAM,MAAM,GAAC,eACP,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE;EACtC,IAAM,CAAC,OAAO,GAAG,OAAO,GAAG,UAAU,CAAC,OAAO,EAAC;EAC9C,IAAM,CAAC,UAAU,GAAG,OAAO,CAAC,WAAU;EACtC,IAAM,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAC;EACzE,IAAM,QAAQ,GAAG,GAAE;EACnB,IAAM,CAAC,OAAO,CAAC,aAAa,EAAE;IAC5B,KAAOC,IAAI,CAAC,GAAG,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE;MACtC,EAAE,IAAI,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,EAAA,KAAK,IAAA;IAC1C,IAAM,OAAO,CAAC,UAAU,KAAK,QAAQ,EAAE,EAAA,QAAQ,IAAI,SAAQ,EAAA;GAC1D;EACH,IAAM,CAAC,aAAa,GAAG,WAAW,CAAC,QAAQ,EAAC;EAC5C,IAAM,cAAc,GAAG,CAAC,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,EAAE,IAAI,aAAa,CAAC,OAAM;EAC9E,IAAM,CAAC,mBAAmB,GAAG,WAAW,CAAC,cAAc,EAAC;EACxD,IAAM,CAAC,uBAAuB,GAAG,WAAW,CAAC,cAAc,GAAG,GAAG,GAAG,aAAa,CAAC,UAAU,EAAC;EAC7F,IAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAC;;;;;EAK5B,IAAM,CAAC,WAAW,GAAG,MAAK;;;;;EAK1B,IAAM,QAAQ,EAAE;IACd,IAAM,CAAC,GAAG,GAAG,SAAQ;IACrB,IAAM,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAC;IACjE,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,OAAM;GAC3E,MAAM;IACP,IAAM,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,GAAG,EAAC;IAC/B,IAAM,CAAC,OAAO,GAAG,EAAC;GACjB;;;;EAIH,IAAM,CAAC,IAAI,GAAGE,KAAE,CAAC,IAAG;;EAEpB,IAAM,CAAC,KAAK,GAAG,KAAI;;EAEnB,IAAM,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAG;;;EAGlC,IAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,GAAE;;;EAGlD,IAAM,CAAC,aAAa,GAAG,IAAI,CAAC,eAAe,GAAG,KAAI;EAClD,IAAM,CAAC,YAAY,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,IAAG;;;;;EAKhD,IAAM,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,GAAE;EACtC,IAAM,CAAC,WAAW,GAAG,KAAI;;;EAGzB,IAAM,CAAC,QAAQ,GAAG,OAAO,CAAC,UAAU,KAAK,SAAQ;EACjD,IAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;;;EAG/D,IAAM,CAAC,gBAAgB,GAAG,CAAC,EAAC;;;EAG5B,IAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,EAAC;;EAExD,IAAM,CAAC,MAAM,GAAG,GAAE;;EAElB,IAAM,CAAC,gBAAgB,GAAG,GAAE;;;EAG5B,IAAM,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI;IAC9E,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC,EAAA;;;EAG3B,IAAM,CAAC,UAAU,GAAG,GAAE;EACtB,IAAM,CAAC,UAAU,CAAC,SAAS,EAAC;;;EAG5B,IAAM,CAAC,WAAW,GAAG,KAAI;CACxB;;4PAAA;;AAEH,iBAAE,KAAK,qBAAG;EACR,IAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,GAAE;EACrD,IAAM,CAAC,SAAS,GAAE;EAClB,OAAS,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;CAChC,CAAA;;AAEH,mBAAE,UAAc,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,cAAc,IAAI,CAAC,EAAE,CAAA;AACjF,mBAAE,WAAe,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,eAAe,IAAI,CAAC,EAAE,CAAA;AACnF,mBAAE,OAAW,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,KAAK,GAAG,WAAW,IAAI,CAAC,EAAE,CAAA;AAC3E,mBAAE,UAAc,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,WAAW,IAAI,CAAC,EAAE,CAAA;AAC/E,mBAAE,gBAAoB,mBAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,kBAAkB,IAAI,CAAC,EAAE,CAAA;AAC5F,mBAAE,mBAAuB,mBAAG,EAAE,OAAO,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,CAAA;;;AAG3F,iBAAE,kBAAkB,kCAAG,EAAE,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,KAAK,GAAG,cAAc,IAAI,CAAC,EAAE,CAAA;;AAEtF,OAAE,MAAa,sBAAa;;;;EAC1B,IAAM,GAAG,GAAG,KAAI;EAChB,KAAOF,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAA,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAC,EAAA;EAChE,OAAS,GAAG;CACX,CAAA;;AAEH,OAAE,KAAY,mBAAC,KAAK,EAAE,OAAO,EAAE;EAC7B,OAAS,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE;CACxC,CAAA;;AAEH,OAAE,iBAAwB,+BAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE;EAC9C,IAAM,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAC;EAC5C,MAAQ,CAAC,SAAS,GAAE;EACpB,OAAS,MAAM,CAAC,eAAe,EAAE;CAChC,CAAA;;AAEH,OAAE,SAAgB,uBAAC,KAAK,EAAE,OAAO,EAAE;EACjC,OAAS,IAAI,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC;CAChC,CAAA;;gEACF;;ACvHDD,IAAM,EAAE,GAAG,MAAM,CAAC,UAAS;;;;AAI3BA,IAAM,OAAO,GAAG,6CAA4C;AAC5D,EAAE,CAAC,eAAe,GAAG,SAAS,KAAK,EAAE;;;EACnC,SAAS;;IAEP,cAAc,CAAC,SAAS,GAAG,MAAK;IAChC,KAAK,IAAI,cAAc,CAAC,IAAI,CAACI,MAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAM;IAClDH,IAAI,KAAK,GAAG,OAAO,CAAC,IAAI,CAACG,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAC;IACjD,IAAI,CAAC,KAAK,EAAE,EAAA,OAAO,KAAK,EAAA;IACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,YAAY,EAAE,EAAA,OAAO,IAAI,EAAA;IACxD,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;;;IAGxB,cAAc,CAAC,SAAS,GAAG,MAAK;IAChC,KAAK,IAAI,cAAc,CAAC,IAAI,CAACA,MAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAM;IAClD,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG;MAC3B,EAAA,KAAK,GAAE,EAAA;GACV;EACF;;;;;AAKD,EAAE,CAAC,GAAG,GAAG,SAAS,IAAI,EAAE;EACtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;IACtB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI;GACZ,MAAM;IACL,OAAO,KAAK;GACb;EACF;;;;AAID,EAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE;EAC/B,OAAO,IAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW;EACzE;;;;AAID,EAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;EAC1C,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI;EACZ;;;;AAID,EAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACjD;;;;AAID,EAAE,CAAC,kBAAkB,GAAG,WAAW;EACjC,OAAO,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG;IACzB,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM;IACvB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;EAChE;;AAED,EAAE,CAAC,eAAe,GAAG,WAAW;EAC9B,IAAI,IAAI,CAAC,kBAAkB,EAAE,EAAE;IAC7B,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB;MAClC,EAAA,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,EAAC,EAAA;IACvE,OAAO,IAAI;GACZ;EACF;;;;;AAKD,EAAE,CAAC,SAAS,GAAG,WAAW;EACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACrE;;AAED,EAAE,CAAC,kBAAkB,GAAG,SAAS,OAAO,EAAE,OAAO,EAAE;EACjD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;IACzB,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe;MAC9B,EAAA,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,eAAe,EAAC,EAAA;IACvE,IAAI,CAAC,OAAO;MACV,EAAA,IAAI,CAAC,IAAI,GAAE,EAAA;IACb,OAAO,IAAI;GACZ;EACF;;;;;AAKD,EAAE,CAAC,MAAM,GAAG,SAAS,IAAI,EAAE;EACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,GAAE;EACpC;;;;AAID,EAAE,CAAC,UAAU,GAAG,SAAS,GAAG,EAAE;EAC5B,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,kBAAkB,EAAC;EAC/D;;AAED,AAAO,SAAS,mBAAmB,GAAG;EACpC,IAAI,CAAC,eAAe;EACpB,IAAI,CAAC,aAAa;EAClB,IAAI,CAAC,mBAAmB;EACxB,IAAI,CAAC,iBAAiB;EACtB,IAAI,CAAC,WAAW;IACd,CAAC,EAAC;CACL;;AAED,EAAE,CAAC,kBAAkB,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;EACjE,IAAI,CAAC,sBAAsB,EAAE,EAAA,MAAM,EAAA;EACnC,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC,CAAC;IAC3C,EAAA,IAAI,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,aAAa,EAAE,+CAA+C,EAAC,EAAA;EAC9GF,IAAI,MAAM,GAAG,QAAQ,GAAG,sBAAsB,CAAC,mBAAmB,GAAG,sBAAsB,CAAC,kBAAiB;EAC7G,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,uBAAuB,EAAC,EAAA;EACxE;;AAED,EAAE,CAAC,qBAAqB,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;EACpE,IAAI,CAAC,sBAAsB,EAAE,EAAA,OAAO,KAAK,EAAA;EACzC,IAAK,eAAe;EAAE,IAAA,WAAW,sCAA7B;EACJ,IAAI,CAAC,QAAQ,EAAE,EAAA,OAAO,eAAe,IAAI,CAAC,IAAI,WAAW,IAAI,CAAC,EAAA;EAC9D,IAAI,eAAe,IAAI,CAAC;IACtB,EAAA,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,yEAAyE,EAAC,EAAA;EACxG,IAAI,WAAW,IAAI,CAAC;IAClB,EAAA,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,oCAAoC,EAAC,EAAA;EAC3E;;AAED,EAAE,CAAC,8BAA8B,GAAG,WAAW;EAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IACpE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,4CAA4C,EAAC,EAAA;EACzE,IAAI,IAAI,CAAC,QAAQ;IACf,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,4CAA4C,EAAC,EAAA;EAC1E;;AAED,EAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;EACvC,IAAI,IAAI,CAAC,IAAI,KAAK,yBAAyB;IACzC,EAAA,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,kBAAkB;CACtE;;ACvIDD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;;;AAS3BA,IAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE;;;EAChCJ,IAAI,OAAO,GAAG,GAAE;EAChB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAA,IAAI,CAAC,IAAI,GAAG,GAAE,EAAA;EAC9B,OAAO,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,EAAE;IAC3BF,IAAI,IAAI,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAC;IACnD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;GACrB;EACD,IAAI,IAAI,CAAC,QAAQ;IACf,EAAA,KAAa,kBAAI,MAAM,CAAC,IAAI,CAACA,MAAI,CAAC,gBAAgB,CAAC,yBAAA;MAA9C;QAAAH,IAAI,IAAI;;QACXG,MAAI,CAAC,gBAAgB,CAACA,MAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,GAAE,UAAS,GAAE,IAAI,qBAAiB,GAAE;OAAA,EAAA;EAC/F,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAC;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAU;GAC1C;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;EACxC;;AAEDJ,IAAM,SAAS,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC;IAAE,WAAW,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAC;;AAEhEK,IAAE,CAAC,KAAK,GAAG,SAAS,OAAO,EAAE;EAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;EAC3E,cAAc,CAAC,SAAS,GAAG,IAAI,CAAC,IAAG;EACnCJ,IAAI,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAC;EAC1CA,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAC;;;;;EAK1E,IAAI,MAAM,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,EAAA;EAC9B,IAAI,OAAO,EAAE,EAAA,OAAO,KAAK,EAAA;;EAEzB,IAAI,MAAM,KAAK,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;EAC/B,IAAI,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;IACnCA,IAAI,GAAG,GAAG,IAAI,GAAG,EAAC;IAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,EAAA,EAAE,IAAG,EAAA;IAChEA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAC;IACvC,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;GACxD;EACD,OAAO,KAAK;EACb;;;;;AAKDI,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;IAC7D,EAAA,OAAO,KAAK,EAAA;;EAEd,cAAc,CAAC,SAAS,GAAG,IAAI,CAAC,IAAG;EACnCJ,IAAI,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAC;EAC1CA,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,OAAM;EACpC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,UAAU;KAC9C,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;EACrF;;;;;;;;;AASDI,IAAE,CAAC,cAAc,GAAG,SAAS,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE;EACvDJ,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,KAAI;;EAExD,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE;IACvB,SAAS,GAAGE,KAAE,CAAC,KAAI;IACnB,IAAI,GAAG,MAAK;GACb;;;;;;EAMD,QAAQ,SAAS;EACjB,KAAKA,KAAE,CAAC,MAAM,CAAC,CAAC,KAAKA,KAAE,CAAC,SAAS,EAAE,OAAO,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,OAAO,CAAC;EACnG,KAAKA,KAAE,CAAC,SAAS,EAAE,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC;EAC3D,KAAKA,KAAE,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EAC/C,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;EACjD,KAAKA,KAAE,CAAC,SAAS;;;;IAIf,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,MAAM,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7H,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC;EAC3D,KAAKA,KAAE,CAAC,MAAM;IACZ,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC9B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EACpC,KAAKA,KAAE,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EAC/C,KAAKA,KAAE,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;EACvD,KAAKA,KAAE,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;EACvD,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACrD,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;EACjD,KAAKA,KAAE,CAAC,MAAM,CAAC,CAAC,KAAKA,KAAE,CAAC,IAAI;IAC1B,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,MAAK;IACzB,IAAI,OAAO,IAAI,IAAI,KAAK,KAAK,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAChD,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC;EAC3C,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACrD,KAAKA,KAAE,CAAC,KAAK,EAAE,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;EACnD,KAAKA,KAAE,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EAClD,KAAKA,KAAE,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;EACnD,KAAKA,KAAE,CAAC,OAAO,CAAC;EAChB,KAAKA,KAAE,CAAC,OAAO;IACb,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,2BAA2B,EAAE;MAC7C,IAAI,CAAC,QAAQ;QACX,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,wDAAwD,EAAC,EAAA;MAClF,IAAI,CAAC,IAAI,CAAC,QAAQ;QAChB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,iEAAiE,EAAC,EAAA;KAC5F;IACD,OAAO,SAAS,KAAKA,KAAE,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC;;;;;;;EAO5F;IACE,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE;MAC1B,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MAC9B,IAAI,CAAC,IAAI,GAAE;MACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC;KACzD;;IAEDF,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;IACzD,IAAI,SAAS,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;MAC3E,EAAA,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,EAAA;SAC9D,EAAA,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAA;GACtD;EACF;;AAEDE,IAAE,CAAC,2BAA2B,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE;;;EACvDJ,IAAI,OAAO,GAAG,OAAO,KAAK,QAAO;EACjC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,KAAI,EAAA;OAC7D,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;OAC5C;IACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,GAAE;GACjB;;;;EAIDF,IAAI,CAAC,GAAG,EAAC;EACT,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;IAClCA,IAAI,GAAG,GAAGG,MAAI,CAAC,MAAM,CAAC,CAAC,EAAC;IACxB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;MACtD,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;MAC/D,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,EAAE,EAAA,KAAK,EAAA;KACjC;GACF;EACD,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,EAAC,EAAA;EAC9E,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,gBAAgB,GAAG,mBAAmB,CAAC;EAC/E;;AAEDC,IAAE,CAAC,sBAAsB,GAAG,SAAS,IAAI,EAAE;EACzC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;AAEDA,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;EACrC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACvC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC,EAAA;;IAEjB,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;EAClB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC;EACjD;;;;;;;;;;AAUDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,CAAC,IAAI,GAAE;EACXJ,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAC;EACvL,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;EAClB,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;GACjC;EACDF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,GAAE;EACxB,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,KAAK,EAAE;IAC7DF,IAAIK,MAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,MAAK;IAC9D,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,CAACA,MAAI,EAAE,IAAI,EAAE,IAAI,EAAC;IAC/B,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,qBAAqB,EAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,IAAI,KAAKH,KAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,KAAKG,MAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QACtH,EAAE,IAAI,KAAK,KAAK,IAAIA,MAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;MAClD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;QACjC,IAAI,IAAI,CAAC,IAAI,KAAKH,KAAE,CAAC,GAAG,EAAE;UACxB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;SAC3C,MAAM,EAAA,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAC,EAAA;OACjC;MACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAEG,MAAI,CAAC;KACnC;IACD,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAEA,MAAI,CAAC;GACjC;EACDL,IAAI,sBAAsB,GAAG,IAAI,oBAAmB;EACpDA,IAAI,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC7D,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE;IACtF,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,EAAE;QACxB,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;OAC3C,MAAM,EAAA,IAAI,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAC,EAAA;KACjC;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,EAAC;IACtD,IAAI,CAAC,SAAS,CAAC,IAAI,EAAC;IACpB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;GACnC,MAAM;IACL,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;GACzD;EACD,IAAI,OAAO,GAAG,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,OAAO,EAAC,EAAA;EAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;EACjC;;AAEDE,IAAE,CAAC,sBAAsB,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE,mBAAmB,EAAE;EACvE,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,cAAc,IAAI,mBAAmB,GAAG,CAAC,GAAG,sBAAsB,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC;EACrH;;AAEDA,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;;EAEvC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;EAC3C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,KAAI;EACtE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;EAC5C;;AAEDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;EACvC,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,0BAA0B;IAC9D,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;EACxD,IAAI,CAAC,IAAI,GAAE;;;;;;EAMX,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,KAAI,EAAA;OAChE,EAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,GAAE,EAAE;EACjE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE;;;EACvC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,oBAAoB,GAAE;EAC/C,IAAI,CAAC,KAAK,GAAG,GAAE;EACf,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAC;EAC7B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;;;;;;EAMlBF,IAAI,IAAG;EACP,KAAKA,IAAI,UAAU,GAAG,KAAK,EAAE,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,GAAG;IACrD,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MACvDF,IAAI,MAAM,GAAGG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,MAAK;MACnC,IAAI,GAAG,EAAE,EAAAC,MAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,EAAC,EAAA;MAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAGA,MAAI,CAAC,SAAS,EAAE,EAAC;MACvC,GAAG,CAAC,UAAU,GAAG,GAAE;MACnBA,MAAI,CAAC,IAAI,GAAE;MACX,IAAI,MAAM,EAAE;QACV,GAAG,CAAC,IAAI,GAAGA,MAAI,CAAC,eAAe,GAAE;OAClC,MAAM;QACL,IAAI,UAAU,EAAE,EAAAA,MAAI,CAAC,gBAAgB,CAACA,MAAI,CAAC,YAAY,EAAE,0BAA0B,EAAC,EAAA;QACpF,UAAU,GAAG,KAAI;QACjB,GAAG,CAAC,IAAI,GAAG,KAAI;OAChB;MACDA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;KACtB,MAAM;MACL,IAAI,CAAC,GAAG,EAAE,EAAAC,MAAI,CAAC,UAAU,GAAE,EAAA;MAC3B,GAAG,CAAC,UAAU,CAAC,IAAI,CAACA,MAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAC;KAC/C;GACF;EACD,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,GAAG,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,YAAY,EAAC,EAAA;EAC3C,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDC,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,6BAA6B,EAAC,EAAA;EAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,GAAE;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;;;AAIDL,IAAM,KAAK,GAAG,GAAE;;AAEhBK,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;EAC9B,IAAI,CAAC,OAAO,GAAG,KAAI;EACnB,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,MAAM,EAAE;IAC3BF,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,GAAE;IAC7B,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE;MACvB,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAE;MACtCF,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,aAAY;MAC/C,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,kBAAkB,GAAG,CAAC,EAAC;MAChD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,iBAAiB,GAAG,YAAY,EAAC;MACvE,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;KACvB,MAAM;MACL,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,EAAE,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MACpD,MAAM,CAAC,KAAK,GAAG,KAAI;MACnB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC;KACnB;IACD,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IACpC,IAAI,CAAC,SAAS,GAAE;IAChB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,aAAa,EAAC;GACtD;EACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAI;EACjE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;IAClC,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;EAC3D,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;EAC7C;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EAC1C,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC;EAChC,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,qBAAqB,CAAC;EACpD;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAC;EAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAC;EACxC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrC,IAAI,IAAI,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC,EAAA;EAChE,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,oBAAoB,GAAE;EACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAC;EACvC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;AAEDA,IAAE,CAAC,qBAAqB,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE;;;EAClE,KAAc,oBAAID,MAAI,CAAC,MAAM,6BAAA;IAAxB;IAAAH,IAAI,KAAK;;IACZ,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;MAC1B,EAAAG,MAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,uBAAuB,EAAC;GAAA,EAAA;EAC3EH,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAO,GAAG,QAAQ,GAAG,KAAI;EACjF,KAAKF,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;IAChDA,IAAIM,OAAK,GAAGH,MAAI,CAAC,MAAM,CAAC,CAAC,EAAC;IAC1B,IAAIG,OAAK,CAAC,cAAc,KAAK,IAAI,CAAC,KAAK,EAAE;;MAEvCA,OAAK,CAAC,cAAc,GAAGH,MAAI,CAAC,MAAK;MACjCG,OAAK,CAAC,IAAI,GAAG,KAAI;KAClB,MAAM,EAAA,KAAK,EAAA;GACb;EACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,MAAA,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAC;EACrE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,EAAC;EAClH,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,IAAI,CAAC,KAAK,GAAG,KAAI;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC;EACjD;;AAEDF,IAAE,CAAC,wBAAwB,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjD,IAAI,CAAC,UAAU,GAAG,KAAI;EACtB,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,qBAAqB,CAAC;EACpD;;;;;;AAMDA,IAAE,CAAC,UAAU,GAAG,SAAS,qBAA4B,EAAE,IAAuB,EAAE;oBAAlC;+DAAA,GAAG,IAAI,CAAM;6BAAA,GAAG,IAAI,CAAC,SAAS,EAAE;;EAC5E,IAAI,CAAC,IAAI,GAAG,GAAE;EACd,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,qBAAqB,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAC,EAAA;EAC7C,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3BF,IAAI,IAAI,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAC;IACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;GACrB;EACD,IAAI,qBAAqB,EAAE,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;EAC3C,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;EAC/C;;;;;;AAMDC,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjC,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,IAAI,EAAC;EACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;EACjE,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,IAAI,EAAC;EACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,eAAe,GAAE;EACrE,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;EAC7C;;;;;AAKDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnCJ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,GAAG,gBAAgB,GAAG,iBAAgB;EACrE,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,KAAK,gBAAgB,EAAE;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB;OAClC,IAAI,CAAC,IAAI,KAAK,qBAAqB,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI;QACvE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;MAChE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,wCAAwC,EAAC,EAAA;GACnE;EACD,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,gBAAgB,GAAG,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACzF,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;EACtC,IAAI,CAAC,SAAS,GAAE;EAChB,IAAI,CAAC,MAAM,CAAC,GAAG,GAAE;EACjB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC;EACnC;;;;AAIDE,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;;;EACxC,IAAI,CAAC,YAAY,GAAG,GAAE;EACtB,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,SAAS;IACPJ,IAAI,IAAI,GAAGG,MAAI,CAAC,SAAS,GAAE;IAC3BA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAC;IAC3B,IAAIA,MAAI,CAAC,GAAG,CAACD,KAAE,CAAC,EAAE,CAAC,EAAE;MACnB,IAAI,CAAC,IAAI,GAAGC,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAC;KACzC,MAAM,IAAI,IAAI,KAAK,OAAO,IAAI,EAAEA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,KAAKC,MAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAIA,MAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;MACpHA,MAAI,CAAC,UAAU,GAAE;KAClB,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,YAAY,IAAI,EAAE,KAAK,KAAKA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,IAAIC,MAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;MACzGA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,UAAU,EAAE,0DAA0D,EAAC;KACxF,MAAM;MACL,IAAI,CAAC,IAAI,GAAG,KAAI;KACjB;IACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAACA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAC;IACnE,IAAI,CAACA,MAAI,CAAC,GAAG,CAACD,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,KAAK,EAAA;GAC/B;EACD,OAAO,IAAI;EACZ;;AAEDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;IACpE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,6CAA6C,EAAC;GACjF;EACD,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACjC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,KAAK,KAAK,GAAG,QAAQ,GAAG,YAAY,EAAE,KAAK,EAAC;EACzE;;AAEDL,IAAM,cAAc,GAAG,CAAC;IAAE,sBAAsB,GAAG,CAAC;IAAE,gBAAgB,GAAG,EAAC;;;;;;AAM1EK,IAAE,CAAC,aAAa,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,mBAAmB,EAAE,OAAO,EAAE;EACzE,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;IAC9E,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,KAAK,SAAS,GAAG,sBAAsB,CAAC;MAC/D,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC;GACnC;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAExB,IAAI,SAAS,GAAG,cAAc,EAAE;IAC9B,IAAI,CAAC,EAAE,GAAG,CAAC,SAAS,GAAG,gBAAgB,KAAK,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,UAAU,GAAE;IAC5F,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,GAAG,sBAAsB,CAAC;;;;;MAKlD,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,mBAAmB,GAAG,QAAQ,GAAG,YAAY,GAAG,aAAa,EAAC,EAAA;GAC9I;;EAEDF,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;EACnG,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;EACtB,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAC;;EAE1D,IAAI,EAAE,SAAS,GAAG,cAAc,CAAC;IAC/B,EAAA,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAI,EAAA;;EAE5D,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAC;EAC9B,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAC;;EAExD,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,SAAS,GAAG,cAAc,IAAI,qBAAqB,GAAG,oBAAoB,CAAC;EAC1G;;AAEDE,IAAE,CAAC,mBAAmB,GAAG,SAAS,IAAI,EAAE;EACtC,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAACA,KAAE,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAC;EACpF,IAAI,CAAC,8BAA8B,GAAE;EACtC;;;;;AAKDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE;;;EAC1C,IAAI,CAAC,IAAI,GAAE;;;;EAIXL,IAAM,SAAS,GAAG,IAAI,CAAC,OAAM;EAC7B,IAAI,CAAC,MAAM,GAAG,KAAI;;EAElB,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,EAAC;EACpC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAC;EAC1BC,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,GAAE;EAChCA,IAAI,cAAc,GAAG,MAAK;EAC1B,SAAS,CAAC,IAAI,GAAG,GAAE;EACnB,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3BH,IAAM,OAAO,GAAGI,MAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,EAAC;IAChE,IAAI,OAAO,EAAE;MACX,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAC;MAC5B,IAAI,OAAO,CAAC,IAAI,KAAK,kBAAkB,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;QACzE,IAAI,cAAc,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,yCAAyC,EAAC,EAAA;QACxF,cAAc,GAAG,KAAI;OACtB;KACF;GACF;EACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,EAAC;EACnD,IAAI,CAAC,MAAM,GAAG,UAAS;EACvB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,WAAW,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;EACnF;;AAEDC,IAAE,CAAC,iBAAiB,GAAG,SAAS,sBAAsB,EAAE;;;EACtD,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;;EAElCF,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,GAAE;EAC7BD,IAAM,aAAa,GAAG,UAAC,CAAC,EAAE,WAAmB,EAAE;6CAAV,GAAG,KAAK;;IAC3CA,IAAM,KAAK,GAAGI,MAAI,CAAC,KAAK,EAAE,QAAQ,GAAGA,MAAI,CAAC,SAAQ;IAClD,IAAI,CAACA,MAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;IACxC,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,MAAM,KAAK,CAAC,WAAW,IAAI,CAACC,MAAI,CAAC,kBAAkB,EAAE,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;IACxF,IAAI,MAAM,CAAC,GAAG,EAAE,EAAAA,MAAI,CAAC,UAAU,GAAE,EAAA;IACjC,MAAM,CAAC,QAAQ,GAAG,MAAK;IACvB,MAAM,CAAC,GAAG,GAAGA,MAAI,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAC;IAC9C,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,EAAC;IACnBA,MAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,YAAY,EAAC;IACzC,OAAO,KAAK;IACb;;EAED,MAAM,CAAC,IAAI,GAAG,SAAQ;EACtB,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,QAAQ,EAAC;EACvCH,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;EACnCF,IAAI,OAAO,GAAG,MAAK;EACnB,IAAI,CAAC,WAAW,EAAE;IAChB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE;MACjE,OAAO,GAAG,KAAI;MACd,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;KACjE,MAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;MAC/B,MAAM,CAAC,IAAI,GAAG,MAAK;KACpB,MAAM,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;MAC/B,MAAM,CAAC,IAAI,GAAG,MAAK;KACpB;GACF;EACD,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAA,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAC,EAAA;EAC/C,IAAK,GAAG,cAAJ;EACJF,IAAI,iBAAiB,GAAG,MAAK;EAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,KAAK,aAAa;MAC9F,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,KAAK,aAAa,CAAC,EAAE;IAC1D,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,yCAAyC,EAAC,EAAA;IAC9F,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,kCAAkC,EAAC,EAAA;IAC1E,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;IAC1E,MAAM,CAAC,IAAI,GAAG,cAAa;IAC3B,iBAAiB,GAAG,uBAAsB;GAC3C,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE;IACjF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,wDAAwD,EAAC;GAChF;EACD,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAC;EACtE,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;IAC3D,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;EAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;IAC3D,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;EACnF,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa;IACxE,EAAA,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,+BAA+B,EAAC,EAAA;EACtF,OAAO,MAAM;EACd;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,SAAS,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAE;EAC9E,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,EAAE,iBAAiB,EAAC;EACxE,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,kBAAkB,CAAC;EACnD;;AAEDA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE;EAC5C,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,UAAU,GAAE;IAC3B,IAAI,WAAW;MACb,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAC,EAAA;GAC/C,MAAM;IACL,IAAI,WAAW,KAAK,IAAI;MACtB,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,IAAI,CAAC,EAAE,GAAG,KAAI;GACf;EACF;;AAEDE,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE;EAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,GAAG,KAAI;EAC5E;;;;AAIDE,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,OAAO,EAAE;;;EACvC,IAAI,CAAC,IAAI,GAAE;;EAEX,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,IAAI,CAAC,EAAE;IACrB,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAC;IAC7B,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;IAClC,IAAI,CAAC,SAAS,GAAE;IAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,sBAAsB,CAAC;GACrD;EACD,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,QAAQ,CAAC,EAAE;IACzB,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,YAAY,EAAC;IACvDF,IAAI,QAAO;IACX,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,SAAS,KAAK,OAAO,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE;MACpEF,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;MAC5B,IAAI,CAAC,IAAI,GAAE;MACX,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,IAAI,GAAE,EAAA;MACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,cAAc,GAAG,gBAAgB,EAAE,KAAK,EAAE,OAAO,EAAC;KAChG,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE;MAClCF,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;MAC5B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,YAAY,EAAC;KACxD,MAAM;MACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,GAAE;MAC1C,IAAI,CAAC,SAAS,GAAE;KACjB;IACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,0BAA0B,CAAC;GACzD;;EAED,IAAI,IAAI,CAAC,0BAA0B,EAAE,EAAE;IACrC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAC;IAC5C,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,qBAAqB;MACjD,EAAA,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,YAAY,EAAC,EAAA;;MAEhE,EAAA,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAC,EAAA;IAChF,IAAI,CAAC,UAAU,GAAG,GAAE;IACpB,IAAI,CAAC,MAAM,GAAG,KAAI;GACnB,MAAM;IACL,IAAI,CAAC,WAAW,GAAG,KAAI;IACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAC;IACrD,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;MAC9B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;MAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;KACnC,MAAM;MACL,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA,EAAE;;QAA7BF,IAAI,IAAI;;QAEXG,MAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAC;;QAEhCA,MAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAC;OAClC;;MAED,IAAI,CAAC,MAAM,GAAG,KAAI;KACnB;IACD,IAAI,CAAC,SAAS,GAAE;GACjB;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,wBAAwB,CAAC;EACvD;;AAEDC,IAAE,CAAC,WAAW,GAAG,SAAS,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;EAC5C,IAAI,CAAC,OAAO,EAAE,EAAA,MAAM,EAAA;EACpB,IAAI,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC;IACpB,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,EAAE,oBAAoB,GAAG,IAAI,GAAG,GAAG,EAAC,EAAA;EAC/D,OAAO,CAAC,IAAI,CAAC,GAAG,KAAI;EACrB;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,OAAO,EAAE,GAAG,EAAE;;;EAC7CJ,IAAI,IAAI,GAAG,GAAG,CAAC,KAAI;EACnB,IAAI,IAAI,KAAK,YAAY;IACvB,EAAA,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,EAAC,EAAA;OAC3C,IAAI,IAAI,KAAK,eAAe;IAC/B,EAAA,KAAa,kBAAI,GAAG,CAAC,UAAU,yBAAA;MAA1B;QAAAA,IAAI,IAAI;;QACXG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAC;OAAA,EAAA;OACrC,IAAI,IAAI,KAAK,cAAc;IAC9B,EAAA,KAAY,sBAAI,GAAG,CAAC,QAAQ,+BAAA,EAAE;MAAzBH,IAAI,GAAG;;QACV,IAAI,GAAG,EAAE,EAAAG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,EAAC,EAAA;KAC/C,EAAA;OACE,IAAI,IAAI,KAAK,UAAU;IAC1B,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,EAAC,EAAA;OACxC,IAAI,IAAI,KAAK,mBAAmB;IACnC,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,EAAC,EAAA;OACvC,IAAI,IAAI,KAAK,aAAa;IAC7B,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,QAAQ,EAAC,EAAA;OAC3C,IAAI,IAAI,KAAK,yBAAyB;IACzC,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,GAAG,CAAC,UAAU,EAAC,EAAA;EACnD;;AAEDC,IAAE,CAAC,mBAAmB,GAAG,SAAS,OAAO,EAAE,KAAK,EAAE;;;EAChD,IAAI,CAAC,OAAO,EAAE,EAAA,MAAM,EAAA;EACpB,KAAa,kBAAI,KAAK,yBAAA;IAAjB;IAAAJ,IAAI,IAAI;;IACXG,MAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAC;GAAA;EAC5C;;AAEDC,IAAE,CAAC,0BAA0B,GAAG,WAAW;EACzC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK;IAChC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;IAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,OAAO;IAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,UAAU;IAChC,IAAI,CAAC,KAAK,EAAE;IACZ,IAAI,CAAC,eAAe,EAAE;EACzB;;;;AAIDA,IAAE,CAAC,qBAAqB,GAAG,SAAS,OAAO,EAAE;;;EAC3CJ,IAAI,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;;EAE5B,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBF,IAAI,IAAI,GAAGG,MAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,KAAK,GAAGA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IAClC,IAAI,CAAC,QAAQ,GAAGA,MAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAGA,MAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;IAC7EA,MAAI,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAC;IAClE,KAAK,CAAC,IAAI,CAACA,MAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC,EAAC;GACrD;EACD,OAAO,KAAK;EACb;;;;AAIDC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE;EAC9B,IAAI,CAAC,IAAI,GAAE;;EAEX,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,MAAM,EAAE;IAC3B,IAAI,CAAC,UAAU,GAAG,MAAK;IACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,GAAE;GACnC,MAAM;IACL,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,qBAAqB,GAAE;IAC9C,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAC;IAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,UAAU,GAAE;GACjF;EACD,IAAI,CAAC,SAAS,GAAE;EAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;;;AAIDE,IAAE,CAAC,qBAAqB,GAAG,WAAW;;;EACpCJ,IAAI,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC5B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,EAAE;;IAEzBF,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,wBAAwB,CAAC,EAAC;IAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;GACtC;EACD,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,EAAE;IACzBF,IAAIO,MAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IAC3B,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IAC3BA,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,GAAE;IAC9B,IAAI,CAAC,SAAS,CAACA,MAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,0BAA0B,CAAC,EAAC;IAC7D,OAAO,KAAK;GACb;EACD,IAAI,CAAC,MAAM,CAACL,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBF,IAAIO,MAAI,GAAGJ,MAAI,CAAC,SAAS,GAAE;IAC3BI,MAAI,CAAC,QAAQ,GAAGJ,MAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACrC,IAAIA,MAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;MAC5BI,MAAI,CAAC,KAAK,GAAGJ,MAAI,CAAC,UAAU,GAAE;KAC/B,MAAM;MACLA,MAAI,CAAC,eAAe,CAACI,MAAI,CAAC,QAAQ,EAAC;MACnCA,MAAI,CAAC,KAAK,GAAGA,MAAI,CAAC,SAAQ;KAC3B;IACDJ,MAAI,CAAC,SAAS,CAACI,MAAI,CAAC,KAAK,EAAE,YAAY,EAAC;IACxC,KAAK,CAAC,IAAI,CAACJ,MAAI,CAAC,UAAU,CAACI,MAAI,EAAE,iBAAiB,CAAC,EAAC;GACrD;EACD,OAAO,KAAK;EACb;;;AAGDH,IAAE,CAAC,sBAAsB,GAAG,SAAS,UAAU,EAAE;EAC/C,KAAKJ,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;IACtF,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;GACpE;EACF;AACDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,SAAS,EAAE;EAC5C;IACE,SAAS,CAAC,IAAI,KAAK,qBAAqB;IACxC,SAAS,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS;IACvC,OAAO,SAAS,CAAC,UAAU,CAAC,KAAK,KAAK,QAAQ;;KAE7C,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;GAC9E;CACF;;AC30BDL,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;AAK3BA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,sBAAsB,EAAE;;;EAClE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,EAAE;IACzC,QAAQ,IAAI,CAAC,IAAI;IACjB,KAAK,YAAY;MACf,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QACvC,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,2DAA2D,EAAC,EAAA;MACrF,KAAK;;IAEP,KAAK,eAAe,CAAC;IACrB,KAAK,cAAc,CAAC;IACpB,KAAK,aAAa;MAChB,KAAK;;IAEP,KAAK,kBAAkB;MACrB,IAAI,CAAC,IAAI,GAAG,gBAAe;MAC3B,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;MACjF,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA,EAAE;QAA7BJ,IAAI,IAAI;;MACXG,MAAI,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,EAAC;;;;;;QAMlC;UACE,IAAI,CAAC,IAAI,KAAK,aAAa;WAC1B,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,eAAe,CAAC;UACjF;UACAA,MAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,kBAAkB,EAAC;SACpD;OACF;MACD,KAAK;;IAEP,KAAK,UAAU;;MAEb,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;MACrG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAC;MACxC,KAAK;;IAEP,KAAK,iBAAiB;MACpB,IAAI,CAAC,IAAI,GAAG,eAAc;MAC1B,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;MACjF,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAC;MAC/C,KAAK;;IAEP,KAAK,eAAe;MAClB,IAAI,CAAC,IAAI,GAAG,cAAa;MACzB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAC;MAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,mBAAmB;QAC5C,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,2CAA2C,EAAC,EAAA;MAC9E,KAAK;;IAEP,KAAK,sBAAsB;MACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,6DAA6D,EAAC,EAAA;MACnH,IAAI,CAAC,IAAI,GAAG,oBAAmB;MAC/B,OAAO,IAAI,CAAC,SAAQ;MACpB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAC;;;IAGzC,KAAK,mBAAmB;MACtB,KAAK;;IAEP,KAAK,yBAAyB;MAC5B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,EAAE,sBAAsB,EAAC;MACrE,KAAK;;IAEP,KAAK,kBAAkB;MACrB,IAAI,CAAC,SAAS,EAAE,EAAA,KAAK,EAAA;;IAEvB;MACE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,qBAAqB,EAAC;KAC9C;GACF,MAAM,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;EACxF,OAAO,IAAI;EACZ;;;;AAIDC,IAAE,CAAC,gBAAgB,GAAG,SAAS,QAAQ,EAAE,SAAS,EAAE;;;EAClDJ,IAAI,GAAG,GAAG,QAAQ,CAAC,OAAM;EACzB,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;IAC5BA,IAAI,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAC;IACrB,IAAI,GAAG,EAAE,EAAAG,MAAI,CAAC,YAAY,CAAC,GAAG,EAAE,SAAS,EAAC,EAAA;GAC3C;EACD,IAAI,GAAG,EAAE;IACPH,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,EAAC;IAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,KAAK,CAAC,IAAI,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY;MAC3H,EAAA,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAC,EAAA;GACvC;EACD,OAAO,QAAQ;EAChB;;;;AAIDI,IAAE,CAAC,WAAW,GAAG,SAAS,sBAAsB,EAAE;EAChDJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;EACpE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,WAAW;EAC/BJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;;;EAGX,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI;IACzD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAEnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,GAAE;;EAEvC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;EAC5C;;;;AAIDE,IAAE,CAAC,gBAAgB,GAAG,WAAW;EAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,QAAQ,IAAI,CAAC,IAAI;IACjB,KAAKF,KAAE,CAAC,QAAQ;MACdF,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;MAC3B,IAAI,CAAC,IAAI,GAAE;MACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAACE,KAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAC;MAC9D,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;;IAE9C,KAAKA,KAAE,CAAC,MAAM;MACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;KAC3B;GACF;EACD,OAAO,IAAI,CAAC,UAAU,EAAE;EACzB;;AAEDE,IAAE,CAAC,gBAAgB,GAAG,SAAS,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE;;;EACpEJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;IACvB,IAAI,KAAK,EAAE,EAAA,KAAK,GAAG,MAAK,EAAA;SACnB,EAAAG,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC,EAAA;IAC1B,IAAI,UAAU,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE;MACxC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;KAChB,MAAM,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE;MAC/D,KAAK;KACN,MAAM,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MACpCF,IAAI,IAAI,GAAGG,MAAI,CAAC,gBAAgB,GAAE;MAClCA,MAAI,CAAC,oBAAoB,CAAC,IAAI,EAAC;MAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;MACf,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;MACnGA,MAAI,CAAC,MAAM,CAAC,KAAK,EAAC;MAClB,KAAK;KACN,MAAM;MACLH,IAAI,IAAI,GAAGG,MAAI,CAAC,iBAAiB,CAACA,MAAI,CAAC,KAAK,EAAEA,MAAI,CAAC,QAAQ,EAAC;MAC5DA,MAAI,CAAC,oBAAoB,CAAC,IAAI,EAAC;MAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;KAChB;GACF;EACD,OAAO,IAAI;EACZ;;AAEDC,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC,OAAO,KAAK;EACb;;;;AAIDA,IAAE,CAAC,iBAAiB,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;EACxD,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,gBAAgB,GAAE;EACtC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,EAAE,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACjEF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;EAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,GAAE;EACpC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,mBAAmB,CAAC;EAClD;;;;;;;;;AASDI,IAAE,CAAC,SAAS,GAAG,SAAS,IAAI,EAAE,WAAuB,EAAE,YAAY,EAAE;oBAA5B;2CAAA,GAAG,SAAS;;EACnD,QAAQ,IAAI,CAAC,IAAI;EACjB,KAAK,YAAY;IACf,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;MAC7D,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,UAAU,GAAG,eAAe,IAAI,IAAI,CAAC,IAAI,GAAG,iBAAiB,EAAC,EAAA;IACjH,IAAI,YAAY,EAAE;MAChB,IAAI,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC;QAC9B,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,qBAAqB,EAAC,EAAA;MAC1D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAI;KAC/B;IACD,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,YAAY,EAAE,EAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAC,EAAA;IACnH,KAAK;;EAEP,KAAK,kBAAkB;IACrB,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,2BAA2B,EAAC,EAAA;IAC/E,KAAK;;EAEP,KAAK,eAAe;IAClB,KAAa,kBAAI,IAAI,CAAC,UAAU,yBAAA;MAA3B;IAAAJ,IAAI,IAAI;;IACXG,MAAI,CAAC,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC;GAAA;IACjD,KAAK;;EAEP,KAAK,UAAU;;IAEb,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,EAAC;IACrD,KAAK;;EAEP,KAAK,cAAc;IACjB,KAAa,sBAAI,IAAI,CAAC,QAAQ,+BAAA,EAAE;MAA3BH,IAAI,IAAI;;IACX,IAAI,IAAI,EAAE,EAAAG,MAAI,CAAC,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC,EAAA;KAC1D;IACD,KAAK;;EAEP,KAAK,mBAAmB;IACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAC;IACpD,KAAK;;EAEP,KAAK,aAAa;IAChB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAC;IACxD,KAAK;;EAEP,KAAK,yBAAyB;IAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,EAAC;IAC1D,KAAK;;EAEP;IACE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,WAAW,GAAG,SAAS,GAAG,cAAc,IAAI,SAAS,EAAC;GAC/E;CACF;;AC5OD;;;;;;;;;;;;;;;;;;AAkBA,AAMAJ,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;AAO3BA,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,sBAAsB,EAAE;EACnE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe;IAChE,EAAA,MAAM,EAAA;EACR,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC;IACnF,EAAA,MAAM,EAAA;EACR,IAAK,GAAG;EAAJ,IAAc,KAAI;EACtB,QAAQ,GAAG,CAAC,IAAI;EAChB,KAAK,YAAY,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK;EACzC,KAAK,SAAS,EAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK;EAC/C,SAAS,MAAM;GACd;EACD,IAAK,IAAI,aAAL;EACJ,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,EAAE;MAC3C,IAAI,QAAQ,CAAC,KAAK,EAAE;QAClB,IAAI,sBAAsB,IAAI,sBAAsB,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,sBAAsB,CAAC,WAAW,GAAG,GAAG,CAAC,MAAK,EAAA;;aAE/G,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,oCAAoC,EAAC,EAAA;OAC5E;MACD,QAAQ,CAAC,KAAK,GAAG,KAAI;KACtB;IACD,MAAM;GACP;EACD,IAAI,GAAG,GAAG,GAAG,KAAI;EACjBJ,IAAI,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAC;EAC1B,IAAI,KAAK,EAAE;IACTA,IAAI,aAAY;IAChB,IAAI,IAAI,KAAK,MAAM,EAAE;MACnB,YAAY,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,IAAG;KACnE,MAAM;MACL,YAAY,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAC;KACzC;IACD,IAAI,YAAY;MACd,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,0BAA0B,EAAC,EAAA;GAC/D,MAAM;IACL,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG;MACvB,IAAI,EAAE,KAAK;MACX,GAAG,EAAE,KAAK;MACV,GAAG,EAAE,KAAK;MACX;GACF;EACD,KAAK,CAAC,IAAI,CAAC,GAAG,KAAI;EACnB;;;;;;;;;;;;;;;;;AAiBDI,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;;;EAC1DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC9D,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,KAAK,EAAE;IAC1BF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,EAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,KAAK,CAAC,EAAE,EAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAACC,MAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,sBAAsB,CAAC,EAAC,EAAA;IACrG,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC;GACnD;EACD,OAAO,IAAI;EACZ;;;;;AAKDC,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE,cAAc,EAAE;EAC3E,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE;IAC9B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAA;;;SAG7C,EAAA,IAAI,CAAC,WAAW,GAAG,MAAK,EAAA;GAC9B;;EAEDJ,IAAI,sBAAsB,GAAG,KAAK,EAAE,cAAc,GAAG,CAAC,CAAC,EAAE,gBAAgB,GAAG,CAAC,CAAC,EAAE,kBAAkB,GAAG,CAAC,EAAC;EACvG,IAAI,sBAAsB,EAAE;IAC1B,cAAc,GAAG,sBAAsB,CAAC,oBAAmB;IAC3D,gBAAgB,GAAG,sBAAsB,CAAC,cAAa;IACvD,kBAAkB,GAAG,sBAAsB,CAAC,gBAAe;IAC3D,sBAAsB,CAAC,mBAAmB,GAAG,sBAAsB,CAAC,aAAa,GAAG,sBAAsB,CAAC,eAAe,GAAG,CAAC,EAAC;GAChI,MAAM;IACL,sBAAsB,GAAG,IAAI,oBAAmB;IAChD,sBAAsB,GAAG,KAAI;GAC9B;;EAEDA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnD,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI;IAClD,EAAA,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,MAAK,EAAA;EACpCF,IAAI,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,sBAAsB,EAAC;EACnE,IAAI,cAAc,EAAE,EAAA,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAC,EAAA;EAC9E,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;IACtBA,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK;IAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,CAAC,GAAG,KAAI;IAC/F,IAAI,CAAC,sBAAsB,EAAE,EAAA,mBAAmB,CAAC,IAAI,CAAC,sBAAsB,EAAC,EAAA;IAC7E,sBAAsB,CAAC,eAAe,GAAG,CAAC,EAAC;IAC3C,IAAI,CAAC,SAAS,CAAC,IAAI,EAAC;IACpB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IACxC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,sBAAsB,CAAC;GACrD,MAAM;IACL,IAAI,sBAAsB,EAAE,EAAA,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC,EAAA;GACrF;EACD,IAAI,cAAc,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,eAAc,EAAA;EACpF,IAAI,gBAAgB,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,aAAa,GAAG,iBAAgB,EAAA;EAClF,IAAI,kBAAkB,GAAG,CAAC,CAAC,EAAE,EAAA,sBAAsB,CAAC,eAAe,GAAG,mBAAkB,EAAA;EACxF,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,qBAAqB,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;EAChEJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,sBAAsB,EAAC;EAC1D,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACnE,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,CAAC,EAAE;IACzBF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;IAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,GAAE;IACzC,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,KAAK,EAAC;IACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;IAC5C,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,uBAAuB,CAAC;GACtD;EACD,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,sBAAsB,EAAE;EACvDJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,sBAAsB,EAAE,KAAK,EAAC;EAC9D,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;EACnE,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,yBAAyB,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;EACxI;;;;;;;;AAQDI,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE;EACzEJ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAK;EAC1B,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,GAAG,CAAC,EAAE;IACnD,IAAI,IAAI,GAAG,OAAO,EAAE;MAClBF,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,WAAU;MACvEF,IAAI,EAAE,GAAG,IAAI,CAAC,MAAK;MACnB,IAAI,CAAC,IAAI,GAAE;MACXA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;MACnDA,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAC;MAC/FA,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAC;MACjF,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC;KACzE;GACF;EACD,OAAO,IAAI;EACZ;;AAEDI,IAAE,CAAC,WAAW,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE;EACtEJ,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;EAC/C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,QAAQ,GAAG,GAAE;EAClB,IAAI,CAAC,KAAK,GAAG,MAAK;EAClB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,mBAAmB,GAAG,kBAAkB,CAAC;EACjF;;;;AAIDI,IAAE,CAAC,eAAe,GAAG,SAAS,sBAAsB,EAAE,QAAQ,EAAE;;;EAC9DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAI;EACzD,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,EAAE;IAChH,IAAI,GAAG,IAAI,CAAC,UAAU,GAAE;IACxB,QAAQ,GAAG,KAAI;GAChB,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;IAC3BA,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAM;IAC7D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK;IAC1B,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAC;IAChD,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,MAAM,EAAE,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAC,EAAA;SACpC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;aACzC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,YAAY;MAC1C,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,wCAAwC,EAAC,EAAA;SACxE,EAAA,QAAQ,GAAG,KAAI,EAAA;IACpB,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,kBAAkB,GAAG,iBAAiB,EAAC;GAC9E,MAAM;IACL,IAAI,GAAG,IAAI,CAAC,mBAAmB,CAAC,sBAAsB,EAAC;IACvD,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,EAAE,EAAA,OAAO,IAAI,EAAA;IACnE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE;MACtDF,IAAIO,MAAI,GAAGJ,MAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;MAC/CI,MAAI,CAAC,QAAQ,GAAGJ,MAAI,CAAC,MAAK;MAC1BI,MAAI,CAAC,MAAM,GAAG,MAAK;MACnBA,MAAI,CAAC,QAAQ,GAAG,KAAI;MACpBJ,MAAI,CAAC,SAAS,CAAC,IAAI,EAAC;MACpBA,MAAI,CAAC,IAAI,GAAE;MACX,IAAI,GAAGA,MAAI,CAAC,UAAU,CAACI,MAAI,EAAE,kBAAkB,EAAC;KACjD;GACF;;EAED,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAACL,KAAE,CAAC,QAAQ,CAAC;IACpC,EAAA,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,EAAA;;IAEjG,EAAA,OAAO,IAAI,EAAA;EACd;;;;AAIDE,IAAE,CAAC,mBAAmB,GAAG,SAAS,sBAAsB,EAAE;EACxDJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnDA,IAAI,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,sBAAsB,EAAC;EACrDA,IAAI,mBAAmB,GAAG,IAAI,CAAC,IAAI,KAAK,yBAAyB,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,IAAG;EACjI,IAAI,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,CAAC,IAAI,mBAAmB,EAAE,EAAA,OAAO,IAAI,EAAA;EAC1FA,IAAI,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAC;EAC3D,IAAI,sBAAsB,IAAI,MAAM,CAAC,IAAI,KAAK,kBAAkB,EAAE;IAChE,IAAI,sBAAsB,CAAC,mBAAmB,IAAI,MAAM,CAAC,KAAK,EAAE,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,EAAC,EAAA;IAC/G,IAAI,sBAAsB,CAAC,iBAAiB,IAAI,MAAM,CAAC,KAAK,EAAE,EAAA,sBAAsB,CAAC,iBAAiB,GAAG,CAAC,EAAC,EAAA;GAC5G;EACD,OAAO,MAAM;EACd;;AAEDI,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE;;;EAC/DJ,IAAI,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;MACtG,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,QAAO;EACpH,OAAO,IAAI,EAAE;IACXA,IAAI,OAAO,GAAGG,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAC;IACrF,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,yBAAyB,EAAE,EAAA,OAAO,OAAO,EAAA;IAClF,IAAI,GAAG,QAAO;GACf;EACF;;AAEDC,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE;EAC/EJ,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,EAAC;EACpC,IAAI,QAAQ,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,GAAG,CAAC,EAAE;IAChCF,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/C,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACzE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,SAAQ;IAC1B,IAAI,QAAQ,EAAE,EAAA,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,QAAQ,EAAC,EAAA;IACtC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,EAAC;GACjD,MAAM,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC1CF,IAAI,sBAAsB,GAAG,IAAI,mBAAmB,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;IACrJ,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,aAAa,GAAG,EAAC;IACtBA,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAACE,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,KAAK,EAAE,sBAAsB,EAAC;IAC1G,IAAI,eAAe,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;MACvE,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,KAAK,EAAC;MACtD,IAAI,CAAC,8BAA8B,GAAE;MACrC,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;QACxB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,2DAA2D,EAAC,EAAA;MAC7F,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;MACrC,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC;KACvF;IACD,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,aAAa,GAAG,gBAAgB,IAAI,IAAI,CAAC,cAAa;IAC3DF,IAAIO,MAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/CA,MAAI,CAAC,MAAM,GAAG,KAAI;IAClBA,MAAI,CAAC,SAAS,GAAG,SAAQ;IACzB,IAAI,GAAG,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,gBAAgB,EAAC;GAC/C,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKL,KAAE,CAAC,SAAS,EAAE;IACrCF,IAAIO,MAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC/CA,MAAI,CAAC,GAAG,GAAG,KAAI;IACfA,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAC;IACjD,IAAI,GAAG,IAAI,CAAC,UAAU,CAACA,MAAI,EAAE,0BAA0B,EAAC;GACzD;EACD,OAAO,IAAI;EACZ;;;;;;;AAODH,IAAE,CAAC,aAAa,GAAG,SAAS,sBAAsB,EAAE;;;EAGlD,IAAI,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,KAAK,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAE7CF,IAAI,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC,gBAAgB,KAAK,IAAI,CAAC,MAAK;EAC3D,QAAQ,IAAI,CAAC,IAAI;EACjB,KAAKE,KAAE,CAAC,MAAM;IACZ,IAAI,CAAC,IAAI,CAAC,UAAU;MAClB,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,kCAAkC,EAAC,EAAA;IAC5D,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB;MACnD,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,gDAAgD,EAAC,EAAA;;;;;;;IAO1E,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM;MAC9E,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC;;EAEvC,KAAKA,KAAE,CAAC,KAAK;IACX,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,gBAAgB,CAAC;;EAEhD,KAAKA,KAAE,CAAC,IAAI;IACVF,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,YAAW;IACnFA,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,SAAS,CAAC;MAC9H,EAAA,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAA;IACjF,IAAI,UAAU,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE;MAC5C,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;QACpB,EAAA,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAA;MACrF,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE;QACjG,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;QAC3B,IAAI,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC;UAClD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;QACnB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;OACnF;KACF;IACD,OAAO,EAAE;;EAEX,KAAKA,KAAE,CAAC,MAAM;IACZF,IAAI,KAAK,GAAG,IAAI,CAAC,MAAK;IACtB,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAC;IACrC,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAC;IACzD,OAAO,IAAI;;EAEb,KAAKE,KAAE,CAAC,GAAG,CAAC,CAAC,KAAKA,KAAE,CAAC,MAAM;IACzB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;;EAEtC,KAAKA,KAAE,CAAC,KAAK,CAAC,CAAC,KAAKA,KAAE,CAAC,KAAK,CAAC,CAAC,KAAKA,KAAE,CAAC,MAAM;IAC1C,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAK;IACnE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAO;IAC5B,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;;EAEzC,KAAKA,KAAE,CAAC,MAAM;IACZF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,GAAG,IAAI,CAAC,kCAAkC,CAAC,UAAU,EAAC;IAClF,IAAI,sBAAsB,EAAE;MAC1B,IAAI,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;QACpF,EAAA,sBAAsB,CAAC,mBAAmB,GAAG,MAAK,EAAA;MACpD,IAAI,sBAAsB,CAAC,iBAAiB,GAAG,CAAC;QAC9C,EAAA,sBAAsB,CAAC,iBAAiB,GAAG,MAAK,EAAA;KACnD;IACD,OAAO,IAAI;;EAEb,KAAKE,KAAE,CAAC,QAAQ;IACd,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,CAACA,KAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,sBAAsB,EAAC;IACnF,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;;EAEjD,KAAKA,KAAE,CAAC,MAAM;IACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,sBAAsB,CAAC;;EAErD,KAAKA,KAAE,CAAC,SAAS;IACf,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;IACvB,IAAI,CAAC,IAAI,GAAE;IACX,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;;EAEpC,KAAKA,KAAE,CAAC,MAAM;IACZ,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC;;EAEjD,KAAKA,KAAE,CAAC,IAAI;IACV,OAAO,IAAI,CAAC,QAAQ,EAAE;;EAExB,KAAKA,KAAE,CAAC,SAAS;IACf,OAAO,IAAI,CAAC,aAAa,EAAE;;EAE7B;IACE,IAAI,CAAC,UAAU,GAAE;GAClB;EACF;;AAEDE,IAAE,CAAC,YAAY,GAAG,SAAS,KAAK,EAAE;EAChCJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,KAAK,GAAG,MAAK;EAClB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EACjD,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,CAAC;EACxC;;AAEDI,IAAE,CAAC,oBAAoB,GAAG,WAAW;EACnC,IAAI,CAAC,MAAM,CAACF,KAAE,CAAC,MAAM,EAAC;EACtBF,IAAI,GAAG,GAAG,IAAI,CAAC,eAAe,GAAE;EAChC,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,OAAO,GAAG;EACX;;AAEDE,IAAE,CAAC,kCAAkC,GAAG,SAAS,UAAU,EAAE;;;EAC3DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,kBAAkB,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAC5G,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,IAAI,GAAE;;IAEXA,IAAI,aAAa,GAAG,IAAI,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,CAAC,SAAQ;IAC7DA,IAAI,QAAQ,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,MAAK;IACpDA,IAAI,sBAAsB,GAAG,IAAI,mBAAmB,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,YAAW;IAC3H,IAAI,CAAC,QAAQ,GAAG,EAAC;IACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;;IAEjB,OAAO,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,MAAM,EAAE;MAC9B,KAAK,GAAG,KAAK,GAAG,KAAK,GAAGC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MAC7C,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE;QAClE,WAAW,GAAG,KAAI;QAClB,KAAK;OACN,MAAM,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;QACpC,WAAW,GAAGC,MAAI,CAAC,MAAK;QACxB,QAAQ,CAAC,IAAI,CAACA,MAAI,CAAC,cAAc,CAACA,MAAI,CAAC,gBAAgB,EAAE,CAAC,EAAC;QAC3D,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC,EAAA;QACnG,KAAK;OACN,MAAM;QACL,QAAQ,CAAC,IAAI,CAACA,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAEA,MAAI,CAAC,cAAc,CAAC,EAAC;OACzF;KACF;IACDH,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,CAAC,SAAQ;IACzD,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;;IAEtB,IAAI,UAAU,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;MAClE,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,EAAE,KAAK,EAAC;MACtD,IAAI,CAAC,8BAA8B,GAAE;MACrC,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;MAC3B,OAAO,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC;KAC9D;;IAED,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,EAAC,EAAA;IACvE,IAAI,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,WAAW,EAAC,EAAA;IAC7C,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,IAAI,EAAC;IACxD,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;IAC5C,IAAI,CAAC,QAAQ,GAAG,WAAW,IAAI,IAAI,CAAC,SAAQ;;IAE5C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;MACvB,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,EAAE,aAAa,EAAC;MACpD,GAAG,CAAC,WAAW,GAAG,SAAQ;MAC1B,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,oBAAoB,EAAE,WAAW,EAAE,WAAW,EAAC;KACvE,MAAM;MACL,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAC;KAClB;GACF,MAAM;IACL,GAAG,GAAG,IAAI,CAAC,oBAAoB,GAAE;GAClC;;EAED,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE;IAC/BF,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAC;IAC9C,GAAG,CAAC,UAAU,GAAG,IAAG;IACpB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,yBAAyB,CAAC;GACvD,MAAM;IACL,OAAO,GAAG;GACX;EACF;;AAEDI,IAAE,CAAC,cAAc,GAAG,SAAS,IAAI,EAAE;EACjC,OAAO,IAAI;EACZ;;AAEDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE;EAC9D,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC;EACjF;;;;;;;;AAQDL,IAAMS,OAAK,GAAG,GAAE;;AAEhBJ,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvBJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3BA,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;EAChC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,GAAG,CAAC,EAAE;IACrD,IAAI,CAAC,IAAI,GAAG,KAAI;IAChBF,IAAI,WAAW,GAAG,IAAI,CAAC,YAAW;IAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAC;IACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,IAAI,WAAW;MAChD,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,oDAAoD,EAAC,EAAA;IAClG,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE;MAC5B,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,0CAA0C,EAAC,EAAA;IAC/E,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,cAAc,CAAC;GAC7C;EACDA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC,SAAQ;EACnD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAC;EAClF,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAACA,KAAE,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,KAAK,EAAC,EAAA;OACxG,EAAA,IAAI,CAAC,SAAS,GAAGM,QAAK,EAAA;EAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;EAC9C;;;;AAIDJ,IAAE,CAAC,oBAAoB,GAAG,SAAS,GAAA,EAAY;MAAX,QAAQ;;EAC1CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,eAAe,EAAE;IACpC,IAAI,CAAC,QAAQ,EAAE;MACb,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,kDAAkD,EAAC;KACtF;IACD,IAAI,CAAC,KAAK,GAAG;MACX,GAAG,EAAE,IAAI,CAAC,KAAK;MACf,MAAM,EAAE,IAAI;MACb;GACF,MAAM;IACL,IAAI,CAAC,KAAK,GAAG;MACX,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;MACnE,MAAM,EAAE,IAAI,CAAC,KAAK;MACnB;GACF;EACD,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,UAAS;EACtC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,aAAa,GAAG,SAAS,GAAA,EAAyB;oBAAP;2BAAA,GAAG,EAAE,CAAX;qEAAA,KAAK;;EAC3CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,WAAW,GAAG,GAAE;EACrBA,IAAI,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,UAAA,QAAQ,CAAC,EAAC;EAClD,IAAI,CAAC,MAAM,GAAG,CAAC,MAAM,EAAC;EACtB,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE;IACnB,IAAIG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG,EAAE,EAAAC,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,EAAE,+BAA+B,EAAC,EAAA;IAC/EA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,YAAY,EAAC;IAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAACC,MAAI,CAAC,eAAe,EAAE,EAAC;IAC7CA,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,MAAM,EAAC;IACtB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAGC,MAAI,CAAC,oBAAoB,CAAC,CAAC,UAAA,QAAQ,CAAC,CAAC,EAAC;GACjE;EACD,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE;EAC9B,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO;KACjF,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,CAAC,CAAC;IACxL,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;EACjE;;;;AAIDE,IAAE,CAAC,QAAQ,GAAG,SAAS,SAAS,EAAE,sBAAsB,EAAE;;;EACxDJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,QAAQ,GAAG,GAAE;EACxD,IAAI,CAAC,UAAU,GAAG,GAAE;EACpB,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,CAAC,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,MAAM,CAAC,EAAE;IAC3B,IAAI,CAAC,KAAK,EAAE;MACVC,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAIC,MAAI,CAAC,kBAAkB,CAACD,KAAE,CAAC,MAAM,CAAC,EAAE,EAAA,KAAK,EAAA;KAC9C,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBH,IAAM,IAAI,GAAGI,MAAI,CAAC,aAAa,CAAC,SAAS,EAAE,sBAAsB,EAAC;IAClE,IAAI,CAAC,SAAS,EAAE,EAAAA,MAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,sBAAsB,EAAC,EAAA;IAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAC;GAC3B;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,eAAe,GAAG,kBAAkB,CAAC;EAC/E;;AAEDC,IAAE,CAAC,aAAa,GAAG,SAAS,SAAS,EAAE,sBAAsB,EAAE;EAC7DJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAQ;EACrE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,QAAQ,CAAC,EAAE;IAC1D,IAAI,SAAS,EAAE;MACb,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;MACtC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,EAAE;QAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,+CAA+C,EAAC;OACxE;MACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,aAAa,CAAC;KAC5C;;IAED,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,IAAI,sBAAsB,EAAE;MACrD,IAAI,sBAAsB,CAAC,mBAAmB,GAAG,CAAC,EAAE;QAClD,sBAAsB,CAAC,mBAAmB,GAAG,IAAI,CAAC,MAAK;OACxD;MACD,IAAI,sBAAsB,CAAC,iBAAiB,GAAG,CAAC,EAAE;QAChD,sBAAsB,CAAC,iBAAiB,GAAG,IAAI,CAAC,MAAK;OACtD;KACF;;IAED,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;;IAEpE,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,IAAI,sBAAsB,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC,EAAE;MAChG,sBAAsB,CAAC,aAAa,GAAG,IAAI,CAAC,MAAK;KAClD;;IAED,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,eAAe,CAAC;GAC9C;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,CAAC,MAAM,GAAG,MAAK;IACnB,IAAI,CAAC,SAAS,GAAG,MAAK;IACtB,IAAI,SAAS,IAAI,sBAAsB,EAAE;MACvC,QAAQ,GAAG,IAAI,CAAC,MAAK;MACrB,QAAQ,GAAG,IAAI,CAAC,SAAQ;KACzB;IACD,IAAI,CAAC,SAAS;MACZ,EAAA,WAAW,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC,EAAA;GAClC;EACDF,IAAI,WAAW,GAAG,IAAI,CAAC,YAAW;EAClC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAC;EAC5B,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;IACzG,OAAO,GAAG,KAAI;IACd,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAACE,KAAE,CAAC,IAAI,EAAC;IAChE,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,sBAAsB,EAAC;GACrD,MAAM;IACL,OAAO,GAAG,MAAK;GAChB;EACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,sBAAsB,EAAE,WAAW,EAAC;EACvH,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC;EACzC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,sBAAsB,EAAE,WAAW,EAAE;EAC/H,IAAI,CAAC,WAAW,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,KAAKF,KAAE,CAAC,KAAK;IACpD,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;;EAEnB,IAAI,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,KAAK,CAAC,EAAE;IACtB,IAAI,CAAC,KAAK,GAAG,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;IACjI,IAAI,CAAC,IAAI,GAAG,OAAM;GACnB,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,EAAE;IACnE,IAAI,SAAS,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAChC,IAAI,CAAC,IAAI,GAAG,OAAM;IAClB,IAAI,CAAC,MAAM,GAAG,KAAI;IAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,OAAO,EAAC;GACpD,MAAM,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW;aAC1B,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY;cAChF,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC;cACnD,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,CAAC,EAAE;IAC9D,IAAI,WAAW,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAI;IACzB,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAC;IAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAC;IACpCF,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,KAAK,KAAK,GAAG,CAAC,GAAG,EAAC;IAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE;MAC3CA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAK;MAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QACrB,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;;QAE5D,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sCAAsC,EAAC,EAAA;KACvE,MAAM;MACL,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa;QACpE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,+BAA+B,EAAC,EAAA;KACrF;GACF,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,YAAY,EAAE;IAC5F,IAAI,WAAW,IAAI,OAAO,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IAC7C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;IAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa;MAClD,EAAA,IAAI,CAAC,aAAa,GAAG,SAAQ,EAAA;IAC/B,IAAI,CAAC,IAAI,GAAG,OAAM;IAClB,IAAI,SAAS,EAAE;MACb,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAC;KAClE,MAAM,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,EAAE,IAAI,sBAAsB,EAAE;MACxD,IAAI,sBAAsB,CAAC,eAAe,GAAG,CAAC;QAC5C,EAAA,sBAAsB,CAAC,eAAe,GAAG,IAAI,CAAC,MAAK,EAAA;MACrD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAC;KAClE,MAAM;MACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAG;KACtB;IACD,IAAI,CAAC,SAAS,GAAG,KAAI;GACtB,MAAM,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;EACzB;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpC,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IACjC,IAAI,IAAI,CAAC,GAAG,CAACF,KAAE,CAAC,QAAQ,CAAC,EAAE;MACzB,IAAI,CAAC,QAAQ,GAAG,KAAI;MACpB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,gBAAgB,GAAE;MAClC,IAAI,CAAC,MAAM,CAACA,KAAE,CAAC,QAAQ,EAAC;MACxB,OAAO,IAAI,CAAC,GAAG;KAChB,MAAM;MACL,IAAI,CAAC,QAAQ,GAAG,MAAK;KACtB;GACF;EACD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;EACjH;;;;AAIDE,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE;EAC/B,IAAI,CAAC,EAAE,GAAG,KAAI;EACd,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,GAAG,MAAK,EAAA;EAC3E,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,MAAK,EAAA;EACtD;;;;AAIDA,IAAE,CAAC,WAAW,GAAG,SAAS,WAAW,EAAE,OAAO,EAAE,gBAAgB,EAAE;EAChEJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;;EAE5H,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,SAAS,GAAG,YAAW,EAAA;EAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;IAC/B,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAExB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;EACtB,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,WAAW,IAAI,gBAAgB,GAAG,kBAAkB,GAAG,CAAC,CAAC,EAAC;;EAEnH,IAAI,CAAC,MAAM,CAACE,KAAE,CAAC,MAAM,EAAC;EACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAACA,KAAE,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAC;EACpF,IAAI,CAAC,8BAA8B,GAAE;EACrC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC;;EAEzC,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,oBAAoB,CAAC;EACnD;;;;AAIDE,IAAE,CAAC,oBAAoB,GAAG,SAAS,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE;EACxDJ,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,gBAAgB,GAAG,IAAI,CAAC,cAAa;;EAEnG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,WAAW,EAAC;EAC5D,IAAI,CAAC,YAAY,CAAC,IAAI,EAAC;EACvB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,QAAO,EAAA;;EAEzD,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,QAAQ,GAAG,EAAC;EACjB,IAAI,CAAC,aAAa,GAAG,EAAC;;EAEtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAC;EACjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAC;;EAEzC,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,QAAQ,GAAG,YAAW;EAC3B,IAAI,CAAC,aAAa,GAAG,iBAAgB;EACrC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,yBAAyB,CAAC;EACxD;;;;AAIDI,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE;EAC/DJ,IAAI,YAAY,GAAG,eAAe,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,OAAM;EAC7DF,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,MAAK;;EAE9C,IAAI,YAAY,EAAE;IAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,gBAAgB,GAAE;IACnC,IAAI,CAAC,UAAU,GAAG,KAAI;IACtB,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAC;GAC9B,MAAM;IACLA,IAAI,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAC;IACrF,IAAI,CAAC,SAAS,IAAI,SAAS,EAAE;MAC3B,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,EAAC;;;;MAI1C,IAAI,SAAS,IAAI,SAAS;QACxB,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,2EAA2E,EAAC,EAAA;KACjH;;;IAGDA,IAAI,SAAS,GAAG,IAAI,CAAC,OAAM;IAC3B,IAAI,CAAC,MAAM,GAAG,GAAE;IAChB,IAAI,SAAS,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,KAAI,EAAA;;;;IAIjC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,SAAS,IAAI,CAAC,SAAS,IAAI,CAAC,eAAe,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,EAAC;IACxH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAC;IAClC,IAAI,CAAC,UAAU,GAAG,MAAK;IACvB,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;IAC3C,IAAI,CAAC,MAAM,GAAG,UAAS;GACxB;EACD,IAAI,CAAC,SAAS,GAAE;;;EAGhB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAC,EAAA;EACjE,IAAI,CAAC,MAAM,GAAG,UAAS;EACxB;;AAEDI,IAAE,CAAC,iBAAiB,GAAG,SAAS,MAAM,EAAE;EACtC,KAAc,kBAAI,MAAM,yBAAA;IAAnB;IAAAJ,IAAI,KAAK;;IACZ,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,EAAA,OAAO,KAAK;GAAA,EAAA;EAC/C,OAAO,IAAI;EACZ;;;;;AAKDI,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,eAAe,EAAE;;;EAC/CJ,IAAI,QAAQ,GAAG,GAAE;EACjB,KAAc,kBAAI,IAAI,CAAC,MAAM,yBAAA;IAAxB;IAAAA,IAAI,KAAK;;IACZG,MAAI,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,eAAe,GAAG,IAAI,GAAG,QAAQ,EAAC;GAAA;EACrE;;;;;;;;AAQDC,IAAE,CAAC,aAAa,GAAG,SAAS,KAAK,EAAE,kBAAkB,EAAE,UAAU,EAAE,sBAAsB,EAAE;;;EACzFJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,KAAI;EAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;IACvB,IAAI,CAAC,KAAK,EAAE;MACVG,MAAI,CAAC,MAAM,CAACD,KAAE,CAAC,KAAK,EAAC;MACrB,IAAI,kBAAkB,IAAIC,MAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,EAAA,KAAK,EAAA;KAChE,MAAM,EAAA,KAAK,GAAG,MAAK,EAAA;;IAEpBH,IAAI,GAAG,YAAA;IACP,IAAI,UAAU,IAAIG,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK;MACtC,EAAA,GAAG,GAAG,KAAI,EAAA;SACP,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,EAAE;MAClC,GAAG,GAAGC,MAAI,CAAC,WAAW,CAAC,sBAAsB,EAAC;MAC9C,IAAI,sBAAsB,IAAIA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,KAAK,IAAI,sBAAsB,CAAC,aAAa,GAAG,CAAC;QAC9F,EAAA,sBAAsB,CAAC,aAAa,GAAGC,MAAI,CAAC,MAAK,EAAA;KACpD,MAAM;MACL,GAAG,GAAGA,MAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sBAAsB,EAAC;KAC3D;IACD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAC;GACf;EACD,OAAO,IAAI;EACZ;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,GAAA,EAAoB;MAAnB,KAAK,aAAE;MAAA,GAAG,WAAE;MAAA,IAAI;;EAC7C,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,KAAK,OAAO;IACtC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,qDAAqD,EAAC,EAAA;EACrF,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,KAAK,OAAO;IAClC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,2DAA2D,EAAC,EAAA;EAC3F,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;IAC1B,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,GAAE,sBAAqB,GAAE,IAAI,MAAE,GAAE,EAAA;EACnD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC;IAC9B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAA,MAAM,EAAA;EAC3DL,IAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,cAAa;EACtE,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IACjB,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,KAAK,OAAO;MACnC,EAAA,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,sDAAsD,EAAC,EAAA;IACtF,IAAI,CAAC,gBAAgB,CAAC,KAAK,GAAE,eAAc,GAAE,IAAI,kBAAc,GAAE;GAClE;EACF;;;;;;AAMDK,IAAE,CAAC,UAAU,GAAG,SAAS,OAAO,EAAE,SAAS,EAAE;EAC3CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,KAAK,OAAO,EAAE,EAAA,OAAO,GAAG,MAAK,EAAA;EACtE,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,EAAE;IACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAK;GACvB,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;IAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAO;;;;;;IAM7B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;SACjD,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE;MAClG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;KACnB;GACF,MAAM;IACL,IAAI,CAAC,UAAU,GAAE;GAClB;EACD,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,YAAY,EAAC;EACnC,IAAI,CAAC,OAAO,EAAE;IACZ,IAAI,CAAC,eAAe,CAAC,IAAI,EAAC;IAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa;MAC9C,EAAA,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,MAAK,EAAA;GAClC;EACD,OAAO,IAAI;EACZ;;;;AAIDE,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE;EAC7B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK,EAAA;;EAE9CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,IAAI,CAAC,IAAI,KAAKE,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,kBAAkB,EAAE,KAAK,IAAI,CAAC,IAAI,KAAKA,KAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;IAC1G,IAAI,CAAC,QAAQ,GAAG,MAAK;IACrB,IAAI,CAAC,QAAQ,GAAG,KAAI;GACrB,MAAM;IACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAACA,KAAE,CAAC,IAAI,EAAC;IACjC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC;GAC5C;EACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;EAChD;;AAEDE,IAAE,CAAC,UAAU,GAAG,WAAW;EACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAK,EAAA;;EAE9CJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3B,IAAI,CAAC,IAAI,GAAE;EACX,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAC;EAChD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,iBAAiB,CAAC;CAChD;;AC15BDD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;;;;;AAQ3BA,IAAE,CAAC,KAAK,GAAG,SAAS,GAAG,EAAE,OAAO,EAAE;EAChCJ,IAAI,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAC;EACtC,OAAO,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,IAAG;EACnDA,IAAI,GAAG,GAAG,IAAI,WAAW,CAAC,OAAO,EAAC;EAClC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAG;EACrD,MAAM,GAAG;EACV;;AAEDI,IAAE,CAAC,gBAAgB,GAAGA,IAAE,CAAC,MAAK;;AAE9BA,IAAE,CAAC,WAAW,GAAG,WAAW;EAC1B,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;IAC1B,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;GAC7D;CACF;;ACtBDL,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3B,IAAM,KAAK,GAAC,cACC,CAAC,KAAK,EAAE;EACnB,IAAM,CAAC,KAAK,GAAG,MAAK;;EAEpB,IAAM,CAAC,GAAG,GAAG,GAAE;;EAEf,IAAM,CAAC,OAAO,GAAG,GAAE;;EAEnB,IAAM,CAAC,SAAS,GAAG,GAAE;CACpB,CAAA;;;;AAKHA,IAAE,CAAC,UAAU,GAAG,SAAS,KAAK,EAAE;EAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,EAAC;EACvC;;AAEDA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxB,IAAI,CAAC,UAAU,CAAC,GAAG,GAAE;EACtB;;;;;AAKDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE;EAC9C,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,cAAc,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;EACrF;;AAEDA,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE;;;EAChDJ,IAAI,UAAU,GAAG,MAAK;EACtB,IAAI,WAAW,KAAK,YAAY,EAAE;IAChCD,IAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC;IACnH,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC;IACxB,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;MAC5C,EAAA,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC,EAAA;GACrC,MAAM,IAAI,WAAW,KAAK,iBAAiB,EAAE;IAC5CA,IAAMU,OAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjCA,OAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAC;GACzB,MAAM,IAAI,WAAW,KAAK,aAAa,EAAE;IACxCV,IAAMU,OAAK,GAAG,IAAI,CAAC,YAAY,GAAE;IACjC,IAAI,IAAI,CAAC,mBAAmB;MAC1B,EAAA,UAAU,GAAGA,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,EAAA;;MAE7C,EAAA,UAAU,GAAGA,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAIA,OAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,EAAA;IAC/EA,OAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAC;GAC3B,MAAM;IACL,KAAKT,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;MACpDD,IAAMU,OAAK,GAAGN,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;MAChC,IAAIM,OAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAACA,OAAK,CAAC,KAAK,GAAG,kBAAkB,KAAKA,OAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;UACtG,CAACN,MAAI,CAAC,0BAA0B,CAACM,OAAK,CAAC,IAAIA,OAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;QACjF,UAAU,GAAG,KAAI;QACjB,KAAK;OACN;MACDA,OAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAC;MACpB,IAAIN,MAAI,CAAC,QAAQ,KAAKM,OAAK,CAAC,KAAK,GAAG,SAAS,CAAC;QAC5C,EAAA,OAAON,MAAI,CAAC,gBAAgB,CAAC,IAAI,EAAC,EAAA;MACpC,IAAIM,OAAK,CAAC,KAAK,GAAG,SAAS,EAAE,EAAA,KAAK,EAAA;KACnC;GACF;EACD,IAAI,UAAU,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,GAAG,GAAE,cAAa,GAAE,IAAI,gCAA4B,GAAE,EAAA;EAC7F;;AAEDL,IAAE,CAAC,gBAAgB,GAAG,SAAS,EAAE,EAAE;;EAEjC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;MAClD,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;IAClD,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,GAAE;GACpC;EACF;;AAEDA,IAAE,CAAC,YAAY,GAAG,WAAW;EAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;EACnD;;AAEDA,IAAE,CAAC,eAAe,GAAG,WAAW;;;EAC9B,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;IAC7CA,IAAI,KAAK,GAAGG,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;IAC9B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,EAAE,EAAA,OAAO,KAAK,EAAA;GAC1C;EACF;;;AAGDC,IAAE,CAAC,gBAAgB,GAAG,WAAW;;;EAC/B,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;IAC7CA,IAAI,KAAK,GAAGG,MAAI,CAAC,UAAU,CAAC,CAAC,EAAC;IAC9B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,IAAI,EAAE,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,EAAE,EAAA,OAAO,KAAK,EAAA;GAC1E;CACF;;AC3FM,IAAM,IAAI,GAAC,aACL,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE;EAC9B,IAAM,CAAC,IAAI,GAAG,GAAE;EAChB,IAAM,CAAC,KAAK,GAAG,IAAG;EAClB,IAAM,CAAC,GAAG,GAAG,EAAC;EACd,IAAM,MAAM,CAAC,OAAO,CAAC,SAAS;IAC5B,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,MAAM,EAAE,GAAG,EAAC,EAAA;EAC9C,IAAM,MAAM,CAAC,OAAO,CAAC,gBAAgB;IACnC,EAAE,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,iBAAgB,EAAA;EACrD,IAAM,MAAM,CAAC,OAAO,CAAC,MAAM;IACzB,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,EAAC,EAAA;CACxB,CAAA;;;;AAKHJ,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3BA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxB,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC;EACjD;;AAEDA,IAAE,CAAC,WAAW,GAAG,SAAS,GAAG,EAAE,GAAG,EAAE;EAClC,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;EAChC;;;;AAID,SAAS,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;EAC1C,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,GAAG,GAAG,IAAG;EACd,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAG,EAAA;EACpB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;IACrB,EAAA,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAG,EAAA;EACrB,OAAO,IAAI;CACZ;;AAEDA,IAAE,CAAC,UAAU,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACnC,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC;EAChF;;;;AAIDA,IAAE,CAAC,YAAY,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;EAC/C,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;CACrD;;ACjDD;;;;AAIA,AAIO,IAAM,UAAU,GAAC,mBACX,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE;EAC/D,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,MAAM,GAAG,CAAC,CAAC,OAAM;EACxB,IAAM,CAAC,aAAa,GAAG,CAAC,CAAC,cAAa;EACtC,IAAM,CAAC,QAAQ,GAAG,SAAQ;EAC1B,IAAM,CAAC,SAAS,GAAG,CAAC,CAAC,UAAS;CAC7B,CAAA;;AAGH,AAAOL,IAAMW,OAAK,GAAG;EACnB,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;EAClC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC;EACjC,MAAM,EAAE,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC;EACnC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;EAClC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC;EACjC,MAAM,EAAE,IAAI,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,UAAA,CAAC,EAAC,SAAG,CAAC,CAAC,oBAAoB,EAAE,GAAA,CAAC;EACtE,MAAM,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,KAAK,CAAC;EACzC,MAAM,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC;EACxC,UAAU,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;EAC/D,KAAK,EAAE,IAAI,UAAU,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;EAC5D;;AAEDX,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3BA,IAAE,CAAC,cAAc,GAAG,WAAW;EAC7B,OAAO,CAACM,OAAK,CAAC,MAAM,CAAC;EACtB;;AAEDN,IAAE,CAAC,YAAY,GAAG,SAAS,QAAQ,EAAE;EACnCJ,IAAI,MAAM,GAAG,IAAI,CAAC,UAAU,GAAE;EAC9B,IAAI,MAAM,KAAKU,OAAK,CAAC,MAAM,IAAI,MAAM,KAAKA,OAAK,CAAC,MAAM;IACpD,EAAA,OAAO,IAAI,EAAA;EACb,IAAI,QAAQ,KAAKR,KAAE,CAAC,KAAK,KAAK,MAAM,KAAKQ,OAAK,CAAC,MAAM,IAAI,MAAM,KAAKA,OAAK,CAAC,MAAM,CAAC;IAC/E,EAAA,OAAO,CAAC,MAAM,CAAC,MAAM,EAAA;;;;;EAKvB,IAAI,QAAQ,KAAKR,KAAE,CAAC,OAAO,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW;IACrE,EAAA,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAA;EACtE,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,GAAG,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK;IACzH,EAAA,OAAO,IAAI,EAAA;EACb,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM;IACxB,EAAA,OAAO,MAAM,KAAKQ,OAAK,CAAC,MAAM,EAAA;EAChC,IAAI,QAAQ,KAAKR,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI;IACxE,EAAA,OAAO,KAAK,EAAA;EACd,OAAO,CAAC,IAAI,CAAC,WAAW;EACzB;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,WAAW;;;EACjC,KAAKJ,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;IACjDA,IAAI,OAAO,GAAGG,MAAI,CAAC,OAAO,CAAC,CAAC,EAAC;IAC7B,IAAI,OAAO,CAAC,KAAK,KAAK,UAAU;MAC9B,EAAA,OAAO,OAAO,CAAC,SAAS,EAAA;GAC3B;EACD,OAAO,KAAK;EACb;;AAEDC,IAAE,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACpCJ,IAAI,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,KAAI;EAC5B,IAAI,IAAI,CAAC,OAAO,IAAI,QAAQ,KAAKE,KAAE,CAAC,GAAG;IACrC,EAAA,IAAI,CAAC,WAAW,GAAG,MAAK,EAAA;OACrB,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa;IAClC,EAAA,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAC,EAAA;;IAE3B,EAAA,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAU,EAAA;EACrC;;;;AAIDA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAGA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,WAAW;EAC7D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;IAC7B,IAAI,CAAC,WAAW,GAAG,KAAI;IACvB,MAAM;GACP;EACDF,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;EAC5B,IAAI,GAAG,KAAKU,OAAK,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC,KAAK,KAAK,UAAU,EAAE;IAClE,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE;GACzB;EACD,IAAI,CAAC,WAAW,GAAG,CAAC,GAAG,CAAC,OAAM;EAC/B;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAGQ,OAAK,CAAC,MAAM,GAAGA,OAAK,CAAC,MAAM,EAAC;EAC5E,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,YAAY,CAAC,aAAa,GAAG,WAAW;EACzC,IAAI,CAAC,OAAO,CAAC,IAAI,CAACQ,OAAK,CAAC,MAAM,EAAC;EAC/B,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EAC3CF,IAAI,eAAe,GAAG,QAAQ,KAAKE,KAAE,CAAC,GAAG,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,OAAM;EACpH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,GAAGQ,OAAK,CAAC,MAAM,GAAGA,OAAK,CAAC,MAAM,EAAC;EAChE,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,WAAW;;EAEpC;;AAEDA,KAAE,CAAC,SAAS,CAAC,aAAa,GAAGA,KAAE,CAAC,MAAM,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACxE,IAAI,QAAQ,CAAC,UAAU,IAAI,QAAQ,KAAKA,KAAE,CAAC,IAAI,IAAI,QAAQ,KAAKA,KAAE,CAAC,KAAK;MACpE,EAAE,QAAQ,KAAKA,KAAE,CAAC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;MAC3F,EAAE,CAAC,QAAQ,KAAKA,KAAE,CAAC,KAAK,IAAI,QAAQ,KAAKA,KAAE,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,KAAKQ,OAAK,CAAC,MAAM,CAAC;IAC5F,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;;IAE/B,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;EACjC,IAAI,CAAC,WAAW,GAAG,MAAK;EACzB;;AAEDR,KAAE,CAAC,SAAS,CAAC,aAAa,GAAG,WAAW;EACtC,IAAI,IAAI,CAAC,UAAU,EAAE,KAAKQ,OAAK,CAAC,MAAM;IACpC,EAAA,IAAI,CAAC,OAAO,CAAC,GAAG,GAAE,EAAA;;IAElB,EAAA,IAAI,CAAC,OAAO,CAAC,IAAI,CAACA,OAAK,CAAC,MAAM,EAAC,EAAA;EACjC,IAAI,CAAC,WAAW,GAAG,MAAK;EACzB;;AAEDR,KAAE,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACzC,IAAI,QAAQ,KAAKA,KAAE,CAAC,SAAS,EAAE;IAC7BF,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,EAAC;IACnC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAKU,OAAK,CAAC,MAAM;MACtC,EAAA,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAGA,OAAK,CAAC,WAAU,EAAA;;MAEtC,EAAA,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAGA,OAAK,CAAC,MAAK,EAAA;GACpC;EACD,IAAI,CAAC,WAAW,GAAG,KAAI;EACxB;;AAEDR,KAAE,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,QAAQ,EAAE;EACzCF,IAAI,OAAO,GAAG,MAAK;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,QAAQ,KAAKE,KAAE,CAAC,GAAG,EAAE;IACxD,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW;QACxC,IAAI,CAAC,KAAK,KAAK,OAAO,IAAI,IAAI,CAAC,kBAAkB,EAAE;MACrD,EAAA,OAAO,GAAG,KAAI,EAAA;GACjB;EACD,IAAI,CAAC,WAAW,GAAG,QAAO;CAC3B;;;;;;;AC7IDH,IAAM,qBAAqB,GAAG,89BAA69B;AAC3/BA,IAAM,uBAAuB,GAAG;EAC9B,CAAC,EAAE,qBAAqB;EACxB,EAAE,EAAE,qBAAqB,GAAG,wBAAwB;EACrD;;;AAGDA,IAAM,4BAA4B,GAAG,qpBAAopB;;;AAGzrBA,IAAM,iBAAiB,GAAG,2+DAA0+D;AACpgEA,IAAM,mBAAmB,GAAG;EAC1B,CAAC,EAAE,iBAAiB;EACpB,EAAE,EAAE,iBAAiB,GAAG,iHAAiH;EAC1I;;AAEDA,IAAM,IAAI,GAAG,GAAE;AACf,SAAS,gBAAgB,CAAC,WAAW,EAAE;EACrCC,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG;IAC1B,MAAM,EAAE,WAAW,CAAC,uBAAuB,CAAC,WAAW,CAAC,GAAG,GAAG,GAAG,4BAA4B,CAAC;IAC9F,SAAS,EAAE;MACT,gBAAgB,EAAE,WAAW,CAAC,4BAA4B,CAAC;MAC3D,MAAM,EAAE,WAAW,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;KACtD;IACF;EACD,CAAC,CAAC,SAAS,CAAC,iBAAiB,GAAG,CAAC,CAAC,SAAS,CAAC,OAAM;;EAElD,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,iBAAgB;EAC7C,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAM;EACnC,CAAC,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,kBAAiB;CAChD;AACD,gBAAgB,CAAC,CAAC,EAAC;AACnB,gBAAgB,CAAC,EAAE,CAAC;;AClCpBD,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;AAE3B,AAAO,IAAM,qBAAqB,GAAC,8BACtB,CAAC,MAAM,EAAE;EACpB,IAAM,CAAC,MAAM,GAAG,OAAM;EACtB,IAAM,CAAC,UAAU,GAAG,KAAI,IAAE,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,IAAI,GAAG,EAAE,CAAA,IAAG,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,EAAA;EAClH,IAAM,CAAC,iBAAiB,GAAGO,IAAuB,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,EAAC;EACtH,IAAM,CAAC,MAAM,GAAG,GAAE;EAClB,IAAM,CAAC,KAAK,GAAG,GAAE;EACjB,IAAM,CAAC,KAAK,GAAG,EAAC;EAChB,IAAM,CAAC,OAAO,GAAG,MAAK;EACtB,IAAM,CAAC,OAAO,GAAG,MAAK;EACtB,IAAM,CAAC,GAAG,GAAG,EAAC;EACd,IAAM,CAAC,YAAY,GAAG,EAAC;EACvB,IAAM,CAAC,eAAe,GAAG,GAAE;EAC3B,IAAM,CAAC,2BAA2B,GAAG,MAAK;EAC1C,IAAM,CAAC,kBAAkB,GAAG,EAAC;EAC7B,IAAM,CAAC,gBAAgB,GAAG,EAAC;EAC3B,IAAM,CAAC,UAAU,GAAG,GAAE;EACtB,IAAM,CAAC,kBAAkB,GAAG,GAAE;CAC7B,CAAA;;AAEH,gCAAE,KAAK,mBAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;EAC7B,IAAQ,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAC;EAC3C,IAAM,CAAC,KAAK,GAAG,KAAK,GAAG,EAAC;EACxB,IAAM,CAAC,MAAM,GAAG,OAAO,GAAG,GAAE;EAC5B,IAAM,CAAC,KAAK,GAAG,MAAK;EACpB,IAAM,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAChE,IAAM,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;CAC/D,CAAA;;AAEH,gCAAE,KAAK,mBAAC,OAAO,EAAE;EACf,IAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,GAAE,+BAA8B,IAAE,IAAI,CAAC,MAAM,CAAA,QAAI,GAAE,OAAO,GAAG;CACrG,CAAA;;;;AAIH,gCAAE,EAAE,gBAAC,CAAC,EAAE;EACN,IAAQ,CAAC,GAAG,IAAI,CAAC,OAAM;EACvB,IAAQ,CAAC,GAAG,CAAC,CAAC,OAAM;EACpB,IAAM,CAAC,IAAI,CAAC,EAAE;IACZ,OAAS,CAAC,CAAC;GACV;EACH,IAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,EAAC;EAC3B,IAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IAC/D,OAAS,CAAC;GACT;EACH,OAAS,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;CACnD,CAAA;;AAEH,gCAAE,SAAS,uBAAC,CAAC,EAAE;EACb,IAAQ,CAAC,GAAG,IAAI,CAAC,OAAM;EACvB,IAAQ,CAAC,GAAG,CAAC,CAAC,OAAM;EACpB,IAAM,CAAC,IAAI,CAAC,EAAE;IACZ,OAAS,CAAC;GACT;EACH,IAAQ,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,EAAC;EAC3B,IAAM,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IAC/D,OAAS,CAAC,GAAG,CAAC;GACb;EACH,OAAS,CAAC,GAAG,CAAC;CACb,CAAA;;AAEH,gCAAE,OAAO,uBAAG;EACV,OAAS,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;CACzB,CAAA;;AAEH,gCAAE,SAAS,yBAAG;EACZ,OAAS,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACzC,CAAA;;AAEH,gCAAE,OAAO,uBAAG;EACV,IAAM,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAC;CACpC,CAAA;;AAEH,gCAAE,GAAG,iBAAC,EAAE,EAAE;EACR,IAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;IAC3B,IAAM,CAAC,OAAO,GAAE;IAChB,OAAS,IAAI;GACZ;EACH,OAAS,KAAK;CACb,CAAA;;AAGH,SAASC,mBAAiB,CAAC,EAAE,EAAE;EAC7B,IAAI,EAAE,IAAI,MAAM,EAAE,EAAA,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,EAAA;EAChD,EAAE,IAAI,QAAO;EACb,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC,EAAE,GAAG,MAAM,IAAI,MAAM,CAAC;CACxE;;;;;;;;AAQDR,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;;;EACvCL,IAAM,UAAU,GAAG,KAAK,CAAC,WAAU;EACnCA,IAAM,KAAK,GAAG,KAAK,CAAC,MAAK;;EAEzB,KAAKC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACrCD,IAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAC;IAC5B,IAAI,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;MACnCI,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC;KAC3D;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;MACnCA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,mCAAmC,EAAC;KAC7D;GACF;EACF;;;;;;;;AAQDC,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;;;;;;;EAO1B,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;IAClF,KAAK,CAAC,OAAO,GAAG,KAAI;IACpB,IAAI,CAAC,cAAc,CAAC,KAAK,EAAC;GAC3B;EACF;;;AAGDA,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,KAAK,CAAC,GAAG,GAAG,EAAC;EACb,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,KAAK,CAAC,2BAA2B,GAAG,MAAK;EACzC,KAAK,CAAC,kBAAkB,GAAG,EAAC;EAC5B,KAAK,CAAC,gBAAgB,GAAG,EAAC;EAC1B,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,EAAC;EAC3B,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,EAAC;;EAEnC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;;EAE9B,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE;;IAErC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;KAC7B;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,KAAK,CAAC,KAAK,CAAC,0BAA0B,EAAC;KACxC;GACF;EACD,IAAI,KAAK,CAAC,gBAAgB,GAAG,KAAK,CAAC,kBAAkB,EAAE;IACrD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;GAC9B;EACD,KAAe,kBAAI,KAAK,CAAC,kBAAkB,yBAAA,EAAE;IAAxCL,IAAM,IAAI;;IACb,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;MACzC,KAAK,CAAC,KAAK,CAAC,kCAAkC,EAAC;KAChD;GACF;EACF;;;AAGDK,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;;;EACtC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;EAC9B,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC9BD,MAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;GAC/B;;;EAGD,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;IAC1C,KAAK,CAAC,KAAK,CAAC,mBAAmB,EAAC;GACjC;EACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,KAAK,CAAC,0BAA0B,EAAC;GACxC;EACF;;;AAGDC,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;EACtC,OAAO,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;IAClE,EAAA,AAAC,EAAA;EACJ;;;AAGDA,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;;;;IAInC,IAAI,KAAK,CAAC,2BAA2B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;;MAEzE,IAAI,KAAK,CAAC,OAAO,EAAE;QACjB,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;OAClC;KACF;IACD,OAAO,IAAI;GACZ;;EAED,IAAI,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE;IACnF,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAC;IAChC,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,KAAK,CAAC,2BAA2B,GAAG,MAAK;;;EAGzC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACtD,OAAO,IAAI;GACZ;;;EAGD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;;EAGD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACtDC,IAAI,UAAU,GAAG,MAAK;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;KACrC;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;MAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;QAC5B,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;OAClC;MACD,KAAK,CAAC,2BAA2B,GAAG,CAAC,WAAU;MAC/C,OAAO,IAAI;KACZ;GACF;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE,OAAe,EAAE;mCAAV,GAAG,KAAK;;EACvD,IAAI,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE;IACnD,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;IACvB,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE,OAAO,EAAE;EACvD;IACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC;GAChD;EACF;AACDA,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE,OAAO,EAAE;EACvDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3BC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAC;IACrB,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;MACvC,GAAG,GAAG,KAAK,CAAC,aAAY;MACxB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;QAClE,GAAG,GAAG,KAAK,CAAC,aAAY;OACzB;MACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;;QAE3B,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE;UACvC,KAAK,CAAC,KAAK,CAAC,uCAAuC,EAAC;SACrD;QACD,OAAO,IAAI;OACZ;KACF;IACD,IAAI,KAAK,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE;MAC7B,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC;KACrC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC;IACE,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC;IACvC,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;IAC9C,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC;IACtC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;GACrC;EACF;AACDA,IAAE,CAAC,kCAAkC,GAAG,SAAS,KAAK,EAAE;EACtDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;MACpC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,0BAA0B,GAAG,SAAS,KAAK,EAAE;EAC9CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACtD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;MAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;QAC3B,OAAO,IAAI;OACZ;MACD,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;KAClC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAC;KAClC,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,UAAU;MAC3C,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;KAC7B;IACD,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;IAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,kBAAkB,IAAI,EAAC;MAC7B,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,oBAAoB,EAAC;GAClC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,sBAAsB,GAAG,SAAS,KAAK,EAAE;EAC1C;IACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;IACvB,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;IAC9C,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC;IACtC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,iCAAiC,CAAC,KAAK,CAAC;IAC7C,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC;GAC/C;EACF;;;AAGDA,IAAE,CAAC,iCAAiC,GAAG,SAAS,KAAK,EAAE;EACrD,IAAI,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;IAChD,KAAK,CAAC,KAAK,CAAC,mBAAmB,EAAC;GACjC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,yBAAyB,GAAG,SAAS,KAAK,EAAE;EAC7CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,iBAAiB,CAAC,EAAE,CAAC,EAAE;IACzB,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACD,SAAS,iBAAiB,CAAC,EAAE,EAAE;EAC7B;IACE,EAAE,KAAK,IAAI;IACX,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;IAChC,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;IAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;GACjC;CACF;;;;AAIDK,IAAE,CAAC,2BAA2B,GAAG,SAAS,KAAK,EAAE;EAC/CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,EAAE;IAC9D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;;;AAGDI,IAAE,CAAC,kCAAkC,GAAG,SAAS,KAAK,EAAE;EACtDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B;IACE,EAAE,KAAK,CAAC,CAAC;IACT,EAAE,KAAK,IAAI;IACX,EAAE,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;IAC3C,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX;IACA,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;;;AAKDK,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MACnC,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE;QAC1D,KAAK,CAAC,KAAK,CAAC,8BAA8B,EAAC;OAC5C;MACD,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAC;MAC5C,MAAM;KACP;IACD,KAAK,CAAC,KAAK,CAAC,eAAe,EAAC;GAC7B;EACF;;;;;AAKDA,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvC,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MACzE,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,4BAA4B,EAAC;GAC1C;EACD,OAAO,KAAK;EACb;;;;;;AAMDA,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClD,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,IAAI,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,EAAE;IAC/C,KAAK,CAAC,eAAe,IAAIQ,mBAAiB,CAAC,KAAK,CAAC,YAAY,EAAC;IAC9D,OAAO,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,EAAE;MACjD,KAAK,CAAC,eAAe,IAAIA,mBAAiB,CAAC,KAAK,CAAC,YAAY,EAAC;KAC/D;IACD,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;;;;;AAODR,IAAE,CAAC,+BAA+B,GAAG,SAAS,KAAK,EAAE;EACnDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,KAAK,CAAC,OAAO,GAAE;;EAEf,IAAI,EAAE,KAAK,IAAI,YAAY,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC,EAAE;IAC5E,EAAE,GAAG,KAAK,CAAC,aAAY;GACxB;EACD,IAAI,uBAAuB,CAAC,EAAE,CAAC,EAAE;IAC/B,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,OAAO,IAAI;GACZ;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;AACD,SAAS,uBAAuB,CAAC,EAAE,EAAE;EACnC,OAAO,iBAAiB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI;CACzE;;;;;;;;;AASDI,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,KAAK,CAAC,OAAO,GAAE;;EAEf,IAAI,EAAE,KAAK,IAAI,YAAY,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC,EAAE;IAC5E,EAAE,GAAG,KAAK,CAAC,aAAY;GACxB;EACD,IAAI,sBAAsB,CAAC,EAAE,CAAC,EAAE;IAC9B,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,OAAO,IAAI;GACZ;;EAED,KAAK,CAAC,GAAG,GAAG,MAAK;EACjB,OAAO,KAAK;EACb;AACD,SAAS,sBAAsB,CAAC,EAAE,EAAE;EAClC,OAAO,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,MAAM,iBAAiB,EAAE,KAAK,MAAM;CAC/H;;;AAGDI,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC;IACE,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC;IACnC,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;IAC1C,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;KACpC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;IACnD;IACA,OAAO,IAAI;GACZ;EACD,IAAI,KAAK,CAAC,OAAO,EAAE;;IAEjB,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,UAAU;MACpC,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC;KACtC;IACD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;GAC9B;EACD,OAAO,KAAK;EACb;AACDA,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;IACvCA,IAAM,CAAC,GAAG,KAAK,CAAC,aAAY;IAC5B,IAAI,KAAK,CAAC,OAAO,EAAE;;MAEjB,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,EAAE;QAC9B,KAAK,CAAC,gBAAgB,GAAG,EAAC;OAC3B;MACD,OAAO,IAAI;KACZ;IACD,IAAI,CAAC,IAAI,KAAK,CAAC,kBAAkB,EAAE;MACjC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MACnC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,EAAC;MACpD,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,yBAAyB,EAAC;GACvC;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,yBAAyB,GAAG,SAAS,KAAK,EAAE;EAC7C;IACE,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC;IACnC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;IACpC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;IAC1B,IAAI,CAAC,2BAA2B,CAAC,KAAK,CAAC;IACvC,IAAI,CAAC,qCAAqC,CAAC,KAAK,CAAC;KAChD,CAAC,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,mCAAmC,CAAC,KAAK,CAAC,CAAC;IACnE,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;GACrC;EACF;AACDA,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;MACvC,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,cAAc,GAAG,SAAS,KAAK,EAAE;EAClC,IAAI,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE;IAC1E,KAAK,CAAC,YAAY,GAAG,EAAC;IACtB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDA,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE;IACvB,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACD,SAAS,eAAe,CAAC,EAAE,EAAE;EAC3B;IACE,CAAC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;KAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;GAC3C;CACF;;;AAGDK,IAAE,CAAC,qCAAqC,GAAG,SAAS,KAAK,EAAE;EACzDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;MAC3CA,IAAM,IAAI,GAAG,KAAK,CAAC,aAAY;MAC/B,IAAI,KAAK,CAAC,OAAO,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE;QACrDA,IAAM,gBAAgB,GAAG,KAAK,CAAC,IAAG;QAClC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;UACjGA,IAAM,KAAK,GAAG,KAAK,CAAC,aAAY;UAChC,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,EAAE;YACtC,KAAK,CAAC,YAAY,GAAG,CAAC,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,QAAO;YACzE,OAAO,IAAI;WACZ;SACF;QACD,KAAK,CAAC,GAAG,GAAG,iBAAgB;QAC5B,KAAK,CAAC,YAAY,GAAG,KAAI;OAC1B;MACD,OAAO,IAAI;KACZ;IACD;MACE,KAAK,CAAC,OAAO;MACb,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC;MAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,cAAc,CAAC,KAAK,CAAC,YAAY,CAAC;MAClC;MACA,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;MACjB,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC;KACtC;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAED,OAAO,KAAK;EACb;AACD,SAAS,cAAc,CAAC,EAAE,EAAE;EAC1B,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ;CACjC;;;AAGDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,OAAO,EAAE;IACjB,IAAI,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE;MACzC,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,KAAK,CAAC,YAAY,GAAG,KAAI;MACzB,OAAO,IAAI;KACZ;IACD,OAAO,KAAK;GACb;;EAEDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,aAAa,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE;IAClE,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3C,KAAK,CAAC,YAAY,GAAG,EAAC;EACtBJ,IAAI,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EACxB,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,GAAG;MACD,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,GAAG,IAAI,UAAS;MAClE,KAAK,CAAC,OAAO,GAAE;KAChB,QAAQ,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;IACtE,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDI,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;;EAE1B,IAAI,sBAAsB,CAAC,EAAE,CAAC,EAAE;IAC9B,KAAK,CAAC,YAAY,GAAG,CAAC,EAAC;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED;IACE,KAAK,CAAC,OAAO;IACb,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC;KAC5B,EAAE,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI,SAAS;IAC5C;IACA,KAAK,CAAC,YAAY,GAAG,CAAC,EAAC;IACvB,KAAK,CAAC,OAAO,GAAE;IACf;MACE,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB,IAAI,CAAC,wCAAwC,CAAC,KAAK,CAAC;MACpD,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS;MACvB;MACA,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC;GACrC;;EAED,OAAO,KAAK;EACb;AACD,SAAS,sBAAsB,CAAC,EAAE,EAAE;EAClC;IACE,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;IACX,EAAE,KAAK,IAAI;GACZ;CACF;;;;;AAKDK,IAAE,CAAC,wCAAwC,GAAG,SAAS,KAAK,EAAE;EAC5DL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;;EAGvB,IAAI,IAAI,CAAC,6BAA6B,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IACxEA,IAAM,IAAI,GAAG,KAAK,CAAC,gBAAe;IAClC,IAAI,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,EAAE;MAC9CA,IAAM,KAAK,GAAG,KAAK,CAAC,gBAAe;MACnC,IAAI,CAAC,0CAA0C,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAC;MACnE,OAAO,IAAI;KACZ;GACF;EACD,KAAK,CAAC,GAAG,GAAG,MAAK;;;EAGjB,IAAI,IAAI,CAAC,wCAAwC,CAAC,KAAK,CAAC,EAAE;IACxDA,IAAM,WAAW,GAAG,KAAK,CAAC,gBAAe;IACzC,IAAI,CAAC,yCAAyC,CAAC,KAAK,EAAE,WAAW,EAAC;IAClE,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;AACDK,IAAE,CAAC,0CAA0C,GAAG,SAAS,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;EAC3E,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;IAC/C,EAAA,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC,EAAA;EACtC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACtD,EAAA,KAAK,CAAC,KAAK,CAAC,wBAAwB,EAAC,EAAA;EACxC;AACDA,IAAE,CAAC,yCAAyC,GAAG,SAAS,KAAK,EAAE,WAAW,EAAE;EAC1E,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACnD,EAAA,KAAK,CAAC,KAAK,CAAC,uBAAuB,EAAC,EAAA;EACvC;;;;AAIDA,IAAE,CAAC,6BAA6B,GAAG,SAAS,KAAK,EAAE;EACjDJ,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,OAAO,8BAA8B,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC3D,KAAK,CAAC,eAAe,IAAIY,mBAAiB,CAAC,EAAE,EAAC;IAC9C,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,eAAe,KAAK,EAAE;EACpC;AACD,SAAS,8BAA8B,CAAC,EAAE,EAAE;EAC1C,OAAO,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI;CAC1C;;;;AAIDR,IAAE,CAAC,8BAA8B,GAAG,SAAS,KAAK,EAAE;EAClDJ,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,eAAe,GAAG,GAAE;EAC1B,OAAO,+BAA+B,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC5D,KAAK,CAAC,eAAe,IAAIY,mBAAiB,CAAC,EAAE,EAAC;IAC9C,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,eAAe,KAAK,EAAE;EACpC;AACD,SAAS,+BAA+B,CAAC,EAAE,EAAE;EAC3C,OAAO,8BAA8B,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC;CAChE;;;;AAIDR,IAAE,CAAC,wCAAwC,GAAG,SAAS,KAAK,EAAE;EAC5D,OAAO,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;EAClD;;;AAGDA,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE;EAC5C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,UAAS;IACvB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAC;IAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;MAC3B,OAAO,IAAI;KACZ;;IAED,KAAK,CAAC,KAAK,CAAC,8BAA8B,EAAC;GAC5C;EACD,OAAO,KAAK;EACb;;;;;AAKDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,KAAK,EAAE;;;EACtC,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;IACtCL,IAAM,IAAI,GAAG,KAAK,CAAC,aAAY;IAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,IAAII,MAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE;MAC9DJ,IAAM,KAAK,GAAG,KAAK,CAAC,aAAY;MAChC,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE;QAClD,KAAK,CAAC,KAAK,CAAC,yBAAyB,EAAC;OACvC;MACD,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,KAAK,EAAE;QAC/C,KAAK,CAAC,KAAK,CAAC,uCAAuC,EAAC;OACrD;KACF;GACF;EACF;;;;AAIDK,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE;MACrC,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;;MAEjBA,IAAMc,IAAE,GAAG,KAAK,CAAC,OAAO,GAAE;MAC1B,IAAIA,IAAE,KAAK,IAAI,YAAY,YAAY,CAACA,IAAE,CAAC,EAAE;QAC3C,KAAK,CAAC,KAAK,CAAC,sBAAsB,EAAC;OACpC;MACD,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;KAC9B;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAEDd,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,EAAE,KAAK,IAAI,UAAU;IACvB,KAAK,CAAC,YAAY,GAAG,GAAE;IACvB,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;;EAED,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,qBAAqB,GAAG,SAAS,KAAK,EAAE;EACzCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;;EAEvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,OAAO,IAAI;GACZ;;EAED,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC5C,KAAK,CAAC,YAAY,GAAG,KAAI;IACzB,OAAO,IAAI;GACZ;;EAED,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC7C,IAAI,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE;MAC5C,OAAO,IAAI;KACZ;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;;EAED;IACE,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC;IAC1C,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC;GACtC;EACF;;;AAGDK,IAAE,CAAC,4BAA4B,GAAG,SAAS,KAAK,EAAE;EAChDL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU;IAC7C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,2BAA2B,GAAG,SAAS,KAAK,EAAE;EAC/CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE;IAC3B,IAAI,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE;MAC3C,OAAO,IAAI;KACZ;IACD,IAAI,KAAK,CAAC,OAAO,EAAE;MACjB,KAAK,CAAC,KAAK,CAAC,gBAAgB,EAAC;KAC9B;IACD,KAAK,CAAC,GAAG,GAAG,MAAK;GAClB;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,uBAAuB,GAAG,SAAS,KAAK,EAAE;EAC3CL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,cAAc,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IAC3C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,GAAG,IAAI,UAAS;IAClE,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;AACD,SAAS,cAAc,CAAC,EAAE,EAAE;EAC1B,OAAO,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;CACxC;;;AAGDI,IAAE,CAAC,mBAAmB,GAAG,SAAS,KAAK,EAAE;EACvCL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvBC,IAAI,EAAE,GAAG,EAAC;EACV,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,UAAU,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE;IACvC,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,EAAE,EAAC;IAC3D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,KAAK,CAAC,GAAG,KAAK,KAAK;EAC3B;AACD,SAAS,UAAU,CAAC,EAAE,EAAE;EACtB;IACE,CAAC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;KAChC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;KACzC,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,SAAS;GAC3C;CACF;AACD,SAAS,QAAQ,CAAC,EAAE,EAAE;EACpB,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS;GAChC;EACD,IAAI,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI,UAAU;IAC5C,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS;GAChC;EACD,OAAO,EAAE,GAAG,IAAI;CACjB;;;;AAIDI,IAAE,CAAC,mCAAmC,GAAG,SAAS,KAAK,EAAE;EACvD,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;IACpCL,IAAM,EAAE,GAAG,KAAK,CAAC,aAAY;IAC7B,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;MACpCA,IAAM,EAAE,GAAG,KAAK,CAAC,aAAY;MAC7B,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,EAAE;QAC/C,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,aAAY;OAC3D,MAAM;QACL,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,CAAC,GAAG,GAAE;OACjC;KACF,MAAM;MACL,KAAK,CAAC,YAAY,GAAG,GAAE;KACxB;IACD,OAAO,IAAI;GACZ;EACD,OAAO,KAAK;EACb;;;AAGDK,IAAE,CAAC,oBAAoB,GAAG,SAAS,KAAK,EAAE;EACxCL,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;EAC1B,IAAI,YAAY,CAAC,EAAE,CAAC,EAAE;IACpB,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAI;IAC9B,KAAK,CAAC,OAAO,GAAE;IACf,OAAO,IAAI;GACZ;EACD,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,OAAO,KAAK;EACb;AACD,SAAS,YAAY,CAAC,EAAE,EAAE;EACxB,OAAO,EAAE,IAAI,IAAI,YAAY,EAAE,IAAI,IAAI;CACxC;;;;;AAKDK,IAAE,CAAC,wBAAwB,GAAG,SAAS,KAAK,EAAE,MAAM,EAAE;EACpDL,IAAM,KAAK,GAAG,KAAK,CAAC,IAAG;EACvB,KAAK,CAAC,YAAY,GAAG,EAAC;EACtB,KAAKC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;IAC/BD,IAAM,EAAE,GAAG,KAAK,CAAC,OAAO,GAAE;IAC1B,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE;MACnB,KAAK,CAAC,GAAG,GAAG,MAAK;MACjB,OAAO,KAAK;KACb;IACD,KAAK,CAAC,YAAY,GAAG,EAAE,GAAG,KAAK,CAAC,YAAY,GAAG,QAAQ,CAAC,EAAE,EAAC;IAC3D,KAAK,CAAC,OAAO,GAAE;GAChB;EACD,OAAO,IAAI;CACZ;;;;;;ACxgCD,AAAO,IAAM,KAAK,GAAC,cACN,CAAC,CAAC,EAAE;EACf,IAAM,CAAC,IAAI,GAAG,CAAC,CAAC,KAAI;EACpB,IAAM,CAAC,KAAK,GAAG,CAAC,CAAC,MAAK;EACtB,IAAM,CAAC,KAAK,GAAG,CAAC,CAAC,MAAK;EACtB,IAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAG;EAClB,IAAM,CAAC,CAAC,OAAO,CAAC,SAAS;IACvB,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAC,EAAA;EAC1D,IAAM,CAAC,CAAC,OAAO,CAAC,MAAM;IACpB,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAC,EAAA;CAChC,CAAA;;;;AAKHA,IAAMK,IAAE,GAAG,MAAM,CAAC,UAAS;;;;AAI3BA,IAAE,CAAC,IAAI,GAAG,WAAW;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO;IACtB,EAAA,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAC,EAAA;;EAEvC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,IAAG;EAC1B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAK;EAC9B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,OAAM;EAChC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,SAAQ;EACpC,IAAI,CAAC,SAAS,GAAE;EACjB;;AAEDA,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvB,IAAI,CAAC,IAAI,GAAE;EACX,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC;EACvB;;;AAGD,IAAI,OAAO,MAAM,KAAK,WAAW;EAC/B,EAAAA,IAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,WAAW;;;IAC/B,OAAO;MACL,IAAI,EAAE,YAAG;QACPJ,IAAI,KAAK,GAAGG,MAAI,CAAC,QAAQ,GAAE;QAC3B,OAAO;UACL,IAAI,EAAE,KAAK,CAAC,IAAI,KAAKD,KAAE,CAAC,GAAG;UAC3B,KAAK,EAAE,KAAK;SACb;OACF;KACF;IACF,EAAA;;;;;AAKHE,IAAE,CAAC,UAAU,GAAG,WAAW;EACzB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;EAC7C;;;;;AAKDA,IAAE,CAAC,SAAS,GAAG,WAAW;EACxBJ,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,GAAE;EAClC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,EAAA,IAAI,CAAC,SAAS,GAAE,EAAA;;EAE9D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAG;EACrB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAA,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,GAAE,EAAA;EAC9D,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAA,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,CAAC,EAAA;;EAElE,IAAI,UAAU,CAAC,QAAQ,EAAE,EAAA,OAAO,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAA;OACpD,EAAA,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAC,EAAA;EAC9C;;AAEDE,IAAE,CAAC,SAAS,GAAG,SAAS,IAAI,EAAE;;;EAG5B,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,EAAE;IACvE,EAAA,OAAO,IAAI,CAAC,QAAQ,EAAE,EAAA;;EAExB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;EACnC;;AAEDA,IAAE,CAAC,iBAAiB,GAAG,WAAW;EAChCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;EAC1C,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,IAAI,EAAA;EACjDA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,OAAO,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,GAAG,SAAS;EACvC;;AAEDI,IAAE,CAAC,gBAAgB,GAAG,WAAW;;;EAC/BJ,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,GAAE;EAC3DA,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,EAAC;EACnE,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,sBAAsB,EAAC,EAAA;EAChE,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,EAAC;EAClB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;IAC1B,UAAU,CAAC,SAAS,GAAG,MAAK;IAC5BA,IAAI,MAAK;IACT,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE;MACtE,EAAEG,MAAI,CAAC,QAAO;MACdA,MAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;KAC/C;GACF;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG;2BACvD,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,EAAC,EAAA;EACvD;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,SAAS,EAAE;;;EACvCJ,IAAI,KAAK,GAAG,IAAI,CAAC,IAAG;EACpBA,IAAI,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,GAAE;EAC3DA,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,EAAC;EACrD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE;IACrD,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAEA,MAAI,CAAC,GAAG,EAAC;GACvC;EACD,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS;IACxB,EAAA,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG;2BACrE,QAAQ,EAAE,IAAI,CAAC,WAAW,EAAE,EAAC,EAAA;EACvD;;;;;AAKDC,IAAE,CAAC,SAAS,GAAG,WAAW;;;EACxB,IAAI,EAAE,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;IACzCJ,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,QAAQ,EAAE;IACV,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG;MACf,EAAEA,MAAI,CAAC,IAAG;MACV,KAAK;IACP,KAAK,EAAE;MACL,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9C,EAAEA,MAAI,CAAC,IAAG;OACX;IACH,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI;MAC3B,EAAEA,MAAI,CAAC,IAAG;MACV,IAAIA,MAAI,CAAC,OAAO,CAAC,SAAS,EAAE;QAC1B,EAAEA,MAAI,CAAC,QAAO;QACdA,MAAI,CAAC,SAAS,GAAGA,MAAI,CAAC,IAAG;OAC1B;MACD,KAAK;IACP,KAAK,EAAE;MACL,QAAQA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC;MAC3C,KAAK,EAAE;QACLA,MAAI,CAAC,gBAAgB,GAAE;QACvB,KAAK;MACP,KAAK,EAAE;QACLA,MAAI,CAAC,eAAe,CAAC,CAAC,EAAC;QACvB,KAAK;MACP;QACE,MAAM,IAAI;OACX;MACD,KAAK;IACP;MACE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,EAAE;QACvF,EAAEA,MAAI,CAAC,IAAG;OACX,MAAM;QACL,MAAM,IAAI;OACX;KACF;GACF;EACF;;;;;;;AAODC,IAAE,CAAC,WAAW,GAAG,SAAS,IAAI,EAAE,GAAG,EAAE;EACnC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAG;EACnB,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAA,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,GAAE,EAAA;EAC5DJ,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAI;EACxB,IAAI,CAAC,IAAI,GAAG,KAAI;EAChB,IAAI,CAAC,KAAK,GAAG,IAAG;;EAEhB,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAC;EAC7B;;;;;;;;;;;AAWDI,IAAE,CAAC,aAAa,GAAG,WAAW;EAC5BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAA;EAC1DA,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC/C,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE,EAAE;IAChE,IAAI,CAAC,GAAG,IAAI,EAAC;IACb,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,QAAQ,CAAC;GACrC,MAAM;IACL,EAAE,IAAI,CAAC,IAAG;IACV,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,GAAG,CAAC;GAChC;EACF;;AAEDE,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,UAAU,EAAE,EAAE;EAC9D,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,KAAK,EAAE,CAAC,CAAC;EAClC;;AAEDE,IAAE,CAAC,yBAAyB,GAAG,SAAS,IAAI,EAAE;EAC5CJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9CA,IAAI,IAAI,GAAG,EAAC;EACZA,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,GAAGE,KAAE,CAAC,IAAI,GAAGA,KAAE,CAAC,OAAM;;;EAGjD,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE;IAC/D,EAAE,KAAI;IACN,SAAS,GAAGA,KAAE,CAAC,SAAQ;IACvB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;GAC3C;;EAED,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,EAAA;EAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC;EACtC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,IAAI,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,GAAG,GAAGE,KAAE,CAAC,SAAS,GAAGA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC,EAAA;EACvF,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,GAAG,GAAGA,KAAE,CAAC,SAAS,GAAGA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC;EACrE;;AAEDE,IAAE,CAAC,eAAe,GAAG,WAAW;EAC9BJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,UAAU,EAAE,CAAC,CAAC;EACvC;;AAEDE,IAAE,CAAC,kBAAkB,GAAG,SAAS,IAAI,EAAE;EACrCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,IAAI,EAAE;IACjB,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;SAC1E,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;;MAE1F,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC;MACvB,IAAI,CAAC,SAAS,GAAE;MAChB,OAAO,IAAI,CAAC,SAAS,EAAE;KACxB;IACD,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;GACnC;EACD,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAA;EACnD,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,OAAO,EAAE,CAAC,CAAC;EACpC;;AAEDE,IAAE,CAAC,eAAe,GAAG,SAAS,IAAI,EAAE;EAClCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9CA,IAAI,IAAI,GAAG,EAAC;EACZ,IAAI,IAAI,KAAK,IAAI,EAAE;IACjB,IAAI,GAAG,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAC;IACxE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,EAAA;IAC5F,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,QAAQ,EAAE,IAAI,CAAC;GACxC;EACD,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE;MAC1F,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;;IAE9C,IAAI,CAAC,eAAe,CAAC,CAAC,EAAC;IACvB,IAAI,CAAC,SAAS,GAAE;IAChB,OAAO,IAAI,CAAC,SAAS,EAAE;GACxB;EACD,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,IAAI,GAAG,EAAC,EAAA;EACzB,OAAO,IAAI,CAAC,QAAQ,CAACA,KAAE,CAAC,UAAU,EAAE,IAAI,CAAC;EAC1C;;AAEDE,IAAE,CAAC,iBAAiB,GAAG,SAAS,IAAI,EAAE;EACpCJ,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;EAC9C,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAA;EACtG,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IAC/D,IAAI,CAAC,GAAG,IAAI,EAAC;IACb,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;GAClC;EACD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,EAAE,GAAGA,KAAE,CAAC,EAAE,GAAGA,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;EACzD;;AAEDE,IAAE,CAAC,gBAAgB,GAAG,SAAS,IAAI,EAAE;EACnC,QAAQ,IAAI;;;EAGZ,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,aAAa,EAAE;;;EAG7B,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACF,KAAE,CAAC,MAAM,CAAC;EACvD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACvD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,IAAI,CAAC;EACrD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;EACtD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;EACzD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;EACzD,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACxD,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,MAAM,CAAC;EACxD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,KAAK,CAAC;EACtD,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,QAAQ,CAAC;;EAEzD,KAAK,EAAE;IACL,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,KAAK,EAAA;IACvC,EAAE,IAAI,CAAC,IAAG;IACV,OAAO,IAAI,CAAC,WAAW,CAACA,KAAE,CAAC,SAAS,CAAC;;EAEvC,KAAK,EAAE;IACLF,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAC;IAC9C,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAA;IAChE,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;MACjC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAA;MAC/D,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAA;KAC/D;;;;EAIH,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IAC7E,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;;;EAG/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;;;;;;;EAO9B,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,eAAe,EAAE;;EAE/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC;;EAE7C,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;IACf,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;;EAEtC,KAAK,EAAE;IACL,OAAO,IAAI,CAAC,eAAe,EAAE;;EAE/B,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;;EAEtC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC;;EAEnC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE;IACd,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;;EAErC,KAAK,GAAG;IACN,OAAO,IAAI,CAAC,QAAQ,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,CAAC;GACnC;;EAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,wBAAwB,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,GAAG,EAAC;EAC/E;;AAEDE,IAAE,CAAC,QAAQ,GAAG,SAAS,IAAI,EAAE,IAAI,EAAE;EACjCJ,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,EAAC;EACrD,IAAI,CAAC,GAAG,IAAI,KAAI;EAChB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC;EACnC;;AAEDI,IAAE,CAAC,UAAU,GAAG,WAAW;;;EACzBJ,IAAI,OAAO,EAAE,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,IAAG;EACtC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;IACvFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,MAAM,CAACA,MAAI,CAAC,GAAG,EAAC;IACpC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAAA,MAAI,CAAC,KAAK,CAAC,KAAK,EAAE,iCAAiC,EAAC,EAAA;IAC5E,IAAI,CAAC,OAAO,EAAE;MACZ,IAAI,EAAE,KAAK,GAAG,EAAE,EAAA,OAAO,GAAG,KAAI,EAAA;WACzB,IAAI,EAAE,KAAK,GAAG,IAAI,OAAO,EAAE,EAAA,OAAO,GAAG,MAAK,EAAA;WAC1C,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,EAAA,KAAK,EAAA;MACtC,OAAO,GAAG,EAAE,KAAK,KAAI;KACtB,MAAM,EAAA,OAAO,GAAG,MAAK,EAAA;IACtB,EAAEA,MAAI,CAAC,IAAG;GACX;EACDH,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EAC/C,EAAE,IAAI,CAAC,IAAG;EACVA,IAAI,UAAU,GAAG,IAAI,CAAC,IAAG;EACzBA,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,GAAE;EAC5B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,IAAI,CAAC,UAAU,CAAC,UAAU,EAAC,EAAA;;;EAGjDD,IAAM,KAAK,GAAG,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,EAAC;EACtF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAC;EAClC,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAC;EAC/B,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAC;;;EAGjCC,IAAI,KAAK,GAAG,KAAI;EAChB,IAAI;IACF,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,KAAK,EAAC;GACnC,CAAC,OAAO,CAAC,EAAE;;;GAGX;;EAED,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,MAAM,EAAE,CAAC,SAAA,OAAO,EAAE,OAAA,KAAK,EAAE,OAAA,KAAK,CAAC,CAAC;EAC5D;;;;;;AAMDE,IAAE,CAAC,OAAO,GAAG,SAAS,KAAK,EAAE,GAAG,EAAE;;;EAChCJ,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG,EAAC;EAC/B,KAAKA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,QAAQ,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;IAC5DA,IAAI,IAAI,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,CAAC,EAAE,GAAG,YAAA;IAC/C,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAE,EAAA;SAC/B,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAE,EAAA;SACpC,IAAI,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,EAAE,EAAA,GAAG,GAAG,IAAI,GAAG,GAAE,EAAA;SAC7C,EAAA,GAAG,GAAG,SAAQ,EAAA;IACnB,IAAI,GAAG,IAAI,KAAK,EAAE,EAAA,KAAK,EAAA;IACvB,EAAEA,MAAI,CAAC,IAAG;IACV,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,IAAG;GAC5B;EACD,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,EAAE,EAAA,OAAO,IAAI,EAAA;;EAE9E,OAAO,KAAK;EACb;;AAEDC,IAAE,CAAC,eAAe,GAAG,SAAS,KAAK,EAAE;EACnC,IAAI,CAAC,GAAG,IAAI,EAAC;EACbJ,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAC;EAC7B,IAAI,GAAG,IAAI,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,2BAA2B,GAAG,KAAK,EAAC,EAAA;EAChF,IAAI,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,kCAAkC,EAAC,EAAA;EACzG,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,EAAE,GAAG,CAAC;EACrC;;;;AAIDE,IAAE,CAAC,UAAU,GAAG,SAAS,aAAa,EAAE;EACtCJ,IAAI,KAAK,GAAG,IAAI,CAAC,IAAG;EACpB,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;EACpFA,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,GAAE;EACxE,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;EAC7D,IAAI,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAA,KAAK,GAAG,MAAK,EAAA;EAC1EA,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;EAC1C,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE;IACzB,EAAE,IAAI,CAAC,IAAG;IACV,IAAI,CAAC,OAAO,CAAC,EAAE,EAAC;IAChB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;GACvC;EACD,IAAI,CAAC,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;IAC3C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,EAAC;IACxC,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,EAAA,EAAE,IAAI,CAAC,IAAG,EAAA;IAC1C,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,gBAAgB,EAAC,EAAA;GACnE;EACD,IAAI,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,kCAAkC,EAAC,EAAA;;EAEzGA,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAC;EAC3CA,IAAI,GAAG,GAAG,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,EAAC;EACpD,OAAO,IAAI,CAAC,WAAW,CAACE,KAAE,CAAC,GAAG,EAAE,GAAG,CAAC;EACrC;;;;AAIDE,IAAE,CAAC,aAAa,GAAG,WAAW;EAC5BJ,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAI;;EAE9C,IAAI,EAAE,KAAK,GAAG,EAAE;IACd,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,EAAA,IAAI,CAAC,UAAU,GAAE,EAAA;IACnDA,IAAI,OAAO,GAAG,EAAE,IAAI,CAAC,IAAG;IACxB,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,EAAC;IACrE,EAAE,IAAI,CAAC,IAAG;IACV,IAAI,IAAI,GAAG,QAAQ,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,0BAA0B,EAAC,EAAA;GAClF,MAAM;IACL,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAC;GAC3B;EACD,OAAO,IAAI;EACZ;;AAED,SAAS,iBAAiB,CAAC,IAAI,EAAE;;EAE/B,IAAI,IAAI,IAAI,MAAM,EAAE,EAAA,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAA;EACpD,IAAI,IAAI,QAAO;EACf,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC,IAAI,GAAG,IAAI,IAAI,MAAM,CAAC;CAC1E;;AAEDI,IAAE,CAAC,UAAU,GAAG,SAAS,KAAK,EAAE;;;EAC9BJ,IAAI,GAAG,GAAG,EAAE,EAAE,UAAU,GAAG,EAAE,IAAI,CAAC,IAAG;EACrC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;IACzFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,IAAI,EAAE,KAAK,KAAK,EAAE,EAAA,KAAK,EAAA;IACvB,IAAI,EAAE,KAAK,EAAE,EAAE;MACb,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,GAAG,IAAIA,MAAI,CAAC,eAAe,CAAC,KAAK,EAAC;MAClC,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,IAAI,SAAS,CAAC,EAAE,EAAEA,MAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,8BAA8B,EAAC,EAAA;MACzG,EAAEA,MAAI,CAAC,IAAG;KACX;GACF;EACD,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAC;EAC/C,OAAO,IAAI,CAAC,WAAW,CAACD,KAAE,CAAC,MAAM,EAAE,GAAG,CAAC;EACxC;;;;AAIDH,IAAM,6BAA6B,GAAG,GAAE;;AAExCK,IAAE,CAAC,oBAAoB,GAAG,WAAW;EACnC,IAAI,CAAC,iBAAiB,GAAG,KAAI;EAC7B,IAAI;IACF,IAAI,CAAC,aAAa,GAAE;GACrB,CAAC,OAAO,GAAG,EAAE;IACZ,IAAI,GAAG,KAAK,6BAA6B,EAAE;MACzC,IAAI,CAAC,wBAAwB,GAAE;KAChC,MAAM;MACL,MAAM,GAAG;KACV;GACF;;EAED,IAAI,CAAC,iBAAiB,GAAG,MAAK;EAC/B;;AAEDA,IAAE,CAAC,kBAAkB,GAAG,SAAS,QAAQ,EAAE,OAAO,EAAE;EAClD,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,CAAC,EAAE;IAC3D,MAAM,6BAA6B;GACpC,MAAM;IACL,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,EAAC;GAC9B;EACF;;AAEDA,IAAE,CAAC,aAAa,GAAG,WAAW;;;EAC5BJ,IAAI,GAAG,GAAG,EAAE,EAAE,UAAU,GAAG,IAAI,CAAC,IAAG;EACnC,SAAS;IACP,IAAIG,MAAI,CAAC,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAAA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC,EAAA;IAClFH,IAAI,EAAE,GAAGG,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,EAAC;IACxC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;MACzE,IAAIA,MAAI,CAAC,GAAG,KAAKA,MAAI,CAAC,KAAK,KAAKA,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,QAAQ,IAAIC,MAAI,CAAC,IAAI,KAAKD,KAAE,CAAC,eAAe,CAAC,EAAE;QAC9F,IAAI,EAAE,KAAK,EAAE,EAAE;UACbC,MAAI,CAAC,GAAG,IAAI,EAAC;UACb,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,YAAY,CAAC;SACzC,MAAM;UACL,EAAEC,MAAI,CAAC,IAAG;UACV,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,SAAS,CAAC;SACtC;OACF;MACD,GAAG,IAAIC,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,QAAQ,EAAE,GAAG,CAAC;KAC1C;IACD,IAAI,EAAE,KAAK,EAAE,EAAE;MACb,GAAG,IAAIC,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,GAAG,IAAIA,MAAI,CAAC,eAAe,CAAC,IAAI,EAAC;MACjC,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;MACxB,GAAG,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC7C,EAAEA,MAAI,CAAC,IAAG;MACV,QAAQ,EAAE;MACV,KAAK,EAAE;QACL,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAACA,MAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAA,EAAEA,MAAI,CAAC,IAAG,EAAA;MACxD,KAAK,EAAE;QACL,GAAG,IAAI,KAAI;QACX,KAAK;MACP;QACE,GAAG,IAAI,MAAM,CAAC,YAAY,CAAC,EAAE,EAAC;QAC9B,KAAK;OACN;MACD,IAAIA,MAAI,CAAC,OAAO,CAAC,SAAS,EAAE;QAC1B,EAAEA,MAAI,CAAC,QAAO;QACdA,MAAI,CAAC,SAAS,GAAGA,MAAI,CAAC,IAAG;OAC1B;MACD,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,EAAEA,MAAI,CAAC,IAAG;KACX;GACF;EACF;;;AAGDC,IAAE,CAAC,wBAAwB,GAAG,WAAW;;;EACvC,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;IAC/C,QAAQD,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,CAAC;IAC5B,KAAK,IAAI;MACP,EAAEA,MAAI,CAAC,IAAG;MACV,KAAK;;IAEP,KAAK,GAAG;MACN,IAAIA,MAAI,CAAC,KAAK,CAACA,MAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;QACpC,KAAK;OACN;;;IAGH,KAAK,GAAG;MACN,OAAOA,MAAI,CAAC,WAAW,CAACD,KAAE,CAAC,eAAe,EAAEC,MAAI,CAAC,KAAK,CAAC,KAAK,CAACA,MAAI,CAAC,KAAK,EAAEA,MAAI,CAAC,GAAG,CAAC,CAAC;;;KAGpF;GACF;EACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,uBAAuB,EAAC;EAChD;;;;AAIDC,IAAE,CAAC,eAAe,GAAG,SAAS,UAAU,EAAE;EACxCJ,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,GAAG,EAAC;EAC1C,EAAE,IAAI,CAAC,IAAG;EACV,QAAQ,EAAE;EACV,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,GAAG,EAAE,OAAO,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;EACzD,KAAK,GAAG,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;EACxD,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,EAAE,EAAE,OAAO,IAAI;EACpB,KAAK,GAAG,EAAE,OAAO,QAAQ;EACzB,KAAK,GAAG,EAAE,OAAO,IAAI;EACrB,KAAK,EAAE,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAA,EAAE,IAAI,CAAC,IAAG,EAAA;EAC/D,KAAK,EAAE;IACL,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAO,EAAE;IACzE,OAAO,EAAE;EACX;IACE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;MACxBA,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC;MACrEA,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAC;MACjC,IAAI,KAAK,GAAG,GAAG,EAAE;QACf,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;QAChC,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAC;OAC9B;MACD,IAAI,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,GAAG,EAAC;MAC/B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAC;MACpC,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,EAAE;QAC/E,IAAI,CAAC,kBAAkB;UACrB,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM;UAC9B,UAAU;cACN,kCAAkC;cAClC,8BAA8B;UACnC;OACF;MACD,OAAO,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC;KAClC;IACD,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;;;MAGjB,OAAO,EAAE;KACV;IACD,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;GAC/B;EACF;;;;AAIDI,IAAE,CAAC,WAAW,GAAG,SAAS,GAAG,EAAE;EAC7BJ,IAAI,OAAO,GAAG,IAAI,CAAC,IAAG;EACtBA,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAC;EAC7B,IAAI,CAAC,KAAK,IAAI,EAAE,EAAA,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,+BAA+B,EAAC,EAAA;EACjF,OAAO,CAAC;EACT;;;;;;;;AAQDI,IAAE,CAAC,SAAS,GAAG,WAAW;;;EACxB,IAAI,CAAC,WAAW,GAAG,MAAK;EACxBJ,IAAI,IAAI,GAAG,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC,IAAG;EAClDA,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,EAAC;EAC1C,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;IACnCA,IAAI,EAAE,GAAGG,MAAI,CAAC,iBAAiB,GAAE;IACjC,IAAI,gBAAgB,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;MAChCA,MAAI,CAAC,GAAG,IAAI,EAAE,IAAI,MAAM,GAAG,CAAC,GAAG,EAAC;KACjC,MAAM,IAAI,EAAE,KAAK,EAAE,EAAE;MACpBA,MAAI,CAAC,WAAW,GAAG,KAAI;MACvB,IAAI,IAAIA,MAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAEA,MAAI,CAAC,GAAG,EAAC;MAC9CH,IAAI,QAAQ,GAAGG,MAAI,CAAC,IAAG;MACvB,IAAIA,MAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAEA,MAAI,CAAC,GAAG,CAAC,KAAK,GAAG;QAC3C,EAAAA,MAAI,CAAC,kBAAkB,CAACA,MAAI,CAAC,GAAG,EAAE,2CAA2C,EAAC,EAAA;MAChF,EAAEA,MAAI,CAAC,IAAG;MACVH,IAAI,GAAG,GAAGG,MAAI,CAAC,aAAa,GAAE;MAC9B,IAAI,CAAC,CAAC,KAAK,GAAG,iBAAiB,GAAG,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC;QAC9D,EAAAA,MAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,wBAAwB,EAAC,EAAA;MAC7D,IAAI,IAAI,iBAAiB,CAAC,GAAG,EAAC;MAC9B,UAAU,GAAGA,MAAI,CAAC,IAAG;KACtB,MAAM;MACL,KAAK;KACN;IACD,KAAK,GAAG,MAAK;GACd;EACD,OAAO,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC;EACrD;;;;;AAKDC,IAAE,CAAC,QAAQ,GAAG,WAAW;EACvBJ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,GAAE;EAC3BA,IAAI,IAAI,GAAGE,KAAE,CAAC,KAAI;EAClB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IAC5B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAA,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,6BAA6B,GAAG,IAAI,EAAC,EAAA;IAC7F,IAAI,GAAGY,UAAY,CAAC,IAAI,EAAC;GAC1B;EACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC;CACpC;;AC9rBD;;;;;;;;;;;;;;;;AAgBA,AAkBOf,IAAM,OAAO,GAAG,QAAO;;;;;;;;;AAS9B,AAAO,SAAS,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE;EACpC,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC;CACpC;;;;;;AAMD,AAAO,SAAS,iBAAiB,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE;EACrD,OAAO,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC;CACrD;;;;;AAKD,AAAO,SAAS,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE;EACxC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC;CACxC;;;;"}
\ No newline at end of file
diff --git a/node_modules/acorn/dist/bin.js b/node_modules/acorn/dist/bin.js
new file mode 100644
index 0000000..faa461e
--- /dev/null
+++ b/node_modules/acorn/dist/bin.js
@@ -0,0 +1,64 @@
+'use strict';
+
+var path = require('path');
+var fs = require('fs');
+var acorn = require('./acorn.js');
+
+var infile, forceFile, silent = false, compact = false, tokenize = false;
+var options = {};
+
+function help(status) {
+  var print = (status === 0) ? console.log : console.error;
+  print("usage: " + path.basename(process.argv[1]) + " [--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|...|--ecma2015|--ecma2016|--ecma2017|--ecma2018|...]");
+  print("        [--tokenize] [--locations] [---allow-hash-bang] [--compact] [--silent] [--module] [--help] [--] [infile]");
+  process.exit(status);
+}
+
+for (var i = 2; i < process.argv.length; ++i) {
+  var arg = process.argv[i];
+  if ((arg === "-" || arg[0] !== "-") && !infile) { infile = arg; }
+  else if (arg === "--" && !infile && i + 2 === process.argv.length) { forceFile = infile = process.argv[++i]; }
+  else if (arg === "--locations") { options.locations = true; }
+  else if (arg === "--allow-hash-bang") { options.allowHashBang = true; }
+  else if (arg === "--silent") { silent = true; }
+  else if (arg === "--compact") { compact = true; }
+  else if (arg === "--help") { help(0); }
+  else if (arg === "--tokenize") { tokenize = true; }
+  else if (arg === "--module") { options.sourceType = "module"; }
+  else {
+    var match = arg.match(/^--ecma(\d+)$/);
+    if (match)
+      { options.ecmaVersion = +match[1]; }
+    else
+      { help(1); }
+  }
+}
+
+function run(code) {
+  var result;
+  try {
+    if (!tokenize) {
+      result = acorn.parse(code, options);
+    } else {
+      result = [];
+      var tokenizer = acorn.tokenizer(code, options), token;
+      do {
+        token = tokenizer.getToken();
+        result.push(token);
+      } while (token.type !== acorn.tokTypes.eof)
+    }
+  } catch (e) {
+    console.error(infile && infile !== "-" ? e.message.replace(/\(\d+:\d+\)$/, function (m) { return m.slice(0, 1) + infile + " " + m.slice(1); }) : e.message);
+    process.exit(1);
+  }
+  if (!silent) { console.log(JSON.stringify(result, null, compact ? null : 2)); }
+}
+
+if (forceFile || infile && infile !== "-") {
+  run(fs.readFileSync(infile, "utf8"));
+} else {
+  var code = "";
+  process.stdin.resume();
+  process.stdin.on("data", function (chunk) { return code += chunk; });
+  process.stdin.on("end", function () { return run(code); });
+}
diff --git a/node_modules/acorn/package.json b/node_modules/acorn/package.json
new file mode 100644
index 0000000..6f570eb
--- /dev/null
+++ b/node_modules/acorn/package.json
@@ -0,0 +1,66 @@
+{
+  "_from": "acorn@^7.0.0",
+  "_id": "acorn@7.0.0",
+  "_inBundle": false,
+  "_integrity": "sha512-PaF/MduxijYYt7unVGRuds1vBC9bFxbNf+VWqhOClfdgy7RlVkQqt610ig1/yxTgsDIfW1cWDel5EBbOy3jdtQ==",
+  "_location": "/acorn",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "acorn@^7.0.0",
+    "name": "acorn",
+    "escapedName": "acorn",
+    "rawSpec": "^7.0.0",
+    "saveSpec": null,
+    "fetchSpec": "^7.0.0"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/acorn/-/acorn-7.0.0.tgz",
+  "_shasum": "26b8d1cd9a9b700350b71c0905546f64d1284e7a",
+  "_spec": "acorn@^7.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "bin": {
+    "acorn": "./bin/acorn"
+  },
+  "bugs": {
+    "url": "https://github.com/acornjs/acorn/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "ECMAScript parser",
+  "engines": {
+    "node": ">=0.4.0"
+  },
+  "homepage": "https://github.com/acornjs/acorn",
+  "license": "MIT",
+  "main": "dist/acorn.js",
+  "maintainers": [
+    {
+      "name": "Marijn Haverbeke",
+      "email": "marijnh@gmail.com",
+      "url": "https://marijnhaverbeke.nl"
+    },
+    {
+      "name": "Ingvar Stepanyan",
+      "email": "me@rreverser.com",
+      "url": "https://rreverser.com/"
+    },
+    {
+      "name": "Adrian Heine",
+      "url": "http://adrianheine.de"
+    }
+  ],
+  "module": "dist/acorn.mjs",
+  "name": "acorn",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/acornjs/acorn.git"
+  },
+  "scripts": {
+    "prepare": "cd ..; npm run build:main && npm run build:bin"
+  },
+  "version": "7.0.0"
+}
diff --git a/node_modules/ast-types/.travis.yml b/node_modules/ast-types/.travis.yml
new file mode 100644
index 0000000..68c03c4
--- /dev/null
+++ b/node_modules/ast-types/.travis.yml
@@ -0,0 +1,11 @@
+language: node_js
+node_js:
+  - "12"
+  - "11"
+  - "10"
+  - "9"
+  - "8"
+  - "7"
+  - "6"
+
+sudo: false
diff --git a/node_modules/ast-types/LICENSE b/node_modules/ast-types/LICENSE
new file mode 100644
index 0000000..3f9d40b
--- /dev/null
+++ b/node_modules/ast-types/LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2013 Ben Newman <bn@cs.stanford.edu>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/ast-types/README.md b/node_modules/ast-types/README.md
new file mode 100644
index 0000000..da799e0
--- /dev/null
+++ b/node_modules/ast-types/README.md
@@ -0,0 +1,511 @@
+# AST Types [![Build Status](https://travis-ci.org/benjamn/ast-types.svg?branch=master)](https://travis-ci.org/benjamn/ast-types) [![Greenkeeper badge](https://badges.greenkeeper.io/benjamn/ast-types.svg)](https://greenkeeper.io/)
+
+This module provides an efficient, modular,
+[Esprima](https://github.com/ariya/esprima)-compatible implementation of
+the [abstract syntax
+tree](http://en.wikipedia.org/wiki/Abstract_syntax_tree) type hierarchy
+pioneered by the [Mozilla Parser
+API](https://developer.mozilla.org/en-US/docs/SpiderMonkey/Parser_API).
+
+Installation
+---
+
+From NPM:
+
+    npm install ast-types
+
+From GitHub:
+
+    cd path/to/node_modules
+    git clone git://github.com/benjamn/ast-types.git
+    cd ast-types
+    npm install .
+
+Basic Usage
+---
+```js
+import assert from "assert";
+import {
+  namedTypes as n,
+  builders as b,
+} from "ast-types";
+
+var fooId = b.identifier("foo");
+var ifFoo = b.ifStatement(fooId, b.blockStatement([
+  b.expressionStatement(b.callExpression(fooId, []))
+]));
+
+assert.ok(n.IfStatement.check(ifFoo));
+assert.ok(n.Statement.check(ifFoo));
+assert.ok(n.Node.check(ifFoo));
+
+assert.ok(n.BlockStatement.check(ifFoo.consequent));
+assert.strictEqual(
+  ifFoo.consequent.body[0].expression.arguments.length,
+  0,
+);
+
+assert.strictEqual(ifFoo.test, fooId);
+assert.ok(n.Expression.check(ifFoo.test));
+assert.ok(n.Identifier.check(ifFoo.test));
+assert.ok(!n.Statement.check(ifFoo.test));
+```
+
+AST Traversal
+---
+
+Because it understands the AST type system so thoroughly, this library
+is able to provide excellent node iteration and traversal mechanisms.
+
+If you want complete control over the traversal, and all you need is a way
+of enumerating the known fields of your AST nodes and getting their
+values, you may be interested in the primitives `getFieldNames` and
+`getFieldValue`:
+```js
+import {
+  getFieldNames,
+  getFieldValue,
+} from "ast-types";
+
+const partialFunExpr = { type: "FunctionExpression" };
+
+// Even though partialFunExpr doesn't actually contain all the fields that
+// are expected for a FunctionExpression, types.getFieldNames knows:
+console.log(getFieldNames(partialFunExpr));
+// [ 'type', 'id', 'params', 'body', 'generator', 'expression',
+//   'defaults', 'rest', 'async' ]
+
+// For fields that have default values, types.getFieldValue will return
+// the default if the field is not actually defined.
+console.log(getFieldValue(partialFunExpr, "generator"));
+// false
+```
+
+Two more low-level helper functions, `eachField` and `someField`, are
+defined in terms of `getFieldNames` and `getFieldValue`:
+```js
+// Iterate over all defined fields of an object, including those missing
+// or undefined, passing each field name and effective value (as returned
+// by getFieldValue) to the callback. If the object has no corresponding
+// Def, the callback will never be called.
+export function eachField(object, callback, context) {
+  getFieldNames(object).forEach(function(name) {
+    callback.call(this, name, getFieldValue(object, name));
+  }, context);
+}
+
+// Similar to eachField, except that iteration stops as soon as the
+// callback returns a truthy value. Like Array.prototype.some, the final
+// result is either true or false to indicates whether the callback
+// returned true for any element or not.
+export function someField(object, callback, context) {
+  return getFieldNames(object).some(function(name) {
+    return callback.call(this, name, getFieldValue(object, name));
+  }, context);
+}
+```
+
+So here's how you might make a copy of an AST node:
+```js
+import { eachField } from "ast-types";
+const copy = {};
+eachField(node, function(name, value) {
+  // Note that undefined fields will be visited too, according to
+  // the rules associated with node.type, and default field values
+  // will be substituted if appropriate.
+  copy[name] = value;
+})
+```
+
+But that's not all! You can also easily visit entire syntax trees using
+the powerful `types.visit` abstraction.
+
+Here's a trivial example of how you might assert that `arguments.callee`
+is never used in `ast`:
+```js
+import assert from "assert";
+import {
+  visit,
+  namedTypes as n,
+} from "ast-types";
+
+visit(ast, {
+  // This method will be called for any node with .type "MemberExpression":
+  visitMemberExpression(path) {
+    // Visitor methods receive a single argument, a NodePath object
+    // wrapping the node of interest.
+    var node = path.node;
+
+    if (
+      n.Identifier.check(node.object) &&
+      node.object.name === "arguments" &&
+      n.Identifier.check(node.property)
+    ) {
+      assert.notStrictEqual(node.property.name, "callee");
+    }
+
+    // It's your responsibility to call this.traverse with some
+    // NodePath object (usually the one passed into the visitor
+    // method) before the visitor method returns, or return false to
+    // indicate that the traversal need not continue any further down
+    // this subtree.
+    this.traverse(path);
+  }
+});
+```
+
+Here's a slightly more involved example of transforming `...rest`
+parameters into browser-runnable ES5 JavaScript:
+
+```js
+import { builders as b, visit } from "ast-types";
+
+// Reuse the same AST structure for Array.prototype.slice.call.
+var sliceExpr = b.memberExpression(
+  b.memberExpression(
+    b.memberExpression(
+      b.identifier("Array"),
+      b.identifier("prototype"),
+      false
+    ),
+    b.identifier("slice"),
+    false
+  ),
+  b.identifier("call"),
+  false
+);
+
+visit(ast, {
+  // This method will be called for any node whose type is a subtype of
+  // Function (e.g., FunctionDeclaration, FunctionExpression, and
+  // ArrowFunctionExpression). Note that types.visit precomputes a
+  // lookup table from every known type to the appropriate visitor
+  // method to call for nodes of that type, so the dispatch takes
+  // constant time.
+  visitFunction(path) {
+    // Visitor methods receive a single argument, a NodePath object
+    // wrapping the node of interest.
+    const node = path.node;
+
+    // It's your responsibility to call this.traverse with some
+    // NodePath object (usually the one passed into the visitor
+    // method) before the visitor method returns, or return false to
+    // indicate that the traversal need not continue any further down
+    // this subtree. An assertion will fail if you forget, which is
+    // awesome, because it means you will never again make the
+    // disastrous mistake of forgetting to traverse a subtree. Also
+    // cool: because you can call this method at any point in the
+    // visitor method, it's up to you whether your traversal is
+    // pre-order, post-order, or both!
+    this.traverse(path);
+
+    // This traversal is only concerned with Function nodes that have
+    // rest parameters.
+    if (!node.rest) {
+      return;
+    }
+
+    // For the purposes of this example, we won't worry about functions
+    // with Expression bodies.
+    n.BlockStatement.assert(node.body);
+
+    // Use types.builders to build a variable declaration of the form
+    //
+    //   var rest = Array.prototype.slice.call(arguments, n);
+    //
+    // where `rest` is the name of the rest parameter, and `n` is a
+    // numeric literal specifying the number of named parameters the
+    // function takes.
+    const restVarDecl = b.variableDeclaration("var", [
+      b.variableDeclarator(
+        node.rest,
+        b.callExpression(sliceExpr, [
+          b.identifier("arguments"),
+          b.literal(node.params.length)
+        ])
+      )
+    ]);
+
+    // Similar to doing node.body.body.unshift(restVarDecl), except
+    // that the other NodePath objects wrapping body statements will
+    // have their indexes updated to accommodate the new statement.
+    path.get("body", "body").unshift(restVarDecl);
+
+    // Nullify node.rest now that we have simulated the behavior of
+    // the rest parameter using ordinary JavaScript.
+    path.get("rest").replace(null);
+
+    // There's nothing wrong with doing node.rest = null, but I wanted
+    // to point out that the above statement has the same effect.
+    assert.strictEqual(node.rest, null);
+  }
+});
+```
+
+Here's how you might use `types.visit` to implement a function that
+determines if a given function node refers to `this`:
+
+```js
+function usesThis(funcNode) {
+  n.Function.assert(funcNode);
+  var result = false;
+
+  visit(funcNode, {
+    visitThisExpression(path) {
+      result = true;
+
+      // The quickest way to terminate the traversal is to call
+      // this.abort(), which throws a special exception (instanceof
+      // this.AbortRequest) that will be caught in the top-level
+      // types.visit method, so you don't have to worry about
+      // catching the exception yourself.
+      this.abort();
+    },
+
+    visitFunction(path) {
+      // ThisExpression nodes in nested scopes don't count as `this`
+      // references for the original function node, so we can safely
+      // avoid traversing this subtree.
+      return false;
+    },
+
+    visitCallExpression(path) {
+      const node = path.node;
+
+      // If the function contains CallExpression nodes involving
+      // super, those expressions will implicitly depend on the
+      // value of `this`, even though they do not explicitly contain
+      // any ThisExpression nodes.
+      if (this.isSuperCallExpression(node)) {
+        result = true;
+        this.abort(); // Throws AbortRequest exception.
+      }
+
+      this.traverse(path);
+    },
+
+    // Yes, you can define arbitrary helper methods.
+    isSuperCallExpression(callExpr) {
+      n.CallExpression.assert(callExpr);
+      return this.isSuperIdentifier(callExpr.callee)
+          || this.isSuperMemberExpression(callExpr.callee);
+    },
+
+    // And even helper helper methods!
+    isSuperIdentifier(node) {
+      return n.Identifier.check(node.callee)
+          && node.callee.name === "super";
+    },
+
+    isSuperMemberExpression(node) {
+      return n.MemberExpression.check(node.callee)
+          && n.Identifier.check(node.callee.object)
+          && node.callee.object.name === "super";
+    }
+  });
+
+  return result;
+}
+```
+
+As you might guess, when an `AbortRequest` is thrown from a subtree, the
+exception will propagate from the corresponding calls to `this.traverse`
+in the ancestor visitor methods. If you decide you want to cancel the
+request, simply catch the exception and call its `.cancel()` method. The
+rest of the subtree beneath the `try`-`catch` block will be abandoned, but
+the remaining siblings of the ancestor node will still be visited.
+
+NodePath
+---
+
+The `NodePath` object passed to visitor methods is a wrapper around an AST
+node, and it serves to provide access to the chain of ancestor objects
+(all the way back to the root of the AST) and scope information.
+
+In general, `path.node` refers to the wrapped node, `path.parent.node`
+refers to the nearest `Node` ancestor, `path.parent.parent.node` to the
+grandparent, and so on.
+
+Note that `path.node` may not be a direct property value of
+`path.parent.node`; for instance, it might be the case that `path.node` is
+an element of an array that is a direct child of the parent node:
+```js
+path.node === path.parent.node.elements[3]
+```
+in which case you should know that `path.parentPath` provides
+finer-grained access to the complete path of objects (not just the `Node`
+ones) from the root of the AST:
+```js
+// In reality, path.parent is the grandparent of path:
+path.parentPath.parentPath === path.parent
+
+// The path.parentPath object wraps the elements array (note that we use
+// .value because the elements array is not a Node):
+path.parentPath.value === path.parent.node.elements
+
+// The path.node object is the fourth element in that array:
+path.parentPath.value[3] === path.node
+
+// Unlike path.node and path.value, which are synonyms because path.node
+// is a Node object, path.parentPath.node is distinct from
+// path.parentPath.value, because the elements array is not a
+// Node. Instead, path.parentPath.node refers to the closest ancestor
+// Node, which happens to be the same as path.parent.node:
+path.parentPath.node === path.parent.node
+
+// The path is named for its index in the elements array:
+path.name === 3
+
+// Likewise, path.parentPath is named for the property by which
+// path.parent.node refers to it:
+path.parentPath.name === "elements"
+
+// Putting it all together, we can follow the chain of object references
+// from path.parent.node all the way to path.node by accessing each
+// property by name:
+path.parent.node[path.parentPath.name][path.name] === path.node
+```
+
+These `NodePath` objects are created during the traversal without
+modifying the AST nodes themselves, so it's not a problem if the same node
+appears more than once in the AST (like `Array.prototype.slice.call` in
+the example above), because it will be visited with a distict `NodePath`
+each time it appears.
+
+Child `NodePath` objects are created lazily, by calling the `.get` method
+of a parent `NodePath` object:
+```js
+// If a NodePath object for the elements array has never been created
+// before, it will be created here and cached in the future:
+path.get("elements").get(3).value === path.value.elements[3]
+
+// Alternatively, you can pass multiple property names to .get instead of
+// chaining multiple .get calls:
+path.get("elements", 0).value === path.value.elements[0]
+```
+
+`NodePath` objects support a number of useful methods:
+```js
+// Replace one node with another node:
+var fifth = path.get("elements", 4);
+fifth.replace(newNode);
+
+// Now do some stuff that might rearrange the list, and this replacement
+// remains safe:
+fifth.replace(newerNode);
+
+// Replace the third element in an array with two new nodes:
+path.get("elements", 2).replace(
+  b.identifier("foo"),
+  b.thisExpression()
+);
+
+// Remove a node and its parent if it would leave a redundant AST node:
+//e.g. var t = 1, y =2; removing the `t` and `y` declarators results in `var undefined`.
+path.prune(); //returns the closest parent `NodePath`.
+
+// Remove a node from a list of nodes:
+path.get("elements", 3).replace();
+
+// Add three new nodes to the beginning of a list of nodes:
+path.get("elements").unshift(a, b, c);
+
+// Remove and return the first node in a list of nodes:
+path.get("elements").shift();
+
+// Push two new nodes onto the end of a list of nodes:
+path.get("elements").push(d, e);
+
+// Remove and return the last node in a list of nodes:
+path.get("elements").pop();
+
+// Insert a new node before/after the seventh node in a list of nodes:
+var seventh = path.get("elements", 6);
+seventh.insertBefore(newNode);
+seventh.insertAfter(newNode);
+
+// Insert a new element at index 5 in a list of nodes:
+path.get("elements").insertAt(5, newNode);
+```
+
+Scope
+---
+
+The object exposed as `path.scope` during AST traversals provides
+information about variable and function declarations in the scope that
+contains `path.node`. See [scope.ts](lib/scope.ts) for its public
+interface, which currently includes `.isGlobal`, `.getGlobalScope()`,
+`.depth`, `.declares(name)`, `.lookup(name)`, and `.getBindings()`.
+
+Custom AST Node Types
+---
+
+The `ast-types` module was designed to be extended. To that end, it
+provides a readable, declarative syntax for specifying new AST node types,
+based primarily upon the `require("ast-types").Type.def` function:
+```js
+import {
+  Type,
+  builtInTypes,
+  builders as b,
+  finalize,
+} from "ast-types";
+
+const { def } = Type;
+const { string } = builtInTypes;
+
+// Suppose you need a named File type to wrap your Programs.
+def("File")
+  .bases("Node")
+  .build("name", "program")
+  .field("name", string)
+  .field("program", def("Program"));
+
+// Prevent further modifications to the File type (and any other
+// types newly introduced by def(...)).
+finalize();
+
+// The b.file builder function is now available. It expects two
+// arguments, as named by .build("name", "program") above.
+const main = b.file("main.js", b.program([
+  // Pointless program contents included for extra color.
+  b.functionDeclaration(b.identifier("succ"), [
+    b.identifier("x")
+  ], b.blockStatement([
+    b.returnStatement(
+      b.binaryExpression(
+        "+", b.identifier("x"), b.literal(1)
+      )
+    )
+  ]))
+]));
+
+assert.strictEqual(main.name, "main.js");
+assert.strictEqual(main.program.body[0].params[0].name, "x");
+// etc.
+
+// If you pass the wrong type of arguments, or fail to pass enough
+// arguments, an AssertionError will be thrown.
+
+b.file(b.blockStatement([]));
+// ==> AssertionError: {"body":[],"type":"BlockStatement","loc":null} does not match type string
+
+b.file("lib/types.js", b.thisExpression());
+// ==> AssertionError: {"type":"ThisExpression","loc":null} does not match type Program
+```
+
+The `def` syntax is used to define all the default AST node types found in
+[babel-core.ts](def/babel-core.ts),
+[babel.ts](def/babel.ts),
+[core.ts](def/core.ts),
+[es-proposals.ts](def/es-proposals.ts),
+[es6.ts](def/es6.ts),
+[es7.ts](def/es7.ts),
+[esprima.ts](def/esprima.ts),
+[flow.ts](def/flow.ts),
+[jsx.ts](def/jsx.ts),
+[type-annotations.ts](def/type-annotations.ts),
+and
+[typescripts.ts](def/typescripts.ts),
+so you have
+no shortage of examples to learn from.
diff --git a/node_modules/ast-types/def/babel-core.d.ts b/node_modules/ast-types/def/babel-core.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/babel-core.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/babel-core.js b/node_modules/ast-types/def/babel-core.js
new file mode 100644
index 0000000..d97c7c0
--- /dev/null
+++ b/node_modules/ast-types/def/babel-core.js
@@ -0,0 +1,258 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+var es7_1 = __importDefault(require("./es7"));
+function default_1(fork) {
+    fork.use(es7_1.default);
+    var types = fork.use(types_1.default);
+    var defaults = fork.use(shared_1.default).defaults;
+    var def = types.Type.def;
+    var or = types.Type.or;
+    def("Noop")
+        .bases("Statement")
+        .build();
+    def("DoExpression")
+        .bases("Expression")
+        .build("body")
+        .field("body", [def("Statement")]);
+    def("Super")
+        .bases("Expression")
+        .build();
+    def("BindExpression")
+        .bases("Expression")
+        .build("object", "callee")
+        .field("object", or(def("Expression"), null))
+        .field("callee", def("Expression"));
+    def("Decorator")
+        .bases("Node")
+        .build("expression")
+        .field("expression", def("Expression"));
+    def("Property")
+        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+    def("MethodDefinition")
+        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+    def("MetaProperty")
+        .bases("Expression")
+        .build("meta", "property")
+        .field("meta", def("Identifier"))
+        .field("property", def("Identifier"));
+    def("ParenthesizedExpression")
+        .bases("Expression")
+        .build("expression")
+        .field("expression", def("Expression"));
+    def("ImportSpecifier")
+        .bases("ModuleSpecifier")
+        .build("imported", "local")
+        .field("imported", def("Identifier"));
+    def("ImportDefaultSpecifier")
+        .bases("ModuleSpecifier")
+        .build("local");
+    def("ImportNamespaceSpecifier")
+        .bases("ModuleSpecifier")
+        .build("local");
+    def("ExportDefaultDeclaration")
+        .bases("Declaration")
+        .build("declaration")
+        .field("declaration", or(def("Declaration"), def("Expression")));
+    def("ExportNamedDeclaration")
+        .bases("Declaration")
+        .build("declaration", "specifiers", "source")
+        .field("declaration", or(def("Declaration"), null))
+        .field("specifiers", [def("ExportSpecifier")], defaults.emptyArray)
+        .field("source", or(def("Literal"), null), defaults["null"]);
+    def("ExportSpecifier")
+        .bases("ModuleSpecifier")
+        .build("local", "exported")
+        .field("exported", def("Identifier"));
+    def("ExportNamespaceSpecifier")
+        .bases("Specifier")
+        .build("exported")
+        .field("exported", def("Identifier"));
+    def("ExportDefaultSpecifier")
+        .bases("Specifier")
+        .build("exported")
+        .field("exported", def("Identifier"));
+    def("ExportAllDeclaration")
+        .bases("Declaration")
+        .build("exported", "source")
+        .field("exported", or(def("Identifier"), null))
+        .field("source", def("Literal"));
+    def("CommentBlock")
+        .bases("Comment")
+        .build("value", /*optional:*/ "leading", "trailing");
+    def("CommentLine")
+        .bases("Comment")
+        .build("value", /*optional:*/ "leading", "trailing");
+    def("Directive")
+        .bases("Node")
+        .build("value")
+        .field("value", def("DirectiveLiteral"));
+    def("DirectiveLiteral")
+        .bases("Node", "Expression")
+        .build("value")
+        .field("value", String, defaults["use strict"]);
+    def("InterpreterDirective")
+        .bases("Node")
+        .build("value")
+        .field("value", String);
+    def("BlockStatement")
+        .bases("Statement")
+        .build("body")
+        .field("body", [def("Statement")])
+        .field("directives", [def("Directive")], defaults.emptyArray);
+    def("Program")
+        .bases("Node")
+        .build("body")
+        .field("body", [def("Statement")])
+        .field("directives", [def("Directive")], defaults.emptyArray)
+        .field("interpreter", or(def("InterpreterDirective"), null), defaults["null"]);
+    // Split Literal
+    def("StringLiteral")
+        .bases("Literal")
+        .build("value")
+        .field("value", String);
+    def("NumericLiteral")
+        .bases("Literal")
+        .build("value")
+        .field("value", Number)
+        .field("raw", or(String, null), defaults["null"])
+        .field("extra", {
+        rawValue: Number,
+        raw: String
+    }, function getDefault() {
+        return {
+            rawValue: this.value,
+            raw: this.value + ""
+        };
+    });
+    def("BigIntLiteral")
+        .bases("Literal")
+        .build("value")
+        // Only String really seems appropriate here, since BigInt values
+        // often exceed the limits of JS numbers.
+        .field("value", or(String, Number))
+        .field("extra", {
+        rawValue: String,
+        raw: String
+    }, function getDefault() {
+        return {
+            rawValue: String(this.value),
+            raw: this.value + "n"
+        };
+    });
+    def("NullLiteral")
+        .bases("Literal")
+        .build()
+        .field("value", null, defaults["null"]);
+    def("BooleanLiteral")
+        .bases("Literal")
+        .build("value")
+        .field("value", Boolean);
+    def("RegExpLiteral")
+        .bases("Literal")
+        .build("pattern", "flags")
+        .field("pattern", String)
+        .field("flags", String)
+        .field("value", RegExp, function () {
+        return new RegExp(this.pattern, this.flags);
+    });
+    var ObjectExpressionProperty = or(def("Property"), def("ObjectMethod"), def("ObjectProperty"), def("SpreadProperty"), def("SpreadElement"));
+    // Split Property -> ObjectProperty and ObjectMethod
+    def("ObjectExpression")
+        .bases("Expression")
+        .build("properties")
+        .field("properties", [ObjectExpressionProperty]);
+    // ObjectMethod hoist .value properties to own properties
+    def("ObjectMethod")
+        .bases("Node", "Function")
+        .build("kind", "key", "params", "body", "computed")
+        .field("kind", or("method", "get", "set"))
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+        .field("params", [def("Pattern")])
+        .field("body", def("BlockStatement"))
+        .field("computed", Boolean, defaults["false"])
+        .field("generator", Boolean, defaults["false"])
+        .field("async", Boolean, defaults["false"])
+        .field("accessibility", // TypeScript
+    or(def("Literal"), null), defaults["null"])
+        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+    def("ObjectProperty")
+        .bases("Node")
+        .build("key", "value")
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+        .field("value", or(def("Expression"), def("Pattern")))
+        .field("accessibility", // TypeScript
+    or(def("Literal"), null), defaults["null"])
+        .field("computed", Boolean, defaults["false"]);
+    var ClassBodyElement = or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"), def("ClassPrivateProperty"), def("ClassMethod"), def("ClassPrivateMethod"));
+    // MethodDefinition -> ClassMethod
+    def("ClassBody")
+        .bases("Declaration")
+        .build("body")
+        .field("body", [ClassBodyElement]);
+    def("ClassMethod")
+        .bases("Declaration", "Function")
+        .build("kind", "key", "params", "body", "computed", "static")
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")));
+    def("ClassPrivateMethod")
+        .bases("Declaration", "Function")
+        .build("key", "params", "body", "kind", "computed", "static")
+        .field("key", def("PrivateName"));
+    ["ClassMethod",
+        "ClassPrivateMethod",
+    ].forEach(function (typeName) {
+        def(typeName)
+            .field("kind", or("get", "set", "method", "constructor"), function () { return "method"; })
+            .field("body", def("BlockStatement"))
+            .field("computed", Boolean, defaults["false"])
+            .field("static", or(Boolean, null), defaults["null"])
+            .field("abstract", or(Boolean, null), defaults["null"])
+            .field("access", or("public", "private", "protected", null), defaults["null"])
+            .field("accessibility", or("public", "private", "protected", null), defaults["null"])
+            .field("decorators", or([def("Decorator")], null), defaults["null"])
+            .field("optional", or(Boolean, null), defaults["null"]);
+    });
+    def("ClassPrivateProperty")
+        .bases("ClassProperty")
+        .build("key", "value")
+        .field("key", def("PrivateName"))
+        .field("value", or(def("Expression"), null), defaults["null"]);
+    def("PrivateName")
+        .bases("Expression", "Pattern")
+        .build("id")
+        .field("id", def("Identifier"));
+    var ObjectPatternProperty = or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"), def("SpreadProperty"), // Used by Esprima
+    def("ObjectProperty"), // Babel 6
+    def("RestProperty") // Babel 6
+    );
+    // Split into RestProperty and SpreadProperty
+    def("ObjectPattern")
+        .bases("Pattern")
+        .build("properties")
+        .field("properties", [ObjectPatternProperty])
+        .field("decorators", or([def("Decorator")], null), defaults["null"]);
+    def("SpreadProperty")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("Expression"));
+    def("RestProperty")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("Expression"));
+    def("ForAwaitStatement")
+        .bases("Statement")
+        .build("left", "right", "body")
+        .field("left", or(def("VariableDeclaration"), def("Expression")))
+        .field("right", def("Expression"))
+        .field("body", def("Statement"));
+    // The callee node of a dynamic import(...) expression.
+    def("Import")
+        .bases("Expression")
+        .build();
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/babel.d.ts b/node_modules/ast-types/def/babel.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/babel.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/babel.js b/node_modules/ast-types/def/babel.js
new file mode 100644
index 0000000..5a9816a
--- /dev/null
+++ b/node_modules/ast-types/def/babel.js
@@ -0,0 +1,13 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var babel_core_1 = __importDefault(require("./babel-core"));
+var flow_1 = __importDefault(require("./flow"));
+function default_1(fork) {
+    fork.use(babel_core_1.default);
+    fork.use(flow_1.default);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/core.d.ts b/node_modules/ast-types/def/core.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/core.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/core.js b/node_modules/ast-types/def/core.js
new file mode 100644
index 0000000..a2aa9e5
--- /dev/null
+++ b/node_modules/ast-types/def/core.js
@@ -0,0 +1,300 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    var types = fork.use(types_1.default);
+    var Type = types.Type;
+    var def = Type.def;
+    var or = Type.or;
+    var shared = fork.use(shared_1.default);
+    var defaults = shared.defaults;
+    var geq = shared.geq;
+    // Abstract supertype of all syntactic entities that are allowed to have a
+    // .loc field.
+    def("Printable")
+        .field("loc", or(def("SourceLocation"), null), defaults["null"], true);
+    def("Node")
+        .bases("Printable")
+        .field("type", String)
+        .field("comments", or([def("Comment")], null), defaults["null"], true);
+    def("SourceLocation")
+        .field("start", def("Position"))
+        .field("end", def("Position"))
+        .field("source", or(String, null), defaults["null"]);
+    def("Position")
+        .field("line", geq(1))
+        .field("column", geq(0));
+    def("File")
+        .bases("Node")
+        .build("program", "name")
+        .field("program", def("Program"))
+        .field("name", or(String, null), defaults["null"]);
+    def("Program")
+        .bases("Node")
+        .build("body")
+        .field("body", [def("Statement")]);
+    def("Function")
+        .bases("Node")
+        .field("id", or(def("Identifier"), null), defaults["null"])
+        .field("params", [def("Pattern")])
+        .field("body", def("BlockStatement"))
+        .field("generator", Boolean, defaults["false"])
+        .field("async", Boolean, defaults["false"]);
+    def("Statement").bases("Node");
+    // The empty .build() here means that an EmptyStatement can be constructed
+    // (i.e. it's not abstract) but that it needs no arguments.
+    def("EmptyStatement").bases("Statement").build();
+    def("BlockStatement")
+        .bases("Statement")
+        .build("body")
+        .field("body", [def("Statement")]);
+    // TODO Figure out how to silently coerce Expressions to
+    // ExpressionStatements where a Statement was expected.
+    def("ExpressionStatement")
+        .bases("Statement")
+        .build("expression")
+        .field("expression", def("Expression"));
+    def("IfStatement")
+        .bases("Statement")
+        .build("test", "consequent", "alternate")
+        .field("test", def("Expression"))
+        .field("consequent", def("Statement"))
+        .field("alternate", or(def("Statement"), null), defaults["null"]);
+    def("LabeledStatement")
+        .bases("Statement")
+        .build("label", "body")
+        .field("label", def("Identifier"))
+        .field("body", def("Statement"));
+    def("BreakStatement")
+        .bases("Statement")
+        .build("label")
+        .field("label", or(def("Identifier"), null), defaults["null"]);
+    def("ContinueStatement")
+        .bases("Statement")
+        .build("label")
+        .field("label", or(def("Identifier"), null), defaults["null"]);
+    def("WithStatement")
+        .bases("Statement")
+        .build("object", "body")
+        .field("object", def("Expression"))
+        .field("body", def("Statement"));
+    def("SwitchStatement")
+        .bases("Statement")
+        .build("discriminant", "cases", "lexical")
+        .field("discriminant", def("Expression"))
+        .field("cases", [def("SwitchCase")])
+        .field("lexical", Boolean, defaults["false"]);
+    def("ReturnStatement")
+        .bases("Statement")
+        .build("argument")
+        .field("argument", or(def("Expression"), null));
+    def("ThrowStatement")
+        .bases("Statement")
+        .build("argument")
+        .field("argument", def("Expression"));
+    def("TryStatement")
+        .bases("Statement")
+        .build("block", "handler", "finalizer")
+        .field("block", def("BlockStatement"))
+        .field("handler", or(def("CatchClause"), null), function () {
+        return this.handlers && this.handlers[0] || null;
+    })
+        .field("handlers", [def("CatchClause")], function () {
+        return this.handler ? [this.handler] : [];
+    }, true) // Indicates this field is hidden from eachField iteration.
+        .field("guardedHandlers", [def("CatchClause")], defaults.emptyArray)
+        .field("finalizer", or(def("BlockStatement"), null), defaults["null"]);
+    def("CatchClause")
+        .bases("Node")
+        .build("param", "guard", "body")
+        // https://github.com/tc39/proposal-optional-catch-binding
+        .field("param", or(def("Pattern"), null), defaults["null"])
+        .field("guard", or(def("Expression"), null), defaults["null"])
+        .field("body", def("BlockStatement"));
+    def("WhileStatement")
+        .bases("Statement")
+        .build("test", "body")
+        .field("test", def("Expression"))
+        .field("body", def("Statement"));
+    def("DoWhileStatement")
+        .bases("Statement")
+        .build("body", "test")
+        .field("body", def("Statement"))
+        .field("test", def("Expression"));
+    def("ForStatement")
+        .bases("Statement")
+        .build("init", "test", "update", "body")
+        .field("init", or(def("VariableDeclaration"), def("Expression"), null))
+        .field("test", or(def("Expression"), null))
+        .field("update", or(def("Expression"), null))
+        .field("body", def("Statement"));
+    def("ForInStatement")
+        .bases("Statement")
+        .build("left", "right", "body")
+        .field("left", or(def("VariableDeclaration"), def("Expression")))
+        .field("right", def("Expression"))
+        .field("body", def("Statement"));
+    def("DebuggerStatement").bases("Statement").build();
+    def("Declaration").bases("Statement");
+    def("FunctionDeclaration")
+        .bases("Function", "Declaration")
+        .build("id", "params", "body")
+        .field("id", def("Identifier"));
+    def("FunctionExpression")
+        .bases("Function", "Expression")
+        .build("id", "params", "body");
+    def("VariableDeclaration")
+        .bases("Declaration")
+        .build("kind", "declarations")
+        .field("kind", or("var", "let", "const"))
+        .field("declarations", [def("VariableDeclarator")]);
+    def("VariableDeclarator")
+        .bases("Node")
+        .build("id", "init")
+        .field("id", def("Pattern"))
+        .field("init", or(def("Expression"), null), defaults["null"]);
+    def("Expression").bases("Node");
+    def("ThisExpression").bases("Expression").build();
+    def("ArrayExpression")
+        .bases("Expression")
+        .build("elements")
+        .field("elements", [or(def("Expression"), null)]);
+    def("ObjectExpression")
+        .bases("Expression")
+        .build("properties")
+        .field("properties", [def("Property")]);
+    // TODO Not in the Mozilla Parser API, but used by Esprima.
+    def("Property")
+        .bases("Node") // Want to be able to visit Property Nodes.
+        .build("kind", "key", "value")
+        .field("kind", or("init", "get", "set"))
+        .field("key", or(def("Literal"), def("Identifier")))
+        .field("value", def("Expression"));
+    def("SequenceExpression")
+        .bases("Expression")
+        .build("expressions")
+        .field("expressions", [def("Expression")]);
+    var UnaryOperator = or("-", "+", "!", "~", "typeof", "void", "delete");
+    def("UnaryExpression")
+        .bases("Expression")
+        .build("operator", "argument", "prefix")
+        .field("operator", UnaryOperator)
+        .field("argument", def("Expression"))
+        // Esprima doesn't bother with this field, presumably because it's
+        // always true for unary operators.
+        .field("prefix", Boolean, defaults["true"]);
+    var BinaryOperator = or("==", "!=", "===", "!==", "<", "<=", ">", ">=", "<<", ">>", ">>>", "+", "-", "*", "/", "%", "**", "&", // TODO Missing from the Parser API.
+    "|", "^", "in", "instanceof");
+    def("BinaryExpression")
+        .bases("Expression")
+        .build("operator", "left", "right")
+        .field("operator", BinaryOperator)
+        .field("left", def("Expression"))
+        .field("right", def("Expression"));
+    var AssignmentOperator = or("=", "+=", "-=", "*=", "/=", "%=", "<<=", ">>=", ">>>=", "|=", "^=", "&=");
+    def("AssignmentExpression")
+        .bases("Expression")
+        .build("operator", "left", "right")
+        .field("operator", AssignmentOperator)
+        .field("left", or(def("Pattern"), def("MemberExpression")))
+        .field("right", def("Expression"));
+    var UpdateOperator = or("++", "--");
+    def("UpdateExpression")
+        .bases("Expression")
+        .build("operator", "argument", "prefix")
+        .field("operator", UpdateOperator)
+        .field("argument", def("Expression"))
+        .field("prefix", Boolean);
+    var LogicalOperator = or("||", "&&");
+    def("LogicalExpression")
+        .bases("Expression")
+        .build("operator", "left", "right")
+        .field("operator", LogicalOperator)
+        .field("left", def("Expression"))
+        .field("right", def("Expression"));
+    def("ConditionalExpression")
+        .bases("Expression")
+        .build("test", "consequent", "alternate")
+        .field("test", def("Expression"))
+        .field("consequent", def("Expression"))
+        .field("alternate", def("Expression"));
+    def("NewExpression")
+        .bases("Expression")
+        .build("callee", "arguments")
+        .field("callee", def("Expression"))
+        // The Mozilla Parser API gives this type as [or(def("Expression"),
+        // null)], but null values don't really make sense at the call site.
+        // TODO Report this nonsense.
+        .field("arguments", [def("Expression")]);
+    def("CallExpression")
+        .bases("Expression")
+        .build("callee", "arguments")
+        .field("callee", def("Expression"))
+        // See comment for NewExpression above.
+        .field("arguments", [def("Expression")]);
+    def("MemberExpression")
+        .bases("Expression")
+        .build("object", "property", "computed")
+        .field("object", def("Expression"))
+        .field("property", or(def("Identifier"), def("Expression")))
+        .field("computed", Boolean, function () {
+        var type = this.property.type;
+        if (type === 'Literal' ||
+            type === 'MemberExpression' ||
+            type === 'BinaryExpression') {
+            return true;
+        }
+        return false;
+    });
+    def("Pattern").bases("Node");
+    def("SwitchCase")
+        .bases("Node")
+        .build("test", "consequent")
+        .field("test", or(def("Expression"), null))
+        .field("consequent", [def("Statement")]);
+    def("Identifier")
+        .bases("Expression", "Pattern")
+        .build("name")
+        .field("name", String)
+        .field("optional", Boolean, defaults["false"]);
+    def("Literal")
+        .bases("Expression")
+        .build("value")
+        .field("value", or(String, Boolean, null, Number, RegExp))
+        .field("regex", or({
+        pattern: String,
+        flags: String
+    }, null), function () {
+        if (this.value instanceof RegExp) {
+            var flags = "";
+            if (this.value.ignoreCase)
+                flags += "i";
+            if (this.value.multiline)
+                flags += "m";
+            if (this.value.global)
+                flags += "g";
+            return {
+                pattern: this.value.source,
+                flags: flags
+            };
+        }
+        return null;
+    });
+    // Abstract (non-buildable) comment supertype. Not a Node.
+    def("Comment")
+        .bases("Printable")
+        .field("value", String)
+        // A .leading comment comes before the node, whereas a .trailing
+        // comment comes after it. These two fields should not both be true,
+        // but they might both be false when the comment falls inside a node
+        // and the node has no children for the comment to lead or trail,
+        // e.g. { /*dangling*/ }.
+        .field("leading", Boolean, defaults["true"])
+        .field("trailing", Boolean, defaults["false"]);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/es-proposals.d.ts b/node_modules/ast-types/def/es-proposals.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/es-proposals.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/es-proposals.js b/node_modules/ast-types/def/es-proposals.js
new file mode 100644
index 0000000..a9431d6
--- /dev/null
+++ b/node_modules/ast-types/def/es-proposals.js
@@ -0,0 +1,35 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+var core_1 = __importDefault(require("./core"));
+function default_1(fork) {
+    fork.use(core_1.default);
+    var types = fork.use(types_1.default);
+    var Type = types.Type;
+    var def = types.Type.def;
+    var or = Type.or;
+    var shared = fork.use(shared_1.default);
+    var defaults = shared.defaults;
+    // https://github.com/tc39/proposal-optional-chaining
+    // `a?.b` as per https://github.com/estree/estree/issues/146
+    def("OptionalMemberExpression")
+        .bases("MemberExpression")
+        .build("object", "property", "computed", "optional")
+        .field("optional", Boolean, defaults["true"]);
+    // a?.b()
+    def("OptionalCallExpression")
+        .bases("CallExpression")
+        .build("callee", "arguments", "optional")
+        .field("optional", Boolean, defaults["true"]);
+    // https://github.com/tc39/proposal-nullish-coalescing
+    // `a ?? b` as per https://github.com/babel/babylon/pull/761/files
+    var LogicalOperator = or("||", "&&", "??");
+    def("LogicalExpression")
+        .field("operator", LogicalOperator);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/es6.d.ts b/node_modules/ast-types/def/es6.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/es6.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/es6.js b/node_modules/ast-types/def/es6.js
new file mode 100644
index 0000000..56291af
--- /dev/null
+++ b/node_modules/ast-types/def/es6.js
@@ -0,0 +1,212 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var core_1 = __importDefault(require("./core"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    fork.use(core_1.default);
+    var types = fork.use(types_1.default);
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    def("Function")
+        .field("generator", Boolean, defaults["false"])
+        .field("expression", Boolean, defaults["false"])
+        .field("defaults", [or(def("Expression"), null)], defaults.emptyArray)
+        // TODO This could be represented as a RestElement in .params.
+        .field("rest", or(def("Identifier"), null), defaults["null"]);
+    // The ESTree way of representing a ...rest parameter.
+    def("RestElement")
+        .bases("Pattern")
+        .build("argument")
+        .field("argument", def("Pattern"))
+        .field("typeAnnotation", // for Babylon. Flow parser puts it on the identifier
+    or(def("TypeAnnotation"), def("TSTypeAnnotation"), null), defaults["null"]);
+    def("SpreadElementPattern")
+        .bases("Pattern")
+        .build("argument")
+        .field("argument", def("Pattern"));
+    def("FunctionDeclaration")
+        .build("id", "params", "body", "generator", "expression");
+    def("FunctionExpression")
+        .build("id", "params", "body", "generator", "expression");
+    // The Parser API calls this ArrowExpression, but Esprima and all other
+    // actual parsers use ArrowFunctionExpression.
+    def("ArrowFunctionExpression")
+        .bases("Function", "Expression")
+        .build("params", "body", "expression")
+        // The forced null value here is compatible with the overridden
+        // definition of the "id" field in the Function interface.
+        .field("id", null, defaults["null"])
+        // Arrow function bodies are allowed to be expressions.
+        .field("body", or(def("BlockStatement"), def("Expression")))
+        // The current spec forbids arrow generators, so I have taken the
+        // liberty of enforcing that. TODO Report this.
+        .field("generator", false, defaults["false"]);
+    def("ForOfStatement")
+        .bases("Statement")
+        .build("left", "right", "body")
+        .field("left", or(def("VariableDeclaration"), def("Pattern")))
+        .field("right", def("Expression"))
+        .field("body", def("Statement"));
+    def("YieldExpression")
+        .bases("Expression")
+        .build("argument", "delegate")
+        .field("argument", or(def("Expression"), null))
+        .field("delegate", Boolean, defaults["false"]);
+    def("GeneratorExpression")
+        .bases("Expression")
+        .build("body", "blocks", "filter")
+        .field("body", def("Expression"))
+        .field("blocks", [def("ComprehensionBlock")])
+        .field("filter", or(def("Expression"), null));
+    def("ComprehensionExpression")
+        .bases("Expression")
+        .build("body", "blocks", "filter")
+        .field("body", def("Expression"))
+        .field("blocks", [def("ComprehensionBlock")])
+        .field("filter", or(def("Expression"), null));
+    def("ComprehensionBlock")
+        .bases("Node")
+        .build("left", "right", "each")
+        .field("left", def("Pattern"))
+        .field("right", def("Expression"))
+        .field("each", Boolean);
+    def("Property")
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+        .field("value", or(def("Expression"), def("Pattern")))
+        .field("method", Boolean, defaults["false"])
+        .field("shorthand", Boolean, defaults["false"])
+        .field("computed", Boolean, defaults["false"]);
+    def("ObjectProperty")
+        .field("shorthand", Boolean, defaults["false"]);
+    def("PropertyPattern")
+        .bases("Pattern")
+        .build("key", "pattern")
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+        .field("pattern", def("Pattern"))
+        .field("computed", Boolean, defaults["false"]);
+    def("ObjectPattern")
+        .bases("Pattern")
+        .build("properties")
+        .field("properties", [or(def("PropertyPattern"), def("Property"))]);
+    def("ArrayPattern")
+        .bases("Pattern")
+        .build("elements")
+        .field("elements", [or(def("Pattern"), null)]);
+    def("MethodDefinition")
+        .bases("Declaration")
+        .build("kind", "key", "value", "static")
+        .field("kind", or("constructor", "method", "get", "set"))
+        .field("key", def("Expression"))
+        .field("value", def("Function"))
+        .field("computed", Boolean, defaults["false"])
+        .field("static", Boolean, defaults["false"]);
+    def("SpreadElement")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("Expression"));
+    def("ArrayExpression")
+        .field("elements", [or(def("Expression"), def("SpreadElement"), def("RestElement"), null)]);
+    def("NewExpression")
+        .field("arguments", [or(def("Expression"), def("SpreadElement"))]);
+    def("CallExpression")
+        .field("arguments", [or(def("Expression"), def("SpreadElement"))]);
+    // Note: this node type is *not* an AssignmentExpression with a Pattern on
+    // the left-hand side! The existing AssignmentExpression type already
+    // supports destructuring assignments. AssignmentPattern nodes may appear
+    // wherever a Pattern is allowed, and the right-hand side represents a
+    // default value to be destructured against the left-hand side, if no
+    // value is otherwise provided. For example: default parameter values.
+    def("AssignmentPattern")
+        .bases("Pattern")
+        .build("left", "right")
+        .field("left", def("Pattern"))
+        .field("right", def("Expression"));
+    var ClassBodyElement = or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"));
+    def("ClassProperty")
+        .bases("Declaration")
+        .build("key")
+        .field("key", or(def("Literal"), def("Identifier"), def("Expression")))
+        .field("computed", Boolean, defaults["false"]);
+    def("ClassPropertyDefinition") // static property
+        .bases("Declaration")
+        .build("definition")
+        // Yes, Virginia, circular definitions are permitted.
+        .field("definition", ClassBodyElement);
+    def("ClassBody")
+        .bases("Declaration")
+        .build("body")
+        .field("body", [ClassBodyElement]);
+    def("ClassDeclaration")
+        .bases("Declaration")
+        .build("id", "body", "superClass")
+        .field("id", or(def("Identifier"), null))
+        .field("body", def("ClassBody"))
+        .field("superClass", or(def("Expression"), null), defaults["null"]);
+    def("ClassExpression")
+        .bases("Expression")
+        .build("id", "body", "superClass")
+        .field("id", or(def("Identifier"), null), defaults["null"])
+        .field("body", def("ClassBody"))
+        .field("superClass", or(def("Expression"), null), defaults["null"]);
+    // Specifier and ModuleSpecifier are abstract non-standard types
+    // introduced for definitional convenience.
+    def("Specifier").bases("Node");
+    // This supertype is shared/abused by both def/babel.js and
+    // def/esprima.js. In the future, it will be possible to load only one set
+    // of definitions appropriate for a given parser, but until then we must
+    // rely on default functions to reconcile the conflicting AST formats.
+    def("ModuleSpecifier")
+        .bases("Specifier")
+        // This local field is used by Babel/Acorn. It should not technically
+        // be optional in the Babel/Acorn AST format, but it must be optional
+        // in the Esprima AST format.
+        .field("local", or(def("Identifier"), null), defaults["null"])
+        // The id and name fields are used by Esprima. The id field should not
+        // technically be optional in the Esprima AST format, but it must be
+        // optional in the Babel/Acorn AST format.
+        .field("id", or(def("Identifier"), null), defaults["null"])
+        .field("name", or(def("Identifier"), null), defaults["null"]);
+    // Like ModuleSpecifier, except type:"ImportSpecifier" and buildable.
+    // import {<id [as name]>} from ...;
+    def("ImportSpecifier")
+        .bases("ModuleSpecifier")
+        .build("id", "name");
+    // import <* as id> from ...;
+    def("ImportNamespaceSpecifier")
+        .bases("ModuleSpecifier")
+        .build("id");
+    // import <id> from ...;
+    def("ImportDefaultSpecifier")
+        .bases("ModuleSpecifier")
+        .build("id");
+    def("ImportDeclaration")
+        .bases("Declaration")
+        .build("specifiers", "source", "importKind")
+        .field("specifiers", [or(def("ImportSpecifier"), def("ImportNamespaceSpecifier"), def("ImportDefaultSpecifier"))], defaults.emptyArray)
+        .field("source", def("Literal"))
+        .field("importKind", or("value", "type"), function () {
+        return "value";
+    });
+    def("TaggedTemplateExpression")
+        .bases("Expression")
+        .build("tag", "quasi")
+        .field("tag", def("Expression"))
+        .field("quasi", def("TemplateLiteral"));
+    def("TemplateLiteral")
+        .bases("Expression")
+        .build("quasis", "expressions")
+        .field("quasis", [def("TemplateElement")])
+        .field("expressions", [def("Expression")]);
+    def("TemplateElement")
+        .bases("Node")
+        .build("value", "tail")
+        .field("value", { "cooked": String, "raw": String })
+        .field("tail", Boolean);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/es7.d.ts b/node_modules/ast-types/def/es7.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/es7.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/es7.js b/node_modules/ast-types/def/es7.js
new file mode 100644
index 0000000..9da0139
--- /dev/null
+++ b/node_modules/ast-types/def/es7.js
@@ -0,0 +1,36 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var es6_1 = __importDefault(require("./es6"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    fork.use(es6_1.default);
+    var types = fork.use(types_1.default);
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    def("Function")
+        .field("async", Boolean, defaults["false"]);
+    def("SpreadProperty")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("Expression"));
+    def("ObjectExpression")
+        .field("properties", [or(def("Property"), def("SpreadProperty"), def("SpreadElement"))]);
+    def("SpreadPropertyPattern")
+        .bases("Pattern")
+        .build("argument")
+        .field("argument", def("Pattern"));
+    def("ObjectPattern")
+        .field("properties", [or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"))]);
+    def("AwaitExpression")
+        .bases("Expression")
+        .build("argument", "all")
+        .field("argument", or(def("Expression"), null))
+        .field("all", Boolean, defaults["false"]);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/esprima.d.ts b/node_modules/ast-types/def/esprima.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/esprima.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/esprima.js b/node_modules/ast-types/def/esprima.js
new file mode 100644
index 0000000..1684132
--- /dev/null
+++ b/node_modules/ast-types/def/esprima.js
@@ -0,0 +1,51 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var es7_1 = __importDefault(require("./es7"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    fork.use(es7_1.default);
+    var types = fork.use(types_1.default);
+    var defaults = fork.use(shared_1.default).defaults;
+    var def = types.Type.def;
+    var or = types.Type.or;
+    def("VariableDeclaration")
+        .field("declarations", [or(def("VariableDeclarator"), def("Identifier") // Esprima deviation.
+        )]);
+    def("Property")
+        .field("value", or(def("Expression"), def("Pattern") // Esprima deviation.
+    ));
+    def("ArrayPattern")
+        .field("elements", [or(def("Pattern"), def("SpreadElement"), null)]);
+    def("ObjectPattern")
+        .field("properties", [or(def("Property"), def("PropertyPattern"), def("SpreadPropertyPattern"), def("SpreadProperty") // Used by Esprima.
+        )]);
+    // Like ModuleSpecifier, except type:"ExportSpecifier" and buildable.
+    // export {<id [as name]>} [from ...];
+    def("ExportSpecifier")
+        .bases("ModuleSpecifier")
+        .build("id", "name");
+    // export <*> from ...;
+    def("ExportBatchSpecifier")
+        .bases("Specifier")
+        .build();
+    def("ExportDeclaration")
+        .bases("Declaration")
+        .build("default", "declaration", "specifiers", "source")
+        .field("default", Boolean)
+        .field("declaration", or(def("Declaration"), def("Expression"), // Implies default.
+    null))
+        .field("specifiers", [or(def("ExportSpecifier"), def("ExportBatchSpecifier"))], defaults.emptyArray)
+        .field("source", or(def("Literal"), null), defaults["null"]);
+    def("Block")
+        .bases("Comment")
+        .build("value", /*optional:*/ "leading", "trailing");
+    def("Line")
+        .bases("Comment")
+        .build("value", /*optional:*/ "leading", "trailing");
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/flow.d.ts b/node_modules/ast-types/def/flow.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/flow.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/flow.js b/node_modules/ast-types/def/flow.js
new file mode 100644
index 0000000..b8f9358
--- /dev/null
+++ b/node_modules/ast-types/def/flow.js
@@ -0,0 +1,294 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var es7_1 = __importDefault(require("./es7"));
+var type_annotations_1 = __importDefault(require("./type-annotations"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    fork.use(es7_1.default);
+    fork.use(type_annotations_1.default);
+    var types = fork.use(types_1.default);
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    // Base types
+    def("Flow").bases("Node");
+    def("FlowType").bases("Flow");
+    // Type annotations
+    def("AnyTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("EmptyTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("MixedTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("VoidTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("NumberTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("NumberLiteralTypeAnnotation")
+        .bases("FlowType")
+        .build("value", "raw")
+        .field("value", Number)
+        .field("raw", String);
+    // Babylon 6 differs in AST from Flow
+    // same as NumberLiteralTypeAnnotation
+    def("NumericLiteralTypeAnnotation")
+        .bases("FlowType")
+        .build("value", "raw")
+        .field("value", Number)
+        .field("raw", String);
+    def("StringTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("StringLiteralTypeAnnotation")
+        .bases("FlowType")
+        .build("value", "raw")
+        .field("value", String)
+        .field("raw", String);
+    def("BooleanTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("BooleanLiteralTypeAnnotation")
+        .bases("FlowType")
+        .build("value", "raw")
+        .field("value", Boolean)
+        .field("raw", String);
+    def("TypeAnnotation")
+        .bases("Node")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("FlowType"));
+    def("NullableTypeAnnotation")
+        .bases("FlowType")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("FlowType"));
+    def("NullLiteralTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("NullTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("ThisTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("ExistsTypeAnnotation")
+        .bases("FlowType")
+        .build();
+    def("ExistentialTypeParam")
+        .bases("FlowType")
+        .build();
+    def("FunctionTypeAnnotation")
+        .bases("FlowType")
+        .build("params", "returnType", "rest", "typeParameters")
+        .field("params", [def("FunctionTypeParam")])
+        .field("returnType", def("FlowType"))
+        .field("rest", or(def("FunctionTypeParam"), null))
+        .field("typeParameters", or(def("TypeParameterDeclaration"), null));
+    def("FunctionTypeParam")
+        .bases("Node")
+        .build("name", "typeAnnotation", "optional")
+        .field("name", def("Identifier"))
+        .field("typeAnnotation", def("FlowType"))
+        .field("optional", Boolean);
+    def("ArrayTypeAnnotation")
+        .bases("FlowType")
+        .build("elementType")
+        .field("elementType", def("FlowType"));
+    def("ObjectTypeAnnotation")
+        .bases("FlowType")
+        .build("properties", "indexers", "callProperties")
+        .field("properties", [
+        or(def("ObjectTypeProperty"), def("ObjectTypeSpreadProperty"))
+    ])
+        .field("indexers", [def("ObjectTypeIndexer")], defaults.emptyArray)
+        .field("callProperties", [def("ObjectTypeCallProperty")], defaults.emptyArray)
+        .field("inexact", or(Boolean, void 0), defaults["undefined"])
+        .field("exact", Boolean, defaults["false"])
+        .field("internalSlots", [def("ObjectTypeInternalSlot")], defaults.emptyArray);
+    def("Variance")
+        .bases("Node")
+        .build("kind")
+        .field("kind", or("plus", "minus"));
+    var LegacyVariance = or(def("Variance"), "plus", "minus", null);
+    def("ObjectTypeProperty")
+        .bases("Node")
+        .build("key", "value", "optional")
+        .field("key", or(def("Literal"), def("Identifier")))
+        .field("value", def("FlowType"))
+        .field("optional", Boolean)
+        .field("variance", LegacyVariance, defaults["null"]);
+    def("ObjectTypeIndexer")
+        .bases("Node")
+        .build("id", "key", "value")
+        .field("id", def("Identifier"))
+        .field("key", def("FlowType"))
+        .field("value", def("FlowType"))
+        .field("variance", LegacyVariance, defaults["null"]);
+    def("ObjectTypeCallProperty")
+        .bases("Node")
+        .build("value")
+        .field("value", def("FunctionTypeAnnotation"))
+        .field("static", Boolean, defaults["false"]);
+    def("QualifiedTypeIdentifier")
+        .bases("Node")
+        .build("qualification", "id")
+        .field("qualification", or(def("Identifier"), def("QualifiedTypeIdentifier")))
+        .field("id", def("Identifier"));
+    def("GenericTypeAnnotation")
+        .bases("FlowType")
+        .build("id", "typeParameters")
+        .field("id", or(def("Identifier"), def("QualifiedTypeIdentifier")))
+        .field("typeParameters", or(def("TypeParameterInstantiation"), null));
+    def("MemberTypeAnnotation")
+        .bases("FlowType")
+        .build("object", "property")
+        .field("object", def("Identifier"))
+        .field("property", or(def("MemberTypeAnnotation"), def("GenericTypeAnnotation")));
+    def("UnionTypeAnnotation")
+        .bases("FlowType")
+        .build("types")
+        .field("types", [def("FlowType")]);
+    def("IntersectionTypeAnnotation")
+        .bases("FlowType")
+        .build("types")
+        .field("types", [def("FlowType")]);
+    def("TypeofTypeAnnotation")
+        .bases("FlowType")
+        .build("argument")
+        .field("argument", def("FlowType"));
+    def("ObjectTypeSpreadProperty")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("FlowType"));
+    def("ObjectTypeInternalSlot")
+        .bases("Node")
+        .build("id", "value", "optional", "static", "method")
+        .field("id", def("Identifier"))
+        .field("value", def("FlowType"))
+        .field("optional", Boolean)
+        .field("static", Boolean)
+        .field("method", Boolean);
+    def("TypeParameterDeclaration")
+        .bases("Node")
+        .build("params")
+        .field("params", [def("TypeParameter")]);
+    def("TypeParameterInstantiation")
+        .bases("Node")
+        .build("params")
+        .field("params", [def("FlowType")]);
+    def("TypeParameter")
+        .bases("FlowType")
+        .build("name", "variance", "bound")
+        .field("name", String)
+        .field("variance", LegacyVariance, defaults["null"])
+        .field("bound", or(def("TypeAnnotation"), null), defaults["null"]);
+    def("ClassProperty")
+        .field("variance", LegacyVariance, defaults["null"]);
+    def("ClassImplements")
+        .bases("Node")
+        .build("id")
+        .field("id", def("Identifier"))
+        .field("superClass", or(def("Expression"), null), defaults["null"])
+        .field("typeParameters", or(def("TypeParameterInstantiation"), null), defaults["null"]);
+    def("InterfaceTypeAnnotation")
+        .bases("FlowType")
+        .build("body", "extends")
+        .field("body", def("ObjectTypeAnnotation"))
+        .field("extends", or([def("InterfaceExtends")], null), defaults["null"]);
+    def("InterfaceDeclaration")
+        .bases("Declaration")
+        .build("id", "body", "extends")
+        .field("id", def("Identifier"))
+        .field("typeParameters", or(def("TypeParameterDeclaration"), null), defaults["null"])
+        .field("body", def("ObjectTypeAnnotation"))
+        .field("extends", [def("InterfaceExtends")]);
+    def("DeclareInterface")
+        .bases("InterfaceDeclaration")
+        .build("id", "body", "extends");
+    def("InterfaceExtends")
+        .bases("Node")
+        .build("id")
+        .field("id", def("Identifier"))
+        .field("typeParameters", or(def("TypeParameterInstantiation"), null), defaults["null"]);
+    def("TypeAlias")
+        .bases("Declaration")
+        .build("id", "typeParameters", "right")
+        .field("id", def("Identifier"))
+        .field("typeParameters", or(def("TypeParameterDeclaration"), null))
+        .field("right", def("FlowType"));
+    def("OpaqueType")
+        .bases("Declaration")
+        .build("id", "typeParameters", "impltype", "supertype")
+        .field("id", def("Identifier"))
+        .field("typeParameters", or(def("TypeParameterDeclaration"), null))
+        .field("impltype", def("FlowType"))
+        .field("supertype", def("FlowType"));
+    def("DeclareTypeAlias")
+        .bases("TypeAlias")
+        .build("id", "typeParameters", "right");
+    def("DeclareOpaqueType")
+        .bases("TypeAlias")
+        .build("id", "typeParameters", "supertype");
+    def("TypeCastExpression")
+        .bases("Expression")
+        .build("expression", "typeAnnotation")
+        .field("expression", def("Expression"))
+        .field("typeAnnotation", def("TypeAnnotation"));
+    def("TupleTypeAnnotation")
+        .bases("FlowType")
+        .build("types")
+        .field("types", [def("FlowType")]);
+    def("DeclareVariable")
+        .bases("Statement")
+        .build("id")
+        .field("id", def("Identifier"));
+    def("DeclareFunction")
+        .bases("Statement")
+        .build("id")
+        .field("id", def("Identifier"));
+    def("DeclareClass")
+        .bases("InterfaceDeclaration")
+        .build("id");
+    def("DeclareModule")
+        .bases("Statement")
+        .build("id", "body")
+        .field("id", or(def("Identifier"), def("Literal")))
+        .field("body", def("BlockStatement"));
+    def("DeclareModuleExports")
+        .bases("Statement")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("TypeAnnotation"));
+    def("DeclareExportDeclaration")
+        .bases("Declaration")
+        .build("default", "declaration", "specifiers", "source")
+        .field("default", Boolean)
+        .field("declaration", or(def("DeclareVariable"), def("DeclareFunction"), def("DeclareClass"), def("FlowType"), // Implies default.
+    null))
+        .field("specifiers", [or(def("ExportSpecifier"), def("ExportBatchSpecifier"))], defaults.emptyArray)
+        .field("source", or(def("Literal"), null), defaults["null"]);
+    def("DeclareExportAllDeclaration")
+        .bases("Declaration")
+        .build("source")
+        .field("source", or(def("Literal"), null), defaults["null"]);
+    def("FlowPredicate").bases("Flow");
+    def("InferredPredicate")
+        .bases("FlowPredicate")
+        .build();
+    def("DeclaredPredicate")
+        .bases("FlowPredicate")
+        .build("value")
+        .field("value", def("Expression"));
+    def("CallExpression")
+        .field("typeArguments", or(null, def("TypeParameterInstantiation")), defaults["null"]);
+    def("NewExpression")
+        .field("typeArguments", or(null, def("TypeParameterInstantiation")), defaults["null"]);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/jsx.d.ts b/node_modules/ast-types/def/jsx.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/jsx.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/jsx.js b/node_modules/ast-types/def/jsx.js
new file mode 100644
index 0000000..f6fb42d
--- /dev/null
+++ b/node_modules/ast-types/def/jsx.js
@@ -0,0 +1,105 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var es7_1 = __importDefault(require("./es7"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    fork.use(es7_1.default);
+    var types = fork.use(types_1.default);
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    def("JSXAttribute")
+        .bases("Node")
+        .build("name", "value")
+        .field("name", or(def("JSXIdentifier"), def("JSXNamespacedName")))
+        .field("value", or(def("Literal"), // attr="value"
+    def("JSXExpressionContainer"), // attr={value}
+    null // attr= or just attr
+    ), defaults["null"]);
+    def("JSXIdentifier")
+        .bases("Identifier")
+        .build("name")
+        .field("name", String);
+    def("JSXNamespacedName")
+        .bases("Node")
+        .build("namespace", "name")
+        .field("namespace", def("JSXIdentifier"))
+        .field("name", def("JSXIdentifier"));
+    def("JSXMemberExpression")
+        .bases("MemberExpression")
+        .build("object", "property")
+        .field("object", or(def("JSXIdentifier"), def("JSXMemberExpression")))
+        .field("property", def("JSXIdentifier"))
+        .field("computed", Boolean, defaults.false);
+    var JSXElementName = or(def("JSXIdentifier"), def("JSXNamespacedName"), def("JSXMemberExpression"));
+    def("JSXSpreadAttribute")
+        .bases("Node")
+        .build("argument")
+        .field("argument", def("Expression"));
+    var JSXAttributes = [or(def("JSXAttribute"), def("JSXSpreadAttribute"))];
+    def("JSXExpressionContainer")
+        .bases("Expression")
+        .build("expression")
+        .field("expression", def("Expression"));
+    def("JSXElement")
+        .bases("Expression")
+        .build("openingElement", "closingElement", "children")
+        .field("openingElement", def("JSXOpeningElement"))
+        .field("closingElement", or(def("JSXClosingElement"), null), defaults["null"])
+        .field("children", [or(def("JSXElement"), def("JSXExpressionContainer"), def("JSXFragment"), def("JSXText"), def("Literal") // TODO Esprima should return JSXText instead.
+        )], defaults.emptyArray)
+        .field("name", JSXElementName, function () {
+        // Little-known fact: the `this` object inside a default function
+        // is none other than the partially-built object itself, and any
+        // fields initialized directly from builder function arguments
+        // (like openingElement, closingElement, and children) are
+        // guaranteed to be available.
+        return this.openingElement.name;
+    }, true) // hidden from traversal
+        .field("selfClosing", Boolean, function () {
+        return this.openingElement.selfClosing;
+    }, true) // hidden from traversal
+        .field("attributes", JSXAttributes, function () {
+        return this.openingElement.attributes;
+    }, true); // hidden from traversal
+    def("JSXOpeningElement")
+        .bases("Node") // TODO Does this make sense? Can't really be an JSXElement.
+        .build("name", "attributes", "selfClosing")
+        .field("name", JSXElementName)
+        .field("attributes", JSXAttributes, defaults.emptyArray)
+        .field("selfClosing", Boolean, defaults["false"]);
+    def("JSXClosingElement")
+        .bases("Node") // TODO Same concern.
+        .build("name")
+        .field("name", JSXElementName);
+    def("JSXFragment")
+        .bases("Expression")
+        .build("openingElement", "closingElement", "children")
+        .field("openingElement", def("JSXOpeningFragment"))
+        .field("closingElement", def("JSXClosingFragment"))
+        .field("children", [or(def("JSXElement"), def("JSXExpressionContainer"), def("JSXFragment"), def("JSXText"), def("Literal") // TODO Esprima should return JSXText instead.
+        )], defaults.emptyArray);
+    def("JSXOpeningFragment")
+        .bases("Node") // TODO Same concern.
+        .build();
+    def("JSXClosingFragment")
+        .bases("Node") // TODO Same concern.
+        .build();
+    def("JSXText")
+        .bases("Literal")
+        .build("value")
+        .field("value", String);
+    def("JSXEmptyExpression").bases("Expression").build();
+    // This PR has caused many people issues, but supporting it seems like a
+    // good idea anyway: https://github.com/babel/babel/pull/4988
+    def("JSXSpreadChild")
+        .bases("Expression")
+        .build("expression")
+        .field("expression", def("Expression"));
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/type-annotations.d.ts b/node_modules/ast-types/def/type-annotations.d.ts
new file mode 100644
index 0000000..7c57c57
--- /dev/null
+++ b/node_modules/ast-types/def/type-annotations.d.ts
@@ -0,0 +1,7 @@
+/**
+ * Type annotation defs shared between Flow and TypeScript.
+ * These defs could not be defined in ./flow.ts or ./typescript.ts directly
+ * because they use the same name.
+ */
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/type-annotations.js b/node_modules/ast-types/def/type-annotations.js
new file mode 100644
index 0000000..95ca42e
--- /dev/null
+++ b/node_modules/ast-types/def/type-annotations.js
@@ -0,0 +1,42 @@
+"use strict";;
+/**
+ * Type annotation defs shared between Flow and TypeScript.
+ * These defs could not be defined in ./flow.ts or ./typescript.ts directly
+ * because they use the same name.
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    var types = fork.use(types_1.default);
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    var TypeAnnotation = or(def("TypeAnnotation"), def("TSTypeAnnotation"), null);
+    var TypeParamDecl = or(def("TypeParameterDeclaration"), def("TSTypeParameterDeclaration"), null);
+    def("Identifier")
+        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+    def("ObjectPattern")
+        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+    def("Function")
+        .field("returnType", TypeAnnotation, defaults["null"])
+        .field("typeParameters", TypeParamDecl, defaults["null"]);
+    def("ClassProperty")
+        .build("key", "value", "typeAnnotation", "static")
+        .field("value", or(def("Expression"), null))
+        .field("static", Boolean, defaults["false"])
+        .field("typeAnnotation", TypeAnnotation, defaults["null"]);
+    ["ClassDeclaration",
+        "ClassExpression",
+    ].forEach(function (typeName) {
+        def(typeName)
+            .field("typeParameters", TypeParamDecl, defaults["null"])
+            .field("superTypeParameters", or(def("TypeParameterInstantiation"), def("TSTypeParameterInstantiation"), null), defaults["null"])
+            .field("implements", or([def("ClassImplements")], [def("TSExpressionWithTypeArguments")]), defaults.emptyArray);
+    });
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/def/typescript.d.ts b/node_modules/ast-types/def/typescript.d.ts
new file mode 100644
index 0000000..1ef9137
--- /dev/null
+++ b/node_modules/ast-types/def/typescript.d.ts
@@ -0,0 +1,2 @@
+import { Fork } from "../types";
+export default function (fork: Fork): void;
diff --git a/node_modules/ast-types/def/typescript.js b/node_modules/ast-types/def/typescript.js
new file mode 100644
index 0000000..bef599d
--- /dev/null
+++ b/node_modules/ast-types/def/typescript.js
@@ -0,0 +1,339 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var babel_core_1 = __importDefault(require("./babel-core"));
+var type_annotations_1 = __importDefault(require("./type-annotations"));
+var types_1 = __importDefault(require("../lib/types"));
+var shared_1 = __importDefault(require("../lib/shared"));
+function default_1(fork) {
+    // Since TypeScript is parsed by Babylon, include the core Babylon types
+    // but omit the Flow-related types.
+    fork.use(babel_core_1.default);
+    fork.use(type_annotations_1.default);
+    var types = fork.use(types_1.default);
+    var n = types.namedTypes;
+    var def = types.Type.def;
+    var or = types.Type.or;
+    var defaults = fork.use(shared_1.default).defaults;
+    var StringLiteral = types.Type.from(function (value, deep) {
+        if (n.StringLiteral &&
+            n.StringLiteral.check(value, deep)) {
+            return true;
+        }
+        if (n.Literal &&
+            n.Literal.check(value, deep) &&
+            typeof value.value === "string") {
+            return true;
+        }
+        return false;
+    }, "StringLiteral");
+    def("TSType")
+        .bases("Node");
+    var TSEntityName = or(def("Identifier"), def("TSQualifiedName"));
+    def("TSTypeReference")
+        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+        .build("typeName", "typeParameters")
+        .field("typeName", TSEntityName);
+    // An abstract (non-buildable) base type that provide a commonly-needed
+    // optional .typeParameters field.
+    def("TSHasOptionalTypeParameterInstantiation")
+        .field("typeParameters", or(def("TSTypeParameterInstantiation"), null), defaults["null"]);
+    // An abstract (non-buildable) base type that provide a commonly-needed
+    // optional .typeParameters field.
+    def("TSHasOptionalTypeParameters")
+        .field("typeParameters", or(def("TSTypeParameterDeclaration"), null, void 0), defaults["null"]);
+    // An abstract (non-buildable) base type that provide a commonly-needed
+    // optional .typeAnnotation field.
+    def("TSHasOptionalTypeAnnotation")
+        .field("typeAnnotation", or(def("TSTypeAnnotation"), null), defaults["null"]);
+    def("TSQualifiedName")
+        .bases("Node")
+        .build("left", "right")
+        .field("left", TSEntityName)
+        .field("right", TSEntityName);
+    def("TSAsExpression")
+        .bases("Expression", "Pattern")
+        .build("expression", "typeAnnotation")
+        .field("expression", def("Expression"))
+        .field("typeAnnotation", def("TSType"))
+        .field("extra", or({ parenthesized: Boolean }, null), defaults["null"]);
+    def("TSNonNullExpression")
+        .bases("Expression", "Pattern")
+        .build("expression")
+        .field("expression", def("Expression"));
+    [
+        "TSAnyKeyword",
+        "TSBigIntKeyword",
+        "TSBooleanKeyword",
+        "TSNeverKeyword",
+        "TSNullKeyword",
+        "TSNumberKeyword",
+        "TSObjectKeyword",
+        "TSStringKeyword",
+        "TSSymbolKeyword",
+        "TSUndefinedKeyword",
+        "TSUnknownKeyword",
+        "TSVoidKeyword",
+        "TSThisType",
+    ].forEach(function (keywordType) {
+        def(keywordType)
+            .bases("TSType")
+            .build();
+    });
+    def("TSArrayType")
+        .bases("TSType")
+        .build("elementType")
+        .field("elementType", def("TSType"));
+    def("TSLiteralType")
+        .bases("TSType")
+        .build("literal")
+        .field("literal", or(def("NumericLiteral"), def("StringLiteral"), def("BooleanLiteral"), def("TemplateLiteral"), def("UnaryExpression")));
+    ["TSUnionType",
+        "TSIntersectionType",
+    ].forEach(function (typeName) {
+        def(typeName)
+            .bases("TSType")
+            .build("types")
+            .field("types", [def("TSType")]);
+    });
+    def("TSConditionalType")
+        .bases("TSType")
+        .build("checkType", "extendsType", "trueType", "falseType")
+        .field("checkType", def("TSType"))
+        .field("extendsType", def("TSType"))
+        .field("trueType", def("TSType"))
+        .field("falseType", def("TSType"));
+    def("TSInferType")
+        .bases("TSType")
+        .build("typeParameter")
+        .field("typeParameter", def("TSTypeParameter"));
+    def("TSParenthesizedType")
+        .bases("TSType")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("TSType"));
+    var ParametersType = [or(def("Identifier"), def("RestElement"), def("ArrayPattern"), def("ObjectPattern"))];
+    ["TSFunctionType",
+        "TSConstructorType",
+    ].forEach(function (typeName) {
+        def(typeName)
+            .bases("TSType", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+            .build("parameters")
+            .field("parameters", ParametersType);
+    });
+    def("TSDeclareFunction")
+        .bases("Declaration", "TSHasOptionalTypeParameters")
+        .build("id", "params", "returnType")
+        .field("declare", Boolean, defaults["false"])
+        .field("async", Boolean, defaults["false"])
+        .field("generator", Boolean, defaults["false"])
+        .field("id", or(def("Identifier"), null), defaults["null"])
+        .field("params", [def("Pattern")])
+        // tSFunctionTypeAnnotationCommon
+        .field("returnType", or(def("TSTypeAnnotation"), def("Noop"), // Still used?
+    null), defaults["null"]);
+    def("TSDeclareMethod")
+        .bases("Declaration", "TSHasOptionalTypeParameters")
+        .build("key", "params", "returnType")
+        .field("async", Boolean, defaults["false"])
+        .field("generator", Boolean, defaults["false"])
+        .field("params", [def("Pattern")])
+        // classMethodOrPropertyCommon
+        .field("abstract", Boolean, defaults["false"])
+        .field("accessibility", or("public", "private", "protected", void 0), defaults["undefined"])
+        .field("static", Boolean, defaults["false"])
+        .field("computed", Boolean, defaults["false"])
+        .field("optional", Boolean, defaults["false"])
+        .field("key", or(def("Identifier"), def("StringLiteral"), def("NumericLiteral"), 
+    // Only allowed if .computed is true.
+    def("Expression")))
+        // classMethodOrDeclareMethodCommon
+        .field("kind", or("get", "set", "method", "constructor"), function getDefault() { return "method"; })
+        .field("access", // Not "accessibility"?
+    or("public", "private", "protected", void 0), defaults["undefined"])
+        .field("decorators", or([def("Decorator")], null), defaults["null"])
+        // tSFunctionTypeAnnotationCommon
+        .field("returnType", or(def("TSTypeAnnotation"), def("Noop"), // Still used?
+    null), defaults["null"]);
+    def("TSMappedType")
+        .bases("TSType")
+        .build("typeParameter", "typeAnnotation")
+        .field("readonly", or(Boolean, "+", "-"), defaults["false"])
+        .field("typeParameter", def("TSTypeParameter"))
+        .field("optional", or(Boolean, "+", "-"), defaults["false"])
+        .field("typeAnnotation", or(def("TSType"), null), defaults["null"]);
+    def("TSTupleType")
+        .bases("TSType")
+        .build("elementTypes")
+        .field("elementTypes", [def("TSType")]);
+    def("TSRestType")
+        .bases("TSType")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("TSType"));
+    def("TSOptionalType")
+        .bases("TSType")
+        .build("typeAnnotation")
+        .field("typeAnnotation", def("TSType"));
+    def("TSIndexedAccessType")
+        .bases("TSType")
+        .build("objectType", "indexType")
+        .field("objectType", def("TSType"))
+        .field("indexType", def("TSType"));
+    def("TSTypeOperator")
+        .bases("TSType")
+        .build("operator")
+        .field("operator", String)
+        .field("typeAnnotation", def("TSType"));
+    def("TSTypeAnnotation")
+        .bases("Node")
+        .build("typeAnnotation")
+        .field("typeAnnotation", or(def("TSType"), def("TSTypeAnnotation")));
+    def("TSIndexSignature")
+        .bases("Declaration", "TSHasOptionalTypeAnnotation")
+        .build("parameters", "typeAnnotation")
+        .field("parameters", [def("Identifier")]) // Length === 1
+        .field("readonly", Boolean, defaults["false"]);
+    def("TSPropertySignature")
+        .bases("Declaration", "TSHasOptionalTypeAnnotation")
+        .build("key", "typeAnnotation", "optional")
+        .field("key", def("Expression"))
+        .field("computed", Boolean, defaults["false"])
+        .field("readonly", Boolean, defaults["false"])
+        .field("optional", Boolean, defaults["false"])
+        .field("initializer", or(def("Expression"), null), defaults["null"]);
+    def("TSMethodSignature")
+        .bases("Declaration", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+        .build("key", "parameters", "typeAnnotation")
+        .field("key", def("Expression"))
+        .field("computed", Boolean, defaults["false"])
+        .field("optional", Boolean, defaults["false"])
+        .field("parameters", ParametersType);
+    def("TSTypePredicate")
+        .bases("TSTypeAnnotation")
+        .build("parameterName", "typeAnnotation")
+        .field("parameterName", or(def("Identifier"), def("TSThisType")))
+        .field("typeAnnotation", def("TSTypeAnnotation"));
+    ["TSCallSignatureDeclaration",
+        "TSConstructSignatureDeclaration",
+    ].forEach(function (typeName) {
+        def(typeName)
+            .bases("Declaration", "TSHasOptionalTypeParameters", "TSHasOptionalTypeAnnotation")
+            .build("parameters", "typeAnnotation")
+            .field("parameters", ParametersType);
+    });
+    def("TSEnumMember")
+        .bases("Node")
+        .build("id", "initializer")
+        .field("id", or(def("Identifier"), StringLiteral))
+        .field("initializer", or(def("Expression"), null), defaults["null"]);
+    def("TSTypeQuery")
+        .bases("TSType")
+        .build("exprName")
+        .field("exprName", or(TSEntityName, def("TSImportType")));
+    // Inferred from Babylon's tsParseTypeMember method.
+    var TSTypeMember = or(def("TSCallSignatureDeclaration"), def("TSConstructSignatureDeclaration"), def("TSIndexSignature"), def("TSMethodSignature"), def("TSPropertySignature"));
+    def("TSTypeLiteral")
+        .bases("TSType")
+        .build("members")
+        .field("members", [TSTypeMember]);
+    def("TSTypeParameter")
+        .bases("Identifier")
+        .build("name", "constraint", "default")
+        .field("name", String)
+        .field("constraint", or(def("TSType"), void 0), defaults["undefined"])
+        .field("default", or(def("TSType"), void 0), defaults["undefined"]);
+    def("TSTypeAssertion")
+        .bases("Expression", "Pattern")
+        .build("typeAnnotation", "expression")
+        .field("typeAnnotation", def("TSType"))
+        .field("expression", def("Expression"))
+        .field("extra", or({ parenthesized: Boolean }, null), defaults["null"]);
+    def("TSTypeParameterDeclaration")
+        .bases("Declaration")
+        .build("params")
+        .field("params", [def("TSTypeParameter")]);
+    def("TSTypeParameterInstantiation")
+        .bases("Node")
+        .build("params")
+        .field("params", [def("TSType")]);
+    def("TSEnumDeclaration")
+        .bases("Declaration")
+        .build("id", "members")
+        .field("id", def("Identifier"))
+        .field("const", Boolean, defaults["false"])
+        .field("declare", Boolean, defaults["false"])
+        .field("members", [def("TSEnumMember")])
+        .field("initializer", or(def("Expression"), null), defaults["null"]);
+    def("TSTypeAliasDeclaration")
+        .bases("Declaration", "TSHasOptionalTypeParameters")
+        .build("id", "typeAnnotation")
+        .field("id", def("Identifier"))
+        .field("declare", Boolean, defaults["false"])
+        .field("typeAnnotation", def("TSType"));
+    def("TSModuleBlock")
+        .bases("Node")
+        .build("body")
+        .field("body", [def("Statement")]);
+    def("TSModuleDeclaration")
+        .bases("Declaration")
+        .build("id", "body")
+        .field("id", or(StringLiteral, TSEntityName))
+        .field("declare", Boolean, defaults["false"])
+        .field("global", Boolean, defaults["false"])
+        .field("body", or(def("TSModuleBlock"), def("TSModuleDeclaration"), null), defaults["null"]);
+    def("TSImportType")
+        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+        .build("argument", "qualifier", "typeParameters")
+        .field("argument", StringLiteral)
+        .field("qualifier", or(TSEntityName, void 0), defaults["undefined"]);
+    def("TSImportEqualsDeclaration")
+        .bases("Declaration")
+        .build("id", "moduleReference")
+        .field("id", def("Identifier"))
+        .field("isExport", Boolean, defaults["false"])
+        .field("moduleReference", or(TSEntityName, def("TSExternalModuleReference")));
+    def("TSExternalModuleReference")
+        .bases("Declaration")
+        .build("expression")
+        .field("expression", StringLiteral);
+    def("TSExportAssignment")
+        .bases("Statement")
+        .build("expression")
+        .field("expression", def("Expression"));
+    def("TSNamespaceExportDeclaration")
+        .bases("Declaration")
+        .build("id")
+        .field("id", def("Identifier"));
+    def("TSInterfaceBody")
+        .bases("Node")
+        .build("body")
+        .field("body", [TSTypeMember]);
+    def("TSExpressionWithTypeArguments")
+        .bases("TSType", "TSHasOptionalTypeParameterInstantiation")
+        .build("expression", "typeParameters")
+        .field("expression", TSEntityName);
+    def("TSInterfaceDeclaration")
+        .bases("Declaration", "TSHasOptionalTypeParameters")
+        .build("id", "body")
+        .field("id", TSEntityName)
+        .field("declare", Boolean, defaults["false"])
+        .field("extends", or([def("TSExpressionWithTypeArguments")], null), defaults["null"])
+        .field("body", def("TSInterfaceBody"));
+    def("TSParameterProperty")
+        .bases("Pattern")
+        .build("parameter")
+        .field("accessibility", or("public", "private", "protected", void 0), defaults["undefined"])
+        .field("readonly", Boolean, defaults["false"])
+        .field("parameter", or(def("Identifier"), def("AssignmentPattern")));
+    def("ClassProperty")
+        .field("access", // Not "accessibility"?
+    or("public", "private", "protected", void 0), defaults["undefined"]);
+    // Defined already in es6 and babel-core.
+    def("ClassBody")
+        .field("body", [or(def("MethodDefinition"), def("VariableDeclarator"), def("ClassPropertyDefinition"), def("ClassProperty"), def("ClassPrivateProperty"), def("ClassMethod"), def("ClassPrivateMethod"), 
+        // Just need to add these types:
+        def("TSDeclareMethod"), TSTypeMember)]);
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/fork.d.ts b/node_modules/ast-types/fork.d.ts
new file mode 100644
index 0000000..3badc9c
--- /dev/null
+++ b/node_modules/ast-types/fork.d.ts
@@ -0,0 +1,42 @@
+import { Def, Plugin } from "./types";
+export default function (defs: Def[]): {
+    Type: {
+        or(...types: any[]): import("./lib/types").Type<any>;
+        from<T>(value: any, name?: string | undefined): import("./lib/types").Type<T>;
+        def(typeName: string): import("./lib/types").Def<any>;
+        hasDef(typeName: string): boolean;
+    };
+    builtInTypes: {
+        string: import("./lib/types").Type<string>;
+        function: import("./lib/types").Type<Function>;
+        array: import("./lib/types").Type<any[]>;
+        object: import("./lib/types").Type<{
+            [key: string]: any;
+        }>;
+        RegExp: import("./lib/types").Type<RegExp>;
+        Date: import("./lib/types").Type<Date>;
+        number: import("./lib/types").Type<number>;
+        boolean: import("./lib/types").Type<boolean>;
+        null: import("./lib/types").Type<null>;
+        undefined: import("./lib/types").Type<undefined>;
+    };
+    namedTypes: import("./gen/namedTypes").NamedTypes;
+    builders: import("./gen/builders").builders;
+    defineMethod: (name: any, func?: Function | undefined) => Function;
+    getFieldNames: (object: any) => string[];
+    getFieldValue: (object: any, fieldName: any) => any;
+    eachField: (object: any, callback: (name: any, value: any) => any, context?: any) => void;
+    someField: (object: any, callback: (name: any, value: any) => any, context?: any) => boolean;
+    getSupertypeNames: (typeName: string) => string[];
+    getBuilderName: (typeName: any) => any;
+    astNodesAreEquivalent: {
+        (a: any, b: any, problemPath?: any): boolean;
+        assert(a: any, b: any): void;
+    };
+    finalize: () => void;
+    Path: import("./lib/path").PathConstructor;
+    NodePath: import("./lib/node-path").NodePathConstructor;
+    PathVisitor: import("./lib/path-visitor").PathVisitorConstructor;
+    use: <T>(plugin: Plugin<T>) => T;
+    visit: <M = {}>(node: import("./lib/types").ASTNode, methods?: import("./main").Visitor<M> | undefined) => any;
+};
diff --git a/node_modules/ast-types/fork.js b/node_modules/ast-types/fork.js
new file mode 100644
index 0000000..31c1b26
--- /dev/null
+++ b/node_modules/ast-types/fork.js
@@ -0,0 +1,54 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./lib/types"));
+var path_visitor_1 = __importDefault(require("./lib/path-visitor"));
+var equiv_1 = __importDefault(require("./lib/equiv"));
+var path_1 = __importDefault(require("./lib/path"));
+var node_path_1 = __importDefault(require("./lib/node-path"));
+function default_1(defs) {
+    var fork = createFork();
+    var types = fork.use(types_1.default);
+    defs.forEach(fork.use);
+    types.finalize();
+    var PathVisitor = fork.use(path_visitor_1.default);
+    return {
+        Type: types.Type,
+        builtInTypes: types.builtInTypes,
+        namedTypes: types.namedTypes,
+        builders: types.builders,
+        defineMethod: types.defineMethod,
+        getFieldNames: types.getFieldNames,
+        getFieldValue: types.getFieldValue,
+        eachField: types.eachField,
+        someField: types.someField,
+        getSupertypeNames: types.getSupertypeNames,
+        getBuilderName: types.getBuilderName,
+        astNodesAreEquivalent: fork.use(equiv_1.default),
+        finalize: types.finalize,
+        Path: fork.use(path_1.default),
+        NodePath: fork.use(node_path_1.default),
+        PathVisitor: PathVisitor,
+        use: fork.use,
+        visit: PathVisitor.visit,
+    };
+}
+exports.default = default_1;
+function createFork() {
+    var used = [];
+    var usedResult = [];
+    function use(plugin) {
+        var idx = used.indexOf(plugin);
+        if (idx === -1) {
+            idx = used.length;
+            used.push(plugin);
+            usedResult[idx] = plugin(fork);
+        }
+        return usedResult[idx];
+    }
+    var fork = { use: use };
+    return fork;
+}
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/gen/builders.d.ts b/node_modules/ast-types/gen/builders.d.ts
new file mode 100644
index 0000000..7123993
--- /dev/null
+++ b/node_modules/ast-types/gen/builders.d.ts
@@ -0,0 +1,2563 @@
+import * as K from "./kinds";
+import { namedTypes } from "./namedTypes";
+export interface FileBuilder {
+    (program: K.ProgramKind, name?: string | null): namedTypes.File;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name?: string | null;
+        program: K.ProgramKind;
+    }): namedTypes.File;
+}
+export interface ProgramBuilder {
+    (body: K.StatementKind[]): namedTypes.Program;
+    from(params: {
+        body: K.StatementKind[];
+        comments?: K.CommentKind[] | null;
+        directives?: K.DirectiveKind[];
+        interpreter?: K.InterpreterDirectiveKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Program;
+}
+export interface IdentifierBuilder {
+    (name: string): namedTypes.Identifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: string;
+        optional?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }): namedTypes.Identifier;
+}
+export interface BlockStatementBuilder {
+    (body: K.StatementKind[]): namedTypes.BlockStatement;
+    from(params: {
+        body: K.StatementKind[];
+        comments?: K.CommentKind[] | null;
+        directives?: K.DirectiveKind[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.BlockStatement;
+}
+export interface EmptyStatementBuilder {
+    (): namedTypes.EmptyStatement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.EmptyStatement;
+}
+export interface ExpressionStatementBuilder {
+    (expression: K.ExpressionKind): namedTypes.ExpressionStatement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExpressionStatement;
+}
+export interface IfStatementBuilder {
+    (test: K.ExpressionKind, consequent: K.StatementKind, alternate?: K.StatementKind | null): namedTypes.IfStatement;
+    from(params: {
+        alternate?: K.StatementKind | null;
+        comments?: K.CommentKind[] | null;
+        consequent: K.StatementKind;
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind;
+    }): namedTypes.IfStatement;
+}
+export interface LabeledStatementBuilder {
+    (label: K.IdentifierKind, body: K.StatementKind): namedTypes.LabeledStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        label: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.LabeledStatement;
+}
+export interface BreakStatementBuilder {
+    (label?: K.IdentifierKind | null): namedTypes.BreakStatement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        label?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.BreakStatement;
+}
+export interface ContinueStatementBuilder {
+    (label?: K.IdentifierKind | null): namedTypes.ContinueStatement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        label?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ContinueStatement;
+}
+export interface WithStatementBuilder {
+    (object: K.ExpressionKind, body: K.StatementKind): namedTypes.WithStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        object: K.ExpressionKind;
+    }): namedTypes.WithStatement;
+}
+export interface SwitchStatementBuilder {
+    (discriminant: K.ExpressionKind, cases: K.SwitchCaseKind[], lexical?: boolean): namedTypes.SwitchStatement;
+    from(params: {
+        cases: K.SwitchCaseKind[];
+        comments?: K.CommentKind[] | null;
+        discriminant: K.ExpressionKind;
+        lexical?: boolean;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SwitchStatement;
+}
+export interface SwitchCaseBuilder {
+    (test: K.ExpressionKind | null, consequent: K.StatementKind[]): namedTypes.SwitchCase;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        consequent: K.StatementKind[];
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind | null;
+    }): namedTypes.SwitchCase;
+}
+export interface ReturnStatementBuilder {
+    (argument: K.ExpressionKind | null): namedTypes.ReturnStatement;
+    from(params: {
+        argument: K.ExpressionKind | null;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ReturnStatement;
+}
+export interface ThrowStatementBuilder {
+    (argument: K.ExpressionKind): namedTypes.ThrowStatement;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ThrowStatement;
+}
+export interface TryStatementBuilder {
+    (block: K.BlockStatementKind, handler?: K.CatchClauseKind | null, finalizer?: K.BlockStatementKind | null): namedTypes.TryStatement;
+    from(params: {
+        block: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        finalizer?: K.BlockStatementKind | null;
+        guardedHandlers?: K.CatchClauseKind[];
+        handler?: K.CatchClauseKind | null;
+        handlers?: K.CatchClauseKind[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TryStatement;
+}
+export interface CatchClauseBuilder {
+    (param: K.PatternKind | null | undefined, guard: K.ExpressionKind | null | undefined, body: K.BlockStatementKind): namedTypes.CatchClause;
+    from(params: {
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        guard?: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+        param?: K.PatternKind | null;
+    }): namedTypes.CatchClause;
+}
+export interface WhileStatementBuilder {
+    (test: K.ExpressionKind, body: K.StatementKind): namedTypes.WhileStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind;
+    }): namedTypes.WhileStatement;
+}
+export interface DoWhileStatementBuilder {
+    (body: K.StatementKind, test: K.ExpressionKind): namedTypes.DoWhileStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind;
+    }): namedTypes.DoWhileStatement;
+}
+export interface ForStatementBuilder {
+    (init: K.VariableDeclarationKind | K.ExpressionKind | null, test: K.ExpressionKind | null, update: K.ExpressionKind | null, body: K.StatementKind): namedTypes.ForStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        init: K.VariableDeclarationKind | K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind | null;
+        update: K.ExpressionKind | null;
+    }): namedTypes.ForStatement;
+}
+export interface VariableDeclarationBuilder {
+    (kind: "var" | "let" | "const", declarations: (K.VariableDeclaratorKind | K.IdentifierKind)[]): namedTypes.VariableDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declarations: (K.VariableDeclaratorKind | K.IdentifierKind)[];
+        kind: "var" | "let" | "const";
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.VariableDeclaration;
+}
+export interface ForInStatementBuilder {
+    (left: K.VariableDeclarationKind | K.ExpressionKind, right: K.ExpressionKind, body: K.StatementKind): namedTypes.ForInStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        left: K.VariableDeclarationKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.ExpressionKind;
+    }): namedTypes.ForInStatement;
+}
+export interface DebuggerStatementBuilder {
+    (): namedTypes.DebuggerStatement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.DebuggerStatement;
+}
+export interface FunctionDeclarationBuilder {
+    (id: K.IdentifierKind, params: K.PatternKind[], body: K.BlockStatementKind, generator?: boolean, expression?: boolean): namedTypes.FunctionDeclaration;
+    from(params: {
+        async?: boolean;
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: boolean;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.FunctionDeclaration;
+}
+export interface FunctionExpressionBuilder {
+    (id: K.IdentifierKind | null | undefined, params: K.PatternKind[], body: K.BlockStatementKind, generator?: boolean, expression?: boolean): namedTypes.FunctionExpression;
+    from(params: {
+        async?: boolean;
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.FunctionExpression;
+}
+export interface VariableDeclaratorBuilder {
+    (id: K.PatternKind, init?: K.ExpressionKind | null): namedTypes.VariableDeclarator;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.PatternKind;
+        init?: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.VariableDeclarator;
+}
+export interface ThisExpressionBuilder {
+    (): namedTypes.ThisExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ThisExpression;
+}
+export interface ArrayExpressionBuilder {
+    (elements: (K.ExpressionKind | K.SpreadElementKind | K.RestElementKind | null)[]): namedTypes.ArrayExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        elements: (K.ExpressionKind | K.SpreadElementKind | K.RestElementKind | null)[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ArrayExpression;
+}
+export interface ObjectExpressionBuilder {
+    (properties: (K.PropertyKind | K.ObjectMethodKind | K.ObjectPropertyKind | K.SpreadPropertyKind | K.SpreadElementKind)[]): namedTypes.ObjectExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        properties: (K.PropertyKind | K.ObjectMethodKind | K.ObjectPropertyKind | K.SpreadPropertyKind | K.SpreadElementKind)[];
+    }): namedTypes.ObjectExpression;
+}
+export interface PropertyBuilder {
+    (kind: "init" | "get" | "set", key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, value: K.ExpressionKind | K.PatternKind): namedTypes.Property;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        kind: "init" | "get" | "set";
+        loc?: K.SourceLocationKind | null;
+        method?: boolean;
+        shorthand?: boolean;
+        value: K.ExpressionKind | K.PatternKind;
+    }): namedTypes.Property;
+}
+export interface LiteralBuilder {
+    (value: string | boolean | null | number | RegExp): namedTypes.Literal;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: string | boolean | null | number | RegExp;
+    }): namedTypes.Literal;
+}
+export interface SequenceExpressionBuilder {
+    (expressions: K.ExpressionKind[]): namedTypes.SequenceExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expressions: K.ExpressionKind[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SequenceExpression;
+}
+export interface UnaryExpressionBuilder {
+    (operator: "-" | "+" | "!" | "~" | "typeof" | "void" | "delete", argument: K.ExpressionKind, prefix?: boolean): namedTypes.UnaryExpression;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        operator: "-" | "+" | "!" | "~" | "typeof" | "void" | "delete";
+        prefix?: boolean;
+    }): namedTypes.UnaryExpression;
+}
+export interface BinaryExpressionBuilder {
+    (operator: "==" | "!=" | "===" | "!==" | "<" | "<=" | ">" | ">=" | "<<" | ">>" | ">>>" | "+" | "-" | "*" | "/" | "%" | "**" | "&" | "|" | "^" | "in" | "instanceof", left: K.ExpressionKind, right: K.ExpressionKind): namedTypes.BinaryExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        left: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        operator: "==" | "!=" | "===" | "!==" | "<" | "<=" | ">" | ">=" | "<<" | ">>" | ">>>" | "+" | "-" | "*" | "/" | "%" | "**" | "&" | "|" | "^" | "in" | "instanceof";
+        right: K.ExpressionKind;
+    }): namedTypes.BinaryExpression;
+}
+export interface AssignmentExpressionBuilder {
+    (operator: "=" | "+=" | "-=" | "*=" | "/=" | "%=" | "<<=" | ">>=" | ">>>=" | "|=" | "^=" | "&=", left: K.PatternKind | K.MemberExpressionKind, right: K.ExpressionKind): namedTypes.AssignmentExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        left: K.PatternKind | K.MemberExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        operator: "=" | "+=" | "-=" | "*=" | "/=" | "%=" | "<<=" | ">>=" | ">>>=" | "|=" | "^=" | "&=";
+        right: K.ExpressionKind;
+    }): namedTypes.AssignmentExpression;
+}
+export interface MemberExpressionBuilder {
+    (object: K.ExpressionKind, property: K.IdentifierKind | K.ExpressionKind, computed?: boolean): namedTypes.MemberExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        loc?: K.SourceLocationKind | null;
+        object: K.ExpressionKind;
+        property: K.IdentifierKind | K.ExpressionKind;
+    }): namedTypes.MemberExpression;
+}
+export interface UpdateExpressionBuilder {
+    (operator: "++" | "--", argument: K.ExpressionKind, prefix: boolean): namedTypes.UpdateExpression;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        operator: "++" | "--";
+        prefix: boolean;
+    }): namedTypes.UpdateExpression;
+}
+export interface LogicalExpressionBuilder {
+    (operator: "||" | "&&" | "??", left: K.ExpressionKind, right: K.ExpressionKind): namedTypes.LogicalExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        left: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        operator: "||" | "&&" | "??";
+        right: K.ExpressionKind;
+    }): namedTypes.LogicalExpression;
+}
+export interface ConditionalExpressionBuilder {
+    (test: K.ExpressionKind, consequent: K.ExpressionKind, alternate: K.ExpressionKind): namedTypes.ConditionalExpression;
+    from(params: {
+        alternate: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        consequent: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        test: K.ExpressionKind;
+    }): namedTypes.ConditionalExpression;
+}
+export interface NewExpressionBuilder {
+    (callee: K.ExpressionKind, argumentsParam: (K.ExpressionKind | K.SpreadElementKind)[]): namedTypes.NewExpression;
+    from(params: {
+        arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+        callee: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeArguments?: null | K.TypeParameterInstantiationKind;
+    }): namedTypes.NewExpression;
+}
+export interface CallExpressionBuilder {
+    (callee: K.ExpressionKind, argumentsParam: (K.ExpressionKind | K.SpreadElementKind)[]): namedTypes.CallExpression;
+    from(params: {
+        arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+        callee: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeArguments?: null | K.TypeParameterInstantiationKind;
+    }): namedTypes.CallExpression;
+}
+export interface RestElementBuilder {
+    (argument: K.PatternKind): namedTypes.RestElement;
+    from(params: {
+        argument: K.PatternKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }): namedTypes.RestElement;
+}
+export interface TypeAnnotationBuilder {
+    (typeAnnotation: K.FlowTypeKind): namedTypes.TypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.FlowTypeKind;
+    }): namedTypes.TypeAnnotation;
+}
+export interface TSTypeAnnotationBuilder {
+    (typeAnnotation: K.TSTypeKind | K.TSTypeAnnotationKind): namedTypes.TSTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind | K.TSTypeAnnotationKind;
+    }): namedTypes.TSTypeAnnotation;
+}
+export interface SpreadElementPatternBuilder {
+    (argument: K.PatternKind): namedTypes.SpreadElementPattern;
+    from(params: {
+        argument: K.PatternKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SpreadElementPattern;
+}
+export interface ArrowFunctionExpressionBuilder {
+    (params: K.PatternKind[], body: K.BlockStatementKind | K.ExpressionKind, expression?: boolean): namedTypes.ArrowFunctionExpression;
+    from(params: {
+        async?: boolean;
+        body: K.BlockStatementKind | K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: false;
+        id?: null;
+        loc?: K.SourceLocationKind | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ArrowFunctionExpression;
+}
+export interface ForOfStatementBuilder {
+    (left: K.VariableDeclarationKind | K.PatternKind, right: K.ExpressionKind, body: K.StatementKind): namedTypes.ForOfStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        left: K.VariableDeclarationKind | K.PatternKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.ExpressionKind;
+    }): namedTypes.ForOfStatement;
+}
+export interface YieldExpressionBuilder {
+    (argument: K.ExpressionKind | null, delegate?: boolean): namedTypes.YieldExpression;
+    from(params: {
+        argument: K.ExpressionKind | null;
+        comments?: K.CommentKind[] | null;
+        delegate?: boolean;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.YieldExpression;
+}
+export interface GeneratorExpressionBuilder {
+    (body: K.ExpressionKind, blocks: K.ComprehensionBlockKind[], filter: K.ExpressionKind | null): namedTypes.GeneratorExpression;
+    from(params: {
+        blocks: K.ComprehensionBlockKind[];
+        body: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        filter: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.GeneratorExpression;
+}
+export interface ComprehensionBlockBuilder {
+    (left: K.PatternKind, right: K.ExpressionKind, each: boolean): namedTypes.ComprehensionBlock;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        each: boolean;
+        left: K.PatternKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.ExpressionKind;
+    }): namedTypes.ComprehensionBlock;
+}
+export interface ComprehensionExpressionBuilder {
+    (body: K.ExpressionKind, blocks: K.ComprehensionBlockKind[], filter: K.ExpressionKind | null): namedTypes.ComprehensionExpression;
+    from(params: {
+        blocks: K.ComprehensionBlockKind[];
+        body: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        filter: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ComprehensionExpression;
+}
+export interface ObjectPropertyBuilder {
+    (key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, value: K.ExpressionKind | K.PatternKind): namedTypes.ObjectProperty;
+    from(params: {
+        accessibility?: K.LiteralKind | null;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        shorthand?: boolean;
+        value: K.ExpressionKind | K.PatternKind;
+    }): namedTypes.ObjectProperty;
+}
+export interface PropertyPatternBuilder {
+    (key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, pattern: K.PatternKind): namedTypes.PropertyPattern;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        pattern: K.PatternKind;
+    }): namedTypes.PropertyPattern;
+}
+export interface ObjectPatternBuilder {
+    (properties: (K.PropertyKind | K.PropertyPatternKind | K.SpreadPropertyPatternKind | K.SpreadPropertyKind | K.ObjectPropertyKind | K.RestPropertyKind)[]): namedTypes.ObjectPattern;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        decorators?: K.DecoratorKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        properties: (K.PropertyKind | K.PropertyPatternKind | K.SpreadPropertyPatternKind | K.SpreadPropertyKind | K.ObjectPropertyKind | K.RestPropertyKind)[];
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }): namedTypes.ObjectPattern;
+}
+export interface ArrayPatternBuilder {
+    (elements: (K.PatternKind | K.SpreadElementKind | null)[]): namedTypes.ArrayPattern;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        elements: (K.PatternKind | K.SpreadElementKind | null)[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ArrayPattern;
+}
+export interface MethodDefinitionBuilder {
+    (kind: "constructor" | "method" | "get" | "set", key: K.ExpressionKind, value: K.FunctionKind, staticParam?: boolean): namedTypes.MethodDefinition;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        key: K.ExpressionKind;
+        kind: "constructor" | "method" | "get" | "set";
+        loc?: K.SourceLocationKind | null;
+        static?: boolean;
+        value: K.FunctionKind;
+    }): namedTypes.MethodDefinition;
+}
+export interface SpreadElementBuilder {
+    (argument: K.ExpressionKind): namedTypes.SpreadElement;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SpreadElement;
+}
+export interface AssignmentPatternBuilder {
+    (left: K.PatternKind, right: K.ExpressionKind): namedTypes.AssignmentPattern;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        left: K.PatternKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.ExpressionKind;
+    }): namedTypes.AssignmentPattern;
+}
+export interface ClassPropertyDefinitionBuilder {
+    (definition: K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind): namedTypes.ClassPropertyDefinition;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        definition: K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ClassPropertyDefinition;
+}
+export interface ClassPropertyBuilder {
+    (key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, value: K.ExpressionKind | null, typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null, staticParam?: boolean): namedTypes.ClassProperty;
+    from(params: {
+        access?: "public" | "private" | "protected" | undefined;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        static?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        value: K.ExpressionKind | null;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }): namedTypes.ClassProperty;
+}
+export interface ClassBodyBuilder {
+    (body: (K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind | K.ClassPrivatePropertyKind | K.ClassMethodKind | K.ClassPrivateMethodKind | K.TSDeclareMethodKind | K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[]): namedTypes.ClassBody;
+    from(params: {
+        body: (K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind | K.ClassPrivatePropertyKind | K.ClassMethodKind | K.ClassPrivateMethodKind | K.TSDeclareMethodKind | K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ClassBody;
+}
+export interface ClassDeclarationBuilder {
+    (id: K.IdentifierKind | null, body: K.ClassBodyKind, superClass?: K.ExpressionKind | null): namedTypes.ClassDeclaration;
+    from(params: {
+        body: K.ClassBodyKind;
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind | null;
+        implements?: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+        loc?: K.SourceLocationKind | null;
+        superClass?: K.ExpressionKind | null;
+        superTypeParameters?: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ClassDeclaration;
+}
+export interface ClassExpressionBuilder {
+    (id: K.IdentifierKind | null | undefined, body: K.ClassBodyKind, superClass?: K.ExpressionKind | null): namedTypes.ClassExpression;
+    from(params: {
+        body: K.ClassBodyKind;
+        comments?: K.CommentKind[] | null;
+        id?: K.IdentifierKind | null;
+        implements?: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+        loc?: K.SourceLocationKind | null;
+        superClass?: K.ExpressionKind | null;
+        superTypeParameters?: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ClassExpression;
+}
+export interface ImportSpecifierBuilder {
+    (imported: K.IdentifierKind, local?: K.IdentifierKind | null): namedTypes.ImportSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id?: K.IdentifierKind | null;
+        imported: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        local?: K.IdentifierKind | null;
+        name?: K.IdentifierKind | null;
+    }): namedTypes.ImportSpecifier;
+}
+export interface ImportNamespaceSpecifierBuilder {
+    (local?: K.IdentifierKind | null): namedTypes.ImportNamespaceSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        local?: K.IdentifierKind | null;
+        name?: K.IdentifierKind | null;
+    }): namedTypes.ImportNamespaceSpecifier;
+}
+export interface ImportDefaultSpecifierBuilder {
+    (local?: K.IdentifierKind | null): namedTypes.ImportDefaultSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        local?: K.IdentifierKind | null;
+        name?: K.IdentifierKind | null;
+    }): namedTypes.ImportDefaultSpecifier;
+}
+export interface ImportDeclarationBuilder {
+    (specifiers: (K.ImportSpecifierKind | K.ImportNamespaceSpecifierKind | K.ImportDefaultSpecifierKind)[] | undefined, source: K.LiteralKind, importKind?: "value" | "type"): namedTypes.ImportDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        importKind?: "value" | "type";
+        loc?: K.SourceLocationKind | null;
+        source: K.LiteralKind;
+        specifiers?: (K.ImportSpecifierKind | K.ImportNamespaceSpecifierKind | K.ImportDefaultSpecifierKind)[];
+    }): namedTypes.ImportDeclaration;
+}
+export interface TaggedTemplateExpressionBuilder {
+    (tag: K.ExpressionKind, quasi: K.TemplateLiteralKind): namedTypes.TaggedTemplateExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        quasi: K.TemplateLiteralKind;
+        tag: K.ExpressionKind;
+    }): namedTypes.TaggedTemplateExpression;
+}
+export interface TemplateLiteralBuilder {
+    (quasis: K.TemplateElementKind[], expressions: K.ExpressionKind[]): namedTypes.TemplateLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expressions: K.ExpressionKind[];
+        loc?: K.SourceLocationKind | null;
+        quasis: K.TemplateElementKind[];
+    }): namedTypes.TemplateLiteral;
+}
+export interface TemplateElementBuilder {
+    (value: {
+        cooked: string;
+        raw: string;
+    }, tail: boolean): namedTypes.TemplateElement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        tail: boolean;
+        value: {
+            cooked: string;
+            raw: string;
+        };
+    }): namedTypes.TemplateElement;
+}
+export interface SpreadPropertyBuilder {
+    (argument: K.ExpressionKind): namedTypes.SpreadProperty;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SpreadProperty;
+}
+export interface SpreadPropertyPatternBuilder {
+    (argument: K.PatternKind): namedTypes.SpreadPropertyPattern;
+    from(params: {
+        argument: K.PatternKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.SpreadPropertyPattern;
+}
+export interface AwaitExpressionBuilder {
+    (argument: K.ExpressionKind | null, all?: boolean): namedTypes.AwaitExpression;
+    from(params: {
+        all?: boolean;
+        argument: K.ExpressionKind | null;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.AwaitExpression;
+}
+export interface JSXAttributeBuilder {
+    (name: K.JSXIdentifierKind | K.JSXNamespacedNameKind, value?: K.LiteralKind | K.JSXExpressionContainerKind | null): namedTypes.JSXAttribute;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind;
+        value?: K.LiteralKind | K.JSXExpressionContainerKind | null;
+    }): namedTypes.JSXAttribute;
+}
+export interface JSXIdentifierBuilder {
+    (name: string): namedTypes.JSXIdentifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: string;
+        optional?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }): namedTypes.JSXIdentifier;
+}
+export interface JSXNamespacedNameBuilder {
+    (namespace: K.JSXIdentifierKind, name: K.JSXIdentifierKind): namedTypes.JSXNamespacedName;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: K.JSXIdentifierKind;
+        namespace: K.JSXIdentifierKind;
+    }): namedTypes.JSXNamespacedName;
+}
+export interface JSXExpressionContainerBuilder {
+    (expression: K.ExpressionKind): namedTypes.JSXExpressionContainer;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXExpressionContainer;
+}
+export interface JSXMemberExpressionBuilder {
+    (object: K.JSXIdentifierKind | K.JSXMemberExpressionKind, property: K.JSXIdentifierKind): namedTypes.JSXMemberExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        loc?: K.SourceLocationKind | null;
+        object: K.JSXIdentifierKind | K.JSXMemberExpressionKind;
+        property: K.JSXIdentifierKind;
+    }): namedTypes.JSXMemberExpression;
+}
+export interface JSXSpreadAttributeBuilder {
+    (argument: K.ExpressionKind): namedTypes.JSXSpreadAttribute;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXSpreadAttribute;
+}
+export interface JSXElementBuilder {
+    (openingElement: K.JSXOpeningElementKind, closingElement?: K.JSXClosingElementKind | null, children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[]): namedTypes.JSXElement;
+    from(params: {
+        attributes?: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+        children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+        closingElement?: K.JSXClosingElementKind | null;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name?: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+        openingElement: K.JSXOpeningElementKind;
+        selfClosing?: boolean;
+    }): namedTypes.JSXElement;
+}
+export interface JSXOpeningElementBuilder {
+    (name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind, attributes?: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[], selfClosing?: boolean): namedTypes.JSXOpeningElement;
+    from(params: {
+        attributes?: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+        selfClosing?: boolean;
+    }): namedTypes.JSXOpeningElement;
+}
+export interface JSXClosingElementBuilder {
+    (name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind): namedTypes.JSXClosingElement;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+    }): namedTypes.JSXClosingElement;
+}
+export interface JSXFragmentBuilder {
+    (openingElement: K.JSXOpeningFragmentKind, closingElement: K.JSXClosingFragmentKind, children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[]): namedTypes.JSXFragment;
+    from(params: {
+        children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+        closingElement: K.JSXClosingFragmentKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        openingElement: K.JSXOpeningFragmentKind;
+    }): namedTypes.JSXFragment;
+}
+export interface JSXTextBuilder {
+    (value: string): namedTypes.JSXText;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: string;
+    }): namedTypes.JSXText;
+}
+export interface JSXOpeningFragmentBuilder {
+    (): namedTypes.JSXOpeningFragment;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXOpeningFragment;
+}
+export interface JSXClosingFragmentBuilder {
+    (): namedTypes.JSXClosingFragment;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXClosingFragment;
+}
+export interface JSXEmptyExpressionBuilder {
+    (): namedTypes.JSXEmptyExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXEmptyExpression;
+}
+export interface JSXSpreadChildBuilder {
+    (expression: K.ExpressionKind): namedTypes.JSXSpreadChild;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.JSXSpreadChild;
+}
+export interface TypeParameterDeclarationBuilder {
+    (params: K.TypeParameterKind[]): namedTypes.TypeParameterDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.TypeParameterKind[];
+    }): namedTypes.TypeParameterDeclaration;
+}
+export interface TSTypeParameterDeclarationBuilder {
+    (params: K.TSTypeParameterKind[]): namedTypes.TSTypeParameterDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.TSTypeParameterKind[];
+    }): namedTypes.TSTypeParameterDeclaration;
+}
+export interface TypeParameterInstantiationBuilder {
+    (params: K.FlowTypeKind[]): namedTypes.TypeParameterInstantiation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.FlowTypeKind[];
+    }): namedTypes.TypeParameterInstantiation;
+}
+export interface TSTypeParameterInstantiationBuilder {
+    (params: K.TSTypeKind[]): namedTypes.TSTypeParameterInstantiation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.TSTypeKind[];
+    }): namedTypes.TSTypeParameterInstantiation;
+}
+export interface ClassImplementsBuilder {
+    (id: K.IdentifierKind): namedTypes.ClassImplements;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        superClass?: K.ExpressionKind | null;
+        typeParameters?: K.TypeParameterInstantiationKind | null;
+    }): namedTypes.ClassImplements;
+}
+export interface TSExpressionWithTypeArgumentsBuilder {
+    (expression: K.IdentifierKind | K.TSQualifiedNameKind, typeParameters?: K.TSTypeParameterInstantiationKind | null): namedTypes.TSExpressionWithTypeArguments;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.IdentifierKind | K.TSQualifiedNameKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TSTypeParameterInstantiationKind | null;
+    }): namedTypes.TSExpressionWithTypeArguments;
+}
+export interface AnyTypeAnnotationBuilder {
+    (): namedTypes.AnyTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.AnyTypeAnnotation;
+}
+export interface EmptyTypeAnnotationBuilder {
+    (): namedTypes.EmptyTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.EmptyTypeAnnotation;
+}
+export interface MixedTypeAnnotationBuilder {
+    (): namedTypes.MixedTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.MixedTypeAnnotation;
+}
+export interface VoidTypeAnnotationBuilder {
+    (): namedTypes.VoidTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.VoidTypeAnnotation;
+}
+export interface NumberTypeAnnotationBuilder {
+    (): namedTypes.NumberTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.NumberTypeAnnotation;
+}
+export interface NumberLiteralTypeAnnotationBuilder {
+    (value: number, raw: string): namedTypes.NumberLiteralTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        raw: string;
+        value: number;
+    }): namedTypes.NumberLiteralTypeAnnotation;
+}
+export interface NumericLiteralTypeAnnotationBuilder {
+    (value: number, raw: string): namedTypes.NumericLiteralTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        raw: string;
+        value: number;
+    }): namedTypes.NumericLiteralTypeAnnotation;
+}
+export interface StringTypeAnnotationBuilder {
+    (): namedTypes.StringTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.StringTypeAnnotation;
+}
+export interface StringLiteralTypeAnnotationBuilder {
+    (value: string, raw: string): namedTypes.StringLiteralTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        raw: string;
+        value: string;
+    }): namedTypes.StringLiteralTypeAnnotation;
+}
+export interface BooleanTypeAnnotationBuilder {
+    (): namedTypes.BooleanTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.BooleanTypeAnnotation;
+}
+export interface BooleanLiteralTypeAnnotationBuilder {
+    (value: boolean, raw: string): namedTypes.BooleanLiteralTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        raw: string;
+        value: boolean;
+    }): namedTypes.BooleanLiteralTypeAnnotation;
+}
+export interface NullableTypeAnnotationBuilder {
+    (typeAnnotation: K.FlowTypeKind): namedTypes.NullableTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.FlowTypeKind;
+    }): namedTypes.NullableTypeAnnotation;
+}
+export interface NullLiteralTypeAnnotationBuilder {
+    (): namedTypes.NullLiteralTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.NullLiteralTypeAnnotation;
+}
+export interface NullTypeAnnotationBuilder {
+    (): namedTypes.NullTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.NullTypeAnnotation;
+}
+export interface ThisTypeAnnotationBuilder {
+    (): namedTypes.ThisTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ThisTypeAnnotation;
+}
+export interface ExistsTypeAnnotationBuilder {
+    (): namedTypes.ExistsTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExistsTypeAnnotation;
+}
+export interface ExistentialTypeParamBuilder {
+    (): namedTypes.ExistentialTypeParam;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExistentialTypeParam;
+}
+export interface FunctionTypeAnnotationBuilder {
+    (params: K.FunctionTypeParamKind[], returnType: K.FlowTypeKind, rest: K.FunctionTypeParamKind | null, typeParameters: K.TypeParameterDeclarationKind | null): namedTypes.FunctionTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.FunctionTypeParamKind[];
+        rest: K.FunctionTypeParamKind | null;
+        returnType: K.FlowTypeKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.FunctionTypeAnnotation;
+}
+export interface FunctionTypeParamBuilder {
+    (name: K.IdentifierKind, typeAnnotation: K.FlowTypeKind, optional: boolean): namedTypes.FunctionTypeParam;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: K.IdentifierKind;
+        optional: boolean;
+        typeAnnotation: K.FlowTypeKind;
+    }): namedTypes.FunctionTypeParam;
+}
+export interface ArrayTypeAnnotationBuilder {
+    (elementType: K.FlowTypeKind): namedTypes.ArrayTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        elementType: K.FlowTypeKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ArrayTypeAnnotation;
+}
+export interface ObjectTypeAnnotationBuilder {
+    (properties: (K.ObjectTypePropertyKind | K.ObjectTypeSpreadPropertyKind)[], indexers?: K.ObjectTypeIndexerKind[], callProperties?: K.ObjectTypeCallPropertyKind[]): namedTypes.ObjectTypeAnnotation;
+    from(params: {
+        callProperties?: K.ObjectTypeCallPropertyKind[];
+        comments?: K.CommentKind[] | null;
+        exact?: boolean;
+        indexers?: K.ObjectTypeIndexerKind[];
+        inexact?: boolean | undefined;
+        internalSlots?: K.ObjectTypeInternalSlotKind[];
+        loc?: K.SourceLocationKind | null;
+        properties: (K.ObjectTypePropertyKind | K.ObjectTypeSpreadPropertyKind)[];
+    }): namedTypes.ObjectTypeAnnotation;
+}
+export interface ObjectTypePropertyBuilder {
+    (key: K.LiteralKind | K.IdentifierKind, value: K.FlowTypeKind, optional: boolean): namedTypes.ObjectTypeProperty;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        key: K.LiteralKind | K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        optional: boolean;
+        value: K.FlowTypeKind;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }): namedTypes.ObjectTypeProperty;
+}
+export interface ObjectTypeSpreadPropertyBuilder {
+    (argument: K.FlowTypeKind): namedTypes.ObjectTypeSpreadProperty;
+    from(params: {
+        argument: K.FlowTypeKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ObjectTypeSpreadProperty;
+}
+export interface ObjectTypeIndexerBuilder {
+    (id: K.IdentifierKind, key: K.FlowTypeKind, value: K.FlowTypeKind): namedTypes.ObjectTypeIndexer;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        key: K.FlowTypeKind;
+        loc?: K.SourceLocationKind | null;
+        value: K.FlowTypeKind;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }): namedTypes.ObjectTypeIndexer;
+}
+export interface ObjectTypeCallPropertyBuilder {
+    (value: K.FunctionTypeAnnotationKind): namedTypes.ObjectTypeCallProperty;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        static?: boolean;
+        value: K.FunctionTypeAnnotationKind;
+    }): namedTypes.ObjectTypeCallProperty;
+}
+export interface ObjectTypeInternalSlotBuilder {
+    (id: K.IdentifierKind, value: K.FlowTypeKind, optional: boolean, staticParam: boolean, method: boolean): namedTypes.ObjectTypeInternalSlot;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        method: boolean;
+        optional: boolean;
+        static: boolean;
+        value: K.FlowTypeKind;
+    }): namedTypes.ObjectTypeInternalSlot;
+}
+export interface VarianceBuilder {
+    (kind: "plus" | "minus"): namedTypes.Variance;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        kind: "plus" | "minus";
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Variance;
+}
+export interface QualifiedTypeIdentifierBuilder {
+    (qualification: K.IdentifierKind | K.QualifiedTypeIdentifierKind, id: K.IdentifierKind): namedTypes.QualifiedTypeIdentifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        qualification: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+    }): namedTypes.QualifiedTypeIdentifier;
+}
+export interface GenericTypeAnnotationBuilder {
+    (id: K.IdentifierKind | K.QualifiedTypeIdentifierKind, typeParameters: K.TypeParameterInstantiationKind | null): namedTypes.GenericTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters: K.TypeParameterInstantiationKind | null;
+    }): namedTypes.GenericTypeAnnotation;
+}
+export interface MemberTypeAnnotationBuilder {
+    (object: K.IdentifierKind, property: K.MemberTypeAnnotationKind | K.GenericTypeAnnotationKind): namedTypes.MemberTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        object: K.IdentifierKind;
+        property: K.MemberTypeAnnotationKind | K.GenericTypeAnnotationKind;
+    }): namedTypes.MemberTypeAnnotation;
+}
+export interface UnionTypeAnnotationBuilder {
+    (types: K.FlowTypeKind[]): namedTypes.UnionTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        types: K.FlowTypeKind[];
+    }): namedTypes.UnionTypeAnnotation;
+}
+export interface IntersectionTypeAnnotationBuilder {
+    (types: K.FlowTypeKind[]): namedTypes.IntersectionTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        types: K.FlowTypeKind[];
+    }): namedTypes.IntersectionTypeAnnotation;
+}
+export interface TypeofTypeAnnotationBuilder {
+    (argument: K.FlowTypeKind): namedTypes.TypeofTypeAnnotation;
+    from(params: {
+        argument: K.FlowTypeKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TypeofTypeAnnotation;
+}
+export interface TypeParameterBuilder {
+    (name: string, variance?: K.VarianceKind | "plus" | "minus" | null, bound?: K.TypeAnnotationKind | null): namedTypes.TypeParameter;
+    from(params: {
+        bound?: K.TypeAnnotationKind | null;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        name: string;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }): namedTypes.TypeParameter;
+}
+export interface InterfaceTypeAnnotationBuilder {
+    (body: K.ObjectTypeAnnotationKind, extendsParam?: K.InterfaceExtendsKind[] | null): namedTypes.InterfaceTypeAnnotation;
+    from(params: {
+        body: K.ObjectTypeAnnotationKind;
+        comments?: K.CommentKind[] | null;
+        extends?: K.InterfaceExtendsKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.InterfaceTypeAnnotation;
+}
+export interface InterfaceExtendsBuilder {
+    (id: K.IdentifierKind): namedTypes.InterfaceExtends;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TypeParameterInstantiationKind | null;
+    }): namedTypes.InterfaceExtends;
+}
+export interface InterfaceDeclarationBuilder {
+    (id: K.IdentifierKind, body: K.ObjectTypeAnnotationKind, extendsParam: K.InterfaceExtendsKind[]): namedTypes.InterfaceDeclaration;
+    from(params: {
+        body: K.ObjectTypeAnnotationKind;
+        comments?: K.CommentKind[] | null;
+        extends: K.InterfaceExtendsKind[];
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.InterfaceDeclaration;
+}
+export interface DeclareInterfaceBuilder {
+    (id: K.IdentifierKind, body: K.ObjectTypeAnnotationKind, extendsParam: K.InterfaceExtendsKind[]): namedTypes.DeclareInterface;
+    from(params: {
+        body: K.ObjectTypeAnnotationKind;
+        comments?: K.CommentKind[] | null;
+        extends: K.InterfaceExtendsKind[];
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.DeclareInterface;
+}
+export interface TypeAliasBuilder {
+    (id: K.IdentifierKind, typeParameters: K.TypeParameterDeclarationKind | null, right: K.FlowTypeKind): namedTypes.TypeAlias;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.FlowTypeKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.TypeAlias;
+}
+export interface OpaqueTypeBuilder {
+    (id: K.IdentifierKind, typeParameters: K.TypeParameterDeclarationKind | null, impltype: K.FlowTypeKind, supertype: K.FlowTypeKind): namedTypes.OpaqueType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        impltype: K.FlowTypeKind;
+        loc?: K.SourceLocationKind | null;
+        supertype: K.FlowTypeKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.OpaqueType;
+}
+export interface DeclareTypeAliasBuilder {
+    (id: K.IdentifierKind, typeParameters: K.TypeParameterDeclarationKind | null, right: K.FlowTypeKind): namedTypes.DeclareTypeAlias;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.FlowTypeKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.DeclareTypeAlias;
+}
+export interface DeclareOpaqueTypeBuilder {
+    (id: K.IdentifierKind, typeParameters: K.TypeParameterDeclarationKind | null): namedTypes.DeclareOpaqueType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.FlowTypeKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.DeclareOpaqueType;
+}
+export interface TypeCastExpressionBuilder {
+    (expression: K.ExpressionKind, typeAnnotation: K.TypeAnnotationKind): namedTypes.TypeCastExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TypeAnnotationKind;
+    }): namedTypes.TypeCastExpression;
+}
+export interface TupleTypeAnnotationBuilder {
+    (types: K.FlowTypeKind[]): namedTypes.TupleTypeAnnotation;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        types: K.FlowTypeKind[];
+    }): namedTypes.TupleTypeAnnotation;
+}
+export interface DeclareVariableBuilder {
+    (id: K.IdentifierKind): namedTypes.DeclareVariable;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.DeclareVariable;
+}
+export interface DeclareFunctionBuilder {
+    (id: K.IdentifierKind): namedTypes.DeclareFunction;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.DeclareFunction;
+}
+export interface DeclareClassBuilder {
+    (id: K.IdentifierKind): namedTypes.DeclareClass;
+    from(params: {
+        body: K.ObjectTypeAnnotationKind;
+        comments?: K.CommentKind[] | null;
+        extends: K.InterfaceExtendsKind[];
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | null;
+    }): namedTypes.DeclareClass;
+}
+export interface DeclareModuleBuilder {
+    (id: K.IdentifierKind | K.LiteralKind, body: K.BlockStatementKind): namedTypes.DeclareModule;
+    from(params: {
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind | K.LiteralKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.DeclareModule;
+}
+export interface DeclareModuleExportsBuilder {
+    (typeAnnotation: K.TypeAnnotationKind): namedTypes.DeclareModuleExports;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TypeAnnotationKind;
+    }): namedTypes.DeclareModuleExports;
+}
+export interface DeclareExportDeclarationBuilder {
+    (defaultParam: boolean, declaration: K.DeclareVariableKind | K.DeclareFunctionKind | K.DeclareClassKind | K.FlowTypeKind | null, specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[], source?: K.LiteralKind | null): namedTypes.DeclareExportDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declaration: K.DeclareVariableKind | K.DeclareFunctionKind | K.DeclareClassKind | K.FlowTypeKind | null;
+        default: boolean;
+        loc?: K.SourceLocationKind | null;
+        source?: K.LiteralKind | null;
+        specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+    }): namedTypes.DeclareExportDeclaration;
+}
+export interface ExportSpecifierBuilder {
+    (local: K.IdentifierKind | null | undefined, exported: K.IdentifierKind): namedTypes.ExportSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        exported: K.IdentifierKind;
+        id?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        local?: K.IdentifierKind | null;
+        name?: K.IdentifierKind | null;
+    }): namedTypes.ExportSpecifier;
+}
+export interface ExportBatchSpecifierBuilder {
+    (): namedTypes.ExportBatchSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExportBatchSpecifier;
+}
+export interface DeclareExportAllDeclarationBuilder {
+    (source?: K.LiteralKind | null): namedTypes.DeclareExportAllDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        source?: K.LiteralKind | null;
+    }): namedTypes.DeclareExportAllDeclaration;
+}
+export interface InferredPredicateBuilder {
+    (): namedTypes.InferredPredicate;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.InferredPredicate;
+}
+export interface DeclaredPredicateBuilder {
+    (value: K.ExpressionKind): namedTypes.DeclaredPredicate;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        value: K.ExpressionKind;
+    }): namedTypes.DeclaredPredicate;
+}
+export interface ExportDeclarationBuilder {
+    (defaultParam: boolean, declaration: K.DeclarationKind | K.ExpressionKind | null, specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[], source?: K.LiteralKind | null): namedTypes.ExportDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declaration: K.DeclarationKind | K.ExpressionKind | null;
+        default: boolean;
+        loc?: K.SourceLocationKind | null;
+        source?: K.LiteralKind | null;
+        specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+    }): namedTypes.ExportDeclaration;
+}
+export interface BlockBuilder {
+    (value: string, leading?: boolean, trailing?: boolean): namedTypes.Block;
+    from(params: {
+        leading?: boolean;
+        loc?: K.SourceLocationKind | null;
+        trailing?: boolean;
+        value: string;
+    }): namedTypes.Block;
+}
+export interface LineBuilder {
+    (value: string, leading?: boolean, trailing?: boolean): namedTypes.Line;
+    from(params: {
+        leading?: boolean;
+        loc?: K.SourceLocationKind | null;
+        trailing?: boolean;
+        value: string;
+    }): namedTypes.Line;
+}
+export interface NoopBuilder {
+    (): namedTypes.Noop;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Noop;
+}
+export interface DoExpressionBuilder {
+    (body: K.StatementKind[]): namedTypes.DoExpression;
+    from(params: {
+        body: K.StatementKind[];
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.DoExpression;
+}
+export interface SuperBuilder {
+    (): namedTypes.Super;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Super;
+}
+export interface BindExpressionBuilder {
+    (object: K.ExpressionKind | null, callee: K.ExpressionKind): namedTypes.BindExpression;
+    from(params: {
+        callee: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        object: K.ExpressionKind | null;
+    }): namedTypes.BindExpression;
+}
+export interface DecoratorBuilder {
+    (expression: K.ExpressionKind): namedTypes.Decorator;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Decorator;
+}
+export interface MetaPropertyBuilder {
+    (meta: K.IdentifierKind, property: K.IdentifierKind): namedTypes.MetaProperty;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        meta: K.IdentifierKind;
+        property: K.IdentifierKind;
+    }): namedTypes.MetaProperty;
+}
+export interface ParenthesizedExpressionBuilder {
+    (expression: K.ExpressionKind): namedTypes.ParenthesizedExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ParenthesizedExpression;
+}
+export interface ExportDefaultDeclarationBuilder {
+    (declaration: K.DeclarationKind | K.ExpressionKind): namedTypes.ExportDefaultDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declaration: K.DeclarationKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExportDefaultDeclaration;
+}
+export interface ExportNamedDeclarationBuilder {
+    (declaration: K.DeclarationKind | null, specifiers?: K.ExportSpecifierKind[], source?: K.LiteralKind | null): namedTypes.ExportNamedDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declaration: K.DeclarationKind | null;
+        loc?: K.SourceLocationKind | null;
+        source?: K.LiteralKind | null;
+        specifiers?: K.ExportSpecifierKind[];
+    }): namedTypes.ExportNamedDeclaration;
+}
+export interface ExportNamespaceSpecifierBuilder {
+    (exported: K.IdentifierKind): namedTypes.ExportNamespaceSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        exported: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExportNamespaceSpecifier;
+}
+export interface ExportDefaultSpecifierBuilder {
+    (exported: K.IdentifierKind): namedTypes.ExportDefaultSpecifier;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        exported: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.ExportDefaultSpecifier;
+}
+export interface ExportAllDeclarationBuilder {
+    (exported: K.IdentifierKind | null, source: K.LiteralKind): namedTypes.ExportAllDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        exported: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        source: K.LiteralKind;
+    }): namedTypes.ExportAllDeclaration;
+}
+export interface CommentBlockBuilder {
+    (value: string, leading?: boolean, trailing?: boolean): namedTypes.CommentBlock;
+    from(params: {
+        leading?: boolean;
+        loc?: K.SourceLocationKind | null;
+        trailing?: boolean;
+        value: string;
+    }): namedTypes.CommentBlock;
+}
+export interface CommentLineBuilder {
+    (value: string, leading?: boolean, trailing?: boolean): namedTypes.CommentLine;
+    from(params: {
+        leading?: boolean;
+        loc?: K.SourceLocationKind | null;
+        trailing?: boolean;
+        value: string;
+    }): namedTypes.CommentLine;
+}
+export interface DirectiveBuilder {
+    (value: K.DirectiveLiteralKind): namedTypes.Directive;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        value: K.DirectiveLiteralKind;
+    }): namedTypes.Directive;
+}
+export interface DirectiveLiteralBuilder {
+    (value?: string): namedTypes.DirectiveLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        value?: string;
+    }): namedTypes.DirectiveLiteral;
+}
+export interface InterpreterDirectiveBuilder {
+    (value: string): namedTypes.InterpreterDirective;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        value: string;
+    }): namedTypes.InterpreterDirective;
+}
+export interface StringLiteralBuilder {
+    (value: string): namedTypes.StringLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: string;
+    }): namedTypes.StringLiteral;
+}
+export interface NumericLiteralBuilder {
+    (value: number): namedTypes.NumericLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        extra?: {
+            rawValue: number;
+            raw: string;
+        };
+        loc?: K.SourceLocationKind | null;
+        raw?: string | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: number;
+    }): namedTypes.NumericLiteral;
+}
+export interface BigIntLiteralBuilder {
+    (value: string | number): namedTypes.BigIntLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        extra?: {
+            rawValue: string;
+            raw: string;
+        };
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: string | number;
+    }): namedTypes.BigIntLiteral;
+}
+export interface NullLiteralBuilder {
+    (): namedTypes.NullLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value?: null;
+    }): namedTypes.NullLiteral;
+}
+export interface BooleanLiteralBuilder {
+    (value: boolean): namedTypes.BooleanLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value: boolean;
+    }): namedTypes.BooleanLiteral;
+}
+export interface RegExpLiteralBuilder {
+    (pattern: string, flags: string): namedTypes.RegExpLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        flags: string;
+        loc?: K.SourceLocationKind | null;
+        pattern: string;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+        value?: RegExp;
+    }): namedTypes.RegExpLiteral;
+}
+export interface ObjectMethodBuilder {
+    (kind: "method" | "get" | "set", key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, params: K.PatternKind[], body: K.BlockStatementKind, computed?: boolean): namedTypes.ObjectMethod;
+    from(params: {
+        accessibility?: K.LiteralKind | null;
+        async?: boolean;
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        kind: "method" | "get" | "set";
+        loc?: K.SourceLocationKind | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ObjectMethod;
+}
+export interface ClassPrivatePropertyBuilder {
+    (key: K.PrivateNameKind, value?: K.ExpressionKind | null): namedTypes.ClassPrivateProperty;
+    from(params: {
+        access?: "public" | "private" | "protected" | undefined;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        key: K.PrivateNameKind;
+        loc?: K.SourceLocationKind | null;
+        static?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        value?: K.ExpressionKind | null;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }): namedTypes.ClassPrivateProperty;
+}
+export interface ClassMethodBuilder {
+    (kind: "get" | "set" | "method" | "constructor" | undefined, key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind, params: K.PatternKind[], body: K.BlockStatementKind, computed?: boolean, staticParam?: boolean | null): namedTypes.ClassMethod;
+    from(params: {
+        abstract?: boolean | null;
+        access?: "public" | "private" | "protected" | null;
+        accessibility?: "public" | "private" | "protected" | null;
+        async?: boolean;
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        static?: boolean | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ClassMethod;
+}
+export interface ClassPrivateMethodBuilder {
+    (key: K.PrivateNameKind, params: K.PatternKind[], body: K.BlockStatementKind, kind?: "get" | "set" | "method" | "constructor", computed?: boolean, staticParam?: boolean | null): namedTypes.ClassPrivateMethod;
+    from(params: {
+        abstract?: boolean | null;
+        access?: "public" | "private" | "protected" | null;
+        accessibility?: "public" | "private" | "protected" | null;
+        async?: boolean;
+        body: K.BlockStatementKind;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        defaults?: (K.ExpressionKind | null)[];
+        expression?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        key: K.PrivateNameKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean | null;
+        params: K.PatternKind[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        static?: boolean | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }): namedTypes.ClassPrivateMethod;
+}
+export interface PrivateNameBuilder {
+    (id: K.IdentifierKind): namedTypes.PrivateName;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.PrivateName;
+}
+export interface RestPropertyBuilder {
+    (argument: K.ExpressionKind): namedTypes.RestProperty;
+    from(params: {
+        argument: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.RestProperty;
+}
+export interface ForAwaitStatementBuilder {
+    (left: K.VariableDeclarationKind | K.ExpressionKind, right: K.ExpressionKind, body: K.StatementKind): namedTypes.ForAwaitStatement;
+    from(params: {
+        body: K.StatementKind;
+        comments?: K.CommentKind[] | null;
+        left: K.VariableDeclarationKind | K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.ExpressionKind;
+    }): namedTypes.ForAwaitStatement;
+}
+export interface ImportBuilder {
+    (): namedTypes.Import;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.Import;
+}
+export interface TSQualifiedNameBuilder {
+    (left: K.IdentifierKind | K.TSQualifiedNameKind, right: K.IdentifierKind | K.TSQualifiedNameKind): namedTypes.TSQualifiedName;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        left: K.IdentifierKind | K.TSQualifiedNameKind;
+        loc?: K.SourceLocationKind | null;
+        right: K.IdentifierKind | K.TSQualifiedNameKind;
+    }): namedTypes.TSQualifiedName;
+}
+export interface TSTypeReferenceBuilder {
+    (typeName: K.IdentifierKind | K.TSQualifiedNameKind, typeParameters?: K.TSTypeParameterInstantiationKind | null): namedTypes.TSTypeReference;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeName: K.IdentifierKind | K.TSQualifiedNameKind;
+        typeParameters?: K.TSTypeParameterInstantiationKind | null;
+    }): namedTypes.TSTypeReference;
+}
+export interface TSAsExpressionBuilder {
+    (expression: K.ExpressionKind, typeAnnotation: K.TSTypeKind): namedTypes.TSAsExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        extra?: {
+            parenthesized: boolean;
+        } | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSAsExpression;
+}
+export interface TSNonNullExpressionBuilder {
+    (expression: K.ExpressionKind): namedTypes.TSNonNullExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSNonNullExpression;
+}
+export interface TSAnyKeywordBuilder {
+    (): namedTypes.TSAnyKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSAnyKeyword;
+}
+export interface TSBigIntKeywordBuilder {
+    (): namedTypes.TSBigIntKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSBigIntKeyword;
+}
+export interface TSBooleanKeywordBuilder {
+    (): namedTypes.TSBooleanKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSBooleanKeyword;
+}
+export interface TSNeverKeywordBuilder {
+    (): namedTypes.TSNeverKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSNeverKeyword;
+}
+export interface TSNullKeywordBuilder {
+    (): namedTypes.TSNullKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSNullKeyword;
+}
+export interface TSNumberKeywordBuilder {
+    (): namedTypes.TSNumberKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSNumberKeyword;
+}
+export interface TSObjectKeywordBuilder {
+    (): namedTypes.TSObjectKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSObjectKeyword;
+}
+export interface TSStringKeywordBuilder {
+    (): namedTypes.TSStringKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSStringKeyword;
+}
+export interface TSSymbolKeywordBuilder {
+    (): namedTypes.TSSymbolKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSSymbolKeyword;
+}
+export interface TSUndefinedKeywordBuilder {
+    (): namedTypes.TSUndefinedKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSUndefinedKeyword;
+}
+export interface TSUnknownKeywordBuilder {
+    (): namedTypes.TSUnknownKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSUnknownKeyword;
+}
+export interface TSVoidKeywordBuilder {
+    (): namedTypes.TSVoidKeyword;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSVoidKeyword;
+}
+export interface TSThisTypeBuilder {
+    (): namedTypes.TSThisType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSThisType;
+}
+export interface TSArrayTypeBuilder {
+    (elementType: K.TSTypeKind): namedTypes.TSArrayType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        elementType: K.TSTypeKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSArrayType;
+}
+export interface TSLiteralTypeBuilder {
+    (literal: K.NumericLiteralKind | K.StringLiteralKind | K.BooleanLiteralKind | K.TemplateLiteralKind | K.UnaryExpressionKind): namedTypes.TSLiteralType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        literal: K.NumericLiteralKind | K.StringLiteralKind | K.BooleanLiteralKind | K.TemplateLiteralKind | K.UnaryExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSLiteralType;
+}
+export interface TSUnionTypeBuilder {
+    (types: K.TSTypeKind[]): namedTypes.TSUnionType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        types: K.TSTypeKind[];
+    }): namedTypes.TSUnionType;
+}
+export interface TSIntersectionTypeBuilder {
+    (types: K.TSTypeKind[]): namedTypes.TSIntersectionType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        types: K.TSTypeKind[];
+    }): namedTypes.TSIntersectionType;
+}
+export interface TSConditionalTypeBuilder {
+    (checkType: K.TSTypeKind, extendsType: K.TSTypeKind, trueType: K.TSTypeKind, falseType: K.TSTypeKind): namedTypes.TSConditionalType;
+    from(params: {
+        checkType: K.TSTypeKind;
+        comments?: K.CommentKind[] | null;
+        extendsType: K.TSTypeKind;
+        falseType: K.TSTypeKind;
+        loc?: K.SourceLocationKind | null;
+        trueType: K.TSTypeKind;
+    }): namedTypes.TSConditionalType;
+}
+export interface TSInferTypeBuilder {
+    (typeParameter: K.TSTypeParameterKind): namedTypes.TSInferType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeParameter: K.TSTypeParameterKind;
+    }): namedTypes.TSInferType;
+}
+export interface TSTypeParameterBuilder {
+    (name: string, constraint?: K.TSTypeKind | undefined, defaultParam?: K.TSTypeKind | undefined): namedTypes.TSTypeParameter;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        constraint?: K.TSTypeKind | undefined;
+        default?: K.TSTypeKind | undefined;
+        loc?: K.SourceLocationKind | null;
+        name: string;
+        optional?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }): namedTypes.TSTypeParameter;
+}
+export interface TSParenthesizedTypeBuilder {
+    (typeAnnotation: K.TSTypeKind): namedTypes.TSParenthesizedType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSParenthesizedType;
+}
+export interface TSFunctionTypeBuilder {
+    (parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[]): namedTypes.TSFunctionType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSFunctionType;
+}
+export interface TSConstructorTypeBuilder {
+    (parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[]): namedTypes.TSConstructorType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSConstructorType;
+}
+export interface TSDeclareFunctionBuilder {
+    (id: K.IdentifierKind | null | undefined, params: K.PatternKind[], returnType?: K.TSTypeAnnotationKind | K.NoopKind | null): namedTypes.TSDeclareFunction;
+    from(params: {
+        async?: boolean;
+        comments?: K.CommentKind[] | null;
+        declare?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        loc?: K.SourceLocationKind | null;
+        params: K.PatternKind[];
+        returnType?: K.TSTypeAnnotationKind | K.NoopKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSDeclareFunction;
+}
+export interface TSDeclareMethodBuilder {
+    (key: K.IdentifierKind | K.StringLiteralKind | K.NumericLiteralKind | K.ExpressionKind, params: K.PatternKind[], returnType?: K.TSTypeAnnotationKind | K.NoopKind | null): namedTypes.TSDeclareMethod;
+    from(params: {
+        abstract?: boolean;
+        access?: "public" | "private" | "protected" | undefined;
+        accessibility?: "public" | "private" | "protected" | undefined;
+        async?: boolean;
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+        generator?: boolean;
+        key: K.IdentifierKind | K.StringLiteralKind | K.NumericLiteralKind | K.ExpressionKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean;
+        params: K.PatternKind[];
+        returnType?: K.TSTypeAnnotationKind | K.NoopKind | null;
+        static?: boolean;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSDeclareMethod;
+}
+export interface TSMappedTypeBuilder {
+    (typeParameter: K.TSTypeParameterKind, typeAnnotation?: K.TSTypeKind | null): namedTypes.TSMappedType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean | "+" | "-";
+        readonly?: boolean | "+" | "-";
+        typeAnnotation?: K.TSTypeKind | null;
+        typeParameter: K.TSTypeParameterKind;
+    }): namedTypes.TSMappedType;
+}
+export interface TSTupleTypeBuilder {
+    (elementTypes: K.TSTypeKind[]): namedTypes.TSTupleType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        elementTypes: K.TSTypeKind[];
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSTupleType;
+}
+export interface TSRestTypeBuilder {
+    (typeAnnotation: K.TSTypeKind): namedTypes.TSRestType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSRestType;
+}
+export interface TSOptionalTypeBuilder {
+    (typeAnnotation: K.TSTypeKind): namedTypes.TSOptionalType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSOptionalType;
+}
+export interface TSIndexedAccessTypeBuilder {
+    (objectType: K.TSTypeKind, indexType: K.TSTypeKind): namedTypes.TSIndexedAccessType;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        indexType: K.TSTypeKind;
+        loc?: K.SourceLocationKind | null;
+        objectType: K.TSTypeKind;
+    }): namedTypes.TSIndexedAccessType;
+}
+export interface TSTypeOperatorBuilder {
+    (operator: string): namedTypes.TSTypeOperator;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        operator: string;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSTypeOperator;
+}
+export interface TSIndexSignatureBuilder {
+    (parameters: K.IdentifierKind[], typeAnnotation?: K.TSTypeAnnotationKind | null): namedTypes.TSIndexSignature;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameters: K.IdentifierKind[];
+        readonly?: boolean;
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+    }): namedTypes.TSIndexSignature;
+}
+export interface TSPropertySignatureBuilder {
+    (key: K.ExpressionKind, typeAnnotation?: K.TSTypeAnnotationKind | null, optional?: boolean): namedTypes.TSPropertySignature;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        initializer?: K.ExpressionKind | null;
+        key: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean;
+        readonly?: boolean;
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+    }): namedTypes.TSPropertySignature;
+}
+export interface TSMethodSignatureBuilder {
+    (key: K.ExpressionKind, parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[], typeAnnotation?: K.TSTypeAnnotationKind | null): namedTypes.TSMethodSignature;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        key: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSMethodSignature;
+}
+export interface TSTypePredicateBuilder {
+    (parameterName: K.IdentifierKind | K.TSThisTypeKind, typeAnnotation: K.TSTypeAnnotationKind): namedTypes.TSTypePredicate;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameterName: K.IdentifierKind | K.TSThisTypeKind;
+        typeAnnotation: K.TSTypeAnnotationKind;
+    }): namedTypes.TSTypePredicate;
+}
+export interface TSCallSignatureDeclarationBuilder {
+    (parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[], typeAnnotation?: K.TSTypeAnnotationKind | null): namedTypes.TSCallSignatureDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSCallSignatureDeclaration;
+}
+export interface TSConstructSignatureDeclarationBuilder {
+    (parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[], typeAnnotation?: K.TSTypeAnnotationKind | null): namedTypes.TSConstructSignatureDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSConstructSignatureDeclaration;
+}
+export interface TSEnumMemberBuilder {
+    (id: K.IdentifierKind | K.StringLiteralKind, initializer?: K.ExpressionKind | null): namedTypes.TSEnumMember;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind | K.StringLiteralKind;
+        initializer?: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSEnumMember;
+}
+export interface TSTypeQueryBuilder {
+    (exprName: K.IdentifierKind | K.TSQualifiedNameKind | K.TSImportTypeKind): namedTypes.TSTypeQuery;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        exprName: K.IdentifierKind | K.TSQualifiedNameKind | K.TSImportTypeKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSTypeQuery;
+}
+export interface TSImportTypeBuilder {
+    (argument: K.StringLiteralKind, qualifier?: K.IdentifierKind | K.TSQualifiedNameKind | undefined, typeParameters?: K.TSTypeParameterInstantiationKind | null): namedTypes.TSImportType;
+    from(params: {
+        argument: K.StringLiteralKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        qualifier?: K.IdentifierKind | K.TSQualifiedNameKind | undefined;
+        typeParameters?: K.TSTypeParameterInstantiationKind | null;
+    }): namedTypes.TSImportType;
+}
+export interface TSTypeLiteralBuilder {
+    (members: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[]): namedTypes.TSTypeLiteral;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        members: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+    }): namedTypes.TSTypeLiteral;
+}
+export interface TSTypeAssertionBuilder {
+    (typeAnnotation: K.TSTypeKind, expression: K.ExpressionKind): namedTypes.TSTypeAssertion;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        extra?: {
+            parenthesized: boolean;
+        } | null;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+    }): namedTypes.TSTypeAssertion;
+}
+export interface TSEnumDeclarationBuilder {
+    (id: K.IdentifierKind, members: K.TSEnumMemberKind[]): namedTypes.TSEnumDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        const?: boolean;
+        declare?: boolean;
+        id: K.IdentifierKind;
+        initializer?: K.ExpressionKind | null;
+        loc?: K.SourceLocationKind | null;
+        members: K.TSEnumMemberKind[];
+    }): namedTypes.TSEnumDeclaration;
+}
+export interface TSTypeAliasDeclarationBuilder {
+    (id: K.IdentifierKind, typeAnnotation: K.TSTypeKind): namedTypes.TSTypeAliasDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        declare?: boolean;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+        typeAnnotation: K.TSTypeKind;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSTypeAliasDeclaration;
+}
+export interface TSModuleBlockBuilder {
+    (body: K.StatementKind[]): namedTypes.TSModuleBlock;
+    from(params: {
+        body: K.StatementKind[];
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSModuleBlock;
+}
+export interface TSModuleDeclarationBuilder {
+    (id: K.StringLiteralKind | K.IdentifierKind | K.TSQualifiedNameKind, body?: K.TSModuleBlockKind | K.TSModuleDeclarationKind | null): namedTypes.TSModuleDeclaration;
+    from(params: {
+        body?: K.TSModuleBlockKind | K.TSModuleDeclarationKind | null;
+        comments?: K.CommentKind[] | null;
+        declare?: boolean;
+        global?: boolean;
+        id: K.StringLiteralKind | K.IdentifierKind | K.TSQualifiedNameKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSModuleDeclaration;
+}
+export interface TSImportEqualsDeclarationBuilder {
+    (id: K.IdentifierKind, moduleReference: K.IdentifierKind | K.TSQualifiedNameKind | K.TSExternalModuleReferenceKind): namedTypes.TSImportEqualsDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        isExport?: boolean;
+        loc?: K.SourceLocationKind | null;
+        moduleReference: K.IdentifierKind | K.TSQualifiedNameKind | K.TSExternalModuleReferenceKind;
+    }): namedTypes.TSImportEqualsDeclaration;
+}
+export interface TSExternalModuleReferenceBuilder {
+    (expression: K.StringLiteralKind): namedTypes.TSExternalModuleReference;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.StringLiteralKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSExternalModuleReference;
+}
+export interface TSExportAssignmentBuilder {
+    (expression: K.ExpressionKind): namedTypes.TSExportAssignment;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        expression: K.ExpressionKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSExportAssignment;
+}
+export interface TSNamespaceExportDeclarationBuilder {
+    (id: K.IdentifierKind): namedTypes.TSNamespaceExportDeclaration;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        id: K.IdentifierKind;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSNamespaceExportDeclaration;
+}
+export interface TSInterfaceBodyBuilder {
+    (body: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[]): namedTypes.TSInterfaceBody;
+    from(params: {
+        body: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+    }): namedTypes.TSInterfaceBody;
+}
+export interface TSInterfaceDeclarationBuilder {
+    (id: K.IdentifierKind | K.TSQualifiedNameKind, body: K.TSInterfaceBodyKind): namedTypes.TSInterfaceDeclaration;
+    from(params: {
+        body: K.TSInterfaceBodyKind;
+        comments?: K.CommentKind[] | null;
+        declare?: boolean;
+        extends?: K.TSExpressionWithTypeArgumentsKind[] | null;
+        id: K.IdentifierKind | K.TSQualifiedNameKind;
+        loc?: K.SourceLocationKind | null;
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }): namedTypes.TSInterfaceDeclaration;
+}
+export interface TSParameterPropertyBuilder {
+    (parameter: K.IdentifierKind | K.AssignmentPatternKind): namedTypes.TSParameterProperty;
+    from(params: {
+        accessibility?: "public" | "private" | "protected" | undefined;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        parameter: K.IdentifierKind | K.AssignmentPatternKind;
+        readonly?: boolean;
+    }): namedTypes.TSParameterProperty;
+}
+export interface OptionalMemberExpressionBuilder {
+    (object: K.ExpressionKind, property: K.IdentifierKind | K.ExpressionKind, computed?: boolean, optional?: boolean): namedTypes.OptionalMemberExpression;
+    from(params: {
+        comments?: K.CommentKind[] | null;
+        computed?: boolean;
+        loc?: K.SourceLocationKind | null;
+        object: K.ExpressionKind;
+        optional?: boolean;
+        property: K.IdentifierKind | K.ExpressionKind;
+    }): namedTypes.OptionalMemberExpression;
+}
+export interface OptionalCallExpressionBuilder {
+    (callee: K.ExpressionKind, argumentsParam: (K.ExpressionKind | K.SpreadElementKind)[], optional?: boolean): namedTypes.OptionalCallExpression;
+    from(params: {
+        arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+        callee: K.ExpressionKind;
+        comments?: K.CommentKind[] | null;
+        loc?: K.SourceLocationKind | null;
+        optional?: boolean;
+        typeArguments?: null | K.TypeParameterInstantiationKind;
+    }): namedTypes.OptionalCallExpression;
+}
+export interface builders {
+    file: FileBuilder;
+    program: ProgramBuilder;
+    identifier: IdentifierBuilder;
+    blockStatement: BlockStatementBuilder;
+    emptyStatement: EmptyStatementBuilder;
+    expressionStatement: ExpressionStatementBuilder;
+    ifStatement: IfStatementBuilder;
+    labeledStatement: LabeledStatementBuilder;
+    breakStatement: BreakStatementBuilder;
+    continueStatement: ContinueStatementBuilder;
+    withStatement: WithStatementBuilder;
+    switchStatement: SwitchStatementBuilder;
+    switchCase: SwitchCaseBuilder;
+    returnStatement: ReturnStatementBuilder;
+    throwStatement: ThrowStatementBuilder;
+    tryStatement: TryStatementBuilder;
+    catchClause: CatchClauseBuilder;
+    whileStatement: WhileStatementBuilder;
+    doWhileStatement: DoWhileStatementBuilder;
+    forStatement: ForStatementBuilder;
+    variableDeclaration: VariableDeclarationBuilder;
+    forInStatement: ForInStatementBuilder;
+    debuggerStatement: DebuggerStatementBuilder;
+    functionDeclaration: FunctionDeclarationBuilder;
+    functionExpression: FunctionExpressionBuilder;
+    variableDeclarator: VariableDeclaratorBuilder;
+    thisExpression: ThisExpressionBuilder;
+    arrayExpression: ArrayExpressionBuilder;
+    objectExpression: ObjectExpressionBuilder;
+    property: PropertyBuilder;
+    literal: LiteralBuilder;
+    sequenceExpression: SequenceExpressionBuilder;
+    unaryExpression: UnaryExpressionBuilder;
+    binaryExpression: BinaryExpressionBuilder;
+    assignmentExpression: AssignmentExpressionBuilder;
+    memberExpression: MemberExpressionBuilder;
+    updateExpression: UpdateExpressionBuilder;
+    logicalExpression: LogicalExpressionBuilder;
+    conditionalExpression: ConditionalExpressionBuilder;
+    newExpression: NewExpressionBuilder;
+    callExpression: CallExpressionBuilder;
+    restElement: RestElementBuilder;
+    typeAnnotation: TypeAnnotationBuilder;
+    tsTypeAnnotation: TSTypeAnnotationBuilder;
+    spreadElementPattern: SpreadElementPatternBuilder;
+    arrowFunctionExpression: ArrowFunctionExpressionBuilder;
+    forOfStatement: ForOfStatementBuilder;
+    yieldExpression: YieldExpressionBuilder;
+    generatorExpression: GeneratorExpressionBuilder;
+    comprehensionBlock: ComprehensionBlockBuilder;
+    comprehensionExpression: ComprehensionExpressionBuilder;
+    objectProperty: ObjectPropertyBuilder;
+    propertyPattern: PropertyPatternBuilder;
+    objectPattern: ObjectPatternBuilder;
+    arrayPattern: ArrayPatternBuilder;
+    methodDefinition: MethodDefinitionBuilder;
+    spreadElement: SpreadElementBuilder;
+    assignmentPattern: AssignmentPatternBuilder;
+    classPropertyDefinition: ClassPropertyDefinitionBuilder;
+    classProperty: ClassPropertyBuilder;
+    classBody: ClassBodyBuilder;
+    classDeclaration: ClassDeclarationBuilder;
+    classExpression: ClassExpressionBuilder;
+    importSpecifier: ImportSpecifierBuilder;
+    importNamespaceSpecifier: ImportNamespaceSpecifierBuilder;
+    importDefaultSpecifier: ImportDefaultSpecifierBuilder;
+    importDeclaration: ImportDeclarationBuilder;
+    taggedTemplateExpression: TaggedTemplateExpressionBuilder;
+    templateLiteral: TemplateLiteralBuilder;
+    templateElement: TemplateElementBuilder;
+    spreadProperty: SpreadPropertyBuilder;
+    spreadPropertyPattern: SpreadPropertyPatternBuilder;
+    awaitExpression: AwaitExpressionBuilder;
+    jsxAttribute: JSXAttributeBuilder;
+    jsxIdentifier: JSXIdentifierBuilder;
+    jsxNamespacedName: JSXNamespacedNameBuilder;
+    jsxExpressionContainer: JSXExpressionContainerBuilder;
+    jsxMemberExpression: JSXMemberExpressionBuilder;
+    jsxSpreadAttribute: JSXSpreadAttributeBuilder;
+    jsxElement: JSXElementBuilder;
+    jsxOpeningElement: JSXOpeningElementBuilder;
+    jsxClosingElement: JSXClosingElementBuilder;
+    jsxFragment: JSXFragmentBuilder;
+    jsxText: JSXTextBuilder;
+    jsxOpeningFragment: JSXOpeningFragmentBuilder;
+    jsxClosingFragment: JSXClosingFragmentBuilder;
+    jsxEmptyExpression: JSXEmptyExpressionBuilder;
+    jsxSpreadChild: JSXSpreadChildBuilder;
+    typeParameterDeclaration: TypeParameterDeclarationBuilder;
+    tsTypeParameterDeclaration: TSTypeParameterDeclarationBuilder;
+    typeParameterInstantiation: TypeParameterInstantiationBuilder;
+    tsTypeParameterInstantiation: TSTypeParameterInstantiationBuilder;
+    classImplements: ClassImplementsBuilder;
+    tsExpressionWithTypeArguments: TSExpressionWithTypeArgumentsBuilder;
+    anyTypeAnnotation: AnyTypeAnnotationBuilder;
+    emptyTypeAnnotation: EmptyTypeAnnotationBuilder;
+    mixedTypeAnnotation: MixedTypeAnnotationBuilder;
+    voidTypeAnnotation: VoidTypeAnnotationBuilder;
+    numberTypeAnnotation: NumberTypeAnnotationBuilder;
+    numberLiteralTypeAnnotation: NumberLiteralTypeAnnotationBuilder;
+    numericLiteralTypeAnnotation: NumericLiteralTypeAnnotationBuilder;
+    stringTypeAnnotation: StringTypeAnnotationBuilder;
+    stringLiteralTypeAnnotation: StringLiteralTypeAnnotationBuilder;
+    booleanTypeAnnotation: BooleanTypeAnnotationBuilder;
+    booleanLiteralTypeAnnotation: BooleanLiteralTypeAnnotationBuilder;
+    nullableTypeAnnotation: NullableTypeAnnotationBuilder;
+    nullLiteralTypeAnnotation: NullLiteralTypeAnnotationBuilder;
+    nullTypeAnnotation: NullTypeAnnotationBuilder;
+    thisTypeAnnotation: ThisTypeAnnotationBuilder;
+    existsTypeAnnotation: ExistsTypeAnnotationBuilder;
+    existentialTypeParam: ExistentialTypeParamBuilder;
+    functionTypeAnnotation: FunctionTypeAnnotationBuilder;
+    functionTypeParam: FunctionTypeParamBuilder;
+    arrayTypeAnnotation: ArrayTypeAnnotationBuilder;
+    objectTypeAnnotation: ObjectTypeAnnotationBuilder;
+    objectTypeProperty: ObjectTypePropertyBuilder;
+    objectTypeSpreadProperty: ObjectTypeSpreadPropertyBuilder;
+    objectTypeIndexer: ObjectTypeIndexerBuilder;
+    objectTypeCallProperty: ObjectTypeCallPropertyBuilder;
+    objectTypeInternalSlot: ObjectTypeInternalSlotBuilder;
+    variance: VarianceBuilder;
+    qualifiedTypeIdentifier: QualifiedTypeIdentifierBuilder;
+    genericTypeAnnotation: GenericTypeAnnotationBuilder;
+    memberTypeAnnotation: MemberTypeAnnotationBuilder;
+    unionTypeAnnotation: UnionTypeAnnotationBuilder;
+    intersectionTypeAnnotation: IntersectionTypeAnnotationBuilder;
+    typeofTypeAnnotation: TypeofTypeAnnotationBuilder;
+    typeParameter: TypeParameterBuilder;
+    interfaceTypeAnnotation: InterfaceTypeAnnotationBuilder;
+    interfaceExtends: InterfaceExtendsBuilder;
+    interfaceDeclaration: InterfaceDeclarationBuilder;
+    declareInterface: DeclareInterfaceBuilder;
+    typeAlias: TypeAliasBuilder;
+    opaqueType: OpaqueTypeBuilder;
+    declareTypeAlias: DeclareTypeAliasBuilder;
+    declareOpaqueType: DeclareOpaqueTypeBuilder;
+    typeCastExpression: TypeCastExpressionBuilder;
+    tupleTypeAnnotation: TupleTypeAnnotationBuilder;
+    declareVariable: DeclareVariableBuilder;
+    declareFunction: DeclareFunctionBuilder;
+    declareClass: DeclareClassBuilder;
+    declareModule: DeclareModuleBuilder;
+    declareModuleExports: DeclareModuleExportsBuilder;
+    declareExportDeclaration: DeclareExportDeclarationBuilder;
+    exportSpecifier: ExportSpecifierBuilder;
+    exportBatchSpecifier: ExportBatchSpecifierBuilder;
+    declareExportAllDeclaration: DeclareExportAllDeclarationBuilder;
+    inferredPredicate: InferredPredicateBuilder;
+    declaredPredicate: DeclaredPredicateBuilder;
+    exportDeclaration: ExportDeclarationBuilder;
+    block: BlockBuilder;
+    line: LineBuilder;
+    noop: NoopBuilder;
+    doExpression: DoExpressionBuilder;
+    super: SuperBuilder;
+    bindExpression: BindExpressionBuilder;
+    decorator: DecoratorBuilder;
+    metaProperty: MetaPropertyBuilder;
+    parenthesizedExpression: ParenthesizedExpressionBuilder;
+    exportDefaultDeclaration: ExportDefaultDeclarationBuilder;
+    exportNamedDeclaration: ExportNamedDeclarationBuilder;
+    exportNamespaceSpecifier: ExportNamespaceSpecifierBuilder;
+    exportDefaultSpecifier: ExportDefaultSpecifierBuilder;
+    exportAllDeclaration: ExportAllDeclarationBuilder;
+    commentBlock: CommentBlockBuilder;
+    commentLine: CommentLineBuilder;
+    directive: DirectiveBuilder;
+    directiveLiteral: DirectiveLiteralBuilder;
+    interpreterDirective: InterpreterDirectiveBuilder;
+    stringLiteral: StringLiteralBuilder;
+    numericLiteral: NumericLiteralBuilder;
+    bigIntLiteral: BigIntLiteralBuilder;
+    nullLiteral: NullLiteralBuilder;
+    booleanLiteral: BooleanLiteralBuilder;
+    regExpLiteral: RegExpLiteralBuilder;
+    objectMethod: ObjectMethodBuilder;
+    classPrivateProperty: ClassPrivatePropertyBuilder;
+    classMethod: ClassMethodBuilder;
+    classPrivateMethod: ClassPrivateMethodBuilder;
+    privateName: PrivateNameBuilder;
+    restProperty: RestPropertyBuilder;
+    forAwaitStatement: ForAwaitStatementBuilder;
+    import: ImportBuilder;
+    tsQualifiedName: TSQualifiedNameBuilder;
+    tsTypeReference: TSTypeReferenceBuilder;
+    tsAsExpression: TSAsExpressionBuilder;
+    tsNonNullExpression: TSNonNullExpressionBuilder;
+    tsAnyKeyword: TSAnyKeywordBuilder;
+    tsBigIntKeyword: TSBigIntKeywordBuilder;
+    tsBooleanKeyword: TSBooleanKeywordBuilder;
+    tsNeverKeyword: TSNeverKeywordBuilder;
+    tsNullKeyword: TSNullKeywordBuilder;
+    tsNumberKeyword: TSNumberKeywordBuilder;
+    tsObjectKeyword: TSObjectKeywordBuilder;
+    tsStringKeyword: TSStringKeywordBuilder;
+    tsSymbolKeyword: TSSymbolKeywordBuilder;
+    tsUndefinedKeyword: TSUndefinedKeywordBuilder;
+    tsUnknownKeyword: TSUnknownKeywordBuilder;
+    tsVoidKeyword: TSVoidKeywordBuilder;
+    tsThisType: TSThisTypeBuilder;
+    tsArrayType: TSArrayTypeBuilder;
+    tsLiteralType: TSLiteralTypeBuilder;
+    tsUnionType: TSUnionTypeBuilder;
+    tsIntersectionType: TSIntersectionTypeBuilder;
+    tsConditionalType: TSConditionalTypeBuilder;
+    tsInferType: TSInferTypeBuilder;
+    tsTypeParameter: TSTypeParameterBuilder;
+    tsParenthesizedType: TSParenthesizedTypeBuilder;
+    tsFunctionType: TSFunctionTypeBuilder;
+    tsConstructorType: TSConstructorTypeBuilder;
+    tsDeclareFunction: TSDeclareFunctionBuilder;
+    tsDeclareMethod: TSDeclareMethodBuilder;
+    tsMappedType: TSMappedTypeBuilder;
+    tsTupleType: TSTupleTypeBuilder;
+    tsRestType: TSRestTypeBuilder;
+    tsOptionalType: TSOptionalTypeBuilder;
+    tsIndexedAccessType: TSIndexedAccessTypeBuilder;
+    tsTypeOperator: TSTypeOperatorBuilder;
+    tsIndexSignature: TSIndexSignatureBuilder;
+    tsPropertySignature: TSPropertySignatureBuilder;
+    tsMethodSignature: TSMethodSignatureBuilder;
+    tsTypePredicate: TSTypePredicateBuilder;
+    tsCallSignatureDeclaration: TSCallSignatureDeclarationBuilder;
+    tsConstructSignatureDeclaration: TSConstructSignatureDeclarationBuilder;
+    tsEnumMember: TSEnumMemberBuilder;
+    tsTypeQuery: TSTypeQueryBuilder;
+    tsImportType: TSImportTypeBuilder;
+    tsTypeLiteral: TSTypeLiteralBuilder;
+    tsTypeAssertion: TSTypeAssertionBuilder;
+    tsEnumDeclaration: TSEnumDeclarationBuilder;
+    tsTypeAliasDeclaration: TSTypeAliasDeclarationBuilder;
+    tsModuleBlock: TSModuleBlockBuilder;
+    tsModuleDeclaration: TSModuleDeclarationBuilder;
+    tsImportEqualsDeclaration: TSImportEqualsDeclarationBuilder;
+    tsExternalModuleReference: TSExternalModuleReferenceBuilder;
+    tsExportAssignment: TSExportAssignmentBuilder;
+    tsNamespaceExportDeclaration: TSNamespaceExportDeclarationBuilder;
+    tsInterfaceBody: TSInterfaceBodyBuilder;
+    tsInterfaceDeclaration: TSInterfaceDeclarationBuilder;
+    tsParameterProperty: TSParameterPropertyBuilder;
+    optionalMemberExpression: OptionalMemberExpressionBuilder;
+    optionalCallExpression: OptionalCallExpressionBuilder;
+    [builderName: string]: any;
+}
diff --git a/node_modules/ast-types/gen/builders.js b/node_modules/ast-types/gen/builders.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ast-types/gen/builders.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ast-types/gen/kinds.d.ts b/node_modules/ast-types/gen/kinds.d.ts
new file mode 100644
index 0000000..6c02ffb
--- /dev/null
+++ b/node_modules/ast-types/gen/kinds.d.ts
@@ -0,0 +1,262 @@
+import { namedTypes } from "./namedTypes";
+export declare type PrintableKind = namedTypes.File | namedTypes.Program | namedTypes.Identifier | namedTypes.BlockStatement | namedTypes.EmptyStatement | namedTypes.ExpressionStatement | namedTypes.IfStatement | namedTypes.LabeledStatement | namedTypes.BreakStatement | namedTypes.ContinueStatement | namedTypes.WithStatement | namedTypes.SwitchStatement | namedTypes.SwitchCase | namedTypes.ReturnStatement | namedTypes.ThrowStatement | namedTypes.TryStatement | namedTypes.CatchClause | namedTypes.WhileStatement | namedTypes.DoWhileStatement | namedTypes.ForStatement | namedTypes.VariableDeclaration | namedTypes.ForInStatement | namedTypes.DebuggerStatement | namedTypes.FunctionDeclaration | namedTypes.FunctionExpression | namedTypes.VariableDeclarator | namedTypes.ThisExpression | namedTypes.ArrayExpression | namedTypes.ObjectExpression | namedTypes.Property | namedTypes.Literal | namedTypes.SequenceExpression | namedTypes.UnaryExpression | namedTypes.BinaryExpression | namedTypes.AssignmentExpression | namedTypes.MemberExpression | namedTypes.UpdateExpression | namedTypes.LogicalExpression | namedTypes.ConditionalExpression | namedTypes.NewExpression | namedTypes.CallExpression | namedTypes.RestElement | namedTypes.TypeAnnotation | namedTypes.TSTypeAnnotation | namedTypes.SpreadElementPattern | namedTypes.ArrowFunctionExpression | namedTypes.ForOfStatement | namedTypes.YieldExpression | namedTypes.GeneratorExpression | namedTypes.ComprehensionBlock | namedTypes.ComprehensionExpression | namedTypes.ObjectProperty | namedTypes.PropertyPattern | namedTypes.ObjectPattern | namedTypes.ArrayPattern | namedTypes.MethodDefinition | namedTypes.SpreadElement | namedTypes.AssignmentPattern | namedTypes.ClassPropertyDefinition | namedTypes.ClassProperty | namedTypes.ClassBody | namedTypes.ClassDeclaration | namedTypes.ClassExpression | namedTypes.ImportSpecifier | namedTypes.ImportNamespaceSpecifier | namedTypes.ImportDefaultSpecifier | namedTypes.ImportDeclaration | namedTypes.TaggedTemplateExpression | namedTypes.TemplateLiteral | namedTypes.TemplateElement | namedTypes.SpreadProperty | namedTypes.SpreadPropertyPattern | namedTypes.AwaitExpression | namedTypes.JSXAttribute | namedTypes.JSXIdentifier | namedTypes.JSXNamespacedName | namedTypes.JSXExpressionContainer | namedTypes.JSXMemberExpression | namedTypes.JSXSpreadAttribute | namedTypes.JSXElement | namedTypes.JSXOpeningElement | namedTypes.JSXClosingElement | namedTypes.JSXFragment | namedTypes.JSXText | namedTypes.JSXOpeningFragment | namedTypes.JSXClosingFragment | namedTypes.JSXEmptyExpression | namedTypes.JSXSpreadChild | namedTypes.TypeParameterDeclaration | namedTypes.TSTypeParameterDeclaration | namedTypes.TypeParameterInstantiation | namedTypes.TSTypeParameterInstantiation | namedTypes.ClassImplements | namedTypes.TSExpressionWithTypeArguments | namedTypes.AnyTypeAnnotation | namedTypes.EmptyTypeAnnotation | namedTypes.MixedTypeAnnotation | namedTypes.VoidTypeAnnotation | namedTypes.NumberTypeAnnotation | namedTypes.NumberLiteralTypeAnnotation | namedTypes.NumericLiteralTypeAnnotation | namedTypes.StringTypeAnnotation | namedTypes.StringLiteralTypeAnnotation | namedTypes.BooleanTypeAnnotation | namedTypes.BooleanLiteralTypeAnnotation | namedTypes.NullableTypeAnnotation | namedTypes.NullLiteralTypeAnnotation | namedTypes.NullTypeAnnotation | namedTypes.ThisTypeAnnotation | namedTypes.ExistsTypeAnnotation | namedTypes.ExistentialTypeParam | namedTypes.FunctionTypeAnnotation | namedTypes.FunctionTypeParam | namedTypes.ArrayTypeAnnotation | namedTypes.ObjectTypeAnnotation | namedTypes.ObjectTypeProperty | namedTypes.ObjectTypeSpreadProperty | namedTypes.ObjectTypeIndexer | namedTypes.ObjectTypeCallProperty | namedTypes.ObjectTypeInternalSlot | namedTypes.Variance | namedTypes.QualifiedTypeIdentifier | namedTypes.GenericTypeAnnotation | namedTypes.MemberTypeAnnotation | namedTypes.UnionTypeAnnotation | namedTypes.IntersectionTypeAnnotation | namedTypes.TypeofTypeAnnotation | namedTypes.TypeParameter | namedTypes.InterfaceTypeAnnotation | namedTypes.InterfaceExtends | namedTypes.InterfaceDeclaration | namedTypes.DeclareInterface | namedTypes.TypeAlias | namedTypes.OpaqueType | namedTypes.DeclareTypeAlias | namedTypes.DeclareOpaqueType | namedTypes.TypeCastExpression | namedTypes.TupleTypeAnnotation | namedTypes.DeclareVariable | namedTypes.DeclareFunction | namedTypes.DeclareClass | namedTypes.DeclareModule | namedTypes.DeclareModuleExports | namedTypes.DeclareExportDeclaration | namedTypes.ExportSpecifier | namedTypes.ExportBatchSpecifier | namedTypes.DeclareExportAllDeclaration | namedTypes.InferredPredicate | namedTypes.DeclaredPredicate | namedTypes.ExportDeclaration | namedTypes.Block | namedTypes.Line | namedTypes.Noop | namedTypes.DoExpression | namedTypes.Super | namedTypes.BindExpression | namedTypes.Decorator | namedTypes.MetaProperty | namedTypes.ParenthesizedExpression | namedTypes.ExportDefaultDeclaration | namedTypes.ExportNamedDeclaration | namedTypes.ExportNamespaceSpecifier | namedTypes.ExportDefaultSpecifier | namedTypes.ExportAllDeclaration | namedTypes.CommentBlock | namedTypes.CommentLine | namedTypes.Directive | namedTypes.DirectiveLiteral | namedTypes.InterpreterDirective | namedTypes.StringLiteral | namedTypes.NumericLiteral | namedTypes.BigIntLiteral | namedTypes.NullLiteral | namedTypes.BooleanLiteral | namedTypes.RegExpLiteral | namedTypes.ObjectMethod | namedTypes.ClassPrivateProperty | namedTypes.ClassMethod | namedTypes.ClassPrivateMethod | namedTypes.PrivateName | namedTypes.RestProperty | namedTypes.ForAwaitStatement | namedTypes.Import | namedTypes.TSQualifiedName | namedTypes.TSTypeReference | namedTypes.TSAsExpression | namedTypes.TSNonNullExpression | namedTypes.TSAnyKeyword | namedTypes.TSBigIntKeyword | namedTypes.TSBooleanKeyword | namedTypes.TSNeverKeyword | namedTypes.TSNullKeyword | namedTypes.TSNumberKeyword | namedTypes.TSObjectKeyword | namedTypes.TSStringKeyword | namedTypes.TSSymbolKeyword | namedTypes.TSUndefinedKeyword | namedTypes.TSUnknownKeyword | namedTypes.TSVoidKeyword | namedTypes.TSThisType | namedTypes.TSArrayType | namedTypes.TSLiteralType | namedTypes.TSUnionType | namedTypes.TSIntersectionType | namedTypes.TSConditionalType | namedTypes.TSInferType | namedTypes.TSTypeParameter | namedTypes.TSParenthesizedType | namedTypes.TSFunctionType | namedTypes.TSConstructorType | namedTypes.TSDeclareFunction | namedTypes.TSDeclareMethod | namedTypes.TSMappedType | namedTypes.TSTupleType | namedTypes.TSRestType | namedTypes.TSOptionalType | namedTypes.TSIndexedAccessType | namedTypes.TSTypeOperator | namedTypes.TSIndexSignature | namedTypes.TSPropertySignature | namedTypes.TSMethodSignature | namedTypes.TSTypePredicate | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration | namedTypes.TSEnumMember | namedTypes.TSTypeQuery | namedTypes.TSImportType | namedTypes.TSTypeLiteral | namedTypes.TSTypeAssertion | namedTypes.TSEnumDeclaration | namedTypes.TSTypeAliasDeclaration | namedTypes.TSModuleBlock | namedTypes.TSModuleDeclaration | namedTypes.TSImportEqualsDeclaration | namedTypes.TSExternalModuleReference | namedTypes.TSExportAssignment | namedTypes.TSNamespaceExportDeclaration | namedTypes.TSInterfaceBody | namedTypes.TSInterfaceDeclaration | namedTypes.TSParameterProperty | namedTypes.OptionalMemberExpression | namedTypes.OptionalCallExpression;
+export declare type SourceLocationKind = namedTypes.SourceLocation;
+export declare type NodeKind = namedTypes.File | namedTypes.Program | namedTypes.Identifier | namedTypes.BlockStatement | namedTypes.EmptyStatement | namedTypes.ExpressionStatement | namedTypes.IfStatement | namedTypes.LabeledStatement | namedTypes.BreakStatement | namedTypes.ContinueStatement | namedTypes.WithStatement | namedTypes.SwitchStatement | namedTypes.SwitchCase | namedTypes.ReturnStatement | namedTypes.ThrowStatement | namedTypes.TryStatement | namedTypes.CatchClause | namedTypes.WhileStatement | namedTypes.DoWhileStatement | namedTypes.ForStatement | namedTypes.VariableDeclaration | namedTypes.ForInStatement | namedTypes.DebuggerStatement | namedTypes.FunctionDeclaration | namedTypes.FunctionExpression | namedTypes.VariableDeclarator | namedTypes.ThisExpression | namedTypes.ArrayExpression | namedTypes.ObjectExpression | namedTypes.Property | namedTypes.Literal | namedTypes.SequenceExpression | namedTypes.UnaryExpression | namedTypes.BinaryExpression | namedTypes.AssignmentExpression | namedTypes.MemberExpression | namedTypes.UpdateExpression | namedTypes.LogicalExpression | namedTypes.ConditionalExpression | namedTypes.NewExpression | namedTypes.CallExpression | namedTypes.RestElement | namedTypes.TypeAnnotation | namedTypes.TSTypeAnnotation | namedTypes.SpreadElementPattern | namedTypes.ArrowFunctionExpression | namedTypes.ForOfStatement | namedTypes.YieldExpression | namedTypes.GeneratorExpression | namedTypes.ComprehensionBlock | namedTypes.ComprehensionExpression | namedTypes.ObjectProperty | namedTypes.PropertyPattern | namedTypes.ObjectPattern | namedTypes.ArrayPattern | namedTypes.MethodDefinition | namedTypes.SpreadElement | namedTypes.AssignmentPattern | namedTypes.ClassPropertyDefinition | namedTypes.ClassProperty | namedTypes.ClassBody | namedTypes.ClassDeclaration | namedTypes.ClassExpression | namedTypes.ImportSpecifier | namedTypes.ImportNamespaceSpecifier | namedTypes.ImportDefaultSpecifier | namedTypes.ImportDeclaration | namedTypes.TaggedTemplateExpression | namedTypes.TemplateLiteral | namedTypes.TemplateElement | namedTypes.SpreadProperty | namedTypes.SpreadPropertyPattern | namedTypes.AwaitExpression | namedTypes.JSXAttribute | namedTypes.JSXIdentifier | namedTypes.JSXNamespacedName | namedTypes.JSXExpressionContainer | namedTypes.JSXMemberExpression | namedTypes.JSXSpreadAttribute | namedTypes.JSXElement | namedTypes.JSXOpeningElement | namedTypes.JSXClosingElement | namedTypes.JSXFragment | namedTypes.JSXText | namedTypes.JSXOpeningFragment | namedTypes.JSXClosingFragment | namedTypes.JSXEmptyExpression | namedTypes.JSXSpreadChild | namedTypes.TypeParameterDeclaration | namedTypes.TSTypeParameterDeclaration | namedTypes.TypeParameterInstantiation | namedTypes.TSTypeParameterInstantiation | namedTypes.ClassImplements | namedTypes.TSExpressionWithTypeArguments | namedTypes.AnyTypeAnnotation | namedTypes.EmptyTypeAnnotation | namedTypes.MixedTypeAnnotation | namedTypes.VoidTypeAnnotation | namedTypes.NumberTypeAnnotation | namedTypes.NumberLiteralTypeAnnotation | namedTypes.NumericLiteralTypeAnnotation | namedTypes.StringTypeAnnotation | namedTypes.StringLiteralTypeAnnotation | namedTypes.BooleanTypeAnnotation | namedTypes.BooleanLiteralTypeAnnotation | namedTypes.NullableTypeAnnotation | namedTypes.NullLiteralTypeAnnotation | namedTypes.NullTypeAnnotation | namedTypes.ThisTypeAnnotation | namedTypes.ExistsTypeAnnotation | namedTypes.ExistentialTypeParam | namedTypes.FunctionTypeAnnotation | namedTypes.FunctionTypeParam | namedTypes.ArrayTypeAnnotation | namedTypes.ObjectTypeAnnotation | namedTypes.ObjectTypeProperty | namedTypes.ObjectTypeSpreadProperty | namedTypes.ObjectTypeIndexer | namedTypes.ObjectTypeCallProperty | namedTypes.ObjectTypeInternalSlot | namedTypes.Variance | namedTypes.QualifiedTypeIdentifier | namedTypes.GenericTypeAnnotation | namedTypes.MemberTypeAnnotation | namedTypes.UnionTypeAnnotation | namedTypes.IntersectionTypeAnnotation | namedTypes.TypeofTypeAnnotation | namedTypes.TypeParameter | namedTypes.InterfaceTypeAnnotation | namedTypes.InterfaceExtends | namedTypes.InterfaceDeclaration | namedTypes.DeclareInterface | namedTypes.TypeAlias | namedTypes.OpaqueType | namedTypes.DeclareTypeAlias | namedTypes.DeclareOpaqueType | namedTypes.TypeCastExpression | namedTypes.TupleTypeAnnotation | namedTypes.DeclareVariable | namedTypes.DeclareFunction | namedTypes.DeclareClass | namedTypes.DeclareModule | namedTypes.DeclareModuleExports | namedTypes.DeclareExportDeclaration | namedTypes.ExportSpecifier | namedTypes.ExportBatchSpecifier | namedTypes.DeclareExportAllDeclaration | namedTypes.InferredPredicate | namedTypes.DeclaredPredicate | namedTypes.ExportDeclaration | namedTypes.Noop | namedTypes.DoExpression | namedTypes.Super | namedTypes.BindExpression | namedTypes.Decorator | namedTypes.MetaProperty | namedTypes.ParenthesizedExpression | namedTypes.ExportDefaultDeclaration | namedTypes.ExportNamedDeclaration | namedTypes.ExportNamespaceSpecifier | namedTypes.ExportDefaultSpecifier | namedTypes.ExportAllDeclaration | namedTypes.Directive | namedTypes.DirectiveLiteral | namedTypes.InterpreterDirective | namedTypes.StringLiteral | namedTypes.NumericLiteral | namedTypes.BigIntLiteral | namedTypes.NullLiteral | namedTypes.BooleanLiteral | namedTypes.RegExpLiteral | namedTypes.ObjectMethod | namedTypes.ClassPrivateProperty | namedTypes.ClassMethod | namedTypes.ClassPrivateMethod | namedTypes.PrivateName | namedTypes.RestProperty | namedTypes.ForAwaitStatement | namedTypes.Import | namedTypes.TSQualifiedName | namedTypes.TSTypeReference | namedTypes.TSAsExpression | namedTypes.TSNonNullExpression | namedTypes.TSAnyKeyword | namedTypes.TSBigIntKeyword | namedTypes.TSBooleanKeyword | namedTypes.TSNeverKeyword | namedTypes.TSNullKeyword | namedTypes.TSNumberKeyword | namedTypes.TSObjectKeyword | namedTypes.TSStringKeyword | namedTypes.TSSymbolKeyword | namedTypes.TSUndefinedKeyword | namedTypes.TSUnknownKeyword | namedTypes.TSVoidKeyword | namedTypes.TSThisType | namedTypes.TSArrayType | namedTypes.TSLiteralType | namedTypes.TSUnionType | namedTypes.TSIntersectionType | namedTypes.TSConditionalType | namedTypes.TSInferType | namedTypes.TSTypeParameter | namedTypes.TSParenthesizedType | namedTypes.TSFunctionType | namedTypes.TSConstructorType | namedTypes.TSDeclareFunction | namedTypes.TSDeclareMethod | namedTypes.TSMappedType | namedTypes.TSTupleType | namedTypes.TSRestType | namedTypes.TSOptionalType | namedTypes.TSIndexedAccessType | namedTypes.TSTypeOperator | namedTypes.TSIndexSignature | namedTypes.TSPropertySignature | namedTypes.TSMethodSignature | namedTypes.TSTypePredicate | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration | namedTypes.TSEnumMember | namedTypes.TSTypeQuery | namedTypes.TSImportType | namedTypes.TSTypeLiteral | namedTypes.TSTypeAssertion | namedTypes.TSEnumDeclaration | namedTypes.TSTypeAliasDeclaration | namedTypes.TSModuleBlock | namedTypes.TSModuleDeclaration | namedTypes.TSImportEqualsDeclaration | namedTypes.TSExternalModuleReference | namedTypes.TSExportAssignment | namedTypes.TSNamespaceExportDeclaration | namedTypes.TSInterfaceBody | namedTypes.TSInterfaceDeclaration | namedTypes.TSParameterProperty | namedTypes.OptionalMemberExpression | namedTypes.OptionalCallExpression;
+export declare type CommentKind = namedTypes.Block | namedTypes.Line | namedTypes.CommentBlock | namedTypes.CommentLine;
+export declare type PositionKind = namedTypes.Position;
+export declare type FileKind = namedTypes.File;
+export declare type ProgramKind = namedTypes.Program;
+export declare type StatementKind = namedTypes.BlockStatement | namedTypes.EmptyStatement | namedTypes.ExpressionStatement | namedTypes.IfStatement | namedTypes.LabeledStatement | namedTypes.BreakStatement | namedTypes.ContinueStatement | namedTypes.WithStatement | namedTypes.SwitchStatement | namedTypes.ReturnStatement | namedTypes.ThrowStatement | namedTypes.TryStatement | namedTypes.WhileStatement | namedTypes.DoWhileStatement | namedTypes.ForStatement | namedTypes.VariableDeclaration | namedTypes.ForInStatement | namedTypes.DebuggerStatement | namedTypes.FunctionDeclaration | namedTypes.ForOfStatement | namedTypes.MethodDefinition | namedTypes.ClassPropertyDefinition | namedTypes.ClassProperty | namedTypes.ClassBody | namedTypes.ClassDeclaration | namedTypes.ImportDeclaration | namedTypes.TSTypeParameterDeclaration | namedTypes.InterfaceDeclaration | namedTypes.DeclareInterface | namedTypes.TypeAlias | namedTypes.OpaqueType | namedTypes.DeclareTypeAlias | namedTypes.DeclareOpaqueType | namedTypes.DeclareVariable | namedTypes.DeclareFunction | namedTypes.DeclareClass | namedTypes.DeclareModule | namedTypes.DeclareModuleExports | namedTypes.DeclareExportDeclaration | namedTypes.DeclareExportAllDeclaration | namedTypes.ExportDeclaration | namedTypes.Noop | namedTypes.ExportDefaultDeclaration | namedTypes.ExportNamedDeclaration | namedTypes.ExportAllDeclaration | namedTypes.ClassPrivateProperty | namedTypes.ClassMethod | namedTypes.ClassPrivateMethod | namedTypes.ForAwaitStatement | namedTypes.TSDeclareFunction | namedTypes.TSDeclareMethod | namedTypes.TSIndexSignature | namedTypes.TSPropertySignature | namedTypes.TSMethodSignature | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration | namedTypes.TSEnumDeclaration | namedTypes.TSTypeAliasDeclaration | namedTypes.TSModuleDeclaration | namedTypes.TSImportEqualsDeclaration | namedTypes.TSExternalModuleReference | namedTypes.TSExportAssignment | namedTypes.TSNamespaceExportDeclaration | namedTypes.TSInterfaceDeclaration;
+export declare type FunctionKind = namedTypes.FunctionDeclaration | namedTypes.FunctionExpression | namedTypes.ArrowFunctionExpression | namedTypes.ObjectMethod | namedTypes.ClassMethod | namedTypes.ClassPrivateMethod;
+export declare type ExpressionKind = namedTypes.Identifier | namedTypes.FunctionExpression | namedTypes.ThisExpression | namedTypes.ArrayExpression | namedTypes.ObjectExpression | namedTypes.Literal | namedTypes.SequenceExpression | namedTypes.UnaryExpression | namedTypes.BinaryExpression | namedTypes.AssignmentExpression | namedTypes.MemberExpression | namedTypes.UpdateExpression | namedTypes.LogicalExpression | namedTypes.ConditionalExpression | namedTypes.NewExpression | namedTypes.CallExpression | namedTypes.ArrowFunctionExpression | namedTypes.YieldExpression | namedTypes.GeneratorExpression | namedTypes.ComprehensionExpression | namedTypes.ClassExpression | namedTypes.TaggedTemplateExpression | namedTypes.TemplateLiteral | namedTypes.AwaitExpression | namedTypes.JSXIdentifier | namedTypes.JSXExpressionContainer | namedTypes.JSXMemberExpression | namedTypes.JSXElement | namedTypes.JSXFragment | namedTypes.JSXText | namedTypes.JSXEmptyExpression | namedTypes.JSXSpreadChild | namedTypes.TypeCastExpression | namedTypes.DoExpression | namedTypes.Super | namedTypes.BindExpression | namedTypes.MetaProperty | namedTypes.ParenthesizedExpression | namedTypes.DirectiveLiteral | namedTypes.StringLiteral | namedTypes.NumericLiteral | namedTypes.BigIntLiteral | namedTypes.NullLiteral | namedTypes.BooleanLiteral | namedTypes.RegExpLiteral | namedTypes.PrivateName | namedTypes.Import | namedTypes.TSAsExpression | namedTypes.TSNonNullExpression | namedTypes.TSTypeParameter | namedTypes.TSTypeAssertion | namedTypes.OptionalMemberExpression | namedTypes.OptionalCallExpression;
+export declare type PatternKind = namedTypes.Identifier | namedTypes.RestElement | namedTypes.SpreadElementPattern | namedTypes.PropertyPattern | namedTypes.ObjectPattern | namedTypes.ArrayPattern | namedTypes.AssignmentPattern | namedTypes.SpreadPropertyPattern | namedTypes.JSXIdentifier | namedTypes.PrivateName | namedTypes.TSAsExpression | namedTypes.TSNonNullExpression | namedTypes.TSTypeParameter | namedTypes.TSTypeAssertion | namedTypes.TSParameterProperty;
+export declare type IdentifierKind = namedTypes.Identifier | namedTypes.JSXIdentifier | namedTypes.TSTypeParameter;
+export declare type BlockStatementKind = namedTypes.BlockStatement;
+export declare type EmptyStatementKind = namedTypes.EmptyStatement;
+export declare type ExpressionStatementKind = namedTypes.ExpressionStatement;
+export declare type IfStatementKind = namedTypes.IfStatement;
+export declare type LabeledStatementKind = namedTypes.LabeledStatement;
+export declare type BreakStatementKind = namedTypes.BreakStatement;
+export declare type ContinueStatementKind = namedTypes.ContinueStatement;
+export declare type WithStatementKind = namedTypes.WithStatement;
+export declare type SwitchStatementKind = namedTypes.SwitchStatement;
+export declare type SwitchCaseKind = namedTypes.SwitchCase;
+export declare type ReturnStatementKind = namedTypes.ReturnStatement;
+export declare type ThrowStatementKind = namedTypes.ThrowStatement;
+export declare type TryStatementKind = namedTypes.TryStatement;
+export declare type CatchClauseKind = namedTypes.CatchClause;
+export declare type WhileStatementKind = namedTypes.WhileStatement;
+export declare type DoWhileStatementKind = namedTypes.DoWhileStatement;
+export declare type ForStatementKind = namedTypes.ForStatement;
+export declare type DeclarationKind = namedTypes.VariableDeclaration | namedTypes.FunctionDeclaration | namedTypes.MethodDefinition | namedTypes.ClassPropertyDefinition | namedTypes.ClassProperty | namedTypes.ClassBody | namedTypes.ClassDeclaration | namedTypes.ImportDeclaration | namedTypes.TSTypeParameterDeclaration | namedTypes.InterfaceDeclaration | namedTypes.DeclareInterface | namedTypes.TypeAlias | namedTypes.OpaqueType | namedTypes.DeclareTypeAlias | namedTypes.DeclareOpaqueType | namedTypes.DeclareClass | namedTypes.DeclareExportDeclaration | namedTypes.DeclareExportAllDeclaration | namedTypes.ExportDeclaration | namedTypes.ExportDefaultDeclaration | namedTypes.ExportNamedDeclaration | namedTypes.ExportAllDeclaration | namedTypes.ClassPrivateProperty | namedTypes.ClassMethod | namedTypes.ClassPrivateMethod | namedTypes.TSDeclareFunction | namedTypes.TSDeclareMethod | namedTypes.TSIndexSignature | namedTypes.TSPropertySignature | namedTypes.TSMethodSignature | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration | namedTypes.TSEnumDeclaration | namedTypes.TSTypeAliasDeclaration | namedTypes.TSModuleDeclaration | namedTypes.TSImportEqualsDeclaration | namedTypes.TSExternalModuleReference | namedTypes.TSNamespaceExportDeclaration | namedTypes.TSInterfaceDeclaration;
+export declare type VariableDeclarationKind = namedTypes.VariableDeclaration;
+export declare type ForInStatementKind = namedTypes.ForInStatement;
+export declare type DebuggerStatementKind = namedTypes.DebuggerStatement;
+export declare type FunctionDeclarationKind = namedTypes.FunctionDeclaration;
+export declare type FunctionExpressionKind = namedTypes.FunctionExpression;
+export declare type VariableDeclaratorKind = namedTypes.VariableDeclarator;
+export declare type ThisExpressionKind = namedTypes.ThisExpression;
+export declare type ArrayExpressionKind = namedTypes.ArrayExpression;
+export declare type ObjectExpressionKind = namedTypes.ObjectExpression;
+export declare type PropertyKind = namedTypes.Property;
+export declare type LiteralKind = namedTypes.Literal | namedTypes.JSXText | namedTypes.StringLiteral | namedTypes.NumericLiteral | namedTypes.BigIntLiteral | namedTypes.NullLiteral | namedTypes.BooleanLiteral | namedTypes.RegExpLiteral;
+export declare type SequenceExpressionKind = namedTypes.SequenceExpression;
+export declare type UnaryExpressionKind = namedTypes.UnaryExpression;
+export declare type BinaryExpressionKind = namedTypes.BinaryExpression;
+export declare type AssignmentExpressionKind = namedTypes.AssignmentExpression;
+export declare type MemberExpressionKind = namedTypes.MemberExpression | namedTypes.JSXMemberExpression | namedTypes.OptionalMemberExpression;
+export declare type UpdateExpressionKind = namedTypes.UpdateExpression;
+export declare type LogicalExpressionKind = namedTypes.LogicalExpression;
+export declare type ConditionalExpressionKind = namedTypes.ConditionalExpression;
+export declare type NewExpressionKind = namedTypes.NewExpression;
+export declare type CallExpressionKind = namedTypes.CallExpression | namedTypes.OptionalCallExpression;
+export declare type RestElementKind = namedTypes.RestElement;
+export declare type TypeAnnotationKind = namedTypes.TypeAnnotation;
+export declare type TSTypeAnnotationKind = namedTypes.TSTypeAnnotation | namedTypes.TSTypePredicate;
+export declare type SpreadElementPatternKind = namedTypes.SpreadElementPattern;
+export declare type ArrowFunctionExpressionKind = namedTypes.ArrowFunctionExpression;
+export declare type ForOfStatementKind = namedTypes.ForOfStatement;
+export declare type YieldExpressionKind = namedTypes.YieldExpression;
+export declare type GeneratorExpressionKind = namedTypes.GeneratorExpression;
+export declare type ComprehensionBlockKind = namedTypes.ComprehensionBlock;
+export declare type ComprehensionExpressionKind = namedTypes.ComprehensionExpression;
+export declare type ObjectPropertyKind = namedTypes.ObjectProperty;
+export declare type PropertyPatternKind = namedTypes.PropertyPattern;
+export declare type ObjectPatternKind = namedTypes.ObjectPattern;
+export declare type ArrayPatternKind = namedTypes.ArrayPattern;
+export declare type MethodDefinitionKind = namedTypes.MethodDefinition;
+export declare type SpreadElementKind = namedTypes.SpreadElement;
+export declare type AssignmentPatternKind = namedTypes.AssignmentPattern;
+export declare type ClassPropertyDefinitionKind = namedTypes.ClassPropertyDefinition;
+export declare type ClassPropertyKind = namedTypes.ClassProperty | namedTypes.ClassPrivateProperty;
+export declare type ClassBodyKind = namedTypes.ClassBody;
+export declare type ClassDeclarationKind = namedTypes.ClassDeclaration;
+export declare type ClassExpressionKind = namedTypes.ClassExpression;
+export declare type SpecifierKind = namedTypes.ImportSpecifier | namedTypes.ImportNamespaceSpecifier | namedTypes.ImportDefaultSpecifier | namedTypes.ExportSpecifier | namedTypes.ExportBatchSpecifier | namedTypes.ExportNamespaceSpecifier | namedTypes.ExportDefaultSpecifier;
+export declare type ModuleSpecifierKind = namedTypes.ImportSpecifier | namedTypes.ImportNamespaceSpecifier | namedTypes.ImportDefaultSpecifier | namedTypes.ExportSpecifier;
+export declare type ImportSpecifierKind = namedTypes.ImportSpecifier;
+export declare type ImportNamespaceSpecifierKind = namedTypes.ImportNamespaceSpecifier;
+export declare type ImportDefaultSpecifierKind = namedTypes.ImportDefaultSpecifier;
+export declare type ImportDeclarationKind = namedTypes.ImportDeclaration;
+export declare type TaggedTemplateExpressionKind = namedTypes.TaggedTemplateExpression;
+export declare type TemplateLiteralKind = namedTypes.TemplateLiteral;
+export declare type TemplateElementKind = namedTypes.TemplateElement;
+export declare type SpreadPropertyKind = namedTypes.SpreadProperty;
+export declare type SpreadPropertyPatternKind = namedTypes.SpreadPropertyPattern;
+export declare type AwaitExpressionKind = namedTypes.AwaitExpression;
+export declare type JSXAttributeKind = namedTypes.JSXAttribute;
+export declare type JSXIdentifierKind = namedTypes.JSXIdentifier;
+export declare type JSXNamespacedNameKind = namedTypes.JSXNamespacedName;
+export declare type JSXExpressionContainerKind = namedTypes.JSXExpressionContainer;
+export declare type JSXMemberExpressionKind = namedTypes.JSXMemberExpression;
+export declare type JSXSpreadAttributeKind = namedTypes.JSXSpreadAttribute;
+export declare type JSXElementKind = namedTypes.JSXElement;
+export declare type JSXOpeningElementKind = namedTypes.JSXOpeningElement;
+export declare type JSXClosingElementKind = namedTypes.JSXClosingElement;
+export declare type JSXFragmentKind = namedTypes.JSXFragment;
+export declare type JSXTextKind = namedTypes.JSXText;
+export declare type JSXOpeningFragmentKind = namedTypes.JSXOpeningFragment;
+export declare type JSXClosingFragmentKind = namedTypes.JSXClosingFragment;
+export declare type JSXEmptyExpressionKind = namedTypes.JSXEmptyExpression;
+export declare type JSXSpreadChildKind = namedTypes.JSXSpreadChild;
+export declare type TypeParameterDeclarationKind = namedTypes.TypeParameterDeclaration;
+export declare type TSTypeParameterDeclarationKind = namedTypes.TSTypeParameterDeclaration;
+export declare type TypeParameterInstantiationKind = namedTypes.TypeParameterInstantiation;
+export declare type TSTypeParameterInstantiationKind = namedTypes.TSTypeParameterInstantiation;
+export declare type ClassImplementsKind = namedTypes.ClassImplements;
+export declare type TSTypeKind = namedTypes.TSExpressionWithTypeArguments | namedTypes.TSTypeReference | namedTypes.TSAnyKeyword | namedTypes.TSBigIntKeyword | namedTypes.TSBooleanKeyword | namedTypes.TSNeverKeyword | namedTypes.TSNullKeyword | namedTypes.TSNumberKeyword | namedTypes.TSObjectKeyword | namedTypes.TSStringKeyword | namedTypes.TSSymbolKeyword | namedTypes.TSUndefinedKeyword | namedTypes.TSUnknownKeyword | namedTypes.TSVoidKeyword | namedTypes.TSThisType | namedTypes.TSArrayType | namedTypes.TSLiteralType | namedTypes.TSUnionType | namedTypes.TSIntersectionType | namedTypes.TSConditionalType | namedTypes.TSInferType | namedTypes.TSParenthesizedType | namedTypes.TSFunctionType | namedTypes.TSConstructorType | namedTypes.TSMappedType | namedTypes.TSTupleType | namedTypes.TSRestType | namedTypes.TSOptionalType | namedTypes.TSIndexedAccessType | namedTypes.TSTypeOperator | namedTypes.TSTypeQuery | namedTypes.TSImportType | namedTypes.TSTypeLiteral;
+export declare type TSHasOptionalTypeParameterInstantiationKind = namedTypes.TSExpressionWithTypeArguments | namedTypes.TSTypeReference | namedTypes.TSImportType;
+export declare type TSExpressionWithTypeArgumentsKind = namedTypes.TSExpressionWithTypeArguments;
+export declare type FlowKind = namedTypes.AnyTypeAnnotation | namedTypes.EmptyTypeAnnotation | namedTypes.MixedTypeAnnotation | namedTypes.VoidTypeAnnotation | namedTypes.NumberTypeAnnotation | namedTypes.NumberLiteralTypeAnnotation | namedTypes.NumericLiteralTypeAnnotation | namedTypes.StringTypeAnnotation | namedTypes.StringLiteralTypeAnnotation | namedTypes.BooleanTypeAnnotation | namedTypes.BooleanLiteralTypeAnnotation | namedTypes.NullableTypeAnnotation | namedTypes.NullLiteralTypeAnnotation | namedTypes.NullTypeAnnotation | namedTypes.ThisTypeAnnotation | namedTypes.ExistsTypeAnnotation | namedTypes.ExistentialTypeParam | namedTypes.FunctionTypeAnnotation | namedTypes.ArrayTypeAnnotation | namedTypes.ObjectTypeAnnotation | namedTypes.GenericTypeAnnotation | namedTypes.MemberTypeAnnotation | namedTypes.UnionTypeAnnotation | namedTypes.IntersectionTypeAnnotation | namedTypes.TypeofTypeAnnotation | namedTypes.TypeParameter | namedTypes.InterfaceTypeAnnotation | namedTypes.TupleTypeAnnotation | namedTypes.InferredPredicate | namedTypes.DeclaredPredicate;
+export declare type FlowTypeKind = namedTypes.AnyTypeAnnotation | namedTypes.EmptyTypeAnnotation | namedTypes.MixedTypeAnnotation | namedTypes.VoidTypeAnnotation | namedTypes.NumberTypeAnnotation | namedTypes.NumberLiteralTypeAnnotation | namedTypes.NumericLiteralTypeAnnotation | namedTypes.StringTypeAnnotation | namedTypes.StringLiteralTypeAnnotation | namedTypes.BooleanTypeAnnotation | namedTypes.BooleanLiteralTypeAnnotation | namedTypes.NullableTypeAnnotation | namedTypes.NullLiteralTypeAnnotation | namedTypes.NullTypeAnnotation | namedTypes.ThisTypeAnnotation | namedTypes.ExistsTypeAnnotation | namedTypes.ExistentialTypeParam | namedTypes.FunctionTypeAnnotation | namedTypes.ArrayTypeAnnotation | namedTypes.ObjectTypeAnnotation | namedTypes.GenericTypeAnnotation | namedTypes.MemberTypeAnnotation | namedTypes.UnionTypeAnnotation | namedTypes.IntersectionTypeAnnotation | namedTypes.TypeofTypeAnnotation | namedTypes.TypeParameter | namedTypes.InterfaceTypeAnnotation | namedTypes.TupleTypeAnnotation;
+export declare type AnyTypeAnnotationKind = namedTypes.AnyTypeAnnotation;
+export declare type EmptyTypeAnnotationKind = namedTypes.EmptyTypeAnnotation;
+export declare type MixedTypeAnnotationKind = namedTypes.MixedTypeAnnotation;
+export declare type VoidTypeAnnotationKind = namedTypes.VoidTypeAnnotation;
+export declare type NumberTypeAnnotationKind = namedTypes.NumberTypeAnnotation;
+export declare type NumberLiteralTypeAnnotationKind = namedTypes.NumberLiteralTypeAnnotation;
+export declare type NumericLiteralTypeAnnotationKind = namedTypes.NumericLiteralTypeAnnotation;
+export declare type StringTypeAnnotationKind = namedTypes.StringTypeAnnotation;
+export declare type StringLiteralTypeAnnotationKind = namedTypes.StringLiteralTypeAnnotation;
+export declare type BooleanTypeAnnotationKind = namedTypes.BooleanTypeAnnotation;
+export declare type BooleanLiteralTypeAnnotationKind = namedTypes.BooleanLiteralTypeAnnotation;
+export declare type NullableTypeAnnotationKind = namedTypes.NullableTypeAnnotation;
+export declare type NullLiteralTypeAnnotationKind = namedTypes.NullLiteralTypeAnnotation;
+export declare type NullTypeAnnotationKind = namedTypes.NullTypeAnnotation;
+export declare type ThisTypeAnnotationKind = namedTypes.ThisTypeAnnotation;
+export declare type ExistsTypeAnnotationKind = namedTypes.ExistsTypeAnnotation;
+export declare type ExistentialTypeParamKind = namedTypes.ExistentialTypeParam;
+export declare type FunctionTypeAnnotationKind = namedTypes.FunctionTypeAnnotation;
+export declare type FunctionTypeParamKind = namedTypes.FunctionTypeParam;
+export declare type ArrayTypeAnnotationKind = namedTypes.ArrayTypeAnnotation;
+export declare type ObjectTypeAnnotationKind = namedTypes.ObjectTypeAnnotation;
+export declare type ObjectTypePropertyKind = namedTypes.ObjectTypeProperty;
+export declare type ObjectTypeSpreadPropertyKind = namedTypes.ObjectTypeSpreadProperty;
+export declare type ObjectTypeIndexerKind = namedTypes.ObjectTypeIndexer;
+export declare type ObjectTypeCallPropertyKind = namedTypes.ObjectTypeCallProperty;
+export declare type ObjectTypeInternalSlotKind = namedTypes.ObjectTypeInternalSlot;
+export declare type VarianceKind = namedTypes.Variance;
+export declare type QualifiedTypeIdentifierKind = namedTypes.QualifiedTypeIdentifier;
+export declare type GenericTypeAnnotationKind = namedTypes.GenericTypeAnnotation;
+export declare type MemberTypeAnnotationKind = namedTypes.MemberTypeAnnotation;
+export declare type UnionTypeAnnotationKind = namedTypes.UnionTypeAnnotation;
+export declare type IntersectionTypeAnnotationKind = namedTypes.IntersectionTypeAnnotation;
+export declare type TypeofTypeAnnotationKind = namedTypes.TypeofTypeAnnotation;
+export declare type TypeParameterKind = namedTypes.TypeParameter;
+export declare type InterfaceTypeAnnotationKind = namedTypes.InterfaceTypeAnnotation;
+export declare type InterfaceExtendsKind = namedTypes.InterfaceExtends;
+export declare type InterfaceDeclarationKind = namedTypes.InterfaceDeclaration | namedTypes.DeclareInterface | namedTypes.DeclareClass;
+export declare type DeclareInterfaceKind = namedTypes.DeclareInterface;
+export declare type TypeAliasKind = namedTypes.TypeAlias | namedTypes.DeclareTypeAlias | namedTypes.DeclareOpaqueType;
+export declare type OpaqueTypeKind = namedTypes.OpaqueType;
+export declare type DeclareTypeAliasKind = namedTypes.DeclareTypeAlias;
+export declare type DeclareOpaqueTypeKind = namedTypes.DeclareOpaqueType;
+export declare type TypeCastExpressionKind = namedTypes.TypeCastExpression;
+export declare type TupleTypeAnnotationKind = namedTypes.TupleTypeAnnotation;
+export declare type DeclareVariableKind = namedTypes.DeclareVariable;
+export declare type DeclareFunctionKind = namedTypes.DeclareFunction;
+export declare type DeclareClassKind = namedTypes.DeclareClass;
+export declare type DeclareModuleKind = namedTypes.DeclareModule;
+export declare type DeclareModuleExportsKind = namedTypes.DeclareModuleExports;
+export declare type DeclareExportDeclarationKind = namedTypes.DeclareExportDeclaration;
+export declare type ExportSpecifierKind = namedTypes.ExportSpecifier;
+export declare type ExportBatchSpecifierKind = namedTypes.ExportBatchSpecifier;
+export declare type DeclareExportAllDeclarationKind = namedTypes.DeclareExportAllDeclaration;
+export declare type FlowPredicateKind = namedTypes.InferredPredicate | namedTypes.DeclaredPredicate;
+export declare type InferredPredicateKind = namedTypes.InferredPredicate;
+export declare type DeclaredPredicateKind = namedTypes.DeclaredPredicate;
+export declare type ExportDeclarationKind = namedTypes.ExportDeclaration;
+export declare type BlockKind = namedTypes.Block;
+export declare type LineKind = namedTypes.Line;
+export declare type NoopKind = namedTypes.Noop;
+export declare type DoExpressionKind = namedTypes.DoExpression;
+export declare type SuperKind = namedTypes.Super;
+export declare type BindExpressionKind = namedTypes.BindExpression;
+export declare type DecoratorKind = namedTypes.Decorator;
+export declare type MetaPropertyKind = namedTypes.MetaProperty;
+export declare type ParenthesizedExpressionKind = namedTypes.ParenthesizedExpression;
+export declare type ExportDefaultDeclarationKind = namedTypes.ExportDefaultDeclaration;
+export declare type ExportNamedDeclarationKind = namedTypes.ExportNamedDeclaration;
+export declare type ExportNamespaceSpecifierKind = namedTypes.ExportNamespaceSpecifier;
+export declare type ExportDefaultSpecifierKind = namedTypes.ExportDefaultSpecifier;
+export declare type ExportAllDeclarationKind = namedTypes.ExportAllDeclaration;
+export declare type CommentBlockKind = namedTypes.CommentBlock;
+export declare type CommentLineKind = namedTypes.CommentLine;
+export declare type DirectiveKind = namedTypes.Directive;
+export declare type DirectiveLiteralKind = namedTypes.DirectiveLiteral;
+export declare type InterpreterDirectiveKind = namedTypes.InterpreterDirective;
+export declare type StringLiteralKind = namedTypes.StringLiteral;
+export declare type NumericLiteralKind = namedTypes.NumericLiteral;
+export declare type BigIntLiteralKind = namedTypes.BigIntLiteral;
+export declare type NullLiteralKind = namedTypes.NullLiteral;
+export declare type BooleanLiteralKind = namedTypes.BooleanLiteral;
+export declare type RegExpLiteralKind = namedTypes.RegExpLiteral;
+export declare type ObjectMethodKind = namedTypes.ObjectMethod;
+export declare type ClassPrivatePropertyKind = namedTypes.ClassPrivateProperty;
+export declare type ClassMethodKind = namedTypes.ClassMethod;
+export declare type ClassPrivateMethodKind = namedTypes.ClassPrivateMethod;
+export declare type PrivateNameKind = namedTypes.PrivateName;
+export declare type RestPropertyKind = namedTypes.RestProperty;
+export declare type ForAwaitStatementKind = namedTypes.ForAwaitStatement;
+export declare type ImportKind = namedTypes.Import;
+export declare type TSQualifiedNameKind = namedTypes.TSQualifiedName;
+export declare type TSTypeReferenceKind = namedTypes.TSTypeReference;
+export declare type TSHasOptionalTypeParametersKind = namedTypes.TSFunctionType | namedTypes.TSConstructorType | namedTypes.TSDeclareFunction | namedTypes.TSDeclareMethod | namedTypes.TSMethodSignature | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration | namedTypes.TSTypeAliasDeclaration | namedTypes.TSInterfaceDeclaration;
+export declare type TSHasOptionalTypeAnnotationKind = namedTypes.TSFunctionType | namedTypes.TSConstructorType | namedTypes.TSIndexSignature | namedTypes.TSPropertySignature | namedTypes.TSMethodSignature | namedTypes.TSCallSignatureDeclaration | namedTypes.TSConstructSignatureDeclaration;
+export declare type TSAsExpressionKind = namedTypes.TSAsExpression;
+export declare type TSNonNullExpressionKind = namedTypes.TSNonNullExpression;
+export declare type TSAnyKeywordKind = namedTypes.TSAnyKeyword;
+export declare type TSBigIntKeywordKind = namedTypes.TSBigIntKeyword;
+export declare type TSBooleanKeywordKind = namedTypes.TSBooleanKeyword;
+export declare type TSNeverKeywordKind = namedTypes.TSNeverKeyword;
+export declare type TSNullKeywordKind = namedTypes.TSNullKeyword;
+export declare type TSNumberKeywordKind = namedTypes.TSNumberKeyword;
+export declare type TSObjectKeywordKind = namedTypes.TSObjectKeyword;
+export declare type TSStringKeywordKind = namedTypes.TSStringKeyword;
+export declare type TSSymbolKeywordKind = namedTypes.TSSymbolKeyword;
+export declare type TSUndefinedKeywordKind = namedTypes.TSUndefinedKeyword;
+export declare type TSUnknownKeywordKind = namedTypes.TSUnknownKeyword;
+export declare type TSVoidKeywordKind = namedTypes.TSVoidKeyword;
+export declare type TSThisTypeKind = namedTypes.TSThisType;
+export declare type TSArrayTypeKind = namedTypes.TSArrayType;
+export declare type TSLiteralTypeKind = namedTypes.TSLiteralType;
+export declare type TSUnionTypeKind = namedTypes.TSUnionType;
+export declare type TSIntersectionTypeKind = namedTypes.TSIntersectionType;
+export declare type TSConditionalTypeKind = namedTypes.TSConditionalType;
+export declare type TSInferTypeKind = namedTypes.TSInferType;
+export declare type TSTypeParameterKind = namedTypes.TSTypeParameter;
+export declare type TSParenthesizedTypeKind = namedTypes.TSParenthesizedType;
+export declare type TSFunctionTypeKind = namedTypes.TSFunctionType;
+export declare type TSConstructorTypeKind = namedTypes.TSConstructorType;
+export declare type TSDeclareFunctionKind = namedTypes.TSDeclareFunction;
+export declare type TSDeclareMethodKind = namedTypes.TSDeclareMethod;
+export declare type TSMappedTypeKind = namedTypes.TSMappedType;
+export declare type TSTupleTypeKind = namedTypes.TSTupleType;
+export declare type TSRestTypeKind = namedTypes.TSRestType;
+export declare type TSOptionalTypeKind = namedTypes.TSOptionalType;
+export declare type TSIndexedAccessTypeKind = namedTypes.TSIndexedAccessType;
+export declare type TSTypeOperatorKind = namedTypes.TSTypeOperator;
+export declare type TSIndexSignatureKind = namedTypes.TSIndexSignature;
+export declare type TSPropertySignatureKind = namedTypes.TSPropertySignature;
+export declare type TSMethodSignatureKind = namedTypes.TSMethodSignature;
+export declare type TSTypePredicateKind = namedTypes.TSTypePredicate;
+export declare type TSCallSignatureDeclarationKind = namedTypes.TSCallSignatureDeclaration;
+export declare type TSConstructSignatureDeclarationKind = namedTypes.TSConstructSignatureDeclaration;
+export declare type TSEnumMemberKind = namedTypes.TSEnumMember;
+export declare type TSTypeQueryKind = namedTypes.TSTypeQuery;
+export declare type TSImportTypeKind = namedTypes.TSImportType;
+export declare type TSTypeLiteralKind = namedTypes.TSTypeLiteral;
+export declare type TSTypeAssertionKind = namedTypes.TSTypeAssertion;
+export declare type TSEnumDeclarationKind = namedTypes.TSEnumDeclaration;
+export declare type TSTypeAliasDeclarationKind = namedTypes.TSTypeAliasDeclaration;
+export declare type TSModuleBlockKind = namedTypes.TSModuleBlock;
+export declare type TSModuleDeclarationKind = namedTypes.TSModuleDeclaration;
+export declare type TSImportEqualsDeclarationKind = namedTypes.TSImportEqualsDeclaration;
+export declare type TSExternalModuleReferenceKind = namedTypes.TSExternalModuleReference;
+export declare type TSExportAssignmentKind = namedTypes.TSExportAssignment;
+export declare type TSNamespaceExportDeclarationKind = namedTypes.TSNamespaceExportDeclaration;
+export declare type TSInterfaceBodyKind = namedTypes.TSInterfaceBody;
+export declare type TSInterfaceDeclarationKind = namedTypes.TSInterfaceDeclaration;
+export declare type TSParameterPropertyKind = namedTypes.TSParameterProperty;
+export declare type OptionalMemberExpressionKind = namedTypes.OptionalMemberExpression;
+export declare type OptionalCallExpressionKind = namedTypes.OptionalCallExpression;
diff --git a/node_modules/ast-types/gen/kinds.js b/node_modules/ast-types/gen/kinds.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ast-types/gen/kinds.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ast-types/gen/namedTypes.d.ts b/node_modules/ast-types/gen/namedTypes.d.ts
new file mode 100644
index 0000000..5995596
--- /dev/null
+++ b/node_modules/ast-types/gen/namedTypes.d.ts
@@ -0,0 +1,1794 @@
+import { Omit } from "../types";
+import { Type } from "../lib/types";
+import * as K from "./kinds";
+export declare namespace namedTypes {
+    interface Printable {
+        loc?: K.SourceLocationKind | null;
+    }
+    interface SourceLocation {
+        start: K.PositionKind;
+        end: K.PositionKind;
+        source?: string | null;
+    }
+    interface Node extends Printable {
+        type: string;
+        comments?: K.CommentKind[] | null;
+    }
+    interface Comment extends Printable {
+        value: string;
+        leading?: boolean;
+        trailing?: boolean;
+    }
+    interface Position {
+        line: number;
+        column: number;
+    }
+    interface File extends Omit<Node, "type"> {
+        type: "File";
+        program: K.ProgramKind;
+        name?: string | null;
+    }
+    interface Program extends Omit<Node, "type"> {
+        type: "Program";
+        body: K.StatementKind[];
+        directives?: K.DirectiveKind[];
+        interpreter?: K.InterpreterDirectiveKind | null;
+    }
+    interface Statement extends Node {
+    }
+    interface Function extends Node {
+        id?: K.IdentifierKind | null;
+        params: K.PatternKind[];
+        body: K.BlockStatementKind;
+        generator?: boolean;
+        async?: boolean;
+        expression?: boolean;
+        defaults?: (K.ExpressionKind | null)[];
+        rest?: K.IdentifierKind | null;
+        returnType?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    }
+    interface Expression extends Node {
+    }
+    interface Pattern extends Node {
+    }
+    interface Identifier extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+        type: "Identifier";
+        name: string;
+        optional?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }
+    interface BlockStatement extends Omit<Statement, "type"> {
+        type: "BlockStatement";
+        body: K.StatementKind[];
+        directives?: K.DirectiveKind[];
+    }
+    interface EmptyStatement extends Omit<Statement, "type"> {
+        type: "EmptyStatement";
+    }
+    interface ExpressionStatement extends Omit<Statement, "type"> {
+        type: "ExpressionStatement";
+        expression: K.ExpressionKind;
+    }
+    interface IfStatement extends Omit<Statement, "type"> {
+        type: "IfStatement";
+        test: K.ExpressionKind;
+        consequent: K.StatementKind;
+        alternate?: K.StatementKind | null;
+    }
+    interface LabeledStatement extends Omit<Statement, "type"> {
+        type: "LabeledStatement";
+        label: K.IdentifierKind;
+        body: K.StatementKind;
+    }
+    interface BreakStatement extends Omit<Statement, "type"> {
+        type: "BreakStatement";
+        label?: K.IdentifierKind | null;
+    }
+    interface ContinueStatement extends Omit<Statement, "type"> {
+        type: "ContinueStatement";
+        label?: K.IdentifierKind | null;
+    }
+    interface WithStatement extends Omit<Statement, "type"> {
+        type: "WithStatement";
+        object: K.ExpressionKind;
+        body: K.StatementKind;
+    }
+    interface SwitchStatement extends Omit<Statement, "type"> {
+        type: "SwitchStatement";
+        discriminant: K.ExpressionKind;
+        cases: K.SwitchCaseKind[];
+        lexical?: boolean;
+    }
+    interface SwitchCase extends Omit<Node, "type"> {
+        type: "SwitchCase";
+        test: K.ExpressionKind | null;
+        consequent: K.StatementKind[];
+    }
+    interface ReturnStatement extends Omit<Statement, "type"> {
+        type: "ReturnStatement";
+        argument: K.ExpressionKind | null;
+    }
+    interface ThrowStatement extends Omit<Statement, "type"> {
+        type: "ThrowStatement";
+        argument: K.ExpressionKind;
+    }
+    interface TryStatement extends Omit<Statement, "type"> {
+        type: "TryStatement";
+        block: K.BlockStatementKind;
+        handler?: K.CatchClauseKind | null;
+        handlers?: K.CatchClauseKind[];
+        guardedHandlers?: K.CatchClauseKind[];
+        finalizer?: K.BlockStatementKind | null;
+    }
+    interface CatchClause extends Omit<Node, "type"> {
+        type: "CatchClause";
+        param?: K.PatternKind | null;
+        guard?: K.ExpressionKind | null;
+        body: K.BlockStatementKind;
+    }
+    interface WhileStatement extends Omit<Statement, "type"> {
+        type: "WhileStatement";
+        test: K.ExpressionKind;
+        body: K.StatementKind;
+    }
+    interface DoWhileStatement extends Omit<Statement, "type"> {
+        type: "DoWhileStatement";
+        body: K.StatementKind;
+        test: K.ExpressionKind;
+    }
+    interface ForStatement extends Omit<Statement, "type"> {
+        type: "ForStatement";
+        init: K.VariableDeclarationKind | K.ExpressionKind | null;
+        test: K.ExpressionKind | null;
+        update: K.ExpressionKind | null;
+        body: K.StatementKind;
+    }
+    interface Declaration extends Statement {
+    }
+    interface VariableDeclaration extends Omit<Declaration, "type"> {
+        type: "VariableDeclaration";
+        kind: "var" | "let" | "const";
+        declarations: (K.VariableDeclaratorKind | K.IdentifierKind)[];
+    }
+    interface ForInStatement extends Omit<Statement, "type"> {
+        type: "ForInStatement";
+        left: K.VariableDeclarationKind | K.ExpressionKind;
+        right: K.ExpressionKind;
+        body: K.StatementKind;
+    }
+    interface DebuggerStatement extends Omit<Statement, "type"> {
+        type: "DebuggerStatement";
+    }
+    interface FunctionDeclaration extends Omit<Function, "type" | "id">, Omit<Declaration, "type"> {
+        type: "FunctionDeclaration";
+        id: K.IdentifierKind;
+    }
+    interface FunctionExpression extends Omit<Function, "type">, Omit<Expression, "type"> {
+        type: "FunctionExpression";
+    }
+    interface VariableDeclarator extends Omit<Node, "type"> {
+        type: "VariableDeclarator";
+        id: K.PatternKind;
+        init?: K.ExpressionKind | null;
+    }
+    interface ThisExpression extends Omit<Expression, "type"> {
+        type: "ThisExpression";
+    }
+    interface ArrayExpression extends Omit<Expression, "type"> {
+        type: "ArrayExpression";
+        elements: (K.ExpressionKind | K.SpreadElementKind | K.RestElementKind | null)[];
+    }
+    interface ObjectExpression extends Omit<Expression, "type"> {
+        type: "ObjectExpression";
+        properties: (K.PropertyKind | K.ObjectMethodKind | K.ObjectPropertyKind | K.SpreadPropertyKind | K.SpreadElementKind)[];
+    }
+    interface Property extends Omit<Node, "type"> {
+        type: "Property";
+        kind: "init" | "get" | "set";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        value: K.ExpressionKind | K.PatternKind;
+        method?: boolean;
+        shorthand?: boolean;
+        computed?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+    }
+    interface Literal extends Omit<Expression, "type"> {
+        type: "Literal";
+        value: string | boolean | null | number | RegExp;
+        regex?: {
+            pattern: string;
+            flags: string;
+        } | null;
+    }
+    interface SequenceExpression extends Omit<Expression, "type"> {
+        type: "SequenceExpression";
+        expressions: K.ExpressionKind[];
+    }
+    interface UnaryExpression extends Omit<Expression, "type"> {
+        type: "UnaryExpression";
+        operator: "-" | "+" | "!" | "~" | "typeof" | "void" | "delete";
+        argument: K.ExpressionKind;
+        prefix?: boolean;
+    }
+    interface BinaryExpression extends Omit<Expression, "type"> {
+        type: "BinaryExpression";
+        operator: "==" | "!=" | "===" | "!==" | "<" | "<=" | ">" | ">=" | "<<" | ">>" | ">>>" | "+" | "-" | "*" | "/" | "%" | "**" | "&" | "|" | "^" | "in" | "instanceof";
+        left: K.ExpressionKind;
+        right: K.ExpressionKind;
+    }
+    interface AssignmentExpression extends Omit<Expression, "type"> {
+        type: "AssignmentExpression";
+        operator: "=" | "+=" | "-=" | "*=" | "/=" | "%=" | "<<=" | ">>=" | ">>>=" | "|=" | "^=" | "&=";
+        left: K.PatternKind | K.MemberExpressionKind;
+        right: K.ExpressionKind;
+    }
+    interface MemberExpression extends Omit<Expression, "type"> {
+        type: "MemberExpression";
+        object: K.ExpressionKind;
+        property: K.IdentifierKind | K.ExpressionKind;
+        computed?: boolean;
+    }
+    interface UpdateExpression extends Omit<Expression, "type"> {
+        type: "UpdateExpression";
+        operator: "++" | "--";
+        argument: K.ExpressionKind;
+        prefix: boolean;
+    }
+    interface LogicalExpression extends Omit<Expression, "type"> {
+        type: "LogicalExpression";
+        operator: "||" | "&&" | "??";
+        left: K.ExpressionKind;
+        right: K.ExpressionKind;
+    }
+    interface ConditionalExpression extends Omit<Expression, "type"> {
+        type: "ConditionalExpression";
+        test: K.ExpressionKind;
+        consequent: K.ExpressionKind;
+        alternate: K.ExpressionKind;
+    }
+    interface NewExpression extends Omit<Expression, "type"> {
+        type: "NewExpression";
+        callee: K.ExpressionKind;
+        arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+        typeArguments?: null | K.TypeParameterInstantiationKind;
+    }
+    interface CallExpression extends Omit<Expression, "type"> {
+        type: "CallExpression";
+        callee: K.ExpressionKind;
+        arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+        typeArguments?: null | K.TypeParameterInstantiationKind;
+    }
+    interface RestElement extends Omit<Pattern, "type"> {
+        type: "RestElement";
+        argument: K.PatternKind;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    }
+    interface TypeAnnotation extends Omit<Node, "type"> {
+        type: "TypeAnnotation";
+        typeAnnotation: K.FlowTypeKind;
+    }
+    interface TSTypeAnnotation extends Omit<Node, "type"> {
+        type: "TSTypeAnnotation";
+        typeAnnotation: K.TSTypeKind | K.TSTypeAnnotationKind;
+    }
+    interface SpreadElementPattern extends Omit<Pattern, "type"> {
+        type: "SpreadElementPattern";
+        argument: K.PatternKind;
+    }
+    interface ArrowFunctionExpression extends Omit<Function, "type" | "id" | "body" | "generator">, Omit<Expression, "type"> {
+        type: "ArrowFunctionExpression";
+        id?: null;
+        body: K.BlockStatementKind | K.ExpressionKind;
+        generator?: false;
+    }
+    interface ForOfStatement extends Omit<Statement, "type"> {
+        type: "ForOfStatement";
+        left: K.VariableDeclarationKind | K.PatternKind;
+        right: K.ExpressionKind;
+        body: K.StatementKind;
+    }
+    interface YieldExpression extends Omit<Expression, "type"> {
+        type: "YieldExpression";
+        argument: K.ExpressionKind | null;
+        delegate?: boolean;
+    }
+    interface GeneratorExpression extends Omit<Expression, "type"> {
+        type: "GeneratorExpression";
+        body: K.ExpressionKind;
+        blocks: K.ComprehensionBlockKind[];
+        filter: K.ExpressionKind | null;
+    }
+    interface ComprehensionBlock extends Omit<Node, "type"> {
+        type: "ComprehensionBlock";
+        left: K.PatternKind;
+        right: K.ExpressionKind;
+        each: boolean;
+    }
+    interface ComprehensionExpression extends Omit<Expression, "type"> {
+        type: "ComprehensionExpression";
+        body: K.ExpressionKind;
+        blocks: K.ComprehensionBlockKind[];
+        filter: K.ExpressionKind | null;
+    }
+    interface ObjectProperty extends Omit<Node, "type"> {
+        shorthand?: boolean;
+        type: "ObjectProperty";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        value: K.ExpressionKind | K.PatternKind;
+        accessibility?: K.LiteralKind | null;
+        computed?: boolean;
+    }
+    interface PropertyPattern extends Omit<Pattern, "type"> {
+        type: "PropertyPattern";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        pattern: K.PatternKind;
+        computed?: boolean;
+    }
+    interface ObjectPattern extends Omit<Pattern, "type"> {
+        type: "ObjectPattern";
+        properties: (K.PropertyKind | K.PropertyPatternKind | K.SpreadPropertyPatternKind | K.SpreadPropertyKind | K.ObjectPropertyKind | K.RestPropertyKind)[];
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        decorators?: K.DecoratorKind[] | null;
+    }
+    interface ArrayPattern extends Omit<Pattern, "type"> {
+        type: "ArrayPattern";
+        elements: (K.PatternKind | K.SpreadElementKind | null)[];
+    }
+    interface MethodDefinition extends Omit<Declaration, "type"> {
+        type: "MethodDefinition";
+        kind: "constructor" | "method" | "get" | "set";
+        key: K.ExpressionKind;
+        value: K.FunctionKind;
+        computed?: boolean;
+        static?: boolean;
+        decorators?: K.DecoratorKind[] | null;
+    }
+    interface SpreadElement extends Omit<Node, "type"> {
+        type: "SpreadElement";
+        argument: K.ExpressionKind;
+    }
+    interface AssignmentPattern extends Omit<Pattern, "type"> {
+        type: "AssignmentPattern";
+        left: K.PatternKind;
+        right: K.ExpressionKind;
+    }
+    interface ClassPropertyDefinition extends Omit<Declaration, "type"> {
+        type: "ClassPropertyDefinition";
+        definition: K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind;
+    }
+    interface ClassProperty extends Omit<Declaration, "type"> {
+        type: "ClassProperty";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        computed?: boolean;
+        value: K.ExpressionKind | null;
+        static?: boolean;
+        typeAnnotation?: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+        access?: "public" | "private" | "protected" | undefined;
+    }
+    interface ClassBody extends Omit<Declaration, "type"> {
+        type: "ClassBody";
+        body: (K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind | K.ClassPrivatePropertyKind | K.ClassMethodKind | K.ClassPrivateMethodKind | K.TSDeclareMethodKind | K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+    }
+    interface ClassDeclaration extends Omit<Declaration, "type"> {
+        type: "ClassDeclaration";
+        id: K.IdentifierKind | null;
+        body: K.ClassBodyKind;
+        superClass?: K.ExpressionKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+        superTypeParameters?: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+        implements?: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+    }
+    interface ClassExpression extends Omit<Expression, "type"> {
+        type: "ClassExpression";
+        id?: K.IdentifierKind | null;
+        body: K.ClassBodyKind;
+        superClass?: K.ExpressionKind | null;
+        typeParameters?: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+        superTypeParameters?: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+        implements?: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+    }
+    interface Specifier extends Node {
+    }
+    interface ModuleSpecifier extends Specifier {
+        local?: K.IdentifierKind | null;
+        id?: K.IdentifierKind | null;
+        name?: K.IdentifierKind | null;
+    }
+    interface ImportSpecifier extends Omit<ModuleSpecifier, "type"> {
+        type: "ImportSpecifier";
+        imported: K.IdentifierKind;
+    }
+    interface ImportNamespaceSpecifier extends Omit<ModuleSpecifier, "type"> {
+        type: "ImportNamespaceSpecifier";
+    }
+    interface ImportDefaultSpecifier extends Omit<ModuleSpecifier, "type"> {
+        type: "ImportDefaultSpecifier";
+    }
+    interface ImportDeclaration extends Omit<Declaration, "type"> {
+        type: "ImportDeclaration";
+        specifiers?: (K.ImportSpecifierKind | K.ImportNamespaceSpecifierKind | K.ImportDefaultSpecifierKind)[];
+        source: K.LiteralKind;
+        importKind?: "value" | "type";
+    }
+    interface TaggedTemplateExpression extends Omit<Expression, "type"> {
+        type: "TaggedTemplateExpression";
+        tag: K.ExpressionKind;
+        quasi: K.TemplateLiteralKind;
+    }
+    interface TemplateLiteral extends Omit<Expression, "type"> {
+        type: "TemplateLiteral";
+        quasis: K.TemplateElementKind[];
+        expressions: K.ExpressionKind[];
+    }
+    interface TemplateElement extends Omit<Node, "type"> {
+        type: "TemplateElement";
+        value: {
+            cooked: string;
+            raw: string;
+        };
+        tail: boolean;
+    }
+    interface SpreadProperty extends Omit<Node, "type"> {
+        type: "SpreadProperty";
+        argument: K.ExpressionKind;
+    }
+    interface SpreadPropertyPattern extends Omit<Pattern, "type"> {
+        type: "SpreadPropertyPattern";
+        argument: K.PatternKind;
+    }
+    interface AwaitExpression extends Omit<Expression, "type"> {
+        type: "AwaitExpression";
+        argument: K.ExpressionKind | null;
+        all?: boolean;
+    }
+    interface JSXAttribute extends Omit<Node, "type"> {
+        type: "JSXAttribute";
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind;
+        value?: K.LiteralKind | K.JSXExpressionContainerKind | null;
+    }
+    interface JSXIdentifier extends Omit<Identifier, "type" | "name"> {
+        type: "JSXIdentifier";
+        name: string;
+    }
+    interface JSXNamespacedName extends Omit<Node, "type"> {
+        type: "JSXNamespacedName";
+        namespace: K.JSXIdentifierKind;
+        name: K.JSXIdentifierKind;
+    }
+    interface JSXExpressionContainer extends Omit<Expression, "type"> {
+        type: "JSXExpressionContainer";
+        expression: K.ExpressionKind;
+    }
+    interface JSXMemberExpression extends Omit<MemberExpression, "type" | "object" | "property" | "computed"> {
+        type: "JSXMemberExpression";
+        object: K.JSXIdentifierKind | K.JSXMemberExpressionKind;
+        property: K.JSXIdentifierKind;
+        computed?: boolean;
+    }
+    interface JSXSpreadAttribute extends Omit<Node, "type"> {
+        type: "JSXSpreadAttribute";
+        argument: K.ExpressionKind;
+    }
+    interface JSXElement extends Omit<Expression, "type"> {
+        type: "JSXElement";
+        openingElement: K.JSXOpeningElementKind;
+        closingElement?: K.JSXClosingElementKind | null;
+        children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+        name?: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+        selfClosing?: boolean;
+        attributes?: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+    }
+    interface JSXOpeningElement extends Omit<Node, "type"> {
+        type: "JSXOpeningElement";
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+        attributes?: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+        selfClosing?: boolean;
+    }
+    interface JSXClosingElement extends Omit<Node, "type"> {
+        type: "JSXClosingElement";
+        name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+    }
+    interface JSXFragment extends Omit<Expression, "type"> {
+        type: "JSXFragment";
+        openingElement: K.JSXOpeningFragmentKind;
+        closingElement: K.JSXClosingFragmentKind;
+        children?: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+    }
+    interface JSXText extends Omit<Literal, "type" | "value"> {
+        type: "JSXText";
+        value: string;
+    }
+    interface JSXOpeningFragment extends Omit<Node, "type"> {
+        type: "JSXOpeningFragment";
+    }
+    interface JSXClosingFragment extends Omit<Node, "type"> {
+        type: "JSXClosingFragment";
+    }
+    interface JSXEmptyExpression extends Omit<Expression, "type"> {
+        type: "JSXEmptyExpression";
+    }
+    interface JSXSpreadChild extends Omit<Expression, "type"> {
+        type: "JSXSpreadChild";
+        expression: K.ExpressionKind;
+    }
+    interface TypeParameterDeclaration extends Omit<Node, "type"> {
+        type: "TypeParameterDeclaration";
+        params: K.TypeParameterKind[];
+    }
+    interface TSTypeParameterDeclaration extends Omit<Declaration, "type"> {
+        type: "TSTypeParameterDeclaration";
+        params: K.TSTypeParameterKind[];
+    }
+    interface TypeParameterInstantiation extends Omit<Node, "type"> {
+        type: "TypeParameterInstantiation";
+        params: K.FlowTypeKind[];
+    }
+    interface TSTypeParameterInstantiation extends Omit<Node, "type"> {
+        type: "TSTypeParameterInstantiation";
+        params: K.TSTypeKind[];
+    }
+    interface ClassImplements extends Omit<Node, "type"> {
+        type: "ClassImplements";
+        id: K.IdentifierKind;
+        superClass?: K.ExpressionKind | null;
+        typeParameters?: K.TypeParameterInstantiationKind | null;
+    }
+    interface TSType extends Node {
+    }
+    interface TSHasOptionalTypeParameterInstantiation {
+        typeParameters?: K.TSTypeParameterInstantiationKind | null;
+    }
+    interface TSExpressionWithTypeArguments extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+        type: "TSExpressionWithTypeArguments";
+        expression: K.IdentifierKind | K.TSQualifiedNameKind;
+    }
+    interface Flow extends Node {
+    }
+    interface FlowType extends Flow {
+    }
+    interface AnyTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "AnyTypeAnnotation";
+    }
+    interface EmptyTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "EmptyTypeAnnotation";
+    }
+    interface MixedTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "MixedTypeAnnotation";
+    }
+    interface VoidTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "VoidTypeAnnotation";
+    }
+    interface NumberTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NumberTypeAnnotation";
+    }
+    interface NumberLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NumberLiteralTypeAnnotation";
+        value: number;
+        raw: string;
+    }
+    interface NumericLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NumericLiteralTypeAnnotation";
+        value: number;
+        raw: string;
+    }
+    interface StringTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "StringTypeAnnotation";
+    }
+    interface StringLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "StringLiteralTypeAnnotation";
+        value: string;
+        raw: string;
+    }
+    interface BooleanTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "BooleanTypeAnnotation";
+    }
+    interface BooleanLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "BooleanLiteralTypeAnnotation";
+        value: boolean;
+        raw: string;
+    }
+    interface NullableTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NullableTypeAnnotation";
+        typeAnnotation: K.FlowTypeKind;
+    }
+    interface NullLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NullLiteralTypeAnnotation";
+    }
+    interface NullTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "NullTypeAnnotation";
+    }
+    interface ThisTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "ThisTypeAnnotation";
+    }
+    interface ExistsTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "ExistsTypeAnnotation";
+    }
+    interface ExistentialTypeParam extends Omit<FlowType, "type"> {
+        type: "ExistentialTypeParam";
+    }
+    interface FunctionTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "FunctionTypeAnnotation";
+        params: K.FunctionTypeParamKind[];
+        returnType: K.FlowTypeKind;
+        rest: K.FunctionTypeParamKind | null;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+    }
+    interface FunctionTypeParam extends Omit<Node, "type"> {
+        type: "FunctionTypeParam";
+        name: K.IdentifierKind;
+        typeAnnotation: K.FlowTypeKind;
+        optional: boolean;
+    }
+    interface ArrayTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "ArrayTypeAnnotation";
+        elementType: K.FlowTypeKind;
+    }
+    interface ObjectTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "ObjectTypeAnnotation";
+        properties: (K.ObjectTypePropertyKind | K.ObjectTypeSpreadPropertyKind)[];
+        indexers?: K.ObjectTypeIndexerKind[];
+        callProperties?: K.ObjectTypeCallPropertyKind[];
+        inexact?: boolean | undefined;
+        exact?: boolean;
+        internalSlots?: K.ObjectTypeInternalSlotKind[];
+    }
+    interface ObjectTypeProperty extends Omit<Node, "type"> {
+        type: "ObjectTypeProperty";
+        key: K.LiteralKind | K.IdentifierKind;
+        value: K.FlowTypeKind;
+        optional: boolean;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }
+    interface ObjectTypeSpreadProperty extends Omit<Node, "type"> {
+        type: "ObjectTypeSpreadProperty";
+        argument: K.FlowTypeKind;
+    }
+    interface ObjectTypeIndexer extends Omit<Node, "type"> {
+        type: "ObjectTypeIndexer";
+        id: K.IdentifierKind;
+        key: K.FlowTypeKind;
+        value: K.FlowTypeKind;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+    }
+    interface ObjectTypeCallProperty extends Omit<Node, "type"> {
+        type: "ObjectTypeCallProperty";
+        value: K.FunctionTypeAnnotationKind;
+        static?: boolean;
+    }
+    interface ObjectTypeInternalSlot extends Omit<Node, "type"> {
+        type: "ObjectTypeInternalSlot";
+        id: K.IdentifierKind;
+        value: K.FlowTypeKind;
+        optional: boolean;
+        static: boolean;
+        method: boolean;
+    }
+    interface Variance extends Omit<Node, "type"> {
+        type: "Variance";
+        kind: "plus" | "minus";
+    }
+    interface QualifiedTypeIdentifier extends Omit<Node, "type"> {
+        type: "QualifiedTypeIdentifier";
+        qualification: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+        id: K.IdentifierKind;
+    }
+    interface GenericTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "GenericTypeAnnotation";
+        id: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+        typeParameters: K.TypeParameterInstantiationKind | null;
+    }
+    interface MemberTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "MemberTypeAnnotation";
+        object: K.IdentifierKind;
+        property: K.MemberTypeAnnotationKind | K.GenericTypeAnnotationKind;
+    }
+    interface UnionTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "UnionTypeAnnotation";
+        types: K.FlowTypeKind[];
+    }
+    interface IntersectionTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "IntersectionTypeAnnotation";
+        types: K.FlowTypeKind[];
+    }
+    interface TypeofTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "TypeofTypeAnnotation";
+        argument: K.FlowTypeKind;
+    }
+    interface TypeParameter extends Omit<FlowType, "type"> {
+        type: "TypeParameter";
+        name: string;
+        variance?: K.VarianceKind | "plus" | "minus" | null;
+        bound?: K.TypeAnnotationKind | null;
+    }
+    interface InterfaceTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "InterfaceTypeAnnotation";
+        body: K.ObjectTypeAnnotationKind;
+        extends?: K.InterfaceExtendsKind[] | null;
+    }
+    interface InterfaceExtends extends Omit<Node, "type"> {
+        type: "InterfaceExtends";
+        id: K.IdentifierKind;
+        typeParameters?: K.TypeParameterInstantiationKind | null;
+    }
+    interface InterfaceDeclaration extends Omit<Declaration, "type"> {
+        type: "InterfaceDeclaration";
+        id: K.IdentifierKind;
+        typeParameters?: K.TypeParameterDeclarationKind | null;
+        body: K.ObjectTypeAnnotationKind;
+        extends: K.InterfaceExtendsKind[];
+    }
+    interface DeclareInterface extends Omit<InterfaceDeclaration, "type"> {
+        type: "DeclareInterface";
+    }
+    interface TypeAlias extends Omit<Declaration, "type"> {
+        type: "TypeAlias";
+        id: K.IdentifierKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+        right: K.FlowTypeKind;
+    }
+    interface OpaqueType extends Omit<Declaration, "type"> {
+        type: "OpaqueType";
+        id: K.IdentifierKind;
+        typeParameters: K.TypeParameterDeclarationKind | null;
+        impltype: K.FlowTypeKind;
+        supertype: K.FlowTypeKind;
+    }
+    interface DeclareTypeAlias extends Omit<TypeAlias, "type"> {
+        type: "DeclareTypeAlias";
+    }
+    interface DeclareOpaqueType extends Omit<TypeAlias, "type"> {
+        type: "DeclareOpaqueType";
+    }
+    interface TypeCastExpression extends Omit<Expression, "type"> {
+        type: "TypeCastExpression";
+        expression: K.ExpressionKind;
+        typeAnnotation: K.TypeAnnotationKind;
+    }
+    interface TupleTypeAnnotation extends Omit<FlowType, "type"> {
+        type: "TupleTypeAnnotation";
+        types: K.FlowTypeKind[];
+    }
+    interface DeclareVariable extends Omit<Statement, "type"> {
+        type: "DeclareVariable";
+        id: K.IdentifierKind;
+    }
+    interface DeclareFunction extends Omit<Statement, "type"> {
+        type: "DeclareFunction";
+        id: K.IdentifierKind;
+    }
+    interface DeclareClass extends Omit<InterfaceDeclaration, "type"> {
+        type: "DeclareClass";
+    }
+    interface DeclareModule extends Omit<Statement, "type"> {
+        type: "DeclareModule";
+        id: K.IdentifierKind | K.LiteralKind;
+        body: K.BlockStatementKind;
+    }
+    interface DeclareModuleExports extends Omit<Statement, "type"> {
+        type: "DeclareModuleExports";
+        typeAnnotation: K.TypeAnnotationKind;
+    }
+    interface DeclareExportDeclaration extends Omit<Declaration, "type"> {
+        type: "DeclareExportDeclaration";
+        default: boolean;
+        declaration: K.DeclareVariableKind | K.DeclareFunctionKind | K.DeclareClassKind | K.FlowTypeKind | null;
+        specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+        source?: K.LiteralKind | null;
+    }
+    interface ExportSpecifier extends Omit<ModuleSpecifier, "type"> {
+        type: "ExportSpecifier";
+        exported: K.IdentifierKind;
+    }
+    interface ExportBatchSpecifier extends Omit<Specifier, "type"> {
+        type: "ExportBatchSpecifier";
+    }
+    interface DeclareExportAllDeclaration extends Omit<Declaration, "type"> {
+        type: "DeclareExportAllDeclaration";
+        source?: K.LiteralKind | null;
+    }
+    interface FlowPredicate extends Flow {
+    }
+    interface InferredPredicate extends Omit<FlowPredicate, "type"> {
+        type: "InferredPredicate";
+    }
+    interface DeclaredPredicate extends Omit<FlowPredicate, "type"> {
+        type: "DeclaredPredicate";
+        value: K.ExpressionKind;
+    }
+    interface ExportDeclaration extends Omit<Declaration, "type"> {
+        type: "ExportDeclaration";
+        default: boolean;
+        declaration: K.DeclarationKind | K.ExpressionKind | null;
+        specifiers?: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+        source?: K.LiteralKind | null;
+    }
+    interface Block extends Comment {
+        type: "Block";
+    }
+    interface Line extends Comment {
+        type: "Line";
+    }
+    interface Noop extends Omit<Statement, "type"> {
+        type: "Noop";
+    }
+    interface DoExpression extends Omit<Expression, "type"> {
+        type: "DoExpression";
+        body: K.StatementKind[];
+    }
+    interface Super extends Omit<Expression, "type"> {
+        type: "Super";
+    }
+    interface BindExpression extends Omit<Expression, "type"> {
+        type: "BindExpression";
+        object: K.ExpressionKind | null;
+        callee: K.ExpressionKind;
+    }
+    interface Decorator extends Omit<Node, "type"> {
+        type: "Decorator";
+        expression: K.ExpressionKind;
+    }
+    interface MetaProperty extends Omit<Expression, "type"> {
+        type: "MetaProperty";
+        meta: K.IdentifierKind;
+        property: K.IdentifierKind;
+    }
+    interface ParenthesizedExpression extends Omit<Expression, "type"> {
+        type: "ParenthesizedExpression";
+        expression: K.ExpressionKind;
+    }
+    interface ExportDefaultDeclaration extends Omit<Declaration, "type"> {
+        type: "ExportDefaultDeclaration";
+        declaration: K.DeclarationKind | K.ExpressionKind;
+    }
+    interface ExportNamedDeclaration extends Omit<Declaration, "type"> {
+        type: "ExportNamedDeclaration";
+        declaration: K.DeclarationKind | null;
+        specifiers?: K.ExportSpecifierKind[];
+        source?: K.LiteralKind | null;
+    }
+    interface ExportNamespaceSpecifier extends Omit<Specifier, "type"> {
+        type: "ExportNamespaceSpecifier";
+        exported: K.IdentifierKind;
+    }
+    interface ExportDefaultSpecifier extends Omit<Specifier, "type"> {
+        type: "ExportDefaultSpecifier";
+        exported: K.IdentifierKind;
+    }
+    interface ExportAllDeclaration extends Omit<Declaration, "type"> {
+        type: "ExportAllDeclaration";
+        exported: K.IdentifierKind | null;
+        source: K.LiteralKind;
+    }
+    interface CommentBlock extends Comment {
+        type: "CommentBlock";
+    }
+    interface CommentLine extends Comment {
+        type: "CommentLine";
+    }
+    interface Directive extends Omit<Node, "type"> {
+        type: "Directive";
+        value: K.DirectiveLiteralKind;
+    }
+    interface DirectiveLiteral extends Omit<Node, "type">, Omit<Expression, "type"> {
+        type: "DirectiveLiteral";
+        value?: string;
+    }
+    interface InterpreterDirective extends Omit<Node, "type"> {
+        type: "InterpreterDirective";
+        value: string;
+    }
+    interface StringLiteral extends Omit<Literal, "type" | "value"> {
+        type: "StringLiteral";
+        value: string;
+    }
+    interface NumericLiteral extends Omit<Literal, "type" | "value"> {
+        type: "NumericLiteral";
+        value: number;
+        raw?: string | null;
+        extra?: {
+            rawValue: number;
+            raw: string;
+        };
+    }
+    interface BigIntLiteral extends Omit<Literal, "type" | "value"> {
+        type: "BigIntLiteral";
+        value: string | number;
+        extra?: {
+            rawValue: string;
+            raw: string;
+        };
+    }
+    interface NullLiteral extends Omit<Literal, "type" | "value"> {
+        type: "NullLiteral";
+        value?: null;
+    }
+    interface BooleanLiteral extends Omit<Literal, "type" | "value"> {
+        type: "BooleanLiteral";
+        value: boolean;
+    }
+    interface RegExpLiteral extends Omit<Literal, "type" | "value"> {
+        type: "RegExpLiteral";
+        pattern: string;
+        flags: string;
+        value?: RegExp;
+    }
+    interface ObjectMethod extends Omit<Node, "type">, Omit<Function, "type" | "params" | "body" | "generator" | "async"> {
+        type: "ObjectMethod";
+        kind: "method" | "get" | "set";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        params: K.PatternKind[];
+        body: K.BlockStatementKind;
+        computed?: boolean;
+        generator?: boolean;
+        async?: boolean;
+        accessibility?: K.LiteralKind | null;
+        decorators?: K.DecoratorKind[] | null;
+    }
+    interface ClassPrivateProperty extends Omit<ClassProperty, "type" | "key" | "value"> {
+        type: "ClassPrivateProperty";
+        key: K.PrivateNameKind;
+        value?: K.ExpressionKind | null;
+    }
+    interface ClassMethod extends Omit<Declaration, "type">, Omit<Function, "type" | "body"> {
+        type: "ClassMethod";
+        key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        body: K.BlockStatementKind;
+        computed?: boolean;
+        static?: boolean | null;
+        abstract?: boolean | null;
+        access?: "public" | "private" | "protected" | null;
+        accessibility?: "public" | "private" | "protected" | null;
+        decorators?: K.DecoratorKind[] | null;
+        optional?: boolean | null;
+    }
+    interface ClassPrivateMethod extends Omit<Declaration, "type">, Omit<Function, "type" | "body"> {
+        type: "ClassPrivateMethod";
+        key: K.PrivateNameKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        body: K.BlockStatementKind;
+        computed?: boolean;
+        static?: boolean | null;
+        abstract?: boolean | null;
+        access?: "public" | "private" | "protected" | null;
+        accessibility?: "public" | "private" | "protected" | null;
+        decorators?: K.DecoratorKind[] | null;
+        optional?: boolean | null;
+    }
+    interface PrivateName extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+        type: "PrivateName";
+        id: K.IdentifierKind;
+    }
+    interface RestProperty extends Omit<Node, "type"> {
+        type: "RestProperty";
+        argument: K.ExpressionKind;
+    }
+    interface ForAwaitStatement extends Omit<Statement, "type"> {
+        type: "ForAwaitStatement";
+        left: K.VariableDeclarationKind | K.ExpressionKind;
+        right: K.ExpressionKind;
+        body: K.StatementKind;
+    }
+    interface Import extends Omit<Expression, "type"> {
+        type: "Import";
+    }
+    interface TSQualifiedName extends Omit<Node, "type"> {
+        type: "TSQualifiedName";
+        left: K.IdentifierKind | K.TSQualifiedNameKind;
+        right: K.IdentifierKind | K.TSQualifiedNameKind;
+    }
+    interface TSTypeReference extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+        type: "TSTypeReference";
+        typeName: K.IdentifierKind | K.TSQualifiedNameKind;
+    }
+    interface TSHasOptionalTypeParameters {
+        typeParameters?: K.TSTypeParameterDeclarationKind | null | undefined;
+    }
+    interface TSHasOptionalTypeAnnotation {
+        typeAnnotation?: K.TSTypeAnnotationKind | null;
+    }
+    interface TSAsExpression extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+        type: "TSAsExpression";
+        expression: K.ExpressionKind;
+        typeAnnotation: K.TSTypeKind;
+        extra?: {
+            parenthesized: boolean;
+        } | null;
+    }
+    interface TSNonNullExpression extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+        type: "TSNonNullExpression";
+        expression: K.ExpressionKind;
+    }
+    interface TSAnyKeyword extends Omit<TSType, "type"> {
+        type: "TSAnyKeyword";
+    }
+    interface TSBigIntKeyword extends Omit<TSType, "type"> {
+        type: "TSBigIntKeyword";
+    }
+    interface TSBooleanKeyword extends Omit<TSType, "type"> {
+        type: "TSBooleanKeyword";
+    }
+    interface TSNeverKeyword extends Omit<TSType, "type"> {
+        type: "TSNeverKeyword";
+    }
+    interface TSNullKeyword extends Omit<TSType, "type"> {
+        type: "TSNullKeyword";
+    }
+    interface TSNumberKeyword extends Omit<TSType, "type"> {
+        type: "TSNumberKeyword";
+    }
+    interface TSObjectKeyword extends Omit<TSType, "type"> {
+        type: "TSObjectKeyword";
+    }
+    interface TSStringKeyword extends Omit<TSType, "type"> {
+        type: "TSStringKeyword";
+    }
+    interface TSSymbolKeyword extends Omit<TSType, "type"> {
+        type: "TSSymbolKeyword";
+    }
+    interface TSUndefinedKeyword extends Omit<TSType, "type"> {
+        type: "TSUndefinedKeyword";
+    }
+    interface TSUnknownKeyword extends Omit<TSType, "type"> {
+        type: "TSUnknownKeyword";
+    }
+    interface TSVoidKeyword extends Omit<TSType, "type"> {
+        type: "TSVoidKeyword";
+    }
+    interface TSThisType extends Omit<TSType, "type"> {
+        type: "TSThisType";
+    }
+    interface TSArrayType extends Omit<TSType, "type"> {
+        type: "TSArrayType";
+        elementType: K.TSTypeKind;
+    }
+    interface TSLiteralType extends Omit<TSType, "type"> {
+        type: "TSLiteralType";
+        literal: K.NumericLiteralKind | K.StringLiteralKind | K.BooleanLiteralKind | K.TemplateLiteralKind | K.UnaryExpressionKind;
+    }
+    interface TSUnionType extends Omit<TSType, "type"> {
+        type: "TSUnionType";
+        types: K.TSTypeKind[];
+    }
+    interface TSIntersectionType extends Omit<TSType, "type"> {
+        type: "TSIntersectionType";
+        types: K.TSTypeKind[];
+    }
+    interface TSConditionalType extends Omit<TSType, "type"> {
+        type: "TSConditionalType";
+        checkType: K.TSTypeKind;
+        extendsType: K.TSTypeKind;
+        trueType: K.TSTypeKind;
+        falseType: K.TSTypeKind;
+    }
+    interface TSInferType extends Omit<TSType, "type"> {
+        type: "TSInferType";
+        typeParameter: K.TSTypeParameterKind;
+    }
+    interface TSTypeParameter extends Omit<Identifier, "type" | "name"> {
+        type: "TSTypeParameter";
+        name: string;
+        constraint?: K.TSTypeKind | undefined;
+        default?: K.TSTypeKind | undefined;
+    }
+    interface TSParenthesizedType extends Omit<TSType, "type"> {
+        type: "TSParenthesizedType";
+        typeAnnotation: K.TSTypeKind;
+    }
+    interface TSFunctionType extends Omit<TSType, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+        type: "TSFunctionType";
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+    }
+    interface TSConstructorType extends Omit<TSType, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+        type: "TSConstructorType";
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+    }
+    interface TSDeclareFunction extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+        type: "TSDeclareFunction";
+        declare?: boolean;
+        async?: boolean;
+        generator?: boolean;
+        id?: K.IdentifierKind | null;
+        params: K.PatternKind[];
+        returnType?: K.TSTypeAnnotationKind | K.NoopKind | null;
+    }
+    interface TSDeclareMethod extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+        type: "TSDeclareMethod";
+        async?: boolean;
+        generator?: boolean;
+        params: K.PatternKind[];
+        abstract?: boolean;
+        accessibility?: "public" | "private" | "protected" | undefined;
+        static?: boolean;
+        computed?: boolean;
+        optional?: boolean;
+        key: K.IdentifierKind | K.StringLiteralKind | K.NumericLiteralKind | K.ExpressionKind;
+        kind?: "get" | "set" | "method" | "constructor";
+        access?: "public" | "private" | "protected" | undefined;
+        decorators?: K.DecoratorKind[] | null;
+        returnType?: K.TSTypeAnnotationKind | K.NoopKind | null;
+    }
+    interface TSMappedType extends Omit<TSType, "type"> {
+        type: "TSMappedType";
+        readonly?: boolean | "+" | "-";
+        typeParameter: K.TSTypeParameterKind;
+        optional?: boolean | "+" | "-";
+        typeAnnotation?: K.TSTypeKind | null;
+    }
+    interface TSTupleType extends Omit<TSType, "type"> {
+        type: "TSTupleType";
+        elementTypes: K.TSTypeKind[];
+    }
+    interface TSRestType extends Omit<TSType, "type"> {
+        type: "TSRestType";
+        typeAnnotation: K.TSTypeKind;
+    }
+    interface TSOptionalType extends Omit<TSType, "type"> {
+        type: "TSOptionalType";
+        typeAnnotation: K.TSTypeKind;
+    }
+    interface TSIndexedAccessType extends Omit<TSType, "type"> {
+        type: "TSIndexedAccessType";
+        objectType: K.TSTypeKind;
+        indexType: K.TSTypeKind;
+    }
+    interface TSTypeOperator extends Omit<TSType, "type"> {
+        type: "TSTypeOperator";
+        operator: string;
+        typeAnnotation: K.TSTypeKind;
+    }
+    interface TSIndexSignature extends Omit<Declaration, "type">, TSHasOptionalTypeAnnotation {
+        type: "TSIndexSignature";
+        parameters: K.IdentifierKind[];
+        readonly?: boolean;
+    }
+    interface TSPropertySignature extends Omit<Declaration, "type">, TSHasOptionalTypeAnnotation {
+        type: "TSPropertySignature";
+        key: K.ExpressionKind;
+        computed?: boolean;
+        readonly?: boolean;
+        optional?: boolean;
+        initializer?: K.ExpressionKind | null;
+    }
+    interface TSMethodSignature extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+        type: "TSMethodSignature";
+        key: K.ExpressionKind;
+        computed?: boolean;
+        optional?: boolean;
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+    }
+    interface TSTypePredicate extends Omit<TSTypeAnnotation, "type" | "typeAnnotation"> {
+        type: "TSTypePredicate";
+        parameterName: K.IdentifierKind | K.TSThisTypeKind;
+        typeAnnotation: K.TSTypeAnnotationKind;
+    }
+    interface TSCallSignatureDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+        type: "TSCallSignatureDeclaration";
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+    }
+    interface TSConstructSignatureDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+        type: "TSConstructSignatureDeclaration";
+        parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+    }
+    interface TSEnumMember extends Omit<Node, "type"> {
+        type: "TSEnumMember";
+        id: K.IdentifierKind | K.StringLiteralKind;
+        initializer?: K.ExpressionKind | null;
+    }
+    interface TSTypeQuery extends Omit<TSType, "type"> {
+        type: "TSTypeQuery";
+        exprName: K.IdentifierKind | K.TSQualifiedNameKind | K.TSImportTypeKind;
+    }
+    interface TSImportType extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+        type: "TSImportType";
+        argument: K.StringLiteralKind;
+        qualifier?: K.IdentifierKind | K.TSQualifiedNameKind | undefined;
+    }
+    interface TSTypeLiteral extends Omit<TSType, "type"> {
+        type: "TSTypeLiteral";
+        members: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+    }
+    interface TSTypeAssertion extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+        type: "TSTypeAssertion";
+        typeAnnotation: K.TSTypeKind;
+        expression: K.ExpressionKind;
+        extra?: {
+            parenthesized: boolean;
+        } | null;
+    }
+    interface TSEnumDeclaration extends Omit<Declaration, "type"> {
+        type: "TSEnumDeclaration";
+        id: K.IdentifierKind;
+        const?: boolean;
+        declare?: boolean;
+        members: K.TSEnumMemberKind[];
+        initializer?: K.ExpressionKind | null;
+    }
+    interface TSTypeAliasDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+        type: "TSTypeAliasDeclaration";
+        id: K.IdentifierKind;
+        declare?: boolean;
+        typeAnnotation: K.TSTypeKind;
+    }
+    interface TSModuleBlock extends Omit<Node, "type"> {
+        type: "TSModuleBlock";
+        body: K.StatementKind[];
+    }
+    interface TSModuleDeclaration extends Omit<Declaration, "type"> {
+        type: "TSModuleDeclaration";
+        id: K.StringLiteralKind | K.IdentifierKind | K.TSQualifiedNameKind;
+        declare?: boolean;
+        global?: boolean;
+        body?: K.TSModuleBlockKind | K.TSModuleDeclarationKind | null;
+    }
+    interface TSImportEqualsDeclaration extends Omit<Declaration, "type"> {
+        type: "TSImportEqualsDeclaration";
+        id: K.IdentifierKind;
+        isExport?: boolean;
+        moduleReference: K.IdentifierKind | K.TSQualifiedNameKind | K.TSExternalModuleReferenceKind;
+    }
+    interface TSExternalModuleReference extends Omit<Declaration, "type"> {
+        type: "TSExternalModuleReference";
+        expression: K.StringLiteralKind;
+    }
+    interface TSExportAssignment extends Omit<Statement, "type"> {
+        type: "TSExportAssignment";
+        expression: K.ExpressionKind;
+    }
+    interface TSNamespaceExportDeclaration extends Omit<Declaration, "type"> {
+        type: "TSNamespaceExportDeclaration";
+        id: K.IdentifierKind;
+    }
+    interface TSInterfaceBody extends Omit<Node, "type"> {
+        type: "TSInterfaceBody";
+        body: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+    }
+    interface TSInterfaceDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+        type: "TSInterfaceDeclaration";
+        id: K.IdentifierKind | K.TSQualifiedNameKind;
+        declare?: boolean;
+        extends?: K.TSExpressionWithTypeArgumentsKind[] | null;
+        body: K.TSInterfaceBodyKind;
+    }
+    interface TSParameterProperty extends Omit<Pattern, "type"> {
+        type: "TSParameterProperty";
+        accessibility?: "public" | "private" | "protected" | undefined;
+        readonly?: boolean;
+        parameter: K.IdentifierKind | K.AssignmentPatternKind;
+    }
+    interface OptionalMemberExpression extends Omit<MemberExpression, "type"> {
+        type: "OptionalMemberExpression";
+        optional?: boolean;
+    }
+    interface OptionalCallExpression extends Omit<CallExpression, "type"> {
+        type: "OptionalCallExpression";
+        optional?: boolean;
+    }
+    type ASTNode = File | Program | Identifier | BlockStatement | EmptyStatement | ExpressionStatement | IfStatement | LabeledStatement | BreakStatement | ContinueStatement | WithStatement | SwitchStatement | SwitchCase | ReturnStatement | ThrowStatement | TryStatement | CatchClause | WhileStatement | DoWhileStatement | ForStatement | VariableDeclaration | ForInStatement | DebuggerStatement | FunctionDeclaration | FunctionExpression | VariableDeclarator | ThisExpression | ArrayExpression | ObjectExpression | Property | Literal | SequenceExpression | UnaryExpression | BinaryExpression | AssignmentExpression | MemberExpression | UpdateExpression | LogicalExpression | ConditionalExpression | NewExpression | CallExpression | RestElement | TypeAnnotation | TSTypeAnnotation | SpreadElementPattern | ArrowFunctionExpression | ForOfStatement | YieldExpression | GeneratorExpression | ComprehensionBlock | ComprehensionExpression | ObjectProperty | PropertyPattern | ObjectPattern | ArrayPattern | MethodDefinition | SpreadElement | AssignmentPattern | ClassPropertyDefinition | ClassProperty | ClassBody | ClassDeclaration | ClassExpression | ImportSpecifier | ImportNamespaceSpecifier | ImportDefaultSpecifier | ImportDeclaration | TaggedTemplateExpression | TemplateLiteral | TemplateElement | SpreadProperty | SpreadPropertyPattern | AwaitExpression | JSXAttribute | JSXIdentifier | JSXNamespacedName | JSXExpressionContainer | JSXMemberExpression | JSXSpreadAttribute | JSXElement | JSXOpeningElement | JSXClosingElement | JSXFragment | JSXText | JSXOpeningFragment | JSXClosingFragment | JSXEmptyExpression | JSXSpreadChild | TypeParameterDeclaration | TSTypeParameterDeclaration | TypeParameterInstantiation | TSTypeParameterInstantiation | ClassImplements | TSExpressionWithTypeArguments | AnyTypeAnnotation | EmptyTypeAnnotation | MixedTypeAnnotation | VoidTypeAnnotation | NumberTypeAnnotation | NumberLiteralTypeAnnotation | NumericLiteralTypeAnnotation | StringTypeAnnotation | StringLiteralTypeAnnotation | BooleanTypeAnnotation | BooleanLiteralTypeAnnotation | NullableTypeAnnotation | NullLiteralTypeAnnotation | NullTypeAnnotation | ThisTypeAnnotation | ExistsTypeAnnotation | ExistentialTypeParam | FunctionTypeAnnotation | FunctionTypeParam | ArrayTypeAnnotation | ObjectTypeAnnotation | ObjectTypeProperty | ObjectTypeSpreadProperty | ObjectTypeIndexer | ObjectTypeCallProperty | ObjectTypeInternalSlot | Variance | QualifiedTypeIdentifier | GenericTypeAnnotation | MemberTypeAnnotation | UnionTypeAnnotation | IntersectionTypeAnnotation | TypeofTypeAnnotation | TypeParameter | InterfaceTypeAnnotation | InterfaceExtends | InterfaceDeclaration | DeclareInterface | TypeAlias | OpaqueType | DeclareTypeAlias | DeclareOpaqueType | TypeCastExpression | TupleTypeAnnotation | DeclareVariable | DeclareFunction | DeclareClass | DeclareModule | DeclareModuleExports | DeclareExportDeclaration | ExportSpecifier | ExportBatchSpecifier | DeclareExportAllDeclaration | InferredPredicate | DeclaredPredicate | ExportDeclaration | Block | Line | Noop | DoExpression | Super | BindExpression | Decorator | MetaProperty | ParenthesizedExpression | ExportDefaultDeclaration | ExportNamedDeclaration | ExportNamespaceSpecifier | ExportDefaultSpecifier | ExportAllDeclaration | CommentBlock | CommentLine | Directive | DirectiveLiteral | InterpreterDirective | StringLiteral | NumericLiteral | BigIntLiteral | NullLiteral | BooleanLiteral | RegExpLiteral | ObjectMethod | ClassPrivateProperty | ClassMethod | ClassPrivateMethod | PrivateName | RestProperty | ForAwaitStatement | Import | TSQualifiedName | TSTypeReference | TSAsExpression | TSNonNullExpression | TSAnyKeyword | TSBigIntKeyword | TSBooleanKeyword | TSNeverKeyword | TSNullKeyword | TSNumberKeyword | TSObjectKeyword | TSStringKeyword | TSSymbolKeyword | TSUndefinedKeyword | TSUnknownKeyword | TSVoidKeyword | TSThisType | TSArrayType | TSLiteralType | TSUnionType | TSIntersectionType | TSConditionalType | TSInferType | TSTypeParameter | TSParenthesizedType | TSFunctionType | TSConstructorType | TSDeclareFunction | TSDeclareMethod | TSMappedType | TSTupleType | TSRestType | TSOptionalType | TSIndexedAccessType | TSTypeOperator | TSIndexSignature | TSPropertySignature | TSMethodSignature | TSTypePredicate | TSCallSignatureDeclaration | TSConstructSignatureDeclaration | TSEnumMember | TSTypeQuery | TSImportType | TSTypeLiteral | TSTypeAssertion | TSEnumDeclaration | TSTypeAliasDeclaration | TSModuleBlock | TSModuleDeclaration | TSImportEqualsDeclaration | TSExternalModuleReference | TSExportAssignment | TSNamespaceExportDeclaration | TSInterfaceBody | TSInterfaceDeclaration | TSParameterProperty | OptionalMemberExpression | OptionalCallExpression;
+    let Printable: Type<Printable>;
+    let SourceLocation: Type<SourceLocation>;
+    let Node: Type<Node>;
+    let Comment: Type<Comment>;
+    let Position: Type<Position>;
+    let File: Type<File>;
+    let Program: Type<Program>;
+    let Statement: Type<Statement>;
+    let Function: Type<Function>;
+    let Expression: Type<Expression>;
+    let Pattern: Type<Pattern>;
+    let Identifier: Type<Identifier>;
+    let BlockStatement: Type<BlockStatement>;
+    let EmptyStatement: Type<EmptyStatement>;
+    let ExpressionStatement: Type<ExpressionStatement>;
+    let IfStatement: Type<IfStatement>;
+    let LabeledStatement: Type<LabeledStatement>;
+    let BreakStatement: Type<BreakStatement>;
+    let ContinueStatement: Type<ContinueStatement>;
+    let WithStatement: Type<WithStatement>;
+    let SwitchStatement: Type<SwitchStatement>;
+    let SwitchCase: Type<SwitchCase>;
+    let ReturnStatement: Type<ReturnStatement>;
+    let ThrowStatement: Type<ThrowStatement>;
+    let TryStatement: Type<TryStatement>;
+    let CatchClause: Type<CatchClause>;
+    let WhileStatement: Type<WhileStatement>;
+    let DoWhileStatement: Type<DoWhileStatement>;
+    let ForStatement: Type<ForStatement>;
+    let Declaration: Type<Declaration>;
+    let VariableDeclaration: Type<VariableDeclaration>;
+    let ForInStatement: Type<ForInStatement>;
+    let DebuggerStatement: Type<DebuggerStatement>;
+    let FunctionDeclaration: Type<FunctionDeclaration>;
+    let FunctionExpression: Type<FunctionExpression>;
+    let VariableDeclarator: Type<VariableDeclarator>;
+    let ThisExpression: Type<ThisExpression>;
+    let ArrayExpression: Type<ArrayExpression>;
+    let ObjectExpression: Type<ObjectExpression>;
+    let Property: Type<Property>;
+    let Literal: Type<Literal>;
+    let SequenceExpression: Type<SequenceExpression>;
+    let UnaryExpression: Type<UnaryExpression>;
+    let BinaryExpression: Type<BinaryExpression>;
+    let AssignmentExpression: Type<AssignmentExpression>;
+    let MemberExpression: Type<MemberExpression>;
+    let UpdateExpression: Type<UpdateExpression>;
+    let LogicalExpression: Type<LogicalExpression>;
+    let ConditionalExpression: Type<ConditionalExpression>;
+    let NewExpression: Type<NewExpression>;
+    let CallExpression: Type<CallExpression>;
+    let RestElement: Type<RestElement>;
+    let TypeAnnotation: Type<TypeAnnotation>;
+    let TSTypeAnnotation: Type<TSTypeAnnotation>;
+    let SpreadElementPattern: Type<SpreadElementPattern>;
+    let ArrowFunctionExpression: Type<ArrowFunctionExpression>;
+    let ForOfStatement: Type<ForOfStatement>;
+    let YieldExpression: Type<YieldExpression>;
+    let GeneratorExpression: Type<GeneratorExpression>;
+    let ComprehensionBlock: Type<ComprehensionBlock>;
+    let ComprehensionExpression: Type<ComprehensionExpression>;
+    let ObjectProperty: Type<ObjectProperty>;
+    let PropertyPattern: Type<PropertyPattern>;
+    let ObjectPattern: Type<ObjectPattern>;
+    let ArrayPattern: Type<ArrayPattern>;
+    let MethodDefinition: Type<MethodDefinition>;
+    let SpreadElement: Type<SpreadElement>;
+    let AssignmentPattern: Type<AssignmentPattern>;
+    let ClassPropertyDefinition: Type<ClassPropertyDefinition>;
+    let ClassProperty: Type<ClassProperty>;
+    let ClassBody: Type<ClassBody>;
+    let ClassDeclaration: Type<ClassDeclaration>;
+    let ClassExpression: Type<ClassExpression>;
+    let Specifier: Type<Specifier>;
+    let ModuleSpecifier: Type<ModuleSpecifier>;
+    let ImportSpecifier: Type<ImportSpecifier>;
+    let ImportNamespaceSpecifier: Type<ImportNamespaceSpecifier>;
+    let ImportDefaultSpecifier: Type<ImportDefaultSpecifier>;
+    let ImportDeclaration: Type<ImportDeclaration>;
+    let TaggedTemplateExpression: Type<TaggedTemplateExpression>;
+    let TemplateLiteral: Type<TemplateLiteral>;
+    let TemplateElement: Type<TemplateElement>;
+    let SpreadProperty: Type<SpreadProperty>;
+    let SpreadPropertyPattern: Type<SpreadPropertyPattern>;
+    let AwaitExpression: Type<AwaitExpression>;
+    let JSXAttribute: Type<JSXAttribute>;
+    let JSXIdentifier: Type<JSXIdentifier>;
+    let JSXNamespacedName: Type<JSXNamespacedName>;
+    let JSXExpressionContainer: Type<JSXExpressionContainer>;
+    let JSXMemberExpression: Type<JSXMemberExpression>;
+    let JSXSpreadAttribute: Type<JSXSpreadAttribute>;
+    let JSXElement: Type<JSXElement>;
+    let JSXOpeningElement: Type<JSXOpeningElement>;
+    let JSXClosingElement: Type<JSXClosingElement>;
+    let JSXFragment: Type<JSXFragment>;
+    let JSXText: Type<JSXText>;
+    let JSXOpeningFragment: Type<JSXOpeningFragment>;
+    let JSXClosingFragment: Type<JSXClosingFragment>;
+    let JSXEmptyExpression: Type<JSXEmptyExpression>;
+    let JSXSpreadChild: Type<JSXSpreadChild>;
+    let TypeParameterDeclaration: Type<TypeParameterDeclaration>;
+    let TSTypeParameterDeclaration: Type<TSTypeParameterDeclaration>;
+    let TypeParameterInstantiation: Type<TypeParameterInstantiation>;
+    let TSTypeParameterInstantiation: Type<TSTypeParameterInstantiation>;
+    let ClassImplements: Type<ClassImplements>;
+    let TSType: Type<TSType>;
+    let TSHasOptionalTypeParameterInstantiation: Type<TSHasOptionalTypeParameterInstantiation>;
+    let TSExpressionWithTypeArguments: Type<TSExpressionWithTypeArguments>;
+    let Flow: Type<Flow>;
+    let FlowType: Type<FlowType>;
+    let AnyTypeAnnotation: Type<AnyTypeAnnotation>;
+    let EmptyTypeAnnotation: Type<EmptyTypeAnnotation>;
+    let MixedTypeAnnotation: Type<MixedTypeAnnotation>;
+    let VoidTypeAnnotation: Type<VoidTypeAnnotation>;
+    let NumberTypeAnnotation: Type<NumberTypeAnnotation>;
+    let NumberLiteralTypeAnnotation: Type<NumberLiteralTypeAnnotation>;
+    let NumericLiteralTypeAnnotation: Type<NumericLiteralTypeAnnotation>;
+    let StringTypeAnnotation: Type<StringTypeAnnotation>;
+    let StringLiteralTypeAnnotation: Type<StringLiteralTypeAnnotation>;
+    let BooleanTypeAnnotation: Type<BooleanTypeAnnotation>;
+    let BooleanLiteralTypeAnnotation: Type<BooleanLiteralTypeAnnotation>;
+    let NullableTypeAnnotation: Type<NullableTypeAnnotation>;
+    let NullLiteralTypeAnnotation: Type<NullLiteralTypeAnnotation>;
+    let NullTypeAnnotation: Type<NullTypeAnnotation>;
+    let ThisTypeAnnotation: Type<ThisTypeAnnotation>;
+    let ExistsTypeAnnotation: Type<ExistsTypeAnnotation>;
+    let ExistentialTypeParam: Type<ExistentialTypeParam>;
+    let FunctionTypeAnnotation: Type<FunctionTypeAnnotation>;
+    let FunctionTypeParam: Type<FunctionTypeParam>;
+    let ArrayTypeAnnotation: Type<ArrayTypeAnnotation>;
+    let ObjectTypeAnnotation: Type<ObjectTypeAnnotation>;
+    let ObjectTypeProperty: Type<ObjectTypeProperty>;
+    let ObjectTypeSpreadProperty: Type<ObjectTypeSpreadProperty>;
+    let ObjectTypeIndexer: Type<ObjectTypeIndexer>;
+    let ObjectTypeCallProperty: Type<ObjectTypeCallProperty>;
+    let ObjectTypeInternalSlot: Type<ObjectTypeInternalSlot>;
+    let Variance: Type<Variance>;
+    let QualifiedTypeIdentifier: Type<QualifiedTypeIdentifier>;
+    let GenericTypeAnnotation: Type<GenericTypeAnnotation>;
+    let MemberTypeAnnotation: Type<MemberTypeAnnotation>;
+    let UnionTypeAnnotation: Type<UnionTypeAnnotation>;
+    let IntersectionTypeAnnotation: Type<IntersectionTypeAnnotation>;
+    let TypeofTypeAnnotation: Type<TypeofTypeAnnotation>;
+    let TypeParameter: Type<TypeParameter>;
+    let InterfaceTypeAnnotation: Type<InterfaceTypeAnnotation>;
+    let InterfaceExtends: Type<InterfaceExtends>;
+    let InterfaceDeclaration: Type<InterfaceDeclaration>;
+    let DeclareInterface: Type<DeclareInterface>;
+    let TypeAlias: Type<TypeAlias>;
+    let OpaqueType: Type<OpaqueType>;
+    let DeclareTypeAlias: Type<DeclareTypeAlias>;
+    let DeclareOpaqueType: Type<DeclareOpaqueType>;
+    let TypeCastExpression: Type<TypeCastExpression>;
+    let TupleTypeAnnotation: Type<TupleTypeAnnotation>;
+    let DeclareVariable: Type<DeclareVariable>;
+    let DeclareFunction: Type<DeclareFunction>;
+    let DeclareClass: Type<DeclareClass>;
+    let DeclareModule: Type<DeclareModule>;
+    let DeclareModuleExports: Type<DeclareModuleExports>;
+    let DeclareExportDeclaration: Type<DeclareExportDeclaration>;
+    let ExportSpecifier: Type<ExportSpecifier>;
+    let ExportBatchSpecifier: Type<ExportBatchSpecifier>;
+    let DeclareExportAllDeclaration: Type<DeclareExportAllDeclaration>;
+    let FlowPredicate: Type<FlowPredicate>;
+    let InferredPredicate: Type<InferredPredicate>;
+    let DeclaredPredicate: Type<DeclaredPredicate>;
+    let ExportDeclaration: Type<ExportDeclaration>;
+    let Block: Type<Block>;
+    let Line: Type<Line>;
+    let Noop: Type<Noop>;
+    let DoExpression: Type<DoExpression>;
+    let Super: Type<Super>;
+    let BindExpression: Type<BindExpression>;
+    let Decorator: Type<Decorator>;
+    let MetaProperty: Type<MetaProperty>;
+    let ParenthesizedExpression: Type<ParenthesizedExpression>;
+    let ExportDefaultDeclaration: Type<ExportDefaultDeclaration>;
+    let ExportNamedDeclaration: Type<ExportNamedDeclaration>;
+    let ExportNamespaceSpecifier: Type<ExportNamespaceSpecifier>;
+    let ExportDefaultSpecifier: Type<ExportDefaultSpecifier>;
+    let ExportAllDeclaration: Type<ExportAllDeclaration>;
+    let CommentBlock: Type<CommentBlock>;
+    let CommentLine: Type<CommentLine>;
+    let Directive: Type<Directive>;
+    let DirectiveLiteral: Type<DirectiveLiteral>;
+    let InterpreterDirective: Type<InterpreterDirective>;
+    let StringLiteral: Type<StringLiteral>;
+    let NumericLiteral: Type<NumericLiteral>;
+    let BigIntLiteral: Type<BigIntLiteral>;
+    let NullLiteral: Type<NullLiteral>;
+    let BooleanLiteral: Type<BooleanLiteral>;
+    let RegExpLiteral: Type<RegExpLiteral>;
+    let ObjectMethod: Type<ObjectMethod>;
+    let ClassPrivateProperty: Type<ClassPrivateProperty>;
+    let ClassMethod: Type<ClassMethod>;
+    let ClassPrivateMethod: Type<ClassPrivateMethod>;
+    let PrivateName: Type<PrivateName>;
+    let RestProperty: Type<RestProperty>;
+    let ForAwaitStatement: Type<ForAwaitStatement>;
+    let Import: Type<Import>;
+    let TSQualifiedName: Type<TSQualifiedName>;
+    let TSTypeReference: Type<TSTypeReference>;
+    let TSHasOptionalTypeParameters: Type<TSHasOptionalTypeParameters>;
+    let TSHasOptionalTypeAnnotation: Type<TSHasOptionalTypeAnnotation>;
+    let TSAsExpression: Type<TSAsExpression>;
+    let TSNonNullExpression: Type<TSNonNullExpression>;
+    let TSAnyKeyword: Type<TSAnyKeyword>;
+    let TSBigIntKeyword: Type<TSBigIntKeyword>;
+    let TSBooleanKeyword: Type<TSBooleanKeyword>;
+    let TSNeverKeyword: Type<TSNeverKeyword>;
+    let TSNullKeyword: Type<TSNullKeyword>;
+    let TSNumberKeyword: Type<TSNumberKeyword>;
+    let TSObjectKeyword: Type<TSObjectKeyword>;
+    let TSStringKeyword: Type<TSStringKeyword>;
+    let TSSymbolKeyword: Type<TSSymbolKeyword>;
+    let TSUndefinedKeyword: Type<TSUndefinedKeyword>;
+    let TSUnknownKeyword: Type<TSUnknownKeyword>;
+    let TSVoidKeyword: Type<TSVoidKeyword>;
+    let TSThisType: Type<TSThisType>;
+    let TSArrayType: Type<TSArrayType>;
+    let TSLiteralType: Type<TSLiteralType>;
+    let TSUnionType: Type<TSUnionType>;
+    let TSIntersectionType: Type<TSIntersectionType>;
+    let TSConditionalType: Type<TSConditionalType>;
+    let TSInferType: Type<TSInferType>;
+    let TSTypeParameter: Type<TSTypeParameter>;
+    let TSParenthesizedType: Type<TSParenthesizedType>;
+    let TSFunctionType: Type<TSFunctionType>;
+    let TSConstructorType: Type<TSConstructorType>;
+    let TSDeclareFunction: Type<TSDeclareFunction>;
+    let TSDeclareMethod: Type<TSDeclareMethod>;
+    let TSMappedType: Type<TSMappedType>;
+    let TSTupleType: Type<TSTupleType>;
+    let TSRestType: Type<TSRestType>;
+    let TSOptionalType: Type<TSOptionalType>;
+    let TSIndexedAccessType: Type<TSIndexedAccessType>;
+    let TSTypeOperator: Type<TSTypeOperator>;
+    let TSIndexSignature: Type<TSIndexSignature>;
+    let TSPropertySignature: Type<TSPropertySignature>;
+    let TSMethodSignature: Type<TSMethodSignature>;
+    let TSTypePredicate: Type<TSTypePredicate>;
+    let TSCallSignatureDeclaration: Type<TSCallSignatureDeclaration>;
+    let TSConstructSignatureDeclaration: Type<TSConstructSignatureDeclaration>;
+    let TSEnumMember: Type<TSEnumMember>;
+    let TSTypeQuery: Type<TSTypeQuery>;
+    let TSImportType: Type<TSImportType>;
+    let TSTypeLiteral: Type<TSTypeLiteral>;
+    let TSTypeAssertion: Type<TSTypeAssertion>;
+    let TSEnumDeclaration: Type<TSEnumDeclaration>;
+    let TSTypeAliasDeclaration: Type<TSTypeAliasDeclaration>;
+    let TSModuleBlock: Type<TSModuleBlock>;
+    let TSModuleDeclaration: Type<TSModuleDeclaration>;
+    let TSImportEqualsDeclaration: Type<TSImportEqualsDeclaration>;
+    let TSExternalModuleReference: Type<TSExternalModuleReference>;
+    let TSExportAssignment: Type<TSExportAssignment>;
+    let TSNamespaceExportDeclaration: Type<TSNamespaceExportDeclaration>;
+    let TSInterfaceBody: Type<TSInterfaceBody>;
+    let TSInterfaceDeclaration: Type<TSInterfaceDeclaration>;
+    let TSParameterProperty: Type<TSParameterProperty>;
+    let OptionalMemberExpression: Type<OptionalMemberExpression>;
+    let OptionalCallExpression: Type<OptionalCallExpression>;
+}
+export interface NamedTypes {
+    Printable: Type<namedTypes.Printable>;
+    SourceLocation: Type<namedTypes.SourceLocation>;
+    Node: Type<namedTypes.Node>;
+    Comment: Type<namedTypes.Comment>;
+    Position: Type<namedTypes.Position>;
+    File: Type<namedTypes.File>;
+    Program: Type<namedTypes.Program>;
+    Statement: Type<namedTypes.Statement>;
+    Function: Type<namedTypes.Function>;
+    Expression: Type<namedTypes.Expression>;
+    Pattern: Type<namedTypes.Pattern>;
+    Identifier: Type<namedTypes.Identifier>;
+    BlockStatement: Type<namedTypes.BlockStatement>;
+    EmptyStatement: Type<namedTypes.EmptyStatement>;
+    ExpressionStatement: Type<namedTypes.ExpressionStatement>;
+    IfStatement: Type<namedTypes.IfStatement>;
+    LabeledStatement: Type<namedTypes.LabeledStatement>;
+    BreakStatement: Type<namedTypes.BreakStatement>;
+    ContinueStatement: Type<namedTypes.ContinueStatement>;
+    WithStatement: Type<namedTypes.WithStatement>;
+    SwitchStatement: Type<namedTypes.SwitchStatement>;
+    SwitchCase: Type<namedTypes.SwitchCase>;
+    ReturnStatement: Type<namedTypes.ReturnStatement>;
+    ThrowStatement: Type<namedTypes.ThrowStatement>;
+    TryStatement: Type<namedTypes.TryStatement>;
+    CatchClause: Type<namedTypes.CatchClause>;
+    WhileStatement: Type<namedTypes.WhileStatement>;
+    DoWhileStatement: Type<namedTypes.DoWhileStatement>;
+    ForStatement: Type<namedTypes.ForStatement>;
+    Declaration: Type<namedTypes.Declaration>;
+    VariableDeclaration: Type<namedTypes.VariableDeclaration>;
+    ForInStatement: Type<namedTypes.ForInStatement>;
+    DebuggerStatement: Type<namedTypes.DebuggerStatement>;
+    FunctionDeclaration: Type<namedTypes.FunctionDeclaration>;
+    FunctionExpression: Type<namedTypes.FunctionExpression>;
+    VariableDeclarator: Type<namedTypes.VariableDeclarator>;
+    ThisExpression: Type<namedTypes.ThisExpression>;
+    ArrayExpression: Type<namedTypes.ArrayExpression>;
+    ObjectExpression: Type<namedTypes.ObjectExpression>;
+    Property: Type<namedTypes.Property>;
+    Literal: Type<namedTypes.Literal>;
+    SequenceExpression: Type<namedTypes.SequenceExpression>;
+    UnaryExpression: Type<namedTypes.UnaryExpression>;
+    BinaryExpression: Type<namedTypes.BinaryExpression>;
+    AssignmentExpression: Type<namedTypes.AssignmentExpression>;
+    MemberExpression: Type<namedTypes.MemberExpression>;
+    UpdateExpression: Type<namedTypes.UpdateExpression>;
+    LogicalExpression: Type<namedTypes.LogicalExpression>;
+    ConditionalExpression: Type<namedTypes.ConditionalExpression>;
+    NewExpression: Type<namedTypes.NewExpression>;
+    CallExpression: Type<namedTypes.CallExpression>;
+    RestElement: Type<namedTypes.RestElement>;
+    TypeAnnotation: Type<namedTypes.TypeAnnotation>;
+    TSTypeAnnotation: Type<namedTypes.TSTypeAnnotation>;
+    SpreadElementPattern: Type<namedTypes.SpreadElementPattern>;
+    ArrowFunctionExpression: Type<namedTypes.ArrowFunctionExpression>;
+    ForOfStatement: Type<namedTypes.ForOfStatement>;
+    YieldExpression: Type<namedTypes.YieldExpression>;
+    GeneratorExpression: Type<namedTypes.GeneratorExpression>;
+    ComprehensionBlock: Type<namedTypes.ComprehensionBlock>;
+    ComprehensionExpression: Type<namedTypes.ComprehensionExpression>;
+    ObjectProperty: Type<namedTypes.ObjectProperty>;
+    PropertyPattern: Type<namedTypes.PropertyPattern>;
+    ObjectPattern: Type<namedTypes.ObjectPattern>;
+    ArrayPattern: Type<namedTypes.ArrayPattern>;
+    MethodDefinition: Type<namedTypes.MethodDefinition>;
+    SpreadElement: Type<namedTypes.SpreadElement>;
+    AssignmentPattern: Type<namedTypes.AssignmentPattern>;
+    ClassPropertyDefinition: Type<namedTypes.ClassPropertyDefinition>;
+    ClassProperty: Type<namedTypes.ClassProperty>;
+    ClassBody: Type<namedTypes.ClassBody>;
+    ClassDeclaration: Type<namedTypes.ClassDeclaration>;
+    ClassExpression: Type<namedTypes.ClassExpression>;
+    Specifier: Type<namedTypes.Specifier>;
+    ModuleSpecifier: Type<namedTypes.ModuleSpecifier>;
+    ImportSpecifier: Type<namedTypes.ImportSpecifier>;
+    ImportNamespaceSpecifier: Type<namedTypes.ImportNamespaceSpecifier>;
+    ImportDefaultSpecifier: Type<namedTypes.ImportDefaultSpecifier>;
+    ImportDeclaration: Type<namedTypes.ImportDeclaration>;
+    TaggedTemplateExpression: Type<namedTypes.TaggedTemplateExpression>;
+    TemplateLiteral: Type<namedTypes.TemplateLiteral>;
+    TemplateElement: Type<namedTypes.TemplateElement>;
+    SpreadProperty: Type<namedTypes.SpreadProperty>;
+    SpreadPropertyPattern: Type<namedTypes.SpreadPropertyPattern>;
+    AwaitExpression: Type<namedTypes.AwaitExpression>;
+    JSXAttribute: Type<namedTypes.JSXAttribute>;
+    JSXIdentifier: Type<namedTypes.JSXIdentifier>;
+    JSXNamespacedName: Type<namedTypes.JSXNamespacedName>;
+    JSXExpressionContainer: Type<namedTypes.JSXExpressionContainer>;
+    JSXMemberExpression: Type<namedTypes.JSXMemberExpression>;
+    JSXSpreadAttribute: Type<namedTypes.JSXSpreadAttribute>;
+    JSXElement: Type<namedTypes.JSXElement>;
+    JSXOpeningElement: Type<namedTypes.JSXOpeningElement>;
+    JSXClosingElement: Type<namedTypes.JSXClosingElement>;
+    JSXFragment: Type<namedTypes.JSXFragment>;
+    JSXText: Type<namedTypes.JSXText>;
+    JSXOpeningFragment: Type<namedTypes.JSXOpeningFragment>;
+    JSXClosingFragment: Type<namedTypes.JSXClosingFragment>;
+    JSXEmptyExpression: Type<namedTypes.JSXEmptyExpression>;
+    JSXSpreadChild: Type<namedTypes.JSXSpreadChild>;
+    TypeParameterDeclaration: Type<namedTypes.TypeParameterDeclaration>;
+    TSTypeParameterDeclaration: Type<namedTypes.TSTypeParameterDeclaration>;
+    TypeParameterInstantiation: Type<namedTypes.TypeParameterInstantiation>;
+    TSTypeParameterInstantiation: Type<namedTypes.TSTypeParameterInstantiation>;
+    ClassImplements: Type<namedTypes.ClassImplements>;
+    TSType: Type<namedTypes.TSType>;
+    TSHasOptionalTypeParameterInstantiation: Type<namedTypes.TSHasOptionalTypeParameterInstantiation>;
+    TSExpressionWithTypeArguments: Type<namedTypes.TSExpressionWithTypeArguments>;
+    Flow: Type<namedTypes.Flow>;
+    FlowType: Type<namedTypes.FlowType>;
+    AnyTypeAnnotation: Type<namedTypes.AnyTypeAnnotation>;
+    EmptyTypeAnnotation: Type<namedTypes.EmptyTypeAnnotation>;
+    MixedTypeAnnotation: Type<namedTypes.MixedTypeAnnotation>;
+    VoidTypeAnnotation: Type<namedTypes.VoidTypeAnnotation>;
+    NumberTypeAnnotation: Type<namedTypes.NumberTypeAnnotation>;
+    NumberLiteralTypeAnnotation: Type<namedTypes.NumberLiteralTypeAnnotation>;
+    NumericLiteralTypeAnnotation: Type<namedTypes.NumericLiteralTypeAnnotation>;
+    StringTypeAnnotation: Type<namedTypes.StringTypeAnnotation>;
+    StringLiteralTypeAnnotation: Type<namedTypes.StringLiteralTypeAnnotation>;
+    BooleanTypeAnnotation: Type<namedTypes.BooleanTypeAnnotation>;
+    BooleanLiteralTypeAnnotation: Type<namedTypes.BooleanLiteralTypeAnnotation>;
+    NullableTypeAnnotation: Type<namedTypes.NullableTypeAnnotation>;
+    NullLiteralTypeAnnotation: Type<namedTypes.NullLiteralTypeAnnotation>;
+    NullTypeAnnotation: Type<namedTypes.NullTypeAnnotation>;
+    ThisTypeAnnotation: Type<namedTypes.ThisTypeAnnotation>;
+    ExistsTypeAnnotation: Type<namedTypes.ExistsTypeAnnotation>;
+    ExistentialTypeParam: Type<namedTypes.ExistentialTypeParam>;
+    FunctionTypeAnnotation: Type<namedTypes.FunctionTypeAnnotation>;
+    FunctionTypeParam: Type<namedTypes.FunctionTypeParam>;
+    ArrayTypeAnnotation: Type<namedTypes.ArrayTypeAnnotation>;
+    ObjectTypeAnnotation: Type<namedTypes.ObjectTypeAnnotation>;
+    ObjectTypeProperty: Type<namedTypes.ObjectTypeProperty>;
+    ObjectTypeSpreadProperty: Type<namedTypes.ObjectTypeSpreadProperty>;
+    ObjectTypeIndexer: Type<namedTypes.ObjectTypeIndexer>;
+    ObjectTypeCallProperty: Type<namedTypes.ObjectTypeCallProperty>;
+    ObjectTypeInternalSlot: Type<namedTypes.ObjectTypeInternalSlot>;
+    Variance: Type<namedTypes.Variance>;
+    QualifiedTypeIdentifier: Type<namedTypes.QualifiedTypeIdentifier>;
+    GenericTypeAnnotation: Type<namedTypes.GenericTypeAnnotation>;
+    MemberTypeAnnotation: Type<namedTypes.MemberTypeAnnotation>;
+    UnionTypeAnnotation: Type<namedTypes.UnionTypeAnnotation>;
+    IntersectionTypeAnnotation: Type<namedTypes.IntersectionTypeAnnotation>;
+    TypeofTypeAnnotation: Type<namedTypes.TypeofTypeAnnotation>;
+    TypeParameter: Type<namedTypes.TypeParameter>;
+    InterfaceTypeAnnotation: Type<namedTypes.InterfaceTypeAnnotation>;
+    InterfaceExtends: Type<namedTypes.InterfaceExtends>;
+    InterfaceDeclaration: Type<namedTypes.InterfaceDeclaration>;
+    DeclareInterface: Type<namedTypes.DeclareInterface>;
+    TypeAlias: Type<namedTypes.TypeAlias>;
+    OpaqueType: Type<namedTypes.OpaqueType>;
+    DeclareTypeAlias: Type<namedTypes.DeclareTypeAlias>;
+    DeclareOpaqueType: Type<namedTypes.DeclareOpaqueType>;
+    TypeCastExpression: Type<namedTypes.TypeCastExpression>;
+    TupleTypeAnnotation: Type<namedTypes.TupleTypeAnnotation>;
+    DeclareVariable: Type<namedTypes.DeclareVariable>;
+    DeclareFunction: Type<namedTypes.DeclareFunction>;
+    DeclareClass: Type<namedTypes.DeclareClass>;
+    DeclareModule: Type<namedTypes.DeclareModule>;
+    DeclareModuleExports: Type<namedTypes.DeclareModuleExports>;
+    DeclareExportDeclaration: Type<namedTypes.DeclareExportDeclaration>;
+    ExportSpecifier: Type<namedTypes.ExportSpecifier>;
+    ExportBatchSpecifier: Type<namedTypes.ExportBatchSpecifier>;
+    DeclareExportAllDeclaration: Type<namedTypes.DeclareExportAllDeclaration>;
+    FlowPredicate: Type<namedTypes.FlowPredicate>;
+    InferredPredicate: Type<namedTypes.InferredPredicate>;
+    DeclaredPredicate: Type<namedTypes.DeclaredPredicate>;
+    ExportDeclaration: Type<namedTypes.ExportDeclaration>;
+    Block: Type<namedTypes.Block>;
+    Line: Type<namedTypes.Line>;
+    Noop: Type<namedTypes.Noop>;
+    DoExpression: Type<namedTypes.DoExpression>;
+    Super: Type<namedTypes.Super>;
+    BindExpression: Type<namedTypes.BindExpression>;
+    Decorator: Type<namedTypes.Decorator>;
+    MetaProperty: Type<namedTypes.MetaProperty>;
+    ParenthesizedExpression: Type<namedTypes.ParenthesizedExpression>;
+    ExportDefaultDeclaration: Type<namedTypes.ExportDefaultDeclaration>;
+    ExportNamedDeclaration: Type<namedTypes.ExportNamedDeclaration>;
+    ExportNamespaceSpecifier: Type<namedTypes.ExportNamespaceSpecifier>;
+    ExportDefaultSpecifier: Type<namedTypes.ExportDefaultSpecifier>;
+    ExportAllDeclaration: Type<namedTypes.ExportAllDeclaration>;
+    CommentBlock: Type<namedTypes.CommentBlock>;
+    CommentLine: Type<namedTypes.CommentLine>;
+    Directive: Type<namedTypes.Directive>;
+    DirectiveLiteral: Type<namedTypes.DirectiveLiteral>;
+    InterpreterDirective: Type<namedTypes.InterpreterDirective>;
+    StringLiteral: Type<namedTypes.StringLiteral>;
+    NumericLiteral: Type<namedTypes.NumericLiteral>;
+    BigIntLiteral: Type<namedTypes.BigIntLiteral>;
+    NullLiteral: Type<namedTypes.NullLiteral>;
+    BooleanLiteral: Type<namedTypes.BooleanLiteral>;
+    RegExpLiteral: Type<namedTypes.RegExpLiteral>;
+    ObjectMethod: Type<namedTypes.ObjectMethod>;
+    ClassPrivateProperty: Type<namedTypes.ClassPrivateProperty>;
+    ClassMethod: Type<namedTypes.ClassMethod>;
+    ClassPrivateMethod: Type<namedTypes.ClassPrivateMethod>;
+    PrivateName: Type<namedTypes.PrivateName>;
+    RestProperty: Type<namedTypes.RestProperty>;
+    ForAwaitStatement: Type<namedTypes.ForAwaitStatement>;
+    Import: Type<namedTypes.Import>;
+    TSQualifiedName: Type<namedTypes.TSQualifiedName>;
+    TSTypeReference: Type<namedTypes.TSTypeReference>;
+    TSHasOptionalTypeParameters: Type<namedTypes.TSHasOptionalTypeParameters>;
+    TSHasOptionalTypeAnnotation: Type<namedTypes.TSHasOptionalTypeAnnotation>;
+    TSAsExpression: Type<namedTypes.TSAsExpression>;
+    TSNonNullExpression: Type<namedTypes.TSNonNullExpression>;
+    TSAnyKeyword: Type<namedTypes.TSAnyKeyword>;
+    TSBigIntKeyword: Type<namedTypes.TSBigIntKeyword>;
+    TSBooleanKeyword: Type<namedTypes.TSBooleanKeyword>;
+    TSNeverKeyword: Type<namedTypes.TSNeverKeyword>;
+    TSNullKeyword: Type<namedTypes.TSNullKeyword>;
+    TSNumberKeyword: Type<namedTypes.TSNumberKeyword>;
+    TSObjectKeyword: Type<namedTypes.TSObjectKeyword>;
+    TSStringKeyword: Type<namedTypes.TSStringKeyword>;
+    TSSymbolKeyword: Type<namedTypes.TSSymbolKeyword>;
+    TSUndefinedKeyword: Type<namedTypes.TSUndefinedKeyword>;
+    TSUnknownKeyword: Type<namedTypes.TSUnknownKeyword>;
+    TSVoidKeyword: Type<namedTypes.TSVoidKeyword>;
+    TSThisType: Type<namedTypes.TSThisType>;
+    TSArrayType: Type<namedTypes.TSArrayType>;
+    TSLiteralType: Type<namedTypes.TSLiteralType>;
+    TSUnionType: Type<namedTypes.TSUnionType>;
+    TSIntersectionType: Type<namedTypes.TSIntersectionType>;
+    TSConditionalType: Type<namedTypes.TSConditionalType>;
+    TSInferType: Type<namedTypes.TSInferType>;
+    TSTypeParameter: Type<namedTypes.TSTypeParameter>;
+    TSParenthesizedType: Type<namedTypes.TSParenthesizedType>;
+    TSFunctionType: Type<namedTypes.TSFunctionType>;
+    TSConstructorType: Type<namedTypes.TSConstructorType>;
+    TSDeclareFunction: Type<namedTypes.TSDeclareFunction>;
+    TSDeclareMethod: Type<namedTypes.TSDeclareMethod>;
+    TSMappedType: Type<namedTypes.TSMappedType>;
+    TSTupleType: Type<namedTypes.TSTupleType>;
+    TSRestType: Type<namedTypes.TSRestType>;
+    TSOptionalType: Type<namedTypes.TSOptionalType>;
+    TSIndexedAccessType: Type<namedTypes.TSIndexedAccessType>;
+    TSTypeOperator: Type<namedTypes.TSTypeOperator>;
+    TSIndexSignature: Type<namedTypes.TSIndexSignature>;
+    TSPropertySignature: Type<namedTypes.TSPropertySignature>;
+    TSMethodSignature: Type<namedTypes.TSMethodSignature>;
+    TSTypePredicate: Type<namedTypes.TSTypePredicate>;
+    TSCallSignatureDeclaration: Type<namedTypes.TSCallSignatureDeclaration>;
+    TSConstructSignatureDeclaration: Type<namedTypes.TSConstructSignatureDeclaration>;
+    TSEnumMember: Type<namedTypes.TSEnumMember>;
+    TSTypeQuery: Type<namedTypes.TSTypeQuery>;
+    TSImportType: Type<namedTypes.TSImportType>;
+    TSTypeLiteral: Type<namedTypes.TSTypeLiteral>;
+    TSTypeAssertion: Type<namedTypes.TSTypeAssertion>;
+    TSEnumDeclaration: Type<namedTypes.TSEnumDeclaration>;
+    TSTypeAliasDeclaration: Type<namedTypes.TSTypeAliasDeclaration>;
+    TSModuleBlock: Type<namedTypes.TSModuleBlock>;
+    TSModuleDeclaration: Type<namedTypes.TSModuleDeclaration>;
+    TSImportEqualsDeclaration: Type<namedTypes.TSImportEqualsDeclaration>;
+    TSExternalModuleReference: Type<namedTypes.TSExternalModuleReference>;
+    TSExportAssignment: Type<namedTypes.TSExportAssignment>;
+    TSNamespaceExportDeclaration: Type<namedTypes.TSNamespaceExportDeclaration>;
+    TSInterfaceBody: Type<namedTypes.TSInterfaceBody>;
+    TSInterfaceDeclaration: Type<namedTypes.TSInterfaceDeclaration>;
+    TSParameterProperty: Type<namedTypes.TSParameterProperty>;
+    OptionalMemberExpression: Type<namedTypes.OptionalMemberExpression>;
+    OptionalCallExpression: Type<namedTypes.OptionalCallExpression>;
+}
diff --git a/node_modules/ast-types/gen/namedTypes.js b/node_modules/ast-types/gen/namedTypes.js
new file mode 100644
index 0000000..c5ace25
--- /dev/null
+++ b/node_modules/ast-types/gen/namedTypes.js
@@ -0,0 +1,5 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var namedTypes;
+(function (namedTypes) {
+})(namedTypes = exports.namedTypes || (exports.namedTypes = {}));
diff --git a/node_modules/ast-types/gen/nodes.d.ts b/node_modules/ast-types/gen/nodes.d.ts
new file mode 100644
index 0000000..4f7724a
--- /dev/null
+++ b/node_modules/ast-types/gen/nodes.d.ts
@@ -0,0 +1,1265 @@
+import { Omit } from "../types";
+import * as K from "./kinds";
+export interface Printable {
+    loc: K.SourceLocationKind | null;
+}
+export interface SourceLocation {
+    start: K.PositionKind;
+    end: K.PositionKind;
+    source: string | null;
+}
+export interface Node extends Printable {
+    type: string;
+    comments: K.CommentKind[] | null;
+}
+export interface Comment extends Printable {
+    value: string;
+    leading: boolean;
+    trailing: boolean;
+}
+export interface Position {
+    line: number;
+    column: number;
+}
+export interface File extends Omit<Node, "type"> {
+    type: "File";
+    program: K.ProgramKind;
+    name: string | null;
+}
+export interface Program extends Omit<Node, "type"> {
+    type: "Program";
+    body: K.StatementKind[];
+    directives: K.DirectiveKind[];
+    interpreter: K.InterpreterDirectiveKind | null;
+}
+export interface Statement extends Node {
+}
+export interface Function extends Node {
+    id: K.IdentifierKind | null;
+    params: K.PatternKind[];
+    body: K.BlockStatementKind;
+    generator: boolean;
+    async: boolean;
+    expression: boolean;
+    defaults: (K.ExpressionKind | null)[];
+    rest: K.IdentifierKind | null;
+    returnType: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    typeParameters: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+}
+export interface Expression extends Node {
+}
+export interface Pattern extends Node {
+}
+export interface Identifier extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+    type: "Identifier";
+    name: string;
+    optional: boolean;
+    typeAnnotation: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+}
+export interface BlockStatement extends Omit<Statement, "type"> {
+    type: "BlockStatement";
+    body: K.StatementKind[];
+    directives: K.DirectiveKind[];
+}
+export interface EmptyStatement extends Omit<Statement, "type"> {
+    type: "EmptyStatement";
+}
+export interface ExpressionStatement extends Omit<Statement, "type"> {
+    type: "ExpressionStatement";
+    expression: K.ExpressionKind;
+}
+export interface IfStatement extends Omit<Statement, "type"> {
+    type: "IfStatement";
+    test: K.ExpressionKind;
+    consequent: K.StatementKind;
+    alternate: K.StatementKind | null;
+}
+export interface LabeledStatement extends Omit<Statement, "type"> {
+    type: "LabeledStatement";
+    label: K.IdentifierKind;
+    body: K.StatementKind;
+}
+export interface BreakStatement extends Omit<Statement, "type"> {
+    type: "BreakStatement";
+    label: K.IdentifierKind | null;
+}
+export interface ContinueStatement extends Omit<Statement, "type"> {
+    type: "ContinueStatement";
+    label: K.IdentifierKind | null;
+}
+export interface WithStatement extends Omit<Statement, "type"> {
+    type: "WithStatement";
+    object: K.ExpressionKind;
+    body: K.StatementKind;
+}
+export interface SwitchStatement extends Omit<Statement, "type"> {
+    type: "SwitchStatement";
+    discriminant: K.ExpressionKind;
+    cases: K.SwitchCaseKind[];
+    lexical: boolean;
+}
+export interface SwitchCase extends Omit<Node, "type"> {
+    type: "SwitchCase";
+    test: K.ExpressionKind | null;
+    consequent: K.StatementKind[];
+}
+export interface ReturnStatement extends Omit<Statement, "type"> {
+    type: "ReturnStatement";
+    argument: K.ExpressionKind | null;
+}
+export interface ThrowStatement extends Omit<Statement, "type"> {
+    type: "ThrowStatement";
+    argument: K.ExpressionKind;
+}
+export interface TryStatement extends Omit<Statement, "type"> {
+    type: "TryStatement";
+    block: K.BlockStatementKind;
+    handler: K.CatchClauseKind | null;
+    handlers: K.CatchClauseKind[];
+    guardedHandlers: K.CatchClauseKind[];
+    finalizer: K.BlockStatementKind | null;
+}
+export interface CatchClause extends Omit<Node, "type"> {
+    type: "CatchClause";
+    param: K.PatternKind | null;
+    guard: K.ExpressionKind | null;
+    body: K.BlockStatementKind;
+}
+export interface WhileStatement extends Omit<Statement, "type"> {
+    type: "WhileStatement";
+    test: K.ExpressionKind;
+    body: K.StatementKind;
+}
+export interface DoWhileStatement extends Omit<Statement, "type"> {
+    type: "DoWhileStatement";
+    body: K.StatementKind;
+    test: K.ExpressionKind;
+}
+export interface ForStatement extends Omit<Statement, "type"> {
+    type: "ForStatement";
+    init: K.VariableDeclarationKind | K.ExpressionKind | null;
+    test: K.ExpressionKind | null;
+    update: K.ExpressionKind | null;
+    body: K.StatementKind;
+}
+export interface Declaration extends Statement {
+}
+export interface VariableDeclaration extends Omit<Declaration, "type"> {
+    type: "VariableDeclaration";
+    kind: "var" | "let" | "const";
+    declarations: (K.VariableDeclaratorKind | K.IdentifierKind)[];
+}
+export interface ForInStatement extends Omit<Statement, "type"> {
+    type: "ForInStatement";
+    left: K.VariableDeclarationKind | K.ExpressionKind;
+    right: K.ExpressionKind;
+    body: K.StatementKind;
+}
+export interface DebuggerStatement extends Omit<Statement, "type"> {
+    type: "DebuggerStatement";
+}
+export interface FunctionDeclaration extends Omit<Function, "type" | "id">, Omit<Declaration, "type"> {
+    type: "FunctionDeclaration";
+    id: K.IdentifierKind;
+}
+export interface FunctionExpression extends Omit<Function, "type">, Omit<Expression, "type"> {
+    type: "FunctionExpression";
+}
+export interface VariableDeclarator extends Omit<Node, "type"> {
+    type: "VariableDeclarator";
+    id: K.PatternKind;
+    init: K.ExpressionKind | null;
+}
+export interface ThisExpression extends Omit<Expression, "type"> {
+    type: "ThisExpression";
+}
+export interface ArrayExpression extends Omit<Expression, "type"> {
+    type: "ArrayExpression";
+    elements: (K.ExpressionKind | K.SpreadElementKind | K.RestElementKind | null)[];
+}
+export interface ObjectExpression extends Omit<Expression, "type"> {
+    type: "ObjectExpression";
+    properties: (K.PropertyKind | K.ObjectMethodKind | K.ObjectPropertyKind | K.SpreadPropertyKind | K.SpreadElementKind)[];
+}
+export interface Property extends Omit<Node, "type"> {
+    type: "Property";
+    kind: "init" | "get" | "set";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    value: K.ExpressionKind | K.PatternKind;
+    method: boolean;
+    shorthand: boolean;
+    computed: boolean;
+    decorators: K.DecoratorKind[] | null;
+}
+export interface Literal extends Omit<Expression, "type"> {
+    type: "Literal";
+    value: string | boolean | null | number | RegExp;
+    regex: {
+        pattern: string;
+        flags: string;
+    } | null;
+}
+export interface SequenceExpression extends Omit<Expression, "type"> {
+    type: "SequenceExpression";
+    expressions: K.ExpressionKind[];
+}
+export interface UnaryExpression extends Omit<Expression, "type"> {
+    type: "UnaryExpression";
+    operator: "-" | "+" | "!" | "~" | "typeof" | "void" | "delete";
+    argument: K.ExpressionKind;
+    prefix: boolean;
+}
+export interface BinaryExpression extends Omit<Expression, "type"> {
+    type: "BinaryExpression";
+    operator: "==" | "!=" | "===" | "!==" | "<" | "<=" | ">" | ">=" | "<<" | ">>" | ">>>" | "+" | "-" | "*" | "/" | "%" | "**" | "&" | "|" | "^" | "in" | "instanceof";
+    left: K.ExpressionKind;
+    right: K.ExpressionKind;
+}
+export interface AssignmentExpression extends Omit<Expression, "type"> {
+    type: "AssignmentExpression";
+    operator: "=" | "+=" | "-=" | "*=" | "/=" | "%=" | "<<=" | ">>=" | ">>>=" | "|=" | "^=" | "&=";
+    left: K.PatternKind | K.MemberExpressionKind;
+    right: K.ExpressionKind;
+}
+export interface MemberExpression extends Omit<Expression, "type"> {
+    type: "MemberExpression";
+    object: K.ExpressionKind;
+    property: K.IdentifierKind | K.ExpressionKind;
+    computed: boolean;
+}
+export interface UpdateExpression extends Omit<Expression, "type"> {
+    type: "UpdateExpression";
+    operator: "++" | "--";
+    argument: K.ExpressionKind;
+    prefix: boolean;
+}
+export interface LogicalExpression extends Omit<Expression, "type"> {
+    type: "LogicalExpression";
+    operator: "||" | "&&" | "??";
+    left: K.ExpressionKind;
+    right: K.ExpressionKind;
+}
+export interface ConditionalExpression extends Omit<Expression, "type"> {
+    type: "ConditionalExpression";
+    test: K.ExpressionKind;
+    consequent: K.ExpressionKind;
+    alternate: K.ExpressionKind;
+}
+export interface NewExpression extends Omit<Expression, "type"> {
+    type: "NewExpression";
+    callee: K.ExpressionKind;
+    arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+}
+export interface CallExpression extends Omit<Expression, "type"> {
+    type: "CallExpression";
+    callee: K.ExpressionKind;
+    arguments: (K.ExpressionKind | K.SpreadElementKind)[];
+}
+export interface RestElement extends Omit<Pattern, "type"> {
+    type: "RestElement";
+    argument: K.PatternKind;
+    typeAnnotation: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+}
+export interface TypeAnnotation extends Omit<Node, "type"> {
+    type: "TypeAnnotation";
+    typeAnnotation: K.FlowTypeKind;
+}
+export interface TSTypeAnnotation extends Omit<Node, "type"> {
+    type: "TSTypeAnnotation";
+    typeAnnotation: K.TSTypeKind | K.TSTypeAnnotationKind;
+}
+export interface SpreadElementPattern extends Omit<Pattern, "type"> {
+    type: "SpreadElementPattern";
+    argument: K.PatternKind;
+}
+export interface ArrowFunctionExpression extends Omit<Function, "type" | "id" | "body" | "generator">, Omit<Expression, "type"> {
+    type: "ArrowFunctionExpression";
+    id: null;
+    body: K.BlockStatementKind | K.ExpressionKind;
+    generator: false;
+}
+export interface ForOfStatement extends Omit<Statement, "type"> {
+    type: "ForOfStatement";
+    left: K.VariableDeclarationKind | K.PatternKind;
+    right: K.ExpressionKind;
+    body: K.StatementKind;
+}
+export interface YieldExpression extends Omit<Expression, "type"> {
+    type: "YieldExpression";
+    argument: K.ExpressionKind | null;
+    delegate: boolean;
+}
+export interface GeneratorExpression extends Omit<Expression, "type"> {
+    type: "GeneratorExpression";
+    body: K.ExpressionKind;
+    blocks: K.ComprehensionBlockKind[];
+    filter: K.ExpressionKind | null;
+}
+export interface ComprehensionBlock extends Omit<Node, "type"> {
+    type: "ComprehensionBlock";
+    left: K.PatternKind;
+    right: K.ExpressionKind;
+    each: boolean;
+}
+export interface ComprehensionExpression extends Omit<Expression, "type"> {
+    type: "ComprehensionExpression";
+    body: K.ExpressionKind;
+    blocks: K.ComprehensionBlockKind[];
+    filter: K.ExpressionKind | null;
+}
+export interface ObjectProperty extends Omit<Node, "type"> {
+    shorthand: boolean;
+    type: "ObjectProperty";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    value: K.ExpressionKind | K.PatternKind;
+    accessibility: K.LiteralKind | null;
+    computed: boolean;
+}
+export interface PropertyPattern extends Omit<Pattern, "type"> {
+    type: "PropertyPattern";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    pattern: K.PatternKind;
+    computed: boolean;
+}
+export interface ObjectPattern extends Omit<Pattern, "type"> {
+    type: "ObjectPattern";
+    properties: (K.PropertyKind | K.PropertyPatternKind | K.SpreadPropertyPatternKind | K.SpreadPropertyKind | K.ObjectPropertyKind | K.RestPropertyKind)[];
+    typeAnnotation: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    decorators: K.DecoratorKind[] | null;
+}
+export interface ArrayPattern extends Omit<Pattern, "type"> {
+    type: "ArrayPattern";
+    elements: (K.PatternKind | K.SpreadElementKind | null)[];
+}
+export interface MethodDefinition extends Omit<Declaration, "type"> {
+    type: "MethodDefinition";
+    kind: "constructor" | "method" | "get" | "set";
+    key: K.ExpressionKind;
+    value: K.FunctionKind;
+    computed: boolean;
+    static: boolean;
+    decorators: K.DecoratorKind[] | null;
+}
+export interface SpreadElement extends Omit<Node, "type"> {
+    type: "SpreadElement";
+    argument: K.ExpressionKind;
+}
+export interface AssignmentPattern extends Omit<Pattern, "type"> {
+    type: "AssignmentPattern";
+    left: K.PatternKind;
+    right: K.ExpressionKind;
+}
+export interface ClassPropertyDefinition extends Omit<Declaration, "type"> {
+    type: "ClassPropertyDefinition";
+    definition: K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind;
+}
+export interface ClassProperty extends Omit<Declaration, "type"> {
+    type: "ClassProperty";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    computed: boolean;
+    value: K.ExpressionKind | null;
+    static: boolean;
+    typeAnnotation: K.TypeAnnotationKind | K.TSTypeAnnotationKind | null;
+    variance: K.VarianceKind | "plus" | "minus" | null;
+    access: "public" | "private" | "protected" | undefined;
+}
+export interface ClassBody extends Omit<Declaration, "type"> {
+    type: "ClassBody";
+    body: (K.MethodDefinitionKind | K.VariableDeclaratorKind | K.ClassPropertyDefinitionKind | K.ClassPropertyKind | K.ClassPrivatePropertyKind | K.ClassMethodKind | K.ClassPrivateMethodKind | K.TSDeclareMethodKind | K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+}
+export interface ClassDeclaration extends Omit<Declaration, "type"> {
+    type: "ClassDeclaration";
+    id: K.IdentifierKind | null;
+    body: K.ClassBodyKind;
+    superClass: K.ExpressionKind | null;
+    typeParameters: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    superTypeParameters: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+    implements: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+}
+export interface ClassExpression extends Omit<Expression, "type"> {
+    type: "ClassExpression";
+    id: K.IdentifierKind | null;
+    body: K.ClassBodyKind;
+    superClass: K.ExpressionKind | null;
+    typeParameters: K.TypeParameterDeclarationKind | K.TSTypeParameterDeclarationKind | null;
+    superTypeParameters: K.TypeParameterInstantiationKind | K.TSTypeParameterInstantiationKind | null;
+    implements: K.ClassImplementsKind[] | K.TSExpressionWithTypeArgumentsKind[];
+}
+export interface Specifier extends Node {
+}
+export interface ModuleSpecifier extends Specifier {
+    local: K.IdentifierKind | null;
+    id: K.IdentifierKind | null;
+    name: K.IdentifierKind | null;
+}
+export interface ImportSpecifier extends Omit<ModuleSpecifier, "type"> {
+    type: "ImportSpecifier";
+    imported: K.IdentifierKind;
+}
+export interface ImportNamespaceSpecifier extends Omit<ModuleSpecifier, "type"> {
+    type: "ImportNamespaceSpecifier";
+}
+export interface ImportDefaultSpecifier extends Omit<ModuleSpecifier, "type"> {
+    type: "ImportDefaultSpecifier";
+}
+export interface ImportDeclaration extends Omit<Declaration, "type"> {
+    type: "ImportDeclaration";
+    specifiers: (K.ImportSpecifierKind | K.ImportNamespaceSpecifierKind | K.ImportDefaultSpecifierKind)[];
+    source: K.LiteralKind;
+    importKind: "value" | "type";
+}
+export interface TaggedTemplateExpression extends Omit<Expression, "type"> {
+    type: "TaggedTemplateExpression";
+    tag: K.ExpressionKind;
+    quasi: K.TemplateLiteralKind;
+}
+export interface TemplateLiteral extends Omit<Expression, "type"> {
+    type: "TemplateLiteral";
+    quasis: K.TemplateElementKind[];
+    expressions: K.ExpressionKind[];
+}
+export interface TemplateElement extends Omit<Node, "type"> {
+    type: "TemplateElement";
+    value: {
+        cooked: string;
+        raw: string;
+    };
+    tail: boolean;
+}
+export interface SpreadProperty extends Omit<Node, "type"> {
+    type: "SpreadProperty";
+    argument: K.ExpressionKind;
+}
+export interface SpreadPropertyPattern extends Omit<Pattern, "type"> {
+    type: "SpreadPropertyPattern";
+    argument: K.PatternKind;
+}
+export interface AwaitExpression extends Omit<Expression, "type"> {
+    type: "AwaitExpression";
+    argument: K.ExpressionKind | null;
+    all: boolean;
+}
+export interface JSXAttribute extends Omit<Node, "type"> {
+    type: "JSXAttribute";
+    name: K.JSXIdentifierKind | K.JSXNamespacedNameKind;
+    value: K.LiteralKind | K.JSXExpressionContainerKind | null;
+}
+export interface JSXIdentifier extends Omit<Identifier, "type" | "name"> {
+    type: "JSXIdentifier";
+    name: string;
+}
+export interface JSXNamespacedName extends Omit<Node, "type"> {
+    type: "JSXNamespacedName";
+    namespace: K.JSXIdentifierKind;
+    name: K.JSXIdentifierKind;
+}
+export interface JSXExpressionContainer extends Omit<Expression, "type"> {
+    type: "JSXExpressionContainer";
+    expression: K.ExpressionKind;
+}
+export interface JSXMemberExpression extends Omit<MemberExpression, "type" | "object" | "property" | "computed"> {
+    type: "JSXMemberExpression";
+    object: K.JSXIdentifierKind | K.JSXMemberExpressionKind;
+    property: K.JSXIdentifierKind;
+    computed: boolean;
+}
+export interface JSXSpreadAttribute extends Omit<Node, "type"> {
+    type: "JSXSpreadAttribute";
+    argument: K.ExpressionKind;
+}
+export interface JSXElement extends Omit<Expression, "type"> {
+    type: "JSXElement";
+    openingElement: K.JSXOpeningElementKind;
+    closingElement: K.JSXClosingElementKind | null;
+    children: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+    name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+    selfClosing: boolean;
+    attributes: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+}
+export interface JSXOpeningElement extends Omit<Node, "type"> {
+    type: "JSXOpeningElement";
+    name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+    attributes: (K.JSXAttributeKind | K.JSXSpreadAttributeKind)[];
+    selfClosing: boolean;
+}
+export interface JSXClosingElement extends Omit<Node, "type"> {
+    type: "JSXClosingElement";
+    name: K.JSXIdentifierKind | K.JSXNamespacedNameKind | K.JSXMemberExpressionKind;
+}
+export interface JSXFragment extends Omit<Expression, "type"> {
+    type: "JSXFragment";
+    openingElement: K.JSXOpeningFragmentKind;
+    closingElement: K.JSXClosingFragmentKind;
+    children: (K.JSXElementKind | K.JSXExpressionContainerKind | K.JSXFragmentKind | K.JSXTextKind | K.LiteralKind)[];
+}
+export interface JSXText extends Omit<Literal, "type" | "value"> {
+    type: "JSXText";
+    value: string;
+}
+export interface JSXOpeningFragment extends Omit<Node, "type"> {
+    type: "JSXOpeningFragment";
+}
+export interface JSXClosingFragment extends Omit<Node, "type"> {
+    type: "JSXClosingFragment";
+}
+export interface JSXEmptyExpression extends Omit<Expression, "type"> {
+    type: "JSXEmptyExpression";
+}
+export interface JSXSpreadChild extends Omit<Expression, "type"> {
+    type: "JSXSpreadChild";
+    expression: K.ExpressionKind;
+}
+export interface TypeParameterDeclaration extends Omit<Node, "type"> {
+    type: "TypeParameterDeclaration";
+    params: K.TypeParameterKind[];
+}
+export interface TSTypeParameterDeclaration extends Omit<Declaration, "type"> {
+    type: "TSTypeParameterDeclaration";
+    params: K.TSTypeParameterKind[];
+}
+export interface TypeParameterInstantiation extends Omit<Node, "type"> {
+    type: "TypeParameterInstantiation";
+    params: K.FlowTypeKind[];
+}
+export interface TSTypeParameterInstantiation extends Omit<Node, "type"> {
+    type: "TSTypeParameterInstantiation";
+    params: K.TSTypeKind[];
+}
+export interface ClassImplements extends Omit<Node, "type"> {
+    type: "ClassImplements";
+    id: K.IdentifierKind;
+    superClass: K.ExpressionKind | null;
+    typeParameters: K.TypeParameterInstantiationKind | null;
+}
+export interface TSType extends Node {
+}
+export interface TSHasOptionalTypeParameterInstantiation {
+    typeParameters: K.TSTypeParameterInstantiationKind | null;
+}
+export interface TSExpressionWithTypeArguments extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+    type: "TSExpressionWithTypeArguments";
+    expression: K.IdentifierKind | K.TSQualifiedNameKind;
+}
+export interface Flow extends Node {
+}
+export interface FlowType extends Flow {
+}
+export interface AnyTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "AnyTypeAnnotation";
+}
+export interface EmptyTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "EmptyTypeAnnotation";
+}
+export interface MixedTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "MixedTypeAnnotation";
+}
+export interface VoidTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "VoidTypeAnnotation";
+}
+export interface NumberTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NumberTypeAnnotation";
+}
+export interface NumberLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NumberLiteralTypeAnnotation";
+    value: number;
+    raw: string;
+}
+export interface NumericLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NumericLiteralTypeAnnotation";
+    value: number;
+    raw: string;
+}
+export interface StringTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "StringTypeAnnotation";
+}
+export interface StringLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "StringLiteralTypeAnnotation";
+    value: string;
+    raw: string;
+}
+export interface BooleanTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "BooleanTypeAnnotation";
+}
+export interface BooleanLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "BooleanLiteralTypeAnnotation";
+    value: boolean;
+    raw: string;
+}
+export interface NullableTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NullableTypeAnnotation";
+    typeAnnotation: K.FlowTypeKind;
+}
+export interface NullLiteralTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NullLiteralTypeAnnotation";
+}
+export interface NullTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "NullTypeAnnotation";
+}
+export interface ThisTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "ThisTypeAnnotation";
+}
+export interface ExistsTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "ExistsTypeAnnotation";
+}
+export interface ExistentialTypeParam extends Omit<FlowType, "type"> {
+    type: "ExistentialTypeParam";
+}
+export interface FunctionTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "FunctionTypeAnnotation";
+    params: K.FunctionTypeParamKind[];
+    returnType: K.FlowTypeKind;
+    rest: K.FunctionTypeParamKind | null;
+    typeParameters: K.TypeParameterDeclarationKind | null;
+}
+export interface FunctionTypeParam extends Omit<Node, "type"> {
+    type: "FunctionTypeParam";
+    name: K.IdentifierKind;
+    typeAnnotation: K.FlowTypeKind;
+    optional: boolean;
+}
+export interface ArrayTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "ArrayTypeAnnotation";
+    elementType: K.FlowTypeKind;
+}
+export interface ObjectTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "ObjectTypeAnnotation";
+    properties: (K.ObjectTypePropertyKind | K.ObjectTypeSpreadPropertyKind)[];
+    indexers: K.ObjectTypeIndexerKind[];
+    callProperties: K.ObjectTypeCallPropertyKind[];
+    inexact: boolean | undefined;
+    exact: boolean;
+    internalSlots: K.ObjectTypeInternalSlotKind[];
+}
+export interface ObjectTypeProperty extends Omit<Node, "type"> {
+    type: "ObjectTypeProperty";
+    key: K.LiteralKind | K.IdentifierKind;
+    value: K.FlowTypeKind;
+    optional: boolean;
+    variance: K.VarianceKind | "plus" | "minus" | null;
+}
+export interface ObjectTypeSpreadProperty extends Omit<Node, "type"> {
+    type: "ObjectTypeSpreadProperty";
+    argument: K.FlowTypeKind;
+}
+export interface ObjectTypeIndexer extends Omit<Node, "type"> {
+    type: "ObjectTypeIndexer";
+    id: K.IdentifierKind;
+    key: K.FlowTypeKind;
+    value: K.FlowTypeKind;
+    variance: K.VarianceKind | "plus" | "minus" | null;
+}
+export interface ObjectTypeCallProperty extends Omit<Node, "type"> {
+    type: "ObjectTypeCallProperty";
+    value: K.FunctionTypeAnnotationKind;
+    static: boolean;
+}
+export interface ObjectTypeInternalSlot extends Omit<Node, "type"> {
+    type: "ObjectTypeInternalSlot";
+    id: K.IdentifierKind;
+    value: K.FlowTypeKind;
+    optional: boolean;
+    static: boolean;
+    method: boolean;
+}
+export interface Variance extends Omit<Node, "type"> {
+    type: "Variance";
+    kind: "plus" | "minus";
+}
+export interface QualifiedTypeIdentifier extends Omit<Node, "type"> {
+    type: "QualifiedTypeIdentifier";
+    qualification: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+    id: K.IdentifierKind;
+}
+export interface GenericTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "GenericTypeAnnotation";
+    id: K.IdentifierKind | K.QualifiedTypeIdentifierKind;
+    typeParameters: K.TypeParameterInstantiationKind | null;
+}
+export interface MemberTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "MemberTypeAnnotation";
+    object: K.IdentifierKind;
+    property: K.MemberTypeAnnotationKind | K.GenericTypeAnnotationKind;
+}
+export interface UnionTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "UnionTypeAnnotation";
+    types: K.FlowTypeKind[];
+}
+export interface IntersectionTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "IntersectionTypeAnnotation";
+    types: K.FlowTypeKind[];
+}
+export interface TypeofTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "TypeofTypeAnnotation";
+    argument: K.FlowTypeKind;
+}
+export interface TypeParameter extends Omit<FlowType, "type"> {
+    type: "TypeParameter";
+    name: string;
+    variance: K.VarianceKind | "plus" | "minus" | null;
+    bound: K.TypeAnnotationKind | null;
+}
+export interface InterfaceTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "InterfaceTypeAnnotation";
+    body: K.ObjectTypeAnnotationKind;
+    extends: K.InterfaceExtendsKind[] | null;
+}
+export interface InterfaceExtends extends Omit<Node, "type"> {
+    type: "InterfaceExtends";
+    id: K.IdentifierKind;
+    typeParameters: K.TypeParameterInstantiationKind | null;
+}
+export interface InterfaceDeclaration extends Omit<Declaration, "type"> {
+    type: "InterfaceDeclaration";
+    id: K.IdentifierKind;
+    typeParameters: K.TypeParameterDeclarationKind | null;
+    body: K.ObjectTypeAnnotationKind;
+    extends: K.InterfaceExtendsKind[];
+}
+export interface DeclareInterface extends Omit<InterfaceDeclaration, "type"> {
+    type: "DeclareInterface";
+}
+export interface TypeAlias extends Omit<Declaration, "type"> {
+    type: "TypeAlias";
+    id: K.IdentifierKind;
+    typeParameters: K.TypeParameterDeclarationKind | null;
+    right: K.FlowTypeKind;
+}
+export interface OpaqueType extends Omit<Declaration, "type"> {
+    type: "OpaqueType";
+    id: K.IdentifierKind;
+    typeParameters: K.TypeParameterDeclarationKind | null;
+    impltype: K.FlowTypeKind;
+    supertype: K.FlowTypeKind;
+}
+export interface DeclareTypeAlias extends Omit<TypeAlias, "type"> {
+    type: "DeclareTypeAlias";
+}
+export interface DeclareOpaqueType extends Omit<TypeAlias, "type"> {
+    type: "DeclareOpaqueType";
+}
+export interface TypeCastExpression extends Omit<Expression, "type"> {
+    type: "TypeCastExpression";
+    expression: K.ExpressionKind;
+    typeAnnotation: K.TypeAnnotationKind;
+}
+export interface TupleTypeAnnotation extends Omit<FlowType, "type"> {
+    type: "TupleTypeAnnotation";
+    types: K.FlowTypeKind[];
+}
+export interface DeclareVariable extends Omit<Statement, "type"> {
+    type: "DeclareVariable";
+    id: K.IdentifierKind;
+}
+export interface DeclareFunction extends Omit<Statement, "type"> {
+    type: "DeclareFunction";
+    id: K.IdentifierKind;
+}
+export interface DeclareClass extends Omit<InterfaceDeclaration, "type"> {
+    type: "DeclareClass";
+}
+export interface DeclareModule extends Omit<Statement, "type"> {
+    type: "DeclareModule";
+    id: K.IdentifierKind | K.LiteralKind;
+    body: K.BlockStatementKind;
+}
+export interface DeclareModuleExports extends Omit<Statement, "type"> {
+    type: "DeclareModuleExports";
+    typeAnnotation: K.TypeAnnotationKind;
+}
+export interface DeclareExportDeclaration extends Omit<Declaration, "type"> {
+    type: "DeclareExportDeclaration";
+    default: boolean;
+    declaration: K.DeclareVariableKind | K.DeclareFunctionKind | K.DeclareClassKind | K.FlowTypeKind | null;
+    specifiers: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+    source: K.LiteralKind | null;
+}
+export interface ExportSpecifier extends Omit<ModuleSpecifier, "type"> {
+    type: "ExportSpecifier";
+    exported: K.IdentifierKind;
+}
+export interface ExportBatchSpecifier extends Omit<Specifier, "type"> {
+    type: "ExportBatchSpecifier";
+}
+export interface DeclareExportAllDeclaration extends Omit<Declaration, "type"> {
+    type: "DeclareExportAllDeclaration";
+    source: K.LiteralKind | null;
+}
+export interface FlowPredicate extends Flow {
+}
+export interface InferredPredicate extends Omit<FlowPredicate, "type"> {
+    type: "InferredPredicate";
+}
+export interface DeclaredPredicate extends Omit<FlowPredicate, "type"> {
+    type: "DeclaredPredicate";
+    value: K.ExpressionKind;
+}
+export interface ExportDeclaration extends Omit<Declaration, "type"> {
+    type: "ExportDeclaration";
+    default: boolean;
+    declaration: K.DeclarationKind | K.ExpressionKind | null;
+    specifiers: (K.ExportSpecifierKind | K.ExportBatchSpecifierKind)[];
+    source: K.LiteralKind | null;
+}
+export interface Block extends Comment {
+    type: "Block";
+}
+export interface Line extends Comment {
+    type: "Line";
+}
+export interface Noop extends Omit<Statement, "type"> {
+    type: "Noop";
+}
+export interface DoExpression extends Omit<Expression, "type"> {
+    type: "DoExpression";
+    body: K.StatementKind[];
+}
+export interface Super extends Omit<Expression, "type"> {
+    type: "Super";
+}
+export interface BindExpression extends Omit<Expression, "type"> {
+    type: "BindExpression";
+    object: K.ExpressionKind | null;
+    callee: K.ExpressionKind;
+}
+export interface Decorator extends Omit<Node, "type"> {
+    type: "Decorator";
+    expression: K.ExpressionKind;
+}
+export interface MetaProperty extends Omit<Expression, "type"> {
+    type: "MetaProperty";
+    meta: K.IdentifierKind;
+    property: K.IdentifierKind;
+}
+export interface ParenthesizedExpression extends Omit<Expression, "type"> {
+    type: "ParenthesizedExpression";
+    expression: K.ExpressionKind;
+}
+export interface ExportDefaultDeclaration extends Omit<Declaration, "type"> {
+    type: "ExportDefaultDeclaration";
+    declaration: K.DeclarationKind | K.ExpressionKind;
+}
+export interface ExportNamedDeclaration extends Omit<Declaration, "type"> {
+    type: "ExportNamedDeclaration";
+    declaration: K.DeclarationKind | null;
+    specifiers: K.ExportSpecifierKind[];
+    source: K.LiteralKind | null;
+}
+export interface ExportNamespaceSpecifier extends Omit<Specifier, "type"> {
+    type: "ExportNamespaceSpecifier";
+    exported: K.IdentifierKind;
+}
+export interface ExportDefaultSpecifier extends Omit<Specifier, "type"> {
+    type: "ExportDefaultSpecifier";
+    exported: K.IdentifierKind;
+}
+export interface ExportAllDeclaration extends Omit<Declaration, "type"> {
+    type: "ExportAllDeclaration";
+    exported: K.IdentifierKind | null;
+    source: K.LiteralKind;
+}
+export interface CommentBlock extends Comment {
+    type: "CommentBlock";
+}
+export interface CommentLine extends Comment {
+    type: "CommentLine";
+}
+export interface Directive extends Omit<Node, "type"> {
+    type: "Directive";
+    value: K.DirectiveLiteralKind;
+}
+export interface DirectiveLiteral extends Omit<Node, "type">, Omit<Expression, "type"> {
+    type: "DirectiveLiteral";
+    value: string;
+}
+export interface InterpreterDirective extends Omit<Node, "type"> {
+    type: "InterpreterDirective";
+    value: string;
+}
+export interface StringLiteral extends Omit<Literal, "type" | "value"> {
+    type: "StringLiteral";
+    value: string;
+}
+export interface NumericLiteral extends Omit<Literal, "type" | "value"> {
+    type: "NumericLiteral";
+    value: number;
+    raw: string | null;
+    extra: {
+        rawValue: number;
+        raw: string;
+    };
+}
+export interface BigIntLiteral extends Omit<Literal, "type" | "value"> {
+    type: "BigIntLiteral";
+    value: string | number;
+    extra: {
+        rawValue: string;
+        raw: string;
+    };
+}
+export interface NullLiteral extends Omit<Literal, "type" | "value"> {
+    type: "NullLiteral";
+    value: null;
+}
+export interface BooleanLiteral extends Omit<Literal, "type" | "value"> {
+    type: "BooleanLiteral";
+    value: boolean;
+}
+export interface RegExpLiteral extends Omit<Literal, "type" | "value"> {
+    type: "RegExpLiteral";
+    pattern: string;
+    flags: string;
+    value: RegExp;
+}
+export interface ObjectMethod extends Omit<Node, "type">, Omit<Function, "type" | "params" | "body" | "generator" | "async"> {
+    type: "ObjectMethod";
+    kind: "method" | "get" | "set";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    params: K.PatternKind[];
+    body: K.BlockStatementKind;
+    computed: boolean;
+    generator: boolean;
+    async: boolean;
+    accessibility: K.LiteralKind | null;
+    decorators: K.DecoratorKind[] | null;
+}
+export interface ClassPrivateProperty extends Omit<ClassProperty, "type" | "key" | "value"> {
+    type: "ClassPrivateProperty";
+    key: K.PrivateNameKind;
+    value: K.ExpressionKind | null;
+}
+export interface ClassMethod extends Omit<Declaration, "type">, Omit<Function, "type" | "body"> {
+    type: "ClassMethod";
+    key: K.LiteralKind | K.IdentifierKind | K.ExpressionKind;
+    kind: "get" | "set" | "method" | "constructor";
+    body: K.BlockStatementKind;
+    computed: boolean;
+    static: boolean | null;
+    abstract: boolean | null;
+    access: "public" | "private" | "protected" | null;
+    accessibility: "public" | "private" | "protected" | null;
+    decorators: K.DecoratorKind[] | null;
+    optional: boolean | null;
+}
+export interface ClassPrivateMethod extends Omit<Declaration, "type">, Omit<Function, "type" | "body"> {
+    type: "ClassPrivateMethod";
+    key: K.PrivateNameKind;
+    kind: "get" | "set" | "method" | "constructor";
+    body: K.BlockStatementKind;
+    computed: boolean;
+    static: boolean | null;
+    abstract: boolean | null;
+    access: "public" | "private" | "protected" | null;
+    accessibility: "public" | "private" | "protected" | null;
+    decorators: K.DecoratorKind[] | null;
+    optional: boolean | null;
+}
+export interface PrivateName extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+    type: "PrivateName";
+    id: K.IdentifierKind;
+}
+export interface RestProperty extends Omit<Node, "type"> {
+    type: "RestProperty";
+    argument: K.ExpressionKind;
+}
+export interface ForAwaitStatement extends Omit<Statement, "type"> {
+    type: "ForAwaitStatement";
+    left: K.VariableDeclarationKind | K.ExpressionKind;
+    right: K.ExpressionKind;
+    body: K.StatementKind;
+}
+export interface Import extends Omit<Expression, "type"> {
+    type: "Import";
+}
+export interface TSQualifiedName extends Omit<Node, "type"> {
+    type: "TSQualifiedName";
+    left: K.IdentifierKind | K.TSQualifiedNameKind;
+    right: K.IdentifierKind | K.TSQualifiedNameKind;
+}
+export interface TSTypeReference extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+    type: "TSTypeReference";
+    typeName: K.IdentifierKind | K.TSQualifiedNameKind;
+}
+export interface TSHasOptionalTypeParameters {
+    typeParameters: K.TSTypeParameterDeclarationKind | null | undefined;
+}
+export interface TSHasOptionalTypeAnnotation {
+    typeAnnotation: K.TSTypeAnnotationKind | null;
+}
+export interface TSAsExpression extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+    type: "TSAsExpression";
+    expression: K.ExpressionKind;
+    typeAnnotation: K.TSTypeKind;
+    extra: {
+        parenthesized: boolean;
+    } | null;
+}
+export interface TSNonNullExpression extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+    type: "TSNonNullExpression";
+    expression: K.ExpressionKind;
+}
+export interface TSAnyKeyword extends Omit<TSType, "type"> {
+    type: "TSAnyKeyword";
+}
+export interface TSBigIntKeyword extends Omit<TSType, "type"> {
+    type: "TSBigIntKeyword";
+}
+export interface TSBooleanKeyword extends Omit<TSType, "type"> {
+    type: "TSBooleanKeyword";
+}
+export interface TSNeverKeyword extends Omit<TSType, "type"> {
+    type: "TSNeverKeyword";
+}
+export interface TSNullKeyword extends Omit<TSType, "type"> {
+    type: "TSNullKeyword";
+}
+export interface TSNumberKeyword extends Omit<TSType, "type"> {
+    type: "TSNumberKeyword";
+}
+export interface TSObjectKeyword extends Omit<TSType, "type"> {
+    type: "TSObjectKeyword";
+}
+export interface TSStringKeyword extends Omit<TSType, "type"> {
+    type: "TSStringKeyword";
+}
+export interface TSSymbolKeyword extends Omit<TSType, "type"> {
+    type: "TSSymbolKeyword";
+}
+export interface TSUndefinedKeyword extends Omit<TSType, "type"> {
+    type: "TSUndefinedKeyword";
+}
+export interface TSUnknownKeyword extends Omit<TSType, "type"> {
+    type: "TSUnknownKeyword";
+}
+export interface TSVoidKeyword extends Omit<TSType, "type"> {
+    type: "TSVoidKeyword";
+}
+export interface TSThisType extends Omit<TSType, "type"> {
+    type: "TSThisType";
+}
+export interface TSArrayType extends Omit<TSType, "type"> {
+    type: "TSArrayType";
+    elementType: K.TSTypeKind;
+}
+export interface TSLiteralType extends Omit<TSType, "type"> {
+    type: "TSLiteralType";
+    literal: K.NumericLiteralKind | K.StringLiteralKind | K.BooleanLiteralKind | K.TemplateLiteralKind | K.UnaryExpressionKind;
+}
+export interface TSUnionType extends Omit<TSType, "type"> {
+    type: "TSUnionType";
+    types: K.TSTypeKind[];
+}
+export interface TSIntersectionType extends Omit<TSType, "type"> {
+    type: "TSIntersectionType";
+    types: K.TSTypeKind[];
+}
+export interface TSConditionalType extends Omit<TSType, "type"> {
+    type: "TSConditionalType";
+    checkType: K.TSTypeKind;
+    extendsType: K.TSTypeKind;
+    trueType: K.TSTypeKind;
+    falseType: K.TSTypeKind;
+}
+export interface TSInferType extends Omit<TSType, "type"> {
+    type: "TSInferType";
+    typeParameter: K.TSTypeParameterKind;
+}
+export interface TSTypeParameter extends Omit<Identifier, "type" | "name"> {
+    type: "TSTypeParameter";
+    name: string;
+    constraint: K.TSTypeKind | undefined;
+    default: K.TSTypeKind | undefined;
+}
+export interface TSParenthesizedType extends Omit<TSType, "type"> {
+    type: "TSParenthesizedType";
+    typeAnnotation: K.TSTypeKind;
+}
+export interface TSFunctionType extends Omit<TSType, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+    type: "TSFunctionType";
+    parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+}
+export interface TSConstructorType extends Omit<TSType, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+    type: "TSConstructorType";
+    parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+}
+export interface TSDeclareFunction extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+    type: "TSDeclareFunction";
+    declare: boolean;
+    async: boolean;
+    generator: boolean;
+    id: K.IdentifierKind | null;
+    params: K.PatternKind[];
+    returnType: K.TSTypeAnnotationKind | K.NoopKind | null;
+}
+export interface TSDeclareMethod extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+    type: "TSDeclareMethod";
+    async: boolean;
+    generator: boolean;
+    params: K.PatternKind[];
+    abstract: boolean;
+    accessibility: "public" | "private" | "protected" | undefined;
+    static: boolean;
+    computed: boolean;
+    optional: boolean;
+    key: K.IdentifierKind | K.StringLiteralKind | K.NumericLiteralKind | K.ExpressionKind;
+    kind: "get" | "set" | "method" | "constructor";
+    access: "public" | "private" | "protected" | undefined;
+    decorators: K.DecoratorKind[] | null;
+    returnType: K.TSTypeAnnotationKind | K.NoopKind | null;
+}
+export interface TSMappedType extends Omit<TSType, "type"> {
+    type: "TSMappedType";
+    readonly: boolean | "+" | "-";
+    typeParameter: K.TSTypeParameterKind;
+    optional: boolean | "+" | "-";
+    typeAnnotation: K.TSTypeKind | null;
+}
+export interface TSTupleType extends Omit<TSType, "type"> {
+    type: "TSTupleType";
+    elementTypes: K.TSTypeKind[];
+}
+export interface TSRestType extends Omit<TSType, "type"> {
+    type: "TSRestType";
+    typeAnnotation: K.TSTypeKind;
+}
+export interface TSOptionalType extends Omit<TSType, "type"> {
+    type: "TSOptionalType";
+    typeAnnotation: K.TSTypeKind;
+}
+export interface TSIndexedAccessType extends Omit<TSType, "type"> {
+    type: "TSIndexedAccessType";
+    objectType: K.TSTypeKind;
+    indexType: K.TSTypeKind;
+}
+export interface TSTypeOperator extends Omit<TSType, "type"> {
+    type: "TSTypeOperator";
+    operator: string;
+    typeAnnotation: K.TSTypeKind;
+}
+export interface TSIndexSignature extends Omit<Declaration, "type">, TSHasOptionalTypeAnnotation {
+    type: "TSIndexSignature";
+    parameters: K.IdentifierKind[];
+    readonly: boolean;
+}
+export interface TSPropertySignature extends Omit<Declaration, "type">, TSHasOptionalTypeAnnotation {
+    type: "TSPropertySignature";
+    key: K.ExpressionKind;
+    computed: boolean;
+    readonly: boolean;
+    optional: boolean;
+    initializer: K.ExpressionKind | null;
+}
+export interface TSMethodSignature extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+    type: "TSMethodSignature";
+    key: K.ExpressionKind;
+    computed: boolean;
+    optional: boolean;
+    parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+}
+export interface TSTypePredicate extends Omit<TSTypeAnnotation, "type" | "typeAnnotation"> {
+    type: "TSTypePredicate";
+    parameterName: K.IdentifierKind | K.TSThisTypeKind;
+    typeAnnotation: K.TSTypeAnnotationKind;
+}
+export interface TSCallSignatureDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+    type: "TSCallSignatureDeclaration";
+    parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+}
+export interface TSConstructSignatureDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters, TSHasOptionalTypeAnnotation {
+    type: "TSConstructSignatureDeclaration";
+    parameters: (K.IdentifierKind | K.RestElementKind | K.ArrayPatternKind | K.ObjectPatternKind)[];
+}
+export interface TSEnumMember extends Omit<Node, "type"> {
+    type: "TSEnumMember";
+    id: K.IdentifierKind | K.StringLiteralKind;
+    initializer: K.ExpressionKind | null;
+}
+export interface TSTypeQuery extends Omit<TSType, "type"> {
+    type: "TSTypeQuery";
+    exprName: K.IdentifierKind | K.TSQualifiedNameKind | K.TSImportTypeKind;
+}
+export interface TSImportType extends Omit<TSType, "type">, TSHasOptionalTypeParameterInstantiation {
+    type: "TSImportType";
+    argument: K.StringLiteralKind;
+    qualifier: K.IdentifierKind | K.TSQualifiedNameKind | undefined;
+}
+export interface TSTypeLiteral extends Omit<TSType, "type"> {
+    type: "TSTypeLiteral";
+    members: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+}
+export interface TSTypeAssertion extends Omit<Expression, "type">, Omit<Pattern, "type"> {
+    type: "TSTypeAssertion";
+    typeAnnotation: K.TSTypeKind;
+    expression: K.ExpressionKind;
+    extra: {
+        parenthesized: boolean;
+    } | null;
+}
+export interface TSEnumDeclaration extends Omit<Declaration, "type"> {
+    type: "TSEnumDeclaration";
+    id: K.IdentifierKind;
+    const: boolean;
+    declare: boolean;
+    members: K.TSEnumMemberKind[];
+    initializer: K.ExpressionKind | null;
+}
+export interface TSTypeAliasDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+    type: "TSTypeAliasDeclaration";
+    id: K.IdentifierKind;
+    declare: boolean;
+    typeAnnotation: K.TSTypeKind;
+}
+export interface TSModuleBlock extends Omit<Node, "type"> {
+    type: "TSModuleBlock";
+    body: K.StatementKind[];
+}
+export interface TSModuleDeclaration extends Omit<Declaration, "type"> {
+    type: "TSModuleDeclaration";
+    id: K.StringLiteralKind | K.IdentifierKind | K.TSQualifiedNameKind;
+    declare: boolean;
+    global: boolean;
+    body: K.TSModuleBlockKind | K.TSModuleDeclarationKind | null;
+}
+export interface TSImportEqualsDeclaration extends Omit<Declaration, "type"> {
+    type: "TSImportEqualsDeclaration";
+    id: K.IdentifierKind;
+    isExport: boolean;
+    moduleReference: K.IdentifierKind | K.TSQualifiedNameKind | K.TSExternalModuleReferenceKind;
+}
+export interface TSExternalModuleReference extends Omit<Declaration, "type"> {
+    type: "TSExternalModuleReference";
+    expression: K.StringLiteralKind;
+}
+export interface TSExportAssignment extends Omit<Statement, "type"> {
+    type: "TSExportAssignment";
+    expression: K.ExpressionKind;
+}
+export interface TSNamespaceExportDeclaration extends Omit<Declaration, "type"> {
+    type: "TSNamespaceExportDeclaration";
+    id: K.IdentifierKind;
+}
+export interface TSInterfaceBody extends Omit<Node, "type"> {
+    type: "TSInterfaceBody";
+    body: (K.TSCallSignatureDeclarationKind | K.TSConstructSignatureDeclarationKind | K.TSIndexSignatureKind | K.TSMethodSignatureKind | K.TSPropertySignatureKind)[];
+}
+export interface TSInterfaceDeclaration extends Omit<Declaration, "type">, TSHasOptionalTypeParameters {
+    type: "TSInterfaceDeclaration";
+    id: K.IdentifierKind | K.TSQualifiedNameKind;
+    declare: boolean;
+    extends: K.TSExpressionWithTypeArgumentsKind[] | null;
+    body: K.TSInterfaceBodyKind;
+}
+export interface TSParameterProperty extends Omit<Pattern, "type"> {
+    type: "TSParameterProperty";
+    accessibility: "public" | "private" | "protected" | undefined;
+    readonly: boolean;
+    parameter: K.IdentifierKind | K.AssignmentPatternKind;
+}
+export interface OptionalMemberExpression extends Omit<MemberExpression, "type"> {
+    type: "OptionalMemberExpression";
+    optional: boolean;
+}
+export interface OptionalCallExpression extends Omit<CallExpression, "type"> {
+    type: "OptionalCallExpression";
+    optional: boolean;
+}
+export declare type ASTNode = File | Program | Identifier | BlockStatement | EmptyStatement | ExpressionStatement | IfStatement | LabeledStatement | BreakStatement | ContinueStatement | WithStatement | SwitchStatement | SwitchCase | ReturnStatement | ThrowStatement | TryStatement | CatchClause | WhileStatement | DoWhileStatement | ForStatement | VariableDeclaration | ForInStatement | DebuggerStatement | FunctionDeclaration | FunctionExpression | VariableDeclarator | ThisExpression | ArrayExpression | ObjectExpression | Property | Literal | SequenceExpression | UnaryExpression | BinaryExpression | AssignmentExpression | MemberExpression | UpdateExpression | LogicalExpression | ConditionalExpression | NewExpression | CallExpression | RestElement | TypeAnnotation | TSTypeAnnotation | SpreadElementPattern | ArrowFunctionExpression | ForOfStatement | YieldExpression | GeneratorExpression | ComprehensionBlock | ComprehensionExpression | ObjectProperty | PropertyPattern | ObjectPattern | ArrayPattern | MethodDefinition | SpreadElement | AssignmentPattern | ClassPropertyDefinition | ClassProperty | ClassBody | ClassDeclaration | ClassExpression | ImportSpecifier | ImportNamespaceSpecifier | ImportDefaultSpecifier | ImportDeclaration | TaggedTemplateExpression | TemplateLiteral | TemplateElement | SpreadProperty | SpreadPropertyPattern | AwaitExpression | JSXAttribute | JSXIdentifier | JSXNamespacedName | JSXExpressionContainer | JSXMemberExpression | JSXSpreadAttribute | JSXElement | JSXOpeningElement | JSXClosingElement | JSXFragment | JSXText | JSXOpeningFragment | JSXClosingFragment | JSXEmptyExpression | JSXSpreadChild | TypeParameterDeclaration | TSTypeParameterDeclaration | TypeParameterInstantiation | TSTypeParameterInstantiation | ClassImplements | TSExpressionWithTypeArguments | AnyTypeAnnotation | EmptyTypeAnnotation | MixedTypeAnnotation | VoidTypeAnnotation | NumberTypeAnnotation | NumberLiteralTypeAnnotation | NumericLiteralTypeAnnotation | StringTypeAnnotation | StringLiteralTypeAnnotation | BooleanTypeAnnotation | BooleanLiteralTypeAnnotation | NullableTypeAnnotation | NullLiteralTypeAnnotation | NullTypeAnnotation | ThisTypeAnnotation | ExistsTypeAnnotation | ExistentialTypeParam | FunctionTypeAnnotation | FunctionTypeParam | ArrayTypeAnnotation | ObjectTypeAnnotation | ObjectTypeProperty | ObjectTypeSpreadProperty | ObjectTypeIndexer | ObjectTypeCallProperty | ObjectTypeInternalSlot | Variance | QualifiedTypeIdentifier | GenericTypeAnnotation | MemberTypeAnnotation | UnionTypeAnnotation | IntersectionTypeAnnotation | TypeofTypeAnnotation | TypeParameter | InterfaceTypeAnnotation | InterfaceExtends | InterfaceDeclaration | DeclareInterface | TypeAlias | OpaqueType | DeclareTypeAlias | DeclareOpaqueType | TypeCastExpression | TupleTypeAnnotation | DeclareVariable | DeclareFunction | DeclareClass | DeclareModule | DeclareModuleExports | DeclareExportDeclaration | ExportSpecifier | ExportBatchSpecifier | DeclareExportAllDeclaration | InferredPredicate | DeclaredPredicate | ExportDeclaration | Block | Line | Noop | DoExpression | Super | BindExpression | Decorator | MetaProperty | ParenthesizedExpression | ExportDefaultDeclaration | ExportNamedDeclaration | ExportNamespaceSpecifier | ExportDefaultSpecifier | ExportAllDeclaration | CommentBlock | CommentLine | Directive | DirectiveLiteral | InterpreterDirective | StringLiteral | NumericLiteral | BigIntLiteral | NullLiteral | BooleanLiteral | RegExpLiteral | ObjectMethod | ClassPrivateProperty | ClassMethod | ClassPrivateMethod | PrivateName | RestProperty | ForAwaitStatement | Import | TSQualifiedName | TSTypeReference | TSAsExpression | TSNonNullExpression | TSAnyKeyword | TSBigIntKeyword | TSBooleanKeyword | TSNeverKeyword | TSNullKeyword | TSNumberKeyword | TSObjectKeyword | TSStringKeyword | TSSymbolKeyword | TSUndefinedKeyword | TSUnknownKeyword | TSVoidKeyword | TSThisType | TSArrayType | TSLiteralType | TSUnionType | TSIntersectionType | TSConditionalType | TSInferType | TSTypeParameter | TSParenthesizedType | TSFunctionType | TSConstructorType | TSDeclareFunction | TSDeclareMethod | TSMappedType | TSTupleType | TSRestType | TSOptionalType | TSIndexedAccessType | TSTypeOperator | TSIndexSignature | TSPropertySignature | TSMethodSignature | TSTypePredicate | TSCallSignatureDeclaration | TSConstructSignatureDeclaration | TSEnumMember | TSTypeQuery | TSImportType | TSTypeLiteral | TSTypeAssertion | TSEnumDeclaration | TSTypeAliasDeclaration | TSModuleBlock | TSModuleDeclaration | TSImportEqualsDeclaration | TSExternalModuleReference | TSExportAssignment | TSNamespaceExportDeclaration | TSInterfaceBody | TSInterfaceDeclaration | TSParameterProperty | OptionalMemberExpression | OptionalCallExpression;
diff --git a/node_modules/ast-types/gen/nodes.js b/node_modules/ast-types/gen/nodes.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ast-types/gen/nodes.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ast-types/gen/visitor.d.ts b/node_modules/ast-types/gen/visitor.d.ts
new file mode 100644
index 0000000..ec29154
--- /dev/null
+++ b/node_modules/ast-types/gen/visitor.d.ts
@@ -0,0 +1,266 @@
+import { NodePath } from "../lib/node-path";
+import { Context } from "../lib/path-visitor";
+import { namedTypes } from "./namedTypes";
+export interface Visitor<M = {}> {
+    visitPrintable?(this: Context & M, path: NodePath<namedTypes.Printable>): any;
+    visitSourceLocation?(this: Context & M, path: NodePath<namedTypes.SourceLocation>): any;
+    visitNode?(this: Context & M, path: NodePath<namedTypes.Node>): any;
+    visitComment?(this: Context & M, path: NodePath<namedTypes.Comment>): any;
+    visitPosition?(this: Context & M, path: NodePath<namedTypes.Position>): any;
+    visitFile?(this: Context & M, path: NodePath<namedTypes.File>): any;
+    visitProgram?(this: Context & M, path: NodePath<namedTypes.Program>): any;
+    visitStatement?(this: Context & M, path: NodePath<namedTypes.Statement>): any;
+    visitFunction?(this: Context & M, path: NodePath<namedTypes.Function>): any;
+    visitExpression?(this: Context & M, path: NodePath<namedTypes.Expression>): any;
+    visitPattern?(this: Context & M, path: NodePath<namedTypes.Pattern>): any;
+    visitIdentifier?(this: Context & M, path: NodePath<namedTypes.Identifier>): any;
+    visitBlockStatement?(this: Context & M, path: NodePath<namedTypes.BlockStatement>): any;
+    visitEmptyStatement?(this: Context & M, path: NodePath<namedTypes.EmptyStatement>): any;
+    visitExpressionStatement?(this: Context & M, path: NodePath<namedTypes.ExpressionStatement>): any;
+    visitIfStatement?(this: Context & M, path: NodePath<namedTypes.IfStatement>): any;
+    visitLabeledStatement?(this: Context & M, path: NodePath<namedTypes.LabeledStatement>): any;
+    visitBreakStatement?(this: Context & M, path: NodePath<namedTypes.BreakStatement>): any;
+    visitContinueStatement?(this: Context & M, path: NodePath<namedTypes.ContinueStatement>): any;
+    visitWithStatement?(this: Context & M, path: NodePath<namedTypes.WithStatement>): any;
+    visitSwitchStatement?(this: Context & M, path: NodePath<namedTypes.SwitchStatement>): any;
+    visitSwitchCase?(this: Context & M, path: NodePath<namedTypes.SwitchCase>): any;
+    visitReturnStatement?(this: Context & M, path: NodePath<namedTypes.ReturnStatement>): any;
+    visitThrowStatement?(this: Context & M, path: NodePath<namedTypes.ThrowStatement>): any;
+    visitTryStatement?(this: Context & M, path: NodePath<namedTypes.TryStatement>): any;
+    visitCatchClause?(this: Context & M, path: NodePath<namedTypes.CatchClause>): any;
+    visitWhileStatement?(this: Context & M, path: NodePath<namedTypes.WhileStatement>): any;
+    visitDoWhileStatement?(this: Context & M, path: NodePath<namedTypes.DoWhileStatement>): any;
+    visitForStatement?(this: Context & M, path: NodePath<namedTypes.ForStatement>): any;
+    visitDeclaration?(this: Context & M, path: NodePath<namedTypes.Declaration>): any;
+    visitVariableDeclaration?(this: Context & M, path: NodePath<namedTypes.VariableDeclaration>): any;
+    visitForInStatement?(this: Context & M, path: NodePath<namedTypes.ForInStatement>): any;
+    visitDebuggerStatement?(this: Context & M, path: NodePath<namedTypes.DebuggerStatement>): any;
+    visitFunctionDeclaration?(this: Context & M, path: NodePath<namedTypes.FunctionDeclaration>): any;
+    visitFunctionExpression?(this: Context & M, path: NodePath<namedTypes.FunctionExpression>): any;
+    visitVariableDeclarator?(this: Context & M, path: NodePath<namedTypes.VariableDeclarator>): any;
+    visitThisExpression?(this: Context & M, path: NodePath<namedTypes.ThisExpression>): any;
+    visitArrayExpression?(this: Context & M, path: NodePath<namedTypes.ArrayExpression>): any;
+    visitObjectExpression?(this: Context & M, path: NodePath<namedTypes.ObjectExpression>): any;
+    visitProperty?(this: Context & M, path: NodePath<namedTypes.Property>): any;
+    visitLiteral?(this: Context & M, path: NodePath<namedTypes.Literal>): any;
+    visitSequenceExpression?(this: Context & M, path: NodePath<namedTypes.SequenceExpression>): any;
+    visitUnaryExpression?(this: Context & M, path: NodePath<namedTypes.UnaryExpression>): any;
+    visitBinaryExpression?(this: Context & M, path: NodePath<namedTypes.BinaryExpression>): any;
+    visitAssignmentExpression?(this: Context & M, path: NodePath<namedTypes.AssignmentExpression>): any;
+    visitMemberExpression?(this: Context & M, path: NodePath<namedTypes.MemberExpression>): any;
+    visitUpdateExpression?(this: Context & M, path: NodePath<namedTypes.UpdateExpression>): any;
+    visitLogicalExpression?(this: Context & M, path: NodePath<namedTypes.LogicalExpression>): any;
+    visitConditionalExpression?(this: Context & M, path: NodePath<namedTypes.ConditionalExpression>): any;
+    visitNewExpression?(this: Context & M, path: NodePath<namedTypes.NewExpression>): any;
+    visitCallExpression?(this: Context & M, path: NodePath<namedTypes.CallExpression>): any;
+    visitRestElement?(this: Context & M, path: NodePath<namedTypes.RestElement>): any;
+    visitTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.TypeAnnotation>): any;
+    visitTSTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.TSTypeAnnotation>): any;
+    visitSpreadElementPattern?(this: Context & M, path: NodePath<namedTypes.SpreadElementPattern>): any;
+    visitArrowFunctionExpression?(this: Context & M, path: NodePath<namedTypes.ArrowFunctionExpression>): any;
+    visitForOfStatement?(this: Context & M, path: NodePath<namedTypes.ForOfStatement>): any;
+    visitYieldExpression?(this: Context & M, path: NodePath<namedTypes.YieldExpression>): any;
+    visitGeneratorExpression?(this: Context & M, path: NodePath<namedTypes.GeneratorExpression>): any;
+    visitComprehensionBlock?(this: Context & M, path: NodePath<namedTypes.ComprehensionBlock>): any;
+    visitComprehensionExpression?(this: Context & M, path: NodePath<namedTypes.ComprehensionExpression>): any;
+    visitObjectProperty?(this: Context & M, path: NodePath<namedTypes.ObjectProperty>): any;
+    visitPropertyPattern?(this: Context & M, path: NodePath<namedTypes.PropertyPattern>): any;
+    visitObjectPattern?(this: Context & M, path: NodePath<namedTypes.ObjectPattern>): any;
+    visitArrayPattern?(this: Context & M, path: NodePath<namedTypes.ArrayPattern>): any;
+    visitMethodDefinition?(this: Context & M, path: NodePath<namedTypes.MethodDefinition>): any;
+    visitSpreadElement?(this: Context & M, path: NodePath<namedTypes.SpreadElement>): any;
+    visitAssignmentPattern?(this: Context & M, path: NodePath<namedTypes.AssignmentPattern>): any;
+    visitClassPropertyDefinition?(this: Context & M, path: NodePath<namedTypes.ClassPropertyDefinition>): any;
+    visitClassProperty?(this: Context & M, path: NodePath<namedTypes.ClassProperty>): any;
+    visitClassBody?(this: Context & M, path: NodePath<namedTypes.ClassBody>): any;
+    visitClassDeclaration?(this: Context & M, path: NodePath<namedTypes.ClassDeclaration>): any;
+    visitClassExpression?(this: Context & M, path: NodePath<namedTypes.ClassExpression>): any;
+    visitSpecifier?(this: Context & M, path: NodePath<namedTypes.Specifier>): any;
+    visitModuleSpecifier?(this: Context & M, path: NodePath<namedTypes.ModuleSpecifier>): any;
+    visitImportSpecifier?(this: Context & M, path: NodePath<namedTypes.ImportSpecifier>): any;
+    visitImportNamespaceSpecifier?(this: Context & M, path: NodePath<namedTypes.ImportNamespaceSpecifier>): any;
+    visitImportDefaultSpecifier?(this: Context & M, path: NodePath<namedTypes.ImportDefaultSpecifier>): any;
+    visitImportDeclaration?(this: Context & M, path: NodePath<namedTypes.ImportDeclaration>): any;
+    visitTaggedTemplateExpression?(this: Context & M, path: NodePath<namedTypes.TaggedTemplateExpression>): any;
+    visitTemplateLiteral?(this: Context & M, path: NodePath<namedTypes.TemplateLiteral>): any;
+    visitTemplateElement?(this: Context & M, path: NodePath<namedTypes.TemplateElement>): any;
+    visitSpreadProperty?(this: Context & M, path: NodePath<namedTypes.SpreadProperty>): any;
+    visitSpreadPropertyPattern?(this: Context & M, path: NodePath<namedTypes.SpreadPropertyPattern>): any;
+    visitAwaitExpression?(this: Context & M, path: NodePath<namedTypes.AwaitExpression>): any;
+    visitJSXAttribute?(this: Context & M, path: NodePath<namedTypes.JSXAttribute>): any;
+    visitJSXIdentifier?(this: Context & M, path: NodePath<namedTypes.JSXIdentifier>): any;
+    visitJSXNamespacedName?(this: Context & M, path: NodePath<namedTypes.JSXNamespacedName>): any;
+    visitJSXExpressionContainer?(this: Context & M, path: NodePath<namedTypes.JSXExpressionContainer>): any;
+    visitJSXMemberExpression?(this: Context & M, path: NodePath<namedTypes.JSXMemberExpression>): any;
+    visitJSXSpreadAttribute?(this: Context & M, path: NodePath<namedTypes.JSXSpreadAttribute>): any;
+    visitJSXElement?(this: Context & M, path: NodePath<namedTypes.JSXElement>): any;
+    visitJSXOpeningElement?(this: Context & M, path: NodePath<namedTypes.JSXOpeningElement>): any;
+    visitJSXClosingElement?(this: Context & M, path: NodePath<namedTypes.JSXClosingElement>): any;
+    visitJSXFragment?(this: Context & M, path: NodePath<namedTypes.JSXFragment>): any;
+    visitJSXText?(this: Context & M, path: NodePath<namedTypes.JSXText>): any;
+    visitJSXOpeningFragment?(this: Context & M, path: NodePath<namedTypes.JSXOpeningFragment>): any;
+    visitJSXClosingFragment?(this: Context & M, path: NodePath<namedTypes.JSXClosingFragment>): any;
+    visitJSXEmptyExpression?(this: Context & M, path: NodePath<namedTypes.JSXEmptyExpression>): any;
+    visitJSXSpreadChild?(this: Context & M, path: NodePath<namedTypes.JSXSpreadChild>): any;
+    visitTypeParameterDeclaration?(this: Context & M, path: NodePath<namedTypes.TypeParameterDeclaration>): any;
+    visitTSTypeParameterDeclaration?(this: Context & M, path: NodePath<namedTypes.TSTypeParameterDeclaration>): any;
+    visitTypeParameterInstantiation?(this: Context & M, path: NodePath<namedTypes.TypeParameterInstantiation>): any;
+    visitTSTypeParameterInstantiation?(this: Context & M, path: NodePath<namedTypes.TSTypeParameterInstantiation>): any;
+    visitClassImplements?(this: Context & M, path: NodePath<namedTypes.ClassImplements>): any;
+    visitTSType?(this: Context & M, path: NodePath<namedTypes.TSType>): any;
+    visitTSHasOptionalTypeParameterInstantiation?(this: Context & M, path: NodePath<namedTypes.TSHasOptionalTypeParameterInstantiation>): any;
+    visitTSExpressionWithTypeArguments?(this: Context & M, path: NodePath<namedTypes.TSExpressionWithTypeArguments>): any;
+    visitFlow?(this: Context & M, path: NodePath<namedTypes.Flow>): any;
+    visitFlowType?(this: Context & M, path: NodePath<namedTypes.FlowType>): any;
+    visitAnyTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.AnyTypeAnnotation>): any;
+    visitEmptyTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.EmptyTypeAnnotation>): any;
+    visitMixedTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.MixedTypeAnnotation>): any;
+    visitVoidTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.VoidTypeAnnotation>): any;
+    visitNumberTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NumberTypeAnnotation>): any;
+    visitNumberLiteralTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NumberLiteralTypeAnnotation>): any;
+    visitNumericLiteralTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NumericLiteralTypeAnnotation>): any;
+    visitStringTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.StringTypeAnnotation>): any;
+    visitStringLiteralTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.StringLiteralTypeAnnotation>): any;
+    visitBooleanTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.BooleanTypeAnnotation>): any;
+    visitBooleanLiteralTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.BooleanLiteralTypeAnnotation>): any;
+    visitNullableTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NullableTypeAnnotation>): any;
+    visitNullLiteralTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NullLiteralTypeAnnotation>): any;
+    visitNullTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.NullTypeAnnotation>): any;
+    visitThisTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.ThisTypeAnnotation>): any;
+    visitExistsTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.ExistsTypeAnnotation>): any;
+    visitExistentialTypeParam?(this: Context & M, path: NodePath<namedTypes.ExistentialTypeParam>): any;
+    visitFunctionTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.FunctionTypeAnnotation>): any;
+    visitFunctionTypeParam?(this: Context & M, path: NodePath<namedTypes.FunctionTypeParam>): any;
+    visitArrayTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.ArrayTypeAnnotation>): any;
+    visitObjectTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.ObjectTypeAnnotation>): any;
+    visitObjectTypeProperty?(this: Context & M, path: NodePath<namedTypes.ObjectTypeProperty>): any;
+    visitObjectTypeSpreadProperty?(this: Context & M, path: NodePath<namedTypes.ObjectTypeSpreadProperty>): any;
+    visitObjectTypeIndexer?(this: Context & M, path: NodePath<namedTypes.ObjectTypeIndexer>): any;
+    visitObjectTypeCallProperty?(this: Context & M, path: NodePath<namedTypes.ObjectTypeCallProperty>): any;
+    visitObjectTypeInternalSlot?(this: Context & M, path: NodePath<namedTypes.ObjectTypeInternalSlot>): any;
+    visitVariance?(this: Context & M, path: NodePath<namedTypes.Variance>): any;
+    visitQualifiedTypeIdentifier?(this: Context & M, path: NodePath<namedTypes.QualifiedTypeIdentifier>): any;
+    visitGenericTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.GenericTypeAnnotation>): any;
+    visitMemberTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.MemberTypeAnnotation>): any;
+    visitUnionTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.UnionTypeAnnotation>): any;
+    visitIntersectionTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.IntersectionTypeAnnotation>): any;
+    visitTypeofTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.TypeofTypeAnnotation>): any;
+    visitTypeParameter?(this: Context & M, path: NodePath<namedTypes.TypeParameter>): any;
+    visitInterfaceTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.InterfaceTypeAnnotation>): any;
+    visitInterfaceExtends?(this: Context & M, path: NodePath<namedTypes.InterfaceExtends>): any;
+    visitInterfaceDeclaration?(this: Context & M, path: NodePath<namedTypes.InterfaceDeclaration>): any;
+    visitDeclareInterface?(this: Context & M, path: NodePath<namedTypes.DeclareInterface>): any;
+    visitTypeAlias?(this: Context & M, path: NodePath<namedTypes.TypeAlias>): any;
+    visitOpaqueType?(this: Context & M, path: NodePath<namedTypes.OpaqueType>): any;
+    visitDeclareTypeAlias?(this: Context & M, path: NodePath<namedTypes.DeclareTypeAlias>): any;
+    visitDeclareOpaqueType?(this: Context & M, path: NodePath<namedTypes.DeclareOpaqueType>): any;
+    visitTypeCastExpression?(this: Context & M, path: NodePath<namedTypes.TypeCastExpression>): any;
+    visitTupleTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.TupleTypeAnnotation>): any;
+    visitDeclareVariable?(this: Context & M, path: NodePath<namedTypes.DeclareVariable>): any;
+    visitDeclareFunction?(this: Context & M, path: NodePath<namedTypes.DeclareFunction>): any;
+    visitDeclareClass?(this: Context & M, path: NodePath<namedTypes.DeclareClass>): any;
+    visitDeclareModule?(this: Context & M, path: NodePath<namedTypes.DeclareModule>): any;
+    visitDeclareModuleExports?(this: Context & M, path: NodePath<namedTypes.DeclareModuleExports>): any;
+    visitDeclareExportDeclaration?(this: Context & M, path: NodePath<namedTypes.DeclareExportDeclaration>): any;
+    visitExportSpecifier?(this: Context & M, path: NodePath<namedTypes.ExportSpecifier>): any;
+    visitExportBatchSpecifier?(this: Context & M, path: NodePath<namedTypes.ExportBatchSpecifier>): any;
+    visitDeclareExportAllDeclaration?(this: Context & M, path: NodePath<namedTypes.DeclareExportAllDeclaration>): any;
+    visitFlowPredicate?(this: Context & M, path: NodePath<namedTypes.FlowPredicate>): any;
+    visitInferredPredicate?(this: Context & M, path: NodePath<namedTypes.InferredPredicate>): any;
+    visitDeclaredPredicate?(this: Context & M, path: NodePath<namedTypes.DeclaredPredicate>): any;
+    visitExportDeclaration?(this: Context & M, path: NodePath<namedTypes.ExportDeclaration>): any;
+    visitBlock?(this: Context & M, path: NodePath<namedTypes.Block>): any;
+    visitLine?(this: Context & M, path: NodePath<namedTypes.Line>): any;
+    visitNoop?(this: Context & M, path: NodePath<namedTypes.Noop>): any;
+    visitDoExpression?(this: Context & M, path: NodePath<namedTypes.DoExpression>): any;
+    visitSuper?(this: Context & M, path: NodePath<namedTypes.Super>): any;
+    visitBindExpression?(this: Context & M, path: NodePath<namedTypes.BindExpression>): any;
+    visitDecorator?(this: Context & M, path: NodePath<namedTypes.Decorator>): any;
+    visitMetaProperty?(this: Context & M, path: NodePath<namedTypes.MetaProperty>): any;
+    visitParenthesizedExpression?(this: Context & M, path: NodePath<namedTypes.ParenthesizedExpression>): any;
+    visitExportDefaultDeclaration?(this: Context & M, path: NodePath<namedTypes.ExportDefaultDeclaration>): any;
+    visitExportNamedDeclaration?(this: Context & M, path: NodePath<namedTypes.ExportNamedDeclaration>): any;
+    visitExportNamespaceSpecifier?(this: Context & M, path: NodePath<namedTypes.ExportNamespaceSpecifier>): any;
+    visitExportDefaultSpecifier?(this: Context & M, path: NodePath<namedTypes.ExportDefaultSpecifier>): any;
+    visitExportAllDeclaration?(this: Context & M, path: NodePath<namedTypes.ExportAllDeclaration>): any;
+    visitCommentBlock?(this: Context & M, path: NodePath<namedTypes.CommentBlock>): any;
+    visitCommentLine?(this: Context & M, path: NodePath<namedTypes.CommentLine>): any;
+    visitDirective?(this: Context & M, path: NodePath<namedTypes.Directive>): any;
+    visitDirectiveLiteral?(this: Context & M, path: NodePath<namedTypes.DirectiveLiteral>): any;
+    visitInterpreterDirective?(this: Context & M, path: NodePath<namedTypes.InterpreterDirective>): any;
+    visitStringLiteral?(this: Context & M, path: NodePath<namedTypes.StringLiteral>): any;
+    visitNumericLiteral?(this: Context & M, path: NodePath<namedTypes.NumericLiteral>): any;
+    visitBigIntLiteral?(this: Context & M, path: NodePath<namedTypes.BigIntLiteral>): any;
+    visitNullLiteral?(this: Context & M, path: NodePath<namedTypes.NullLiteral>): any;
+    visitBooleanLiteral?(this: Context & M, path: NodePath<namedTypes.BooleanLiteral>): any;
+    visitRegExpLiteral?(this: Context & M, path: NodePath<namedTypes.RegExpLiteral>): any;
+    visitObjectMethod?(this: Context & M, path: NodePath<namedTypes.ObjectMethod>): any;
+    visitClassPrivateProperty?(this: Context & M, path: NodePath<namedTypes.ClassPrivateProperty>): any;
+    visitClassMethod?(this: Context & M, path: NodePath<namedTypes.ClassMethod>): any;
+    visitClassPrivateMethod?(this: Context & M, path: NodePath<namedTypes.ClassPrivateMethod>): any;
+    visitPrivateName?(this: Context & M, path: NodePath<namedTypes.PrivateName>): any;
+    visitRestProperty?(this: Context & M, path: NodePath<namedTypes.RestProperty>): any;
+    visitForAwaitStatement?(this: Context & M, path: NodePath<namedTypes.ForAwaitStatement>): any;
+    visitImport?(this: Context & M, path: NodePath<namedTypes.Import>): any;
+    visitTSQualifiedName?(this: Context & M, path: NodePath<namedTypes.TSQualifiedName>): any;
+    visitTSTypeReference?(this: Context & M, path: NodePath<namedTypes.TSTypeReference>): any;
+    visitTSHasOptionalTypeParameters?(this: Context & M, path: NodePath<namedTypes.TSHasOptionalTypeParameters>): any;
+    visitTSHasOptionalTypeAnnotation?(this: Context & M, path: NodePath<namedTypes.TSHasOptionalTypeAnnotation>): any;
+    visitTSAsExpression?(this: Context & M, path: NodePath<namedTypes.TSAsExpression>): any;
+    visitTSNonNullExpression?(this: Context & M, path: NodePath<namedTypes.TSNonNullExpression>): any;
+    visitTSAnyKeyword?(this: Context & M, path: NodePath<namedTypes.TSAnyKeyword>): any;
+    visitTSBigIntKeyword?(this: Context & M, path: NodePath<namedTypes.TSBigIntKeyword>): any;
+    visitTSBooleanKeyword?(this: Context & M, path: NodePath<namedTypes.TSBooleanKeyword>): any;
+    visitTSNeverKeyword?(this: Context & M, path: NodePath<namedTypes.TSNeverKeyword>): any;
+    visitTSNullKeyword?(this: Context & M, path: NodePath<namedTypes.TSNullKeyword>): any;
+    visitTSNumberKeyword?(this: Context & M, path: NodePath<namedTypes.TSNumberKeyword>): any;
+    visitTSObjectKeyword?(this: Context & M, path: NodePath<namedTypes.TSObjectKeyword>): any;
+    visitTSStringKeyword?(this: Context & M, path: NodePath<namedTypes.TSStringKeyword>): any;
+    visitTSSymbolKeyword?(this: Context & M, path: NodePath<namedTypes.TSSymbolKeyword>): any;
+    visitTSUndefinedKeyword?(this: Context & M, path: NodePath<namedTypes.TSUndefinedKeyword>): any;
+    visitTSUnknownKeyword?(this: Context & M, path: NodePath<namedTypes.TSUnknownKeyword>): any;
+    visitTSVoidKeyword?(this: Context & M, path: NodePath<namedTypes.TSVoidKeyword>): any;
+    visitTSThisType?(this: Context & M, path: NodePath<namedTypes.TSThisType>): any;
+    visitTSArrayType?(this: Context & M, path: NodePath<namedTypes.TSArrayType>): any;
+    visitTSLiteralType?(this: Context & M, path: NodePath<namedTypes.TSLiteralType>): any;
+    visitTSUnionType?(this: Context & M, path: NodePath<namedTypes.TSUnionType>): any;
+    visitTSIntersectionType?(this: Context & M, path: NodePath<namedTypes.TSIntersectionType>): any;
+    visitTSConditionalType?(this: Context & M, path: NodePath<namedTypes.TSConditionalType>): any;
+    visitTSInferType?(this: Context & M, path: NodePath<namedTypes.TSInferType>): any;
+    visitTSTypeParameter?(this: Context & M, path: NodePath<namedTypes.TSTypeParameter>): any;
+    visitTSParenthesizedType?(this: Context & M, path: NodePath<namedTypes.TSParenthesizedType>): any;
+    visitTSFunctionType?(this: Context & M, path: NodePath<namedTypes.TSFunctionType>): any;
+    visitTSConstructorType?(this: Context & M, path: NodePath<namedTypes.TSConstructorType>): any;
+    visitTSDeclareFunction?(this: Context & M, path: NodePath<namedTypes.TSDeclareFunction>): any;
+    visitTSDeclareMethod?(this: Context & M, path: NodePath<namedTypes.TSDeclareMethod>): any;
+    visitTSMappedType?(this: Context & M, path: NodePath<namedTypes.TSMappedType>): any;
+    visitTSTupleType?(this: Context & M, path: NodePath<namedTypes.TSTupleType>): any;
+    visitTSRestType?(this: Context & M, path: NodePath<namedTypes.TSRestType>): any;
+    visitTSOptionalType?(this: Context & M, path: NodePath<namedTypes.TSOptionalType>): any;
+    visitTSIndexedAccessType?(this: Context & M, path: NodePath<namedTypes.TSIndexedAccessType>): any;
+    visitTSTypeOperator?(this: Context & M, path: NodePath<namedTypes.TSTypeOperator>): any;
+    visitTSIndexSignature?(this: Context & M, path: NodePath<namedTypes.TSIndexSignature>): any;
+    visitTSPropertySignature?(this: Context & M, path: NodePath<namedTypes.TSPropertySignature>): any;
+    visitTSMethodSignature?(this: Context & M, path: NodePath<namedTypes.TSMethodSignature>): any;
+    visitTSTypePredicate?(this: Context & M, path: NodePath<namedTypes.TSTypePredicate>): any;
+    visitTSCallSignatureDeclaration?(this: Context & M, path: NodePath<namedTypes.TSCallSignatureDeclaration>): any;
+    visitTSConstructSignatureDeclaration?(this: Context & M, path: NodePath<namedTypes.TSConstructSignatureDeclaration>): any;
+    visitTSEnumMember?(this: Context & M, path: NodePath<namedTypes.TSEnumMember>): any;
+    visitTSTypeQuery?(this: Context & M, path: NodePath<namedTypes.TSTypeQuery>): any;
+    visitTSImportType?(this: Context & M, path: NodePath<namedTypes.TSImportType>): any;
+    visitTSTypeLiteral?(this: Context & M, path: NodePath<namedTypes.TSTypeLiteral>): any;
+    visitTSTypeAssertion?(this: Context & M, path: NodePath<namedTypes.TSTypeAssertion>): any;
+    visitTSEnumDeclaration?(this: Context & M, path: NodePath<namedTypes.TSEnumDeclaration>): any;
+    visitTSTypeAliasDeclaration?(this: Context & M, path: NodePath<namedTypes.TSTypeAliasDeclaration>): any;
+    visitTSModuleBlock?(this: Context & M, path: NodePath<namedTypes.TSModuleBlock>): any;
+    visitTSModuleDeclaration?(this: Context & M, path: NodePath<namedTypes.TSModuleDeclaration>): any;
+    visitTSImportEqualsDeclaration?(this: Context & M, path: NodePath<namedTypes.TSImportEqualsDeclaration>): any;
+    visitTSExternalModuleReference?(this: Context & M, path: NodePath<namedTypes.TSExternalModuleReference>): any;
+    visitTSExportAssignment?(this: Context & M, path: NodePath<namedTypes.TSExportAssignment>): any;
+    visitTSNamespaceExportDeclaration?(this: Context & M, path: NodePath<namedTypes.TSNamespaceExportDeclaration>): any;
+    visitTSInterfaceBody?(this: Context & M, path: NodePath<namedTypes.TSInterfaceBody>): any;
+    visitTSInterfaceDeclaration?(this: Context & M, path: NodePath<namedTypes.TSInterfaceDeclaration>): any;
+    visitTSParameterProperty?(this: Context & M, path: NodePath<namedTypes.TSParameterProperty>): any;
+    visitOptionalMemberExpression?(this: Context & M, path: NodePath<namedTypes.OptionalMemberExpression>): any;
+    visitOptionalCallExpression?(this: Context & M, path: NodePath<namedTypes.OptionalCallExpression>): any;
+}
diff --git a/node_modules/ast-types/gen/visitor.js b/node_modules/ast-types/gen/visitor.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ast-types/gen/visitor.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ast-types/lib/equiv.d.ts b/node_modules/ast-types/lib/equiv.d.ts
new file mode 100644
index 0000000..bbc9e70
--- /dev/null
+++ b/node_modules/ast-types/lib/equiv.d.ts
@@ -0,0 +1,5 @@
+import { Fork } from "../types";
+export default function (fork: Fork): {
+    (a: any, b: any, problemPath?: any): boolean;
+    assert(a: any, b: any): void;
+};
diff --git a/node_modules/ast-types/lib/equiv.js b/node_modules/ast-types/lib/equiv.js
new file mode 100644
index 0000000..758c233
--- /dev/null
+++ b/node_modules/ast-types/lib/equiv.js
@@ -0,0 +1,156 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+function default_1(fork) {
+    var types = fork.use(types_1.default);
+    var getFieldNames = types.getFieldNames;
+    var getFieldValue = types.getFieldValue;
+    var isArray = types.builtInTypes.array;
+    var isObject = types.builtInTypes.object;
+    var isDate = types.builtInTypes.Date;
+    var isRegExp = types.builtInTypes.RegExp;
+    var hasOwn = Object.prototype.hasOwnProperty;
+    function astNodesAreEquivalent(a, b, problemPath) {
+        if (isArray.check(problemPath)) {
+            problemPath.length = 0;
+        }
+        else {
+            problemPath = null;
+        }
+        return areEquivalent(a, b, problemPath);
+    }
+    astNodesAreEquivalent.assert = function (a, b) {
+        var problemPath = [];
+        if (!astNodesAreEquivalent(a, b, problemPath)) {
+            if (problemPath.length === 0) {
+                if (a !== b) {
+                    throw new Error("Nodes must be equal");
+                }
+            }
+            else {
+                throw new Error("Nodes differ in the following path: " +
+                    problemPath.map(subscriptForProperty).join(""));
+            }
+        }
+    };
+    function subscriptForProperty(property) {
+        if (/[_$a-z][_$a-z0-9]*/i.test(property)) {
+            return "." + property;
+        }
+        return "[" + JSON.stringify(property) + "]";
+    }
+    function areEquivalent(a, b, problemPath) {
+        if (a === b) {
+            return true;
+        }
+        if (isArray.check(a)) {
+            return arraysAreEquivalent(a, b, problemPath);
+        }
+        if (isObject.check(a)) {
+            return objectsAreEquivalent(a, b, problemPath);
+        }
+        if (isDate.check(a)) {
+            return isDate.check(b) && (+a === +b);
+        }
+        if (isRegExp.check(a)) {
+            return isRegExp.check(b) && (a.source === b.source &&
+                a.global === b.global &&
+                a.multiline === b.multiline &&
+                a.ignoreCase === b.ignoreCase);
+        }
+        return a == b;
+    }
+    function arraysAreEquivalent(a, b, problemPath) {
+        isArray.assert(a);
+        var aLength = a.length;
+        if (!isArray.check(b) || b.length !== aLength) {
+            if (problemPath) {
+                problemPath.push("length");
+            }
+            return false;
+        }
+        for (var i = 0; i < aLength; ++i) {
+            if (problemPath) {
+                problemPath.push(i);
+            }
+            if (i in a !== i in b) {
+                return false;
+            }
+            if (!areEquivalent(a[i], b[i], problemPath)) {
+                return false;
+            }
+            if (problemPath) {
+                var problemPathTail = problemPath.pop();
+                if (problemPathTail !== i) {
+                    throw new Error("" + problemPathTail);
+                }
+            }
+        }
+        return true;
+    }
+    function objectsAreEquivalent(a, b, problemPath) {
+        isObject.assert(a);
+        if (!isObject.check(b)) {
+            return false;
+        }
+        // Fast path for a common property of AST nodes.
+        if (a.type !== b.type) {
+            if (problemPath) {
+                problemPath.push("type");
+            }
+            return false;
+        }
+        var aNames = getFieldNames(a);
+        var aNameCount = aNames.length;
+        var bNames = getFieldNames(b);
+        var bNameCount = bNames.length;
+        if (aNameCount === bNameCount) {
+            for (var i = 0; i < aNameCount; ++i) {
+                var name = aNames[i];
+                var aChild = getFieldValue(a, name);
+                var bChild = getFieldValue(b, name);
+                if (problemPath) {
+                    problemPath.push(name);
+                }
+                if (!areEquivalent(aChild, bChild, problemPath)) {
+                    return false;
+                }
+                if (problemPath) {
+                    var problemPathTail = problemPath.pop();
+                    if (problemPathTail !== name) {
+                        throw new Error("" + problemPathTail);
+                    }
+                }
+            }
+            return true;
+        }
+        if (!problemPath) {
+            return false;
+        }
+        // Since aNameCount !== bNameCount, we need to find some name that's
+        // missing in aNames but present in bNames, or vice-versa.
+        var seenNames = Object.create(null);
+        for (i = 0; i < aNameCount; ++i) {
+            seenNames[aNames[i]] = true;
+        }
+        for (i = 0; i < bNameCount; ++i) {
+            name = bNames[i];
+            if (!hasOwn.call(seenNames, name)) {
+                problemPath.push(name);
+                return false;
+            }
+            delete seenNames[name];
+        }
+        for (name in seenNames) {
+            problemPath.push(name);
+            break;
+        }
+        return false;
+    }
+    return astNodesAreEquivalent;
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/node-path.d.ts b/node_modules/ast-types/lib/node-path.d.ts
new file mode 100644
index 0000000..b8b11d1
--- /dev/null
+++ b/node_modules/ast-types/lib/node-path.d.ts
@@ -0,0 +1,22 @@
+import { Fork } from "../types";
+import { ASTNode } from "./types";
+import { Path } from "./path";
+import { Scope } from "./scope";
+export interface NodePath<N = any, V = any> extends Path<V> {
+    node: N;
+    parent: any;
+    scope: any;
+    replace: Path['replace'];
+    prune(...args: any[]): any;
+    _computeNode(): any;
+    _computeParent(): any;
+    _computeScope(): Scope | null;
+    getValueProperty(name: any): any;
+    needsParens(assumeExpressionContext?: boolean): boolean;
+    canBeFirstInStatement(): boolean;
+    firstInStatement(): boolean;
+}
+export interface NodePathConstructor {
+    new <N extends ASTNode = any, V = any>(value: any, parentPath?: any, name?: any): NodePath<N, V>;
+}
+export default function nodePathPlugin(fork: Fork): NodePathConstructor;
diff --git a/node_modules/ast-types/lib/node-path.js b/node_modules/ast-types/lib/node-path.js
new file mode 100644
index 0000000..72f8e88
--- /dev/null
+++ b/node_modules/ast-types/lib/node-path.js
@@ -0,0 +1,413 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+var path_1 = __importDefault(require("./path"));
+var scope_1 = __importDefault(require("./scope"));
+function nodePathPlugin(fork) {
+    var types = fork.use(types_1.default);
+    var n = types.namedTypes;
+    var b = types.builders;
+    var isNumber = types.builtInTypes.number;
+    var isArray = types.builtInTypes.array;
+    var Path = fork.use(path_1.default);
+    var Scope = fork.use(scope_1.default);
+    var NodePath = function NodePath(value, parentPath, name) {
+        if (!(this instanceof NodePath)) {
+            throw new Error("NodePath constructor cannot be invoked without 'new'");
+        }
+        Path.call(this, value, parentPath, name);
+    };
+    var NPp = NodePath.prototype = Object.create(Path.prototype, {
+        constructor: {
+            value: NodePath,
+            enumerable: false,
+            writable: true,
+            configurable: true
+        }
+    });
+    Object.defineProperties(NPp, {
+        node: {
+            get: function () {
+                Object.defineProperty(this, "node", {
+                    configurable: true,
+                    value: this._computeNode()
+                });
+                return this.node;
+            }
+        },
+        parent: {
+            get: function () {
+                Object.defineProperty(this, "parent", {
+                    configurable: true,
+                    value: this._computeParent()
+                });
+                return this.parent;
+            }
+        },
+        scope: {
+            get: function () {
+                Object.defineProperty(this, "scope", {
+                    configurable: true,
+                    value: this._computeScope()
+                });
+                return this.scope;
+            }
+        }
+    });
+    NPp.replace = function () {
+        delete this.node;
+        delete this.parent;
+        delete this.scope;
+        return Path.prototype.replace.apply(this, arguments);
+    };
+    NPp.prune = function () {
+        var remainingNodePath = this.parent;
+        this.replace();
+        return cleanUpNodesAfterPrune(remainingNodePath);
+    };
+    // The value of the first ancestor Path whose value is a Node.
+    NPp._computeNode = function () {
+        var value = this.value;
+        if (n.Node.check(value)) {
+            return value;
+        }
+        var pp = this.parentPath;
+        return pp && pp.node || null;
+    };
+    // The first ancestor Path whose value is a Node distinct from this.node.
+    NPp._computeParent = function () {
+        var value = this.value;
+        var pp = this.parentPath;
+        if (!n.Node.check(value)) {
+            while (pp && !n.Node.check(pp.value)) {
+                pp = pp.parentPath;
+            }
+            if (pp) {
+                pp = pp.parentPath;
+            }
+        }
+        while (pp && !n.Node.check(pp.value)) {
+            pp = pp.parentPath;
+        }
+        return pp || null;
+    };
+    // The closest enclosing scope that governs this node.
+    NPp._computeScope = function () {
+        var value = this.value;
+        var pp = this.parentPath;
+        var scope = pp && pp.scope;
+        if (n.Node.check(value) &&
+            Scope.isEstablishedBy(value)) {
+            scope = new Scope(this, scope);
+        }
+        return scope || null;
+    };
+    NPp.getValueProperty = function (name) {
+        return types.getFieldValue(this.value, name);
+    };
+    /**
+     * Determine whether this.node needs to be wrapped in parentheses in order
+     * for a parser to reproduce the same local AST structure.
+     *
+     * For instance, in the expression `(1 + 2) * 3`, the BinaryExpression
+     * whose operator is "+" needs parentheses, because `1 + 2 * 3` would
+     * parse differently.
+     *
+     * If assumeExpressionContext === true, we don't worry about edge cases
+     * like an anonymous FunctionExpression appearing lexically first in its
+     * enclosing statement and thus needing parentheses to avoid being parsed
+     * as a FunctionDeclaration with a missing name.
+     */
+    NPp.needsParens = function (assumeExpressionContext) {
+        var pp = this.parentPath;
+        if (!pp) {
+            return false;
+        }
+        var node = this.value;
+        // Only expressions need parentheses.
+        if (!n.Expression.check(node)) {
+            return false;
+        }
+        // Identifiers never need parentheses.
+        if (node.type === "Identifier") {
+            return false;
+        }
+        while (!n.Node.check(pp.value)) {
+            pp = pp.parentPath;
+            if (!pp) {
+                return false;
+            }
+        }
+        var parent = pp.value;
+        switch (node.type) {
+            case "UnaryExpression":
+            case "SpreadElement":
+            case "SpreadProperty":
+                return parent.type === "MemberExpression"
+                    && this.name === "object"
+                    && parent.object === node;
+            case "BinaryExpression":
+            case "LogicalExpression":
+                switch (parent.type) {
+                    case "CallExpression":
+                        return this.name === "callee"
+                            && parent.callee === node;
+                    case "UnaryExpression":
+                    case "SpreadElement":
+                    case "SpreadProperty":
+                        return true;
+                    case "MemberExpression":
+                        return this.name === "object"
+                            && parent.object === node;
+                    case "BinaryExpression":
+                    case "LogicalExpression": {
+                        var n_1 = node;
+                        var po = parent.operator;
+                        var pp_1 = PRECEDENCE[po];
+                        var no = n_1.operator;
+                        var np = PRECEDENCE[no];
+                        if (pp_1 > np) {
+                            return true;
+                        }
+                        if (pp_1 === np && this.name === "right") {
+                            if (parent.right !== n_1) {
+                                throw new Error("Nodes must be equal");
+                            }
+                            return true;
+                        }
+                    }
+                    default:
+                        return false;
+                }
+            case "SequenceExpression":
+                switch (parent.type) {
+                    case "ForStatement":
+                        // Although parentheses wouldn't hurt around sequence
+                        // expressions in the head of for loops, traditional style
+                        // dictates that e.g. i++, j++ should not be wrapped with
+                        // parentheses.
+                        return false;
+                    case "ExpressionStatement":
+                        return this.name !== "expression";
+                    default:
+                        // Otherwise err on the side of overparenthesization, adding
+                        // explicit exceptions above if this proves overzealous.
+                        return true;
+                }
+            case "YieldExpression":
+                switch (parent.type) {
+                    case "BinaryExpression":
+                    case "LogicalExpression":
+                    case "UnaryExpression":
+                    case "SpreadElement":
+                    case "SpreadProperty":
+                    case "CallExpression":
+                    case "MemberExpression":
+                    case "NewExpression":
+                    case "ConditionalExpression":
+                    case "YieldExpression":
+                        return true;
+                    default:
+                        return false;
+                }
+            case "Literal":
+                return parent.type === "MemberExpression"
+                    && isNumber.check(node.value)
+                    && this.name === "object"
+                    && parent.object === node;
+            case "AssignmentExpression":
+            case "ConditionalExpression":
+                switch (parent.type) {
+                    case "UnaryExpression":
+                    case "SpreadElement":
+                    case "SpreadProperty":
+                    case "BinaryExpression":
+                    case "LogicalExpression":
+                        return true;
+                    case "CallExpression":
+                        return this.name === "callee"
+                            && parent.callee === node;
+                    case "ConditionalExpression":
+                        return this.name === "test"
+                            && parent.test === node;
+                    case "MemberExpression":
+                        return this.name === "object"
+                            && parent.object === node;
+                    default:
+                        return false;
+                }
+            default:
+                if (parent.type === "NewExpression" &&
+                    this.name === "callee" &&
+                    parent.callee === node) {
+                    return containsCallExpression(node);
+                }
+        }
+        if (assumeExpressionContext !== true &&
+            !this.canBeFirstInStatement() &&
+            this.firstInStatement())
+            return true;
+        return false;
+    };
+    function isBinary(node) {
+        return n.BinaryExpression.check(node)
+            || n.LogicalExpression.check(node);
+    }
+    // @ts-ignore 'isUnaryLike' is declared but its value is never read. [6133]
+    function isUnaryLike(node) {
+        return n.UnaryExpression.check(node)
+            // I considered making SpreadElement and SpreadProperty subtypes
+            // of UnaryExpression, but they're not really Expression nodes.
+            || (n.SpreadElement && n.SpreadElement.check(node))
+            || (n.SpreadProperty && n.SpreadProperty.check(node));
+    }
+    var PRECEDENCE = {};
+    [["||"],
+        ["&&"],
+        ["|"],
+        ["^"],
+        ["&"],
+        ["==", "===", "!=", "!=="],
+        ["<", ">", "<=", ">=", "in", "instanceof"],
+        [">>", "<<", ">>>"],
+        ["+", "-"],
+        ["*", "/", "%"]
+    ].forEach(function (tier, i) {
+        tier.forEach(function (op) {
+            PRECEDENCE[op] = i;
+        });
+    });
+    function containsCallExpression(node) {
+        if (n.CallExpression.check(node)) {
+            return true;
+        }
+        if (isArray.check(node)) {
+            return node.some(containsCallExpression);
+        }
+        if (n.Node.check(node)) {
+            return types.someField(node, function (_name, child) {
+                return containsCallExpression(child);
+            });
+        }
+        return false;
+    }
+    NPp.canBeFirstInStatement = function () {
+        var node = this.node;
+        return !n.FunctionExpression.check(node)
+            && !n.ObjectExpression.check(node);
+    };
+    NPp.firstInStatement = function () {
+        return firstInStatement(this);
+    };
+    function firstInStatement(path) {
+        for (var node, parent; path.parent; path = path.parent) {
+            node = path.node;
+            parent = path.parent.node;
+            if (n.BlockStatement.check(parent) &&
+                path.parent.name === "body" &&
+                path.name === 0) {
+                if (parent.body[0] !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                return true;
+            }
+            if (n.ExpressionStatement.check(parent) &&
+                path.name === "expression") {
+                if (parent.expression !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                return true;
+            }
+            if (n.SequenceExpression.check(parent) &&
+                path.parent.name === "expressions" &&
+                path.name === 0) {
+                if (parent.expressions[0] !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            if (n.CallExpression.check(parent) &&
+                path.name === "callee") {
+                if (parent.callee !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            if (n.MemberExpression.check(parent) &&
+                path.name === "object") {
+                if (parent.object !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            if (n.ConditionalExpression.check(parent) &&
+                path.name === "test") {
+                if (parent.test !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            if (isBinary(parent) &&
+                path.name === "left") {
+                if (parent.left !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            if (n.UnaryExpression.check(parent) &&
+                !parent.prefix &&
+                path.name === "argument") {
+                if (parent.argument !== node) {
+                    throw new Error("Nodes must be equal");
+                }
+                continue;
+            }
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Pruning certain nodes will result in empty or incomplete nodes, here we clean those nodes up.
+     */
+    function cleanUpNodesAfterPrune(remainingNodePath) {
+        if (n.VariableDeclaration.check(remainingNodePath.node)) {
+            var declarations = remainingNodePath.get('declarations').value;
+            if (!declarations || declarations.length === 0) {
+                return remainingNodePath.prune();
+            }
+        }
+        else if (n.ExpressionStatement.check(remainingNodePath.node)) {
+            if (!remainingNodePath.get('expression').value) {
+                return remainingNodePath.prune();
+            }
+        }
+        else if (n.IfStatement.check(remainingNodePath.node)) {
+            cleanUpIfStatementAfterPrune(remainingNodePath);
+        }
+        return remainingNodePath;
+    }
+    function cleanUpIfStatementAfterPrune(ifStatement) {
+        var testExpression = ifStatement.get('test').value;
+        var alternate = ifStatement.get('alternate').value;
+        var consequent = ifStatement.get('consequent').value;
+        if (!consequent && !alternate) {
+            var testExpressionStatement = b.expressionStatement(testExpression);
+            ifStatement.replace(testExpressionStatement);
+        }
+        else if (!consequent && alternate) {
+            var negatedTestExpression = b.unaryExpression('!', testExpression, true);
+            if (n.UnaryExpression.check(testExpression) && testExpression.operator === '!') {
+                negatedTestExpression = testExpression.argument;
+            }
+            ifStatement.get("test").replace(negatedTestExpression);
+            ifStatement.get("consequent").replace(alternate);
+            ifStatement.get("alternate").replace();
+        }
+    }
+    return NodePath;
+}
+exports.default = nodePathPlugin;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/path-visitor.d.ts b/node_modules/ast-types/lib/path-visitor.d.ts
new file mode 100644
index 0000000..b03e68f
--- /dev/null
+++ b/node_modules/ast-types/lib/path-visitor.d.ts
@@ -0,0 +1,52 @@
+import { Fork, Omit } from "../types";
+import { ASTNode } from "./types";
+import { NodePath } from "./node-path";
+export interface PathVisitor {
+    _reusableContextStack: any;
+    _methodNameTable: any;
+    _shouldVisitComments: any;
+    Context: any;
+    _visiting: any;
+    _changeReported: any;
+    _abortRequested: boolean;
+    visit(...args: any[]): any;
+    reset(...args: any[]): any;
+    visitWithoutReset(path: any): any;
+    AbortRequest: any;
+    abort(): void;
+    visitor: any;
+    acquireContext(path: any): any;
+    releaseContext(context: any): void;
+    reportChanged(): void;
+    wasChangeReported(): any;
+}
+export interface PathVisitorStatics {
+    fromMethodsObject(methods?: any): Visitor;
+    visit<M = {}>(node: ASTNode, methods?: import("../gen/visitor").Visitor<M>): any;
+}
+export interface PathVisitorConstructor extends PathVisitorStatics {
+    new (): PathVisitor;
+}
+export interface Visitor extends PathVisitor {
+}
+export interface VisitorConstructor extends PathVisitorStatics {
+    new (): Visitor;
+}
+export interface VisitorMethods {
+    [visitorMethod: string]: (path: NodePath) => any;
+}
+export interface SharedContextMethods {
+    currentPath: any;
+    needToCallTraverse: boolean;
+    Context: any;
+    visitor: any;
+    reset(path: any, ...args: any[]): any;
+    invokeVisitorMethod(methodName: string): any;
+    traverse(path: any, newVisitor?: VisitorMethods): any;
+    visit(path: any, newVisitor?: VisitorMethods): any;
+    reportChanged(): void;
+    abort(): void;
+}
+export interface Context extends Omit<PathVisitor, "visit" | "reset">, SharedContextMethods {
+}
+export default function pathVisitorPlugin(fork: Fork): PathVisitorConstructor;
diff --git a/node_modules/ast-types/lib/path-visitor.js b/node_modules/ast-types/lib/path-visitor.js
new file mode 100644
index 0000000..2f1c881
--- /dev/null
+++ b/node_modules/ast-types/lib/path-visitor.js
@@ -0,0 +1,345 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+var node_path_1 = __importDefault(require("./node-path"));
+var hasOwn = Object.prototype.hasOwnProperty;
+function pathVisitorPlugin(fork) {
+    var types = fork.use(types_1.default);
+    var NodePath = fork.use(node_path_1.default);
+    var isArray = types.builtInTypes.array;
+    var isObject = types.builtInTypes.object;
+    var isFunction = types.builtInTypes.function;
+    var undefined;
+    var PathVisitor = function PathVisitor() {
+        if (!(this instanceof PathVisitor)) {
+            throw new Error("PathVisitor constructor cannot be invoked without 'new'");
+        }
+        // Permanent state.
+        this._reusableContextStack = [];
+        this._methodNameTable = computeMethodNameTable(this);
+        this._shouldVisitComments =
+            hasOwn.call(this._methodNameTable, "Block") ||
+                hasOwn.call(this._methodNameTable, "Line");
+        this.Context = makeContextConstructor(this);
+        // State reset every time PathVisitor.prototype.visit is called.
+        this._visiting = false;
+        this._changeReported = false;
+    };
+    function computeMethodNameTable(visitor) {
+        var typeNames = Object.create(null);
+        for (var methodName in visitor) {
+            if (/^visit[A-Z]/.test(methodName)) {
+                typeNames[methodName.slice("visit".length)] = true;
+            }
+        }
+        var supertypeTable = types.computeSupertypeLookupTable(typeNames);
+        var methodNameTable = Object.create(null);
+        var typeNameKeys = Object.keys(supertypeTable);
+        var typeNameCount = typeNameKeys.length;
+        for (var i = 0; i < typeNameCount; ++i) {
+            var typeName = typeNameKeys[i];
+            methodName = "visit" + supertypeTable[typeName];
+            if (isFunction.check(visitor[methodName])) {
+                methodNameTable[typeName] = methodName;
+            }
+        }
+        return methodNameTable;
+    }
+    PathVisitor.fromMethodsObject = function fromMethodsObject(methods) {
+        if (methods instanceof PathVisitor) {
+            return methods;
+        }
+        if (!isObject.check(methods)) {
+            // An empty visitor?
+            return new PathVisitor;
+        }
+        var Visitor = function Visitor() {
+            if (!(this instanceof Visitor)) {
+                throw new Error("Visitor constructor cannot be invoked without 'new'");
+            }
+            PathVisitor.call(this);
+        };
+        var Vp = Visitor.prototype = Object.create(PVp);
+        Vp.constructor = Visitor;
+        extend(Vp, methods);
+        extend(Visitor, PathVisitor);
+        isFunction.assert(Visitor.fromMethodsObject);
+        isFunction.assert(Visitor.visit);
+        return new Visitor;
+    };
+    function extend(target, source) {
+        for (var property in source) {
+            if (hasOwn.call(source, property)) {
+                target[property] = source[property];
+            }
+        }
+        return target;
+    }
+    PathVisitor.visit = function visit(node, methods) {
+        return PathVisitor.fromMethodsObject(methods).visit(node);
+    };
+    var PVp = PathVisitor.prototype;
+    PVp.visit = function () {
+        if (this._visiting) {
+            throw new Error("Recursively calling visitor.visit(path) resets visitor state. " +
+                "Try this.visit(path) or this.traverse(path) instead.");
+        }
+        // Private state that needs to be reset before every traversal.
+        this._visiting = true;
+        this._changeReported = false;
+        this._abortRequested = false;
+        var argc = arguments.length;
+        var args = new Array(argc);
+        for (var i = 0; i < argc; ++i) {
+            args[i] = arguments[i];
+        }
+        if (!(args[0] instanceof NodePath)) {
+            args[0] = new NodePath({ root: args[0] }).get("root");
+        }
+        // Called with the same arguments as .visit.
+        this.reset.apply(this, args);
+        var didNotThrow;
+        try {
+            var root = this.visitWithoutReset(args[0]);
+            didNotThrow = true;
+        }
+        finally {
+            this._visiting = false;
+            if (!didNotThrow && this._abortRequested) {
+                // If this.visitWithoutReset threw an exception and
+                // this._abortRequested was set to true, return the root of
+                // the AST instead of letting the exception propagate, so that
+                // client code does not have to provide a try-catch block to
+                // intercept the AbortRequest exception.  Other kinds of
+                // exceptions will propagate without being intercepted and
+                // rethrown by a catch block, so their stacks will accurately
+                // reflect the original throwing context.
+                return args[0].value;
+            }
+        }
+        return root;
+    };
+    PVp.AbortRequest = function AbortRequest() { };
+    PVp.abort = function () {
+        var visitor = this;
+        visitor._abortRequested = true;
+        var request = new visitor.AbortRequest();
+        // If you decide to catch this exception and stop it from propagating,
+        // make sure to call its cancel method to avoid silencing other
+        // exceptions that might be thrown later in the traversal.
+        request.cancel = function () {
+            visitor._abortRequested = false;
+        };
+        throw request;
+    };
+    PVp.reset = function (_path /*, additional arguments */) {
+        // Empty stub; may be reassigned or overridden by subclasses.
+    };
+    PVp.visitWithoutReset = function (path) {
+        if (this instanceof this.Context) {
+            // Since this.Context.prototype === this, there's a chance we
+            // might accidentally call context.visitWithoutReset. If that
+            // happens, re-invoke the method against context.visitor.
+            return this.visitor.visitWithoutReset(path);
+        }
+        if (!(path instanceof NodePath)) {
+            throw new Error("");
+        }
+        var value = path.value;
+        var methodName = value &&
+            typeof value === "object" &&
+            typeof value.type === "string" &&
+            this._methodNameTable[value.type];
+        if (methodName) {
+            var context = this.acquireContext(path);
+            try {
+                return context.invokeVisitorMethod(methodName);
+            }
+            finally {
+                this.releaseContext(context);
+            }
+        }
+        else {
+            // If there was no visitor method to call, visit the children of
+            // this node generically.
+            return visitChildren(path, this);
+        }
+    };
+    function visitChildren(path, visitor) {
+        if (!(path instanceof NodePath)) {
+            throw new Error("");
+        }
+        if (!(visitor instanceof PathVisitor)) {
+            throw new Error("");
+        }
+        var value = path.value;
+        if (isArray.check(value)) {
+            path.each(visitor.visitWithoutReset, visitor);
+        }
+        else if (!isObject.check(value)) {
+            // No children to visit.
+        }
+        else {
+            var childNames = types.getFieldNames(value);
+            // The .comments field of the Node type is hidden, so we only
+            // visit it if the visitor defines visitBlock or visitLine, and
+            // value.comments is defined.
+            if (visitor._shouldVisitComments &&
+                value.comments &&
+                childNames.indexOf("comments") < 0) {
+                childNames.push("comments");
+            }
+            var childCount = childNames.length;
+            var childPaths = [];
+            for (var i = 0; i < childCount; ++i) {
+                var childName = childNames[i];
+                if (!hasOwn.call(value, childName)) {
+                    value[childName] = types.getFieldValue(value, childName);
+                }
+                childPaths.push(path.get(childName));
+            }
+            for (var i = 0; i < childCount; ++i) {
+                visitor.visitWithoutReset(childPaths[i]);
+            }
+        }
+        return path.value;
+    }
+    PVp.acquireContext = function (path) {
+        if (this._reusableContextStack.length === 0) {
+            return new this.Context(path);
+        }
+        return this._reusableContextStack.pop().reset(path);
+    };
+    PVp.releaseContext = function (context) {
+        if (!(context instanceof this.Context)) {
+            throw new Error("");
+        }
+        this._reusableContextStack.push(context);
+        context.currentPath = null;
+    };
+    PVp.reportChanged = function () {
+        this._changeReported = true;
+    };
+    PVp.wasChangeReported = function () {
+        return this._changeReported;
+    };
+    function makeContextConstructor(visitor) {
+        function Context(path) {
+            if (!(this instanceof Context)) {
+                throw new Error("");
+            }
+            if (!(this instanceof PathVisitor)) {
+                throw new Error("");
+            }
+            if (!(path instanceof NodePath)) {
+                throw new Error("");
+            }
+            Object.defineProperty(this, "visitor", {
+                value: visitor,
+                writable: false,
+                enumerable: true,
+                configurable: false
+            });
+            this.currentPath = path;
+            this.needToCallTraverse = true;
+            Object.seal(this);
+        }
+        if (!(visitor instanceof PathVisitor)) {
+            throw new Error("");
+        }
+        // Note that the visitor object is the prototype of Context.prototype,
+        // so all visitor methods are inherited by context objects.
+        var Cp = Context.prototype = Object.create(visitor);
+        Cp.constructor = Context;
+        extend(Cp, sharedContextProtoMethods);
+        return Context;
+    }
+    // Every PathVisitor has a different this.Context constructor and
+    // this.Context.prototype object, but those prototypes can all use the
+    // same reset, invokeVisitorMethod, and traverse function objects.
+    var sharedContextProtoMethods = Object.create(null);
+    sharedContextProtoMethods.reset =
+        function reset(path) {
+            if (!(this instanceof this.Context)) {
+                throw new Error("");
+            }
+            if (!(path instanceof NodePath)) {
+                throw new Error("");
+            }
+            this.currentPath = path;
+            this.needToCallTraverse = true;
+            return this;
+        };
+    sharedContextProtoMethods.invokeVisitorMethod =
+        function invokeVisitorMethod(methodName) {
+            if (!(this instanceof this.Context)) {
+                throw new Error("");
+            }
+            if (!(this.currentPath instanceof NodePath)) {
+                throw new Error("");
+            }
+            var result = this.visitor[methodName].call(this, this.currentPath);
+            if (result === false) {
+                // Visitor methods return false to indicate that they have handled
+                // their own traversal needs, and we should not complain if
+                // this.needToCallTraverse is still true.
+                this.needToCallTraverse = false;
+            }
+            else if (result !== undefined) {
+                // Any other non-undefined value returned from the visitor method
+                // is interpreted as a replacement value.
+                this.currentPath = this.currentPath.replace(result)[0];
+                if (this.needToCallTraverse) {
+                    // If this.traverse still hasn't been called, visit the
+                    // children of the replacement node.
+                    this.traverse(this.currentPath);
+                }
+            }
+            if (this.needToCallTraverse !== false) {
+                throw new Error("Must either call this.traverse or return false in " + methodName);
+            }
+            var path = this.currentPath;
+            return path && path.value;
+        };
+    sharedContextProtoMethods.traverse =
+        function traverse(path, newVisitor) {
+            if (!(this instanceof this.Context)) {
+                throw new Error("");
+            }
+            if (!(path instanceof NodePath)) {
+                throw new Error("");
+            }
+            if (!(this.currentPath instanceof NodePath)) {
+                throw new Error("");
+            }
+            this.needToCallTraverse = false;
+            return visitChildren(path, PathVisitor.fromMethodsObject(newVisitor || this.visitor));
+        };
+    sharedContextProtoMethods.visit =
+        function visit(path, newVisitor) {
+            if (!(this instanceof this.Context)) {
+                throw new Error("");
+            }
+            if (!(path instanceof NodePath)) {
+                throw new Error("");
+            }
+            if (!(this.currentPath instanceof NodePath)) {
+                throw new Error("");
+            }
+            this.needToCallTraverse = false;
+            return PathVisitor.fromMethodsObject(newVisitor || this.visitor).visitWithoutReset(path);
+        };
+    sharedContextProtoMethods.reportChanged = function reportChanged() {
+        this.visitor.reportChanged();
+    };
+    sharedContextProtoMethods.abort = function abort() {
+        this.needToCallTraverse = false;
+        this.visitor.abort();
+    };
+    return PathVisitor;
+}
+exports.default = pathVisitorPlugin;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/path.d.ts b/node_modules/ast-types/lib/path.d.ts
new file mode 100644
index 0000000..feef1f1
--- /dev/null
+++ b/node_modules/ast-types/lib/path.d.ts
@@ -0,0 +1,25 @@
+import { Fork } from "../types";
+import { ASTNode } from "./types";
+export interface Path<V = any> {
+    value: V;
+    parentPath: any;
+    name: any;
+    __childCache: object | null;
+    getValueProperty(name: any): any;
+    get(...names: any[]): any;
+    each(callback: any, context: any): any;
+    map(callback: any, context: any): any;
+    filter(callback: any, context: any): any;
+    shift(): any;
+    unshift(...args: any[]): any;
+    push(...args: any[]): any;
+    pop(): any;
+    insertAt(index: number, ...args: any[]): any;
+    insertBefore(...args: any[]): any;
+    insertAfter(...args: any[]): any;
+    replace(replacement?: ASTNode, ...args: ASTNode[]): any;
+}
+export interface PathConstructor {
+    new <V = any>(value: any, parentPath?: any, name?: any): Path<V>;
+}
+export default function pathPlugin(fork: Fork): PathConstructor;
diff --git a/node_modules/ast-types/lib/path.js b/node_modules/ast-types/lib/path.js
new file mode 100644
index 0000000..22fa052
--- /dev/null
+++ b/node_modules/ast-types/lib/path.js
@@ -0,0 +1,333 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+var Op = Object.prototype;
+var hasOwn = Op.hasOwnProperty;
+function pathPlugin(fork) {
+    var types = fork.use(types_1.default);
+    var isArray = types.builtInTypes.array;
+    var isNumber = types.builtInTypes.number;
+    var Path = function Path(value, parentPath, name) {
+        if (!(this instanceof Path)) {
+            throw new Error("Path constructor cannot be invoked without 'new'");
+        }
+        if (parentPath) {
+            if (!(parentPath instanceof Path)) {
+                throw new Error("");
+            }
+        }
+        else {
+            parentPath = null;
+            name = null;
+        }
+        // The value encapsulated by this Path, generally equal to
+        // parentPath.value[name] if we have a parentPath.
+        this.value = value;
+        // The immediate parent Path of this Path.
+        this.parentPath = parentPath;
+        // The name of the property of parentPath.value through which this
+        // Path's value was reached.
+        this.name = name;
+        // Calling path.get("child") multiple times always returns the same
+        // child Path object, for both performance and consistency reasons.
+        this.__childCache = null;
+    };
+    var Pp = Path.prototype;
+    function getChildCache(path) {
+        // Lazily create the child cache. This also cheapens cache
+        // invalidation, since you can just reset path.__childCache to null.
+        return path.__childCache || (path.__childCache = Object.create(null));
+    }
+    function getChildPath(path, name) {
+        var cache = getChildCache(path);
+        var actualChildValue = path.getValueProperty(name);
+        var childPath = cache[name];
+        if (!hasOwn.call(cache, name) ||
+            // Ensure consistency between cache and reality.
+            childPath.value !== actualChildValue) {
+            childPath = cache[name] = new path.constructor(actualChildValue, path, name);
+        }
+        return childPath;
+    }
+    // This method is designed to be overridden by subclasses that need to
+    // handle missing properties, etc.
+    Pp.getValueProperty = function getValueProperty(name) {
+        return this.value[name];
+    };
+    Pp.get = function get() {
+        var names = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            names[_i] = arguments[_i];
+        }
+        var path = this;
+        var count = names.length;
+        for (var i = 0; i < count; ++i) {
+            path = getChildPath(path, names[i]);
+        }
+        return path;
+    };
+    Pp.each = function each(callback, context) {
+        var childPaths = [];
+        var len = this.value.length;
+        var i = 0;
+        // Collect all the original child paths before invoking the callback.
+        for (var i = 0; i < len; ++i) {
+            if (hasOwn.call(this.value, i)) {
+                childPaths[i] = this.get(i);
+            }
+        }
+        // Invoke the callback on just the original child paths, regardless of
+        // any modifications made to the array by the callback. I chose these
+        // semantics over cleverly invoking the callback on new elements because
+        // this way is much easier to reason about.
+        context = context || this;
+        for (i = 0; i < len; ++i) {
+            if (hasOwn.call(childPaths, i)) {
+                callback.call(context, childPaths[i]);
+            }
+        }
+    };
+    Pp.map = function map(callback, context) {
+        var result = [];
+        this.each(function (childPath) {
+            result.push(callback.call(this, childPath));
+        }, context);
+        return result;
+    };
+    Pp.filter = function filter(callback, context) {
+        var result = [];
+        this.each(function (childPath) {
+            if (callback.call(this, childPath)) {
+                result.push(childPath);
+            }
+        }, context);
+        return result;
+    };
+    function emptyMoves() { }
+    function getMoves(path, offset, start, end) {
+        isArray.assert(path.value);
+        if (offset === 0) {
+            return emptyMoves;
+        }
+        var length = path.value.length;
+        if (length < 1) {
+            return emptyMoves;
+        }
+        var argc = arguments.length;
+        if (argc === 2) {
+            start = 0;
+            end = length;
+        }
+        else if (argc === 3) {
+            start = Math.max(start, 0);
+            end = length;
+        }
+        else {
+            start = Math.max(start, 0);
+            end = Math.min(end, length);
+        }
+        isNumber.assert(start);
+        isNumber.assert(end);
+        var moves = Object.create(null);
+        var cache = getChildCache(path);
+        for (var i = start; i < end; ++i) {
+            if (hasOwn.call(path.value, i)) {
+                var childPath = path.get(i);
+                if (childPath.name !== i) {
+                    throw new Error("");
+                }
+                var newIndex = i + offset;
+                childPath.name = newIndex;
+                moves[newIndex] = childPath;
+                delete cache[i];
+            }
+        }
+        delete cache.length;
+        return function () {
+            for (var newIndex in moves) {
+                var childPath = moves[newIndex];
+                if (childPath.name !== +newIndex) {
+                    throw new Error("");
+                }
+                cache[newIndex] = childPath;
+                path.value[newIndex] = childPath.value;
+            }
+        };
+    }
+    Pp.shift = function shift() {
+        var move = getMoves(this, -1);
+        var result = this.value.shift();
+        move();
+        return result;
+    };
+    Pp.unshift = function unshift() {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var move = getMoves(this, args.length);
+        var result = this.value.unshift.apply(this.value, args);
+        move();
+        return result;
+    };
+    Pp.push = function push() {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        isArray.assert(this.value);
+        delete getChildCache(this).length;
+        return this.value.push.apply(this.value, args);
+    };
+    Pp.pop = function pop() {
+        isArray.assert(this.value);
+        var cache = getChildCache(this);
+        delete cache[this.value.length - 1];
+        delete cache.length;
+        return this.value.pop();
+    };
+    Pp.insertAt = function insertAt(index) {
+        var argc = arguments.length;
+        var move = getMoves(this, argc - 1, index);
+        if (move === emptyMoves && argc <= 1) {
+            return this;
+        }
+        index = Math.max(index, 0);
+        for (var i = 1; i < argc; ++i) {
+            this.value[index + i - 1] = arguments[i];
+        }
+        move();
+        return this;
+    };
+    Pp.insertBefore = function insertBefore() {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var pp = this.parentPath;
+        var argc = args.length;
+        var insertAtArgs = [this.name];
+        for (var i = 0; i < argc; ++i) {
+            insertAtArgs.push(args[i]);
+        }
+        return pp.insertAt.apply(pp, insertAtArgs);
+    };
+    Pp.insertAfter = function insertAfter() {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var pp = this.parentPath;
+        var argc = args.length;
+        var insertAtArgs = [this.name + 1];
+        for (var i = 0; i < argc; ++i) {
+            insertAtArgs.push(args[i]);
+        }
+        return pp.insertAt.apply(pp, insertAtArgs);
+    };
+    function repairRelationshipWithParent(path) {
+        if (!(path instanceof Path)) {
+            throw new Error("");
+        }
+        var pp = path.parentPath;
+        if (!pp) {
+            // Orphan paths have no relationship to repair.
+            return path;
+        }
+        var parentValue = pp.value;
+        var parentCache = getChildCache(pp);
+        // Make sure parentCache[path.name] is populated.
+        if (parentValue[path.name] === path.value) {
+            parentCache[path.name] = path;
+        }
+        else if (isArray.check(parentValue)) {
+            // Something caused path.name to become out of date, so attempt to
+            // recover by searching for path.value in parentValue.
+            var i = parentValue.indexOf(path.value);
+            if (i >= 0) {
+                parentCache[path.name = i] = path;
+            }
+        }
+        else {
+            // If path.value disagrees with parentValue[path.name], and
+            // path.name is not an array index, let path.value become the new
+            // parentValue[path.name] and update parentCache accordingly.
+            parentValue[path.name] = path.value;
+            parentCache[path.name] = path;
+        }
+        if (parentValue[path.name] !== path.value) {
+            throw new Error("");
+        }
+        if (path.parentPath.get(path.name) !== path) {
+            throw new Error("");
+        }
+        return path;
+    }
+    Pp.replace = function replace(replacement) {
+        var results = [];
+        var parentValue = this.parentPath.value;
+        var parentCache = getChildCache(this.parentPath);
+        var count = arguments.length;
+        repairRelationshipWithParent(this);
+        if (isArray.check(parentValue)) {
+            var originalLength = parentValue.length;
+            var move = getMoves(this.parentPath, count - 1, this.name + 1);
+            var spliceArgs = [this.name, 1];
+            for (var i = 0; i < count; ++i) {
+                spliceArgs.push(arguments[i]);
+            }
+            var splicedOut = parentValue.splice.apply(parentValue, spliceArgs);
+            if (splicedOut[0] !== this.value) {
+                throw new Error("");
+            }
+            if (parentValue.length !== (originalLength - 1 + count)) {
+                throw new Error("");
+            }
+            move();
+            if (count === 0) {
+                delete this.value;
+                delete parentCache[this.name];
+                this.__childCache = null;
+            }
+            else {
+                if (parentValue[this.name] !== replacement) {
+                    throw new Error("");
+                }
+                if (this.value !== replacement) {
+                    this.value = replacement;
+                    this.__childCache = null;
+                }
+                for (i = 0; i < count; ++i) {
+                    results.push(this.parentPath.get(this.name + i));
+                }
+                if (results[0] !== this) {
+                    throw new Error("");
+                }
+            }
+        }
+        else if (count === 1) {
+            if (this.value !== replacement) {
+                this.__childCache = null;
+            }
+            this.value = parentValue[this.name] = replacement;
+            results.push(this);
+        }
+        else if (count === 0) {
+            delete parentValue[this.name];
+            delete this.value;
+            this.__childCache = null;
+            // Leave this path cached as parentCache[this.name], even though
+            // it no longer has a value defined.
+        }
+        else {
+            throw new Error("Could not replace path");
+        }
+        return results;
+    };
+    return Path;
+}
+exports.default = pathPlugin;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/scope.d.ts b/node_modules/ast-types/lib/scope.d.ts
new file mode 100644
index 0000000..c4687d1
--- /dev/null
+++ b/node_modules/ast-types/lib/scope.d.ts
@@ -0,0 +1,26 @@
+import { Fork } from "../types";
+export interface Scope {
+    path: any;
+    node: any;
+    isGlobal: boolean;
+    depth: number;
+    parent: any;
+    bindings: any;
+    types: any;
+    didScan: boolean;
+    declares(name: any): any;
+    declaresType(name: any): any;
+    declareTemporary(prefix?: any): any;
+    injectTemporary(identifier: any, init: any): any;
+    scan(force?: any): any;
+    getBindings(): any;
+    getTypes(): any;
+    lookup(name: any): any;
+    lookupType(name: any): any;
+    getGlobalScope(): Scope;
+}
+export interface ScopeConstructor {
+    new (path: any, parentScope: any): Scope;
+    isEstablishedBy(node: any): any;
+}
+export default function scopePlugin(fork: Fork): ScopeConstructor;
diff --git a/node_modules/ast-types/lib/scope.js b/node_modules/ast-types/lib/scope.js
new file mode 100644
index 0000000..a80fe4c
--- /dev/null
+++ b/node_modules/ast-types/lib/scope.js
@@ -0,0 +1,317 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+var hasOwn = Object.prototype.hasOwnProperty;
+function scopePlugin(fork) {
+    var types = fork.use(types_1.default);
+    var Type = types.Type;
+    var namedTypes = types.namedTypes;
+    var Node = namedTypes.Node;
+    var Expression = namedTypes.Expression;
+    var isArray = types.builtInTypes.array;
+    var b = types.builders;
+    var Scope = function Scope(path, parentScope) {
+        if (!(this instanceof Scope)) {
+            throw new Error("Scope constructor cannot be invoked without 'new'");
+        }
+        ScopeType.assert(path.value);
+        var depth;
+        if (parentScope) {
+            if (!(parentScope instanceof Scope)) {
+                throw new Error("");
+            }
+            depth = parentScope.depth + 1;
+        }
+        else {
+            parentScope = null;
+            depth = 0;
+        }
+        Object.defineProperties(this, {
+            path: { value: path },
+            node: { value: path.value },
+            isGlobal: { value: !parentScope, enumerable: true },
+            depth: { value: depth },
+            parent: { value: parentScope },
+            bindings: { value: {} },
+            types: { value: {} },
+        });
+    };
+    var scopeTypes = [
+        // Program nodes introduce global scopes.
+        namedTypes.Program,
+        // Function is the supertype of FunctionExpression,
+        // FunctionDeclaration, ArrowExpression, etc.
+        namedTypes.Function,
+        // In case you didn't know, the caught parameter shadows any variable
+        // of the same name in an outer scope.
+        namedTypes.CatchClause
+    ];
+    var ScopeType = Type.or.apply(Type, scopeTypes);
+    Scope.isEstablishedBy = function (node) {
+        return ScopeType.check(node);
+    };
+    var Sp = Scope.prototype;
+    // Will be overridden after an instance lazily calls scanScope.
+    Sp.didScan = false;
+    Sp.declares = function (name) {
+        this.scan();
+        return hasOwn.call(this.bindings, name);
+    };
+    Sp.declaresType = function (name) {
+        this.scan();
+        return hasOwn.call(this.types, name);
+    };
+    Sp.declareTemporary = function (prefix) {
+        if (prefix) {
+            if (!/^[a-z$_]/i.test(prefix)) {
+                throw new Error("");
+            }
+        }
+        else {
+            prefix = "t$";
+        }
+        // Include this.depth in the name to make sure the name does not
+        // collide with any variables in nested/enclosing scopes.
+        prefix += this.depth.toString(36) + "$";
+        this.scan();
+        var index = 0;
+        while (this.declares(prefix + index)) {
+            ++index;
+        }
+        var name = prefix + index;
+        return this.bindings[name] = types.builders.identifier(name);
+    };
+    Sp.injectTemporary = function (identifier, init) {
+        identifier || (identifier = this.declareTemporary());
+        var bodyPath = this.path.get("body");
+        if (namedTypes.BlockStatement.check(bodyPath.value)) {
+            bodyPath = bodyPath.get("body");
+        }
+        bodyPath.unshift(b.variableDeclaration("var", [b.variableDeclarator(identifier, init || null)]));
+        return identifier;
+    };
+    Sp.scan = function (force) {
+        if (force || !this.didScan) {
+            for (var name in this.bindings) {
+                // Empty out this.bindings, just in cases.
+                delete this.bindings[name];
+            }
+            scanScope(this.path, this.bindings, this.types);
+            this.didScan = true;
+        }
+    };
+    Sp.getBindings = function () {
+        this.scan();
+        return this.bindings;
+    };
+    Sp.getTypes = function () {
+        this.scan();
+        return this.types;
+    };
+    function scanScope(path, bindings, scopeTypes) {
+        var node = path.value;
+        ScopeType.assert(node);
+        if (namedTypes.CatchClause.check(node)) {
+            // A catch clause establishes a new scope but the only variable
+            // bound in that scope is the catch parameter. Any other
+            // declarations create bindings in the outer scope.
+            addPattern(path.get("param"), bindings);
+        }
+        else {
+            recursiveScanScope(path, bindings, scopeTypes);
+        }
+    }
+    function recursiveScanScope(path, bindings, scopeTypes) {
+        var node = path.value;
+        if (path.parent &&
+            namedTypes.FunctionExpression.check(path.parent.node) &&
+            path.parent.node.id) {
+            addPattern(path.parent.get("id"), bindings);
+        }
+        if (!node) {
+            // None of the remaining cases matter if node is falsy.
+        }
+        else if (isArray.check(node)) {
+            path.each(function (childPath) {
+                recursiveScanChild(childPath, bindings, scopeTypes);
+            });
+        }
+        else if (namedTypes.Function.check(node)) {
+            path.get("params").each(function (paramPath) {
+                addPattern(paramPath, bindings);
+            });
+            recursiveScanChild(path.get("body"), bindings, scopeTypes);
+        }
+        else if ((namedTypes.TypeAlias && namedTypes.TypeAlias.check(node)) ||
+            (namedTypes.InterfaceDeclaration && namedTypes.InterfaceDeclaration.check(node)) ||
+            (namedTypes.TSTypeAliasDeclaration && namedTypes.TSTypeAliasDeclaration.check(node)) ||
+            (namedTypes.TSInterfaceDeclaration && namedTypes.TSInterfaceDeclaration.check(node))) {
+            addTypePattern(path.get("id"), scopeTypes);
+        }
+        else if (namedTypes.VariableDeclarator.check(node)) {
+            addPattern(path.get("id"), bindings);
+            recursiveScanChild(path.get("init"), bindings, scopeTypes);
+        }
+        else if (node.type === "ImportSpecifier" ||
+            node.type === "ImportNamespaceSpecifier" ||
+            node.type === "ImportDefaultSpecifier") {
+            addPattern(
+            // Esprima used to use the .name field to refer to the local
+            // binding identifier for ImportSpecifier nodes, but .id for
+            // ImportNamespaceSpecifier and ImportDefaultSpecifier nodes.
+            // ESTree/Acorn/ESpree use .local for all three node types.
+            path.get(node.local ? "local" :
+                node.name ? "name" : "id"), bindings);
+        }
+        else if (Node.check(node) && !Expression.check(node)) {
+            types.eachField(node, function (name, child) {
+                var childPath = path.get(name);
+                if (!pathHasValue(childPath, child)) {
+                    throw new Error("");
+                }
+                recursiveScanChild(childPath, bindings, scopeTypes);
+            });
+        }
+    }
+    function pathHasValue(path, value) {
+        if (path.value === value) {
+            return true;
+        }
+        // Empty arrays are probably produced by defaults.emptyArray, in which
+        // case is makes sense to regard them as equivalent, if not ===.
+        if (Array.isArray(path.value) &&
+            path.value.length === 0 &&
+            Array.isArray(value) &&
+            value.length === 0) {
+            return true;
+        }
+        return false;
+    }
+    function recursiveScanChild(path, bindings, scopeTypes) {
+        var node = path.value;
+        if (!node || Expression.check(node)) {
+            // Ignore falsy values and Expressions.
+        }
+        else if (namedTypes.FunctionDeclaration.check(node) &&
+            node.id !== null) {
+            addPattern(path.get("id"), bindings);
+        }
+        else if (namedTypes.ClassDeclaration &&
+            namedTypes.ClassDeclaration.check(node)) {
+            addPattern(path.get("id"), bindings);
+        }
+        else if (ScopeType.check(node)) {
+            if (namedTypes.CatchClause.check(node) &&
+                // TODO Broaden this to accept any pattern.
+                namedTypes.Identifier.check(node.param)) {
+                var catchParamName = node.param.name;
+                var hadBinding = hasOwn.call(bindings, catchParamName);
+                // Any declarations that occur inside the catch body that do
+                // not have the same name as the catch parameter should count
+                // as bindings in the outer scope.
+                recursiveScanScope(path.get("body"), bindings, scopeTypes);
+                // If a new binding matching the catch parameter name was
+                // created while scanning the catch body, ignore it because it
+                // actually refers to the catch parameter and not the outer
+                // scope that we're currently scanning.
+                if (!hadBinding) {
+                    delete bindings[catchParamName];
+                }
+            }
+        }
+        else {
+            recursiveScanScope(path, bindings, scopeTypes);
+        }
+    }
+    function addPattern(patternPath, bindings) {
+        var pattern = patternPath.value;
+        namedTypes.Pattern.assert(pattern);
+        if (namedTypes.Identifier.check(pattern)) {
+            if (hasOwn.call(bindings, pattern.name)) {
+                bindings[pattern.name].push(patternPath);
+            }
+            else {
+                bindings[pattern.name] = [patternPath];
+            }
+        }
+        else if (namedTypes.AssignmentPattern &&
+            namedTypes.AssignmentPattern.check(pattern)) {
+            addPattern(patternPath.get('left'), bindings);
+        }
+        else if (namedTypes.ObjectPattern &&
+            namedTypes.ObjectPattern.check(pattern)) {
+            patternPath.get('properties').each(function (propertyPath) {
+                var property = propertyPath.value;
+                if (namedTypes.Pattern.check(property)) {
+                    addPattern(propertyPath, bindings);
+                }
+                else if (namedTypes.Property.check(property)) {
+                    addPattern(propertyPath.get('value'), bindings);
+                }
+                else if (namedTypes.SpreadProperty &&
+                    namedTypes.SpreadProperty.check(property)) {
+                    addPattern(propertyPath.get('argument'), bindings);
+                }
+            });
+        }
+        else if (namedTypes.ArrayPattern &&
+            namedTypes.ArrayPattern.check(pattern)) {
+            patternPath.get('elements').each(function (elementPath) {
+                var element = elementPath.value;
+                if (namedTypes.Pattern.check(element)) {
+                    addPattern(elementPath, bindings);
+                }
+                else if (namedTypes.SpreadElement &&
+                    namedTypes.SpreadElement.check(element)) {
+                    addPattern(elementPath.get("argument"), bindings);
+                }
+            });
+        }
+        else if (namedTypes.PropertyPattern &&
+            namedTypes.PropertyPattern.check(pattern)) {
+            addPattern(patternPath.get('pattern'), bindings);
+        }
+        else if ((namedTypes.SpreadElementPattern &&
+            namedTypes.SpreadElementPattern.check(pattern)) ||
+            (namedTypes.SpreadPropertyPattern &&
+                namedTypes.SpreadPropertyPattern.check(pattern))) {
+            addPattern(patternPath.get('argument'), bindings);
+        }
+    }
+    function addTypePattern(patternPath, types) {
+        var pattern = patternPath.value;
+        namedTypes.Pattern.assert(pattern);
+        if (namedTypes.Identifier.check(pattern)) {
+            if (hasOwn.call(types, pattern.name)) {
+                types[pattern.name].push(patternPath);
+            }
+            else {
+                types[pattern.name] = [patternPath];
+            }
+        }
+    }
+    Sp.lookup = function (name) {
+        for (var scope = this; scope; scope = scope.parent)
+            if (scope.declares(name))
+                break;
+        return scope;
+    };
+    Sp.lookupType = function (name) {
+        for (var scope = this; scope; scope = scope.parent)
+            if (scope.declaresType(name))
+                break;
+        return scope;
+    };
+    Sp.getGlobalScope = function () {
+        var scope = this;
+        while (!scope.isGlobal)
+            scope = scope.parent;
+        return scope;
+    };
+    return Scope;
+}
+exports.default = scopePlugin;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/shared.d.ts b/node_modules/ast-types/lib/shared.d.ts
new file mode 100644
index 0000000..4a3044b
--- /dev/null
+++ b/node_modules/ast-types/lib/shared.d.ts
@@ -0,0 +1,13 @@
+import { Fork } from "../types";
+export default function (fork: Fork): {
+    geq: (than: any) => import("./types").Type<{}>;
+    defaults: {
+        "null": () => null;
+        "emptyArray": () => never[];
+        "false": () => boolean;
+        "true": () => boolean;
+        "undefined": () => void;
+        "use strict": () => string;
+    };
+    isPrimitive: import("./types").Type<{}>;
+};
diff --git a/node_modules/ast-types/lib/shared.js b/node_modules/ast-types/lib/shared.js
new file mode 100644
index 0000000..b29985c
--- /dev/null
+++ b/node_modules/ast-types/lib/shared.js
@@ -0,0 +1,49 @@
+"use strict";;
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var types_1 = __importDefault(require("./types"));
+function default_1(fork) {
+    var types = fork.use(types_1.default);
+    var Type = types.Type;
+    var builtin = types.builtInTypes;
+    var isNumber = builtin.number;
+    // An example of constructing a new type with arbitrary constraints from
+    // an existing type.
+    function geq(than) {
+        return Type.from(function (value) { return isNumber.check(value) && value >= than; }, isNumber + " >= " + than);
+    }
+    ;
+    // Default value-returning functions that may optionally be passed as a
+    // third argument to Def.prototype.field.
+    var defaults = {
+        // Functions were used because (among other reasons) that's the most
+        // elegant way to allow for the emptyArray one always to give a new
+        // array instance.
+        "null": function () { return null; },
+        "emptyArray": function () { return []; },
+        "false": function () { return false; },
+        "true": function () { return true; },
+        "undefined": function () { },
+        "use strict": function () { return "use strict"; }
+    };
+    var naiveIsPrimitive = Type.or(builtin.string, builtin.number, builtin.boolean, builtin.null, builtin.undefined);
+    var isPrimitive = Type.from(function (value) {
+        if (value === null)
+            return true;
+        var type = typeof value;
+        if (type === "object" ||
+            type === "function") {
+            return false;
+        }
+        return true;
+    }, naiveIsPrimitive.toString());
+    return {
+        geq: geq,
+        defaults: defaults,
+        isPrimitive: isPrimitive,
+    };
+}
+exports.default = default_1;
+module.exports = exports["default"];
diff --git a/node_modules/ast-types/lib/types.d.ts b/node_modules/ast-types/lib/types.d.ts
new file mode 100644
index 0000000..b0dd533
--- /dev/null
+++ b/node_modules/ast-types/lib/types.d.ts
@@ -0,0 +1,136 @@
+import { Fork } from "../types";
+declare type Deep = boolean | ((type: Type<any>, value: any) => void);
+export declare type Type<T> = ArrayType<T> | IdentityType<T> | ObjectType<T> | OrType<T> | PredicateType<T>;
+export interface AnyType {
+    toString(): string;
+    check(value: any, deep?: Deep): boolean;
+    assert(value: any, deep?: Deep): boolean;
+    arrayOf(): AnyType;
+}
+declare abstract class BaseType<T> {
+    abstract toString(): string;
+    abstract check(value: any, deep?: Deep): value is T;
+    assert(value: any, deep?: Deep): value is T;
+    arrayOf(): Type<T[]>;
+}
+declare class ArrayType<T> extends BaseType<T> {
+    readonly elemType: Type<T extends (infer E)[] ? E : never>;
+    readonly kind: "ArrayType";
+    constructor(elemType: Type<T extends (infer E)[] ? E : never>);
+    toString(): string;
+    check(value: any, deep?: Deep): value is T;
+}
+declare class IdentityType<T> extends BaseType<T> {
+    readonly value: T;
+    readonly kind: "IdentityType";
+    constructor(value: T);
+    toString(): string;
+    check(value: any, deep?: Deep): value is T;
+}
+declare class ObjectType<T> extends BaseType<T> {
+    readonly fields: Field<any>[];
+    readonly kind: "ObjectType";
+    constructor(fields: Field<any>[]);
+    toString(): string;
+    check(value: any, deep?: Deep): value is T;
+}
+declare class OrType<T> extends BaseType<T> {
+    readonly types: Type<any>[];
+    readonly kind: "OrType";
+    constructor(types: Type<any>[]);
+    toString(): string;
+    check(value: any, deep?: Deep): value is T;
+}
+declare class PredicateType<T> extends BaseType<T> {
+    readonly name: string;
+    readonly predicate: (value: any, deep?: Deep) => boolean;
+    readonly kind: "PredicateType";
+    constructor(name: string, predicate: (value: any, deep?: Deep) => boolean);
+    toString(): string;
+    check(value: any, deep?: Deep): value is T;
+}
+export declare abstract class Def<T = any> {
+    readonly type: Type<T>;
+    readonly typeName: string;
+    baseNames: string[];
+    ownFields: {
+        [name: string]: Field<any>;
+    };
+    allSupertypes: {
+        [name: string]: Def<any>;
+    };
+    supertypeList: string[];
+    allFields: {
+        [name: string]: Field<any>;
+    };
+    fieldNames: string[];
+    finalized: boolean;
+    buildable: boolean;
+    buildParams: string[];
+    constructor(type: Type<T>, typeName: string);
+    isSupertypeOf(that: Def<any>): boolean;
+    checkAllFields(value: any, deep?: any): boolean;
+    abstract check(value: any, deep?: any): boolean;
+    bases(...supertypeNames: string[]): this;
+    abstract build(...buildParams: string[]): this;
+    abstract field(name: string, type: any, defaultFn?: Function, hidden?: boolean): this;
+    abstract finalize(): void;
+}
+declare class Field<T> {
+    readonly name: string;
+    readonly type: Type<T>;
+    readonly defaultFn?: Function | undefined;
+    readonly hidden: boolean;
+    constructor(name: string, type: Type<T>, defaultFn?: Function | undefined, hidden?: boolean);
+    toString(): string;
+    getValue(obj: {
+        [key: string]: any;
+    }): any;
+}
+declare type FieldType<T> = Field<T>;
+export { FieldType as Field };
+export interface ASTNode {
+    type: string;
+}
+export interface Builder {
+    (...args: any[]): ASTNode;
+    from(obj: {
+        [param: string]: any;
+    }): ASTNode;
+}
+export default function typesPlugin(_fork: Fork): {
+    Type: {
+        or(...types: any[]): Type<any>;
+        from<T>(value: any, name?: string | undefined): Type<T>;
+        def(typeName: string): Def<any>;
+        hasDef(typeName: string): boolean;
+    };
+    builtInTypes: {
+        string: Type<string>;
+        function: Type<Function>;
+        array: Type<any[]>;
+        object: Type<{
+            [key: string]: any;
+        }>;
+        RegExp: Type<RegExp>;
+        Date: Type<Date>;
+        number: Type<number>;
+        boolean: Type<boolean>;
+        null: Type<null>;
+        undefined: Type<undefined>;
+    };
+    getSupertypeNames: (typeName: string) => string[];
+    computeSupertypeLookupTable: (candidates: any) => {
+        [typeName: string]: any;
+    };
+    builders: import("../gen/builders").builders;
+    defineMethod: (name: any, func?: Function | undefined) => Function;
+    getBuilderName: (typeName: any) => any;
+    getStatementBuilderName: (typeName: any) => any;
+    namedTypes: import("../gen/namedTypes").NamedTypes;
+    getFieldNames: (object: any) => string[];
+    getFieldValue: (object: any, fieldName: any) => any;
+    eachField: (object: any, callback: (name: any, value: any) => any, context?: any) => void;
+    someField: (object: any, callback: (name: any, value: any) => any, context?: any) => boolean;
+    finalize: () => void;
+};
diff --git a/node_modules/ast-types/lib/types.js b/node_modules/ast-types/lib/types.js
new file mode 100644
index 0000000..5e4703a
--- /dev/null
+++ b/node_modules/ast-types/lib/types.js
@@ -0,0 +1,781 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var Op = Object.prototype;
+var objToStr = Op.toString;
+var hasOwn = Op.hasOwnProperty;
+var BaseType = /** @class */ (function () {
+    function BaseType() {
+    }
+    BaseType.prototype.assert = function (value, deep) {
+        if (!this.check(value, deep)) {
+            var str = shallowStringify(value);
+            throw new Error(str + " does not match type " + this);
+        }
+        return true;
+    };
+    BaseType.prototype.arrayOf = function () {
+        var elemType = this;
+        return new ArrayType(elemType);
+    };
+    return BaseType;
+}());
+var ArrayType = /** @class */ (function (_super) {
+    __extends(ArrayType, _super);
+    function ArrayType(elemType) {
+        var _this = _super.call(this) || this;
+        _this.elemType = elemType;
+        _this.kind = "ArrayType";
+        return _this;
+    }
+    ArrayType.prototype.toString = function () {
+        return "[" + this.elemType + "]";
+    };
+    ArrayType.prototype.check = function (value, deep) {
+        var _this = this;
+        return Array.isArray(value) && value.every(function (elem) { return _this.elemType.check(elem, deep); });
+    };
+    return ArrayType;
+}(BaseType));
+var IdentityType = /** @class */ (function (_super) {
+    __extends(IdentityType, _super);
+    function IdentityType(value) {
+        var _this = _super.call(this) || this;
+        _this.value = value;
+        _this.kind = "IdentityType";
+        return _this;
+    }
+    IdentityType.prototype.toString = function () {
+        return String(this.value);
+    };
+    IdentityType.prototype.check = function (value, deep) {
+        var result = value === this.value;
+        if (!result && typeof deep === "function") {
+            deep(this, value);
+        }
+        return result;
+    };
+    return IdentityType;
+}(BaseType));
+var ObjectType = /** @class */ (function (_super) {
+    __extends(ObjectType, _super);
+    function ObjectType(fields) {
+        var _this = _super.call(this) || this;
+        _this.fields = fields;
+        _this.kind = "ObjectType";
+        return _this;
+    }
+    ObjectType.prototype.toString = function () {
+        return "{ " + this.fields.join(", ") + " }";
+    };
+    ObjectType.prototype.check = function (value, deep) {
+        return (objToStr.call(value) === objToStr.call({}) &&
+            this.fields.every(function (field) {
+                return field.type.check(value[field.name], deep);
+            }));
+    };
+    return ObjectType;
+}(BaseType));
+var OrType = /** @class */ (function (_super) {
+    __extends(OrType, _super);
+    function OrType(types) {
+        var _this = _super.call(this) || this;
+        _this.types = types;
+        _this.kind = "OrType";
+        return _this;
+    }
+    OrType.prototype.toString = function () {
+        return this.types.join(" | ");
+    };
+    OrType.prototype.check = function (value, deep) {
+        return this.types.some(function (type) {
+            return type.check(value, deep);
+        });
+    };
+    return OrType;
+}(BaseType));
+var PredicateType = /** @class */ (function (_super) {
+    __extends(PredicateType, _super);
+    function PredicateType(name, predicate) {
+        var _this = _super.call(this) || this;
+        _this.name = name;
+        _this.predicate = predicate;
+        _this.kind = "PredicateType";
+        return _this;
+    }
+    PredicateType.prototype.toString = function () {
+        return this.name;
+    };
+    PredicateType.prototype.check = function (value, deep) {
+        var result = this.predicate(value, deep);
+        if (!result && typeof deep === "function") {
+            deep(this, value);
+        }
+        return result;
+    };
+    return PredicateType;
+}(BaseType));
+var Def = /** @class */ (function () {
+    function Def(type, typeName) {
+        this.type = type;
+        this.typeName = typeName;
+        this.baseNames = [];
+        this.ownFields = Object.create(null);
+        // Includes own typeName. Populated during finalization.
+        this.allSupertypes = Object.create(null);
+        // Linear inheritance hierarchy. Populated during finalization.
+        this.supertypeList = [];
+        // Includes inherited fields.
+        this.allFields = Object.create(null);
+        // Non-hidden keys of allFields.
+        this.fieldNames = [];
+        // This property will be overridden as true by individual Def instances
+        // when they are finalized.
+        this.finalized = false;
+        // False by default until .build(...) is called on an instance.
+        this.buildable = false;
+        this.buildParams = [];
+    }
+    Def.prototype.isSupertypeOf = function (that) {
+        if (that instanceof Def) {
+            if (this.finalized !== true ||
+                that.finalized !== true) {
+                throw new Error("");
+            }
+            return hasOwn.call(that.allSupertypes, this.typeName);
+        }
+        else {
+            throw new Error(that + " is not a Def");
+        }
+    };
+    Def.prototype.checkAllFields = function (value, deep) {
+        var allFields = this.allFields;
+        if (this.finalized !== true) {
+            throw new Error("" + this.typeName);
+        }
+        function checkFieldByName(name) {
+            var field = allFields[name];
+            var type = field.type;
+            var child = field.getValue(value);
+            return type.check(child, deep);
+        }
+        return value !== null &&
+            typeof value === "object" &&
+            Object.keys(allFields).every(checkFieldByName);
+    };
+    Def.prototype.bases = function () {
+        var supertypeNames = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            supertypeNames[_i] = arguments[_i];
+        }
+        var bases = this.baseNames;
+        if (this.finalized) {
+            if (supertypeNames.length !== bases.length) {
+                throw new Error("");
+            }
+            for (var i = 0; i < supertypeNames.length; i++) {
+                if (supertypeNames[i] !== bases[i]) {
+                    throw new Error("");
+                }
+            }
+            return this;
+        }
+        supertypeNames.forEach(function (baseName) {
+            // This indexOf lookup may be O(n), but the typical number of base
+            // names is very small, and indexOf is a native Array method.
+            if (bases.indexOf(baseName) < 0) {
+                bases.push(baseName);
+            }
+        });
+        return this; // For chaining.
+    };
+    return Def;
+}());
+exports.Def = Def;
+var Field = /** @class */ (function () {
+    function Field(name, type, defaultFn, hidden) {
+        this.name = name;
+        this.type = type;
+        this.defaultFn = defaultFn;
+        this.hidden = !!hidden;
+    }
+    Field.prototype.toString = function () {
+        return JSON.stringify(this.name) + ": " + this.type;
+    };
+    Field.prototype.getValue = function (obj) {
+        var value = obj[this.name];
+        if (typeof value !== "undefined") {
+            return value;
+        }
+        if (typeof this.defaultFn === "function") {
+            value = this.defaultFn.call(obj);
+        }
+        return value;
+    };
+    return Field;
+}());
+function shallowStringify(value) {
+    if (Array.isArray(value)) {
+        return "[" + value.map(shallowStringify).join(", ") + "]";
+    }
+    if (value && typeof value === "object") {
+        return "{ " + Object.keys(value).map(function (key) {
+            return key + ": " + value[key];
+        }).join(", ") + " }";
+    }
+    return JSON.stringify(value);
+}
+function typesPlugin(_fork) {
+    var Type = {
+        or: function () {
+            var types = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                types[_i] = arguments[_i];
+            }
+            return new OrType(types.map(function (type) { return Type.from(type); }));
+        },
+        from: function (value, name) {
+            if (value instanceof ArrayType ||
+                value instanceof IdentityType ||
+                value instanceof ObjectType ||
+                value instanceof OrType ||
+                value instanceof PredicateType) {
+                return value;
+            }
+            // The Def type is used as a helper for constructing compound
+            // interface types for AST nodes.
+            if (value instanceof Def) {
+                return value.type;
+            }
+            // Support [ElemType] syntax.
+            if (isArray.check(value)) {
+                if (value.length !== 1) {
+                    throw new Error("only one element type is permitted for typed arrays");
+                }
+                return new ArrayType(Type.from(value[0]));
+            }
+            // Support { someField: FieldType, ... } syntax.
+            if (isObject.check(value)) {
+                return new ObjectType(Object.keys(value).map(function (name) {
+                    return new Field(name, Type.from(value[name], name));
+                }));
+            }
+            if (typeof value === "function") {
+                var bicfIndex = builtInCtorFns.indexOf(value);
+                if (bicfIndex >= 0) {
+                    return builtInCtorTypes[bicfIndex];
+                }
+                if (typeof name !== "string") {
+                    throw new Error("missing name");
+                }
+                return new PredicateType(name, value);
+            }
+            // As a last resort, toType returns a type that matches any value that
+            // is === from. This is primarily useful for literal values like
+            // toType(null), but it has the additional advantage of allowing
+            // toType to be a total function.
+            return new IdentityType(value);
+        },
+        // Define a type whose name is registered in a namespace (the defCache) so
+        // that future definitions will return the same type given the same name.
+        // In particular, this system allows for circular and forward definitions.
+        // The Def object d returned from Type.def may be used to configure the
+        // type d.type by calling methods such as d.bases, d.build, and d.field.
+        def: function (typeName) {
+            return hasOwn.call(defCache, typeName)
+                ? defCache[typeName]
+                : defCache[typeName] = new DefImpl(typeName);
+        },
+        hasDef: function (typeName) {
+            return hasOwn.call(defCache, typeName);
+        }
+    };
+    var builtInCtorFns = [];
+    var builtInCtorTypes = [];
+    var builtInTypes = {};
+    function defBuiltInType(example, name) {
+        var objStr = objToStr.call(example);
+        var type = new PredicateType(name, function (value) { return objToStr.call(value) === objStr; });
+        builtInTypes[name] = type;
+        if (example && typeof example.constructor === "function") {
+            builtInCtorFns.push(example.constructor);
+            builtInCtorTypes.push(type);
+        }
+        return type;
+    }
+    // These types check the underlying [[Class]] attribute of the given
+    // value, rather than using the problematic typeof operator. Note however
+    // that no subtyping is considered; so, for instance, isObject.check
+    // returns false for [], /./, new Date, and null.
+    var isString = defBuiltInType("truthy", "string");
+    var isFunction = defBuiltInType(function () { }, "function");
+    var isArray = defBuiltInType([], "array");
+    var isObject = defBuiltInType({}, "object");
+    var isRegExp = defBuiltInType(/./, "RegExp");
+    var isDate = defBuiltInType(new Date, "Date");
+    var isNumber = defBuiltInType(3, "number");
+    var isBoolean = defBuiltInType(true, "boolean");
+    var isNull = defBuiltInType(null, "null");
+    var isUndefined = defBuiltInType(void 0, "undefined");
+    // In order to return the same Def instance every time Type.def is called
+    // with a particular name, those instances need to be stored in a cache.
+    var defCache = Object.create(null);
+    function defFromValue(value) {
+        if (value && typeof value === "object") {
+            var type = value.type;
+            if (typeof type === "string" &&
+                hasOwn.call(defCache, type)) {
+                var d = defCache[type];
+                if (d.finalized) {
+                    return d;
+                }
+            }
+        }
+        return null;
+    }
+    var DefImpl = /** @class */ (function (_super) {
+        __extends(DefImpl, _super);
+        function DefImpl(typeName) {
+            var _this = _super.call(this, new PredicateType(typeName, function (value, deep) { return _this.check(value, deep); }), typeName) || this;
+            return _this;
+        }
+        DefImpl.prototype.check = function (value, deep) {
+            if (this.finalized !== true) {
+                throw new Error("prematurely checking unfinalized type " + this.typeName);
+            }
+            // A Def type can only match an object value.
+            if (value === null || typeof value !== "object") {
+                return false;
+            }
+            var vDef = defFromValue(value);
+            if (!vDef) {
+                // If we couldn't infer the Def associated with the given value,
+                // and we expected it to be a SourceLocation or a Position, it was
+                // probably just missing a "type" field (because Esprima does not
+                // assign a type property to such nodes). Be optimistic and let
+                // this.checkAllFields make the final decision.
+                if (this.typeName === "SourceLocation" ||
+                    this.typeName === "Position") {
+                    return this.checkAllFields(value, deep);
+                }
+                // Calling this.checkAllFields for any other type of node is both
+                // bad for performance and way too forgiving.
+                return false;
+            }
+            // If checking deeply and vDef === this, then we only need to call
+            // checkAllFields once. Calling checkAllFields is too strict when deep
+            // is false, because then we only care about this.isSupertypeOf(vDef).
+            if (deep && vDef === this) {
+                return this.checkAllFields(value, deep);
+            }
+            // In most cases we rely exclusively on isSupertypeOf to make O(1)
+            // subtyping determinations. This suffices in most situations outside
+            // of unit tests, since interface conformance is checked whenever new
+            // instances are created using builder functions.
+            if (!this.isSupertypeOf(vDef)) {
+                return false;
+            }
+            // The exception is when deep is true; then, we recursively check all
+            // fields.
+            if (!deep) {
+                return true;
+            }
+            // Use the more specific Def (vDef) to perform the deep check, but
+            // shallow-check fields defined by the less specific Def (this).
+            return vDef.checkAllFields(value, deep)
+                && this.checkAllFields(value, false);
+        };
+        DefImpl.prototype.build = function () {
+            var _this = this;
+            var buildParams = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                buildParams[_i] = arguments[_i];
+            }
+            // Calling Def.prototype.build multiple times has the effect of merely
+            // redefining this property.
+            this.buildParams = buildParams;
+            if (this.buildable) {
+                // If this Def is already buildable, update self.buildParams and
+                // continue using the old builder function.
+                return this;
+            }
+            // Every buildable type will have its "type" field filled in
+            // automatically. This includes types that are not subtypes of Node,
+            // like SourceLocation, but that seems harmless (TODO?).
+            this.field("type", String, function () { return _this.typeName; });
+            // Override Dp.buildable for this Def instance.
+            this.buildable = true;
+            var addParam = function (built, param, arg, isArgAvailable) {
+                if (hasOwn.call(built, param))
+                    return;
+                var all = _this.allFields;
+                if (!hasOwn.call(all, param)) {
+                    throw new Error("" + param);
+                }
+                var field = all[param];
+                var type = field.type;
+                var value;
+                if (isArgAvailable) {
+                    value = arg;
+                }
+                else if (field.defaultFn) {
+                    // Expose the partially-built object to the default
+                    // function as its `this` object.
+                    value = field.defaultFn.call(built);
+                }
+                else {
+                    var message = "no value or default function given for field " +
+                        JSON.stringify(param) + " of " + _this.typeName + "(" +
+                        _this.buildParams.map(function (name) {
+                            return all[name];
+                        }).join(", ") + ")";
+                    throw new Error(message);
+                }
+                if (!type.check(value)) {
+                    throw new Error(shallowStringify(value) +
+                        " does not match field " + field +
+                        " of type " + _this.typeName);
+                }
+                built[param] = value;
+            };
+            // Calling the builder function will construct an instance of the Def,
+            // with positional arguments mapped to the fields original passed to .build.
+            // If not enough arguments are provided, the default value for the remaining fields
+            // will be used.
+            var builder = function () {
+                var args = [];
+                for (var _i = 0; _i < arguments.length; _i++) {
+                    args[_i] = arguments[_i];
+                }
+                var argc = args.length;
+                if (!_this.finalized) {
+                    throw new Error("attempting to instantiate unfinalized type " +
+                        _this.typeName);
+                }
+                var built = Object.create(nodePrototype);
+                _this.buildParams.forEach(function (param, i) {
+                    if (i < argc) {
+                        addParam(built, param, args[i], true);
+                    }
+                    else {
+                        addParam(built, param, null, false);
+                    }
+                });
+                Object.keys(_this.allFields).forEach(function (param) {
+                    // Use the default value.
+                    addParam(built, param, null, false);
+                });
+                // Make sure that the "type" field was filled automatically.
+                if (built.type !== _this.typeName) {
+                    throw new Error("");
+                }
+                return built;
+            };
+            // Calling .from on the builder function will construct an instance of the Def,
+            // using field values from the passed object. For fields missing from the passed object,
+            // their default value will be used.
+            builder.from = function (obj) {
+                if (!_this.finalized) {
+                    throw new Error("attempting to instantiate unfinalized type " +
+                        _this.typeName);
+                }
+                var built = Object.create(nodePrototype);
+                Object.keys(_this.allFields).forEach(function (param) {
+                    if (hasOwn.call(obj, param)) {
+                        addParam(built, param, obj[param], true);
+                    }
+                    else {
+                        addParam(built, param, null, false);
+                    }
+                });
+                // Make sure that the "type" field was filled automatically.
+                if (built.type !== _this.typeName) {
+                    throw new Error("");
+                }
+                return built;
+            };
+            Object.defineProperty(builders, getBuilderName(this.typeName), {
+                enumerable: true,
+                value: builder
+            });
+            return this;
+        };
+        // The reason fields are specified using .field(...) instead of an object
+        // literal syntax is somewhat subtle: the object literal syntax would
+        // support only one key and one value, but with .field(...) we can pass
+        // any number of arguments to specify the field.
+        DefImpl.prototype.field = function (name, type, defaultFn, hidden) {
+            if (this.finalized) {
+                console.error("Ignoring attempt to redefine field " +
+                    JSON.stringify(name) + " of finalized type " +
+                    JSON.stringify(this.typeName));
+                return this;
+            }
+            this.ownFields[name] = new Field(name, Type.from(type), defaultFn, hidden);
+            return this; // For chaining.
+        };
+        DefImpl.prototype.finalize = function () {
+            var _this = this;
+            // It's not an error to finalize a type more than once, but only the
+            // first call to .finalize does anything.
+            if (!this.finalized) {
+                var allFields = this.allFields;
+                var allSupertypes = this.allSupertypes;
+                this.baseNames.forEach(function (name) {
+                    var def = defCache[name];
+                    if (def instanceof Def) {
+                        def.finalize();
+                        extend(allFields, def.allFields);
+                        extend(allSupertypes, def.allSupertypes);
+                    }
+                    else {
+                        var message = "unknown supertype name " +
+                            JSON.stringify(name) +
+                            " for subtype " +
+                            JSON.stringify(_this.typeName);
+                        throw new Error(message);
+                    }
+                });
+                // TODO Warn if fields are overridden with incompatible types.
+                extend(allFields, this.ownFields);
+                allSupertypes[this.typeName] = this;
+                this.fieldNames.length = 0;
+                for (var fieldName in allFields) {
+                    if (hasOwn.call(allFields, fieldName) &&
+                        !allFields[fieldName].hidden) {
+                        this.fieldNames.push(fieldName);
+                    }
+                }
+                // Types are exported only once they have been finalized.
+                Object.defineProperty(namedTypes, this.typeName, {
+                    enumerable: true,
+                    value: this.type
+                });
+                this.finalized = true;
+                // A linearization of the inheritance hierarchy.
+                populateSupertypeList(this.typeName, this.supertypeList);
+                if (this.buildable &&
+                    this.supertypeList.lastIndexOf("Expression") >= 0) {
+                    wrapExpressionBuilderWithStatement(this.typeName);
+                }
+            }
+        };
+        return DefImpl;
+    }(Def));
+    // Note that the list returned by this function is a copy of the internal
+    // supertypeList, *without* the typeName itself as the first element.
+    function getSupertypeNames(typeName) {
+        if (!hasOwn.call(defCache, typeName)) {
+            throw new Error("");
+        }
+        var d = defCache[typeName];
+        if (d.finalized !== true) {
+            throw new Error("");
+        }
+        return d.supertypeList.slice(1);
+    }
+    // Returns an object mapping from every known type in the defCache to the
+    // most specific supertype whose name is an own property of the candidates
+    // object.
+    function computeSupertypeLookupTable(candidates) {
+        var table = {};
+        var typeNames = Object.keys(defCache);
+        var typeNameCount = typeNames.length;
+        for (var i = 0; i < typeNameCount; ++i) {
+            var typeName = typeNames[i];
+            var d = defCache[typeName];
+            if (d.finalized !== true) {
+                throw new Error("" + typeName);
+            }
+            for (var j = 0; j < d.supertypeList.length; ++j) {
+                var superTypeName = d.supertypeList[j];
+                if (hasOwn.call(candidates, superTypeName)) {
+                    table[typeName] = superTypeName;
+                    break;
+                }
+            }
+        }
+        return table;
+    }
+    var builders = Object.create(null);
+    // This object is used as prototype for any node created by a builder.
+    var nodePrototype = {};
+    // Call this function to define a new method to be shared by all AST
+    // nodes. The replaced method (if any) is returned for easy wrapping.
+    function defineMethod(name, func) {
+        var old = nodePrototype[name];
+        // Pass undefined as func to delete nodePrototype[name].
+        if (isUndefined.check(func)) {
+            delete nodePrototype[name];
+        }
+        else {
+            isFunction.assert(func);
+            Object.defineProperty(nodePrototype, name, {
+                enumerable: true,
+                configurable: true,
+                value: func
+            });
+        }
+        return old;
+    }
+    function getBuilderName(typeName) {
+        return typeName.replace(/^[A-Z]+/, function (upperCasePrefix) {
+            var len = upperCasePrefix.length;
+            switch (len) {
+                case 0: return "";
+                // If there's only one initial capital letter, just lower-case it.
+                case 1: return upperCasePrefix.toLowerCase();
+                default:
+                    // If there's more than one initial capital letter, lower-case
+                    // all but the last one, so that XMLDefaultDeclaration (for
+                    // example) becomes xmlDefaultDeclaration.
+                    return upperCasePrefix.slice(0, len - 1).toLowerCase() +
+                        upperCasePrefix.charAt(len - 1);
+            }
+        });
+    }
+    function getStatementBuilderName(typeName) {
+        typeName = getBuilderName(typeName);
+        return typeName.replace(/(Expression)?$/, "Statement");
+    }
+    var namedTypes = {};
+    // Like Object.keys, but aware of what fields each AST type should have.
+    function getFieldNames(object) {
+        var d = defFromValue(object);
+        if (d) {
+            return d.fieldNames.slice(0);
+        }
+        if ("type" in object) {
+            throw new Error("did not recognize object of type " +
+                JSON.stringify(object.type));
+        }
+        return Object.keys(object);
+    }
+    // Get the value of an object property, taking object.type and default
+    // functions into account.
+    function getFieldValue(object, fieldName) {
+        var d = defFromValue(object);
+        if (d) {
+            var field = d.allFields[fieldName];
+            if (field) {
+                return field.getValue(object);
+            }
+        }
+        return object && object[fieldName];
+    }
+    // Iterate over all defined fields of an object, including those missing
+    // or undefined, passing each field name and effective value (as returned
+    // by getFieldValue) to the callback. If the object has no corresponding
+    // Def, the callback will never be called.
+    function eachField(object, callback, context) {
+        getFieldNames(object).forEach(function (name) {
+            callback.call(this, name, getFieldValue(object, name));
+        }, context);
+    }
+    // Similar to eachField, except that iteration stops as soon as the
+    // callback returns a truthy value. Like Array.prototype.some, the final
+    // result is either true or false to indicates whether the callback
+    // returned true for any element or not.
+    function someField(object, callback, context) {
+        return getFieldNames(object).some(function (name) {
+            return callback.call(this, name, getFieldValue(object, name));
+        }, context);
+    }
+    // Adds an additional builder for Expression subtypes
+    // that wraps the built Expression in an ExpressionStatements.
+    function wrapExpressionBuilderWithStatement(typeName) {
+        var wrapperName = getStatementBuilderName(typeName);
+        // skip if the builder already exists
+        if (builders[wrapperName])
+            return;
+        // the builder function to wrap with builders.ExpressionStatement
+        var wrapped = builders[getBuilderName(typeName)];
+        // skip if there is nothing to wrap
+        if (!wrapped)
+            return;
+        var builder = function () {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            return builders.expressionStatement(wrapped.apply(builders, args));
+        };
+        builder.from = function () {
+            var args = [];
+            for (var _i = 0; _i < arguments.length; _i++) {
+                args[_i] = arguments[_i];
+            }
+            return builders.expressionStatement(wrapped.from.apply(builders, args));
+        };
+        builders[wrapperName] = builder;
+    }
+    function populateSupertypeList(typeName, list) {
+        list.length = 0;
+        list.push(typeName);
+        var lastSeen = Object.create(null);
+        for (var pos = 0; pos < list.length; ++pos) {
+            typeName = list[pos];
+            var d = defCache[typeName];
+            if (d.finalized !== true) {
+                throw new Error("");
+            }
+            // If we saw typeName earlier in the breadth-first traversal,
+            // delete the last-seen occurrence.
+            if (hasOwn.call(lastSeen, typeName)) {
+                delete list[lastSeen[typeName]];
+            }
+            // Record the new index of the last-seen occurrence of typeName.
+            lastSeen[typeName] = pos;
+            // Enqueue the base names of this type.
+            list.push.apply(list, d.baseNames);
+        }
+        // Compaction loop to remove array holes.
+        for (var to = 0, from = to, len = list.length; from < len; ++from) {
+            if (hasOwn.call(list, from)) {
+                list[to++] = list[from];
+            }
+        }
+        list.length = to;
+    }
+    function extend(into, from) {
+        Object.keys(from).forEach(function (name) {
+            into[name] = from[name];
+        });
+        return into;
+    }
+    function finalize() {
+        Object.keys(defCache).forEach(function (name) {
+            defCache[name].finalize();
+        });
+    }
+    return {
+        Type: Type,
+        builtInTypes: builtInTypes,
+        getSupertypeNames: getSupertypeNames,
+        computeSupertypeLookupTable: computeSupertypeLookupTable,
+        builders: builders,
+        defineMethod: defineMethod,
+        getBuilderName: getBuilderName,
+        getStatementBuilderName: getStatementBuilderName,
+        namedTypes: namedTypes,
+        getFieldNames: getFieldNames,
+        getFieldValue: getFieldValue,
+        eachField: eachField,
+        someField: someField,
+        finalize: finalize,
+    };
+}
+exports.default = typesPlugin;
+;
diff --git a/node_modules/ast-types/main.d.ts b/node_modules/ast-types/main.d.ts
new file mode 100644
index 0000000..6b9a8d0
--- /dev/null
+++ b/node_modules/ast-types/main.d.ts
@@ -0,0 +1,28 @@
+import { ASTNode, Type, AnyType, Field } from "./lib/types";
+import { NodePath } from "./lib/node-path";
+import { namedTypes } from "./gen/namedTypes";
+import { builders } from "./gen/builders";
+import { Visitor } from "./gen/visitor";
+declare const astNodesAreEquivalent: {
+    (a: any, b: any, problemPath?: any): boolean;
+    assert(a: any, b: any): void;
+}, builders: builders, builtInTypes: {
+    string: Type<string>;
+    function: Type<Function>;
+    array: Type<any[]>;
+    object: Type<{
+        [key: string]: any;
+    }>;
+    RegExp: Type<RegExp>;
+    Date: Type<Date>;
+    number: Type<number>;
+    boolean: Type<boolean>;
+    null: Type<null>;
+    undefined: Type<undefined>;
+}, defineMethod: (name: any, func?: Function | undefined) => Function, eachField: (object: any, callback: (name: any, value: any) => any, context?: any) => void, finalize: () => void, getBuilderName: (typeName: any) => any, getFieldNames: (object: any) => string[], getFieldValue: (object: any, fieldName: any) => any, getSupertypeNames: (typeName: string) => string[], NodePath: import("./lib/node-path").NodePathConstructor, Path: import("./lib/path").PathConstructor, PathVisitor: import("./lib/path-visitor").PathVisitorConstructor, someField: (object: any, callback: (name: any, value: any) => any, context?: any) => boolean, Type: {
+    or(...types: any[]): Type<any>;
+    from<T>(value: any, name?: string | undefined): Type<T>;
+    def(typeName: string): import("./lib/types").Def<any>;
+    hasDef(typeName: string): boolean;
+}, use: <T>(plugin: import("./types").Plugin<T>) => T, visit: <M = {}>(node: ASTNode, methods?: Visitor<M> | undefined) => any;
+export { AnyType, ASTNode, astNodesAreEquivalent, builders, builtInTypes, defineMethod, eachField, Field, finalize, getBuilderName, getFieldNames, getFieldValue, getSupertypeNames, namedTypes, NodePath, Path, PathVisitor, someField, Type, use, visit, Visitor, };
diff --git a/node_modules/ast-types/main.js b/node_modules/ast-types/main.js
new file mode 100644
index 0000000..47a97eb
--- /dev/null
+++ b/node_modules/ast-types/main.js
@@ -0,0 +1,52 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var fork_1 = __importDefault(require("./fork"));
+var core_1 = __importDefault(require("./def/core"));
+var es6_1 = __importDefault(require("./def/es6"));
+var es7_1 = __importDefault(require("./def/es7"));
+var jsx_1 = __importDefault(require("./def/jsx"));
+var flow_1 = __importDefault(require("./def/flow"));
+var esprima_1 = __importDefault(require("./def/esprima"));
+var babel_1 = __importDefault(require("./def/babel"));
+var typescript_1 = __importDefault(require("./def/typescript"));
+var es_proposals_1 = __importDefault(require("./def/es-proposals"));
+var namedTypes_1 = require("./gen/namedTypes");
+exports.namedTypes = namedTypes_1.namedTypes;
+var _a = fork_1.default([
+    // This core module of AST types captures ES5 as it is parsed today by
+    // git://github.com/ariya/esprima.git#master.
+    core_1.default,
+    // Feel free to add to or remove from this list of extension modules to
+    // configure the precise type hierarchy that you need.
+    es6_1.default,
+    es7_1.default,
+    jsx_1.default,
+    flow_1.default,
+    esprima_1.default,
+    babel_1.default,
+    typescript_1.default,
+    es_proposals_1.default,
+]), astNodesAreEquivalent = _a.astNodesAreEquivalent, builders = _a.builders, builtInTypes = _a.builtInTypes, defineMethod = _a.defineMethod, eachField = _a.eachField, finalize = _a.finalize, getBuilderName = _a.getBuilderName, getFieldNames = _a.getFieldNames, getFieldValue = _a.getFieldValue, getSupertypeNames = _a.getSupertypeNames, n = _a.namedTypes, NodePath = _a.NodePath, Path = _a.Path, PathVisitor = _a.PathVisitor, someField = _a.someField, Type = _a.Type, use = _a.use, visit = _a.visit;
+exports.astNodesAreEquivalent = astNodesAreEquivalent;
+exports.builders = builders;
+exports.builtInTypes = builtInTypes;
+exports.defineMethod = defineMethod;
+exports.eachField = eachField;
+exports.finalize = finalize;
+exports.getBuilderName = getBuilderName;
+exports.getFieldNames = getFieldNames;
+exports.getFieldValue = getFieldValue;
+exports.getSupertypeNames = getSupertypeNames;
+exports.NodePath = NodePath;
+exports.Path = Path;
+exports.PathVisitor = PathVisitor;
+exports.someField = someField;
+exports.Type = Type;
+exports.use = use;
+exports.visit = visit;
+// Populate the exported fields of the namedTypes namespace, while still
+// retaining its member types.
+Object.assign(namedTypes_1.namedTypes, n);
diff --git a/node_modules/ast-types/package.json b/node_modules/ast-types/package.json
new file mode 100644
index 0000000..ba529ee
--- /dev/null
+++ b/node_modules/ast-types/package.json
@@ -0,0 +1,94 @@
+{
+  "_from": "ast-types@0.13.2",
+  "_id": "ast-types@0.13.2",
+  "_inBundle": false,
+  "_integrity": "sha512-uWMHxJxtfj/1oZClOxDEV1sQ1HCDkA4MG8Gr69KKeBjEVH0R84WlejZ0y2DcwyBlpAEMltmVYkVgqfLFb2oyiA==",
+  "_location": "/ast-types",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "version",
+    "registry": true,
+    "raw": "ast-types@0.13.2",
+    "name": "ast-types",
+    "escapedName": "ast-types",
+    "rawSpec": "0.13.2",
+    "saveSpec": null,
+    "fetchSpec": "0.13.2"
+  },
+  "_requiredBy": [
+    "/recast"
+  ],
+  "_resolved": "https://registry.npmjs.org/ast-types/-/ast-types-0.13.2.tgz",
+  "_shasum": "df39b677a911a83f3a049644fb74fdded23cea48",
+  "_spec": "ast-types@0.13.2",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/recast",
+  "author": {
+    "name": "Ben Newman",
+    "email": "bn@cs.stanford.edu"
+  },
+  "bugs": {
+    "url": "https://github.com/benjamn/ast-types/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {},
+  "deprecated": false,
+  "description": "Esprima-compatible implementation of the Mozilla JS Parser API",
+  "devDependencies": {
+    "@babel/parser": "7.4.4",
+    "@babel/types": "7.4.4",
+    "@types/esprima": "4.0.2",
+    "@types/glob": "7.1.1",
+    "@types/mocha": "5.2.6",
+    "@types/node": "12.0.0",
+    "espree": "5.0.1",
+    "esprima": "4.0.1",
+    "esprima-fb": "15001.1001.0-dev-harmony-fb",
+    "flow-parser": "0.98.1",
+    "glob": "7.1.4",
+    "mocha": "6.1.4",
+    "recast": "0.18.1",
+    "reify": "0.20.6",
+    "ts-add-module-exports": "1.0.0",
+    "ts-emit-clean": "1.0.0",
+    "ts-node": "7.0.1",
+    "typescript": "3.4.5"
+  },
+  "engines": {
+    "node": ">=4"
+  },
+  "homepage": "http://github.com/benjamn/ast-types",
+  "keywords": [
+    "ast",
+    "abstract syntax tree",
+    "hierarchy",
+    "mozilla",
+    "spidermonkey",
+    "parser api",
+    "esprima",
+    "types",
+    "type system",
+    "type checking",
+    "dynamic types",
+    "parsing",
+    "transformation",
+    "syntax"
+  ],
+  "license": "MIT",
+  "main": "main.js",
+  "name": "ast-types",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/benjamn/ast-types.git"
+  },
+  "scripts": {
+    "build": "tsc && ts-add-module-exports",
+    "clean": "ts-emit-clean",
+    "gen": "ts-node --transpile-only script/gen-types.ts",
+    "mocha": "test/run.sh",
+    "postpack": "npm run clean",
+    "prepack": "npm run clean && npm run gen && npm run build",
+    "test": "npm run gen && npm run build && npm run mocha"
+  },
+  "types": "main.d.ts",
+  "version": "0.13.2"
+}
diff --git a/node_modules/ast-types/tsconfig.json b/node_modules/ast-types/tsconfig.json
new file mode 100644
index 0000000..494f4e4
--- /dev/null
+++ b/node_modules/ast-types/tsconfig.json
@@ -0,0 +1,20 @@
+{
+  "compilerOptions": {
+    "target": "es5",
+    "module": "commonjs",
+    "declaration": true,
+    "rootDir": ".",
+    "strict": true,
+    "noUnusedLocals": true,
+    "noUnusedParameters": true,
+    "noImplicitReturns": true,
+    "moduleResolution": "node",
+    "esModuleInterop": true,
+    "stripInternal": true,
+    "lib": ["es2015"]
+  },
+  "exclude": [
+    "node_modules",
+    "test/data"
+  ]
+}
diff --git a/node_modules/ast-types/types.d.ts b/node_modules/ast-types/types.d.ts
new file mode 100644
index 0000000..0465896
--- /dev/null
+++ b/node_modules/ast-types/types.d.ts
@@ -0,0 +1,6 @@
+export declare type Fork = {
+    use<T>(plugin: Plugin<T>): T;
+};
+export declare type Plugin<T> = (fork: Fork) => T;
+export declare type Def = Plugin<void>;
+export declare type Omit<T, K> = Pick<T, Exclude<keyof T, K>>;
diff --git a/node_modules/ast-types/types.js b/node_modules/ast-types/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ast-types/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bianco.attr/LICENSE b/node_modules/bianco.attr/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/bianco.attr/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/bianco.attr/README.md b/node_modules/bianco.attr/README.md
new file mode 100644
index 0000000..440b1c6
--- /dev/null
+++ b/node_modules/bianco.attr/README.md
@@ -0,0 +1,162 @@
+# bianco.attr
+
+[![Build Status][travis-image]][travis-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Usage
+
+```js
+import { set, get, has, remove } from 'bianco.attr'
+
+// set an attribute on a node
+const img = document.createElement('img')
+
+set(img, 'width', 100)
+get(img, 'width') // => '100'
+has(img, 'width') // => true
+
+remove(img, 'width')
+get(img, 'width') // => null
+```
+
+[travis-image]: https://img.shields.io/travis/biancojs/attr.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/biancojs/attr
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE.txt
+
+[npm-version-image]: http://img.shields.io/npm/v/bianco.attr.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/bianco.attr.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/bianco.attr
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+#### Table of Contents
+
+-   [set](#set)
+    -   [Parameters](#parameters)
+    -   [Examples](#examples)
+-   [get](#get)
+    -   [Parameters](#parameters-1)
+    -   [Examples](#examples-1)
+-   [remove](#remove)
+    -   [Parameters](#parameters-2)
+    -   [Examples](#examples-2)
+-   [has](#has)
+    -   [Parameters](#parameters-3)
+    -   [Examples](#examples-3)
+
+### set
+
+Set any attribute on a single or a list of DOM nodes
+
+#### Parameters
+
+-   `els` **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** DOM node/s to parse
+-   `name` **([string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String) \| [Object](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object))** either the name of the attribute to set
+                                                    or a list of properties as object key - value
+-   `value` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** the new value of the attribute (optional)
+
+#### Examples
+
+```javascript
+import { set } from 'bianco.attr'
+
+const img = document.createElement('img')
+
+set(img, 'width', 100)
+
+// or also
+set(img, {
+  width: 300,
+  height: 300
+})
+```
+
+Returns **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** the original array of elements passed to this function
+
+### get
+
+Get any attribute from a single or a list of DOM nodes
+
+#### Parameters
+
+-   `els` **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** DOM node/s to parse
+-   `name` **([string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** name or list of attributes to get
+
+#### Examples
+
+```javascript
+import { get } from 'bianco.attr'
+
+const img = document.createElement('img')
+
+get(img, 'width') // => '200'
+
+// or also
+get(img, ['width', 'height']) // => ['200', '300']
+
+// or also
+get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+```
+
+Returns **([Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array) \| [string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String))** list of the attributes found
+
+### remove
+
+Remove any attribute from a single or a list of DOM nodes
+
+#### Parameters
+
+-   `els` **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** DOM node/s to parse
+-   `name` **([string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** name or list of attributes to remove
+
+#### Examples
+
+```javascript
+import { remove } from 'bianco.attr'
+
+remove(img, 'width') // remove the width attribute
+
+// or also
+remove(img, ['width', 'height']) // remove the width and the height attribute
+
+// or also
+remove([img1, img2], ['width', 'height']) // remove the width and the height attribute from both images
+```
+
+Returns **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** the original array of elements passed to this function
+
+### has
+
+Set any attribute on a single or a list of DOM nodes
+
+#### Parameters
+
+-   `els` **([HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/docs/Web/API/NodeList) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** DOM node/s to parse
+-   `name` **([string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** name or list of attributes to detect
+
+#### Examples
+
+```javascript
+import { has } from 'bianco.attr'
+
+has(img, 'width') // false
+
+// or also
+has(img, ['width', 'height']) // => [false, false]
+
+// or also
+has([img1, img2], ['width', 'height']) // => [[false, false], [false, false]]
+```
+
+Returns **([boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean) \| [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array))** true or false or an array of boolean values
diff --git a/node_modules/bianco.attr/index.js b/node_modules/bianco.attr/index.js
new file mode 100644
index 0000000..e8548c9
--- /dev/null
+++ b/node_modules/bianco.attr/index.js
@@ -0,0 +1,143 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
+
+var domToArray = _interopDefault(require('bianco.dom-to-array'));
+
+/**
+ * Normalize the return values, in case of a single value we avoid to return an array
+ * @param   { Array } values - list of values we want to return
+ * @returns { Array|string|boolean } either the whole list of values or the single one found
+ * @private
+ */
+const normalize = values => values.length === 1 ? values[0] : values;
+
+/**
+ * Parse all the nodes received to get/remove/check their attributes
+ * @param   { HTMLElement|NodeList|Array } els    - DOM node/s to parse
+ * @param   { string|Array }               name   - name or list of attributes
+ * @param   { string }                     method - method that will be used to parse the attributes
+ * @returns { Array|string } result of the parsing in a list or a single value
+ * @private
+ */
+function parseNodes(els, name, method) {
+  const names = typeof name === 'string' ? [name] : name;
+  return normalize(domToArray(els).map(el => {
+    return normalize(names.map(n => el[method](n)))
+  }))
+}
+
+/**
+ * Set any attribute on a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Object }              name  - either the name of the attribute to set
+ *                                                 or a list of properties as object key - value
+ * @param   { string }                     value - the new value of the attribute (optional)
+ * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+ *
+ * @example
+ *
+ * import { set } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * set(img, 'width', 100)
+ *
+ * // or also
+ * set(img, {
+ *   width: 300,
+ *   height: 300
+ * })
+ *
+ */
+function set(els, name, value) {
+  const attrs = typeof name === 'object' ? name : { [name]: value };
+  const props = Object.keys(attrs);
+
+  domToArray(els).forEach(el => {
+    props.forEach(prop => el.setAttribute(prop, attrs[prop]));
+  });
+  return els
+}
+
+/**
+ * Get any attribute from a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to get
+ * @returns { Array|string } list of the attributes found
+ *
+ * @example
+ *
+ * import { get } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * get(img, 'width') // => '200'
+ *
+ * // or also
+ * get(img, ['width', 'height']) // => ['200', '300']
+ *
+ * // or also
+ * get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+ */
+function get(els, name) {
+  return parseNodes(els, name, 'getAttribute')
+}
+
+/**
+ * Remove any attribute from a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to remove
+ * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+ *
+ * @example
+ *
+ * import { remove } from 'bianco.attr'
+ *
+ * remove(img, 'width') // remove the width attribute
+ *
+ * // or also
+ * remove(img, ['width', 'height']) // remove the width and the height attribute
+ *
+ * // or also
+ * remove([img1, img2], ['width', 'height']) // remove the width and the height attribute from both images
+ */
+function remove(els, name) {
+  return parseNodes(els, name, 'removeAttribute')
+}
+
+/**
+ * Set any attribute on a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to detect
+ * @returns { boolean|Array } true or false or an array of boolean values
+ * @example
+ *
+ * import { has } from 'bianco.attr'
+ *
+ * has(img, 'width') // false
+ *
+ * // or also
+ * has(img, ['width', 'height']) // => [false, false]
+ *
+ * // or also
+ * has([img1, img2], ['width', 'height']) // => [[false, false], [false, false]]
+ */
+function has(els, name) {
+  return parseNodes(els, name, 'hasAttribute')
+}
+
+var index_next = {
+  get,
+  set,
+  remove,
+  has
+};
+
+exports.set = set;
+exports.get = get;
+exports.remove = remove;
+exports.has = has;
+exports.default = index_next;
diff --git a/node_modules/bianco.attr/index.next.js b/node_modules/bianco.attr/index.next.js
new file mode 100644
index 0000000..4dd7a5e
--- /dev/null
+++ b/node_modules/bianco.attr/index.next.js
@@ -0,0 +1,131 @@
+import domToArray from 'bianco.dom-to-array'
+
+/**
+ * Normalize the return values, in case of a single value we avoid to return an array
+ * @param   { Array } values - list of values we want to return
+ * @returns { Array|string|boolean } either the whole list of values or the single one found
+ * @private
+ */
+const normalize = values => values.length === 1 ? values[0] : values
+
+/**
+ * Parse all the nodes received to get/remove/check their attributes
+ * @param   { HTMLElement|NodeList|Array } els    - DOM node/s to parse
+ * @param   { string|Array }               name   - name or list of attributes
+ * @param   { string }                     method - method that will be used to parse the attributes
+ * @returns { Array|string } result of the parsing in a list or a single value
+ * @private
+ */
+function parseNodes(els, name, method) {
+  const names = typeof name === 'string' ? [name] : name
+  return normalize(domToArray(els).map(el => {
+    return normalize(names.map(n => el[method](n)))
+  }))
+}
+
+/**
+ * Set any attribute on a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Object }              name  - either the name of the attribute to set
+ *                                                 or a list of properties as object key - value
+ * @param   { string }                     value - the new value of the attribute (optional)
+ * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+ *
+ * @example
+ *
+ * import { set } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * set(img, 'width', 100)
+ *
+ * // or also
+ * set(img, {
+ *   width: 300,
+ *   height: 300
+ * })
+ *
+ */
+export function set(els, name, value) {
+  const attrs = typeof name === 'object' ? name : { [name]: value }
+  const props = Object.keys(attrs)
+
+  domToArray(els).forEach(el => {
+    props.forEach(prop => el.setAttribute(prop, attrs[prop]))
+  })
+  return els
+}
+
+/**
+ * Get any attribute from a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to get
+ * @returns { Array|string } list of the attributes found
+ *
+ * @example
+ *
+ * import { get } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * get(img, 'width') // => '200'
+ *
+ * // or also
+ * get(img, ['width', 'height']) // => ['200', '300']
+ *
+ * // or also
+ * get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+ */
+export function get(els, name) {
+  return parseNodes(els, name, 'getAttribute')
+}
+
+/**
+ * Remove any attribute from a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to remove
+ * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+ *
+ * @example
+ *
+ * import { remove } from 'bianco.attr'
+ *
+ * remove(img, 'width') // remove the width attribute
+ *
+ * // or also
+ * remove(img, ['width', 'height']) // remove the width and the height attribute
+ *
+ * // or also
+ * remove([img1, img2], ['width', 'height']) // remove the width and the height attribute from both images
+ */
+export function remove(els, name) {
+  return parseNodes(els, name, 'removeAttribute')
+}
+
+/**
+ * Set any attribute on a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to detect
+ * @returns { boolean|Array } true or false or an array of boolean values
+ * @example
+ *
+ * import { has } from 'bianco.attr'
+ *
+ * has(img, 'width') // false
+ *
+ * // or also
+ * has(img, ['width', 'height']) // => [false, false]
+ *
+ * // or also
+ * has([img1, img2], ['width', 'height']) // => [[false, false], [false, false]]
+ */
+export function has(els, name) {
+  return parseNodes(els, name, 'hasAttribute')
+}
+
+export default {
+  get,
+  set,
+  remove,
+  has
+}
\ No newline at end of file
diff --git a/node_modules/bianco.attr/package.json b/node_modules/bianco.attr/package.json
new file mode 100644
index 0000000..03f0071
--- /dev/null
+++ b/node_modules/bianco.attr/package.json
@@ -0,0 +1,74 @@
+{
+  "_from": "bianco.attr@^1.0.0",
+  "_id": "bianco.attr@1.0.0",
+  "_inBundle": false,
+  "_integrity": "sha512-ry700auBXrfRcn18wgOlDeCIAOy1HKnUrM96hc2xbzt4FQL+pfXTUGrt++gg9/rpp7JD4JUXi0X1OB7um+jm2w==",
+  "_location": "/bianco.attr",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "bianco.attr@^1.0.0",
+    "name": "bianco.attr",
+    "escapedName": "bianco.attr",
+    "rawSpec": "^1.0.0",
+    "saveSpec": null,
+    "fetchSpec": "^1.0.0"
+  },
+  "_requiredBy": [
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/bianco.attr/-/bianco.attr-1.0.0.tgz",
+  "_shasum": "38a16f28ad840cb57e0ab3638b8016e03c2bf1f2",
+  "_spec": "bianco.attr@^1.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/biancojs/@/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "bianco.dom-to-array": "^0.0.10"
+  },
+  "deprecated": false,
+  "description": "Helper to set/get/remove DOM attributes on a list of nodes",
+  "devDependencies": {
+    "@gianlucaguarini/eslint-config": "^2.0.0",
+    "eslint": "^5.8.0",
+    "jsdom": "12.2.0",
+    "jsdom-global": "3.0.2",
+    "mocha": "^5.2.0",
+    "rollup": "^0.66.6",
+    "rollup-plugin-node-resolve": "^3.4.0"
+  },
+  "files": [
+    "index.js",
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/biancojs/@#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "es6",
+    "es2015"
+  ],
+  "license": "MIT",
+  "main": "index.js",
+  "module": "index.next.js",
+  "name": "bianco.attr",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/biancojs/%40.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "test": "npm run lint && mocha test.js"
+  },
+  "version": "1.0.0"
+}
diff --git a/node_modules/bianco.dom-to-array/LICENSE b/node_modules/bianco.dom-to-array/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/bianco.dom-to-array/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/bianco.dom-to-array/README.md b/node_modules/bianco.dom-to-array/README.md
new file mode 100644
index 0000000..8b36b90
--- /dev/null
+++ b/node_modules/bianco.dom-to-array/README.md
@@ -0,0 +1,62 @@
+# bianco.dom-to-array
+
+[![Build Status][travis-image]][travis-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Usage
+
+```js
+import domToArray from 'bianco.dom-to-array'
+
+var div = document.createElement('div')
+div.innerHTML = `
+  <ul>
+    <li>one</li>
+    <li>two</li>
+  </ul>
+`
+body.appendChild(div)
+
+// It can convert node list
+const lis = document.querySelectorAll('li')
+const $lis = domToArray(lis)
+$lis.length // => 2
+Array.isArray($lis) // => true
+
+// It can convert a single node
+const li = document.querySelector('li')
+const $li = domToArray(li)
+$li.length // => 1
+Array.isArray($li) // => true
+```
+
+[travis-image]: https://img.shields.io/travis/biancojs/dom-to-array.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/biancojs/dom-to-array
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE.txt
+
+[npm-version-image]: http://img.shields.io/npm/v/bianco.dom-to-array.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/bianco.dom-to-array.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/bianco.dom-to-array
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+### domToArray
+
+Converts any DOM node/s to a loopable array
+
+**Parameters**
+
+-   `els` **([HTMLElement](https://developer.mozilla.org/en-US/docs/Web/HTML/Element) \| [NodeList](https://developer.mozilla.org/en-US/docs/Web/API/NodeList))** single html element or a node list
+
+Returns **[Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array)** always a loopable object
diff --git a/node_modules/bianco.dom-to-array/index.js b/node_modules/bianco.dom-to-array/index.js
new file mode 100644
index 0000000..1c6e6d0
--- /dev/null
+++ b/node_modules/bianco.dom-to-array/index.js
@@ -0,0 +1,27 @@
+'use strict';
+
+/**
+ * Converts any DOM node/s to a loopable array
+ * @param   { HTMLElement|NodeList } els - single html element or a node list
+ * @returns { Array } always a loopable object
+ */
+function domToArray(els) {
+  // can this object be already looped?
+  if (!Array.isArray(els)) {
+    // is it a node list?
+    if (
+      /^\[object (HTMLCollection|NodeList|Object)\]$/
+        .test(Object.prototype.toString.call(els))
+        && typeof els.length === 'number'
+    )
+      return Array.from(els)
+    else
+      // if it's a single node
+      // it will be returned as "array" with one single entry
+      return [els]
+  }
+  // this object could be looped out of the box
+  return els
+}
+
+module.exports = domToArray;
diff --git a/node_modules/bianco.dom-to-array/index.next.js b/node_modules/bianco.dom-to-array/index.next.js
new file mode 100644
index 0000000..3a0ca30
--- /dev/null
+++ b/node_modules/bianco.dom-to-array/index.next.js
@@ -0,0 +1,23 @@
+/**
+ * Converts any DOM node/s to a loopable array
+ * @param   { HTMLElement|NodeList } els - single html element or a node list
+ * @returns { Array } always a loopable object
+ */
+export default function domToArray(els) {
+  // can this object be already looped?
+  if (!Array.isArray(els)) {
+    // is it a node list?
+    if (
+      /^\[object (HTMLCollection|NodeList|Object)\]$/
+        .test(Object.prototype.toString.call(els))
+        && typeof els.length === 'number'
+    )
+      return Array.from(els)
+    else
+      // if it's a single node
+      // it will be returned as "array" with one single entry
+      return [els]
+  }
+  // this object could be looped out of the box
+  return els
+}
\ No newline at end of file
diff --git a/node_modules/bianco.dom-to-array/package.json b/node_modules/bianco.dom-to-array/package.json
new file mode 100644
index 0000000..cb7c1c8
--- /dev/null
+++ b/node_modules/bianco.dom-to-array/package.json
@@ -0,0 +1,77 @@
+{
+  "_from": "bianco.dom-to-array@^0.0.10",
+  "_id": "bianco.dom-to-array@0.0.10",
+  "_inBundle": false,
+  "_integrity": "sha512-EFYkcEGPmIqatvh+6I2eF6/X4mDtEyGoBucqmudJ5qABbFOw3RPIWB913aLD1FTaux8pZtYzD/yvcwGJKSNgXg==",
+  "_location": "/bianco.dom-to-array",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "bianco.dom-to-array@^0.0.10",
+    "name": "bianco.dom-to-array",
+    "escapedName": "bianco.dom-to-array",
+    "rawSpec": "^0.0.10",
+    "saveSpec": null,
+    "fetchSpec": "^0.0.10"
+  },
+  "_requiredBy": [
+    "/bianco.attr",
+    "/bianco.query"
+  ],
+  "_resolved": "https://registry.npmjs.org/bianco.dom-to-array/-/bianco.dom-to-array-0.0.10.tgz",
+  "_shasum": "376e1a37c4ca5119b3b6de9fd2d5c994cf0152a3",
+  "_spec": "bianco.dom-to-array@^0.0.10",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/bianco.attr",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/biancojs/dom-to-array/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Converts any DOM node/s to a loopable array",
+  "devDependencies": {
+    "@gianlucaguarini/eslint-config": "^2.0.0",
+    "eslint": "^4.19.1",
+    "jsdom": "11.11.0",
+    "jsdom-global": "3.0.2",
+    "mocha": "^5.2.0",
+    "rollup": "^0.59.4",
+    "rollup-plugin-node-resolve": "^3.3.0"
+  },
+  "files": [
+    "index.js",
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/biancojs/dom-to-array#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "es6",
+    "es2015",
+    "dom",
+    "array",
+    "iterator",
+    "dom loops",
+    "nodes"
+  ],
+  "license": "MIT",
+  "main": "index.js",
+  "module": "index.next.js",
+  "name": "bianco.dom-to-array",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/biancojs/dom-to-array.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "test": "npm run lint && mocha test.js"
+  },
+  "version": "0.0.10"
+}
diff --git a/node_modules/bianco.query/LICENSE b/node_modules/bianco.query/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/bianco.query/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/bianco.query/README.md b/node_modules/bianco.query/README.md
new file mode 100644
index 0000000..e3bb98e
--- /dev/null
+++ b/node_modules/bianco.query/README.md
@@ -0,0 +1,59 @@
+# bianco.query
+
+[![Build Status][travis-image]][travis-url]
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+Modern DOM query selectors helpers written in es2015
+
+## Usage
+
+```js
+import $ from 'bianco.query'
+
+const footer = document.querySelector('.main-footer')
+const header = document.querySelector('.main-header')
+
+// convert DOM nodes to arrays
+$(footer)
+  .concat($(header))
+  .forEach(el => el.classList.add('fade-in'))
+
+// handle DOM queries
+$('h1', 'main').forEach(h1 => h1.classList.add('main-title'))
+```
+
+[travis-image]: https://img.shields.io/travis/biancojs/query.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/biancojs/query
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE.txt
+
+[npm-version-image]: http://img.shields.io/npm/v/bianco.query.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/bianco.query.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/bianco.query
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+#### Table of Contents
+
+-   [$](#)
+    -   [Parameters](#parameters)
+
+### $
+
+Simple helper to find DOM nodes returning them as array like loopable object
+
+#### Parameters
+
+-   `selector` **([string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String) | DOMNodeList)** either the query or the DOM nodes to arraify
+-   `ctx` **[HTMLElement](https://developer.mozilla.org/docs/Web/HTML/Element)** context defining where the query will search for the DOM nodes
+
+Returns **[Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)** DOM nodes found as array
diff --git a/node_modules/bianco.query/index.js b/node_modules/bianco.query/index.js
new file mode 100644
index 0000000..b45ba87
--- /dev/null
+++ b/node_modules/bianco.query/index.js
@@ -0,0 +1,20 @@
+'use strict';
+
+function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
+
+var domToArray = _interopDefault(require('bianco.dom-to-array'));
+
+/**
+ * Simple helper to find DOM nodes returning them as array like loopable object
+ * @param   { string|DOMNodeList } selector - either the query or the DOM nodes to arraify
+ * @param   { HTMLElement }        ctx      - context defining where the query will search for the DOM nodes
+ * @returns { Array } DOM nodes found as array
+ */
+function $(selector, ctx) {
+  return domToArray(typeof selector === 'string' ?
+    (ctx || document).querySelectorAll(selector) :
+    selector
+  )
+}
+
+module.exports = $;
diff --git a/node_modules/bianco.query/index.next.js b/node_modules/bianco.query/index.next.js
new file mode 100644
index 0000000..3ae3196
--- /dev/null
+++ b/node_modules/bianco.query/index.next.js
@@ -0,0 +1,14 @@
+import domToArray from 'bianco.dom-to-array'
+
+/**
+ * Simple helper to find DOM nodes returning them as array like loopable object
+ * @param   { string|DOMNodeList } selector - either the query or the DOM nodes to arraify
+ * @param   { HTMLElement }        ctx      - context defining where the query will search for the DOM nodes
+ * @returns { Array } DOM nodes found as array
+ */
+export default function $(selector, ctx) {
+  return domToArray(typeof selector === 'string' ?
+    (ctx || document).querySelectorAll(selector) :
+    selector
+  )
+}
diff --git a/node_modules/bianco.query/package.json b/node_modules/bianco.query/package.json
new file mode 100644
index 0000000..b6ca198
--- /dev/null
+++ b/node_modules/bianco.query/package.json
@@ -0,0 +1,79 @@
+{
+  "_from": "bianco.query@^1.0.0",
+  "_id": "bianco.query@1.0.0",
+  "_inBundle": false,
+  "_integrity": "sha512-pDstv5+tsuw//wNuPnXuf4DjyN116tcH/a7hxbqH1OpWMsBgBkp/O29uxlWEZWN5e6hCaGajLNA9CAGTsgYeWw==",
+  "_location": "/bianco.query",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "bianco.query@^1.0.0",
+    "name": "bianco.query",
+    "escapedName": "bianco.query",
+    "rawSpec": "^1.0.0",
+    "saveSpec": null,
+    "fetchSpec": "^1.0.0"
+  },
+  "_requiredBy": [
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/bianco.query/-/bianco.query-1.0.0.tgz",
+  "_shasum": "1149b4d5b4175ef28086ba5851507bebd60d161a",
+  "_spec": "bianco.query@^1.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/biancojs/query/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "bianco.dom-to-array": "^0.0.10"
+  },
+  "deprecated": false,
+  "description": "Modern DOM query selectors helpers written in es2015",
+  "devDependencies": {
+    "@gianlucaguarini/eslint-config": "^2.0.0",
+    "eslint": "^5.8.0",
+    "jsdom": "12.2.0",
+    "jsdom-global": "3.0.2",
+    "mocha": "^5.2.0",
+    "rollup": "^0.66.6",
+    "rollup-plugin-node-resolve": "^3.4.0"
+  },
+  "files": [
+    "index.js",
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/biancojs/query#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "es6",
+    "es2015",
+    "query",
+    "$",
+    "querySelectorAll",
+    "querySelector",
+    "DOM"
+  ],
+  "license": "MIT",
+  "main": "index.js",
+  "module": "index.next.js",
+  "name": "bianco.query",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/biancojs/query.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "test": "npm run lint && mocha test.js"
+  },
+  "version": "1.0.0"
+}
diff --git a/node_modules/cssesc/LICENSE-MIT.txt b/node_modules/cssesc/LICENSE-MIT.txt
new file mode 100644
index 0000000..a41e0a7
--- /dev/null
+++ b/node_modules/cssesc/LICENSE-MIT.txt
@@ -0,0 +1,20 @@
+Copyright Mathias Bynens <https://mathiasbynens.be/>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/cssesc/README.md b/node_modules/cssesc/README.md
new file mode 100644
index 0000000..58fb8fe
--- /dev/null
+++ b/node_modules/cssesc/README.md
@@ -0,0 +1,201 @@
+# cssesc [![Build status](https://travis-ci.org/mathiasbynens/cssesc.svg?branch=master)](https://travis-ci.org/mathiasbynens/cssesc) [![Code coverage status](https://img.shields.io/codecov/c/github/mathiasbynens/cssesc.svg)](https://codecov.io/gh/mathiasbynens/cssesc)
+
+A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.
+
+This is a JavaScript library for [escaping text for use in CSS strings or identifiers](https://mathiasbynens.be/notes/css-escapes) while generating the shortest possible valid ASCII-only output. [Here’s an online demo.](https://mothereff.in/css-escapes)
+
+[A polyfill for the CSSOM `CSS.escape()` method is available in a separate repository.](https://mths.be/cssescape) (In comparison, _cssesc_ is much more powerful.)
+
+Feel free to fork if you see possible improvements!
+
+## Installation
+
+Via [npm](https://www.npmjs.com/):
+
+```bash
+npm install cssesc
+```
+
+In a browser:
+
+```html
+<script src="cssesc.js"></script>
+```
+
+In [Node.js](https://nodejs.org/):
+
+```js
+const cssesc = require('cssesc');
+```
+
+In Ruby using [the `ruby-cssesc` wrapper gem](https://github.com/borodean/ruby-cssesc):
+
+```bash
+gem install ruby-cssesc
+```
+
+```ruby
+require 'ruby-cssesc'
+CSSEsc.escape('I ♥ Ruby', is_identifier: true)
+```
+
+In Sass using [`sassy-escape`](https://github.com/borodean/sassy-escape):
+
+```bash
+gem install sassy-escape
+```
+
+```scss
+body {
+  content: escape('I ♥ Sass', $is-identifier: true);
+}
+```
+
+## API
+
+### `cssesc(value, options)`
+
+This function takes a value and returns an escaped version of the value where any characters that are not printable ASCII symbols are escaped using the shortest possible (but valid) [escape sequences for use in CSS strings or identifiers](https://mathiasbynens.be/notes/css-escapes).
+
+```js
+cssesc('Ich ♥ Bücher');
+// → 'Ich \\2665  B\\FC cher'
+
+cssesc('foo 𝌆 bar');
+// → 'foo \\1D306  bar'
+```
+
+By default, `cssesc` returns a string that can be used as part of a CSS string. If the target is a CSS identifier rather than a CSS string, use the `isIdentifier: true` setting (see below).
+
+The optional `options` argument accepts an object with the following options:
+
+#### `isIdentifier`
+
+The default value for the `isIdentifier` option is `false`. This means that the input text will be escaped for use in a CSS string literal. If you want to use the result as a CSS identifier instead (in a selector, for example), set this option to `true`.
+
+```js
+cssesc('123a2b');
+// → '123a2b'
+
+cssesc('123a2b', {
+  'isIdentifier': true
+});
+// → '\\31 23a2b'
+```
+
+#### `quotes`
+
+The default value for the `quotes` option is `'single'`. This means that any occurences of `'` in the input text will be escaped as `\'`, so that the output can be used in a CSS string literal wrapped in single quotes.
+
+```js
+cssesc('Lorem ipsum "dolor" sit \'amet\' etc.');
+// → 'Lorem ipsum "dolor" sit \\\'amet\\\' etc.'
+// → "Lorem ipsum \"dolor\" sit \\'amet\\' etc."
+
+cssesc('Lorem ipsum "dolor" sit \'amet\' etc.', {
+  'quotes': 'single'
+});
+// → 'Lorem ipsum "dolor" sit \\\'amet\\\' etc.'
+// → "Lorem ipsum \"dolor\" sit \\'amet\\' etc."
+```
+
+If you want to use the output as part of a CSS string literal wrapped in double quotes, set the `quotes` option to `'double'`.
+
+```js
+cssesc('Lorem ipsum "dolor" sit \'amet\' etc.', {
+  'quotes': 'double'
+});
+// → 'Lorem ipsum \\"dolor\\" sit \'amet\' etc.'
+// → "Lorem ipsum \\\"dolor\\\" sit 'amet' etc."
+```
+
+#### `wrap`
+
+The `wrap` option takes a boolean value (`true` or `false`), and defaults to `false` (disabled). When enabled, the output will be a valid CSS string literal wrapped in quotes. The type of quotes can be specified through the `quotes` setting.
+
+```js
+cssesc('Lorem ipsum "dolor" sit \'amet\' etc.', {
+  'quotes': 'single',
+  'wrap': true
+});
+// → '\'Lorem ipsum "dolor" sit \\\'amet\\\' etc.\''
+// → "\'Lorem ipsum \"dolor\" sit \\\'amet\\\' etc.\'"
+
+cssesc('Lorem ipsum "dolor" sit \'amet\' etc.', {
+  'quotes': 'double',
+  'wrap': true
+});
+// → '"Lorem ipsum \\"dolor\\" sit \'amet\' etc."'
+// → "\"Lorem ipsum \\\"dolor\\\" sit \'amet\' etc.\""
+```
+
+#### `escapeEverything`
+
+The `escapeEverything` option takes a boolean value (`true` or `false`), and defaults to `false` (disabled). When enabled, all the symbols in the output will be escaped, even printable ASCII symbols.
+
+```js
+cssesc('lolwat"foo\'bar', {
+  'escapeEverything': true
+});
+// → '\\6C\\6F\\6C\\77\\61\\74\\"\\66\\6F\\6F\\\'\\62\\61\\72'
+// → "\\6C\\6F\\6C\\77\\61\\74\\\"\\66\\6F\\6F\\'\\62\\61\\72"
+```
+
+#### Overriding the default options globally
+
+The global default settings can be overridden by modifying the `css.options` object. This saves you from passing in an `options` object for every call to `encode` if you want to use the non-default setting.
+
+```js
+// Read the global default setting for `escapeEverything`:
+cssesc.options.escapeEverything;
+// → `false` by default
+
+// Override the global default setting for `escapeEverything`:
+cssesc.options.escapeEverything = true;
+
+// Using the global default setting for `escapeEverything`, which is now `true`:
+cssesc('foo © bar ≠ baz 𝌆 qux');
+// → '\\66\\6F\\6F\\ \\A9\\ \\62\\61\\72\\ \\2260\\ \\62\\61\\7A\\ \\1D306\\ \\71\\75\\78'
+```
+
+### `cssesc.version`
+
+A string representing the semantic version number.
+
+### Using the `cssesc` binary
+
+To use the `cssesc` binary in your shell, simply install cssesc globally using npm:
+
+```bash
+npm install -g cssesc
+```
+
+After that you will be able to escape text for use in CSS strings or identifiers from the command line:
+
+```bash
+$ cssesc 'föo ♥ bår 𝌆 baz'
+f\F6o \2665  b\E5r \1D306  baz
+```
+
+If the output needs to be a CSS identifier rather than part of a string literal, use the `-i`/`--identifier` option:
+
+```bash
+$ cssesc --identifier 'föo ♥ bår 𝌆 baz'
+f\F6o\ \2665\ b\E5r\ \1D306\ baz
+```
+
+See `cssesc --help` for the full list of options.
+
+## Support
+
+This library supports the Node.js and browser versions mentioned in [`.babelrc`](https://github.com/mathiasbynens/cssesc/blob/master/.babelrc). For a version that supports a wider variety of legacy browsers and environments out-of-the-box, [see v0.1.0](https://github.com/mathiasbynens/cssesc/releases/tag/v0.1.0).
+
+## Author
+
+| [![twitter/mathias](https://gravatar.com/avatar/24e08a9ea84deb17ae121074d0f17125?s=70)](https://twitter.com/mathias "Follow @mathias on Twitter") |
+|---|
+| [Mathias Bynens](https://mathiasbynens.be/) |
+
+## License
+
+This library is available under the [MIT](https://mths.be/mit) license.
diff --git a/node_modules/cssesc/bin/cssesc b/node_modules/cssesc/bin/cssesc
new file mode 100755
index 0000000..188c034
--- /dev/null
+++ b/node_modules/cssesc/bin/cssesc
@@ -0,0 +1,116 @@
+#!/usr/bin/env node
+const fs = require('fs');
+const cssesc = require('../cssesc.js');
+const strings = process.argv.splice(2);
+const stdin = process.stdin;
+const options = {};
+const log = console.log;
+
+const main = function() {
+	const option = strings[0];
+
+	if (/^(?:-h|--help|undefined)$/.test(option)) {
+		log(
+			'cssesc v%s - https://mths.be/cssesc',
+			cssesc.version
+		);
+		log([
+			'\nUsage:\n',
+			'\tcssesc [string]',
+			'\tcssesc [-i | --identifier] [string]',
+			'\tcssesc [-s | --single-quotes] [string]',
+			'\tcssesc [-d | --double-quotes] [string]',
+			'\tcssesc [-w | --wrap] [string]',
+			'\tcssesc [-e | --escape-everything] [string]',
+			'\tcssesc [-v | --version]',
+			'\tcssesc [-h | --help]',
+			'\nExamples:\n',
+			'\tcssesc \'f\xF6o \u2665 b\xE5r \uD834\uDF06 baz\'',
+			'\tcssesc --identifier \'f\xF6o \u2665 b\xE5r \uD834\uDF06 baz\'',
+			'\tcssesc --escape-everything \'f\xF6o \u2665 b\xE5r \uD834\uDF06 baz\'',
+			'\tcssesc --double-quotes --wrap \'f\xF6o \u2665 b\xE5r \uD834\uDF06 baz\'',
+			'\techo \'f\xF6o \u2665 b\xE5r \uD834\uDF06 baz\' | cssesc'
+		].join('\n'));
+		return process.exit(1);
+	}
+
+	if (/^(?:-v|--version)$/.test(option)) {
+		log('v%s', cssesc.version);
+		return process.exit(1);
+	}
+
+	strings.forEach(function(string) {
+		// Process options
+		if (/^(?:-i|--identifier)$/.test(string)) {
+			options.isIdentifier = true;
+			return;
+		}
+		if (/^(?:-s|--single-quotes)$/.test(string)) {
+			options.quotes = 'single';
+			return;
+		}
+		if (/^(?:-d|--double-quotes)$/.test(string)) {
+			options.quotes = 'double';
+			return;
+		}
+		if (/^(?:-w|--wrap)$/.test(string)) {
+			options.wrap = true;
+			return;
+		}
+		if (/^(?:-e|--escape-everything)$/.test(string)) {
+			options.escapeEverything = true;
+			return;
+		}
+
+		// Process string(s)
+		let result;
+		try {
+			result = cssesc(string, options);
+			log(result);
+		} catch (exception) {
+			log(exception.message + '\n');
+			log('Error: failed to escape.');
+			log('If you think this is a bug in cssesc, please report it:');
+			log('https://github.com/mathiasbynens/cssesc/issues/new');
+			log(
+				'\nStack trace using cssesc@%s:\n',
+				cssesc.version
+			);
+			log(exception.stack);
+			return process.exit(1);
+		}
+	});
+	// Return with exit status 0 outside of the `forEach` loop, in case
+	// multiple strings were passed in.
+	return process.exit(0);
+
+};
+
+if (stdin.isTTY) {
+	// handle shell arguments
+	main();
+} else {
+	let timeout;
+	// Either the script is called from within a non-TTY context, or `stdin`
+	// content is being piped in.
+	if (!process.stdout.isTTY) {
+		// The script was called from a non-TTY context. This is a rather uncommon
+		// use case we don’t actively support. However, we don’t want the script
+		// to wait forever in such cases, so…
+		timeout = setTimeout(function() {
+			// …if no piped data arrived after a whole minute, handle shell
+			// arguments instead.
+			main();
+		}, 60000);
+	}
+	let data = '';
+	stdin.on('data', function(chunk) {
+		clearTimeout(timeout);
+		data += chunk;
+	});
+	stdin.on('end', function() {
+		strings.push(data.trim());
+		main();
+	});
+	stdin.resume();
+}
diff --git a/node_modules/cssesc/cssesc.js b/node_modules/cssesc/cssesc.js
new file mode 100644
index 0000000..1c0928e
--- /dev/null
+++ b/node_modules/cssesc/cssesc.js
@@ -0,0 +1,110 @@
+/*! https://mths.be/cssesc v3.0.0 by @mathias */
+'use strict';
+
+var object = {};
+var hasOwnProperty = object.hasOwnProperty;
+var merge = function merge(options, defaults) {
+	if (!options) {
+		return defaults;
+	}
+	var result = {};
+	for (var key in defaults) {
+		// `if (defaults.hasOwnProperty(key) { … }` is not needed here, since
+		// only recognized option names are used.
+		result[key] = hasOwnProperty.call(options, key) ? options[key] : defaults[key];
+	}
+	return result;
+};
+
+var regexAnySingleEscape = /[ -,\.\/:-@\[-\^`\{-~]/;
+var regexSingleEscape = /[ -,\.\/:-@\[\]\^`\{-~]/;
+var regexAlwaysEscape = /['"\\]/;
+var regexExcessiveSpaces = /(^|\\+)?(\\[A-F0-9]{1,6})\x20(?![a-fA-F0-9\x20])/g;
+
+// https://mathiasbynens.be/notes/css-escapes#css
+var cssesc = function cssesc(string, options) {
+	options = merge(options, cssesc.options);
+	if (options.quotes != 'single' && options.quotes != 'double') {
+		options.quotes = 'single';
+	}
+	var quote = options.quotes == 'double' ? '"' : '\'';
+	var isIdentifier = options.isIdentifier;
+
+	var firstChar = string.charAt(0);
+	var output = '';
+	var counter = 0;
+	var length = string.length;
+	while (counter < length) {
+		var character = string.charAt(counter++);
+		var codePoint = character.charCodeAt();
+		var value = void 0;
+		// If it’s not a printable ASCII character…
+		if (codePoint < 0x20 || codePoint > 0x7E) {
+			if (codePoint >= 0xD800 && codePoint <= 0xDBFF && counter < length) {
+				// It’s a high surrogate, and there is a next character.
+				var extra = string.charCodeAt(counter++);
+				if ((extra & 0xFC00) == 0xDC00) {
+					// next character is low surrogate
+					codePoint = ((codePoint & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000;
+				} else {
+					// It’s an unmatched surrogate; only append this code unit, in case
+					// the next code unit is the high surrogate of a surrogate pair.
+					counter--;
+				}
+			}
+			value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+		} else {
+			if (options.escapeEverything) {
+				if (regexAnySingleEscape.test(character)) {
+					value = '\\' + character;
+				} else {
+					value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+				}
+			} else if (/[\t\n\f\r\x0B]/.test(character)) {
+				value = '\\' + codePoint.toString(16).toUpperCase() + ' ';
+			} else if (character == '\\' || !isIdentifier && (character == '"' && quote == character || character == '\'' && quote == character) || isIdentifier && regexSingleEscape.test(character)) {
+				value = '\\' + character;
+			} else {
+				value = character;
+			}
+		}
+		output += value;
+	}
+
+	if (isIdentifier) {
+		if (/^-[-\d]/.test(output)) {
+			output = '\\-' + output.slice(1);
+		} else if (/\d/.test(firstChar)) {
+			output = '\\3' + firstChar + ' ' + output.slice(1);
+		}
+	}
+
+	// Remove spaces after `\HEX` escapes that are not followed by a hex digit,
+	// since they’re redundant. Note that this is only possible if the escape
+	// sequence isn’t preceded by an odd number of backslashes.
+	output = output.replace(regexExcessiveSpaces, function ($0, $1, $2) {
+		if ($1 && $1.length % 2) {
+			// It’s not safe to remove the space, so don’t.
+			return $0;
+		}
+		// Strip the space.
+		return ($1 || '') + $2;
+	});
+
+	if (!isIdentifier && options.wrap) {
+		return quote + output + quote;
+	}
+	return output;
+};
+
+// Expose default options (so they can be overridden globally).
+cssesc.options = {
+	'escapeEverything': false,
+	'isIdentifier': false,
+	'quotes': 'single',
+	'wrap': false
+};
+
+cssesc.version = '3.0.0';
+
+module.exports = cssesc;
diff --git a/node_modules/cssesc/man/cssesc.1 b/node_modules/cssesc/man/cssesc.1
new file mode 100644
index 0000000..eee4996
--- /dev/null
+++ b/node_modules/cssesc/man/cssesc.1
@@ -0,0 +1,70 @@
+.Dd August 9, 2013
+.Dt cssesc 1
+.Sh NAME
+.Nm cssesc
+.Nd escape text for use in CSS string literals or identifiers
+.Sh SYNOPSIS
+.Nm
+.Op Fl i | -identifier Ar string
+.br
+.Op Fl s | -single-quotes Ar string
+.br
+.Op Fl d | -double-quotes Ar string
+.br
+.Op Fl w | -wrap Ar string
+.br
+.Op Fl e | -escape-everything Ar string
+.br
+.Op Fl v | -version
+.br
+.Op Fl h | -help
+.Sh DESCRIPTION
+.Nm
+escapes strings for use in CSS string literals or identifiers while generating the shortest possible valid ASCII-only output.
+.Sh OPTIONS
+.Bl -ohang -offset
+.It Sy "-s, --single-quotes"
+Escape any occurences of ' in the input string as \\', so that the output can be used in a CSS string literal wrapped in single quotes.
+.It Sy "-d, --double-quotes"
+Escape any occurences of " in the input string as \\", so that the output can be used in a CSS string literal wrapped in double quotes.
+.It Sy "-w, --wrap"
+Make sure the output is a valid CSS string literal wrapped in quotes. The type of quotes can be specified using the
+.Ar -s | --single-quotes
+or
+.Ar -d | --double-quotes
+settings.
+.It Sy "-e, --escape-everything"
+Escape all the symbols in the output, even printable ASCII symbols.
+.It Sy "-v, --version"
+Print cssesc's version.
+.It Sy "-h, --help"
+Show the help screen.
+.El
+.Sh EXIT STATUS
+The
+.Nm cssesc
+utility exits with one of the following values:
+.Pp
+.Bl -tag -width flag -compact
+.It Li 0
+.Nm
+successfully escaped the given text and printed the result.
+.It Li 1
+.Nm
+wasn't instructed to escape anything (for example, the
+.Ar --help
+flag was set); or, an error occurred.
+.El
+.Sh EXAMPLES
+.Bl -ohang -offset
+.It Sy "cssesc 'foo bar baz'"
+Print an escaped version of the given text.
+.It Sy echo\ 'foo bar baz'\ |\ cssesc
+Print an escaped version of the text that gets piped in.
+.El
+.Sh BUGS
+cssesc's bug tracker is located at <https://github.com/mathiasbynens/cssesc/issues>.
+.Sh AUTHOR
+Mathias Bynens <https://mathiasbynens.be/>
+.Sh WWW
+<https://mths.be/cssesc>
diff --git a/node_modules/cssesc/package.json b/node_modules/cssesc/package.json
new file mode 100644
index 0000000..70fa37a
--- /dev/null
+++ b/node_modules/cssesc/package.json
@@ -0,0 +1,82 @@
+{
+  "_from": "cssesc@^3.0.0",
+  "_id": "cssesc@3.0.0",
+  "_inBundle": false,
+  "_integrity": "sha512-/Tb/JcjK111nNScGob5MNtsntNM1aCNUDipB/TkwZFhyDrrE47SOx/18wF2bbjgc3ZzCSKW1T5nt5EbFoAz/Vg==",
+  "_location": "/cssesc",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "cssesc@^3.0.0",
+    "name": "cssesc",
+    "escapedName": "cssesc",
+    "rawSpec": "^3.0.0",
+    "saveSpec": null,
+    "fetchSpec": "^3.0.0"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/cssesc/-/cssesc-3.0.0.tgz",
+  "_shasum": "37741919903b868565e1c09ea747445cd18983ee",
+  "_spec": "cssesc@^3.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "Mathias Bynens",
+    "url": "https://mathiasbynens.be/"
+  },
+  "bin": {
+    "cssesc": "bin/cssesc"
+  },
+  "bugs": {
+    "url": "https://github.com/mathiasbynens/cssesc/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "A JavaScript library for escaping CSS strings and identifiers while generating the shortest possible ASCII-only output.",
+  "devDependencies": {
+    "babel-cli": "^6.26.0",
+    "babel-preset-env": "^1.6.1",
+    "codecov": "^1.0.1",
+    "grunt": "^1.0.1",
+    "grunt-template": "^1.0.0",
+    "istanbul": "^0.4.4",
+    "mocha": "^2.5.3",
+    "regenerate": "^1.2.1",
+    "requirejs": "^2.1.16"
+  },
+  "engines": {
+    "node": ">=4"
+  },
+  "files": [
+    "LICENSE-MIT.txt",
+    "cssesc.js",
+    "bin/",
+    "man/"
+  ],
+  "homepage": "https://mths.be/cssesc",
+  "keywords": [
+    "css",
+    "escape",
+    "identifier",
+    "string",
+    "tool"
+  ],
+  "license": "MIT",
+  "main": "cssesc.js",
+  "man": [
+    "man/cssesc.1"
+  ],
+  "name": "cssesc",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/mathiasbynens/cssesc.git"
+  },
+  "scripts": {
+    "build": "grunt template && babel cssesc.js -o cssesc.js",
+    "cover": "istanbul cover --report html node_modules/.bin/_mocha tests -- -u exports -R spec",
+    "test": "mocha tests"
+  },
+  "version": "3.0.0"
+}
diff --git a/node_modules/cumpa/LICENSE b/node_modules/cumpa/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/cumpa/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/cumpa/README.md b/node_modules/cumpa/README.md
new file mode 100644
index 0000000..2bd0797
--- /dev/null
+++ b/node_modules/cumpa/README.md
@@ -0,0 +1,75 @@
+# cumpa
+
+Minimal function composition implementation
+
+<img alt="cumpa" src="./cumpa.gif" width="50%"/>
+
+> `cumpá` in some Italian :it: dialects means `fellow`
+
+[![Build Status][travis-image]][travis-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Usage
+
+```js
+import compose from 'cumpa'
+
+const add2 = x => x + 2
+const multiplyBy3 = x => x * 3
+
+const add2AndMultiplyBy3 = compose(multiplyBy3, add2)
+
+console.log(add2AndMultiplyBy3(1)) // ((1 + 2) * 3) = 9
+```
+
+[travis-image]: https://img.shields.io/travis/GianlucaGuarini/cumpa.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/GianlucaGuarini/cumpa
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE
+
+[npm-version-image]: http://img.shields.io/npm/v/cumpa.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/cumpa.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/cumpa
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+#### Table of Contents
+
+-   [composeRight](#composeright)
+    -   [Parameters](#parameters)
+-   [compose](#compose)
+    -   [Parameters](#parameters-1)
+
+### composeRight
+
+Similar to compose but performs from left-to-right function composition.<br/>
+[see also](https://30secondsofcode.org/function#composeright)
+
+#### Parameters
+
+-   `fns` **...\[[function](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Statements/function)]** ) - list of unary fynctions
+
+Returns **any** result of the computation
+
+### compose
+
+Performs right-to-left function composition.
+Use Array.prototype.reduce() to perform right-to-left function composition.
+The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+[source code](https://30secondsofcode.org/function#compose)
+
+#### Parameters
+
+-   `fns` **...\[[function](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Statements/function)]** ) - list of unary fynctions
+
+Returns **any** result of the computation
diff --git a/node_modules/cumpa/cumpa.js b/node_modules/cumpa/cumpa.js
new file mode 100644
index 0000000..0d3a316
--- /dev/null
+++ b/node_modules/cumpa/cumpa.js
@@ -0,0 +1,32 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = global || self, factory(global.cumpa = {}));
+}(this, function (exports) { 'use strict';
+
+  /**
+   * Similar to compose but performs from left-to-right function composition.<br/>
+   * {@link https://30secondsofcode.org/function#composeright see also}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+  const composeRight = (...fns) => compose(...fns.reverse());
+
+  /**
+   * Performs right-to-left function composition.<br/>
+   * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+   * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+   * {@link https://30secondsofcode.org/function#compose original source code}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+  function compose(...fns) {
+    return fns.reduce((f, g) => (...args) => f(g(...args)))
+  }
+
+  exports.composeRight = composeRight;
+  exports.default = compose;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/cumpa/index.next.js b/node_modules/cumpa/index.next.js
new file mode 100644
index 0000000..aa19822
--- /dev/null
+++ b/node_modules/cumpa/index.next.js
@@ -0,0 +1,19 @@
+/**
+ * Similar to compose but performs from left-to-right function composition.<br/>
+ * {@link https://30secondsofcode.org/function#composeright see also}
+ * @param   {...[function]} fns) - list of unary function
+ * @returns {*} result of the computation
+ */
+export const composeRight = (...fns) => compose(...fns.reverse())
+
+/**
+ * Performs right-to-left function composition.<br/>
+ * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+ * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+ * {@link https://30secondsofcode.org/function#compose original source code}
+ * @param   {...[function]} fns) - list of unary function
+ * @returns {*} result of the computation
+ */
+export default function compose(...fns) {
+  return fns.reduce((f, g) => (...args) => f(g(...args)))
+}
\ No newline at end of file
diff --git a/node_modules/cumpa/package.json b/node_modules/cumpa/package.json
new file mode 100644
index 0000000..dc9d9cb
--- /dev/null
+++ b/node_modules/cumpa/package.json
@@ -0,0 +1,72 @@
+{
+  "_from": "cumpa@^1.0.1",
+  "_id": "cumpa@1.0.1",
+  "_inBundle": false,
+  "_integrity": "sha512-Ew3sfG4cqvDFINS1VgdvLX1FIruhySlnP6DRLhB+1EjewiOzhJzKRKPEp/TCuo0RDisSFeuaDrk0S4Q8grF9CA==",
+  "_location": "/cumpa",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "cumpa@^1.0.1",
+    "name": "cumpa",
+    "escapedName": "cumpa",
+    "rawSpec": "^1.0.1",
+    "saveSpec": null,
+    "fetchSpec": "^1.0.1"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler",
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/cumpa/-/cumpa-1.0.1.tgz",
+  "_shasum": "beff3180ab36e850a157a779d0cf4d997d2c7980",
+  "_spec": "cumpa@^1.0.1",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/GianlucaGuarini/cumpa/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Minimal function composition implementation",
+  "devDependencies": {
+    "@gianlucaguarini/eslint-config": "^2.0.0",
+    "eslint": "^5.16.0",
+    "mocha": "^6.0.2",
+    "rollup": "^1.7.4",
+    "rollup-plugin-node-resolve": "^4.0.1"
+  },
+  "files": [
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/GianlucaGuarini/cumpa#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "flowRight",
+    "functional",
+    "compose",
+    "compose-right"
+  ],
+  "license": "MIT",
+  "main": "cumpa.js",
+  "module": "index.next.js",
+  "name": "cumpa",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/GianlucaGuarini/cumpa.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "pretest": "npm run build",
+    "test": "npm run lint && mocha test.js"
+  },
+  "version": "1.0.1"
+}
diff --git a/node_modules/curri/LICENSE b/node_modules/curri/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/curri/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/curri/README.md b/node_modules/curri/README.md
new file mode 100644
index 0000000..1341efe
--- /dev/null
+++ b/node_modules/curri/README.md
@@ -0,0 +1,52 @@
+# curri
+
+<img alt="curri.js" src="https://cdn.rawgit.com/GianlucaGuarini/curri/master/curri.gif" width="50%"/>
+
+> `curri` in some Italian :it: dialects means `run`
+
+[![Build Status][travis-image]][travis-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Usage
+
+```js
+import curry from 'curri'
+
+const add = (a, b) => a + b
+const add3 = curry(add)(3)
+
+console.log(add3(5)) // 8
+```
+
+[travis-image]: https://img.shields.io/travis/GianlucaGuarini/curri.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/GianlucaGuarini/curri
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE
+
+[npm-version-image]: http://img.shields.io/npm/v/curri.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/curri.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/curri
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+### curry
+
+Function to curry any javascript method
+
+**Parameters**
+
+-   `fn` **[Function](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/function)** the target function we want to curry
+-   `acc` **...\[args]** initial arguments
+
+Returns **([Function](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/function) | any)** it will return a function until the target function
+                      will receive all of its arguments
diff --git a/node_modules/curri/curri.js b/node_modules/curri/curri.js
new file mode 100644
index 0000000..15c86bc
--- /dev/null
+++ b/node_modules/curri/curri.js
@@ -0,0 +1,26 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+  typeof define === 'function' && define.amd ? define(factory) :
+  (global = global || self, global.curri = factory());
+}(this, function () { 'use strict';
+
+  /**
+   * Function to curry any javascript method
+   * @param   {Function}  fn - the target function we want to curry
+   * @param   {...[args]} acc - initial arguments
+   * @returns {Function|*} it will return a function until the target function
+   *                       will receive all of its arguments
+   */
+  function curry(fn, ...acc) {
+    return (...args) => {
+      args = [...acc, ...args];
+
+      return args.length < fn.length ?
+        curry(fn, ...args) :
+        fn(...args)
+    }
+  }
+
+  return curry;
+
+}));
diff --git a/node_modules/curri/index.next.js b/node_modules/curri/index.next.js
new file mode 100644
index 0000000..486956f
--- /dev/null
+++ b/node_modules/curri/index.next.js
@@ -0,0 +1,16 @@
+/**
+ * Function to curry any javascript method
+ * @param   {Function}  fn - the target function we want to curry
+ * @param   {...[args]} acc - initial arguments
+ * @returns {Function|*} it will return a function until the target function
+ *                       will receive all of its arguments
+ */
+export default function curry(fn, ...acc) {
+  return (...args) => {
+    args = [...acc, ...args]
+
+    return args.length < fn.length ?
+      curry(fn, ...args) :
+      fn(...args)
+  }
+}
\ No newline at end of file
diff --git a/node_modules/curri/package.json b/node_modules/curri/package.json
new file mode 100644
index 0000000..d2e9a00
--- /dev/null
+++ b/node_modules/curri/package.json
@@ -0,0 +1,70 @@
+{
+  "_from": "curri@^1.0.1",
+  "_id": "curri@1.0.1",
+  "_inBundle": false,
+  "_integrity": "sha512-VwFb2MGqN0A1RPA0vSgDRSWc0c+V6N9yz8pVYJ9AXILAukRAyCZP5Sqp4VdOxgw1lT0t5oaplwIDT/ruF3Nz7Q==",
+  "_location": "/curri",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "curri@^1.0.1",
+    "name": "curri",
+    "escapedName": "curri",
+    "rawSpec": "^1.0.1",
+    "saveSpec": null,
+    "fetchSpec": "^1.0.1"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler",
+    "/@riotjs/parser",
+    "/riot"
+  ],
+  "_resolved": "https://registry.npmjs.org/curri/-/curri-1.0.1.tgz",
+  "_shasum": "faf9d8900a20e85c1701df64a581cdcdcedb29b1",
+  "_spec": "curri@^1.0.1",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/riot",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/GianlucaGuarini/curri/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Minimal curry implementation",
+  "devDependencies": {
+    "@gianlucaguarini/eslint-config": "^2.0.0",
+    "eslint": "^5.16.0",
+    "mocha": "^6.0.2",
+    "rollup": "^1.7.4"
+  },
+  "files": [
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/GianlucaGuarini/curri#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "curry",
+    "currying",
+    "functional"
+  ],
+  "license": "MIT",
+  "main": "curri.js",
+  "module": "index.next.js",
+  "name": "curri",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/GianlucaGuarini/curri.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "test": "npm run lint && mocha test.js"
+  },
+  "version": "1.0.1"
+}
diff --git a/node_modules/dom-nodes/LICENSE b/node_modules/dom-nodes/LICENSE
new file mode 100644
index 0000000..74e6791
--- /dev/null
+++ b/node_modules/dom-nodes/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Gianluca Guarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/dom-nodes/README.md b/node_modules/dom-nodes/README.md
new file mode 100644
index 0000000..f3d3447
--- /dev/null
+++ b/node_modules/dom-nodes/README.md
@@ -0,0 +1,267 @@
+# dom-nodes
+
+[![Build Status][travis-image]][travis-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![MIT License][license-image]][license-url]
+
+## Installation
+
+```bash
+$ npm i dom-nodes -S
+```
+
+## Usage
+
+```js
+import {isVoid} from 'dom-nodes'
+isVoid('div') // false
+isVoid('img') // true
+```
+
+`dom-nodes` exports all the methods [listed below](#API) giving you some simple tests to understand which kind of node you are dealing with.
+
+This project includes [html-tags](https://github.com/sindresorhus/html-tags) and [svg-tag-names](https://github.com/wooorm/svg-tag-names) directly in its source code avoiding to rely on third party npm modules for such simple list of strings.
+This project couldn't have been made without the projects above!
+
+[travis-image]: https://img.shields.io/travis/riot/dom-nodes.svg?style=flat-square
+
+[travis-url]: https://travis-ci.org/riot/dom-nodes
+
+[license-image]: http://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+
+[license-url]: LICENSE
+
+[npm-version-image]: http://img.shields.io/npm/v/dom-nodes.svg?style=flat-square
+
+[npm-downloads-image]: http://img.shields.io/npm/dm/dom-nodes.svg?style=flat-square
+
+[npm-url]: https://npmjs.org/package/dom-nodes
+
+## API
+
+<!-- Generated by documentation.js. Update this documentation by updating the source code. -->
+
+#### Table of Contents
+
+-   [VOID_SVG_TAGS_LIST](#void_svg_tags_list)
+-   [HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST](#html_elements_having_value_attribute_list)
+-   [SVG_TAGS_LIST](#svg_tags_list)
+-   [VOID_HTML_TAGS_LIST](#void_html_tags_list)
+-   [HTML_TAGS_LIST](#html_tags_list)
+-   [BOOLEAN_ATTRIBUTES_LIST](#boolean_attributes_list)
+-   [HTML_TAGS_RE](#html_tags_re)
+-   [SVG_TAGS_RE](#svg_tags_re)
+-   [VOID_HTML_TAGS_RE](#void_html_tags_re)
+-   [VOID_SVG_TAGS_RE](#void_svg_tags_re)
+-   [HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE](#html_elements_having_value_attribute_re)
+-   [BOOLEAN_ATTRIBUTES_RE](#boolean_attributes_re)
+-   [isVoid](#isvoid)
+    -   [Parameters](#parameters)
+    -   [Examples](#examples)
+-   [isHtml](#ishtml)
+    -   [Parameters](#parameters-1)
+    -   [Examples](#examples-1)
+-   [isSvg](#issvg)
+    -   [Parameters](#parameters-2)
+    -   [Examples](#examples-2)
+-   [isCustom](#iscustom)
+    -   [Parameters](#parameters-3)
+    -   [Examples](#examples-3)
+-   [hasValueAttribute](#hasvalueattribute)
+    -   [Parameters](#parameters-4)
+    -   [Examples](#examples-4)
+-   [isBoolAttribute](#isboolattribute)
+    -   [Parameters](#parameters-5)
+    -   [Examples](#examples-5)
+
+### VOID_SVG_TAGS_LIST
+
+SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+
+Type: [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)
+
+### HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST
+
+List of html elements where the value attribute is allowed
+
+Type: [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)
+
+### SVG_TAGS_LIST
+
+-   **See: <https://github.com/wooorm/svg-tag-names>**
+
+List of all the available svg tags
+
+Type: [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)
+
+### VOID_HTML_TAGS_LIST
+
+-   **See: <http://www.w3.org/TR/html-markup/syntax.html#syntax-elements>**
+-   **See: <http://www.w3.org/TR/html5/syntax.html#void-elements>**
+
+HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+
+Type: [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)
+
+### HTML_TAGS_LIST
+
+-   **See: <https://github.com/sindresorhus/html-tags>**
+
+List of all the html tags
+
+Type: [Array](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Array)
+
+### BOOLEAN_ATTRIBUTES_LIST
+
+-   **See: <https://www.w3.org/TR/html5/infrastructure.html#sec-boolean-attributes>**
+
+List of all boolean HTML attributes
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### HTML_TAGS_RE
+
+Regex matching all the html tags ignoring the cases
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### SVG_TAGS_RE
+
+Regex matching all the svg tags ignoring the cases
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### VOID_HTML_TAGS_RE
+
+Regex matching all the void html tags ignoring the cases
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### VOID_SVG_TAGS_RE
+
+Regex matching all the void svg tags ignoring the cases
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE
+
+Regex matching all the html tags where the value tag is allowed
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### BOOLEAN_ATTRIBUTES_RE
+
+Regex matching all the boolean attributes
+
+Type: [RegExp](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RegExp)
+
+### isVoid
+
+True if it's a self closing tag
+
+#### Parameters
+
+-   `tag` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test tag
+
+#### Examples
+
+```javascript
+isVoid('meta') // true
+isVoid('circle') // true
+isVoid('IMG') // true
+isVoid('div') // false
+isVoid('mask') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if void
+
+### isHtml
+
+True if it's a known HTML tag
+
+#### Parameters
+
+-   `tag` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test tag
+
+#### Examples
+
+```javascript
+isHtml('img') // true
+isHtml('IMG') // true
+isHtml('Img') // true
+isHtml('path') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if html tag
+
+### isSvg
+
+True if it's a known SVG tag
+
+#### Parameters
+
+-   `tag` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test tag
+
+#### Examples
+
+```javascript
+isSvg('g') // true
+isSvg('radialGradient') // true
+isSvg('radialgradient') // true
+isSvg('div') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if svg tag
+
+### isCustom
+
+True if it's not SVG nor a HTML known tag
+
+#### Parameters
+
+-   `tag` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test tag
+
+#### Examples
+
+```javascript
+isCustom('my-component') // true
+isCustom('div') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if custom element
+
+### hasValueAttribute
+
+True if the value attribute is allowed on this tag
+
+#### Parameters
+
+-   `tag` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test tag
+
+#### Examples
+
+```javascript
+hasValueAttribute('input') // true
+hasValueAttribute('div') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if the value attribute is allowed
+
+### isBoolAttribute
+
+True if it's a boolean attribute
+
+#### Parameters
+
+-   `attribute` **[string](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/String)** test attribute
+
+#### Examples
+
+```javascript
+isBoolAttribute('selected') // true
+isBoolAttribute('class') // false
+```
+
+Returns **[boolean](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Boolean)** true if the attribute is a boolean type
diff --git a/node_modules/dom-nodes/dom-nodes.js b/node_modules/dom-nodes/dom-nodes.js
new file mode 100644
index 0000000..225e1a5
--- /dev/null
+++ b/node_modules/dom-nodes/dom-nodes.js
@@ -0,0 +1,473 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = global || self, factory(global.domNodes = {}));
+}(this, function (exports) { 'use strict';
+
+  // similar to _.uniq
+  const uniq = l => l.filter((x, i, a) => a.indexOf(x) === i);
+
+  /**
+   * SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+   * @const {Array}
+   */
+  const VOID_SVG_TAGS_LIST = [
+    'circle',
+    'ellipse',
+    'line',
+    'path',
+    'polygon',
+    'polyline',
+    'rect',
+    'stop',
+    'use'
+  ];
+
+  /**
+   * List of html elements where the value attribute is allowed
+   * @type {Array}
+   */
+  const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST = [
+    'button',
+    'data',
+    'input',
+    'select',
+    'li',
+    'meter',
+    'option',
+    'output',
+    'progress',
+    'textarea',
+    'param'
+  ];
+
+  /**
+   * List of all the available svg tags
+   * @const {Array}
+   * @see {@link https://github.com/wooorm/svg-tag-names}
+   */
+  const SVG_TAGS_LIST = uniq([
+    'a',
+    'altGlyph',
+    'altGlyphDef',
+    'altGlyphItem',
+    'animate',
+    'animateColor',
+    'animateMotion',
+    'animateTransform',
+    'animation',
+    'audio',
+    'canvas',
+    'clipPath',
+    'color-profile',
+    'cursor',
+    'defs',
+    'desc',
+    'discard',
+    'feBlend',
+    'feColorMatrix',
+    'feComponentTransfer',
+    'feComposite',
+    'feConvolveMatrix',
+    'feDiffuseLighting',
+    'feDisplacementMap',
+    'feDistantLight',
+    'feDropShadow',
+    'feFlood',
+    'feFuncA',
+    'feFuncB',
+    'feFuncG',
+    'feFuncR',
+    'feGaussianBlur',
+    'feImage',
+    'feMerge',
+    'feMergeNode',
+    'feMorphology',
+    'feOffset',
+    'fePointLight',
+    'feSpecularLighting',
+    'feSpotLight',
+    'feTile',
+    'feTurbulence',
+    'filter',
+    'font',
+    'font-face',
+    'font-face-format',
+    'font-face-name',
+    'font-face-src',
+    'font-face-uri',
+    'foreignObject',
+    'g',
+    'glyph',
+    'glyphRef',
+    'handler',
+    'hatch',
+    'hatchpath',
+    'hkern',
+    'iframe',
+    'image',
+    'linearGradient',
+    'listener',
+    'marker',
+    'mask',
+    'mesh',
+    'meshgradient',
+    'meshpatch',
+    'meshrow',
+    'metadata',
+    'missing-glyph',
+    'mpath',
+    'pattern',
+    'prefetch',
+    'radialGradient',
+    'script',
+    'set',
+    'solidColor',
+    'solidcolor',
+    'style',
+    'svg',
+    'switch',
+    'symbol',
+    'tbreak',
+    'text',
+    'textArea',
+    'textPath',
+    'title',
+    'tref',
+    'tspan',
+    'unknown',
+    'video',
+    'view',
+    'vkern'
+  ].concat(VOID_SVG_TAGS_LIST)).sort();
+
+  /**
+   * HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+   * @type {Array}
+   * @see   {@link http://www.w3.org/TR/html-markup/syntax.html#syntax-elements}
+   * @see   {@link http://www.w3.org/TR/html5/syntax.html#void-elements}
+   */
+  const VOID_HTML_TAGS_LIST = [
+    'area',
+    'base',
+    'br',
+    'col',
+    'embed',
+    'hr',
+    'img',
+    'input',
+    'keygen',
+    'link',
+    'menuitem',
+    'meta',
+    'param',
+    'source',
+    'track',
+    'wbr'
+  ];
+
+  /**
+   * List of all the html tags
+   * @const {Array}
+   * @see {@link https://github.com/sindresorhus/html-tags}
+   */
+  const HTML_TAGS_LIST = uniq([
+    'a',
+    'abbr',
+    'address',
+    'article',
+    'aside',
+    'audio',
+    'b',
+    'bdi',
+    'bdo',
+    'blockquote',
+    'body',
+    'canvas',
+    'caption',
+    'cite',
+    'code',
+    'colgroup',
+    'datalist',
+    'dd',
+    'del',
+    'details',
+    'dfn',
+    'dialog',
+    'div',
+    'dl',
+    'dt',
+    'em',
+    'fieldset',
+    'figcaption',
+    'figure',
+    'footer',
+    'form',
+    'h1',
+    'h2',
+    'h3',
+    'h4',
+    'h5',
+    'h6',
+    'head',
+    'header',
+    'hgroup',
+    'html',
+    'i',
+    'iframe',
+    'ins',
+    'kbd',
+    'label',
+    'legend',
+    'main',
+    'map',
+    'mark',
+    'math',
+    'menu',
+    'nav',
+    'noscript',
+    'object',
+    'ol',
+    'optgroup',
+    'p',
+    'picture',
+    'pre',
+    'q',
+    'rb',
+    'rp',
+    'rt',
+    'rtc',
+    'ruby',
+    's',
+    'samp',
+    'script',
+    'section',
+    'select',
+    'slot',
+    'small',
+    'span',
+    'strong',
+    'style',
+    'sub',
+    'summary',
+    'sup',
+    'svg',
+    'table',
+    'tbody',
+    'td',
+    'template',
+    'tfoot',
+    'th',
+    'thead',
+    'time',
+    'title',
+    'tr',
+    'u',
+    'ul',
+    'var',
+    'video'
+  ]
+    .concat(VOID_HTML_TAGS_LIST)
+    .concat(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST)
+  ).sort();
+
+  /**
+   * List of all boolean HTML attributes
+   * @const {RegExp}
+   * @see {@link https://www.w3.org/TR/html5/infrastructure.html#sec-boolean-attributes}
+   */
+  const BOOLEAN_ATTRIBUTES_LIST = [
+    'disabled',
+    'visible',
+    'checked',
+    'readonly',
+    'required',
+    'allowfullscreen',
+    'autofocus',
+    'autoplay',
+    'compact',
+    'controls',
+    'default',
+    'formnovalidate',
+    'hidden',
+    'ismap',
+    'itemscope',
+    'loop',
+    'multiple',
+    'muted',
+    'noresize',
+    'noshade',
+    'novalidate',
+    'nowrap',
+    'open',
+    'reversed',
+    'seamless',
+    'selected',
+    'sortable',
+    'truespeed',
+    'typemustmatch'
+  ];
+
+  /**
+   * Join a list of items with the pipe symbol (usefull for regex list concatenation)
+   * @private
+   * @param   {Array} list - list of strings
+   * @returns {string} the list received joined with pipes
+   */
+  function joinWithPipe(list) {
+    return list.join('|')
+  }
+
+  /**
+   * Convert list of strings to regex in order to test against it ignoring the cases
+   * @private
+   * @param   {...Array} lists - array of strings
+   * @returns {RegExp} regex that will match all the strings in the array received ignoring the cases
+   */
+  function listsToRegex(...lists) {
+    return new RegExp(`^/?(?:${joinWithPipe(lists.map(joinWithPipe))})$`, 'i')
+  }
+
+  /**
+   * Regex matching all the html tags ignoring the cases
+   * @const {RegExp}
+   */
+  const HTML_TAGS_RE = listsToRegex(HTML_TAGS_LIST);
+
+  /**
+   * Regex matching all the svg tags ignoring the cases
+   * @const {RegExp}
+   */
+  const SVG_TAGS_RE = listsToRegex(SVG_TAGS_LIST);
+
+  /**
+   * Regex matching all the void html tags ignoring the cases
+   * @const {RegExp}
+   */
+  const VOID_HTML_TAGS_RE =  listsToRegex(VOID_HTML_TAGS_LIST);
+
+  /**
+   * Regex matching all the void svg tags ignoring the cases
+   * @const {RegExp}
+   */
+  const VOID_SVG_TAGS_RE =  listsToRegex(VOID_SVG_TAGS_LIST);
+
+  /**
+   * Regex matching all the html tags where the value tag is allowed
+   * @const {RegExp}
+   */
+  const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE = listsToRegex(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST);
+
+  /**
+   * Regex matching all the boolean attributes
+   * @const {RegExp}
+   */
+  const BOOLEAN_ATTRIBUTES_RE =  listsToRegex(BOOLEAN_ATTRIBUTES_LIST);
+
+  /**
+   * True if it's a self closing tag
+   * @param   {string}  tag - test tag
+   * @returns {boolean} true if void
+   * @example
+   * isVoid('meta') // true
+   * isVoid('circle') // true
+   * isVoid('IMG') // true
+   * isVoid('div') // false
+   * isVoid('mask') // false
+   */
+  function isVoid(tag) {
+    return [
+      VOID_HTML_TAGS_RE,
+      VOID_SVG_TAGS_RE
+    ].some(r => r.test(tag))
+  }
+
+  /**
+   * True if it's a known HTML tag
+   * @param   {string}  tag - test tag
+   * @returns {boolean} true if html tag
+   * @example
+   * isHtml('img') // true
+   * isHtml('IMG') // true
+   * isHtml('Img') // true
+   * isHtml('path') // false
+   */
+  function isHtml(tag) {
+    return HTML_TAGS_RE.test(tag)
+  }
+
+  /**
+   * True if it's a known SVG tag
+   * @param   {string}  tag - test tag
+   * @returns {boolean} true if svg tag
+   * @example
+   * isSvg('g') // true
+   * isSvg('radialGradient') // true
+   * isSvg('radialgradient') // true
+   * isSvg('div') // false
+   */
+  function isSvg(tag) {
+    return SVG_TAGS_RE.test(tag)
+  }
+
+  /**
+   * True if it's not SVG nor a HTML known tag
+   * @param   {string}  tag - test tag
+   * @returns {boolean} true if custom element
+   * @example
+   * isCustom('my-component') // true
+   * isCustom('div') // false
+   */
+  function isCustom(tag) {
+    return [
+      HTML_TAGS_RE,
+      SVG_TAGS_RE
+    ].every(l => !l.test(tag))
+  }
+
+  /**
+   * True if the value attribute is allowed on this tag
+   * @param   {string}  tag - test tag
+   * @returns {boolean} true if the value attribute is allowed
+   * @example
+   * hasValueAttribute('input') // true
+   * hasValueAttribute('div') // false
+   */
+  function hasValueAttribute(tag) {
+    return HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE.test(tag)
+  }
+
+  /**
+   * True if it's a boolean attribute
+   * @param   {string} attribute - test attribute
+   * @returns {boolean} true if the attribute is a boolean type
+   * @example
+   * isBoolAttribute('selected') // true
+   * isBoolAttribute('class') // false
+   */
+  function isBoolAttribute(attribute) {
+    return BOOLEAN_ATTRIBUTES_RE.test(attribute)
+  }
+
+  exports.BOOLEAN_ATTRIBUTES_LIST = BOOLEAN_ATTRIBUTES_LIST;
+  exports.BOOLEAN_ATTRIBUTES_RE = BOOLEAN_ATTRIBUTES_RE;
+  exports.HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST = HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST;
+  exports.HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE = HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE;
+  exports.HTML_TAGS_LIST = HTML_TAGS_LIST;
+  exports.HTML_TAGS_RE = HTML_TAGS_RE;
+  exports.SVG_TAGS_LIST = SVG_TAGS_LIST;
+  exports.SVG_TAGS_RE = SVG_TAGS_RE;
+  exports.VOID_HTML_TAGS_LIST = VOID_HTML_TAGS_LIST;
+  exports.VOID_HTML_TAGS_RE = VOID_HTML_TAGS_RE;
+  exports.VOID_SVG_TAGS_LIST = VOID_SVG_TAGS_LIST;
+  exports.VOID_SVG_TAGS_RE = VOID_SVG_TAGS_RE;
+  exports.hasValueAttribute = hasValueAttribute;
+  exports.isBoolAttribute = isBoolAttribute;
+  exports.isCustom = isCustom;
+  exports.isHtml = isHtml;
+  exports.isSvg = isSvg;
+  exports.isVoid = isVoid;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/dom-nodes/index.next.js b/node_modules/dom-nodes/index.next.js
new file mode 100644
index 0000000..4466312
--- /dev/null
+++ b/node_modules/dom-nodes/index.next.js
@@ -0,0 +1,444 @@
+// similar to _.uniq
+const uniq = l => l.filter((x, i, a) => a.indexOf(x) === i)
+
+/**
+ * SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+ * @const {Array}
+ */
+export const VOID_SVG_TAGS_LIST = [
+  'circle',
+  'ellipse',
+  'line',
+  'path',
+  'polygon',
+  'polyline',
+  'rect',
+  'stop',
+  'use'
+]
+
+/**
+ * List of html elements where the value attribute is allowed
+ * @type {Array}
+ */
+export const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST = [
+  'button',
+  'data',
+  'input',
+  'select',
+  'li',
+  'meter',
+  'option',
+  'output',
+  'progress',
+  'textarea',
+  'param'
+]
+
+/**
+ * List of all the available svg tags
+ * @const {Array}
+ * @see {@link https://github.com/wooorm/svg-tag-names}
+ */
+export const SVG_TAGS_LIST = uniq([
+  'a',
+  'altGlyph',
+  'altGlyphDef',
+  'altGlyphItem',
+  'animate',
+  'animateColor',
+  'animateMotion',
+  'animateTransform',
+  'animation',
+  'audio',
+  'canvas',
+  'clipPath',
+  'color-profile',
+  'cursor',
+  'defs',
+  'desc',
+  'discard',
+  'feBlend',
+  'feColorMatrix',
+  'feComponentTransfer',
+  'feComposite',
+  'feConvolveMatrix',
+  'feDiffuseLighting',
+  'feDisplacementMap',
+  'feDistantLight',
+  'feDropShadow',
+  'feFlood',
+  'feFuncA',
+  'feFuncB',
+  'feFuncG',
+  'feFuncR',
+  'feGaussianBlur',
+  'feImage',
+  'feMerge',
+  'feMergeNode',
+  'feMorphology',
+  'feOffset',
+  'fePointLight',
+  'feSpecularLighting',
+  'feSpotLight',
+  'feTile',
+  'feTurbulence',
+  'filter',
+  'font',
+  'font-face',
+  'font-face-format',
+  'font-face-name',
+  'font-face-src',
+  'font-face-uri',
+  'foreignObject',
+  'g',
+  'glyph',
+  'glyphRef',
+  'handler',
+  'hatch',
+  'hatchpath',
+  'hkern',
+  'iframe',
+  'image',
+  'linearGradient',
+  'listener',
+  'marker',
+  'mask',
+  'mesh',
+  'meshgradient',
+  'meshpatch',
+  'meshrow',
+  'metadata',
+  'missing-glyph',
+  'mpath',
+  'pattern',
+  'prefetch',
+  'radialGradient',
+  'script',
+  'set',
+  'solidColor',
+  'solidcolor',
+  'style',
+  'svg',
+  'switch',
+  'symbol',
+  'tbreak',
+  'text',
+  'textArea',
+  'textPath',
+  'title',
+  'tref',
+  'tspan',
+  'unknown',
+  'video',
+  'view',
+  'vkern'
+].concat(VOID_SVG_TAGS_LIST)).sort()
+
+/**
+ * HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+ * @type {Array}
+ * @see   {@link http://www.w3.org/TR/html-markup/syntax.html#syntax-elements}
+ * @see   {@link http://www.w3.org/TR/html5/syntax.html#void-elements}
+ */
+export const VOID_HTML_TAGS_LIST = [
+  'area',
+  'base',
+  'br',
+  'col',
+  'embed',
+  'hr',
+  'img',
+  'input',
+  'keygen',
+  'link',
+  'menuitem',
+  'meta',
+  'param',
+  'source',
+  'track',
+  'wbr'
+]
+
+/**
+ * List of all the html tags
+ * @const {Array}
+ * @see {@link https://github.com/sindresorhus/html-tags}
+ */
+export const HTML_TAGS_LIST = uniq([
+  'a',
+  'abbr',
+  'address',
+  'article',
+  'aside',
+  'audio',
+  'b',
+  'bdi',
+  'bdo',
+  'blockquote',
+  'body',
+  'canvas',
+  'caption',
+  'cite',
+  'code',
+  'colgroup',
+  'datalist',
+  'dd',
+  'del',
+  'details',
+  'dfn',
+  'dialog',
+  'div',
+  'dl',
+  'dt',
+  'em',
+  'fieldset',
+  'figcaption',
+  'figure',
+  'footer',
+  'form',
+  'h1',
+  'h2',
+  'h3',
+  'h4',
+  'h5',
+  'h6',
+  'head',
+  'header',
+  'hgroup',
+  'html',
+  'i',
+  'iframe',
+  'ins',
+  'kbd',
+  'label',
+  'legend',
+  'main',
+  'map',
+  'mark',
+  'math',
+  'menu',
+  'nav',
+  'noscript',
+  'object',
+  'ol',
+  'optgroup',
+  'p',
+  'picture',
+  'pre',
+  'q',
+  'rb',
+  'rp',
+  'rt',
+  'rtc',
+  'ruby',
+  's',
+  'samp',
+  'script',
+  'section',
+  'select',
+  'slot',
+  'small',
+  'span',
+  'strong',
+  'style',
+  'sub',
+  'summary',
+  'sup',
+  'svg',
+  'table',
+  'tbody',
+  'td',
+  'template',
+  'tfoot',
+  'th',
+  'thead',
+  'time',
+  'title',
+  'tr',
+  'u',
+  'ul',
+  'var',
+  'video'
+]
+  .concat(VOID_HTML_TAGS_LIST)
+  .concat(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST)
+).sort()
+
+/**
+ * List of all boolean HTML attributes
+ * @const {RegExp}
+ * @see {@link https://www.w3.org/TR/html5/infrastructure.html#sec-boolean-attributes}
+ */
+export const BOOLEAN_ATTRIBUTES_LIST = [
+  'disabled',
+  'visible',
+  'checked',
+  'readonly',
+  'required',
+  'allowfullscreen',
+  'autofocus',
+  'autoplay',
+  'compact',
+  'controls',
+  'default',
+  'formnovalidate',
+  'hidden',
+  'ismap',
+  'itemscope',
+  'loop',
+  'multiple',
+  'muted',
+  'noresize',
+  'noshade',
+  'novalidate',
+  'nowrap',
+  'open',
+  'reversed',
+  'seamless',
+  'selected',
+  'sortable',
+  'truespeed',
+  'typemustmatch'
+]
+
+/**
+ * Join a list of items with the pipe symbol (usefull for regex list concatenation)
+ * @private
+ * @param   {Array} list - list of strings
+ * @returns {string} the list received joined with pipes
+ */
+function joinWithPipe(list) {
+  return list.join('|')
+}
+
+/**
+ * Convert list of strings to regex in order to test against it ignoring the cases
+ * @private
+ * @param   {...Array} lists - array of strings
+ * @returns {RegExp} regex that will match all the strings in the array received ignoring the cases
+ */
+function listsToRegex(...lists) {
+  return new RegExp(`^/?(?:${joinWithPipe(lists.map(joinWithPipe))})$`, 'i')
+}
+
+/**
+ * Regex matching all the html tags ignoring the cases
+ * @const {RegExp}
+ */
+export const HTML_TAGS_RE = listsToRegex(HTML_TAGS_LIST)
+
+/**
+ * Regex matching all the svg tags ignoring the cases
+ * @const {RegExp}
+ */
+export const SVG_TAGS_RE = listsToRegex(SVG_TAGS_LIST)
+
+/**
+ * Regex matching all the void html tags ignoring the cases
+ * @const {RegExp}
+ */
+export const VOID_HTML_TAGS_RE =  listsToRegex(VOID_HTML_TAGS_LIST)
+
+/**
+ * Regex matching all the void svg tags ignoring the cases
+ * @const {RegExp}
+ */
+export const VOID_SVG_TAGS_RE =  listsToRegex(VOID_SVG_TAGS_LIST)
+
+/**
+ * Regex matching all the html tags where the value tag is allowed
+ * @const {RegExp}
+ */
+export const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE = listsToRegex(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST)
+
+/**
+ * Regex matching all the boolean attributes
+ * @const {RegExp}
+ */
+export const BOOLEAN_ATTRIBUTES_RE =  listsToRegex(BOOLEAN_ATTRIBUTES_LIST)
+
+/**
+ * True if it's a self closing tag
+ * @param   {string}  tag - test tag
+ * @returns {boolean} true if void
+ * @example
+ * isVoid('meta') // true
+ * isVoid('circle') // true
+ * isVoid('IMG') // true
+ * isVoid('div') // false
+ * isVoid('mask') // false
+ */
+export function isVoid(tag) {
+  return [
+    VOID_HTML_TAGS_RE,
+    VOID_SVG_TAGS_RE
+  ].some(r => r.test(tag))
+}
+
+/**
+ * True if it's a known HTML tag
+ * @param   {string}  tag - test tag
+ * @returns {boolean} true if html tag
+ * @example
+ * isHtml('img') // true
+ * isHtml('IMG') // true
+ * isHtml('Img') // true
+ * isHtml('path') // false
+ */
+export function isHtml(tag) {
+  return HTML_TAGS_RE.test(tag)
+}
+
+/**
+ * True if it's a known SVG tag
+ * @param   {string}  tag - test tag
+ * @returns {boolean} true if svg tag
+ * @example
+ * isSvg('g') // true
+ * isSvg('radialGradient') // true
+ * isSvg('radialgradient') // true
+ * isSvg('div') // false
+ */
+export function isSvg(tag) {
+  return SVG_TAGS_RE.test(tag)
+}
+
+/**
+ * True if it's not SVG nor a HTML known tag
+ * @param   {string}  tag - test tag
+ * @returns {boolean} true if custom element
+ * @example
+ * isCustom('my-component') // true
+ * isCustom('div') // false
+ */
+export function isCustom(tag) {
+  return [
+    HTML_TAGS_RE,
+    SVG_TAGS_RE
+  ].every(l => !l.test(tag))
+}
+
+/**
+ * True if the value attribute is allowed on this tag
+ * @param   {string}  tag - test tag
+ * @returns {boolean} true if the value attribute is allowed
+ * @example
+ * hasValueAttribute('input') // true
+ * hasValueAttribute('div') // false
+ */
+export function hasValueAttribute(tag) {
+  return HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE.test(tag)
+}
+
+/**
+ * True if it's a boolean attribute
+ * @param   {string} attribute - test attribute
+ * @returns {boolean} true if the attribute is a boolean type
+ * @example
+ * isBoolAttribute('selected') // true
+ * isBoolAttribute('class') // false
+ */
+export function isBoolAttribute(attribute) {
+  return BOOLEAN_ATTRIBUTES_RE.test(attribute)
+}
\ No newline at end of file
diff --git a/node_modules/dom-nodes/package.json b/node_modules/dom-nodes/package.json
new file mode 100644
index 0000000..f3b767c
--- /dev/null
+++ b/node_modules/dom-nodes/package.json
@@ -0,0 +1,71 @@
+{
+  "_from": "dom-nodes@^1.1.3",
+  "_id": "dom-nodes@1.1.3",
+  "_inBundle": false,
+  "_integrity": "sha512-y5wnIx97oe0IqMllL/lizgkK2c9vu1cQeqPCCsS7mwNdPuYxg3b04eDJynHhC63kM8+ZsteOmiPElfVGOUmmKg==",
+  "_location": "/dom-nodes",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "dom-nodes@^1.1.3",
+    "name": "dom-nodes",
+    "escapedName": "dom-nodes",
+    "rawSpec": "^1.1.3",
+    "saveSpec": null,
+    "fetchSpec": "^1.1.3"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler",
+    "/@riotjs/parser"
+  ],
+  "_resolved": "https://registry.npmjs.org/dom-nodes/-/dom-nodes-1.1.3.tgz",
+  "_shasum": "608d569eafacadef857f09505123efd10a566030",
+  "_spec": "dom-nodes@^1.1.3",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/riot/dom-nodes/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "List of all the available DOM and SVG nodes and helper functions to quickly test against them",
+  "devDependencies": {
+    "eslint": "^6.1.0",
+    "eslint-config-riot": "^3.0.0",
+    "mocha": "^6.2.0",
+    "rollup": "^1.18.0"
+  },
+  "files": [
+    "index.next.js"
+  ],
+  "homepage": "https://github.com/riot/dom-nodes#readme",
+  "jsnext:main": "index.next.js",
+  "keywords": [
+    "html",
+    "svg",
+    "void",
+    "dom",
+    "riot"
+  ],
+  "license": "MIT",
+  "main": "dom-nodes.js",
+  "module": "index.next.js",
+  "name": "dom-nodes",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/riot/dom-nodes.git"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "doc": "npx documentation readme index.next.js -s API",
+    "lint": "eslint index.next.js test.js rollup.config.js",
+    "prepare": "npm run build && npm test",
+    "test": "npm run build && npm run lint && mocha test.js"
+  },
+  "version": "1.1.3"
+}
diff --git a/node_modules/domdiff/LICENSE b/node_modules/domdiff/LICENSE
new file mode 100644
index 0000000..9b3119f
--- /dev/null
+++ b/node_modules/domdiff/LICENSE
@@ -0,0 +1,15 @@
+ISC License
+
+Copyright (c) 2017, Andrea Giammarchi, @WebReflection
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
+OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/domdiff/README.md b/node_modules/domdiff/README.md
new file mode 100644
index 0000000..9e8e8cd
--- /dev/null
+++ b/node_modules/domdiff/README.md
@@ -0,0 +1,179 @@
+# domdiff
+
+[![donate](https://img.shields.io/badge/$-donate-ff69b4.svg?maxAge=2592000&style=flat)](https://github.com/WebReflection/donate) [![Coverage Status](https://coveralls.io/repos/github/WebReflection/domdiff/badge.svg?branch=master)](https://coveralls.io/github/WebReflection/domdiff?branch=master) [![Build Status](https://travis-ci.org/WebReflection/domdiff.svg?branch=master)](https://travis-ci.org/WebReflection/domdiff) [![License: ISC](https://img.shields.io/badge/License-ISC-yellow.svg)](https://opensource.org/licenses/ISC)
+
+
+A vDOM-less implementation of the [petit-dom](https://github.com/yelouafi/petit-dom) diffing logic, at the core of [hyperHTML](https://github.com/WebReflection/hyperHTML).
+
+
+### V2 breaking change
+
+  * the good old snabdom diff logic has been 100% replaced
+  * lists with `null` or `undefined` nodes are not allowed anymore
+
+<sup><sub>... but I guess having null nodes in the equation was quite possibly a bad idea in the first place ...</sub></sup>
+
+#### V2 Diffing Strategies:
+
+  * common prefixes
+  * common suffixes
+  * skip same lists
+  * add boundaries
+  * remove boundaries
+  * simple sub-sequences insertions and removals
+  * one to many and many to one replacements
+  * fast inverted list swap
+  * O(ND) algo with a limit of 50 attempts
+  * last fallback with a simplified Hunt Szymanski algorithm
+
+The current goal is to have in about 1K the best DOM diffing library out there.
+
+#### V1 breaking change
+
+The signature has moved from `parent, current[], future[], getNode(), beforeNode` to `parent, current[], future[], {before, compare(), node()}`.
+
+
+### Signature
+
+```js
+futureNodes = domdiff(
+  parentNode,     // where changes happen
+  currentNodes,   // Array of current items/nodes
+  futureNodes,    // Array of future items/nodes (returned)
+  options         // optional object with one of the following properties
+                  //  before: domNode
+                  //  compare(generic, generic) => true if same generic
+                  //  node(generic) => Node
+);
+```
+
+
+### How to import it:
+
+  * via **CDN**, as global variable: `https://unpkg.com/domdiff`
+  * via **ESM**, as external module: `https://unpkg.com/domdiff/esm/index.js`
+  * via **CJS**: `const EventTarget = require('domdiff').default;` <sup><sub>( or `require('domdiff/cjs').default` )</sub></sup>
+  * via bundlers/transpilers: `import domdiff from 'domdiff';` <sup><sub>( or `from 'domdiff/esm'` )</sub></sup>
+
+
+### Example
+
+```js
+var nodes = {
+  a: document.createTextNode('a'),
+  b: document.createTextNode('b'),
+  c: document.createTextNode('c')
+};
+
+var parentNode = document.createElement('p');
+var childNodes = [nodes.a, nodes.c];
+parentNode.append(...childNodes);
+parentNode.textContent;
+// "ac"
+
+childNodes = domdiff(
+  parentNode,
+  childNodes,
+  [nodes.a, nodes.b, nodes.c]
+);
+
+parentNode.textContent;
+// "abc"
+```
+
+
+### Compatibility:
+
+Every. JavaScript. Engine.
+
+
+### A `{node: (generic, info) => node}` callback for complex data
+
+The optional `{node: (generic, info) => node}` is invoked per each operation on the DOM.
+
+This can be useful to represent node through wrappers, whenever that is needed.
+
+The passed `info` value can be:
+
+  * `1` when the item/node is being appended
+  * `0` when the item/node is being used as insert _before_ reference
+  * `-0` when the item/node is being used as insert _after_ reference
+  * `-1` when the item/node is being removed
+
+[Example](https://codepen.io/WebReflection/pen/bYJVPd?editors=0010)
+
+```js
+function node(item, i) {
+  // case removal or case after
+  if ((1 / i) < 0) {
+    // case removal
+    if (i) {
+      // if the item has more than a node
+      // remove all other nodes at once
+      if (item.length > 1) {
+        const range = document.createRange();
+        range.setStartBefore(item[1]);
+        range.setEndAfter(item[item.length - 1]);
+        range.deleteContents();
+      }
+      // return the first node to be removed
+      return item[0];
+    }
+    // case after
+    else {
+      return item[item.length - 1];
+    }
+  }
+  // case insert
+  else if (i) {
+    const fragment = document.createDocumentFragment();
+    fragment.append(...item);
+    return fragment;
+  }
+  // case before
+  else {
+    return item[0];
+  }
+}
+
+const and = [document.createTextNode(' & ')];
+
+const Bob = [
+  document.createTextNode('B'),
+  document.createTextNode('o'),
+  document.createTextNode('b')
+];
+
+const Lucy = [
+  document.createTextNode('L'),
+  document.createTextNode('u'),
+  document.createTextNode('c'),
+  document.createTextNode('y')
+];
+
+// clean the body for demo purpose
+document.body.textContent = '';
+let content = domdiff(
+  document.body,
+  [],
+  [Bob, and, Lucy],
+  {node}
+);
+
+// ... later on ...
+content = domdiff(
+  document.body,
+  content,
+  [Lucy, and, Bob],
+  {node}
+);
+
+// clean up
+domdiff(
+  document.body,
+  content,
+  [],
+  {node}
+);
+
+```
diff --git a/node_modules/domdiff/cjs/index.js b/node_modules/domdiff/cjs/index.js
new file mode 100644
index 0000000..59104be
--- /dev/null
+++ b/node_modules/domdiff/cjs/index.js
@@ -0,0 +1,222 @@
+'use strict';
+/*! (c) 2018 Andrea Giammarchi (ISC) */
+
+const {
+  eqeq, identity, indexOf, isReversed, next, append, remove, smartDiff
+} = require('./utils.js');
+
+const domdiff = (
+  parentNode,     // where changes happen
+  currentNodes,   // Array of current items/nodes
+  futureNodes,    // Array of future items/nodes
+  options         // optional object with one of the following properties
+                  //  before: domNode
+                  //  compare(generic, generic) => true if same generic
+                  //  node(generic) => Node
+) => {
+  if (!options)
+    options = {};
+
+  const compare = options.compare || eqeq;
+  const get = options.node || identity;
+  const before = options.before == null ? null : get(options.before, 0);
+
+  const currentLength = currentNodes.length;
+  let currentEnd = currentLength;
+  let currentStart = 0;
+
+  let futureEnd = futureNodes.length;
+  let futureStart = 0;
+
+  // common prefix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentStart], futureNodes[futureStart])
+  ) {
+    currentStart++;
+    futureStart++;
+  }
+
+  // common suffix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])
+  ) {
+    currentEnd--;
+    futureEnd--;
+  }
+
+  const currentSame = currentStart === currentEnd;
+  const futureSame = futureStart === futureEnd;
+
+  // same list
+  if (currentSame && futureSame)
+    return futureNodes;
+
+  // only stuff to add
+  if (currentSame && futureStart < futureEnd) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentStart, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // only stuff to remove
+  if (futureSame && currentStart < currentEnd) {
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  const currentChanges = currentEnd - currentStart;
+  const futureChanges = futureEnd - futureStart;
+  let i = -1;
+
+  // 2 simple indels: the shortest sequence is a subsequence of the longest
+  if (currentChanges < futureChanges) {
+    i = indexOf(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    );
+    // inner diff
+    if (-1 < i) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        i,
+        get(currentNodes[currentStart], 0)
+      );
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        i + currentChanges,
+        futureEnd,
+        next(get, currentNodes, currentEnd, currentLength, before)
+      );
+      return futureNodes;
+    }
+  }
+  /* istanbul ignore else */
+  else if (futureChanges < currentChanges) {
+    i = indexOf(
+      currentNodes,
+      currentStart,
+      currentEnd,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      compare
+    );
+    // outer diff
+    if (-1 < i) {
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        currentStart,
+        i
+      );
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        i + futureChanges,
+        currentEnd
+      );
+      return futureNodes;
+    }
+  }
+
+  // common case with one replacement for many nodes
+  // or many nodes replaced for a single one
+  /* istanbul ignore else */
+  if ((currentChanges < 2 || futureChanges < 2)) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      get(currentNodes[currentStart], 0)
+    );
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  // the half match diff part has been skipped in petit-dom
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+  // accordingly, I think it's safe to skip in here too
+  // if one day it'll come out like the speediest thing ever to do
+  // then I might add it in here too
+
+  // Extra: before going too fancy, what about reversed lists ?
+  //        This should bail out pretty quickly if that's not the case.
+  if (
+    currentChanges === futureChanges &&
+    isReversed(
+      futureNodes,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    )
+  ) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentEnd, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // last resort through a smart diff
+  smartDiff(
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    futureEnd,
+    futureChanges,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    currentChanges,
+    currentLength,
+    compare,
+    before
+  );
+
+  return futureNodes;
+};
+
+Object.defineProperty(exports, '__esModule', {value: true}).default = domdiff;
diff --git a/node_modules/domdiff/cjs/utils.js b/node_modules/domdiff/cjs/utils.js
new file mode 100644
index 0000000..d9ab2d0
--- /dev/null
+++ b/node_modules/domdiff/cjs/utils.js
@@ -0,0 +1,388 @@
+'use strict';
+const Map = (require('@ungap/essential-map'));
+
+const {indexOf: iOF} = [];
+const append = (get, parent, children, start, end, before) => {
+  const isSelect = 'selectedIndex' in parent;
+  let noSelection = isSelect;
+  while (start < end) {
+    const child = get(children[start], 1);
+    parent.insertBefore(child, before);
+    if (isSelect && noSelection && child.selected) {
+      noSelection = !noSelection;
+      let {selectedIndex} = parent;
+      parent.selectedIndex = selectedIndex < 0 ?
+        start :
+        iOF.call(parent.querySelectorAll('option'), child);
+    }
+    start++;
+  }
+};
+exports.append = append;
+
+const eqeq = (a, b) => a == b;
+exports.eqeq = eqeq;
+
+const identity = O => O;
+exports.identity = identity;
+
+const indexOf = (
+  moreNodes,
+  moreStart,
+  moreEnd,
+  lessNodes,
+  lessStart,
+  lessEnd,
+  compare
+) => {
+  const length = lessEnd - lessStart;
+  /* istanbul ignore if */
+  if (length < 1)
+    return -1;
+  while ((moreEnd - moreStart) >= length) {
+    let m = moreStart;
+    let l = lessStart;
+    while (
+      m < moreEnd &&
+      l < lessEnd &&
+      compare(moreNodes[m], lessNodes[l])
+    ) {
+      m++;
+      l++;
+    }
+    if (l === lessEnd)
+      return moreStart;
+    moreStart = m + 1;
+  }
+  return -1;
+};
+exports.indexOf = indexOf;
+
+const isReversed = (
+  futureNodes,
+  futureEnd,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  compare
+) => {
+  while (
+    currentStart < currentEnd &&
+    compare(
+      currentNodes[currentStart],
+      futureNodes[futureEnd - 1]
+    )) {
+      currentStart++;
+      futureEnd--;
+    };
+  return futureEnd === 0;
+};
+exports.isReversed = isReversed;
+
+const next = (get, list, i, length, before) => i < length ?
+              get(list[i], 0) :
+              (0 < i ?
+                get(list[i - 1], -0).nextSibling :
+                before);
+exports.next = next;
+
+const remove = (get, parent, children, start, end) => {
+  if ((end - start) < 2)
+    parent.removeChild(get(children[start], -1));
+  else {
+    const range = parent.ownerDocument.createRange();
+    range.setStartBefore(get(children[start], -1));
+    range.setEndAfter(get(children[end - 1], -1));
+    range.deleteContents();
+  }
+};
+exports.remove = remove;
+
+// - - - - - - - - - - - - - - - - - - -
+// diff related constants and utilities
+// - - - - - - - - - - - - - - - - - - -
+
+const DELETION = -1;
+const INSERTION = 1;
+const SKIP = 0;
+const SKIP_OND = 50;
+
+const HS = (
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges
+) => {
+
+  let k = 0;
+  /* istanbul ignore next */
+  let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+  const link = Array(minLen++);
+  const tresh = Array(minLen);
+  tresh[0] = -1;
+
+  for (let i = 1; i < minLen; i++)
+    tresh[i] = currentEnd;
+
+  const keymap = new Map;
+  for (let i = currentStart; i < currentEnd; i++)
+    keymap.set(currentNodes[i], i);
+
+  for (let i = futureStart; i < futureEnd; i++) {
+    const idxInOld = keymap.get(futureNodes[i]);
+    if (idxInOld != null) {
+      k = findK(tresh, minLen, idxInOld);
+      /* istanbul ignore else */
+      if (-1 < k) {
+        tresh[k] = idxInOld;
+        link[k] = {
+          newi: i,
+          oldi: idxInOld,
+          prev: link[k - 1]
+        };
+      }
+    }
+  }
+
+  k = --minLen;
+  --currentEnd;
+  while (tresh[k] > currentEnd) --k;
+
+  minLen = currentChanges + futureChanges - k;
+  const diff = Array(minLen);
+  let ptr = link[k];
+  --futureEnd;
+  while (ptr) {
+    const {newi, oldi} = ptr;
+    while (futureEnd > newi) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+    while (currentEnd > oldi) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+    diff[--minLen] = SKIP;
+    --futureEnd;
+    --currentEnd;
+    ptr = ptr.prev;
+  }
+  while (futureEnd >= futureStart) {
+    diff[--minLen] = INSERTION;
+    --futureEnd;
+  }
+  while (currentEnd >= currentStart) {
+    diff[--minLen] = DELETION;
+    --currentEnd;
+  }
+  return diff;
+};
+
+// this is pretty much the same petit-dom code without the delete map part
+// https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+const OND = (
+  futureNodes,
+  futureStart,
+  rows,
+  currentNodes,
+  currentStart,
+  cols,
+  compare
+) => {
+  const length = rows + cols;
+  const v = [];
+  let d, k, r, c, pv, cv, pd;
+  outer: for (d = 0; d <= length; d++) {
+    /* istanbul ignore if */
+    if (d > SKIP_OND)
+      return null;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    cv = v[d] = [];
+    for (k = -d; k <= d; k += 2) {
+      if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+        c = pv[pd + k + 1];
+      } else {
+        c = pv[pd + k - 1] + 1;
+      }
+      r = c - k;
+      while (
+        c < cols &&
+        r < rows &&
+        compare(
+          currentNodes[currentStart + c],
+          futureNodes[futureStart + r]
+        )
+      ) {
+        c++;
+        r++;
+      }
+      if (c === cols && r === rows) {
+        break outer;
+      }
+      cv[d + k] = c;
+    }
+  }
+
+  const diff = Array(d / 2 + length / 2);
+  let diffIdx = diff.length - 1;
+  for (d = v.length - 1; d >= 0; d--) {
+    while (
+      c > 0 &&
+      r > 0 &&
+      compare(
+        currentNodes[currentStart + c - 1],
+        futureNodes[futureStart + r - 1]
+      )
+    ) {
+      // diagonal edge = equality
+      diff[diffIdx--] = SKIP;
+      c--;
+      r--;
+    }
+    if (!d)
+      break;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    k = c - r;
+    if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+      // vertical edge = insertion
+      r--;
+      diff[diffIdx--] = INSERTION;
+    } else {
+      // horizontal edge = deletion
+      c--;
+      diff[diffIdx--] = DELETION;
+    }
+  }
+  return diff;
+};
+
+const applyDiff = (
+  diff,
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  currentNodes,
+  currentStart,
+  currentLength,
+  before
+) => {
+  const live = new Map;
+  const length = diff.length;
+  let currentIndex = currentStart;
+  let i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        futureStart++;
+        currentIndex++;
+        break;
+      case INSERTION:
+        // TODO: bulk appends for sequential nodes
+        live.set(futureNodes[futureStart], 1);
+        append(
+          get,
+          parentNode,
+          futureNodes,
+          futureStart++,
+          futureStart,
+          currentIndex < currentLength ?
+            get(currentNodes[currentIndex], 0) :
+            before
+        );
+        break;
+      case DELETION:
+        currentIndex++;
+        break;
+    }
+  }
+  i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        currentStart++;
+        break;
+      case DELETION:
+        // TODO: bulk removes for sequential nodes
+        if (live.has(currentNodes[currentStart]))
+          currentStart++;
+        else
+          remove(
+            get,
+            parentNode,
+            currentNodes,
+            currentStart++,
+            currentStart
+          );
+        break;
+    }
+  }
+};
+
+const findK = (ktr, length, j) => {
+  let lo = 1;
+  let hi = length;
+  while (lo < hi) {
+    const mid = ((lo + hi) / 2) >>> 0;
+    if (j < ktr[mid])
+      hi = mid;
+    else
+      lo = mid + 1;
+  }
+  return lo;
+}
+
+const smartDiff = (
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges,
+  currentLength,
+  compare,
+  before
+) => {
+  applyDiff(
+    OND(
+      futureNodes,
+      futureStart,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentChanges,
+      compare
+    ) ||
+    HS(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      currentChanges
+    ),
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    currentNodes,
+    currentStart,
+    currentLength,
+    before
+  );
+};
+exports.smartDiff = smartDiff;
diff --git a/node_modules/domdiff/esm/index.js b/node_modules/domdiff/esm/index.js
new file mode 100644
index 0000000..28e7719
--- /dev/null
+++ b/node_modules/domdiff/esm/index.js
@@ -0,0 +1,223 @@
+/*! (c) 2018 Andrea Giammarchi (ISC) */
+
+import {
+  eqeq, identity, indexOf, isReversed, next,
+  append, remove,
+  smartDiff
+} from './utils.js';
+
+const domdiff = (
+  parentNode,     // where changes happen
+  currentNodes,   // Array of current items/nodes
+  futureNodes,    // Array of future items/nodes
+  options         // optional object with one of the following properties
+                  //  before: domNode
+                  //  compare(generic, generic) => true if same generic
+                  //  node(generic) => Node
+) => {
+  if (!options)
+    options = {};
+
+  const compare = options.compare || eqeq;
+  const get = options.node || identity;
+  const before = options.before == null ? null : get(options.before, 0);
+
+  const currentLength = currentNodes.length;
+  let currentEnd = currentLength;
+  let currentStart = 0;
+
+  let futureEnd = futureNodes.length;
+  let futureStart = 0;
+
+  // common prefix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentStart], futureNodes[futureStart])
+  ) {
+    currentStart++;
+    futureStart++;
+  }
+
+  // common suffix
+  while (
+    currentStart < currentEnd &&
+    futureStart < futureEnd &&
+    compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])
+  ) {
+    currentEnd--;
+    futureEnd--;
+  }
+
+  const currentSame = currentStart === currentEnd;
+  const futureSame = futureStart === futureEnd;
+
+  // same list
+  if (currentSame && futureSame)
+    return futureNodes;
+
+  // only stuff to add
+  if (currentSame && futureStart < futureEnd) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentStart, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // only stuff to remove
+  if (futureSame && currentStart < currentEnd) {
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  const currentChanges = currentEnd - currentStart;
+  const futureChanges = futureEnd - futureStart;
+  let i = -1;
+
+  // 2 simple indels: the shortest sequence is a subsequence of the longest
+  if (currentChanges < futureChanges) {
+    i = indexOf(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    );
+    // inner diff
+    if (-1 < i) {
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        futureStart,
+        i,
+        get(currentNodes[currentStart], 0)
+      );
+      append(
+        get,
+        parentNode,
+        futureNodes,
+        i + currentChanges,
+        futureEnd,
+        next(get, currentNodes, currentEnd, currentLength, before)
+      );
+      return futureNodes;
+    }
+  }
+  /* istanbul ignore else */
+  else if (futureChanges < currentChanges) {
+    i = indexOf(
+      currentNodes,
+      currentStart,
+      currentEnd,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      compare
+    );
+    // outer diff
+    if (-1 < i) {
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        currentStart,
+        i
+      );
+      remove(
+        get,
+        parentNode,
+        currentNodes,
+        i + futureChanges,
+        currentEnd
+      );
+      return futureNodes;
+    }
+  }
+
+  // common case with one replacement for many nodes
+  // or many nodes replaced for a single one
+  /* istanbul ignore else */
+  if ((currentChanges < 2 || futureChanges < 2)) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      get(currentNodes[currentStart], 0)
+    );
+    remove(
+      get,
+      parentNode,
+      currentNodes,
+      currentStart,
+      currentEnd
+    );
+    return futureNodes;
+  }
+
+  // the half match diff part has been skipped in petit-dom
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+  // accordingly, I think it's safe to skip in here too
+  // if one day it'll come out like the speediest thing ever to do
+  // then I might add it in here too
+
+  // Extra: before going too fancy, what about reversed lists ?
+  //        This should bail out pretty quickly if that's not the case.
+  if (
+    currentChanges === futureChanges &&
+    isReversed(
+      futureNodes,
+      futureEnd,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      compare
+    )
+  ) {
+    append(
+      get,
+      parentNode,
+      futureNodes,
+      futureStart,
+      futureEnd,
+      next(get, currentNodes, currentEnd, currentLength, before)
+    );
+    return futureNodes;
+  }
+
+  // last resort through a smart diff
+  smartDiff(
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    futureEnd,
+    futureChanges,
+    currentNodes,
+    currentStart,
+    currentEnd,
+    currentChanges,
+    currentLength,
+    compare,
+    before
+  );
+
+  return futureNodes;
+};
+
+export default domdiff;
diff --git a/node_modules/domdiff/esm/utils.js b/node_modules/domdiff/esm/utils.js
new file mode 100644
index 0000000..39b516c
--- /dev/null
+++ b/node_modules/domdiff/esm/utils.js
@@ -0,0 +1,379 @@
+import Map from '@ungap/essential-map';
+
+const {indexOf: iOF} = [];
+export const append = (get, parent, children, start, end, before) => {
+  const isSelect = 'selectedIndex' in parent;
+  let noSelection = isSelect;
+  while (start < end) {
+    const child = get(children[start], 1);
+    parent.insertBefore(child, before);
+    if (isSelect && noSelection && child.selected) {
+      noSelection = !noSelection;
+      let {selectedIndex} = parent;
+      parent.selectedIndex = selectedIndex < 0 ?
+        start :
+        iOF.call(parent.querySelectorAll('option'), child);
+    }
+    start++;
+  }
+};
+
+export const eqeq = (a, b) => a == b;
+
+export const identity = O => O;
+
+export const indexOf = (
+  moreNodes,
+  moreStart,
+  moreEnd,
+  lessNodes,
+  lessStart,
+  lessEnd,
+  compare
+) => {
+  const length = lessEnd - lessStart;
+  /* istanbul ignore if */
+  if (length < 1)
+    return -1;
+  while ((moreEnd - moreStart) >= length) {
+    let m = moreStart;
+    let l = lessStart;
+    while (
+      m < moreEnd &&
+      l < lessEnd &&
+      compare(moreNodes[m], lessNodes[l])
+    ) {
+      m++;
+      l++;
+    }
+    if (l === lessEnd)
+      return moreStart;
+    moreStart = m + 1;
+  }
+  return -1;
+};
+
+export const isReversed = (
+  futureNodes,
+  futureEnd,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  compare
+) => {
+  while (
+    currentStart < currentEnd &&
+    compare(
+      currentNodes[currentStart],
+      futureNodes[futureEnd - 1]
+    )) {
+      currentStart++;
+      futureEnd--;
+    };
+  return futureEnd === 0;
+};
+
+export const next = (get, list, i, length, before) => i < length ?
+              get(list[i], 0) :
+              (0 < i ?
+                get(list[i - 1], -0).nextSibling :
+                before);
+
+export const remove = (get, parent, children, start, end) => {
+  if ((end - start) < 2)
+    parent.removeChild(get(children[start], -1));
+  else {
+    const range = parent.ownerDocument.createRange();
+    range.setStartBefore(get(children[start], -1));
+    range.setEndAfter(get(children[end - 1], -1));
+    range.deleteContents();
+  }
+};
+
+// - - - - - - - - - - - - - - - - - - -
+// diff related constants and utilities
+// - - - - - - - - - - - - - - - - - - -
+
+const DELETION = -1;
+const INSERTION = 1;
+const SKIP = 0;
+const SKIP_OND = 50;
+
+const HS = (
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges
+) => {
+
+  let k = 0;
+  /* istanbul ignore next */
+  let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+  const link = Array(minLen++);
+  const tresh = Array(minLen);
+  tresh[0] = -1;
+
+  for (let i = 1; i < minLen; i++)
+    tresh[i] = currentEnd;
+
+  const keymap = new Map;
+  for (let i = currentStart; i < currentEnd; i++)
+    keymap.set(currentNodes[i], i);
+
+  for (let i = futureStart; i < futureEnd; i++) {
+    const idxInOld = keymap.get(futureNodes[i]);
+    if (idxInOld != null) {
+      k = findK(tresh, minLen, idxInOld);
+      /* istanbul ignore else */
+      if (-1 < k) {
+        tresh[k] = idxInOld;
+        link[k] = {
+          newi: i,
+          oldi: idxInOld,
+          prev: link[k - 1]
+        };
+      }
+    }
+  }
+
+  k = --minLen;
+  --currentEnd;
+  while (tresh[k] > currentEnd) --k;
+
+  minLen = currentChanges + futureChanges - k;
+  const diff = Array(minLen);
+  let ptr = link[k];
+  --futureEnd;
+  while (ptr) {
+    const {newi, oldi} = ptr;
+    while (futureEnd > newi) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+    while (currentEnd > oldi) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+    diff[--minLen] = SKIP;
+    --futureEnd;
+    --currentEnd;
+    ptr = ptr.prev;
+  }
+  while (futureEnd >= futureStart) {
+    diff[--minLen] = INSERTION;
+    --futureEnd;
+  }
+  while (currentEnd >= currentStart) {
+    diff[--minLen] = DELETION;
+    --currentEnd;
+  }
+  return diff;
+};
+
+// this is pretty much the same petit-dom code without the delete map part
+// https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+const OND = (
+  futureNodes,
+  futureStart,
+  rows,
+  currentNodes,
+  currentStart,
+  cols,
+  compare
+) => {
+  const length = rows + cols;
+  const v = [];
+  let d, k, r, c, pv, cv, pd;
+  outer: for (d = 0; d <= length; d++) {
+    /* istanbul ignore if */
+    if (d > SKIP_OND)
+      return null;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    cv = v[d] = [];
+    for (k = -d; k <= d; k += 2) {
+      if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+        c = pv[pd + k + 1];
+      } else {
+        c = pv[pd + k - 1] + 1;
+      }
+      r = c - k;
+      while (
+        c < cols &&
+        r < rows &&
+        compare(
+          currentNodes[currentStart + c],
+          futureNodes[futureStart + r]
+        )
+      ) {
+        c++;
+        r++;
+      }
+      if (c === cols && r === rows) {
+        break outer;
+      }
+      cv[d + k] = c;
+    }
+  }
+
+  const diff = Array(d / 2 + length / 2);
+  let diffIdx = diff.length - 1;
+  for (d = v.length - 1; d >= 0; d--) {
+    while (
+      c > 0 &&
+      r > 0 &&
+      compare(
+        currentNodes[currentStart + c - 1],
+        futureNodes[futureStart + r - 1]
+      )
+    ) {
+      // diagonal edge = equality
+      diff[diffIdx--] = SKIP;
+      c--;
+      r--;
+    }
+    if (!d)
+      break;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    k = c - r;
+    if (k === -d || (k !== d && pv[pd + k - 1] < pv[pd + k + 1])) {
+      // vertical edge = insertion
+      r--;
+      diff[diffIdx--] = INSERTION;
+    } else {
+      // horizontal edge = deletion
+      c--;
+      diff[diffIdx--] = DELETION;
+    }
+  }
+  return diff;
+};
+
+const applyDiff = (
+  diff,
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  currentNodes,
+  currentStart,
+  currentLength,
+  before
+) => {
+  const live = new Map;
+  const length = diff.length;
+  let currentIndex = currentStart;
+  let i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        futureStart++;
+        currentIndex++;
+        break;
+      case INSERTION:
+        // TODO: bulk appends for sequential nodes
+        live.set(futureNodes[futureStart], 1);
+        append(
+          get,
+          parentNode,
+          futureNodes,
+          futureStart++,
+          futureStart,
+          currentIndex < currentLength ?
+            get(currentNodes[currentIndex], 0) :
+            before
+        );
+        break;
+      case DELETION:
+        currentIndex++;
+        break;
+    }
+  }
+  i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        currentStart++;
+        break;
+      case DELETION:
+        // TODO: bulk removes for sequential nodes
+        if (live.has(currentNodes[currentStart]))
+          currentStart++;
+        else
+          remove(
+            get,
+            parentNode,
+            currentNodes,
+            currentStart++,
+            currentStart
+          );
+        break;
+    }
+  }
+};
+
+const findK = (ktr, length, j) => {
+  let lo = 1;
+  let hi = length;
+  while (lo < hi) {
+    const mid = ((lo + hi) / 2) >>> 0;
+    if (j < ktr[mid])
+      hi = mid;
+    else
+      lo = mid + 1;
+  }
+  return lo;
+}
+
+export const smartDiff = (
+  get,
+  parentNode,
+  futureNodes,
+  futureStart,
+  futureEnd,
+  futureChanges,
+  currentNodes,
+  currentStart,
+  currentEnd,
+  currentChanges,
+  currentLength,
+  compare,
+  before
+) => {
+  applyDiff(
+    OND(
+      futureNodes,
+      futureStart,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentChanges,
+      compare
+    ) ||
+    HS(
+      futureNodes,
+      futureStart,
+      futureEnd,
+      futureChanges,
+      currentNodes,
+      currentStart,
+      currentEnd,
+      currentChanges
+    ),
+    get,
+    parentNode,
+    futureNodes,
+    futureStart,
+    currentNodes,
+    currentStart,
+    currentLength,
+    before
+  );
+};
diff --git a/node_modules/domdiff/index.js b/node_modules/domdiff/index.js
new file mode 100644
index 0000000..8b0b0e3
--- /dev/null
+++ b/node_modules/domdiff/index.js
@@ -0,0 +1,409 @@
+var domdiff = (function () {
+'use strict';
+
+/*! (c) Andrea Giammarchi - ISC */
+var self = null || /* istanbul ignore next */{};
+try {
+  self.Map = Map;
+} catch (Map) {
+  self.Map = function Map() {
+    var i = 0;
+    var k = [];
+    var v = [];
+    return {
+      delete: function _delete(key) {
+        var had = contains(key);
+        if (had) {
+          k.splice(i, 1);
+          v.splice(i, 1);
+        }
+        return had;
+      },
+      forEach: function forEach(callback, context) {
+        k.forEach(function (key, i) {
+          callback.call(context, v[i], key, this);
+        }, this);
+      },
+      get: function get(key) {
+        return contains(key) ? v[i] : void 0;
+      },
+      has: function has(key) {
+        return contains(key);
+      },
+      set: function set(key, value) {
+        v[contains(key) ? i : k.push(key) - 1] = value;
+        return this;
+      }
+    };
+    function contains(v) {
+      i = k.indexOf(v);
+      return -1 < i;
+    }
+  };
+}
+var Map$1 = self.Map;
+
+var iOF = [].indexOf;
+
+var append = function append(get, parent, children, start, end, before) {
+  var isSelect = 'selectedIndex' in parent;
+  var noSelection = isSelect;
+  while (start < end) {
+    var child = get(children[start], 1);
+    parent.insertBefore(child, before);
+    if (isSelect && noSelection && child.selected) {
+      noSelection = !noSelection;
+      var selectedIndex = parent.selectedIndex;
+
+      parent.selectedIndex = selectedIndex < 0 ? start : iOF.call(parent.querySelectorAll('option'), child);
+    }
+    start++;
+  }
+};
+
+var eqeq = function eqeq(a, b) {
+  return a == b;
+};
+
+var identity = function identity(O) {
+  return O;
+};
+
+var indexOf = function indexOf(moreNodes, moreStart, moreEnd, lessNodes, lessStart, lessEnd, compare) {
+  var length = lessEnd - lessStart;
+  /* istanbul ignore if */
+  if (length < 1) return -1;
+  while (moreEnd - moreStart >= length) {
+    var m = moreStart;
+    var l = lessStart;
+    while (m < moreEnd && l < lessEnd && compare(moreNodes[m], lessNodes[l])) {
+      m++;
+      l++;
+    }
+    if (l === lessEnd) return moreStart;
+    moreStart = m + 1;
+  }
+  return -1;
+};
+
+var isReversed = function isReversed(futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare) {
+  while (currentStart < currentEnd && compare(currentNodes[currentStart], futureNodes[futureEnd - 1])) {
+    currentStart++;
+    futureEnd--;
+  }
+  return futureEnd === 0;
+};
+
+var next = function next(get, list, i, length, before) {
+  return i < length ? get(list[i], 0) : 0 < i ? get(list[i - 1], -0).nextSibling : before;
+};
+
+var remove = function remove(get, parent, children, start, end) {
+  if (end - start < 2) parent.removeChild(get(children[start], -1));else {
+    var range = parent.ownerDocument.createRange();
+    range.setStartBefore(get(children[start], -1));
+    range.setEndAfter(get(children[end - 1], -1));
+    range.deleteContents();
+  }
+};
+
+// - - - - - - - - - - - - - - - - - - -
+// diff related constants and utilities
+// - - - - - - - - - - - - - - - - - - -
+
+var DELETION = -1;
+var INSERTION = 1;
+var SKIP = 0;
+var SKIP_OND = 50;
+
+var HS = function HS(futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges) {
+
+  var k = 0;
+  /* istanbul ignore next */
+  var minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+  var link = Array(minLen++);
+  var tresh = Array(minLen);
+  tresh[0] = -1;
+
+  for (var i = 1; i < minLen; i++) {
+    tresh[i] = currentEnd;
+  }var keymap = new Map$1();
+  for (var _i = currentStart; _i < currentEnd; _i++) {
+    keymap.set(currentNodes[_i], _i);
+  }for (var _i2 = futureStart; _i2 < futureEnd; _i2++) {
+    var idxInOld = keymap.get(futureNodes[_i2]);
+    if (idxInOld != null) {
+      k = findK(tresh, minLen, idxInOld);
+      /* istanbul ignore else */
+      if (-1 < k) {
+        tresh[k] = idxInOld;
+        link[k] = {
+          newi: _i2,
+          oldi: idxInOld,
+          prev: link[k - 1]
+        };
+      }
+    }
+  }
+
+  k = --minLen;
+  --currentEnd;
+  while (tresh[k] > currentEnd) {
+    --k;
+  }minLen = currentChanges + futureChanges - k;
+  var diff = Array(minLen);
+  var ptr = link[k];
+  --futureEnd;
+  while (ptr) {
+    var _ptr = ptr,
+        newi = _ptr.newi,
+        oldi = _ptr.oldi;
+
+    while (futureEnd > newi) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+    while (currentEnd > oldi) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+    diff[--minLen] = SKIP;
+    --futureEnd;
+    --currentEnd;
+    ptr = ptr.prev;
+  }
+  while (futureEnd >= futureStart) {
+    diff[--minLen] = INSERTION;
+    --futureEnd;
+  }
+  while (currentEnd >= currentStart) {
+    diff[--minLen] = DELETION;
+    --currentEnd;
+  }
+  return diff;
+};
+
+// this is pretty much the same petit-dom code without the delete map part
+// https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+var OND = function OND(futureNodes, futureStart, rows, currentNodes, currentStart, cols, compare) {
+  var length = rows + cols;
+  var v = [];
+  var d = void 0,
+      k = void 0,
+      r = void 0,
+      c = void 0,
+      pv = void 0,
+      cv = void 0,
+      pd = void 0;
+  outer: for (d = 0; d <= length; d++) {
+    /* istanbul ignore if */
+    if (d > SKIP_OND) return null;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    cv = v[d] = [];
+    for (k = -d; k <= d; k += 2) {
+      if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+        c = pv[pd + k + 1];
+      } else {
+        c = pv[pd + k - 1] + 1;
+      }
+      r = c - k;
+      while (c < cols && r < rows && compare(currentNodes[currentStart + c], futureNodes[futureStart + r])) {
+        c++;
+        r++;
+      }
+      if (c === cols && r === rows) {
+        break outer;
+      }
+      cv[d + k] = c;
+    }
+  }
+
+  var diff = Array(d / 2 + length / 2);
+  var diffIdx = diff.length - 1;
+  for (d = v.length - 1; d >= 0; d--) {
+    while (c > 0 && r > 0 && compare(currentNodes[currentStart + c - 1], futureNodes[futureStart + r - 1])) {
+      // diagonal edge = equality
+      diff[diffIdx--] = SKIP;
+      c--;
+      r--;
+    }
+    if (!d) break;
+    pd = d - 1;
+    /* istanbul ignore next */
+    pv = d ? v[d - 1] : [0, 0];
+    k = c - r;
+    if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+      // vertical edge = insertion
+      r--;
+      diff[diffIdx--] = INSERTION;
+    } else {
+      // horizontal edge = deletion
+      c--;
+      diff[diffIdx--] = DELETION;
+    }
+  }
+  return diff;
+};
+
+var applyDiff = function applyDiff(diff, get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before) {
+  var live = new Map$1();
+  var length = diff.length;
+  var currentIndex = currentStart;
+  var i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        futureStart++;
+        currentIndex++;
+        break;
+      case INSERTION:
+        // TODO: bulk appends for sequential nodes
+        live.set(futureNodes[futureStart], 1);
+        append(get, parentNode, futureNodes, futureStart++, futureStart, currentIndex < currentLength ? get(currentNodes[currentIndex], 0) : before);
+        break;
+      case DELETION:
+        currentIndex++;
+        break;
+    }
+  }
+  i = 0;
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        currentStart++;
+        break;
+      case DELETION:
+        // TODO: bulk removes for sequential nodes
+        if (live.has(currentNodes[currentStart])) currentStart++;else remove(get, parentNode, currentNodes, currentStart++, currentStart);
+        break;
+    }
+  }
+};
+
+var findK = function findK(ktr, length, j) {
+  var lo = 1;
+  var hi = length;
+  while (lo < hi) {
+    var mid = (lo + hi) / 2 >>> 0;
+    if (j < ktr[mid]) hi = mid;else lo = mid + 1;
+  }
+  return lo;
+};
+
+var smartDiff = function smartDiff(get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before) {
+  applyDiff(OND(futureNodes, futureStart, futureChanges, currentNodes, currentStart, currentChanges, compare) || HS(futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges), get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before);
+};
+
+/*! (c) 2018 Andrea Giammarchi (ISC) */
+
+var domdiff = function domdiff(parentNode, // where changes happen
+currentNodes, // Array of current items/nodes
+futureNodes, // Array of future items/nodes
+options // optional object with one of the following properties
+//  before: domNode
+//  compare(generic, generic) => true if same generic
+//  node(generic) => Node
+) {
+  if (!options) options = {};
+
+  var compare = options.compare || eqeq;
+  var get = options.node || identity;
+  var before = options.before == null ? null : get(options.before, 0);
+
+  var currentLength = currentNodes.length;
+  var currentEnd = currentLength;
+  var currentStart = 0;
+
+  var futureEnd = futureNodes.length;
+  var futureStart = 0;
+
+  // common prefix
+  while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentStart], futureNodes[futureStart])) {
+    currentStart++;
+    futureStart++;
+  }
+
+  // common suffix
+  while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])) {
+    currentEnd--;
+    futureEnd--;
+  }
+
+  var currentSame = currentStart === currentEnd;
+  var futureSame = futureStart === futureEnd;
+
+  // same list
+  if (currentSame && futureSame) return futureNodes;
+
+  // only stuff to add
+  if (currentSame && futureStart < futureEnd) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentStart, currentLength, before));
+    return futureNodes;
+  }
+
+  // only stuff to remove
+  if (futureSame && currentStart < currentEnd) {
+    remove(get, parentNode, currentNodes, currentStart, currentEnd);
+    return futureNodes;
+  }
+
+  var currentChanges = currentEnd - currentStart;
+  var futureChanges = futureEnd - futureStart;
+  var i = -1;
+
+  // 2 simple indels: the shortest sequence is a subsequence of the longest
+  if (currentChanges < futureChanges) {
+    i = indexOf(futureNodes, futureStart, futureEnd, currentNodes, currentStart, currentEnd, compare);
+    // inner diff
+    if (-1 < i) {
+      append(get, parentNode, futureNodes, futureStart, i, get(currentNodes[currentStart], 0));
+      append(get, parentNode, futureNodes, i + currentChanges, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+      return futureNodes;
+    }
+  }
+  /* istanbul ignore else */
+  else if (futureChanges < currentChanges) {
+      i = indexOf(currentNodes, currentStart, currentEnd, futureNodes, futureStart, futureEnd, compare);
+      // outer diff
+      if (-1 < i) {
+        remove(get, parentNode, currentNodes, currentStart, i);
+        remove(get, parentNode, currentNodes, i + futureChanges, currentEnd);
+        return futureNodes;
+      }
+    }
+
+  // common case with one replacement for many nodes
+  // or many nodes replaced for a single one
+  /* istanbul ignore else */
+  if (currentChanges < 2 || futureChanges < 2) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, get(currentNodes[currentStart], 0));
+    remove(get, parentNode, currentNodes, currentStart, currentEnd);
+    return futureNodes;
+  }
+
+  // the half match diff part has been skipped in petit-dom
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+  // accordingly, I think it's safe to skip in here too
+  // if one day it'll come out like the speediest thing ever to do
+  // then I might add it in here too
+
+  // Extra: before going too fancy, what about reversed lists ?
+  //        This should bail out pretty quickly if that's not the case.
+  if (currentChanges === futureChanges && isReversed(futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare)) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+    return futureNodes;
+  }
+
+  // last resort through a smart diff
+  smartDiff(get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before);
+
+  return futureNodes;
+};
+
+
+
+return domdiff;
+
+}());
diff --git a/node_modules/domdiff/min.js b/node_modules/domdiff/min.js
new file mode 100644
index 0000000..eb877b8
--- /dev/null
+++ b/node_modules/domdiff/min.js
@@ -0,0 +1,2 @@
+var domdiff=function(){"use strict";/*! (c) Andrea Giammarchi - ISC */
+var r={};try{r.Map=Map}catch(Map){r.Map=function(){function r(r){return-1<(e=n.indexOf(r))}var e=0,n=[],t=[];return{"delete":function(o){var f=r(o);return f&&(n.splice(e,1),t.splice(e,1)),f},forEach:function(r,e){n.forEach(function(n,o){r.call(e,t[o],n,this)},this)},get:function(n){return r(n)?t[e]:void 0},has:function(e){return r(e)},set:function(o,f){return t[r(o)?e:n.push(o)-1]=f,this}}}}var e=r.Map,n=[].indexOf,t=function(r,e,t,o,f,i){for(var a=("selectedIndex"in e),u=a;o<f;){var c=r(t[o],1);if(e.insertBefore(c,i),a&&u&&c.selected){u=!u;var v=e.selectedIndex;e.selectedIndex=v<0?o:n.call(e.querySelectorAll("option"),c)}o++}},o=function(r,e){return r==e},f=function(r){return r},i=function(r,e,n,t,o,f,i){var a=f-o;if(a<1)return-1;for(;n-e>=a;){for(var u=e,c=o;u<n&&c<f&&i(r[u],t[c]);)u++,c++;if(c===f)return e;e=u+1}return-1},a=function(r,e,n,t,o,f){for(;t<o&&f(n[t],r[e-1]);)t++,e--;return 0===e},u=function(r,e,n,t,o){return n<t?r(e[n],0):0<n?r(e[n-1],-0).nextSibling:o},c=function(r,e,n,t,o){if(o-t<2)e.removeChild(r(n[t],-1));else{var f=e.ownerDocument.createRange();f.setStartBefore(r(n[t],-1)),f.setEndAfter(r(n[o-1],-1)),f.deleteContents()}},v=function(r,n,t,o,f,i,a,u){var c=0,v=o<u?o:u,l=Array(v++),s=Array(v);s[0]=-1;for(var h=1;h<v;h++)s[h]=a;for(var p=new e,g=i;g<a;g++)p.set(f[g],g);for(var b=n;b<t;b++){var w=p.get(r[b]);null!=w&&-1<(c=d(s,v,w))&&(s[c]=w,l[c]={newi:b,oldi:w,prev:l[c-1]})}for(c=--v,--a;s[c]>a;)--c;v=u+o-c;var x=Array(v),y=l[c];for(--t;y;){for(var A=y,k=A.newi,M=A.oldi;t>k;)x[--v]=1,--t;for(;a>M;)x[--v]=-1,--a;x[--v]=0,--t,--a,y=y.prev}for(;t>=n;)x[--v]=1,--t;for(;a>=i;)x[--v]=-1,--a;return x},l=function(r,e,n,t,o,f,i){var a=n+f,u=[],c=void 0,v=void 0,l=void 0,s=void 0,d=void 0,h=void 0,p=void 0;r:for(c=0;c<=a;c++){if(c>50)return null;for(p=c-1,d=c?u[c-1]:[0,0],h=u[c]=[],v=-c;v<=c;v+=2){for(s=v===-c||v!==c&&d[p+v-1]<d[p+v+1]?d[p+v+1]:d[p+v-1]+1,l=s-v;s<f&&l<n&&i(t[o+s],r[e+l]);)s++,l++;if(s===f&&l===n)break r;h[c+v]=s}}var g=Array(c/2+a/2),b=g.length-1;for(c=u.length-1;c>=0;c--){for(;s>0&&l>0&&i(t[o+s-1],r[e+l-1]);)g[b--]=0,s--,l--;if(!c)break;p=c-1,d=c?u[c-1]:[0,0],v=s-l,v===-c||v!==c&&d[p+v-1]<d[p+v+1]?(l--,g[b--]=1):(s--,g[b--]=-1)}return g},s=function(r,n,o,f,i,a,u,v,l){for(var s=new e,d=r.length,h=u,p=0;p<d;)switch(r[p++]){case 0:i++,h++;break;case 1:s.set(f[i],1),t(n,o,f,i++,i,h<v?n(a[h],0):l);break;case-1:h++}for(p=0;p<d;)switch(r[p++]){case 0:u++;break;case-1:s.has(a[u])?u++:c(n,o,a,u++,u)}},d=function(r,e,n){for(var t=1,o=e;t<o;){var f=(t+o)/2>>>0;n<r[f]?o=f:t=f+1}return t},h=function(r,e,n,t,o,f,i,a,u,c,d,h,p){s(l(n,t,f,i,a,c,h)||v(n,t,o,f,i,a,u,c),r,e,n,t,i,a,d,p)};return function(r,e,n,v){v||(v={});for(var l=v.compare||o,s=v.node||f,d=null==v.before?null:s(v.before,0),p=e.length,g=p,b=0,w=n.length,x=0;b<g&&x<w&&l(e[b],n[x]);)b++,x++;for(;b<g&&x<w&&l(e[g-1],n[w-1]);)g--,w--;var y=b===g,A=x===w;if(y&&A)return n;if(y&&x<w)return t(s,r,n,x,w,u(s,e,b,p,d)),n;if(A&&b<g)return c(s,r,e,b,g),n;var k=g-b,M=w-x,m=-1;if(k<M){if(-1<(m=i(n,x,w,e,b,g,l)))return t(s,r,n,x,m,s(e[b],0)),t(s,r,n,m+k,w,u(s,e,g,p,d)),n}else if(M<k&&-1<(m=i(e,b,g,n,x,w,l)))return c(s,r,e,b,m),c(s,r,e,m+M,g),n;return k<2||M<2?(t(s,r,n,x,w,s(e[b],0)),c(s,r,e,b,g),n):k===M&&a(n,w,e,b,g,l)?(t(s,r,n,x,w,u(s,e,g,p,d)),n):(h(s,r,n,x,w,M,e,b,g,k,p,l,d),n)}}();
\ No newline at end of file
diff --git a/node_modules/domdiff/package.json b/node_modules/domdiff/package.json
new file mode 100644
index 0000000..562f9f1
--- /dev/null
+++ b/node_modules/domdiff/package.json
@@ -0,0 +1,90 @@
+{
+  "_from": "domdiff@^2.0.7",
+  "_id": "domdiff@2.0.7",
+  "_inBundle": false,
+  "_integrity": "sha512-tkfFrF0aas8ECV1l3gQ8GOEaFIrK5z4MoR2c0XXY6dGSyrBvsoUoG7t0Gk3c4tbowkhMYpMe0gay4D7Ao31XCw==",
+  "_location": "/domdiff",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "domdiff@^2.0.7",
+    "name": "domdiff",
+    "escapedName": "domdiff",
+    "rawSpec": "^2.0.7",
+    "saveSpec": null,
+    "fetchSpec": "^2.0.7"
+  },
+  "_requiredBy": [
+    "/@riotjs/dom-bindings"
+  ],
+  "_resolved": "https://registry.npmjs.org/domdiff/-/domdiff-2.0.7.tgz",
+  "_shasum": "3ceca17746784964642bd0e78ca81156205d6351",
+  "_spec": "domdiff@^2.0.7",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/dom-bindings",
+  "author": {
+    "name": "Andrea Giammarchi"
+  },
+  "bugs": {
+    "url": "https://github.com/WebReflection/domdiff/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "@ungap/essential-map": "^0.2.0"
+  },
+  "deprecated": false,
+  "description": "A fast and simple way to diff childNodes",
+  "devDependencies": {
+    "ascjs": "^2.5.1",
+    "babel-cli": "^6.26.0",
+    "babel-plugin-check-es2015-constants": "^6.22.0",
+    "babel-plugin-transform-es2015-arrow-functions": "^6.22.0",
+    "babel-plugin-transform-es2015-block-scoped-functions": "^6.22.0",
+    "babel-plugin-transform-es2015-block-scoping": "^6.26.0",
+    "babel-plugin-transform-es2015-classes": "^6.24.1",
+    "babel-plugin-transform-es2015-computed-properties": "^6.24.1",
+    "babel-plugin-transform-es2015-destructuring": "^6.23.0",
+    "babel-plugin-transform-es2015-duplicate-keys": "^6.24.1",
+    "babel-plugin-transform-es2015-function-name": "^6.24.1",
+    "babel-plugin-transform-es2015-literals": "^6.22.0",
+    "babel-plugin-transform-es2015-shorthand-properties": "^6.24.1",
+    "babel-plugin-transform-es2015-spread": "^6.22.0",
+    "babel-plugin-transform-es2015-template-literals": "^6.22.0",
+    "coveralls": "^3.0.5",
+    "istanbul": "^0.4.5",
+    "rollup": "^0.52.3",
+    "rollup-plugin-babel": "^3.0.7",
+    "rollup-plugin-node-resolve": "^3.4.0",
+    "tressa": "^0.3.1",
+    "uglify-js": "^2.8.29"
+  },
+  "directories": {
+    "test": "test"
+  },
+  "homepage": "https://github.com/WebReflection/domdiff#readme",
+  "keywords": [
+    "dom",
+    "diff"
+  ],
+  "license": "ISC",
+  "main": "cjs/index.js",
+  "module": "esm/index.js",
+  "name": "domdiff",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/WebReflection/domdiff.git"
+  },
+  "scripts": {
+    "build": "npm run cjs && npm run bundle && npm run min && npm run test && npm run size",
+    "bundle": "rollup --config rollup.config.js && npm run cleanup",
+    "cjs": "ascjs ./esm ./cjs && sed -i.bck 's/(m => m.__esModule ? m.default : m)//' cjs/utils.js && rm cjs/utils.js.bck",
+    "cleanup": "echo \"$(cat index.js | sed 's/return exports;/return domdiff;/' | sed -e 's/exports.*;//g' | sed 's/exports//' | sed 's/}({}));/}());/')\" > index.js",
+    "coveralls": "cat ./coverage/lcov.info | coveralls",
+    "min": "uglifyjs index.js --support-ie8 --comments=/^!/ -cmo min.js",
+    "size": "echo \"gzip: $(cat min.js | gzip -c9 | wc -c)\" && echo \"brotli: $(cat min.js | brotli | wc -c)\" && echo ''",
+    "test": "istanbul cover test/node.js"
+  },
+  "types": "types.d.ts",
+  "unpkg": "min.js",
+  "version": "2.0.7"
+}
diff --git a/node_modules/domdiff/types.d.ts b/node_modules/domdiff/types.d.ts
new file mode 100644
index 0000000..2fb81df
--- /dev/null
+++ b/node_modules/domdiff/types.d.ts
@@ -0,0 +1,44 @@
+export interface IDomDiffNodeMarkerOptions<T = Node> {
+  /**
+   * A specific live node to use as boundary for all nodes operations.
+   * With live nodes [a,d] and {before: d}, the operation [] => [b, c]
+   * would place nodes right before d, resulting a live collection of [a, b, c, d].
+   * 
+   * `before` doesn't necessarily have to be a node
+   */
+  before: T;
+}
+
+export interface IDomDiffOptionsGenericComparisonFn {
+  /**
+   * A callback to compare between two generic objects, each could be a node or anything. returns `true` to indicate they are the same
+   */
+  compare: <T1 = any, T2 = any>(currentNode: T1, futureNode: T2) => boolean;
+}
+
+export interface IDomDiffOPtionsEachNodeCallbackFn {
+  /**
+   * The optional function is invoked per each operation on the list of current"Nodes".
+   * This can be useful to represent node through wrappers, whenever that is needed.
+   * @param info
+   * `1` when the item/node is being appended
+   * `0` when the item/node is being used as insert _before_ reference
+   * `-0` when the item/node is being used as insert _after_ reference
+   * `-1` when the item/node is being removed
+   */
+  node: <T = any>(generic: T, info: -1 | -0 | 0 | 1) => Node;
+}
+
+/**
+ * A vDOM-less implementation of the [petit-dom](https://github.com/yelouafi/petit-dom) diffing logic
+ * that will mutate child nodes the first argument - parentNode
+ * @param parentNode Where changes happen
+ * @param currentNodes Array of current items / nodes.
+ * @param futureNodes Array of future items / nodes
+ */
+export default function domdiff<TCurrentItems extends any[], TFutureItems extends any[]>(
+  parentNode: Node,
+  currentNodes: TCurrentItems,
+  futureNodes: TFutureItems,
+  options?: IDomDiffNodeMarkerOptions | IDomDiffOptionsGenericComparisonFn | IDomDiffOPtionsEachNodeCallbackFn
+): void;
diff --git a/node_modules/esprima/ChangeLog b/node_modules/esprima/ChangeLog
new file mode 100644
index 0000000..fafe1c9
--- /dev/null
+++ b/node_modules/esprima/ChangeLog
@@ -0,0 +1,235 @@
+2018-06-17: Version 4.0.1
+
+      *  Fix parsing async get/set in a class (issue 1861, 1875)
+      *  Account for different return statement argument (issue 1829, 1897, 1928)
+      *  Correct the handling of HTML comment when parsing a module (issue 1841)
+      *  Fix incorrect parse async with proto-identifier-shorthand (issue 1847)
+      *  Fix negative column in binary expression (issue 1844)
+      *  Fix incorrect YieldExpression  in object methods (issue 1834)
+      *  Various documentation fixes
+
+2017-06-10: Version 4.0.0
+
+      * Support ES2017 async function and await expression (issue 1079)
+      * Support ES2017 trailing commas in function parameters (issue 1550)
+      * Explicitly distinguish parsing a module vs a script (issue 1576)
+      * Fix JSX non-empty container (issue 1786)
+      * Allow JSX element in a yield expression (issue 1765)
+      * Allow `in` expression in a concise body with a function body (issue 1793)
+      * Setter function argument must not be a rest parameter (issue 1693)
+      * Limit strict mode directive to functions with a simple parameter list (issue 1677)
+      * Prohibit any escape sequence in a reserved word (issue 1612)
+      * Only permit hex digits in hex escape sequence (issue 1619)
+      * Prohibit labelled class/generator/function declaration (issue 1484)
+      * Limit function declaration as if statement clause only in non-strict mode (issue 1657)
+      * Tolerate missing ) in a with and do-while statement (issue 1481)
+
+2016-12-22: Version 3.1.3
+
+      * Support binding patterns as rest element (issue 1681)
+      * Account for different possible arguments of a yield expression (issue 1469)
+
+2016-11-24: Version 3.1.2
+
+      * Ensure that import specifier is more restrictive (issue 1615)
+      * Fix duplicated JSX tokens (issue 1613)
+      * Scan template literal in a JSX expression container (issue 1622)
+      * Improve XHTML entity scanning in JSX (issue 1629)
+
+2016-10-31: Version 3.1.1
+
+      * Fix assignment expression problem in an export declaration (issue 1596)
+      * Fix incorrect tokenization of hex digits (issue 1605)
+
+2016-10-09: Version 3.1.0
+
+      * Do not implicitly collect comments when comment attachment is specified (issue 1553)
+      * Fix incorrect handling of duplicated proto shorthand fields (issue 1485)
+      * Prohibit initialization in some variants of for statements (issue 1309, 1561)
+      * Fix incorrect parsing of export specifier (issue 1578)
+      * Fix ESTree compatibility for assignment pattern (issue 1575)
+
+2016-09-03: Version 3.0.0
+
+      * Support ES2016 exponentiation expression (issue 1490)
+      * Support JSX syntax (issue 1467)
+      * Use the latest Unicode 8.0 (issue 1475)
+      * Add the support for syntax node delegate (issue 1435)
+      * Fix ESTree compatibility on meta property (issue 1338)
+      * Fix ESTree compatibility on default parameter value (issue 1081)
+      * Fix ESTree compatibility on try handler (issue 1030)
+
+2016-08-23: Version 2.7.3
+
+      * Fix tokenizer confusion with a comment (issue 1493, 1516)
+
+2016-02-02: Version 2.7.2
+
+      * Fix out-of-bound error location in an invalid string literal (issue 1457)
+      * Fix shorthand object destructuring defaults in variable declarations (issue 1459)
+
+2015-12-10: Version 2.7.1
+
+      * Do not allow trailing comma in a variable declaration (issue 1360)
+      * Fix assignment to `let` in non-strict mode (issue 1376)
+      * Fix missing delegate property in YieldExpression (issue 1407)
+
+2015-10-22: Version 2.7.0
+
+      * Fix the handling of semicolon in a break statement (issue 1044)
+      * Run the test suite with major web browsers (issue 1259, 1317)
+      * Allow `let` as an identifier in non-strict mode (issue 1289)
+      * Attach orphaned comments as `innerComments` (issue 1328)
+      * Add the support for token delegator (issue 1332)
+
+2015-09-01: Version 2.6.0
+
+      * Properly allow or prohibit `let` in a binding identifier/pattern (issue 1048, 1098)
+      * Add sourceType field for Program node (issue 1159)
+      * Ensure that strict mode reserved word binding throw an error (issue 1171)
+      * Run the test suite with Node.js and IE 11 on Windows (issue 1294)
+      * Allow binding pattern with no initializer in a for statement (issue 1301)
+
+2015-07-31: Version 2.5.0
+
+      * Run the test suite in a browser environment (issue 1004)
+      * Ensure a comma between imported default binding and named imports (issue 1046)
+      * Distinguish `yield` as a keyword vs an identifier (issue 1186)
+      * Support ES6 meta property `new.target` (issue 1203)
+      * Fix the syntax node for yield with expression (issue 1223)
+      * Fix the check of duplicated proto in property names (issue 1225)
+      * Fix ES6 Unicode escape in identifier name (issue 1229)
+      * Support ES6 IdentifierStart and IdentifierPart (issue 1232)
+      * Treat await as a reserved word when parsing as a module (issue 1234)
+      * Recognize identifier characters from Unicode SMP (issue 1244)
+      * Ensure that export and import can be followed by a comma (issue 1250)
+      * Fix yield operator precedence (issue 1262)
+
+2015-07-01: Version 2.4.1
+
+      * Fix some cases of comment attachment (issue 1071, 1175)
+      * Fix the handling of destructuring in function arguments (issue 1193)
+      * Fix invalid ranges in assignment expression (issue 1201)
+
+2015-06-26: Version 2.4.0
+
+      * Support ES6 for-of iteration (issue 1047)
+      * Support ES6 spread arguments (issue 1169)
+      * Minimize npm payload (issue 1191)
+
+2015-06-16: Version 2.3.0
+
+      * Support ES6 generator (issue 1033)
+      * Improve parsing of regular expressions with `u` flag (issue 1179)
+
+2015-04-17: Version 2.2.0
+
+      * Support ES6 import and export declarations (issue 1000)
+      * Fix line terminator before arrow not recognized as error (issue 1009)
+      * Support ES6 destructuring (issue 1045)
+      * Support ES6 template literal (issue 1074)
+      * Fix the handling of invalid/incomplete string escape sequences (issue 1106)
+      * Fix ES3 static member access restriction (issue 1120)
+      * Support for `super` in ES6 class (issue 1147)
+
+2015-03-09: Version 2.1.0
+
+      * Support ES6 class (issue 1001)
+      * Support ES6 rest parameter (issue 1011)
+      * Expand the location of property getter, setter, and methods (issue 1029)
+      * Enable TryStatement transition to a single handler (issue 1031)
+      * Support ES6 computed property name (issue 1037)
+      * Tolerate unclosed block comment (issue 1041)
+      * Support ES6 lexical declaration (issue 1065)
+
+2015-02-06: Version 2.0.0
+
+      * Support ES6 arrow function (issue 517)
+      * Support ES6 Unicode code point escape (issue 521)
+      * Improve the speed and accuracy of comment attachment (issue 522)
+      * Support ES6 default parameter (issue 519)
+      * Support ES6 regular expression flags (issue 557)
+      * Fix scanning of implicit octal literals (issue 565)
+      * Fix the handling of automatic semicolon insertion (issue 574)
+      * Support ES6 method definition (issue 620)
+      * Support ES6 octal integer literal (issue 621)
+      * Support ES6 binary integer literal (issue 622)
+      * Support ES6 object literal property value shorthand (issue 624)
+
+2015-03-03: Version 1.2.5
+
+      * Fix scanning of implicit octal literals (issue 565)
+
+2015-02-05: Version 1.2.4
+
+      * Fix parsing of LeftHandSideExpression in ForInStatement (issue 560)
+      * Fix the handling of automatic semicolon insertion (issue 574)
+
+2015-01-18: Version 1.2.3
+
+      * Fix division by this (issue 616)
+
+2014-05-18: Version 1.2.2
+
+      * Fix duplicated tokens when collecting comments (issue 537)
+
+2014-05-04: Version 1.2.1
+
+      * Ensure that Program node may still have leading comments (issue 536)
+
+2014-04-29: Version 1.2.0
+
+      * Fix semicolon handling for expression statement (issue 462, 533)
+      * Disallow escaped characters in regular expression flags (issue 503)
+      * Performance improvement for location tracking (issue 520)
+      * Improve the speed of comment attachment (issue 522)
+
+2014-03-26: Version 1.1.1
+
+      * Fix token handling of forward slash after an array literal (issue 512)
+
+2014-03-23: Version 1.1.0
+
+      * Optionally attach comments to the owning syntax nodes (issue 197)
+      * Simplify binary parsing with stack-based shift reduce (issue 352)
+      * Always include the raw source of literals (issue 376)
+      * Add optional input source information (issue 386)
+      * Tokenizer API for pure lexical scanning (issue 398)
+      * Improve the web site and its online demos (issue 337, 400, 404)
+      * Performance improvement for location tracking (issue 417, 424)
+      * Support HTML comment syntax (issue 451)
+      * Drop support for legacy browsers (issue 474)
+
+2013-08-27: Version 1.0.4
+
+      * Minimize the payload for packages (issue 362)
+      * Fix missing cases on an empty switch statement (issue 436)
+      * Support escaped ] in regexp literal character classes (issue 442)
+      * Tolerate invalid left-hand side expression (issue 130)
+
+2013-05-17: Version 1.0.3
+
+      * Variable declaration needs at least one declarator (issue 391)
+      * Fix benchmark's variance unit conversion (issue 397)
+      * IE < 9: \v should be treated as vertical tab (issue 405)
+      * Unary expressions should always have prefix: true (issue 418)
+      * Catch clause should only accept an identifier (issue 423)
+      * Tolerate setters without parameter (issue 426)
+
+2012-11-02: Version 1.0.2
+
+    Improvement:
+
+      * Fix esvalidate JUnit output upon a syntax error (issue 374)
+
+2012-10-28: Version 1.0.1
+
+    Improvements:
+
+      * esvalidate understands shebang in a Unix shell script (issue 361)
+      * esvalidate treats fatal parsing failure as an error (issue 361)
+      * Reduce Node.js package via .npmignore (issue 362)
+
+2012-10-22: Version 1.0.0
+
+    Initial release.
diff --git a/node_modules/esprima/LICENSE.BSD b/node_modules/esprima/LICENSE.BSD
new file mode 100644
index 0000000..7a55160
--- /dev/null
+++ b/node_modules/esprima/LICENSE.BSD
@@ -0,0 +1,21 @@
+Copyright JS Foundation and other contributors, https://js.foundation/
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/esprima/README.md b/node_modules/esprima/README.md
new file mode 100644
index 0000000..8fb25e6
--- /dev/null
+++ b/node_modules/esprima/README.md
@@ -0,0 +1,46 @@
+[![NPM version](https://img.shields.io/npm/v/esprima.svg)](https://www.npmjs.com/package/esprima)
+[![npm download](https://img.shields.io/npm/dm/esprima.svg)](https://www.npmjs.com/package/esprima)
+[![Build Status](https://img.shields.io/travis/jquery/esprima/master.svg)](https://travis-ci.org/jquery/esprima)
+[![Coverage Status](https://img.shields.io/codecov/c/github/jquery/esprima/master.svg)](https://codecov.io/github/jquery/esprima)
+
+**Esprima** ([esprima.org](http://esprima.org), BSD license) is a high performance,
+standard-compliant [ECMAScript](http://www.ecma-international.org/publications/standards/Ecma-262.htm)
+parser written in ECMAScript (also popularly known as
+[JavaScript](https://en.wikipedia.org/wiki/JavaScript)).
+Esprima is created and maintained by [Ariya Hidayat](https://twitter.com/ariyahidayat),
+with the help of [many contributors](https://github.com/jquery/esprima/contributors).
+
+### Features
+
+- Full support for ECMAScript 2017 ([ECMA-262 8th Edition](http://www.ecma-international.org/publications/standards/Ecma-262.htm))
+- Sensible [syntax tree format](https://github.com/estree/estree/blob/master/es5.md) as standardized by [ESTree project](https://github.com/estree/estree)
+- Experimental support for [JSX](https://facebook.github.io/jsx/), a syntax extension for [React](https://facebook.github.io/react/)
+- Optional tracking of syntax node location (index-based and line-column)
+- [Heavily tested](http://esprima.org/test/ci.html) (~1500 [unit tests](https://github.com/jquery/esprima/tree/master/test/fixtures) with [full code coverage](https://codecov.io/github/jquery/esprima))
+
+### API
+
+Esprima can be used to perform [lexical analysis](https://en.wikipedia.org/wiki/Lexical_analysis) (tokenization) or [syntactic analysis](https://en.wikipedia.org/wiki/Parsing) (parsing) of a JavaScript program.
+
+A simple example on Node.js REPL:
+
+```javascript
+> var esprima = require('esprima');
+> var program = 'const answer = 42';
+
+> esprima.tokenize(program);
+[ { type: 'Keyword', value: 'const' },
+  { type: 'Identifier', value: 'answer' },
+  { type: 'Punctuator', value: '=' },
+  { type: 'Numeric', value: '42' } ]
+  
+> esprima.parseScript(program);
+{ type: 'Program',
+  body:
+   [ { type: 'VariableDeclaration',
+       declarations: [Object],
+       kind: 'const' } ],
+  sourceType: 'script' }
+```
+
+For more information, please read the [complete documentation](http://esprima.org/doc).
\ No newline at end of file
diff --git a/node_modules/esprima/bin/esparse.js b/node_modules/esprima/bin/esparse.js
new file mode 100755
index 0000000..45d05fb
--- /dev/null
+++ b/node_modules/esprima/bin/esparse.js
@@ -0,0 +1,139 @@
+#!/usr/bin/env node
+/*
+  Copyright JS Foundation and other contributors, https://js.foundation/
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/*jslint sloppy:true node:true rhino:true */
+
+var fs, esprima, fname, forceFile, content, options, syntax;
+
+if (typeof require === 'function') {
+    fs = require('fs');
+    try {
+        esprima = require('esprima');
+    } catch (e) {
+        esprima = require('../');
+    }
+} else if (typeof load === 'function') {
+    try {
+        load('esprima.js');
+    } catch (e) {
+        load('../esprima.js');
+    }
+}
+
+// Shims to Node.js objects when running under Rhino.
+if (typeof console === 'undefined' && typeof process === 'undefined') {
+    console = { log: print };
+    fs = { readFileSync: readFile };
+    process = { argv: arguments, exit: quit };
+    process.argv.unshift('esparse.js');
+    process.argv.unshift('rhino');
+}
+
+function showUsage() {
+    console.log('Usage:');
+    console.log('   esparse [options] [file.js]');
+    console.log();
+    console.log('Available options:');
+    console.log();
+    console.log('  --comment      Gather all line and block comments in an array');
+    console.log('  --loc          Include line-column location info for each syntax node');
+    console.log('  --range        Include index-based range for each syntax node');
+    console.log('  --raw          Display the raw value of literals');
+    console.log('  --tokens       List all tokens in an array');
+    console.log('  --tolerant     Tolerate errors on a best-effort basis (experimental)');
+    console.log('  -v, --version  Shows program version');
+    console.log();
+    process.exit(1);
+}
+
+options = {};
+
+process.argv.splice(2).forEach(function (entry) {
+
+    if (forceFile || entry === '-' || entry.slice(0, 1) !== '-') {
+        if (typeof fname === 'string') {
+            console.log('Error: more than one input file.');
+            process.exit(1);
+        } else {
+            fname = entry;
+        }
+    } else if (entry === '-h' || entry === '--help') {
+        showUsage();
+    } else if (entry === '-v' || entry === '--version') {
+        console.log('ECMAScript Parser (using Esprima version', esprima.version, ')');
+        console.log();
+        process.exit(0);
+    } else if (entry === '--comment') {
+        options.comment = true;
+    } else if (entry === '--loc') {
+        options.loc = true;
+    } else if (entry === '--range') {
+        options.range = true;
+    } else if (entry === '--raw') {
+        options.raw = true;
+    } else if (entry === '--tokens') {
+        options.tokens = true;
+    } else if (entry === '--tolerant') {
+        options.tolerant = true;
+    } else if (entry === '--') {
+        forceFile = true;
+    } else {
+        console.log('Error: unknown option ' + entry + '.');
+        process.exit(1);
+    }
+});
+
+// Special handling for regular expression literal since we need to
+// convert it to a string literal, otherwise it will be decoded
+// as object "{}" and the regular expression would be lost.
+function adjustRegexLiteral(key, value) {
+    if (key === 'value' && value instanceof RegExp) {
+        value = value.toString();
+    }
+    return value;
+}
+
+function run(content) {
+    syntax = esprima.parse(content, options);
+    console.log(JSON.stringify(syntax, adjustRegexLiteral, 4));
+}
+
+try {
+    if (fname && (fname !== '-' || forceFile)) {
+        run(fs.readFileSync(fname, 'utf-8'));
+    } else {
+        var content = '';
+        process.stdin.resume();
+        process.stdin.on('data', function(chunk) {
+            content += chunk;
+        });
+        process.stdin.on('end', function() {
+            run(content);
+        });
+    }
+} catch (e) {
+    console.log('Error: ' + e.message);
+    process.exit(1);
+}
diff --git a/node_modules/esprima/bin/esvalidate.js b/node_modules/esprima/bin/esvalidate.js
new file mode 100755
index 0000000..d49a7e4
--- /dev/null
+++ b/node_modules/esprima/bin/esvalidate.js
@@ -0,0 +1,236 @@
+#!/usr/bin/env node
+/*
+  Copyright JS Foundation and other contributors, https://js.foundation/
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright
+      notice, this list of conditions and the following disclaimer in the
+      documentation and/or other materials provided with the distribution.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/*jslint sloppy:true plusplus:true node:true rhino:true */
+/*global phantom:true */
+
+var fs, system, esprima, options, fnames, forceFile, count;
+
+if (typeof esprima === 'undefined') {
+    // PhantomJS can only require() relative files
+    if (typeof phantom === 'object') {
+        fs = require('fs');
+        system = require('system');
+        esprima = require('./esprima');
+    } else if (typeof require === 'function') {
+        fs = require('fs');
+        try {
+            esprima = require('esprima');
+        } catch (e) {
+            esprima = require('../');
+        }
+    } else if (typeof load === 'function') {
+        try {
+            load('esprima.js');
+        } catch (e) {
+            load('../esprima.js');
+        }
+    }
+}
+
+// Shims to Node.js objects when running under PhantomJS 1.7+.
+if (typeof phantom === 'object') {
+    fs.readFileSync = fs.read;
+    process = {
+        argv: [].slice.call(system.args),
+        exit: phantom.exit,
+        on: function (evt, callback) {
+            callback();
+        }
+    };
+    process.argv.unshift('phantomjs');
+}
+
+// Shims to Node.js objects when running under Rhino.
+if (typeof console === 'undefined' && typeof process === 'undefined') {
+    console = { log: print };
+    fs = { readFileSync: readFile };
+    process = {
+        argv: arguments,
+        exit: quit,
+        on: function (evt, callback) {
+            callback();
+        }
+    };
+    process.argv.unshift('esvalidate.js');
+    process.argv.unshift('rhino');
+}
+
+function showUsage() {
+    console.log('Usage:');
+    console.log('   esvalidate [options] [file.js...]');
+    console.log();
+    console.log('Available options:');
+    console.log();
+    console.log('  --format=type  Set the report format, plain (default) or junit');
+    console.log('  -v, --version  Print program version');
+    console.log();
+    process.exit(1);
+}
+
+options = {
+    format: 'plain'
+};
+
+fnames = [];
+
+process.argv.splice(2).forEach(function (entry) {
+
+    if (forceFile || entry === '-' || entry.slice(0, 1) !== '-') {
+        fnames.push(entry);
+    } else if (entry === '-h' || entry === '--help') {
+        showUsage();
+    } else if (entry === '-v' || entry === '--version') {
+        console.log('ECMAScript Validator (using Esprima version', esprima.version, ')');
+        console.log();
+        process.exit(0);
+    } else if (entry.slice(0, 9) === '--format=') {
+        options.format = entry.slice(9);
+        if (options.format !== 'plain' && options.format !== 'junit') {
+            console.log('Error: unknown report format ' + options.format + '.');
+            process.exit(1);
+        }
+    } else if (entry === '--') {
+        forceFile = true;
+    } else {
+        console.log('Error: unknown option ' + entry + '.');
+        process.exit(1);
+    }
+});
+
+if (fnames.length === 0) {
+    fnames.push('');
+}
+
+if (options.format === 'junit') {
+    console.log('<?xml version="1.0" encoding="UTF-8"?>');
+    console.log('<testsuites>');
+}
+
+count = 0;
+
+function run(fname, content) {
+    var timestamp, syntax, name;
+    try {
+        if (typeof content !== 'string') {
+            throw content;
+        }
+
+        if (content[0] === '#' && content[1] === '!') {
+            content = '//' + content.substr(2, content.length);
+        }
+
+        timestamp = Date.now();
+        syntax = esprima.parse(content, { tolerant: true });
+
+        if (options.format === 'junit') {
+
+            name = fname;
+            if (name.lastIndexOf('/') >= 0) {
+                name = name.slice(name.lastIndexOf('/') + 1);
+            }
+
+            console.log('<testsuite name="' + fname + '" errors="0" ' +
+                ' failures="' + syntax.errors.length + '" ' +
+                ' tests="' + syntax.errors.length + '" ' +
+                ' time="' + Math.round((Date.now() - timestamp) / 1000) +
+                '">');
+
+            syntax.errors.forEach(function (error) {
+                var msg = error.message;
+                msg = msg.replace(/^Line\ [0-9]*\:\ /, '');
+                console.log('  <testcase name="Line ' + error.lineNumber + ': ' + msg + '" ' +
+                    ' time="0">');
+                console.log('    <error type="SyntaxError" message="' + error.message + '">' +
+                    error.message + '(' + name + ':' + error.lineNumber + ')' +
+                    '</error>');
+                console.log('  </testcase>');
+            });
+
+            console.log('</testsuite>');
+
+        } else if (options.format === 'plain') {
+
+            syntax.errors.forEach(function (error) {
+                var msg = error.message;
+                msg = msg.replace(/^Line\ [0-9]*\:\ /, '');
+                msg = fname + ':' + error.lineNumber + ': ' + msg;
+                console.log(msg);
+                ++count;
+            });
+
+        }
+    } catch (e) {
+        ++count;
+        if (options.format === 'junit') {
+            console.log('<testsuite name="' + fname + '" errors="1" failures="0" tests="1" ' +
+                ' time="' + Math.round((Date.now() - timestamp) / 1000) + '">');
+            console.log(' <testcase name="' + e.message + '" ' + ' time="0">');
+            console.log(' <error type="ParseError" message="' + e.message + '">' +
+                e.message + '(' + fname + ((e.lineNumber) ? ':' + e.lineNumber : '') +
+                ')</error>');
+            console.log(' </testcase>');
+            console.log('</testsuite>');
+        } else {
+            console.log(fname + ':' + e.lineNumber + ': ' + e.message.replace(/^Line\ [0-9]*\:\ /, ''));
+        }
+    }
+}
+
+fnames.forEach(function (fname) {
+    var content = '';
+    try {
+        if (fname && (fname !== '-' || forceFile)) {
+            content = fs.readFileSync(fname, 'utf-8');
+        } else {
+            fname = '';
+            process.stdin.resume();
+            process.stdin.on('data', function(chunk) {
+                content += chunk;
+            });
+            process.stdin.on('end', function() {
+                run(fname, content);
+            });
+            return;
+        }
+    } catch (e) {
+        content = e;
+    }
+    run(fname, content);
+});
+
+process.on('exit', function () {
+    if (options.format === 'junit') {
+        console.log('</testsuites>');
+    }
+
+    if (count > 0) {
+        process.exit(1);
+    }
+
+    if (count === 0 && typeof phantom === 'object') {
+        process.exit(0);
+    }
+});
diff --git a/node_modules/esprima/dist/esprima.js b/node_modules/esprima/dist/esprima.js
new file mode 100644
index 0000000..2af3eee
--- /dev/null
+++ b/node_modules/esprima/dist/esprima.js
@@ -0,0 +1,6709 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+/* istanbul ignore next */
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+/* istanbul ignore next */
+	else if(typeof exports === 'object')
+		exports["esprima"] = factory();
+	else
+		root["esprima"] = factory();
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+
+/******/ 		// Check if module is in cache
+/* istanbul ignore if */
+/******/ 		if(installedModules[moduleId])
+/******/ 			return installedModules[moduleId].exports;
+
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			exports: {},
+/******/ 			id: moduleId,
+/******/ 			loaded: false
+/******/ 		};
+
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+
+/******/ 		// Flag the module as loaded
+/******/ 		module.loaded = true;
+
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+
+
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(0);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	/*
+	  Copyright JS Foundation and other contributors, https://js.foundation/
+
+	  Redistribution and use in source and binary forms, with or without
+	  modification, are permitted provided that the following conditions are met:
+
+	    * Redistributions of source code must retain the above copyright
+	      notice, this list of conditions and the following disclaimer.
+	    * Redistributions in binary form must reproduce the above copyright
+	      notice, this list of conditions and the following disclaimer in the
+	      documentation and/or other materials provided with the distribution.
+
+	  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+	  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+	  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+	  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+	  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+	  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+	  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+	  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+	  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	*/
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var comment_handler_1 = __webpack_require__(1);
+	var jsx_parser_1 = __webpack_require__(3);
+	var parser_1 = __webpack_require__(8);
+	var tokenizer_1 = __webpack_require__(15);
+	function parse(code, options, delegate) {
+	    var commentHandler = null;
+	    var proxyDelegate = function (node, metadata) {
+	        if (delegate) {
+	            delegate(node, metadata);
+	        }
+	        if (commentHandler) {
+	            commentHandler.visit(node, metadata);
+	        }
+	    };
+	    var parserDelegate = (typeof delegate === 'function') ? proxyDelegate : null;
+	    var collectComment = false;
+	    if (options) {
+	        collectComment = (typeof options.comment === 'boolean' && options.comment);
+	        var attachComment = (typeof options.attachComment === 'boolean' && options.attachComment);
+	        if (collectComment || attachComment) {
+	            commentHandler = new comment_handler_1.CommentHandler();
+	            commentHandler.attach = attachComment;
+	            options.comment = true;
+	            parserDelegate = proxyDelegate;
+	        }
+	    }
+	    var isModule = false;
+	    if (options && typeof options.sourceType === 'string') {
+	        isModule = (options.sourceType === 'module');
+	    }
+	    var parser;
+	    if (options && typeof options.jsx === 'boolean' && options.jsx) {
+	        parser = new jsx_parser_1.JSXParser(code, options, parserDelegate);
+	    }
+	    else {
+	        parser = new parser_1.Parser(code, options, parserDelegate);
+	    }
+	    var program = isModule ? parser.parseModule() : parser.parseScript();
+	    var ast = program;
+	    if (collectComment && commentHandler) {
+	        ast.comments = commentHandler.comments;
+	    }
+	    if (parser.config.tokens) {
+	        ast.tokens = parser.tokens;
+	    }
+	    if (parser.config.tolerant) {
+	        ast.errors = parser.errorHandler.errors;
+	    }
+	    return ast;
+	}
+	exports.parse = parse;
+	function parseModule(code, options, delegate) {
+	    var parsingOptions = options || {};
+	    parsingOptions.sourceType = 'module';
+	    return parse(code, parsingOptions, delegate);
+	}
+	exports.parseModule = parseModule;
+	function parseScript(code, options, delegate) {
+	    var parsingOptions = options || {};
+	    parsingOptions.sourceType = 'script';
+	    return parse(code, parsingOptions, delegate);
+	}
+	exports.parseScript = parseScript;
+	function tokenize(code, options, delegate) {
+	    var tokenizer = new tokenizer_1.Tokenizer(code, options);
+	    var tokens;
+	    tokens = [];
+	    try {
+	        while (true) {
+	            var token = tokenizer.getNextToken();
+	            if (!token) {
+	                break;
+	            }
+	            if (delegate) {
+	                token = delegate(token);
+	            }
+	            tokens.push(token);
+	        }
+	    }
+	    catch (e) {
+	        tokenizer.errorHandler.tolerate(e);
+	    }
+	    if (tokenizer.errorHandler.tolerant) {
+	        tokens.errors = tokenizer.errors();
+	    }
+	    return tokens;
+	}
+	exports.tokenize = tokenize;
+	var syntax_1 = __webpack_require__(2);
+	exports.Syntax = syntax_1.Syntax;
+	// Sync with *.json manifests.
+	exports.version = '4.0.1';
+
+
+/***/ },
+/* 1 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var syntax_1 = __webpack_require__(2);
+	var CommentHandler = (function () {
+	    function CommentHandler() {
+	        this.attach = false;
+	        this.comments = [];
+	        this.stack = [];
+	        this.leading = [];
+	        this.trailing = [];
+	    }
+	    CommentHandler.prototype.insertInnerComments = function (node, metadata) {
+	        //  innnerComments for properties empty block
+	        //  `function a() {/** comments **\/}`
+	        if (node.type === syntax_1.Syntax.BlockStatement && node.body.length === 0) {
+	            var innerComments = [];
+	            for (var i = this.leading.length - 1; i >= 0; --i) {
+	                var entry = this.leading[i];
+	                if (metadata.end.offset >= entry.start) {
+	                    innerComments.unshift(entry.comment);
+	                    this.leading.splice(i, 1);
+	                    this.trailing.splice(i, 1);
+	                }
+	            }
+	            if (innerComments.length) {
+	                node.innerComments = innerComments;
+	            }
+	        }
+	    };
+	    CommentHandler.prototype.findTrailingComments = function (metadata) {
+	        var trailingComments = [];
+	        if (this.trailing.length > 0) {
+	            for (var i = this.trailing.length - 1; i >= 0; --i) {
+	                var entry_1 = this.trailing[i];
+	                if (entry_1.start >= metadata.end.offset) {
+	                    trailingComments.unshift(entry_1.comment);
+	                }
+	            }
+	            this.trailing.length = 0;
+	            return trailingComments;
+	        }
+	        var entry = this.stack[this.stack.length - 1];
+	        if (entry && entry.node.trailingComments) {
+	            var firstComment = entry.node.trailingComments[0];
+	            if (firstComment && firstComment.range[0] >= metadata.end.offset) {
+	                trailingComments = entry.node.trailingComments;
+	                delete entry.node.trailingComments;
+	            }
+	        }
+	        return trailingComments;
+	    };
+	    CommentHandler.prototype.findLeadingComments = function (metadata) {
+	        var leadingComments = [];
+	        var target;
+	        while (this.stack.length > 0) {
+	            var entry = this.stack[this.stack.length - 1];
+	            if (entry && entry.start >= metadata.start.offset) {
+	                target = entry.node;
+	                this.stack.pop();
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        if (target) {
+	            var count = target.leadingComments ? target.leadingComments.length : 0;
+	            for (var i = count - 1; i >= 0; --i) {
+	                var comment = target.leadingComments[i];
+	                if (comment.range[1] <= metadata.start.offset) {
+	                    leadingComments.unshift(comment);
+	                    target.leadingComments.splice(i, 1);
+	                }
+	            }
+	            if (target.leadingComments && target.leadingComments.length === 0) {
+	                delete target.leadingComments;
+	            }
+	            return leadingComments;
+	        }
+	        for (var i = this.leading.length - 1; i >= 0; --i) {
+	            var entry = this.leading[i];
+	            if (entry.start <= metadata.start.offset) {
+	                leadingComments.unshift(entry.comment);
+	                this.leading.splice(i, 1);
+	            }
+	        }
+	        return leadingComments;
+	    };
+	    CommentHandler.prototype.visitNode = function (node, metadata) {
+	        if (node.type === syntax_1.Syntax.Program && node.body.length > 0) {
+	            return;
+	        }
+	        this.insertInnerComments(node, metadata);
+	        var trailingComments = this.findTrailingComments(metadata);
+	        var leadingComments = this.findLeadingComments(metadata);
+	        if (leadingComments.length > 0) {
+	            node.leadingComments = leadingComments;
+	        }
+	        if (trailingComments.length > 0) {
+	            node.trailingComments = trailingComments;
+	        }
+	        this.stack.push({
+	            node: node,
+	            start: metadata.start.offset
+	        });
+	    };
+	    CommentHandler.prototype.visitComment = function (node, metadata) {
+	        var type = (node.type[0] === 'L') ? 'Line' : 'Block';
+	        var comment = {
+	            type: type,
+	            value: node.value
+	        };
+	        if (node.range) {
+	            comment.range = node.range;
+	        }
+	        if (node.loc) {
+	            comment.loc = node.loc;
+	        }
+	        this.comments.push(comment);
+	        if (this.attach) {
+	            var entry = {
+	                comment: {
+	                    type: type,
+	                    value: node.value,
+	                    range: [metadata.start.offset, metadata.end.offset]
+	                },
+	                start: metadata.start.offset
+	            };
+	            if (node.loc) {
+	                entry.comment.loc = node.loc;
+	            }
+	            node.type = type;
+	            this.leading.push(entry);
+	            this.trailing.push(entry);
+	        }
+	    };
+	    CommentHandler.prototype.visit = function (node, metadata) {
+	        if (node.type === 'LineComment') {
+	            this.visitComment(node, metadata);
+	        }
+	        else if (node.type === 'BlockComment') {
+	            this.visitComment(node, metadata);
+	        }
+	        else if (this.attach) {
+	            this.visitNode(node, metadata);
+	        }
+	    };
+	    return CommentHandler;
+	}());
+	exports.CommentHandler = CommentHandler;
+
+
+/***/ },
+/* 2 */
+/***/ function(module, exports) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.Syntax = {
+	    AssignmentExpression: 'AssignmentExpression',
+	    AssignmentPattern: 'AssignmentPattern',
+	    ArrayExpression: 'ArrayExpression',
+	    ArrayPattern: 'ArrayPattern',
+	    ArrowFunctionExpression: 'ArrowFunctionExpression',
+	    AwaitExpression: 'AwaitExpression',
+	    BlockStatement: 'BlockStatement',
+	    BinaryExpression: 'BinaryExpression',
+	    BreakStatement: 'BreakStatement',
+	    CallExpression: 'CallExpression',
+	    CatchClause: 'CatchClause',
+	    ClassBody: 'ClassBody',
+	    ClassDeclaration: 'ClassDeclaration',
+	    ClassExpression: 'ClassExpression',
+	    ConditionalExpression: 'ConditionalExpression',
+	    ContinueStatement: 'ContinueStatement',
+	    DoWhileStatement: 'DoWhileStatement',
+	    DebuggerStatement: 'DebuggerStatement',
+	    EmptyStatement: 'EmptyStatement',
+	    ExportAllDeclaration: 'ExportAllDeclaration',
+	    ExportDefaultDeclaration: 'ExportDefaultDeclaration',
+	    ExportNamedDeclaration: 'ExportNamedDeclaration',
+	    ExportSpecifier: 'ExportSpecifier',
+	    ExpressionStatement: 'ExpressionStatement',
+	    ForStatement: 'ForStatement',
+	    ForOfStatement: 'ForOfStatement',
+	    ForInStatement: 'ForInStatement',
+	    FunctionDeclaration: 'FunctionDeclaration',
+	    FunctionExpression: 'FunctionExpression',
+	    Identifier: 'Identifier',
+	    IfStatement: 'IfStatement',
+	    ImportDeclaration: 'ImportDeclaration',
+	    ImportDefaultSpecifier: 'ImportDefaultSpecifier',
+	    ImportNamespaceSpecifier: 'ImportNamespaceSpecifier',
+	    ImportSpecifier: 'ImportSpecifier',
+	    Literal: 'Literal',
+	    LabeledStatement: 'LabeledStatement',
+	    LogicalExpression: 'LogicalExpression',
+	    MemberExpression: 'MemberExpression',
+	    MetaProperty: 'MetaProperty',
+	    MethodDefinition: 'MethodDefinition',
+	    NewExpression: 'NewExpression',
+	    ObjectExpression: 'ObjectExpression',
+	    ObjectPattern: 'ObjectPattern',
+	    Program: 'Program',
+	    Property: 'Property',
+	    RestElement: 'RestElement',
+	    ReturnStatement: 'ReturnStatement',
+	    SequenceExpression: 'SequenceExpression',
+	    SpreadElement: 'SpreadElement',
+	    Super: 'Super',
+	    SwitchCase: 'SwitchCase',
+	    SwitchStatement: 'SwitchStatement',
+	    TaggedTemplateExpression: 'TaggedTemplateExpression',
+	    TemplateElement: 'TemplateElement',
+	    TemplateLiteral: 'TemplateLiteral',
+	    ThisExpression: 'ThisExpression',
+	    ThrowStatement: 'ThrowStatement',
+	    TryStatement: 'TryStatement',
+	    UnaryExpression: 'UnaryExpression',
+	    UpdateExpression: 'UpdateExpression',
+	    VariableDeclaration: 'VariableDeclaration',
+	    VariableDeclarator: 'VariableDeclarator',
+	    WhileStatement: 'WhileStatement',
+	    WithStatement: 'WithStatement',
+	    YieldExpression: 'YieldExpression'
+	};
+
+
+/***/ },
+/* 3 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+/* istanbul ignore next */
+	var __extends = (this && this.__extends) || (function () {
+	    var extendStatics = Object.setPrototypeOf ||
+	        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+	        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+	    return function (d, b) {
+	        extendStatics(d, b);
+	        function __() { this.constructor = d; }
+	        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+	    };
+	})();
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var character_1 = __webpack_require__(4);
+	var JSXNode = __webpack_require__(5);
+	var jsx_syntax_1 = __webpack_require__(6);
+	var Node = __webpack_require__(7);
+	var parser_1 = __webpack_require__(8);
+	var token_1 = __webpack_require__(13);
+	var xhtml_entities_1 = __webpack_require__(14);
+	token_1.TokenName[100 /* Identifier */] = 'JSXIdentifier';
+	token_1.TokenName[101 /* Text */] = 'JSXText';
+	// Fully qualified element name, e.g. <svg:path> returns "svg:path"
+	function getQualifiedElementName(elementName) {
+	    var qualifiedName;
+	    switch (elementName.type) {
+	        case jsx_syntax_1.JSXSyntax.JSXIdentifier:
+	            var id = elementName;
+	            qualifiedName = id.name;
+	            break;
+	        case jsx_syntax_1.JSXSyntax.JSXNamespacedName:
+	            var ns = elementName;
+	            qualifiedName = getQualifiedElementName(ns.namespace) + ':' +
+	                getQualifiedElementName(ns.name);
+	            break;
+	        case jsx_syntax_1.JSXSyntax.JSXMemberExpression:
+	            var expr = elementName;
+	            qualifiedName = getQualifiedElementName(expr.object) + '.' +
+	                getQualifiedElementName(expr.property);
+	            break;
+	        /* istanbul ignore next */
+	        default:
+	            break;
+	    }
+	    return qualifiedName;
+	}
+	var JSXParser = (function (_super) {
+	    __extends(JSXParser, _super);
+	    function JSXParser(code, options, delegate) {
+	        return _super.call(this, code, options, delegate) || this;
+	    }
+	    JSXParser.prototype.parsePrimaryExpression = function () {
+	        return this.match('<') ? this.parseJSXRoot() : _super.prototype.parsePrimaryExpression.call(this);
+	    };
+	    JSXParser.prototype.startJSX = function () {
+	        // Unwind the scanner before the lookahead token.
+	        this.scanner.index = this.startMarker.index;
+	        this.scanner.lineNumber = this.startMarker.line;
+	        this.scanner.lineStart = this.startMarker.index - this.startMarker.column;
+	    };
+	    JSXParser.prototype.finishJSX = function () {
+	        // Prime the next lookahead.
+	        this.nextToken();
+	    };
+	    JSXParser.prototype.reenterJSX = function () {
+	        this.startJSX();
+	        this.expectJSX('}');
+	        // Pop the closing '}' added from the lookahead.
+	        if (this.config.tokens) {
+	            this.tokens.pop();
+	        }
+	    };
+	    JSXParser.prototype.createJSXNode = function () {
+	        this.collectComments();
+	        return {
+	            index: this.scanner.index,
+	            line: this.scanner.lineNumber,
+	            column: this.scanner.index - this.scanner.lineStart
+	        };
+	    };
+	    JSXParser.prototype.createJSXChildNode = function () {
+	        return {
+	            index: this.scanner.index,
+	            line: this.scanner.lineNumber,
+	            column: this.scanner.index - this.scanner.lineStart
+	        };
+	    };
+	    JSXParser.prototype.scanXHTMLEntity = function (quote) {
+	        var result = '&';
+	        var valid = true;
+	        var terminated = false;
+	        var numeric = false;
+	        var hex = false;
+	        while (!this.scanner.eof() && valid && !terminated) {
+	            var ch = this.scanner.source[this.scanner.index];
+	            if (ch === quote) {
+	                break;
+	            }
+	            terminated = (ch === ';');
+	            result += ch;
+	            ++this.scanner.index;
+	            if (!terminated) {
+	                switch (result.length) {
+	                    case 2:
+	                        // e.g. '&#123;'
+	                        numeric = (ch === '#');
+	                        break;
+	                    case 3:
+	                        if (numeric) {
+	                            // e.g. '&#x41;'
+	                            hex = (ch === 'x');
+	                            valid = hex || character_1.Character.isDecimalDigit(ch.charCodeAt(0));
+	                            numeric = numeric && !hex;
+	                        }
+	                        break;
+	                    default:
+	                        valid = valid && !(numeric && !character_1.Character.isDecimalDigit(ch.charCodeAt(0)));
+	                        valid = valid && !(hex && !character_1.Character.isHexDigit(ch.charCodeAt(0)));
+	                        break;
+	                }
+	            }
+	        }
+	        if (valid && terminated && result.length > 2) {
+	            // e.g. '&#x41;' becomes just '#x41'
+	            var str = result.substr(1, result.length - 2);
+	            if (numeric && str.length > 1) {
+	                result = String.fromCharCode(parseInt(str.substr(1), 10));
+	            }
+	            else if (hex && str.length > 2) {
+	                result = String.fromCharCode(parseInt('0' + str.substr(1), 16));
+	            }
+	            else if (!numeric && !hex && xhtml_entities_1.XHTMLEntities[str]) {
+	                result = xhtml_entities_1.XHTMLEntities[str];
+	            }
+	        }
+	        return result;
+	    };
+	    // Scan the next JSX token. This replaces Scanner#lex when in JSX mode.
+	    JSXParser.prototype.lexJSX = function () {
+	        var cp = this.scanner.source.charCodeAt(this.scanner.index);
+	        // < > / : = { }
+	        if (cp === 60 || cp === 62 || cp === 47 || cp === 58 || cp === 61 || cp === 123 || cp === 125) {
+	            var value = this.scanner.source[this.scanner.index++];
+	            return {
+	                type: 7 /* Punctuator */,
+	                value: value,
+	                lineNumber: this.scanner.lineNumber,
+	                lineStart: this.scanner.lineStart,
+	                start: this.scanner.index - 1,
+	                end: this.scanner.index
+	            };
+	        }
+	        // " '
+	        if (cp === 34 || cp === 39) {
+	            var start = this.scanner.index;
+	            var quote = this.scanner.source[this.scanner.index++];
+	            var str = '';
+	            while (!this.scanner.eof()) {
+	                var ch = this.scanner.source[this.scanner.index++];
+	                if (ch === quote) {
+	                    break;
+	                }
+	                else if (ch === '&') {
+	                    str += this.scanXHTMLEntity(quote);
+	                }
+	                else {
+	                    str += ch;
+	                }
+	            }
+	            return {
+	                type: 8 /* StringLiteral */,
+	                value: str,
+	                lineNumber: this.scanner.lineNumber,
+	                lineStart: this.scanner.lineStart,
+	                start: start,
+	                end: this.scanner.index
+	            };
+	        }
+	        // ... or .
+	        if (cp === 46) {
+	            var n1 = this.scanner.source.charCodeAt(this.scanner.index + 1);
+	            var n2 = this.scanner.source.charCodeAt(this.scanner.index + 2);
+	            var value = (n1 === 46 && n2 === 46) ? '...' : '.';
+	            var start = this.scanner.index;
+	            this.scanner.index += value.length;
+	            return {
+	                type: 7 /* Punctuator */,
+	                value: value,
+	                lineNumber: this.scanner.lineNumber,
+	                lineStart: this.scanner.lineStart,
+	                start: start,
+	                end: this.scanner.index
+	            };
+	        }
+	        // `
+	        if (cp === 96) {
+	            // Only placeholder, since it will be rescanned as a real assignment expression.
+	            return {
+	                type: 10 /* Template */,
+	                value: '',
+	                lineNumber: this.scanner.lineNumber,
+	                lineStart: this.scanner.lineStart,
+	                start: this.scanner.index,
+	                end: this.scanner.index
+	            };
+	        }
+	        // Identifer can not contain backslash (char code 92).
+	        if (character_1.Character.isIdentifierStart(cp) && (cp !== 92)) {
+	            var start = this.scanner.index;
+	            ++this.scanner.index;
+	            while (!this.scanner.eof()) {
+	                var ch = this.scanner.source.charCodeAt(this.scanner.index);
+	                if (character_1.Character.isIdentifierPart(ch) && (ch !== 92)) {
+	                    ++this.scanner.index;
+	                }
+	                else if (ch === 45) {
+	                    // Hyphen (char code 45) can be part of an identifier.
+	                    ++this.scanner.index;
+	                }
+	                else {
+	                    break;
+	                }
+	            }
+	            var id = this.scanner.source.slice(start, this.scanner.index);
+	            return {
+	                type: 100 /* Identifier */,
+	                value: id,
+	                lineNumber: this.scanner.lineNumber,
+	                lineStart: this.scanner.lineStart,
+	                start: start,
+	                end: this.scanner.index
+	            };
+	        }
+	        return this.scanner.lex();
+	    };
+	    JSXParser.prototype.nextJSXToken = function () {
+	        this.collectComments();
+	        this.startMarker.index = this.scanner.index;
+	        this.startMarker.line = this.scanner.lineNumber;
+	        this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+	        var token = this.lexJSX();
+	        this.lastMarker.index = this.scanner.index;
+	        this.lastMarker.line = this.scanner.lineNumber;
+	        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+	        if (this.config.tokens) {
+	            this.tokens.push(this.convertToken(token));
+	        }
+	        return token;
+	    };
+	    JSXParser.prototype.nextJSXText = function () {
+	        this.startMarker.index = this.scanner.index;
+	        this.startMarker.line = this.scanner.lineNumber;
+	        this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+	        var start = this.scanner.index;
+	        var text = '';
+	        while (!this.scanner.eof()) {
+	            var ch = this.scanner.source[this.scanner.index];
+	            if (ch === '{' || ch === '<') {
+	                break;
+	            }
+	            ++this.scanner.index;
+	            text += ch;
+	            if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                ++this.scanner.lineNumber;
+	                if (ch === '\r' && this.scanner.source[this.scanner.index] === '\n') {
+	                    ++this.scanner.index;
+	                }
+	                this.scanner.lineStart = this.scanner.index;
+	            }
+	        }
+	        this.lastMarker.index = this.scanner.index;
+	        this.lastMarker.line = this.scanner.lineNumber;
+	        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+	        var token = {
+	            type: 101 /* Text */,
+	            value: text,
+	            lineNumber: this.scanner.lineNumber,
+	            lineStart: this.scanner.lineStart,
+	            start: start,
+	            end: this.scanner.index
+	        };
+	        if ((text.length > 0) && this.config.tokens) {
+	            this.tokens.push(this.convertToken(token));
+	        }
+	        return token;
+	    };
+	    JSXParser.prototype.peekJSXToken = function () {
+	        var state = this.scanner.saveState();
+	        this.scanner.scanComments();
+	        var next = this.lexJSX();
+	        this.scanner.restoreState(state);
+	        return next;
+	    };
+	    // Expect the next JSX token to match the specified punctuator.
+	    // If not, an exception will be thrown.
+	    JSXParser.prototype.expectJSX = function (value) {
+	        var token = this.nextJSXToken();
+	        if (token.type !== 7 /* Punctuator */ || token.value !== value) {
+	            this.throwUnexpectedToken(token);
+	        }
+	    };
+	    // Return true if the next JSX token matches the specified punctuator.
+	    JSXParser.prototype.matchJSX = function (value) {
+	        var next = this.peekJSXToken();
+	        return next.type === 7 /* Punctuator */ && next.value === value;
+	    };
+	    JSXParser.prototype.parseJSXIdentifier = function () {
+	        var node = this.createJSXNode();
+	        var token = this.nextJSXToken();
+	        if (token.type !== 100 /* Identifier */) {
+	            this.throwUnexpectedToken(token);
+	        }
+	        return this.finalize(node, new JSXNode.JSXIdentifier(token.value));
+	    };
+	    JSXParser.prototype.parseJSXElementName = function () {
+	        var node = this.createJSXNode();
+	        var elementName = this.parseJSXIdentifier();
+	        if (this.matchJSX(':')) {
+	            var namespace = elementName;
+	            this.expectJSX(':');
+	            var name_1 = this.parseJSXIdentifier();
+	            elementName = this.finalize(node, new JSXNode.JSXNamespacedName(namespace, name_1));
+	        }
+	        else if (this.matchJSX('.')) {
+	            while (this.matchJSX('.')) {
+	                var object = elementName;
+	                this.expectJSX('.');
+	                var property = this.parseJSXIdentifier();
+	                elementName = this.finalize(node, new JSXNode.JSXMemberExpression(object, property));
+	            }
+	        }
+	        return elementName;
+	    };
+	    JSXParser.prototype.parseJSXAttributeName = function () {
+	        var node = this.createJSXNode();
+	        var attributeName;
+	        var identifier = this.parseJSXIdentifier();
+	        if (this.matchJSX(':')) {
+	            var namespace = identifier;
+	            this.expectJSX(':');
+	            var name_2 = this.parseJSXIdentifier();
+	            attributeName = this.finalize(node, new JSXNode.JSXNamespacedName(namespace, name_2));
+	        }
+	        else {
+	            attributeName = identifier;
+	        }
+	        return attributeName;
+	    };
+	    JSXParser.prototype.parseJSXStringLiteralAttribute = function () {
+	        var node = this.createJSXNode();
+	        var token = this.nextJSXToken();
+	        if (token.type !== 8 /* StringLiteral */) {
+	            this.throwUnexpectedToken(token);
+	        }
+	        var raw = this.getTokenRaw(token);
+	        return this.finalize(node, new Node.Literal(token.value, raw));
+	    };
+	    JSXParser.prototype.parseJSXExpressionAttribute = function () {
+	        var node = this.createJSXNode();
+	        this.expectJSX('{');
+	        this.finishJSX();
+	        if (this.match('}')) {
+	            this.tolerateError('JSX attributes must only be assigned a non-empty expression');
+	        }
+	        var expression = this.parseAssignmentExpression();
+	        this.reenterJSX();
+	        return this.finalize(node, new JSXNode.JSXExpressionContainer(expression));
+	    };
+	    JSXParser.prototype.parseJSXAttributeValue = function () {
+	        return this.matchJSX('{') ? this.parseJSXExpressionAttribute() :
+	            this.matchJSX('<') ? this.parseJSXElement() : this.parseJSXStringLiteralAttribute();
+	    };
+	    JSXParser.prototype.parseJSXNameValueAttribute = function () {
+	        var node = this.createJSXNode();
+	        var name = this.parseJSXAttributeName();
+	        var value = null;
+	        if (this.matchJSX('=')) {
+	            this.expectJSX('=');
+	            value = this.parseJSXAttributeValue();
+	        }
+	        return this.finalize(node, new JSXNode.JSXAttribute(name, value));
+	    };
+	    JSXParser.prototype.parseJSXSpreadAttribute = function () {
+	        var node = this.createJSXNode();
+	        this.expectJSX('{');
+	        this.expectJSX('...');
+	        this.finishJSX();
+	        var argument = this.parseAssignmentExpression();
+	        this.reenterJSX();
+	        return this.finalize(node, new JSXNode.JSXSpreadAttribute(argument));
+	    };
+	    JSXParser.prototype.parseJSXAttributes = function () {
+	        var attributes = [];
+	        while (!this.matchJSX('/') && !this.matchJSX('>')) {
+	            var attribute = this.matchJSX('{') ? this.parseJSXSpreadAttribute() :
+	                this.parseJSXNameValueAttribute();
+	            attributes.push(attribute);
+	        }
+	        return attributes;
+	    };
+	    JSXParser.prototype.parseJSXOpeningElement = function () {
+	        var node = this.createJSXNode();
+	        this.expectJSX('<');
+	        var name = this.parseJSXElementName();
+	        var attributes = this.parseJSXAttributes();
+	        var selfClosing = this.matchJSX('/');
+	        if (selfClosing) {
+	            this.expectJSX('/');
+	        }
+	        this.expectJSX('>');
+	        return this.finalize(node, new JSXNode.JSXOpeningElement(name, selfClosing, attributes));
+	    };
+	    JSXParser.prototype.parseJSXBoundaryElement = function () {
+	        var node = this.createJSXNode();
+	        this.expectJSX('<');
+	        if (this.matchJSX('/')) {
+	            this.expectJSX('/');
+	            var name_3 = this.parseJSXElementName();
+	            this.expectJSX('>');
+	            return this.finalize(node, new JSXNode.JSXClosingElement(name_3));
+	        }
+	        var name = this.parseJSXElementName();
+	        var attributes = this.parseJSXAttributes();
+	        var selfClosing = this.matchJSX('/');
+	        if (selfClosing) {
+	            this.expectJSX('/');
+	        }
+	        this.expectJSX('>');
+	        return this.finalize(node, new JSXNode.JSXOpeningElement(name, selfClosing, attributes));
+	    };
+	    JSXParser.prototype.parseJSXEmptyExpression = function () {
+	        var node = this.createJSXChildNode();
+	        this.collectComments();
+	        this.lastMarker.index = this.scanner.index;
+	        this.lastMarker.line = this.scanner.lineNumber;
+	        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+	        return this.finalize(node, new JSXNode.JSXEmptyExpression());
+	    };
+	    JSXParser.prototype.parseJSXExpressionContainer = function () {
+	        var node = this.createJSXNode();
+	        this.expectJSX('{');
+	        var expression;
+	        if (this.matchJSX('}')) {
+	            expression = this.parseJSXEmptyExpression();
+	            this.expectJSX('}');
+	        }
+	        else {
+	            this.finishJSX();
+	            expression = this.parseAssignmentExpression();
+	            this.reenterJSX();
+	        }
+	        return this.finalize(node, new JSXNode.JSXExpressionContainer(expression));
+	    };
+	    JSXParser.prototype.parseJSXChildren = function () {
+	        var children = [];
+	        while (!this.scanner.eof()) {
+	            var node = this.createJSXChildNode();
+	            var token = this.nextJSXText();
+	            if (token.start < token.end) {
+	                var raw = this.getTokenRaw(token);
+	                var child = this.finalize(node, new JSXNode.JSXText(token.value, raw));
+	                children.push(child);
+	            }
+	            if (this.scanner.source[this.scanner.index] === '{') {
+	                var container = this.parseJSXExpressionContainer();
+	                children.push(container);
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        return children;
+	    };
+	    JSXParser.prototype.parseComplexJSXElement = function (el) {
+	        var stack = [];
+	        while (!this.scanner.eof()) {
+	            el.children = el.children.concat(this.parseJSXChildren());
+	            var node = this.createJSXChildNode();
+	            var element = this.parseJSXBoundaryElement();
+	            if (element.type === jsx_syntax_1.JSXSyntax.JSXOpeningElement) {
+	                var opening = element;
+	                if (opening.selfClosing) {
+	                    var child = this.finalize(node, new JSXNode.JSXElement(opening, [], null));
+	                    el.children.push(child);
+	                }
+	                else {
+	                    stack.push(el);
+	                    el = { node: node, opening: opening, closing: null, children: [] };
+	                }
+	            }
+	            if (element.type === jsx_syntax_1.JSXSyntax.JSXClosingElement) {
+	                el.closing = element;
+	                var open_1 = getQualifiedElementName(el.opening.name);
+	                var close_1 = getQualifiedElementName(el.closing.name);
+	                if (open_1 !== close_1) {
+	                    this.tolerateError('Expected corresponding JSX closing tag for %0', open_1);
+	                }
+	                if (stack.length > 0) {
+	                    var child = this.finalize(el.node, new JSXNode.JSXElement(el.opening, el.children, el.closing));
+	                    el = stack[stack.length - 1];
+	                    el.children.push(child);
+	                    stack.pop();
+	                }
+	                else {
+	                    break;
+	                }
+	            }
+	        }
+	        return el;
+	    };
+	    JSXParser.prototype.parseJSXElement = function () {
+	        var node = this.createJSXNode();
+	        var opening = this.parseJSXOpeningElement();
+	        var children = [];
+	        var closing = null;
+	        if (!opening.selfClosing) {
+	            var el = this.parseComplexJSXElement({ node: node, opening: opening, closing: closing, children: children });
+	            children = el.children;
+	            closing = el.closing;
+	        }
+	        return this.finalize(node, new JSXNode.JSXElement(opening, children, closing));
+	    };
+	    JSXParser.prototype.parseJSXRoot = function () {
+	        // Pop the opening '<' added from the lookahead.
+	        if (this.config.tokens) {
+	            this.tokens.pop();
+	        }
+	        this.startJSX();
+	        var element = this.parseJSXElement();
+	        this.finishJSX();
+	        return element;
+	    };
+	    JSXParser.prototype.isStartOfExpression = function () {
+	        return _super.prototype.isStartOfExpression.call(this) || this.match('<');
+	    };
+	    return JSXParser;
+	}(parser_1.Parser));
+	exports.JSXParser = JSXParser;
+
+
+/***/ },
+/* 4 */
+/***/ function(module, exports) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	// See also tools/generate-unicode-regex.js.
+	var Regex = {
+	    // Unicode v8.0.0 NonAsciiIdentifierStart:
+	    NonAsciiIdentifierStart: /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B4\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\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-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\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\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,
+	    // Unicode v8.0.0 NonAsciiIdentifierPart:
+	    NonAsciiIdentifierPart: /[\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF]/
+	};
+	exports.Character = {
+	    /* tslint:disable:no-bitwise */
+	    fromCodePoint: function (cp) {
+	        return (cp < 0x10000) ? String.fromCharCode(cp) :
+	            String.fromCharCode(0xD800 + ((cp - 0x10000) >> 10)) +
+	                String.fromCharCode(0xDC00 + ((cp - 0x10000) & 1023));
+	    },
+	    // https://tc39.github.io/ecma262/#sec-white-space
+	    isWhiteSpace: function (cp) {
+	        return (cp === 0x20) || (cp === 0x09) || (cp === 0x0B) || (cp === 0x0C) || (cp === 0xA0) ||
+	            (cp >= 0x1680 && [0x1680, 0x2000, 0x2001, 0x2002, 0x2003, 0x2004, 0x2005, 0x2006, 0x2007, 0x2008, 0x2009, 0x200A, 0x202F, 0x205F, 0x3000, 0xFEFF].indexOf(cp) >= 0);
+	    },
+	    // https://tc39.github.io/ecma262/#sec-line-terminators
+	    isLineTerminator: function (cp) {
+	        return (cp === 0x0A) || (cp === 0x0D) || (cp === 0x2028) || (cp === 0x2029);
+	    },
+	    // https://tc39.github.io/ecma262/#sec-names-and-keywords
+	    isIdentifierStart: function (cp) {
+	        return (cp === 0x24) || (cp === 0x5F) ||
+	            (cp >= 0x41 && cp <= 0x5A) ||
+	            (cp >= 0x61 && cp <= 0x7A) ||
+	            (cp === 0x5C) ||
+	            ((cp >= 0x80) && Regex.NonAsciiIdentifierStart.test(exports.Character.fromCodePoint(cp)));
+	    },
+	    isIdentifierPart: function (cp) {
+	        return (cp === 0x24) || (cp === 0x5F) ||
+	            (cp >= 0x41 && cp <= 0x5A) ||
+	            (cp >= 0x61 && cp <= 0x7A) ||
+	            (cp >= 0x30 && cp <= 0x39) ||
+	            (cp === 0x5C) ||
+	            ((cp >= 0x80) && Regex.NonAsciiIdentifierPart.test(exports.Character.fromCodePoint(cp)));
+	    },
+	    // https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+	    isDecimalDigit: function (cp) {
+	        return (cp >= 0x30 && cp <= 0x39); // 0..9
+	    },
+	    isHexDigit: function (cp) {
+	        return (cp >= 0x30 && cp <= 0x39) ||
+	            (cp >= 0x41 && cp <= 0x46) ||
+	            (cp >= 0x61 && cp <= 0x66); // a..f
+	    },
+	    isOctalDigit: function (cp) {
+	        return (cp >= 0x30 && cp <= 0x37); // 0..7
+	    }
+	};
+
+
+/***/ },
+/* 5 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var jsx_syntax_1 = __webpack_require__(6);
+	/* tslint:disable:max-classes-per-file */
+	var JSXClosingElement = (function () {
+	    function JSXClosingElement(name) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXClosingElement;
+	        this.name = name;
+	    }
+	    return JSXClosingElement;
+	}());
+	exports.JSXClosingElement = JSXClosingElement;
+	var JSXElement = (function () {
+	    function JSXElement(openingElement, children, closingElement) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXElement;
+	        this.openingElement = openingElement;
+	        this.children = children;
+	        this.closingElement = closingElement;
+	    }
+	    return JSXElement;
+	}());
+	exports.JSXElement = JSXElement;
+	var JSXEmptyExpression = (function () {
+	    function JSXEmptyExpression() {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXEmptyExpression;
+	    }
+	    return JSXEmptyExpression;
+	}());
+	exports.JSXEmptyExpression = JSXEmptyExpression;
+	var JSXExpressionContainer = (function () {
+	    function JSXExpressionContainer(expression) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXExpressionContainer;
+	        this.expression = expression;
+	    }
+	    return JSXExpressionContainer;
+	}());
+	exports.JSXExpressionContainer = JSXExpressionContainer;
+	var JSXIdentifier = (function () {
+	    function JSXIdentifier(name) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXIdentifier;
+	        this.name = name;
+	    }
+	    return JSXIdentifier;
+	}());
+	exports.JSXIdentifier = JSXIdentifier;
+	var JSXMemberExpression = (function () {
+	    function JSXMemberExpression(object, property) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXMemberExpression;
+	        this.object = object;
+	        this.property = property;
+	    }
+	    return JSXMemberExpression;
+	}());
+	exports.JSXMemberExpression = JSXMemberExpression;
+	var JSXAttribute = (function () {
+	    function JSXAttribute(name, value) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXAttribute;
+	        this.name = name;
+	        this.value = value;
+	    }
+	    return JSXAttribute;
+	}());
+	exports.JSXAttribute = JSXAttribute;
+	var JSXNamespacedName = (function () {
+	    function JSXNamespacedName(namespace, name) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXNamespacedName;
+	        this.namespace = namespace;
+	        this.name = name;
+	    }
+	    return JSXNamespacedName;
+	}());
+	exports.JSXNamespacedName = JSXNamespacedName;
+	var JSXOpeningElement = (function () {
+	    function JSXOpeningElement(name, selfClosing, attributes) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXOpeningElement;
+	        this.name = name;
+	        this.selfClosing = selfClosing;
+	        this.attributes = attributes;
+	    }
+	    return JSXOpeningElement;
+	}());
+	exports.JSXOpeningElement = JSXOpeningElement;
+	var JSXSpreadAttribute = (function () {
+	    function JSXSpreadAttribute(argument) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXSpreadAttribute;
+	        this.argument = argument;
+	    }
+	    return JSXSpreadAttribute;
+	}());
+	exports.JSXSpreadAttribute = JSXSpreadAttribute;
+	var JSXText = (function () {
+	    function JSXText(value, raw) {
+	        this.type = jsx_syntax_1.JSXSyntax.JSXText;
+	        this.value = value;
+	        this.raw = raw;
+	    }
+	    return JSXText;
+	}());
+	exports.JSXText = JSXText;
+
+
+/***/ },
+/* 6 */
+/***/ function(module, exports) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.JSXSyntax = {
+	    JSXAttribute: 'JSXAttribute',
+	    JSXClosingElement: 'JSXClosingElement',
+	    JSXElement: 'JSXElement',
+	    JSXEmptyExpression: 'JSXEmptyExpression',
+	    JSXExpressionContainer: 'JSXExpressionContainer',
+	    JSXIdentifier: 'JSXIdentifier',
+	    JSXMemberExpression: 'JSXMemberExpression',
+	    JSXNamespacedName: 'JSXNamespacedName',
+	    JSXOpeningElement: 'JSXOpeningElement',
+	    JSXSpreadAttribute: 'JSXSpreadAttribute',
+	    JSXText: 'JSXText'
+	};
+
+
+/***/ },
+/* 7 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var syntax_1 = __webpack_require__(2);
+	/* tslint:disable:max-classes-per-file */
+	var ArrayExpression = (function () {
+	    function ArrayExpression(elements) {
+	        this.type = syntax_1.Syntax.ArrayExpression;
+	        this.elements = elements;
+	    }
+	    return ArrayExpression;
+	}());
+	exports.ArrayExpression = ArrayExpression;
+	var ArrayPattern = (function () {
+	    function ArrayPattern(elements) {
+	        this.type = syntax_1.Syntax.ArrayPattern;
+	        this.elements = elements;
+	    }
+	    return ArrayPattern;
+	}());
+	exports.ArrayPattern = ArrayPattern;
+	var ArrowFunctionExpression = (function () {
+	    function ArrowFunctionExpression(params, body, expression) {
+	        this.type = syntax_1.Syntax.ArrowFunctionExpression;
+	        this.id = null;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = false;
+	        this.expression = expression;
+	        this.async = false;
+	    }
+	    return ArrowFunctionExpression;
+	}());
+	exports.ArrowFunctionExpression = ArrowFunctionExpression;
+	var AssignmentExpression = (function () {
+	    function AssignmentExpression(operator, left, right) {
+	        this.type = syntax_1.Syntax.AssignmentExpression;
+	        this.operator = operator;
+	        this.left = left;
+	        this.right = right;
+	    }
+	    return AssignmentExpression;
+	}());
+	exports.AssignmentExpression = AssignmentExpression;
+	var AssignmentPattern = (function () {
+	    function AssignmentPattern(left, right) {
+	        this.type = syntax_1.Syntax.AssignmentPattern;
+	        this.left = left;
+	        this.right = right;
+	    }
+	    return AssignmentPattern;
+	}());
+	exports.AssignmentPattern = AssignmentPattern;
+	var AsyncArrowFunctionExpression = (function () {
+	    function AsyncArrowFunctionExpression(params, body, expression) {
+	        this.type = syntax_1.Syntax.ArrowFunctionExpression;
+	        this.id = null;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = false;
+	        this.expression = expression;
+	        this.async = true;
+	    }
+	    return AsyncArrowFunctionExpression;
+	}());
+	exports.AsyncArrowFunctionExpression = AsyncArrowFunctionExpression;
+	var AsyncFunctionDeclaration = (function () {
+	    function AsyncFunctionDeclaration(id, params, body) {
+	        this.type = syntax_1.Syntax.FunctionDeclaration;
+	        this.id = id;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = false;
+	        this.expression = false;
+	        this.async = true;
+	    }
+	    return AsyncFunctionDeclaration;
+	}());
+	exports.AsyncFunctionDeclaration = AsyncFunctionDeclaration;
+	var AsyncFunctionExpression = (function () {
+	    function AsyncFunctionExpression(id, params, body) {
+	        this.type = syntax_1.Syntax.FunctionExpression;
+	        this.id = id;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = false;
+	        this.expression = false;
+	        this.async = true;
+	    }
+	    return AsyncFunctionExpression;
+	}());
+	exports.AsyncFunctionExpression = AsyncFunctionExpression;
+	var AwaitExpression = (function () {
+	    function AwaitExpression(argument) {
+	        this.type = syntax_1.Syntax.AwaitExpression;
+	        this.argument = argument;
+	    }
+	    return AwaitExpression;
+	}());
+	exports.AwaitExpression = AwaitExpression;
+	var BinaryExpression = (function () {
+	    function BinaryExpression(operator, left, right) {
+	        var logical = (operator === '||' || operator === '&&');
+	        this.type = logical ? syntax_1.Syntax.LogicalExpression : syntax_1.Syntax.BinaryExpression;
+	        this.operator = operator;
+	        this.left = left;
+	        this.right = right;
+	    }
+	    return BinaryExpression;
+	}());
+	exports.BinaryExpression = BinaryExpression;
+	var BlockStatement = (function () {
+	    function BlockStatement(body) {
+	        this.type = syntax_1.Syntax.BlockStatement;
+	        this.body = body;
+	    }
+	    return BlockStatement;
+	}());
+	exports.BlockStatement = BlockStatement;
+	var BreakStatement = (function () {
+	    function BreakStatement(label) {
+	        this.type = syntax_1.Syntax.BreakStatement;
+	        this.label = label;
+	    }
+	    return BreakStatement;
+	}());
+	exports.BreakStatement = BreakStatement;
+	var CallExpression = (function () {
+	    function CallExpression(callee, args) {
+	        this.type = syntax_1.Syntax.CallExpression;
+	        this.callee = callee;
+	        this.arguments = args;
+	    }
+	    return CallExpression;
+	}());
+	exports.CallExpression = CallExpression;
+	var CatchClause = (function () {
+	    function CatchClause(param, body) {
+	        this.type = syntax_1.Syntax.CatchClause;
+	        this.param = param;
+	        this.body = body;
+	    }
+	    return CatchClause;
+	}());
+	exports.CatchClause = CatchClause;
+	var ClassBody = (function () {
+	    function ClassBody(body) {
+	        this.type = syntax_1.Syntax.ClassBody;
+	        this.body = body;
+	    }
+	    return ClassBody;
+	}());
+	exports.ClassBody = ClassBody;
+	var ClassDeclaration = (function () {
+	    function ClassDeclaration(id, superClass, body) {
+	        this.type = syntax_1.Syntax.ClassDeclaration;
+	        this.id = id;
+	        this.superClass = superClass;
+	        this.body = body;
+	    }
+	    return ClassDeclaration;
+	}());
+	exports.ClassDeclaration = ClassDeclaration;
+	var ClassExpression = (function () {
+	    function ClassExpression(id, superClass, body) {
+	        this.type = syntax_1.Syntax.ClassExpression;
+	        this.id = id;
+	        this.superClass = superClass;
+	        this.body = body;
+	    }
+	    return ClassExpression;
+	}());
+	exports.ClassExpression = ClassExpression;
+	var ComputedMemberExpression = (function () {
+	    function ComputedMemberExpression(object, property) {
+	        this.type = syntax_1.Syntax.MemberExpression;
+	        this.computed = true;
+	        this.object = object;
+	        this.property = property;
+	    }
+	    return ComputedMemberExpression;
+	}());
+	exports.ComputedMemberExpression = ComputedMemberExpression;
+	var ConditionalExpression = (function () {
+	    function ConditionalExpression(test, consequent, alternate) {
+	        this.type = syntax_1.Syntax.ConditionalExpression;
+	        this.test = test;
+	        this.consequent = consequent;
+	        this.alternate = alternate;
+	    }
+	    return ConditionalExpression;
+	}());
+	exports.ConditionalExpression = ConditionalExpression;
+	var ContinueStatement = (function () {
+	    function ContinueStatement(label) {
+	        this.type = syntax_1.Syntax.ContinueStatement;
+	        this.label = label;
+	    }
+	    return ContinueStatement;
+	}());
+	exports.ContinueStatement = ContinueStatement;
+	var DebuggerStatement = (function () {
+	    function DebuggerStatement() {
+	        this.type = syntax_1.Syntax.DebuggerStatement;
+	    }
+	    return DebuggerStatement;
+	}());
+	exports.DebuggerStatement = DebuggerStatement;
+	var Directive = (function () {
+	    function Directive(expression, directive) {
+	        this.type = syntax_1.Syntax.ExpressionStatement;
+	        this.expression = expression;
+	        this.directive = directive;
+	    }
+	    return Directive;
+	}());
+	exports.Directive = Directive;
+	var DoWhileStatement = (function () {
+	    function DoWhileStatement(body, test) {
+	        this.type = syntax_1.Syntax.DoWhileStatement;
+	        this.body = body;
+	        this.test = test;
+	    }
+	    return DoWhileStatement;
+	}());
+	exports.DoWhileStatement = DoWhileStatement;
+	var EmptyStatement = (function () {
+	    function EmptyStatement() {
+	        this.type = syntax_1.Syntax.EmptyStatement;
+	    }
+	    return EmptyStatement;
+	}());
+	exports.EmptyStatement = EmptyStatement;
+	var ExportAllDeclaration = (function () {
+	    function ExportAllDeclaration(source) {
+	        this.type = syntax_1.Syntax.ExportAllDeclaration;
+	        this.source = source;
+	    }
+	    return ExportAllDeclaration;
+	}());
+	exports.ExportAllDeclaration = ExportAllDeclaration;
+	var ExportDefaultDeclaration = (function () {
+	    function ExportDefaultDeclaration(declaration) {
+	        this.type = syntax_1.Syntax.ExportDefaultDeclaration;
+	        this.declaration = declaration;
+	    }
+	    return ExportDefaultDeclaration;
+	}());
+	exports.ExportDefaultDeclaration = ExportDefaultDeclaration;
+	var ExportNamedDeclaration = (function () {
+	    function ExportNamedDeclaration(declaration, specifiers, source) {
+	        this.type = syntax_1.Syntax.ExportNamedDeclaration;
+	        this.declaration = declaration;
+	        this.specifiers = specifiers;
+	        this.source = source;
+	    }
+	    return ExportNamedDeclaration;
+	}());
+	exports.ExportNamedDeclaration = ExportNamedDeclaration;
+	var ExportSpecifier = (function () {
+	    function ExportSpecifier(local, exported) {
+	        this.type = syntax_1.Syntax.ExportSpecifier;
+	        this.exported = exported;
+	        this.local = local;
+	    }
+	    return ExportSpecifier;
+	}());
+	exports.ExportSpecifier = ExportSpecifier;
+	var ExpressionStatement = (function () {
+	    function ExpressionStatement(expression) {
+	        this.type = syntax_1.Syntax.ExpressionStatement;
+	        this.expression = expression;
+	    }
+	    return ExpressionStatement;
+	}());
+	exports.ExpressionStatement = ExpressionStatement;
+	var ForInStatement = (function () {
+	    function ForInStatement(left, right, body) {
+	        this.type = syntax_1.Syntax.ForInStatement;
+	        this.left = left;
+	        this.right = right;
+	        this.body = body;
+	        this.each = false;
+	    }
+	    return ForInStatement;
+	}());
+	exports.ForInStatement = ForInStatement;
+	var ForOfStatement = (function () {
+	    function ForOfStatement(left, right, body) {
+	        this.type = syntax_1.Syntax.ForOfStatement;
+	        this.left = left;
+	        this.right = right;
+	        this.body = body;
+	    }
+	    return ForOfStatement;
+	}());
+	exports.ForOfStatement = ForOfStatement;
+	var ForStatement = (function () {
+	    function ForStatement(init, test, update, body) {
+	        this.type = syntax_1.Syntax.ForStatement;
+	        this.init = init;
+	        this.test = test;
+	        this.update = update;
+	        this.body = body;
+	    }
+	    return ForStatement;
+	}());
+	exports.ForStatement = ForStatement;
+	var FunctionDeclaration = (function () {
+	    function FunctionDeclaration(id, params, body, generator) {
+	        this.type = syntax_1.Syntax.FunctionDeclaration;
+	        this.id = id;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = generator;
+	        this.expression = false;
+	        this.async = false;
+	    }
+	    return FunctionDeclaration;
+	}());
+	exports.FunctionDeclaration = FunctionDeclaration;
+	var FunctionExpression = (function () {
+	    function FunctionExpression(id, params, body, generator) {
+	        this.type = syntax_1.Syntax.FunctionExpression;
+	        this.id = id;
+	        this.params = params;
+	        this.body = body;
+	        this.generator = generator;
+	        this.expression = false;
+	        this.async = false;
+	    }
+	    return FunctionExpression;
+	}());
+	exports.FunctionExpression = FunctionExpression;
+	var Identifier = (function () {
+	    function Identifier(name) {
+	        this.type = syntax_1.Syntax.Identifier;
+	        this.name = name;
+	    }
+	    return Identifier;
+	}());
+	exports.Identifier = Identifier;
+	var IfStatement = (function () {
+	    function IfStatement(test, consequent, alternate) {
+	        this.type = syntax_1.Syntax.IfStatement;
+	        this.test = test;
+	        this.consequent = consequent;
+	        this.alternate = alternate;
+	    }
+	    return IfStatement;
+	}());
+	exports.IfStatement = IfStatement;
+	var ImportDeclaration = (function () {
+	    function ImportDeclaration(specifiers, source) {
+	        this.type = syntax_1.Syntax.ImportDeclaration;
+	        this.specifiers = specifiers;
+	        this.source = source;
+	    }
+	    return ImportDeclaration;
+	}());
+	exports.ImportDeclaration = ImportDeclaration;
+	var ImportDefaultSpecifier = (function () {
+	    function ImportDefaultSpecifier(local) {
+	        this.type = syntax_1.Syntax.ImportDefaultSpecifier;
+	        this.local = local;
+	    }
+	    return ImportDefaultSpecifier;
+	}());
+	exports.ImportDefaultSpecifier = ImportDefaultSpecifier;
+	var ImportNamespaceSpecifier = (function () {
+	    function ImportNamespaceSpecifier(local) {
+	        this.type = syntax_1.Syntax.ImportNamespaceSpecifier;
+	        this.local = local;
+	    }
+	    return ImportNamespaceSpecifier;
+	}());
+	exports.ImportNamespaceSpecifier = ImportNamespaceSpecifier;
+	var ImportSpecifier = (function () {
+	    function ImportSpecifier(local, imported) {
+	        this.type = syntax_1.Syntax.ImportSpecifier;
+	        this.local = local;
+	        this.imported = imported;
+	    }
+	    return ImportSpecifier;
+	}());
+	exports.ImportSpecifier = ImportSpecifier;
+	var LabeledStatement = (function () {
+	    function LabeledStatement(label, body) {
+	        this.type = syntax_1.Syntax.LabeledStatement;
+	        this.label = label;
+	        this.body = body;
+	    }
+	    return LabeledStatement;
+	}());
+	exports.LabeledStatement = LabeledStatement;
+	var Literal = (function () {
+	    function Literal(value, raw) {
+	        this.type = syntax_1.Syntax.Literal;
+	        this.value = value;
+	        this.raw = raw;
+	    }
+	    return Literal;
+	}());
+	exports.Literal = Literal;
+	var MetaProperty = (function () {
+	    function MetaProperty(meta, property) {
+	        this.type = syntax_1.Syntax.MetaProperty;
+	        this.meta = meta;
+	        this.property = property;
+	    }
+	    return MetaProperty;
+	}());
+	exports.MetaProperty = MetaProperty;
+	var MethodDefinition = (function () {
+	    function MethodDefinition(key, computed, value, kind, isStatic) {
+	        this.type = syntax_1.Syntax.MethodDefinition;
+	        this.key = key;
+	        this.computed = computed;
+	        this.value = value;
+	        this.kind = kind;
+	        this.static = isStatic;
+	    }
+	    return MethodDefinition;
+	}());
+	exports.MethodDefinition = MethodDefinition;
+	var Module = (function () {
+	    function Module(body) {
+	        this.type = syntax_1.Syntax.Program;
+	        this.body = body;
+	        this.sourceType = 'module';
+	    }
+	    return Module;
+	}());
+	exports.Module = Module;
+	var NewExpression = (function () {
+	    function NewExpression(callee, args) {
+	        this.type = syntax_1.Syntax.NewExpression;
+	        this.callee = callee;
+	        this.arguments = args;
+	    }
+	    return NewExpression;
+	}());
+	exports.NewExpression = NewExpression;
+	var ObjectExpression = (function () {
+	    function ObjectExpression(properties) {
+	        this.type = syntax_1.Syntax.ObjectExpression;
+	        this.properties = properties;
+	    }
+	    return ObjectExpression;
+	}());
+	exports.ObjectExpression = ObjectExpression;
+	var ObjectPattern = (function () {
+	    function ObjectPattern(properties) {
+	        this.type = syntax_1.Syntax.ObjectPattern;
+	        this.properties = properties;
+	    }
+	    return ObjectPattern;
+	}());
+	exports.ObjectPattern = ObjectPattern;
+	var Property = (function () {
+	    function Property(kind, key, computed, value, method, shorthand) {
+	        this.type = syntax_1.Syntax.Property;
+	        this.key = key;
+	        this.computed = computed;
+	        this.value = value;
+	        this.kind = kind;
+	        this.method = method;
+	        this.shorthand = shorthand;
+	    }
+	    return Property;
+	}());
+	exports.Property = Property;
+	var RegexLiteral = (function () {
+	    function RegexLiteral(value, raw, pattern, flags) {
+	        this.type = syntax_1.Syntax.Literal;
+	        this.value = value;
+	        this.raw = raw;
+	        this.regex = { pattern: pattern, flags: flags };
+	    }
+	    return RegexLiteral;
+	}());
+	exports.RegexLiteral = RegexLiteral;
+	var RestElement = (function () {
+	    function RestElement(argument) {
+	        this.type = syntax_1.Syntax.RestElement;
+	        this.argument = argument;
+	    }
+	    return RestElement;
+	}());
+	exports.RestElement = RestElement;
+	var ReturnStatement = (function () {
+	    function ReturnStatement(argument) {
+	        this.type = syntax_1.Syntax.ReturnStatement;
+	        this.argument = argument;
+	    }
+	    return ReturnStatement;
+	}());
+	exports.ReturnStatement = ReturnStatement;
+	var Script = (function () {
+	    function Script(body) {
+	        this.type = syntax_1.Syntax.Program;
+	        this.body = body;
+	        this.sourceType = 'script';
+	    }
+	    return Script;
+	}());
+	exports.Script = Script;
+	var SequenceExpression = (function () {
+	    function SequenceExpression(expressions) {
+	        this.type = syntax_1.Syntax.SequenceExpression;
+	        this.expressions = expressions;
+	    }
+	    return SequenceExpression;
+	}());
+	exports.SequenceExpression = SequenceExpression;
+	var SpreadElement = (function () {
+	    function SpreadElement(argument) {
+	        this.type = syntax_1.Syntax.SpreadElement;
+	        this.argument = argument;
+	    }
+	    return SpreadElement;
+	}());
+	exports.SpreadElement = SpreadElement;
+	var StaticMemberExpression = (function () {
+	    function StaticMemberExpression(object, property) {
+	        this.type = syntax_1.Syntax.MemberExpression;
+	        this.computed = false;
+	        this.object = object;
+	        this.property = property;
+	    }
+	    return StaticMemberExpression;
+	}());
+	exports.StaticMemberExpression = StaticMemberExpression;
+	var Super = (function () {
+	    function Super() {
+	        this.type = syntax_1.Syntax.Super;
+	    }
+	    return Super;
+	}());
+	exports.Super = Super;
+	var SwitchCase = (function () {
+	    function SwitchCase(test, consequent) {
+	        this.type = syntax_1.Syntax.SwitchCase;
+	        this.test = test;
+	        this.consequent = consequent;
+	    }
+	    return SwitchCase;
+	}());
+	exports.SwitchCase = SwitchCase;
+	var SwitchStatement = (function () {
+	    function SwitchStatement(discriminant, cases) {
+	        this.type = syntax_1.Syntax.SwitchStatement;
+	        this.discriminant = discriminant;
+	        this.cases = cases;
+	    }
+	    return SwitchStatement;
+	}());
+	exports.SwitchStatement = SwitchStatement;
+	var TaggedTemplateExpression = (function () {
+	    function TaggedTemplateExpression(tag, quasi) {
+	        this.type = syntax_1.Syntax.TaggedTemplateExpression;
+	        this.tag = tag;
+	        this.quasi = quasi;
+	    }
+	    return TaggedTemplateExpression;
+	}());
+	exports.TaggedTemplateExpression = TaggedTemplateExpression;
+	var TemplateElement = (function () {
+	    function TemplateElement(value, tail) {
+	        this.type = syntax_1.Syntax.TemplateElement;
+	        this.value = value;
+	        this.tail = tail;
+	    }
+	    return TemplateElement;
+	}());
+	exports.TemplateElement = TemplateElement;
+	var TemplateLiteral = (function () {
+	    function TemplateLiteral(quasis, expressions) {
+	        this.type = syntax_1.Syntax.TemplateLiteral;
+	        this.quasis = quasis;
+	        this.expressions = expressions;
+	    }
+	    return TemplateLiteral;
+	}());
+	exports.TemplateLiteral = TemplateLiteral;
+	var ThisExpression = (function () {
+	    function ThisExpression() {
+	        this.type = syntax_1.Syntax.ThisExpression;
+	    }
+	    return ThisExpression;
+	}());
+	exports.ThisExpression = ThisExpression;
+	var ThrowStatement = (function () {
+	    function ThrowStatement(argument) {
+	        this.type = syntax_1.Syntax.ThrowStatement;
+	        this.argument = argument;
+	    }
+	    return ThrowStatement;
+	}());
+	exports.ThrowStatement = ThrowStatement;
+	var TryStatement = (function () {
+	    function TryStatement(block, handler, finalizer) {
+	        this.type = syntax_1.Syntax.TryStatement;
+	        this.block = block;
+	        this.handler = handler;
+	        this.finalizer = finalizer;
+	    }
+	    return TryStatement;
+	}());
+	exports.TryStatement = TryStatement;
+	var UnaryExpression = (function () {
+	    function UnaryExpression(operator, argument) {
+	        this.type = syntax_1.Syntax.UnaryExpression;
+	        this.operator = operator;
+	        this.argument = argument;
+	        this.prefix = true;
+	    }
+	    return UnaryExpression;
+	}());
+	exports.UnaryExpression = UnaryExpression;
+	var UpdateExpression = (function () {
+	    function UpdateExpression(operator, argument, prefix) {
+	        this.type = syntax_1.Syntax.UpdateExpression;
+	        this.operator = operator;
+	        this.argument = argument;
+	        this.prefix = prefix;
+	    }
+	    return UpdateExpression;
+	}());
+	exports.UpdateExpression = UpdateExpression;
+	var VariableDeclaration = (function () {
+	    function VariableDeclaration(declarations, kind) {
+	        this.type = syntax_1.Syntax.VariableDeclaration;
+	        this.declarations = declarations;
+	        this.kind = kind;
+	    }
+	    return VariableDeclaration;
+	}());
+	exports.VariableDeclaration = VariableDeclaration;
+	var VariableDeclarator = (function () {
+	    function VariableDeclarator(id, init) {
+	        this.type = syntax_1.Syntax.VariableDeclarator;
+	        this.id = id;
+	        this.init = init;
+	    }
+	    return VariableDeclarator;
+	}());
+	exports.VariableDeclarator = VariableDeclarator;
+	var WhileStatement = (function () {
+	    function WhileStatement(test, body) {
+	        this.type = syntax_1.Syntax.WhileStatement;
+	        this.test = test;
+	        this.body = body;
+	    }
+	    return WhileStatement;
+	}());
+	exports.WhileStatement = WhileStatement;
+	var WithStatement = (function () {
+	    function WithStatement(object, body) {
+	        this.type = syntax_1.Syntax.WithStatement;
+	        this.object = object;
+	        this.body = body;
+	    }
+	    return WithStatement;
+	}());
+	exports.WithStatement = WithStatement;
+	var YieldExpression = (function () {
+	    function YieldExpression(argument, delegate) {
+	        this.type = syntax_1.Syntax.YieldExpression;
+	        this.argument = argument;
+	        this.delegate = delegate;
+	    }
+	    return YieldExpression;
+	}());
+	exports.YieldExpression = YieldExpression;
+
+
+/***/ },
+/* 8 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __webpack_require__(9);
+	var error_handler_1 = __webpack_require__(10);
+	var messages_1 = __webpack_require__(11);
+	var Node = __webpack_require__(7);
+	var scanner_1 = __webpack_require__(12);
+	var syntax_1 = __webpack_require__(2);
+	var token_1 = __webpack_require__(13);
+	var ArrowParameterPlaceHolder = 'ArrowParameterPlaceHolder';
+	var Parser = (function () {
+	    function Parser(code, options, delegate) {
+	        if (options === void 0) { options = {}; }
+	        this.config = {
+	            range: (typeof options.range === 'boolean') && options.range,
+	            loc: (typeof options.loc === 'boolean') && options.loc,
+	            source: null,
+	            tokens: (typeof options.tokens === 'boolean') && options.tokens,
+	            comment: (typeof options.comment === 'boolean') && options.comment,
+	            tolerant: (typeof options.tolerant === 'boolean') && options.tolerant
+	        };
+	        if (this.config.loc && options.source && options.source !== null) {
+	            this.config.source = String(options.source);
+	        }
+	        this.delegate = delegate;
+	        this.errorHandler = new error_handler_1.ErrorHandler();
+	        this.errorHandler.tolerant = this.config.tolerant;
+	        this.scanner = new scanner_1.Scanner(code, this.errorHandler);
+	        this.scanner.trackComment = this.config.comment;
+	        this.operatorPrecedence = {
+	            ')': 0,
+	            ';': 0,
+	            ',': 0,
+	            '=': 0,
+	            ']': 0,
+	            '||': 1,
+	            '&&': 2,
+	            '|': 3,
+	            '^': 4,
+	            '&': 5,
+	            '==': 6,
+	            '!=': 6,
+	            '===': 6,
+	            '!==': 6,
+	            '<': 7,
+	            '>': 7,
+	            '<=': 7,
+	            '>=': 7,
+	            '<<': 8,
+	            '>>': 8,
+	            '>>>': 8,
+	            '+': 9,
+	            '-': 9,
+	            '*': 11,
+	            '/': 11,
+	            '%': 11
+	        };
+	        this.lookahead = {
+	            type: 2 /* EOF */,
+	            value: '',
+	            lineNumber: this.scanner.lineNumber,
+	            lineStart: 0,
+	            start: 0,
+	            end: 0
+	        };
+	        this.hasLineTerminator = false;
+	        this.context = {
+	            isModule: false,
+	            await: false,
+	            allowIn: true,
+	            allowStrictDirective: true,
+	            allowYield: true,
+	            firstCoverInitializedNameError: null,
+	            isAssignmentTarget: false,
+	            isBindingElement: false,
+	            inFunctionBody: false,
+	            inIteration: false,
+	            inSwitch: false,
+	            labelSet: {},
+	            strict: false
+	        };
+	        this.tokens = [];
+	        this.startMarker = {
+	            index: 0,
+	            line: this.scanner.lineNumber,
+	            column: 0
+	        };
+	        this.lastMarker = {
+	            index: 0,
+	            line: this.scanner.lineNumber,
+	            column: 0
+	        };
+	        this.nextToken();
+	        this.lastMarker = {
+	            index: this.scanner.index,
+	            line: this.scanner.lineNumber,
+	            column: this.scanner.index - this.scanner.lineStart
+	        };
+	    }
+	    Parser.prototype.throwError = function (messageFormat) {
+	        var values = [];
+	        for (var _i = 1; _i < arguments.length; _i++) {
+	            values[_i - 1] = arguments[_i];
+	        }
+	        var args = Array.prototype.slice.call(arguments, 1);
+	        var msg = messageFormat.replace(/%(\d)/g, function (whole, idx) {
+	            assert_1.assert(idx < args.length, 'Message reference must be in range');
+	            return args[idx];
+	        });
+	        var index = this.lastMarker.index;
+	        var line = this.lastMarker.line;
+	        var column = this.lastMarker.column + 1;
+	        throw this.errorHandler.createError(index, line, column, msg);
+	    };
+	    Parser.prototype.tolerateError = function (messageFormat) {
+	        var values = [];
+	        for (var _i = 1; _i < arguments.length; _i++) {
+	            values[_i - 1] = arguments[_i];
+	        }
+	        var args = Array.prototype.slice.call(arguments, 1);
+	        var msg = messageFormat.replace(/%(\d)/g, function (whole, idx) {
+	            assert_1.assert(idx < args.length, 'Message reference must be in range');
+	            return args[idx];
+	        });
+	        var index = this.lastMarker.index;
+	        var line = this.scanner.lineNumber;
+	        var column = this.lastMarker.column + 1;
+	        this.errorHandler.tolerateError(index, line, column, msg);
+	    };
+	    // Throw an exception because of the token.
+	    Parser.prototype.unexpectedTokenError = function (token, message) {
+	        var msg = message || messages_1.Messages.UnexpectedToken;
+	        var value;
+	        if (token) {
+	            if (!message) {
+	                msg = (token.type === 2 /* EOF */) ? messages_1.Messages.UnexpectedEOS :
+	                    (token.type === 3 /* Identifier */) ? messages_1.Messages.UnexpectedIdentifier :
+	                        (token.type === 6 /* NumericLiteral */) ? messages_1.Messages.UnexpectedNumber :
+	                            (token.type === 8 /* StringLiteral */) ? messages_1.Messages.UnexpectedString :
+	                                (token.type === 10 /* Template */) ? messages_1.Messages.UnexpectedTemplate :
+	                                    messages_1.Messages.UnexpectedToken;
+	                if (token.type === 4 /* Keyword */) {
+	                    if (this.scanner.isFutureReservedWord(token.value)) {
+	                        msg = messages_1.Messages.UnexpectedReserved;
+	                    }
+	                    else if (this.context.strict && this.scanner.isStrictModeReservedWord(token.value)) {
+	                        msg = messages_1.Messages.StrictReservedWord;
+	                    }
+	                }
+	            }
+	            value = token.value;
+	        }
+	        else {
+	            value = 'ILLEGAL';
+	        }
+	        msg = msg.replace('%0', value);
+	        if (token && typeof token.lineNumber === 'number') {
+	            var index = token.start;
+	            var line = token.lineNumber;
+	            var lastMarkerLineStart = this.lastMarker.index - this.lastMarker.column;
+	            var column = token.start - lastMarkerLineStart + 1;
+	            return this.errorHandler.createError(index, line, column, msg);
+	        }
+	        else {
+	            var index = this.lastMarker.index;
+	            var line = this.lastMarker.line;
+	            var column = this.lastMarker.column + 1;
+	            return this.errorHandler.createError(index, line, column, msg);
+	        }
+	    };
+	    Parser.prototype.throwUnexpectedToken = function (token, message) {
+	        throw this.unexpectedTokenError(token, message);
+	    };
+	    Parser.prototype.tolerateUnexpectedToken = function (token, message) {
+	        this.errorHandler.tolerate(this.unexpectedTokenError(token, message));
+	    };
+	    Parser.prototype.collectComments = function () {
+	        if (!this.config.comment) {
+	            this.scanner.scanComments();
+	        }
+	        else {
+	            var comments = this.scanner.scanComments();
+	            if (comments.length > 0 && this.delegate) {
+	                for (var i = 0; i < comments.length; ++i) {
+	                    var e = comments[i];
+	                    var node = void 0;
+	                    node = {
+	                        type: e.multiLine ? 'BlockComment' : 'LineComment',
+	                        value: this.scanner.source.slice(e.slice[0], e.slice[1])
+	                    };
+	                    if (this.config.range) {
+	                        node.range = e.range;
+	                    }
+	                    if (this.config.loc) {
+	                        node.loc = e.loc;
+	                    }
+	                    var metadata = {
+	                        start: {
+	                            line: e.loc.start.line,
+	                            column: e.loc.start.column,
+	                            offset: e.range[0]
+	                        },
+	                        end: {
+	                            line: e.loc.end.line,
+	                            column: e.loc.end.column,
+	                            offset: e.range[1]
+	                        }
+	                    };
+	                    this.delegate(node, metadata);
+	                }
+	            }
+	        }
+	    };
+	    // From internal representation to an external structure
+	    Parser.prototype.getTokenRaw = function (token) {
+	        return this.scanner.source.slice(token.start, token.end);
+	    };
+	    Parser.prototype.convertToken = function (token) {
+	        var t = {
+	            type: token_1.TokenName[token.type],
+	            value: this.getTokenRaw(token)
+	        };
+	        if (this.config.range) {
+	            t.range = [token.start, token.end];
+	        }
+	        if (this.config.loc) {
+	            t.loc = {
+	                start: {
+	                    line: this.startMarker.line,
+	                    column: this.startMarker.column
+	                },
+	                end: {
+	                    line: this.scanner.lineNumber,
+	                    column: this.scanner.index - this.scanner.lineStart
+	                }
+	            };
+	        }
+	        if (token.type === 9 /* RegularExpression */) {
+	            var pattern = token.pattern;
+	            var flags = token.flags;
+	            t.regex = { pattern: pattern, flags: flags };
+	        }
+	        return t;
+	    };
+	    Parser.prototype.nextToken = function () {
+	        var token = this.lookahead;
+	        this.lastMarker.index = this.scanner.index;
+	        this.lastMarker.line = this.scanner.lineNumber;
+	        this.lastMarker.column = this.scanner.index - this.scanner.lineStart;
+	        this.collectComments();
+	        if (this.scanner.index !== this.startMarker.index) {
+	            this.startMarker.index = this.scanner.index;
+	            this.startMarker.line = this.scanner.lineNumber;
+	            this.startMarker.column = this.scanner.index - this.scanner.lineStart;
+	        }
+	        var next = this.scanner.lex();
+	        this.hasLineTerminator = (token.lineNumber !== next.lineNumber);
+	        if (next && this.context.strict && next.type === 3 /* Identifier */) {
+	            if (this.scanner.isStrictModeReservedWord(next.value)) {
+	                next.type = 4 /* Keyword */;
+	            }
+	        }
+	        this.lookahead = next;
+	        if (this.config.tokens && next.type !== 2 /* EOF */) {
+	            this.tokens.push(this.convertToken(next));
+	        }
+	        return token;
+	    };
+	    Parser.prototype.nextRegexToken = function () {
+	        this.collectComments();
+	        var token = this.scanner.scanRegExp();
+	        if (this.config.tokens) {
+	            // Pop the previous token, '/' or '/='
+	            // This is added from the lookahead token.
+	            this.tokens.pop();
+	            this.tokens.push(this.convertToken(token));
+	        }
+	        // Prime the next lookahead.
+	        this.lookahead = token;
+	        this.nextToken();
+	        return token;
+	    };
+	    Parser.prototype.createNode = function () {
+	        return {
+	            index: this.startMarker.index,
+	            line: this.startMarker.line,
+	            column: this.startMarker.column
+	        };
+	    };
+	    Parser.prototype.startNode = function (token, lastLineStart) {
+	        if (lastLineStart === void 0) { lastLineStart = 0; }
+	        var column = token.start - token.lineStart;
+	        var line = token.lineNumber;
+	        if (column < 0) {
+	            column += lastLineStart;
+	            line--;
+	        }
+	        return {
+	            index: token.start,
+	            line: line,
+	            column: column
+	        };
+	    };
+	    Parser.prototype.finalize = function (marker, node) {
+	        if (this.config.range) {
+	            node.range = [marker.index, this.lastMarker.index];
+	        }
+	        if (this.config.loc) {
+	            node.loc = {
+	                start: {
+	                    line: marker.line,
+	                    column: marker.column,
+	                },
+	                end: {
+	                    line: this.lastMarker.line,
+	                    column: this.lastMarker.column
+	                }
+	            };
+	            if (this.config.source) {
+	                node.loc.source = this.config.source;
+	            }
+	        }
+	        if (this.delegate) {
+	            var metadata = {
+	                start: {
+	                    line: marker.line,
+	                    column: marker.column,
+	                    offset: marker.index
+	                },
+	                end: {
+	                    line: this.lastMarker.line,
+	                    column: this.lastMarker.column,
+	                    offset: this.lastMarker.index
+	                }
+	            };
+	            this.delegate(node, metadata);
+	        }
+	        return node;
+	    };
+	    // Expect the next token to match the specified punctuator.
+	    // If not, an exception will be thrown.
+	    Parser.prototype.expect = function (value) {
+	        var token = this.nextToken();
+	        if (token.type !== 7 /* Punctuator */ || token.value !== value) {
+	            this.throwUnexpectedToken(token);
+	        }
+	    };
+	    // Quietly expect a comma when in tolerant mode, otherwise delegates to expect().
+	    Parser.prototype.expectCommaSeparator = function () {
+	        if (this.config.tolerant) {
+	            var token = this.lookahead;
+	            if (token.type === 7 /* Punctuator */ && token.value === ',') {
+	                this.nextToken();
+	            }
+	            else if (token.type === 7 /* Punctuator */ && token.value === ';') {
+	                this.nextToken();
+	                this.tolerateUnexpectedToken(token);
+	            }
+	            else {
+	                this.tolerateUnexpectedToken(token, messages_1.Messages.UnexpectedToken);
+	            }
+	        }
+	        else {
+	            this.expect(',');
+	        }
+	    };
+	    // Expect the next token to match the specified keyword.
+	    // If not, an exception will be thrown.
+	    Parser.prototype.expectKeyword = function (keyword) {
+	        var token = this.nextToken();
+	        if (token.type !== 4 /* Keyword */ || token.value !== keyword) {
+	            this.throwUnexpectedToken(token);
+	        }
+	    };
+	    // Return true if the next token matches the specified punctuator.
+	    Parser.prototype.match = function (value) {
+	        return this.lookahead.type === 7 /* Punctuator */ && this.lookahead.value === value;
+	    };
+	    // Return true if the next token matches the specified keyword
+	    Parser.prototype.matchKeyword = function (keyword) {
+	        return this.lookahead.type === 4 /* Keyword */ && this.lookahead.value === keyword;
+	    };
+	    // Return true if the next token matches the specified contextual keyword
+	    // (where an identifier is sometimes a keyword depending on the context)
+	    Parser.prototype.matchContextualKeyword = function (keyword) {
+	        return this.lookahead.type === 3 /* Identifier */ && this.lookahead.value === keyword;
+	    };
+	    // Return true if the next token is an assignment operator
+	    Parser.prototype.matchAssign = function () {
+	        if (this.lookahead.type !== 7 /* Punctuator */) {
+	            return false;
+	        }
+	        var op = this.lookahead.value;
+	        return op === '=' ||
+	            op === '*=' ||
+	            op === '**=' ||
+	            op === '/=' ||
+	            op === '%=' ||
+	            op === '+=' ||
+	            op === '-=' ||
+	            op === '<<=' ||
+	            op === '>>=' ||
+	            op === '>>>=' ||
+	            op === '&=' ||
+	            op === '^=' ||
+	            op === '|=';
+	    };
+	    // Cover grammar support.
+	    //
+	    // When an assignment expression position starts with an left parenthesis, the determination of the type
+	    // of the syntax is to be deferred arbitrarily long until the end of the parentheses pair (plus a lookahead)
+	    // or the first comma. This situation also defers the determination of all the expressions nested in the pair.
+	    //
+	    // There are three productions that can be parsed in a parentheses pair that needs to be determined
+	    // after the outermost pair is closed. They are:
+	    //
+	    //   1. AssignmentExpression
+	    //   2. BindingElements
+	    //   3. AssignmentTargets
+	    //
+	    // In order to avoid exponential backtracking, we use two flags to denote if the production can be
+	    // binding element or assignment target.
+	    //
+	    // The three productions have the relationship:
+	    //
+	    //   BindingElements ⊆ AssignmentTargets ⊆ AssignmentExpression
+	    //
+	    // with a single exception that CoverInitializedName when used directly in an Expression, generates
+	    // an early error. Therefore, we need the third state, firstCoverInitializedNameError, to track the
+	    // first usage of CoverInitializedName and report it when we reached the end of the parentheses pair.
+	    //
+	    // isolateCoverGrammar function runs the given parser function with a new cover grammar context, and it does not
+	    // effect the current flags. This means the production the parser parses is only used as an expression. Therefore
+	    // the CoverInitializedName check is conducted.
+	    //
+	    // inheritCoverGrammar function runs the given parse function with a new cover grammar context, and it propagates
+	    // the flags outside of the parser. This means the production the parser parses is used as a part of a potential
+	    // pattern. The CoverInitializedName check is deferred.
+	    Parser.prototype.isolateCoverGrammar = function (parseFunction) {
+	        var previousIsBindingElement = this.context.isBindingElement;
+	        var previousIsAssignmentTarget = this.context.isAssignmentTarget;
+	        var previousFirstCoverInitializedNameError = this.context.firstCoverInitializedNameError;
+	        this.context.isBindingElement = true;
+	        this.context.isAssignmentTarget = true;
+	        this.context.firstCoverInitializedNameError = null;
+	        var result = parseFunction.call(this);
+	        if (this.context.firstCoverInitializedNameError !== null) {
+	            this.throwUnexpectedToken(this.context.firstCoverInitializedNameError);
+	        }
+	        this.context.isBindingElement = previousIsBindingElement;
+	        this.context.isAssignmentTarget = previousIsAssignmentTarget;
+	        this.context.firstCoverInitializedNameError = previousFirstCoverInitializedNameError;
+	        return result;
+	    };
+	    Parser.prototype.inheritCoverGrammar = function (parseFunction) {
+	        var previousIsBindingElement = this.context.isBindingElement;
+	        var previousIsAssignmentTarget = this.context.isAssignmentTarget;
+	        var previousFirstCoverInitializedNameError = this.context.firstCoverInitializedNameError;
+	        this.context.isBindingElement = true;
+	        this.context.isAssignmentTarget = true;
+	        this.context.firstCoverInitializedNameError = null;
+	        var result = parseFunction.call(this);
+	        this.context.isBindingElement = this.context.isBindingElement && previousIsBindingElement;
+	        this.context.isAssignmentTarget = this.context.isAssignmentTarget && previousIsAssignmentTarget;
+	        this.context.firstCoverInitializedNameError = previousFirstCoverInitializedNameError || this.context.firstCoverInitializedNameError;
+	        return result;
+	    };
+	    Parser.prototype.consumeSemicolon = function () {
+	        if (this.match(';')) {
+	            this.nextToken();
+	        }
+	        else if (!this.hasLineTerminator) {
+	            if (this.lookahead.type !== 2 /* EOF */ && !this.match('}')) {
+	                this.throwUnexpectedToken(this.lookahead);
+	            }
+	            this.lastMarker.index = this.startMarker.index;
+	            this.lastMarker.line = this.startMarker.line;
+	            this.lastMarker.column = this.startMarker.column;
+	        }
+	    };
+	    // https://tc39.github.io/ecma262/#sec-primary-expression
+	    Parser.prototype.parsePrimaryExpression = function () {
+	        var node = this.createNode();
+	        var expr;
+	        var token, raw;
+	        switch (this.lookahead.type) {
+	            case 3 /* Identifier */:
+	                if ((this.context.isModule || this.context.await) && this.lookahead.value === 'await') {
+	                    this.tolerateUnexpectedToken(this.lookahead);
+	                }
+	                expr = this.matchAsyncFunction() ? this.parseFunctionExpression() : this.finalize(node, new Node.Identifier(this.nextToken().value));
+	                break;
+	            case 6 /* NumericLiteral */:
+	            case 8 /* StringLiteral */:
+	                if (this.context.strict && this.lookahead.octal) {
+	                    this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.StrictOctalLiteral);
+	                }
+	                this.context.isAssignmentTarget = false;
+	                this.context.isBindingElement = false;
+	                token = this.nextToken();
+	                raw = this.getTokenRaw(token);
+	                expr = this.finalize(node, new Node.Literal(token.value, raw));
+	                break;
+	            case 1 /* BooleanLiteral */:
+	                this.context.isAssignmentTarget = false;
+	                this.context.isBindingElement = false;
+	                token = this.nextToken();
+	                raw = this.getTokenRaw(token);
+	                expr = this.finalize(node, new Node.Literal(token.value === 'true', raw));
+	                break;
+	            case 5 /* NullLiteral */:
+	                this.context.isAssignmentTarget = false;
+	                this.context.isBindingElement = false;
+	                token = this.nextToken();
+	                raw = this.getTokenRaw(token);
+	                expr = this.finalize(node, new Node.Literal(null, raw));
+	                break;
+	            case 10 /* Template */:
+	                expr = this.parseTemplateLiteral();
+	                break;
+	            case 7 /* Punctuator */:
+	                switch (this.lookahead.value) {
+	                    case '(':
+	                        this.context.isBindingElement = false;
+	                        expr = this.inheritCoverGrammar(this.parseGroupExpression);
+	                        break;
+	                    case '[':
+	                        expr = this.inheritCoverGrammar(this.parseArrayInitializer);
+	                        break;
+	                    case '{':
+	                        expr = this.inheritCoverGrammar(this.parseObjectInitializer);
+	                        break;
+	                    case '/':
+	                    case '/=':
+	                        this.context.isAssignmentTarget = false;
+	                        this.context.isBindingElement = false;
+	                        this.scanner.index = this.startMarker.index;
+	                        token = this.nextRegexToken();
+	                        raw = this.getTokenRaw(token);
+	                        expr = this.finalize(node, new Node.RegexLiteral(token.regex, raw, token.pattern, token.flags));
+	                        break;
+	                    default:
+	                        expr = this.throwUnexpectedToken(this.nextToken());
+	                }
+	                break;
+	            case 4 /* Keyword */:
+	                if (!this.context.strict && this.context.allowYield && this.matchKeyword('yield')) {
+	                    expr = this.parseIdentifierName();
+	                }
+	                else if (!this.context.strict && this.matchKeyword('let')) {
+	                    expr = this.finalize(node, new Node.Identifier(this.nextToken().value));
+	                }
+	                else {
+	                    this.context.isAssignmentTarget = false;
+	                    this.context.isBindingElement = false;
+	                    if (this.matchKeyword('function')) {
+	                        expr = this.parseFunctionExpression();
+	                    }
+	                    else if (this.matchKeyword('this')) {
+	                        this.nextToken();
+	                        expr = this.finalize(node, new Node.ThisExpression());
+	                    }
+	                    else if (this.matchKeyword('class')) {
+	                        expr = this.parseClassExpression();
+	                    }
+	                    else {
+	                        expr = this.throwUnexpectedToken(this.nextToken());
+	                    }
+	                }
+	                break;
+	            default:
+	                expr = this.throwUnexpectedToken(this.nextToken());
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-array-initializer
+	    Parser.prototype.parseSpreadElement = function () {
+	        var node = this.createNode();
+	        this.expect('...');
+	        var arg = this.inheritCoverGrammar(this.parseAssignmentExpression);
+	        return this.finalize(node, new Node.SpreadElement(arg));
+	    };
+	    Parser.prototype.parseArrayInitializer = function () {
+	        var node = this.createNode();
+	        var elements = [];
+	        this.expect('[');
+	        while (!this.match(']')) {
+	            if (this.match(',')) {
+	                this.nextToken();
+	                elements.push(null);
+	            }
+	            else if (this.match('...')) {
+	                var element = this.parseSpreadElement();
+	                if (!this.match(']')) {
+	                    this.context.isAssignmentTarget = false;
+	                    this.context.isBindingElement = false;
+	                    this.expect(',');
+	                }
+	                elements.push(element);
+	            }
+	            else {
+	                elements.push(this.inheritCoverGrammar(this.parseAssignmentExpression));
+	                if (!this.match(']')) {
+	                    this.expect(',');
+	                }
+	            }
+	        }
+	        this.expect(']');
+	        return this.finalize(node, new Node.ArrayExpression(elements));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-object-initializer
+	    Parser.prototype.parsePropertyMethod = function (params) {
+	        this.context.isAssignmentTarget = false;
+	        this.context.isBindingElement = false;
+	        var previousStrict = this.context.strict;
+	        var previousAllowStrictDirective = this.context.allowStrictDirective;
+	        this.context.allowStrictDirective = params.simple;
+	        var body = this.isolateCoverGrammar(this.parseFunctionSourceElements);
+	        if (this.context.strict && params.firstRestricted) {
+	            this.tolerateUnexpectedToken(params.firstRestricted, params.message);
+	        }
+	        if (this.context.strict && params.stricted) {
+	            this.tolerateUnexpectedToken(params.stricted, params.message);
+	        }
+	        this.context.strict = previousStrict;
+	        this.context.allowStrictDirective = previousAllowStrictDirective;
+	        return body;
+	    };
+	    Parser.prototype.parsePropertyMethodFunction = function () {
+	        var isGenerator = false;
+	        var node = this.createNode();
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.allowYield = true;
+	        var params = this.parseFormalParameters();
+	        var method = this.parsePropertyMethod(params);
+	        this.context.allowYield = previousAllowYield;
+	        return this.finalize(node, new Node.FunctionExpression(null, params.params, method, isGenerator));
+	    };
+	    Parser.prototype.parsePropertyMethodAsyncFunction = function () {
+	        var node = this.createNode();
+	        var previousAllowYield = this.context.allowYield;
+	        var previousAwait = this.context.await;
+	        this.context.allowYield = false;
+	        this.context.await = true;
+	        var params = this.parseFormalParameters();
+	        var method = this.parsePropertyMethod(params);
+	        this.context.allowYield = previousAllowYield;
+	        this.context.await = previousAwait;
+	        return this.finalize(node, new Node.AsyncFunctionExpression(null, params.params, method));
+	    };
+	    Parser.prototype.parseObjectPropertyKey = function () {
+	        var node = this.createNode();
+	        var token = this.nextToken();
+	        var key;
+	        switch (token.type) {
+	            case 8 /* StringLiteral */:
+	            case 6 /* NumericLiteral */:
+	                if (this.context.strict && token.octal) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictOctalLiteral);
+	                }
+	                var raw = this.getTokenRaw(token);
+	                key = this.finalize(node, new Node.Literal(token.value, raw));
+	                break;
+	            case 3 /* Identifier */:
+	            case 1 /* BooleanLiteral */:
+	            case 5 /* NullLiteral */:
+	            case 4 /* Keyword */:
+	                key = this.finalize(node, new Node.Identifier(token.value));
+	                break;
+	            case 7 /* Punctuator */:
+	                if (token.value === '[') {
+	                    key = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                    this.expect(']');
+	                }
+	                else {
+	                    key = this.throwUnexpectedToken(token);
+	                }
+	                break;
+	            default:
+	                key = this.throwUnexpectedToken(token);
+	        }
+	        return key;
+	    };
+	    Parser.prototype.isPropertyKey = function (key, value) {
+	        return (key.type === syntax_1.Syntax.Identifier && key.name === value) ||
+	            (key.type === syntax_1.Syntax.Literal && key.value === value);
+	    };
+	    Parser.prototype.parseObjectProperty = function (hasProto) {
+	        var node = this.createNode();
+	        var token = this.lookahead;
+	        var kind;
+	        var key = null;
+	        var value = null;
+	        var computed = false;
+	        var method = false;
+	        var shorthand = false;
+	        var isAsync = false;
+	        if (token.type === 3 /* Identifier */) {
+	            var id = token.value;
+	            this.nextToken();
+	            computed = this.match('[');
+	            isAsync = !this.hasLineTerminator && (id === 'async') &&
+	                !this.match(':') && !this.match('(') && !this.match('*') && !this.match(',');
+	            key = isAsync ? this.parseObjectPropertyKey() : this.finalize(node, new Node.Identifier(id));
+	        }
+	        else if (this.match('*')) {
+	            this.nextToken();
+	        }
+	        else {
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	        }
+	        var lookaheadPropertyKey = this.qualifiedPropertyName(this.lookahead);
+	        if (token.type === 3 /* Identifier */ && !isAsync && token.value === 'get' && lookaheadPropertyKey) {
+	            kind = 'get';
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            this.context.allowYield = false;
+	            value = this.parseGetterMethod();
+	        }
+	        else if (token.type === 3 /* Identifier */ && !isAsync && token.value === 'set' && lookaheadPropertyKey) {
+	            kind = 'set';
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            value = this.parseSetterMethod();
+	        }
+	        else if (token.type === 7 /* Punctuator */ && token.value === '*' && lookaheadPropertyKey) {
+	            kind = 'init';
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            value = this.parseGeneratorMethod();
+	            method = true;
+	        }
+	        else {
+	            if (!key) {
+	                this.throwUnexpectedToken(this.lookahead);
+	            }
+	            kind = 'init';
+	            if (this.match(':') && !isAsync) {
+	                if (!computed && this.isPropertyKey(key, '__proto__')) {
+	                    if (hasProto.value) {
+	                        this.tolerateError(messages_1.Messages.DuplicateProtoProperty);
+	                    }
+	                    hasProto.value = true;
+	                }
+	                this.nextToken();
+	                value = this.inheritCoverGrammar(this.parseAssignmentExpression);
+	            }
+	            else if (this.match('(')) {
+	                value = isAsync ? this.parsePropertyMethodAsyncFunction() : this.parsePropertyMethodFunction();
+	                method = true;
+	            }
+	            else if (token.type === 3 /* Identifier */) {
+	                var id = this.finalize(node, new Node.Identifier(token.value));
+	                if (this.match('=')) {
+	                    this.context.firstCoverInitializedNameError = this.lookahead;
+	                    this.nextToken();
+	                    shorthand = true;
+	                    var init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                    value = this.finalize(node, new Node.AssignmentPattern(id, init));
+	                }
+	                else {
+	                    shorthand = true;
+	                    value = id;
+	                }
+	            }
+	            else {
+	                this.throwUnexpectedToken(this.nextToken());
+	            }
+	        }
+	        return this.finalize(node, new Node.Property(kind, key, computed, value, method, shorthand));
+	    };
+	    Parser.prototype.parseObjectInitializer = function () {
+	        var node = this.createNode();
+	        this.expect('{');
+	        var properties = [];
+	        var hasProto = { value: false };
+	        while (!this.match('}')) {
+	            properties.push(this.parseObjectProperty(hasProto));
+	            if (!this.match('}')) {
+	                this.expectCommaSeparator();
+	            }
+	        }
+	        this.expect('}');
+	        return this.finalize(node, new Node.ObjectExpression(properties));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-template-literals
+	    Parser.prototype.parseTemplateHead = function () {
+	        assert_1.assert(this.lookahead.head, 'Template literal must start with a template head');
+	        var node = this.createNode();
+	        var token = this.nextToken();
+	        var raw = token.value;
+	        var cooked = token.cooked;
+	        return this.finalize(node, new Node.TemplateElement({ raw: raw, cooked: cooked }, token.tail));
+	    };
+	    Parser.prototype.parseTemplateElement = function () {
+	        if (this.lookahead.type !== 10 /* Template */) {
+	            this.throwUnexpectedToken();
+	        }
+	        var node = this.createNode();
+	        var token = this.nextToken();
+	        var raw = token.value;
+	        var cooked = token.cooked;
+	        return this.finalize(node, new Node.TemplateElement({ raw: raw, cooked: cooked }, token.tail));
+	    };
+	    Parser.prototype.parseTemplateLiteral = function () {
+	        var node = this.createNode();
+	        var expressions = [];
+	        var quasis = [];
+	        var quasi = this.parseTemplateHead();
+	        quasis.push(quasi);
+	        while (!quasi.tail) {
+	            expressions.push(this.parseExpression());
+	            quasi = this.parseTemplateElement();
+	            quasis.push(quasi);
+	        }
+	        return this.finalize(node, new Node.TemplateLiteral(quasis, expressions));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-grouping-operator
+	    Parser.prototype.reinterpretExpressionAsPattern = function (expr) {
+	        switch (expr.type) {
+	            case syntax_1.Syntax.Identifier:
+	            case syntax_1.Syntax.MemberExpression:
+	            case syntax_1.Syntax.RestElement:
+	            case syntax_1.Syntax.AssignmentPattern:
+	                break;
+	            case syntax_1.Syntax.SpreadElement:
+	                expr.type = syntax_1.Syntax.RestElement;
+	                this.reinterpretExpressionAsPattern(expr.argument);
+	                break;
+	            case syntax_1.Syntax.ArrayExpression:
+	                expr.type = syntax_1.Syntax.ArrayPattern;
+	                for (var i = 0; i < expr.elements.length; i++) {
+	                    if (expr.elements[i] !== null) {
+	                        this.reinterpretExpressionAsPattern(expr.elements[i]);
+	                    }
+	                }
+	                break;
+	            case syntax_1.Syntax.ObjectExpression:
+	                expr.type = syntax_1.Syntax.ObjectPattern;
+	                for (var i = 0; i < expr.properties.length; i++) {
+	                    this.reinterpretExpressionAsPattern(expr.properties[i].value);
+	                }
+	                break;
+	            case syntax_1.Syntax.AssignmentExpression:
+	                expr.type = syntax_1.Syntax.AssignmentPattern;
+	                delete expr.operator;
+	                this.reinterpretExpressionAsPattern(expr.left);
+	                break;
+	            default:
+	                // Allow other node type for tolerant parsing.
+	                break;
+	        }
+	    };
+	    Parser.prototype.parseGroupExpression = function () {
+	        var expr;
+	        this.expect('(');
+	        if (this.match(')')) {
+	            this.nextToken();
+	            if (!this.match('=>')) {
+	                this.expect('=>');
+	            }
+	            expr = {
+	                type: ArrowParameterPlaceHolder,
+	                params: [],
+	                async: false
+	            };
+	        }
+	        else {
+	            var startToken = this.lookahead;
+	            var params = [];
+	            if (this.match('...')) {
+	                expr = this.parseRestElement(params);
+	                this.expect(')');
+	                if (!this.match('=>')) {
+	                    this.expect('=>');
+	                }
+	                expr = {
+	                    type: ArrowParameterPlaceHolder,
+	                    params: [expr],
+	                    async: false
+	                };
+	            }
+	            else {
+	                var arrow = false;
+	                this.context.isBindingElement = true;
+	                expr = this.inheritCoverGrammar(this.parseAssignmentExpression);
+	                if (this.match(',')) {
+	                    var expressions = [];
+	                    this.context.isAssignmentTarget = false;
+	                    expressions.push(expr);
+	                    while (this.lookahead.type !== 2 /* EOF */) {
+	                        if (!this.match(',')) {
+	                            break;
+	                        }
+	                        this.nextToken();
+	                        if (this.match(')')) {
+	                            this.nextToken();
+	                            for (var i = 0; i < expressions.length; i++) {
+	                                this.reinterpretExpressionAsPattern(expressions[i]);
+	                            }
+	                            arrow = true;
+	                            expr = {
+	                                type: ArrowParameterPlaceHolder,
+	                                params: expressions,
+	                                async: false
+	                            };
+	                        }
+	                        else if (this.match('...')) {
+	                            if (!this.context.isBindingElement) {
+	                                this.throwUnexpectedToken(this.lookahead);
+	                            }
+	                            expressions.push(this.parseRestElement(params));
+	                            this.expect(')');
+	                            if (!this.match('=>')) {
+	                                this.expect('=>');
+	                            }
+	                            this.context.isBindingElement = false;
+	                            for (var i = 0; i < expressions.length; i++) {
+	                                this.reinterpretExpressionAsPattern(expressions[i]);
+	                            }
+	                            arrow = true;
+	                            expr = {
+	                                type: ArrowParameterPlaceHolder,
+	                                params: expressions,
+	                                async: false
+	                            };
+	                        }
+	                        else {
+	                            expressions.push(this.inheritCoverGrammar(this.parseAssignmentExpression));
+	                        }
+	                        if (arrow) {
+	                            break;
+	                        }
+	                    }
+	                    if (!arrow) {
+	                        expr = this.finalize(this.startNode(startToken), new Node.SequenceExpression(expressions));
+	                    }
+	                }
+	                if (!arrow) {
+	                    this.expect(')');
+	                    if (this.match('=>')) {
+	                        if (expr.type === syntax_1.Syntax.Identifier && expr.name === 'yield') {
+	                            arrow = true;
+	                            expr = {
+	                                type: ArrowParameterPlaceHolder,
+	                                params: [expr],
+	                                async: false
+	                            };
+	                        }
+	                        if (!arrow) {
+	                            if (!this.context.isBindingElement) {
+	                                this.throwUnexpectedToken(this.lookahead);
+	                            }
+	                            if (expr.type === syntax_1.Syntax.SequenceExpression) {
+	                                for (var i = 0; i < expr.expressions.length; i++) {
+	                                    this.reinterpretExpressionAsPattern(expr.expressions[i]);
+	                                }
+	                            }
+	                            else {
+	                                this.reinterpretExpressionAsPattern(expr);
+	                            }
+	                            var parameters = (expr.type === syntax_1.Syntax.SequenceExpression ? expr.expressions : [expr]);
+	                            expr = {
+	                                type: ArrowParameterPlaceHolder,
+	                                params: parameters,
+	                                async: false
+	                            };
+	                        }
+	                    }
+	                    this.context.isBindingElement = false;
+	                }
+	            }
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-left-hand-side-expressions
+	    Parser.prototype.parseArguments = function () {
+	        this.expect('(');
+	        var args = [];
+	        if (!this.match(')')) {
+	            while (true) {
+	                var expr = this.match('...') ? this.parseSpreadElement() :
+	                    this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                args.push(expr);
+	                if (this.match(')')) {
+	                    break;
+	                }
+	                this.expectCommaSeparator();
+	                if (this.match(')')) {
+	                    break;
+	                }
+	            }
+	        }
+	        this.expect(')');
+	        return args;
+	    };
+	    Parser.prototype.isIdentifierName = function (token) {
+	        return token.type === 3 /* Identifier */ ||
+	            token.type === 4 /* Keyword */ ||
+	            token.type === 1 /* BooleanLiteral */ ||
+	            token.type === 5 /* NullLiteral */;
+	    };
+	    Parser.prototype.parseIdentifierName = function () {
+	        var node = this.createNode();
+	        var token = this.nextToken();
+	        if (!this.isIdentifierName(token)) {
+	            this.throwUnexpectedToken(token);
+	        }
+	        return this.finalize(node, new Node.Identifier(token.value));
+	    };
+	    Parser.prototype.parseNewExpression = function () {
+	        var node = this.createNode();
+	        var id = this.parseIdentifierName();
+	        assert_1.assert(id.name === 'new', 'New expression must start with `new`');
+	        var expr;
+	        if (this.match('.')) {
+	            this.nextToken();
+	            if (this.lookahead.type === 3 /* Identifier */ && this.context.inFunctionBody && this.lookahead.value === 'target') {
+	                var property = this.parseIdentifierName();
+	                expr = new Node.MetaProperty(id, property);
+	            }
+	            else {
+	                this.throwUnexpectedToken(this.lookahead);
+	            }
+	        }
+	        else {
+	            var callee = this.isolateCoverGrammar(this.parseLeftHandSideExpression);
+	            var args = this.match('(') ? this.parseArguments() : [];
+	            expr = new Node.NewExpression(callee, args);
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	        }
+	        return this.finalize(node, expr);
+	    };
+	    Parser.prototype.parseAsyncArgument = function () {
+	        var arg = this.parseAssignmentExpression();
+	        this.context.firstCoverInitializedNameError = null;
+	        return arg;
+	    };
+	    Parser.prototype.parseAsyncArguments = function () {
+	        this.expect('(');
+	        var args = [];
+	        if (!this.match(')')) {
+	            while (true) {
+	                var expr = this.match('...') ? this.parseSpreadElement() :
+	                    this.isolateCoverGrammar(this.parseAsyncArgument);
+	                args.push(expr);
+	                if (this.match(')')) {
+	                    break;
+	                }
+	                this.expectCommaSeparator();
+	                if (this.match(')')) {
+	                    break;
+	                }
+	            }
+	        }
+	        this.expect(')');
+	        return args;
+	    };
+	    Parser.prototype.parseLeftHandSideExpressionAllowCall = function () {
+	        var startToken = this.lookahead;
+	        var maybeAsync = this.matchContextualKeyword('async');
+	        var previousAllowIn = this.context.allowIn;
+	        this.context.allowIn = true;
+	        var expr;
+	        if (this.matchKeyword('super') && this.context.inFunctionBody) {
+	            expr = this.createNode();
+	            this.nextToken();
+	            expr = this.finalize(expr, new Node.Super());
+	            if (!this.match('(') && !this.match('.') && !this.match('[')) {
+	                this.throwUnexpectedToken(this.lookahead);
+	            }
+	        }
+	        else {
+	            expr = this.inheritCoverGrammar(this.matchKeyword('new') ? this.parseNewExpression : this.parsePrimaryExpression);
+	        }
+	        while (true) {
+	            if (this.match('.')) {
+	                this.context.isBindingElement = false;
+	                this.context.isAssignmentTarget = true;
+	                this.expect('.');
+	                var property = this.parseIdentifierName();
+	                expr = this.finalize(this.startNode(startToken), new Node.StaticMemberExpression(expr, property));
+	            }
+	            else if (this.match('(')) {
+	                var asyncArrow = maybeAsync && (startToken.lineNumber === this.lookahead.lineNumber);
+	                this.context.isBindingElement = false;
+	                this.context.isAssignmentTarget = false;
+	                var args = asyncArrow ? this.parseAsyncArguments() : this.parseArguments();
+	                expr = this.finalize(this.startNode(startToken), new Node.CallExpression(expr, args));
+	                if (asyncArrow && this.match('=>')) {
+	                    for (var i = 0; i < args.length; ++i) {
+	                        this.reinterpretExpressionAsPattern(args[i]);
+	                    }
+	                    expr = {
+	                        type: ArrowParameterPlaceHolder,
+	                        params: args,
+	                        async: true
+	                    };
+	                }
+	            }
+	            else if (this.match('[')) {
+	                this.context.isBindingElement = false;
+	                this.context.isAssignmentTarget = true;
+	                this.expect('[');
+	                var property = this.isolateCoverGrammar(this.parseExpression);
+	                this.expect(']');
+	                expr = this.finalize(this.startNode(startToken), new Node.ComputedMemberExpression(expr, property));
+	            }
+	            else if (this.lookahead.type === 10 /* Template */ && this.lookahead.head) {
+	                var quasi = this.parseTemplateLiteral();
+	                expr = this.finalize(this.startNode(startToken), new Node.TaggedTemplateExpression(expr, quasi));
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        this.context.allowIn = previousAllowIn;
+	        return expr;
+	    };
+	    Parser.prototype.parseSuper = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('super');
+	        if (!this.match('[') && !this.match('.')) {
+	            this.throwUnexpectedToken(this.lookahead);
+	        }
+	        return this.finalize(node, new Node.Super());
+	    };
+	    Parser.prototype.parseLeftHandSideExpression = function () {
+	        assert_1.assert(this.context.allowIn, 'callee of new expression always allow in keyword.');
+	        var node = this.startNode(this.lookahead);
+	        var expr = (this.matchKeyword('super') && this.context.inFunctionBody) ? this.parseSuper() :
+	            this.inheritCoverGrammar(this.matchKeyword('new') ? this.parseNewExpression : this.parsePrimaryExpression);
+	        while (true) {
+	            if (this.match('[')) {
+	                this.context.isBindingElement = false;
+	                this.context.isAssignmentTarget = true;
+	                this.expect('[');
+	                var property = this.isolateCoverGrammar(this.parseExpression);
+	                this.expect(']');
+	                expr = this.finalize(node, new Node.ComputedMemberExpression(expr, property));
+	            }
+	            else if (this.match('.')) {
+	                this.context.isBindingElement = false;
+	                this.context.isAssignmentTarget = true;
+	                this.expect('.');
+	                var property = this.parseIdentifierName();
+	                expr = this.finalize(node, new Node.StaticMemberExpression(expr, property));
+	            }
+	            else if (this.lookahead.type === 10 /* Template */ && this.lookahead.head) {
+	                var quasi = this.parseTemplateLiteral();
+	                expr = this.finalize(node, new Node.TaggedTemplateExpression(expr, quasi));
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-update-expressions
+	    Parser.prototype.parseUpdateExpression = function () {
+	        var expr;
+	        var startToken = this.lookahead;
+	        if (this.match('++') || this.match('--')) {
+	            var node = this.startNode(startToken);
+	            var token = this.nextToken();
+	            expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+	            if (this.context.strict && expr.type === syntax_1.Syntax.Identifier && this.scanner.isRestrictedWord(expr.name)) {
+	                this.tolerateError(messages_1.Messages.StrictLHSPrefix);
+	            }
+	            if (!this.context.isAssignmentTarget) {
+	                this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+	            }
+	            var prefix = true;
+	            expr = this.finalize(node, new Node.UpdateExpression(token.value, expr, prefix));
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	        }
+	        else {
+	            expr = this.inheritCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+	            if (!this.hasLineTerminator && this.lookahead.type === 7 /* Punctuator */) {
+	                if (this.match('++') || this.match('--')) {
+	                    if (this.context.strict && expr.type === syntax_1.Syntax.Identifier && this.scanner.isRestrictedWord(expr.name)) {
+	                        this.tolerateError(messages_1.Messages.StrictLHSPostfix);
+	                    }
+	                    if (!this.context.isAssignmentTarget) {
+	                        this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+	                    }
+	                    this.context.isAssignmentTarget = false;
+	                    this.context.isBindingElement = false;
+	                    var operator = this.nextToken().value;
+	                    var prefix = false;
+	                    expr = this.finalize(this.startNode(startToken), new Node.UpdateExpression(operator, expr, prefix));
+	                }
+	            }
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-unary-operators
+	    Parser.prototype.parseAwaitExpression = function () {
+	        var node = this.createNode();
+	        this.nextToken();
+	        var argument = this.parseUnaryExpression();
+	        return this.finalize(node, new Node.AwaitExpression(argument));
+	    };
+	    Parser.prototype.parseUnaryExpression = function () {
+	        var expr;
+	        if (this.match('+') || this.match('-') || this.match('~') || this.match('!') ||
+	            this.matchKeyword('delete') || this.matchKeyword('void') || this.matchKeyword('typeof')) {
+	            var node = this.startNode(this.lookahead);
+	            var token = this.nextToken();
+	            expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+	            expr = this.finalize(node, new Node.UnaryExpression(token.value, expr));
+	            if (this.context.strict && expr.operator === 'delete' && expr.argument.type === syntax_1.Syntax.Identifier) {
+	                this.tolerateError(messages_1.Messages.StrictDelete);
+	            }
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	        }
+	        else if (this.context.await && this.matchContextualKeyword('await')) {
+	            expr = this.parseAwaitExpression();
+	        }
+	        else {
+	            expr = this.parseUpdateExpression();
+	        }
+	        return expr;
+	    };
+	    Parser.prototype.parseExponentiationExpression = function () {
+	        var startToken = this.lookahead;
+	        var expr = this.inheritCoverGrammar(this.parseUnaryExpression);
+	        if (expr.type !== syntax_1.Syntax.UnaryExpression && this.match('**')) {
+	            this.nextToken();
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	            var left = expr;
+	            var right = this.isolateCoverGrammar(this.parseExponentiationExpression);
+	            expr = this.finalize(this.startNode(startToken), new Node.BinaryExpression('**', left, right));
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-exp-operator
+	    // https://tc39.github.io/ecma262/#sec-multiplicative-operators
+	    // https://tc39.github.io/ecma262/#sec-additive-operators
+	    // https://tc39.github.io/ecma262/#sec-bitwise-shift-operators
+	    // https://tc39.github.io/ecma262/#sec-relational-operators
+	    // https://tc39.github.io/ecma262/#sec-equality-operators
+	    // https://tc39.github.io/ecma262/#sec-binary-bitwise-operators
+	    // https://tc39.github.io/ecma262/#sec-binary-logical-operators
+	    Parser.prototype.binaryPrecedence = function (token) {
+	        var op = token.value;
+	        var precedence;
+	        if (token.type === 7 /* Punctuator */) {
+	            precedence = this.operatorPrecedence[op] || 0;
+	        }
+	        else if (token.type === 4 /* Keyword */) {
+	            precedence = (op === 'instanceof' || (this.context.allowIn && op === 'in')) ? 7 : 0;
+	        }
+	        else {
+	            precedence = 0;
+	        }
+	        return precedence;
+	    };
+	    Parser.prototype.parseBinaryExpression = function () {
+	        var startToken = this.lookahead;
+	        var expr = this.inheritCoverGrammar(this.parseExponentiationExpression);
+	        var token = this.lookahead;
+	        var prec = this.binaryPrecedence(token);
+	        if (prec > 0) {
+	            this.nextToken();
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	            var markers = [startToken, this.lookahead];
+	            var left = expr;
+	            var right = this.isolateCoverGrammar(this.parseExponentiationExpression);
+	            var stack = [left, token.value, right];
+	            var precedences = [prec];
+	            while (true) {
+	                prec = this.binaryPrecedence(this.lookahead);
+	                if (prec <= 0) {
+	                    break;
+	                }
+	                // Reduce: make a binary expression from the three topmost entries.
+	                while ((stack.length > 2) && (prec <= precedences[precedences.length - 1])) {
+	                    right = stack.pop();
+	                    var operator = stack.pop();
+	                    precedences.pop();
+	                    left = stack.pop();
+	                    markers.pop();
+	                    var node = this.startNode(markers[markers.length - 1]);
+	                    stack.push(this.finalize(node, new Node.BinaryExpression(operator, left, right)));
+	                }
+	                // Shift.
+	                stack.push(this.nextToken().value);
+	                precedences.push(prec);
+	                markers.push(this.lookahead);
+	                stack.push(this.isolateCoverGrammar(this.parseExponentiationExpression));
+	            }
+	            // Final reduce to clean-up the stack.
+	            var i = stack.length - 1;
+	            expr = stack[i];
+	            var lastMarker = markers.pop();
+	            while (i > 1) {
+	                var marker = markers.pop();
+	                var lastLineStart = lastMarker && lastMarker.lineStart;
+	                var node = this.startNode(marker, lastLineStart);
+	                var operator = stack[i - 1];
+	                expr = this.finalize(node, new Node.BinaryExpression(operator, stack[i - 2], expr));
+	                i -= 2;
+	                lastMarker = marker;
+	            }
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-conditional-operator
+	    Parser.prototype.parseConditionalExpression = function () {
+	        var startToken = this.lookahead;
+	        var expr = this.inheritCoverGrammar(this.parseBinaryExpression);
+	        if (this.match('?')) {
+	            this.nextToken();
+	            var previousAllowIn = this.context.allowIn;
+	            this.context.allowIn = true;
+	            var consequent = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	            this.context.allowIn = previousAllowIn;
+	            this.expect(':');
+	            var alternate = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	            expr = this.finalize(this.startNode(startToken), new Node.ConditionalExpression(expr, consequent, alternate));
+	            this.context.isAssignmentTarget = false;
+	            this.context.isBindingElement = false;
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-assignment-operators
+	    Parser.prototype.checkPatternParam = function (options, param) {
+	        switch (param.type) {
+	            case syntax_1.Syntax.Identifier:
+	                this.validateParam(options, param, param.name);
+	                break;
+	            case syntax_1.Syntax.RestElement:
+	                this.checkPatternParam(options, param.argument);
+	                break;
+	            case syntax_1.Syntax.AssignmentPattern:
+	                this.checkPatternParam(options, param.left);
+	                break;
+	            case syntax_1.Syntax.ArrayPattern:
+	                for (var i = 0; i < param.elements.length; i++) {
+	                    if (param.elements[i] !== null) {
+	                        this.checkPatternParam(options, param.elements[i]);
+	                    }
+	                }
+	                break;
+	            case syntax_1.Syntax.ObjectPattern:
+	                for (var i = 0; i < param.properties.length; i++) {
+	                    this.checkPatternParam(options, param.properties[i].value);
+	                }
+	                break;
+	            default:
+	                break;
+	        }
+	        options.simple = options.simple && (param instanceof Node.Identifier);
+	    };
+	    Parser.prototype.reinterpretAsCoverFormalsList = function (expr) {
+	        var params = [expr];
+	        var options;
+	        var asyncArrow = false;
+	        switch (expr.type) {
+	            case syntax_1.Syntax.Identifier:
+	                break;
+	            case ArrowParameterPlaceHolder:
+	                params = expr.params;
+	                asyncArrow = expr.async;
+	                break;
+	            default:
+	                return null;
+	        }
+	        options = {
+	            simple: true,
+	            paramSet: {}
+	        };
+	        for (var i = 0; i < params.length; ++i) {
+	            var param = params[i];
+	            if (param.type === syntax_1.Syntax.AssignmentPattern) {
+	                if (param.right.type === syntax_1.Syntax.YieldExpression) {
+	                    if (param.right.argument) {
+	                        this.throwUnexpectedToken(this.lookahead);
+	                    }
+	                    param.right.type = syntax_1.Syntax.Identifier;
+	                    param.right.name = 'yield';
+	                    delete param.right.argument;
+	                    delete param.right.delegate;
+	                }
+	            }
+	            else if (asyncArrow && param.type === syntax_1.Syntax.Identifier && param.name === 'await') {
+	                this.throwUnexpectedToken(this.lookahead);
+	            }
+	            this.checkPatternParam(options, param);
+	            params[i] = param;
+	        }
+	        if (this.context.strict || !this.context.allowYield) {
+	            for (var i = 0; i < params.length; ++i) {
+	                var param = params[i];
+	                if (param.type === syntax_1.Syntax.YieldExpression) {
+	                    this.throwUnexpectedToken(this.lookahead);
+	                }
+	            }
+	        }
+	        if (options.message === messages_1.Messages.StrictParamDupe) {
+	            var token = this.context.strict ? options.stricted : options.firstRestricted;
+	            this.throwUnexpectedToken(token, options.message);
+	        }
+	        return {
+	            simple: options.simple,
+	            params: params,
+	            stricted: options.stricted,
+	            firstRestricted: options.firstRestricted,
+	            message: options.message
+	        };
+	    };
+	    Parser.prototype.parseAssignmentExpression = function () {
+	        var expr;
+	        if (!this.context.allowYield && this.matchKeyword('yield')) {
+	            expr = this.parseYieldExpression();
+	        }
+	        else {
+	            var startToken = this.lookahead;
+	            var token = startToken;
+	            expr = this.parseConditionalExpression();
+	            if (token.type === 3 /* Identifier */ && (token.lineNumber === this.lookahead.lineNumber) && token.value === 'async') {
+	                if (this.lookahead.type === 3 /* Identifier */ || this.matchKeyword('yield')) {
+	                    var arg = this.parsePrimaryExpression();
+	                    this.reinterpretExpressionAsPattern(arg);
+	                    expr = {
+	                        type: ArrowParameterPlaceHolder,
+	                        params: [arg],
+	                        async: true
+	                    };
+	                }
+	            }
+	            if (expr.type === ArrowParameterPlaceHolder || this.match('=>')) {
+	                // https://tc39.github.io/ecma262/#sec-arrow-function-definitions
+	                this.context.isAssignmentTarget = false;
+	                this.context.isBindingElement = false;
+	                var isAsync = expr.async;
+	                var list = this.reinterpretAsCoverFormalsList(expr);
+	                if (list) {
+	                    if (this.hasLineTerminator) {
+	                        this.tolerateUnexpectedToken(this.lookahead);
+	                    }
+	                    this.context.firstCoverInitializedNameError = null;
+	                    var previousStrict = this.context.strict;
+	                    var previousAllowStrictDirective = this.context.allowStrictDirective;
+	                    this.context.allowStrictDirective = list.simple;
+	                    var previousAllowYield = this.context.allowYield;
+	                    var previousAwait = this.context.await;
+	                    this.context.allowYield = true;
+	                    this.context.await = isAsync;
+	                    var node = this.startNode(startToken);
+	                    this.expect('=>');
+	                    var body = void 0;
+	                    if (this.match('{')) {
+	                        var previousAllowIn = this.context.allowIn;
+	                        this.context.allowIn = true;
+	                        body = this.parseFunctionSourceElements();
+	                        this.context.allowIn = previousAllowIn;
+	                    }
+	                    else {
+	                        body = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                    }
+	                    var expression = body.type !== syntax_1.Syntax.BlockStatement;
+	                    if (this.context.strict && list.firstRestricted) {
+	                        this.throwUnexpectedToken(list.firstRestricted, list.message);
+	                    }
+	                    if (this.context.strict && list.stricted) {
+	                        this.tolerateUnexpectedToken(list.stricted, list.message);
+	                    }
+	                    expr = isAsync ? this.finalize(node, new Node.AsyncArrowFunctionExpression(list.params, body, expression)) :
+	                        this.finalize(node, new Node.ArrowFunctionExpression(list.params, body, expression));
+	                    this.context.strict = previousStrict;
+	                    this.context.allowStrictDirective = previousAllowStrictDirective;
+	                    this.context.allowYield = previousAllowYield;
+	                    this.context.await = previousAwait;
+	                }
+	            }
+	            else {
+	                if (this.matchAssign()) {
+	                    if (!this.context.isAssignmentTarget) {
+	                        this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);
+	                    }
+	                    if (this.context.strict && expr.type === syntax_1.Syntax.Identifier) {
+	                        var id = expr;
+	                        if (this.scanner.isRestrictedWord(id.name)) {
+	                            this.tolerateUnexpectedToken(token, messages_1.Messages.StrictLHSAssignment);
+	                        }
+	                        if (this.scanner.isStrictModeReservedWord(id.name)) {
+	                            this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+	                        }
+	                    }
+	                    if (!this.match('=')) {
+	                        this.context.isAssignmentTarget = false;
+	                        this.context.isBindingElement = false;
+	                    }
+	                    else {
+	                        this.reinterpretExpressionAsPattern(expr);
+	                    }
+	                    token = this.nextToken();
+	                    var operator = token.value;
+	                    var right = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                    expr = this.finalize(this.startNode(startToken), new Node.AssignmentExpression(operator, expr, right));
+	                    this.context.firstCoverInitializedNameError = null;
+	                }
+	            }
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-comma-operator
+	    Parser.prototype.parseExpression = function () {
+	        var startToken = this.lookahead;
+	        var expr = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	        if (this.match(',')) {
+	            var expressions = [];
+	            expressions.push(expr);
+	            while (this.lookahead.type !== 2 /* EOF */) {
+	                if (!this.match(',')) {
+	                    break;
+	                }
+	                this.nextToken();
+	                expressions.push(this.isolateCoverGrammar(this.parseAssignmentExpression));
+	            }
+	            expr = this.finalize(this.startNode(startToken), new Node.SequenceExpression(expressions));
+	        }
+	        return expr;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-block
+	    Parser.prototype.parseStatementListItem = function () {
+	        var statement;
+	        this.context.isAssignmentTarget = true;
+	        this.context.isBindingElement = true;
+	        if (this.lookahead.type === 4 /* Keyword */) {
+	            switch (this.lookahead.value) {
+	                case 'export':
+	                    if (!this.context.isModule) {
+	                        this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.IllegalExportDeclaration);
+	                    }
+	                    statement = this.parseExportDeclaration();
+	                    break;
+	                case 'import':
+	                    if (!this.context.isModule) {
+	                        this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.IllegalImportDeclaration);
+	                    }
+	                    statement = this.parseImportDeclaration();
+	                    break;
+	                case 'const':
+	                    statement = this.parseLexicalDeclaration({ inFor: false });
+	                    break;
+	                case 'function':
+	                    statement = this.parseFunctionDeclaration();
+	                    break;
+	                case 'class':
+	                    statement = this.parseClassDeclaration();
+	                    break;
+	                case 'let':
+	                    statement = this.isLexicalDeclaration() ? this.parseLexicalDeclaration({ inFor: false }) : this.parseStatement();
+	                    break;
+	                default:
+	                    statement = this.parseStatement();
+	                    break;
+	            }
+	        }
+	        else {
+	            statement = this.parseStatement();
+	        }
+	        return statement;
+	    };
+	    Parser.prototype.parseBlock = function () {
+	        var node = this.createNode();
+	        this.expect('{');
+	        var block = [];
+	        while (true) {
+	            if (this.match('}')) {
+	                break;
+	            }
+	            block.push(this.parseStatementListItem());
+	        }
+	        this.expect('}');
+	        return this.finalize(node, new Node.BlockStatement(block));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-let-and-const-declarations
+	    Parser.prototype.parseLexicalBinding = function (kind, options) {
+	        var node = this.createNode();
+	        var params = [];
+	        var id = this.parsePattern(params, kind);
+	        if (this.context.strict && id.type === syntax_1.Syntax.Identifier) {
+	            if (this.scanner.isRestrictedWord(id.name)) {
+	                this.tolerateError(messages_1.Messages.StrictVarName);
+	            }
+	        }
+	        var init = null;
+	        if (kind === 'const') {
+	            if (!this.matchKeyword('in') && !this.matchContextualKeyword('of')) {
+	                if (this.match('=')) {
+	                    this.nextToken();
+	                    init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	                }
+	                else {
+	                    this.throwError(messages_1.Messages.DeclarationMissingInitializer, 'const');
+	                }
+	            }
+	        }
+	        else if ((!options.inFor && id.type !== syntax_1.Syntax.Identifier) || this.match('=')) {
+	            this.expect('=');
+	            init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	        }
+	        return this.finalize(node, new Node.VariableDeclarator(id, init));
+	    };
+	    Parser.prototype.parseBindingList = function (kind, options) {
+	        var list = [this.parseLexicalBinding(kind, options)];
+	        while (this.match(',')) {
+	            this.nextToken();
+	            list.push(this.parseLexicalBinding(kind, options));
+	        }
+	        return list;
+	    };
+	    Parser.prototype.isLexicalDeclaration = function () {
+	        var state = this.scanner.saveState();
+	        this.scanner.scanComments();
+	        var next = this.scanner.lex();
+	        this.scanner.restoreState(state);
+	        return (next.type === 3 /* Identifier */) ||
+	            (next.type === 7 /* Punctuator */ && next.value === '[') ||
+	            (next.type === 7 /* Punctuator */ && next.value === '{') ||
+	            (next.type === 4 /* Keyword */ && next.value === 'let') ||
+	            (next.type === 4 /* Keyword */ && next.value === 'yield');
+	    };
+	    Parser.prototype.parseLexicalDeclaration = function (options) {
+	        var node = this.createNode();
+	        var kind = this.nextToken().value;
+	        assert_1.assert(kind === 'let' || kind === 'const', 'Lexical declaration must be either let or const');
+	        var declarations = this.parseBindingList(kind, options);
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.VariableDeclaration(declarations, kind));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-destructuring-binding-patterns
+	    Parser.prototype.parseBindingRestElement = function (params, kind) {
+	        var node = this.createNode();
+	        this.expect('...');
+	        var arg = this.parsePattern(params, kind);
+	        return this.finalize(node, new Node.RestElement(arg));
+	    };
+	    Parser.prototype.parseArrayPattern = function (params, kind) {
+	        var node = this.createNode();
+	        this.expect('[');
+	        var elements = [];
+	        while (!this.match(']')) {
+	            if (this.match(',')) {
+	                this.nextToken();
+	                elements.push(null);
+	            }
+	            else {
+	                if (this.match('...')) {
+	                    elements.push(this.parseBindingRestElement(params, kind));
+	                    break;
+	                }
+	                else {
+	                    elements.push(this.parsePatternWithDefault(params, kind));
+	                }
+	                if (!this.match(']')) {
+	                    this.expect(',');
+	                }
+	            }
+	        }
+	        this.expect(']');
+	        return this.finalize(node, new Node.ArrayPattern(elements));
+	    };
+	    Parser.prototype.parsePropertyPattern = function (params, kind) {
+	        var node = this.createNode();
+	        var computed = false;
+	        var shorthand = false;
+	        var method = false;
+	        var key;
+	        var value;
+	        if (this.lookahead.type === 3 /* Identifier */) {
+	            var keyToken = this.lookahead;
+	            key = this.parseVariableIdentifier();
+	            var init = this.finalize(node, new Node.Identifier(keyToken.value));
+	            if (this.match('=')) {
+	                params.push(keyToken);
+	                shorthand = true;
+	                this.nextToken();
+	                var expr = this.parseAssignmentExpression();
+	                value = this.finalize(this.startNode(keyToken), new Node.AssignmentPattern(init, expr));
+	            }
+	            else if (!this.match(':')) {
+	                params.push(keyToken);
+	                shorthand = true;
+	                value = init;
+	            }
+	            else {
+	                this.expect(':');
+	                value = this.parsePatternWithDefault(params, kind);
+	            }
+	        }
+	        else {
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            this.expect(':');
+	            value = this.parsePatternWithDefault(params, kind);
+	        }
+	        return this.finalize(node, new Node.Property('init', key, computed, value, method, shorthand));
+	    };
+	    Parser.prototype.parseObjectPattern = function (params, kind) {
+	        var node = this.createNode();
+	        var properties = [];
+	        this.expect('{');
+	        while (!this.match('}')) {
+	            properties.push(this.parsePropertyPattern(params, kind));
+	            if (!this.match('}')) {
+	                this.expect(',');
+	            }
+	        }
+	        this.expect('}');
+	        return this.finalize(node, new Node.ObjectPattern(properties));
+	    };
+	    Parser.prototype.parsePattern = function (params, kind) {
+	        var pattern;
+	        if (this.match('[')) {
+	            pattern = this.parseArrayPattern(params, kind);
+	        }
+	        else if (this.match('{')) {
+	            pattern = this.parseObjectPattern(params, kind);
+	        }
+	        else {
+	            if (this.matchKeyword('let') && (kind === 'const' || kind === 'let')) {
+	                this.tolerateUnexpectedToken(this.lookahead, messages_1.Messages.LetInLexicalBinding);
+	            }
+	            params.push(this.lookahead);
+	            pattern = this.parseVariableIdentifier(kind);
+	        }
+	        return pattern;
+	    };
+	    Parser.prototype.parsePatternWithDefault = function (params, kind) {
+	        var startToken = this.lookahead;
+	        var pattern = this.parsePattern(params, kind);
+	        if (this.match('=')) {
+	            this.nextToken();
+	            var previousAllowYield = this.context.allowYield;
+	            this.context.allowYield = true;
+	            var right = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	            this.context.allowYield = previousAllowYield;
+	            pattern = this.finalize(this.startNode(startToken), new Node.AssignmentPattern(pattern, right));
+	        }
+	        return pattern;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-variable-statement
+	    Parser.prototype.parseVariableIdentifier = function (kind) {
+	        var node = this.createNode();
+	        var token = this.nextToken();
+	        if (token.type === 4 /* Keyword */ && token.value === 'yield') {
+	            if (this.context.strict) {
+	                this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+	            }
+	            else if (!this.context.allowYield) {
+	                this.throwUnexpectedToken(token);
+	            }
+	        }
+	        else if (token.type !== 3 /* Identifier */) {
+	            if (this.context.strict && token.type === 4 /* Keyword */ && this.scanner.isStrictModeReservedWord(token.value)) {
+	                this.tolerateUnexpectedToken(token, messages_1.Messages.StrictReservedWord);
+	            }
+	            else {
+	                if (this.context.strict || token.value !== 'let' || kind !== 'var') {
+	                    this.throwUnexpectedToken(token);
+	                }
+	            }
+	        }
+	        else if ((this.context.isModule || this.context.await) && token.type === 3 /* Identifier */ && token.value === 'await') {
+	            this.tolerateUnexpectedToken(token);
+	        }
+	        return this.finalize(node, new Node.Identifier(token.value));
+	    };
+	    Parser.prototype.parseVariableDeclaration = function (options) {
+	        var node = this.createNode();
+	        var params = [];
+	        var id = this.parsePattern(params, 'var');
+	        if (this.context.strict && id.type === syntax_1.Syntax.Identifier) {
+	            if (this.scanner.isRestrictedWord(id.name)) {
+	                this.tolerateError(messages_1.Messages.StrictVarName);
+	            }
+	        }
+	        var init = null;
+	        if (this.match('=')) {
+	            this.nextToken();
+	            init = this.isolateCoverGrammar(this.parseAssignmentExpression);
+	        }
+	        else if (id.type !== syntax_1.Syntax.Identifier && !options.inFor) {
+	            this.expect('=');
+	        }
+	        return this.finalize(node, new Node.VariableDeclarator(id, init));
+	    };
+	    Parser.prototype.parseVariableDeclarationList = function (options) {
+	        var opt = { inFor: options.inFor };
+	        var list = [];
+	        list.push(this.parseVariableDeclaration(opt));
+	        while (this.match(',')) {
+	            this.nextToken();
+	            list.push(this.parseVariableDeclaration(opt));
+	        }
+	        return list;
+	    };
+	    Parser.prototype.parseVariableStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('var');
+	        var declarations = this.parseVariableDeclarationList({ inFor: false });
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.VariableDeclaration(declarations, 'var'));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-empty-statement
+	    Parser.prototype.parseEmptyStatement = function () {
+	        var node = this.createNode();
+	        this.expect(';');
+	        return this.finalize(node, new Node.EmptyStatement());
+	    };
+	    // https://tc39.github.io/ecma262/#sec-expression-statement
+	    Parser.prototype.parseExpressionStatement = function () {
+	        var node = this.createNode();
+	        var expr = this.parseExpression();
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.ExpressionStatement(expr));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-if-statement
+	    Parser.prototype.parseIfClause = function () {
+	        if (this.context.strict && this.matchKeyword('function')) {
+	            this.tolerateError(messages_1.Messages.StrictFunction);
+	        }
+	        return this.parseStatement();
+	    };
+	    Parser.prototype.parseIfStatement = function () {
+	        var node = this.createNode();
+	        var consequent;
+	        var alternate = null;
+	        this.expectKeyword('if');
+	        this.expect('(');
+	        var test = this.parseExpression();
+	        if (!this.match(')') && this.config.tolerant) {
+	            this.tolerateUnexpectedToken(this.nextToken());
+	            consequent = this.finalize(this.createNode(), new Node.EmptyStatement());
+	        }
+	        else {
+	            this.expect(')');
+	            consequent = this.parseIfClause();
+	            if (this.matchKeyword('else')) {
+	                this.nextToken();
+	                alternate = this.parseIfClause();
+	            }
+	        }
+	        return this.finalize(node, new Node.IfStatement(test, consequent, alternate));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-do-while-statement
+	    Parser.prototype.parseDoWhileStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('do');
+	        var previousInIteration = this.context.inIteration;
+	        this.context.inIteration = true;
+	        var body = this.parseStatement();
+	        this.context.inIteration = previousInIteration;
+	        this.expectKeyword('while');
+	        this.expect('(');
+	        var test = this.parseExpression();
+	        if (!this.match(')') && this.config.tolerant) {
+	            this.tolerateUnexpectedToken(this.nextToken());
+	        }
+	        else {
+	            this.expect(')');
+	            if (this.match(';')) {
+	                this.nextToken();
+	            }
+	        }
+	        return this.finalize(node, new Node.DoWhileStatement(body, test));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-while-statement
+	    Parser.prototype.parseWhileStatement = function () {
+	        var node = this.createNode();
+	        var body;
+	        this.expectKeyword('while');
+	        this.expect('(');
+	        var test = this.parseExpression();
+	        if (!this.match(')') && this.config.tolerant) {
+	            this.tolerateUnexpectedToken(this.nextToken());
+	            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+	        }
+	        else {
+	            this.expect(')');
+	            var previousInIteration = this.context.inIteration;
+	            this.context.inIteration = true;
+	            body = this.parseStatement();
+	            this.context.inIteration = previousInIteration;
+	        }
+	        return this.finalize(node, new Node.WhileStatement(test, body));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-for-statement
+	    // https://tc39.github.io/ecma262/#sec-for-in-and-for-of-statements
+	    Parser.prototype.parseForStatement = function () {
+	        var init = null;
+	        var test = null;
+	        var update = null;
+	        var forIn = true;
+	        var left, right;
+	        var node = this.createNode();
+	        this.expectKeyword('for');
+	        this.expect('(');
+	        if (this.match(';')) {
+	            this.nextToken();
+	        }
+	        else {
+	            if (this.matchKeyword('var')) {
+	                init = this.createNode();
+	                this.nextToken();
+	                var previousAllowIn = this.context.allowIn;
+	                this.context.allowIn = false;
+	                var declarations = this.parseVariableDeclarationList({ inFor: true });
+	                this.context.allowIn = previousAllowIn;
+	                if (declarations.length === 1 && this.matchKeyword('in')) {
+	                    var decl = declarations[0];
+	                    if (decl.init && (decl.id.type === syntax_1.Syntax.ArrayPattern || decl.id.type === syntax_1.Syntax.ObjectPattern || this.context.strict)) {
+	                        this.tolerateError(messages_1.Messages.ForInOfLoopInitializer, 'for-in');
+	                    }
+	                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+	                    this.nextToken();
+	                    left = init;
+	                    right = this.parseExpression();
+	                    init = null;
+	                }
+	                else if (declarations.length === 1 && declarations[0].init === null && this.matchContextualKeyword('of')) {
+	                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+	                    this.nextToken();
+	                    left = init;
+	                    right = this.parseAssignmentExpression();
+	                    init = null;
+	                    forIn = false;
+	                }
+	                else {
+	                    init = this.finalize(init, new Node.VariableDeclaration(declarations, 'var'));
+	                    this.expect(';');
+	                }
+	            }
+	            else if (this.matchKeyword('const') || this.matchKeyword('let')) {
+	                init = this.createNode();
+	                var kind = this.nextToken().value;
+	                if (!this.context.strict && this.lookahead.value === 'in') {
+	                    init = this.finalize(init, new Node.Identifier(kind));
+	                    this.nextToken();
+	                    left = init;
+	                    right = this.parseExpression();
+	                    init = null;
+	                }
+	                else {
+	                    var previousAllowIn = this.context.allowIn;
+	                    this.context.allowIn = false;
+	                    var declarations = this.parseBindingList(kind, { inFor: true });
+	                    this.context.allowIn = previousAllowIn;
+	                    if (declarations.length === 1 && declarations[0].init === null && this.matchKeyword('in')) {
+	                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+	                        this.nextToken();
+	                        left = init;
+	                        right = this.parseExpression();
+	                        init = null;
+	                    }
+	                    else if (declarations.length === 1 && declarations[0].init === null && this.matchContextualKeyword('of')) {
+	                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+	                        this.nextToken();
+	                        left = init;
+	                        right = this.parseAssignmentExpression();
+	                        init = null;
+	                        forIn = false;
+	                    }
+	                    else {
+	                        this.consumeSemicolon();
+	                        init = this.finalize(init, new Node.VariableDeclaration(declarations, kind));
+	                    }
+	                }
+	            }
+	            else {
+	                var initStartToken = this.lookahead;
+	                var previousAllowIn = this.context.allowIn;
+	                this.context.allowIn = false;
+	                init = this.inheritCoverGrammar(this.parseAssignmentExpression);
+	                this.context.allowIn = previousAllowIn;
+	                if (this.matchKeyword('in')) {
+	                    if (!this.context.isAssignmentTarget || init.type === syntax_1.Syntax.AssignmentExpression) {
+	                        this.tolerateError(messages_1.Messages.InvalidLHSInForIn);
+	                    }
+	                    this.nextToken();
+	                    this.reinterpretExpressionAsPattern(init);
+	                    left = init;
+	                    right = this.parseExpression();
+	                    init = null;
+	                }
+	                else if (this.matchContextualKeyword('of')) {
+	                    if (!this.context.isAssignmentTarget || init.type === syntax_1.Syntax.AssignmentExpression) {
+	                        this.tolerateError(messages_1.Messages.InvalidLHSInForLoop);
+	                    }
+	                    this.nextToken();
+	                    this.reinterpretExpressionAsPattern(init);
+	                    left = init;
+	                    right = this.parseAssignmentExpression();
+	                    init = null;
+	                    forIn = false;
+	                }
+	                else {
+	                    if (this.match(',')) {
+	                        var initSeq = [init];
+	                        while (this.match(',')) {
+	                            this.nextToken();
+	                            initSeq.push(this.isolateCoverGrammar(this.parseAssignmentExpression));
+	                        }
+	                        init = this.finalize(this.startNode(initStartToken), new Node.SequenceExpression(initSeq));
+	                    }
+	                    this.expect(';');
+	                }
+	            }
+	        }
+	        if (typeof left === 'undefined') {
+	            if (!this.match(';')) {
+	                test = this.parseExpression();
+	            }
+	            this.expect(';');
+	            if (!this.match(')')) {
+	                update = this.parseExpression();
+	            }
+	        }
+	        var body;
+	        if (!this.match(')') && this.config.tolerant) {
+	            this.tolerateUnexpectedToken(this.nextToken());
+	            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+	        }
+	        else {
+	            this.expect(')');
+	            var previousInIteration = this.context.inIteration;
+	            this.context.inIteration = true;
+	            body = this.isolateCoverGrammar(this.parseStatement);
+	            this.context.inIteration = previousInIteration;
+	        }
+	        return (typeof left === 'undefined') ?
+	            this.finalize(node, new Node.ForStatement(init, test, update, body)) :
+	            forIn ? this.finalize(node, new Node.ForInStatement(left, right, body)) :
+	                this.finalize(node, new Node.ForOfStatement(left, right, body));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-continue-statement
+	    Parser.prototype.parseContinueStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('continue');
+	        var label = null;
+	        if (this.lookahead.type === 3 /* Identifier */ && !this.hasLineTerminator) {
+	            var id = this.parseVariableIdentifier();
+	            label = id;
+	            var key = '$' + id.name;
+	            if (!Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+	                this.throwError(messages_1.Messages.UnknownLabel, id.name);
+	            }
+	        }
+	        this.consumeSemicolon();
+	        if (label === null && !this.context.inIteration) {
+	            this.throwError(messages_1.Messages.IllegalContinue);
+	        }
+	        return this.finalize(node, new Node.ContinueStatement(label));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-break-statement
+	    Parser.prototype.parseBreakStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('break');
+	        var label = null;
+	        if (this.lookahead.type === 3 /* Identifier */ && !this.hasLineTerminator) {
+	            var id = this.parseVariableIdentifier();
+	            var key = '$' + id.name;
+	            if (!Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+	                this.throwError(messages_1.Messages.UnknownLabel, id.name);
+	            }
+	            label = id;
+	        }
+	        this.consumeSemicolon();
+	        if (label === null && !this.context.inIteration && !this.context.inSwitch) {
+	            this.throwError(messages_1.Messages.IllegalBreak);
+	        }
+	        return this.finalize(node, new Node.BreakStatement(label));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-return-statement
+	    Parser.prototype.parseReturnStatement = function () {
+	        if (!this.context.inFunctionBody) {
+	            this.tolerateError(messages_1.Messages.IllegalReturn);
+	        }
+	        var node = this.createNode();
+	        this.expectKeyword('return');
+	        var hasArgument = (!this.match(';') && !this.match('}') &&
+	            !this.hasLineTerminator && this.lookahead.type !== 2 /* EOF */) ||
+	            this.lookahead.type === 8 /* StringLiteral */ ||
+	            this.lookahead.type === 10 /* Template */;
+	        var argument = hasArgument ? this.parseExpression() : null;
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.ReturnStatement(argument));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-with-statement
+	    Parser.prototype.parseWithStatement = function () {
+	        if (this.context.strict) {
+	            this.tolerateError(messages_1.Messages.StrictModeWith);
+	        }
+	        var node = this.createNode();
+	        var body;
+	        this.expectKeyword('with');
+	        this.expect('(');
+	        var object = this.parseExpression();
+	        if (!this.match(')') && this.config.tolerant) {
+	            this.tolerateUnexpectedToken(this.nextToken());
+	            body = this.finalize(this.createNode(), new Node.EmptyStatement());
+	        }
+	        else {
+	            this.expect(')');
+	            body = this.parseStatement();
+	        }
+	        return this.finalize(node, new Node.WithStatement(object, body));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-switch-statement
+	    Parser.prototype.parseSwitchCase = function () {
+	        var node = this.createNode();
+	        var test;
+	        if (this.matchKeyword('default')) {
+	            this.nextToken();
+	            test = null;
+	        }
+	        else {
+	            this.expectKeyword('case');
+	            test = this.parseExpression();
+	        }
+	        this.expect(':');
+	        var consequent = [];
+	        while (true) {
+	            if (this.match('}') || this.matchKeyword('default') || this.matchKeyword('case')) {
+	                break;
+	            }
+	            consequent.push(this.parseStatementListItem());
+	        }
+	        return this.finalize(node, new Node.SwitchCase(test, consequent));
+	    };
+	    Parser.prototype.parseSwitchStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('switch');
+	        this.expect('(');
+	        var discriminant = this.parseExpression();
+	        this.expect(')');
+	        var previousInSwitch = this.context.inSwitch;
+	        this.context.inSwitch = true;
+	        var cases = [];
+	        var defaultFound = false;
+	        this.expect('{');
+	        while (true) {
+	            if (this.match('}')) {
+	                break;
+	            }
+	            var clause = this.parseSwitchCase();
+	            if (clause.test === null) {
+	                if (defaultFound) {
+	                    this.throwError(messages_1.Messages.MultipleDefaultsInSwitch);
+	                }
+	                defaultFound = true;
+	            }
+	            cases.push(clause);
+	        }
+	        this.expect('}');
+	        this.context.inSwitch = previousInSwitch;
+	        return this.finalize(node, new Node.SwitchStatement(discriminant, cases));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-labelled-statements
+	    Parser.prototype.parseLabelledStatement = function () {
+	        var node = this.createNode();
+	        var expr = this.parseExpression();
+	        var statement;
+	        if ((expr.type === syntax_1.Syntax.Identifier) && this.match(':')) {
+	            this.nextToken();
+	            var id = expr;
+	            var key = '$' + id.name;
+	            if (Object.prototype.hasOwnProperty.call(this.context.labelSet, key)) {
+	                this.throwError(messages_1.Messages.Redeclaration, 'Label', id.name);
+	            }
+	            this.context.labelSet[key] = true;
+	            var body = void 0;
+	            if (this.matchKeyword('class')) {
+	                this.tolerateUnexpectedToken(this.lookahead);
+	                body = this.parseClassDeclaration();
+	            }
+	            else if (this.matchKeyword('function')) {
+	                var token = this.lookahead;
+	                var declaration = this.parseFunctionDeclaration();
+	                if (this.context.strict) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunction);
+	                }
+	                else if (declaration.generator) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.GeneratorInLegacyContext);
+	                }
+	                body = declaration;
+	            }
+	            else {
+	                body = this.parseStatement();
+	            }
+	            delete this.context.labelSet[key];
+	            statement = new Node.LabeledStatement(id, body);
+	        }
+	        else {
+	            this.consumeSemicolon();
+	            statement = new Node.ExpressionStatement(expr);
+	        }
+	        return this.finalize(node, statement);
+	    };
+	    // https://tc39.github.io/ecma262/#sec-throw-statement
+	    Parser.prototype.parseThrowStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('throw');
+	        if (this.hasLineTerminator) {
+	            this.throwError(messages_1.Messages.NewlineAfterThrow);
+	        }
+	        var argument = this.parseExpression();
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.ThrowStatement(argument));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-try-statement
+	    Parser.prototype.parseCatchClause = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('catch');
+	        this.expect('(');
+	        if (this.match(')')) {
+	            this.throwUnexpectedToken(this.lookahead);
+	        }
+	        var params = [];
+	        var param = this.parsePattern(params);
+	        var paramMap = {};
+	        for (var i = 0; i < params.length; i++) {
+	            var key = '$' + params[i].value;
+	            if (Object.prototype.hasOwnProperty.call(paramMap, key)) {
+	                this.tolerateError(messages_1.Messages.DuplicateBinding, params[i].value);
+	            }
+	            paramMap[key] = true;
+	        }
+	        if (this.context.strict && param.type === syntax_1.Syntax.Identifier) {
+	            if (this.scanner.isRestrictedWord(param.name)) {
+	                this.tolerateError(messages_1.Messages.StrictCatchVariable);
+	            }
+	        }
+	        this.expect(')');
+	        var body = this.parseBlock();
+	        return this.finalize(node, new Node.CatchClause(param, body));
+	    };
+	    Parser.prototype.parseFinallyClause = function () {
+	        this.expectKeyword('finally');
+	        return this.parseBlock();
+	    };
+	    Parser.prototype.parseTryStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('try');
+	        var block = this.parseBlock();
+	        var handler = this.matchKeyword('catch') ? this.parseCatchClause() : null;
+	        var finalizer = this.matchKeyword('finally') ? this.parseFinallyClause() : null;
+	        if (!handler && !finalizer) {
+	            this.throwError(messages_1.Messages.NoCatchOrFinally);
+	        }
+	        return this.finalize(node, new Node.TryStatement(block, handler, finalizer));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-debugger-statement
+	    Parser.prototype.parseDebuggerStatement = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('debugger');
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.DebuggerStatement());
+	    };
+	    // https://tc39.github.io/ecma262/#sec-ecmascript-language-statements-and-declarations
+	    Parser.prototype.parseStatement = function () {
+	        var statement;
+	        switch (this.lookahead.type) {
+	            case 1 /* BooleanLiteral */:
+	            case 5 /* NullLiteral */:
+	            case 6 /* NumericLiteral */:
+	            case 8 /* StringLiteral */:
+	            case 10 /* Template */:
+	            case 9 /* RegularExpression */:
+	                statement = this.parseExpressionStatement();
+	                break;
+	            case 7 /* Punctuator */:
+	                var value = this.lookahead.value;
+	                if (value === '{') {
+	                    statement = this.parseBlock();
+	                }
+	                else if (value === '(') {
+	                    statement = this.parseExpressionStatement();
+	                }
+	                else if (value === ';') {
+	                    statement = this.parseEmptyStatement();
+	                }
+	                else {
+	                    statement = this.parseExpressionStatement();
+	                }
+	                break;
+	            case 3 /* Identifier */:
+	                statement = this.matchAsyncFunction() ? this.parseFunctionDeclaration() : this.parseLabelledStatement();
+	                break;
+	            case 4 /* Keyword */:
+	                switch (this.lookahead.value) {
+	                    case 'break':
+	                        statement = this.parseBreakStatement();
+	                        break;
+	                    case 'continue':
+	                        statement = this.parseContinueStatement();
+	                        break;
+	                    case 'debugger':
+	                        statement = this.parseDebuggerStatement();
+	                        break;
+	                    case 'do':
+	                        statement = this.parseDoWhileStatement();
+	                        break;
+	                    case 'for':
+	                        statement = this.parseForStatement();
+	                        break;
+	                    case 'function':
+	                        statement = this.parseFunctionDeclaration();
+	                        break;
+	                    case 'if':
+	                        statement = this.parseIfStatement();
+	                        break;
+	                    case 'return':
+	                        statement = this.parseReturnStatement();
+	                        break;
+	                    case 'switch':
+	                        statement = this.parseSwitchStatement();
+	                        break;
+	                    case 'throw':
+	                        statement = this.parseThrowStatement();
+	                        break;
+	                    case 'try':
+	                        statement = this.parseTryStatement();
+	                        break;
+	                    case 'var':
+	                        statement = this.parseVariableStatement();
+	                        break;
+	                    case 'while':
+	                        statement = this.parseWhileStatement();
+	                        break;
+	                    case 'with':
+	                        statement = this.parseWithStatement();
+	                        break;
+	                    default:
+	                        statement = this.parseExpressionStatement();
+	                        break;
+	                }
+	                break;
+	            default:
+	                statement = this.throwUnexpectedToken(this.lookahead);
+	        }
+	        return statement;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-function-definitions
+	    Parser.prototype.parseFunctionSourceElements = function () {
+	        var node = this.createNode();
+	        this.expect('{');
+	        var body = this.parseDirectivePrologues();
+	        var previousLabelSet = this.context.labelSet;
+	        var previousInIteration = this.context.inIteration;
+	        var previousInSwitch = this.context.inSwitch;
+	        var previousInFunctionBody = this.context.inFunctionBody;
+	        this.context.labelSet = {};
+	        this.context.inIteration = false;
+	        this.context.inSwitch = false;
+	        this.context.inFunctionBody = true;
+	        while (this.lookahead.type !== 2 /* EOF */) {
+	            if (this.match('}')) {
+	                break;
+	            }
+	            body.push(this.parseStatementListItem());
+	        }
+	        this.expect('}');
+	        this.context.labelSet = previousLabelSet;
+	        this.context.inIteration = previousInIteration;
+	        this.context.inSwitch = previousInSwitch;
+	        this.context.inFunctionBody = previousInFunctionBody;
+	        return this.finalize(node, new Node.BlockStatement(body));
+	    };
+	    Parser.prototype.validateParam = function (options, param, name) {
+	        var key = '$' + name;
+	        if (this.context.strict) {
+	            if (this.scanner.isRestrictedWord(name)) {
+	                options.stricted = param;
+	                options.message = messages_1.Messages.StrictParamName;
+	            }
+	            if (Object.prototype.hasOwnProperty.call(options.paramSet, key)) {
+	                options.stricted = param;
+	                options.message = messages_1.Messages.StrictParamDupe;
+	            }
+	        }
+	        else if (!options.firstRestricted) {
+	            if (this.scanner.isRestrictedWord(name)) {
+	                options.firstRestricted = param;
+	                options.message = messages_1.Messages.StrictParamName;
+	            }
+	            else if (this.scanner.isStrictModeReservedWord(name)) {
+	                options.firstRestricted = param;
+	                options.message = messages_1.Messages.StrictReservedWord;
+	            }
+	            else if (Object.prototype.hasOwnProperty.call(options.paramSet, key)) {
+	                options.stricted = param;
+	                options.message = messages_1.Messages.StrictParamDupe;
+	            }
+	        }
+	        /* istanbul ignore next */
+	        if (typeof Object.defineProperty === 'function') {
+	            Object.defineProperty(options.paramSet, key, { value: true, enumerable: true, writable: true, configurable: true });
+	        }
+	        else {
+	            options.paramSet[key] = true;
+	        }
+	    };
+	    Parser.prototype.parseRestElement = function (params) {
+	        var node = this.createNode();
+	        this.expect('...');
+	        var arg = this.parsePattern(params);
+	        if (this.match('=')) {
+	            this.throwError(messages_1.Messages.DefaultRestParameter);
+	        }
+	        if (!this.match(')')) {
+	            this.throwError(messages_1.Messages.ParameterAfterRestParameter);
+	        }
+	        return this.finalize(node, new Node.RestElement(arg));
+	    };
+	    Parser.prototype.parseFormalParameter = function (options) {
+	        var params = [];
+	        var param = this.match('...') ? this.parseRestElement(params) : this.parsePatternWithDefault(params);
+	        for (var i = 0; i < params.length; i++) {
+	            this.validateParam(options, params[i], params[i].value);
+	        }
+	        options.simple = options.simple && (param instanceof Node.Identifier);
+	        options.params.push(param);
+	    };
+	    Parser.prototype.parseFormalParameters = function (firstRestricted) {
+	        var options;
+	        options = {
+	            simple: true,
+	            params: [],
+	            firstRestricted: firstRestricted
+	        };
+	        this.expect('(');
+	        if (!this.match(')')) {
+	            options.paramSet = {};
+	            while (this.lookahead.type !== 2 /* EOF */) {
+	                this.parseFormalParameter(options);
+	                if (this.match(')')) {
+	                    break;
+	                }
+	                this.expect(',');
+	                if (this.match(')')) {
+	                    break;
+	                }
+	            }
+	        }
+	        this.expect(')');
+	        return {
+	            simple: options.simple,
+	            params: options.params,
+	            stricted: options.stricted,
+	            firstRestricted: options.firstRestricted,
+	            message: options.message
+	        };
+	    };
+	    Parser.prototype.matchAsyncFunction = function () {
+	        var match = this.matchContextualKeyword('async');
+	        if (match) {
+	            var state = this.scanner.saveState();
+	            this.scanner.scanComments();
+	            var next = this.scanner.lex();
+	            this.scanner.restoreState(state);
+	            match = (state.lineNumber === next.lineNumber) && (next.type === 4 /* Keyword */) && (next.value === 'function');
+	        }
+	        return match;
+	    };
+	    Parser.prototype.parseFunctionDeclaration = function (identifierIsOptional) {
+	        var node = this.createNode();
+	        var isAsync = this.matchContextualKeyword('async');
+	        if (isAsync) {
+	            this.nextToken();
+	        }
+	        this.expectKeyword('function');
+	        var isGenerator = isAsync ? false : this.match('*');
+	        if (isGenerator) {
+	            this.nextToken();
+	        }
+	        var message;
+	        var id = null;
+	        var firstRestricted = null;
+	        if (!identifierIsOptional || !this.match('(')) {
+	            var token = this.lookahead;
+	            id = this.parseVariableIdentifier();
+	            if (this.context.strict) {
+	                if (this.scanner.isRestrictedWord(token.value)) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunctionName);
+	                }
+	            }
+	            else {
+	                if (this.scanner.isRestrictedWord(token.value)) {
+	                    firstRestricted = token;
+	                    message = messages_1.Messages.StrictFunctionName;
+	                }
+	                else if (this.scanner.isStrictModeReservedWord(token.value)) {
+	                    firstRestricted = token;
+	                    message = messages_1.Messages.StrictReservedWord;
+	                }
+	            }
+	        }
+	        var previousAllowAwait = this.context.await;
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.await = isAsync;
+	        this.context.allowYield = !isGenerator;
+	        var formalParameters = this.parseFormalParameters(firstRestricted);
+	        var params = formalParameters.params;
+	        var stricted = formalParameters.stricted;
+	        firstRestricted = formalParameters.firstRestricted;
+	        if (formalParameters.message) {
+	            message = formalParameters.message;
+	        }
+	        var previousStrict = this.context.strict;
+	        var previousAllowStrictDirective = this.context.allowStrictDirective;
+	        this.context.allowStrictDirective = formalParameters.simple;
+	        var body = this.parseFunctionSourceElements();
+	        if (this.context.strict && firstRestricted) {
+	            this.throwUnexpectedToken(firstRestricted, message);
+	        }
+	        if (this.context.strict && stricted) {
+	            this.tolerateUnexpectedToken(stricted, message);
+	        }
+	        this.context.strict = previousStrict;
+	        this.context.allowStrictDirective = previousAllowStrictDirective;
+	        this.context.await = previousAllowAwait;
+	        this.context.allowYield = previousAllowYield;
+	        return isAsync ? this.finalize(node, new Node.AsyncFunctionDeclaration(id, params, body)) :
+	            this.finalize(node, new Node.FunctionDeclaration(id, params, body, isGenerator));
+	    };
+	    Parser.prototype.parseFunctionExpression = function () {
+	        var node = this.createNode();
+	        var isAsync = this.matchContextualKeyword('async');
+	        if (isAsync) {
+	            this.nextToken();
+	        }
+	        this.expectKeyword('function');
+	        var isGenerator = isAsync ? false : this.match('*');
+	        if (isGenerator) {
+	            this.nextToken();
+	        }
+	        var message;
+	        var id = null;
+	        var firstRestricted;
+	        var previousAllowAwait = this.context.await;
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.await = isAsync;
+	        this.context.allowYield = !isGenerator;
+	        if (!this.match('(')) {
+	            var token = this.lookahead;
+	            id = (!this.context.strict && !isGenerator && this.matchKeyword('yield')) ? this.parseIdentifierName() : this.parseVariableIdentifier();
+	            if (this.context.strict) {
+	                if (this.scanner.isRestrictedWord(token.value)) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.StrictFunctionName);
+	                }
+	            }
+	            else {
+	                if (this.scanner.isRestrictedWord(token.value)) {
+	                    firstRestricted = token;
+	                    message = messages_1.Messages.StrictFunctionName;
+	                }
+	                else if (this.scanner.isStrictModeReservedWord(token.value)) {
+	                    firstRestricted = token;
+	                    message = messages_1.Messages.StrictReservedWord;
+	                }
+	            }
+	        }
+	        var formalParameters = this.parseFormalParameters(firstRestricted);
+	        var params = formalParameters.params;
+	        var stricted = formalParameters.stricted;
+	        firstRestricted = formalParameters.firstRestricted;
+	        if (formalParameters.message) {
+	            message = formalParameters.message;
+	        }
+	        var previousStrict = this.context.strict;
+	        var previousAllowStrictDirective = this.context.allowStrictDirective;
+	        this.context.allowStrictDirective = formalParameters.simple;
+	        var body = this.parseFunctionSourceElements();
+	        if (this.context.strict && firstRestricted) {
+	            this.throwUnexpectedToken(firstRestricted, message);
+	        }
+	        if (this.context.strict && stricted) {
+	            this.tolerateUnexpectedToken(stricted, message);
+	        }
+	        this.context.strict = previousStrict;
+	        this.context.allowStrictDirective = previousAllowStrictDirective;
+	        this.context.await = previousAllowAwait;
+	        this.context.allowYield = previousAllowYield;
+	        return isAsync ? this.finalize(node, new Node.AsyncFunctionExpression(id, params, body)) :
+	            this.finalize(node, new Node.FunctionExpression(id, params, body, isGenerator));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-directive-prologues-and-the-use-strict-directive
+	    Parser.prototype.parseDirective = function () {
+	        var token = this.lookahead;
+	        var node = this.createNode();
+	        var expr = this.parseExpression();
+	        var directive = (expr.type === syntax_1.Syntax.Literal) ? this.getTokenRaw(token).slice(1, -1) : null;
+	        this.consumeSemicolon();
+	        return this.finalize(node, directive ? new Node.Directive(expr, directive) : new Node.ExpressionStatement(expr));
+	    };
+	    Parser.prototype.parseDirectivePrologues = function () {
+	        var firstRestricted = null;
+	        var body = [];
+	        while (true) {
+	            var token = this.lookahead;
+	            if (token.type !== 8 /* StringLiteral */) {
+	                break;
+	            }
+	            var statement = this.parseDirective();
+	            body.push(statement);
+	            var directive = statement.directive;
+	            if (typeof directive !== 'string') {
+	                break;
+	            }
+	            if (directive === 'use strict') {
+	                this.context.strict = true;
+	                if (firstRestricted) {
+	                    this.tolerateUnexpectedToken(firstRestricted, messages_1.Messages.StrictOctalLiteral);
+	                }
+	                if (!this.context.allowStrictDirective) {
+	                    this.tolerateUnexpectedToken(token, messages_1.Messages.IllegalLanguageModeDirective);
+	                }
+	            }
+	            else {
+	                if (!firstRestricted && token.octal) {
+	                    firstRestricted = token;
+	                }
+	            }
+	        }
+	        return body;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-method-definitions
+	    Parser.prototype.qualifiedPropertyName = function (token) {
+	        switch (token.type) {
+	            case 3 /* Identifier */:
+	            case 8 /* StringLiteral */:
+	            case 1 /* BooleanLiteral */:
+	            case 5 /* NullLiteral */:
+	            case 6 /* NumericLiteral */:
+	            case 4 /* Keyword */:
+	                return true;
+	            case 7 /* Punctuator */:
+	                return token.value === '[';
+	            default:
+	                break;
+	        }
+	        return false;
+	    };
+	    Parser.prototype.parseGetterMethod = function () {
+	        var node = this.createNode();
+	        var isGenerator = false;
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.allowYield = !isGenerator;
+	        var formalParameters = this.parseFormalParameters();
+	        if (formalParameters.params.length > 0) {
+	            this.tolerateError(messages_1.Messages.BadGetterArity);
+	        }
+	        var method = this.parsePropertyMethod(formalParameters);
+	        this.context.allowYield = previousAllowYield;
+	        return this.finalize(node, new Node.FunctionExpression(null, formalParameters.params, method, isGenerator));
+	    };
+	    Parser.prototype.parseSetterMethod = function () {
+	        var node = this.createNode();
+	        var isGenerator = false;
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.allowYield = !isGenerator;
+	        var formalParameters = this.parseFormalParameters();
+	        if (formalParameters.params.length !== 1) {
+	            this.tolerateError(messages_1.Messages.BadSetterArity);
+	        }
+	        else if (formalParameters.params[0] instanceof Node.RestElement) {
+	            this.tolerateError(messages_1.Messages.BadSetterRestParameter);
+	        }
+	        var method = this.parsePropertyMethod(formalParameters);
+	        this.context.allowYield = previousAllowYield;
+	        return this.finalize(node, new Node.FunctionExpression(null, formalParameters.params, method, isGenerator));
+	    };
+	    Parser.prototype.parseGeneratorMethod = function () {
+	        var node = this.createNode();
+	        var isGenerator = true;
+	        var previousAllowYield = this.context.allowYield;
+	        this.context.allowYield = true;
+	        var params = this.parseFormalParameters();
+	        this.context.allowYield = false;
+	        var method = this.parsePropertyMethod(params);
+	        this.context.allowYield = previousAllowYield;
+	        return this.finalize(node, new Node.FunctionExpression(null, params.params, method, isGenerator));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-generator-function-definitions
+	    Parser.prototype.isStartOfExpression = function () {
+	        var start = true;
+	        var value = this.lookahead.value;
+	        switch (this.lookahead.type) {
+	            case 7 /* Punctuator */:
+	                start = (value === '[') || (value === '(') || (value === '{') ||
+	                    (value === '+') || (value === '-') ||
+	                    (value === '!') || (value === '~') ||
+	                    (value === '++') || (value === '--') ||
+	                    (value === '/') || (value === '/='); // regular expression literal
+	                break;
+	            case 4 /* Keyword */:
+	                start = (value === 'class') || (value === 'delete') ||
+	                    (value === 'function') || (value === 'let') || (value === 'new') ||
+	                    (value === 'super') || (value === 'this') || (value === 'typeof') ||
+	                    (value === 'void') || (value === 'yield');
+	                break;
+	            default:
+	                break;
+	        }
+	        return start;
+	    };
+	    Parser.prototype.parseYieldExpression = function () {
+	        var node = this.createNode();
+	        this.expectKeyword('yield');
+	        var argument = null;
+	        var delegate = false;
+	        if (!this.hasLineTerminator) {
+	            var previousAllowYield = this.context.allowYield;
+	            this.context.allowYield = false;
+	            delegate = this.match('*');
+	            if (delegate) {
+	                this.nextToken();
+	                argument = this.parseAssignmentExpression();
+	            }
+	            else if (this.isStartOfExpression()) {
+	                argument = this.parseAssignmentExpression();
+	            }
+	            this.context.allowYield = previousAllowYield;
+	        }
+	        return this.finalize(node, new Node.YieldExpression(argument, delegate));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-class-definitions
+	    Parser.prototype.parseClassElement = function (hasConstructor) {
+	        var token = this.lookahead;
+	        var node = this.createNode();
+	        var kind = '';
+	        var key = null;
+	        var value = null;
+	        var computed = false;
+	        var method = false;
+	        var isStatic = false;
+	        var isAsync = false;
+	        if (this.match('*')) {
+	            this.nextToken();
+	        }
+	        else {
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            var id = key;
+	            if (id.name === 'static' && (this.qualifiedPropertyName(this.lookahead) || this.match('*'))) {
+	                token = this.lookahead;
+	                isStatic = true;
+	                computed = this.match('[');
+	                if (this.match('*')) {
+	                    this.nextToken();
+	                }
+	                else {
+	                    key = this.parseObjectPropertyKey();
+	                }
+	            }
+	            if ((token.type === 3 /* Identifier */) && !this.hasLineTerminator && (token.value === 'async')) {
+	                var punctuator = this.lookahead.value;
+	                if (punctuator !== ':' && punctuator !== '(' && punctuator !== '*') {
+	                    isAsync = true;
+	                    token = this.lookahead;
+	                    key = this.parseObjectPropertyKey();
+	                    if (token.type === 3 /* Identifier */ && token.value === 'constructor') {
+	                        this.tolerateUnexpectedToken(token, messages_1.Messages.ConstructorIsAsync);
+	                    }
+	                }
+	            }
+	        }
+	        var lookaheadPropertyKey = this.qualifiedPropertyName(this.lookahead);
+	        if (token.type === 3 /* Identifier */) {
+	            if (token.value === 'get' && lookaheadPropertyKey) {
+	                kind = 'get';
+	                computed = this.match('[');
+	                key = this.parseObjectPropertyKey();
+	                this.context.allowYield = false;
+	                value = this.parseGetterMethod();
+	            }
+	            else if (token.value === 'set' && lookaheadPropertyKey) {
+	                kind = 'set';
+	                computed = this.match('[');
+	                key = this.parseObjectPropertyKey();
+	                value = this.parseSetterMethod();
+	            }
+	        }
+	        else if (token.type === 7 /* Punctuator */ && token.value === '*' && lookaheadPropertyKey) {
+	            kind = 'init';
+	            computed = this.match('[');
+	            key = this.parseObjectPropertyKey();
+	            value = this.parseGeneratorMethod();
+	            method = true;
+	        }
+	        if (!kind && key && this.match('(')) {
+	            kind = 'init';
+	            value = isAsync ? this.parsePropertyMethodAsyncFunction() : this.parsePropertyMethodFunction();
+	            method = true;
+	        }
+	        if (!kind) {
+	            this.throwUnexpectedToken(this.lookahead);
+	        }
+	        if (kind === 'init') {
+	            kind = 'method';
+	        }
+	        if (!computed) {
+	            if (isStatic && this.isPropertyKey(key, 'prototype')) {
+	                this.throwUnexpectedToken(token, messages_1.Messages.StaticPrototype);
+	            }
+	            if (!isStatic && this.isPropertyKey(key, 'constructor')) {
+	                if (kind !== 'method' || !method || (value && value.generator)) {
+	                    this.throwUnexpectedToken(token, messages_1.Messages.ConstructorSpecialMethod);
+	                }
+	                if (hasConstructor.value) {
+	                    this.throwUnexpectedToken(token, messages_1.Messages.DuplicateConstructor);
+	                }
+	                else {
+	                    hasConstructor.value = true;
+	                }
+	                kind = 'constructor';
+	            }
+	        }
+	        return this.finalize(node, new Node.MethodDefinition(key, computed, value, kind, isStatic));
+	    };
+	    Parser.prototype.parseClassElementList = function () {
+	        var body = [];
+	        var hasConstructor = { value: false };
+	        this.expect('{');
+	        while (!this.match('}')) {
+	            if (this.match(';')) {
+	                this.nextToken();
+	            }
+	            else {
+	                body.push(this.parseClassElement(hasConstructor));
+	            }
+	        }
+	        this.expect('}');
+	        return body;
+	    };
+	    Parser.prototype.parseClassBody = function () {
+	        var node = this.createNode();
+	        var elementList = this.parseClassElementList();
+	        return this.finalize(node, new Node.ClassBody(elementList));
+	    };
+	    Parser.prototype.parseClassDeclaration = function (identifierIsOptional) {
+	        var node = this.createNode();
+	        var previousStrict = this.context.strict;
+	        this.context.strict = true;
+	        this.expectKeyword('class');
+	        var id = (identifierIsOptional && (this.lookahead.type !== 3 /* Identifier */)) ? null : this.parseVariableIdentifier();
+	        var superClass = null;
+	        if (this.matchKeyword('extends')) {
+	            this.nextToken();
+	            superClass = this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+	        }
+	        var classBody = this.parseClassBody();
+	        this.context.strict = previousStrict;
+	        return this.finalize(node, new Node.ClassDeclaration(id, superClass, classBody));
+	    };
+	    Parser.prototype.parseClassExpression = function () {
+	        var node = this.createNode();
+	        var previousStrict = this.context.strict;
+	        this.context.strict = true;
+	        this.expectKeyword('class');
+	        var id = (this.lookahead.type === 3 /* Identifier */) ? this.parseVariableIdentifier() : null;
+	        var superClass = null;
+	        if (this.matchKeyword('extends')) {
+	            this.nextToken();
+	            superClass = this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);
+	        }
+	        var classBody = this.parseClassBody();
+	        this.context.strict = previousStrict;
+	        return this.finalize(node, new Node.ClassExpression(id, superClass, classBody));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-scripts
+	    // https://tc39.github.io/ecma262/#sec-modules
+	    Parser.prototype.parseModule = function () {
+	        this.context.strict = true;
+	        this.context.isModule = true;
+	        this.scanner.isModule = true;
+	        var node = this.createNode();
+	        var body = this.parseDirectivePrologues();
+	        while (this.lookahead.type !== 2 /* EOF */) {
+	            body.push(this.parseStatementListItem());
+	        }
+	        return this.finalize(node, new Node.Module(body));
+	    };
+	    Parser.prototype.parseScript = function () {
+	        var node = this.createNode();
+	        var body = this.parseDirectivePrologues();
+	        while (this.lookahead.type !== 2 /* EOF */) {
+	            body.push(this.parseStatementListItem());
+	        }
+	        return this.finalize(node, new Node.Script(body));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-imports
+	    Parser.prototype.parseModuleSpecifier = function () {
+	        var node = this.createNode();
+	        if (this.lookahead.type !== 8 /* StringLiteral */) {
+	            this.throwError(messages_1.Messages.InvalidModuleSpecifier);
+	        }
+	        var token = this.nextToken();
+	        var raw = this.getTokenRaw(token);
+	        return this.finalize(node, new Node.Literal(token.value, raw));
+	    };
+	    // import {<foo as bar>} ...;
+	    Parser.prototype.parseImportSpecifier = function () {
+	        var node = this.createNode();
+	        var imported;
+	        var local;
+	        if (this.lookahead.type === 3 /* Identifier */) {
+	            imported = this.parseVariableIdentifier();
+	            local = imported;
+	            if (this.matchContextualKeyword('as')) {
+	                this.nextToken();
+	                local = this.parseVariableIdentifier();
+	            }
+	        }
+	        else {
+	            imported = this.parseIdentifierName();
+	            local = imported;
+	            if (this.matchContextualKeyword('as')) {
+	                this.nextToken();
+	                local = this.parseVariableIdentifier();
+	            }
+	            else {
+	                this.throwUnexpectedToken(this.nextToken());
+	            }
+	        }
+	        return this.finalize(node, new Node.ImportSpecifier(local, imported));
+	    };
+	    // {foo, bar as bas}
+	    Parser.prototype.parseNamedImports = function () {
+	        this.expect('{');
+	        var specifiers = [];
+	        while (!this.match('}')) {
+	            specifiers.push(this.parseImportSpecifier());
+	            if (!this.match('}')) {
+	                this.expect(',');
+	            }
+	        }
+	        this.expect('}');
+	        return specifiers;
+	    };
+	    // import <foo> ...;
+	    Parser.prototype.parseImportDefaultSpecifier = function () {
+	        var node = this.createNode();
+	        var local = this.parseIdentifierName();
+	        return this.finalize(node, new Node.ImportDefaultSpecifier(local));
+	    };
+	    // import <* as foo> ...;
+	    Parser.prototype.parseImportNamespaceSpecifier = function () {
+	        var node = this.createNode();
+	        this.expect('*');
+	        if (!this.matchContextualKeyword('as')) {
+	            this.throwError(messages_1.Messages.NoAsAfterImportNamespace);
+	        }
+	        this.nextToken();
+	        var local = this.parseIdentifierName();
+	        return this.finalize(node, new Node.ImportNamespaceSpecifier(local));
+	    };
+	    Parser.prototype.parseImportDeclaration = function () {
+	        if (this.context.inFunctionBody) {
+	            this.throwError(messages_1.Messages.IllegalImportDeclaration);
+	        }
+	        var node = this.createNode();
+	        this.expectKeyword('import');
+	        var src;
+	        var specifiers = [];
+	        if (this.lookahead.type === 8 /* StringLiteral */) {
+	            // import 'foo';
+	            src = this.parseModuleSpecifier();
+	        }
+	        else {
+	            if (this.match('{')) {
+	                // import {bar}
+	                specifiers = specifiers.concat(this.parseNamedImports());
+	            }
+	            else if (this.match('*')) {
+	                // import * as foo
+	                specifiers.push(this.parseImportNamespaceSpecifier());
+	            }
+	            else if (this.isIdentifierName(this.lookahead) && !this.matchKeyword('default')) {
+	                // import foo
+	                specifiers.push(this.parseImportDefaultSpecifier());
+	                if (this.match(',')) {
+	                    this.nextToken();
+	                    if (this.match('*')) {
+	                        // import foo, * as foo
+	                        specifiers.push(this.parseImportNamespaceSpecifier());
+	                    }
+	                    else if (this.match('{')) {
+	                        // import foo, {bar}
+	                        specifiers = specifiers.concat(this.parseNamedImports());
+	                    }
+	                    else {
+	                        this.throwUnexpectedToken(this.lookahead);
+	                    }
+	                }
+	            }
+	            else {
+	                this.throwUnexpectedToken(this.nextToken());
+	            }
+	            if (!this.matchContextualKeyword('from')) {
+	                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+	                this.throwError(message, this.lookahead.value);
+	            }
+	            this.nextToken();
+	            src = this.parseModuleSpecifier();
+	        }
+	        this.consumeSemicolon();
+	        return this.finalize(node, new Node.ImportDeclaration(specifiers, src));
+	    };
+	    // https://tc39.github.io/ecma262/#sec-exports
+	    Parser.prototype.parseExportSpecifier = function () {
+	        var node = this.createNode();
+	        var local = this.parseIdentifierName();
+	        var exported = local;
+	        if (this.matchContextualKeyword('as')) {
+	            this.nextToken();
+	            exported = this.parseIdentifierName();
+	        }
+	        return this.finalize(node, new Node.ExportSpecifier(local, exported));
+	    };
+	    Parser.prototype.parseExportDeclaration = function () {
+	        if (this.context.inFunctionBody) {
+	            this.throwError(messages_1.Messages.IllegalExportDeclaration);
+	        }
+	        var node = this.createNode();
+	        this.expectKeyword('export');
+	        var exportDeclaration;
+	        if (this.matchKeyword('default')) {
+	            // export default ...
+	            this.nextToken();
+	            if (this.matchKeyword('function')) {
+	                // export default function foo () {}
+	                // export default function () {}
+	                var declaration = this.parseFunctionDeclaration(true);
+	                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+	            }
+	            else if (this.matchKeyword('class')) {
+	                // export default class foo {}
+	                var declaration = this.parseClassDeclaration(true);
+	                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+	            }
+	            else if (this.matchContextualKeyword('async')) {
+	                // export default async function f () {}
+	                // export default async function () {}
+	                // export default async x => x
+	                var declaration = this.matchAsyncFunction() ? this.parseFunctionDeclaration(true) : this.parseAssignmentExpression();
+	                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+	            }
+	            else {
+	                if (this.matchContextualKeyword('from')) {
+	                    this.throwError(messages_1.Messages.UnexpectedToken, this.lookahead.value);
+	                }
+	                // export default {};
+	                // export default [];
+	                // export default (1 + 2);
+	                var declaration = this.match('{') ? this.parseObjectInitializer() :
+	                    this.match('[') ? this.parseArrayInitializer() : this.parseAssignmentExpression();
+	                this.consumeSemicolon();
+	                exportDeclaration = this.finalize(node, new Node.ExportDefaultDeclaration(declaration));
+	            }
+	        }
+	        else if (this.match('*')) {
+	            // export * from 'foo';
+	            this.nextToken();
+	            if (!this.matchContextualKeyword('from')) {
+	                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+	                this.throwError(message, this.lookahead.value);
+	            }
+	            this.nextToken();
+	            var src = this.parseModuleSpecifier();
+	            this.consumeSemicolon();
+	            exportDeclaration = this.finalize(node, new Node.ExportAllDeclaration(src));
+	        }
+	        else if (this.lookahead.type === 4 /* Keyword */) {
+	            // export var f = 1;
+	            var declaration = void 0;
+	            switch (this.lookahead.value) {
+	                case 'let':
+	                case 'const':
+	                    declaration = this.parseLexicalDeclaration({ inFor: false });
+	                    break;
+	                case 'var':
+	                case 'class':
+	                case 'function':
+	                    declaration = this.parseStatementListItem();
+	                    break;
+	                default:
+	                    this.throwUnexpectedToken(this.lookahead);
+	            }
+	            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(declaration, [], null));
+	        }
+	        else if (this.matchAsyncFunction()) {
+	            var declaration = this.parseFunctionDeclaration();
+	            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(declaration, [], null));
+	        }
+	        else {
+	            var specifiers = [];
+	            var source = null;
+	            var isExportFromIdentifier = false;
+	            this.expect('{');
+	            while (!this.match('}')) {
+	                isExportFromIdentifier = isExportFromIdentifier || this.matchKeyword('default');
+	                specifiers.push(this.parseExportSpecifier());
+	                if (!this.match('}')) {
+	                    this.expect(',');
+	                }
+	            }
+	            this.expect('}');
+	            if (this.matchContextualKeyword('from')) {
+	                // export {default} from 'foo';
+	                // export {foo} from 'foo';
+	                this.nextToken();
+	                source = this.parseModuleSpecifier();
+	                this.consumeSemicolon();
+	            }
+	            else if (isExportFromIdentifier) {
+	                // export {default}; // missing fromClause
+	                var message = this.lookahead.value ? messages_1.Messages.UnexpectedToken : messages_1.Messages.MissingFromClause;
+	                this.throwError(message, this.lookahead.value);
+	            }
+	            else {
+	                // export {foo};
+	                this.consumeSemicolon();
+	            }
+	            exportDeclaration = this.finalize(node, new Node.ExportNamedDeclaration(null, specifiers, source));
+	        }
+	        return exportDeclaration;
+	    };
+	    return Parser;
+	}());
+	exports.Parser = Parser;
+
+
+/***/ },
+/* 9 */
+/***/ function(module, exports) {
+
+	"use strict";
+	// Ensure the condition is true, otherwise throw an error.
+	// This is only to have a better contract semantic, i.e. another safety net
+	// to catch a logic error. The condition shall be fulfilled in normal case.
+	// Do NOT use this to enforce a certain condition on any user input.
+	Object.defineProperty(exports, "__esModule", { value: true });
+	function assert(condition, message) {
+	    /* istanbul ignore if */
+	    if (!condition) {
+	        throw new Error('ASSERT: ' + message);
+	    }
+	}
+	exports.assert = assert;
+
+
+/***/ },
+/* 10 */
+/***/ function(module, exports) {
+
+	"use strict";
+	/* tslint:disable:max-classes-per-file */
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var ErrorHandler = (function () {
+	    function ErrorHandler() {
+	        this.errors = [];
+	        this.tolerant = false;
+	    }
+	    ErrorHandler.prototype.recordError = function (error) {
+	        this.errors.push(error);
+	    };
+	    ErrorHandler.prototype.tolerate = function (error) {
+	        if (this.tolerant) {
+	            this.recordError(error);
+	        }
+	        else {
+	            throw error;
+	        }
+	    };
+	    ErrorHandler.prototype.constructError = function (msg, column) {
+	        var error = new Error(msg);
+	        try {
+	            throw error;
+	        }
+	        catch (base) {
+	            /* istanbul ignore else */
+	            if (Object.create && Object.defineProperty) {
+	                error = Object.create(base);
+	                Object.defineProperty(error, 'column', { value: column });
+	            }
+	        }
+	        /* istanbul ignore next */
+	        return error;
+	    };
+	    ErrorHandler.prototype.createError = function (index, line, col, description) {
+	        var msg = 'Line ' + line + ': ' + description;
+	        var error = this.constructError(msg, col);
+	        error.index = index;
+	        error.lineNumber = line;
+	        error.description = description;
+	        return error;
+	    };
+	    ErrorHandler.prototype.throwError = function (index, line, col, description) {
+	        throw this.createError(index, line, col, description);
+	    };
+	    ErrorHandler.prototype.tolerateError = function (index, line, col, description) {
+	        var error = this.createError(index, line, col, description);
+	        if (this.tolerant) {
+	            this.recordError(error);
+	        }
+	        else {
+	            throw error;
+	        }
+	    };
+	    return ErrorHandler;
+	}());
+	exports.ErrorHandler = ErrorHandler;
+
+
+/***/ },
+/* 11 */
+/***/ function(module, exports) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	// Error messages should be identical to V8.
+	exports.Messages = {
+	    BadGetterArity: 'Getter must not have any formal parameters',
+	    BadSetterArity: 'Setter must have exactly one formal parameter',
+	    BadSetterRestParameter: 'Setter function argument must not be a rest parameter',
+	    ConstructorIsAsync: 'Class constructor may not be an async method',
+	    ConstructorSpecialMethod: 'Class constructor may not be an accessor',
+	    DeclarationMissingInitializer: 'Missing initializer in %0 declaration',
+	    DefaultRestParameter: 'Unexpected token =',
+	    DuplicateBinding: 'Duplicate binding %0',
+	    DuplicateConstructor: 'A class may only have one constructor',
+	    DuplicateProtoProperty: 'Duplicate __proto__ fields are not allowed in object literals',
+	    ForInOfLoopInitializer: '%0 loop variable declaration may not have an initializer',
+	    GeneratorInLegacyContext: 'Generator declarations are not allowed in legacy contexts',
+	    IllegalBreak: 'Illegal break statement',
+	    IllegalContinue: 'Illegal continue statement',
+	    IllegalExportDeclaration: 'Unexpected token',
+	    IllegalImportDeclaration: 'Unexpected token',
+	    IllegalLanguageModeDirective: 'Illegal \'use strict\' directive in function with non-simple parameter list',
+	    IllegalReturn: 'Illegal return statement',
+	    InvalidEscapedReservedWord: 'Keyword must not contain escaped characters',
+	    InvalidHexEscapeSequence: 'Invalid hexadecimal escape sequence',
+	    InvalidLHSInAssignment: 'Invalid left-hand side in assignment',
+	    InvalidLHSInForIn: 'Invalid left-hand side in for-in',
+	    InvalidLHSInForLoop: 'Invalid left-hand side in for-loop',
+	    InvalidModuleSpecifier: 'Unexpected token',
+	    InvalidRegExp: 'Invalid regular expression',
+	    LetInLexicalBinding: 'let is disallowed as a lexically bound name',
+	    MissingFromClause: 'Unexpected token',
+	    MultipleDefaultsInSwitch: 'More than one default clause in switch statement',
+	    NewlineAfterThrow: 'Illegal newline after throw',
+	    NoAsAfterImportNamespace: 'Unexpected token',
+	    NoCatchOrFinally: 'Missing catch or finally after try',
+	    ParameterAfterRestParameter: 'Rest parameter must be last formal parameter',
+	    Redeclaration: '%0 \'%1\' has already been declared',
+	    StaticPrototype: 'Classes may not have static property named prototype',
+	    StrictCatchVariable: 'Catch variable may not be eval or arguments in strict mode',
+	    StrictDelete: 'Delete of an unqualified identifier in strict mode.',
+	    StrictFunction: 'In strict mode code, functions can only be declared at top level or inside a block',
+	    StrictFunctionName: 'Function name may not be eval or arguments in strict mode',
+	    StrictLHSAssignment: 'Assignment to eval or arguments is not allowed in strict mode',
+	    StrictLHSPostfix: 'Postfix increment/decrement may not have eval or arguments operand in strict mode',
+	    StrictLHSPrefix: 'Prefix increment/decrement may not have eval or arguments operand in strict mode',
+	    StrictModeWith: 'Strict mode code may not include a with statement',
+	    StrictOctalLiteral: 'Octal literals are not allowed in strict mode.',
+	    StrictParamDupe: 'Strict mode function may not have duplicate parameter names',
+	    StrictParamName: 'Parameter name eval or arguments is not allowed in strict mode',
+	    StrictReservedWord: 'Use of future reserved word in strict mode',
+	    StrictVarName: 'Variable name may not be eval or arguments in strict mode',
+	    TemplateOctalLiteral: 'Octal literals are not allowed in template strings.',
+	    UnexpectedEOS: 'Unexpected end of input',
+	    UnexpectedIdentifier: 'Unexpected identifier',
+	    UnexpectedNumber: 'Unexpected number',
+	    UnexpectedReserved: 'Unexpected reserved word',
+	    UnexpectedString: 'Unexpected string',
+	    UnexpectedTemplate: 'Unexpected quasi %0',
+	    UnexpectedToken: 'Unexpected token %0',
+	    UnexpectedTokenIllegal: 'Unexpected token ILLEGAL',
+	    UnknownLabel: 'Undefined label \'%0\'',
+	    UnterminatedRegExp: 'Invalid regular expression: missing /'
+	};
+
+
+/***/ },
+/* 12 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var assert_1 = __webpack_require__(9);
+	var character_1 = __webpack_require__(4);
+	var messages_1 = __webpack_require__(11);
+	function hexValue(ch) {
+	    return '0123456789abcdef'.indexOf(ch.toLowerCase());
+	}
+	function octalValue(ch) {
+	    return '01234567'.indexOf(ch);
+	}
+	var Scanner = (function () {
+	    function Scanner(code, handler) {
+	        this.source = code;
+	        this.errorHandler = handler;
+	        this.trackComment = false;
+	        this.isModule = false;
+	        this.length = code.length;
+	        this.index = 0;
+	        this.lineNumber = (code.length > 0) ? 1 : 0;
+	        this.lineStart = 0;
+	        this.curlyStack = [];
+	    }
+	    Scanner.prototype.saveState = function () {
+	        return {
+	            index: this.index,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart
+	        };
+	    };
+	    Scanner.prototype.restoreState = function (state) {
+	        this.index = state.index;
+	        this.lineNumber = state.lineNumber;
+	        this.lineStart = state.lineStart;
+	    };
+	    Scanner.prototype.eof = function () {
+	        return this.index >= this.length;
+	    };
+	    Scanner.prototype.throwUnexpectedToken = function (message) {
+	        if (message === void 0) { message = messages_1.Messages.UnexpectedTokenIllegal; }
+	        return this.errorHandler.throwError(this.index, this.lineNumber, this.index - this.lineStart + 1, message);
+	    };
+	    Scanner.prototype.tolerateUnexpectedToken = function (message) {
+	        if (message === void 0) { message = messages_1.Messages.UnexpectedTokenIllegal; }
+	        this.errorHandler.tolerateError(this.index, this.lineNumber, this.index - this.lineStart + 1, message);
+	    };
+	    // https://tc39.github.io/ecma262/#sec-comments
+	    Scanner.prototype.skipSingleLineComment = function (offset) {
+	        var comments = [];
+	        var start, loc;
+	        if (this.trackComment) {
+	            comments = [];
+	            start = this.index - offset;
+	            loc = {
+	                start: {
+	                    line: this.lineNumber,
+	                    column: this.index - this.lineStart - offset
+	                },
+	                end: {}
+	            };
+	        }
+	        while (!this.eof()) {
+	            var ch = this.source.charCodeAt(this.index);
+	            ++this.index;
+	            if (character_1.Character.isLineTerminator(ch)) {
+	                if (this.trackComment) {
+	                    loc.end = {
+	                        line: this.lineNumber,
+	                        column: this.index - this.lineStart - 1
+	                    };
+	                    var entry = {
+	                        multiLine: false,
+	                        slice: [start + offset, this.index - 1],
+	                        range: [start, this.index - 1],
+	                        loc: loc
+	                    };
+	                    comments.push(entry);
+	                }
+	                if (ch === 13 && this.source.charCodeAt(this.index) === 10) {
+	                    ++this.index;
+	                }
+	                ++this.lineNumber;
+	                this.lineStart = this.index;
+	                return comments;
+	            }
+	        }
+	        if (this.trackComment) {
+	            loc.end = {
+	                line: this.lineNumber,
+	                column: this.index - this.lineStart
+	            };
+	            var entry = {
+	                multiLine: false,
+	                slice: [start + offset, this.index],
+	                range: [start, this.index],
+	                loc: loc
+	            };
+	            comments.push(entry);
+	        }
+	        return comments;
+	    };
+	    Scanner.prototype.skipMultiLineComment = function () {
+	        var comments = [];
+	        var start, loc;
+	        if (this.trackComment) {
+	            comments = [];
+	            start = this.index - 2;
+	            loc = {
+	                start: {
+	                    line: this.lineNumber,
+	                    column: this.index - this.lineStart - 2
+	                },
+	                end: {}
+	            };
+	        }
+	        while (!this.eof()) {
+	            var ch = this.source.charCodeAt(this.index);
+	            if (character_1.Character.isLineTerminator(ch)) {
+	                if (ch === 0x0D && this.source.charCodeAt(this.index + 1) === 0x0A) {
+	                    ++this.index;
+	                }
+	                ++this.lineNumber;
+	                ++this.index;
+	                this.lineStart = this.index;
+	            }
+	            else if (ch === 0x2A) {
+	                // Block comment ends with '*/'.
+	                if (this.source.charCodeAt(this.index + 1) === 0x2F) {
+	                    this.index += 2;
+	                    if (this.trackComment) {
+	                        loc.end = {
+	                            line: this.lineNumber,
+	                            column: this.index - this.lineStart
+	                        };
+	                        var entry = {
+	                            multiLine: true,
+	                            slice: [start + 2, this.index - 2],
+	                            range: [start, this.index],
+	                            loc: loc
+	                        };
+	                        comments.push(entry);
+	                    }
+	                    return comments;
+	                }
+	                ++this.index;
+	            }
+	            else {
+	                ++this.index;
+	            }
+	        }
+	        // Ran off the end of the file - the whole thing is a comment
+	        if (this.trackComment) {
+	            loc.end = {
+	                line: this.lineNumber,
+	                column: this.index - this.lineStart
+	            };
+	            var entry = {
+	                multiLine: true,
+	                slice: [start + 2, this.index],
+	                range: [start, this.index],
+	                loc: loc
+	            };
+	            comments.push(entry);
+	        }
+	        this.tolerateUnexpectedToken();
+	        return comments;
+	    };
+	    Scanner.prototype.scanComments = function () {
+	        var comments;
+	        if (this.trackComment) {
+	            comments = [];
+	        }
+	        var start = (this.index === 0);
+	        while (!this.eof()) {
+	            var ch = this.source.charCodeAt(this.index);
+	            if (character_1.Character.isWhiteSpace(ch)) {
+	                ++this.index;
+	            }
+	            else if (character_1.Character.isLineTerminator(ch)) {
+	                ++this.index;
+	                if (ch === 0x0D && this.source.charCodeAt(this.index) === 0x0A) {
+	                    ++this.index;
+	                }
+	                ++this.lineNumber;
+	                this.lineStart = this.index;
+	                start = true;
+	            }
+	            else if (ch === 0x2F) {
+	                ch = this.source.charCodeAt(this.index + 1);
+	                if (ch === 0x2F) {
+	                    this.index += 2;
+	                    var comment = this.skipSingleLineComment(2);
+	                    if (this.trackComment) {
+	                        comments = comments.concat(comment);
+	                    }
+	                    start = true;
+	                }
+	                else if (ch === 0x2A) {
+	                    this.index += 2;
+	                    var comment = this.skipMultiLineComment();
+	                    if (this.trackComment) {
+	                        comments = comments.concat(comment);
+	                    }
+	                }
+	                else {
+	                    break;
+	                }
+	            }
+	            else if (start && ch === 0x2D) {
+	                // U+003E is '>'
+	                if ((this.source.charCodeAt(this.index + 1) === 0x2D) && (this.source.charCodeAt(this.index + 2) === 0x3E)) {
+	                    // '-->' is a single-line comment
+	                    this.index += 3;
+	                    var comment = this.skipSingleLineComment(3);
+	                    if (this.trackComment) {
+	                        comments = comments.concat(comment);
+	                    }
+	                }
+	                else {
+	                    break;
+	                }
+	            }
+	            else if (ch === 0x3C && !this.isModule) {
+	                if (this.source.slice(this.index + 1, this.index + 4) === '!--') {
+	                    this.index += 4; // `<!--`
+	                    var comment = this.skipSingleLineComment(4);
+	                    if (this.trackComment) {
+	                        comments = comments.concat(comment);
+	                    }
+	                }
+	                else {
+	                    break;
+	                }
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        return comments;
+	    };
+	    // https://tc39.github.io/ecma262/#sec-future-reserved-words
+	    Scanner.prototype.isFutureReservedWord = function (id) {
+	        switch (id) {
+	            case 'enum':
+	            case 'export':
+	            case 'import':
+	            case 'super':
+	                return true;
+	            default:
+	                return false;
+	        }
+	    };
+	    Scanner.prototype.isStrictModeReservedWord = function (id) {
+	        switch (id) {
+	            case 'implements':
+	            case 'interface':
+	            case 'package':
+	            case 'private':
+	            case 'protected':
+	            case 'public':
+	            case 'static':
+	            case 'yield':
+	            case 'let':
+	                return true;
+	            default:
+	                return false;
+	        }
+	    };
+	    Scanner.prototype.isRestrictedWord = function (id) {
+	        return id === 'eval' || id === 'arguments';
+	    };
+	    // https://tc39.github.io/ecma262/#sec-keywords
+	    Scanner.prototype.isKeyword = function (id) {
+	        switch (id.length) {
+	            case 2:
+	                return (id === 'if') || (id === 'in') || (id === 'do');
+	            case 3:
+	                return (id === 'var') || (id === 'for') || (id === 'new') ||
+	                    (id === 'try') || (id === 'let');
+	            case 4:
+	                return (id === 'this') || (id === 'else') || (id === 'case') ||
+	                    (id === 'void') || (id === 'with') || (id === 'enum');
+	            case 5:
+	                return (id === 'while') || (id === 'break') || (id === 'catch') ||
+	                    (id === 'throw') || (id === 'const') || (id === 'yield') ||
+	                    (id === 'class') || (id === 'super');
+	            case 6:
+	                return (id === 'return') || (id === 'typeof') || (id === 'delete') ||
+	                    (id === 'switch') || (id === 'export') || (id === 'import');
+	            case 7:
+	                return (id === 'default') || (id === 'finally') || (id === 'extends');
+	            case 8:
+	                return (id === 'function') || (id === 'continue') || (id === 'debugger');
+	            case 10:
+	                return (id === 'instanceof');
+	            default:
+	                return false;
+	        }
+	    };
+	    Scanner.prototype.codePointAt = function (i) {
+	        var cp = this.source.charCodeAt(i);
+	        if (cp >= 0xD800 && cp <= 0xDBFF) {
+	            var second = this.source.charCodeAt(i + 1);
+	            if (second >= 0xDC00 && second <= 0xDFFF) {
+	                var first = cp;
+	                cp = (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
+	            }
+	        }
+	        return cp;
+	    };
+	    Scanner.prototype.scanHexEscape = function (prefix) {
+	        var len = (prefix === 'u') ? 4 : 2;
+	        var code = 0;
+	        for (var i = 0; i < len; ++i) {
+	            if (!this.eof() && character_1.Character.isHexDigit(this.source.charCodeAt(this.index))) {
+	                code = code * 16 + hexValue(this.source[this.index++]);
+	            }
+	            else {
+	                return null;
+	            }
+	        }
+	        return String.fromCharCode(code);
+	    };
+	    Scanner.prototype.scanUnicodeCodePointEscape = function () {
+	        var ch = this.source[this.index];
+	        var code = 0;
+	        // At least, one hex digit is required.
+	        if (ch === '}') {
+	            this.throwUnexpectedToken();
+	        }
+	        while (!this.eof()) {
+	            ch = this.source[this.index++];
+	            if (!character_1.Character.isHexDigit(ch.charCodeAt(0))) {
+	                break;
+	            }
+	            code = code * 16 + hexValue(ch);
+	        }
+	        if (code > 0x10FFFF || ch !== '}') {
+	            this.throwUnexpectedToken();
+	        }
+	        return character_1.Character.fromCodePoint(code);
+	    };
+	    Scanner.prototype.getIdentifier = function () {
+	        var start = this.index++;
+	        while (!this.eof()) {
+	            var ch = this.source.charCodeAt(this.index);
+	            if (ch === 0x5C) {
+	                // Blackslash (U+005C) marks Unicode escape sequence.
+	                this.index = start;
+	                return this.getComplexIdentifier();
+	            }
+	            else if (ch >= 0xD800 && ch < 0xDFFF) {
+	                // Need to handle surrogate pairs.
+	                this.index = start;
+	                return this.getComplexIdentifier();
+	            }
+	            if (character_1.Character.isIdentifierPart(ch)) {
+	                ++this.index;
+	            }
+	            else {
+	                break;
+	            }
+	        }
+	        return this.source.slice(start, this.index);
+	    };
+	    Scanner.prototype.getComplexIdentifier = function () {
+	        var cp = this.codePointAt(this.index);
+	        var id = character_1.Character.fromCodePoint(cp);
+	        this.index += id.length;
+	        // '\u' (U+005C, U+0075) denotes an escaped character.
+	        var ch;
+	        if (cp === 0x5C) {
+	            if (this.source.charCodeAt(this.index) !== 0x75) {
+	                this.throwUnexpectedToken();
+	            }
+	            ++this.index;
+	            if (this.source[this.index] === '{') {
+	                ++this.index;
+	                ch = this.scanUnicodeCodePointEscape();
+	            }
+	            else {
+	                ch = this.scanHexEscape('u');
+	                if (ch === null || ch === '\\' || !character_1.Character.isIdentifierStart(ch.charCodeAt(0))) {
+	                    this.throwUnexpectedToken();
+	                }
+	            }
+	            id = ch;
+	        }
+	        while (!this.eof()) {
+	            cp = this.codePointAt(this.index);
+	            if (!character_1.Character.isIdentifierPart(cp)) {
+	                break;
+	            }
+	            ch = character_1.Character.fromCodePoint(cp);
+	            id += ch;
+	            this.index += ch.length;
+	            // '\u' (U+005C, U+0075) denotes an escaped character.
+	            if (cp === 0x5C) {
+	                id = id.substr(0, id.length - 1);
+	                if (this.source.charCodeAt(this.index) !== 0x75) {
+	                    this.throwUnexpectedToken();
+	                }
+	                ++this.index;
+	                if (this.source[this.index] === '{') {
+	                    ++this.index;
+	                    ch = this.scanUnicodeCodePointEscape();
+	                }
+	                else {
+	                    ch = this.scanHexEscape('u');
+	                    if (ch === null || ch === '\\' || !character_1.Character.isIdentifierPart(ch.charCodeAt(0))) {
+	                        this.throwUnexpectedToken();
+	                    }
+	                }
+	                id += ch;
+	            }
+	        }
+	        return id;
+	    };
+	    Scanner.prototype.octalToDecimal = function (ch) {
+	        // \0 is not octal escape sequence
+	        var octal = (ch !== '0');
+	        var code = octalValue(ch);
+	        if (!this.eof() && character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+	            octal = true;
+	            code = code * 8 + octalValue(this.source[this.index++]);
+	            // 3 digits are only allowed when string starts
+	            // with 0, 1, 2, 3
+	            if ('0123'.indexOf(ch) >= 0 && !this.eof() && character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+	                code = code * 8 + octalValue(this.source[this.index++]);
+	            }
+	        }
+	        return {
+	            code: code,
+	            octal: octal
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-names-and-keywords
+	    Scanner.prototype.scanIdentifier = function () {
+	        var type;
+	        var start = this.index;
+	        // Backslash (U+005C) starts an escaped character.
+	        var id = (this.source.charCodeAt(start) === 0x5C) ? this.getComplexIdentifier() : this.getIdentifier();
+	        // There is no keyword or literal with only one character.
+	        // Thus, it must be an identifier.
+	        if (id.length === 1) {
+	            type = 3 /* Identifier */;
+	        }
+	        else if (this.isKeyword(id)) {
+	            type = 4 /* Keyword */;
+	        }
+	        else if (id === 'null') {
+	            type = 5 /* NullLiteral */;
+	        }
+	        else if (id === 'true' || id === 'false') {
+	            type = 1 /* BooleanLiteral */;
+	        }
+	        else {
+	            type = 3 /* Identifier */;
+	        }
+	        if (type !== 3 /* Identifier */ && (start + id.length !== this.index)) {
+	            var restore = this.index;
+	            this.index = start;
+	            this.tolerateUnexpectedToken(messages_1.Messages.InvalidEscapedReservedWord);
+	            this.index = restore;
+	        }
+	        return {
+	            type: type,
+	            value: id,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-punctuators
+	    Scanner.prototype.scanPunctuator = function () {
+	        var start = this.index;
+	        // Check for most common single-character punctuators.
+	        var str = this.source[this.index];
+	        switch (str) {
+	            case '(':
+	            case '{':
+	                if (str === '{') {
+	                    this.curlyStack.push('{');
+	                }
+	                ++this.index;
+	                break;
+	            case '.':
+	                ++this.index;
+	                if (this.source[this.index] === '.' && this.source[this.index + 1] === '.') {
+	                    // Spread operator: ...
+	                    this.index += 2;
+	                    str = '...';
+	                }
+	                break;
+	            case '}':
+	                ++this.index;
+	                this.curlyStack.pop();
+	                break;
+	            case ')':
+	            case ';':
+	            case ',':
+	            case '[':
+	            case ']':
+	            case ':':
+	            case '?':
+	            case '~':
+	                ++this.index;
+	                break;
+	            default:
+	                // 4-character punctuator.
+	                str = this.source.substr(this.index, 4);
+	                if (str === '>>>=') {
+	                    this.index += 4;
+	                }
+	                else {
+	                    // 3-character punctuators.
+	                    str = str.substr(0, 3);
+	                    if (str === '===' || str === '!==' || str === '>>>' ||
+	                        str === '<<=' || str === '>>=' || str === '**=') {
+	                        this.index += 3;
+	                    }
+	                    else {
+	                        // 2-character punctuators.
+	                        str = str.substr(0, 2);
+	                        if (str === '&&' || str === '||' || str === '==' || str === '!=' ||
+	                            str === '+=' || str === '-=' || str === '*=' || str === '/=' ||
+	                            str === '++' || str === '--' || str === '<<' || str === '>>' ||
+	                            str === '&=' || str === '|=' || str === '^=' || str === '%=' ||
+	                            str === '<=' || str === '>=' || str === '=>' || str === '**') {
+	                            this.index += 2;
+	                        }
+	                        else {
+	                            // 1-character punctuators.
+	                            str = this.source[this.index];
+	                            if ('<>=!+-*%&|^/'.indexOf(str) >= 0) {
+	                                ++this.index;
+	                            }
+	                        }
+	                    }
+	                }
+	        }
+	        if (this.index === start) {
+	            this.throwUnexpectedToken();
+	        }
+	        return {
+	            type: 7 /* Punctuator */,
+	            value: str,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+	    Scanner.prototype.scanHexLiteral = function (start) {
+	        var num = '';
+	        while (!this.eof()) {
+	            if (!character_1.Character.isHexDigit(this.source.charCodeAt(this.index))) {
+	                break;
+	            }
+	            num += this.source[this.index++];
+	        }
+	        if (num.length === 0) {
+	            this.throwUnexpectedToken();
+	        }
+	        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))) {
+	            this.throwUnexpectedToken();
+	        }
+	        return {
+	            type: 6 /* NumericLiteral */,
+	            value: parseInt('0x' + num, 16),
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    Scanner.prototype.scanBinaryLiteral = function (start) {
+	        var num = '';
+	        var ch;
+	        while (!this.eof()) {
+	            ch = this.source[this.index];
+	            if (ch !== '0' && ch !== '1') {
+	                break;
+	            }
+	            num += this.source[this.index++];
+	        }
+	        if (num.length === 0) {
+	            // only 0b or 0B
+	            this.throwUnexpectedToken();
+	        }
+	        if (!this.eof()) {
+	            ch = this.source.charCodeAt(this.index);
+	            /* istanbul ignore else */
+	            if (character_1.Character.isIdentifierStart(ch) || character_1.Character.isDecimalDigit(ch)) {
+	                this.throwUnexpectedToken();
+	            }
+	        }
+	        return {
+	            type: 6 /* NumericLiteral */,
+	            value: parseInt(num, 2),
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    Scanner.prototype.scanOctalLiteral = function (prefix, start) {
+	        var num = '';
+	        var octal = false;
+	        if (character_1.Character.isOctalDigit(prefix.charCodeAt(0))) {
+	            octal = true;
+	            num = '0' + this.source[this.index++];
+	        }
+	        else {
+	            ++this.index;
+	        }
+	        while (!this.eof()) {
+	            if (!character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))) {
+	                break;
+	            }
+	            num += this.source[this.index++];
+	        }
+	        if (!octal && num.length === 0) {
+	            // only 0o or 0O
+	            this.throwUnexpectedToken();
+	        }
+	        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index)) || character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	            this.throwUnexpectedToken();
+	        }
+	        return {
+	            type: 6 /* NumericLiteral */,
+	            value: parseInt(num, 8),
+	            octal: octal,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    Scanner.prototype.isImplicitOctalLiteral = function () {
+	        // Implicit octal, unless there is a non-octal digit.
+	        // (Annex B.1.1 on Numeric Literals)
+	        for (var i = this.index + 1; i < this.length; ++i) {
+	            var ch = this.source[i];
+	            if (ch === '8' || ch === '9') {
+	                return false;
+	            }
+	            if (!character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+	                return true;
+	            }
+	        }
+	        return true;
+	    };
+	    Scanner.prototype.scanNumericLiteral = function () {
+	        var start = this.index;
+	        var ch = this.source[start];
+	        assert_1.assert(character_1.Character.isDecimalDigit(ch.charCodeAt(0)) || (ch === '.'), 'Numeric literal must start with a decimal digit or a decimal point');
+	        var num = '';
+	        if (ch !== '.') {
+	            num = this.source[this.index++];
+	            ch = this.source[this.index];
+	            // Hex number starts with '0x'.
+	            // Octal number starts with '0'.
+	            // Octal number in ES6 starts with '0o'.
+	            // Binary number in ES6 starts with '0b'.
+	            if (num === '0') {
+	                if (ch === 'x' || ch === 'X') {
+	                    ++this.index;
+	                    return this.scanHexLiteral(start);
+	                }
+	                if (ch === 'b' || ch === 'B') {
+	                    ++this.index;
+	                    return this.scanBinaryLiteral(start);
+	                }
+	                if (ch === 'o' || ch === 'O') {
+	                    return this.scanOctalLiteral(ch, start);
+	                }
+	                if (ch && character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+	                    if (this.isImplicitOctalLiteral()) {
+	                        return this.scanOctalLiteral(ch, start);
+	                    }
+	                }
+	            }
+	            while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	                num += this.source[this.index++];
+	            }
+	            ch = this.source[this.index];
+	        }
+	        if (ch === '.') {
+	            num += this.source[this.index++];
+	            while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	                num += this.source[this.index++];
+	            }
+	            ch = this.source[this.index];
+	        }
+	        if (ch === 'e' || ch === 'E') {
+	            num += this.source[this.index++];
+	            ch = this.source[this.index];
+	            if (ch === '+' || ch === '-') {
+	                num += this.source[this.index++];
+	            }
+	            if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	                while (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	                    num += this.source[this.index++];
+	                }
+	            }
+	            else {
+	                this.throwUnexpectedToken();
+	            }
+	        }
+	        if (character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))) {
+	            this.throwUnexpectedToken();
+	        }
+	        return {
+	            type: 6 /* NumericLiteral */,
+	            value: parseFloat(num),
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-literals-string-literals
+	    Scanner.prototype.scanStringLiteral = function () {
+	        var start = this.index;
+	        var quote = this.source[start];
+	        assert_1.assert((quote === '\'' || quote === '"'), 'String literal must starts with a quote');
+	        ++this.index;
+	        var octal = false;
+	        var str = '';
+	        while (!this.eof()) {
+	            var ch = this.source[this.index++];
+	            if (ch === quote) {
+	                quote = '';
+	                break;
+	            }
+	            else if (ch === '\\') {
+	                ch = this.source[this.index++];
+	                if (!ch || !character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                    switch (ch) {
+	                        case 'u':
+	                            if (this.source[this.index] === '{') {
+	                                ++this.index;
+	                                str += this.scanUnicodeCodePointEscape();
+	                            }
+	                            else {
+	                                var unescaped_1 = this.scanHexEscape(ch);
+	                                if (unescaped_1 === null) {
+	                                    this.throwUnexpectedToken();
+	                                }
+	                                str += unescaped_1;
+	                            }
+	                            break;
+	                        case 'x':
+	                            var unescaped = this.scanHexEscape(ch);
+	                            if (unescaped === null) {
+	                                this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);
+	                            }
+	                            str += unescaped;
+	                            break;
+	                        case 'n':
+	                            str += '\n';
+	                            break;
+	                        case 'r':
+	                            str += '\r';
+	                            break;
+	                        case 't':
+	                            str += '\t';
+	                            break;
+	                        case 'b':
+	                            str += '\b';
+	                            break;
+	                        case 'f':
+	                            str += '\f';
+	                            break;
+	                        case 'v':
+	                            str += '\x0B';
+	                            break;
+	                        case '8':
+	                        case '9':
+	                            str += ch;
+	                            this.tolerateUnexpectedToken();
+	                            break;
+	                        default:
+	                            if (ch && character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+	                                var octToDec = this.octalToDecimal(ch);
+	                                octal = octToDec.octal || octal;
+	                                str += String.fromCharCode(octToDec.code);
+	                            }
+	                            else {
+	                                str += ch;
+	                            }
+	                            break;
+	                    }
+	                }
+	                else {
+	                    ++this.lineNumber;
+	                    if (ch === '\r' && this.source[this.index] === '\n') {
+	                        ++this.index;
+	                    }
+	                    this.lineStart = this.index;
+	                }
+	            }
+	            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                break;
+	            }
+	            else {
+	                str += ch;
+	            }
+	        }
+	        if (quote !== '') {
+	            this.index = start;
+	            this.throwUnexpectedToken();
+	        }
+	        return {
+	            type: 8 /* StringLiteral */,
+	            value: str,
+	            octal: octal,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-template-literal-lexical-components
+	    Scanner.prototype.scanTemplate = function () {
+	        var cooked = '';
+	        var terminated = false;
+	        var start = this.index;
+	        var head = (this.source[start] === '`');
+	        var tail = false;
+	        var rawOffset = 2;
+	        ++this.index;
+	        while (!this.eof()) {
+	            var ch = this.source[this.index++];
+	            if (ch === '`') {
+	                rawOffset = 1;
+	                tail = true;
+	                terminated = true;
+	                break;
+	            }
+	            else if (ch === '$') {
+	                if (this.source[this.index] === '{') {
+	                    this.curlyStack.push('${');
+	                    ++this.index;
+	                    terminated = true;
+	                    break;
+	                }
+	                cooked += ch;
+	            }
+	            else if (ch === '\\') {
+	                ch = this.source[this.index++];
+	                if (!character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                    switch (ch) {
+	                        case 'n':
+	                            cooked += '\n';
+	                            break;
+	                        case 'r':
+	                            cooked += '\r';
+	                            break;
+	                        case 't':
+	                            cooked += '\t';
+	                            break;
+	                        case 'u':
+	                            if (this.source[this.index] === '{') {
+	                                ++this.index;
+	                                cooked += this.scanUnicodeCodePointEscape();
+	                            }
+	                            else {
+	                                var restore = this.index;
+	                                var unescaped_2 = this.scanHexEscape(ch);
+	                                if (unescaped_2 !== null) {
+	                                    cooked += unescaped_2;
+	                                }
+	                                else {
+	                                    this.index = restore;
+	                                    cooked += ch;
+	                                }
+	                            }
+	                            break;
+	                        case 'x':
+	                            var unescaped = this.scanHexEscape(ch);
+	                            if (unescaped === null) {
+	                                this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);
+	                            }
+	                            cooked += unescaped;
+	                            break;
+	                        case 'b':
+	                            cooked += '\b';
+	                            break;
+	                        case 'f':
+	                            cooked += '\f';
+	                            break;
+	                        case 'v':
+	                            cooked += '\v';
+	                            break;
+	                        default:
+	                            if (ch === '0') {
+	                                if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))) {
+	                                    // Illegal: \01 \02 and so on
+	                                    this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);
+	                                }
+	                                cooked += '\0';
+	                            }
+	                            else if (character_1.Character.isOctalDigit(ch.charCodeAt(0))) {
+	                                // Illegal: \1 \2
+	                                this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);
+	                            }
+	                            else {
+	                                cooked += ch;
+	                            }
+	                            break;
+	                    }
+	                }
+	                else {
+	                    ++this.lineNumber;
+	                    if (ch === '\r' && this.source[this.index] === '\n') {
+	                        ++this.index;
+	                    }
+	                    this.lineStart = this.index;
+	                }
+	            }
+	            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                ++this.lineNumber;
+	                if (ch === '\r' && this.source[this.index] === '\n') {
+	                    ++this.index;
+	                }
+	                this.lineStart = this.index;
+	                cooked += '\n';
+	            }
+	            else {
+	                cooked += ch;
+	            }
+	        }
+	        if (!terminated) {
+	            this.throwUnexpectedToken();
+	        }
+	        if (!head) {
+	            this.curlyStack.pop();
+	        }
+	        return {
+	            type: 10 /* Template */,
+	            value: this.source.slice(start + 1, this.index - rawOffset),
+	            cooked: cooked,
+	            head: head,
+	            tail: tail,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    // https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+	    Scanner.prototype.testRegExp = function (pattern, flags) {
+	        // The BMP character to use as a replacement for astral symbols when
+	        // translating an ES6 "u"-flagged pattern to an ES5-compatible
+	        // approximation.
+	        // Note: replacing with '\uFFFF' enables false positives in unlikely
+	        // scenarios. For example, `[\u{1044f}-\u{10440}]` is an invalid
+	        // pattern that would not be detected by this substitution.
+	        var astralSubstitute = '\uFFFF';
+	        var tmp = pattern;
+	        var self = this;
+	        if (flags.indexOf('u') >= 0) {
+	            tmp = tmp
+	                .replace(/\\u\{([0-9a-fA-F]+)\}|\\u([a-fA-F0-9]{4})/g, function ($0, $1, $2) {
+	                var codePoint = parseInt($1 || $2, 16);
+	                if (codePoint > 0x10FFFF) {
+	                    self.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);
+	                }
+	                if (codePoint <= 0xFFFF) {
+	                    return String.fromCharCode(codePoint);
+	                }
+	                return astralSubstitute;
+	            })
+	                .replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g, astralSubstitute);
+	        }
+	        // First, detect invalid regular expressions.
+	        try {
+	            RegExp(tmp);
+	        }
+	        catch (e) {
+	            this.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);
+	        }
+	        // Return a regular expression object for this pattern-flag pair, or
+	        // `null` in case the current environment doesn't support the flags it
+	        // uses.
+	        try {
+	            return new RegExp(pattern, flags);
+	        }
+	        catch (exception) {
+	            /* istanbul ignore next */
+	            return null;
+	        }
+	    };
+	    Scanner.prototype.scanRegExpBody = function () {
+	        var ch = this.source[this.index];
+	        assert_1.assert(ch === '/', 'Regular expression literal must start with a slash');
+	        var str = this.source[this.index++];
+	        var classMarker = false;
+	        var terminated = false;
+	        while (!this.eof()) {
+	            ch = this.source[this.index++];
+	            str += ch;
+	            if (ch === '\\') {
+	                ch = this.source[this.index++];
+	                // https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+	                if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                    this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+	                }
+	                str += ch;
+	            }
+	            else if (character_1.Character.isLineTerminator(ch.charCodeAt(0))) {
+	                this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+	            }
+	            else if (classMarker) {
+	                if (ch === ']') {
+	                    classMarker = false;
+	                }
+	            }
+	            else {
+	                if (ch === '/') {
+	                    terminated = true;
+	                    break;
+	                }
+	                else if (ch === '[') {
+	                    classMarker = true;
+	                }
+	            }
+	        }
+	        if (!terminated) {
+	            this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);
+	        }
+	        // Exclude leading and trailing slash.
+	        return str.substr(1, str.length - 2);
+	    };
+	    Scanner.prototype.scanRegExpFlags = function () {
+	        var str = '';
+	        var flags = '';
+	        while (!this.eof()) {
+	            var ch = this.source[this.index];
+	            if (!character_1.Character.isIdentifierPart(ch.charCodeAt(0))) {
+	                break;
+	            }
+	            ++this.index;
+	            if (ch === '\\' && !this.eof()) {
+	                ch = this.source[this.index];
+	                if (ch === 'u') {
+	                    ++this.index;
+	                    var restore = this.index;
+	                    var char = this.scanHexEscape('u');
+	                    if (char !== null) {
+	                        flags += char;
+	                        for (str += '\\u'; restore < this.index; ++restore) {
+	                            str += this.source[restore];
+	                        }
+	                    }
+	                    else {
+	                        this.index = restore;
+	                        flags += 'u';
+	                        str += '\\u';
+	                    }
+	                    this.tolerateUnexpectedToken();
+	                }
+	                else {
+	                    str += '\\';
+	                    this.tolerateUnexpectedToken();
+	                }
+	            }
+	            else {
+	                flags += ch;
+	                str += ch;
+	            }
+	        }
+	        return flags;
+	    };
+	    Scanner.prototype.scanRegExp = function () {
+	        var start = this.index;
+	        var pattern = this.scanRegExpBody();
+	        var flags = this.scanRegExpFlags();
+	        var value = this.testRegExp(pattern, flags);
+	        return {
+	            type: 9 /* RegularExpression */,
+	            value: '',
+	            pattern: pattern,
+	            flags: flags,
+	            regex: value,
+	            lineNumber: this.lineNumber,
+	            lineStart: this.lineStart,
+	            start: start,
+	            end: this.index
+	        };
+	    };
+	    Scanner.prototype.lex = function () {
+	        if (this.eof()) {
+	            return {
+	                type: 2 /* EOF */,
+	                value: '',
+	                lineNumber: this.lineNumber,
+	                lineStart: this.lineStart,
+	                start: this.index,
+	                end: this.index
+	            };
+	        }
+	        var cp = this.source.charCodeAt(this.index);
+	        if (character_1.Character.isIdentifierStart(cp)) {
+	            return this.scanIdentifier();
+	        }
+	        // Very common: ( and ) and ;
+	        if (cp === 0x28 || cp === 0x29 || cp === 0x3B) {
+	            return this.scanPunctuator();
+	        }
+	        // String literal starts with single quote (U+0027) or double quote (U+0022).
+	        if (cp === 0x27 || cp === 0x22) {
+	            return this.scanStringLiteral();
+	        }
+	        // Dot (.) U+002E can also start a floating-point number, hence the need
+	        // to check the next character.
+	        if (cp === 0x2E) {
+	            if (character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index + 1))) {
+	                return this.scanNumericLiteral();
+	            }
+	            return this.scanPunctuator();
+	        }
+	        if (character_1.Character.isDecimalDigit(cp)) {
+	            return this.scanNumericLiteral();
+	        }
+	        // Template literals start with ` (U+0060) for template head
+	        // or } (U+007D) for template middle or template tail.
+	        if (cp === 0x60 || (cp === 0x7D && this.curlyStack[this.curlyStack.length - 1] === '${')) {
+	            return this.scanTemplate();
+	        }
+	        // Possible identifier start in a surrogate pair.
+	        if (cp >= 0xD800 && cp < 0xDFFF) {
+	            if (character_1.Character.isIdentifierStart(this.codePointAt(this.index))) {
+	                return this.scanIdentifier();
+	            }
+	        }
+	        return this.scanPunctuator();
+	    };
+	    return Scanner;
+	}());
+	exports.Scanner = Scanner;
+
+
+/***/ },
+/* 13 */
+/***/ function(module, exports) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.TokenName = {};
+	exports.TokenName[1 /* BooleanLiteral */] = 'Boolean';
+	exports.TokenName[2 /* EOF */] = '<end>';
+	exports.TokenName[3 /* Identifier */] = 'Identifier';
+	exports.TokenName[4 /* Keyword */] = 'Keyword';
+	exports.TokenName[5 /* NullLiteral */] = 'Null';
+	exports.TokenName[6 /* NumericLiteral */] = 'Numeric';
+	exports.TokenName[7 /* Punctuator */] = 'Punctuator';
+	exports.TokenName[8 /* StringLiteral */] = 'String';
+	exports.TokenName[9 /* RegularExpression */] = 'RegularExpression';
+	exports.TokenName[10 /* Template */] = 'Template';
+
+
+/***/ },
+/* 14 */
+/***/ function(module, exports) {
+
+	"use strict";
+	// Generated by generate-xhtml-entities.js. DO NOT MODIFY!
+	Object.defineProperty(exports, "__esModule", { value: true });
+	exports.XHTMLEntities = {
+	    quot: '\u0022',
+	    amp: '\u0026',
+	    apos: '\u0027',
+	    gt: '\u003E',
+	    nbsp: '\u00A0',
+	    iexcl: '\u00A1',
+	    cent: '\u00A2',
+	    pound: '\u00A3',
+	    curren: '\u00A4',
+	    yen: '\u00A5',
+	    brvbar: '\u00A6',
+	    sect: '\u00A7',
+	    uml: '\u00A8',
+	    copy: '\u00A9',
+	    ordf: '\u00AA',
+	    laquo: '\u00AB',
+	    not: '\u00AC',
+	    shy: '\u00AD',
+	    reg: '\u00AE',
+	    macr: '\u00AF',
+	    deg: '\u00B0',
+	    plusmn: '\u00B1',
+	    sup2: '\u00B2',
+	    sup3: '\u00B3',
+	    acute: '\u00B4',
+	    micro: '\u00B5',
+	    para: '\u00B6',
+	    middot: '\u00B7',
+	    cedil: '\u00B8',
+	    sup1: '\u00B9',
+	    ordm: '\u00BA',
+	    raquo: '\u00BB',
+	    frac14: '\u00BC',
+	    frac12: '\u00BD',
+	    frac34: '\u00BE',
+	    iquest: '\u00BF',
+	    Agrave: '\u00C0',
+	    Aacute: '\u00C1',
+	    Acirc: '\u00C2',
+	    Atilde: '\u00C3',
+	    Auml: '\u00C4',
+	    Aring: '\u00C5',
+	    AElig: '\u00C6',
+	    Ccedil: '\u00C7',
+	    Egrave: '\u00C8',
+	    Eacute: '\u00C9',
+	    Ecirc: '\u00CA',
+	    Euml: '\u00CB',
+	    Igrave: '\u00CC',
+	    Iacute: '\u00CD',
+	    Icirc: '\u00CE',
+	    Iuml: '\u00CF',
+	    ETH: '\u00D0',
+	    Ntilde: '\u00D1',
+	    Ograve: '\u00D2',
+	    Oacute: '\u00D3',
+	    Ocirc: '\u00D4',
+	    Otilde: '\u00D5',
+	    Ouml: '\u00D6',
+	    times: '\u00D7',
+	    Oslash: '\u00D8',
+	    Ugrave: '\u00D9',
+	    Uacute: '\u00DA',
+	    Ucirc: '\u00DB',
+	    Uuml: '\u00DC',
+	    Yacute: '\u00DD',
+	    THORN: '\u00DE',
+	    szlig: '\u00DF',
+	    agrave: '\u00E0',
+	    aacute: '\u00E1',
+	    acirc: '\u00E2',
+	    atilde: '\u00E3',
+	    auml: '\u00E4',
+	    aring: '\u00E5',
+	    aelig: '\u00E6',
+	    ccedil: '\u00E7',
+	    egrave: '\u00E8',
+	    eacute: '\u00E9',
+	    ecirc: '\u00EA',
+	    euml: '\u00EB',
+	    igrave: '\u00EC',
+	    iacute: '\u00ED',
+	    icirc: '\u00EE',
+	    iuml: '\u00EF',
+	    eth: '\u00F0',
+	    ntilde: '\u00F1',
+	    ograve: '\u00F2',
+	    oacute: '\u00F3',
+	    ocirc: '\u00F4',
+	    otilde: '\u00F5',
+	    ouml: '\u00F6',
+	    divide: '\u00F7',
+	    oslash: '\u00F8',
+	    ugrave: '\u00F9',
+	    uacute: '\u00FA',
+	    ucirc: '\u00FB',
+	    uuml: '\u00FC',
+	    yacute: '\u00FD',
+	    thorn: '\u00FE',
+	    yuml: '\u00FF',
+	    OElig: '\u0152',
+	    oelig: '\u0153',
+	    Scaron: '\u0160',
+	    scaron: '\u0161',
+	    Yuml: '\u0178',
+	    fnof: '\u0192',
+	    circ: '\u02C6',
+	    tilde: '\u02DC',
+	    Alpha: '\u0391',
+	    Beta: '\u0392',
+	    Gamma: '\u0393',
+	    Delta: '\u0394',
+	    Epsilon: '\u0395',
+	    Zeta: '\u0396',
+	    Eta: '\u0397',
+	    Theta: '\u0398',
+	    Iota: '\u0399',
+	    Kappa: '\u039A',
+	    Lambda: '\u039B',
+	    Mu: '\u039C',
+	    Nu: '\u039D',
+	    Xi: '\u039E',
+	    Omicron: '\u039F',
+	    Pi: '\u03A0',
+	    Rho: '\u03A1',
+	    Sigma: '\u03A3',
+	    Tau: '\u03A4',
+	    Upsilon: '\u03A5',
+	    Phi: '\u03A6',
+	    Chi: '\u03A7',
+	    Psi: '\u03A8',
+	    Omega: '\u03A9',
+	    alpha: '\u03B1',
+	    beta: '\u03B2',
+	    gamma: '\u03B3',
+	    delta: '\u03B4',
+	    epsilon: '\u03B5',
+	    zeta: '\u03B6',
+	    eta: '\u03B7',
+	    theta: '\u03B8',
+	    iota: '\u03B9',
+	    kappa: '\u03BA',
+	    lambda: '\u03BB',
+	    mu: '\u03BC',
+	    nu: '\u03BD',
+	    xi: '\u03BE',
+	    omicron: '\u03BF',
+	    pi: '\u03C0',
+	    rho: '\u03C1',
+	    sigmaf: '\u03C2',
+	    sigma: '\u03C3',
+	    tau: '\u03C4',
+	    upsilon: '\u03C5',
+	    phi: '\u03C6',
+	    chi: '\u03C7',
+	    psi: '\u03C8',
+	    omega: '\u03C9',
+	    thetasym: '\u03D1',
+	    upsih: '\u03D2',
+	    piv: '\u03D6',
+	    ensp: '\u2002',
+	    emsp: '\u2003',
+	    thinsp: '\u2009',
+	    zwnj: '\u200C',
+	    zwj: '\u200D',
+	    lrm: '\u200E',
+	    rlm: '\u200F',
+	    ndash: '\u2013',
+	    mdash: '\u2014',
+	    lsquo: '\u2018',
+	    rsquo: '\u2019',
+	    sbquo: '\u201A',
+	    ldquo: '\u201C',
+	    rdquo: '\u201D',
+	    bdquo: '\u201E',
+	    dagger: '\u2020',
+	    Dagger: '\u2021',
+	    bull: '\u2022',
+	    hellip: '\u2026',
+	    permil: '\u2030',
+	    prime: '\u2032',
+	    Prime: '\u2033',
+	    lsaquo: '\u2039',
+	    rsaquo: '\u203A',
+	    oline: '\u203E',
+	    frasl: '\u2044',
+	    euro: '\u20AC',
+	    image: '\u2111',
+	    weierp: '\u2118',
+	    real: '\u211C',
+	    trade: '\u2122',
+	    alefsym: '\u2135',
+	    larr: '\u2190',
+	    uarr: '\u2191',
+	    rarr: '\u2192',
+	    darr: '\u2193',
+	    harr: '\u2194',
+	    crarr: '\u21B5',
+	    lArr: '\u21D0',
+	    uArr: '\u21D1',
+	    rArr: '\u21D2',
+	    dArr: '\u21D3',
+	    hArr: '\u21D4',
+	    forall: '\u2200',
+	    part: '\u2202',
+	    exist: '\u2203',
+	    empty: '\u2205',
+	    nabla: '\u2207',
+	    isin: '\u2208',
+	    notin: '\u2209',
+	    ni: '\u220B',
+	    prod: '\u220F',
+	    sum: '\u2211',
+	    minus: '\u2212',
+	    lowast: '\u2217',
+	    radic: '\u221A',
+	    prop: '\u221D',
+	    infin: '\u221E',
+	    ang: '\u2220',
+	    and: '\u2227',
+	    or: '\u2228',
+	    cap: '\u2229',
+	    cup: '\u222A',
+	    int: '\u222B',
+	    there4: '\u2234',
+	    sim: '\u223C',
+	    cong: '\u2245',
+	    asymp: '\u2248',
+	    ne: '\u2260',
+	    equiv: '\u2261',
+	    le: '\u2264',
+	    ge: '\u2265',
+	    sub: '\u2282',
+	    sup: '\u2283',
+	    nsub: '\u2284',
+	    sube: '\u2286',
+	    supe: '\u2287',
+	    oplus: '\u2295',
+	    otimes: '\u2297',
+	    perp: '\u22A5',
+	    sdot: '\u22C5',
+	    lceil: '\u2308',
+	    rceil: '\u2309',
+	    lfloor: '\u230A',
+	    rfloor: '\u230B',
+	    loz: '\u25CA',
+	    spades: '\u2660',
+	    clubs: '\u2663',
+	    hearts: '\u2665',
+	    diams: '\u2666',
+	    lang: '\u27E8',
+	    rang: '\u27E9'
+	};
+
+
+/***/ },
+/* 15 */
+/***/ function(module, exports, __webpack_require__) {
+
+	"use strict";
+	Object.defineProperty(exports, "__esModule", { value: true });
+	var error_handler_1 = __webpack_require__(10);
+	var scanner_1 = __webpack_require__(12);
+	var token_1 = __webpack_require__(13);
+	var Reader = (function () {
+	    function Reader() {
+	        this.values = [];
+	        this.curly = this.paren = -1;
+	    }
+	    // A function following one of those tokens is an expression.
+	    Reader.prototype.beforeFunctionExpression = function (t) {
+	        return ['(', '{', '[', 'in', 'typeof', 'instanceof', 'new',
+	            'return', 'case', 'delete', 'throw', 'void',
+	            // assignment operators
+	            '=', '+=', '-=', '*=', '**=', '/=', '%=', '<<=', '>>=', '>>>=',
+	            '&=', '|=', '^=', ',',
+	            // binary/unary operators
+	            '+', '-', '*', '**', '/', '%', '++', '--', '<<', '>>', '>>>', '&',
+	            '|', '^', '!', '~', '&&', '||', '?', ':', '===', '==', '>=',
+	            '<=', '<', '>', '!=', '!=='].indexOf(t) >= 0;
+	    };
+	    // Determine if forward slash (/) is an operator or part of a regular expression
+	    // https://github.com/mozilla/sweet.js/wiki/design
+	    Reader.prototype.isRegexStart = function () {
+	        var previous = this.values[this.values.length - 1];
+	        var regex = (previous !== null);
+	        switch (previous) {
+	            case 'this':
+	            case ']':
+	                regex = false;
+	                break;
+	            case ')':
+	                var keyword = this.values[this.paren - 1];
+	                regex = (keyword === 'if' || keyword === 'while' || keyword === 'for' || keyword === 'with');
+	                break;
+	            case '}':
+	                // Dividing a function by anything makes little sense,
+	                // but we have to check for that.
+	                regex = false;
+	                if (this.values[this.curly - 3] === 'function') {
+	                    // Anonymous function, e.g. function(){} /42
+	                    var check = this.values[this.curly - 4];
+	                    regex = check ? !this.beforeFunctionExpression(check) : false;
+	                }
+	                else if (this.values[this.curly - 4] === 'function') {
+	                    // Named function, e.g. function f(){} /42/
+	                    var check = this.values[this.curly - 5];
+	                    regex = check ? !this.beforeFunctionExpression(check) : true;
+	                }
+	                break;
+	            default:
+	                break;
+	        }
+	        return regex;
+	    };
+	    Reader.prototype.push = function (token) {
+	        if (token.type === 7 /* Punctuator */ || token.type === 4 /* Keyword */) {
+	            if (token.value === '{') {
+	                this.curly = this.values.length;
+	            }
+	            else if (token.value === '(') {
+	                this.paren = this.values.length;
+	            }
+	            this.values.push(token.value);
+	        }
+	        else {
+	            this.values.push(null);
+	        }
+	    };
+	    return Reader;
+	}());
+	var Tokenizer = (function () {
+	    function Tokenizer(code, config) {
+	        this.errorHandler = new error_handler_1.ErrorHandler();
+	        this.errorHandler.tolerant = config ? (typeof config.tolerant === 'boolean' && config.tolerant) : false;
+	        this.scanner = new scanner_1.Scanner(code, this.errorHandler);
+	        this.scanner.trackComment = config ? (typeof config.comment === 'boolean' && config.comment) : false;
+	        this.trackRange = config ? (typeof config.range === 'boolean' && config.range) : false;
+	        this.trackLoc = config ? (typeof config.loc === 'boolean' && config.loc) : false;
+	        this.buffer = [];
+	        this.reader = new Reader();
+	    }
+	    Tokenizer.prototype.errors = function () {
+	        return this.errorHandler.errors;
+	    };
+	    Tokenizer.prototype.getNextToken = function () {
+	        if (this.buffer.length === 0) {
+	            var comments = this.scanner.scanComments();
+	            if (this.scanner.trackComment) {
+	                for (var i = 0; i < comments.length; ++i) {
+	                    var e = comments[i];
+	                    var value = this.scanner.source.slice(e.slice[0], e.slice[1]);
+	                    var comment = {
+	                        type: e.multiLine ? 'BlockComment' : 'LineComment',
+	                        value: value
+	                    };
+	                    if (this.trackRange) {
+	                        comment.range = e.range;
+	                    }
+	                    if (this.trackLoc) {
+	                        comment.loc = e.loc;
+	                    }
+	                    this.buffer.push(comment);
+	                }
+	            }
+	            if (!this.scanner.eof()) {
+	                var loc = void 0;
+	                if (this.trackLoc) {
+	                    loc = {
+	                        start: {
+	                            line: this.scanner.lineNumber,
+	                            column: this.scanner.index - this.scanner.lineStart
+	                        },
+	                        end: {}
+	                    };
+	                }
+	                var startRegex = (this.scanner.source[this.scanner.index] === '/') && this.reader.isRegexStart();
+	                var token = startRegex ? this.scanner.scanRegExp() : this.scanner.lex();
+	                this.reader.push(token);
+	                var entry = {
+	                    type: token_1.TokenName[token.type],
+	                    value: this.scanner.source.slice(token.start, token.end)
+	                };
+	                if (this.trackRange) {
+	                    entry.range = [token.start, token.end];
+	                }
+	                if (this.trackLoc) {
+	                    loc.end = {
+	                        line: this.scanner.lineNumber,
+	                        column: this.scanner.index - this.scanner.lineStart
+	                    };
+	                    entry.loc = loc;
+	                }
+	                if (token.type === 9 /* RegularExpression */) {
+	                    var pattern = token.pattern;
+	                    var flags = token.flags;
+	                    entry.regex = { pattern: pattern, flags: flags };
+	                }
+	                this.buffer.push(entry);
+	            }
+	        }
+	        return this.buffer.shift();
+	    };
+	    return Tokenizer;
+	}());
+	exports.Tokenizer = Tokenizer;
+
+
+/***/ }
+/******/ ])
+});
+;
\ No newline at end of file
diff --git a/node_modules/esprima/package.json b/node_modules/esprima/package.json
new file mode 100644
index 0000000..216e692
--- /dev/null
+++ b/node_modules/esprima/package.json
@@ -0,0 +1,137 @@
+{
+  "_from": "esprima@~4.0.0",
+  "_id": "esprima@4.0.1",
+  "_inBundle": false,
+  "_integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==",
+  "_location": "/esprima",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "esprima@~4.0.0",
+    "name": "esprima",
+    "escapedName": "esprima",
+    "rawSpec": "~4.0.0",
+    "saveSpec": null,
+    "fetchSpec": "~4.0.0"
+  },
+  "_requiredBy": [
+    "/recast"
+  ],
+  "_resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
+  "_shasum": "13b04cdb3e6c5d19df91ab6987a8695619b0aa71",
+  "_spec": "esprima@~4.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/recast",
+  "author": {
+    "name": "Ariya Hidayat",
+    "email": "ariya.hidayat@gmail.com"
+  },
+  "bin": {
+    "esparse": "./bin/esparse.js",
+    "esvalidate": "./bin/esvalidate.js"
+  },
+  "bugs": {
+    "url": "https://github.com/jquery/esprima/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "ECMAScript parsing infrastructure for multipurpose analysis",
+  "devDependencies": {
+    "codecov.io": "~0.1.6",
+    "escomplex-js": "1.2.0",
+    "everything.js": "~1.0.3",
+    "glob": "~7.1.0",
+    "istanbul": "~0.4.0",
+    "json-diff": "~0.3.1",
+    "karma": "~1.3.0",
+    "karma-chrome-launcher": "~2.0.0",
+    "karma-detect-browsers": "~2.2.3",
+    "karma-edge-launcher": "~0.2.0",
+    "karma-firefox-launcher": "~1.0.0",
+    "karma-ie-launcher": "~1.0.0",
+    "karma-mocha": "~1.3.0",
+    "karma-safari-launcher": "~1.0.0",
+    "karma-safaritechpreview-launcher": "~0.0.4",
+    "karma-sauce-launcher": "~1.1.0",
+    "lodash": "~3.10.1",
+    "mocha": "~3.2.0",
+    "node-tick-processor": "~0.0.2",
+    "regenerate": "~1.3.2",
+    "temp": "~0.8.3",
+    "tslint": "~5.1.0",
+    "typescript": "~2.3.2",
+    "typescript-formatter": "~5.1.3",
+    "unicode-8.0.0": "~0.7.0",
+    "webpack": "~1.14.0"
+  },
+  "engines": {
+    "node": ">=4"
+  },
+  "files": [
+    "bin",
+    "dist/esprima.js"
+  ],
+  "homepage": "http://esprima.org",
+  "keywords": [
+    "ast",
+    "ecmascript",
+    "esprima",
+    "javascript",
+    "parser",
+    "syntax"
+  ],
+  "license": "BSD-2-Clause",
+  "main": "dist/esprima.js",
+  "maintainers": [
+    {
+      "name": "Ariya Hidayat",
+      "email": "ariya.hidayat@gmail.com",
+      "url": "http://ariya.ofilabs.com"
+    }
+  ],
+  "name": "esprima",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/jquery/esprima.git"
+  },
+  "scripts": {
+    "all-tests": "npm run verify-line-ending && npm run generate-fixtures && npm run unit-tests && npm run api-tests && npm run grammar-tests && npm run regression-tests && npm run hostile-env-tests",
+    "analyze-coverage": "istanbul cover test/unit-tests.js",
+    "api-tests": "mocha -R dot test/api-tests.js",
+    "appveyor": "npm run compile && npm run all-tests && npm run browser-tests",
+    "benchmark": "npm run benchmark-parser && npm run benchmark-tokenizer",
+    "benchmark-parser": "node -expose_gc test/benchmark-parser.js",
+    "benchmark-tokenizer": "node --expose_gc test/benchmark-tokenizer.js",
+    "browser-tests": "npm run compile && npm run generate-fixtures && cd test && karma start --single-run",
+    "check-coverage": "istanbul check-coverage --statement 100 --branch 100 --function 100",
+    "check-version": "node test/check-version.js",
+    "circleci": "npm test && npm run codecov && npm run downstream",
+    "code-style": "tsfmt --verify src/*.ts && tsfmt --verify test/*.js",
+    "codecov": "istanbul report cobertura && codecov < ./coverage/cobertura-coverage.xml",
+    "compile": "tsc -p src/ && webpack && node tools/fixupbundle.js",
+    "complexity": "node test/check-complexity.js",
+    "downstream": "node test/downstream.js",
+    "droneio": "npm run compile && npm run all-tests && npm run saucelabs",
+    "dynamic-analysis": "npm run analyze-coverage && npm run check-coverage",
+    "format-code": "tsfmt -r src/*.ts && tsfmt -r test/*.js",
+    "generate-fixtures": "node tools/generate-fixtures.js",
+    "generate-regex": "node tools/generate-identifier-regex.js",
+    "generate-xhtml-entities": "node tools/generate-xhtml-entities.js",
+    "grammar-tests": "node test/grammar-tests.js",
+    "hostile-env-tests": "node test/hostile-environment-tests.js",
+    "prepublish": "npm run compile",
+    "profile": "node --prof test/profile.js && mv isolate*.log v8.log && node-tick-processor",
+    "regression-tests": "node test/regression-tests.js",
+    "saucelabs": "npm run saucelabs-evergreen && npm run saucelabs-ie && npm run saucelabs-safari",
+    "saucelabs-evergreen": "cd test && karma start saucelabs-evergreen.conf.js",
+    "saucelabs-ie": "cd test && karma start saucelabs-ie.conf.js",
+    "saucelabs-safari": "cd test && karma start saucelabs-safari.conf.js",
+    "static-analysis": "npm run check-version && npm run tslint && npm run code-style && npm run complexity",
+    "test": "npm run compile && npm run all-tests && npm run static-analysis && npm run dynamic-analysis",
+    "travis": "npm test",
+    "tslint": "tslint src/*.ts",
+    "unit-tests": "node test/unit-tests.js",
+    "verify-line-ending": "node test/verify-line-ending.js"
+  },
+  "version": "4.0.1"
+}
diff --git a/node_modules/globals/globals.json b/node_modules/globals/globals.json
new file mode 100644
index 0000000..6f5ac02
--- /dev/null
+++ b/node_modules/globals/globals.json
@@ -0,0 +1,1563 @@
+{
+	"builtin": {
+		"Array": false,
+		"ArrayBuffer": false,
+		"Atomics": false,
+		"BigInt": false,
+		"BigInt64Array": false,
+		"BigUint64Array": false,
+		"Boolean": false,
+		"constructor": false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		"globalThis": false,
+		"hasOwnProperty": false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		"isPrototypeOf": false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		"propertyIsEnumerable": false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		"SharedArrayBuffer": false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		"toLocaleString": false,
+		"toString": false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		"valueOf": false,
+		"WeakMap": false,
+		"WeakSet": false
+	},
+	"es5": {
+		"Array": false,
+		"Boolean": false,
+		"constructor": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Function": false,
+		"hasOwnProperty": false,
+		"Infinity": false,
+		"isFinite": false,
+		"isNaN": false,
+		"isPrototypeOf": false,
+		"JSON": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"propertyIsEnumerable": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"RegExp": false,
+		"String": false,
+		"SyntaxError": false,
+		"toLocaleString": false,
+		"toString": false,
+		"TypeError": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		"valueOf": false
+	},
+	"es2015": {
+		"Array": false,
+		"ArrayBuffer": false,
+		"Boolean": false,
+		"constructor": false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		"hasOwnProperty": false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		"isPrototypeOf": false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		"propertyIsEnumerable": false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		"toLocaleString": false,
+		"toString": false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		"valueOf": false,
+		"WeakMap": false,
+		"WeakSet": false
+	},
+	"es2017": {
+		"Array": false,
+		"ArrayBuffer": false,
+		"Atomics": false,
+		"Boolean": false,
+		"constructor": false,
+		"DataView": false,
+		"Date": false,
+		"decodeURI": false,
+		"decodeURIComponent": false,
+		"encodeURI": false,
+		"encodeURIComponent": false,
+		"Error": false,
+		"escape": false,
+		"eval": false,
+		"EvalError": false,
+		"Float32Array": false,
+		"Float64Array": false,
+		"Function": false,
+		"hasOwnProperty": false,
+		"Infinity": false,
+		"Int16Array": false,
+		"Int32Array": false,
+		"Int8Array": false,
+		"isFinite": false,
+		"isNaN": false,
+		"isPrototypeOf": false,
+		"JSON": false,
+		"Map": false,
+		"Math": false,
+		"NaN": false,
+		"Number": false,
+		"Object": false,
+		"parseFloat": false,
+		"parseInt": false,
+		"Promise": false,
+		"propertyIsEnumerable": false,
+		"Proxy": false,
+		"RangeError": false,
+		"ReferenceError": false,
+		"Reflect": false,
+		"RegExp": false,
+		"Set": false,
+		"SharedArrayBuffer": false,
+		"String": false,
+		"Symbol": false,
+		"SyntaxError": false,
+		"toLocaleString": false,
+		"toString": false,
+		"TypeError": false,
+		"Uint16Array": false,
+		"Uint32Array": false,
+		"Uint8Array": false,
+		"Uint8ClampedArray": false,
+		"undefined": false,
+		"unescape": false,
+		"URIError": false,
+		"valueOf": false,
+		"WeakMap": false,
+		"WeakSet": false
+	},
+	"browser": {
+		"AbortController": false,
+		"AbortSignal": false,
+		"addEventListener": false,
+		"alert": false,
+		"AnalyserNode": false,
+		"Animation": false,
+		"AnimationEffectReadOnly": false,
+		"AnimationEffectTiming": false,
+		"AnimationEffectTimingReadOnly": false,
+		"AnimationEvent": false,
+		"AnimationPlaybackEvent": false,
+		"AnimationTimeline": false,
+		"applicationCache": false,
+		"ApplicationCache": false,
+		"ApplicationCacheErrorEvent": false,
+		"atob": false,
+		"Attr": false,
+		"Audio": false,
+		"AudioBuffer": false,
+		"AudioBufferSourceNode": false,
+		"AudioContext": false,
+		"AudioDestinationNode": false,
+		"AudioListener": false,
+		"AudioNode": false,
+		"AudioParam": false,
+		"AudioProcessingEvent": false,
+		"AudioScheduledSourceNode": false,
+		"AudioWorkletGlobalScope ": false,
+		"AudioWorkletNode": false,
+		"AudioWorkletProcessor": false,
+		"BarProp": false,
+		"BaseAudioContext": false,
+		"BatteryManager": false,
+		"BeforeUnloadEvent": false,
+		"BiquadFilterNode": false,
+		"Blob": false,
+		"BlobEvent": false,
+		"blur": false,
+		"BroadcastChannel": false,
+		"btoa": false,
+		"BudgetService": false,
+		"ByteLengthQueuingStrategy": false,
+		"Cache": false,
+		"caches": false,
+		"CacheStorage": false,
+		"cancelAnimationFrame": false,
+		"cancelIdleCallback": false,
+		"CanvasCaptureMediaStreamTrack": false,
+		"CanvasGradient": false,
+		"CanvasPattern": false,
+		"CanvasRenderingContext2D": false,
+		"ChannelMergerNode": false,
+		"ChannelSplitterNode": false,
+		"CharacterData": false,
+		"clearInterval": false,
+		"clearTimeout": false,
+		"clientInformation": false,
+		"ClipboardEvent": false,
+		"close": false,
+		"closed": false,
+		"CloseEvent": false,
+		"Comment": false,
+		"CompositionEvent": false,
+		"confirm": false,
+		"console": false,
+		"ConstantSourceNode": false,
+		"ConvolverNode": false,
+		"CountQueuingStrategy": false,
+		"createImageBitmap": false,
+		"Credential": false,
+		"CredentialsContainer": false,
+		"crypto": false,
+		"Crypto": false,
+		"CryptoKey": false,
+		"CSS": false,
+		"CSSConditionRule": false,
+		"CSSFontFaceRule": false,
+		"CSSGroupingRule": false,
+		"CSSImportRule": false,
+		"CSSKeyframeRule": false,
+		"CSSKeyframesRule": false,
+		"CSSMediaRule": false,
+		"CSSNamespaceRule": false,
+		"CSSPageRule": false,
+		"CSSRule": false,
+		"CSSRuleList": false,
+		"CSSStyleDeclaration": false,
+		"CSSStyleRule": false,
+		"CSSStyleSheet": false,
+		"CSSSupportsRule": false,
+		"CustomElementRegistry": false,
+		"customElements": false,
+		"CustomEvent": false,
+		"DataTransfer": false,
+		"DataTransferItem": false,
+		"DataTransferItemList": false,
+		"defaultstatus": false,
+		"defaultStatus": false,
+		"DelayNode": false,
+		"DeviceMotionEvent": false,
+		"DeviceOrientationEvent": false,
+		"devicePixelRatio": false,
+		"dispatchEvent": false,
+		"document": false,
+		"Document": false,
+		"DocumentFragment": false,
+		"DocumentType": false,
+		"DOMError": false,
+		"DOMException": false,
+		"DOMImplementation": false,
+		"DOMMatrix": false,
+		"DOMMatrixReadOnly": false,
+		"DOMParser": false,
+		"DOMPoint": false,
+		"DOMPointReadOnly": false,
+		"DOMQuad": false,
+		"DOMRect": false,
+		"DOMRectReadOnly": false,
+		"DOMStringList": false,
+		"DOMStringMap": false,
+		"DOMTokenList": false,
+		"DragEvent": false,
+		"DynamicsCompressorNode": false,
+		"Element": false,
+		"ErrorEvent": false,
+		"event": false,
+		"Event": false,
+		"EventSource": false,
+		"EventTarget": false,
+		"external": false,
+		"fetch": false,
+		"File": false,
+		"FileList": false,
+		"FileReader": false,
+		"find": false,
+		"focus": false,
+		"FocusEvent": false,
+		"FontFace": false,
+		"FontFaceSetLoadEvent": false,
+		"FormData": false,
+		"frameElement": false,
+		"frames": false,
+		"GainNode": false,
+		"Gamepad": false,
+		"GamepadButton": false,
+		"GamepadEvent": false,
+		"getComputedStyle": false,
+		"getSelection": false,
+		"HashChangeEvent": false,
+		"Headers": false,
+		"history": false,
+		"History": false,
+		"HTMLAllCollection": false,
+		"HTMLAnchorElement": false,
+		"HTMLAreaElement": false,
+		"HTMLAudioElement": false,
+		"HTMLBaseElement": false,
+		"HTMLBodyElement": false,
+		"HTMLBRElement": false,
+		"HTMLButtonElement": false,
+		"HTMLCanvasElement": false,
+		"HTMLCollection": false,
+		"HTMLContentElement": false,
+		"HTMLDataElement": false,
+		"HTMLDataListElement": false,
+		"HTMLDetailsElement": false,
+		"HTMLDialogElement": false,
+		"HTMLDirectoryElement": false,
+		"HTMLDivElement": false,
+		"HTMLDListElement": false,
+		"HTMLDocument": false,
+		"HTMLElement": false,
+		"HTMLEmbedElement": false,
+		"HTMLFieldSetElement": false,
+		"HTMLFontElement": false,
+		"HTMLFormControlsCollection": false,
+		"HTMLFormElement": false,
+		"HTMLFrameElement": false,
+		"HTMLFrameSetElement": false,
+		"HTMLHeadElement": false,
+		"HTMLHeadingElement": false,
+		"HTMLHRElement": false,
+		"HTMLHtmlElement": false,
+		"HTMLIFrameElement": false,
+		"HTMLImageElement": false,
+		"HTMLInputElement": false,
+		"HTMLLabelElement": false,
+		"HTMLLegendElement": false,
+		"HTMLLIElement": false,
+		"HTMLLinkElement": false,
+		"HTMLMapElement": false,
+		"HTMLMarqueeElement": false,
+		"HTMLMediaElement": false,
+		"HTMLMenuElement": false,
+		"HTMLMetaElement": false,
+		"HTMLMeterElement": false,
+		"HTMLModElement": false,
+		"HTMLObjectElement": false,
+		"HTMLOListElement": false,
+		"HTMLOptGroupElement": false,
+		"HTMLOptionElement": false,
+		"HTMLOptionsCollection": false,
+		"HTMLOutputElement": false,
+		"HTMLParagraphElement": false,
+		"HTMLParamElement": false,
+		"HTMLPictureElement": false,
+		"HTMLPreElement": false,
+		"HTMLProgressElement": false,
+		"HTMLQuoteElement": false,
+		"HTMLScriptElement": false,
+		"HTMLSelectElement": false,
+		"HTMLShadowElement": false,
+		"HTMLSlotElement": false,
+		"HTMLSourceElement": false,
+		"HTMLSpanElement": false,
+		"HTMLStyleElement": false,
+		"HTMLTableCaptionElement": false,
+		"HTMLTableCellElement": false,
+		"HTMLTableColElement": false,
+		"HTMLTableElement": false,
+		"HTMLTableRowElement": false,
+		"HTMLTableSectionElement": false,
+		"HTMLTemplateElement": false,
+		"HTMLTextAreaElement": false,
+		"HTMLTimeElement": false,
+		"HTMLTitleElement": false,
+		"HTMLTrackElement": false,
+		"HTMLUListElement": false,
+		"HTMLUnknownElement": false,
+		"HTMLVideoElement": false,
+		"IDBCursor": false,
+		"IDBCursorWithValue": false,
+		"IDBDatabase": false,
+		"IDBFactory": false,
+		"IDBIndex": false,
+		"IDBKeyRange": false,
+		"IDBObjectStore": false,
+		"IDBOpenDBRequest": false,
+		"IDBRequest": false,
+		"IDBTransaction": false,
+		"IDBVersionChangeEvent": false,
+		"IdleDeadline": false,
+		"IIRFilterNode": false,
+		"Image": false,
+		"ImageBitmap": false,
+		"ImageBitmapRenderingContext": false,
+		"ImageCapture": false,
+		"ImageData": false,
+		"indexedDB": false,
+		"innerHeight": false,
+		"innerWidth": false,
+		"InputEvent": false,
+		"IntersectionObserver": false,
+		"IntersectionObserverEntry": false,
+		"Intl": false,
+		"isSecureContext": false,
+		"KeyboardEvent": false,
+		"KeyframeEffect": false,
+		"KeyframeEffectReadOnly": false,
+		"length": false,
+		"localStorage": false,
+		"location": true,
+		"Location": false,
+		"locationbar": false,
+		"matchMedia": false,
+		"MediaDeviceInfo": false,
+		"MediaDevices": false,
+		"MediaElementAudioSourceNode": false,
+		"MediaEncryptedEvent": false,
+		"MediaError": false,
+		"MediaKeyMessageEvent": false,
+		"MediaKeySession": false,
+		"MediaKeyStatusMap": false,
+		"MediaKeySystemAccess": false,
+		"MediaList": false,
+		"MediaQueryList": false,
+		"MediaQueryListEvent": false,
+		"MediaRecorder": false,
+		"MediaSettingsRange": false,
+		"MediaSource": false,
+		"MediaStream": false,
+		"MediaStreamAudioDestinationNode": false,
+		"MediaStreamAudioSourceNode": false,
+		"MediaStreamEvent": false,
+		"MediaStreamTrack": false,
+		"MediaStreamTrackEvent": false,
+		"menubar": false,
+		"MessageChannel": false,
+		"MessageEvent": false,
+		"MessagePort": false,
+		"MIDIAccess": false,
+		"MIDIConnectionEvent": false,
+		"MIDIInput": false,
+		"MIDIInputMap": false,
+		"MIDIMessageEvent": false,
+		"MIDIOutput": false,
+		"MIDIOutputMap": false,
+		"MIDIPort": false,
+		"MimeType": false,
+		"MimeTypeArray": false,
+		"MouseEvent": false,
+		"moveBy": false,
+		"moveTo": false,
+		"MutationEvent": false,
+		"MutationObserver": false,
+		"MutationRecord": false,
+		"name": false,
+		"NamedNodeMap": false,
+		"NavigationPreloadManager": false,
+		"navigator": false,
+		"Navigator": false,
+		"NetworkInformation": false,
+		"Node": false,
+		"NodeFilter": false,
+		"NodeIterator": false,
+		"NodeList": false,
+		"Notification": false,
+		"OfflineAudioCompletionEvent": false,
+		"OfflineAudioContext": false,
+		"offscreenBuffering": false,
+		"OffscreenCanvas": true,
+		"onabort": true,
+		"onafterprint": true,
+		"onanimationend": true,
+		"onanimationiteration": true,
+		"onanimationstart": true,
+		"onappinstalled": true,
+		"onauxclick": true,
+		"onbeforeinstallprompt": true,
+		"onbeforeprint": true,
+		"onbeforeunload": true,
+		"onblur": true,
+		"oncancel": true,
+		"oncanplay": true,
+		"oncanplaythrough": true,
+		"onchange": true,
+		"onclick": true,
+		"onclose": true,
+		"oncontextmenu": true,
+		"oncuechange": true,
+		"ondblclick": true,
+		"ondevicemotion": true,
+		"ondeviceorientation": true,
+		"ondeviceorientationabsolute": true,
+		"ondrag": true,
+		"ondragend": true,
+		"ondragenter": true,
+		"ondragleave": true,
+		"ondragover": true,
+		"ondragstart": true,
+		"ondrop": true,
+		"ondurationchange": true,
+		"onemptied": true,
+		"onended": true,
+		"onerror": true,
+		"onfocus": true,
+		"ongotpointercapture": true,
+		"onhashchange": true,
+		"oninput": true,
+		"oninvalid": true,
+		"onkeydown": true,
+		"onkeypress": true,
+		"onkeyup": true,
+		"onlanguagechange": true,
+		"onload": true,
+		"onloadeddata": true,
+		"onloadedmetadata": true,
+		"onloadstart": true,
+		"onlostpointercapture": true,
+		"onmessage": true,
+		"onmessageerror": true,
+		"onmousedown": true,
+		"onmouseenter": true,
+		"onmouseleave": true,
+		"onmousemove": true,
+		"onmouseout": true,
+		"onmouseover": true,
+		"onmouseup": true,
+		"onmousewheel": true,
+		"onoffline": true,
+		"ononline": true,
+		"onpagehide": true,
+		"onpageshow": true,
+		"onpause": true,
+		"onplay": true,
+		"onplaying": true,
+		"onpointercancel": true,
+		"onpointerdown": true,
+		"onpointerenter": true,
+		"onpointerleave": true,
+		"onpointermove": true,
+		"onpointerout": true,
+		"onpointerover": true,
+		"onpointerup": true,
+		"onpopstate": true,
+		"onprogress": true,
+		"onratechange": true,
+		"onrejectionhandled": true,
+		"onreset": true,
+		"onresize": true,
+		"onscroll": true,
+		"onsearch": true,
+		"onseeked": true,
+		"onseeking": true,
+		"onselect": true,
+		"onstalled": true,
+		"onstorage": true,
+		"onsubmit": true,
+		"onsuspend": true,
+		"ontimeupdate": true,
+		"ontoggle": true,
+		"ontransitionend": true,
+		"onunhandledrejection": true,
+		"onunload": true,
+		"onvolumechange": true,
+		"onwaiting": true,
+		"onwheel": true,
+		"open": false,
+		"openDatabase": false,
+		"opener": false,
+		"Option": false,
+		"origin": false,
+		"OscillatorNode": false,
+		"outerHeight": false,
+		"outerWidth": false,
+		"PageTransitionEvent": false,
+		"pageXOffset": false,
+		"pageYOffset": false,
+		"PannerNode": false,
+		"parent": false,
+		"Path2D": false,
+		"PaymentAddress": false,
+		"PaymentRequest": false,
+		"PaymentRequestUpdateEvent": false,
+		"PaymentResponse": false,
+		"performance": false,
+		"Performance": false,
+		"PerformanceEntry": false,
+		"PerformanceLongTaskTiming": false,
+		"PerformanceMark": false,
+		"PerformanceMeasure": false,
+		"PerformanceNavigation": false,
+		"PerformanceNavigationTiming": false,
+		"PerformanceObserver": false,
+		"PerformanceObserverEntryList": false,
+		"PerformancePaintTiming": false,
+		"PerformanceResourceTiming": false,
+		"PerformanceTiming": false,
+		"PeriodicWave": false,
+		"Permissions": false,
+		"PermissionStatus": false,
+		"personalbar": false,
+		"PhotoCapabilities": false,
+		"Plugin": false,
+		"PluginArray": false,
+		"PointerEvent": false,
+		"PopStateEvent": false,
+		"postMessage": false,
+		"Presentation": false,
+		"PresentationAvailability": false,
+		"PresentationConnection": false,
+		"PresentationConnectionAvailableEvent": false,
+		"PresentationConnectionCloseEvent": false,
+		"PresentationConnectionList": false,
+		"PresentationReceiver": false,
+		"PresentationRequest": false,
+		"print": false,
+		"ProcessingInstruction": false,
+		"ProgressEvent": false,
+		"PromiseRejectionEvent": false,
+		"prompt": false,
+		"PushManager": false,
+		"PushSubscription": false,
+		"PushSubscriptionOptions": false,
+		"queueMicrotask": false,
+		"RadioNodeList": false,
+		"Range": false,
+		"ReadableStream": false,
+		"registerProcessor": false,
+		"RemotePlayback": false,
+		"removeEventListener": false,
+		"Request": false,
+		"requestAnimationFrame": false,
+		"requestIdleCallback": false,
+		"resizeBy": false,
+		"ResizeObserver": false,
+		"ResizeObserverEntry": false,
+		"resizeTo": false,
+		"Response": false,
+		"RTCCertificate": false,
+		"RTCDataChannel": false,
+		"RTCDataChannelEvent": false,
+		"RTCDtlsTransport": false,
+		"RTCIceCandidate": false,
+		"RTCIceGatherer": false,
+		"RTCIceTransport": false,
+		"RTCPeerConnection": false,
+		"RTCPeerConnectionIceEvent": false,
+		"RTCRtpContributingSource": false,
+		"RTCRtpReceiver": false,
+		"RTCRtpSender": false,
+		"RTCSctpTransport": false,
+		"RTCSessionDescription": false,
+		"RTCStatsReport": false,
+		"RTCTrackEvent": false,
+		"screen": false,
+		"Screen": false,
+		"screenLeft": false,
+		"ScreenOrientation": false,
+		"screenTop": false,
+		"screenX": false,
+		"screenY": false,
+		"ScriptProcessorNode": false,
+		"scroll": false,
+		"scrollbars": false,
+		"scrollBy": false,
+		"scrollTo": false,
+		"scrollX": false,
+		"scrollY": false,
+		"SecurityPolicyViolationEvent": false,
+		"Selection": false,
+		"self": false,
+		"ServiceWorker": false,
+		"ServiceWorkerContainer": false,
+		"ServiceWorkerRegistration": false,
+		"sessionStorage": false,
+		"setInterval": false,
+		"setTimeout": false,
+		"ShadowRoot": false,
+		"SharedWorker": false,
+		"SourceBuffer": false,
+		"SourceBufferList": false,
+		"speechSynthesis": false,
+		"SpeechSynthesisEvent": false,
+		"SpeechSynthesisUtterance": false,
+		"StaticRange": false,
+		"status": false,
+		"statusbar": false,
+		"StereoPannerNode": false,
+		"stop": false,
+		"Storage": false,
+		"StorageEvent": false,
+		"StorageManager": false,
+		"styleMedia": false,
+		"StyleSheet": false,
+		"StyleSheetList": false,
+		"SubtleCrypto": false,
+		"SVGAElement": false,
+		"SVGAngle": false,
+		"SVGAnimatedAngle": false,
+		"SVGAnimatedBoolean": false,
+		"SVGAnimatedEnumeration": false,
+		"SVGAnimatedInteger": false,
+		"SVGAnimatedLength": false,
+		"SVGAnimatedLengthList": false,
+		"SVGAnimatedNumber": false,
+		"SVGAnimatedNumberList": false,
+		"SVGAnimatedPreserveAspectRatio": false,
+		"SVGAnimatedRect": false,
+		"SVGAnimatedString": false,
+		"SVGAnimatedTransformList": false,
+		"SVGAnimateElement": false,
+		"SVGAnimateMotionElement": false,
+		"SVGAnimateTransformElement": false,
+		"SVGAnimationElement": false,
+		"SVGCircleElement": false,
+		"SVGClipPathElement": false,
+		"SVGComponentTransferFunctionElement": false,
+		"SVGDefsElement": false,
+		"SVGDescElement": false,
+		"SVGDiscardElement": false,
+		"SVGElement": false,
+		"SVGEllipseElement": false,
+		"SVGFEBlendElement": false,
+		"SVGFEColorMatrixElement": false,
+		"SVGFEComponentTransferElement": false,
+		"SVGFECompositeElement": false,
+		"SVGFEConvolveMatrixElement": false,
+		"SVGFEDiffuseLightingElement": false,
+		"SVGFEDisplacementMapElement": false,
+		"SVGFEDistantLightElement": false,
+		"SVGFEDropShadowElement": false,
+		"SVGFEFloodElement": false,
+		"SVGFEFuncAElement": false,
+		"SVGFEFuncBElement": false,
+		"SVGFEFuncGElement": false,
+		"SVGFEFuncRElement": false,
+		"SVGFEGaussianBlurElement": false,
+		"SVGFEImageElement": false,
+		"SVGFEMergeElement": false,
+		"SVGFEMergeNodeElement": false,
+		"SVGFEMorphologyElement": false,
+		"SVGFEOffsetElement": false,
+		"SVGFEPointLightElement": false,
+		"SVGFESpecularLightingElement": false,
+		"SVGFESpotLightElement": false,
+		"SVGFETileElement": false,
+		"SVGFETurbulenceElement": false,
+		"SVGFilterElement": false,
+		"SVGForeignObjectElement": false,
+		"SVGGElement": false,
+		"SVGGeometryElement": false,
+		"SVGGradientElement": false,
+		"SVGGraphicsElement": false,
+		"SVGImageElement": false,
+		"SVGLength": false,
+		"SVGLengthList": false,
+		"SVGLinearGradientElement": false,
+		"SVGLineElement": false,
+		"SVGMarkerElement": false,
+		"SVGMaskElement": false,
+		"SVGMatrix": false,
+		"SVGMetadataElement": false,
+		"SVGMPathElement": false,
+		"SVGNumber": false,
+		"SVGNumberList": false,
+		"SVGPathElement": false,
+		"SVGPatternElement": false,
+		"SVGPoint": false,
+		"SVGPointList": false,
+		"SVGPolygonElement": false,
+		"SVGPolylineElement": false,
+		"SVGPreserveAspectRatio": false,
+		"SVGRadialGradientElement": false,
+		"SVGRect": false,
+		"SVGRectElement": false,
+		"SVGScriptElement": false,
+		"SVGSetElement": false,
+		"SVGStopElement": false,
+		"SVGStringList": false,
+		"SVGStyleElement": false,
+		"SVGSVGElement": false,
+		"SVGSwitchElement": false,
+		"SVGSymbolElement": false,
+		"SVGTextContentElement": false,
+		"SVGTextElement": false,
+		"SVGTextPathElement": false,
+		"SVGTextPositioningElement": false,
+		"SVGTitleElement": false,
+		"SVGTransform": false,
+		"SVGTransformList": false,
+		"SVGTSpanElement": false,
+		"SVGUnitTypes": false,
+		"SVGUseElement": false,
+		"SVGViewElement": false,
+		"TaskAttributionTiming": false,
+		"Text": false,
+		"TextDecoder": false,
+		"TextEncoder": false,
+		"TextEvent": false,
+		"TextMetrics": false,
+		"TextTrack": false,
+		"TextTrackCue": false,
+		"TextTrackCueList": false,
+		"TextTrackList": false,
+		"TimeRanges": false,
+		"toolbar": false,
+		"top": false,
+		"Touch": false,
+		"TouchEvent": false,
+		"TouchList": false,
+		"TrackEvent": false,
+		"TransitionEvent": false,
+		"TreeWalker": false,
+		"UIEvent": false,
+		"URL": false,
+		"URLSearchParams": false,
+		"ValidityState": false,
+		"visualViewport": false,
+		"VisualViewport": false,
+		"VTTCue": false,
+		"WaveShaperNode": false,
+		"WebAssembly": false,
+		"WebGL2RenderingContext": false,
+		"WebGLActiveInfo": false,
+		"WebGLBuffer": false,
+		"WebGLContextEvent": false,
+		"WebGLFramebuffer": false,
+		"WebGLProgram": false,
+		"WebGLQuery": false,
+		"WebGLRenderbuffer": false,
+		"WebGLRenderingContext": false,
+		"WebGLSampler": false,
+		"WebGLShader": false,
+		"WebGLShaderPrecisionFormat": false,
+		"WebGLSync": false,
+		"WebGLTexture": false,
+		"WebGLTransformFeedback": false,
+		"WebGLUniformLocation": false,
+		"WebGLVertexArrayObject": false,
+		"WebSocket": false,
+		"WheelEvent": false,
+		"window": false,
+		"Window": false,
+		"Worker": false,
+		"WritableStream": false,
+		"XMLDocument": false,
+		"XMLHttpRequest": false,
+		"XMLHttpRequestEventTarget": false,
+		"XMLHttpRequestUpload": false,
+		"XMLSerializer": false,
+		"XPathEvaluator": false,
+		"XPathExpression": false,
+		"XPathResult": false,
+		"XSLTProcessor": false
+	},
+	"worker": {
+		"addEventListener": false,
+		"applicationCache": false,
+		"atob": false,
+		"Blob": false,
+		"BroadcastChannel": false,
+		"btoa": false,
+		"Cache": false,
+		"caches": false,
+		"clearInterval": false,
+		"clearTimeout": false,
+		"close": true,
+		"console": false,
+		"fetch": false,
+		"FileReaderSync": false,
+		"FormData": false,
+		"Headers": false,
+		"IDBCursor": false,
+		"IDBCursorWithValue": false,
+		"IDBDatabase": false,
+		"IDBFactory": false,
+		"IDBIndex": false,
+		"IDBKeyRange": false,
+		"IDBObjectStore": false,
+		"IDBOpenDBRequest": false,
+		"IDBRequest": false,
+		"IDBTransaction": false,
+		"IDBVersionChangeEvent": false,
+		"ImageData": false,
+		"importScripts": true,
+		"indexedDB": false,
+		"location": false,
+		"MessageChannel": false,
+		"MessagePort": false,
+		"name": false,
+		"navigator": false,
+		"Notification": false,
+		"onclose": true,
+		"onconnect": true,
+		"onerror": true,
+		"onlanguagechange": true,
+		"onmessage": true,
+		"onoffline": true,
+		"ononline": true,
+		"onrejectionhandled": true,
+		"onunhandledrejection": true,
+		"performance": false,
+		"Performance": false,
+		"PerformanceEntry": false,
+		"PerformanceMark": false,
+		"PerformanceMeasure": false,
+		"PerformanceNavigation": false,
+		"PerformanceResourceTiming": false,
+		"PerformanceTiming": false,
+		"postMessage": true,
+		"Promise": false,
+		"queueMicrotask": false,
+		"removeEventListener": false,
+		"Request": false,
+		"Response": false,
+		"self": true,
+		"ServiceWorkerRegistration": false,
+		"setInterval": false,
+		"setTimeout": false,
+		"TextDecoder": false,
+		"TextEncoder": false,
+		"URL": false,
+		"URLSearchParams": false,
+		"WebSocket": false,
+		"Worker": false,
+		"WorkerGlobalScope": false,
+		"XMLHttpRequest": false
+	},
+	"node": {
+		"__dirname": false,
+		"__filename": false,
+		"Buffer": false,
+		"clearImmediate": false,
+		"clearInterval": false,
+		"clearTimeout": false,
+		"console": false,
+		"exports": true,
+		"global": false,
+		"Intl": false,
+		"module": false,
+		"process": false,
+		"queueMicrotask": false,
+		"require": false,
+		"setImmediate": false,
+		"setInterval": false,
+		"setTimeout": false,
+		"TextDecoder": false,
+		"TextEncoder": false,
+		"URL": false,
+		"URLSearchParams": false
+	},
+	"commonjs": {
+		"exports": true,
+		"global": false,
+		"module": false,
+		"require": false
+	},
+	"amd": {
+		"define": false,
+		"require": false
+	},
+	"mocha": {
+		"after": false,
+		"afterEach": false,
+		"before": false,
+		"beforeEach": false,
+		"context": false,
+		"describe": false,
+		"it": false,
+		"mocha": false,
+		"run": false,
+		"setup": false,
+		"specify": false,
+		"suite": false,
+		"suiteSetup": false,
+		"suiteTeardown": false,
+		"teardown": false,
+		"test": false,
+		"xcontext": false,
+		"xdescribe": false,
+		"xit": false,
+		"xspecify": false
+	},
+	"jasmine": {
+		"afterAll": false,
+		"afterEach": false,
+		"beforeAll": false,
+		"beforeEach": false,
+		"describe": false,
+		"expect": false,
+		"fail": false,
+		"fdescribe": false,
+		"fit": false,
+		"it": false,
+		"jasmine": false,
+		"pending": false,
+		"runs": false,
+		"spyOn": false,
+		"spyOnProperty": false,
+		"waits": false,
+		"waitsFor": false,
+		"xdescribe": false,
+		"xit": false
+	},
+	"jest": {
+		"afterAll": false,
+		"afterEach": false,
+		"beforeAll": false,
+		"beforeEach": false,
+		"describe": false,
+		"expect": false,
+		"fdescribe": false,
+		"fit": false,
+		"it": false,
+		"jest": false,
+		"pit": false,
+		"require": false,
+		"test": false,
+		"xdescribe": false,
+		"xit": false,
+		"xtest": false
+	},
+	"qunit": {
+		"asyncTest": false,
+		"deepEqual": false,
+		"equal": false,
+		"expect": false,
+		"module": false,
+		"notDeepEqual": false,
+		"notEqual": false,
+		"notOk": false,
+		"notPropEqual": false,
+		"notStrictEqual": false,
+		"ok": false,
+		"propEqual": false,
+		"QUnit": false,
+		"raises": false,
+		"start": false,
+		"stop": false,
+		"strictEqual": false,
+		"test": false,
+		"throws": false
+	},
+	"phantomjs": {
+		"console": true,
+		"exports": true,
+		"phantom": true,
+		"require": true,
+		"WebPage": true
+	},
+	"couch": {
+		"emit": false,
+		"exports": false,
+		"getRow": false,
+		"log": false,
+		"module": false,
+		"provides": false,
+		"require": false,
+		"respond": false,
+		"send": false,
+		"start": false,
+		"sum": false
+	},
+	"rhino": {
+		"defineClass": false,
+		"deserialize": false,
+		"gc": false,
+		"help": false,
+		"importClass": false,
+		"importPackage": false,
+		"java": false,
+		"load": false,
+		"loadClass": false,
+		"Packages": false,
+		"print": false,
+		"quit": false,
+		"readFile": false,
+		"readUrl": false,
+		"runCommand": false,
+		"seal": false,
+		"serialize": false,
+		"spawn": false,
+		"sync": false,
+		"toint32": false,
+		"version": false
+	},
+	"nashorn": {
+		"__DIR__": false,
+		"__FILE__": false,
+		"__LINE__": false,
+		"com": false,
+		"edu": false,
+		"exit": false,
+		"java": false,
+		"Java": false,
+		"javafx": false,
+		"JavaImporter": false,
+		"javax": false,
+		"JSAdapter": false,
+		"load": false,
+		"loadWithNewGlobal": false,
+		"org": false,
+		"Packages": false,
+		"print": false,
+		"quit": false
+	},
+	"wsh": {
+		"ActiveXObject": true,
+		"Enumerator": true,
+		"GetObject": true,
+		"ScriptEngine": true,
+		"ScriptEngineBuildVersion": true,
+		"ScriptEngineMajorVersion": true,
+		"ScriptEngineMinorVersion": true,
+		"VBArray": true,
+		"WScript": true,
+		"WSH": true,
+		"XDomainRequest": true
+	},
+	"jquery": {
+		"$": false,
+		"jQuery": false
+	},
+	"yui": {
+		"YAHOO": false,
+		"YAHOO_config": false,
+		"YUI": false,
+		"YUI_config": false
+	},
+	"shelljs": {
+		"cat": false,
+		"cd": false,
+		"chmod": false,
+		"config": false,
+		"cp": false,
+		"dirs": false,
+		"echo": false,
+		"env": false,
+		"error": false,
+		"exec": false,
+		"exit": false,
+		"find": false,
+		"grep": false,
+		"ln": false,
+		"ls": false,
+		"mkdir": false,
+		"mv": false,
+		"popd": false,
+		"pushd": false,
+		"pwd": false,
+		"rm": false,
+		"sed": false,
+		"set": false,
+		"target": false,
+		"tempdir": false,
+		"test": false,
+		"touch": false,
+		"which": false
+	},
+	"prototypejs": {
+		"$": false,
+		"$$": false,
+		"$A": false,
+		"$break": false,
+		"$continue": false,
+		"$F": false,
+		"$H": false,
+		"$R": false,
+		"$w": false,
+		"Abstract": false,
+		"Ajax": false,
+		"Autocompleter": false,
+		"Builder": false,
+		"Class": false,
+		"Control": false,
+		"Draggable": false,
+		"Draggables": false,
+		"Droppables": false,
+		"Effect": false,
+		"Element": false,
+		"Enumerable": false,
+		"Event": false,
+		"Field": false,
+		"Form": false,
+		"Hash": false,
+		"Insertion": false,
+		"ObjectRange": false,
+		"PeriodicalExecuter": false,
+		"Position": false,
+		"Prototype": false,
+		"Scriptaculous": false,
+		"Selector": false,
+		"Sortable": false,
+		"SortableObserver": false,
+		"Sound": false,
+		"Template": false,
+		"Toggle": false,
+		"Try": false
+	},
+	"meteor": {
+		"_": false,
+		"$": false,
+		"Accounts": false,
+		"AccountsClient": false,
+		"AccountsCommon": false,
+		"AccountsServer": false,
+		"App": false,
+		"Assets": false,
+		"Blaze": false,
+		"check": false,
+		"Cordova": false,
+		"DDP": false,
+		"DDPRateLimiter": false,
+		"DDPServer": false,
+		"Deps": false,
+		"EJSON": false,
+		"Email": false,
+		"HTTP": false,
+		"Log": false,
+		"Match": false,
+		"Meteor": false,
+		"Mongo": false,
+		"MongoInternals": false,
+		"Npm": false,
+		"Package": false,
+		"Plugin": false,
+		"process": false,
+		"Random": false,
+		"ReactiveDict": false,
+		"ReactiveVar": false,
+		"Router": false,
+		"ServiceConfiguration": false,
+		"Session": false,
+		"share": false,
+		"Spacebars": false,
+		"Template": false,
+		"Tinytest": false,
+		"Tracker": false,
+		"UI": false,
+		"Utils": false,
+		"WebApp": false,
+		"WebAppInternals": false
+	},
+	"mongo": {
+		"_isWindows": false,
+		"_rand": false,
+		"BulkWriteResult": false,
+		"cat": false,
+		"cd": false,
+		"connect": false,
+		"db": false,
+		"getHostName": false,
+		"getMemInfo": false,
+		"hostname": false,
+		"ISODate": false,
+		"listFiles": false,
+		"load": false,
+		"ls": false,
+		"md5sumFile": false,
+		"mkdir": false,
+		"Mongo": false,
+		"NumberInt": false,
+		"NumberLong": false,
+		"ObjectId": false,
+		"PlanCache": false,
+		"print": false,
+		"printjson": false,
+		"pwd": false,
+		"quit": false,
+		"removeFile": false,
+		"rs": false,
+		"sh": false,
+		"UUID": false,
+		"version": false,
+		"WriteResult": false
+	},
+	"applescript": {
+		"$": false,
+		"Application": false,
+		"Automation": false,
+		"console": false,
+		"delay": false,
+		"Library": false,
+		"ObjC": false,
+		"ObjectSpecifier": false,
+		"Path": false,
+		"Progress": false,
+		"Ref": false
+	},
+	"serviceworker": {
+		"addEventListener": false,
+		"applicationCache": false,
+		"atob": false,
+		"Blob": false,
+		"BroadcastChannel": false,
+		"btoa": false,
+		"Cache": false,
+		"caches": false,
+		"CacheStorage": false,
+		"clearInterval": false,
+		"clearTimeout": false,
+		"Client": false,
+		"clients": false,
+		"Clients": false,
+		"close": true,
+		"console": false,
+		"ExtendableEvent": false,
+		"ExtendableMessageEvent": false,
+		"fetch": false,
+		"FetchEvent": false,
+		"FileReaderSync": false,
+		"FormData": false,
+		"Headers": false,
+		"IDBCursor": false,
+		"IDBCursorWithValue": false,
+		"IDBDatabase": false,
+		"IDBFactory": false,
+		"IDBIndex": false,
+		"IDBKeyRange": false,
+		"IDBObjectStore": false,
+		"IDBOpenDBRequest": false,
+		"IDBRequest": false,
+		"IDBTransaction": false,
+		"IDBVersionChangeEvent": false,
+		"ImageData": false,
+		"importScripts": false,
+		"indexedDB": false,
+		"location": false,
+		"MessageChannel": false,
+		"MessagePort": false,
+		"name": false,
+		"navigator": false,
+		"Notification": false,
+		"onclose": true,
+		"onconnect": true,
+		"onerror": true,
+		"onfetch": true,
+		"oninstall": true,
+		"onlanguagechange": true,
+		"onmessage": true,
+		"onmessageerror": true,
+		"onnotificationclick": true,
+		"onnotificationclose": true,
+		"onoffline": true,
+		"ononline": true,
+		"onpush": true,
+		"onpushsubscriptionchange": true,
+		"onrejectionhandled": true,
+		"onsync": true,
+		"onunhandledrejection": true,
+		"performance": false,
+		"Performance": false,
+		"PerformanceEntry": false,
+		"PerformanceMark": false,
+		"PerformanceMeasure": false,
+		"PerformanceNavigation": false,
+		"PerformanceResourceTiming": false,
+		"PerformanceTiming": false,
+		"postMessage": true,
+		"Promise": false,
+		"queueMicrotask": false,
+		"registration": false,
+		"removeEventListener": false,
+		"Request": false,
+		"Response": false,
+		"self": false,
+		"ServiceWorker": false,
+		"ServiceWorkerContainer": false,
+		"ServiceWorkerGlobalScope": false,
+		"ServiceWorkerMessageEvent": false,
+		"ServiceWorkerRegistration": false,
+		"setInterval": false,
+		"setTimeout": false,
+		"skipWaiting": false,
+		"TextDecoder": false,
+		"TextEncoder": false,
+		"URL": false,
+		"URLSearchParams": false,
+		"WebSocket": false,
+		"WindowClient": false,
+		"Worker": false,
+		"WorkerGlobalScope": false,
+		"XMLHttpRequest": false
+	},
+	"atomtest": {
+		"advanceClock": false,
+		"fakeClearInterval": false,
+		"fakeClearTimeout": false,
+		"fakeSetInterval": false,
+		"fakeSetTimeout": false,
+		"resetTimeouts": false,
+		"waitsForPromise": false
+	},
+	"embertest": {
+		"andThen": false,
+		"click": false,
+		"currentPath": false,
+		"currentRouteName": false,
+		"currentURL": false,
+		"fillIn": false,
+		"find": false,
+		"findAll": false,
+		"findWithAssert": false,
+		"keyEvent": false,
+		"pauseTest": false,
+		"resumeTest": false,
+		"triggerEvent": false,
+		"visit": false,
+		"wait": false
+	},
+	"protractor": {
+		"$": false,
+		"$$": false,
+		"browser": false,
+		"by": false,
+		"By": false,
+		"DartObject": false,
+		"element": false,
+		"protractor": false
+	},
+	"shared-node-browser": {
+		"clearInterval": false,
+		"clearTimeout": false,
+		"console": false,
+		"setInterval": false,
+		"setTimeout": false,
+		"URL": false,
+		"URLSearchParams": false
+	},
+	"webextensions": {
+		"browser": false,
+		"chrome": false,
+		"opr": false
+	},
+	"greasemonkey": {
+		"cloneInto": false,
+		"createObjectIn": false,
+		"exportFunction": false,
+		"GM": false,
+		"GM_addStyle": false,
+		"GM_deleteValue": false,
+		"GM_getResourceText": false,
+		"GM_getResourceURL": false,
+		"GM_getValue": false,
+		"GM_info": false,
+		"GM_listValues": false,
+		"GM_log": false,
+		"GM_openInTab": false,
+		"GM_registerMenuCommand": false,
+		"GM_setClipboard": false,
+		"GM_setValue": false,
+		"GM_xmlhttpRequest": false,
+		"unsafeWindow": false
+	},
+	"devtools": {
+		"$": false,
+		"$_": false,
+		"$$": false,
+		"$0": false,
+		"$1": false,
+		"$2": false,
+		"$3": false,
+		"$4": false,
+		"$x": false,
+		"chrome": false,
+		"clear": false,
+		"copy": false,
+		"debug": false,
+		"dir": false,
+		"dirxml": false,
+		"getEventListeners": false,
+		"inspect": false,
+		"keys": false,
+		"monitor": false,
+		"monitorEvents": false,
+		"profile": false,
+		"profileEnd": false,
+		"queryObjects": false,
+		"table": false,
+		"undebug": false,
+		"unmonitor": false,
+		"unmonitorEvents": false,
+		"values": false
+	}
+}
diff --git a/node_modules/globals/index.js b/node_modules/globals/index.js
new file mode 100644
index 0000000..a951582
--- /dev/null
+++ b/node_modules/globals/index.js
@@ -0,0 +1,2 @@
+'use strict';
+module.exports = require('./globals.json');
diff --git a/node_modules/globals/license b/node_modules/globals/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/globals/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/globals/package.json b/node_modules/globals/package.json
new file mode 100644
index 0000000..2005cbd
--- /dev/null
+++ b/node_modules/globals/package.json
@@ -0,0 +1,82 @@
+{
+  "_from": "globals@^12.0.0",
+  "_id": "globals@12.0.0",
+  "_inBundle": false,
+  "_integrity": "sha512-c9xoi32iDwlETiyYfO0pd3M8GcEuytJinSoqq7k3fz4H8p2p31NyfKr7JVd7Y0QvmtWcWXcwqW4L33eeDYgh1A==",
+  "_location": "/globals",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "globals@^12.0.0",
+    "name": "globals",
+    "escapedName": "globals",
+    "rawSpec": "^12.0.0",
+    "saveSpec": null,
+    "fetchSpec": "^12.0.0"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/globals/-/globals-12.0.0.tgz",
+  "_shasum": "99c258ace9f3f75a5efe7c01387e2e41890c3dba",
+  "_spec": "globals@^12.0.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "Sindre Sorhus",
+    "email": "sindresorhus@gmail.com",
+    "url": "sindresorhus.com"
+  },
+  "bugs": {
+    "url": "https://github.com/sindresorhus/globals/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "type-fest": "^0.6.0"
+  },
+  "deprecated": false,
+  "description": "Global identifiers from different JavaScript environments",
+  "devDependencies": {
+    "ava": "^2.2.0",
+    "tsd": "^0.7.2",
+    "xo": "^0.24.0"
+  },
+  "engines": {
+    "node": ">=8"
+  },
+  "files": [
+    "index.js",
+    "globals.json"
+  ],
+  "homepage": "https://github.com/sindresorhus/globals#readme",
+  "keywords": [
+    "globals",
+    "global",
+    "identifiers",
+    "variables",
+    "vars",
+    "jshint",
+    "eslint",
+    "environments"
+  ],
+  "license": "MIT",
+  "name": "globals",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/sindresorhus/globals.git"
+  },
+  "scripts": {
+    "test": "xo && ava"
+  },
+  "tsd": {
+    "compilerOptions": {
+      "resolveJsonModule": true
+    }
+  },
+  "version": "12.0.0",
+  "xo": {
+    "ignores": [
+      "get-browser-globals.js"
+    ]
+  }
+}
diff --git a/node_modules/globals/readme.md b/node_modules/globals/readme.md
new file mode 100644
index 0000000..b0af4a7
--- /dev/null
+++ b/node_modules/globals/readme.md
@@ -0,0 +1,36 @@
+# globals [![Build Status](https://travis-ci.org/sindresorhus/globals.svg?branch=master)](https://travis-ci.org/sindresorhus/globals)
+
+> Global identifiers from different JavaScript environments
+
+Extracted from [JSHint](https://github.com/jshint/jshint/blob/3a8efa979dbb157bfb5c10b5826603a55a33b9ad/src/vars.js) and [ESLint](https://github.com/eslint/eslint/blob/b648406218f8a2d7302b98f5565e23199f44eb31/conf/environments.json) and merged.
+
+It's just a [JSON file](globals.json), so use it in whatever environment you like.
+
+**This module [no longer accepts](https://github.com/sindresorhus/globals/issues/82) new environments. If you need it for ESLint, just [create a plugin](http://eslint.org/docs/developer-guide/working-with-plugins#environments-in-plugins).**
+
+
+## Install
+
+```
+$ npm install globals
+```
+
+
+## Usage
+
+```js
+const globals = require('globals');
+
+console.log(globals.browser);
+/*
+{
+	addEventListener: false,
+	applicationCache: false,
+	ArrayBuffer: false,
+	atob: false,
+	...
+}
+*/
+```
+
+Each global is given a value of `true` or `false`. A value of `true` indicates that the variable may be overwritten. A value of `false` indicates that the variable should be considered read-only. This information is used by static analysis tools to flag incorrect behavior. We assume all variables should be `false` unless we hear otherwise.
diff --git a/node_modules/private/LICENSE b/node_modules/private/LICENSE
new file mode 100644
index 0000000..6c2f144
--- /dev/null
+++ b/node_modules/private/LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2014 Ben Newman <bn@cs.stanford.edu>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/private/README.md b/node_modules/private/README.md
new file mode 100644
index 0000000..493077b
--- /dev/null
+++ b/node_modules/private/README.md
@@ -0,0 +1,245 @@
+# private [![Build Status](https://travis-ci.org/benjamn/private.png?branch=master)](https://travis-ci.org/benjamn/private) [![Greenkeeper badge](https://badges.greenkeeper.io/benjamn/private.svg)](https://greenkeeper.io/)
+
+A general-purpose utility for associating truly private state with any JavaScript object.
+
+Installation
+---
+
+From NPM:
+
+    npm install private
+
+From GitHub:
+
+    cd path/to/node_modules
+    git clone git://github.com/benjamn/private.git
+    cd private
+    npm install .
+
+Usage
+---
+**Get or create a secret object associated with any (non-frozen) object:**
+```js
+var getSecret = require("private").makeAccessor();
+var obj = Object.create(null); // any kind of object works
+getSecret(obj).totallySafeProperty = "p455w0rd";
+
+console.log(Object.keys(obj)); // []
+console.log(Object.getOwnPropertyNames(obj)); // []
+console.log(getSecret(obj)); // { totallySafeProperty: "p455w0rd" }
+```
+Now, only code that has a reference to both `getSecret` and `obj` can possibly access `.totallySafeProperty`.
+
+*Importantly, no global references to the secret object are retained by the `private` package, so as soon as `obj` gets garbage collected, the secret will be reclaimed as well. In other words, you don't have to worry about memory leaks.*
+
+**Create a unique property name that cannot be enumerated or guessed:**
+```js
+var secretKey = require("private").makeUniqueKey();
+var obj = Object.create(null); // any kind of object works
+
+Object.defineProperty(obj, secretKey, {
+  value: { totallySafeProperty: "p455w0rd" },
+  enumerable: false // optional; non-enumerability is the default
+});
+
+Object.defineProperty(obj, "nonEnumerableProperty", {
+  value: "anyone can guess my name",
+  enumerable: false
+});
+
+console.log(obj[secretKey].totallySafeProperty); // p455w0rd
+console.log(obj.nonEnumerableProperty); // "anyone can guess my name"
+console.log(Object.keys(obj)); // []
+console.log(Object.getOwnPropertyNames(obj)); // ["nonEnumerableProperty"]
+
+for (var key in obj) {
+  console.log(key); // never called
+}
+```
+Because these keys are non-enumerable, you can't discover them using a `for`-`in` loop. Because `secretKey` is a long string of random characters, you would have a lot of trouble guessing it. And because the `private` module wraps `Object.getOwnPropertyNames` to exclude the keys it generates, you can't even use that interface to discover it.
+
+Unless you have access to the value of the `secretKey` property name, there is no way to access the value associated with it. So your only responsibility as secret-keeper is to avoid handing out the value of `secretKey` to untrusted code.
+
+Think of this style as a home-grown version of the first style. Note, however, that it requires a full implementation of ES5's `Object.defineProperty` method in order to make any safety guarantees, whereas the first example will provide safety even in environments that do not support `Object.defineProperty`.
+
+Rationale
+---
+
+In JavaScript, the only data that are truly private are local variables
+whose values do not *leak* from the scope in which they were defined.
+
+This notion of *closure privacy* is powerful, and it readily provides some
+of the benefits of traditional data privacy, a la Java or C++:
+```js
+function MyClass(secret) {
+    this.increment = function() {
+        return ++secret;
+    };
+}
+
+var mc = new MyClass(3);
+console.log(mc.increment()); // 4
+```
+You can learn something about `secret` by calling `.increment()`, and you
+can increase its value by one as many times as you like, but you can never
+decrease its value, because it is completely inaccessible except through
+the `.increment` method. And if the `.increment` method were not
+available, it would be as if no `secret` variable had ever been declared,
+as far as you could tell.
+
+This style breaks down as soon as you want to inherit methods from the
+prototype of a class:
+```js
+function MyClass(secret) {
+    this.secret = secret;
+}
+
+MyClass.prototype.increment = function() {
+    return ++this.secret;
+};
+```
+The only way to communicate between the `MyClass` constructor and the
+`.increment` method in this example is to manipulate shared properties of
+`this`. Unfortunately `this.secret` is now exposed to unlicensed
+modification:
+```js
+var mc = new MyClass(6);
+console.log(mc.increment()); // 7
+mc.secret -= Infinity;
+console.log(mc.increment()); // -Infinity
+mc.secret = "Go home JavaScript, you're drunk.";
+mc.increment(); // NaN
+```
+Another problem with closure privacy is that it only lends itself to
+per-instance privacy, whereas the `private` keyword in most
+object-oriented languages indicates that the data member in question is
+visible to all instances of the same class.
+
+Suppose you have a `Node` class with a notion of parents and children:
+```js
+function Node() {
+    var parent;
+    var children = [];
+
+    this.getParent = function() {
+        return parent;
+    };
+
+    this.appendChild = function(child) {
+        children.push(child);
+        child.parent = this; // Can this be made to work?
+    };
+}
+```
+The desire here is to allow other `Node` objects to manipulate the value
+returned by `.getParent()`, but otherwise disallow any modification of the
+`parent` variable. You could expose a `.setParent` function, but then
+anyone could call it, and you might as well give up on the getter/setter
+pattern.
+
+This module solves both of these problems.
+
+Usage
+---
+
+Let's revisit the `Node` example from above:
+```js
+var p = require("private").makeAccessor();
+
+function Node() {
+    var privates = p(this);
+    var children = [];
+
+    this.getParent = function() {
+        return privates.parent;
+    };
+
+    this.appendChild = function(child) {
+        children.push(child);
+        var cp = p(child);
+        if (cp.parent)
+            cp.parent.removeChild(child);
+        cp.parent = this;
+        return child;
+    };
+}
+```
+Now, in order to access the private data of a `Node` object, you need to
+have access to the unique `p` function that is being used here.  This is
+already an improvement over the previous example, because it allows
+restricted access by other `Node` instances, but can it help with the
+`Node.prototype` problem too?
+
+Yes it can!
+```js
+var p = require("private").makeAccessor();
+
+function Node() {
+    p(this).children = [];
+}
+
+var Np = Node.prototype;
+
+Np.getParent = function() {
+    return p(this).parent;
+};
+
+Np.appendChild = function(child) {
+    p(this).children.push(child);
+    var cp = p(child);
+    if (cp.parent)
+        cp.parent.removeChild(child);
+    cp.parent = this;
+    return child;
+};
+```
+Because `p` is in scope not only within the `Node` constructor but also
+within `Node` methods, we can finally avoid redefining methods every time
+the `Node` constructor is called.
+
+Now, you might be wondering how you can restrict access to `p` so that no
+untrusted code is able to call it. The answer is to use your favorite
+module pattern, be it CommonJS, AMD `define`, or even the old
+Immediately-Invoked Function Expression:
+```js
+var Node = (function() {
+    var p = require("private").makeAccessor();
+
+    function Node() {
+        p(this).children = [];
+    }
+
+    var Np = Node.prototype;
+
+    Np.getParent = function() {
+        return p(this).parent;
+    };
+
+    Np.appendChild = function(child) {
+        p(this).children.push(child);
+        var cp = p(child);
+        if (cp.parent)
+            cp.parent.removeChild(child);
+        cp.parent = this;
+        return child;
+    };
+
+    return Node;
+}());
+
+var parent = new Node;
+var child = new Node;
+parent.appendChild(child);
+assert.strictEqual(child.getParent(), parent);
+```
+Because this version of `p` never leaks from the enclosing function scope,
+only `Node` objects have access to it.
+
+So, you see, the claim I made at the beginning of this README remains
+true:
+
+> In JavaScript, the only data that are truly private are local variables
+> whose values do not *leak* from the scope in which they were defined.
+
+It just so happens that closure privacy is sufficient to implement a
+privacy model similar to that provided by other languages.
diff --git a/node_modules/private/package.json b/node_modules/private/package.json
new file mode 100644
index 0000000..1035792
--- /dev/null
+++ b/node_modules/private/package.json
@@ -0,0 +1,67 @@
+{
+  "_from": "private@^0.1.8",
+  "_id": "private@0.1.8",
+  "_inBundle": false,
+  "_integrity": "sha512-VvivMrbvd2nKkiG38qjULzlc+4Vx4wm/whI9pQD35YrARNnhxeiRktSOhSukRLFNlzg6Br/cJPet5J/u19r/mg==",
+  "_location": "/private",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "private@^0.1.8",
+    "name": "private",
+    "escapedName": "private",
+    "rawSpec": "^0.1.8",
+    "saveSpec": null,
+    "fetchSpec": "^0.1.8"
+  },
+  "_requiredBy": [
+    "/recast"
+  ],
+  "_resolved": "https://registry.npmjs.org/private/-/private-0.1.8.tgz",
+  "_shasum": "2381edb3689f7a53d653190060fcf822d2f368ff",
+  "_spec": "private@^0.1.8",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/recast",
+  "author": {
+    "name": "Ben Newman",
+    "email": "bn@cs.stanford.edu"
+  },
+  "bugs": {
+    "url": "https://github.com/benjamn/private/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Utility for associating truly private state with any JavaScript object",
+  "devDependencies": {
+    "mocha": "^4.0.1"
+  },
+  "engines": {
+    "node": ">= 0.6"
+  },
+  "files": [
+    "private.js"
+  ],
+  "homepage": "http://github.com/benjamn/private",
+  "keywords": [
+    "private",
+    "access control",
+    "access modifiers",
+    "encapsulation",
+    "secret",
+    "state",
+    "privilege",
+    "scope",
+    "es5"
+  ],
+  "license": "MIT",
+  "main": "private.js",
+  "name": "private",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/benjamn/private.git"
+  },
+  "scripts": {
+    "test": "mocha --reporter spec --full-trace test/run.js"
+  },
+  "version": "0.1.8"
+}
diff --git a/node_modules/private/private.js b/node_modules/private/private.js
new file mode 100644
index 0000000..4f952fc
--- /dev/null
+++ b/node_modules/private/private.js
@@ -0,0 +1,129 @@
+"use strict";
+
+var originalObject = Object;
+var originalDefProp = Object.defineProperty;
+var originalCreate = Object.create;
+
+function defProp(obj, name, value) {
+  if (originalDefProp) try {
+    originalDefProp.call(originalObject, obj, name, { value: value });
+  } catch (definePropertyIsBrokenInIE8) {
+    obj[name] = value;
+  } else {
+    obj[name] = value;
+  }
+}
+
+// For functions that will be invoked using .call or .apply, we need to
+// define those methods on the function objects themselves, rather than
+// inheriting them from Function.prototype, so that a malicious or clumsy
+// third party cannot interfere with the functionality of this module by
+// redefining Function.prototype.call or .apply.
+function makeSafeToCall(fun) {
+  if (fun) {
+    defProp(fun, "call", fun.call);
+    defProp(fun, "apply", fun.apply);
+  }
+  return fun;
+}
+
+makeSafeToCall(originalDefProp);
+makeSafeToCall(originalCreate);
+
+var hasOwn = makeSafeToCall(Object.prototype.hasOwnProperty);
+var numToStr = makeSafeToCall(Number.prototype.toString);
+var strSlice = makeSafeToCall(String.prototype.slice);
+
+var cloner = function(){};
+function create(prototype) {
+  if (originalCreate) {
+    return originalCreate.call(originalObject, prototype);
+  }
+  cloner.prototype = prototype || null;
+  return new cloner;
+}
+
+var rand = Math.random;
+var uniqueKeys = create(null);
+
+function makeUniqueKey() {
+  // Collisions are highly unlikely, but this module is in the business of
+  // making guarantees rather than safe bets.
+  do var uniqueKey = internString(strSlice.call(numToStr.call(rand(), 36), 2));
+  while (hasOwn.call(uniqueKeys, uniqueKey));
+  return uniqueKeys[uniqueKey] = uniqueKey;
+}
+
+function internString(str) {
+  var obj = {};
+  obj[str] = true;
+  return Object.keys(obj)[0];
+}
+
+// External users might find this function useful, but it is not necessary
+// for the typical use of this module.
+exports.makeUniqueKey = makeUniqueKey;
+
+// Object.getOwnPropertyNames is the only way to enumerate non-enumerable
+// properties, so if we wrap it to ignore our secret keys, there should be
+// no way (except guessing) to access those properties.
+var originalGetOPNs = Object.getOwnPropertyNames;
+Object.getOwnPropertyNames = function getOwnPropertyNames(object) {
+  for (var names = originalGetOPNs(object),
+           src = 0,
+           dst = 0,
+           len = names.length;
+       src < len;
+       ++src) {
+    if (!hasOwn.call(uniqueKeys, names[src])) {
+      if (src > dst) {
+        names[dst] = names[src];
+      }
+      ++dst;
+    }
+  }
+  names.length = dst;
+  return names;
+};
+
+function defaultCreatorFn(object) {
+  return create(null);
+}
+
+function makeAccessor(secretCreatorFn) {
+  var brand = makeUniqueKey();
+  var passkey = create(null);
+
+  secretCreatorFn = secretCreatorFn || defaultCreatorFn;
+
+  function register(object) {
+    var secret; // Created lazily.
+
+    function vault(key, forget) {
+      // Only code that has access to the passkey can retrieve (or forget)
+      // the secret object.
+      if (key === passkey) {
+        return forget
+          ? secret = null
+          : secret || (secret = secretCreatorFn(object));
+      }
+    }
+
+    defProp(object, brand, vault);
+  }
+
+  function accessor(object) {
+    if (!hasOwn.call(object, brand))
+      register(object);
+    return object[brand](passkey);
+  }
+
+  accessor.forget = function(object) {
+    if (hasOwn.call(object, brand))
+      object[brand](passkey, true);
+  };
+
+  return accessor;
+}
+
+exports.makeAccessor = makeAccessor;
diff --git a/node_modules/recast/.editorconfig b/node_modules/recast/.editorconfig
new file mode 100644
index 0000000..70bfb79
--- /dev/null
+++ b/node_modules/recast/.editorconfig
@@ -0,0 +1,2 @@
+[*.js]
+indent_style = space
diff --git a/node_modules/recast/.travis.yml b/node_modules/recast/.travis.yml
new file mode 100644
index 0000000..18273ed
--- /dev/null
+++ b/node_modules/recast/.travis.yml
@@ -0,0 +1,19 @@
+language: node_js
+matrix:
+  include:
+  - node_js: "12"
+  - node_js: "11"
+  - node_js: "10"
+  - node_js: "9"
+  - node_js: "8"
+  - node_js: "7"
+  - node_js: "6"
+
+# Allow Travis tests to run in containers.
+sudo: false
+
+# Update package-lock.json after test runs:
+before_install:
+  - npm install -g greenkeeper-lockfile@1
+before_script: greenkeeper-lockfile-update
+after_script: greenkeeper-lockfile-upload
diff --git a/node_modules/recast/LICENSE b/node_modules/recast/LICENSE
new file mode 100644
index 0000000..527755b
--- /dev/null
+++ b/node_modules/recast/LICENSE
@@ -0,0 +1,20 @@
+Copyright (c) 2012 Ben Newman <bn@cs.stanford.edu>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/recast/README.md b/node_modules/recast/README.md
new file mode 100644
index 0000000..b087b93
--- /dev/null
+++ b/node_modules/recast/README.md
@@ -0,0 +1,208 @@
+# recast, _v_. [![Build Status](https://travis-ci.org/benjamn/recast.svg?branch=master)](https://travis-ci.org/benjamn/recast) [![Join the chat at https://gitter.im/benjamn/recast](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/benjamn/recast?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) [![Greenkeeper badge](https://badges.greenkeeper.io/benjamn/recast.svg)](https://greenkeeper.io/)
+
+1. to give (a metal object) a different form by melting it down and reshaping it.
+1. to form, fashion, or arrange again.
+1. to remodel or reconstruct (a literary work, document, sentence, etc.).
+1. to supply (a theater or opera work) with a new cast.
+
+Installation
+---
+
+From NPM:
+
+    npm install recast
+    
+From GitHub:
+
+    cd path/to/node_modules
+    git clone git://github.com/benjamn/recast.git
+    cd recast
+    npm install .
+
+Import style
+---
+
+Recast is designed to be imported using **named** imports:
+```js
+import { parse, print } from "recast";
+console.log(print(parse(source)).code);
+
+import * as recast from "recast";
+console.log(recast.print(recast.parse(source)).code);
+```
+
+If you're using CommonJS:
+```js
+const { parse, print } = require("recast");
+console.log(print(parse(source)).code);
+
+const recast = require("recast");
+console.log(recast.print(recast.parse(source)).code);
+```
+
+Usage
+---
+
+Recast exposes two essential interfaces, one for parsing JavaScript code (`require("recast").parse`) and the other for reprinting modified syntax trees (`require("recast").print`).
+
+Here's a simple but non-trivial example of how you might use `.parse` and `.print`:
+```js
+import * as recast from "recast";
+
+// Let's turn this function declaration into a variable declaration.
+const code = [
+  "function add(a, b) {",
+  "  return a +",
+  "    // Weird formatting, huh?",
+  "    b;",
+  "}"
+].join("\n");
+
+// Parse the code using an interface similar to require("esprima").parse.
+const ast = recast.parse(code);
+```
+Now do *whatever* you want to `ast`. Really, anything at all!
+
+See [ast-types](https://github.com/benjamn/ast-types) (especially the [def/core.ts](https://github.com/benjamn/ast-types/blob/master/def/core.ts)) module for a thorough overview of the `ast` API.
+```js
+// Grab a reference to the function declaration we just parsed.
+const add = ast.program.body[0];
+
+// Make sure it's a FunctionDeclaration (optional).
+const n = recast.types.namedTypes;
+n.FunctionDeclaration.assert(add);
+
+// If you choose to use recast.builders to construct new AST nodes, all builder
+// arguments will be dynamically type-checked against the Mozilla Parser API.
+const b = recast.types.builders;
+
+// This kind of manipulation should seem familiar if you've used Esprima or the
+// Mozilla Parser API before.
+ast.program.body[0] = b.variableDeclaration("var", [
+  b.variableDeclarator(add.id, b.functionExpression(
+    null, // Anonymize the function expression.
+    add.params,
+    add.body
+  ))
+]);
+
+// Just for fun, because addition is commutative:
+add.params.push(add.params.shift());
+```
+When you finish manipulating the AST, let `recast.print` work its magic:
+```js
+const output = recast.print(ast).code;
+```
+The `output` string now looks exactly like this, weird formatting and all:
+```js
+var add = function(b, a) {
+  return a +
+    // Weird formatting, huh?
+    b;
+}
+```
+The magic of Recast is that it reprints only those parts of the syntax tree that you modify. In other words, the following identity is guaranteed:
+```js
+recast.print(recast.parse(source)).code === source
+```
+Whenever Recast cannot reprint a modified node using the original source code, it falls back to using a generic pretty printer. So the worst that can happen is that your changes trigger some harmless reformatting of your code.
+
+If you really don't care about preserving the original formatting, you can access the pretty printer directly:
+```js
+var output = recast.prettyPrint(ast, { tabWidth: 2 }).code;
+```
+And here's the exact `output`:
+```js
+var add = function(b, a) {
+  return a + b;
+}
+```
+Note that the weird formatting was discarded, yet the behavior and abstract structure of the code remain the same.
+
+Using a different parser
+---
+
+By default, Recast uses the [Esprima JavaScript parser](https://www.npmjs.com/package/esprima) when you call `recast.parse(code)`. While Esprima supports almost all modern ECMAScript syntax, you may want to use a different parser to enable TypeScript or Flow syntax, or just because you want to match other compilation tools you might be using.
+
+In order to get any benefits from Recast's conservative pretty-printing, **it is very important that you continue to call `recast.parse`** (rather than parsing the AST yourself using a different parser), and simply instruct `recast.parse` to use a different parser:
+
+```js
+const acornAst = recast.parse(source, {
+  parser: require("acorn")
+});
+```
+
+Why is this so important? When you call `recast.parse`, it makes a shadow copy of the AST before returning it to you, giving every copied AST node a reference back to the original through a special `.original` property. This information is what enables `recast.print` to detect where the AST has been modified, so that it can preserve formatting for parts of the AST that were not modified.
+
+Any `parser` object that supports a `parser.parse(source)` method will work here; however, if your parser requires additional options, you can always implement your own `parse` method that invokes your parser with custom options:
+
+```js
+const acornAst = recast.parse(source, {
+  parser: {
+    parse(source) {
+      return require("acorn").parse(source, {
+        // additional options
+      });
+    }
+  }
+});
+```
+
+To take some of the guesswork out of configuring common parsers, Recast provides [several preconfigured parsers](https://github.com/benjamn/recast/tree/master/parsers), so you can parse TypeScript (for example) without worrying about the configuration details:
+
+```js
+const tsAst = recast.parse(source, {
+  parser: require("recast/parsers/typescript")
+});
+```
+
+**Note:** Some of these parsers import npm packages that Recast does not directly depend upon, so please be aware you may have to run `npm install babylon@next` to use the `typescript`, `flow`, or `babylon` parsers, or `npm install acorn` to use the `acorn` parser. Only Esprima is installed by default when Recast is installed.
+
+Source maps
+---
+
+One of the coolest consequences of tracking and reusing original source code during reprinting is that it's pretty easy to generate a high-resolution mapping between the original code and the generated code—completely automatically!
+
+With every `slice`, `join`, and re-`indent`-ation, the reprinting process maintains exact knowledge of which character sequences are original, and where in the original source they came from.
+
+All you have to think about is how to manipulate the syntax tree, and Recast will give you a [source map](https://github.com/mozilla/source-map) in exchange for specifying the names of your source file(s) and the desired name of the map:
+```js
+var result = recast.print(transform(recast.parse(source, {
+  sourceFileName: "source.js"
+})), {
+  sourceMapName: "map.json"
+});
+    
+console.log(result.code); // Resulting string of code.
+console.log(result.map); // JSON source map.
+
+var SourceMapConsumer = require("source-map").SourceMapConsumer;
+var smc = new SourceMapConsumer(result.map);
+console.log(smc.originalPositionFor({
+  line: 3,
+  column: 15
+})); // { source: 'source.js',
+     //   line: 2,
+     //   column: 10,
+     //   name: null }
+```
+
+Note that you are free to mix and match syntax trees parsed from different source files, and the resulting source map will automatically keep track of the separate file origins for you.
+
+Note also that the source maps generated by Recast are character-by-character maps, so meaningful identifier names are not recorded at this time. This approach leads to higher-resolution debugging in modern browsers, at the expense of somewhat larger map sizes. Striking the perfect balance here is an area for future exploration, but such improvements will not require any breaking changes to the interface demonstrated above.
+
+Options
+---
+All Recast API functions take second parameter with configuration options, documented in
+[options.ts](https://github.com/benjamn/recast/blob/master/lib/options.ts)
+
+Motivation
+---
+
+The more code you have, the harder it becomes to make big, sweeping changes quickly and confidently. Even if you trust yourself not to make too many mistakes, and no matter how proficient you are with your text editor, changing tens of thousands of lines of code takes precious, non-refundable time.
+
+Is there a better way? Not always! When a task requires you to alter the semantics of many different pieces of code in subtly different ways, your brain inevitably becomes the bottleneck, and there is little hope of completely automating the process. Your best bet is to plan carefully, buckle down, and get it right the first time. Love it or loathe it, that's the way programming goes sometimes.
+
+What I hope to eliminate are the brain-wasting tasks, the tasks that are bottlenecked by keystrokes, the tasks that can be expressed as operations on the _syntactic structure_ of your code. Specifically, my goal is to make it possible for you to run your code through a parser, manipulate the abstract syntax tree directly, subject only to the constraints of your imagination, and then automatically translate those modifications back into source code, without upsetting the formatting of unmodified code.
+
+And here's the best part: when you're done running a Recast script, if you're not completely satisfied with the results, blow them away with `git reset --hard`, tweak the script, and just run it again. Change your mind as many times as you like. Instead of typing yourself into a nasty case of [RSI](http://en.wikipedia.org/wiki/Repetitive_strain_injury), gaze upon your new wells of free time and ask yourself: what next?
diff --git a/node_modules/recast/example/add-braces b/node_modules/recast/example/add-braces
new file mode 100755
index 0000000..0c6901d
--- /dev/null
+++ b/node_modules/recast/example/add-braces
@@ -0,0 +1,44 @@
+#!/usr/bin/env node
+
+var recast = require("recast");
+var types = recast.types;
+var n = types.namedTypes;
+var b = types.builders;
+
+require("recast").run(function(ast, callback) {
+    recast.visit(ast, {
+        visitIfStatement: function(path) {
+            var stmt = path.node;
+            stmt.consequent = fix(stmt.consequent);
+
+            var alt = stmt.alternate;
+            if (!n.IfStatement.check(alt)) {
+                stmt.alternate = fix(alt);
+            }
+
+            this.traverse(path);
+        },
+
+        visitWhileStatement: visitLoop,
+        visitForStatement: visitLoop,
+        visitForInStatement: visitLoop
+    });
+
+    callback(ast);
+});
+
+function visitLoop(path) {
+    var loop = path.node;
+    loop.body = fix(loop.body);
+    this.traverse(path);
+}
+
+function fix(clause) {
+    if (clause) {
+        if (!n.BlockStatement.check(clause)) {
+            clause = b.blockStatement([clause]);
+        }
+    }
+
+    return clause;
+}
diff --git a/node_modules/recast/example/generic-identity b/node_modules/recast/example/generic-identity
new file mode 100755
index 0000000..a8364c3
--- /dev/null
+++ b/node_modules/recast/example/generic-identity
@@ -0,0 +1,17 @@
+#!/usr/bin/env node
+
+// This script should reprint the contents of the given file without
+// reusing the original source, but with identical AST structure.
+
+var recast = require("recast");
+
+recast.run(function(ast, callback) {
+    recast.visit(ast, {
+        visitNode: function(path) {
+            this.traverse(path);
+            path.node.original = null;
+        }
+    });
+
+    callback(ast);
+});
diff --git a/node_modules/recast/example/identity b/node_modules/recast/example/identity
new file mode 100755
index 0000000..62981b8
--- /dev/null
+++ b/node_modules/recast/example/identity
@@ -0,0 +1,8 @@
+#!/usr/bin/env node
+
+// This script should echo the contents of the given file without
+// modification.
+
+require("recast").run(function(ast, callback) {
+    callback(ast);
+});
diff --git a/node_modules/recast/example/to-while b/node_modules/recast/example/to-while
new file mode 100755
index 0000000..9922222
--- /dev/null
+++ b/node_modules/recast/example/to-while
@@ -0,0 +1,84 @@
+#!/usr/bin/env node
+
+// This script converts for and do-while loops into equivalent while loops.
+// Note that for-in statements are left unmodified, as they do not have a
+// simple analogy to while loops. Also note that labeled continue statements
+// are not correctly handled at this point, and will trigger an assertion
+// failure if encountered.
+
+var assert = require("assert");
+var recast = require("recast");
+var types = recast.types;
+var n = types.namedTypes;
+var b = types.builders;
+
+recast.run(function(ast, callback) {
+    recast.visit(ast, {
+        visitForStatement: function(path) {
+            var fst = path.node;
+
+            path.replace(
+                fst.init,
+                b.whileStatement(
+                    fst.test,
+                    insertBeforeLoopback(fst, fst.update)
+                )
+            );
+
+            this.traverse(path);
+        },
+
+        visitDoWhileStatement: function(path) {
+            var dwst = path.node;
+            return b.whileStatement(
+                b.literal(true),
+                insertBeforeLoopback(
+                    dwst,
+                    b.ifStatement(
+                        dwst.test,
+                        b.breakStatement()
+                    )
+                )
+            );
+        }
+    });
+
+    callback(ast);
+});
+
+function insertBeforeLoopback(loop, toInsert) {
+    var body = loop.body;
+
+    if (!n.Statement.check(toInsert)) {
+        toInsert = b.expressionStatement(toInsert);
+    }
+
+    if (n.BlockStatement.check(body)) {
+        body.body.push(toInsert);
+    } else {
+        body = b.blockStatement([body, toInsert]);
+        loop.body = body;
+    }
+
+    recast.visit(body, {
+        visitContinueStatement: function(path) {
+            var cst = path.node;
+
+            assert.equal(
+                cst.label, null,
+                "Labeled continue statements are not yet supported."
+            );
+
+            path.replace(toInsert, path.node);
+            return false;
+        },
+
+        // Do not descend into nested loops.
+        visitWhileStatement: function() {},
+        visitForStatement: function() {},
+        visitForInStatement: function() {},
+        visitDoWhileStatement: function() {}
+    });
+
+    return body;
+}
diff --git a/node_modules/recast/lib/comments.d.ts b/node_modules/recast/lib/comments.d.ts
new file mode 100644
index 0000000..1c1df43
--- /dev/null
+++ b/node_modules/recast/lib/comments.d.ts
@@ -0,0 +1,2 @@
+export declare function attach(comments: any[], ast: any, lines: any): void;
+export declare function printComments(path: any, print: any): any;
diff --git a/node_modules/recast/lib/comments.js b/node_modules/recast/lib/comments.js
new file mode 100644
index 0000000..5bdf0e8
--- /dev/null
+++ b/node_modules/recast/lib/comments.js
@@ -0,0 +1,308 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var types = __importStar(require("ast-types"));
+var n = types.namedTypes;
+var isArray = types.builtInTypes.array;
+var isObject = types.builtInTypes.object;
+var lines_1 = require("./lines");
+var util_1 = require("./util");
+var private_1 = require("private");
+var childNodesCacheKey = private_1.makeUniqueKey();
+// TODO Move a non-caching implementation of this function into ast-types,
+// and implement a caching wrapper function here.
+function getSortedChildNodes(node, lines, resultArray) {
+    if (!node) {
+        return;
+    }
+    // The .loc checks below are sensitive to some of the problems that
+    // are fixed by this utility function. Specifically, if it decides to
+    // set node.loc to null, indicating that the node's .loc information
+    // is unreliable, then we don't want to add node to the resultArray.
+    util_1.fixFaultyLocations(node, lines);
+    if (resultArray) {
+        if (n.Node.check(node) &&
+            n.SourceLocation.check(node.loc)) {
+            // This reverse insertion sort almost always takes constant
+            // time because we almost always (maybe always?) append the
+            // nodes in order anyway.
+            for (var i = resultArray.length - 1; i >= 0; --i) {
+                if (util_1.comparePos(resultArray[i].loc.end, node.loc.start) <= 0) {
+                    break;
+                }
+            }
+            resultArray.splice(i + 1, 0, node);
+            return;
+        }
+    }
+    else if (node[childNodesCacheKey]) {
+        return node[childNodesCacheKey];
+    }
+    var names;
+    if (isArray.check(node)) {
+        names = Object.keys(node);
+    }
+    else if (isObject.check(node)) {
+        names = types.getFieldNames(node);
+    }
+    else {
+        return;
+    }
+    if (!resultArray) {
+        Object.defineProperty(node, childNodesCacheKey, {
+            value: resultArray = [],
+            enumerable: false
+        });
+    }
+    for (var i = 0, nameCount = names.length; i < nameCount; ++i) {
+        getSortedChildNodes(node[names[i]], lines, resultArray);
+    }
+    return resultArray;
+}
+// As efficiently as possible, decorate the comment object with
+// .precedingNode, .enclosingNode, and/or .followingNode properties, at
+// least one of which is guaranteed to be defined.
+function decorateComment(node, comment, lines) {
+    var childNodes = getSortedChildNodes(node, lines);
+    // Time to dust off the old binary search robes and wizard hat.
+    var left = 0, right = childNodes.length;
+    while (left < right) {
+        var middle = (left + right) >> 1;
+        var child = childNodes[middle];
+        if (util_1.comparePos(child.loc.start, comment.loc.start) <= 0 &&
+            util_1.comparePos(comment.loc.end, child.loc.end) <= 0) {
+            // The comment is completely contained by this child node.
+            decorateComment(comment.enclosingNode = child, comment, lines);
+            return; // Abandon the binary search at this level.
+        }
+        if (util_1.comparePos(child.loc.end, comment.loc.start) <= 0) {
+            // This child node falls completely before the comment.
+            // Because we will never consider this node or any nodes
+            // before it again, this node must be the closest preceding
+            // node we have encountered so far.
+            var precedingNode = child;
+            left = middle + 1;
+            continue;
+        }
+        if (util_1.comparePos(comment.loc.end, child.loc.start) <= 0) {
+            // This child node falls completely after the comment.
+            // Because we will never consider this node or any nodes after
+            // it again, this node must be the closest following node we
+            // have encountered so far.
+            var followingNode = child;
+            right = middle;
+            continue;
+        }
+        throw new Error("Comment location overlaps with node location");
+    }
+    if (precedingNode) {
+        comment.precedingNode = precedingNode;
+    }
+    if (followingNode) {
+        comment.followingNode = followingNode;
+    }
+}
+function attach(comments, ast, lines) {
+    if (!isArray.check(comments)) {
+        return;
+    }
+    var tiesToBreak = [];
+    comments.forEach(function (comment) {
+        comment.loc.lines = lines;
+        decorateComment(ast, comment, lines);
+        var pn = comment.precedingNode;
+        var en = comment.enclosingNode;
+        var fn = comment.followingNode;
+        if (pn && fn) {
+            var tieCount = tiesToBreak.length;
+            if (tieCount > 0) {
+                var lastTie = tiesToBreak[tieCount - 1];
+                assert_1.default.strictEqual(lastTie.precedingNode === comment.precedingNode, lastTie.followingNode === comment.followingNode);
+                if (lastTie.followingNode !== comment.followingNode) {
+                    breakTies(tiesToBreak, lines);
+                }
+            }
+            tiesToBreak.push(comment);
+        }
+        else if (pn) {
+            // No contest: we have a trailing comment.
+            breakTies(tiesToBreak, lines);
+            addTrailingComment(pn, comment);
+        }
+        else if (fn) {
+            // No contest: we have a leading comment.
+            breakTies(tiesToBreak, lines);
+            addLeadingComment(fn, comment);
+        }
+        else if (en) {
+            // The enclosing node has no child nodes at all, so what we
+            // have here is a dangling comment, e.g. [/* crickets */].
+            breakTies(tiesToBreak, lines);
+            addDanglingComment(en, comment);
+        }
+        else {
+            throw new Error("AST contains no nodes at all?");
+        }
+    });
+    breakTies(tiesToBreak, lines);
+    comments.forEach(function (comment) {
+        // These node references were useful for breaking ties, but we
+        // don't need them anymore, and they create cycles in the AST that
+        // may lead to infinite recursion if we don't delete them here.
+        delete comment.precedingNode;
+        delete comment.enclosingNode;
+        delete comment.followingNode;
+    });
+}
+exports.attach = attach;
+;
+function breakTies(tiesToBreak, lines) {
+    var tieCount = tiesToBreak.length;
+    if (tieCount === 0) {
+        return;
+    }
+    var pn = tiesToBreak[0].precedingNode;
+    var fn = tiesToBreak[0].followingNode;
+    var gapEndPos = fn.loc.start;
+    // Iterate backwards through tiesToBreak, examining the gaps
+    // between the tied comments. In order to qualify as leading, a
+    // comment must be separated from fn by an unbroken series of
+    // whitespace-only gaps (or other comments).
+    for (var indexOfFirstLeadingComment = tieCount; indexOfFirstLeadingComment > 0; --indexOfFirstLeadingComment) {
+        var comment = tiesToBreak[indexOfFirstLeadingComment - 1];
+        assert_1.default.strictEqual(comment.precedingNode, pn);
+        assert_1.default.strictEqual(comment.followingNode, fn);
+        var gap = lines.sliceString(comment.loc.end, gapEndPos);
+        if (/\S/.test(gap)) {
+            // The gap string contained something other than whitespace.
+            break;
+        }
+        gapEndPos = comment.loc.start;
+    }
+    while (indexOfFirstLeadingComment <= tieCount &&
+        (comment = tiesToBreak[indexOfFirstLeadingComment]) &&
+        // If the comment is a //-style comment and indented more
+        // deeply than the node itself, reconsider it as trailing.
+        (comment.type === "Line" || comment.type === "CommentLine") &&
+        comment.loc.start.column > fn.loc.start.column) {
+        ++indexOfFirstLeadingComment;
+    }
+    tiesToBreak.forEach(function (comment, i) {
+        if (i < indexOfFirstLeadingComment) {
+            addTrailingComment(pn, comment);
+        }
+        else {
+            addLeadingComment(fn, comment);
+        }
+    });
+    tiesToBreak.length = 0;
+}
+function addCommentHelper(node, comment) {
+    var comments = node.comments || (node.comments = []);
+    comments.push(comment);
+}
+function addLeadingComment(node, comment) {
+    comment.leading = true;
+    comment.trailing = false;
+    addCommentHelper(node, comment);
+}
+function addDanglingComment(node, comment) {
+    comment.leading = false;
+    comment.trailing = false;
+    addCommentHelper(node, comment);
+}
+function addTrailingComment(node, comment) {
+    comment.leading = false;
+    comment.trailing = true;
+    addCommentHelper(node, comment);
+}
+function printLeadingComment(commentPath, print) {
+    var comment = commentPath.getValue();
+    n.Comment.assert(comment);
+    var loc = comment.loc;
+    var lines = loc && loc.lines;
+    var parts = [print(commentPath)];
+    if (comment.trailing) {
+        // When we print trailing comments as leading comments, we don't
+        // want to bring any trailing spaces along.
+        parts.push("\n");
+    }
+    else if (lines instanceof lines_1.Lines) {
+        var trailingSpace = lines.slice(loc.end, lines.skipSpaces(loc.end) || lines.lastPos());
+        if (trailingSpace.length === 1) {
+            // If the trailing space contains no newlines, then we want to
+            // preserve it exactly as we found it.
+            parts.push(trailingSpace);
+        }
+        else {
+            // If the trailing space contains newlines, then replace it
+            // with just that many newlines, with all other spaces removed.
+            parts.push(new Array(trailingSpace.length).join("\n"));
+        }
+    }
+    else {
+        parts.push("\n");
+    }
+    return lines_1.concat(parts);
+}
+function printTrailingComment(commentPath, print) {
+    var comment = commentPath.getValue(commentPath);
+    n.Comment.assert(comment);
+    var loc = comment.loc;
+    var lines = loc && loc.lines;
+    var parts = [];
+    if (lines instanceof lines_1.Lines) {
+        var fromPos = lines.skipSpaces(loc.start, true) || lines.firstPos();
+        var leadingSpace = lines.slice(fromPos, loc.start);
+        if (leadingSpace.length === 1) {
+            // If the leading space contains no newlines, then we want to
+            // preserve it exactly as we found it.
+            parts.push(leadingSpace);
+        }
+        else {
+            // If the leading space contains newlines, then replace it
+            // with just that many newlines, sans all other spaces.
+            parts.push(new Array(leadingSpace.length).join("\n"));
+        }
+    }
+    parts.push(print(commentPath));
+    return lines_1.concat(parts);
+}
+function printComments(path, print) {
+    var value = path.getValue();
+    var innerLines = print(path);
+    var comments = n.Node.check(value) &&
+        types.getFieldValue(value, "comments");
+    if (!comments || comments.length === 0) {
+        return innerLines;
+    }
+    var leadingParts = [];
+    var trailingParts = [innerLines];
+    path.each(function (commentPath) {
+        var comment = commentPath.getValue();
+        var leading = types.getFieldValue(comment, "leading");
+        var trailing = types.getFieldValue(comment, "trailing");
+        if (leading || (trailing && !(n.Statement.check(value) ||
+            comment.type === "Block" ||
+            comment.type === "CommentBlock"))) {
+            leadingParts.push(printLeadingComment(commentPath, print));
+        }
+        else if (trailing) {
+            trailingParts.push(printTrailingComment(commentPath, print));
+        }
+    }, "comments");
+    leadingParts.push.apply(leadingParts, trailingParts);
+    return lines_1.concat(leadingParts);
+}
+exports.printComments = printComments;
+;
diff --git a/node_modules/recast/lib/fast-path.d.ts b/node_modules/recast/lib/fast-path.d.ts
new file mode 100644
index 0000000..8a89403
--- /dev/null
+++ b/node_modules/recast/lib/fast-path.d.ts
@@ -0,0 +1,25 @@
+interface FastPathType {
+    stack: any[];
+    copy(): any;
+    getName(): any;
+    getValue(): any;
+    valueIsDuplicate(): any;
+    getNode(count?: number): any;
+    getParentNode(count?: number): any;
+    getRootValue(): any;
+    call(callback: any, ...names: any[]): any;
+    each(callback: any, ...names: any[]): any;
+    map(callback: any, ...names: any[]): any;
+    hasParens(): any;
+    getPrevToken(node: any): any;
+    getNextToken(node: any): any;
+    needsParens(assumeExpressionContext: any): any;
+    canBeFirstInStatement(): any;
+    firstInStatement(): any;
+}
+interface FastPathConstructor {
+    new (value: any): FastPathType;
+    from(obj: any): any;
+}
+declare const FastPath: FastPathConstructor;
+export default FastPath;
diff --git a/node_modules/recast/lib/fast-path.js b/node_modules/recast/lib/fast-path.js
new file mode 100644
index 0000000..148b0e3
--- /dev/null
+++ b/node_modules/recast/lib/fast-path.js
@@ -0,0 +1,539 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var types = __importStar(require("ast-types"));
+var n = types.namedTypes;
+var isArray = types.builtInTypes.array;
+var isNumber = types.builtInTypes.number;
+var util = __importStar(require("./util"));
+var FastPath = function FastPath(value) {
+    assert_1.default.ok(this instanceof FastPath);
+    this.stack = [value];
+};
+var FPp = FastPath.prototype;
+// Static convenience function for coercing a value to a FastPath.
+FastPath.from = function (obj) {
+    if (obj instanceof FastPath) {
+        // Return a defensive copy of any existing FastPath instances.
+        return obj.copy();
+    }
+    if (obj instanceof types.NodePath) {
+        // For backwards compatibility, unroll NodePath instances into
+        // lightweight FastPath [..., name, value] stacks.
+        var copy = Object.create(FastPath.prototype);
+        var stack = [obj.value];
+        for (var pp; (pp = obj.parentPath); obj = pp)
+            stack.push(obj.name, pp.value);
+        copy.stack = stack.reverse();
+        return copy;
+    }
+    // Otherwise use obj as the value of the new FastPath instance.
+    return new FastPath(obj);
+};
+FPp.copy = function copy() {
+    var copy = Object.create(FastPath.prototype);
+    copy.stack = this.stack.slice(0);
+    return copy;
+};
+// The name of the current property is always the penultimate element of
+// this.stack, and always a String.
+FPp.getName = function getName() {
+    var s = this.stack;
+    var len = s.length;
+    if (len > 1) {
+        return s[len - 2];
+    }
+    // Since the name is always a string, null is a safe sentinel value to
+    // return if we do not know the name of the (root) value.
+    return null;
+};
+// The value of the current property is always the final element of
+// this.stack.
+FPp.getValue = function getValue() {
+    var s = this.stack;
+    return s[s.length - 1];
+};
+FPp.valueIsDuplicate = function () {
+    var s = this.stack;
+    var valueIndex = s.length - 1;
+    return s.lastIndexOf(s[valueIndex], valueIndex - 1) >= 0;
+};
+function getNodeHelper(path, count) {
+    var s = path.stack;
+    for (var i = s.length - 1; i >= 0; i -= 2) {
+        var value = s[i];
+        if (n.Node.check(value) && --count < 0) {
+            return value;
+        }
+    }
+    return null;
+}
+FPp.getNode = function getNode(count) {
+    if (count === void 0) { count = 0; }
+    return getNodeHelper(this, ~~count);
+};
+FPp.getParentNode = function getParentNode(count) {
+    if (count === void 0) { count = 0; }
+    return getNodeHelper(this, ~~count + 1);
+};
+// The length of the stack can be either even or odd, depending on whether
+// or not we have a name for the root value. The difference between the
+// index of the root value and the index of the final value is always
+// even, though, which allows us to return the root value in constant time
+// (i.e. without iterating backwards through the stack).
+FPp.getRootValue = function getRootValue() {
+    var s = this.stack;
+    if (s.length % 2 === 0) {
+        return s[1];
+    }
+    return s[0];
+};
+// Temporarily push properties named by string arguments given after the
+// callback function onto this.stack, then call the callback with a
+// reference to this (modified) FastPath object. Note that the stack will
+// be restored to its original state after the callback is finished, so it
+// is probably a mistake to retain a reference to the path.
+FPp.call = function call(callback /*, name1, name2, ... */) {
+    var s = this.stack;
+    var origLen = s.length;
+    var value = s[origLen - 1];
+    var argc = arguments.length;
+    for (var i = 1; i < argc; ++i) {
+        var name = arguments[i];
+        value = value[name];
+        s.push(name, value);
+    }
+    var result = callback(this);
+    s.length = origLen;
+    return result;
+};
+// Similar to FastPath.prototype.call, except that the value obtained by
+// accessing this.getValue()[name1][name2]... should be array-like. The
+// callback will be called with a reference to this path object for each
+// element of the array.
+FPp.each = function each(callback /*, name1, name2, ... */) {
+    var s = this.stack;
+    var origLen = s.length;
+    var value = s[origLen - 1];
+    var argc = arguments.length;
+    for (var i = 1; i < argc; ++i) {
+        var name = arguments[i];
+        value = value[name];
+        s.push(name, value);
+    }
+    for (var i = 0; i < value.length; ++i) {
+        if (i in value) {
+            s.push(i, value[i]);
+            // If the callback needs to know the value of i, call
+            // path.getName(), assuming path is the parameter name.
+            callback(this);
+            s.length -= 2;
+        }
+    }
+    s.length = origLen;
+};
+// Similar to FastPath.prototype.each, except that the results of the
+// callback function invocations are stored in an array and returned at
+// the end of the iteration.
+FPp.map = function map(callback /*, name1, name2, ... */) {
+    var s = this.stack;
+    var origLen = s.length;
+    var value = s[origLen - 1];
+    var argc = arguments.length;
+    for (var i = 1; i < argc; ++i) {
+        var name = arguments[i];
+        value = value[name];
+        s.push(name, value);
+    }
+    var result = new Array(value.length);
+    for (var i = 0; i < value.length; ++i) {
+        if (i in value) {
+            s.push(i, value[i]);
+            result[i] = callback(this, i);
+            s.length -= 2;
+        }
+    }
+    s.length = origLen;
+    return result;
+};
+// Returns true if the node at the tip of the path is wrapped with
+// parentheses, OR if the only reason the node needed parentheses was that
+// it couldn't be the first expression in the enclosing statement (see
+// FastPath#canBeFirstInStatement), and it has an opening `(` character.
+// For example, the FunctionExpression in `(function(){}())` appears to
+// need parentheses only because it's the first expression in the AST, but
+// since it happens to be preceded by a `(` (which is not apparent from
+// the AST but can be determined using FastPath#getPrevToken), there is no
+// ambiguity about how to parse it, so it counts as having parentheses,
+// even though it is not immediately followed by a `)`.
+FPp.hasParens = function () {
+    var node = this.getNode();
+    var prevToken = this.getPrevToken(node);
+    if (!prevToken) {
+        return false;
+    }
+    var nextToken = this.getNextToken(node);
+    if (!nextToken) {
+        return false;
+    }
+    if (prevToken.value === "(") {
+        if (nextToken.value === ")") {
+            // If the node preceded by a `(` token and followed by a `)` token,
+            // then of course it has parentheses.
+            return true;
+        }
+        // If this is one of the few Expression types that can't come first in
+        // the enclosing statement because of parsing ambiguities (namely,
+        // FunctionExpression, ObjectExpression, and ClassExpression) and
+        // this.firstInStatement() returns true, and the node would not need
+        // parentheses in an expression context because this.needsParens(true)
+        // returns false, then it just needs an opening parenthesis to resolve
+        // the parsing ambiguity that made it appear to need parentheses.
+        var justNeedsOpeningParen = !this.canBeFirstInStatement() &&
+            this.firstInStatement() &&
+            !this.needsParens(true);
+        if (justNeedsOpeningParen) {
+            return true;
+        }
+    }
+    return false;
+};
+FPp.getPrevToken = function (node) {
+    node = node || this.getNode();
+    var loc = node && node.loc;
+    var tokens = loc && loc.tokens;
+    if (tokens && loc.start.token > 0) {
+        var token = tokens[loc.start.token - 1];
+        if (token) {
+            // Do not return tokens that fall outside the root subtree.
+            var rootLoc = this.getRootValue().loc;
+            if (util.comparePos(rootLoc.start, token.loc.start) <= 0) {
+                return token;
+            }
+        }
+    }
+    return null;
+};
+FPp.getNextToken = function (node) {
+    node = node || this.getNode();
+    var loc = node && node.loc;
+    var tokens = loc && loc.tokens;
+    if (tokens && loc.end.token < tokens.length) {
+        var token = tokens[loc.end.token];
+        if (token) {
+            // Do not return tokens that fall outside the root subtree.
+            var rootLoc = this.getRootValue().loc;
+            if (util.comparePos(token.loc.end, rootLoc.end) <= 0) {
+                return token;
+            }
+        }
+    }
+    return null;
+};
+// Inspired by require("ast-types").NodePath.prototype.needsParens, but
+// more efficient because we're iterating backwards through a stack.
+FPp.needsParens = function (assumeExpressionContext) {
+    var node = this.getNode();
+    // This needs to come before `if (!parent) { return false }` because
+    // an object destructuring assignment requires parens for
+    // correctness even when it's the topmost expression.
+    if (node.type === "AssignmentExpression" && node.left.type === 'ObjectPattern') {
+        return true;
+    }
+    var parent = this.getParentNode();
+    if (!parent) {
+        return false;
+    }
+    var name = this.getName();
+    // If the value of this path is some child of a Node and not a Node
+    // itself, then it doesn't need parentheses. Only Node objects (in fact,
+    // only Expression nodes) need parentheses.
+    if (this.getValue() !== node) {
+        return false;
+    }
+    // Only statements don't need parentheses.
+    if (n.Statement.check(node)) {
+        return false;
+    }
+    // Identifiers never need parentheses.
+    if (node.type === "Identifier") {
+        return false;
+    }
+    if (parent.type === "ParenthesizedExpression") {
+        return false;
+    }
+    switch (node.type) {
+        case "UnaryExpression":
+        case "SpreadElement":
+        case "SpreadProperty":
+            return parent.type === "MemberExpression"
+                && name === "object"
+                && parent.object === node;
+        case "BinaryExpression":
+        case "LogicalExpression":
+            switch (parent.type) {
+                case "CallExpression":
+                    return name === "callee"
+                        && parent.callee === node;
+                case "UnaryExpression":
+                case "SpreadElement":
+                case "SpreadProperty":
+                    return true;
+                case "MemberExpression":
+                    return name === "object"
+                        && parent.object === node;
+                case "BinaryExpression":
+                case "LogicalExpression":
+                    var po = parent.operator;
+                    var pp = PRECEDENCE[po];
+                    var no = node.operator;
+                    var np = PRECEDENCE[no];
+                    if (pp > np) {
+                        return true;
+                    }
+                    if (pp === np && name === "right") {
+                        assert_1.default.strictEqual(parent.right, node);
+                        return true;
+                    }
+                default:
+                    return false;
+            }
+        case "SequenceExpression":
+            switch (parent.type) {
+                case "ReturnStatement":
+                    return false;
+                case "ForStatement":
+                    // Although parentheses wouldn't hurt around sequence expressions in
+                    // the head of for loops, traditional style dictates that e.g. i++,
+                    // j++ should not be wrapped with parentheses.
+                    return false;
+                case "ExpressionStatement":
+                    return name !== "expression";
+                default:
+                    // Otherwise err on the side of overparenthesization, adding
+                    // explicit exceptions above if this proves overzealous.
+                    return true;
+            }
+        case "YieldExpression":
+            switch (parent.type) {
+                case "BinaryExpression":
+                case "LogicalExpression":
+                case "UnaryExpression":
+                case "SpreadElement":
+                case "SpreadProperty":
+                case "CallExpression":
+                case "MemberExpression":
+                case "NewExpression":
+                case "ConditionalExpression":
+                case "YieldExpression":
+                    return true;
+                default:
+                    return false;
+            }
+        case "IntersectionTypeAnnotation":
+        case "UnionTypeAnnotation":
+            return parent.type === "NullableTypeAnnotation";
+        case "Literal":
+            return parent.type === "MemberExpression"
+                && isNumber.check(node.value)
+                && name === "object"
+                && parent.object === node;
+        // Babel 6 Literal split
+        case "NumericLiteral":
+            return parent.type === "MemberExpression"
+                && name === "object"
+                && parent.object === node;
+        case "AssignmentExpression":
+        case "ConditionalExpression":
+            switch (parent.type) {
+                case "UnaryExpression":
+                case "SpreadElement":
+                case "SpreadProperty":
+                case "BinaryExpression":
+                case "LogicalExpression":
+                    return true;
+                case "CallExpression":
+                case "NewExpression":
+                    return name === "callee"
+                        && parent.callee === node;
+                case "ConditionalExpression":
+                    return name === "test"
+                        && parent.test === node;
+                case "MemberExpression":
+                    return name === "object"
+                        && parent.object === node;
+                default:
+                    return false;
+            }
+        case "ArrowFunctionExpression":
+            if (n.CallExpression.check(parent) &&
+                name === 'callee') {
+                return true;
+            }
+            if (n.MemberExpression.check(parent) &&
+                name === 'object') {
+                return true;
+            }
+            return isBinary(parent);
+        case "ObjectExpression":
+            if (parent.type === "ArrowFunctionExpression" &&
+                name === "body") {
+                return true;
+            }
+            break;
+        case "CallExpression":
+            if (name === "declaration" &&
+                n.ExportDefaultDeclaration.check(parent) &&
+                n.FunctionExpression.check(node.callee)) {
+                return true;
+            }
+    }
+    if (parent.type === "NewExpression" &&
+        name === "callee" &&
+        parent.callee === node) {
+        return containsCallExpression(node);
+    }
+    if (assumeExpressionContext !== true &&
+        !this.canBeFirstInStatement() &&
+        this.firstInStatement()) {
+        return true;
+    }
+    return false;
+};
+function isBinary(node) {
+    return n.BinaryExpression.check(node)
+        || n.LogicalExpression.check(node);
+}
+// @ts-ignore 'isUnaryLike' is declared but its value is never read. [6133]
+function isUnaryLike(node) {
+    return n.UnaryExpression.check(node)
+        // I considered making SpreadElement and SpreadProperty subtypes of
+        // UnaryExpression, but they're not really Expression nodes.
+        || (n.SpreadElement && n.SpreadElement.check(node))
+        || (n.SpreadProperty && n.SpreadProperty.check(node));
+}
+var PRECEDENCE = {};
+[["||"],
+    ["&&"],
+    ["|"],
+    ["^"],
+    ["&"],
+    ["==", "===", "!=", "!=="],
+    ["<", ">", "<=", ">=", "in", "instanceof"],
+    [">>", "<<", ">>>"],
+    ["+", "-"],
+    ["*", "/", "%", "**"]
+].forEach(function (tier, i) {
+    tier.forEach(function (op) {
+        PRECEDENCE[op] = i;
+    });
+});
+function containsCallExpression(node) {
+    if (n.CallExpression.check(node)) {
+        return true;
+    }
+    if (isArray.check(node)) {
+        return node.some(containsCallExpression);
+    }
+    if (n.Node.check(node)) {
+        return types.someField(node, function (_name, child) {
+            return containsCallExpression(child);
+        });
+    }
+    return false;
+}
+FPp.canBeFirstInStatement = function () {
+    var node = this.getNode();
+    if (n.FunctionExpression.check(node)) {
+        return false;
+    }
+    if (n.ObjectExpression.check(node)) {
+        return false;
+    }
+    if (n.ClassExpression.check(node)) {
+        return false;
+    }
+    return true;
+};
+FPp.firstInStatement = function () {
+    var s = this.stack;
+    var parentName, parent;
+    var childName, child;
+    for (var i = s.length - 1; i >= 0; i -= 2) {
+        if (n.Node.check(s[i])) {
+            childName = parentName;
+            child = parent;
+            parentName = s[i - 1];
+            parent = s[i];
+        }
+        if (!parent || !child) {
+            continue;
+        }
+        if (n.BlockStatement.check(parent) &&
+            parentName === "body" &&
+            childName === 0) {
+            assert_1.default.strictEqual(parent.body[0], child);
+            return true;
+        }
+        if (n.ExpressionStatement.check(parent) &&
+            childName === "expression") {
+            assert_1.default.strictEqual(parent.expression, child);
+            return true;
+        }
+        if (n.AssignmentExpression.check(parent) &&
+            childName === "left") {
+            assert_1.default.strictEqual(parent.left, child);
+            return true;
+        }
+        if (n.ArrowFunctionExpression.check(parent) &&
+            childName === "body") {
+            assert_1.default.strictEqual(parent.body, child);
+            return true;
+        }
+        if (n.SequenceExpression.check(parent) &&
+            parentName === "expressions" &&
+            childName === 0) {
+            assert_1.default.strictEqual(parent.expressions[0], child);
+            continue;
+        }
+        if (n.CallExpression.check(parent) &&
+            childName === "callee") {
+            assert_1.default.strictEqual(parent.callee, child);
+            continue;
+        }
+        if (n.MemberExpression.check(parent) &&
+            childName === "object") {
+            assert_1.default.strictEqual(parent.object, child);
+            continue;
+        }
+        if (n.ConditionalExpression.check(parent) &&
+            childName === "test") {
+            assert_1.default.strictEqual(parent.test, child);
+            continue;
+        }
+        if (isBinary(parent) &&
+            childName === "left") {
+            assert_1.default.strictEqual(parent.left, child);
+            continue;
+        }
+        if (n.UnaryExpression.check(parent) &&
+            !parent.prefix &&
+            childName === "argument") {
+            assert_1.default.strictEqual(parent.argument, child);
+            continue;
+        }
+        return false;
+    }
+    return true;
+};
+exports.default = FastPath;
diff --git a/node_modules/recast/lib/lines.d.ts b/node_modules/recast/lib/lines.d.ts
new file mode 100644
index 0000000..6d705fd
--- /dev/null
+++ b/node_modules/recast/lib/lines.d.ts
@@ -0,0 +1,62 @@
+import { Options } from "./options";
+import { namedTypes } from "ast-types";
+declare type Pos = namedTypes.Position;
+declare type LineInfo = {
+    readonly line: string;
+    readonly indent: number;
+    readonly locked: boolean;
+    readonly sliceStart: number;
+    readonly sliceEnd: number;
+};
+export declare class Lines {
+    private infos;
+    readonly length: number;
+    readonly name: string | null;
+    private mappings;
+    private cachedSourceMap;
+    private cachedTabWidth;
+    constructor(infos: LineInfo[], sourceFileName?: string | null);
+    toString(options?: Options): string;
+    getSourceMap(sourceMapName: string, sourceRoot?: string): any;
+    bootstrapCharAt(pos: Pos): string;
+    charAt(pos: Pos): string;
+    stripMargin(width: number, skipFirstLine: boolean): Lines;
+    indent(by: number): Lines;
+    indentTail(by: number): Lines;
+    lockIndentTail(): Lines;
+    getIndentAt(line: number): number;
+    guessTabWidth(): number;
+    startsWithComment(): boolean;
+    isOnlyWhitespace(): boolean;
+    isPrecededOnlyByWhitespace(pos: Pos): boolean;
+    getLineLength(line: number): number;
+    nextPos(pos: Pos, skipSpaces?: boolean): boolean;
+    prevPos(pos: Pos, skipSpaces?: boolean): boolean;
+    firstPos(): {
+        line: number;
+        column: number;
+    };
+    lastPos(): {
+        line: number;
+        column: number;
+    };
+    skipSpaces(pos: Pos, backward?: boolean, modifyInPlace?: boolean): namedTypes.Position | null;
+    trimLeft(): Lines;
+    trimRight(): Lines;
+    trim(): Lines;
+    eachPos(callback: (pos: Pos) => any, startPos?: Pos, skipSpaces?: boolean): void;
+    bootstrapSlice(start: Pos, end: Pos): Lines;
+    slice(start?: Pos, end?: Pos): Lines;
+    bootstrapSliceString(start: Pos, end: Pos, options?: Options): string;
+    sliceString(start?: Pos, end?: Pos, options?: Options): string;
+    isEmpty(): boolean;
+    join(elements: (string | Lines)[]): Lines;
+    concat(...args: (string | Lines)[]): Lines;
+}
+export declare function countSpaces(spaces: any, tabWidth?: number): number;
+/**
+ * @param {Object} options - Options object that configures printing.
+ */
+export declare function fromString(string: string | Lines, options?: Options): Lines;
+export declare function concat(elements: any): Lines;
+export {};
diff --git a/node_modules/recast/lib/lines.js b/node_modules/recast/lib/lines.js
new file mode 100644
index 0000000..fd0eb69
--- /dev/null
+++ b/node_modules/recast/lib/lines.js
@@ -0,0 +1,668 @@
+"use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var source_map_1 = __importDefault(require("source-map"));
+var options_1 = require("./options");
+var util_1 = require("./util");
+var mapping_1 = __importDefault(require("./mapping"));
+var Lines = /** @class */ (function () {
+    function Lines(infos, sourceFileName) {
+        if (sourceFileName === void 0) { sourceFileName = null; }
+        this.infos = infos;
+        this.mappings = [];
+        this.cachedSourceMap = null;
+        this.cachedTabWidth = void 0;
+        assert_1.default.ok(infos.length > 0);
+        this.length = infos.length;
+        this.name = sourceFileName || null;
+        if (this.name) {
+            this.mappings.push(new mapping_1.default(this, {
+                start: this.firstPos(),
+                end: this.lastPos(),
+            }));
+        }
+    }
+    Lines.prototype.toString = function (options) {
+        return this.sliceString(this.firstPos(), this.lastPos(), options);
+    };
+    Lines.prototype.getSourceMap = function (sourceMapName, sourceRoot) {
+        if (!sourceMapName) {
+            // Although we could make up a name or generate an anonymous
+            // source map, instead we assume that any consumer who does not
+            // provide a name does not actually want a source map.
+            return null;
+        }
+        var targetLines = this;
+        function updateJSON(json) {
+            json = json || {};
+            json.file = sourceMapName;
+            if (sourceRoot) {
+                json.sourceRoot = sourceRoot;
+            }
+            return json;
+        }
+        if (targetLines.cachedSourceMap) {
+            // Since Lines objects are immutable, we can reuse any source map
+            // that was previously generated. Nevertheless, we return a new
+            // JSON object here to protect the cached source map from outside
+            // modification.
+            return updateJSON(targetLines.cachedSourceMap.toJSON());
+        }
+        var smg = new source_map_1.default.SourceMapGenerator(updateJSON());
+        var sourcesToContents = {};
+        targetLines.mappings.forEach(function (mapping) {
+            var sourceCursor = mapping.sourceLines.skipSpaces(mapping.sourceLoc.start) || mapping.sourceLines.lastPos();
+            var targetCursor = targetLines.skipSpaces(mapping.targetLoc.start) || targetLines.lastPos();
+            while (util_1.comparePos(sourceCursor, mapping.sourceLoc.end) < 0 &&
+                util_1.comparePos(targetCursor, mapping.targetLoc.end) < 0) {
+                var sourceChar = mapping.sourceLines.charAt(sourceCursor);
+                var targetChar = targetLines.charAt(targetCursor);
+                assert_1.default.strictEqual(sourceChar, targetChar);
+                var sourceName = mapping.sourceLines.name;
+                // Add mappings one character at a time for maximum resolution.
+                smg.addMapping({
+                    source: sourceName,
+                    original: { line: sourceCursor.line,
+                        column: sourceCursor.column },
+                    generated: { line: targetCursor.line,
+                        column: targetCursor.column }
+                });
+                if (!hasOwn.call(sourcesToContents, sourceName)) {
+                    var sourceContent = mapping.sourceLines.toString();
+                    smg.setSourceContent(sourceName, sourceContent);
+                    sourcesToContents[sourceName] = sourceContent;
+                }
+                targetLines.nextPos(targetCursor, true);
+                mapping.sourceLines.nextPos(sourceCursor, true);
+            }
+        });
+        targetLines.cachedSourceMap = smg;
+        return smg.toJSON();
+    };
+    Lines.prototype.bootstrapCharAt = function (pos) {
+        assert_1.default.strictEqual(typeof pos, "object");
+        assert_1.default.strictEqual(typeof pos.line, "number");
+        assert_1.default.strictEqual(typeof pos.column, "number");
+        var line = pos.line, column = pos.column, strings = this.toString().split(lineTerminatorSeqExp), string = strings[line - 1];
+        if (typeof string === "undefined")
+            return "";
+        if (column === string.length &&
+            line < strings.length)
+            return "\n";
+        if (column >= string.length)
+            return "";
+        return string.charAt(column);
+    };
+    Lines.prototype.charAt = function (pos) {
+        assert_1.default.strictEqual(typeof pos, "object");
+        assert_1.default.strictEqual(typeof pos.line, "number");
+        assert_1.default.strictEqual(typeof pos.column, "number");
+        var line = pos.line, column = pos.column, secret = this, infos = secret.infos, info = infos[line - 1], c = column;
+        if (typeof info === "undefined" || c < 0)
+            return "";
+        var indent = this.getIndentAt(line);
+        if (c < indent)
+            return " ";
+        c += info.sliceStart - indent;
+        if (c === info.sliceEnd &&
+            line < this.length)
+            return "\n";
+        if (c >= info.sliceEnd)
+            return "";
+        return info.line.charAt(c);
+    };
+    Lines.prototype.stripMargin = function (width, skipFirstLine) {
+        if (width === 0)
+            return this;
+        assert_1.default.ok(width > 0, "negative margin: " + width);
+        if (skipFirstLine && this.length === 1)
+            return this;
+        var lines = new Lines(this.infos.map(function (info, i) {
+            if (info.line && (i > 0 || !skipFirstLine)) {
+                info = __assign({}, info, { indent: Math.max(0, info.indent - width) });
+            }
+            return info;
+        }));
+        if (this.mappings.length > 0) {
+            var newMappings = lines.mappings;
+            assert_1.default.strictEqual(newMappings.length, 0);
+            this.mappings.forEach(function (mapping) {
+                newMappings.push(mapping.indent(width, skipFirstLine, true));
+            });
+        }
+        return lines;
+    };
+    Lines.prototype.indent = function (by) {
+        if (by === 0) {
+            return this;
+        }
+        var lines = new Lines(this.infos.map(function (info) {
+            if (info.line && !info.locked) {
+                info = __assign({}, info, { indent: info.indent + by });
+            }
+            return info;
+        }));
+        if (this.mappings.length > 0) {
+            var newMappings = lines.mappings;
+            assert_1.default.strictEqual(newMappings.length, 0);
+            this.mappings.forEach(function (mapping) {
+                newMappings.push(mapping.indent(by));
+            });
+        }
+        return lines;
+    };
+    Lines.prototype.indentTail = function (by) {
+        if (by === 0) {
+            return this;
+        }
+        if (this.length < 2) {
+            return this;
+        }
+        var lines = new Lines(this.infos.map(function (info, i) {
+            if (i > 0 && info.line && !info.locked) {
+                info = __assign({}, info, { indent: info.indent + by });
+            }
+            return info;
+        }));
+        if (this.mappings.length > 0) {
+            var newMappings = lines.mappings;
+            assert_1.default.strictEqual(newMappings.length, 0);
+            this.mappings.forEach(function (mapping) {
+                newMappings.push(mapping.indent(by, true));
+            });
+        }
+        return lines;
+    };
+    Lines.prototype.lockIndentTail = function () {
+        if (this.length < 2) {
+            return this;
+        }
+        return new Lines(this.infos.map(function (info, i) {
+            return __assign({}, info, { locked: i > 0 });
+        }));
+    };
+    Lines.prototype.getIndentAt = function (line) {
+        assert_1.default.ok(line >= 1, "no line " + line + " (line numbers start from 1)");
+        return Math.max(this.infos[line - 1].indent, 0);
+    };
+    Lines.prototype.guessTabWidth = function () {
+        if (typeof this.cachedTabWidth === "number") {
+            return this.cachedTabWidth;
+        }
+        var counts = []; // Sparse array.
+        var lastIndent = 0;
+        for (var line = 1, last = this.length; line <= last; ++line) {
+            var info = this.infos[line - 1];
+            var sliced = info.line.slice(info.sliceStart, info.sliceEnd);
+            // Whitespace-only lines don't tell us much about the likely tab
+            // width of this code.
+            if (isOnlyWhitespace(sliced)) {
+                continue;
+            }
+            var diff = Math.abs(info.indent - lastIndent);
+            counts[diff] = ~~counts[diff] + 1;
+            lastIndent = info.indent;
+        }
+        var maxCount = -1;
+        var result = 2;
+        for (var tabWidth = 1; tabWidth < counts.length; tabWidth += 1) {
+            if (hasOwn.call(counts, tabWidth) &&
+                counts[tabWidth] > maxCount) {
+                maxCount = counts[tabWidth];
+                result = tabWidth;
+            }
+        }
+        return this.cachedTabWidth = result;
+    };
+    // Determine if the list of lines has a first line that starts with a //
+    // or /* comment. If this is the case, the code may need to be wrapped in
+    // parens to avoid ASI issues.
+    Lines.prototype.startsWithComment = function () {
+        if (this.infos.length === 0) {
+            return false;
+        }
+        var firstLineInfo = this.infos[0], sliceStart = firstLineInfo.sliceStart, sliceEnd = firstLineInfo.sliceEnd, firstLine = firstLineInfo.line.slice(sliceStart, sliceEnd).trim();
+        return firstLine.length === 0 ||
+            firstLine.slice(0, 2) === "//" ||
+            firstLine.slice(0, 2) === "/*";
+    };
+    Lines.prototype.isOnlyWhitespace = function () {
+        return isOnlyWhitespace(this.toString());
+    };
+    Lines.prototype.isPrecededOnlyByWhitespace = function (pos) {
+        var info = this.infos[pos.line - 1];
+        var indent = Math.max(info.indent, 0);
+        var diff = pos.column - indent;
+        if (diff <= 0) {
+            // If pos.column does not exceed the indentation amount, then
+            // there must be only whitespace before it.
+            return true;
+        }
+        var start = info.sliceStart;
+        var end = Math.min(start + diff, info.sliceEnd);
+        var prefix = info.line.slice(start, end);
+        return isOnlyWhitespace(prefix);
+    };
+    Lines.prototype.getLineLength = function (line) {
+        var info = this.infos[line - 1];
+        return this.getIndentAt(line) + info.sliceEnd - info.sliceStart;
+    };
+    Lines.prototype.nextPos = function (pos, skipSpaces) {
+        if (skipSpaces === void 0) { skipSpaces = false; }
+        var l = Math.max(pos.line, 0), c = Math.max(pos.column, 0);
+        if (c < this.getLineLength(l)) {
+            pos.column += 1;
+            return skipSpaces
+                ? !!this.skipSpaces(pos, false, true)
+                : true;
+        }
+        if (l < this.length) {
+            pos.line += 1;
+            pos.column = 0;
+            return skipSpaces
+                ? !!this.skipSpaces(pos, false, true)
+                : true;
+        }
+        return false;
+    };
+    Lines.prototype.prevPos = function (pos, skipSpaces) {
+        if (skipSpaces === void 0) { skipSpaces = false; }
+        var l = pos.line, c = pos.column;
+        if (c < 1) {
+            l -= 1;
+            if (l < 1)
+                return false;
+            c = this.getLineLength(l);
+        }
+        else {
+            c = Math.min(c - 1, this.getLineLength(l));
+        }
+        pos.line = l;
+        pos.column = c;
+        return skipSpaces
+            ? !!this.skipSpaces(pos, true, true)
+            : true;
+    };
+    Lines.prototype.firstPos = function () {
+        // Trivial, but provided for completeness.
+        return { line: 1, column: 0 };
+    };
+    Lines.prototype.lastPos = function () {
+        return {
+            line: this.length,
+            column: this.getLineLength(this.length)
+        };
+    };
+    Lines.prototype.skipSpaces = function (pos, backward, modifyInPlace) {
+        if (backward === void 0) { backward = false; }
+        if (modifyInPlace === void 0) { modifyInPlace = false; }
+        if (pos) {
+            pos = modifyInPlace ? pos : {
+                line: pos.line,
+                column: pos.column
+            };
+        }
+        else if (backward) {
+            pos = this.lastPos();
+        }
+        else {
+            pos = this.firstPos();
+        }
+        if (backward) {
+            while (this.prevPos(pos)) {
+                if (!isOnlyWhitespace(this.charAt(pos)) &&
+                    this.nextPos(pos)) {
+                    return pos;
+                }
+            }
+            return null;
+        }
+        else {
+            while (isOnlyWhitespace(this.charAt(pos))) {
+                if (!this.nextPos(pos)) {
+                    return null;
+                }
+            }
+            return pos;
+        }
+    };
+    Lines.prototype.trimLeft = function () {
+        var pos = this.skipSpaces(this.firstPos(), false, true);
+        return pos ? this.slice(pos) : emptyLines;
+    };
+    Lines.prototype.trimRight = function () {
+        var pos = this.skipSpaces(this.lastPos(), true, true);
+        return pos ? this.slice(this.firstPos(), pos) : emptyLines;
+    };
+    Lines.prototype.trim = function () {
+        var start = this.skipSpaces(this.firstPos(), false, true);
+        if (start === null) {
+            return emptyLines;
+        }
+        var end = this.skipSpaces(this.lastPos(), true, true);
+        if (end === null) {
+            return emptyLines;
+        }
+        return this.slice(start, end);
+    };
+    Lines.prototype.eachPos = function (callback, startPos, skipSpaces) {
+        if (startPos === void 0) { startPos = this.firstPos(); }
+        if (skipSpaces === void 0) { skipSpaces = false; }
+        var pos = this.firstPos();
+        if (startPos) {
+            pos.line = startPos.line,
+                pos.column = startPos.column;
+        }
+        if (skipSpaces && !this.skipSpaces(pos, false, true)) {
+            return; // Encountered nothing but spaces.
+        }
+        do
+            callback.call(this, pos);
+        while (this.nextPos(pos, skipSpaces));
+    };
+    Lines.prototype.bootstrapSlice = function (start, end) {
+        var strings = this.toString().split(lineTerminatorSeqExp).slice(start.line - 1, end.line);
+        if (strings.length > 0) {
+            strings.push(strings.pop().slice(0, end.column));
+            strings[0] = strings[0].slice(start.column);
+        }
+        return fromString(strings.join("\n"));
+    };
+    Lines.prototype.slice = function (start, end) {
+        if (!end) {
+            if (!start) {
+                // The client seems to want a copy of this Lines object, but
+                // Lines objects are immutable, so it's perfectly adequate to
+                // return the same object.
+                return this;
+            }
+            // Slice to the end if no end position was provided.
+            end = this.lastPos();
+        }
+        if (!start) {
+            throw new Error("cannot slice with end but not start");
+        }
+        var sliced = this.infos.slice(start.line - 1, end.line);
+        if (start.line === end.line) {
+            sliced[0] = sliceInfo(sliced[0], start.column, end.column);
+        }
+        else {
+            assert_1.default.ok(start.line < end.line);
+            sliced[0] = sliceInfo(sliced[0], start.column);
+            sliced.push(sliceInfo(sliced.pop(), 0, end.column));
+        }
+        var lines = new Lines(sliced);
+        if (this.mappings.length > 0) {
+            var newMappings = lines.mappings;
+            assert_1.default.strictEqual(newMappings.length, 0);
+            this.mappings.forEach(function (mapping) {
+                var sliced = mapping.slice(this, start, end);
+                if (sliced) {
+                    newMappings.push(sliced);
+                }
+            }, this);
+        }
+        return lines;
+    };
+    Lines.prototype.bootstrapSliceString = function (start, end, options) {
+        return this.slice(start, end).toString(options);
+    };
+    Lines.prototype.sliceString = function (start, end, options) {
+        if (start === void 0) { start = this.firstPos(); }
+        if (end === void 0) { end = this.lastPos(); }
+        options = options_1.normalize(options);
+        var parts = [];
+        var _a = options.tabWidth, tabWidth = _a === void 0 ? 2 : _a;
+        for (var line = start.line; line <= end.line; ++line) {
+            var info = this.infos[line - 1];
+            if (line === start.line) {
+                if (line === end.line) {
+                    info = sliceInfo(info, start.column, end.column);
+                }
+                else {
+                    info = sliceInfo(info, start.column);
+                }
+            }
+            else if (line === end.line) {
+                info = sliceInfo(info, 0, end.column);
+            }
+            var indent = Math.max(info.indent, 0);
+            var before = info.line.slice(0, info.sliceStart);
+            if (options.reuseWhitespace &&
+                isOnlyWhitespace(before) &&
+                countSpaces(before, options.tabWidth) === indent) {
+                // Reuse original spaces if the indentation is correct.
+                parts.push(info.line.slice(0, info.sliceEnd));
+                continue;
+            }
+            var tabs = 0;
+            var spaces = indent;
+            if (options.useTabs) {
+                tabs = Math.floor(indent / tabWidth);
+                spaces -= tabs * tabWidth;
+            }
+            var result = "";
+            if (tabs > 0) {
+                result += new Array(tabs + 1).join("\t");
+            }
+            if (spaces > 0) {
+                result += new Array(spaces + 1).join(" ");
+            }
+            result += info.line.slice(info.sliceStart, info.sliceEnd);
+            parts.push(result);
+        }
+        return parts.join(options.lineTerminator);
+    };
+    Lines.prototype.isEmpty = function () {
+        return this.length < 2 && this.getLineLength(1) < 1;
+    };
+    Lines.prototype.join = function (elements) {
+        var separator = this;
+        var infos = [];
+        var mappings = [];
+        var prevInfo;
+        function appendLines(linesOrNull) {
+            if (linesOrNull === null) {
+                return;
+            }
+            if (prevInfo) {
+                var info = linesOrNull.infos[0];
+                var indent = new Array(info.indent + 1).join(" ");
+                var prevLine = infos.length;
+                var prevColumn = Math.max(prevInfo.indent, 0) +
+                    prevInfo.sliceEnd - prevInfo.sliceStart;
+                prevInfo.line = prevInfo.line.slice(0, prevInfo.sliceEnd) + indent + info.line.slice(info.sliceStart, info.sliceEnd);
+                // If any part of a line is indentation-locked, the whole line
+                // will be indentation-locked.
+                prevInfo.locked = prevInfo.locked || info.locked;
+                prevInfo.sliceEnd = prevInfo.line.length;
+                if (linesOrNull.mappings.length > 0) {
+                    linesOrNull.mappings.forEach(function (mapping) {
+                        mappings.push(mapping.add(prevLine, prevColumn));
+                    });
+                }
+            }
+            else if (linesOrNull.mappings.length > 0) {
+                mappings.push.apply(mappings, linesOrNull.mappings);
+            }
+            linesOrNull.infos.forEach(function (info, i) {
+                if (!prevInfo || i > 0) {
+                    prevInfo = __assign({}, info);
+                    infos.push(prevInfo);
+                }
+            });
+        }
+        function appendWithSeparator(linesOrNull, i) {
+            if (i > 0)
+                appendLines(separator);
+            appendLines(linesOrNull);
+        }
+        elements.map(function (elem) {
+            var lines = fromString(elem);
+            if (lines.isEmpty())
+                return null;
+            return lines;
+        }).forEach(function (linesOrNull, i) {
+            if (separator.isEmpty()) {
+                appendLines(linesOrNull);
+            }
+            else {
+                appendWithSeparator(linesOrNull, i);
+            }
+        });
+        if (infos.length < 1)
+            return emptyLines;
+        var lines = new Lines(infos);
+        lines.mappings = mappings;
+        return lines;
+    };
+    Lines.prototype.concat = function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var list = [this];
+        list.push.apply(list, args);
+        assert_1.default.strictEqual(list.length, args.length + 1);
+        return emptyLines.join(list);
+    };
+    return Lines;
+}());
+exports.Lines = Lines;
+var fromStringCache = {};
+var hasOwn = fromStringCache.hasOwnProperty;
+var maxCacheKeyLen = 10;
+function countSpaces(spaces, tabWidth) {
+    var count = 0;
+    var len = spaces.length;
+    for (var i = 0; i < len; ++i) {
+        switch (spaces.charCodeAt(i)) {
+            case 9: // '\t'
+                assert_1.default.strictEqual(typeof tabWidth, "number");
+                assert_1.default.ok(tabWidth > 0);
+                var next = Math.ceil(count / tabWidth) * tabWidth;
+                if (next === count) {
+                    count += tabWidth;
+                }
+                else {
+                    count = next;
+                }
+                break;
+            case 11: // '\v'
+            case 12: // '\f'
+            case 13: // '\r'
+            case 0xfeff: // zero-width non-breaking space
+                // These characters contribute nothing to indentation.
+                break;
+            case 32: // ' '
+            default: // Treat all other whitespace like ' '.
+                count += 1;
+                break;
+        }
+    }
+    return count;
+}
+exports.countSpaces = countSpaces;
+var leadingSpaceExp = /^\s*/;
+// As specified here: http://www.ecma-international.org/ecma-262/6.0/#sec-line-terminators
+var lineTerminatorSeqExp = /\u000D\u000A|\u000D(?!\u000A)|\u000A|\u2028|\u2029/;
+/**
+ * @param {Object} options - Options object that configures printing.
+ */
+function fromString(string, options) {
+    if (string instanceof Lines)
+        return string;
+    string += "";
+    var tabWidth = options && options.tabWidth;
+    var tabless = string.indexOf("\t") < 0;
+    var cacheable = !options && tabless && (string.length <= maxCacheKeyLen);
+    assert_1.default.ok(tabWidth || tabless, "No tab width specified but encountered tabs in string\n" + string);
+    if (cacheable && hasOwn.call(fromStringCache, string))
+        return fromStringCache[string];
+    var lines = new Lines(string.split(lineTerminatorSeqExp).map(function (line) {
+        // TODO: handle null exec result
+        var spaces = leadingSpaceExp.exec(line)[0];
+        return {
+            line: line,
+            indent: countSpaces(spaces, tabWidth),
+            // Boolean indicating whether this line can be reindented.
+            locked: false,
+            sliceStart: spaces.length,
+            sliceEnd: line.length
+        };
+    }), options_1.normalize(options).sourceFileName);
+    if (cacheable)
+        fromStringCache[string] = lines;
+    return lines;
+}
+exports.fromString = fromString;
+function isOnlyWhitespace(string) {
+    return !/\S/.test(string);
+}
+function sliceInfo(info, startCol, endCol) {
+    var sliceStart = info.sliceStart;
+    var sliceEnd = info.sliceEnd;
+    var indent = Math.max(info.indent, 0);
+    var lineLength = indent + sliceEnd - sliceStart;
+    if (typeof endCol === "undefined") {
+        endCol = lineLength;
+    }
+    startCol = Math.max(startCol, 0);
+    endCol = Math.min(endCol, lineLength);
+    endCol = Math.max(endCol, startCol);
+    if (endCol < indent) {
+        indent = endCol;
+        sliceEnd = sliceStart;
+    }
+    else {
+        sliceEnd -= lineLength - endCol;
+    }
+    lineLength = endCol;
+    lineLength -= startCol;
+    if (startCol < indent) {
+        indent -= startCol;
+    }
+    else {
+        startCol -= indent;
+        indent = 0;
+        sliceStart += startCol;
+    }
+    assert_1.default.ok(indent >= 0);
+    assert_1.default.ok(sliceStart <= sliceEnd);
+    assert_1.default.strictEqual(lineLength, indent + sliceEnd - sliceStart);
+    if (info.indent === indent &&
+        info.sliceStart === sliceStart &&
+        info.sliceEnd === sliceEnd) {
+        return info;
+    }
+    return {
+        line: info.line,
+        indent: indent,
+        // A destructive slice always unlocks indentation.
+        locked: false,
+        sliceStart: sliceStart,
+        sliceEnd: sliceEnd
+    };
+}
+function concat(elements) {
+    return emptyLines.join(elements);
+}
+exports.concat = concat;
+;
+// The emptyLines object needs to be created all the way down here so that
+// Lines.prototype will be fully populated.
+var emptyLines = fromString("");
diff --git a/node_modules/recast/lib/mapping.d.ts b/node_modules/recast/lib/mapping.d.ts
new file mode 100644
index 0000000..35c39b4
--- /dev/null
+++ b/node_modules/recast/lib/mapping.d.ts
@@ -0,0 +1,15 @@
+import { namedTypes } from "ast-types";
+import { Lines } from "./lines";
+declare type Pos = namedTypes.Position;
+declare type Loc = namedTypes.SourceLocation;
+export default class Mapping {
+    sourceLines: Lines;
+    sourceLoc: Loc;
+    targetLoc: Loc;
+    constructor(sourceLines: Lines, sourceLoc: Loc, targetLoc?: Loc);
+    slice(lines: Lines, start: Pos, end?: Pos): Mapping | null;
+    add(line: number, column: number): Mapping;
+    subtract(line: number, column: number): Mapping;
+    indent(by: number, skipFirstLine?: boolean, noNegativeColumns?: boolean): Mapping;
+}
+export {};
diff --git a/node_modules/recast/lib/mapping.js b/node_modules/recast/lib/mapping.js
new file mode 100644
index 0000000..fbb5e19
--- /dev/null
+++ b/node_modules/recast/lib/mapping.js
@@ -0,0 +1,202 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var util_1 = require("./util");
+var Mapping = /** @class */ (function () {
+    function Mapping(sourceLines, sourceLoc, targetLoc) {
+        if (targetLoc === void 0) { targetLoc = sourceLoc; }
+        this.sourceLines = sourceLines;
+        this.sourceLoc = sourceLoc;
+        this.targetLoc = targetLoc;
+    }
+    Mapping.prototype.slice = function (lines, start, end) {
+        if (end === void 0) { end = lines.lastPos(); }
+        var sourceLines = this.sourceLines;
+        var sourceLoc = this.sourceLoc;
+        var targetLoc = this.targetLoc;
+        function skip(name) {
+            var sourceFromPos = sourceLoc[name];
+            var targetFromPos = targetLoc[name];
+            var targetToPos = start;
+            if (name === "end") {
+                targetToPos = end;
+            }
+            else {
+                assert_1.default.strictEqual(name, "start");
+            }
+            return skipChars(sourceLines, sourceFromPos, lines, targetFromPos, targetToPos);
+        }
+        if (util_1.comparePos(start, targetLoc.start) <= 0) {
+            if (util_1.comparePos(targetLoc.end, end) <= 0) {
+                targetLoc = {
+                    start: subtractPos(targetLoc.start, start.line, start.column),
+                    end: subtractPos(targetLoc.end, start.line, start.column)
+                };
+                // The sourceLoc can stay the same because the contents of the
+                // targetLoc have not changed.
+            }
+            else if (util_1.comparePos(end, targetLoc.start) <= 0) {
+                return null;
+            }
+            else {
+                sourceLoc = {
+                    start: sourceLoc.start,
+                    end: skip("end")
+                };
+                targetLoc = {
+                    start: subtractPos(targetLoc.start, start.line, start.column),
+                    end: subtractPos(end, start.line, start.column)
+                };
+            }
+        }
+        else {
+            if (util_1.comparePos(targetLoc.end, start) <= 0) {
+                return null;
+            }
+            if (util_1.comparePos(targetLoc.end, end) <= 0) {
+                sourceLoc = {
+                    start: skip("start"),
+                    end: sourceLoc.end
+                };
+                targetLoc = {
+                    // Same as subtractPos(start, start.line, start.column):
+                    start: { line: 1, column: 0 },
+                    end: subtractPos(targetLoc.end, start.line, start.column)
+                };
+            }
+            else {
+                sourceLoc = {
+                    start: skip("start"),
+                    end: skip("end")
+                };
+                targetLoc = {
+                    // Same as subtractPos(start, start.line, start.column):
+                    start: { line: 1, column: 0 },
+                    end: subtractPos(end, start.line, start.column)
+                };
+            }
+        }
+        return new Mapping(this.sourceLines, sourceLoc, targetLoc);
+    };
+    Mapping.prototype.add = function (line, column) {
+        return new Mapping(this.sourceLines, this.sourceLoc, {
+            start: addPos(this.targetLoc.start, line, column),
+            end: addPos(this.targetLoc.end, line, column)
+        });
+    };
+    Mapping.prototype.subtract = function (line, column) {
+        return new Mapping(this.sourceLines, this.sourceLoc, {
+            start: subtractPos(this.targetLoc.start, line, column),
+            end: subtractPos(this.targetLoc.end, line, column)
+        });
+    };
+    Mapping.prototype.indent = function (by, skipFirstLine, noNegativeColumns) {
+        if (skipFirstLine === void 0) { skipFirstLine = false; }
+        if (noNegativeColumns === void 0) { noNegativeColumns = false; }
+        if (by === 0) {
+            return this;
+        }
+        var targetLoc = this.targetLoc;
+        var startLine = targetLoc.start.line;
+        var endLine = targetLoc.end.line;
+        if (skipFirstLine && startLine === 1 && endLine === 1) {
+            return this;
+        }
+        targetLoc = {
+            start: targetLoc.start,
+            end: targetLoc.end
+        };
+        if (!skipFirstLine || startLine > 1) {
+            var startColumn = targetLoc.start.column + by;
+            targetLoc.start = {
+                line: startLine,
+                column: noNegativeColumns
+                    ? Math.max(0, startColumn)
+                    : startColumn
+            };
+        }
+        if (!skipFirstLine || endLine > 1) {
+            var endColumn = targetLoc.end.column + by;
+            targetLoc.end = {
+                line: endLine,
+                column: noNegativeColumns
+                    ? Math.max(0, endColumn)
+                    : endColumn
+            };
+        }
+        return new Mapping(this.sourceLines, this.sourceLoc, targetLoc);
+    };
+    return Mapping;
+}());
+exports.default = Mapping;
+function addPos(toPos, line, column) {
+    return {
+        line: toPos.line + line - 1,
+        column: (toPos.line === 1)
+            ? toPos.column + column
+            : toPos.column
+    };
+}
+function subtractPos(fromPos, line, column) {
+    return {
+        line: fromPos.line - line + 1,
+        column: (fromPos.line === line)
+            ? fromPos.column - column
+            : fromPos.column
+    };
+}
+function skipChars(sourceLines, sourceFromPos, targetLines, targetFromPos, targetToPos) {
+    var targetComparison = util_1.comparePos(targetFromPos, targetToPos);
+    if (targetComparison === 0) {
+        // Trivial case: no characters to skip.
+        return sourceFromPos;
+    }
+    if (targetComparison < 0) {
+        // Skipping forward.
+        var sourceCursor = sourceLines.skipSpaces(sourceFromPos) || sourceLines.lastPos();
+        var targetCursor = targetLines.skipSpaces(targetFromPos) || targetLines.lastPos();
+        var lineDiff = targetToPos.line - targetCursor.line;
+        sourceCursor.line += lineDiff;
+        targetCursor.line += lineDiff;
+        if (lineDiff > 0) {
+            // If jumping to later lines, reset columns to the beginnings
+            // of those lines.
+            sourceCursor.column = 0;
+            targetCursor.column = 0;
+        }
+        else {
+            assert_1.default.strictEqual(lineDiff, 0);
+        }
+        while (util_1.comparePos(targetCursor, targetToPos) < 0 &&
+            targetLines.nextPos(targetCursor, true)) {
+            assert_1.default.ok(sourceLines.nextPos(sourceCursor, true));
+            assert_1.default.strictEqual(sourceLines.charAt(sourceCursor), targetLines.charAt(targetCursor));
+        }
+    }
+    else {
+        // Skipping backward.
+        var sourceCursor = sourceLines.skipSpaces(sourceFromPos, true) || sourceLines.firstPos();
+        var targetCursor = targetLines.skipSpaces(targetFromPos, true) || targetLines.firstPos();
+        var lineDiff = targetToPos.line - targetCursor.line;
+        sourceCursor.line += lineDiff;
+        targetCursor.line += lineDiff;
+        if (lineDiff < 0) {
+            // If jumping to earlier lines, reset columns to the ends of
+            // those lines.
+            sourceCursor.column = sourceLines.getLineLength(sourceCursor.line);
+            targetCursor.column = targetLines.getLineLength(targetCursor.line);
+        }
+        else {
+            assert_1.default.strictEqual(lineDiff, 0);
+        }
+        while (util_1.comparePos(targetToPos, targetCursor) < 0 &&
+            targetLines.prevPos(targetCursor, true)) {
+            assert_1.default.ok(sourceLines.prevPos(sourceCursor, true));
+            assert_1.default.strictEqual(sourceLines.charAt(sourceCursor), targetLines.charAt(targetCursor));
+        }
+    }
+    return sourceCursor;
+}
diff --git a/node_modules/recast/lib/options.d.ts b/node_modules/recast/lib/options.d.ts
new file mode 100644
index 0000000..6f88721
--- /dev/null
+++ b/node_modules/recast/lib/options.d.ts
@@ -0,0 +1,148 @@
+import { Omit } from "ast-types/types";
+/**
+ * All Recast API functions take second parameter with configuration options,
+ * documented in options.js
+ */
+export interface Options extends DeprecatedOptions {
+    /**
+     * If you want to use a different branch of esprima, or any other module
+     * that supports a .parse function, pass that module object to
+     * recast.parse as options.parser (legacy synonym: options.esprima).
+     * @default require("recast/parsers/esprima")
+     */
+    parser?: any;
+    /**
+     * Number of spaces the pretty-printer should use per tab for
+     * indentation. If you do not pass this option explicitly, it will be
+     * (quite reliably!) inferred from the original code.
+     * @default 4
+     */
+    tabWidth?: number;
+    /**
+     * If you really want the pretty-printer to use tabs instead of spaces,
+     * make this option true.
+     * @default false
+     */
+    useTabs?: boolean;
+    /**
+     * The reprinting code leaves leading whitespace untouched unless it has
+     * to reindent a line, or you pass false for this option.
+     * @default true
+     */
+    reuseWhitespace?: boolean;
+    /**
+     * Override this option to use a different line terminator, e.g. \r\n.
+     * @default require("os").EOL || "\n"
+     */
+    lineTerminator?: string;
+    /**
+     * Some of the pretty-printer code (such as that for printing function
+     * parameter lists) makes a valiant attempt to prevent really long
+     * lines. You can adjust the limit by changing this option; however,
+     * there is no guarantee that line length will fit inside this limit.
+     * @default 74
+     */
+    wrapColumn?: number;
+    /**
+     * Pass a string as options.sourceFileName to recast.parse to tell the
+     * reprinter to keep track of reused code so that it can construct a
+     * source map automatically.
+     * @default null
+     */
+    sourceFileName?: string | null;
+    /**
+     * Pass a string as options.sourceMapName to recast.print, and (provided
+     * you passed options.sourceFileName earlier) the PrintResult of
+     * recast.print will have a .map property for the generated source map.
+     * @default null
+     */
+    sourceMapName?: string | null;
+    /**
+     * If provided, this option will be passed along to the source map
+     * generator as a root directory for relative source file paths.
+     * @default null
+     */
+    sourceRoot?: string | null;
+    /**
+     * If you provide a source map that was generated from a previous call
+     * to recast.print as options.inputSourceMap, the old source map will be
+     * composed with the new source map.
+     * @default null
+     */
+    inputSourceMap?: string | null;
+    /**
+     * If you want esprima to generate .range information (recast only uses
+     * .loc internally), pass true for this option.
+     * @default false
+     */
+    range?: boolean;
+    /**
+     * If you want esprima not to throw exceptions when it encounters
+     * non-fatal errors, keep this option true.
+     * @default true
+     */
+    tolerant?: boolean;
+    /**
+     * If you want to override the quotes used in string literals, specify
+     * either "single", "double", or "auto" here ("auto" will select the one
+     * which results in the shorter literal) Otherwise, use double quotes.
+     * @default null
+     */
+    quote?: 'single' | 'double' | 'auto' | null;
+    /**
+     * Controls the printing of trailing commas in object literals, array
+     * expressions and function parameters.
+     *
+     * This option could either be:
+     * * Boolean - enable/disable in all contexts (objects, arrays and function params).
+     * * Object - enable/disable per context.
+     *
+     * Example:
+     * trailingComma: {
+     *   objects: true,
+     *   arrays: true,
+     *   parameters: false,
+     * }
+     *
+     * @default false
+     */
+    trailingComma?: boolean;
+    /**
+     * Controls the printing of spaces inside array brackets.
+     * See: http://eslint.org/docs/rules/array-bracket-spacing
+     * @default false
+     */
+    arrayBracketSpacing?: boolean;
+    /**
+     * Controls the printing of spaces inside object literals,
+     * destructuring assignments, and import/export specifiers.
+     * See: http://eslint.org/docs/rules/object-curly-spacing
+     * @default true
+     */
+    objectCurlySpacing?: boolean;
+    /**
+     * If you want parenthesis to wrap single-argument arrow function
+     * parameter lists, pass true for this option.
+     * @default false
+     */
+    arrowParensAlways?: boolean;
+    /**
+     * There are 2 supported syntaxes (`,` and `;`) in Flow Object Types;
+     * The use of commas is in line with the more popular style and matches
+     * how objects are defined in JS, making it a bit more natural to write.
+     * @default true
+     */
+    flowObjectCommas?: boolean;
+    /**
+     * Whether to return an array of .tokens on the root AST node.
+     * @default true
+     */
+    tokens?: boolean;
+}
+interface DeprecatedOptions {
+    /** @deprecated */
+    esprima?: any;
+}
+export declare type NormalizedOptions = Required<Omit<Options, keyof DeprecatedOptions>>;
+export declare function normalize(opts?: Options): NormalizedOptions;
+export {};
diff --git a/node_modules/recast/lib/options.js b/node_modules/recast/lib/options.js
new file mode 100644
index 0000000..3268c90
--- /dev/null
+++ b/node_modules/recast/lib/options.js
@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var defaults = {
+    parser: require("../parsers/esprima"),
+    tabWidth: 4,
+    useTabs: false,
+    reuseWhitespace: true,
+    lineTerminator: require("os").EOL || "\n",
+    wrapColumn: 74,
+    sourceFileName: null,
+    sourceMapName: null,
+    sourceRoot: null,
+    inputSourceMap: null,
+    range: false,
+    tolerant: true,
+    quote: null,
+    trailingComma: false,
+    arrayBracketSpacing: false,
+    objectCurlySpacing: true,
+    arrowParensAlways: false,
+    flowObjectCommas: true,
+    tokens: true
+}, hasOwn = defaults.hasOwnProperty;
+// Copy options and fill in default values.
+function normalize(opts) {
+    var options = opts || defaults;
+    function get(key) {
+        return hasOwn.call(options, key)
+            ? options[key]
+            : defaults[key];
+    }
+    return {
+        tabWidth: +get("tabWidth"),
+        useTabs: !!get("useTabs"),
+        reuseWhitespace: !!get("reuseWhitespace"),
+        lineTerminator: get("lineTerminator"),
+        wrapColumn: Math.max(get("wrapColumn"), 0),
+        sourceFileName: get("sourceFileName"),
+        sourceMapName: get("sourceMapName"),
+        sourceRoot: get("sourceRoot"),
+        inputSourceMap: get("inputSourceMap"),
+        parser: get("esprima") || get("parser"),
+        range: get("range"),
+        tolerant: get("tolerant"),
+        quote: get("quote"),
+        trailingComma: get("trailingComma"),
+        arrayBracketSpacing: get("arrayBracketSpacing"),
+        objectCurlySpacing: get("objectCurlySpacing"),
+        arrowParensAlways: get("arrowParensAlways"),
+        flowObjectCommas: get("flowObjectCommas"),
+        tokens: !!get("tokens")
+    };
+}
+exports.normalize = normalize;
+;
diff --git a/node_modules/recast/lib/parser.d.ts b/node_modules/recast/lib/parser.d.ts
new file mode 100644
index 0000000..6f1d6df
--- /dev/null
+++ b/node_modules/recast/lib/parser.d.ts
@@ -0,0 +1,2 @@
+import { Options } from "./options";
+export declare function parse(source: string, options?: Partial<Options>): any;
diff --git a/node_modules/recast/lib/parser.js b/node_modules/recast/lib/parser.js
new file mode 100644
index 0000000..4871e9e
--- /dev/null
+++ b/node_modules/recast/lib/parser.js
@@ -0,0 +1,257 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var types = __importStar(require("ast-types"));
+var b = types.builders;
+var isObject = types.builtInTypes.object;
+var isArray = types.builtInTypes.array;
+var options_1 = require("./options");
+var lines_1 = require("./lines");
+var comments_1 = require("./comments");
+var util = __importStar(require("./util"));
+function parse(source, options) {
+    options = options_1.normalize(options);
+    var lines = lines_1.fromString(source, options);
+    var sourceWithoutTabs = lines.toString({
+        tabWidth: options.tabWidth,
+        reuseWhitespace: false,
+        useTabs: false
+    });
+    var comments = [];
+    var ast = options.parser.parse(sourceWithoutTabs, {
+        jsx: true,
+        loc: true,
+        locations: true,
+        range: options.range,
+        comment: true,
+        onComment: comments,
+        tolerant: util.getOption(options, "tolerant", true),
+        ecmaVersion: 6,
+        sourceType: util.getOption(options, "sourceType", "module")
+    });
+    // Use ast.tokens if possible, and otherwise fall back to the Esprima
+    // tokenizer. All the preconfigured ../parsers/* expose ast.tokens
+    // automatically, but custom parsers might need additional configuration
+    // to avoid this fallback.
+    var tokens = Array.isArray(ast.tokens)
+        ? ast.tokens
+        : require("esprima").tokenize(sourceWithoutTabs, {
+            loc: true
+        });
+    // We will reattach the tokens array to the file object below.
+    delete ast.tokens;
+    // Make sure every token has a token.value string.
+    tokens.forEach(function (token) {
+        if (typeof token.value !== "string") {
+            token.value = lines.sliceString(token.loc.start, token.loc.end);
+        }
+    });
+    if (Array.isArray(ast.comments)) {
+        comments = ast.comments;
+        delete ast.comments;
+    }
+    if (ast.loc) {
+        // If the source was empty, some parsers give loc.{start,end}.line
+        // values of 0, instead of the minimum of 1.
+        util.fixFaultyLocations(ast, lines);
+    }
+    else {
+        ast.loc = {
+            start: lines.firstPos(),
+            end: lines.lastPos()
+        };
+    }
+    ast.loc.lines = lines;
+    ast.loc.indent = 0;
+    var file;
+    var program;
+    if (ast.type === "Program") {
+        program = ast;
+        // In order to ensure we reprint leading and trailing program
+        // comments, wrap the original Program node with a File node. Only
+        // ESTree parsers (Acorn and Esprima) return a Program as the root AST
+        // node. Most other (Babylon-like) parsers return a File.
+        file = b.file(ast, options.sourceFileName || null);
+        file.loc = {
+            start: lines.firstPos(),
+            end: lines.lastPos(),
+            lines: lines,
+            indent: 0
+        };
+    }
+    else if (ast.type === "File") {
+        file = ast;
+        program = file.program;
+    }
+    // Expose file.tokens unless the caller passed false for options.tokens.
+    if (options.tokens) {
+        file.tokens = tokens;
+    }
+    // Expand the Program's .loc to include all comments (not just those
+    // attached to the Program node, as its children may have comments as
+    // well), since sometimes program.loc.{start,end} will coincide with the
+    // .loc.{start,end} of the first and last *statements*, mistakenly
+    // excluding comments that fall outside that region.
+    var trueProgramLoc = util.getTrueLoc({
+        type: program.type,
+        loc: program.loc,
+        body: [],
+        comments: comments
+    }, lines);
+    program.loc.start = trueProgramLoc.start;
+    program.loc.end = trueProgramLoc.end;
+    // Passing file.program here instead of just file means that initial
+    // comments will be attached to program.body[0] instead of program.
+    comments_1.attach(comments, program.body.length ? file.program : file, lines);
+    // Return a copy of the original AST so that any changes made may be
+    // compared to the original.
+    return new TreeCopier(lines, tokens).copy(file);
+}
+exports.parse = parse;
+;
+var TreeCopier = function TreeCopier(lines, tokens) {
+    assert_1.default.ok(this instanceof TreeCopier);
+    this.lines = lines;
+    this.tokens = tokens;
+    this.startTokenIndex = 0;
+    this.endTokenIndex = tokens.length;
+    this.indent = 0;
+    this.seen = new Map;
+};
+var TCp = TreeCopier.prototype;
+TCp.copy = function (node) {
+    if (this.seen.has(node)) {
+        return this.seen.get(node);
+    }
+    if (isArray.check(node)) {
+        var copy = new Array(node.length);
+        this.seen.set(node, copy);
+        node.forEach(function (item, i) {
+            copy[i] = this.copy(item);
+        }, this);
+        return copy;
+    }
+    if (!isObject.check(node)) {
+        return node;
+    }
+    util.fixFaultyLocations(node, this.lines);
+    var copy = Object.create(Object.getPrototypeOf(node), {
+        original: {
+            value: node,
+            configurable: false,
+            enumerable: false,
+            writable: true
+        }
+    });
+    this.seen.set(node, copy);
+    var loc = node.loc;
+    var oldIndent = this.indent;
+    var newIndent = oldIndent;
+    var oldStartTokenIndex = this.startTokenIndex;
+    var oldEndTokenIndex = this.endTokenIndex;
+    if (loc) {
+        // When node is a comment, we set node.loc.indent to
+        // node.loc.start.column so that, when/if we print the comment by
+        // itself, we can strip that much whitespace from the left margin of
+        // the comment. This only really matters for multiline Block comments,
+        // but it doesn't hurt for Line comments.
+        if (node.type === "Block" || node.type === "Line" ||
+            node.type === "CommentBlock" || node.type === "CommentLine" ||
+            this.lines.isPrecededOnlyByWhitespace(loc.start)) {
+            newIndent = this.indent = loc.start.column;
+        }
+        // Every node.loc has a reference to the original source lines as well
+        // as a complete list of source tokens.
+        loc.lines = this.lines;
+        loc.tokens = this.tokens;
+        loc.indent = newIndent;
+        // Set loc.start.token and loc.end.token such that
+        // loc.tokens.slice(loc.start.token, loc.end.token) returns a list of
+        // all the tokens that make up this node.
+        this.findTokenRange(loc);
+    }
+    var keys = Object.keys(node);
+    var keyCount = keys.length;
+    for (var i = 0; i < keyCount; ++i) {
+        var key = keys[i];
+        if (key === "loc") {
+            copy[key] = node[key];
+        }
+        else if (key === "tokens" &&
+            node.type === "File") {
+            // Preserve file.tokens (uncopied) in case client code cares about
+            // it, even though Recast ignores it when reprinting.
+            copy[key] = node[key];
+        }
+        else {
+            copy[key] = this.copy(node[key]);
+        }
+    }
+    this.indent = oldIndent;
+    this.startTokenIndex = oldStartTokenIndex;
+    this.endTokenIndex = oldEndTokenIndex;
+    return copy;
+};
+// If we didn't have any idea where in loc.tokens to look for tokens
+// contained by this loc, a binary search would be appropriate, but
+// because we maintain this.startTokenIndex and this.endTokenIndex as we
+// traverse the AST, we only need to make small (linear) adjustments to
+// those indexes with each recursive iteration.
+TCp.findTokenRange = function (loc) {
+    // In the unlikely event that loc.tokens[this.startTokenIndex] starts
+    // *after* loc.start, we need to rewind this.startTokenIndex first.
+    while (this.startTokenIndex > 0) {
+        var token = loc.tokens[this.startTokenIndex];
+        if (util.comparePos(loc.start, token.loc.start) < 0) {
+            --this.startTokenIndex;
+        }
+        else
+            break;
+    }
+    // In the unlikely event that loc.tokens[this.endTokenIndex - 1] ends
+    // *before* loc.end, we need to fast-forward this.endTokenIndex first.
+    while (this.endTokenIndex < loc.tokens.length) {
+        var token = loc.tokens[this.endTokenIndex];
+        if (util.comparePos(token.loc.end, loc.end) < 0) {
+            ++this.endTokenIndex;
+        }
+        else
+            break;
+    }
+    // Increment this.startTokenIndex until we've found the first token
+    // contained by this node.
+    while (this.startTokenIndex < this.endTokenIndex) {
+        var token = loc.tokens[this.startTokenIndex];
+        if (util.comparePos(token.loc.start, loc.start) < 0) {
+            ++this.startTokenIndex;
+        }
+        else
+            break;
+    }
+    // Index into loc.tokens of the first token within this node.
+    loc.start.token = this.startTokenIndex;
+    // Decrement this.endTokenIndex until we've found the first token after
+    // this node (not contained by the node).
+    while (this.endTokenIndex > this.startTokenIndex) {
+        var token = loc.tokens[this.endTokenIndex - 1];
+        if (util.comparePos(loc.end, token.loc.end) < 0) {
+            --this.endTokenIndex;
+        }
+        else
+            break;
+    }
+    // Index into loc.tokens of the first token *after* this node.
+    // If loc.start.token === loc.end.token, the node contains no tokens,
+    // and the index is that of the next token following this node.
+    loc.end.token = this.endTokenIndex;
+};
diff --git a/node_modules/recast/lib/patcher.d.ts b/node_modules/recast/lib/patcher.d.ts
new file mode 100644
index 0000000..dcc065c
--- /dev/null
+++ b/node_modules/recast/lib/patcher.d.ts
@@ -0,0 +1,12 @@
+interface PatcherType {
+    replace(loc: any, lines: any): any;
+    get(loc?: any): any;
+    tryToReprintComments(newNode: any, oldNode: any, print: any): any;
+    deleteComments(node: any): any;
+}
+interface PatcherConstructor {
+    new (lines: any): PatcherType;
+}
+declare const Patcher: PatcherConstructor;
+export { Patcher };
+export declare function getReprinter(path: any): ((print: any) => any) | undefined;
diff --git a/node_modules/recast/lib/patcher.js b/node_modules/recast/lib/patcher.js
new file mode 100644
index 0000000..fbec8cc
--- /dev/null
+++ b/node_modules/recast/lib/patcher.js
@@ -0,0 +1,392 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var linesModule = __importStar(require("./lines"));
+var types = __importStar(require("ast-types"));
+var Printable = types.namedTypes.Printable;
+var Expression = types.namedTypes.Expression;
+var ReturnStatement = types.namedTypes.ReturnStatement;
+var SourceLocation = types.namedTypes.SourceLocation;
+var util_1 = require("./util");
+var fast_path_1 = __importDefault(require("./fast-path"));
+var isObject = types.builtInTypes.object;
+var isArray = types.builtInTypes.array;
+var isString = types.builtInTypes.string;
+var riskyAdjoiningCharExp = /[0-9a-z_$]/i;
+var Patcher = function Patcher(lines) {
+    assert_1.default.ok(this instanceof Patcher);
+    assert_1.default.ok(lines instanceof linesModule.Lines);
+    var self = this, replacements = [];
+    self.replace = function (loc, lines) {
+        if (isString.check(lines))
+            lines = linesModule.fromString(lines);
+        replacements.push({
+            lines: lines,
+            start: loc.start,
+            end: loc.end
+        });
+    };
+    self.get = function (loc) {
+        // If no location is provided, return the complete Lines object.
+        loc = loc || {
+            start: { line: 1, column: 0 },
+            end: { line: lines.length,
+                column: lines.getLineLength(lines.length) }
+        };
+        var sliceFrom = loc.start, toConcat = [];
+        function pushSlice(from, to) {
+            assert_1.default.ok(util_1.comparePos(from, to) <= 0);
+            toConcat.push(lines.slice(from, to));
+        }
+        replacements.sort(function (a, b) {
+            return util_1.comparePos(a.start, b.start);
+        }).forEach(function (rep) {
+            if (util_1.comparePos(sliceFrom, rep.start) > 0) {
+                // Ignore nested replacement ranges.
+            }
+            else {
+                pushSlice(sliceFrom, rep.start);
+                toConcat.push(rep.lines);
+                sliceFrom = rep.end;
+            }
+        });
+        pushSlice(sliceFrom, loc.end);
+        return linesModule.concat(toConcat);
+    };
+};
+exports.Patcher = Patcher;
+var Pp = Patcher.prototype;
+Pp.tryToReprintComments = function (newNode, oldNode, print) {
+    var patcher = this;
+    if (!newNode.comments &&
+        !oldNode.comments) {
+        // We were (vacuously) able to reprint all the comments!
+        return true;
+    }
+    var newPath = fast_path_1.default.from(newNode);
+    var oldPath = fast_path_1.default.from(oldNode);
+    newPath.stack.push("comments", getSurroundingComments(newNode));
+    oldPath.stack.push("comments", getSurroundingComments(oldNode));
+    var reprints = [];
+    var ableToReprintComments = findArrayReprints(newPath, oldPath, reprints);
+    // No need to pop anything from newPath.stack or oldPath.stack, since
+    // newPath and oldPath are fresh local variables.
+    if (ableToReprintComments && reprints.length > 0) {
+        reprints.forEach(function (reprint) {
+            var oldComment = reprint.oldPath.getValue();
+            assert_1.default.ok(oldComment.leading || oldComment.trailing);
+            patcher.replace(oldComment.loc, 
+            // Comments can't have .comments, so it doesn't matter whether we
+            // print with comments or without.
+            print(reprint.newPath).indentTail(oldComment.loc.indent));
+        });
+    }
+    return ableToReprintComments;
+};
+// Get all comments that are either leading or trailing, ignoring any
+// comments that occur inside node.loc. Returns an empty array for nodes
+// with no leading or trailing comments.
+function getSurroundingComments(node) {
+    var result = [];
+    if (node.comments &&
+        node.comments.length > 0) {
+        node.comments.forEach(function (comment) {
+            if (comment.leading || comment.trailing) {
+                result.push(comment);
+            }
+        });
+    }
+    return result;
+}
+Pp.deleteComments = function (node) {
+    if (!node.comments) {
+        return;
+    }
+    var patcher = this;
+    node.comments.forEach(function (comment) {
+        if (comment.leading) {
+            // Delete leading comments along with any trailing whitespace they
+            // might have.
+            patcher.replace({
+                start: comment.loc.start,
+                end: node.loc.lines.skipSpaces(comment.loc.end, false, false)
+            }, "");
+        }
+        else if (comment.trailing) {
+            // Delete trailing comments along with any leading whitespace they
+            // might have.
+            patcher.replace({
+                start: node.loc.lines.skipSpaces(comment.loc.start, true, false),
+                end: comment.loc.end
+            }, "");
+        }
+    });
+};
+function getReprinter(path) {
+    assert_1.default.ok(path instanceof fast_path_1.default);
+    // Make sure that this path refers specifically to a Node, rather than
+    // some non-Node subproperty of a Node.
+    var node = path.getValue();
+    if (!Printable.check(node))
+        return;
+    var orig = node.original;
+    var origLoc = orig && orig.loc;
+    var lines = origLoc && origLoc.lines;
+    var reprints = [];
+    if (!lines || !findReprints(path, reprints))
+        return;
+    return function (print) {
+        var patcher = new Patcher(lines);
+        reprints.forEach(function (reprint) {
+            var newNode = reprint.newPath.getValue();
+            var oldNode = reprint.oldPath.getValue();
+            SourceLocation.assert(oldNode.loc, true);
+            var needToPrintNewPathWithComments = !patcher.tryToReprintComments(newNode, oldNode, print);
+            if (needToPrintNewPathWithComments) {
+                // Since we were not able to preserve all leading/trailing
+                // comments, we delete oldNode's comments, print newPath with
+                // comments, and then patch the resulting lines where oldNode used
+                // to be.
+                patcher.deleteComments(oldNode);
+            }
+            var newLines = print(reprint.newPath, {
+                includeComments: needToPrintNewPathWithComments,
+                // If the oldNode we're replacing already had parentheses, we may
+                // not need to print the new node with any extra parentheses,
+                // because the existing parentheses will suffice. However, if the
+                // newNode has a different type than the oldNode, let the printer
+                // decide if reprint.newPath needs parentheses, as usual.
+                avoidRootParens: (oldNode.type === newNode.type &&
+                    reprint.oldPath.hasParens())
+            }).indentTail(oldNode.loc.indent);
+            var nls = needsLeadingSpace(lines, oldNode.loc, newLines);
+            var nts = needsTrailingSpace(lines, oldNode.loc, newLines);
+            // If we try to replace the argument of a ReturnStatement like
+            // return"asdf" with e.g. a literal null expression, we run the risk
+            // of ending up with returnnull, so we need to add an extra leading
+            // space in situations where that might happen. Likewise for
+            // "asdf"in obj. See #170.
+            if (nls || nts) {
+                var newParts = [];
+                nls && newParts.push(" ");
+                newParts.push(newLines);
+                nts && newParts.push(" ");
+                newLines = linesModule.concat(newParts);
+            }
+            patcher.replace(oldNode.loc, newLines);
+        });
+        // Recall that origLoc is the .loc of an ancestor node that is
+        // guaranteed to contain all the reprinted nodes and comments.
+        var patchedLines = patcher.get(origLoc).indentTail(-orig.loc.indent);
+        if (path.needsParens()) {
+            return linesModule.concat(["(", patchedLines, ")"]);
+        }
+        return patchedLines;
+    };
+}
+exports.getReprinter = getReprinter;
+;
+// If the last character before oldLoc and the first character of newLines
+// are both identifier characters, they must be separated by a space,
+// otherwise they will most likely get fused together into a single token.
+function needsLeadingSpace(oldLines, oldLoc, newLines) {
+    var posBeforeOldLoc = util_1.copyPos(oldLoc.start);
+    // The character just before the location occupied by oldNode.
+    var charBeforeOldLoc = oldLines.prevPos(posBeforeOldLoc) &&
+        oldLines.charAt(posBeforeOldLoc);
+    // First character of the reprinted node.
+    var newFirstChar = newLines.charAt(newLines.firstPos());
+    return charBeforeOldLoc &&
+        riskyAdjoiningCharExp.test(charBeforeOldLoc) &&
+        newFirstChar &&
+        riskyAdjoiningCharExp.test(newFirstChar);
+}
+// If the last character of newLines and the first character after oldLoc
+// are both identifier characters, they must be separated by a space,
+// otherwise they will most likely get fused together into a single token.
+function needsTrailingSpace(oldLines, oldLoc, newLines) {
+    // The character just after the location occupied by oldNode.
+    var charAfterOldLoc = oldLines.charAt(oldLoc.end);
+    var newLastPos = newLines.lastPos();
+    // Last character of the reprinted node.
+    var newLastChar = newLines.prevPos(newLastPos) &&
+        newLines.charAt(newLastPos);
+    return newLastChar &&
+        riskyAdjoiningCharExp.test(newLastChar) &&
+        charAfterOldLoc &&
+        riskyAdjoiningCharExp.test(charAfterOldLoc);
+}
+function findReprints(newPath, reprints) {
+    var newNode = newPath.getValue();
+    Printable.assert(newNode);
+    var oldNode = newNode.original;
+    Printable.assert(oldNode);
+    assert_1.default.deepEqual(reprints, []);
+    if (newNode.type !== oldNode.type) {
+        return false;
+    }
+    var oldPath = new fast_path_1.default(oldNode);
+    var canReprint = findChildReprints(newPath, oldPath, reprints);
+    if (!canReprint) {
+        // Make absolutely sure the calling code does not attempt to reprint
+        // any nodes.
+        reprints.length = 0;
+    }
+    return canReprint;
+}
+function findAnyReprints(newPath, oldPath, reprints) {
+    var newNode = newPath.getValue();
+    var oldNode = oldPath.getValue();
+    if (newNode === oldNode)
+        return true;
+    if (isArray.check(newNode))
+        return findArrayReprints(newPath, oldPath, reprints);
+    if (isObject.check(newNode))
+        return findObjectReprints(newPath, oldPath, reprints);
+    return false;
+}
+function findArrayReprints(newPath, oldPath, reprints) {
+    var newNode = newPath.getValue();
+    var oldNode = oldPath.getValue();
+    if (newNode === oldNode ||
+        newPath.valueIsDuplicate() ||
+        oldPath.valueIsDuplicate()) {
+        return true;
+    }
+    isArray.assert(newNode);
+    var len = newNode.length;
+    if (!(isArray.check(oldNode) &&
+        oldNode.length === len))
+        return false;
+    for (var i = 0; i < len; ++i) {
+        newPath.stack.push(i, newNode[i]);
+        oldPath.stack.push(i, oldNode[i]);
+        var canReprint = findAnyReprints(newPath, oldPath, reprints);
+        newPath.stack.length -= 2;
+        oldPath.stack.length -= 2;
+        if (!canReprint) {
+            return false;
+        }
+    }
+    return true;
+}
+function findObjectReprints(newPath, oldPath, reprints) {
+    var newNode = newPath.getValue();
+    isObject.assert(newNode);
+    if (newNode.original === null) {
+        // If newNode.original node was set to null, reprint the node.
+        return false;
+    }
+    var oldNode = oldPath.getValue();
+    if (!isObject.check(oldNode))
+        return false;
+    if (newNode === oldNode ||
+        newPath.valueIsDuplicate() ||
+        oldPath.valueIsDuplicate()) {
+        return true;
+    }
+    if (Printable.check(newNode)) {
+        if (!Printable.check(oldNode)) {
+            return false;
+        }
+        // Here we need to decide whether the reprinted code for newNode is
+        // appropriate for patching into the location of oldNode.
+        if (newNode.type === oldNode.type) {
+            var childReprints = [];
+            if (findChildReprints(newPath, oldPath, childReprints)) {
+                reprints.push.apply(reprints, childReprints);
+            }
+            else if (oldNode.loc) {
+                // If we have no .loc information for oldNode, then we won't be
+                // able to reprint it.
+                reprints.push({
+                    oldPath: oldPath.copy(),
+                    newPath: newPath.copy()
+                });
+            }
+            else {
+                return false;
+            }
+            return true;
+        }
+        if (Expression.check(newNode) &&
+            Expression.check(oldNode) &&
+            // If we have no .loc information for oldNode, then we won't be
+            // able to reprint it.
+            oldNode.loc) {
+            // If both nodes are subtypes of Expression, then we should be able
+            // to fill the location occupied by the old node with code printed
+            // for the new node with no ill consequences.
+            reprints.push({
+                oldPath: oldPath.copy(),
+                newPath: newPath.copy()
+            });
+            return true;
+        }
+        // The nodes have different types, and at least one of the types is
+        // not a subtype of the Expression type, so we cannot safely assume
+        // the nodes are syntactically interchangeable.
+        return false;
+    }
+    return findChildReprints(newPath, oldPath, reprints);
+}
+function findChildReprints(newPath, oldPath, reprints) {
+    var newNode = newPath.getValue();
+    var oldNode = oldPath.getValue();
+    isObject.assert(newNode);
+    isObject.assert(oldNode);
+    if (newNode.original === null) {
+        // If newNode.original node was set to null, reprint the node.
+        return false;
+    }
+    // If this node needs parentheses and will not be wrapped with
+    // parentheses when reprinted, then return false to skip reprinting and
+    // let it be printed generically.
+    if (newPath.needsParens() &&
+        !oldPath.hasParens()) {
+        return false;
+    }
+    var keys = util_1.getUnionOfKeys(oldNode, newNode);
+    if (oldNode.type === "File" ||
+        newNode.type === "File") {
+        // Don't bother traversing file.tokens, an often very large array
+        // returned by Babylon, and useless for our purposes.
+        delete keys.tokens;
+    }
+    // Don't bother traversing .loc objects looking for reprintable nodes.
+    delete keys.loc;
+    var originalReprintCount = reprints.length;
+    for (var k in keys) {
+        if (k.charAt(0) === "_") {
+            // Ignore "private" AST properties added by e.g. Babel plugins and
+            // parsers like Babylon.
+            continue;
+        }
+        newPath.stack.push(k, types.getFieldValue(newNode, k));
+        oldPath.stack.push(k, types.getFieldValue(oldNode, k));
+        var canReprint = findAnyReprints(newPath, oldPath, reprints);
+        newPath.stack.length -= 2;
+        oldPath.stack.length -= 2;
+        if (!canReprint) {
+            return false;
+        }
+    }
+    // Return statements might end up running into ASI issues due to
+    // comments inserted deep within the tree, so reprint them if anything
+    // changed within them.
+    if (ReturnStatement.check(newPath.getNode()) &&
+        reprints.length > originalReprintCount) {
+        return false;
+    }
+    return true;
+}
diff --git a/node_modules/recast/lib/printer.d.ts b/node_modules/recast/lib/printer.d.ts
new file mode 100644
index 0000000..d8e2cfa
--- /dev/null
+++ b/node_modules/recast/lib/printer.d.ts
@@ -0,0 +1,14 @@
+export interface PrintResultType {
+    code: string;
+    map?: any;
+    toString(): string;
+}
+interface PrinterType {
+    print(ast: any): PrintResultType;
+    printGenerically(ast: any): PrintResultType;
+}
+interface PrinterConstructor {
+    new (config?: any): PrinterType;
+}
+declare const Printer: PrinterConstructor;
+export { Printer };
diff --git a/node_modules/recast/lib/printer.js b/node_modules/recast/lib/printer.js
new file mode 100644
index 0000000..0c3d668
--- /dev/null
+++ b/node_modules/recast/lib/printer.js
@@ -0,0 +1,2248 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var comments_1 = require("./comments");
+var lines_1 = require("./lines");
+var options_1 = require("./options");
+var patcher_1 = require("./patcher");
+var types = __importStar(require("ast-types"));
+var namedTypes = types.namedTypes;
+var isString = types.builtInTypes.string;
+var isObject = types.builtInTypes.object;
+var fast_path_1 = __importDefault(require("./fast-path"));
+var util = __importStar(require("./util"));
+var PrintResult = function PrintResult(code, sourceMap) {
+    assert_1.default.ok(this instanceof PrintResult);
+    isString.assert(code);
+    this.code = code;
+    if (sourceMap) {
+        isObject.assert(sourceMap);
+        this.map = sourceMap;
+    }
+};
+var PRp = PrintResult.prototype;
+var warnedAboutToString = false;
+PRp.toString = function () {
+    if (!warnedAboutToString) {
+        console.warn("Deprecation warning: recast.print now returns an object with " +
+            "a .code property. You appear to be treating the object as a " +
+            "string, which might still work but is strongly discouraged.");
+        warnedAboutToString = true;
+    }
+    return this.code;
+};
+var emptyPrintResult = new PrintResult("");
+var Printer = function Printer(config) {
+    assert_1.default.ok(this instanceof Printer);
+    var explicitTabWidth = config && config.tabWidth;
+    config = options_1.normalize(config);
+    // It's common for client code to pass the same options into both
+    // recast.parse and recast.print, but the Printer doesn't need (and
+    // can be confused by) config.sourceFileName, so we null it out.
+    config.sourceFileName = null;
+    // Non-destructively modifies options with overrides, and returns a
+    // new print function that uses the modified options.
+    function makePrintFunctionWith(options, overrides) {
+        options = Object.assign({}, options, overrides);
+        return function (path) {
+            return print(path, options);
+        };
+    }
+    function print(path, options) {
+        assert_1.default.ok(path instanceof fast_path_1.default);
+        options = options || {};
+        if (options.includeComments) {
+            return comments_1.printComments(path, makePrintFunctionWith(options, {
+                includeComments: false
+            }));
+        }
+        var oldTabWidth = config.tabWidth;
+        if (!explicitTabWidth) {
+            var loc = path.getNode().loc;
+            if (loc && loc.lines && loc.lines.guessTabWidth) {
+                config.tabWidth = loc.lines.guessTabWidth();
+            }
+        }
+        var reprinter = patcher_1.getReprinter(path);
+        var lines = reprinter
+            // Since the print function that we pass to the reprinter will
+            // be used to print "new" nodes, it's tempting to think we
+            // should pass printRootGenerically instead of print, to avoid
+            // calling maybeReprint again, but that would be a mistake
+            // because the new nodes might not be entirely new, but merely
+            // moved from elsewhere in the AST. The print function is the
+            // right choice because it gives us the opportunity to reprint
+            // such nodes using their original source.
+            ? reprinter(print)
+            : genericPrint(path, config, options, makePrintFunctionWith(options, {
+                includeComments: true,
+                avoidRootParens: false
+            }));
+        config.tabWidth = oldTabWidth;
+        return lines;
+    }
+    this.print = function (ast) {
+        if (!ast) {
+            return emptyPrintResult;
+        }
+        var lines = print(fast_path_1.default.from(ast), {
+            includeComments: true,
+            avoidRootParens: false
+        });
+        return new PrintResult(lines.toString(config), util.composeSourceMaps(config.inputSourceMap, lines.getSourceMap(config.sourceMapName, config.sourceRoot)));
+    };
+    this.printGenerically = function (ast) {
+        if (!ast) {
+            return emptyPrintResult;
+        }
+        // Print the entire AST generically.
+        function printGenerically(path) {
+            return comments_1.printComments(path, function (path) {
+                return genericPrint(path, config, {
+                    includeComments: true,
+                    avoidRootParens: false
+                }, printGenerically);
+            });
+        }
+        var path = fast_path_1.default.from(ast);
+        var oldReuseWhitespace = config.reuseWhitespace;
+        // Do not reuse whitespace (or anything else, for that matter)
+        // when printing generically.
+        config.reuseWhitespace = false;
+        // TODO Allow printing of comments?
+        var pr = new PrintResult(printGenerically(path).toString(config));
+        config.reuseWhitespace = oldReuseWhitespace;
+        return pr;
+    };
+};
+exports.Printer = Printer;
+function genericPrint(path, config, options, printPath) {
+    assert_1.default.ok(path instanceof fast_path_1.default);
+    var node = path.getValue();
+    var parts = [];
+    var linesWithoutParens = genericPrintNoParens(path, config, printPath);
+    if (!node || linesWithoutParens.isEmpty()) {
+        return linesWithoutParens;
+    }
+    var shouldAddParens = false;
+    var decoratorsLines = printDecorators(path, printPath);
+    if (decoratorsLines.isEmpty()) {
+        // Nodes with decorators can't have parentheses, so we can avoid
+        // computing path.needsParens() except in this case.
+        if (!options.avoidRootParens) {
+            shouldAddParens = path.needsParens();
+        }
+    }
+    else {
+        parts.push(decoratorsLines);
+    }
+    if (shouldAddParens) {
+        parts.unshift("(");
+    }
+    parts.push(linesWithoutParens);
+    if (shouldAddParens) {
+        parts.push(")");
+    }
+    return lines_1.concat(parts);
+}
+// Note that the `options` parameter of this function is what other
+// functions in this file call the `config` object (that is, the
+// configuration object originally passed into the Printer constructor).
+// Its properties are documented in lib/options.js.
+function genericPrintNoParens(path, options, print) {
+    var n = path.getValue();
+    if (!n) {
+        return lines_1.fromString("");
+    }
+    if (typeof n === "string") {
+        return lines_1.fromString(n, options);
+    }
+    namedTypes.Printable.assert(n);
+    var parts = [];
+    switch (n.type) {
+        case "File":
+            return path.call(print, "program");
+        case "Program":
+            // Babel 6
+            if (n.directives) {
+                path.each(function (childPath) {
+                    parts.push(print(childPath), ";\n");
+                }, "directives");
+            }
+            if (n.interpreter) {
+                parts.push(path.call(print, "interpreter"));
+            }
+            parts.push(path.call(function (bodyPath) {
+                return printStatementSequence(bodyPath, options, print);
+            }, "body"));
+            return lines_1.concat(parts);
+        case "Noop": // Babel extension.
+        case "EmptyStatement":
+            return lines_1.fromString("");
+        case "ExpressionStatement":
+            return lines_1.concat([path.call(print, "expression"), ";"]);
+        case "ParenthesizedExpression": // Babel extension.
+            return lines_1.concat(["(", path.call(print, "expression"), ")"]);
+        case "BinaryExpression":
+        case "LogicalExpression":
+        case "AssignmentExpression":
+            return lines_1.fromString(" ").join([
+                path.call(print, "left"),
+                n.operator,
+                path.call(print, "right")
+            ]);
+        case "AssignmentPattern":
+            return lines_1.concat([
+                path.call(print, "left"),
+                " = ",
+                path.call(print, "right")
+            ]);
+        case "MemberExpression":
+        case "OptionalMemberExpression":
+            parts.push(path.call(print, "object"));
+            var property = path.call(print, "property");
+            var optional = n.type === "OptionalMemberExpression" && n.optional;
+            if (n.computed) {
+                parts.push(optional ? "?.[" : "[", property, "]");
+            }
+            else {
+                parts.push(optional ? "?." : ".", property);
+            }
+            return lines_1.concat(parts);
+        case "MetaProperty":
+            return lines_1.concat([
+                path.call(print, "meta"),
+                ".",
+                path.call(print, "property")
+            ]);
+        case "BindExpression":
+            if (n.object) {
+                parts.push(path.call(print, "object"));
+            }
+            parts.push("::", path.call(print, "callee"));
+            return lines_1.concat(parts);
+        case "Path":
+            return lines_1.fromString(".").join(n.body);
+        case "Identifier":
+            return lines_1.concat([
+                lines_1.fromString(n.name, options),
+                n.optional ? "?" : "",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "SpreadElement":
+        case "SpreadElementPattern":
+        case "RestProperty": // Babel 6 for ObjectPattern
+        case "SpreadProperty":
+        case "SpreadPropertyPattern":
+        case "ObjectTypeSpreadProperty":
+        case "RestElement":
+            return lines_1.concat([
+                "...",
+                path.call(print, "argument"),
+                path.call(print, "typeAnnotation")
+            ]);
+        case "FunctionDeclaration":
+        case "FunctionExpression":
+        case "TSDeclareFunction":
+            if (n.declare) {
+                parts.push("declare ");
+            }
+            if (n.async) {
+                parts.push("async ");
+            }
+            parts.push("function");
+            if (n.generator)
+                parts.push("*");
+            if (n.id) {
+                parts.push(" ", path.call(print, "id"), path.call(print, "typeParameters"));
+            }
+            else {
+                if (n.typeParameters) {
+                    parts.push(path.call(print, "typeParameters"));
+                }
+            }
+            parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+            if (n.body) {
+                parts.push(" ", path.call(print, "body"));
+            }
+            return lines_1.concat(parts);
+        case "ArrowFunctionExpression":
+            if (n.async) {
+                parts.push("async ");
+            }
+            if (n.typeParameters) {
+                parts.push(path.call(print, "typeParameters"));
+            }
+            if (!options.arrowParensAlways &&
+                n.params.length === 1 &&
+                !n.rest &&
+                n.params[0].type === 'Identifier' &&
+                !n.params[0].typeAnnotation &&
+                !n.returnType) {
+                parts.push(path.call(print, "params", 0));
+            }
+            else {
+                parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+            }
+            parts.push(" => ", path.call(print, "body"));
+            return lines_1.concat(parts);
+        case "MethodDefinition":
+            return printMethod(path, options, print);
+        case "YieldExpression":
+            parts.push("yield");
+            if (n.delegate)
+                parts.push("*");
+            if (n.argument)
+                parts.push(" ", path.call(print, "argument"));
+            return lines_1.concat(parts);
+        case "AwaitExpression":
+            parts.push("await");
+            if (n.all)
+                parts.push("*");
+            if (n.argument)
+                parts.push(" ", path.call(print, "argument"));
+            return lines_1.concat(parts);
+        case "ModuleDeclaration":
+            parts.push("module", path.call(print, "id"));
+            if (n.source) {
+                assert_1.default.ok(!n.body);
+                parts.push("from", path.call(print, "source"));
+            }
+            else {
+                parts.push(path.call(print, "body"));
+            }
+            return lines_1.fromString(" ").join(parts);
+        case "ImportSpecifier":
+            if (n.importKind && n.importKind !== "value") {
+                parts.push(n.importKind + " ");
+            }
+            if (n.imported) {
+                parts.push(path.call(print, "imported"));
+                if (n.local &&
+                    n.local.name !== n.imported.name) {
+                    parts.push(" as ", path.call(print, "local"));
+                }
+            }
+            else if (n.id) {
+                parts.push(path.call(print, "id"));
+                if (n.name) {
+                    parts.push(" as ", path.call(print, "name"));
+                }
+            }
+            return lines_1.concat(parts);
+        case "ExportSpecifier":
+            if (n.local) {
+                parts.push(path.call(print, "local"));
+                if (n.exported &&
+                    n.exported.name !== n.local.name) {
+                    parts.push(" as ", path.call(print, "exported"));
+                }
+            }
+            else if (n.id) {
+                parts.push(path.call(print, "id"));
+                if (n.name) {
+                    parts.push(" as ", path.call(print, "name"));
+                }
+            }
+            return lines_1.concat(parts);
+        case "ExportBatchSpecifier":
+            return lines_1.fromString("*");
+        case "ImportNamespaceSpecifier":
+            parts.push("* as ");
+            if (n.local) {
+                parts.push(path.call(print, "local"));
+            }
+            else if (n.id) {
+                parts.push(path.call(print, "id"));
+            }
+            return lines_1.concat(parts);
+        case "ImportDefaultSpecifier":
+            if (n.local) {
+                return path.call(print, "local");
+            }
+            return path.call(print, "id");
+        case "TSExportAssignment":
+            return lines_1.concat(["export = ", path.call(print, "expression")]);
+        case "ExportDeclaration":
+        case "ExportDefaultDeclaration":
+        case "ExportNamedDeclaration":
+            return printExportDeclaration(path, options, print);
+        case "ExportAllDeclaration":
+            parts.push("export *");
+            if (n.exported) {
+                parts.push(" as ", path.call(print, "exported"));
+            }
+            parts.push(" from ", path.call(print, "source"), ";");
+            return lines_1.concat(parts);
+        case "TSNamespaceExportDeclaration":
+            parts.push("export as namespace ", path.call(print, "id"));
+            return maybeAddSemicolon(lines_1.concat(parts));
+        case "ExportNamespaceSpecifier":
+            return lines_1.concat(["* as ", path.call(print, "exported")]);
+        case "ExportDefaultSpecifier":
+            return path.call(print, "exported");
+        case "Import":
+            return lines_1.fromString("import", options);
+        case "ImportDeclaration": {
+            parts.push("import ");
+            if (n.importKind && n.importKind !== "value") {
+                parts.push(n.importKind + " ");
+            }
+            if (n.specifiers &&
+                n.specifiers.length > 0) {
+                var unbracedSpecifiers_1 = [];
+                var bracedSpecifiers_1 = [];
+                path.each(function (specifierPath) {
+                    var spec = specifierPath.getValue();
+                    if (spec.type === "ImportSpecifier") {
+                        bracedSpecifiers_1.push(print(specifierPath));
+                    }
+                    else if (spec.type === "ImportDefaultSpecifier" ||
+                        spec.type === "ImportNamespaceSpecifier") {
+                        unbracedSpecifiers_1.push(print(specifierPath));
+                    }
+                }, "specifiers");
+                unbracedSpecifiers_1.forEach(function (lines, i) {
+                    if (i > 0) {
+                        parts.push(", ");
+                    }
+                    parts.push(lines);
+                });
+                if (bracedSpecifiers_1.length > 0) {
+                    var lines_2 = lines_1.fromString(", ").join(bracedSpecifiers_1);
+                    if (lines_2.getLineLength(1) > options.wrapColumn) {
+                        lines_2 = lines_1.concat([
+                            lines_1.fromString(",\n").join(bracedSpecifiers_1).indent(options.tabWidth),
+                            ","
+                        ]);
+                    }
+                    if (unbracedSpecifiers_1.length > 0) {
+                        parts.push(", ");
+                    }
+                    if (lines_2.length > 1) {
+                        parts.push("{\n", lines_2, "\n}");
+                    }
+                    else if (options.objectCurlySpacing) {
+                        parts.push("{ ", lines_2, " }");
+                    }
+                    else {
+                        parts.push("{", lines_2, "}");
+                    }
+                }
+                parts.push(" from ");
+            }
+            parts.push(path.call(print, "source"), ";");
+            return lines_1.concat(parts);
+        }
+        case "BlockStatement":
+            var naked = path.call(function (bodyPath) {
+                return printStatementSequence(bodyPath, options, print);
+            }, "body");
+            if (naked.isEmpty()) {
+                if (!n.directives || n.directives.length === 0) {
+                    return lines_1.fromString("{}");
+                }
+            }
+            parts.push("{\n");
+            // Babel 6
+            if (n.directives) {
+                path.each(function (childPath) {
+                    parts.push(print(childPath).indent(options.tabWidth), ";", n.directives.length > 1 || !naked.isEmpty() ? "\n" : "");
+                }, "directives");
+            }
+            parts.push(naked.indent(options.tabWidth));
+            parts.push("\n}");
+            return lines_1.concat(parts);
+        case "ReturnStatement":
+            parts.push("return");
+            if (n.argument) {
+                var argLines = path.call(print, "argument");
+                if (argLines.startsWithComment() ||
+                    (argLines.length > 1 &&
+                        namedTypes.JSXElement &&
+                        namedTypes.JSXElement.check(n.argument))) {
+                    parts.push(" (\n", argLines.indent(options.tabWidth), "\n)");
+                }
+                else {
+                    parts.push(" ", argLines);
+                }
+            }
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "CallExpression":
+        case "OptionalCallExpression":
+            parts.push(path.call(print, "callee"));
+            if (n.typeParameters) {
+                parts.push(path.call(print, "typeParameters"));
+            }
+            if (n.typeArguments) {
+                parts.push(path.call(print, "typeArguments"));
+            }
+            if (n.type === "OptionalCallExpression" &&
+                n.callee.type !== "OptionalMemberExpression") {
+                parts.push("?.");
+            }
+            parts.push(printArgumentsList(path, options, print));
+            return lines_1.concat(parts);
+        case "ObjectExpression":
+        case "ObjectPattern":
+        case "ObjectTypeAnnotation":
+            var allowBreak = false;
+            var isTypeAnnotation = n.type === "ObjectTypeAnnotation";
+            var separator = options.flowObjectCommas ? "," : (isTypeAnnotation ? ";" : ",");
+            var fields = [];
+            if (isTypeAnnotation) {
+                fields.push("indexers", "callProperties");
+                if (n.internalSlots != null) {
+                    fields.push("internalSlots");
+                }
+            }
+            fields.push("properties");
+            var len = 0;
+            fields.forEach(function (field) {
+                len += n[field].length;
+            });
+            var oneLine = (isTypeAnnotation && len === 1) || len === 0;
+            var leftBrace = n.exact ? "{|" : "{";
+            var rightBrace = n.exact ? "|}" : "}";
+            parts.push(oneLine ? leftBrace : leftBrace + "\n");
+            var leftBraceIndex = parts.length - 1;
+            var i = 0;
+            fields.forEach(function (field) {
+                path.each(function (childPath) {
+                    var lines = print(childPath);
+                    if (!oneLine) {
+                        lines = lines.indent(options.tabWidth);
+                    }
+                    var multiLine = !isTypeAnnotation && lines.length > 1;
+                    if (multiLine && allowBreak) {
+                        // Similar to the logic for BlockStatement.
+                        parts.push("\n");
+                    }
+                    parts.push(lines);
+                    if (i < len - 1) {
+                        // Add an extra line break if the previous object property
+                        // had a multi-line value.
+                        parts.push(separator + (multiLine ? "\n\n" : "\n"));
+                        allowBreak = !multiLine;
+                    }
+                    else if (len !== 1 && isTypeAnnotation) {
+                        parts.push(separator);
+                    }
+                    else if (!oneLine && util.isTrailingCommaEnabled(options, "objects")) {
+                        parts.push(separator);
+                    }
+                    i++;
+                }, field);
+            });
+            if (n.inexact) {
+                var line = lines_1.fromString("...", options);
+                if (oneLine) {
+                    if (len > 0) {
+                        parts.push(separator, " ");
+                    }
+                    parts.push(line);
+                }
+                else {
+                    // No trailing separator after ... to maintain parity with prettier.
+                    parts.push("\n", line.indent(options.tabWidth));
+                }
+            }
+            parts.push(oneLine ? rightBrace : "\n" + rightBrace);
+            if (i !== 0 && oneLine && options.objectCurlySpacing) {
+                parts[leftBraceIndex] = leftBrace + " ";
+                parts[parts.length - 1] = " " + rightBrace;
+            }
+            if (n.typeAnnotation) {
+                parts.push(path.call(print, "typeAnnotation"));
+            }
+            return lines_1.concat(parts);
+        case "PropertyPattern":
+            return lines_1.concat([
+                path.call(print, "key"),
+                ": ",
+                path.call(print, "pattern")
+            ]);
+        case "ObjectProperty": // Babel 6
+        case "Property": // Non-standard AST node type.
+            if (n.method || n.kind === "get" || n.kind === "set") {
+                return printMethod(path, options, print);
+            }
+            var key = path.call(print, "key");
+            if (n.computed) {
+                parts.push("[", key, "]");
+            }
+            else {
+                parts.push(key);
+            }
+            if (!n.shorthand) {
+                parts.push(": ", path.call(print, "value"));
+            }
+            return lines_1.concat(parts);
+        case "ClassMethod": // Babel 6
+        case "ObjectMethod": // Babel 6
+        case "ClassPrivateMethod":
+        case "TSDeclareMethod":
+            return printMethod(path, options, print);
+        case "PrivateName":
+            return lines_1.concat(["#", path.call(print, "id")]);
+        case "Decorator":
+            return lines_1.concat(["@", path.call(print, "expression")]);
+        case "ArrayExpression":
+        case "ArrayPattern":
+            var elems = n.elements, len = elems.length;
+            var printed = path.map(print, "elements");
+            var joined = lines_1.fromString(", ").join(printed);
+            var oneLine = joined.getLineLength(1) <= options.wrapColumn;
+            if (oneLine) {
+                if (options.arrayBracketSpacing) {
+                    parts.push("[ ");
+                }
+                else {
+                    parts.push("[");
+                }
+            }
+            else {
+                parts.push("[\n");
+            }
+            path.each(function (elemPath) {
+                var i = elemPath.getName();
+                var elem = elemPath.getValue();
+                if (!elem) {
+                    // If the array expression ends with a hole, that hole
+                    // will be ignored by the interpreter, but if it ends with
+                    // two (or more) holes, we need to write out two (or more)
+                    // commas so that the resulting code is interpreted with
+                    // both (all) of the holes.
+                    parts.push(",");
+                }
+                else {
+                    var lines = printed[i];
+                    if (oneLine) {
+                        if (i > 0)
+                            parts.push(" ");
+                    }
+                    else {
+                        lines = lines.indent(options.tabWidth);
+                    }
+                    parts.push(lines);
+                    if (i < len - 1 || (!oneLine && util.isTrailingCommaEnabled(options, "arrays")))
+                        parts.push(",");
+                    if (!oneLine)
+                        parts.push("\n");
+                }
+            }, "elements");
+            if (oneLine && options.arrayBracketSpacing) {
+                parts.push(" ]");
+            }
+            else {
+                parts.push("]");
+            }
+            return lines_1.concat(parts);
+        case "SequenceExpression":
+            return lines_1.fromString(", ").join(path.map(print, "expressions"));
+        case "ThisExpression":
+            return lines_1.fromString("this");
+        case "Super":
+            return lines_1.fromString("super");
+        case "NullLiteral": // Babel 6 Literal split
+            return lines_1.fromString("null");
+        case "RegExpLiteral": // Babel 6 Literal split
+            return lines_1.fromString(n.extra.raw);
+        case "BigIntLiteral": // Babel 7 Literal split
+            return lines_1.fromString(n.value + "n");
+        case "NumericLiteral": // Babel 6 Literal Split
+            // Keep original representation for numeric values not in base 10.
+            if (n.extra &&
+                typeof n.extra.raw === "string" &&
+                Number(n.extra.raw) === n.value) {
+                return lines_1.fromString(n.extra.raw, options);
+            }
+            return lines_1.fromString(n.value, options);
+        case "BooleanLiteral": // Babel 6 Literal split
+        case "StringLiteral": // Babel 6 Literal split
+        case "Literal":
+            // Numeric values may be in bases other than 10. Use their raw
+            // representation if equivalent.
+            if (typeof n.value === "number" &&
+                typeof n.raw === "string" &&
+                Number(n.raw) === n.value) {
+                return lines_1.fromString(n.raw, options);
+            }
+            if (typeof n.value !== "string") {
+                return lines_1.fromString(n.value, options);
+            }
+            return lines_1.fromString(nodeStr(n.value, options), options);
+        case "Directive": // Babel 6
+            return path.call(print, "value");
+        case "DirectiveLiteral": // Babel 6
+            return lines_1.fromString(nodeStr(n.value, options));
+        case "InterpreterDirective":
+            return lines_1.fromString("#!" + n.value + "\n", options);
+        case "ModuleSpecifier":
+            if (n.local) {
+                throw new Error("The ESTree ModuleSpecifier type should be abstract");
+            }
+            // The Esprima ModuleSpecifier type is just a string-valued
+            // Literal identifying the imported-from module.
+            return lines_1.fromString(nodeStr(n.value, options), options);
+        case "UnaryExpression":
+            parts.push(n.operator);
+            if (/[a-z]$/.test(n.operator))
+                parts.push(" ");
+            parts.push(path.call(print, "argument"));
+            return lines_1.concat(parts);
+        case "UpdateExpression":
+            parts.push(path.call(print, "argument"), n.operator);
+            if (n.prefix)
+                parts.reverse();
+            return lines_1.concat(parts);
+        case "ConditionalExpression":
+            return lines_1.concat([
+                path.call(print, "test"),
+                " ? ", path.call(print, "consequent"),
+                " : ", path.call(print, "alternate")
+            ]);
+        case "NewExpression":
+            parts.push("new ", path.call(print, "callee"));
+            if (n.typeParameters) {
+                parts.push(path.call(print, "typeParameters"));
+            }
+            if (n.typeArguments) {
+                parts.push(path.call(print, "typeArguments"));
+            }
+            var args = n.arguments;
+            if (args) {
+                parts.push(printArgumentsList(path, options, print));
+            }
+            return lines_1.concat(parts);
+        case "VariableDeclaration":
+            if (n.declare) {
+                parts.push("declare ");
+            }
+            parts.push(n.kind, " ");
+            var maxLen = 0;
+            var printed = path.map(function (childPath) {
+                var lines = print(childPath);
+                maxLen = Math.max(lines.length, maxLen);
+                return lines;
+            }, "declarations");
+            if (maxLen === 1) {
+                parts.push(lines_1.fromString(", ").join(printed));
+            }
+            else if (printed.length > 1) {
+                parts.push(lines_1.fromString(",\n").join(printed)
+                    .indentTail(n.kind.length + 1));
+            }
+            else {
+                parts.push(printed[0]);
+            }
+            // We generally want to terminate all variable declarations with a
+            // semicolon, except when they are children of for loops.
+            var parentNode = path.getParentNode();
+            if (!namedTypes.ForStatement.check(parentNode) &&
+                !namedTypes.ForInStatement.check(parentNode) &&
+                !(namedTypes.ForOfStatement &&
+                    namedTypes.ForOfStatement.check(parentNode)) &&
+                !(namedTypes.ForAwaitStatement &&
+                    namedTypes.ForAwaitStatement.check(parentNode))) {
+                parts.push(";");
+            }
+            return lines_1.concat(parts);
+        case "VariableDeclarator":
+            return n.init ? lines_1.fromString(" = ").join([
+                path.call(print, "id"),
+                path.call(print, "init")
+            ]) : path.call(print, "id");
+        case "WithStatement":
+            return lines_1.concat([
+                "with (",
+                path.call(print, "object"),
+                ") ",
+                path.call(print, "body")
+            ]);
+        case "IfStatement":
+            var con = adjustClause(path.call(print, "consequent"), options);
+            parts.push("if (", path.call(print, "test"), ")", con);
+            if (n.alternate)
+                parts.push(endsWithBrace(con) ? " else" : "\nelse", adjustClause(path.call(print, "alternate"), options));
+            return lines_1.concat(parts);
+        case "ForStatement":
+            // TODO Get the for (;;) case right.
+            var init = path.call(print, "init"), sep = init.length > 1 ? ";\n" : "; ", forParen = "for (", indented = lines_1.fromString(sep).join([
+                init,
+                path.call(print, "test"),
+                path.call(print, "update")
+            ]).indentTail(forParen.length), head = lines_1.concat([forParen, indented, ")"]), clause = adjustClause(path.call(print, "body"), options);
+            parts.push(head);
+            if (head.length > 1) {
+                parts.push("\n");
+                clause = clause.trimLeft();
+            }
+            parts.push(clause);
+            return lines_1.concat(parts);
+        case "WhileStatement":
+            return lines_1.concat([
+                "while (",
+                path.call(print, "test"),
+                ")",
+                adjustClause(path.call(print, "body"), options)
+            ]);
+        case "ForInStatement":
+            // Note: esprima can't actually parse "for each (".
+            return lines_1.concat([
+                n.each ? "for each (" : "for (",
+                path.call(print, "left"),
+                " in ",
+                path.call(print, "right"),
+                ")",
+                adjustClause(path.call(print, "body"), options)
+            ]);
+        case "ForOfStatement":
+        case "ForAwaitStatement":
+            parts.push("for ");
+            if (n.await || n.type === "ForAwaitStatement") {
+                parts.push("await ");
+            }
+            parts.push("(", path.call(print, "left"), " of ", path.call(print, "right"), ")", adjustClause(path.call(print, "body"), options));
+            return lines_1.concat(parts);
+        case "DoWhileStatement":
+            var doBody = lines_1.concat([
+                "do",
+                adjustClause(path.call(print, "body"), options)
+            ]);
+            parts.push(doBody);
+            if (endsWithBrace(doBody))
+                parts.push(" while");
+            else
+                parts.push("\nwhile");
+            parts.push(" (", path.call(print, "test"), ");");
+            return lines_1.concat(parts);
+        case "DoExpression":
+            var statements = path.call(function (bodyPath) {
+                return printStatementSequence(bodyPath, options, print);
+            }, "body");
+            return lines_1.concat([
+                "do {\n",
+                statements.indent(options.tabWidth),
+                "\n}"
+            ]);
+        case "BreakStatement":
+            parts.push("break");
+            if (n.label)
+                parts.push(" ", path.call(print, "label"));
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "ContinueStatement":
+            parts.push("continue");
+            if (n.label)
+                parts.push(" ", path.call(print, "label"));
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "LabeledStatement":
+            return lines_1.concat([
+                path.call(print, "label"),
+                ":\n",
+                path.call(print, "body")
+            ]);
+        case "TryStatement":
+            parts.push("try ", path.call(print, "block"));
+            if (n.handler) {
+                parts.push(" ", path.call(print, "handler"));
+            }
+            else if (n.handlers) {
+                path.each(function (handlerPath) {
+                    parts.push(" ", print(handlerPath));
+                }, "handlers");
+            }
+            if (n.finalizer) {
+                parts.push(" finally ", path.call(print, "finalizer"));
+            }
+            return lines_1.concat(parts);
+        case "CatchClause":
+            parts.push("catch ");
+            if (n.param) {
+                parts.push("(", path.call(print, "param"));
+            }
+            if (n.guard) {
+                // Note: esprima does not recognize conditional catch clauses.
+                parts.push(" if ", path.call(print, "guard"));
+            }
+            if (n.param) {
+                parts.push(") ");
+            }
+            parts.push(path.call(print, "body"));
+            return lines_1.concat(parts);
+        case "ThrowStatement":
+            return lines_1.concat(["throw ", path.call(print, "argument"), ";"]);
+        case "SwitchStatement":
+            return lines_1.concat([
+                "switch (",
+                path.call(print, "discriminant"),
+                ") {\n",
+                lines_1.fromString("\n").join(path.map(print, "cases")),
+                "\n}"
+            ]);
+        // Note: ignoring n.lexical because it has no printing consequences.
+        case "SwitchCase":
+            if (n.test)
+                parts.push("case ", path.call(print, "test"), ":");
+            else
+                parts.push("default:");
+            if (n.consequent.length > 0) {
+                parts.push("\n", path.call(function (consequentPath) {
+                    return printStatementSequence(consequentPath, options, print);
+                }, "consequent").indent(options.tabWidth));
+            }
+            return lines_1.concat(parts);
+        case "DebuggerStatement":
+            return lines_1.fromString("debugger;");
+        // JSX extensions below.
+        case "JSXAttribute":
+            parts.push(path.call(print, "name"));
+            if (n.value)
+                parts.push("=", path.call(print, "value"));
+            return lines_1.concat(parts);
+        case "JSXIdentifier":
+            return lines_1.fromString(n.name, options);
+        case "JSXNamespacedName":
+            return lines_1.fromString(":").join([
+                path.call(print, "namespace"),
+                path.call(print, "name")
+            ]);
+        case "JSXMemberExpression":
+            return lines_1.fromString(".").join([
+                path.call(print, "object"),
+                path.call(print, "property")
+            ]);
+        case "JSXSpreadAttribute":
+            return lines_1.concat(["{...", path.call(print, "argument"), "}"]);
+        case "JSXSpreadChild":
+            return lines_1.concat(["{...", path.call(print, "expression"), "}"]);
+        case "JSXExpressionContainer":
+            return lines_1.concat(["{", path.call(print, "expression"), "}"]);
+        case "JSXElement":
+        case "JSXFragment":
+            var openingPropName = "opening" + (n.type === "JSXElement" ? "Element" : "Fragment");
+            var closingPropName = "closing" + (n.type === "JSXElement" ? "Element" : "Fragment");
+            var openingLines = path.call(print, openingPropName);
+            if (n[openingPropName].selfClosing) {
+                assert_1.default.ok(!n[closingPropName], "unexpected " + closingPropName + " element in self-closing " + n.type);
+                return openingLines;
+            }
+            var childLines = lines_1.concat(path.map(function (childPath) {
+                var child = childPath.getValue();
+                if (namedTypes.Literal.check(child) &&
+                    typeof child.value === "string") {
+                    if (/\S/.test(child.value)) {
+                        return child.value.replace(/^\s+|\s+$/g, "");
+                    }
+                    else if (/\n/.test(child.value)) {
+                        return "\n";
+                    }
+                }
+                return print(childPath);
+            }, "children")).indentTail(options.tabWidth);
+            var closingLines = path.call(print, closingPropName);
+            return lines_1.concat([
+                openingLines,
+                childLines,
+                closingLines
+            ]);
+        case "JSXOpeningElement":
+            parts.push("<", path.call(print, "name"));
+            var attrParts = [];
+            path.each(function (attrPath) {
+                attrParts.push(" ", print(attrPath));
+            }, "attributes");
+            var attrLines = lines_1.concat(attrParts);
+            var needLineWrap = (attrLines.length > 1 ||
+                attrLines.getLineLength(1) > options.wrapColumn);
+            if (needLineWrap) {
+                attrParts.forEach(function (part, i) {
+                    if (part === " ") {
+                        assert_1.default.strictEqual(i % 2, 0);
+                        attrParts[i] = "\n";
+                    }
+                });
+                attrLines = lines_1.concat(attrParts).indentTail(options.tabWidth);
+            }
+            parts.push(attrLines, n.selfClosing ? " />" : ">");
+            return lines_1.concat(parts);
+        case "JSXClosingElement":
+            return lines_1.concat(["</", path.call(print, "name"), ">"]);
+        case "JSXOpeningFragment":
+            return lines_1.fromString("<>");
+        case "JSXClosingFragment":
+            return lines_1.fromString("</>");
+        case "JSXText":
+            return lines_1.fromString(n.value, options);
+        case "JSXEmptyExpression":
+            return lines_1.fromString("");
+        case "TypeAnnotatedIdentifier":
+            return lines_1.concat([
+                path.call(print, "annotation"),
+                " ",
+                path.call(print, "identifier")
+            ]);
+        case "ClassBody":
+            if (n.body.length === 0) {
+                return lines_1.fromString("{}");
+            }
+            return lines_1.concat([
+                "{\n",
+                path.call(function (bodyPath) {
+                    return printStatementSequence(bodyPath, options, print);
+                }, "body").indent(options.tabWidth),
+                "\n}"
+            ]);
+        case "ClassPropertyDefinition":
+            parts.push("static ", path.call(print, "definition"));
+            if (!namedTypes.MethodDefinition.check(n.definition))
+                parts.push(";");
+            return lines_1.concat(parts);
+        case "ClassProperty":
+            var access = n.accessibility || n.access;
+            if (typeof access === "string") {
+                parts.push(access, " ");
+            }
+            if (n.static) {
+                parts.push("static ");
+            }
+            if (n.abstract) {
+                parts.push("abstract ");
+            }
+            if (n.readonly) {
+                parts.push("readonly ");
+            }
+            var key = path.call(print, "key");
+            if (n.computed) {
+                key = lines_1.concat(["[", key, "]"]);
+            }
+            if (n.variance) {
+                key = lines_1.concat([printVariance(path, print), key]);
+            }
+            parts.push(key);
+            if (n.optional) {
+                parts.push("?");
+            }
+            if (n.typeAnnotation) {
+                parts.push(path.call(print, "typeAnnotation"));
+            }
+            if (n.value) {
+                parts.push(" = ", path.call(print, "value"));
+            }
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "ClassPrivateProperty":
+            if (n.static) {
+                parts.push("static ");
+            }
+            parts.push(path.call(print, "key"));
+            if (n.typeAnnotation) {
+                parts.push(path.call(print, "typeAnnotation"));
+            }
+            if (n.value) {
+                parts.push(" = ", path.call(print, "value"));
+            }
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "ClassDeclaration":
+        case "ClassExpression":
+            if (n.declare) {
+                parts.push("declare ");
+            }
+            if (n.abstract) {
+                parts.push("abstract ");
+            }
+            parts.push("class");
+            if (n.id) {
+                parts.push(" ", path.call(print, "id"));
+            }
+            if (n.typeParameters) {
+                parts.push(path.call(print, "typeParameters"));
+            }
+            if (n.superClass) {
+                parts.push(" extends ", path.call(print, "superClass"), path.call(print, "superTypeParameters"));
+            }
+            if (n["implements"] && n['implements'].length > 0) {
+                parts.push(" implements ", lines_1.fromString(", ").join(path.map(print, "implements")));
+            }
+            parts.push(" ", path.call(print, "body"));
+            return lines_1.concat(parts);
+        case "TemplateElement":
+            return lines_1.fromString(n.value.raw, options).lockIndentTail();
+        case "TemplateLiteral":
+            var expressions = path.map(print, "expressions");
+            parts.push("`");
+            path.each(function (childPath) {
+                var i = childPath.getName();
+                parts.push(print(childPath));
+                if (i < expressions.length) {
+                    parts.push("${", expressions[i], "}");
+                }
+            }, "quasis");
+            parts.push("`");
+            return lines_1.concat(parts).lockIndentTail();
+        case "TaggedTemplateExpression":
+            return lines_1.concat([
+                path.call(print, "tag"),
+                path.call(print, "quasi")
+            ]);
+        // These types are unprintable because they serve as abstract
+        // supertypes for other (printable) types.
+        case "Node":
+        case "Printable":
+        case "SourceLocation":
+        case "Position":
+        case "Statement":
+        case "Function":
+        case "Pattern":
+        case "Expression":
+        case "Declaration":
+        case "Specifier":
+        case "NamedSpecifier":
+        case "Comment": // Supertype of Block and Line
+        case "Flow": // Supertype of all Flow AST node types
+        case "FlowType": // Supertype of all Flow types
+        case "FlowPredicate": // Supertype of InferredPredicate and DeclaredPredicate
+        case "MemberTypeAnnotation": // Flow
+        case "Type": // Flow
+        case "TSHasOptionalTypeParameterInstantiation":
+        case "TSHasOptionalTypeParameters":
+        case "TSHasOptionalTypeAnnotation":
+            throw new Error("unprintable type: " + JSON.stringify(n.type));
+        case "CommentBlock": // Babel block comment.
+        case "Block": // Esprima block comment.
+            return lines_1.concat(["/*", lines_1.fromString(n.value, options), "*/"]);
+        case "CommentLine": // Babel line comment.
+        case "Line": // Esprima line comment.
+            return lines_1.concat(["//", lines_1.fromString(n.value, options)]);
+        // Type Annotations for Facebook Flow, typically stripped out or
+        // transformed away before printing.
+        case "TypeAnnotation":
+            if (n.typeAnnotation) {
+                if (n.typeAnnotation.type !== "FunctionTypeAnnotation") {
+                    parts.push(": ");
+                }
+                parts.push(path.call(print, "typeAnnotation"));
+                return lines_1.concat(parts);
+            }
+            return lines_1.fromString("");
+        case "ExistentialTypeParam":
+        case "ExistsTypeAnnotation":
+            return lines_1.fromString("*", options);
+        case "EmptyTypeAnnotation":
+            return lines_1.fromString("empty", options);
+        case "AnyTypeAnnotation":
+            return lines_1.fromString("any", options);
+        case "MixedTypeAnnotation":
+            return lines_1.fromString("mixed", options);
+        case "ArrayTypeAnnotation":
+            return lines_1.concat([
+                path.call(print, "elementType"),
+                "[]"
+            ]);
+        case "TupleTypeAnnotation":
+            var printed = path.map(print, "types");
+            var joined = lines_1.fromString(", ").join(printed);
+            var oneLine = joined.getLineLength(1) <= options.wrapColumn;
+            if (oneLine) {
+                if (options.arrayBracketSpacing) {
+                    parts.push("[ ");
+                }
+                else {
+                    parts.push("[");
+                }
+            }
+            else {
+                parts.push("[\n");
+            }
+            path.each(function (elemPath) {
+                var i = elemPath.getName();
+                var elem = elemPath.getValue();
+                if (!elem) {
+                    // If the array expression ends with a hole, that hole
+                    // will be ignored by the interpreter, but if it ends with
+                    // two (or more) holes, we need to write out two (or more)
+                    // commas so that the resulting code is interpreted with
+                    // both (all) of the holes.
+                    parts.push(",");
+                }
+                else {
+                    var lines = printed[i];
+                    if (oneLine) {
+                        if (i > 0)
+                            parts.push(" ");
+                    }
+                    else {
+                        lines = lines.indent(options.tabWidth);
+                    }
+                    parts.push(lines);
+                    if (i < n.types.length - 1 || (!oneLine && util.isTrailingCommaEnabled(options, "arrays")))
+                        parts.push(",");
+                    if (!oneLine)
+                        parts.push("\n");
+                }
+            }, "types");
+            if (oneLine && options.arrayBracketSpacing) {
+                parts.push(" ]");
+            }
+            else {
+                parts.push("]");
+            }
+            return lines_1.concat(parts);
+        case "BooleanTypeAnnotation":
+            return lines_1.fromString("boolean", options);
+        case "BooleanLiteralTypeAnnotation":
+            assert_1.default.strictEqual(typeof n.value, "boolean");
+            return lines_1.fromString("" + n.value, options);
+        case "InterfaceTypeAnnotation":
+            parts.push("interface");
+            if (n.extends && n.extends.length > 0) {
+                parts.push(" extends ", lines_1.fromString(", ").join(path.map(print, "extends")));
+            }
+            parts.push(" ", path.call(print, "body"));
+            return lines_1.concat(parts);
+        case "DeclareClass":
+            return printFlowDeclaration(path, [
+                "class ",
+                path.call(print, "id"),
+                " ",
+                path.call(print, "body"),
+            ]);
+        case "DeclareFunction":
+            return printFlowDeclaration(path, [
+                "function ",
+                path.call(print, "id"),
+                ";"
+            ]);
+        case "DeclareModule":
+            return printFlowDeclaration(path, [
+                "module ",
+                path.call(print, "id"),
+                " ",
+                path.call(print, "body"),
+            ]);
+        case "DeclareModuleExports":
+            return printFlowDeclaration(path, [
+                "module.exports",
+                path.call(print, "typeAnnotation"),
+            ]);
+        case "DeclareVariable":
+            return printFlowDeclaration(path, [
+                "var ",
+                path.call(print, "id"),
+                ";"
+            ]);
+        case "DeclareExportDeclaration":
+        case "DeclareExportAllDeclaration":
+            return lines_1.concat([
+                "declare ",
+                printExportDeclaration(path, options, print)
+            ]);
+        case "InferredPredicate":
+            return lines_1.fromString("%checks", options);
+        case "DeclaredPredicate":
+            return lines_1.concat([
+                "%checks(",
+                path.call(print, "value"),
+                ")"
+            ]);
+        case "FunctionTypeAnnotation":
+            // FunctionTypeAnnotation is ambiguous:
+            // declare function(a: B): void; OR
+            // var A: (a: B) => void;
+            var parent = path.getParentNode(0);
+            var isArrowFunctionTypeAnnotation = !(namedTypes.ObjectTypeCallProperty.check(parent) ||
+                (namedTypes.ObjectTypeInternalSlot.check(parent) && parent.method) ||
+                namedTypes.DeclareFunction.check(path.getParentNode(2)));
+            var needsColon = isArrowFunctionTypeAnnotation &&
+                !namedTypes.FunctionTypeParam.check(parent);
+            if (needsColon) {
+                parts.push(": ");
+            }
+            parts.push("(", printFunctionParams(path, options, print), ")");
+            // The returnType is not wrapped in a TypeAnnotation, so the colon
+            // needs to be added separately.
+            if (n.returnType) {
+                parts.push(isArrowFunctionTypeAnnotation ? " => " : ": ", path.call(print, "returnType"));
+            }
+            return lines_1.concat(parts);
+        case "FunctionTypeParam":
+            return lines_1.concat([
+                path.call(print, "name"),
+                n.optional ? '?' : '',
+                ": ",
+                path.call(print, "typeAnnotation"),
+            ]);
+        case "GenericTypeAnnotation":
+            return lines_1.concat([
+                path.call(print, "id"),
+                path.call(print, "typeParameters")
+            ]);
+        case "DeclareInterface":
+            parts.push("declare ");
+        // Fall through to InterfaceDeclaration...
+        case "InterfaceDeclaration":
+        case "TSInterfaceDeclaration":
+            if (n.declare) {
+                parts.push("declare ");
+            }
+            parts.push("interface ", path.call(print, "id"), path.call(print, "typeParameters"), " ");
+            if (n["extends"] && n["extends"].length > 0) {
+                parts.push("extends ", lines_1.fromString(", ").join(path.map(print, "extends")), " ");
+            }
+            if (n.body) {
+                parts.push(path.call(print, "body"));
+            }
+            return lines_1.concat(parts);
+        case "ClassImplements":
+        case "InterfaceExtends":
+            return lines_1.concat([
+                path.call(print, "id"),
+                path.call(print, "typeParameters")
+            ]);
+        case "IntersectionTypeAnnotation":
+            return lines_1.fromString(" & ").join(path.map(print, "types"));
+        case "NullableTypeAnnotation":
+            return lines_1.concat([
+                "?",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "NullLiteralTypeAnnotation":
+            return lines_1.fromString("null", options);
+        case "ThisTypeAnnotation":
+            return lines_1.fromString("this", options);
+        case "NumberTypeAnnotation":
+            return lines_1.fromString("number", options);
+        case "ObjectTypeCallProperty":
+            return path.call(print, "value");
+        case "ObjectTypeIndexer":
+            return lines_1.concat([
+                printVariance(path, print),
+                "[",
+                path.call(print, "id"),
+                ": ",
+                path.call(print, "key"),
+                "]: ",
+                path.call(print, "value")
+            ]);
+        case "ObjectTypeProperty":
+            return lines_1.concat([
+                printVariance(path, print),
+                path.call(print, "key"),
+                n.optional ? "?" : "",
+                ": ",
+                path.call(print, "value")
+            ]);
+        case "ObjectTypeInternalSlot":
+            return lines_1.concat([
+                n.static ? "static " : "",
+                "[[",
+                path.call(print, "id"),
+                "]]",
+                n.optional ? "?" : "",
+                n.value.type !== "FunctionTypeAnnotation" ? ": " : "",
+                path.call(print, "value")
+            ]);
+        case "QualifiedTypeIdentifier":
+            return lines_1.concat([
+                path.call(print, "qualification"),
+                ".",
+                path.call(print, "id")
+            ]);
+        case "StringLiteralTypeAnnotation":
+            return lines_1.fromString(nodeStr(n.value, options), options);
+        case "NumberLiteralTypeAnnotation":
+        case "NumericLiteralTypeAnnotation":
+            assert_1.default.strictEqual(typeof n.value, "number");
+            return lines_1.fromString(JSON.stringify(n.value), options);
+        case "StringTypeAnnotation":
+            return lines_1.fromString("string", options);
+        case "DeclareTypeAlias":
+            parts.push("declare ");
+        // Fall through to TypeAlias...
+        case "TypeAlias":
+            return lines_1.concat([
+                "type ",
+                path.call(print, "id"),
+                path.call(print, "typeParameters"),
+                " = ",
+                path.call(print, "right"),
+                ";"
+            ]);
+        case "DeclareOpaqueType":
+            parts.push("declare ");
+        // Fall through to OpaqueType...
+        case "OpaqueType":
+            parts.push("opaque type ", path.call(print, "id"), path.call(print, "typeParameters"));
+            if (n["supertype"]) {
+                parts.push(": ", path.call(print, "supertype"));
+            }
+            if (n["impltype"]) {
+                parts.push(" = ", path.call(print, "impltype"));
+            }
+            parts.push(";");
+            return lines_1.concat(parts);
+        case "TypeCastExpression":
+            return lines_1.concat([
+                "(",
+                path.call(print, "expression"),
+                path.call(print, "typeAnnotation"),
+                ")"
+            ]);
+        case "TypeParameterDeclaration":
+        case "TypeParameterInstantiation":
+            return lines_1.concat([
+                "<",
+                lines_1.fromString(", ").join(path.map(print, "params")),
+                ">"
+            ]);
+        case "Variance":
+            if (n.kind === "plus") {
+                return lines_1.fromString("+");
+            }
+            if (n.kind === "minus") {
+                return lines_1.fromString("-");
+            }
+            return lines_1.fromString("");
+        case "TypeParameter":
+            if (n.variance) {
+                parts.push(printVariance(path, print));
+            }
+            parts.push(path.call(print, 'name'));
+            if (n.bound) {
+                parts.push(path.call(print, 'bound'));
+            }
+            if (n['default']) {
+                parts.push('=', path.call(print, 'default'));
+            }
+            return lines_1.concat(parts);
+        case "TypeofTypeAnnotation":
+            return lines_1.concat([
+                lines_1.fromString("typeof ", options),
+                path.call(print, "argument")
+            ]);
+        case "UnionTypeAnnotation":
+            return lines_1.fromString(" | ").join(path.map(print, "types"));
+        case "VoidTypeAnnotation":
+            return lines_1.fromString("void", options);
+        case "NullTypeAnnotation":
+            return lines_1.fromString("null", options);
+        // Type Annotations for TypeScript (when using Babylon as parser)
+        case "TSType":
+            throw new Error("unprintable type: " + JSON.stringify(n.type));
+        case "TSNumberKeyword":
+            return lines_1.fromString("number", options);
+        case "TSBigIntKeyword":
+            return lines_1.fromString("bigint", options);
+        case "TSObjectKeyword":
+            return lines_1.fromString("object", options);
+        case "TSBooleanKeyword":
+            return lines_1.fromString("boolean", options);
+        case "TSStringKeyword":
+            return lines_1.fromString("string", options);
+        case "TSSymbolKeyword":
+            return lines_1.fromString("symbol", options);
+        case "TSAnyKeyword":
+            return lines_1.fromString("any", options);
+        case "TSVoidKeyword":
+            return lines_1.fromString("void", options);
+        case "TSThisType":
+            return lines_1.fromString("this", options);
+        case "TSNullKeyword":
+            return lines_1.fromString("null", options);
+        case "TSUndefinedKeyword":
+            return lines_1.fromString("undefined", options);
+        case "TSUnknownKeyword":
+            return lines_1.fromString("unknown", options);
+        case "TSNeverKeyword":
+            return lines_1.fromString("never", options);
+        case "TSArrayType":
+            return lines_1.concat([
+                path.call(print, "elementType"),
+                "[]"
+            ]);
+        case "TSLiteralType":
+            return path.call(print, "literal");
+        case "TSUnionType":
+            return lines_1.fromString(" | ").join(path.map(print, "types"));
+        case "TSIntersectionType":
+            return lines_1.fromString(" & ").join(path.map(print, "types"));
+        case "TSConditionalType":
+            parts.push(path.call(print, "checkType"), " extends ", path.call(print, "extendsType"), " ? ", path.call(print, "trueType"), " : ", path.call(print, "falseType"));
+            return lines_1.concat(parts);
+        case "TSInferType":
+            parts.push("infer ", path.call(print, "typeParameter"));
+            return lines_1.concat(parts);
+        case "TSParenthesizedType":
+            return lines_1.concat([
+                "(",
+                path.call(print, "typeAnnotation"),
+                ")"
+            ]);
+        case "TSFunctionType":
+        case "TSConstructorType":
+            return lines_1.concat([
+                path.call(print, "typeParameters"),
+                "(",
+                printFunctionParams(path, options, print),
+                ")",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "TSMappedType": {
+            parts.push(n.readonly ? "readonly " : "", "[", path.call(print, "typeParameter"), "]", n.optional ? "?" : "");
+            if (n.typeAnnotation) {
+                parts.push(": ", path.call(print, "typeAnnotation"), ";");
+            }
+            return lines_1.concat([
+                "{\n",
+                lines_1.concat(parts).indent(options.tabWidth),
+                "\n}",
+            ]);
+        }
+        case "TSTupleType":
+            return lines_1.concat([
+                "[",
+                lines_1.fromString(", ").join(path.map(print, "elementTypes")),
+                "]"
+            ]);
+        case "TSRestType":
+            return lines_1.concat([
+                "...",
+                path.call(print, "typeAnnotation"),
+                "[]"
+            ]);
+        case "TSOptionalType":
+            return lines_1.concat([
+                path.call(print, "typeAnnotation"),
+                "?"
+            ]);
+        case "TSIndexedAccessType":
+            return lines_1.concat([
+                path.call(print, "objectType"),
+                "[",
+                path.call(print, "indexType"),
+                "]"
+            ]);
+        case "TSTypeOperator":
+            return lines_1.concat([
+                path.call(print, "operator"),
+                " ",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "TSTypeLiteral": {
+            var memberLines_1 = lines_1.fromString(",\n").join(path.map(print, "members"));
+            if (memberLines_1.isEmpty()) {
+                return lines_1.fromString("{}", options);
+            }
+            parts.push("{\n", memberLines_1.indent(options.tabWidth), "\n}");
+            return lines_1.concat(parts);
+        }
+        case "TSEnumMember":
+            parts.push(path.call(print, "id"));
+            if (n.initializer) {
+                parts.push(" = ", path.call(print, "initializer"));
+            }
+            return lines_1.concat(parts);
+        case "TSTypeQuery":
+            return lines_1.concat([
+                "typeof ",
+                path.call(print, "exprName"),
+            ]);
+        case "TSParameterProperty":
+            if (n.accessibility) {
+                parts.push(n.accessibility, " ");
+            }
+            if (n.export) {
+                parts.push("export ");
+            }
+            if (n.static) {
+                parts.push("static ");
+            }
+            if (n.readonly) {
+                parts.push("readonly ");
+            }
+            parts.push(path.call(print, "parameter"));
+            return lines_1.concat(parts);
+        case "TSTypeReference":
+            return lines_1.concat([
+                path.call(print, "typeName"),
+                path.call(print, "typeParameters")
+            ]);
+        case "TSQualifiedName":
+            return lines_1.concat([
+                path.call(print, "left"),
+                ".",
+                path.call(print, "right")
+            ]);
+        case "TSAsExpression": {
+            var withParens = n.extra && n.extra.parenthesized === true;
+            if (withParens)
+                parts.push("(");
+            parts.push(path.call(print, "expression"), lines_1.fromString(" as "), path.call(print, "typeAnnotation"));
+            if (withParens)
+                parts.push(")");
+            return lines_1.concat(parts);
+        }
+        case "TSNonNullExpression":
+            return lines_1.concat([
+                path.call(print, "expression"),
+                "!"
+            ]);
+        case "TSTypeAnnotation": {
+            // similar to flow's FunctionTypeAnnotation, this can be
+            // ambiguous: it can be prefixed by => or :
+            // in a type predicate, it takes the for u is U
+            var parent = path.getParentNode(0);
+            var prefix = ": ";
+            if (namedTypes.TSFunctionType.check(parent)) {
+                prefix = " => ";
+            }
+            if (namedTypes.TSTypePredicate.check(parent)) {
+                prefix = " is ";
+            }
+            return lines_1.concat([
+                prefix,
+                path.call(print, "typeAnnotation")
+            ]);
+        }
+        case "TSIndexSignature":
+            return lines_1.concat([
+                n.readonly ? "readonly " : "",
+                "[",
+                path.map(print, "parameters"),
+                "]",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "TSPropertySignature":
+            parts.push(printVariance(path, print), n.readonly ? "readonly " : "");
+            if (n.computed) {
+                parts.push("[", path.call(print, "key"), "]");
+            }
+            else {
+                parts.push(path.call(print, "key"));
+            }
+            parts.push(n.optional ? "?" : "", path.call(print, "typeAnnotation"));
+            return lines_1.concat(parts);
+        case "TSMethodSignature":
+            if (n.computed) {
+                parts.push("[", path.call(print, "key"), "]");
+            }
+            else {
+                parts.push(path.call(print, "key"));
+            }
+            if (n.optional) {
+                parts.push("?");
+            }
+            parts.push(path.call(print, "typeParameters"), "(", printFunctionParams(path, options, print), ")", path.call(print, "typeAnnotation"));
+            return lines_1.concat(parts);
+        case "TSTypePredicate":
+            return lines_1.concat([
+                path.call(print, "parameterName"),
+                path.call(print, "typeAnnotation")
+            ]);
+        case "TSCallSignatureDeclaration":
+            return lines_1.concat([
+                path.call(print, "typeParameters"),
+                "(",
+                printFunctionParams(path, options, print),
+                ")",
+                path.call(print, "typeAnnotation")
+            ]);
+        case "TSConstructSignatureDeclaration":
+            if (n.typeParameters) {
+                parts.push("new", path.call(print, "typeParameters"));
+            }
+            else {
+                parts.push("new ");
+            }
+            parts.push("(", printFunctionParams(path, options, print), ")", path.call(print, "typeAnnotation"));
+            return lines_1.concat(parts);
+        case "TSTypeAliasDeclaration":
+            return lines_1.concat([
+                n.declare ? "declare " : "",
+                "type ",
+                path.call(print, "id"),
+                path.call(print, "typeParameters"),
+                " = ",
+                path.call(print, "typeAnnotation"),
+                ";"
+            ]);
+        case "TSTypeParameter":
+            parts.push(path.call(print, "name"));
+            // ambiguous because of TSMappedType
+            var parent = path.getParentNode(0);
+            var isInMappedType = namedTypes.TSMappedType.check(parent);
+            if (n.constraint) {
+                parts.push(isInMappedType ? " in " : " extends ", path.call(print, "constraint"));
+            }
+            if (n["default"]) {
+                parts.push(" = ", path.call(print, "default"));
+            }
+            return lines_1.concat(parts);
+        case "TSTypeAssertion":
+            var withParens = n.extra && n.extra.parenthesized === true;
+            if (withParens) {
+                parts.push("(");
+            }
+            parts.push("<", path.call(print, "typeAnnotation"), "> ", path.call(print, "expression"));
+            if (withParens) {
+                parts.push(")");
+            }
+            return lines_1.concat(parts);
+        case "TSTypeParameterDeclaration":
+        case "TSTypeParameterInstantiation":
+            return lines_1.concat([
+                "<",
+                lines_1.fromString(", ").join(path.map(print, "params")),
+                ">"
+            ]);
+        case "TSEnumDeclaration":
+            parts.push(n.declare ? "declare " : "", n.const ? "const " : "", "enum ", path.call(print, "id"));
+            var memberLines = lines_1.fromString(",\n").join(path.map(print, "members"));
+            if (memberLines.isEmpty()) {
+                parts.push(" {}");
+            }
+            else {
+                parts.push(" {\n", memberLines.indent(options.tabWidth), "\n}");
+            }
+            return lines_1.concat(parts);
+        case "TSExpressionWithTypeArguments":
+            return lines_1.concat([
+                path.call(print, "expression"),
+                path.call(print, "typeParameters")
+            ]);
+        case "TSInterfaceBody":
+            var lines = lines_1.fromString(";\n").join(path.map(print, "body"));
+            if (lines.isEmpty()) {
+                return lines_1.fromString("{}", options);
+            }
+            return lines_1.concat([
+                "{\n",
+                lines.indent(options.tabWidth), ";",
+                "\n}",
+            ]);
+        case "TSImportType":
+            parts.push("import(", path.call(print, "argument"), ")");
+            if (n.qualifier) {
+                parts.push(".", path.call(print, "qualifier"));
+            }
+            if (n.typeParameters) {
+                parts.push(path.call(print, "typeParameters"));
+            }
+            return lines_1.concat(parts);
+        case "TSImportEqualsDeclaration":
+            if (n.isExport) {
+                parts.push("export ");
+            }
+            parts.push("import ", path.call(print, "id"), " = ", path.call(print, "moduleReference"));
+            return maybeAddSemicolon(lines_1.concat(parts));
+        case "TSExternalModuleReference":
+            return lines_1.concat(["require(", path.call(print, "expression"), ")"]);
+        case "TSModuleDeclaration": {
+            var parent_1 = path.getParentNode();
+            if (parent_1.type === "TSModuleDeclaration") {
+                parts.push(".");
+            }
+            else {
+                if (n.declare) {
+                    parts.push("declare ");
+                }
+                if (!n.global) {
+                    var isExternal = n.id.type === "StringLiteral" ||
+                        (n.id.type === "Literal" &&
+                            typeof n.id.value === "string");
+                    if (isExternal) {
+                        parts.push("module ");
+                    }
+                    else if (n.loc &&
+                        n.loc.lines &&
+                        n.id.loc) {
+                        var prefix_1 = n.loc.lines.sliceString(n.loc.start, n.id.loc.start);
+                        // These keywords are fundamentally ambiguous in the
+                        // Babylon parser, and not reflected in the AST, so
+                        // the best we can do is to match the original code,
+                        // when possible.
+                        if (prefix_1.indexOf("module") >= 0) {
+                            parts.push("module ");
+                        }
+                        else {
+                            parts.push("namespace ");
+                        }
+                    }
+                    else {
+                        parts.push("namespace ");
+                    }
+                }
+            }
+            parts.push(path.call(print, "id"));
+            if (n.body && n.body.type === "TSModuleDeclaration") {
+                parts.push(path.call(print, "body"));
+            }
+            else if (n.body) {
+                var bodyLines = path.call(print, "body");
+                if (bodyLines.isEmpty()) {
+                    parts.push(" {}");
+                }
+                else {
+                    parts.push(" {\n", bodyLines.indent(options.tabWidth), "\n}");
+                }
+            }
+            return lines_1.concat(parts);
+        }
+        case "TSModuleBlock":
+            return path.call(function (bodyPath) {
+                return printStatementSequence(bodyPath, options, print);
+            }, "body");
+        // Unhandled types below. If encountered, nodes of these types should
+        // be either left alone or desugared into AST types that are fully
+        // supported by the pretty-printer.
+        case "ClassHeritage": // TODO
+        case "ComprehensionBlock": // TODO
+        case "ComprehensionExpression": // TODO
+        case "Glob": // TODO
+        case "GeneratorExpression": // TODO
+        case "LetStatement": // TODO
+        case "LetExpression": // TODO
+        case "GraphExpression": // TODO
+        case "GraphIndexExpression": // TODO
+        // XML types that nobody cares about or needs to print.
+        case "XMLDefaultDeclaration":
+        case "XMLAnyName":
+        case "XMLQualifiedIdentifier":
+        case "XMLFunctionQualifiedIdentifier":
+        case "XMLAttributeSelector":
+        case "XMLFilterExpression":
+        case "XML":
+        case "XMLElement":
+        case "XMLList":
+        case "XMLEscape":
+        case "XMLText":
+        case "XMLStartTag":
+        case "XMLEndTag":
+        case "XMLPointTag":
+        case "XMLName":
+        case "XMLAttribute":
+        case "XMLCdata":
+        case "XMLComment":
+        case "XMLProcessingInstruction":
+        default:
+            debugger;
+            throw new Error("unknown type: " + JSON.stringify(n.type));
+    }
+}
+function printDecorators(path, printPath) {
+    var parts = [];
+    var node = path.getValue();
+    if (node.decorators &&
+        node.decorators.length > 0 &&
+        // If the parent node is an export declaration, it will be
+        // responsible for printing node.decorators.
+        !util.getParentExportDeclaration(path)) {
+        path.each(function (decoratorPath) {
+            parts.push(printPath(decoratorPath), "\n");
+        }, "decorators");
+    }
+    else if (util.isExportDeclaration(node) &&
+        node.declaration &&
+        node.declaration.decorators) {
+        // Export declarations are responsible for printing any decorators
+        // that logically apply to node.declaration.
+        path.each(function (decoratorPath) {
+            parts.push(printPath(decoratorPath), "\n");
+        }, "declaration", "decorators");
+    }
+    return lines_1.concat(parts);
+}
+function printStatementSequence(path, options, print) {
+    var filtered = [];
+    var sawComment = false;
+    var sawStatement = false;
+    path.each(function (stmtPath) {
+        var stmt = stmtPath.getValue();
+        // Just in case the AST has been modified to contain falsy
+        // "statements," it's safer simply to skip them.
+        if (!stmt) {
+            return;
+        }
+        // Skip printing EmptyStatement nodes to avoid leaving stray
+        // semicolons lying around.
+        if (stmt.type === "EmptyStatement" &&
+            !(stmt.comments && stmt.comments.length > 0)) {
+            return;
+        }
+        if (namedTypes.Comment.check(stmt)) {
+            // The pretty printer allows a dangling Comment node to act as
+            // a Statement when the Comment can't be attached to any other
+            // non-Comment node in the tree.
+            sawComment = true;
+        }
+        else if (namedTypes.Statement.check(stmt)) {
+            sawStatement = true;
+        }
+        else {
+            // When the pretty printer encounters a string instead of an
+            // AST node, it just prints the string. This behavior can be
+            // useful for fine-grained formatting decisions like inserting
+            // blank lines.
+            isString.assert(stmt);
+        }
+        // We can't hang onto stmtPath outside of this function, because
+        // it's just a reference to a mutable FastPath object, so we have
+        // to go ahead and print it here.
+        filtered.push({
+            node: stmt,
+            printed: print(stmtPath)
+        });
+    });
+    if (sawComment) {
+        assert_1.default.strictEqual(sawStatement, false, "Comments may appear as statements in otherwise empty statement " +
+            "lists, but may not coexist with non-Comment nodes.");
+    }
+    var prevTrailingSpace = null;
+    var len = filtered.length;
+    var parts = [];
+    filtered.forEach(function (info, i) {
+        var printed = info.printed;
+        var stmt = info.node;
+        var multiLine = printed.length > 1;
+        var notFirst = i > 0;
+        var notLast = i < len - 1;
+        var leadingSpace;
+        var trailingSpace;
+        var lines = stmt && stmt.loc && stmt.loc.lines;
+        var trueLoc = lines && options.reuseWhitespace &&
+            util.getTrueLoc(stmt, lines);
+        if (notFirst) {
+            if (trueLoc) {
+                var beforeStart = lines.skipSpaces(trueLoc.start, true);
+                var beforeStartLine = beforeStart ? beforeStart.line : 1;
+                var leadingGap = trueLoc.start.line - beforeStartLine;
+                leadingSpace = Array(leadingGap + 1).join("\n");
+            }
+            else {
+                leadingSpace = multiLine ? "\n\n" : "\n";
+            }
+        }
+        else {
+            leadingSpace = "";
+        }
+        if (notLast) {
+            if (trueLoc) {
+                var afterEnd = lines.skipSpaces(trueLoc.end);
+                var afterEndLine = afterEnd ? afterEnd.line : lines.length;
+                var trailingGap = afterEndLine - trueLoc.end.line;
+                trailingSpace = Array(trailingGap + 1).join("\n");
+            }
+            else {
+                trailingSpace = multiLine ? "\n\n" : "\n";
+            }
+        }
+        else {
+            trailingSpace = "";
+        }
+        parts.push(maxSpace(prevTrailingSpace, leadingSpace), printed);
+        if (notLast) {
+            prevTrailingSpace = trailingSpace;
+        }
+        else if (trailingSpace) {
+            parts.push(trailingSpace);
+        }
+    });
+    return lines_1.concat(parts);
+}
+function maxSpace(s1, s2) {
+    if (!s1 && !s2) {
+        return lines_1.fromString("");
+    }
+    if (!s1) {
+        return lines_1.fromString(s2);
+    }
+    if (!s2) {
+        return lines_1.fromString(s1);
+    }
+    var spaceLines1 = lines_1.fromString(s1);
+    var spaceLines2 = lines_1.fromString(s2);
+    if (spaceLines2.length > spaceLines1.length) {
+        return spaceLines2;
+    }
+    return spaceLines1;
+}
+function printMethod(path, options, print) {
+    var node = path.getNode();
+    var kind = node.kind;
+    var parts = [];
+    var nodeValue = node.value;
+    if (!namedTypes.FunctionExpression.check(nodeValue)) {
+        nodeValue = node;
+    }
+    var access = node.accessibility || node.access;
+    if (typeof access === "string") {
+        parts.push(access, " ");
+    }
+    if (node.static) {
+        parts.push("static ");
+    }
+    if (node.abstract) {
+        parts.push("abstract ");
+    }
+    if (node.readonly) {
+        parts.push("readonly ");
+    }
+    if (nodeValue.async) {
+        parts.push("async ");
+    }
+    if (nodeValue.generator) {
+        parts.push("*");
+    }
+    if (kind === "get" || kind === "set") {
+        parts.push(kind, " ");
+    }
+    var key = path.call(print, "key");
+    if (node.computed) {
+        key = lines_1.concat(["[", key, "]"]);
+    }
+    parts.push(key);
+    if (node.optional) {
+        parts.push("?");
+    }
+    if (node === nodeValue) {
+        parts.push(path.call(print, "typeParameters"), "(", printFunctionParams(path, options, print), ")", path.call(print, "returnType"));
+        if (node.body) {
+            parts.push(" ", path.call(print, "body"));
+        }
+        else {
+            parts.push(";");
+        }
+    }
+    else {
+        parts.push(path.call(print, "value", "typeParameters"), "(", path.call(function (valuePath) {
+            return printFunctionParams(valuePath, options, print);
+        }, "value"), ")", path.call(print, "value", "returnType"));
+        if (nodeValue.body) {
+            parts.push(" ", path.call(print, "value", "body"));
+        }
+        else {
+            parts.push(";");
+        }
+    }
+    return lines_1.concat(parts);
+}
+function printArgumentsList(path, options, print) {
+    var printed = path.map(print, "arguments");
+    var trailingComma = util.isTrailingCommaEnabled(options, "parameters");
+    var joined = lines_1.fromString(", ").join(printed);
+    if (joined.getLineLength(1) > options.wrapColumn) {
+        joined = lines_1.fromString(",\n").join(printed);
+        return lines_1.concat([
+            "(\n",
+            joined.indent(options.tabWidth),
+            trailingComma ? ",\n)" : "\n)"
+        ]);
+    }
+    return lines_1.concat(["(", joined, ")"]);
+}
+function printFunctionParams(path, options, print) {
+    var fun = path.getValue();
+    if (fun.params) {
+        var params = fun.params;
+        var printed = path.map(print, "params");
+    }
+    else if (fun.parameters) {
+        params = fun.parameters;
+        printed = path.map(print, "parameters");
+    }
+    if (fun.defaults) {
+        path.each(function (defExprPath) {
+            var i = defExprPath.getName();
+            var p = printed[i];
+            if (p && defExprPath.getValue()) {
+                printed[i] = lines_1.concat([p, " = ", print(defExprPath)]);
+            }
+        }, "defaults");
+    }
+    if (fun.rest) {
+        printed.push(lines_1.concat(["...", path.call(print, "rest")]));
+    }
+    var joined = lines_1.fromString(", ").join(printed);
+    if (joined.length > 1 ||
+        joined.getLineLength(1) > options.wrapColumn) {
+        joined = lines_1.fromString(",\n").join(printed);
+        if (util.isTrailingCommaEnabled(options, "parameters") &&
+            !fun.rest &&
+            params[params.length - 1].type !== 'RestElement') {
+            joined = lines_1.concat([joined, ",\n"]);
+        }
+        else {
+            joined = lines_1.concat([joined, "\n"]);
+        }
+        return lines_1.concat(["\n", joined.indent(options.tabWidth)]);
+    }
+    return joined;
+}
+function printExportDeclaration(path, options, print) {
+    var decl = path.getValue();
+    var parts = ["export "];
+    if (decl.exportKind && decl.exportKind !== "value") {
+        parts.push(decl.exportKind + " ");
+    }
+    var shouldPrintSpaces = options.objectCurlySpacing;
+    namedTypes.Declaration.assert(decl);
+    if (decl["default"] ||
+        decl.type === "ExportDefaultDeclaration") {
+        parts.push("default ");
+    }
+    if (decl.declaration) {
+        parts.push(path.call(print, "declaration"));
+    }
+    else if (decl.specifiers) {
+        if (decl.specifiers.length === 1 &&
+            decl.specifiers[0].type === "ExportBatchSpecifier") {
+            parts.push("*");
+        }
+        else if (decl.specifiers.length === 0) {
+            parts.push("{}");
+        }
+        else if (decl.specifiers[0].type === 'ExportDefaultSpecifier') {
+            var unbracedSpecifiers_2 = [];
+            var bracedSpecifiers_2 = [];
+            path.each(function (specifierPath) {
+                var spec = specifierPath.getValue();
+                if (spec.type === "ExportDefaultSpecifier") {
+                    unbracedSpecifiers_2.push(print(specifierPath));
+                }
+                else {
+                    bracedSpecifiers_2.push(print(specifierPath));
+                }
+            }, "specifiers");
+            unbracedSpecifiers_2.forEach(function (lines, i) {
+                if (i > 0) {
+                    parts.push(", ");
+                }
+                parts.push(lines);
+            });
+            if (bracedSpecifiers_2.length > 0) {
+                var lines_3 = lines_1.fromString(", ").join(bracedSpecifiers_2);
+                if (lines_3.getLineLength(1) > options.wrapColumn) {
+                    lines_3 = lines_1.concat([
+                        lines_1.fromString(",\n").join(bracedSpecifiers_2).indent(options.tabWidth),
+                        ","
+                    ]);
+                }
+                if (unbracedSpecifiers_2.length > 0) {
+                    parts.push(", ");
+                }
+                if (lines_3.length > 1) {
+                    parts.push("{\n", lines_3, "\n}");
+                }
+                else if (options.objectCurlySpacing) {
+                    parts.push("{ ", lines_3, " }");
+                }
+                else {
+                    parts.push("{", lines_3, "}");
+                }
+            }
+        }
+        else {
+            parts.push(shouldPrintSpaces ? "{ " : "{", lines_1.fromString(", ").join(path.map(print, "specifiers")), shouldPrintSpaces ? " }" : "}");
+        }
+        if (decl.source) {
+            parts.push(" from ", path.call(print, "source"));
+        }
+    }
+    var lines = lines_1.concat(parts);
+    if (lastNonSpaceCharacter(lines) !== ";" &&
+        !(decl.declaration &&
+            (decl.declaration.type === "FunctionDeclaration" ||
+                decl.declaration.type === "ClassDeclaration" ||
+                decl.declaration.type === "TSModuleDeclaration" ||
+                decl.declaration.type === "TSInterfaceDeclaration" ||
+                decl.declaration.type === "TSEnumDeclaration"))) {
+        lines = lines_1.concat([lines, ";"]);
+    }
+    return lines;
+}
+function printFlowDeclaration(path, parts) {
+    var parentExportDecl = util.getParentExportDeclaration(path);
+    if (parentExportDecl) {
+        assert_1.default.strictEqual(parentExportDecl.type, "DeclareExportDeclaration");
+    }
+    else {
+        // If the parent node has type DeclareExportDeclaration, then it
+        // will be responsible for printing the "declare" token. Otherwise
+        // it needs to be printed with this non-exported declaration node.
+        parts.unshift("declare ");
+    }
+    return lines_1.concat(parts);
+}
+function printVariance(path, print) {
+    return path.call(function (variancePath) {
+        var value = variancePath.getValue();
+        if (value) {
+            if (value === "plus") {
+                return lines_1.fromString("+");
+            }
+            if (value === "minus") {
+                return lines_1.fromString("-");
+            }
+            return print(variancePath);
+        }
+        return lines_1.fromString("");
+    }, "variance");
+}
+function adjustClause(clause, options) {
+    if (clause.length > 1)
+        return lines_1.concat([" ", clause]);
+    return lines_1.concat([
+        "\n",
+        maybeAddSemicolon(clause).indent(options.tabWidth)
+    ]);
+}
+function lastNonSpaceCharacter(lines) {
+    var pos = lines.lastPos();
+    do {
+        var ch = lines.charAt(pos);
+        if (/\S/.test(ch))
+            return ch;
+    } while (lines.prevPos(pos));
+}
+function endsWithBrace(lines) {
+    return lastNonSpaceCharacter(lines) === "}";
+}
+function swapQuotes(str) {
+    return str.replace(/['"]/g, function (m) {
+        return m === '"' ? '\'' : '"';
+    });
+}
+function nodeStr(str, options) {
+    isString.assert(str);
+    switch (options.quote) {
+        case "auto":
+            var double = JSON.stringify(str);
+            var single = swapQuotes(JSON.stringify(swapQuotes(str)));
+            return double.length > single.length ? single : double;
+        case "single":
+            return swapQuotes(JSON.stringify(swapQuotes(str)));
+        case "double":
+        default:
+            return JSON.stringify(str);
+    }
+}
+function maybeAddSemicolon(lines) {
+    var eoc = lastNonSpaceCharacter(lines);
+    if (!eoc || "\n};".indexOf(eoc) < 0)
+        return lines_1.concat([lines, ";"]);
+    return lines;
+}
diff --git a/node_modules/recast/lib/util.d.ts b/node_modules/recast/lib/util.d.ts
new file mode 100644
index 0000000..effa34b
--- /dev/null
+++ b/node_modules/recast/lib/util.d.ts
@@ -0,0 +1,16 @@
+export declare function getOption(options: any, key: any, defaultValue: any): any;
+export declare function getUnionOfKeys(...args: any[]): any;
+export declare function comparePos(pos1: any, pos2: any): number;
+export declare function copyPos(pos: any): {
+    line: any;
+    column: any;
+};
+export declare function composeSourceMaps(formerMap: any, latterMap: any): any;
+export declare function getTrueLoc(node: any, lines: any): {
+    start: any;
+    end: any;
+} | null;
+export declare function fixFaultyLocations(node: any, lines: any): void;
+export declare function isExportDeclaration(node: any): boolean;
+export declare function getParentExportDeclaration(path: any): any;
+export declare function isTrailingCommaEnabled(options: any, context: any): boolean;
diff --git a/node_modules/recast/lib/util.js b/node_modules/recast/lib/util.js
new file mode 100644
index 0000000..0520bbb
--- /dev/null
+++ b/node_modules/recast/lib/util.js
@@ -0,0 +1,339 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var assert_1 = __importDefault(require("assert"));
+var types = __importStar(require("ast-types"));
+var n = types.namedTypes;
+var source_map_1 = __importDefault(require("source-map"));
+var SourceMapConsumer = source_map_1.default.SourceMapConsumer;
+var SourceMapGenerator = source_map_1.default.SourceMapGenerator;
+var hasOwn = Object.prototype.hasOwnProperty;
+function getOption(options, key, defaultValue) {
+    if (options && hasOwn.call(options, key)) {
+        return options[key];
+    }
+    return defaultValue;
+}
+exports.getOption = getOption;
+function getUnionOfKeys() {
+    var args = [];
+    for (var _i = 0; _i < arguments.length; _i++) {
+        args[_i] = arguments[_i];
+    }
+    var result = {};
+    var argc = args.length;
+    for (var i = 0; i < argc; ++i) {
+        var keys = Object.keys(args[i]);
+        var keyCount = keys.length;
+        for (var j = 0; j < keyCount; ++j) {
+            result[keys[j]] = true;
+        }
+    }
+    return result;
+}
+exports.getUnionOfKeys = getUnionOfKeys;
+function comparePos(pos1, pos2) {
+    return (pos1.line - pos2.line) || (pos1.column - pos2.column);
+}
+exports.comparePos = comparePos;
+function copyPos(pos) {
+    return {
+        line: pos.line,
+        column: pos.column
+    };
+}
+exports.copyPos = copyPos;
+function composeSourceMaps(formerMap, latterMap) {
+    if (formerMap) {
+        if (!latterMap) {
+            return formerMap;
+        }
+    }
+    else {
+        return latterMap || null;
+    }
+    var smcFormer = new SourceMapConsumer(formerMap);
+    var smcLatter = new SourceMapConsumer(latterMap);
+    var smg = new SourceMapGenerator({
+        file: latterMap.file,
+        sourceRoot: latterMap.sourceRoot
+    });
+    var sourcesToContents = {};
+    smcLatter.eachMapping(function (mapping) {
+        var origPos = smcFormer.originalPositionFor({
+            line: mapping.originalLine,
+            column: mapping.originalColumn
+        });
+        var sourceName = origPos.source;
+        if (sourceName === null) {
+            return;
+        }
+        smg.addMapping({
+            source: sourceName,
+            original: copyPos(origPos),
+            generated: {
+                line: mapping.generatedLine,
+                column: mapping.generatedColumn
+            },
+            name: mapping.name
+        });
+        var sourceContent = smcFormer.sourceContentFor(sourceName);
+        if (sourceContent && !hasOwn.call(sourcesToContents, sourceName)) {
+            sourcesToContents[sourceName] = sourceContent;
+            smg.setSourceContent(sourceName, sourceContent);
+        }
+    });
+    return smg.toJSON();
+}
+exports.composeSourceMaps = composeSourceMaps;
+;
+function getTrueLoc(node, lines) {
+    // It's possible that node is newly-created (not parsed by Esprima),
+    // in which case it probably won't have a .loc property (or an
+    // .original property for that matter). That's fine; we'll just
+    // pretty-print it as usual.
+    if (!node.loc) {
+        return null;
+    }
+    var result = {
+        start: node.loc.start,
+        end: node.loc.end
+    };
+    function include(node) {
+        expandLoc(result, node.loc);
+    }
+    // If the node is an export declaration and its .declaration has any
+    // decorators, their locations might contribute to the true start/end
+    // positions of the export declaration node.
+    if (node.declaration &&
+        node.declaration.decorators &&
+        isExportDeclaration(node)) {
+        node.declaration.decorators.forEach(include);
+    }
+    if (comparePos(result.start, result.end) < 0) {
+        // Trim leading whitespace.
+        result.start = copyPos(result.start);
+        lines.skipSpaces(result.start, false, true);
+        if (comparePos(result.start, result.end) < 0) {
+            // Trim trailing whitespace, if the end location is not already the
+            // same as the start location.
+            result.end = copyPos(result.end);
+            lines.skipSpaces(result.end, true, true);
+        }
+    }
+    // If the node has any comments, their locations might contribute to
+    // the true start/end positions of the node.
+    if (node.comments) {
+        node.comments.forEach(include);
+    }
+    return result;
+}
+exports.getTrueLoc = getTrueLoc;
+;
+function expandLoc(parentLoc, childLoc) {
+    if (parentLoc && childLoc) {
+        if (comparePos(childLoc.start, parentLoc.start) < 0) {
+            parentLoc.start = childLoc.start;
+        }
+        if (comparePos(parentLoc.end, childLoc.end) < 0) {
+            parentLoc.end = childLoc.end;
+        }
+    }
+}
+function fixFaultyLocations(node, lines) {
+    var loc = node.loc;
+    if (loc) {
+        if (loc.start.line < 1) {
+            loc.start.line = 1;
+        }
+        if (loc.end.line < 1) {
+            loc.end.line = 1;
+        }
+    }
+    if (node.type === "File") {
+        // Babylon returns File nodes whose .loc.{start,end} do not include
+        // leading or trailing whitespace.
+        loc.start = lines.firstPos();
+        loc.end = lines.lastPos();
+    }
+    fixForLoopHead(node, lines);
+    fixTemplateLiteral(node, lines);
+    if (loc && node.decorators) {
+        // Expand the .loc of the node responsible for printing the decorators
+        // (here, the decorated node) so that it includes node.decorators.
+        node.decorators.forEach(function (decorator) {
+            expandLoc(loc, decorator.loc);
+        });
+    }
+    else if (node.declaration && isExportDeclaration(node)) {
+        // Nullify .loc information for the child declaration so that we never
+        // try to reprint it without also reprinting the export declaration.
+        node.declaration.loc = null;
+        // Expand the .loc of the node responsible for printing the decorators
+        // (here, the export declaration) so that it includes node.decorators.
+        var decorators = node.declaration.decorators;
+        if (decorators) {
+            decorators.forEach(function (decorator) {
+                expandLoc(loc, decorator.loc);
+            });
+        }
+    }
+    else if ((n.MethodDefinition && n.MethodDefinition.check(node)) ||
+        (n.Property.check(node) && (node.method || node.shorthand))) {
+        // If the node is a MethodDefinition or a .method or .shorthand
+        // Property, then the location information stored in
+        // node.value.loc is very likely untrustworthy (just the {body}
+        // part of a method, or nothing in the case of shorthand
+        // properties), so we null out that information to prevent
+        // accidental reuse of bogus source code during reprinting.
+        node.value.loc = null;
+        if (n.FunctionExpression.check(node.value)) {
+            // FunctionExpression method values should be anonymous,
+            // because their .id fields are ignored anyway.
+            node.value.id = null;
+        }
+    }
+    else if (node.type === "ObjectTypeProperty") {
+        var loc = node.loc;
+        var end = loc && loc.end;
+        if (end) {
+            end = copyPos(end);
+            if (lines.prevPos(end) &&
+                lines.charAt(end) === ",") {
+                // Some parsers accidentally include trailing commas in the
+                // .loc.end information for ObjectTypeProperty nodes.
+                if ((end = lines.skipSpaces(end, true, true))) {
+                    loc.end = end;
+                }
+            }
+        }
+    }
+}
+exports.fixFaultyLocations = fixFaultyLocations;
+;
+function fixForLoopHead(node, lines) {
+    if (node.type !== "ForStatement") {
+        return;
+    }
+    function fix(child) {
+        var loc = child && child.loc;
+        var start = loc && loc.start;
+        var end = loc && copyPos(loc.end);
+        while (start && end && comparePos(start, end) < 0) {
+            lines.prevPos(end);
+            if (lines.charAt(end) === ";") {
+                // Update child.loc.end to *exclude* the ';' character.
+                loc.end.line = end.line;
+                loc.end.column = end.column;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    fix(node.init);
+    fix(node.test);
+    fix(node.update);
+}
+function fixTemplateLiteral(node, lines) {
+    if (node.type !== "TemplateLiteral") {
+        return;
+    }
+    if (node.quasis.length === 0) {
+        // If there are no quasi elements, then there is nothing to fix.
+        return;
+    }
+    // node.loc is not present when using export default with a template literal
+    if (node.loc) {
+        // First we need to exclude the opening ` from the .loc of the first
+        // quasi element, in case the parser accidentally decided to include it.
+        var afterLeftBackTickPos = copyPos(node.loc.start);
+        assert_1.default.strictEqual(lines.charAt(afterLeftBackTickPos), "`");
+        assert_1.default.ok(lines.nextPos(afterLeftBackTickPos));
+        var firstQuasi = node.quasis[0];
+        if (comparePos(firstQuasi.loc.start, afterLeftBackTickPos) < 0) {
+            firstQuasi.loc.start = afterLeftBackTickPos;
+        }
+        // Next we need to exclude the closing ` from the .loc of the last quasi
+        // element, in case the parser accidentally decided to include it.
+        var rightBackTickPos = copyPos(node.loc.end);
+        assert_1.default.ok(lines.prevPos(rightBackTickPos));
+        assert_1.default.strictEqual(lines.charAt(rightBackTickPos), "`");
+        var lastQuasi = node.quasis[node.quasis.length - 1];
+        if (comparePos(rightBackTickPos, lastQuasi.loc.end) < 0) {
+            lastQuasi.loc.end = rightBackTickPos;
+        }
+    }
+    // Now we need to exclude ${ and } characters from the .loc's of all
+    // quasi elements, since some parsers accidentally include them.
+    node.expressions.forEach(function (expr, i) {
+        // Rewind from expr.loc.start over any whitespace and the ${ that
+        // precedes the expression. The position of the $ should be the same
+        // as the .loc.end of the preceding quasi element, but some parsers
+        // accidentally include the ${ in the .loc of the quasi element.
+        var dollarCurlyPos = lines.skipSpaces(expr.loc.start, true, false);
+        if (lines.prevPos(dollarCurlyPos) &&
+            lines.charAt(dollarCurlyPos) === "{" &&
+            lines.prevPos(dollarCurlyPos) &&
+            lines.charAt(dollarCurlyPos) === "$") {
+            var quasiBefore = node.quasis[i];
+            if (comparePos(dollarCurlyPos, quasiBefore.loc.end) < 0) {
+                quasiBefore.loc.end = dollarCurlyPos;
+            }
+        }
+        // Likewise, some parsers accidentally include the } that follows
+        // the expression in the .loc of the following quasi element.
+        var rightCurlyPos = lines.skipSpaces(expr.loc.end, false, false);
+        if (lines.charAt(rightCurlyPos) === "}") {
+            assert_1.default.ok(lines.nextPos(rightCurlyPos));
+            // Now rightCurlyPos is technically the position just after the }.
+            var quasiAfter = node.quasis[i + 1];
+            if (comparePos(quasiAfter.loc.start, rightCurlyPos) < 0) {
+                quasiAfter.loc.start = rightCurlyPos;
+            }
+        }
+    });
+}
+function isExportDeclaration(node) {
+    if (node)
+        switch (node.type) {
+            case "ExportDeclaration":
+            case "ExportDefaultDeclaration":
+            case "ExportDefaultSpecifier":
+            case "DeclareExportDeclaration":
+            case "ExportNamedDeclaration":
+            case "ExportAllDeclaration":
+                return true;
+        }
+    return false;
+}
+exports.isExportDeclaration = isExportDeclaration;
+;
+function getParentExportDeclaration(path) {
+    var parentNode = path.getParentNode();
+    if (path.getName() === "declaration" &&
+        isExportDeclaration(parentNode)) {
+        return parentNode;
+    }
+    return null;
+}
+exports.getParentExportDeclaration = getParentExportDeclaration;
+;
+function isTrailingCommaEnabled(options, context) {
+    var trailingComma = options.trailingComma;
+    if (typeof trailingComma === "object") {
+        return !!trailingComma[context];
+    }
+    return !!trailingComma;
+}
+exports.isTrailingCommaEnabled = isTrailingCommaEnabled;
+;
diff --git a/node_modules/recast/main.d.ts b/node_modules/recast/main.d.ts
new file mode 100644
index 0000000..ae89c3b
--- /dev/null
+++ b/node_modules/recast/main.d.ts
@@ -0,0 +1,50 @@
+import * as types from "ast-types";
+import { parse } from "./lib/parser";
+import { Options } from "./lib/options";
+export { 
+/**
+ * Parse a string of code into an augmented syntax tree suitable for
+ * arbitrary modification and reprinting.
+ */
+parse, 
+/**
+ * Convenient shorthand for the ast-types package.
+ */
+types, };
+/**
+ * Traverse and potentially modify an abstract syntax tree using a
+ * convenient visitor syntax:
+ *
+ *   recast.visit(ast, {
+ *     names: [],
+ *     visitIdentifier: function(path) {
+ *       var node = path.value;
+ *       this.visitor.names.push(node.name);
+ *       this.traverse(path);
+ *     }
+ *   });
+ */
+export { visit } from "ast-types";
+/**
+ * Options shared between parsing and printing.
+ */
+export { Options } from "./lib/options";
+/**
+ * Reprint a modified syntax tree using as much of the original source
+ * code as possible.
+ */
+export declare function print(node: types.ASTNode, options?: Options): import("./lib/printer").PrintResultType;
+/**
+ * Print without attempting to reuse any original source code.
+ */
+export declare function prettyPrint(node: types.ASTNode, options?: Options): import("./lib/printer").PrintResultType;
+/**
+ * Convenient command-line interface (see e.g. example/add-braces).
+ */
+export declare function run(transformer: Transformer, options?: RunOptions): void;
+export interface Transformer {
+    (ast: types.ASTNode, callback: (ast: types.ASTNode) => void): void;
+}
+export interface RunOptions extends Options {
+    writeback?(code: string): void;
+}
diff --git a/node_modules/recast/main.js b/node_modules/recast/main.js
new file mode 100644
index 0000000..c4a2916
--- /dev/null
+++ b/node_modules/recast/main.js
@@ -0,0 +1,73 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var fs_1 = __importDefault(require("fs"));
+var types = __importStar(require("ast-types"));
+exports.types = types;
+var parser_1 = require("./lib/parser");
+exports.parse = parser_1.parse;
+var printer_1 = require("./lib/printer");
+/**
+ * Traverse and potentially modify an abstract syntax tree using a
+ * convenient visitor syntax:
+ *
+ *   recast.visit(ast, {
+ *     names: [],
+ *     visitIdentifier: function(path) {
+ *       var node = path.value;
+ *       this.visitor.names.push(node.name);
+ *       this.traverse(path);
+ *     }
+ *   });
+ */
+var ast_types_1 = require("ast-types");
+exports.visit = ast_types_1.visit;
+/**
+ * Reprint a modified syntax tree using as much of the original source
+ * code as possible.
+ */
+function print(node, options) {
+    return new printer_1.Printer(options).print(node);
+}
+exports.print = print;
+/**
+ * Print without attempting to reuse any original source code.
+ */
+function prettyPrint(node, options) {
+    return new printer_1.Printer(options).printGenerically(node);
+}
+exports.prettyPrint = prettyPrint;
+/**
+ * Convenient command-line interface (see e.g. example/add-braces).
+ */
+function run(transformer, options) {
+    return runFile(process.argv[2], transformer, options);
+}
+exports.run = run;
+function runFile(path, transformer, options) {
+    fs_1.default.readFile(path, "utf-8", function (err, code) {
+        if (err) {
+            console.error(err);
+            return;
+        }
+        runString(code, transformer, options);
+    });
+}
+function defaultWriteback(output) {
+    process.stdout.write(output);
+}
+function runString(code, transformer, options) {
+    var writeback = options && options.writeback || defaultWriteback;
+    transformer(parser_1.parse(code, options), function (node) {
+        writeback(print(node, options).code);
+    });
+}
diff --git a/node_modules/recast/node_modules/source-map/CHANGELOG.md b/node_modules/recast/node_modules/source-map/CHANGELOG.md
new file mode 100644
index 0000000..3a8c066
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/CHANGELOG.md
@@ -0,0 +1,301 @@
+# Change Log
+
+## 0.5.6
+
+* Fix for regression when people were using numbers as names in source maps. See
+  #236.
+
+## 0.5.5
+
+* Fix "regression" of unsupported, implementation behavior that half the world
+  happens to have come to depend on. See #235.
+
+* Fix regression involving function hoisting in SpiderMonkey. See #233.
+
+## 0.5.4
+
+* Large performance improvements to source-map serialization. See #228 and #229.
+
+## 0.5.3
+
+* Do not include unnecessary distribution files. See
+  commit ef7006f8d1647e0a83fdc60f04f5a7ca54886f86.
+
+## 0.5.2
+
+* Include browser distributions of the library in package.json's `files`. See
+  issue #212.
+
+## 0.5.1
+
+* Fix latent bugs in IndexedSourceMapConsumer.prototype._parseMappings. See
+  ff05274becc9e6e1295ed60f3ea090d31d843379.
+
+## 0.5.0
+
+* Node 0.8 is no longer supported.
+
+* Use webpack instead of dryice for bundling.
+
+* Big speedups serializing source maps. See pull request #203.
+
+* Fix a bug with `SourceMapConsumer.prototype.sourceContentFor` and sources that
+  explicitly start with the source root. See issue #199.
+
+## 0.4.4
+
+* Fix an issue where using a `SourceMapGenerator` after having created a
+  `SourceMapConsumer` from it via `SourceMapConsumer.fromSourceMap` failed. See
+  issue #191.
+
+* Fix an issue with where `SourceMapGenerator` would mistakenly consider
+  different mappings as duplicates of each other and avoid generating them. See
+  issue #192.
+
+## 0.4.3
+
+* A very large number of performance improvements, particularly when parsing
+  source maps. Collectively about 75% of time shaved off of the source map
+  parsing benchmark!
+
+* Fix a bug in `SourceMapConsumer.prototype.allGeneratedPositionsFor` and fuzzy
+  searching in the presence of a column option. See issue #177.
+
+* Fix a bug with joining a source and its source root when the source is above
+  the root. See issue #182.
+
+* Add the `SourceMapConsumer.prototype.hasContentsOfAllSources` method to
+  determine when all sources' contents are inlined into the source map. See
+  issue #190.
+
+## 0.4.2
+
+* Add an `.npmignore` file so that the benchmarks aren't pulled down by
+  dependent projects. Issue #169.
+
+* Add an optional `column` argument to
+  `SourceMapConsumer.prototype.allGeneratedPositionsFor` and better handle lines
+  with no mappings. Issues #172 and #173.
+
+## 0.4.1
+
+* Fix accidentally defining a global variable. #170.
+
+## 0.4.0
+
+* The default direction for fuzzy searching was changed back to its original
+  direction. See #164.
+
+* There is now a `bias` option you can supply to `SourceMapConsumer` to control
+  the fuzzy searching direction. See #167.
+
+* About an 8% speed up in parsing source maps. See #159.
+
+* Added a benchmark for parsing and generating source maps.
+
+## 0.3.0
+
+* Change the default direction that searching for positions fuzzes when there is
+  not an exact match. See #154.
+
+* Support for environments using json2.js for JSON serialization. See #156.
+
+## 0.2.0
+
+* Support for consuming "indexed" source maps which do not have any remote
+  sections. See pull request #127. This introduces a minor backwards
+  incompatibility if you are monkey patching `SourceMapConsumer.prototype`
+  methods.
+
+## 0.1.43
+
+* Performance improvements for `SourceMapGenerator` and `SourceNode`. See issue
+  #148 for some discussion and issues #150, #151, and #152 for implementations.
+
+## 0.1.42
+
+* Fix an issue where `SourceNode`s from different versions of the source-map
+  library couldn't be used in conjunction with each other. See issue #142.
+
+## 0.1.41
+
+* Fix a bug with getting the source content of relative sources with a "./"
+  prefix. See issue #145 and [Bug 1090768](bugzil.la/1090768).
+
+* Add the `SourceMapConsumer.prototype.computeColumnSpans` method to compute the
+  column span of each mapping.
+
+* Add the `SourceMapConsumer.prototype.allGeneratedPositionsFor` method to find
+  all generated positions associated with a given original source and line.
+
+## 0.1.40
+
+* Performance improvements for parsing source maps in SourceMapConsumer.
+
+## 0.1.39
+
+* Fix a bug where setting a source's contents to null before any source content
+  had been set before threw a TypeError. See issue #131.
+
+## 0.1.38
+
+* Fix a bug where finding relative paths from an empty path were creating
+  absolute paths. See issue #129.
+
+## 0.1.37
+
+* Fix a bug where if the source root was an empty string, relative source paths
+  would turn into absolute source paths. Issue #124.
+
+## 0.1.36
+
+* Allow the `names` mapping property to be an empty string. Issue #121.
+
+## 0.1.35
+
+* A third optional parameter was added to `SourceNode.fromStringWithSourceMap`
+  to specify a path that relative sources in the second parameter should be
+  relative to. Issue #105.
+
+* If no file property is given to a `SourceMapGenerator`, then the resulting
+  source map will no longer have a `null` file property. The property will
+  simply not exist. Issue #104.
+
+* Fixed a bug where consecutive newlines were ignored in `SourceNode`s.
+  Issue #116.
+
+## 0.1.34
+
+* Make `SourceNode` work with windows style ("\r\n") newlines. Issue #103.
+
+* Fix bug involving source contents and the
+  `SourceMapGenerator.prototype.applySourceMap`. Issue #100.
+
+## 0.1.33
+
+* Fix some edge cases surrounding path joining and URL resolution.
+
+* Add a third parameter for relative path to
+  `SourceMapGenerator.prototype.applySourceMap`.
+
+* Fix issues with mappings and EOLs.
+
+## 0.1.32
+
+* Fixed a bug where SourceMapConsumer couldn't handle negative relative columns
+  (issue 92).
+
+* Fixed test runner to actually report number of failed tests as its process
+  exit code.
+
+* Fixed a typo when reporting bad mappings (issue 87).
+
+## 0.1.31
+
+* Delay parsing the mappings in SourceMapConsumer until queried for a source
+  location.
+
+* Support Sass source maps (which at the time of writing deviate from the spec
+  in small ways) in SourceMapConsumer.
+
+## 0.1.30
+
+* Do not join source root with a source, when the source is a data URI.
+
+* Extend the test runner to allow running single specific test files at a time.
+
+* Performance improvements in `SourceNode.prototype.walk` and
+  `SourceMapConsumer.prototype.eachMapping`.
+
+* Source map browser builds will now work inside Workers.
+
+* Better error messages when attempting to add an invalid mapping to a
+  `SourceMapGenerator`.
+
+## 0.1.29
+
+* Allow duplicate entries in the `names` and `sources` arrays of source maps
+  (usually from TypeScript) we are parsing. Fixes github issue 72.
+
+## 0.1.28
+
+* Skip duplicate mappings when creating source maps from SourceNode; github
+  issue 75.
+
+## 0.1.27
+
+* Don't throw an error when the `file` property is missing in SourceMapConsumer,
+  we don't use it anyway.
+
+## 0.1.26
+
+* Fix SourceNode.fromStringWithSourceMap for empty maps. Fixes github issue 70.
+
+## 0.1.25
+
+* Make compatible with browserify
+
+## 0.1.24
+
+* Fix issue with absolute paths and `file://` URIs. See
+  https://bugzilla.mozilla.org/show_bug.cgi?id=885597
+
+## 0.1.23
+
+* Fix issue with absolute paths and sourcesContent, github issue 64.
+
+## 0.1.22
+
+* Ignore duplicate mappings in SourceMapGenerator. Fixes github issue 21.
+
+## 0.1.21
+
+* Fixed handling of sources that start with a slash so that they are relative to
+  the source root's host.
+
+## 0.1.20
+
+* Fixed github issue #43: absolute URLs aren't joined with the source root
+  anymore.
+
+## 0.1.19
+
+* Using Travis CI to run tests.
+
+## 0.1.18
+
+* Fixed a bug in the handling of sourceRoot.
+
+## 0.1.17
+
+* Added SourceNode.fromStringWithSourceMap.
+
+## 0.1.16
+
+* Added missing documentation.
+
+* Fixed the generating of empty mappings in SourceNode.
+
+## 0.1.15
+
+* Added SourceMapGenerator.applySourceMap.
+
+## 0.1.14
+
+* The sourceRoot is now handled consistently.
+
+## 0.1.13
+
+* Added SourceMapGenerator.fromSourceMap.
+
+## 0.1.12
+
+* SourceNode now generates empty mappings too.
+
+## 0.1.11
+
+* Added name support to SourceNode.
+
+## 0.1.10
+
+* Added sourcesContent support to the customer and generator.
diff --git a/node_modules/recast/node_modules/source-map/LICENSE b/node_modules/recast/node_modules/source-map/LICENSE
new file mode 100644
index 0000000..ed1b7cf
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/LICENSE
@@ -0,0 +1,28 @@
+
+Copyright (c) 2009-2011, Mozilla Foundation and contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the names of the Mozilla Foundation nor the names of project
+  contributors may be used to endorse or promote products derived from this
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/recast/node_modules/source-map/README.md b/node_modules/recast/node_modules/source-map/README.md
new file mode 100644
index 0000000..fea4beb
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/README.md
@@ -0,0 +1,742 @@
+# Source Map
+
+[![Build Status](https://travis-ci.org/mozilla/source-map.png?branch=master)](https://travis-ci.org/mozilla/source-map)
+
+[![NPM](https://nodei.co/npm/source-map.png?downloads=true&downloadRank=true)](https://www.npmjs.com/package/source-map)
+
+This is a library to generate and consume the source map format
+[described here][format].
+
+[format]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit
+
+## Use with Node
+
+    $ npm install source-map
+
+## Use on the Web
+
+    <script src="https://raw.githubusercontent.com/mozilla/source-map/master/dist/source-map.min.js" defer></script>
+
+--------------------------------------------------------------------------------
+
+<!-- `npm run toc` to regenerate the Table of Contents -->
+
+<!-- START doctoc generated TOC please keep comment here to allow auto update -->
+<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE -->
+## Table of Contents
+
+- [Examples](#examples)
+  - [Consuming a source map](#consuming-a-source-map)
+  - [Generating a source map](#generating-a-source-map)
+    - [With SourceNode (high level API)](#with-sourcenode-high-level-api)
+    - [With SourceMapGenerator (low level API)](#with-sourcemapgenerator-low-level-api)
+- [API](#api)
+  - [SourceMapConsumer](#sourcemapconsumer)
+    - [new SourceMapConsumer(rawSourceMap)](#new-sourcemapconsumerrawsourcemap)
+    - [SourceMapConsumer.prototype.computeColumnSpans()](#sourcemapconsumerprototypecomputecolumnspans)
+    - [SourceMapConsumer.prototype.originalPositionFor(generatedPosition)](#sourcemapconsumerprototypeoriginalpositionforgeneratedposition)
+    - [SourceMapConsumer.prototype.generatedPositionFor(originalPosition)](#sourcemapconsumerprototypegeneratedpositionfororiginalposition)
+    - [SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)](#sourcemapconsumerprototypeallgeneratedpositionsfororiginalposition)
+    - [SourceMapConsumer.prototype.hasContentsOfAllSources()](#sourcemapconsumerprototypehascontentsofallsources)
+    - [SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])](#sourcemapconsumerprototypesourcecontentforsource-returnnullonmissing)
+    - [SourceMapConsumer.prototype.eachMapping(callback, context, order)](#sourcemapconsumerprototypeeachmappingcallback-context-order)
+  - [SourceMapGenerator](#sourcemapgenerator)
+    - [new SourceMapGenerator([startOfSourceMap])](#new-sourcemapgeneratorstartofsourcemap)
+    - [SourceMapGenerator.fromSourceMap(sourceMapConsumer)](#sourcemapgeneratorfromsourcemapsourcemapconsumer)
+    - [SourceMapGenerator.prototype.addMapping(mapping)](#sourcemapgeneratorprototypeaddmappingmapping)
+    - [SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)](#sourcemapgeneratorprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])](#sourcemapgeneratorprototypeapplysourcemapsourcemapconsumer-sourcefile-sourcemappath)
+    - [SourceMapGenerator.prototype.toString()](#sourcemapgeneratorprototypetostring)
+  - [SourceNode](#sourcenode)
+    - [new SourceNode([line, column, source[, chunk[, name]]])](#new-sourcenodeline-column-source-chunk-name)
+    - [SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])](#sourcenodefromstringwithsourcemapcode-sourcemapconsumer-relativepath)
+    - [SourceNode.prototype.add(chunk)](#sourcenodeprototypeaddchunk)
+    - [SourceNode.prototype.prepend(chunk)](#sourcenodeprototypeprependchunk)
+    - [SourceNode.prototype.setSourceContent(sourceFile, sourceContent)](#sourcenodeprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceNode.prototype.walk(fn)](#sourcenodeprototypewalkfn)
+    - [SourceNode.prototype.walkSourceContents(fn)](#sourcenodeprototypewalksourcecontentsfn)
+    - [SourceNode.prototype.join(sep)](#sourcenodeprototypejoinsep)
+    - [SourceNode.prototype.replaceRight(pattern, replacement)](#sourcenodeprototypereplacerightpattern-replacement)
+    - [SourceNode.prototype.toString()](#sourcenodeprototypetostring)
+    - [SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])](#sourcenodeprototypetostringwithsourcemapstartofsourcemap)
+
+<!-- END doctoc generated TOC please keep comment here to allow auto update -->
+
+## Examples
+
+### Consuming a source map
+
+```js
+var rawSourceMap = {
+  version: 3,
+  file: 'min.js',
+  names: ['bar', 'baz', 'n'],
+  sources: ['one.js', 'two.js'],
+  sourceRoot: 'http://example.com/www/js/',
+  mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'
+};
+
+var smc = new SourceMapConsumer(rawSourceMap);
+
+console.log(smc.sources);
+// [ 'http://example.com/www/js/one.js',
+//   'http://example.com/www/js/two.js' ]
+
+console.log(smc.originalPositionFor({
+  line: 2,
+  column: 28
+}));
+// { source: 'http://example.com/www/js/two.js',
+//   line: 2,
+//   column: 10,
+//   name: 'n' }
+
+console.log(smc.generatedPositionFor({
+  source: 'http://example.com/www/js/two.js',
+  line: 2,
+  column: 10
+}));
+// { line: 2, column: 28 }
+
+smc.eachMapping(function (m) {
+  // ...
+});
+```
+
+### Generating a source map
+
+In depth guide:
+[**Compiling to JavaScript, and Debugging with Source Maps**](https://hacks.mozilla.org/2013/05/compiling-to-javascript-and-debugging-with-source-maps/)
+
+#### With SourceNode (high level API)
+
+```js
+function compile(ast) {
+  switch (ast.type) {
+  case 'BinaryExpression':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      [compile(ast.left), " + ", compile(ast.right)]
+    );
+  case 'Literal':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      String(ast.value)
+    );
+  // ...
+  default:
+    throw new Error("Bad AST");
+  }
+}
+
+var ast = parse("40 + 2", "add.js");
+console.log(compile(ast).toStringWithSourceMap({
+  file: 'add.js'
+}));
+// { code: '40 + 2',
+//   map: [object SourceMapGenerator] }
+```
+
+#### With SourceMapGenerator (low level API)
+
+```js
+var map = new SourceMapGenerator({
+  file: "source-mapped.js"
+});
+
+map.addMapping({
+  generated: {
+    line: 10,
+    column: 35
+  },
+  source: "foo.js",
+  original: {
+    line: 33,
+    column: 2
+  },
+  name: "christopher"
+});
+
+console.log(map.toString());
+// '{"version":3,"file":"source-mapped.js","sources":["foo.js"],"names":["christopher"],"mappings":";;;;;;;;;mCAgCEA"}'
+```
+
+## API
+
+Get a reference to the module:
+
+```js
+// Node.js
+var sourceMap = require('source-map');
+
+// Browser builds
+var sourceMap = window.sourceMap;
+
+// Inside Firefox
+const sourceMap = require("devtools/toolkit/sourcemap/source-map.js");
+```
+
+### SourceMapConsumer
+
+A SourceMapConsumer instance represents a parsed source map which we can query
+for information about the original file positions by giving it a file position
+in the generated source.
+
+#### new SourceMapConsumer(rawSourceMap)
+
+The only parameter is the raw source map (either as a string which can be
+`JSON.parse`'d, or an object). According to the spec, source maps have the
+following attributes:
+
+* `version`: Which version of the source map spec this map is following.
+
+* `sources`: An array of URLs to the original source files.
+
+* `names`: An array of identifiers which can be referenced by individual
+  mappings.
+
+* `sourceRoot`: Optional. The URL root from which all sources are relative.
+
+* `sourcesContent`: Optional. An array of contents of the original source files.
+
+* `mappings`: A string of base64 VLQs which contain the actual mappings.
+
+* `file`: Optional. The generated filename this source map is associated with.
+
+```js
+var consumer = new sourceMap.SourceMapConsumer(rawSourceMapJsonData);
+```
+
+#### SourceMapConsumer.prototype.computeColumnSpans()
+
+Compute the last column for each generated mapping. The last column is
+inclusive.
+
+```js
+// Before:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+
+consumer.computeColumnSpans();
+
+// After:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1,
+//     lastColumn: 9 },
+//   { line: 2,
+//     column: 10,
+//     lastColumn: 19 },
+//   { line: 2,
+//     column: 20,
+//     lastColumn: Infinity } ]
+
+```
+
+#### SourceMapConsumer.prototype.originalPositionFor(generatedPosition)
+
+Returns the original source, line, and column information for the generated
+source's line and column positions provided. The only argument is an object with
+the following properties:
+
+* `line`: The line number in the generated source.  Line numbers in
+  this library are 1-based (note that the underlying source map
+  specification uses 0-based line numbers -- this library handles the
+  translation).
+
+* `column`: The column number in the generated source.  Column numbers
+  in this library are 0-based.
+
+* `bias`: Either `SourceMapConsumer.GREATEST_LOWER_BOUND` or
+  `SourceMapConsumer.LEAST_UPPER_BOUND`. Specifies whether to return the closest
+  element that is smaller than or greater than the one we are searching for,
+  respectively, if the exact element cannot be found.  Defaults to
+  `SourceMapConsumer.GREATEST_LOWER_BOUND`.
+
+and an object is returned with the following properties:
+
+* `source`: The original source file, or null if this information is not
+  available.
+
+* `line`: The line number in the original source, or null if this information is
+  not available.  The line number is 1-based.
+
+* `column`: The column number in the original source, or null if this
+  information is not available.  The column number is 0-based.
+
+* `name`: The original identifier, or null if this information is not available.
+
+```js
+consumer.originalPositionFor({ line: 2, column: 10 })
+// { source: 'foo.coffee',
+//   line: 2,
+//   column: 2,
+//   name: null }
+
+consumer.originalPositionFor({ line: 99999999999999999, column: 999999999999999 })
+// { source: null,
+//   line: null,
+//   column: null,
+//   name: null }
+```
+
+#### SourceMapConsumer.prototype.generatedPositionFor(originalPosition)
+
+Returns the generated line and column information for the original source,
+line, and column positions provided. The only argument is an object with
+the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: The column number in the original source.  The column
+  number is 0-based.
+
+and an object is returned with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.generatedPositionFor({ source: "example.js", line: 2, column: 10 })
+// { line: 1,
+//   column: 56 }
+```
+
+#### SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)
+
+Returns all generated line and column information for the original source, line,
+and column provided. If no column is provided, returns all mappings
+corresponding to a either the line we are searching for or the next closest line
+that has any mappings. Otherwise, returns all mappings corresponding to the
+given line and either the column we are searching for or the next closest column
+that has any offsets.
+
+The only argument is an object with the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: Optional. The column number in the original source.  The
+  column number is 0-based.
+
+and an array of objects is returned, each with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.allGeneratedpositionsfor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+```
+
+#### SourceMapConsumer.prototype.hasContentsOfAllSources()
+
+Return true if we have the embedded source content for every source listed in
+the source map, false otherwise.
+
+In other words, if this method returns `true`, then
+`consumer.sourceContentFor(s)` will succeed for every source `s` in
+`consumer.sources`.
+
+```js
+// ...
+if (consumer.hasContentsOfAllSources()) {
+  consumerReadyCallback(consumer);
+} else {
+  fetchSources(consumer, consumerReadyCallback);
+}
+// ...
+```
+
+#### SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])
+
+Returns the original source content for the source provided. The only
+argument is the URL of the original source file.
+
+If the source content for the given source is not found, then an error is
+thrown. Optionally, pass `true` as the second param to have `null` returned
+instead.
+
+```js
+consumer.sources
+// [ "my-cool-lib.clj" ]
+
+consumer.sourceContentFor("my-cool-lib.clj")
+// "..."
+
+consumer.sourceContentFor("this is not in the source map");
+// Error: "this is not in the source map" is not in the source map
+
+consumer.sourceContentFor("this is not in the source map", true);
+// null
+```
+
+#### SourceMapConsumer.prototype.eachMapping(callback, context, order)
+
+Iterate over each mapping between an original source/line/column and a
+generated line/column in this source map.
+
+* `callback`: The function that is called with each mapping. Mappings have the
+  form `{ source, generatedLine, generatedColumn, originalLine, originalColumn,
+  name }`
+
+* `context`: Optional. If specified, this object will be the value of `this`
+  every time that `callback` is called.
+
+* `order`: Either `SourceMapConsumer.GENERATED_ORDER` or
+  `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to iterate over
+  the mappings sorted by the generated file's line/column order or the
+  original's source/line/column order, respectively. Defaults to
+  `SourceMapConsumer.GENERATED_ORDER`.
+
+```js
+consumer.eachMapping(function (m) { console.log(m); })
+// ...
+// { source: 'illmatic.js',
+//   generatedLine: 1,
+//   generatedColumn: 0,
+//   originalLine: 1,
+//   originalColumn: 0,
+//   name: null }
+// { source: 'illmatic.js',
+//   generatedLine: 2,
+//   generatedColumn: 0,
+//   originalLine: 2,
+//   originalColumn: 0,
+//   name: null }
+// ...
+```
+### SourceMapGenerator
+
+An instance of the SourceMapGenerator represents a source map which is being
+built incrementally.
+
+#### new SourceMapGenerator([startOfSourceMap])
+
+You may pass an object with the following properties:
+
+* `file`: The filename of the generated source that this source map is
+  associated with.
+
+* `sourceRoot`: A root for all relative URLs in this source map.
+
+* `skipValidation`: Optional. When `true`, disables validation of mappings as
+  they are added. This can improve performance but should be used with
+  discretion, as a last resort. Even then, one should avoid using this flag when
+  running tests, if possible.
+
+```js
+var generator = new sourceMap.SourceMapGenerator({
+  file: "my-generated-javascript-file.js",
+  sourceRoot: "http://example.com/app/js/"
+});
+```
+
+#### SourceMapGenerator.fromSourceMap(sourceMapConsumer)
+
+Creates a new `SourceMapGenerator` from an existing `SourceMapConsumer` instance.
+
+* `sourceMapConsumer` The SourceMap.
+
+```js
+var generator = sourceMap.SourceMapGenerator.fromSourceMap(consumer);
+```
+
+#### SourceMapGenerator.prototype.addMapping(mapping)
+
+Add a single mapping from original source line and column to the generated
+source's line and column for this source map being created. The mapping object
+should have the following properties:
+
+* `generated`: An object with the generated line and column positions.
+
+* `original`: An object with the original line and column positions.
+
+* `source`: The original source file (relative to the sourceRoot).
+
+* `name`: An optional original token name for this mapping.
+
+```js
+generator.addMapping({
+  source: "module-one.scm",
+  original: { line: 128, column: 0 },
+  generated: { line: 3, column: 456 }
+})
+```
+
+#### SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for an original source file.
+
+* `sourceFile` the URL of the original source file.
+
+* `sourceContent` the content of the source file.
+
+```js
+generator.setSourceContent("module-one.scm",
+                           fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])
+
+Applies a SourceMap for a source file to the SourceMap.
+Each mapping to the supplied source file is rewritten using the
+supplied SourceMap. Note: The resolution for the resulting mappings
+is the minimum of this map and the supplied map.
+
+* `sourceMapConsumer`: The SourceMap to be applied.
+
+* `sourceFile`: Optional. The filename of the source file.
+  If omitted, sourceMapConsumer.file will be used, if it exists.
+  Otherwise an error will be thrown.
+
+* `sourceMapPath`: Optional. The dirname of the path to the SourceMap
+  to be applied. If relative, it is relative to the SourceMap.
+
+  This parameter is needed when the two SourceMaps aren't in the same
+  directory, and the SourceMap to be applied contains relative source
+  paths. If so, those relative source paths need to be rewritten
+  relative to the SourceMap.
+
+  If omitted, it is assumed that both SourceMaps are in the same directory,
+  thus not needing any rewriting. (Supplying `'.'` has the same effect.)
+
+#### SourceMapGenerator.prototype.toString()
+
+Renders the source map being generated to a string.
+
+```js
+generator.toString()
+// '{"version":3,"sources":["module-one.scm"],"names":[],"mappings":"...snip...","file":"my-generated-javascript-file.js","sourceRoot":"http://example.com/app/js/"}'
+```
+
+### SourceNode
+
+SourceNodes provide a way to abstract over interpolating and/or concatenating
+snippets of generated JavaScript source code, while maintaining the line and
+column information associated between those snippets and the original source
+code. This is useful as the final intermediate representation a compiler might
+use before outputting the generated JS and source map.
+
+#### new SourceNode([line, column, source[, chunk[, name]]])
+
+* `line`: The original line number associated with this source node, or null if
+  it isn't associated with an original line.  The line number is 1-based.
+
+* `column`: The original column number associated with this source node, or null
+  if it isn't associated with an original column.  The column number
+  is 0-based.
+
+* `source`: The original source's filename; null if no filename is provided.
+
+* `chunk`: Optional. Is immediately passed to `SourceNode.prototype.add`, see
+  below.
+
+* `name`: Optional. The original identifier.
+
+```js
+var node = new SourceNode(1, 2, "a.cpp", [
+  new SourceNode(3, 4, "b.cpp", "extern int status;\n"),
+  new SourceNode(5, 6, "c.cpp", "std::string* make_string(size_t n);\n"),
+  new SourceNode(7, 8, "d.cpp", "int main(int argc, char** argv) {}\n"),
+]);
+```
+
+#### SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])
+
+Creates a SourceNode from generated code and a SourceMapConsumer.
+
+* `code`: The generated code
+
+* `sourceMapConsumer` The SourceMap for the generated code
+
+* `relativePath` The optional path that relative sources in `sourceMapConsumer`
+  should be relative to.
+
+```js
+var consumer = new SourceMapConsumer(fs.readFileSync("path/to/my-file.js.map", "utf8"));
+var node = SourceNode.fromStringWithSourceMap(fs.readFileSync("path/to/my-file.js"),
+                                              consumer);
+```
+
+#### SourceNode.prototype.add(chunk)
+
+Add a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.add(" + ");
+node.add(otherNode);
+node.add([leftHandOperandNode, " + ", rightHandOperandNode]);
+```
+
+#### SourceNode.prototype.prepend(chunk)
+
+Prepend a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.prepend("/** Build Id: f783haef86324gf **/\n\n");
+```
+
+#### SourceNode.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for a source file. This will be added to the
+`SourceMap` in the `sourcesContent` field.
+
+* `sourceFile`: The filename of the source file
+
+* `sourceContent`: The content of the source file
+
+```js
+node.setSourceContent("module-one.scm",
+                      fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceNode.prototype.walk(fn)
+
+Walk over the tree of JS snippets in this node and its children. The walking
+function is called once for each snippet of JS and is passed that snippet and
+the its original associated source's line/column location.
+
+* `fn`: The traversal function.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.walk(function (code, loc) { console.log("WALK:", code, loc); })
+// WALK: uno { source: 'b.js', line: 3, column: 4, name: null }
+// WALK: dos { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: tres { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: quatro { source: 'c.js', line: 5, column: 6, name: null }
+```
+
+#### SourceNode.prototype.walkSourceContents(fn)
+
+Walk over the tree of SourceNodes. The walking function is called for each
+source file content and is passed the filename and source content.
+
+* `fn`: The traversal function.
+
+```js
+var a = new SourceNode(1, 2, "a.js", "generated from a");
+a.setSourceContent("a.js", "original a");
+var b = new SourceNode(1, 2, "b.js", "generated from b");
+b.setSourceContent("b.js", "original b");
+var c = new SourceNode(1, 2, "c.js", "generated from c");
+c.setSourceContent("c.js", "original c");
+
+var node = new SourceNode(null, null, null, [a, b, c]);
+node.walkSourceContents(function (source, contents) { console.log("WALK:", source, ":", contents); })
+// WALK: a.js : original a
+// WALK: b.js : original b
+// WALK: c.js : original c
+```
+
+#### SourceNode.prototype.join(sep)
+
+Like `Array.prototype.join` except for SourceNodes. Inserts the separator
+between each of this source node's children.
+
+* `sep`: The separator.
+
+```js
+var lhs = new SourceNode(1, 2, "a.rs", "my_copy");
+var operand = new SourceNode(3, 4, "a.rs", "=");
+var rhs = new SourceNode(5, 6, "a.rs", "orig.clone()");
+
+var node = new SourceNode(null, null, null, [ lhs, operand, rhs ]);
+var joinedNode = node.join(" ");
+```
+
+#### SourceNode.prototype.replaceRight(pattern, replacement)
+
+Call `String.prototype.replace` on the very right-most source snippet. Useful
+for trimming white space from the end of a source node, etc.
+
+* `pattern`: The pattern to replace.
+
+* `replacement`: The thing to replace the pattern with.
+
+```js
+// Trim trailing white space.
+node.replaceRight(/\s*$/, "");
+```
+
+#### SourceNode.prototype.toString()
+
+Return the string representation of this source node. Walks over the tree and
+concatenates all the various snippets together to one string.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toString()
+// 'unodostresquatro'
+```
+
+#### SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])
+
+Returns the string representation of this tree of source nodes, plus a
+SourceMapGenerator which contains all the mappings between the generated and
+original sources.
+
+The arguments are the same as those to `new SourceMapGenerator`.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toStringWithSourceMap({ file: "my-output-file.js" })
+// { code: 'unodostresquatro',
+//   map: [object SourceMapGenerator] }
+```
diff --git a/node_modules/recast/node_modules/source-map/dist/source-map.debug.js b/node_modules/recast/node_modules/source-map/dist/source-map.debug.js
new file mode 100644
index 0000000..aad0620
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/dist/source-map.debug.js
@@ -0,0 +1,3234 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory();
+	else
+		root["sourceMap"] = factory();
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId])
+/******/ 			return installedModules[moduleId].exports;
+/******/
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			exports: {},
+/******/ 			id: moduleId,
+/******/ 			loaded: false
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.loaded = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(0);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	exports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;
+	exports.SourceNode = __webpack_require__(10).SourceNode;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var base64VLQ = __webpack_require__(2);
+	var util = __webpack_require__(4);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var MappingList = __webpack_require__(6).MappingList;
+	
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	function SourceMapGenerator(aArgs) {
+	  if (!aArgs) {
+	    aArgs = {};
+	  }
+	  this._file = util.getArg(aArgs, 'file', null);
+	  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+	  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	  this._mappings = new MappingList();
+	  this._sourcesContents = null;
+	}
+	
+	SourceMapGenerator.prototype._version = 3;
+	
+	/**
+	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	 *
+	 * @param aSourceMapConsumer The SourceMap.
+	 */
+	SourceMapGenerator.fromSourceMap =
+	  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+	    var sourceRoot = aSourceMapConsumer.sourceRoot;
+	    var generator = new SourceMapGenerator({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot: sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      var newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+	
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util.relative(sourceRoot, newMapping.source);
+	        }
+	
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+	
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+	
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util.relative(sourceRoot, sourceFile);
+	      }
+	
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+	
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  };
+	
+	/**
+	 * Add a single mapping from original source line and column to the generated
+	 * source's line and column for this source map being created. The mapping
+	 * object should have the following properties:
+	 *
+	 *   - generated: An object with the generated line and column positions.
+	 *   - original: An object with the original line and column positions.
+	 *   - source: The original source file (relative to the sourceRoot).
+	 *   - name: An optional original token name for this mapping.
+	 */
+	SourceMapGenerator.prototype.addMapping =
+	  function SourceMapGenerator_addMapping(aArgs) {
+	    var generated = util.getArg(aArgs, 'generated');
+	    var original = util.getArg(aArgs, 'original', null);
+	    var source = util.getArg(aArgs, 'source', null);
+	    var name = util.getArg(aArgs, 'name', null);
+	
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+	
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+	
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+	
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source: source,
+	      name: name
+	    });
+	  };
+	
+	/**
+	 * Set the source content for a source file.
+	 */
+	SourceMapGenerator.prototype.setSourceContent =
+	  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+	    var source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util.relative(this._sourceRoot, source);
+	    }
+	
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  };
+	
+	/**
+	 * Applies the mappings of a sub-source-map for a specific source file to the
+	 * source map being generated. Each mapping to the supplied source file is
+	 * rewritten using the supplied source map. Note: The resolution for the
+	 * resulting mappings is the minimium of this map and the supplied map.
+	 *
+	 * @param aSourceMapConsumer The source map to be applied.
+	 * @param aSourceFile Optional. The filename of the source file.
+	 *        If omitted, SourceMapConsumer's file property will be used.
+	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	 *        This parameter is needed when the two source maps aren't in the same
+	 *        directory, and the source map to be applied contains relative source
+	 *        paths. If so, those relative source paths need to be rewritten
+	 *        relative to the SourceMapGenerator.
+	 */
+	SourceMapGenerator.prototype.applySourceMap =
+	  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    var sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    var sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    var newSources = new ArraySet();
+	    var newNames = new ArraySet();
+	
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function (mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        var original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util.join(aSourceMapPath, mapping.source)
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+	
+	      var source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+	
+	      var name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+	
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+	
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          sourceFile = util.join(aSourceMapPath, sourceFile);
+	        }
+	        if (sourceRoot != null) {
+	          sourceFile = util.relative(sourceRoot, sourceFile);
+	        }
+	        this.setSourceContent(sourceFile, content);
+	      }
+	    }, this);
+	  };
+	
+	/**
+	 * A mapping can have one of the three levels of data:
+	 *
+	 *   1. Just the generated position.
+	 *   2. The Generated position, original position, and original source.
+	 *   3. Generated and original position, original source, as well as a name
+	 *      token.
+	 *
+	 * To maintain consistency, we validate that any new mapping being added falls
+	 * in to one of these categories.
+	 */
+	SourceMapGenerator.prototype._validateMapping =
+	  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+	                                              aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+	        throw new Error(
+	            'original.line and original.column are not numbers -- you probably meant to omit ' +
+	            'the original mapping entirely and only map the generated position. If so, pass ' +
+	            'null for the original mapping instead of an object with empty or null values.'
+	        );
+	    }
+	
+	    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) {
+	      // Case 1.
+	      return;
+	    }
+	    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) {
+	      // Cases 2 and 3.
+	      return;
+	    }
+	    else {
+	      throw new Error('Invalid mapping: ' + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  };
+	
+	/**
+	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	 * specified by the source map format.
+	 */
+	SourceMapGenerator.prototype._serializeMappings =
+	  function SourceMapGenerator_serializeMappings() {
+	    var previousGeneratedColumn = 0;
+	    var previousGeneratedLine = 1;
+	    var previousOriginalColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousName = 0;
+	    var previousSource = 0;
+	    var result = '';
+	    var next;
+	    var mapping;
+	    var nameIdx;
+	    var sourceIdx;
+	
+	    var mappings = this._mappings.toArray();
+	    for (var i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = ''
+	
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ';';
+	          previousGeneratedLine++;
+	        }
+	      }
+	      else {
+	        if (i > 0) {
+	          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	            continue;
+	          }
+	          next += ',';
+	        }
+	      }
+	
+	      next += base64VLQ.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+	
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64VLQ.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+	
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64VLQ.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+	
+	        next += base64VLQ.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+	
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64VLQ.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+	
+	      result += next;
+	    }
+	
+	    return result;
+	  };
+	
+	SourceMapGenerator.prototype._generateSourcesContent =
+	  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function (source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util.relative(aSourceRoot, source);
+	      }
+	      var key = util.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  };
+	
+	/**
+	 * Externalize the source map.
+	 */
+	SourceMapGenerator.prototype.toJSON =
+	  function SourceMapGenerator_toJSON() {
+	    var map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+	
+	    return map;
+	  };
+	
+	/**
+	 * Render the source map being generated to a string.
+	 */
+	SourceMapGenerator.prototype.toString =
+	  function SourceMapGenerator_toString() {
+	    return JSON.stringify(this.toJSON());
+	  };
+	
+	exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+	
+	var base64 = __webpack_require__(3);
+	
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+	
+	var VLQ_BASE_SHIFT = 5;
+	
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+	
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+	
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+	
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+	
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+	
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	exports.encode = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+	
+	  var vlq = toVLQSigned(aValue);
+	
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+	
+	  return encoded;
+	};
+	
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+	
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+	
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+	
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+	
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+	
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	exports.encode = function (number) {
+	  if (0 <= number && number < intToCharMap.length) {
+	    return intToCharMap[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+	
+	/**
+	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+	 * failure.
+	 */
+	exports.decode = function (charCode) {
+	  var bigA = 65;     // 'A'
+	  var bigZ = 90;     // 'Z'
+	
+	  var littleA = 97;  // 'a'
+	  var littleZ = 122; // 'z'
+	
+	  var zero = 48;     // '0'
+	  var nine = 57;     // '9'
+	
+	  var plus = 43;     // '+'
+	  var slash = 47;    // '/'
+	
+	  var littleOffset = 26;
+	  var numberOffset = 52;
+	
+	  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+	  if (bigA <= charCode && charCode <= bigZ) {
+	    return (charCode - bigA);
+	  }
+	
+	  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+	  if (littleA <= charCode && charCode <= littleZ) {
+	    return (charCode - littleA + littleOffset);
+	  }
+	
+	  // 52 - 61: 0123456789
+	  if (zero <= charCode && charCode <= nine) {
+	    return (charCode - zero + numberOffset);
+	  }
+	
+	  // 62: +
+	  if (charCode == plus) {
+	    return 62;
+	  }
+	
+	  // 63: /
+	  if (charCode == slash) {
+	    return 63;
+	  }
+	
+	  // Invalid base64 digit.
+	  return -1;
+	};
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  } else {
+	    throw new Error('"' + aName + '" is a required argument.');
+	  }
+	}
+	exports.getArg = getArg;
+	
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+	
+	function urlParse(aUrl) {
+	  var match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+	
+	function urlGenerate(aParsedUrl) {
+	  var url = '';
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ':';
+	  }
+	  url += '//';
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + '@';
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+	
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	function normalize(aPath) {
+	  var path = aPath;
+	  var url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  var isAbsolute = exports.isAbsolute(path);
+	
+	  var parts = path.split(/\/+/);
+	  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+	    part = parts[i];
+	    if (part === '.') {
+	      parts.splice(i, 1);
+	    } else if (part === '..') {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === '') {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join('/');
+	
+	  if (path === '') {
+	    path = isAbsolute ? '/' : '.';
+	  }
+	
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	}
+	exports.normalize = normalize;
+	
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  var aPathUrl = urlParse(aPath);
+	  var aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || '/';
+	  }
+	
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+	
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+	
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+	
+	  var joined = aPath.charAt(0) === '/'
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+	
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+	
+	exports.isAbsolute = function (aPath) {
+	  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+	};
+	
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	
+	  aRoot = aRoot.replace(/\/$/, '');
+	
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  var level = 0;
+	  while (aPath.indexOf(aRoot + '/') !== 0) {
+	    var index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+	
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+	
+	    ++level;
+	  }
+	
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+	
+	var supportsNullProto = (function () {
+	  var obj = Object.create(null);
+	  return !('__proto__' in obj);
+	}());
+	
+	function identity (s) {
+	  return s;
+	}
+	
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return '$' + aStr;
+	  }
+	
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+	
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+	
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+	
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+	
+	  var length = s.length;
+	
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+	
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+	
+	  for (var i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+	
+	  return true;
+	}
+	
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  var cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+	
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+	
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+	
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+	
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+	
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+	
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+	
+	  return -1;
+	}
+	
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+	
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+	
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+	
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || '';
+	
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+	      sourceRoot += '/';
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+	
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    var parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      var index = parsed.path.lastIndexOf('/');
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+	
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+	
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+	
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+	
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+	
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+	
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+	
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+	
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+	
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+	
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+	
+	exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter(mappingA, mappingB) {
+	  // Optimized for most common case
+	  var lineA = mappingA.generatedLine;
+	  var lineB = mappingB.generatedLine;
+	  var columnA = mappingA.generatedColumn;
+	  var columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+	
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a neglibable overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	function MappingList() {
+	  this._array = [];
+	  this._sorted = true;
+	  // Serves as infimum
+	  this._last = {generatedLine: -1, generatedColumn: 0};
+	}
+	
+	/**
+	 * Iterate through internal items. This method takes the same arguments that
+	 * `Array.prototype.forEach` takes.
+	 *
+	 * NOTE: The order of the mappings is NOT guaranteed.
+	 */
+	MappingList.prototype.unsortedForEach =
+	  function MappingList_forEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  };
+	
+	/**
+	 * Add the given source mapping.
+	 *
+	 * @param Object aMapping
+	 */
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+	  if (generatedPositionAfter(this._last, aMapping)) {
+	    this._last = aMapping;
+	    this._array.push(aMapping);
+	  } else {
+	    this._sorted = false;
+	    this._array.push(aMapping);
+	  }
+	};
+	
+	/**
+	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+	 * generated position.
+	 *
+	 * WARNING: This method returns internal data without copying, for
+	 * performance. The return value must NOT be mutated, and should be treated as
+	 * an immutable borrow. If you want to take ownership, you must make your own
+	 * copy.
+	 */
+	MappingList.prototype.toArray = function MappingList_toArray() {
+	  if (!this._sorted) {
+	    this._array.sort(util.compareByGeneratedPositionsInflated);
+	    this._sorted = true;
+	  }
+	  return this._array;
+	};
+	
+	exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var util = __webpack_require__(4);
+	var binarySearch = __webpack_require__(8);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var base64VLQ = __webpack_require__(2);
+	var quickSort = __webpack_require__(9).quickSort;
+	
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  return sourceMap.sections != null
+	    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+	    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+	
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	}
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer.prototype._version = 3;
+	
+	// `__generatedMappings` and `__originalMappings` are arrays that hold the
+	// parsed mapping coordinates from the source map's "mappings" attribute. They
+	// are lazily instantiated, accessed via the `_generatedMappings` and
+	// `_originalMappings` getters respectively, and we only parse the mappings
+	// and create these arrays once queried for a source location. We jump through
+	// these hoops because there can be many thousands of mappings, and parsing
+	// them is expensive, so we only want to do it if we must.
+	//
+	// Each object in the arrays is of the form:
+	//
+	//     {
+	//       generatedLine: The line number in the generated code,
+	//       generatedColumn: The column number in the generated code,
+	//       source: The path to the original source file that generated this
+	//               chunk of code,
+	//       originalLine: The line number in the original source that
+	//                     corresponds to this chunk of generated code,
+	//       originalColumn: The column number in the original source that
+	//                       corresponds to this chunk of generated code,
+	//       name: The name of the original symbol which generated this chunk of
+	//             code.
+	//     }
+	//
+	// All properties except for `generatedLine` and `generatedColumn` can be
+	// `null`.
+	//
+	// `_generatedMappings` is ordered by the generated positions.
+	//
+	// `_originalMappings` is ordered by the original positions.
+	
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__generatedMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+	
+	    return this.__generatedMappings;
+	  }
+	});
+	
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__originalMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+	
+	    return this.__originalMappings;
+	  }
+	});
+	
+	SourceMapConsumer.prototype._charIsMappingSeparator =
+	  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+	    var c = aStr.charAt(index);
+	    return c === ";" || c === ",";
+	  };
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	SourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  };
+	
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+	
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+	
+	/**
+	 * Iterate over each mapping between an original source/line/column and a
+	 * generated line/column in this source map.
+	 *
+	 * @param Function aCallback
+	 *        The function that is called with each mapping.
+	 * @param Object aContext
+	 *        Optional. If specified, this object will be the value of `this` every
+	 *        time that `aCallback` is called.
+	 * @param aOrder
+	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	 *        iterate over the mappings sorted by the generated file's line/column
+	 *        order or the original's source/line/column order, respectively. Defaults to
+	 *        `SourceMapConsumer.GENERATED_ORDER`.
+	 */
+	SourceMapConsumer.prototype.eachMapping =
+	  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+	    var context = aContext || null;
+	    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+	
+	    var mappings;
+	    switch (order) {
+	    case SourceMapConsumer.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+	
+	    var sourceRoot = this.sourceRoot;
+	    mappings.map(function (mapping) {
+	      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+	      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      return {
+	        source: source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  };
+	
+	/**
+	 * Returns all generated line and column information for the original source,
+	 * line, and column provided. If no column is provided, returns all mappings
+	 * corresponding to a either the line we are searching for or the next
+	 * closest line that has any mappings. Otherwise, returns all mappings
+	 * corresponding to the given line and either the column we are searching for
+	 * or the next closest column that has any offsets.
+	 *
+	 * The only argument is an object with the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number is 1-based.
+	 *   - column: Optional. the column number in the original source.
+	 *    The column number is 0-based.
+	 *
+	 * and an array of objects is returned, each with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *    line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *    The column number is 0-based.
+	 */
+	SourceMapConsumer.prototype.allGeneratedPositionsFor =
+	  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+	    var line = util.getArg(aArgs, 'line');
+	
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    var needle = {
+	      source: util.getArg(aArgs, 'source'),
+	      originalLine: line,
+	      originalColumn: util.getArg(aArgs, 'column', 0)
+	    };
+	
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+	
+	    var mappings = [];
+	
+	    var index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util.compareByOriginalPositions,
+	                                  binarySearch.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+	
+	      if (aArgs.column === undefined) {
+	        var originalLine = mapping.originalLine;
+	
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+	
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        var originalColumn = mapping.originalColumn;
+	
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+	
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+	
+	    return mappings;
+	  };
+	
+	exports.SourceMapConsumer = SourceMapConsumer;
+	
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  var version = util.getArg(sourceMap, 'version');
+	  var sources = util.getArg(sourceMap, 'sources');
+	  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	  // requires the array) to play nice here.
+	  var names = util.getArg(sourceMap, 'names', []);
+	  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+	  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+	  var mappings = util.getArg(sourceMap, 'mappings');
+	  var file = util.getArg(sourceMap, 'file', null);
+	
+	  // Once again, Sass deviates from the spec and supplies the version as a
+	  // string rather than a number, so we use loose equality checking here.
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+	
+	  if (sourceRoot) {
+	    sourceRoot = util.normalize(sourceRoot);
+	  }
+	
+	  sources = sources
+	    .map(String)
+	    // Some source maps produce relative source paths like "./foo.js" instead of
+	    // "foo.js".  Normalize these first so that future comparisons will succeed.
+	    // See bugzil.la/1090768.
+	    .map(util.normalize)
+	    // Always ensure that absolute sources are internally stored relative to
+	    // the source root, if the source root is absolute. Not doing this would
+	    // be particularly problematic when the source root is a prefix of the
+	    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	    .map(function (source) {
+	      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+	        ? util.relative(sourceRoot, source)
+	        : source;
+	    });
+	
+	  // Pass `true` below to allow duplicate names and sources. While source maps
+	  // are intended to be compressed and deduplicated, the TypeScript compiler
+	  // sometimes generates source maps with duplicates in them. See Github issue
+	  // #72 and bugzil.la/889492.
+	  this._names = ArraySet.fromArray(names.map(String), true);
+	  this._sources = ArraySet.fromArray(sources, true);
+	
+	  this._absoluteSources = this._sources.toArray().map(function (s) {
+	    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	  });
+	
+	  this.sourceRoot = sourceRoot;
+	  this.sourcesContent = sourcesContent;
+	  this._mappings = mappings;
+	  this._sourceMapURL = aSourceMapURL;
+	  this.file = file;
+	}
+	
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+	
+	/**
+	 * Utility function to find the index of a source.  Returns -1 if not
+	 * found.
+	 */
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+	  var relativeSource = aSource;
+	  if (this.sourceRoot != null) {
+	    relativeSource = util.relative(this.sourceRoot, relativeSource);
+	  }
+	
+	  if (this._sources.has(relativeSource)) {
+	    return this._sources.indexOf(relativeSource);
+	  }
+	
+	  // Maybe aSource is an absolute URL as returned by |sources|.  In
+	  // this case we can't simply undo the transform.
+	  var i;
+	  for (i = 0; i < this._absoluteSources.length; ++i) {
+	    if (this._absoluteSources[i] == aSource) {
+	      return i;
+	    }
+	  }
+	
+	  return -1;
+	};
+	
+	/**
+	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	 *
+	 * @param SourceMapGenerator aSourceMap
+	 *        The source map that will be consumed.
+	 * @param String aSourceMapURL
+	 *        The URL at which the source map can be found (optional)
+	 * @returns BasicSourceMapConsumer
+	 */
+	BasicSourceMapConsumer.fromSourceMap =
+	  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+	    var smc = Object.create(BasicSourceMapConsumer.prototype);
+	
+	    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+	    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+	    smc.sourceRoot = aSourceMap._sourceRoot;
+	    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+	                                                            smc.sourceRoot);
+	    smc.file = aSourceMap._file;
+	    smc._sourceMapURL = aSourceMapURL;
+	    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+	      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+	    });
+	
+	    // Because we are modifying the entries (by converting string sources and
+	    // names to indices into the sources and names ArraySets), we have to make
+	    // a copy of the entry or else bad things happen. Shared mutable state
+	    // strikes again! See github issue #191.
+	
+	    var generatedMappings = aSourceMap._mappings.toArray().slice();
+	    var destGeneratedMappings = smc.__generatedMappings = [];
+	    var destOriginalMappings = smc.__originalMappings = [];
+	
+	    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+	      var srcMapping = generatedMappings[i];
+	      var destMapping = new Mapping;
+	      destMapping.generatedLine = srcMapping.generatedLine;
+	      destMapping.generatedColumn = srcMapping.generatedColumn;
+	
+	      if (srcMapping.source) {
+	        destMapping.source = sources.indexOf(srcMapping.source);
+	        destMapping.originalLine = srcMapping.originalLine;
+	        destMapping.originalColumn = srcMapping.originalColumn;
+	
+	        if (srcMapping.name) {
+	          destMapping.name = names.indexOf(srcMapping.name);
+	        }
+	
+	        destOriginalMappings.push(destMapping);
+	      }
+	
+	      destGeneratedMappings.push(destMapping);
+	    }
+	
+	    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+	
+	    return smc;
+	  };
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	BasicSourceMapConsumer.prototype._version = 3;
+	
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    return this._absoluteSources.slice();
+	  }
+	});
+	
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	BasicSourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    var generatedLine = 1;
+	    var previousGeneratedColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousOriginalColumn = 0;
+	    var previousSource = 0;
+	    var previousName = 0;
+	    var length = aStr.length;
+	    var index = 0;
+	    var cachedSegments = {};
+	    var temp = {};
+	    var originalMappings = [];
+	    var generatedMappings = [];
+	    var mapping, str, segment, end, value;
+	
+	    while (index < length) {
+	      if (aStr.charAt(index) === ';') {
+	        generatedLine++;
+	        index++;
+	        previousGeneratedColumn = 0;
+	      }
+	      else if (aStr.charAt(index) === ',') {
+	        index++;
+	      }
+	      else {
+	        mapping = new Mapping();
+	        mapping.generatedLine = generatedLine;
+	
+	        // Because each offset is encoded relative to the previous one,
+	        // many segments often have the same encoding. We can exploit this
+	        // fact by caching the parsed variable length fields of each segment,
+	        // allowing us to avoid a second parse if we encounter the same
+	        // segment again.
+	        for (end = index; end < length; end++) {
+	          if (this._charIsMappingSeparator(aStr, end)) {
+	            break;
+	          }
+	        }
+	        str = aStr.slice(index, end);
+	
+	        segment = cachedSegments[str];
+	        if (segment) {
+	          index += str.length;
+	        } else {
+	          segment = [];
+	          while (index < end) {
+	            base64VLQ.decode(aStr, index, temp);
+	            value = temp.value;
+	            index = temp.rest;
+	            segment.push(value);
+	          }
+	
+	          if (segment.length === 2) {
+	            throw new Error('Found a source, but no line and column');
+	          }
+	
+	          if (segment.length === 3) {
+	            throw new Error('Found a source and line, but no column');
+	          }
+	
+	          cachedSegments[str] = segment;
+	        }
+	
+	        // Generated column.
+	        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+	        previousGeneratedColumn = mapping.generatedColumn;
+	
+	        if (segment.length > 1) {
+	          // Original source.
+	          mapping.source = previousSource + segment[1];
+	          previousSource += segment[1];
+	
+	          // Original line.
+	          mapping.originalLine = previousOriginalLine + segment[2];
+	          previousOriginalLine = mapping.originalLine;
+	          // Lines are stored 0-based
+	          mapping.originalLine += 1;
+	
+	          // Original column.
+	          mapping.originalColumn = previousOriginalColumn + segment[3];
+	          previousOriginalColumn = mapping.originalColumn;
+	
+	          if (segment.length > 4) {
+	            // Original name.
+	            mapping.name = previousName + segment[4];
+	            previousName += segment[4];
+	          }
+	        }
+	
+	        generatedMappings.push(mapping);
+	        if (typeof mapping.originalLine === 'number') {
+	          originalMappings.push(mapping);
+	        }
+	      }
+	    }
+	
+	    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = generatedMappings;
+	
+	    quickSort(originalMappings, util.compareByOriginalPositions);
+	    this.__originalMappings = originalMappings;
+	  };
+	
+	/**
+	 * Find the mapping that best matches the hypothetical "needle" mapping that
+	 * we are searching for in the given "haystack" of mappings.
+	 */
+	BasicSourceMapConsumer.prototype._findMapping =
+	  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+	                                         aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+	
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError('Line must be greater than or equal to 1, got '
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError('Column must be greater than or equal to 0, got '
+	                          + aNeedle[aColumnName]);
+	    }
+	
+	    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	  };
+	
+	/**
+	 * Compute the last column for each generated mapping. The last column is
+	 * inclusive.
+	 */
+	BasicSourceMapConsumer.prototype.computeColumnSpans =
+	  function SourceMapConsumer_computeColumnSpans() {
+	    for (var index = 0; index < this._generatedMappings.length; ++index) {
+	      var mapping = this._generatedMappings[index];
+	
+	      // Mappings do not contain a field for the last generated columnt. We
+	      // can come up with an optimistic estimate, however, by assuming that
+	      // mappings are contiguous (i.e. given two consecutive mappings, the
+	      // first mapping ends where the second one starts).
+	      if (index + 1 < this._generatedMappings.length) {
+	        var nextMapping = this._generatedMappings[index + 1];
+	
+	        if (mapping.generatedLine === nextMapping.generatedLine) {
+	          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+	          continue;
+	        }
+	      }
+	
+	      // The last mapping for each line spans the entire line.
+	      mapping.lastGeneratedColumn = Infinity;
+	    }
+	  };
+	
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	BasicSourceMapConsumer.prototype.originalPositionFor =
+	  function SourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    var index = this._findMapping(
+	      needle,
+	      this._generatedMappings,
+	      "generatedLine",
+	      "generatedColumn",
+	      util.compareByGeneratedPositionsDeflated,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+	
+	    if (index >= 0) {
+	      var mapping = this._generatedMappings[index];
+	
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        var source = util.getArg(mapping, 'source', null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+	        var name = util.getArg(mapping, 'name', null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+	        return {
+	          source: source,
+	          line: util.getArg(mapping, 'originalLine', null),
+	          column: util.getArg(mapping, 'originalColumn', null),
+	          name: name
+	        };
+	      }
+	    }
+	
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  };
+	
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function (sc) { return sc == null; });
+	  };
+	
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	BasicSourceMapConsumer.prototype.sourceContentFor =
+	  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+	
+	    var index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+	
+	    var relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util.relative(this.sourceRoot, relativeSource);
+	    }
+	
+	    var url;
+	    if (this.sourceRoot != null
+	        && (url = util.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+	      }
+	
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+	
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	    }
+	  };
+	
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	BasicSourceMapConsumer.prototype.generatedPositionFor =
+	  function SourceMapConsumer_generatedPositionFor(aArgs) {
+	    var source = util.getArg(aArgs, 'source');
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+	
+	    var needle = {
+	      source: source,
+	      originalLine: util.getArg(aArgs, 'line'),
+	      originalColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    var index = this._findMapping(
+	      needle,
+	      this._originalMappings,
+	      "originalLine",
+	      "originalColumn",
+	      util.compareByOriginalPositions,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+	
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+	
+	      if (mapping.source === needle.source) {
+	        return {
+	          line: util.getArg(mapping, 'generatedLine', null),
+	          column: util.getArg(mapping, 'generatedColumn', null),
+	          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	        };
+	      }
+	    }
+	
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  };
+	
+	exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+	
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+	
+	  var version = util.getArg(sourceMap, 'version');
+	  var sections = util.getArg(sourceMap, 'sections');
+	
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+	
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	
+	  var lastOffset = {
+	    line: -1,
+	    column: 0
+	  };
+	  this._sections = sections.map(function (s) {
+	    if (s.url) {
+	      // The url field will require support for asynchronicity.
+	      // See https://github.com/mozilla/source-map/issues/16
+	      throw new Error('Support for url field in sections not implemented.');
+	    }
+	    var offset = util.getArg(s, 'offset');
+	    var offsetLine = util.getArg(offset, 'line');
+	    var offsetColumn = util.getArg(offset, 'column');
+	
+	    if (offsetLine < lastOffset.line ||
+	        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	      throw new Error('Section offsets must be ordered and non-overlapping.');
+	    }
+	    lastOffset = offset;
+	
+	    return {
+	      generatedOffset: {
+	        // The offset fields are 0-based, but we use 1-based indices when
+	        // encoding/decoding from VLQ.
+	        generatedLine: offsetLine + 1,
+	        generatedColumn: offsetColumn + 1
+	      },
+	      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+	    }
+	  });
+	}
+	
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+	
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	IndexedSourceMapConsumer.prototype._version = 3;
+	
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    var sources = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+	});
+	
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	IndexedSourceMapConsumer.prototype.originalPositionFor =
+	  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+	
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    var sectionIndex = binarySearch.search(needle, this._sections,
+	      function(needle, section) {
+	        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+	
+	        return (needle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    var section = this._sections[sectionIndex];
+	
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+	
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  };
+	
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+	    return this._sections.every(function (s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  };
+	
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	IndexedSourceMapConsumer.prototype.sourceContentFor =
+	  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	
+	      var content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + aSource + '" is not in the SourceMap.');
+	    }
+	  };
+	
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based. 
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	IndexedSourceMapConsumer.prototype.generatedPositionFor =
+	  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+	        continue;
+	      }
+	      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        var ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+	
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  };
+	
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	IndexedSourceMapConsumer.prototype._parseMappings =
+	  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    this.__generatedMappings = [];
+	    this.__originalMappings = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	      var sectionMappings = section.consumer._generatedMappings;
+	      for (var j = 0; j < sectionMappings.length; j++) {
+	        var mapping = sectionMappings[j];
+	
+	        var source = section.consumer._sources.at(mapping.source);
+	        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+	
+	        var name = null;
+	        if (mapping.name) {
+	          name = section.consumer._names.at(mapping.name);
+	          this._names.add(name);
+	          name = this._names.indexOf(name);
+	        }
+	
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        var adjustedMapping = {
+	          source: source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name: name
+	        };
+	
+	        this.__generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === 'number') {
+	          this.__originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+	
+	    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+	  };
+	
+	exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+	
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  }
+	  else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+	
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    } else {
+	      return mid;
+	    }
+	  }
+	  else {
+	    // Our needle is less than aHaystack[mid].
+	    if (mid - aLow > 1) {
+	      // The element is in the lower half.
+	      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	    }
+	
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return mid;
+	    } else {
+	      return aLow < 0 ? -1 : aLow;
+	    }
+	  }
+	}
+	
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+	
+	  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+	
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+	
+	  return index;
+	};
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	// It turns out that some (most?) JavaScript engines don't self-host
+	// `Array.prototype.sort`. This makes sense because C++ will likely remain
+	// faster than JS when doing raw CPU-intensive sorting. However, when using a
+	// custom comparator function, calling back and forth between the VM's C++ and
+	// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+	// worse generated code for the comparator function than would be optimal. In
+	// fact, when sorting with a comparator, these costs outweigh the benefits of
+	// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+	// a ~3500ms mean speed-up in `bench/bench.html`.
+	
+	/**
+	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+	 *
+	 * @param {Array} ary
+	 *        The array.
+	 * @param {Number} x
+	 *        The index of the first item.
+	 * @param {Number} y
+	 *        The index of the second item.
+	 */
+	function swap(ary, x, y) {
+	  var temp = ary[x];
+	  ary[x] = ary[y];
+	  ary[y] = temp;
+	}
+	
+	/**
+	 * Returns a random integer within the range `low .. high` inclusive.
+	 *
+	 * @param {Number} low
+	 *        The lower bound on the range.
+	 * @param {Number} high
+	 *        The upper bound on the range.
+	 */
+	function randomIntInRange(low, high) {
+	  return Math.round(low + (Math.random() * (high - low)));
+	}
+	
+	/**
+	 * The Quick Sort algorithm.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 * @param {Number} p
+	 *        Start index of the array
+	 * @param {Number} r
+	 *        End index of the array
+	 */
+	function doQuickSort(ary, comparator, p, r) {
+	  // If our lower bound is less than our upper bound, we (1) partition the
+	  // array into two pieces and (2) recurse on each half. If it is not, this is
+	  // the empty array and our base case.
+	
+	  if (p < r) {
+	    // (1) Partitioning.
+	    //
+	    // The partitioning chooses a pivot between `p` and `r` and moves all
+	    // elements that are less than or equal to the pivot to the before it, and
+	    // all the elements that are greater than it after it. The effect is that
+	    // once partition is done, the pivot is in the exact place it will be when
+	    // the array is put in sorted order, and it will not need to be moved
+	    // again. This runs in O(n) time.
+	
+	    // Always choose a random pivot so that an input array which is reverse
+	    // sorted does not cause O(n^2) running time.
+	    var pivotIndex = randomIntInRange(p, r);
+	    var i = p - 1;
+	
+	    swap(ary, pivotIndex, r);
+	    var pivot = ary[r];
+	
+	    // Immediately after `j` is incremented in this loop, the following hold
+	    // true:
+	    //
+	    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+	    //
+	    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+	    for (var j = p; j < r; j++) {
+	      if (comparator(ary[j], pivot) <= 0) {
+	        i += 1;
+	        swap(ary, i, j);
+	      }
+	    }
+	
+	    swap(ary, i + 1, j);
+	    var q = i + 1;
+	
+	    // (2) Recurse on each half.
+	
+	    doQuickSort(ary, comparator, p, q - 1);
+	    doQuickSort(ary, comparator, q + 1, r);
+	  }
+	}
+	
+	/**
+	 * Sort the given array in-place with the given comparator function.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 */
+	exports.quickSort = function (ary, comparator) {
+	  doQuickSort(ary, comparator, 0, ary.length - 1);
+	};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	
+	var SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	var util = __webpack_require__(4);
+	
+	// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+	// operating systems these days (capturing the result).
+	var REGEX_NEWLINE = /(\r?\n)/;
+	
+	// Newline character code for charCodeAt() comparisons
+	var NEWLINE_CODE = 10;
+	
+	// Private symbol for identifying `SourceNode`s when multiple versions of
+	// the source-map library are loaded. This MUST NOT CHANGE across
+	// versions!
+	var isSourceNode = "$$$isSourceNode$$$";
+	
+	/**
+	 * SourceNodes provide a way to abstract over interpolating/concatenating
+	 * snippets of generated JavaScript source code while maintaining the line and
+	 * column information associated with the original source code.
+	 *
+	 * @param aLine The original line number.
+	 * @param aColumn The original column number.
+	 * @param aSource The original source's filename.
+	 * @param aChunks Optional. An array of strings which are snippets of
+	 *        generated JS, or other SourceNodes.
+	 * @param aName The original identifier.
+	 */
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+	  this.children = [];
+	  this.sourceContents = {};
+	  this.line = aLine == null ? null : aLine;
+	  this.column = aColumn == null ? null : aColumn;
+	  this.source = aSource == null ? null : aSource;
+	  this.name = aName == null ? null : aName;
+	  this[isSourceNode] = true;
+	  if (aChunks != null) this.add(aChunks);
+	}
+	
+	/**
+	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+	 *
+	 * @param aGeneratedCode The generated code
+	 * @param aSourceMapConsumer The SourceMap for the generated code
+	 * @param aRelativePath Optional. The path that relative sources in the
+	 *        SourceMapConsumer should be relative to.
+	 */
+	SourceNode.fromStringWithSourceMap =
+	  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+	    // The SourceNode we want to fill with the generated code
+	    // and the SourceMap
+	    var node = new SourceNode();
+	
+	    // All even indices of this array are one line of the generated code,
+	    // while all odd indices are the newlines between two adjacent lines
+	    // (since `REGEX_NEWLINE` captures its match).
+	    // Processed fragments are accessed by calling `shiftNextLine`.
+	    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+	    var remainingLinesIndex = 0;
+	    var shiftNextLine = function() {
+	      var lineContents = getNextLine();
+	      // The last line of a file might not have a newline.
+	      var newLine = getNextLine() || "";
+	      return lineContents + newLine;
+	
+	      function getNextLine() {
+	        return remainingLinesIndex < remainingLines.length ?
+	            remainingLines[remainingLinesIndex++] : undefined;
+	      }
+	    };
+	
+	    // We need to remember the position of "remainingLines"
+	    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+	
+	    // The generate SourceNodes we need a code range.
+	    // To extract it current and last mapping is used.
+	    // Here we store the last mapping.
+	    var lastMapping = null;
+	
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      if (lastMapping !== null) {
+	        // We add the code from "lastMapping" to "mapping":
+	        // First check if there is a new line in between.
+	        if (lastGeneratedLine < mapping.generatedLine) {
+	          // Associate first line with "lastMapping"
+	          addMappingWithCode(lastMapping, shiftNextLine());
+	          lastGeneratedLine++;
+	          lastGeneratedColumn = 0;
+	          // The remaining code is added without mapping
+	        } else {
+	          // There is no new line in between.
+	          // Associate the code between "lastGeneratedColumn" and
+	          // "mapping.generatedColumn" with "lastMapping"
+	          var nextLine = remainingLines[remainingLinesIndex] || '';
+	          var code = nextLine.substr(0, mapping.generatedColumn -
+	                                        lastGeneratedColumn);
+	          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+	                                              lastGeneratedColumn);
+	          lastGeneratedColumn = mapping.generatedColumn;
+	          addMappingWithCode(lastMapping, code);
+	          // No more remaining code, continue
+	          lastMapping = mapping;
+	          return;
+	        }
+	      }
+	      // We add the generated code until the first mapping
+	      // to the SourceNode without any mapping.
+	      // Each line is added as separate string.
+	      while (lastGeneratedLine < mapping.generatedLine) {
+	        node.add(shiftNextLine());
+	        lastGeneratedLine++;
+	      }
+	      if (lastGeneratedColumn < mapping.generatedColumn) {
+	        var nextLine = remainingLines[remainingLinesIndex] || '';
+	        node.add(nextLine.substr(0, mapping.generatedColumn));
+	        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+	        lastGeneratedColumn = mapping.generatedColumn;
+	      }
+	      lastMapping = mapping;
+	    }, this);
+	    // We have processed all mappings.
+	    if (remainingLinesIndex < remainingLines.length) {
+	      if (lastMapping) {
+	        // Associate the remaining code in the current line with "lastMapping"
+	        addMappingWithCode(lastMapping, shiftNextLine());
+	      }
+	      // and add the remaining lines without any mapping
+	      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+	    }
+	
+	    // Copy sourcesContent into SourceNode
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aRelativePath != null) {
+	          sourceFile = util.join(aRelativePath, sourceFile);
+	        }
+	        node.setSourceContent(sourceFile, content);
+	      }
+	    });
+	
+	    return node;
+	
+	    function addMappingWithCode(mapping, code) {
+	      if (mapping === null || mapping.source === undefined) {
+	        node.add(code);
+	      } else {
+	        var source = aRelativePath
+	          ? util.join(aRelativePath, mapping.source)
+	          : mapping.source;
+	        node.add(new SourceNode(mapping.originalLine,
+	                                mapping.originalColumn,
+	                                source,
+	                                code,
+	                                mapping.name));
+	      }
+	    }
+	  };
+	
+	/**
+	 * Add a chunk of generated JS to this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    aChunk.forEach(function (chunk) {
+	      this.add(chunk);
+	    }, this);
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    if (aChunk) {
+	      this.children.push(aChunk);
+	    }
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Add a chunk of generated JS to the beginning of this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    for (var i = aChunk.length-1; i >= 0; i--) {
+	      this.prepend(aChunk[i]);
+	    }
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    this.children.unshift(aChunk);
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Walk over the tree of JS snippets in this node and its children. The
+	 * walking function is called once for each snippet of JS and is passed that
+	 * snippet and the its original associated source's line/column location.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+	  var chunk;
+	  for (var i = 0, len = this.children.length; i < len; i++) {
+	    chunk = this.children[i];
+	    if (chunk[isSourceNode]) {
+	      chunk.walk(aFn);
+	    }
+	    else {
+	      if (chunk !== '') {
+	        aFn(chunk, { source: this.source,
+	                     line: this.line,
+	                     column: this.column,
+	                     name: this.name });
+	      }
+	    }
+	  }
+	};
+	
+	/**
+	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	 * each of `this.children`.
+	 *
+	 * @param aSep The separator.
+	 */
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+	  var newChildren;
+	  var i;
+	  var len = this.children.length;
+	  if (len > 0) {
+	    newChildren = [];
+	    for (i = 0; i < len-1; i++) {
+	      newChildren.push(this.children[i]);
+	      newChildren.push(aSep);
+	    }
+	    newChildren.push(this.children[i]);
+	    this.children = newChildren;
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Call String.prototype.replace on the very right-most source snippet. Useful
+	 * for trimming whitespace from the end of a source node, etc.
+	 *
+	 * @param aPattern The pattern to replace.
+	 * @param aReplacement The thing to replace the pattern with.
+	 */
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+	  var lastChild = this.children[this.children.length - 1];
+	  if (lastChild[isSourceNode]) {
+	    lastChild.replaceRight(aPattern, aReplacement);
+	  }
+	  else if (typeof lastChild === 'string') {
+	    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+	  }
+	  else {
+	    this.children.push(''.replace(aPattern, aReplacement));
+	  }
+	  return this;
+	};
+	
+	/**
+	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+	 * in the sourcesContent field.
+	 *
+	 * @param aSourceFile The filename of the source file
+	 * @param aSourceContent The content of the source file
+	 */
+	SourceNode.prototype.setSourceContent =
+	  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+	    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	  };
+	
+	/**
+	 * Walk over the tree of SourceNodes. The walking function is called for each
+	 * source file content and is passed the filename and source content.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walkSourceContents =
+	  function SourceNode_walkSourceContents(aFn) {
+	    for (var i = 0, len = this.children.length; i < len; i++) {
+	      if (this.children[i][isSourceNode]) {
+	        this.children[i].walkSourceContents(aFn);
+	      }
+	    }
+	
+	    var sources = Object.keys(this.sourceContents);
+	    for (var i = 0, len = sources.length; i < len; i++) {
+	      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	    }
+	  };
+	
+	/**
+	 * Return the string representation of this source node. Walks over the tree
+	 * and concatenates all the various snippets together to one string.
+	 */
+	SourceNode.prototype.toString = function SourceNode_toString() {
+	  var str = "";
+	  this.walk(function (chunk) {
+	    str += chunk;
+	  });
+	  return str;
+	};
+	
+	/**
+	 * Returns the string representation of this source node along with a source
+	 * map.
+	 */
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+	  var generated = {
+	    code: "",
+	    line: 1,
+	    column: 0
+	  };
+	  var map = new SourceMapGenerator(aArgs);
+	  var sourceMappingActive = false;
+	  var lastOriginalSource = null;
+	  var lastOriginalLine = null;
+	  var lastOriginalColumn = null;
+	  var lastOriginalName = null;
+	  this.walk(function (chunk, original) {
+	    generated.code += chunk;
+	    if (original.source !== null
+	        && original.line !== null
+	        && original.column !== null) {
+	      if(lastOriginalSource !== original.source
+	         || lastOriginalLine !== original.line
+	         || lastOriginalColumn !== original.column
+	         || lastOriginalName !== original.name) {
+	        map.addMapping({
+	          source: original.source,
+	          original: {
+	            line: original.line,
+	            column: original.column
+	          },
+	          generated: {
+	            line: generated.line,
+	            column: generated.column
+	          },
+	          name: original.name
+	        });
+	      }
+	      lastOriginalSource = original.source;
+	      lastOriginalLine = original.line;
+	      lastOriginalColumn = original.column;
+	      lastOriginalName = original.name;
+	      sourceMappingActive = true;
+	    } else if (sourceMappingActive) {
+	      map.addMapping({
+	        generated: {
+	          line: generated.line,
+	          column: generated.column
+	        }
+	      });
+	      lastOriginalSource = null;
+	      sourceMappingActive = false;
+	    }
+	    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+	      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+	        generated.line++;
+	        generated.column = 0;
+	        // Mappings end at eol
+	        if (idx + 1 === length) {
+	          lastOriginalSource = null;
+	          sourceMappingActive = false;
+	        } else if (sourceMappingActive) {
+	          map.addMapping({
+	            source: original.source,
+	            original: {
+	              line: original.line,
+	              column: original.column
+	            },
+	            generated: {
+	              line: generated.line,
+	              column: generated.column
+	            },
+	            name: original.name
+	          });
+	        }
+	      } else {
+	        generated.column++;
+	      }
+	    }
+	  });
+	  this.walkSourceContents(function (sourceFile, sourceContent) {
+	    map.setSourceContent(sourceFile, sourceContent);
+	  });
+	
+	  return { code: generated.code, map: map };
+	};
+	
+	exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ])
+});
+;
+//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap 1624c7299b887f7bdf64","webpack:///./source-map.js","webpack:///./lib/source-map-generator.js","webpack:///./lib/base64-vlq.js","webpack:///./lib/base64.js","webpack:///./lib/util.js","webpack:///./lib/array-set.js","webpack:///./lib/mapping-list.js","webpack:///./lib/source-map-consumer.js","webpack:///./lib/binary-search.js","webpack:///./lib/quick-sort.js","webpack:///./lib/source-node.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;ACVA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,uBAAe;AACf;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;ACtCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,MAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA0C,SAAS;AACnD;AACA;;AAEA;AACA;AACA;AACA,qBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;ACxaA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4DAA2D;AAC3D,qBAAoB;AACpB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;;AAEH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAG;;AAEH;AACA;AACA;;;;;;;AC3IA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iBAAgB;AAChB,iBAAgB;;AAEhB,oBAAmB;AACnB,qBAAoB;;AAEpB,iBAAgB;AAChB,iBAAgB;;AAEhB,iBAAgB;AAChB,kBAAiB;;AAEjB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;AClEA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,+CAA8C,QAAQ;AACtD;AACA;AACA;AACA,MAAK;AACL;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4BAA2B,QAAQ;AACnC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,cAAa;AACb;;AAEA;AACA,eAAc;AACd;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAsC;AACtC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;ACveA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,uCAAsC,SAAS;AAC/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;ACxHA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAgB;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;AC9EA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA,oBAAmB;AACnB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;;AAEX;AACA;AACA,QAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;;AAEX;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA2B,MAAM;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAa,kCAAkC;AAC/C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,uDAAsD,YAAY;AAClE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,0BAAyB,cAAc;AACvC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAuB,wCAAwC;AAC/D;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAA+C,mBAAmB,EAAE;AACpE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA;AACA,8BAA6B,MAAM;AACnC;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA,IAAG;AACH;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C,sBAAqB,+CAA+C;AACpE;AACA;AACA;AACA;AACA;AACA,EAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,2BAA2B;AAC9C;AACA;AACA,sBAAqB,4BAA4B;AACjD;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;ACxnCA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;AC9GA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,SAAS;AACpB;AACA,YAAW,OAAO;AAClB;AACA,YAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAW,MAAM;AACjB;AACA,YAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;;;;;;;ACjHA,iBAAgB,oBAAoB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;;AAEL;;AAEA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAiC,QAAQ;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA6C,SAAS;AACtD;AACA;AACA;AACA;AACA;AACA;AACA,qBAAoB;AACpB;AACA;AACA,uCAAsC;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAe,WAAW;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAA+C,SAAS;AACxD;AACA;AACA;AACA;;AAEA;AACA,0CAAyC,SAAS;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAW;AACX;AACA;AACA;AACA,YAAW;AACX;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,MAAK;AACL;AACA;AACA;AACA;AACA;AACA,QAAO;AACP;AACA;AACA;AACA,6CAA4C,cAAc;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAS;AACT;AACA;AACA;AACA;AACA;AACA,cAAa;AACb;AACA;AACA;AACA,cAAa;AACb;AACA,YAAW;AACX;AACA,QAAO;AACP;AACA;AACA;AACA,IAAG;AACH;AACA;AACA,IAAG;;AAEH,WAAU;AACV;;AAEA","file":"source-map.debug.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId])\n \t\t\treturn installedModules[moduleId].exports;\n\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\texports: {},\n \t\t\tid: moduleId,\n \t\t\tloaded: false\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.loaded = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(0);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 1624c7299b887f7bdf64","/*\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 */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./source-map.js\n// module id = 0\n// module chunks = 0","/* -*- 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\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar 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 */\nfunction 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\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\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(sourceRoot, newMapping.source);\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 */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\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 */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\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 */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\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\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 */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\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 (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\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 (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\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 */\nSourceMapGenerator.prototype._serializeMappings =\n  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      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\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(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\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\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\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(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  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(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-generator.js\n// module id = 1\n// module chunks = 0","/* -*- 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\nvar 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\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar 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 */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (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 */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.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 */\nexports.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(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\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\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64-vlq.js\n// module id = 2\n// module chunks = 0","/* -*- 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\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.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 */\nexports.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//////////////////\n// WEBPACK FOOTER\n// ./lib/base64.js\n// module id = 3\n// module chunks = 0","/* -*- 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 */\nfunction 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}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction 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}\nexports.urlParse = urlParse;\n\nfunction 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}\nexports.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 '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction 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}\nexports.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 */\nfunction 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 = 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}\nexports.join = join;\n\nexports.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 */\nfunction 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}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction 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 */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction 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 (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    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 */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\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}\nexports.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 */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\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}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction 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 */\nfunction 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}\nexports.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 */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.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 */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\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}\nexports.computeSourceURL = computeSourceURL;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/util.js\n// module id = 4\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar 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 */\nfunction 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 */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\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 */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : 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 */\nArraySet.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 */\nArraySet.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 */\nArraySet.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 */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/array-set.js\n// module id = 5\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction 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 lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\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 */\nfunction 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 */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.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 */\nMappingList.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\nexports.MappingList = MappingList;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/mapping-list.js\n// module id = 6\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction 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\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.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\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\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\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\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\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\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 */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.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 */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\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.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).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 */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\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(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\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 (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\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\nexports.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 */\nfunction 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 && util.isAbsolute(sourceRoot) && 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\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.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 */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\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 */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.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 */\nfunction 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 */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\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      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\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(generatedMappings, util.compareByGeneratedPositionsDeflated);\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 */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\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('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\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 */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  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 */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\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(this.sourceRoot, source, this._sourceMapURL);\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 */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\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 */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\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 (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\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\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\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    }\n    else {\n      throw new Error('\"' + relativeSource + '\" 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 *   - 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 */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\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\nexports.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 */\nfunction 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('Support for url field in sections not implemented.');\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 (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\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(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\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 */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\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(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\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: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: 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 */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  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 */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\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    }\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 */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\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 (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === 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 */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\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(section.consumer.sourceRoot, source, this._sourceMapURL);\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: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === 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(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-consumer.js\n// module id = 7\n// module chunks = 0","/* -*- 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\nexports.GREATEST_LOWER_BOUND = 1;\nexports.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 */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\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  }\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(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\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  }\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(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\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 */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\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//////////////////\n// WEBPACK FOOTER\n// ./lib/binary-search.js\n// module id = 8\n// module chunks = 0","/* -*- 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 */\nfunction 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 */\nfunction 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 */\nfunction 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 */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/quick-sort.js\n// module id = 9\n// module chunks = 0","/* -*- 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\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar 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).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar 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!\nvar 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 */\nfunction 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 */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\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++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, 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(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\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(mapping.generatedColumn);\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(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\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 */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + 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 */\nSourceNode.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  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + 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 */\nSourceNode.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    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\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 */\nSourceNode.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 */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, 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 */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\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 */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\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(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\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 */\nSourceNode.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 */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\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 (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\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\nexports.SourceNode = SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-node.js\n// module id = 10\n// module chunks = 0"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/recast/node_modules/source-map/dist/source-map.js b/node_modules/recast/node_modules/source-map/dist/source-map.js
new file mode 100644
index 0000000..b4eb087
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/dist/source-map.js
@@ -0,0 +1,3233 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory();
+	else
+		root["sourceMap"] = factory();
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId])
+/******/ 			return installedModules[moduleId].exports;
+
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			exports: {},
+/******/ 			id: moduleId,
+/******/ 			loaded: false
+/******/ 		};
+
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+
+/******/ 		// Flag the module as loaded
+/******/ 		module.loaded = true;
+
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+
+
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(0);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/*
+	 * Copyright 2009-2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE.txt or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+	exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	exports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;
+	exports.SourceNode = __webpack_require__(10).SourceNode;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var base64VLQ = __webpack_require__(2);
+	var util = __webpack_require__(4);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var MappingList = __webpack_require__(6).MappingList;
+
+	/**
+	 * An instance of the SourceMapGenerator represents a source map which is
+	 * being built incrementally. You may pass an object with the following
+	 * properties:
+	 *
+	 *   - file: The filename of the generated source.
+	 *   - sourceRoot: A root for all relative URLs in this source map.
+	 */
+	function SourceMapGenerator(aArgs) {
+	  if (!aArgs) {
+	    aArgs = {};
+	  }
+	  this._file = util.getArg(aArgs, 'file', null);
+	  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+	  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+	  this._mappings = new MappingList();
+	  this._sourcesContents = null;
+	}
+
+	SourceMapGenerator.prototype._version = 3;
+
+	/**
+	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+	 *
+	 * @param aSourceMapConsumer The SourceMap.
+	 */
+	SourceMapGenerator.fromSourceMap =
+	  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+	    var sourceRoot = aSourceMapConsumer.sourceRoot;
+	    var generator = new SourceMapGenerator({
+	      file: aSourceMapConsumer.file,
+	      sourceRoot: sourceRoot
+	    });
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      var newMapping = {
+	        generated: {
+	          line: mapping.generatedLine,
+	          column: mapping.generatedColumn
+	        }
+	      };
+
+	      if (mapping.source != null) {
+	        newMapping.source = mapping.source;
+	        if (sourceRoot != null) {
+	          newMapping.source = util.relative(sourceRoot, newMapping.source);
+	        }
+
+	        newMapping.original = {
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        };
+
+	        if (mapping.name != null) {
+	          newMapping.name = mapping.name;
+	        }
+	      }
+
+	      generator.addMapping(newMapping);
+	    });
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var sourceRelative = sourceFile;
+	      if (sourceRoot !== null) {
+	        sourceRelative = util.relative(sourceRoot, sourceFile);
+	      }
+
+	      if (!generator._sources.has(sourceRelative)) {
+	        generator._sources.add(sourceRelative);
+	      }
+
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        generator.setSourceContent(sourceFile, content);
+	      }
+	    });
+	    return generator;
+	  };
+
+	/**
+	 * Add a single mapping from original source line and column to the generated
+	 * source's line and column for this source map being created. The mapping
+	 * object should have the following properties:
+	 *
+	 *   - generated: An object with the generated line and column positions.
+	 *   - original: An object with the original line and column positions.
+	 *   - source: The original source file (relative to the sourceRoot).
+	 *   - name: An optional original token name for this mapping.
+	 */
+	SourceMapGenerator.prototype.addMapping =
+	  function SourceMapGenerator_addMapping(aArgs) {
+	    var generated = util.getArg(aArgs, 'generated');
+	    var original = util.getArg(aArgs, 'original', null);
+	    var source = util.getArg(aArgs, 'source', null);
+	    var name = util.getArg(aArgs, 'name', null);
+
+	    if (!this._skipValidation) {
+	      this._validateMapping(generated, original, source, name);
+	    }
+
+	    if (source != null) {
+	      source = String(source);
+	      if (!this._sources.has(source)) {
+	        this._sources.add(source);
+	      }
+	    }
+
+	    if (name != null) {
+	      name = String(name);
+	      if (!this._names.has(name)) {
+	        this._names.add(name);
+	      }
+	    }
+
+	    this._mappings.add({
+	      generatedLine: generated.line,
+	      generatedColumn: generated.column,
+	      originalLine: original != null && original.line,
+	      originalColumn: original != null && original.column,
+	      source: source,
+	      name: name
+	    });
+	  };
+
+	/**
+	 * Set the source content for a source file.
+	 */
+	SourceMapGenerator.prototype.setSourceContent =
+	  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+	    var source = aSourceFile;
+	    if (this._sourceRoot != null) {
+	      source = util.relative(this._sourceRoot, source);
+	    }
+
+	    if (aSourceContent != null) {
+	      // Add the source content to the _sourcesContents map.
+	      // Create a new _sourcesContents map if the property is null.
+	      if (!this._sourcesContents) {
+	        this._sourcesContents = Object.create(null);
+	      }
+	      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+	    } else if (this._sourcesContents) {
+	      // Remove the source file from the _sourcesContents map.
+	      // If the _sourcesContents map is empty, set the property to null.
+	      delete this._sourcesContents[util.toSetString(source)];
+	      if (Object.keys(this._sourcesContents).length === 0) {
+	        this._sourcesContents = null;
+	      }
+	    }
+	  };
+
+	/**
+	 * Applies the mappings of a sub-source-map for a specific source file to the
+	 * source map being generated. Each mapping to the supplied source file is
+	 * rewritten using the supplied source map. Note: The resolution for the
+	 * resulting mappings is the minimium of this map and the supplied map.
+	 *
+	 * @param aSourceMapConsumer The source map to be applied.
+	 * @param aSourceFile Optional. The filename of the source file.
+	 *        If omitted, SourceMapConsumer's file property will be used.
+	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+	 *        This parameter is needed when the two source maps aren't in the same
+	 *        directory, and the source map to be applied contains relative source
+	 *        paths. If so, those relative source paths need to be rewritten
+	 *        relative to the SourceMapGenerator.
+	 */
+	SourceMapGenerator.prototype.applySourceMap =
+	  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+	    var sourceFile = aSourceFile;
+	    // If aSourceFile is omitted, we will use the file property of the SourceMap
+	    if (aSourceFile == null) {
+	      if (aSourceMapConsumer.file == null) {
+	        throw new Error(
+	          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+	          'or the source map\'s "file" property. Both were omitted.'
+	        );
+	      }
+	      sourceFile = aSourceMapConsumer.file;
+	    }
+	    var sourceRoot = this._sourceRoot;
+	    // Make "sourceFile" relative if an absolute Url is passed.
+	    if (sourceRoot != null) {
+	      sourceFile = util.relative(sourceRoot, sourceFile);
+	    }
+	    // Applying the SourceMap can add and remove items from the sources and
+	    // the names array.
+	    var newSources = new ArraySet();
+	    var newNames = new ArraySet();
+
+	    // Find mappings for the "sourceFile"
+	    this._mappings.unsortedForEach(function (mapping) {
+	      if (mapping.source === sourceFile && mapping.originalLine != null) {
+	        // Check if it can be mapped by the source map, then update the mapping.
+	        var original = aSourceMapConsumer.originalPositionFor({
+	          line: mapping.originalLine,
+	          column: mapping.originalColumn
+	        });
+	        if (original.source != null) {
+	          // Copy mapping
+	          mapping.source = original.source;
+	          if (aSourceMapPath != null) {
+	            mapping.source = util.join(aSourceMapPath, mapping.source)
+	          }
+	          if (sourceRoot != null) {
+	            mapping.source = util.relative(sourceRoot, mapping.source);
+	          }
+	          mapping.originalLine = original.line;
+	          mapping.originalColumn = original.column;
+	          if (original.name != null) {
+	            mapping.name = original.name;
+	          }
+	        }
+	      }
+
+	      var source = mapping.source;
+	      if (source != null && !newSources.has(source)) {
+	        newSources.add(source);
+	      }
+
+	      var name = mapping.name;
+	      if (name != null && !newNames.has(name)) {
+	        newNames.add(name);
+	      }
+
+	    }, this);
+	    this._sources = newSources;
+	    this._names = newNames;
+
+	    // Copy sourcesContents of applied map.
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aSourceMapPath != null) {
+	          sourceFile = util.join(aSourceMapPath, sourceFile);
+	        }
+	        if (sourceRoot != null) {
+	          sourceFile = util.relative(sourceRoot, sourceFile);
+	        }
+	        this.setSourceContent(sourceFile, content);
+	      }
+	    }, this);
+	  };
+
+	/**
+	 * A mapping can have one of the three levels of data:
+	 *
+	 *   1. Just the generated position.
+	 *   2. The Generated position, original position, and original source.
+	 *   3. Generated and original position, original source, as well as a name
+	 *      token.
+	 *
+	 * To maintain consistency, we validate that any new mapping being added falls
+	 * in to one of these categories.
+	 */
+	SourceMapGenerator.prototype._validateMapping =
+	  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+	                                              aName) {
+	    // When aOriginal is truthy but has empty values for .line and .column,
+	    // it is most likely a programmer error. In this case we throw a very
+	    // specific error message to try to guide them the right way.
+	    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+	    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+	        throw new Error(
+	            'original.line and original.column are not numbers -- you probably meant to omit ' +
+	            'the original mapping entirely and only map the generated position. If so, pass ' +
+	            'null for the original mapping instead of an object with empty or null values.'
+	        );
+	    }
+
+	    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	        && aGenerated.line > 0 && aGenerated.column >= 0
+	        && !aOriginal && !aSource && !aName) {
+	      // Case 1.
+	      return;
+	    }
+	    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+	             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+	             && aGenerated.line > 0 && aGenerated.column >= 0
+	             && aOriginal.line > 0 && aOriginal.column >= 0
+	             && aSource) {
+	      // Cases 2 and 3.
+	      return;
+	    }
+	    else {
+	      throw new Error('Invalid mapping: ' + JSON.stringify({
+	        generated: aGenerated,
+	        source: aSource,
+	        original: aOriginal,
+	        name: aName
+	      }));
+	    }
+	  };
+
+	/**
+	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+	 * specified by the source map format.
+	 */
+	SourceMapGenerator.prototype._serializeMappings =
+	  function SourceMapGenerator_serializeMappings() {
+	    var previousGeneratedColumn = 0;
+	    var previousGeneratedLine = 1;
+	    var previousOriginalColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousName = 0;
+	    var previousSource = 0;
+	    var result = '';
+	    var next;
+	    var mapping;
+	    var nameIdx;
+	    var sourceIdx;
+
+	    var mappings = this._mappings.toArray();
+	    for (var i = 0, len = mappings.length; i < len; i++) {
+	      mapping = mappings[i];
+	      next = ''
+
+	      if (mapping.generatedLine !== previousGeneratedLine) {
+	        previousGeneratedColumn = 0;
+	        while (mapping.generatedLine !== previousGeneratedLine) {
+	          next += ';';
+	          previousGeneratedLine++;
+	        }
+	      }
+	      else {
+	        if (i > 0) {
+	          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+	            continue;
+	          }
+	          next += ',';
+	        }
+	      }
+
+	      next += base64VLQ.encode(mapping.generatedColumn
+	                                 - previousGeneratedColumn);
+	      previousGeneratedColumn = mapping.generatedColumn;
+
+	      if (mapping.source != null) {
+	        sourceIdx = this._sources.indexOf(mapping.source);
+	        next += base64VLQ.encode(sourceIdx - previousSource);
+	        previousSource = sourceIdx;
+
+	        // lines are stored 0-based in SourceMap spec version 3
+	        next += base64VLQ.encode(mapping.originalLine - 1
+	                                   - previousOriginalLine);
+	        previousOriginalLine = mapping.originalLine - 1;
+
+	        next += base64VLQ.encode(mapping.originalColumn
+	                                   - previousOriginalColumn);
+	        previousOriginalColumn = mapping.originalColumn;
+
+	        if (mapping.name != null) {
+	          nameIdx = this._names.indexOf(mapping.name);
+	          next += base64VLQ.encode(nameIdx - previousName);
+	          previousName = nameIdx;
+	        }
+	      }
+
+	      result += next;
+	    }
+
+	    return result;
+	  };
+
+	SourceMapGenerator.prototype._generateSourcesContent =
+	  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+	    return aSources.map(function (source) {
+	      if (!this._sourcesContents) {
+	        return null;
+	      }
+	      if (aSourceRoot != null) {
+	        source = util.relative(aSourceRoot, source);
+	      }
+	      var key = util.toSetString(source);
+	      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+	        ? this._sourcesContents[key]
+	        : null;
+	    }, this);
+	  };
+
+	/**
+	 * Externalize the source map.
+	 */
+	SourceMapGenerator.prototype.toJSON =
+	  function SourceMapGenerator_toJSON() {
+	    var map = {
+	      version: this._version,
+	      sources: this._sources.toArray(),
+	      names: this._names.toArray(),
+	      mappings: this._serializeMappings()
+	    };
+	    if (this._file != null) {
+	      map.file = this._file;
+	    }
+	    if (this._sourceRoot != null) {
+	      map.sourceRoot = this._sourceRoot;
+	    }
+	    if (this._sourcesContents) {
+	      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+	    }
+
+	    return map;
+	  };
+
+	/**
+	 * Render the source map being generated to a string.
+	 */
+	SourceMapGenerator.prototype.toString =
+	  function SourceMapGenerator_toString() {
+	    return JSON.stringify(this.toJSON());
+	  };
+
+	exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+
+	var base64 = __webpack_require__(3);
+
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+
+	var VLQ_BASE_SHIFT = 5;
+
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	exports.encode = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+
+	  var vlq = toVLQSigned(aValue);
+
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+
+	  return encoded;
+	};
+
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+	/**
+	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+	 */
+	exports.encode = function (number) {
+	  if (0 <= number && number < intToCharMap.length) {
+	    return intToCharMap[number];
+	  }
+	  throw new TypeError("Must be between 0 and 63: " + number);
+	};
+
+	/**
+	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+	 * failure.
+	 */
+	exports.decode = function (charCode) {
+	  var bigA = 65;     // 'A'
+	  var bigZ = 90;     // 'Z'
+
+	  var littleA = 97;  // 'a'
+	  var littleZ = 122; // 'z'
+
+	  var zero = 48;     // '0'
+	  var nine = 57;     // '9'
+
+	  var plus = 43;     // '+'
+	  var slash = 47;    // '/'
+
+	  var littleOffset = 26;
+	  var numberOffset = 52;
+
+	  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+	  if (bigA <= charCode && charCode <= bigZ) {
+	    return (charCode - bigA);
+	  }
+
+	  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+	  if (littleA <= charCode && charCode <= littleZ) {
+	    return (charCode - littleA + littleOffset);
+	  }
+
+	  // 52 - 61: 0123456789
+	  if (zero <= charCode && charCode <= nine) {
+	    return (charCode - zero + numberOffset);
+	  }
+
+	  // 62: +
+	  if (charCode == plus) {
+	    return 62;
+	  }
+
+	  // 63: /
+	  if (charCode == slash) {
+	    return 63;
+	  }
+
+	  // Invalid base64 digit.
+	  return -1;
+	};
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	/**
+	 * This is a helper function for getting values from parameter/options
+	 * objects.
+	 *
+	 * @param args The object we are extracting values from
+	 * @param name The name of the property we are getting.
+	 * @param defaultValue An optional value to return if the property is missing
+	 * from the object. If this is not specified and the property is missing, an
+	 * error will be thrown.
+	 */
+	function getArg(aArgs, aName, aDefaultValue) {
+	  if (aName in aArgs) {
+	    return aArgs[aName];
+	  } else if (arguments.length === 3) {
+	    return aDefaultValue;
+	  } else {
+	    throw new Error('"' + aName + '" is a required argument.');
+	  }
+	}
+	exports.getArg = getArg;
+
+	var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+	var dataUrlRegexp = /^data:.+\,.+$/;
+
+	function urlParse(aUrl) {
+	  var match = aUrl.match(urlRegexp);
+	  if (!match) {
+	    return null;
+	  }
+	  return {
+	    scheme: match[1],
+	    auth: match[2],
+	    host: match[3],
+	    port: match[4],
+	    path: match[5]
+	  };
+	}
+	exports.urlParse = urlParse;
+
+	function urlGenerate(aParsedUrl) {
+	  var url = '';
+	  if (aParsedUrl.scheme) {
+	    url += aParsedUrl.scheme + ':';
+	  }
+	  url += '//';
+	  if (aParsedUrl.auth) {
+	    url += aParsedUrl.auth + '@';
+	  }
+	  if (aParsedUrl.host) {
+	    url += aParsedUrl.host;
+	  }
+	  if (aParsedUrl.port) {
+	    url += ":" + aParsedUrl.port
+	  }
+	  if (aParsedUrl.path) {
+	    url += aParsedUrl.path;
+	  }
+	  return url;
+	}
+	exports.urlGenerate = urlGenerate;
+
+	/**
+	 * Normalizes a path, or the path portion of a URL:
+	 *
+	 * - Replaces consecutive slashes with one slash.
+	 * - Removes unnecessary '.' parts.
+	 * - Removes unnecessary '<dir>/..' parts.
+	 *
+	 * Based on code in the Node.js 'path' core module.
+	 *
+	 * @param aPath The path or url to normalize.
+	 */
+	function normalize(aPath) {
+	  var path = aPath;
+	  var url = urlParse(aPath);
+	  if (url) {
+	    if (!url.path) {
+	      return aPath;
+	    }
+	    path = url.path;
+	  }
+	  var isAbsolute = exports.isAbsolute(path);
+
+	  var parts = path.split(/\/+/);
+	  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+	    part = parts[i];
+	    if (part === '.') {
+	      parts.splice(i, 1);
+	    } else if (part === '..') {
+	      up++;
+	    } else if (up > 0) {
+	      if (part === '') {
+	        // The first part is blank if the path is absolute. Trying to go
+	        // above the root is a no-op. Therefore we can remove all '..' parts
+	        // directly after the root.
+	        parts.splice(i + 1, up);
+	        up = 0;
+	      } else {
+	        parts.splice(i, 2);
+	        up--;
+	      }
+	    }
+	  }
+	  path = parts.join('/');
+
+	  if (path === '') {
+	    path = isAbsolute ? '/' : '.';
+	  }
+
+	  if (url) {
+	    url.path = path;
+	    return urlGenerate(url);
+	  }
+	  return path;
+	}
+	exports.normalize = normalize;
+
+	/**
+	 * Joins two paths/URLs.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be joined with the root.
+	 *
+	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+	 *   first.
+	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+	 *   is updated with the result and aRoot is returned. Otherwise the result
+	 *   is returned.
+	 *   - If aPath is absolute, the result is aPath.
+	 *   - Otherwise the two paths are joined with a slash.
+	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+	 */
+	function join(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+	  if (aPath === "") {
+	    aPath = ".";
+	  }
+	  var aPathUrl = urlParse(aPath);
+	  var aRootUrl = urlParse(aRoot);
+	  if (aRootUrl) {
+	    aRoot = aRootUrl.path || '/';
+	  }
+
+	  // `join(foo, '//www.example.org')`
+	  if (aPathUrl && !aPathUrl.scheme) {
+	    if (aRootUrl) {
+	      aPathUrl.scheme = aRootUrl.scheme;
+	    }
+	    return urlGenerate(aPathUrl);
+	  }
+
+	  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+	    return aPath;
+	  }
+
+	  // `join('http://', 'www.example.com')`
+	  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+	    aRootUrl.host = aPath;
+	    return urlGenerate(aRootUrl);
+	  }
+
+	  var joined = aPath.charAt(0) === '/'
+	    ? aPath
+	    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+	  if (aRootUrl) {
+	    aRootUrl.path = joined;
+	    return urlGenerate(aRootUrl);
+	  }
+	  return joined;
+	}
+	exports.join = join;
+
+	exports.isAbsolute = function (aPath) {
+	  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+	};
+
+	/**
+	 * Make a path relative to a URL or another path.
+	 *
+	 * @param aRoot The root path or URL.
+	 * @param aPath The path or URL to be made relative to aRoot.
+	 */
+	function relative(aRoot, aPath) {
+	  if (aRoot === "") {
+	    aRoot = ".";
+	  }
+
+	  aRoot = aRoot.replace(/\/$/, '');
+
+	  // It is possible for the path to be above the root. In this case, simply
+	  // checking whether the root is a prefix of the path won't work. Instead, we
+	  // need to remove components from the root one by one, until either we find
+	  // a prefix that fits, or we run out of components to remove.
+	  var level = 0;
+	  while (aPath.indexOf(aRoot + '/') !== 0) {
+	    var index = aRoot.lastIndexOf("/");
+	    if (index < 0) {
+	      return aPath;
+	    }
+
+	    // If the only part of the root that is left is the scheme (i.e. http://,
+	    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+	    // have exhausted all components, so the path is not relative to the root.
+	    aRoot = aRoot.slice(0, index);
+	    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+	      return aPath;
+	    }
+
+	    ++level;
+	  }
+
+	  // Make sure we add a "../" for each component we removed from the root.
+	  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+	}
+	exports.relative = relative;
+
+	var supportsNullProto = (function () {
+	  var obj = Object.create(null);
+	  return !('__proto__' in obj);
+	}());
+
+	function identity (s) {
+	  return s;
+	}
+
+	/**
+	 * Because behavior goes wacky when you set `__proto__` on objects, we
+	 * have to prefix all the strings in our set with an arbitrary character.
+	 *
+	 * See https://github.com/mozilla/source-map/pull/31 and
+	 * https://github.com/mozilla/source-map/issues/30
+	 *
+	 * @param String aStr
+	 */
+	function toSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return '$' + aStr;
+	  }
+
+	  return aStr;
+	}
+	exports.toSetString = supportsNullProto ? identity : toSetString;
+
+	function fromSetString(aStr) {
+	  if (isProtoString(aStr)) {
+	    return aStr.slice(1);
+	  }
+
+	  return aStr;
+	}
+	exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+	function isProtoString(s) {
+	  if (!s) {
+	    return false;
+	  }
+
+	  var length = s.length;
+
+	  if (length < 9 /* "__proto__".length */) {
+	    return false;
+	  }
+
+	  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+	      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+	      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+	      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+	      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+	      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+	    return false;
+	  }
+
+	  for (var i = length - 10; i >= 0; i--) {
+	    if (s.charCodeAt(i) !== 36 /* '$' */) {
+	      return false;
+	    }
+	  }
+
+	  return true;
+	}
+
+	/**
+	 * Comparator between two mappings where the original positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same original source/line/column, but different generated
+	 * line and column the same. Useful when searching for a mapping with a
+	 * stubbed out mapping.
+	 */
+	function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+	  var cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0 || onlyCompareOriginal) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByOriginalPositions = compareByOriginalPositions;
+
+	/**
+	 * Comparator between two mappings with deflated source and name indices where
+	 * the generated positions are compared.
+	 *
+	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+	 * mappings with the same generated line and column, but different
+	 * source/name/original line and column the same. Useful when searching for a
+	 * mapping with a stubbed out mapping.
+	 */
+	function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0 || onlyCompareGenerated) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+	function strcmp(aStr1, aStr2) {
+	  if (aStr1 === aStr2) {
+	    return 0;
+	  }
+
+	  if (aStr1 === null) {
+	    return 1; // aStr2 !== null
+	  }
+
+	  if (aStr2 === null) {
+	    return -1; // aStr1 !== null
+	  }
+
+	  if (aStr1 > aStr2) {
+	    return 1;
+	  }
+
+	  return -1;
+	}
+
+	/**
+	 * Comparator between two mappings with inflated source and name strings where
+	 * the generated positions are compared.
+	 */
+	function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+	  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = strcmp(mappingA.source, mappingB.source);
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalLine - mappingB.originalLine;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  cmp = mappingA.originalColumn - mappingB.originalColumn;
+	  if (cmp !== 0) {
+	    return cmp;
+	  }
+
+	  return strcmp(mappingA.name, mappingB.name);
+	}
+	exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+	/**
+	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+	 * in the source maps specification), and then parse the string as
+	 * JSON.
+	 */
+	function parseSourceMapInput(str) {
+	  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+	}
+	exports.parseSourceMapInput = parseSourceMapInput;
+
+	/**
+	 * Compute the URL of a source given the the source root, the source's
+	 * URL, and the source map's URL.
+	 */
+	function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+	  sourceURL = sourceURL || '';
+
+	  if (sourceRoot) {
+	    // This follows what Chrome does.
+	    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+	      sourceRoot += '/';
+	    }
+	    // The spec says:
+	    //   Line 4: An optional source root, useful for relocating source
+	    //   files on a server or removing repeated values in the
+	    //   “sources” entry.  This value is prepended to the individual
+	    //   entries in the “source” field.
+	    sourceURL = sourceRoot + sourceURL;
+	  }
+
+	  // Historically, SourceMapConsumer did not take the sourceMapURL as
+	  // a parameter.  This mode is still somewhat supported, which is why
+	  // this code block is conditional.  However, it's preferable to pass
+	  // the source map URL to SourceMapConsumer, so that this function
+	  // can implement the source URL resolution algorithm as outlined in
+	  // the spec.  This block is basically the equivalent of:
+	  //    new URL(sourceURL, sourceMapURL).toString()
+	  // ... except it avoids using URL, which wasn't available in the
+	  // older releases of node still supported by this library.
+	  //
+	  // The spec says:
+	  //   If the sources are not absolute URLs after prepending of the
+	  //   “sourceRoot”, the sources are resolved relative to the
+	  //   SourceMap (like resolving script src in a html document).
+	  if (sourceMapURL) {
+	    var parsed = urlParse(sourceMapURL);
+	    if (!parsed) {
+	      throw new Error("sourceMapURL could not be parsed");
+	    }
+	    if (parsed.path) {
+	      // Strip the last path component, but keep the "/".
+	      var index = parsed.path.lastIndexOf('/');
+	      if (index >= 0) {
+	        parsed.path = parsed.path.substring(0, index + 1);
+	      }
+	    }
+	    sourceURL = join(urlGenerate(parsed), sourceURL);
+	  }
+
+	  return normalize(sourceURL);
+	}
+	exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+
+	/**
+	 * A data structure which is a combination of an array and a set. Adding a new
+	 * member is O(1), testing for membership is O(1), and finding the index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+
+	exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2014 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+
+	/**
+	 * Determine whether mappingB is after mappingA with respect to generated
+	 * position.
+	 */
+	function generatedPositionAfter(mappingA, mappingB) {
+	  // Optimized for most common case
+	  var lineA = mappingA.generatedLine;
+	  var lineB = mappingB.generatedLine;
+	  var columnA = mappingA.generatedColumn;
+	  var columnB = mappingB.generatedColumn;
+	  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+	         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+	}
+
+	/**
+	 * A data structure to provide a sorted view of accumulated mappings in a
+	 * performance conscious manner. It trades a neglibable overhead in general
+	 * case for a large speedup in case of mappings being added in order.
+	 */
+	function MappingList() {
+	  this._array = [];
+	  this._sorted = true;
+	  // Serves as infimum
+	  this._last = {generatedLine: -1, generatedColumn: 0};
+	}
+
+	/**
+	 * Iterate through internal items. This method takes the same arguments that
+	 * `Array.prototype.forEach` takes.
+	 *
+	 * NOTE: The order of the mappings is NOT guaranteed.
+	 */
+	MappingList.prototype.unsortedForEach =
+	  function MappingList_forEach(aCallback, aThisArg) {
+	    this._array.forEach(aCallback, aThisArg);
+	  };
+
+	/**
+	 * Add the given source mapping.
+	 *
+	 * @param Object aMapping
+	 */
+	MappingList.prototype.add = function MappingList_add(aMapping) {
+	  if (generatedPositionAfter(this._last, aMapping)) {
+	    this._last = aMapping;
+	    this._array.push(aMapping);
+	  } else {
+	    this._sorted = false;
+	    this._array.push(aMapping);
+	  }
+	};
+
+	/**
+	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+	 * generated position.
+	 *
+	 * WARNING: This method returns internal data without copying, for
+	 * performance. The return value must NOT be mutated, and should be treated as
+	 * an immutable borrow. If you want to take ownership, you must make your own
+	 * copy.
+	 */
+	MappingList.prototype.toArray = function MappingList_toArray() {
+	  if (!this._sorted) {
+	    this._array.sort(util.compareByGeneratedPositionsInflated);
+	    this._sorted = true;
+	  }
+	  return this._array;
+	};
+
+	exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = __webpack_require__(4);
+	var binarySearch = __webpack_require__(8);
+	var ArraySet = __webpack_require__(5).ArraySet;
+	var base64VLQ = __webpack_require__(2);
+	var quickSort = __webpack_require__(9).quickSort;
+
+	function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  return sourceMap.sections != null
+	    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+	    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+	}
+
+	SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+	  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+	}
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	SourceMapConsumer.prototype._version = 3;
+
+	// `__generatedMappings` and `__originalMappings` are arrays that hold the
+	// parsed mapping coordinates from the source map's "mappings" attribute. They
+	// are lazily instantiated, accessed via the `_generatedMappings` and
+	// `_originalMappings` getters respectively, and we only parse the mappings
+	// and create these arrays once queried for a source location. We jump through
+	// these hoops because there can be many thousands of mappings, and parsing
+	// them is expensive, so we only want to do it if we must.
+	//
+	// Each object in the arrays is of the form:
+	//
+	//     {
+	//       generatedLine: The line number in the generated code,
+	//       generatedColumn: The column number in the generated code,
+	//       source: The path to the original source file that generated this
+	//               chunk of code,
+	//       originalLine: The line number in the original source that
+	//                     corresponds to this chunk of generated code,
+	//       originalColumn: The column number in the original source that
+	//                       corresponds to this chunk of generated code,
+	//       name: The name of the original symbol which generated this chunk of
+	//             code.
+	//     }
+	//
+	// All properties except for `generatedLine` and `generatedColumn` can be
+	// `null`.
+	//
+	// `_generatedMappings` is ordered by the generated positions.
+	//
+	// `_originalMappings` is ordered by the original positions.
+
+	SourceMapConsumer.prototype.__generatedMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__generatedMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__generatedMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype.__originalMappings = null;
+	Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+	  configurable: true,
+	  enumerable: true,
+	  get: function () {
+	    if (!this.__originalMappings) {
+	      this._parseMappings(this._mappings, this.sourceRoot);
+	    }
+
+	    return this.__originalMappings;
+	  }
+	});
+
+	SourceMapConsumer.prototype._charIsMappingSeparator =
+	  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+	    var c = aStr.charAt(index);
+	    return c === ";" || c === ",";
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	SourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    throw new Error("Subclasses must implement _parseMappings");
+	  };
+
+	SourceMapConsumer.GENERATED_ORDER = 1;
+	SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+	SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+	SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Iterate over each mapping between an original source/line/column and a
+	 * generated line/column in this source map.
+	 *
+	 * @param Function aCallback
+	 *        The function that is called with each mapping.
+	 * @param Object aContext
+	 *        Optional. If specified, this object will be the value of `this` every
+	 *        time that `aCallback` is called.
+	 * @param aOrder
+	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+	 *        iterate over the mappings sorted by the generated file's line/column
+	 *        order or the original's source/line/column order, respectively. Defaults to
+	 *        `SourceMapConsumer.GENERATED_ORDER`.
+	 */
+	SourceMapConsumer.prototype.eachMapping =
+	  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+	    var context = aContext || null;
+	    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+	    var mappings;
+	    switch (order) {
+	    case SourceMapConsumer.GENERATED_ORDER:
+	      mappings = this._generatedMappings;
+	      break;
+	    case SourceMapConsumer.ORIGINAL_ORDER:
+	      mappings = this._originalMappings;
+	      break;
+	    default:
+	      throw new Error("Unknown order of iteration.");
+	    }
+
+	    var sourceRoot = this.sourceRoot;
+	    mappings.map(function (mapping) {
+	      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+	      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+	      return {
+	        source: source,
+	        generatedLine: mapping.generatedLine,
+	        generatedColumn: mapping.generatedColumn,
+	        originalLine: mapping.originalLine,
+	        originalColumn: mapping.originalColumn,
+	        name: mapping.name === null ? null : this._names.at(mapping.name)
+	      };
+	    }, this).forEach(aCallback, context);
+	  };
+
+	/**
+	 * Returns all generated line and column information for the original source,
+	 * line, and column provided. If no column is provided, returns all mappings
+	 * corresponding to a either the line we are searching for or the next
+	 * closest line that has any mappings. Otherwise, returns all mappings
+	 * corresponding to the given line and either the column we are searching for
+	 * or the next closest column that has any offsets.
+	 *
+	 * The only argument is an object with the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number is 1-based.
+	 *   - column: Optional. the column number in the original source.
+	 *    The column number is 0-based.
+	 *
+	 * and an array of objects is returned, each with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *    line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *    The column number is 0-based.
+	 */
+	SourceMapConsumer.prototype.allGeneratedPositionsFor =
+	  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+	    var line = util.getArg(aArgs, 'line');
+
+	    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+	    // returns the index of the closest mapping less than the needle. By
+	    // setting needle.originalColumn to 0, we thus find the last mapping for
+	    // the given line, provided such a mapping exists.
+	    var needle = {
+	      source: util.getArg(aArgs, 'source'),
+	      originalLine: line,
+	      originalColumn: util.getArg(aArgs, 'column', 0)
+	    };
+
+	    needle.source = this._findSourceIndex(needle.source);
+	    if (needle.source < 0) {
+	      return [];
+	    }
+
+	    var mappings = [];
+
+	    var index = this._findMapping(needle,
+	                                  this._originalMappings,
+	                                  "originalLine",
+	                                  "originalColumn",
+	                                  util.compareByOriginalPositions,
+	                                  binarySearch.LEAST_UPPER_BOUND);
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (aArgs.column === undefined) {
+	        var originalLine = mapping.originalLine;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we found. Since
+	        // mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we found.
+	        while (mapping && mapping.originalLine === originalLine) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      } else {
+	        var originalColumn = mapping.originalColumn;
+
+	        // Iterate until either we run out of mappings, or we run into
+	        // a mapping for a different line than the one we were searching for.
+	        // Since mappings are sorted, this is guaranteed to find all mappings for
+	        // the line we are searching for.
+	        while (mapping &&
+	               mapping.originalLine === line &&
+	               mapping.originalColumn == originalColumn) {
+	          mappings.push({
+	            line: util.getArg(mapping, 'generatedLine', null),
+	            column: util.getArg(mapping, 'generatedColumn', null),
+	            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	          });
+
+	          mapping = this._originalMappings[++index];
+	        }
+	      }
+	    }
+
+	    return mappings;
+	  };
+
+	exports.SourceMapConsumer = SourceMapConsumer;
+
+	/**
+	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+	 * query for information about the original file positions by giving it a file
+	 * position in the generated source.
+	 *
+	 * The first parameter is the raw source map (either as a JSON string, or
+	 * already parsed to an object). According to the spec, source maps have the
+	 * following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - sources: An array of URLs to the original source files.
+	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+	 *   - sourcesContent: Optional. An array of contents of the original source files.
+	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *
+	 * Here is an example source map, taken from the source map spec[0]:
+	 *
+	 *     {
+	 *       version : 3,
+	 *       file: "out.js",
+	 *       sourceRoot : "",
+	 *       sources: ["foo.js", "bar.js"],
+	 *       names: ["src", "maps", "are", "fun"],
+	 *       mappings: "AA,AB;;ABCDE;"
+	 *     }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+	 */
+	function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sources = util.getArg(sourceMap, 'sources');
+	  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+	  // requires the array) to play nice here.
+	  var names = util.getArg(sourceMap, 'names', []);
+	  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+	  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+	  var mappings = util.getArg(sourceMap, 'mappings');
+	  var file = util.getArg(sourceMap, 'file', null);
+
+	  // Once again, Sass deviates from the spec and supplies the version as a
+	  // string rather than a number, so we use loose equality checking here.
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  if (sourceRoot) {
+	    sourceRoot = util.normalize(sourceRoot);
+	  }
+
+	  sources = sources
+	    .map(String)
+	    // Some source maps produce relative source paths like "./foo.js" instead of
+	    // "foo.js".  Normalize these first so that future comparisons will succeed.
+	    // See bugzil.la/1090768.
+	    .map(util.normalize)
+	    // Always ensure that absolute sources are internally stored relative to
+	    // the source root, if the source root is absolute. Not doing this would
+	    // be particularly problematic when the source root is a prefix of the
+	    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+	    .map(function (source) {
+	      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+	        ? util.relative(sourceRoot, source)
+	        : source;
+	    });
+
+	  // Pass `true` below to allow duplicate names and sources. While source maps
+	  // are intended to be compressed and deduplicated, the TypeScript compiler
+	  // sometimes generates source maps with duplicates in them. See Github issue
+	  // #72 and bugzil.la/889492.
+	  this._names = ArraySet.fromArray(names.map(String), true);
+	  this._sources = ArraySet.fromArray(sources, true);
+
+	  this._absoluteSources = this._sources.toArray().map(function (s) {
+	    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+	  });
+
+	  this.sourceRoot = sourceRoot;
+	  this.sourcesContent = sourcesContent;
+	  this._mappings = mappings;
+	  this._sourceMapURL = aSourceMapURL;
+	  this.file = file;
+	}
+
+	BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+
+	/**
+	 * Utility function to find the index of a source.  Returns -1 if not
+	 * found.
+	 */
+	BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+	  var relativeSource = aSource;
+	  if (this.sourceRoot != null) {
+	    relativeSource = util.relative(this.sourceRoot, relativeSource);
+	  }
+
+	  if (this._sources.has(relativeSource)) {
+	    return this._sources.indexOf(relativeSource);
+	  }
+
+	  // Maybe aSource is an absolute URL as returned by |sources|.  In
+	  // this case we can't simply undo the transform.
+	  var i;
+	  for (i = 0; i < this._absoluteSources.length; ++i) {
+	    if (this._absoluteSources[i] == aSource) {
+	      return i;
+	    }
+	  }
+
+	  return -1;
+	};
+
+	/**
+	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+	 *
+	 * @param SourceMapGenerator aSourceMap
+	 *        The source map that will be consumed.
+	 * @param String aSourceMapURL
+	 *        The URL at which the source map can be found (optional)
+	 * @returns BasicSourceMapConsumer
+	 */
+	BasicSourceMapConsumer.fromSourceMap =
+	  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+	    var smc = Object.create(BasicSourceMapConsumer.prototype);
+
+	    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+	    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+	    smc.sourceRoot = aSourceMap._sourceRoot;
+	    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+	                                                            smc.sourceRoot);
+	    smc.file = aSourceMap._file;
+	    smc._sourceMapURL = aSourceMapURL;
+	    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+	      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+	    });
+
+	    // Because we are modifying the entries (by converting string sources and
+	    // names to indices into the sources and names ArraySets), we have to make
+	    // a copy of the entry or else bad things happen. Shared mutable state
+	    // strikes again! See github issue #191.
+
+	    var generatedMappings = aSourceMap._mappings.toArray().slice();
+	    var destGeneratedMappings = smc.__generatedMappings = [];
+	    var destOriginalMappings = smc.__originalMappings = [];
+
+	    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+	      var srcMapping = generatedMappings[i];
+	      var destMapping = new Mapping;
+	      destMapping.generatedLine = srcMapping.generatedLine;
+	      destMapping.generatedColumn = srcMapping.generatedColumn;
+
+	      if (srcMapping.source) {
+	        destMapping.source = sources.indexOf(srcMapping.source);
+	        destMapping.originalLine = srcMapping.originalLine;
+	        destMapping.originalColumn = srcMapping.originalColumn;
+
+	        if (srcMapping.name) {
+	          destMapping.name = names.indexOf(srcMapping.name);
+	        }
+
+	        destOriginalMappings.push(destMapping);
+	      }
+
+	      destGeneratedMappings.push(destMapping);
+	    }
+
+	    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+
+	    return smc;
+	  };
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	BasicSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    return this._absoluteSources.slice();
+	  }
+	});
+
+	/**
+	 * Provide the JIT with a nice shape / hidden class.
+	 */
+	function Mapping() {
+	  this.generatedLine = 0;
+	  this.generatedColumn = 0;
+	  this.source = null;
+	  this.originalLine = null;
+	  this.originalColumn = null;
+	  this.name = null;
+	}
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	BasicSourceMapConsumer.prototype._parseMappings =
+	  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    var generatedLine = 1;
+	    var previousGeneratedColumn = 0;
+	    var previousOriginalLine = 0;
+	    var previousOriginalColumn = 0;
+	    var previousSource = 0;
+	    var previousName = 0;
+	    var length = aStr.length;
+	    var index = 0;
+	    var cachedSegments = {};
+	    var temp = {};
+	    var originalMappings = [];
+	    var generatedMappings = [];
+	    var mapping, str, segment, end, value;
+
+	    while (index < length) {
+	      if (aStr.charAt(index) === ';') {
+	        generatedLine++;
+	        index++;
+	        previousGeneratedColumn = 0;
+	      }
+	      else if (aStr.charAt(index) === ',') {
+	        index++;
+	      }
+	      else {
+	        mapping = new Mapping();
+	        mapping.generatedLine = generatedLine;
+
+	        // Because each offset is encoded relative to the previous one,
+	        // many segments often have the same encoding. We can exploit this
+	        // fact by caching the parsed variable length fields of each segment,
+	        // allowing us to avoid a second parse if we encounter the same
+	        // segment again.
+	        for (end = index; end < length; end++) {
+	          if (this._charIsMappingSeparator(aStr, end)) {
+	            break;
+	          }
+	        }
+	        str = aStr.slice(index, end);
+
+	        segment = cachedSegments[str];
+	        if (segment) {
+	          index += str.length;
+	        } else {
+	          segment = [];
+	          while (index < end) {
+	            base64VLQ.decode(aStr, index, temp);
+	            value = temp.value;
+	            index = temp.rest;
+	            segment.push(value);
+	          }
+
+	          if (segment.length === 2) {
+	            throw new Error('Found a source, but no line and column');
+	          }
+
+	          if (segment.length === 3) {
+	            throw new Error('Found a source and line, but no column');
+	          }
+
+	          cachedSegments[str] = segment;
+	        }
+
+	        // Generated column.
+	        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+	        previousGeneratedColumn = mapping.generatedColumn;
+
+	        if (segment.length > 1) {
+	          // Original source.
+	          mapping.source = previousSource + segment[1];
+	          previousSource += segment[1];
+
+	          // Original line.
+	          mapping.originalLine = previousOriginalLine + segment[2];
+	          previousOriginalLine = mapping.originalLine;
+	          // Lines are stored 0-based
+	          mapping.originalLine += 1;
+
+	          // Original column.
+	          mapping.originalColumn = previousOriginalColumn + segment[3];
+	          previousOriginalColumn = mapping.originalColumn;
+
+	          if (segment.length > 4) {
+	            // Original name.
+	            mapping.name = previousName + segment[4];
+	            previousName += segment[4];
+	          }
+	        }
+
+	        generatedMappings.push(mapping);
+	        if (typeof mapping.originalLine === 'number') {
+	          originalMappings.push(mapping);
+	        }
+	      }
+	    }
+
+	    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    this.__generatedMappings = generatedMappings;
+
+	    quickSort(originalMappings, util.compareByOriginalPositions);
+	    this.__originalMappings = originalMappings;
+	  };
+
+	/**
+	 * Find the mapping that best matches the hypothetical "needle" mapping that
+	 * we are searching for in the given "haystack" of mappings.
+	 */
+	BasicSourceMapConsumer.prototype._findMapping =
+	  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+	                                         aColumnName, aComparator, aBias) {
+	    // To return the position we are searching for, we must first find the
+	    // mapping for the given position and then return the opposite position it
+	    // points to. Because the mappings are sorted, we can use binary search to
+	    // find the best mapping.
+
+	    if (aNeedle[aLineName] <= 0) {
+	      throw new TypeError('Line must be greater than or equal to 1, got '
+	                          + aNeedle[aLineName]);
+	    }
+	    if (aNeedle[aColumnName] < 0) {
+	      throw new TypeError('Column must be greater than or equal to 0, got '
+	                          + aNeedle[aColumnName]);
+	    }
+
+	    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+	  };
+
+	/**
+	 * Compute the last column for each generated mapping. The last column is
+	 * inclusive.
+	 */
+	BasicSourceMapConsumer.prototype.computeColumnSpans =
+	  function SourceMapConsumer_computeColumnSpans() {
+	    for (var index = 0; index < this._generatedMappings.length; ++index) {
+	      var mapping = this._generatedMappings[index];
+
+	      // Mappings do not contain a field for the last generated columnt. We
+	      // can come up with an optimistic estimate, however, by assuming that
+	      // mappings are contiguous (i.e. given two consecutive mappings, the
+	      // first mapping ends where the second one starts).
+	      if (index + 1 < this._generatedMappings.length) {
+	        var nextMapping = this._generatedMappings[index + 1];
+
+	        if (mapping.generatedLine === nextMapping.generatedLine) {
+	          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+	          continue;
+	        }
+	      }
+
+	      // The last mapping for each line spans the entire line.
+	      mapping.lastGeneratedColumn = Infinity;
+	    }
+	  };
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	BasicSourceMapConsumer.prototype.originalPositionFor =
+	  function SourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._generatedMappings,
+	      "generatedLine",
+	      "generatedColumn",
+	      util.compareByGeneratedPositionsDeflated,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._generatedMappings[index];
+
+	      if (mapping.generatedLine === needle.generatedLine) {
+	        var source = util.getArg(mapping, 'source', null);
+	        if (source !== null) {
+	          source = this._sources.at(source);
+	          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+	        }
+	        var name = util.getArg(mapping, 'name', null);
+	        if (name !== null) {
+	          name = this._names.at(name);
+	        }
+	        return {
+	          source: source,
+	          line: util.getArg(mapping, 'originalLine', null),
+	          column: util.getArg(mapping, 'originalColumn', null),
+	          name: name
+	        };
+	      }
+	    }
+
+	    return {
+	      source: null,
+	      line: null,
+	      column: null,
+	      name: null
+	    };
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+	    if (!this.sourcesContent) {
+	      return false;
+	    }
+	    return this.sourcesContent.length >= this._sources.size() &&
+	      !this.sourcesContent.some(function (sc) { return sc == null; });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	BasicSourceMapConsumer.prototype.sourceContentFor =
+	  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    if (!this.sourcesContent) {
+	      return null;
+	    }
+
+	    var index = this._findSourceIndex(aSource);
+	    if (index >= 0) {
+	      return this.sourcesContent[index];
+	    }
+
+	    var relativeSource = aSource;
+	    if (this.sourceRoot != null) {
+	      relativeSource = util.relative(this.sourceRoot, relativeSource);
+	    }
+
+	    var url;
+	    if (this.sourceRoot != null
+	        && (url = util.urlParse(this.sourceRoot))) {
+	      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+	      // many users. We can help them out when they expect file:// URIs to
+	      // behave like it would if they were running a local HTTP server. See
+	      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+	      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+	      if (url.scheme == "file"
+	          && this._sources.has(fileUriAbsPath)) {
+	        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+	      }
+
+	      if ((!url.path || url.path == "/")
+	          && this._sources.has("/" + relativeSource)) {
+	        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+	      }
+	    }
+
+	    // This function is used recursively from
+	    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+	    // don't want to throw if we can't find the source - we just want to
+	    // return null, so we provide a flag to exit gracefully.
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	BasicSourceMapConsumer.prototype.generatedPositionFor =
+	  function SourceMapConsumer_generatedPositionFor(aArgs) {
+	    var source = util.getArg(aArgs, 'source');
+	    source = this._findSourceIndex(source);
+	    if (source < 0) {
+	      return {
+	        line: null,
+	        column: null,
+	        lastColumn: null
+	      };
+	    }
+
+	    var needle = {
+	      source: source,
+	      originalLine: util.getArg(aArgs, 'line'),
+	      originalColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    var index = this._findMapping(
+	      needle,
+	      this._originalMappings,
+	      "originalLine",
+	      "originalColumn",
+	      util.compareByOriginalPositions,
+	      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+	    );
+
+	    if (index >= 0) {
+	      var mapping = this._originalMappings[index];
+
+	      if (mapping.source === needle.source) {
+	        return {
+	          line: util.getArg(mapping, 'generatedLine', null),
+	          column: util.getArg(mapping, 'generatedColumn', null),
+	          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+	        };
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null,
+	      lastColumn: null
+	    };
+	  };
+
+	exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+	/**
+	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+	 * we can query for information. It differs from BasicSourceMapConsumer in
+	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+	 * input.
+	 *
+	 * The first parameter is a raw source map (either as a JSON string, or already
+	 * parsed to an object). According to the spec for indexed source maps, they
+	 * have the following attributes:
+	 *
+	 *   - version: Which version of the source map spec this map is following.
+	 *   - file: Optional. The generated file this source map is associated with.
+	 *   - sections: A list of section definitions.
+	 *
+	 * Each value under the "sections" field has two fields:
+	 *   - offset: The offset into the original specified at which this section
+	 *       begins to apply, defined as an object with a "line" and "column"
+	 *       field.
+	 *   - map: A source map definition. This source map could also be indexed,
+	 *       but doesn't have to be.
+	 *
+	 * Instead of the "map" field, it's also possible to have a "url" field
+	 * specifying a URL to retrieve a source map from, but that's currently
+	 * unsupported.
+	 *
+	 * Here's an example source map, taken from the source map spec[0], but
+	 * modified to omit a section which uses the "url" field.
+	 *
+	 *  {
+	 *    version : 3,
+	 *    file: "app.js",
+	 *    sections: [{
+	 *      offset: {line:100, column:10},
+	 *      map: {
+	 *        version : 3,
+	 *        file: "section.js",
+	 *        sources: ["foo.js", "bar.js"],
+	 *        names: ["src", "maps", "are", "fun"],
+	 *        mappings: "AAAA,E;;ABCDE;"
+	 *      }
+	 *    }],
+	 *  }
+	 *
+	 * The second parameter, if given, is a string whose value is the URL
+	 * at which the source map was found.  This URL is used to compute the
+	 * sources array.
+	 *
+	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+	 */
+	function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+	  var sourceMap = aSourceMap;
+	  if (typeof aSourceMap === 'string') {
+	    sourceMap = util.parseSourceMapInput(aSourceMap);
+	  }
+
+	  var version = util.getArg(sourceMap, 'version');
+	  var sections = util.getArg(sourceMap, 'sections');
+
+	  if (version != this._version) {
+	    throw new Error('Unsupported version: ' + version);
+	  }
+
+	  this._sources = new ArraySet();
+	  this._names = new ArraySet();
+
+	  var lastOffset = {
+	    line: -1,
+	    column: 0
+	  };
+	  this._sections = sections.map(function (s) {
+	    if (s.url) {
+	      // The url field will require support for asynchronicity.
+	      // See https://github.com/mozilla/source-map/issues/16
+	      throw new Error('Support for url field in sections not implemented.');
+	    }
+	    var offset = util.getArg(s, 'offset');
+	    var offsetLine = util.getArg(offset, 'line');
+	    var offsetColumn = util.getArg(offset, 'column');
+
+	    if (offsetLine < lastOffset.line ||
+	        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+	      throw new Error('Section offsets must be ordered and non-overlapping.');
+	    }
+	    lastOffset = offset;
+
+	    return {
+	      generatedOffset: {
+	        // The offset fields are 0-based, but we use 1-based indices when
+	        // encoding/decoding from VLQ.
+	        generatedLine: offsetLine + 1,
+	        generatedColumn: offsetColumn + 1
+	      },
+	      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+	    }
+	  });
+	}
+
+	IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+	IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+
+	/**
+	 * The version of the source mapping spec that we are consuming.
+	 */
+	IndexedSourceMapConsumer.prototype._version = 3;
+
+	/**
+	 * The list of original sources.
+	 */
+	Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+	  get: function () {
+	    var sources = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+	        sources.push(this._sections[i].consumer.sources[j]);
+	      }
+	    }
+	    return sources;
+	  }
+	});
+
+	/**
+	 * Returns the original source, line, and column information for the generated
+	 * source's line and column positions provided. The only argument is an object
+	 * with the following properties:
+	 *
+	 *   - line: The line number in the generated source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the generated source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - source: The original source file, or null.
+	 *   - line: The line number in the original source, or null.  The
+	 *     line number is 1-based.
+	 *   - column: The column number in the original source, or null.  The
+	 *     column number is 0-based.
+	 *   - name: The original identifier, or null.
+	 */
+	IndexedSourceMapConsumer.prototype.originalPositionFor =
+	  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+	    var needle = {
+	      generatedLine: util.getArg(aArgs, 'line'),
+	      generatedColumn: util.getArg(aArgs, 'column')
+	    };
+
+	    // Find the section containing the generated position we're trying to map
+	    // to an original position.
+	    var sectionIndex = binarySearch.search(needle, this._sections,
+	      function(needle, section) {
+	        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+	        if (cmp) {
+	          return cmp;
+	        }
+
+	        return (needle.generatedColumn -
+	                section.generatedOffset.generatedColumn);
+	      });
+	    var section = this._sections[sectionIndex];
+
+	    if (!section) {
+	      return {
+	        source: null,
+	        line: null,
+	        column: null,
+	        name: null
+	      };
+	    }
+
+	    return section.consumer.originalPositionFor({
+	      line: needle.generatedLine -
+	        (section.generatedOffset.generatedLine - 1),
+	      column: needle.generatedColumn -
+	        (section.generatedOffset.generatedLine === needle.generatedLine
+	         ? section.generatedOffset.generatedColumn - 1
+	         : 0),
+	      bias: aArgs.bias
+	    });
+	  };
+
+	/**
+	 * Return true if we have the source content for every source in the source
+	 * map, false otherwise.
+	 */
+	IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+	  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+	    return this._sections.every(function (s) {
+	      return s.consumer.hasContentsOfAllSources();
+	    });
+	  };
+
+	/**
+	 * Returns the original source content. The only argument is the url of the
+	 * original source file. Returns null if no original source content is
+	 * available.
+	 */
+	IndexedSourceMapConsumer.prototype.sourceContentFor =
+	  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      var content = section.consumer.sourceContentFor(aSource, true);
+	      if (content) {
+	        return content;
+	      }
+	    }
+	    if (nullOnMissing) {
+	      return null;
+	    }
+	    else {
+	      throw new Error('"' + aSource + '" is not in the SourceMap.');
+	    }
+	  };
+
+	/**
+	 * Returns the generated line and column information for the original source,
+	 * line, and column positions provided. The only argument is an object with
+	 * the following properties:
+	 *
+	 *   - source: The filename of the original source.
+	 *   - line: The line number in the original source.  The line number
+	 *     is 1-based.
+	 *   - column: The column number in the original source.  The column
+	 *     number is 0-based.
+	 *
+	 * and an object is returned with the following properties:
+	 *
+	 *   - line: The line number in the generated source, or null.  The
+	 *     line number is 1-based. 
+	 *   - column: The column number in the generated source, or null.
+	 *     The column number is 0-based.
+	 */
+	IndexedSourceMapConsumer.prototype.generatedPositionFor =
+	  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+
+	      // Only consider this section if the requested source is in the list of
+	      // sources of the consumer.
+	      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+	        continue;
+	      }
+	      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+	      if (generatedPosition) {
+	        var ret = {
+	          line: generatedPosition.line +
+	            (section.generatedOffset.generatedLine - 1),
+	          column: generatedPosition.column +
+	            (section.generatedOffset.generatedLine === generatedPosition.line
+	             ? section.generatedOffset.generatedColumn - 1
+	             : 0)
+	        };
+	        return ret;
+	      }
+	    }
+
+	    return {
+	      line: null,
+	      column: null
+	    };
+	  };
+
+	/**
+	 * Parse the mappings in a string in to a data structure which we can easily
+	 * query (the ordered arrays in the `this.__generatedMappings` and
+	 * `this.__originalMappings` properties).
+	 */
+	IndexedSourceMapConsumer.prototype._parseMappings =
+	  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+	    this.__generatedMappings = [];
+	    this.__originalMappings = [];
+	    for (var i = 0; i < this._sections.length; i++) {
+	      var section = this._sections[i];
+	      var sectionMappings = section.consumer._generatedMappings;
+	      for (var j = 0; j < sectionMappings.length; j++) {
+	        var mapping = sectionMappings[j];
+
+	        var source = section.consumer._sources.at(mapping.source);
+	        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+	        this._sources.add(source);
+	        source = this._sources.indexOf(source);
+
+	        var name = null;
+	        if (mapping.name) {
+	          name = section.consumer._names.at(mapping.name);
+	          this._names.add(name);
+	          name = this._names.indexOf(name);
+	        }
+
+	        // The mappings coming from the consumer for the section have
+	        // generated positions relative to the start of the section, so we
+	        // need to offset them to be relative to the start of the concatenated
+	        // generated file.
+	        var adjustedMapping = {
+	          source: source,
+	          generatedLine: mapping.generatedLine +
+	            (section.generatedOffset.generatedLine - 1),
+	          generatedColumn: mapping.generatedColumn +
+	            (section.generatedOffset.generatedLine === mapping.generatedLine
+	            ? section.generatedOffset.generatedColumn - 1
+	            : 0),
+	          originalLine: mapping.originalLine,
+	          originalColumn: mapping.originalColumn,
+	          name: name
+	        };
+
+	        this.__generatedMappings.push(adjustedMapping);
+	        if (typeof adjustedMapping.originalLine === 'number') {
+	          this.__originalMappings.push(adjustedMapping);
+	        }
+	      }
+	    }
+
+	    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+	    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+	  };
+
+	exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	exports.GREATEST_LOWER_BOUND = 1;
+	exports.LEAST_UPPER_BOUND = 2;
+
+	/**
+	 * Recursive implementation of binary search.
+	 *
+	 * @param aLow Indices here and lower do not contain the needle.
+	 * @param aHigh Indices here and higher do not contain the needle.
+	 * @param aNeedle The element being searched for.
+	 * @param aHaystack The non-empty array being searched.
+	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 */
+	function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+	  // This function terminates when one of the following is true:
+	  //
+	  //   1. We find the exact element we are looking for.
+	  //
+	  //   2. We did not find the exact element, but we can return the index of
+	  //      the next-closest element.
+	  //
+	  //   3. We did not find the exact element, and there is no next-closest
+	  //      element than the one we are searching for, so we return -1.
+	  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+	  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+	  if (cmp === 0) {
+	    // Found the element we are looking for.
+	    return mid;
+	  }
+	  else if (cmp > 0) {
+	    // Our needle is greater than aHaystack[mid].
+	    if (aHigh - mid > 1) {
+	      // The element is in the upper half.
+	      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // The exact needle element was not found in this haystack. Determine if
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return aHigh < aHaystack.length ? aHigh : -1;
+	    } else {
+	      return mid;
+	    }
+	  }
+	  else {
+	    // Our needle is less than aHaystack[mid].
+	    if (mid - aLow > 1) {
+	      // The element is in the lower half.
+	      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+	    }
+
+	    // we are in termination case (3) or (2) and return the appropriate thing.
+	    if (aBias == exports.LEAST_UPPER_BOUND) {
+	      return mid;
+	    } else {
+	      return aLow < 0 ? -1 : aLow;
+	    }
+	  }
+	}
+
+	/**
+	 * This is an implementation of binary search which will always try and return
+	 * the index of the closest element if there is no exact hit. This is because
+	 * mappings between original and generated line/col pairs are single points,
+	 * and there is an implicit region between each of them, so a miss just means
+	 * that you aren't on the very start of a region.
+	 *
+	 * @param aNeedle The element you are looking for.
+	 * @param aHaystack The array that is being searched.
+	 * @param aCompare A function which takes the needle and an element in the
+	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+	 *     than, equal to, or greater than the element, respectively.
+	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+	 *     closest element that is smaller than or greater than the one we are
+	 *     searching for, respectively, if the exact element cannot be found.
+	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+	 */
+	exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+	  if (aHaystack.length === 0) {
+	    return -1;
+	  }
+
+	  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+	                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+	  if (index < 0) {
+	    return -1;
+	  }
+
+	  // We have found either the exact element, or the next-closest element than
+	  // the one we are searching for. However, there may be more than one such
+	  // element. Make sure we always return the smallest of these.
+	  while (index - 1 >= 0) {
+	    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+	      break;
+	    }
+	    --index;
+	  }
+
+	  return index;
+	};
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	// It turns out that some (most?) JavaScript engines don't self-host
+	// `Array.prototype.sort`. This makes sense because C++ will likely remain
+	// faster than JS when doing raw CPU-intensive sorting. However, when using a
+	// custom comparator function, calling back and forth between the VM's C++ and
+	// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+	// worse generated code for the comparator function than would be optimal. In
+	// fact, when sorting with a comparator, these costs outweigh the benefits of
+	// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+	// a ~3500ms mean speed-up in `bench/bench.html`.
+
+	/**
+	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+	 *
+	 * @param {Array} ary
+	 *        The array.
+	 * @param {Number} x
+	 *        The index of the first item.
+	 * @param {Number} y
+	 *        The index of the second item.
+	 */
+	function swap(ary, x, y) {
+	  var temp = ary[x];
+	  ary[x] = ary[y];
+	  ary[y] = temp;
+	}
+
+	/**
+	 * Returns a random integer within the range `low .. high` inclusive.
+	 *
+	 * @param {Number} low
+	 *        The lower bound on the range.
+	 * @param {Number} high
+	 *        The upper bound on the range.
+	 */
+	function randomIntInRange(low, high) {
+	  return Math.round(low + (Math.random() * (high - low)));
+	}
+
+	/**
+	 * The Quick Sort algorithm.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 * @param {Number} p
+	 *        Start index of the array
+	 * @param {Number} r
+	 *        End index of the array
+	 */
+	function doQuickSort(ary, comparator, p, r) {
+	  // If our lower bound is less than our upper bound, we (1) partition the
+	  // array into two pieces and (2) recurse on each half. If it is not, this is
+	  // the empty array and our base case.
+
+	  if (p < r) {
+	    // (1) Partitioning.
+	    //
+	    // The partitioning chooses a pivot between `p` and `r` and moves all
+	    // elements that are less than or equal to the pivot to the before it, and
+	    // all the elements that are greater than it after it. The effect is that
+	    // once partition is done, the pivot is in the exact place it will be when
+	    // the array is put in sorted order, and it will not need to be moved
+	    // again. This runs in O(n) time.
+
+	    // Always choose a random pivot so that an input array which is reverse
+	    // sorted does not cause O(n^2) running time.
+	    var pivotIndex = randomIntInRange(p, r);
+	    var i = p - 1;
+
+	    swap(ary, pivotIndex, r);
+	    var pivot = ary[r];
+
+	    // Immediately after `j` is incremented in this loop, the following hold
+	    // true:
+	    //
+	    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+	    //
+	    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+	    for (var j = p; j < r; j++) {
+	      if (comparator(ary[j], pivot) <= 0) {
+	        i += 1;
+	        swap(ary, i, j);
+	      }
+	    }
+
+	    swap(ary, i + 1, j);
+	    var q = i + 1;
+
+	    // (2) Recurse on each half.
+
+	    doQuickSort(ary, comparator, p, q - 1);
+	    doQuickSort(ary, comparator, q + 1, r);
+	  }
+	}
+
+	/**
+	 * Sort the given array in-place with the given comparator function.
+	 *
+	 * @param {Array} ary
+	 *        An array to sort.
+	 * @param {function} comparator
+	 *        Function to use to compare two items.
+	 */
+	exports.quickSort = function (ary, comparator) {
+	  doQuickSort(ary, comparator, 0, ary.length - 1);
+	};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
+
+	/* -*- Mode: js; js-indent-level: 2; -*- */
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+	var util = __webpack_require__(4);
+
+	// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+	// operating systems these days (capturing the result).
+	var REGEX_NEWLINE = /(\r?\n)/;
+
+	// Newline character code for charCodeAt() comparisons
+	var NEWLINE_CODE = 10;
+
+	// Private symbol for identifying `SourceNode`s when multiple versions of
+	// the source-map library are loaded. This MUST NOT CHANGE across
+	// versions!
+	var isSourceNode = "$$$isSourceNode$$$";
+
+	/**
+	 * SourceNodes provide a way to abstract over interpolating/concatenating
+	 * snippets of generated JavaScript source code while maintaining the line and
+	 * column information associated with the original source code.
+	 *
+	 * @param aLine The original line number.
+	 * @param aColumn The original column number.
+	 * @param aSource The original source's filename.
+	 * @param aChunks Optional. An array of strings which are snippets of
+	 *        generated JS, or other SourceNodes.
+	 * @param aName The original identifier.
+	 */
+	function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+	  this.children = [];
+	  this.sourceContents = {};
+	  this.line = aLine == null ? null : aLine;
+	  this.column = aColumn == null ? null : aColumn;
+	  this.source = aSource == null ? null : aSource;
+	  this.name = aName == null ? null : aName;
+	  this[isSourceNode] = true;
+	  if (aChunks != null) this.add(aChunks);
+	}
+
+	/**
+	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+	 *
+	 * @param aGeneratedCode The generated code
+	 * @param aSourceMapConsumer The SourceMap for the generated code
+	 * @param aRelativePath Optional. The path that relative sources in the
+	 *        SourceMapConsumer should be relative to.
+	 */
+	SourceNode.fromStringWithSourceMap =
+	  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+	    // The SourceNode we want to fill with the generated code
+	    // and the SourceMap
+	    var node = new SourceNode();
+
+	    // All even indices of this array are one line of the generated code,
+	    // while all odd indices are the newlines between two adjacent lines
+	    // (since `REGEX_NEWLINE` captures its match).
+	    // Processed fragments are accessed by calling `shiftNextLine`.
+	    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+	    var remainingLinesIndex = 0;
+	    var shiftNextLine = function() {
+	      var lineContents = getNextLine();
+	      // The last line of a file might not have a newline.
+	      var newLine = getNextLine() || "";
+	      return lineContents + newLine;
+
+	      function getNextLine() {
+	        return remainingLinesIndex < remainingLines.length ?
+	            remainingLines[remainingLinesIndex++] : undefined;
+	      }
+	    };
+
+	    // We need to remember the position of "remainingLines"
+	    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+	    // The generate SourceNodes we need a code range.
+	    // To extract it current and last mapping is used.
+	    // Here we store the last mapping.
+	    var lastMapping = null;
+
+	    aSourceMapConsumer.eachMapping(function (mapping) {
+	      if (lastMapping !== null) {
+	        // We add the code from "lastMapping" to "mapping":
+	        // First check if there is a new line in between.
+	        if (lastGeneratedLine < mapping.generatedLine) {
+	          // Associate first line with "lastMapping"
+	          addMappingWithCode(lastMapping, shiftNextLine());
+	          lastGeneratedLine++;
+	          lastGeneratedColumn = 0;
+	          // The remaining code is added without mapping
+	        } else {
+	          // There is no new line in between.
+	          // Associate the code between "lastGeneratedColumn" and
+	          // "mapping.generatedColumn" with "lastMapping"
+	          var nextLine = remainingLines[remainingLinesIndex] || '';
+	          var code = nextLine.substr(0, mapping.generatedColumn -
+	                                        lastGeneratedColumn);
+	          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+	                                              lastGeneratedColumn);
+	          lastGeneratedColumn = mapping.generatedColumn;
+	          addMappingWithCode(lastMapping, code);
+	          // No more remaining code, continue
+	          lastMapping = mapping;
+	          return;
+	        }
+	      }
+	      // We add the generated code until the first mapping
+	      // to the SourceNode without any mapping.
+	      // Each line is added as separate string.
+	      while (lastGeneratedLine < mapping.generatedLine) {
+	        node.add(shiftNextLine());
+	        lastGeneratedLine++;
+	      }
+	      if (lastGeneratedColumn < mapping.generatedColumn) {
+	        var nextLine = remainingLines[remainingLinesIndex] || '';
+	        node.add(nextLine.substr(0, mapping.generatedColumn));
+	        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+	        lastGeneratedColumn = mapping.generatedColumn;
+	      }
+	      lastMapping = mapping;
+	    }, this);
+	    // We have processed all mappings.
+	    if (remainingLinesIndex < remainingLines.length) {
+	      if (lastMapping) {
+	        // Associate the remaining code in the current line with "lastMapping"
+	        addMappingWithCode(lastMapping, shiftNextLine());
+	      }
+	      // and add the remaining lines without any mapping
+	      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+	    }
+
+	    // Copy sourcesContent into SourceNode
+	    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+	      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+	      if (content != null) {
+	        if (aRelativePath != null) {
+	          sourceFile = util.join(aRelativePath, sourceFile);
+	        }
+	        node.setSourceContent(sourceFile, content);
+	      }
+	    });
+
+	    return node;
+
+	    function addMappingWithCode(mapping, code) {
+	      if (mapping === null || mapping.source === undefined) {
+	        node.add(code);
+	      } else {
+	        var source = aRelativePath
+	          ? util.join(aRelativePath, mapping.source)
+	          : mapping.source;
+	        node.add(new SourceNode(mapping.originalLine,
+	                                mapping.originalColumn,
+	                                source,
+	                                code,
+	                                mapping.name));
+	      }
+	    }
+	  };
+
+	/**
+	 * Add a chunk of generated JS to this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.add = function SourceNode_add(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    aChunk.forEach(function (chunk) {
+	      this.add(chunk);
+	    }, this);
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    if (aChunk) {
+	      this.children.push(aChunk);
+	    }
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Add a chunk of generated JS to the beginning of this source node.
+	 *
+	 * @param aChunk A string snippet of generated JS code, another instance of
+	 *        SourceNode, or an array where each member is one of those things.
+	 */
+	SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+	  if (Array.isArray(aChunk)) {
+	    for (var i = aChunk.length-1; i >= 0; i--) {
+	      this.prepend(aChunk[i]);
+	    }
+	  }
+	  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+	    this.children.unshift(aChunk);
+	  }
+	  else {
+	    throw new TypeError(
+	      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+	    );
+	  }
+	  return this;
+	};
+
+	/**
+	 * Walk over the tree of JS snippets in this node and its children. The
+	 * walking function is called once for each snippet of JS and is passed that
+	 * snippet and the its original associated source's line/column location.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+	  var chunk;
+	  for (var i = 0, len = this.children.length; i < len; i++) {
+	    chunk = this.children[i];
+	    if (chunk[isSourceNode]) {
+	      chunk.walk(aFn);
+	    }
+	    else {
+	      if (chunk !== '') {
+	        aFn(chunk, { source: this.source,
+	                     line: this.line,
+	                     column: this.column,
+	                     name: this.name });
+	      }
+	    }
+	  }
+	};
+
+	/**
+	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+	 * each of `this.children`.
+	 *
+	 * @param aSep The separator.
+	 */
+	SourceNode.prototype.join = function SourceNode_join(aSep) {
+	  var newChildren;
+	  var i;
+	  var len = this.children.length;
+	  if (len > 0) {
+	    newChildren = [];
+	    for (i = 0; i < len-1; i++) {
+	      newChildren.push(this.children[i]);
+	      newChildren.push(aSep);
+	    }
+	    newChildren.push(this.children[i]);
+	    this.children = newChildren;
+	  }
+	  return this;
+	};
+
+	/**
+	 * Call String.prototype.replace on the very right-most source snippet. Useful
+	 * for trimming whitespace from the end of a source node, etc.
+	 *
+	 * @param aPattern The pattern to replace.
+	 * @param aReplacement The thing to replace the pattern with.
+	 */
+	SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+	  var lastChild = this.children[this.children.length - 1];
+	  if (lastChild[isSourceNode]) {
+	    lastChild.replaceRight(aPattern, aReplacement);
+	  }
+	  else if (typeof lastChild === 'string') {
+	    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+	  }
+	  else {
+	    this.children.push(''.replace(aPattern, aReplacement));
+	  }
+	  return this;
+	};
+
+	/**
+	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+	 * in the sourcesContent field.
+	 *
+	 * @param aSourceFile The filename of the source file
+	 * @param aSourceContent The content of the source file
+	 */
+	SourceNode.prototype.setSourceContent =
+	  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+	    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+	  };
+
+	/**
+	 * Walk over the tree of SourceNodes. The walking function is called for each
+	 * source file content and is passed the filename and source content.
+	 *
+	 * @param aFn The traversal function.
+	 */
+	SourceNode.prototype.walkSourceContents =
+	  function SourceNode_walkSourceContents(aFn) {
+	    for (var i = 0, len = this.children.length; i < len; i++) {
+	      if (this.children[i][isSourceNode]) {
+	        this.children[i].walkSourceContents(aFn);
+	      }
+	    }
+
+	    var sources = Object.keys(this.sourceContents);
+	    for (var i = 0, len = sources.length; i < len; i++) {
+	      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+	    }
+	  };
+
+	/**
+	 * Return the string representation of this source node. Walks over the tree
+	 * and concatenates all the various snippets together to one string.
+	 */
+	SourceNode.prototype.toString = function SourceNode_toString() {
+	  var str = "";
+	  this.walk(function (chunk) {
+	    str += chunk;
+	  });
+	  return str;
+	};
+
+	/**
+	 * Returns the string representation of this source node along with a source
+	 * map.
+	 */
+	SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+	  var generated = {
+	    code: "",
+	    line: 1,
+	    column: 0
+	  };
+	  var map = new SourceMapGenerator(aArgs);
+	  var sourceMappingActive = false;
+	  var lastOriginalSource = null;
+	  var lastOriginalLine = null;
+	  var lastOriginalColumn = null;
+	  var lastOriginalName = null;
+	  this.walk(function (chunk, original) {
+	    generated.code += chunk;
+	    if (original.source !== null
+	        && original.line !== null
+	        && original.column !== null) {
+	      if(lastOriginalSource !== original.source
+	         || lastOriginalLine !== original.line
+	         || lastOriginalColumn !== original.column
+	         || lastOriginalName !== original.name) {
+	        map.addMapping({
+	          source: original.source,
+	          original: {
+	            line: original.line,
+	            column: original.column
+	          },
+	          generated: {
+	            line: generated.line,
+	            column: generated.column
+	          },
+	          name: original.name
+	        });
+	      }
+	      lastOriginalSource = original.source;
+	      lastOriginalLine = original.line;
+	      lastOriginalColumn = original.column;
+	      lastOriginalName = original.name;
+	      sourceMappingActive = true;
+	    } else if (sourceMappingActive) {
+	      map.addMapping({
+	        generated: {
+	          line: generated.line,
+	          column: generated.column
+	        }
+	      });
+	      lastOriginalSource = null;
+	      sourceMappingActive = false;
+	    }
+	    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+	      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+	        generated.line++;
+	        generated.column = 0;
+	        // Mappings end at eol
+	        if (idx + 1 === length) {
+	          lastOriginalSource = null;
+	          sourceMappingActive = false;
+	        } else if (sourceMappingActive) {
+	          map.addMapping({
+	            source: original.source,
+	            original: {
+	              line: original.line,
+	              column: original.column
+	            },
+	            generated: {
+	              line: generated.line,
+	              column: generated.column
+	            },
+	            name: original.name
+	          });
+	        }
+	      } else {
+	        generated.column++;
+	      }
+	    }
+	  });
+	  this.walkSourceContents(function (sourceFile, sourceContent) {
+	    map.setSourceContent(sourceFile, sourceContent);
+	  });
+
+	  return { code: generated.code, map: map };
+	};
+
+	exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ])
+});
+;
\ No newline at end of file
diff --git a/node_modules/recast/node_modules/source-map/dist/source-map.min.js b/node_modules/recast/node_modules/source-map/dist/source-map.min.js
new file mode 100644
index 0000000..c7c72da
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/dist/source-map.min.js
@@ -0,0 +1,2 @@
+!function(e,n){"object"==typeof exports&&"object"==typeof module?module.exports=n():"function"==typeof define&&define.amd?define([],n):"object"==typeof exports?exports.sourceMap=n():e.sourceMap=n()}(this,function(){return function(e){function n(t){if(r[t])return r[t].exports;var o=r[t]={exports:{},id:t,loaded:!1};return e[t].call(o.exports,o,o.exports,n),o.loaded=!0,o.exports}var r={};return n.m=e,n.c=r,n.p="",n(0)}([function(e,n,r){n.SourceMapGenerator=r(1).SourceMapGenerator,n.SourceMapConsumer=r(7).SourceMapConsumer,n.SourceNode=r(10).SourceNode},function(e,n,r){function t(e){e||(e={}),this._file=i.getArg(e,"file",null),this._sourceRoot=i.getArg(e,"sourceRoot",null),this._skipValidation=i.getArg(e,"skipValidation",!1),this._sources=new s,this._names=new s,this._mappings=new a,this._sourcesContents=null}var o=r(2),i=r(4),s=r(5).ArraySet,a=r(6).MappingList;t.prototype._version=3,t.fromSourceMap=function(e){var n=e.sourceRoot,r=new t({file:e.file,sourceRoot:n});return e.eachMapping(function(e){var t={generated:{line:e.generatedLine,column:e.generatedColumn}};null!=e.source&&(t.source=e.source,null!=n&&(t.source=i.relative(n,t.source)),t.original={line:e.originalLine,column:e.originalColumn},null!=e.name&&(t.name=e.name)),r.addMapping(t)}),e.sources.forEach(function(t){var o=t;null!==n&&(o=i.relative(n,t)),r._sources.has(o)||r._sources.add(o);var s=e.sourceContentFor(t);null!=s&&r.setSourceContent(t,s)}),r},t.prototype.addMapping=function(e){var n=i.getArg(e,"generated"),r=i.getArg(e,"original",null),t=i.getArg(e,"source",null),o=i.getArg(e,"name",null);this._skipValidation||this._validateMapping(n,r,t,o),null!=t&&(t=String(t),this._sources.has(t)||this._sources.add(t)),null!=o&&(o=String(o),this._names.has(o)||this._names.add(o)),this._mappings.add({generatedLine:n.line,generatedColumn:n.column,originalLine:null!=r&&r.line,originalColumn:null!=r&&r.column,source:t,name:o})},t.prototype.setSourceContent=function(e,n){var r=e;null!=this._sourceRoot&&(r=i.relative(this._sourceRoot,r)),null!=n?(this._sourcesContents||(this._sourcesContents=Object.create(null)),this._sourcesContents[i.toSetString(r)]=n):this._sourcesContents&&(delete this._sourcesContents[i.toSetString(r)],0===Object.keys(this._sourcesContents).length&&(this._sourcesContents=null))},t.prototype.applySourceMap=function(e,n,r){var t=n;if(null==n){if(null==e.file)throw new Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, or the source map\'s "file" property. Both were omitted.');t=e.file}var o=this._sourceRoot;null!=o&&(t=i.relative(o,t));var a=new s,u=new s;this._mappings.unsortedForEach(function(n){if(n.source===t&&null!=n.originalLine){var s=e.originalPositionFor({line:n.originalLine,column:n.originalColumn});null!=s.source&&(n.source=s.source,null!=r&&(n.source=i.join(r,n.source)),null!=o&&(n.source=i.relative(o,n.source)),n.originalLine=s.line,n.originalColumn=s.column,null!=s.name&&(n.name=s.name))}var l=n.source;null==l||a.has(l)||a.add(l);var c=n.name;null==c||u.has(c)||u.add(c)},this),this._sources=a,this._names=u,e.sources.forEach(function(n){var t=e.sourceContentFor(n);null!=t&&(null!=r&&(n=i.join(r,n)),null!=o&&(n=i.relative(o,n)),this.setSourceContent(n,t))},this)},t.prototype._validateMapping=function(e,n,r,t){if(n&&"number"!=typeof n.line&&"number"!=typeof n.column)throw new Error("original.line and original.column are not numbers -- you probably meant to omit the original mapping entirely and only map the generated position. If so, pass null for the original mapping instead of an object with empty or null values.");if((!(e&&"line"in e&&"column"in e&&e.line>0&&e.column>=0)||n||r||t)&&!(e&&"line"in e&&"column"in e&&n&&"line"in n&&"column"in n&&e.line>0&&e.column>=0&&n.line>0&&n.column>=0&&r))throw new Error("Invalid mapping: "+JSON.stringify({generated:e,source:r,original:n,name:t}))},t.prototype._serializeMappings=function(){for(var e,n,r,t,s=0,a=1,u=0,l=0,c=0,g=0,p="",h=this._mappings.toArray(),f=0,d=h.length;f<d;f++){if(n=h[f],e="",n.generatedLine!==a)for(s=0;n.generatedLine!==a;)e+=";",a++;else if(f>0){if(!i.compareByGeneratedPositionsInflated(n,h[f-1]))continue;e+=","}e+=o.encode(n.generatedColumn-s),s=n.generatedColumn,null!=n.source&&(t=this._sources.indexOf(n.source),e+=o.encode(t-g),g=t,e+=o.encode(n.originalLine-1-l),l=n.originalLine-1,e+=o.encode(n.originalColumn-u),u=n.originalColumn,null!=n.name&&(r=this._names.indexOf(n.name),e+=o.encode(r-c),c=r)),p+=e}return p},t.prototype._generateSourcesContent=function(e,n){return e.map(function(e){if(!this._sourcesContents)return null;null!=n&&(e=i.relative(n,e));var r=i.toSetString(e);return Object.prototype.hasOwnProperty.call(this._sourcesContents,r)?this._sourcesContents[r]:null},this)},t.prototype.toJSON=function(){var e={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};return null!=this._file&&(e.file=this._file),null!=this._sourceRoot&&(e.sourceRoot=this._sourceRoot),this._sourcesContents&&(e.sourcesContent=this._generateSourcesContent(e.sources,e.sourceRoot)),e},t.prototype.toString=function(){return JSON.stringify(this.toJSON())},n.SourceMapGenerator=t},function(e,n,r){function t(e){return e<0?(-e<<1)+1:(e<<1)+0}function o(e){var n=1===(1&e),r=e>>1;return n?-r:r}var i=r(3),s=5,a=1<<s,u=a-1,l=a;n.encode=function(e){var n,r="",o=t(e);do n=o&u,o>>>=s,o>0&&(n|=l),r+=i.encode(n);while(o>0);return r},n.decode=function(e,n,r){var t,a,c=e.length,g=0,p=0;do{if(n>=c)throw new Error("Expected more digits in base 64 VLQ value.");if(a=i.decode(e.charCodeAt(n++)),a===-1)throw new Error("Invalid base64 digit: "+e.charAt(n-1));t=!!(a&l),a&=u,g+=a<<p,p+=s}while(t);r.value=o(g),r.rest=n}},function(e,n){var r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");n.encode=function(e){if(0<=e&&e<r.length)return r[e];throw new TypeError("Must be between 0 and 63: "+e)},n.decode=function(e){var n=65,r=90,t=97,o=122,i=48,s=57,a=43,u=47,l=26,c=52;return n<=e&&e<=r?e-n:t<=e&&e<=o?e-t+l:i<=e&&e<=s?e-i+c:e==a?62:e==u?63:-1}},function(e,n){function r(e,n,r){if(n in e)return e[n];if(3===arguments.length)return r;throw new Error('"'+n+'" is a required argument.')}function t(e){var n=e.match(v);return n?{scheme:n[1],auth:n[2],host:n[3],port:n[4],path:n[5]}:null}function o(e){var n="";return e.scheme&&(n+=e.scheme+":"),n+="//",e.auth&&(n+=e.auth+"@"),e.host&&(n+=e.host),e.port&&(n+=":"+e.port),e.path&&(n+=e.path),n}function i(e){var r=e,i=t(e);if(i){if(!i.path)return e;r=i.path}for(var s,a=n.isAbsolute(r),u=r.split(/\/+/),l=0,c=u.length-1;c>=0;c--)s=u[c],"."===s?u.splice(c,1):".."===s?l++:l>0&&(""===s?(u.splice(c+1,l),l=0):(u.splice(c,2),l--));return r=u.join("/"),""===r&&(r=a?"/":"."),i?(i.path=r,o(i)):r}function s(e,n){""===e&&(e="."),""===n&&(n=".");var r=t(n),s=t(e);if(s&&(e=s.path||"/"),r&&!r.scheme)return s&&(r.scheme=s.scheme),o(r);if(r||n.match(y))return n;if(s&&!s.host&&!s.path)return s.host=n,o(s);var a="/"===n.charAt(0)?n:i(e.replace(/\/+$/,"")+"/"+n);return s?(s.path=a,o(s)):a}function a(e,n){""===e&&(e="."),e=e.replace(/\/$/,"");for(var r=0;0!==n.indexOf(e+"/");){var t=e.lastIndexOf("/");if(t<0)return n;if(e=e.slice(0,t),e.match(/^([^\/]+:\/)?\/*$/))return n;++r}return Array(r+1).join("../")+n.substr(e.length+1)}function u(e){return e}function l(e){return g(e)?"$"+e:e}function c(e){return g(e)?e.slice(1):e}function g(e){if(!e)return!1;var n=e.length;if(n<9)return!1;if(95!==e.charCodeAt(n-1)||95!==e.charCodeAt(n-2)||111!==e.charCodeAt(n-3)||116!==e.charCodeAt(n-4)||111!==e.charCodeAt(n-5)||114!==e.charCodeAt(n-6)||112!==e.charCodeAt(n-7)||95!==e.charCodeAt(n-8)||95!==e.charCodeAt(n-9))return!1;for(var r=n-10;r>=0;r--)if(36!==e.charCodeAt(r))return!1;return!0}function p(e,n,r){var t=f(e.source,n.source);return 0!==t?t:(t=e.originalLine-n.originalLine,0!==t?t:(t=e.originalColumn-n.originalColumn,0!==t||r?t:(t=e.generatedColumn-n.generatedColumn,0!==t?t:(t=e.generatedLine-n.generatedLine,0!==t?t:f(e.name,n.name)))))}function h(e,n,r){var t=e.generatedLine-n.generatedLine;return 0!==t?t:(t=e.generatedColumn-n.generatedColumn,0!==t||r?t:(t=f(e.source,n.source),0!==t?t:(t=e.originalLine-n.originalLine,0!==t?t:(t=e.originalColumn-n.originalColumn,0!==t?t:f(e.name,n.name)))))}function f(e,n){return e===n?0:null===e?1:null===n?-1:e>n?1:-1}function d(e,n){var r=e.generatedLine-n.generatedLine;return 0!==r?r:(r=e.generatedColumn-n.generatedColumn,0!==r?r:(r=f(e.source,n.source),0!==r?r:(r=e.originalLine-n.originalLine,0!==r?r:(r=e.originalColumn-n.originalColumn,0!==r?r:f(e.name,n.name)))))}function m(e){return JSON.parse(e.replace(/^\)]}'[^\n]*\n/,""))}function _(e,n,r){if(n=n||"",e&&("/"!==e[e.length-1]&&"/"!==n[0]&&(e+="/"),n=e+n),r){var a=t(r);if(!a)throw new Error("sourceMapURL could not be parsed");if(a.path){var u=a.path.lastIndexOf("/");u>=0&&(a.path=a.path.substring(0,u+1))}n=s(o(a),n)}return i(n)}n.getArg=r;var v=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/,y=/^data:.+\,.+$/;n.urlParse=t,n.urlGenerate=o,n.normalize=i,n.join=s,n.isAbsolute=function(e){return"/"===e.charAt(0)||v.test(e)},n.relative=a;var C=function(){var e=Object.create(null);return!("__proto__"in e)}();n.toSetString=C?u:l,n.fromSetString=C?u:c,n.compareByOriginalPositions=p,n.compareByGeneratedPositionsDeflated=h,n.compareByGeneratedPositionsInflated=d,n.parseSourceMapInput=m,n.computeSourceURL=_},function(e,n,r){function t(){this._array=[],this._set=s?new Map:Object.create(null)}var o=r(4),i=Object.prototype.hasOwnProperty,s="undefined"!=typeof Map;t.fromArray=function(e,n){for(var r=new t,o=0,i=e.length;o<i;o++)r.add(e[o],n);return r},t.prototype.size=function(){return s?this._set.size:Object.getOwnPropertyNames(this._set).length},t.prototype.add=function(e,n){var r=s?e:o.toSetString(e),t=s?this.has(e):i.call(this._set,r),a=this._array.length;t&&!n||this._array.push(e),t||(s?this._set.set(e,a):this._set[r]=a)},t.prototype.has=function(e){if(s)return this._set.has(e);var n=o.toSetString(e);return i.call(this._set,n)},t.prototype.indexOf=function(e){if(s){var n=this._set.get(e);if(n>=0)return n}else{var r=o.toSetString(e);if(i.call(this._set,r))return this._set[r]}throw new Error('"'+e+'" is not in the set.')},t.prototype.at=function(e){if(e>=0&&e<this._array.length)return this._array[e];throw new Error("No element indexed by "+e)},t.prototype.toArray=function(){return this._array.slice()},n.ArraySet=t},function(e,n,r){function t(e,n){var r=e.generatedLine,t=n.generatedLine,o=e.generatedColumn,s=n.generatedColumn;return t>r||t==r&&s>=o||i.compareByGeneratedPositionsInflated(e,n)<=0}function o(){this._array=[],this._sorted=!0,this._last={generatedLine:-1,generatedColumn:0}}var i=r(4);o.prototype.unsortedForEach=function(e,n){this._array.forEach(e,n)},o.prototype.add=function(e){t(this._last,e)?(this._last=e,this._array.push(e)):(this._sorted=!1,this._array.push(e))},o.prototype.toArray=function(){return this._sorted||(this._array.sort(i.compareByGeneratedPositionsInflated),this._sorted=!0),this._array},n.MappingList=o},function(e,n,r){function t(e,n){var r=e;return"string"==typeof e&&(r=a.parseSourceMapInput(e)),null!=r.sections?new s(r,n):new o(r,n)}function o(e,n){var r=e;"string"==typeof e&&(r=a.parseSourceMapInput(e));var t=a.getArg(r,"version"),o=a.getArg(r,"sources"),i=a.getArg(r,"names",[]),s=a.getArg(r,"sourceRoot",null),u=a.getArg(r,"sourcesContent",null),c=a.getArg(r,"mappings"),g=a.getArg(r,"file",null);if(t!=this._version)throw new Error("Unsupported version: "+t);s&&(s=a.normalize(s)),o=o.map(String).map(a.normalize).map(function(e){return s&&a.isAbsolute(s)&&a.isAbsolute(e)?a.relative(s,e):e}),this._names=l.fromArray(i.map(String),!0),this._sources=l.fromArray(o,!0),this._absoluteSources=this._sources.toArray().map(function(e){return a.computeSourceURL(s,e,n)}),this.sourceRoot=s,this.sourcesContent=u,this._mappings=c,this._sourceMapURL=n,this.file=g}function i(){this.generatedLine=0,this.generatedColumn=0,this.source=null,this.originalLine=null,this.originalColumn=null,this.name=null}function s(e,n){var r=e;"string"==typeof e&&(r=a.parseSourceMapInput(e));var o=a.getArg(r,"version"),i=a.getArg(r,"sections");if(o!=this._version)throw new Error("Unsupported version: "+o);this._sources=new l,this._names=new l;var s={line:-1,column:0};this._sections=i.map(function(e){if(e.url)throw new Error("Support for url field in sections not implemented.");var r=a.getArg(e,"offset"),o=a.getArg(r,"line"),i=a.getArg(r,"column");if(o<s.line||o===s.line&&i<s.column)throw new Error("Section offsets must be ordered and non-overlapping.");return s=r,{generatedOffset:{generatedLine:o+1,generatedColumn:i+1},consumer:new t(a.getArg(e,"map"),n)}})}var a=r(4),u=r(8),l=r(5).ArraySet,c=r(2),g=r(9).quickSort;t.fromSourceMap=function(e,n){return o.fromSourceMap(e,n)},t.prototype._version=3,t.prototype.__generatedMappings=null,Object.defineProperty(t.prototype,"_generatedMappings",{configurable:!0,enumerable:!0,get:function(){return this.__generatedMappings||this._parseMappings(this._mappings,this.sourceRoot),this.__generatedMappings}}),t.prototype.__originalMappings=null,Object.defineProperty(t.prototype,"_originalMappings",{configurable:!0,enumerable:!0,get:function(){return this.__originalMappings||this._parseMappings(this._mappings,this.sourceRoot),this.__originalMappings}}),t.prototype._charIsMappingSeparator=function(e,n){var r=e.charAt(n);return";"===r||","===r},t.prototype._parseMappings=function(e,n){throw new Error("Subclasses must implement _parseMappings")},t.GENERATED_ORDER=1,t.ORIGINAL_ORDER=2,t.GREATEST_LOWER_BOUND=1,t.LEAST_UPPER_BOUND=2,t.prototype.eachMapping=function(e,n,r){var o,i=n||null,s=r||t.GENERATED_ORDER;switch(s){case t.GENERATED_ORDER:o=this._generatedMappings;break;case t.ORIGINAL_ORDER:o=this._originalMappings;break;default:throw new Error("Unknown order of iteration.")}var u=this.sourceRoot;o.map(function(e){var n=null===e.source?null:this._sources.at(e.source);return n=a.computeSourceURL(u,n,this._sourceMapURL),{source:n,generatedLine:e.generatedLine,generatedColumn:e.generatedColumn,originalLine:e.originalLine,originalColumn:e.originalColumn,name:null===e.name?null:this._names.at(e.name)}},this).forEach(e,i)},t.prototype.allGeneratedPositionsFor=function(e){var n=a.getArg(e,"line"),r={source:a.getArg(e,"source"),originalLine:n,originalColumn:a.getArg(e,"column",0)};if(r.source=this._findSourceIndex(r.source),r.source<0)return[];var t=[],o=this._findMapping(r,this._originalMappings,"originalLine","originalColumn",a.compareByOriginalPositions,u.LEAST_UPPER_BOUND);if(o>=0){var i=this._originalMappings[o];if(void 0===e.column)for(var s=i.originalLine;i&&i.originalLine===s;)t.push({line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}),i=this._originalMappings[++o];else for(var l=i.originalColumn;i&&i.originalLine===n&&i.originalColumn==l;)t.push({line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}),i=this._originalMappings[++o]}return t},n.SourceMapConsumer=t,o.prototype=Object.create(t.prototype),o.prototype.consumer=t,o.prototype._findSourceIndex=function(e){var n=e;if(null!=this.sourceRoot&&(n=a.relative(this.sourceRoot,n)),this._sources.has(n))return this._sources.indexOf(n);var r;for(r=0;r<this._absoluteSources.length;++r)if(this._absoluteSources[r]==e)return r;return-1},o.fromSourceMap=function(e,n){var r=Object.create(o.prototype),t=r._names=l.fromArray(e._names.toArray(),!0),s=r._sources=l.fromArray(e._sources.toArray(),!0);r.sourceRoot=e._sourceRoot,r.sourcesContent=e._generateSourcesContent(r._sources.toArray(),r.sourceRoot),r.file=e._file,r._sourceMapURL=n,r._absoluteSources=r._sources.toArray().map(function(e){return a.computeSourceURL(r.sourceRoot,e,n)});for(var u=e._mappings.toArray().slice(),c=r.__generatedMappings=[],p=r.__originalMappings=[],h=0,f=u.length;h<f;h++){var d=u[h],m=new i;m.generatedLine=d.generatedLine,m.generatedColumn=d.generatedColumn,d.source&&(m.source=s.indexOf(d.source),m.originalLine=d.originalLine,m.originalColumn=d.originalColumn,d.name&&(m.name=t.indexOf(d.name)),p.push(m)),c.push(m)}return g(r.__originalMappings,a.compareByOriginalPositions),r},o.prototype._version=3,Object.defineProperty(o.prototype,"sources",{get:function(){return this._absoluteSources.slice()}}),o.prototype._parseMappings=function(e,n){for(var r,t,o,s,u,l=1,p=0,h=0,f=0,d=0,m=0,_=e.length,v=0,y={},C={},S=[],A=[];v<_;)if(";"===e.charAt(v))l++,v++,p=0;else if(","===e.charAt(v))v++;else{for(r=new i,r.generatedLine=l,s=v;s<_&&!this._charIsMappingSeparator(e,s);s++);if(t=e.slice(v,s),o=y[t])v+=t.length;else{for(o=[];v<s;)c.decode(e,v,C),u=C.value,v=C.rest,o.push(u);if(2===o.length)throw new Error("Found a source, but no line and column");if(3===o.length)throw new Error("Found a source and line, but no column");y[t]=o}r.generatedColumn=p+o[0],p=r.generatedColumn,o.length>1&&(r.source=d+o[1],d+=o[1],r.originalLine=h+o[2],h=r.originalLine,r.originalLine+=1,r.originalColumn=f+o[3],f=r.originalColumn,o.length>4&&(r.name=m+o[4],m+=o[4])),A.push(r),"number"==typeof r.originalLine&&S.push(r)}g(A,a.compareByGeneratedPositionsDeflated),this.__generatedMappings=A,g(S,a.compareByOriginalPositions),this.__originalMappings=S},o.prototype._findMapping=function(e,n,r,t,o,i){if(e[r]<=0)throw new TypeError("Line must be greater than or equal to 1, got "+e[r]);if(e[t]<0)throw new TypeError("Column must be greater than or equal to 0, got "+e[t]);return u.search(e,n,o,i)},o.prototype.computeColumnSpans=function(){for(var e=0;e<this._generatedMappings.length;++e){var n=this._generatedMappings[e];if(e+1<this._generatedMappings.length){var r=this._generatedMappings[e+1];if(n.generatedLine===r.generatedLine){n.lastGeneratedColumn=r.generatedColumn-1;continue}}n.lastGeneratedColumn=1/0}},o.prototype.originalPositionFor=function(e){var n={generatedLine:a.getArg(e,"line"),generatedColumn:a.getArg(e,"column")},r=this._findMapping(n,this._generatedMappings,"generatedLine","generatedColumn",a.compareByGeneratedPositionsDeflated,a.getArg(e,"bias",t.GREATEST_LOWER_BOUND));if(r>=0){var o=this._generatedMappings[r];if(o.generatedLine===n.generatedLine){var i=a.getArg(o,"source",null);null!==i&&(i=this._sources.at(i),i=a.computeSourceURL(this.sourceRoot,i,this._sourceMapURL));var s=a.getArg(o,"name",null);return null!==s&&(s=this._names.at(s)),{source:i,line:a.getArg(o,"originalLine",null),column:a.getArg(o,"originalColumn",null),name:s}}}return{source:null,line:null,column:null,name:null}},o.prototype.hasContentsOfAllSources=function(){return!!this.sourcesContent&&(this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(e){return null==e}))},o.prototype.sourceContentFor=function(e,n){if(!this.sourcesContent)return null;var r=this._findSourceIndex(e);if(r>=0)return this.sourcesContent[r];var t=e;null!=this.sourceRoot&&(t=a.relative(this.sourceRoot,t));var o;if(null!=this.sourceRoot&&(o=a.urlParse(this.sourceRoot))){var i=t.replace(/^file:\/\//,"");if("file"==o.scheme&&this._sources.has(i))return this.sourcesContent[this._sources.indexOf(i)];if((!o.path||"/"==o.path)&&this._sources.has("/"+t))return this.sourcesContent[this._sources.indexOf("/"+t)]}if(n)return null;throw new Error('"'+t+'" is not in the SourceMap.')},o.prototype.generatedPositionFor=function(e){var n=a.getArg(e,"source");if(n=this._findSourceIndex(n),n<0)return{line:null,column:null,lastColumn:null};var r={source:n,originalLine:a.getArg(e,"line"),originalColumn:a.getArg(e,"column")},o=this._findMapping(r,this._originalMappings,"originalLine","originalColumn",a.compareByOriginalPositions,a.getArg(e,"bias",t.GREATEST_LOWER_BOUND));if(o>=0){var i=this._originalMappings[o];if(i.source===r.source)return{line:a.getArg(i,"generatedLine",null),column:a.getArg(i,"generatedColumn",null),lastColumn:a.getArg(i,"lastGeneratedColumn",null)}}return{line:null,column:null,lastColumn:null}},n.BasicSourceMapConsumer=o,s.prototype=Object.create(t.prototype),s.prototype.constructor=t,s.prototype._version=3,Object.defineProperty(s.prototype,"sources",{get:function(){for(var e=[],n=0;n<this._sections.length;n++)for(var r=0;r<this._sections[n].consumer.sources.length;r++)e.push(this._sections[n].consumer.sources[r]);return e}}),s.prototype.originalPositionFor=function(e){var n={generatedLine:a.getArg(e,"line"),generatedColumn:a.getArg(e,"column")},r=u.search(n,this._sections,function(e,n){var r=e.generatedLine-n.generatedOffset.generatedLine;return r?r:e.generatedColumn-n.generatedOffset.generatedColumn}),t=this._sections[r];return t?t.consumer.originalPositionFor({line:n.generatedLine-(t.generatedOffset.generatedLine-1),column:n.generatedColumn-(t.generatedOffset.generatedLine===n.generatedLine?t.generatedOffset.generatedColumn-1:0),bias:e.bias}):{source:null,line:null,column:null,name:null}},s.prototype.hasContentsOfAllSources=function(){return this._sections.every(function(e){return e.consumer.hasContentsOfAllSources()})},s.prototype.sourceContentFor=function(e,n){for(var r=0;r<this._sections.length;r++){var t=this._sections[r],o=t.consumer.sourceContentFor(e,!0);if(o)return o}if(n)return null;throw new Error('"'+e+'" is not in the SourceMap.')},s.prototype.generatedPositionFor=function(e){for(var n=0;n<this._sections.length;n++){var r=this._sections[n];if(r.consumer._findSourceIndex(a.getArg(e,"source"))!==-1){var t=r.consumer.generatedPositionFor(e);if(t){var o={line:t.line+(r.generatedOffset.generatedLine-1),column:t.column+(r.generatedOffset.generatedLine===t.line?r.generatedOffset.generatedColumn-1:0)};return o}}}return{line:null,column:null}},s.prototype._parseMappings=function(e,n){this.__generatedMappings=[],this.__originalMappings=[];for(var r=0;r<this._sections.length;r++)for(var t=this._sections[r],o=t.consumer._generatedMappings,i=0;i<o.length;i++){var s=o[i],u=t.consumer._sources.at(s.source);u=a.computeSourceURL(t.consumer.sourceRoot,u,this._sourceMapURL),this._sources.add(u),u=this._sources.indexOf(u);var l=null;s.name&&(l=t.consumer._names.at(s.name),this._names.add(l),l=this._names.indexOf(l));var c={source:u,generatedLine:s.generatedLine+(t.generatedOffset.generatedLine-1),generatedColumn:s.generatedColumn+(t.generatedOffset.generatedLine===s.generatedLine?t.generatedOffset.generatedColumn-1:0),originalLine:s.originalLine,originalColumn:s.originalColumn,name:l};this.__generatedMappings.push(c),"number"==typeof c.originalLine&&this.__originalMappings.push(c)}g(this.__generatedMappings,a.compareByGeneratedPositionsDeflated),g(this.__originalMappings,a.compareByOriginalPositions)},n.IndexedSourceMapConsumer=s},function(e,n){function r(e,t,o,i,s,a){var u=Math.floor((t-e)/2)+e,l=s(o,i[u],!0);return 0===l?u:l>0?t-u>1?r(u,t,o,i,s,a):a==n.LEAST_UPPER_BOUND?t<i.length?t:-1:u:u-e>1?r(e,u,o,i,s,a):a==n.LEAST_UPPER_BOUND?u:e<0?-1:e}n.GREATEST_LOWER_BOUND=1,n.LEAST_UPPER_BOUND=2,n.search=function(e,t,o,i){if(0===t.length)return-1;var s=r(-1,t.length,e,t,o,i||n.GREATEST_LOWER_BOUND);if(s<0)return-1;for(;s-1>=0&&0===o(t[s],t[s-1],!0);)--s;return s}},function(e,n){function r(e,n,r){var t=e[n];e[n]=e[r],e[r]=t}function t(e,n){return Math.round(e+Math.random()*(n-e))}function o(e,n,i,s){if(i<s){var a=t(i,s),u=i-1;r(e,a,s);for(var l=e[s],c=i;c<s;c++)n(e[c],l)<=0&&(u+=1,r(e,u,c));r(e,u+1,c);var g=u+1;o(e,n,i,g-1),o(e,n,g+1,s)}}n.quickSort=function(e,n){o(e,n,0,e.length-1)}},function(e,n,r){function t(e,n,r,t,o){this.children=[],this.sourceContents={},this.line=null==e?null:e,this.column=null==n?null:n,this.source=null==r?null:r,this.name=null==o?null:o,this[u]=!0,null!=t&&this.add(t)}var o=r(1).SourceMapGenerator,i=r(4),s=/(\r?\n)/,a=10,u="$$$isSourceNode$$$";t.fromStringWithSourceMap=function(e,n,r){function o(e,n){if(null===e||void 0===e.source)a.add(n);else{var o=r?i.join(r,e.source):e.source;a.add(new t(e.originalLine,e.originalColumn,o,n,e.name))}}var a=new t,u=e.split(s),l=0,c=function(){function e(){return l<u.length?u[l++]:void 0}var n=e(),r=e()||"";return n+r},g=1,p=0,h=null;return n.eachMapping(function(e){if(null!==h){if(!(g<e.generatedLine)){var n=u[l]||"",r=n.substr(0,e.generatedColumn-p);return u[l]=n.substr(e.generatedColumn-p),p=e.generatedColumn,o(h,r),void(h=e)}o(h,c()),g++,p=0}for(;g<e.generatedLine;)a.add(c()),g++;if(p<e.generatedColumn){var n=u[l]||"";a.add(n.substr(0,e.generatedColumn)),u[l]=n.substr(e.generatedColumn),p=e.generatedColumn}h=e},this),l<u.length&&(h&&o(h,c()),a.add(u.splice(l).join(""))),n.sources.forEach(function(e){var t=n.sourceContentFor(e);null!=t&&(null!=r&&(e=i.join(r,e)),a.setSourceContent(e,t))}),a},t.prototype.add=function(e){if(Array.isArray(e))e.forEach(function(e){this.add(e)},this);else{if(!e[u]&&"string"!=typeof e)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+e);e&&this.children.push(e)}return this},t.prototype.prepend=function(e){if(Array.isArray(e))for(var n=e.length-1;n>=0;n--)this.prepend(e[n]);else{if(!e[u]&&"string"!=typeof e)throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+e);this.children.unshift(e)}return this},t.prototype.walk=function(e){for(var n,r=0,t=this.children.length;r<t;r++)n=this.children[r],n[u]?n.walk(e):""!==n&&e(n,{source:this.source,line:this.line,column:this.column,name:this.name})},t.prototype.join=function(e){var n,r,t=this.children.length;if(t>0){for(n=[],r=0;r<t-1;r++)n.push(this.children[r]),n.push(e);n.push(this.children[r]),this.children=n}return this},t.prototype.replaceRight=function(e,n){var r=this.children[this.children.length-1];return r[u]?r.replaceRight(e,n):"string"==typeof r?this.children[this.children.length-1]=r.replace(e,n):this.children.push("".replace(e,n)),this},t.prototype.setSourceContent=function(e,n){this.sourceContents[i.toSetString(e)]=n},t.prototype.walkSourceContents=function(e){for(var n=0,r=this.children.length;n<r;n++)this.children[n][u]&&this.children[n].walkSourceContents(e);for(var t=Object.keys(this.sourceContents),n=0,r=t.length;n<r;n++)e(i.fromSetString(t[n]),this.sourceContents[t[n]])},t.prototype.toString=function(){var e="";return this.walk(function(n){e+=n}),e},t.prototype.toStringWithSourceMap=function(e){var n={code:"",line:1,column:0},r=new o(e),t=!1,i=null,s=null,u=null,l=null;return this.walk(function(e,o){n.code+=e,null!==o.source&&null!==o.line&&null!==o.column?(i===o.source&&s===o.line&&u===o.column&&l===o.name||r.addMapping({source:o.source,original:{line:o.line,column:o.column},generated:{line:n.line,column:n.column},name:o.name}),i=o.source,s=o.line,u=o.column,l=o.name,t=!0):t&&(r.addMapping({generated:{line:n.line,column:n.column}}),i=null,t=!1);for(var c=0,g=e.length;c<g;c++)e.charCodeAt(c)===a?(n.line++,n.column=0,c+1===g?(i=null,t=!1):t&&r.addMapping({source:o.source,original:{line:o.line,column:o.column},generated:{line:n.line,column:n.column},name:o.name})):n.column++}),this.walkSourceContents(function(e,n){r.setSourceContent(e,n)}),{code:n.code,map:r}},n.SourceNode=t}])});
+//# sourceMappingURL=source-map.min.js.map
\ No newline at end of file
diff --git a/node_modules/recast/node_modules/source-map/dist/source-map.min.js.map b/node_modules/recast/node_modules/source-map/dist/source-map.min.js.map
new file mode 100644
index 0000000..d2cc86e
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/dist/source-map.min.js.map
@@ -0,0 +1 @@
+{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///source-map.min.js","webpack:///webpack/bootstrap 0fd5815da764db5fb9fe","webpack:///./source-map.js","webpack:///./lib/source-map-generator.js","webpack:///./lib/base64-vlq.js","webpack:///./lib/base64.js","webpack:///./lib/util.js","webpack:///./lib/array-set.js","webpack:///./lib/mapping-list.js","webpack:///./lib/source-map-consumer.js","webpack:///./lib/binary-search.js","webpack:///./lib/quick-sort.js","webpack:///./lib/source-node.js"],"names":["root","factory","exports","module","define","amd","this","modules","__webpack_require__","moduleId","installedModules","id","loaded","call","m","c","p","SourceMapGenerator","SourceMapConsumer","SourceNode","aArgs","_file","util","getArg","_sourceRoot","_skipValidation","_sources","ArraySet","_names","_mappings","MappingList","_sourcesContents","base64VLQ","prototype","_version","fromSourceMap","aSourceMapConsumer","sourceRoot","generator","file","eachMapping","mapping","newMapping","generated","line","generatedLine","column","generatedColumn","source","relative","original","originalLine","originalColumn","name","addMapping","sources","forEach","sourceFile","sourceRelative","has","add","content","sourceContentFor","setSourceContent","_validateMapping","String","aSourceFile","aSourceContent","Object","create","toSetString","keys","length","applySourceMap","aSourceMapPath","Error","newSources","newNames","unsortedForEach","originalPositionFor","join","aGenerated","aOriginal","aSource","aName","JSON","stringify","_serializeMappings","next","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","result","mappings","toArray","i","len","compareByGeneratedPositionsInflated","encode","indexOf","_generateSourcesContent","aSources","aSourceRoot","map","key","hasOwnProperty","toJSON","version","names","sourcesContent","toString","toVLQSigned","aValue","fromVLQSigned","isNegative","shifted","base64","VLQ_BASE_SHIFT","VLQ_BASE","VLQ_BASE_MASK","VLQ_CONTINUATION_BIT","digit","encoded","vlq","decode","aStr","aIndex","aOutParam","continuation","strLen","shift","charCodeAt","charAt","value","rest","intToCharMap","split","number","TypeError","charCode","bigA","bigZ","littleA","littleZ","zero","nine","plus","slash","littleOffset","numberOffset","aDefaultValue","arguments","urlParse","aUrl","match","urlRegexp","scheme","auth","host","port","path","urlGenerate","aParsedUrl","url","normalize","aPath","part","isAbsolute","parts","up","splice","aRoot","aPathUrl","aRootUrl","dataUrlRegexp","joined","replace","level","index","lastIndexOf","slice","Array","substr","identity","s","isProtoString","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","strcmp","compareByGeneratedPositionsDeflated","onlyCompareGenerated","aStr1","aStr2","parseSourceMapInput","str","parse","computeSourceURL","sourceURL","sourceMapURL","parsed","substring","test","supportsNullProto","obj","_array","_set","hasNativeMap","Map","fromArray","aArray","aAllowDuplicates","set","size","getOwnPropertyNames","sStr","isDuplicate","idx","push","get","at","aIdx","generatedPositionAfter","lineA","lineB","columnA","columnB","_sorted","_last","aCallback","aThisArg","aMapping","sort","aSourceMap","aSourceMapURL","sourceMap","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","_absoluteSources","_sourceMapURL","Mapping","lastOffset","_sections","offset","offsetLine","offsetColumn","generatedOffset","consumer","binarySearch","quickSort","__generatedMappings","defineProperty","configurable","enumerable","_parseMappings","__originalMappings","_charIsMappingSeparator","GENERATED_ORDER","ORIGINAL_ORDER","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","aContext","aOrder","context","order","_generatedMappings","_originalMappings","allGeneratedPositionsFor","needle","_findSourceIndex","_findMapping","undefined","lastColumn","relativeSource","smc","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","segment","end","cachedSegments","temp","originalMappings","aNeedle","aMappings","aLineName","aColumnName","aComparator","aBias","search","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","hasContentsOfAllSources","some","sc","nullOnMissing","fileUriAbsPath","generatedPositionFor","constructor","j","sectionIndex","section","bias","every","generatedPosition","ret","sectionMappings","adjustedMapping","recursiveSearch","aLow","aHigh","aHaystack","aCompare","mid","Math","floor","swap","ary","x","y","randomIntInRange","low","high","round","random","doQuickSort","comparator","r","pivotIndex","pivot","q","aLine","aColumn","aChunks","children","sourceContents","isSourceNode","REGEX_NEWLINE","NEWLINE_CODE","fromStringWithSourceMap","aGeneratedCode","aRelativePath","addMappingWithCode","code","node","remainingLines","remainingLinesIndex","shiftNextLine","getNextLine","lineContents","newLine","lastGeneratedLine","lastMapping","nextLine","aChunk","isArray","chunk","prepend","unshift","walk","aFn","aSep","newChildren","replaceRight","aPattern","aReplacement","lastChild","walkSourceContents","toStringWithSourceMap","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","sourceContent"],"mappings":"CAAA,SAAAA,EAAAC,GACA,gBAAAC,UAAA,gBAAAC,QACAA,OAAAD,QAAAD,IACA,kBAAAG,gBAAAC,IACAD,UAAAH,GACA,gBAAAC,SACAA,QAAA,UAAAD,IAEAD,EAAA,UAAAC,KACCK,KAAA,WACD,MCAgB,UAAUC,GCN1B,QAAAC,GAAAC,GAGA,GAAAC,EAAAD,GACA,MAAAC,GAAAD,GAAAP,OAGA,IAAAC,GAAAO,EAAAD,IACAP,WACAS,GAAAF,EACAG,QAAA,EAUA,OANAL,GAAAE,GAAAI,KAAAV,EAAAD,QAAAC,IAAAD,QAAAM,GAGAL,EAAAS,QAAA,EAGAT,EAAAD,QAvBA,GAAAQ,KAqCA,OATAF,GAAAM,EAAAP,EAGAC,EAAAO,EAAAL,EAGAF,EAAAQ,EAAA,GAGAR,EAAA,KDgBM,SAAUL,EAAQD,EAASM,GEjDjCN,EAAAe,mBAAAT,EAAA,GAAAS,mBACAf,EAAAgB,kBAAAV,EAAA,GAAAU,kBACAhB,EAAAiB,WAAAX,EAAA,IAAAW,YF6DM,SAAUhB,EAAQD,EAASM,GGhDjC,QAAAS,GAAAG,GACAA,IACAA,MAEAd,KAAAe,MAAAC,EAAAC,OAAAH,EAAA,aACAd,KAAAkB,YAAAF,EAAAC,OAAAH,EAAA,mBACAd,KAAAmB,gBAAAH,EAAAC,OAAAH,EAAA,qBACAd,KAAAoB,SAAA,GAAAC,GACArB,KAAAsB,OAAA,GAAAD,GACArB,KAAAuB,UAAA,GAAAC,GACAxB,KAAAyB,iBAAA,KAvBA,GAAAC,GAAAxB,EAAA,GACAc,EAAAd,EAAA,GACAmB,EAAAnB,EAAA,GAAAmB,SACAG,EAAAtB,EAAA,GAAAsB,WAuBAb,GAAAgB,UAAAC,SAAA,EAOAjB,EAAAkB,cACA,SAAAC,GACA,GAAAC,GAAAD,EAAAC,WACAC,EAAA,GAAArB,IACAsB,KAAAH,EAAAG,KACAF,cA2CA,OAzCAD,GAAAI,YAAA,SAAAC,GACA,GAAAC,IACAC,WACAC,KAAAH,EAAAI,cACAC,OAAAL,EAAAM,iBAIA,OAAAN,EAAAO,SACAN,EAAAM,OAAAP,EAAAO,OACA,MAAAX,IACAK,EAAAM,OAAA1B,EAAA2B,SAAAZ,EAAAK,EAAAM,SAGAN,EAAAQ,UACAN,KAAAH,EAAAU,aACAL,OAAAL,EAAAW,gBAGA,MAAAX,EAAAY,OACAX,EAAAW,KAAAZ,EAAAY,OAIAf,EAAAgB,WAAAZ,KAEAN,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAC,GAAAD,CACA,QAAApB,IACAqB,EAAApC,EAAA2B,SAAAZ,EAAAoB,IAGAnB,EAAAZ,SAAAiC,IAAAD,IACApB,EAAAZ,SAAAkC,IAAAF,EAGA,IAAAG,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,GACAvB,EAAAyB,iBAAAN,EAAAI,KAGAvB,GAaArB,EAAAgB,UAAAqB,WACA,SAAAlC,GACA,GAAAuB,GAAArB,EAAAC,OAAAH,EAAA,aACA8B,EAAA5B,EAAAC,OAAAH,EAAA,iBACA4B,EAAA1B,EAAAC,OAAAH,EAAA,eACAiC,EAAA/B,EAAAC,OAAAH,EAAA,YAEAd,MAAAmB,iBACAnB,KAAA0D,iBAAArB,EAAAO,EAAAF,EAAAK,GAGA,MAAAL,IACAA,EAAAiB,OAAAjB,GACA1C,KAAAoB,SAAAiC,IAAAX,IACA1C,KAAAoB,SAAAkC,IAAAZ,IAIA,MAAAK,IACAA,EAAAY,OAAAZ,GACA/C,KAAAsB,OAAA+B,IAAAN,IACA/C,KAAAsB,OAAAgC,IAAAP,IAIA/C,KAAAuB,UAAA+B,KACAf,cAAAF,EAAAC,KACAG,gBAAAJ,EAAAG,OACAK,aAAA,MAAAD,KAAAN,KACAQ,eAAA,MAAAF,KAAAJ,OACAE,SACAK,UAOApC,EAAAgB,UAAA8B,iBACA,SAAAG,EAAAC,GACA,GAAAnB,GAAAkB,CACA,OAAA5D,KAAAkB,cACAwB,EAAA1B,EAAA2B,SAAA3C,KAAAkB,YAAAwB,IAGA,MAAAmB,GAGA7D,KAAAyB,mBACAzB,KAAAyB,iBAAAqC,OAAAC,OAAA,OAEA/D,KAAAyB,iBAAAT,EAAAgD,YAAAtB,IAAAmB,GACK7D,KAAAyB,yBAGLzB,MAAAyB,iBAAAT,EAAAgD,YAAAtB,IACA,IAAAoB,OAAAG,KAAAjE,KAAAyB,kBAAAyC,SACAlE,KAAAyB,iBAAA,QAqBAd,EAAAgB,UAAAwC,eACA,SAAArC,EAAA8B,EAAAQ,GACA,GAAAjB,GAAAS,CAEA,UAAAA,EAAA,CACA,SAAA9B,EAAAG,KACA,SAAAoC,OACA,gJAIAlB,GAAArB,EAAAG,KAEA,GAAAF,GAAA/B,KAAAkB,WAEA,OAAAa,IACAoB,EAAAnC,EAAA2B,SAAAZ,EAAAoB,GAIA,IAAAmB,GAAA,GAAAjD,GACAkD,EAAA,GAAAlD,EAGArB,MAAAuB,UAAAiD,gBAAA,SAAArC,GACA,GAAAA,EAAAO,SAAAS,GAAA,MAAAhB,EAAAU,aAAA,CAEA,GAAAD,GAAAd,EAAA2C,qBACAnC,KAAAH,EAAAU,aACAL,OAAAL,EAAAW,gBAEA,OAAAF,EAAAF,SAEAP,EAAAO,OAAAE,EAAAF,OACA,MAAA0B,IACAjC,EAAAO,OAAA1B,EAAA0D,KAAAN,EAAAjC,EAAAO,SAEA,MAAAX,IACAI,EAAAO,OAAA1B,EAAA2B,SAAAZ,EAAAI,EAAAO,SAEAP,EAAAU,aAAAD,EAAAN,KACAH,EAAAW,eAAAF,EAAAJ,OACA,MAAAI,EAAAG,OACAZ,EAAAY,KAAAH,EAAAG,OAKA,GAAAL,GAAAP,EAAAO,MACA,OAAAA,GAAA4B,EAAAjB,IAAAX,IACA4B,EAAAhB,IAAAZ,EAGA,IAAAK,GAAAZ,EAAAY,IACA,OAAAA,GAAAwB,EAAAlB,IAAAN,IACAwB,EAAAjB,IAAAP,IAGK/C,MACLA,KAAAoB,SAAAkD,EACAtE,KAAAsB,OAAAiD,EAGAzC,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAI,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,IACA,MAAAa,IACAjB,EAAAnC,EAAA0D,KAAAN,EAAAjB,IAEA,MAAApB,IACAoB,EAAAnC,EAAA2B,SAAAZ,EAAAoB,IAEAnD,KAAAyD,iBAAAN,EAAAI,KAEKvD,OAcLW,EAAAgB,UAAA+B,iBACA,SAAAiB,EAAAC,EAAAC,EACAC,GAKA,GAAAF,GAAA,gBAAAA,GAAAtC,MAAA,gBAAAsC,GAAApC,OACA,SAAA6B,OACA,+OAMA,OAAAM,GAAA,QAAAA,IAAA,UAAAA,IACAA,EAAArC,KAAA,GAAAqC,EAAAnC,QAAA,IACAoC,GAAAC,GAAAC,MAIAH,GAAA,QAAAA,IAAA,UAAAA,IACAC,GAAA,QAAAA,IAAA,UAAAA,IACAD,EAAArC,KAAA,GAAAqC,EAAAnC,QAAA,GACAoC,EAAAtC,KAAA,GAAAsC,EAAApC,QAAA,GACAqC,GAKA,SAAAR,OAAA,oBAAAU,KAAAC,WACA3C,UAAAsC,EACAjC,OAAAmC,EACAjC,SAAAgC,EACA7B,KAAA+B,MASAnE,EAAAgB,UAAAsD,mBACA,WAcA,OANAC,GACA/C,EACAgD,EACAC,EAVAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,GAMAC,EAAA5F,KAAAuB,UAAAsE,UACAC,EAAA,EAAAC,EAAAH,EAAA1B,OAA0C4B,EAAAC,EAASD,IAAA,CAInD,GAHA3D,EAAAyD,EAAAE,GACAZ,EAAA,GAEA/C,EAAAI,gBAAA+C,EAEA,IADAD,EAAA,EACAlD,EAAAI,gBAAA+C,GACAJ,GAAA,IACAI,QAIA,IAAAQ,EAAA,GACA,IAAA9E,EAAAgF,oCAAA7D,EAAAyD,EAAAE,EAAA,IACA,QAEAZ,IAAA,IAIAA,GAAAxD,EAAAuE,OAAA9D,EAAAM,gBACA4C,GACAA,EAAAlD,EAAAM,gBAEA,MAAAN,EAAAO,SACA0C,EAAApF,KAAAoB,SAAA8E,QAAA/D,EAAAO,QACAwC,GAAAxD,EAAAuE,OAAAb,EAAAM,GACAA,EAAAN,EAGAF,GAAAxD,EAAAuE,OAAA9D,EAAAU,aAAA,EACA2C,GACAA,EAAArD,EAAAU,aAAA,EAEAqC,GAAAxD,EAAAuE,OAAA9D,EAAAW,eACAyC,GACAA,EAAApD,EAAAW,eAEA,MAAAX,EAAAY,OACAoC,EAAAnF,KAAAsB,OAAA4E,QAAA/D,EAAAY,MACAmC,GAAAxD,EAAAuE,OAAAd,EAAAM,GACAA,EAAAN,IAIAQ,GAAAT,EAGA,MAAAS,IAGAhF,EAAAgB,UAAAwE,wBACA,SAAAC,EAAAC,GACA,MAAAD,GAAAE,IAAA,SAAA5D,GACA,IAAA1C,KAAAyB,iBACA,WAEA,OAAA4E,IACA3D,EAAA1B,EAAA2B,SAAA0D,EAAA3D,GAEA,IAAA6D,GAAAvF,EAAAgD,YAAAtB,EACA,OAAAoB,QAAAnC,UAAA6E,eAAAjG,KAAAP,KAAAyB,iBAAA8E,GACAvG,KAAAyB,iBAAA8E,GACA,MACKvG,OAMLW,EAAAgB,UAAA8E,OACA,WACA,GAAAH,IACAI,QAAA1G,KAAA4B,SACAqB,QAAAjD,KAAAoB,SAAAyE,UACAc,MAAA3G,KAAAsB,OAAAuE,UACAD,SAAA5F,KAAAiF,qBAYA,OAVA,OAAAjF,KAAAe,QACAuF,EAAArE,KAAAjC,KAAAe,OAEA,MAAAf,KAAAkB,cACAoF,EAAAvE,WAAA/B,KAAAkB,aAEAlB,KAAAyB,mBACA6E,EAAAM,eAAA5G,KAAAmG,wBAAAG,EAAArD,QAAAqD,EAAAvE,aAGAuE,GAMA3F,EAAAgB,UAAAkF,SACA,WACA,MAAA9B,MAAAC,UAAAhF,KAAAyG,WAGA7G,EAAAe,sBH2EM,SAAUd,EAAQD,EAASM,GI/ajC,QAAA4G,GAAAC,GACA,MAAAA,GAAA,IACAA,GAAA,MACAA,GAAA,KASA,QAAAC,GAAAD,GACA,GAAAE,GAAA,OAAAF,GACAG,EAAAH,GAAA,CACA,OAAAE,IACAC,EACAA,EAhDA,GAAAC,GAAAjH,EAAA,GAcAkH,EAAA,EAGAC,EAAA,GAAAD,EAGAE,EAAAD,EAAA,EAGAE,EAAAF,CA+BAzH,GAAAqG,OAAA,SAAAc,GACA,GACAS,GADAC,EAAA,GAGAC,EAAAZ,EAAAC,EAEA,GACAS,GAAAE,EAAAJ,EACAI,KAAAN,EACAM,EAAA,IAGAF,GAAAD,GAEAE,GAAAN,EAAAlB,OAAAuB,SACGE,EAAA,EAEH,OAAAD,IAOA7H,EAAA+H,OAAA,SAAAC,EAAAC,EAAAC,GACA,GAGAC,GAAAP,EAHAQ,EAAAJ,EAAA1D,OACAyB,EAAA,EACAsC,EAAA,CAGA,IACA,GAAAJ,GAAAG,EACA,SAAA3D,OAAA,6CAIA,IADAmD,EAAAL,EAAAQ,OAAAC,EAAAM,WAAAL,MACAL,KAAA,EACA,SAAAnD,OAAA,yBAAAuD,EAAAO,OAAAN,EAAA,GAGAE,MAAAP,EAAAD,GACAC,GAAAF,EACA3B,GAAA6B,GAAAS,EACAA,GAAAb,QACGW,EAEHD,GAAAM,MAAApB,EAAArB,GACAmC,EAAAO,KAAAR,IJ2fM,SAAUhI,EAAQD,GK9nBxB,GAAA0I,GAAA,mEAAAC,MAAA,GAKA3I,GAAAqG,OAAA,SAAAuC,GACA,MAAAA,KAAAF,EAAApE,OACA,MAAAoE,GAAAE,EAEA,UAAAC,WAAA,6BAAAD,IAOA5I,EAAA+H,OAAA,SAAAe,GACA,GAAAC,GAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,IAEAC,EAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,EAGA,OAAAT,IAAAD,MAAAE,EACAF,EAAAC,EAIAE,GAAAH,MAAAI,EACAJ,EAAAG,EAAAM,EAIAJ,GAAAL,MAAAM,EACAN,EAAAK,EAAAK,EAIAV,GAAAO,EACA,GAIAP,GAAAQ,EACA,IAIA,IL6oBM,SAAUrJ,EAAQD,GM7rBxB,QAAAqB,GAAAH,EAAAgE,EAAAuE,GACA,GAAAvE,IAAAhE,GACA,MAAAA,GAAAgE,EACG,QAAAwE,UAAApF,OACH,MAAAmF,EAEA,UAAAhF,OAAA,IAAAS,EAAA,6BAQA,QAAAyE,GAAAC,GACA,GAAAC,GAAAD,EAAAC,MAAAC,EACA,OAAAD,IAIAE,OAAAF,EAAA,GACAG,KAAAH,EAAA,GACAI,KAAAJ,EAAA,GACAK,KAAAL,EAAA,GACAM,KAAAN,EAAA,IAPA,KAYA,QAAAO,GAAAC,GACA,GAAAC,GAAA,EAiBA,OAhBAD,GAAAN,SACAO,GAAAD,EAAAN,OAAA,KAEAO,GAAA,KACAD,EAAAL,OACAM,GAAAD,EAAAL,KAAA,KAEAK,EAAAJ,OACAK,GAAAD,EAAAJ,MAEAI,EAAAH,OACAI,GAAA,IAAAD,EAAAH,MAEAG,EAAAF,OACAG,GAAAD,EAAAF,MAEAG,EAeA,QAAAC,GAAAC,GACA,GAAAL,GAAAK,EACAF,EAAAX,EAAAa,EACA,IAAAF,EAAA,CACA,IAAAA,EAAAH,KACA,MAAAK,EAEAL,GAAAG,EAAAH,KAKA,OAAAM,GAHAC,EAAA1K,EAAA0K,WAAAP,GAEAQ,EAAAR,EAAAxB,MAAA,OACAiC,EAAA,EAAA1E,EAAAyE,EAAArG,OAAA,EAA8C4B,GAAA,EAAQA,IACtDuE,EAAAE,EAAAzE,GACA,MAAAuE,EACAE,EAAAE,OAAA3E,EAAA,GACK,OAAAuE,EACLG,IACKA,EAAA,IACL,KAAAH,GAIAE,EAAAE,OAAA3E,EAAA,EAAA0E,GACAA,EAAA,IAEAD,EAAAE,OAAA3E,EAAA,GACA0E,KAUA,OANAT,GAAAQ,EAAA7F,KAAA,KAEA,KAAAqF,IACAA,EAAAO,EAAA,SAGAJ,GACAA,EAAAH,OACAC,EAAAE,IAEAH,EAoBA,QAAArF,GAAAgG,EAAAN,GACA,KAAAM,IACAA,EAAA,KAEA,KAAAN,IACAA,EAAA,IAEA,IAAAO,GAAApB,EAAAa,GACAQ,EAAArB,EAAAmB,EAMA,IALAE,IACAF,EAAAE,EAAAb,MAAA,KAIAY,MAAAhB,OAIA,MAHAiB,KACAD,EAAAhB,OAAAiB,EAAAjB,QAEAK,EAAAW,EAGA,IAAAA,GAAAP,EAAAX,MAAAoB,GACA,MAAAT,EAIA,IAAAQ,MAAAf,OAAAe,EAAAb,KAEA,MADAa,GAAAf,KAAAO,EACAJ,EAAAY,EAGA,IAAAE,GAAA,MAAAV,EAAAjC,OAAA,GACAiC,EACAD,EAAAO,EAAAK,QAAA,eAAAX,EAEA,OAAAQ,IACAA,EAAAb,KAAAe,EACAd,EAAAY,IAEAE,EAcA,QAAAnI,GAAA+H,EAAAN,GACA,KAAAM,IACAA,EAAA,KAGAA,IAAAK,QAAA,SAOA,KADA,GAAAC,GAAA,EACA,IAAAZ,EAAAlE,QAAAwE,EAAA,OACA,GAAAO,GAAAP,EAAAQ,YAAA,IACA,IAAAD,EAAA,EACA,MAAAb,EAOA,IADAM,IAAAS,MAAA,EAAAF,GACAP,EAAAjB,MAAA,qBACA,MAAAW,KAGAY,EAIA,MAAAI,OAAAJ,EAAA,GAAAtG,KAAA,OAAA0F,EAAAiB,OAAAX,EAAAxG,OAAA,GASA,QAAAoH,GAAAC,GACA,MAAAA,GAYA,QAAAvH,GAAA4D,GACA,MAAA4D,GAAA5D,GACA,IAAAA,EAGAA,EAIA,QAAA6D,GAAA7D,GACA,MAAA4D,GAAA5D,GACAA,EAAAuD,MAAA,GAGAvD,EAIA,QAAA4D,GAAAD,GACA,IAAAA,EACA,QAGA,IAAArH,GAAAqH,EAAArH,MAEA,IAAAA,EAAA,EACA,QAGA,SAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,MAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,IACA,KAAAqH,EAAArD,WAAAhE,EAAA,GACA,QAGA,QAAA4B,GAAA5B,EAAA,GAA2B4B,GAAA,EAAQA,IACnC,QAAAyF,EAAArD,WAAApC,GACA,QAIA,UAWA,QAAA4F,GAAAC,EAAAC,EAAAC,GACA,GAAAC,GAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,OACA,YAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,GAAAD,EACAC,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,EACAA,GAGAA,EAAAH,EAAApJ,cAAAqJ,EAAArJ,cACA,IAAAuJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UAaA,QAAAiJ,GAAAL,EAAAC,EAAAK,GACA,GAAAH,GAAAH,EAAApJ,cAAAqJ,EAAArJ,aACA,YAAAuJ,EACAA,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,GAAAG,EACAH,GAGAA,EAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,QACA,IAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UAIA,QAAAgJ,GAAAG,EAAAC,GACA,MAAAD,KAAAC,EACA,EAGA,OAAAD,EACA,EAGA,OAAAC,GACA,EAGAD,EAAAC,EACA,GAGA,EAOA,QAAAnG,GAAA2F,EAAAC,GACA,GAAAE,GAAAH,EAAApJ,cAAAqJ,EAAArJ,aACA,YAAAuJ,EACAA,GAGAA,EAAAH,EAAAlJ,gBAAAmJ,EAAAnJ,gBACA,IAAAqJ,EACAA,GAGAA,EAAAC,EAAAJ,EAAAjJ,OAAAkJ,EAAAlJ,QACA,IAAAoJ,EACAA,GAGAA,EAAAH,EAAA9I,aAAA+I,EAAA/I,aACA,IAAAiJ,EACAA,GAGAA,EAAAH,EAAA7I,eAAA8I,EAAA9I,eACA,IAAAgJ,EACAA,EAGAC,EAAAJ,EAAA5I,KAAA6I,EAAA7I,UASA,QAAAqJ,GAAAC,GACA,MAAAtH,MAAAuH,MAAAD,EAAAtB,QAAA,iBAAsC,KAQtC,QAAAwB,GAAAxK,EAAAyK,EAAAC,GA8BA,GA7BAD,KAAA,GAEAzK,IAEA,MAAAA,IAAAmC,OAAA,UAAAsI,EAAA,KACAzK,GAAA,KAOAyK,EAAAzK,EAAAyK,GAiBAC,EAAA,CACA,GAAAC,GAAAnD,EAAAkD,EACA,KAAAC,EACA,SAAArI,OAAA,mCAEA,IAAAqI,EAAA3C,KAAA,CAEA,GAAAkB,GAAAyB,EAAA3C,KAAAmB,YAAA,IACAD,IAAA,IACAyB,EAAA3C,KAAA2C,EAAA3C,KAAA4C,UAAA,EAAA1B,EAAA,IAGAuB,EAAA9H,EAAAsF,EAAA0C,GAAAF,GAGA,MAAArC,GAAAqC,GA3cA5M,EAAAqB,QAEA,IAAAyI,GAAA,iEACAmB,EAAA,eAeAjL,GAAA2J,WAsBA3J,EAAAoK,cAwDApK,EAAAuK,YA2DAvK,EAAA8E,OAEA9E,EAAA0K,WAAA,SAAAF,GACA,YAAAA,EAAAjC,OAAA,IAAAuB,EAAAkD,KAAAxC,IAyCAxK,EAAA+C,UAEA,IAAAkK,GAAA,WACA,GAAAC,GAAAhJ,OAAAC,OAAA,KACA,sBAAA+I,MAuBAlN,GAAAoE,YAAA6I,EAAAvB,EAAAtH,EASApE,EAAA6L,cAAAoB,EAAAvB,EAAAG,EAsEA7L,EAAA8L,6BAuCA9L,EAAAoM,sCAsDApM,EAAAoG,sCAUApG,EAAAwM,sBAqDAxM,EAAA2M,oBNqtBM,SAAU1M,EAAQD,EAASM,GO3qCjC,QAAAmB,KACArB,KAAA+M,UACA/M,KAAAgN,KAAAC,EAAA,GAAAC,KAAApJ,OAAAC,OAAA,MAZA,GAAA/C,GAAAd,EAAA,GACAmD,EAAAS,OAAAnC,UAAA6E,eACAyG,EAAA,mBAAAC,IAgBA7L,GAAA8L,UAAA,SAAAC,EAAAC,GAEA,OADAC,GAAA,GAAAjM,GACAyE,EAAA,EAAAC,EAAAqH,EAAAlJ,OAAsC4B,EAAAC,EAASD,IAC/CwH,EAAAhK,IAAA8J,EAAAtH,GAAAuH,EAEA,OAAAC,IASAjM,EAAAM,UAAA4L,KAAA,WACA,MAAAN,GAAAjN,KAAAgN,KAAAO,KAAAzJ,OAAA0J,oBAAAxN,KAAAgN,MAAA9I,QAQA7C,EAAAM,UAAA2B,IAAA,SAAAsE,EAAAyF,GACA,GAAAI,GAAAR,EAAArF,EAAA5G,EAAAgD,YAAA4D,GACA8F,EAAAT,EAAAjN,KAAAqD,IAAAuE,GAAAvE,EAAA9C,KAAAP,KAAAgN,KAAAS,GACAE,EAAA3N,KAAA+M,OAAA7I,MACAwJ,KAAAL,GACArN,KAAA+M,OAAAa,KAAAhG,GAEA8F,IACAT,EACAjN,KAAAgN,KAAAM,IAAA1F,EAAA+F,GAEA3N,KAAAgN,KAAAS,GAAAE,IAUAtM,EAAAM,UAAA0B,IAAA,SAAAuE,GACA,GAAAqF,EACA,MAAAjN,MAAAgN,KAAA3J,IAAAuE,EAEA,IAAA6F,GAAAzM,EAAAgD,YAAA4D,EACA,OAAAvE,GAAA9C,KAAAP,KAAAgN,KAAAS,IASApM,EAAAM,UAAAuE,QAAA,SAAA0B,GACA,GAAAqF,EAAA,CACA,GAAAU,GAAA3N,KAAAgN,KAAAa,IAAAjG,EACA,IAAA+F,GAAA,EACA,MAAAA,OAEG,CACH,GAAAF,GAAAzM,EAAAgD,YAAA4D,EACA,IAAAvE,EAAA9C,KAAAP,KAAAgN,KAAAS,GACA,MAAAzN,MAAAgN,KAAAS,GAIA,SAAApJ,OAAA,IAAAuD,EAAA,yBAQAvG,EAAAM,UAAAmM,GAAA,SAAAC,GACA,GAAAA,GAAA,GAAAA,EAAA/N,KAAA+M,OAAA7I,OACA,MAAAlE,MAAA+M,OAAAgB,EAEA,UAAA1J,OAAA,yBAAA0J,IAQA1M,EAAAM,UAAAkE,QAAA,WACA,MAAA7F,MAAA+M,OAAA5B,SAGAvL,EAAAyB,YPmsCM,SAAUxB,EAAQD,EAASM,GQ9yCjC,QAAA8N,GAAArC,EAAAC,GAEA,GAAAqC,GAAAtC,EAAApJ,cACA2L,EAAAtC,EAAArJ,cACA4L,EAAAxC,EAAAlJ,gBACA2L,EAAAxC,EAAAnJ,eACA,OAAAyL,GAAAD,GAAAC,GAAAD,GAAAG,GAAAD,GACAnN,EAAAgF,oCAAA2F,EAAAC,IAAA,EAQA,QAAApK,KACAxB,KAAA+M,UACA/M,KAAAqO,SAAA,EAEArO,KAAAsO,OAAgB/L,eAAA,EAAAE,gBAAA,GAzBhB,GAAAzB,GAAAd,EAAA,EAkCAsB,GAAAG,UAAA6C,gBACA,SAAA+J,EAAAC,GACAxO,KAAA+M,OAAA7J,QAAAqL,EAAAC,IAQAhN,EAAAG,UAAA2B,IAAA,SAAAmL,GACAT,EAAAhO,KAAAsO,MAAAG,IACAzO,KAAAsO,MAAAG,EACAzO,KAAA+M,OAAAa,KAAAa,KAEAzO,KAAAqO,SAAA,EACArO,KAAA+M,OAAAa,KAAAa,KAaAjN,EAAAG,UAAAkE,QAAA,WAKA,MAJA7F,MAAAqO,UACArO,KAAA+M,OAAA2B,KAAA1N,EAAAgF,qCACAhG,KAAAqO,SAAA,GAEArO,KAAA+M,QAGAnN,EAAA4B,eRk0CM,SAAU3B,EAAQD,EAASM,GSn4CjC,QAAAU,GAAA+N,EAAAC,GACA,GAAAC,GAAAF,CAKA,OAJA,gBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,IAGA,MAAAE,EAAAC,SACA,GAAAC,GAAAF,EAAAD,GACA,GAAAI,GAAAH,EAAAD,GA0QA,QAAAI,GAAAL,EAAAC,GACA,GAAAC,GAAAF,CACA,iBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,GAGA,IAAAjI,GAAA1F,EAAAC,OAAA4N,EAAA,WACA5L,EAAAjC,EAAAC,OAAA4N,EAAA,WAGAlI,EAAA3F,EAAAC,OAAA4N,EAAA,YACA9M,EAAAf,EAAAC,OAAA4N,EAAA,mBACAjI,EAAA5F,EAAAC,OAAA4N,EAAA,uBACAjJ,EAAA5E,EAAAC,OAAA4N,EAAA,YACA5M,EAAAjB,EAAAC,OAAA4N,EAAA,YAIA,IAAAnI,GAAA1G,KAAA4B,SACA,SAAAyC,OAAA,wBAAAqC,EAGA3E,KACAA,EAAAf,EAAAmJ,UAAApI,IAGAkB,IACAqD,IAAA3C,QAIA2C,IAAAtF,EAAAmJ,WAKA7D,IAAA,SAAA5D,GACA,MAAAX,IAAAf,EAAAsJ,WAAAvI,IAAAf,EAAAsJ,WAAA5H,GACA1B,EAAA2B,SAAAZ,EAAAW,GACAA,IAOA1C,KAAAsB,OAAAD,EAAA8L,UAAAxG,EAAAL,IAAA3C,SAAA,GACA3D,KAAAoB,SAAAC,EAAA8L,UAAAlK,GAAA,GAEAjD,KAAAiP,iBAAAjP,KAAAoB,SAAAyE,UAAAS,IAAA,SAAAiF,GACA,MAAAvK,GAAAuL,iBAAAxK,EAAAwJ,EAAAqD,KAGA5O,KAAA+B,aACA/B,KAAA4G,iBACA5G,KAAAuB,UAAAqE,EACA5F,KAAAkP,cAAAN,EACA5O,KAAAiC,OA4GA,QAAAkN,KACAnP,KAAAuC,cAAA,EACAvC,KAAAyC,gBAAA,EACAzC,KAAA0C,OAAA,KACA1C,KAAA6C,aAAA,KACA7C,KAAA8C,eAAA,KACA9C,KAAA+C,KAAA,KAkaA,QAAAgM,GAAAJ,EAAAC,GACA,GAAAC,GAAAF,CACA,iBAAAA,KACAE,EAAA7N,EAAAoL,oBAAAuC,GAGA,IAAAjI,GAAA1F,EAAAC,OAAA4N,EAAA,WACAC,EAAA9N,EAAAC,OAAA4N,EAAA,WAEA,IAAAnI,GAAA1G,KAAA4B,SACA,SAAAyC,OAAA,wBAAAqC,EAGA1G,MAAAoB,SAAA,GAAAC,GACArB,KAAAsB,OAAA,GAAAD,EAEA,IAAA+N,IACA9M,MAAA,EACAE,OAAA,EAEAxC,MAAAqP,UAAAP,EAAAxI,IAAA,SAAAiF,GACA,GAAAA,EAAArB,IAGA,SAAA7F,OAAA,qDAEA,IAAAiL,GAAAtO,EAAAC,OAAAsK,EAAA,UACAgE,EAAAvO,EAAAC,OAAAqO,EAAA,QACAE,EAAAxO,EAAAC,OAAAqO,EAAA,SAEA,IAAAC,EAAAH,EAAA9M,MACAiN,IAAAH,EAAA9M,MAAAkN,EAAAJ,EAAA5M,OACA,SAAA6B,OAAA,uDAIA,OAFA+K,GAAAE,GAGAG,iBAGAlN,cAAAgN,EAAA,EACA9M,gBAAA+M,EAAA,GAEAE,SAAA,GAAA9O,GAAAI,EAAAC,OAAAsK,EAAA,OAAAqD,MAh5BA,GAAA5N,GAAAd,EAAA,GACAyP,EAAAzP,EAAA,GACAmB,EAAAnB,EAAA,GAAAmB,SACAK,EAAAxB,EAAA,GACA0P,EAAA1P,EAAA,GAAA0P,SAaAhP,GAAAiB,cAAA,SAAA8M,EAAAC,GACA,MAAAI,GAAAnN,cAAA8M,EAAAC,IAMAhO,EAAAe,UAAAC,SAAA,EAgCAhB,EAAAe,UAAAkO,oBAAA,KACA/L,OAAAgM,eAAAlP,EAAAe,UAAA,sBACAoO,cAAA,EACAC,YAAA,EACAnC,IAAA,WAKA,MAJA7N,MAAA6P,qBACA7P,KAAAiQ,eAAAjQ,KAAAuB,UAAAvB,KAAA+B,YAGA/B,KAAA6P,uBAIAjP,EAAAe,UAAAuO,mBAAA,KACApM,OAAAgM,eAAAlP,EAAAe,UAAA,qBACAoO,cAAA,EACAC,YAAA,EACAnC,IAAA,WAKA,MAJA7N,MAAAkQ,oBACAlQ,KAAAiQ,eAAAjQ,KAAAuB,UAAAvB,KAAA+B,YAGA/B,KAAAkQ,sBAIAtP,EAAAe,UAAAwO,wBACA,SAAAvI,EAAAqD,GACA,GAAAxK,GAAAmH,EAAAO,OAAA8C,EACA,aAAAxK,GAAmB,MAAAA,GAQnBG,EAAAe,UAAAsO,eACA,SAAArI,EAAAvB,GACA,SAAAhC,OAAA,6CAGAzD,EAAAwP,gBAAA,EACAxP,EAAAyP,eAAA,EAEAzP,EAAA0P,qBAAA,EACA1P,EAAA2P,kBAAA,EAkBA3P,EAAAe,UAAAO,YACA,SAAAqM,EAAAiC,EAAAC,GACA,GAGA7K,GAHA8K,EAAAF,GAAA,KACAG,EAAAF,GAAA7P,EAAAwP,eAGA,QAAAO,GACA,IAAA/P,GAAAwP,gBACAxK,EAAA5F,KAAA4Q,kBACA,MACA,KAAAhQ,GAAAyP,eACAzK,EAAA5F,KAAA6Q,iBACA,MACA,SACA,SAAAxM,OAAA,+BAGA,GAAAtC,GAAA/B,KAAA+B,UACA6D,GAAAU,IAAA,SAAAnE,GACA,GAAAO,GAAA,OAAAP,EAAAO,OAAA,KAAA1C,KAAAoB,SAAA0M,GAAA3L,EAAAO,OAEA,OADAA,GAAA1B,EAAAuL,iBAAAxK,EAAAW,EAAA1C,KAAAkP,gBAEAxM,SACAH,cAAAJ,EAAAI,cACAE,gBAAAN,EAAAM,gBACAI,aAAAV,EAAAU,aACAC,eAAAX,EAAAW,eACAC,KAAA,OAAAZ,EAAAY,KAAA,KAAA/C,KAAAsB,OAAAwM,GAAA3L,EAAAY,QAEK/C,MAAAkD,QAAAqL,EAAAmC,IAyBL9P,EAAAe,UAAAmP,yBACA,SAAAhQ,GACA,GAAAwB,GAAAtB,EAAAC,OAAAH,EAAA,QAMAiQ,GACArO,OAAA1B,EAAAC,OAAAH,EAAA,UACA+B,aAAAP,EACAQ,eAAA9B,EAAAC,OAAAH,EAAA,YAIA,IADAiQ,EAAArO,OAAA1C,KAAAgR,iBAAAD,EAAArO,QACAqO,EAAArO,OAAA,EACA,QAGA,IAAAkD,MAEAqF,EAAAjL,KAAAiR,aAAAF,EACA/Q,KAAA6Q,kBACA,eACA,iBACA7P,EAAA0K,2BACAiE,EAAAY,kBACA,IAAAtF,GAAA,GACA,GAAA9I,GAAAnC,KAAA6Q,kBAAA5F,EAEA,IAAAiG,SAAApQ,EAAA0B,OAOA,IANA,GAAAK,GAAAV,EAAAU,aAMAV,KAAAU,kBACA+C,EAAAgI,MACAtL,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,8BAGAA,EAAAnC,KAAA6Q,oBAAA5F,OASA,KANA,GAAAnI,GAAAX,EAAAW,eAMAX,GACAA,EAAAU,eAAAP,GACAH,EAAAW,mBACA8C,EAAAgI,MACAtL,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,8BAGAA,EAAAnC,KAAA6Q,oBAAA5F,GAKA,MAAArF,IAGAhG,EAAAgB,oBAgGAoO,EAAArN,UAAAmC,OAAAC,OAAAnD,EAAAe,WACAqN,EAAArN,UAAA+N,SAAA9O,EAMAoO,EAAArN,UAAAqP,iBAAA,SAAAnM,GACA,GAAAuM,GAAAvM,CAKA,IAJA,MAAA7E,KAAA+B,aACAqP,EAAApQ,EAAA2B,SAAA3C,KAAA+B,WAAAqP,IAGApR,KAAAoB,SAAAiC,IAAA+N,GACA,MAAApR,MAAAoB,SAAA8E,QAAAkL,EAKA,IAAAtL,EACA,KAAAA,EAAA,EAAaA,EAAA9F,KAAAiP,iBAAA/K,SAAkC4B,EAC/C,GAAA9F,KAAAiP,iBAAAnJ,IAAAjB,EACA,MAAAiB,EAIA,WAYAkJ,EAAAnN,cACA,SAAA8M,EAAAC,GACA,GAAAyC,GAAAvN,OAAAC,OAAAiL,EAAArN,WAEAgF,EAAA0K,EAAA/P,OAAAD,EAAA8L,UAAAwB,EAAArN,OAAAuE,WAAA,GACA5C,EAAAoO,EAAAjQ,SAAAC,EAAA8L,UAAAwB,EAAAvN,SAAAyE,WAAA,EACAwL,GAAAtP,WAAA4M,EAAAzN,YACAmQ,EAAAzK,eAAA+H,EAAAxI,wBAAAkL,EAAAjQ,SAAAyE,UACAwL,EAAAtP,YACAsP,EAAApP,KAAA0M,EAAA5N,MACAsQ,EAAAnC,cAAAN,EACAyC,EAAApC,iBAAAoC,EAAAjQ,SAAAyE,UAAAS,IAAA,SAAAiF,GACA,MAAAvK,GAAAuL,iBAAA8E,EAAAtP,WAAAwJ,EAAAqD,IAYA,QAJA0C,GAAA3C,EAAApN,UAAAsE,UAAAsF,QACAoG,EAAAF,EAAAxB,uBACA2B,EAAAH,EAAAnB,sBAEApK,EAAA,EAAA5B,EAAAoN,EAAApN,OAAsD4B,EAAA5B,EAAY4B,IAAA,CAClE,GAAA2L,GAAAH,EAAAxL,GACA4L,EAAA,GAAAvC,EACAuC,GAAAnP,cAAAkP,EAAAlP,cACAmP,EAAAjP,gBAAAgP,EAAAhP,gBAEAgP,EAAA/O,SACAgP,EAAAhP,OAAAO,EAAAiD,QAAAuL,EAAA/O,QACAgP,EAAA7O,aAAA4O,EAAA5O,aACA6O,EAAA5O,eAAA2O,EAAA3O,eAEA2O,EAAA1O,OACA2O,EAAA3O,KAAA4D,EAAAT,QAAAuL,EAAA1O,OAGAyO,EAAA5D,KAAA8D,IAGAH,EAAA3D,KAAA8D,GAKA,MAFA9B,GAAAyB,EAAAnB,mBAAAlP,EAAA0K,4BAEA2F,GAMArC,EAAArN,UAAAC,SAAA,EAKAkC,OAAAgM,eAAAd,EAAArN,UAAA,WACAkM,IAAA,WACA,MAAA7N,MAAAiP,iBAAA9D,WAqBA6D,EAAArN,UAAAsO,eACA,SAAArI,EAAAvB,GAeA,IAdA,GAYAlE,GAAAkK,EAAAsF,EAAAC,EAAAxJ,EAZA7F,EAAA,EACA8C,EAAA,EACAG,EAAA,EACAD,EAAA,EACAG,EAAA,EACAD,EAAA,EACAvB,EAAA0D,EAAA1D,OACA+G,EAAA,EACA4G,KACAC,KACAC,KACAT,KAGArG,EAAA/G,GACA,SAAA0D,EAAAO,OAAA8C,GACA1I,IACA0I,IACA5F,EAAA,MAEA,UAAAuC,EAAAO,OAAA8C,GACAA,QAEA,CASA,IARA9I,EAAA,GAAAgN,GACAhN,EAAAI,gBAOAqP,EAAA3G,EAAyB2G,EAAA1N,IACzBlE,KAAAmQ,wBAAAvI,EAAAgK,GADuCA,KAQvC,GAHAvF,EAAAzE,EAAAuD,MAAAF,EAAA2G,GAEAD,EAAAE,EAAAxF,GAEApB,GAAAoB,EAAAnI,WACS,CAET,IADAyN,KACA1G,EAAA2G,GACAlQ,EAAAiG,OAAAC,EAAAqD,EAAA6G,GACA1J,EAAA0J,EAAA1J,MACA6C,EAAA6G,EAAAzJ,KACAsJ,EAAA/D,KAAAxF,EAGA,QAAAuJ,EAAAzN,OACA,SAAAG,OAAA,yCAGA,QAAAsN,EAAAzN,OACA,SAAAG,OAAA,yCAGAwN,GAAAxF,GAAAsF,EAIAxP,EAAAM,gBAAA4C,EAAAsM,EAAA,GACAtM,EAAAlD,EAAAM,gBAEAkP,EAAAzN,OAAA,IAEA/B,EAAAO,OAAAgD,EAAAiM,EAAA,GACAjM,GAAAiM,EAAA,GAGAxP,EAAAU,aAAA2C,EAAAmM,EAAA,GACAnM,EAAArD,EAAAU,aAEAV,EAAAU,cAAA,EAGAV,EAAAW,eAAAyC,EAAAoM,EAAA,GACApM,EAAApD,EAAAW,eAEA6O,EAAAzN,OAAA,IAEA/B,EAAAY,KAAA0C,EAAAkM,EAAA,GACAlM,GAAAkM,EAAA,KAIAL,EAAA1D,KAAAzL,GACA,gBAAAA,GAAAU,cACAkP,EAAAnE,KAAAzL,GAKAyN,EAAA0B,EAAAtQ,EAAAgL,qCACAhM,KAAA6P,oBAAAyB,EAEA1B,EAAAmC,EAAA/Q,EAAA0K,4BACA1L,KAAAkQ,mBAAA6B,GAOA/C,EAAArN,UAAAsP,aACA,SAAAe,EAAAC,EAAAC,EACAC,EAAAC,EAAAC,GAMA,GAAAL,EAAAE,IAAA,EACA,SAAAzJ,WAAA,gDACAuJ,EAAAE,GAEA,IAAAF,EAAAG,GAAA,EACA,SAAA1J,WAAA,kDACAuJ,EAAAG,GAGA,OAAAxC,GAAA2C,OAAAN,EAAAC,EAAAG,EAAAC,IAOArD,EAAArN,UAAA4Q,mBACA,WACA,OAAAtH,GAAA,EAAuBA,EAAAjL,KAAA4Q,mBAAA1M,SAAwC+G,EAAA,CAC/D,GAAA9I,GAAAnC,KAAA4Q,mBAAA3F,EAMA,IAAAA,EAAA,EAAAjL,KAAA4Q,mBAAA1M,OAAA,CACA,GAAAsO,GAAAxS,KAAA4Q,mBAAA3F,EAAA,EAEA,IAAA9I,EAAAI,gBAAAiQ,EAAAjQ,cAAA,CACAJ,EAAAsQ,oBAAAD,EAAA/P,gBAAA,CACA,WAKAN,EAAAsQ,oBAAAC,MA4BA1D,EAAArN,UAAA8C,oBACA,SAAA3D,GACA,GAAAiQ,IACAxO,cAAAvB,EAAAC,OAAAH,EAAA,QACA2B,gBAAAzB,EAAAC,OAAAH,EAAA,WAGAmK,EAAAjL,KAAAiR,aACAF,EACA/Q,KAAA4Q,mBACA,gBACA,kBACA5P,EAAAgL,oCACAhL,EAAAC,OAAAH,EAAA,OAAAF,EAAA0P,sBAGA,IAAArF,GAAA,GACA,GAAA9I,GAAAnC,KAAA4Q,mBAAA3F,EAEA,IAAA9I,EAAAI,gBAAAwO,EAAAxO,cAAA,CACA,GAAAG,GAAA1B,EAAAC,OAAAkB,EAAA,cACA,QAAAO,IACAA,EAAA1C,KAAAoB,SAAA0M,GAAApL,GACAA,EAAA1B,EAAAuL,iBAAAvM,KAAA+B,WAAAW,EAAA1C,KAAAkP,eAEA,IAAAnM,GAAA/B,EAAAC,OAAAkB,EAAA,YAIA,OAHA,QAAAY,IACAA,EAAA/C,KAAAsB,OAAAwM,GAAA/K,KAGAL,SACAJ,KAAAtB,EAAAC,OAAAkB,EAAA,qBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,uBACAY,SAKA,OACAL,OAAA,KACAJ,KAAA,KACAE,OAAA,KACAO,KAAA,OAQAiM,EAAArN,UAAAgR,wBACA,WACA,QAAA3S,KAAA4G,iBAGA5G,KAAA4G,eAAA1C,QAAAlE,KAAAoB,SAAAmM,SACAvN,KAAA4G,eAAAgM,KAAA,SAAAC,GAA+C,aAAAA,MAQ/C7D,EAAArN,UAAA6B,iBACA,SAAAqB,EAAAiO,GACA,IAAA9S,KAAA4G,eACA,WAGA,IAAAqE,GAAAjL,KAAAgR,iBAAAnM,EACA,IAAAoG,GAAA,EACA,MAAAjL,MAAA4G,eAAAqE,EAGA,IAAAmG,GAAAvM,CACA,OAAA7E,KAAA+B,aACAqP,EAAApQ,EAAA2B,SAAA3C,KAAA+B,WAAAqP,GAGA,IAAAlH,EACA,UAAAlK,KAAA+B,aACAmI,EAAAlJ,EAAAuI,SAAAvJ,KAAA+B,aAAA,CAKA,GAAAgR,GAAA3B,EAAArG,QAAA,gBACA,YAAAb,EAAAP,QACA3J,KAAAoB,SAAAiC,IAAA0P,GACA,MAAA/S,MAAA4G,eAAA5G,KAAAoB,SAAA8E,QAAA6M,GAGA,MAAA7I,EAAAH,MAAA,KAAAG,EAAAH,OACA/J,KAAAoB,SAAAiC,IAAA,IAAA+N,GACA,MAAApR,MAAA4G,eAAA5G,KAAAoB,SAAA8E,QAAA,IAAAkL,IAQA,GAAA0B,EACA,WAGA,UAAAzO,OAAA,IAAA+M,EAAA,+BA2BApC,EAAArN,UAAAqR,qBACA,SAAAlS,GACA,GAAA4B,GAAA1B,EAAAC,OAAAH,EAAA,SAEA,IADA4B,EAAA1C,KAAAgR,iBAAAtO,GACAA,EAAA,EACA,OACAJ,KAAA,KACAE,OAAA,KACA2O,WAAA,KAIA,IAAAJ,IACArO,SACAG,aAAA7B,EAAAC,OAAAH,EAAA,QACAgC,eAAA9B,EAAAC,OAAAH,EAAA,WAGAmK,EAAAjL,KAAAiR,aACAF,EACA/Q,KAAA6Q,kBACA,eACA,iBACA7P,EAAA0K,2BACA1K,EAAAC,OAAAH,EAAA,OAAAF,EAAA0P,sBAGA,IAAArF,GAAA,GACA,GAAA9I,GAAAnC,KAAA6Q,kBAAA5F,EAEA,IAAA9I,EAAAO,SAAAqO,EAAArO,OACA,OACAJ,KAAAtB,EAAAC,OAAAkB,EAAA,sBACAK,OAAAxB,EAAAC,OAAAkB,EAAA,wBACAgP,WAAAnQ,EAAAC,OAAAkB,EAAA,6BAKA,OACAG,KAAA,KACAE,OAAA,KACA2O,WAAA,OAIAvR,EAAAoP,yBAmGAD,EAAApN,UAAAmC,OAAAC,OAAAnD,EAAAe,WACAoN,EAAApN,UAAAsR,YAAArS,EAKAmO,EAAApN,UAAAC,SAAA,EAKAkC,OAAAgM,eAAAf,EAAApN,UAAA,WACAkM,IAAA,WAEA,OADA5K,MACA6C,EAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAC9C,OAAAoN,GAAA,EAAqBA,EAAAlT,KAAAqP,UAAAvJ,GAAA4J,SAAAzM,QAAAiB,OAA+CgP,IACpEjQ,EAAA2K,KAAA5N,KAAAqP,UAAAvJ,GAAA4J,SAAAzM,QAAAiQ,GAGA,OAAAjQ,MAuBA8L,EAAApN,UAAA8C,oBACA,SAAA3D,GACA,GAAAiQ,IACAxO,cAAAvB,EAAAC,OAAAH,EAAA,QACA2B,gBAAAzB,EAAAC,OAAAH,EAAA,WAKAqS,EAAAxD,EAAA2C,OAAAvB,EAAA/Q,KAAAqP,UACA,SAAA0B,EAAAqC,GACA,GAAAtH,GAAAiF,EAAAxO,cAAA6Q,EAAA3D,gBAAAlN,aACA,OAAAuJ,GACAA,EAGAiF,EAAAtO,gBACA2Q,EAAA3D,gBAAAhN,kBAEA2Q,EAAApT,KAAAqP,UAAA8D,EAEA,OAAAC,GASAA,EAAA1D,SAAAjL,qBACAnC,KAAAyO,EAAAxO,eACA6Q,EAAA3D,gBAAAlN,cAAA,GACAC,OAAAuO,EAAAtO,iBACA2Q,EAAA3D,gBAAAlN,gBAAAwO,EAAAxO,cACA6Q,EAAA3D,gBAAAhN,gBAAA,EACA,GACA4Q,KAAAvS,EAAAuS,QAdA3Q,OAAA,KACAJ,KAAA,KACAE,OAAA,KACAO,KAAA,OAmBAgM,EAAApN,UAAAgR,wBACA,WACA,MAAA3S,MAAAqP,UAAAiE,MAAA,SAAA/H,GACA,MAAAA,GAAAmE,SAAAiD,6BASA5D,EAAApN,UAAA6B,iBACA,SAAAqB,EAAAiO,GACA,OAAAhN,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAAA,CAC9C,GAAAsN,GAAApT,KAAAqP,UAAAvJ,GAEAvC,EAAA6P,EAAA1D,SAAAlM,iBAAAqB,GAAA,EACA,IAAAtB,EACA,MAAAA,GAGA,GAAAuP,EACA,WAGA,UAAAzO,OAAA,IAAAQ,EAAA,+BAsBAkK,EAAApN,UAAAqR,qBACA,SAAAlS,GACA,OAAAgF,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAAA,CAC9C,GAAAsN,GAAApT,KAAAqP,UAAAvJ,EAIA,IAAAsN,EAAA1D,SAAAsB,iBAAAhQ,EAAAC,OAAAH,EAAA,iBAGA,GAAAyS,GAAAH,EAAA1D,SAAAsD,qBAAAlS,EACA,IAAAyS,EAAA,CACA,GAAAC,IACAlR,KAAAiR,EAAAjR,MACA8Q,EAAA3D,gBAAAlN,cAAA,GACAC,OAAA+Q,EAAA/Q,QACA4Q,EAAA3D,gBAAAlN,gBAAAgR,EAAAjR,KACA8Q,EAAA3D,gBAAAhN,gBAAA,EACA,GAEA,OAAA+Q,KAIA,OACAlR,KAAA,KACAE,OAAA,OASAuM,EAAApN,UAAAsO,eACA,SAAArI,EAAAvB,GACArG,KAAA6P,uBACA7P,KAAAkQ,qBACA,QAAApK,GAAA,EAAmBA,EAAA9F,KAAAqP,UAAAnL,OAA2B4B,IAG9C,OAFAsN,GAAApT,KAAAqP,UAAAvJ,GACA2N,EAAAL,EAAA1D,SAAAkB,mBACAsC,EAAA,EAAqBA,EAAAO,EAAAvP,OAA4BgP,IAAA,CACjD,GAAA/Q,GAAAsR,EAAAP,GAEAxQ,EAAA0Q,EAAA1D,SAAAtO,SAAA0M,GAAA3L,EAAAO,OACAA,GAAA1B,EAAAuL,iBAAA6G,EAAA1D,SAAA3N,WAAAW,EAAA1C,KAAAkP,eACAlP,KAAAoB,SAAAkC,IAAAZ,GACAA,EAAA1C,KAAAoB,SAAA8E,QAAAxD,EAEA,IAAAK,GAAA,IACAZ,GAAAY,OACAA,EAAAqQ,EAAA1D,SAAApO,OAAAwM,GAAA3L,EAAAY,MACA/C,KAAAsB,OAAAgC,IAAAP,GACAA,EAAA/C,KAAAsB,OAAA4E,QAAAnD,GAOA,IAAA2Q,IACAhR,SACAH,cAAAJ,EAAAI,eACA6Q,EAAA3D,gBAAAlN,cAAA,GACAE,gBAAAN,EAAAM,iBACA2Q,EAAA3D,gBAAAlN,gBAAAJ,EAAAI,cACA6Q,EAAA3D,gBAAAhN,gBAAA,EACA,GACAI,aAAAV,EAAAU,aACAC,eAAAX,EAAAW,eACAC,OAGA/C,MAAA6P,oBAAAjC,KAAA8F,GACA,gBAAAA,GAAA7Q,cACA7C,KAAAkQ,mBAAAtC,KAAA8F,GAKA9D,EAAA5P,KAAA6P,oBAAA7O,EAAAgL,qCACA4D,EAAA5P,KAAAkQ,mBAAAlP,EAAA0K,6BAGA9L,EAAAmP,4BTu5CM,SAAUlP,EAAQD,GUx/ExB,QAAA+T,GAAAC,EAAAC,EAAA7B,EAAA8B,EAAAC,EAAA1B,GAUA,GAAA2B,GAAAC,KAAAC,OAAAL,EAAAD,GAAA,GAAAA,EACA9H,EAAAiI,EAAA/B,EAAA8B,EAAAE,IAAA,EACA,YAAAlI,EAEAkI,EAEAlI,EAAA,EAEA+H,EAAAG,EAAA,EAEAL,EAAAK,EAAAH,EAAA7B,EAAA8B,EAAAC,EAAA1B,GAKAA,GAAAzS,EAAA2Q,kBACAsD,EAAAC,EAAA5P,OAAA2P,GAAA,EAEAG,EAKAA,EAAAJ,EAAA,EAEAD,EAAAC,EAAAI,EAAAhC,EAAA8B,EAAAC,EAAA1B,GAIAA,GAAAzS,EAAA2Q,kBACAyD,EAEAJ,EAAA,KAAAA,EA1DAhU,EAAA0Q,qBAAA,EACA1Q,EAAA2Q,kBAAA,EAgFA3Q,EAAA0S,OAAA,SAAAN,EAAA8B,EAAAC,EAAA1B,GACA,OAAAyB,EAAA5P,OACA,QAGA,IAAA+G,GAAA0I,GAAA,EAAAG,EAAA5P,OAAA8N,EAAA8B,EACAC,EAAA1B,GAAAzS,EAAA0Q,qBACA,IAAArF,EAAA,EACA,QAMA,MAAAA,EAAA,MACA,IAAA8I,EAAAD,EAAA7I,GAAA6I,EAAA7I,EAAA,UAGAA,CAGA,OAAAA,KVuhFM,SAAUpL,EAAQD,GWzmFxB,QAAAuU,GAAAC,EAAAC,EAAAC,GACA,GAAAxC,GAAAsC,EAAAC,EACAD,GAAAC,GAAAD,EAAAE,GACAF,EAAAE,GAAAxC,EAWA,QAAAyC,GAAAC,EAAAC,GACA,MAAAR,MAAAS,MAAAF,EAAAP,KAAAU,UAAAF,EAAAD,IAeA,QAAAI,GAAAR,EAAAS,EAAAnU,EAAAoU,GAKA,GAAApU,EAAAoU,EAAA,CAYA,GAAAC,GAAAR,EAAA7T,EAAAoU,GACAhP,EAAApF,EAAA,CAEAyT,GAAAC,EAAAW,EAAAD,EASA,QARAE,GAAAZ,EAAAU,GAQA5B,EAAAxS,EAAmBwS,EAAA4B,EAAO5B,IAC1B2B,EAAAT,EAAAlB,GAAA8B,IAAA,IACAlP,GAAA,EACAqO,EAAAC,EAAAtO,EAAAoN,GAIAiB,GAAAC,EAAAtO,EAAA,EAAAoN,EACA,IAAA+B,GAAAnP,EAAA,CAIA8O,GAAAR,EAAAS,EAAAnU,EAAAuU,EAAA,GACAL,EAAAR,EAAAS,EAAAI,EAAA,EAAAH,IAYAlV,EAAAgQ,UAAA,SAAAwE,EAAAS,GACAD,EAAAR,EAAAS,EAAA,EAAAT,EAAAlQ,OAAA,KX4oFM,SAAUrE,EAAQD,EAASM,GY1tFjC,QAAAW,GAAAqU,EAAAC,EAAAtQ,EAAAuQ,EAAAtQ,GACA9E,KAAAqV,YACArV,KAAAsV,kBACAtV,KAAAsC,KAAA,MAAA4S,EAAA,KAAAA,EACAlV,KAAAwC,OAAA,MAAA2S,EAAA,KAAAA,EACAnV,KAAA0C,OAAA,MAAAmC,EAAA,KAAAA,EACA7E,KAAA+C,KAAA,MAAA+B,EAAA,KAAAA,EACA9E,KAAAuV,IAAA,EACA,MAAAH,GAAApV,KAAAsD,IAAA8R,GAnCA,GAAAzU,GAAAT,EAAA,GAAAS,mBACAK,EAAAd,EAAA,GAIAsV,EAAA,UAGAC,EAAA,GAKAF,EAAA,oBAiCA1U,GAAA6U,wBACA,SAAAC,EAAA7T,EAAA8T,GA+FA,QAAAC,GAAA1T,EAAA2T,GACA,UAAA3T,GAAA+O,SAAA/O,EAAAO,OACAqT,EAAAzS,IAAAwS,OACO,CACP,GAAApT,GAAAkT,EACA5U,EAAA0D,KAAAkR,EAAAzT,EAAAO,QACAP,EAAAO,MACAqT,GAAAzS,IAAA,GAAAzC,GAAAsB,EAAAU,aACAV,EAAAW,eACAJ,EACAoT,EACA3T,EAAAY,QAvGA,GAAAgT,GAAA,GAAAlV,GAMAmV,EAAAL,EAAApN,MAAAiN,GACAS,EAAA,EACAC,EAAA,WAMA,QAAAC,KACA,MAAAF,GAAAD,EAAA9R,OACA8R,EAAAC,KAAA/E,OAPA,GAAAkF,GAAAD,IAEAE,EAAAF,KAAA,EACA,OAAAC,GAAAC,GASAC,EAAA,EAAA7D,EAAA,EAKA8D,EAAA,IAgEA,OA9DAzU,GAAAI,YAAA,SAAAC,GACA,UAAAoU,EAAA,CAGA,KAAAD,EAAAnU,EAAAI,eAMS,CAIT,GAAAiU,GAAAR,EAAAC,IAAA,GACAH,EAAAU,EAAAnL,OAAA,EAAAlJ,EAAAM,gBACAgQ,EAOA,OANAuD,GAAAC,GAAAO,EAAAnL,OAAAlJ,EAAAM,gBACAgQ,GACAA,EAAAtQ,EAAAM,gBACAoT,EAAAU,EAAAT,QAEAS,EAAApU,GAhBA0T,EAAAU,EAAAL,KACAI,IACA7D,EAAA,EAqBA,KAAA6D,EAAAnU,EAAAI,eACAwT,EAAAzS,IAAA4S,KACAI,GAEA,IAAA7D,EAAAtQ,EAAAM,gBAAA,CACA,GAAA+T,GAAAR,EAAAC,IAAA,EACAF,GAAAzS,IAAAkT,EAAAnL,OAAA,EAAAlJ,EAAAM,kBACAuT,EAAAC,GAAAO,EAAAnL,OAAAlJ,EAAAM,iBACAgQ,EAAAtQ,EAAAM,gBAEA8T,EAAApU,GACKnC,MAELiW,EAAAD,EAAA9R,SACAqS,GAEAV,EAAAU,EAAAL,KAGAH,EAAAzS,IAAA0S,EAAAvL,OAAAwL,GAAAvR,KAAA,MAIA5C,EAAAmB,QAAAC,QAAA,SAAAC,GACA,GAAAI,GAAAzB,EAAA0B,iBAAAL,EACA,OAAAI,IACA,MAAAqS,IACAzS,EAAAnC,EAAA0D,KAAAkR,EAAAzS,IAEA4S,EAAAtS,iBAAAN,EAAAI,MAIAwS,GAwBAlV,EAAAc,UAAA2B,IAAA,SAAAmT,GACA,GAAArL,MAAAsL,QAAAD,GACAA,EAAAvT,QAAA,SAAAyT,GACA3W,KAAAsD,IAAAqT,IACK3W,UAEL,KAAAyW,EAAAlB,IAAA,gBAAAkB,GAMA,SAAAhO,WACA,8EAAAgO,EANAA,IACAzW,KAAAqV,SAAAzH,KAAA6I,GAQA,MAAAzW,OASAa,EAAAc,UAAAiV,QAAA,SAAAH,GACA,GAAArL,MAAAsL,QAAAD,GACA,OAAA3Q,GAAA2Q,EAAAvS,OAAA,EAAiC4B,GAAA,EAAQA,IACzC9F,KAAA4W,QAAAH,EAAA3Q,QAGA,KAAA2Q,EAAAlB,IAAA,gBAAAkB,GAIA,SAAAhO,WACA,8EAAAgO,EAJAzW,MAAAqV,SAAAwB,QAAAJ,GAOA,MAAAzW,OAUAa,EAAAc,UAAAmV,KAAA,SAAAC,GAEA,OADAJ,GACA7Q,EAAA,EAAAC,EAAA/F,KAAAqV,SAAAnR,OAA6C4B,EAAAC,EAASD,IACtD6Q,EAAA3W,KAAAqV,SAAAvP,GACA6Q,EAAApB,GACAoB,EAAAG,KAAAC,GAGA,KAAAJ,GACAI,EAAAJ,GAAoBjU,OAAA1C,KAAA0C,OACpBJ,KAAAtC,KAAAsC,KACAE,OAAAxC,KAAAwC,OACAO,KAAA/C,KAAA+C,QAYAlC,EAAAc,UAAA+C,KAAA,SAAAsS,GACA,GAAAC,GACAnR,EACAC,EAAA/F,KAAAqV,SAAAnR,MACA,IAAA6B,EAAA,GAEA,IADAkR,KACAnR,EAAA,EAAeA,EAAAC,EAAA,EAAWD,IAC1BmR,EAAArJ,KAAA5N,KAAAqV,SAAAvP,IACAmR,EAAArJ,KAAAoJ,EAEAC,GAAArJ,KAAA5N,KAAAqV,SAAAvP,IACA9F,KAAAqV,SAAA4B,EAEA,MAAAjX,OAUAa,EAAAc,UAAAuV,aAAA,SAAAC,EAAAC,GACA,GAAAC,GAAArX,KAAAqV,SAAArV,KAAAqV,SAAAnR,OAAA,EAUA,OATAmT,GAAA9B,GACA8B,EAAAH,aAAAC,EAAAC,GAEA,gBAAAC,GACArX,KAAAqV,SAAArV,KAAAqV,SAAAnR,OAAA,GAAAmT,EAAAtM,QAAAoM,EAAAC,GAGApX,KAAAqV,SAAAzH,KAAA,GAAA7C,QAAAoM,EAAAC,IAEApX,MAUAa,EAAAc,UAAA8B,iBACA,SAAAG,EAAAC,GACA7D,KAAAsV,eAAAtU,EAAAgD,YAAAJ,IAAAC,GASAhD,EAAAc,UAAA2V,mBACA,SAAAP,GACA,OAAAjR,GAAA,EAAAC,EAAA/F,KAAAqV,SAAAnR,OAA+C4B,EAAAC,EAASD,IACxD9F,KAAAqV,SAAAvP,GAAAyP,IACAvV,KAAAqV,SAAAvP,GAAAwR,mBAAAP,EAKA,QADA9T,GAAAa,OAAAG,KAAAjE,KAAAsV,gBACAxP,EAAA,EAAAC,EAAA9C,EAAAiB,OAAyC4B,EAAAC,EAASD,IAClDiR,EAAA/V,EAAAyK,cAAAxI,EAAA6C,IAAA9F,KAAAsV,eAAArS,EAAA6C,MAQAjF,EAAAc,UAAAkF,SAAA,WACA,GAAAwF,GAAA,EAIA,OAHArM,MAAA8W,KAAA,SAAAH,GACAtK,GAAAsK,IAEAtK,GAOAxL,EAAAc,UAAA4V,sBAAA,SAAAzW,GACA,GAAAuB,IACAyT,KAAA,GACAxT,KAAA,EACAE,OAAA,GAEA8D,EAAA,GAAA3F,GAAAG,GACA0W,GAAA,EACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KACAC,EAAA,IAqEA,OApEA5X,MAAA8W,KAAA,SAAAH,EAAA/T,GACAP,EAAAyT,MAAAa,EACA,OAAA/T,EAAAF,QACA,OAAAE,EAAAN,MACA,OAAAM,EAAAJ,QACAiV,IAAA7U,EAAAF,QACAgV,IAAA9U,EAAAN,MACAqV,IAAA/U,EAAAJ,QACAoV,IAAAhV,EAAAG,MACAuD,EAAAtD,YACAN,OAAAE,EAAAF,OACAE,UACAN,KAAAM,EAAAN,KACAE,OAAAI,EAAAJ,QAEAH,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,QAEAO,KAAAH,EAAAG,OAGA0U,EAAA7U,EAAAF,OACAgV,EAAA9U,EAAAN,KACAqV,EAAA/U,EAAAJ,OACAoV,EAAAhV,EAAAG,KACAyU,GAAA,GACKA,IACLlR,EAAAtD,YACAX,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,UAGAiV,EAAA,KACAD,GAAA,EAEA,QAAA7J,GAAA,EAAAzJ,EAAAyS,EAAAzS,OAA4CyJ,EAAAzJ,EAAcyJ,IAC1DgJ,EAAAzO,WAAAyF,KAAA8H,GACApT,EAAAC,OACAD,EAAAG,OAAA,EAEAmL,EAAA,IAAAzJ,GACAuT,EAAA,KACAD,GAAA,GACSA,GACTlR,EAAAtD,YACAN,OAAAE,EAAAF,OACAE,UACAN,KAAAM,EAAAN,KACAE,OAAAI,EAAAJ,QAEAH,WACAC,KAAAD,EAAAC,KACAE,OAAAH,EAAAG,QAEAO,KAAAH,EAAAG,QAIAV,EAAAG,WAIAxC,KAAAsX,mBAAA,SAAAnU,EAAA0U,GACAvR,EAAA7C,iBAAAN,EAAA0U,MAGU/B,KAAAzT,EAAAyT,KAAAxP,QAGV1G,EAAAiB","file":"source-map.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"sourceMap\"] = factory();\n\telse\n\t\troot[\"sourceMap\"] = factory();\n})(this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId])\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\texports: {},\n/******/ \t\t\tid: moduleId,\n/******/ \t\t\tloaded: false\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.loaded = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(0);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/*\n\t * Copyright 2009-2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE.txt or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\texports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;\n\texports.SourceMapConsumer = __webpack_require__(7).SourceMapConsumer;\n\texports.SourceNode = __webpack_require__(10).SourceNode;\n\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar base64VLQ = __webpack_require__(2);\n\tvar util = __webpack_require__(4);\n\tvar ArraySet = __webpack_require__(5).ArraySet;\n\tvar MappingList = __webpack_require__(6).MappingList;\n\t\n\t/**\n\t * An instance of the SourceMapGenerator represents a source map which is\n\t * being built incrementally. You may pass an object with the following\n\t * properties:\n\t *\n\t *   - file: The filename of the generated source.\n\t *   - sourceRoot: A root for all relative URLs in this source map.\n\t */\n\tfunction SourceMapGenerator(aArgs) {\n\t  if (!aArgs) {\n\t    aArgs = {};\n\t  }\n\t  this._file = util.getArg(aArgs, 'file', null);\n\t  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n\t  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n\t  this._sources = new ArraySet();\n\t  this._names = new ArraySet();\n\t  this._mappings = new MappingList();\n\t  this._sourcesContents = null;\n\t}\n\t\n\tSourceMapGenerator.prototype._version = 3;\n\t\n\t/**\n\t * Creates a new SourceMapGenerator based on a SourceMapConsumer\n\t *\n\t * @param aSourceMapConsumer The SourceMap.\n\t */\n\tSourceMapGenerator.fromSourceMap =\n\t  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n\t    var sourceRoot = aSourceMapConsumer.sourceRoot;\n\t    var generator = new SourceMapGenerator({\n\t      file: aSourceMapConsumer.file,\n\t      sourceRoot: sourceRoot\n\t    });\n\t    aSourceMapConsumer.eachMapping(function (mapping) {\n\t      var newMapping = {\n\t        generated: {\n\t          line: mapping.generatedLine,\n\t          column: mapping.generatedColumn\n\t        }\n\t      };\n\t\n\t      if (mapping.source != null) {\n\t        newMapping.source = mapping.source;\n\t        if (sourceRoot != null) {\n\t          newMapping.source = util.relative(sourceRoot, newMapping.source);\n\t        }\n\t\n\t        newMapping.original = {\n\t          line: mapping.originalLine,\n\t          column: mapping.originalColumn\n\t        };\n\t\n\t        if (mapping.name != null) {\n\t          newMapping.name = mapping.name;\n\t        }\n\t      }\n\t\n\t      generator.addMapping(newMapping);\n\t    });\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var sourceRelative = sourceFile;\n\t      if (sourceRoot !== null) {\n\t        sourceRelative = util.relative(sourceRoot, sourceFile);\n\t      }\n\t\n\t      if (!generator._sources.has(sourceRelative)) {\n\t        generator._sources.add(sourceRelative);\n\t      }\n\t\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        generator.setSourceContent(sourceFile, content);\n\t      }\n\t    });\n\t    return generator;\n\t  };\n\t\n\t/**\n\t * Add a single mapping from original source line and column to the generated\n\t * source's line and column for this source map being created. The mapping\n\t * object should have the following properties:\n\t *\n\t *   - generated: An object with the generated line and column positions.\n\t *   - original: An object with the original line and column positions.\n\t *   - source: The original source file (relative to the sourceRoot).\n\t *   - name: An optional original token name for this mapping.\n\t */\n\tSourceMapGenerator.prototype.addMapping =\n\t  function SourceMapGenerator_addMapping(aArgs) {\n\t    var generated = util.getArg(aArgs, 'generated');\n\t    var original = util.getArg(aArgs, 'original', null);\n\t    var source = util.getArg(aArgs, 'source', null);\n\t    var name = util.getArg(aArgs, 'name', null);\n\t\n\t    if (!this._skipValidation) {\n\t      this._validateMapping(generated, original, source, name);\n\t    }\n\t\n\t    if (source != null) {\n\t      source = String(source);\n\t      if (!this._sources.has(source)) {\n\t        this._sources.add(source);\n\t      }\n\t    }\n\t\n\t    if (name != null) {\n\t      name = String(name);\n\t      if (!this._names.has(name)) {\n\t        this._names.add(name);\n\t      }\n\t    }\n\t\n\t    this._mappings.add({\n\t      generatedLine: generated.line,\n\t      generatedColumn: generated.column,\n\t      originalLine: original != null && original.line,\n\t      originalColumn: original != null && original.column,\n\t      source: source,\n\t      name: name\n\t    });\n\t  };\n\t\n\t/**\n\t * Set the source content for a source file.\n\t */\n\tSourceMapGenerator.prototype.setSourceContent =\n\t  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n\t    var source = aSourceFile;\n\t    if (this._sourceRoot != null) {\n\t      source = util.relative(this._sourceRoot, source);\n\t    }\n\t\n\t    if (aSourceContent != null) {\n\t      // Add the source content to the _sourcesContents map.\n\t      // Create a new _sourcesContents map if the property is null.\n\t      if (!this._sourcesContents) {\n\t        this._sourcesContents = Object.create(null);\n\t      }\n\t      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n\t    } else if (this._sourcesContents) {\n\t      // Remove the source file from the _sourcesContents map.\n\t      // If the _sourcesContents map is empty, set the property to null.\n\t      delete this._sourcesContents[util.toSetString(source)];\n\t      if (Object.keys(this._sourcesContents).length === 0) {\n\t        this._sourcesContents = null;\n\t      }\n\t    }\n\t  };\n\t\n\t/**\n\t * Applies the mappings of a sub-source-map for a specific source file to the\n\t * source map being generated. Each mapping to the supplied source file is\n\t * rewritten using the supplied source map. Note: The resolution for the\n\t * resulting mappings is the minimium of this map and the supplied map.\n\t *\n\t * @param aSourceMapConsumer The source map to be applied.\n\t * @param aSourceFile Optional. The filename of the source file.\n\t *        If omitted, SourceMapConsumer's file property will be used.\n\t * @param aSourceMapPath Optional. The dirname of the path to the source map\n\t *        to be applied. If relative, it is relative to the SourceMapConsumer.\n\t *        This parameter is needed when the two source maps aren't in the same\n\t *        directory, and the source map to be applied contains relative source\n\t *        paths. If so, those relative source paths need to be rewritten\n\t *        relative to the SourceMapGenerator.\n\t */\n\tSourceMapGenerator.prototype.applySourceMap =\n\t  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n\t    var sourceFile = aSourceFile;\n\t    // If aSourceFile is omitted, we will use the file property of the SourceMap\n\t    if (aSourceFile == null) {\n\t      if (aSourceMapConsumer.file == null) {\n\t        throw new Error(\n\t          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n\t          'or the source map\\'s \"file\" property. Both were omitted.'\n\t        );\n\t      }\n\t      sourceFile = aSourceMapConsumer.file;\n\t    }\n\t    var sourceRoot = this._sourceRoot;\n\t    // Make \"sourceFile\" relative if an absolute Url is passed.\n\t    if (sourceRoot != null) {\n\t      sourceFile = util.relative(sourceRoot, sourceFile);\n\t    }\n\t    // Applying the SourceMap can add and remove items from the sources and\n\t    // the names array.\n\t    var newSources = new ArraySet();\n\t    var newNames = new ArraySet();\n\t\n\t    // Find mappings for the \"sourceFile\"\n\t    this._mappings.unsortedForEach(function (mapping) {\n\t      if (mapping.source === sourceFile && mapping.originalLine != null) {\n\t        // Check if it can be mapped by the source map, then update the mapping.\n\t        var original = aSourceMapConsumer.originalPositionFor({\n\t          line: mapping.originalLine,\n\t          column: mapping.originalColumn\n\t        });\n\t        if (original.source != null) {\n\t          // Copy mapping\n\t          mapping.source = original.source;\n\t          if (aSourceMapPath != null) {\n\t            mapping.source = util.join(aSourceMapPath, mapping.source)\n\t          }\n\t          if (sourceRoot != null) {\n\t            mapping.source = util.relative(sourceRoot, mapping.source);\n\t          }\n\t          mapping.originalLine = original.line;\n\t          mapping.originalColumn = original.column;\n\t          if (original.name != null) {\n\t            mapping.name = original.name;\n\t          }\n\t        }\n\t      }\n\t\n\t      var source = mapping.source;\n\t      if (source != null && !newSources.has(source)) {\n\t        newSources.add(source);\n\t      }\n\t\n\t      var name = mapping.name;\n\t      if (name != null && !newNames.has(name)) {\n\t        newNames.add(name);\n\t      }\n\t\n\t    }, this);\n\t    this._sources = newSources;\n\t    this._names = newNames;\n\t\n\t    // Copy sourcesContents of applied map.\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        if (aSourceMapPath != null) {\n\t          sourceFile = util.join(aSourceMapPath, sourceFile);\n\t        }\n\t        if (sourceRoot != null) {\n\t          sourceFile = util.relative(sourceRoot, sourceFile);\n\t        }\n\t        this.setSourceContent(sourceFile, content);\n\t      }\n\t    }, this);\n\t  };\n\t\n\t/**\n\t * A mapping can have one of the three levels of data:\n\t *\n\t *   1. Just the generated position.\n\t *   2. The Generated position, original position, and original source.\n\t *   3. Generated and original position, original source, as well as a name\n\t *      token.\n\t *\n\t * To maintain consistency, we validate that any new mapping being added falls\n\t * in to one of these categories.\n\t */\n\tSourceMapGenerator.prototype._validateMapping =\n\t  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n\t                                              aName) {\n\t    // When aOriginal is truthy but has empty values for .line and .column,\n\t    // it is most likely a programmer error. In this case we throw a very\n\t    // specific error message to try to guide them the right way.\n\t    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n\t    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n\t        throw new Error(\n\t            'original.line and original.column are not numbers -- you probably meant to omit ' +\n\t            'the original mapping entirely and only map the generated position. If so, pass ' +\n\t            'null for the original mapping instead of an object with empty or null values.'\n\t        );\n\t    }\n\t\n\t    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n\t        && aGenerated.line > 0 && aGenerated.column >= 0\n\t        && !aOriginal && !aSource && !aName) {\n\t      // Case 1.\n\t      return;\n\t    }\n\t    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n\t             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n\t             && aGenerated.line > 0 && aGenerated.column >= 0\n\t             && aOriginal.line > 0 && aOriginal.column >= 0\n\t             && aSource) {\n\t      // Cases 2 and 3.\n\t      return;\n\t    }\n\t    else {\n\t      throw new Error('Invalid mapping: ' + JSON.stringify({\n\t        generated: aGenerated,\n\t        source: aSource,\n\t        original: aOriginal,\n\t        name: aName\n\t      }));\n\t    }\n\t  };\n\t\n\t/**\n\t * Serialize the accumulated mappings in to the stream of base 64 VLQs\n\t * specified by the source map format.\n\t */\n\tSourceMapGenerator.prototype._serializeMappings =\n\t  function SourceMapGenerator_serializeMappings() {\n\t    var previousGeneratedColumn = 0;\n\t    var previousGeneratedLine = 1;\n\t    var previousOriginalColumn = 0;\n\t    var previousOriginalLine = 0;\n\t    var previousName = 0;\n\t    var previousSource = 0;\n\t    var result = '';\n\t    var next;\n\t    var mapping;\n\t    var nameIdx;\n\t    var sourceIdx;\n\t\n\t    var mappings = this._mappings.toArray();\n\t    for (var i = 0, len = mappings.length; i < len; i++) {\n\t      mapping = mappings[i];\n\t      next = ''\n\t\n\t      if (mapping.generatedLine !== previousGeneratedLine) {\n\t        previousGeneratedColumn = 0;\n\t        while (mapping.generatedLine !== previousGeneratedLine) {\n\t          next += ';';\n\t          previousGeneratedLine++;\n\t        }\n\t      }\n\t      else {\n\t        if (i > 0) {\n\t          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n\t            continue;\n\t          }\n\t          next += ',';\n\t        }\n\t      }\n\t\n\t      next += base64VLQ.encode(mapping.generatedColumn\n\t                                 - previousGeneratedColumn);\n\t      previousGeneratedColumn = mapping.generatedColumn;\n\t\n\t      if (mapping.source != null) {\n\t        sourceIdx = this._sources.indexOf(mapping.source);\n\t        next += base64VLQ.encode(sourceIdx - previousSource);\n\t        previousSource = sourceIdx;\n\t\n\t        // lines are stored 0-based in SourceMap spec version 3\n\t        next += base64VLQ.encode(mapping.originalLine - 1\n\t                                   - previousOriginalLine);\n\t        previousOriginalLine = mapping.originalLine - 1;\n\t\n\t        next += base64VLQ.encode(mapping.originalColumn\n\t                                   - previousOriginalColumn);\n\t        previousOriginalColumn = mapping.originalColumn;\n\t\n\t        if (mapping.name != null) {\n\t          nameIdx = this._names.indexOf(mapping.name);\n\t          next += base64VLQ.encode(nameIdx - previousName);\n\t          previousName = nameIdx;\n\t        }\n\t      }\n\t\n\t      result += next;\n\t    }\n\t\n\t    return result;\n\t  };\n\t\n\tSourceMapGenerator.prototype._generateSourcesContent =\n\t  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n\t    return aSources.map(function (source) {\n\t      if (!this._sourcesContents) {\n\t        return null;\n\t      }\n\t      if (aSourceRoot != null) {\n\t        source = util.relative(aSourceRoot, source);\n\t      }\n\t      var key = util.toSetString(source);\n\t      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n\t        ? this._sourcesContents[key]\n\t        : null;\n\t    }, this);\n\t  };\n\t\n\t/**\n\t * Externalize the source map.\n\t */\n\tSourceMapGenerator.prototype.toJSON =\n\t  function SourceMapGenerator_toJSON() {\n\t    var map = {\n\t      version: this._version,\n\t      sources: this._sources.toArray(),\n\t      names: this._names.toArray(),\n\t      mappings: this._serializeMappings()\n\t    };\n\t    if (this._file != null) {\n\t      map.file = this._file;\n\t    }\n\t    if (this._sourceRoot != null) {\n\t      map.sourceRoot = this._sourceRoot;\n\t    }\n\t    if (this._sourcesContents) {\n\t      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n\t    }\n\t\n\t    return map;\n\t  };\n\t\n\t/**\n\t * Render the source map being generated to a string.\n\t */\n\tSourceMapGenerator.prototype.toString =\n\t  function SourceMapGenerator_toString() {\n\t    return JSON.stringify(this.toJSON());\n\t  };\n\t\n\texports.SourceMapGenerator = SourceMapGenerator;\n\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t *\n\t * Based on the Base 64 VLQ implementation in Closure Compiler:\n\t * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n\t *\n\t * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n\t * Redistribution and use in source and binary forms, with or without\n\t * modification, are permitted provided that the following conditions are\n\t * met:\n\t *\n\t *  * Redistributions of source code must retain the above copyright\n\t *    notice, this list of conditions and the following disclaimer.\n\t *  * Redistributions in binary form must reproduce the above\n\t *    copyright notice, this list of conditions and the following\n\t *    disclaimer in the documentation and/or other materials provided\n\t *    with the distribution.\n\t *  * Neither the name of Google Inc. nor the names of its\n\t *    contributors may be used to endorse or promote products derived\n\t *    from this software without specific prior written permission.\n\t *\n\t * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\t * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\t * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\t * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\t * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\t * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\t * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\t * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\t * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\t * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\t * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\t */\n\t\n\tvar base64 = __webpack_require__(3);\n\t\n\t// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n\t// length quantities we use in the source map spec, the first bit is the sign,\n\t// the next four bits are the actual value, and the 6th bit is the\n\t// continuation bit. The continuation bit tells us whether there are more\n\t// digits in this value following this digit.\n\t//\n\t//   Continuation\n\t//   |    Sign\n\t//   |    |\n\t//   V    V\n\t//   101011\n\t\n\tvar VLQ_BASE_SHIFT = 5;\n\t\n\t// binary: 100000\n\tvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\t\n\t// binary: 011111\n\tvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\t\n\t// binary: 100000\n\tvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\t\n\t/**\n\t * Converts from a two-complement value to a value where the sign bit is\n\t * placed in the least significant bit.  For example, as decimals:\n\t *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n\t *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n\t */\n\tfunction toVLQSigned(aValue) {\n\t  return aValue < 0\n\t    ? ((-aValue) << 1) + 1\n\t    : (aValue << 1) + 0;\n\t}\n\t\n\t/**\n\t * Converts to a two-complement value from a value where the sign bit is\n\t * placed in the least significant bit.  For example, as decimals:\n\t *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n\t *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n\t */\n\tfunction fromVLQSigned(aValue) {\n\t  var isNegative = (aValue & 1) === 1;\n\t  var shifted = aValue >> 1;\n\t  return isNegative\n\t    ? -shifted\n\t    : shifted;\n\t}\n\t\n\t/**\n\t * Returns the base 64 VLQ encoded value.\n\t */\n\texports.encode = function base64VLQ_encode(aValue) {\n\t  var encoded = \"\";\n\t  var digit;\n\t\n\t  var vlq = toVLQSigned(aValue);\n\t\n\t  do {\n\t    digit = vlq & VLQ_BASE_MASK;\n\t    vlq >>>= VLQ_BASE_SHIFT;\n\t    if (vlq > 0) {\n\t      // There are still more digits in this value, so we must make sure the\n\t      // continuation bit is marked.\n\t      digit |= VLQ_CONTINUATION_BIT;\n\t    }\n\t    encoded += base64.encode(digit);\n\t  } while (vlq > 0);\n\t\n\t  return encoded;\n\t};\n\t\n\t/**\n\t * Decodes the next base 64 VLQ value from the given string and returns the\n\t * value and the rest of the string via the out parameter.\n\t */\n\texports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n\t  var strLen = aStr.length;\n\t  var result = 0;\n\t  var shift = 0;\n\t  var continuation, digit;\n\t\n\t  do {\n\t    if (aIndex >= strLen) {\n\t      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n\t    }\n\t\n\t    digit = base64.decode(aStr.charCodeAt(aIndex++));\n\t    if (digit === -1) {\n\t      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n\t    }\n\t\n\t    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n\t    digit &= VLQ_BASE_MASK;\n\t    result = result + (digit << shift);\n\t    shift += VLQ_BASE_SHIFT;\n\t  } while (continuation);\n\t\n\t  aOutParam.value = fromVLQSigned(result);\n\t  aOutParam.rest = aIndex;\n\t};\n\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\t\n\t/**\n\t * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n\t */\n\texports.encode = function (number) {\n\t  if (0 <= number && number < intToCharMap.length) {\n\t    return intToCharMap[number];\n\t  }\n\t  throw new TypeError(\"Must be between 0 and 63: \" + number);\n\t};\n\t\n\t/**\n\t * Decode a single base 64 character code digit to an integer. Returns -1 on\n\t * failure.\n\t */\n\texports.decode = function (charCode) {\n\t  var bigA = 65;     // 'A'\n\t  var bigZ = 90;     // 'Z'\n\t\n\t  var littleA = 97;  // 'a'\n\t  var littleZ = 122; // 'z'\n\t\n\t  var zero = 48;     // '0'\n\t  var nine = 57;     // '9'\n\t\n\t  var plus = 43;     // '+'\n\t  var slash = 47;    // '/'\n\t\n\t  var littleOffset = 26;\n\t  var numberOffset = 52;\n\t\n\t  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n\t  if (bigA <= charCode && charCode <= bigZ) {\n\t    return (charCode - bigA);\n\t  }\n\t\n\t  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n\t  if (littleA <= charCode && charCode <= littleZ) {\n\t    return (charCode - littleA + littleOffset);\n\t  }\n\t\n\t  // 52 - 61: 0123456789\n\t  if (zero <= charCode && charCode <= nine) {\n\t    return (charCode - zero + numberOffset);\n\t  }\n\t\n\t  // 62: +\n\t  if (charCode == plus) {\n\t    return 62;\n\t  }\n\t\n\t  // 63: /\n\t  if (charCode == slash) {\n\t    return 63;\n\t  }\n\t\n\t  // Invalid base64 digit.\n\t  return -1;\n\t};\n\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\t/**\n\t * This is a helper function for getting values from parameter/options\n\t * objects.\n\t *\n\t * @param args The object we are extracting values from\n\t * @param name The name of the property we are getting.\n\t * @param defaultValue An optional value to return if the property is missing\n\t * from the object. If this is not specified and the property is missing, an\n\t * error will be thrown.\n\t */\n\tfunction getArg(aArgs, aName, aDefaultValue) {\n\t  if (aName in aArgs) {\n\t    return aArgs[aName];\n\t  } else if (arguments.length === 3) {\n\t    return aDefaultValue;\n\t  } else {\n\t    throw new Error('\"' + aName + '\" is a required argument.');\n\t  }\n\t}\n\texports.getArg = getArg;\n\t\n\tvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\n\tvar dataUrlRegexp = /^data:.+\\,.+$/;\n\t\n\tfunction urlParse(aUrl) {\n\t  var match = aUrl.match(urlRegexp);\n\t  if (!match) {\n\t    return null;\n\t  }\n\t  return {\n\t    scheme: match[1],\n\t    auth: match[2],\n\t    host: match[3],\n\t    port: match[4],\n\t    path: match[5]\n\t  };\n\t}\n\texports.urlParse = urlParse;\n\t\n\tfunction urlGenerate(aParsedUrl) {\n\t  var url = '';\n\t  if (aParsedUrl.scheme) {\n\t    url += aParsedUrl.scheme + ':';\n\t  }\n\t  url += '//';\n\t  if (aParsedUrl.auth) {\n\t    url += aParsedUrl.auth + '@';\n\t  }\n\t  if (aParsedUrl.host) {\n\t    url += aParsedUrl.host;\n\t  }\n\t  if (aParsedUrl.port) {\n\t    url += \":\" + aParsedUrl.port\n\t  }\n\t  if (aParsedUrl.path) {\n\t    url += aParsedUrl.path;\n\t  }\n\t  return url;\n\t}\n\texports.urlGenerate = urlGenerate;\n\t\n\t/**\n\t * Normalizes a path, or the path portion of a URL:\n\t *\n\t * - Replaces consecutive slashes with one slash.\n\t * - Removes unnecessary '.' parts.\n\t * - Removes unnecessary '<dir>/..' parts.\n\t *\n\t * Based on code in the Node.js 'path' core module.\n\t *\n\t * @param aPath The path or url to normalize.\n\t */\n\tfunction normalize(aPath) {\n\t  var path = aPath;\n\t  var url = urlParse(aPath);\n\t  if (url) {\n\t    if (!url.path) {\n\t      return aPath;\n\t    }\n\t    path = url.path;\n\t  }\n\t  var isAbsolute = exports.isAbsolute(path);\n\t\n\t  var parts = path.split(/\\/+/);\n\t  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n\t    part = parts[i];\n\t    if (part === '.') {\n\t      parts.splice(i, 1);\n\t    } else if (part === '..') {\n\t      up++;\n\t    } else if (up > 0) {\n\t      if (part === '') {\n\t        // The first part is blank if the path is absolute. Trying to go\n\t        // above the root is a no-op. Therefore we can remove all '..' parts\n\t        // directly after the root.\n\t        parts.splice(i + 1, up);\n\t        up = 0;\n\t      } else {\n\t        parts.splice(i, 2);\n\t        up--;\n\t      }\n\t    }\n\t  }\n\t  path = parts.join('/');\n\t\n\t  if (path === '') {\n\t    path = isAbsolute ? '/' : '.';\n\t  }\n\t\n\t  if (url) {\n\t    url.path = path;\n\t    return urlGenerate(url);\n\t  }\n\t  return path;\n\t}\n\texports.normalize = normalize;\n\t\n\t/**\n\t * Joins two paths/URLs.\n\t *\n\t * @param aRoot The root path or URL.\n\t * @param aPath The path or URL to be joined with the root.\n\t *\n\t * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n\t *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n\t *   first.\n\t * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n\t *   is updated with the result and aRoot is returned. Otherwise the result\n\t *   is returned.\n\t *   - If aPath is absolute, the result is aPath.\n\t *   - Otherwise the two paths are joined with a slash.\n\t * - Joining for example 'http://' and 'www.example.com' is also supported.\n\t */\n\tfunction join(aRoot, aPath) {\n\t  if (aRoot === \"\") {\n\t    aRoot = \".\";\n\t  }\n\t  if (aPath === \"\") {\n\t    aPath = \".\";\n\t  }\n\t  var aPathUrl = urlParse(aPath);\n\t  var aRootUrl = urlParse(aRoot);\n\t  if (aRootUrl) {\n\t    aRoot = aRootUrl.path || '/';\n\t  }\n\t\n\t  // `join(foo, '//www.example.org')`\n\t  if (aPathUrl && !aPathUrl.scheme) {\n\t    if (aRootUrl) {\n\t      aPathUrl.scheme = aRootUrl.scheme;\n\t    }\n\t    return urlGenerate(aPathUrl);\n\t  }\n\t\n\t  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n\t    return aPath;\n\t  }\n\t\n\t  // `join('http://', 'www.example.com')`\n\t  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n\t    aRootUrl.host = aPath;\n\t    return urlGenerate(aRootUrl);\n\t  }\n\t\n\t  var joined = aPath.charAt(0) === '/'\n\t    ? aPath\n\t    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\t\n\t  if (aRootUrl) {\n\t    aRootUrl.path = joined;\n\t    return urlGenerate(aRootUrl);\n\t  }\n\t  return joined;\n\t}\n\texports.join = join;\n\t\n\texports.isAbsolute = function (aPath) {\n\t  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n\t};\n\t\n\t/**\n\t * Make a path relative to a URL or another path.\n\t *\n\t * @param aRoot The root path or URL.\n\t * @param aPath The path or URL to be made relative to aRoot.\n\t */\n\tfunction relative(aRoot, aPath) {\n\t  if (aRoot === \"\") {\n\t    aRoot = \".\";\n\t  }\n\t\n\t  aRoot = aRoot.replace(/\\/$/, '');\n\t\n\t  // It is possible for the path to be above the root. In this case, simply\n\t  // checking whether the root is a prefix of the path won't work. Instead, we\n\t  // need to remove components from the root one by one, until either we find\n\t  // a prefix that fits, or we run out of components to remove.\n\t  var level = 0;\n\t  while (aPath.indexOf(aRoot + '/') !== 0) {\n\t    var index = aRoot.lastIndexOf(\"/\");\n\t    if (index < 0) {\n\t      return aPath;\n\t    }\n\t\n\t    // If the only part of the root that is left is the scheme (i.e. http://,\n\t    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n\t    // have exhausted all components, so the path is not relative to the root.\n\t    aRoot = aRoot.slice(0, index);\n\t    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n\t      return aPath;\n\t    }\n\t\n\t    ++level;\n\t  }\n\t\n\t  // Make sure we add a \"../\" for each component we removed from the root.\n\t  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n\t}\n\texports.relative = relative;\n\t\n\tvar supportsNullProto = (function () {\n\t  var obj = Object.create(null);\n\t  return !('__proto__' in obj);\n\t}());\n\t\n\tfunction identity (s) {\n\t  return s;\n\t}\n\t\n\t/**\n\t * Because behavior goes wacky when you set `__proto__` on objects, we\n\t * have to prefix all the strings in our set with an arbitrary character.\n\t *\n\t * See https://github.com/mozilla/source-map/pull/31 and\n\t * https://github.com/mozilla/source-map/issues/30\n\t *\n\t * @param String aStr\n\t */\n\tfunction toSetString(aStr) {\n\t  if (isProtoString(aStr)) {\n\t    return '$' + aStr;\n\t  }\n\t\n\t  return aStr;\n\t}\n\texports.toSetString = supportsNullProto ? identity : toSetString;\n\t\n\tfunction fromSetString(aStr) {\n\t  if (isProtoString(aStr)) {\n\t    return aStr.slice(1);\n\t  }\n\t\n\t  return aStr;\n\t}\n\texports.fromSetString = supportsNullProto ? identity : fromSetString;\n\t\n\tfunction isProtoString(s) {\n\t  if (!s) {\n\t    return false;\n\t  }\n\t\n\t  var length = s.length;\n\t\n\t  if (length < 9 /* \"__proto__\".length */) {\n\t    return false;\n\t  }\n\t\n\t  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n\t      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n\t      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n\t      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n\t      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n\t      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n\t      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n\t    return false;\n\t  }\n\t\n\t  for (var i = length - 10; i >= 0; i--) {\n\t    if (s.charCodeAt(i) !== 36 /* '$' */) {\n\t      return false;\n\t    }\n\t  }\n\t\n\t  return true;\n\t}\n\t\n\t/**\n\t * Comparator between two mappings where the original positions are compared.\n\t *\n\t * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n\t * mappings with the same original source/line/column, but different generated\n\t * line and column the same. Useful when searching for a mapping with a\n\t * stubbed out mapping.\n\t */\n\tfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n\t  var cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0 || onlyCompareOriginal) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByOriginalPositions = compareByOriginalPositions;\n\t\n\t/**\n\t * Comparator between two mappings with deflated source and name indices where\n\t * the generated positions are compared.\n\t *\n\t * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n\t * mappings with the same generated line and column, but different\n\t * source/name/original line and column the same. Useful when searching for a\n\t * mapping with a stubbed out mapping.\n\t */\n\tfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n\t  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0 || onlyCompareGenerated) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\t\n\tfunction strcmp(aStr1, aStr2) {\n\t  if (aStr1 === aStr2) {\n\t    return 0;\n\t  }\n\t\n\t  if (aStr1 === null) {\n\t    return 1; // aStr2 !== null\n\t  }\n\t\n\t  if (aStr2 === null) {\n\t    return -1; // aStr1 !== null\n\t  }\n\t\n\t  if (aStr1 > aStr2) {\n\t    return 1;\n\t  }\n\t\n\t  return -1;\n\t}\n\t\n\t/**\n\t * Comparator between two mappings with inflated source and name strings where\n\t * the generated positions are compared.\n\t */\n\tfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n\t  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = strcmp(mappingA.source, mappingB.source);\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalLine - mappingB.originalLine;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  cmp = mappingA.originalColumn - mappingB.originalColumn;\n\t  if (cmp !== 0) {\n\t    return cmp;\n\t  }\n\t\n\t  return strcmp(mappingA.name, mappingB.name);\n\t}\n\texports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\t\n\t/**\n\t * Strip any JSON XSSI avoidance prefix from the string (as documented\n\t * in the source maps specification), and then parse the string as\n\t * JSON.\n\t */\n\tfunction parseSourceMapInput(str) {\n\t  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n\t}\n\texports.parseSourceMapInput = parseSourceMapInput;\n\t\n\t/**\n\t * Compute the URL of a source given the the source root, the source's\n\t * URL, and the source map's URL.\n\t */\n\tfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n\t  sourceURL = sourceURL || '';\n\t\n\t  if (sourceRoot) {\n\t    // This follows what Chrome does.\n\t    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n\t      sourceRoot += '/';\n\t    }\n\t    // The spec says:\n\t    //   Line 4: An optional source root, useful for relocating source\n\t    //   files on a server or removing repeated values in the\n\t    //   “sources” entry.  This value is prepended to the individual\n\t    //   entries in the “source” field.\n\t    sourceURL = sourceRoot + sourceURL;\n\t  }\n\t\n\t  // Historically, SourceMapConsumer did not take the sourceMapURL as\n\t  // a parameter.  This mode is still somewhat supported, which is why\n\t  // this code block is conditional.  However, it's preferable to pass\n\t  // the source map URL to SourceMapConsumer, so that this function\n\t  // can implement the source URL resolution algorithm as outlined in\n\t  // the spec.  This block is basically the equivalent of:\n\t  //    new URL(sourceURL, sourceMapURL).toString()\n\t  // ... except it avoids using URL, which wasn't available in the\n\t  // older releases of node still supported by this library.\n\t  //\n\t  // The spec says:\n\t  //   If the sources are not absolute URLs after prepending of the\n\t  //   “sourceRoot”, the sources are resolved relative to the\n\t  //   SourceMap (like resolving script src in a html document).\n\t  if (sourceMapURL) {\n\t    var parsed = urlParse(sourceMapURL);\n\t    if (!parsed) {\n\t      throw new Error(\"sourceMapURL could not be parsed\");\n\t    }\n\t    if (parsed.path) {\n\t      // Strip the last path component, but keep the \"/\".\n\t      var index = parsed.path.lastIndexOf('/');\n\t      if (index >= 0) {\n\t        parsed.path = parsed.path.substring(0, index + 1);\n\t      }\n\t    }\n\t    sourceURL = join(urlGenerate(parsed), sourceURL);\n\t  }\n\t\n\t  return normalize(sourceURL);\n\t}\n\texports.computeSourceURL = computeSourceURL;\n\n\n/***/ }),\n/* 5 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar hasNativeMap = typeof Map !== \"undefined\";\n\t\n\t/**\n\t * A data structure which is a combination of an array and a set. Adding a new\n\t * member is O(1), testing for membership is O(1), and finding the index of an\n\t * element is O(1). Removing elements from the set is not supported. Only\n\t * strings are supported for membership.\n\t */\n\tfunction ArraySet() {\n\t  this._array = [];\n\t  this._set = hasNativeMap ? new Map() : Object.create(null);\n\t}\n\t\n\t/**\n\t * Static method for creating ArraySet instances from an existing array.\n\t */\n\tArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n\t  var set = new ArraySet();\n\t  for (var i = 0, len = aArray.length; i < len; i++) {\n\t    set.add(aArray[i], aAllowDuplicates);\n\t  }\n\t  return set;\n\t};\n\t\n\t/**\n\t * Return how many unique items are in this ArraySet. If duplicates have been\n\t * added, than those do not count towards the size.\n\t *\n\t * @returns Number\n\t */\n\tArraySet.prototype.size = function ArraySet_size() {\n\t  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n\t};\n\t\n\t/**\n\t * Add the given string to this set.\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n\t  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n\t  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n\t  var idx = this._array.length;\n\t  if (!isDuplicate || aAllowDuplicates) {\n\t    this._array.push(aStr);\n\t  }\n\t  if (!isDuplicate) {\n\t    if (hasNativeMap) {\n\t      this._set.set(aStr, idx);\n\t    } else {\n\t      this._set[sStr] = idx;\n\t    }\n\t  }\n\t};\n\t\n\t/**\n\t * Is the given string a member of this set?\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.has = function ArraySet_has(aStr) {\n\t  if (hasNativeMap) {\n\t    return this._set.has(aStr);\n\t  } else {\n\t    var sStr = util.toSetString(aStr);\n\t    return has.call(this._set, sStr);\n\t  }\n\t};\n\t\n\t/**\n\t * What is the index of the given string in the array?\n\t *\n\t * @param String aStr\n\t */\n\tArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n\t  if (hasNativeMap) {\n\t    var idx = this._set.get(aStr);\n\t    if (idx >= 0) {\n\t        return idx;\n\t    }\n\t  } else {\n\t    var sStr = util.toSetString(aStr);\n\t    if (has.call(this._set, sStr)) {\n\t      return this._set[sStr];\n\t    }\n\t  }\n\t\n\t  throw new Error('\"' + aStr + '\" is not in the set.');\n\t};\n\t\n\t/**\n\t * What is the element at the given index?\n\t *\n\t * @param Number aIdx\n\t */\n\tArraySet.prototype.at = function ArraySet_at(aIdx) {\n\t  if (aIdx >= 0 && aIdx < this._array.length) {\n\t    return this._array[aIdx];\n\t  }\n\t  throw new Error('No element indexed by ' + aIdx);\n\t};\n\t\n\t/**\n\t * Returns the array representation of this set (which has the proper indices\n\t * indicated by indexOf). Note that this is a copy of the internal array used\n\t * for storing the members so that no one can mess with internal state.\n\t */\n\tArraySet.prototype.toArray = function ArraySet_toArray() {\n\t  return this._array.slice();\n\t};\n\t\n\texports.ArraySet = ArraySet;\n\n\n/***/ }),\n/* 6 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2014 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\t\n\t/**\n\t * Determine whether mappingB is after mappingA with respect to generated\n\t * position.\n\t */\n\tfunction generatedPositionAfter(mappingA, mappingB) {\n\t  // Optimized for most common case\n\t  var lineA = mappingA.generatedLine;\n\t  var lineB = mappingB.generatedLine;\n\t  var columnA = mappingA.generatedColumn;\n\t  var columnB = mappingB.generatedColumn;\n\t  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n\t         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n\t}\n\t\n\t/**\n\t * A data structure to provide a sorted view of accumulated mappings in a\n\t * performance conscious manner. It trades a neglibable overhead in general\n\t * case for a large speedup in case of mappings being added in order.\n\t */\n\tfunction MappingList() {\n\t  this._array = [];\n\t  this._sorted = true;\n\t  // Serves as infimum\n\t  this._last = {generatedLine: -1, generatedColumn: 0};\n\t}\n\t\n\t/**\n\t * Iterate through internal items. This method takes the same arguments that\n\t * `Array.prototype.forEach` takes.\n\t *\n\t * NOTE: The order of the mappings is NOT guaranteed.\n\t */\n\tMappingList.prototype.unsortedForEach =\n\t  function MappingList_forEach(aCallback, aThisArg) {\n\t    this._array.forEach(aCallback, aThisArg);\n\t  };\n\t\n\t/**\n\t * Add the given source mapping.\n\t *\n\t * @param Object aMapping\n\t */\n\tMappingList.prototype.add = function MappingList_add(aMapping) {\n\t  if (generatedPositionAfter(this._last, aMapping)) {\n\t    this._last = aMapping;\n\t    this._array.push(aMapping);\n\t  } else {\n\t    this._sorted = false;\n\t    this._array.push(aMapping);\n\t  }\n\t};\n\t\n\t/**\n\t * Returns the flat, sorted array of mappings. The mappings are sorted by\n\t * generated position.\n\t *\n\t * WARNING: This method returns internal data without copying, for\n\t * performance. The return value must NOT be mutated, and should be treated as\n\t * an immutable borrow. If you want to take ownership, you must make your own\n\t * copy.\n\t */\n\tMappingList.prototype.toArray = function MappingList_toArray() {\n\t  if (!this._sorted) {\n\t    this._array.sort(util.compareByGeneratedPositionsInflated);\n\t    this._sorted = true;\n\t  }\n\t  return this._array;\n\t};\n\t\n\texports.MappingList = MappingList;\n\n\n/***/ }),\n/* 7 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar util = __webpack_require__(4);\n\tvar binarySearch = __webpack_require__(8);\n\tvar ArraySet = __webpack_require__(5).ArraySet;\n\tvar base64VLQ = __webpack_require__(2);\n\tvar quickSort = __webpack_require__(9).quickSort;\n\t\n\tfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  return sourceMap.sections != null\n\t    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n\t    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n\t}\n\t\n\tSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n\t  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n\t}\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tSourceMapConsumer.prototype._version = 3;\n\t\n\t// `__generatedMappings` and `__originalMappings` are arrays that hold the\n\t// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n\t// are lazily instantiated, accessed via the `_generatedMappings` and\n\t// `_originalMappings` getters respectively, and we only parse the mappings\n\t// and create these arrays once queried for a source location. We jump through\n\t// these hoops because there can be many thousands of mappings, and parsing\n\t// them is expensive, so we only want to do it if we must.\n\t//\n\t// Each object in the arrays is of the form:\n\t//\n\t//     {\n\t//       generatedLine: The line number in the generated code,\n\t//       generatedColumn: The column number in the generated code,\n\t//       source: The path to the original source file that generated this\n\t//               chunk of code,\n\t//       originalLine: The line number in the original source that\n\t//                     corresponds to this chunk of generated code,\n\t//       originalColumn: The column number in the original source that\n\t//                       corresponds to this chunk of generated code,\n\t//       name: The name of the original symbol which generated this chunk of\n\t//             code.\n\t//     }\n\t//\n\t// All properties except for `generatedLine` and `generatedColumn` can be\n\t// `null`.\n\t//\n\t// `_generatedMappings` is ordered by the generated positions.\n\t//\n\t// `_originalMappings` is ordered by the original positions.\n\t\n\tSourceMapConsumer.prototype.__generatedMappings = null;\n\tObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n\t  configurable: true,\n\t  enumerable: true,\n\t  get: function () {\n\t    if (!this.__generatedMappings) {\n\t      this._parseMappings(this._mappings, this.sourceRoot);\n\t    }\n\t\n\t    return this.__generatedMappings;\n\t  }\n\t});\n\t\n\tSourceMapConsumer.prototype.__originalMappings = null;\n\tObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n\t  configurable: true,\n\t  enumerable: true,\n\t  get: function () {\n\t    if (!this.__originalMappings) {\n\t      this._parseMappings(this._mappings, this.sourceRoot);\n\t    }\n\t\n\t    return this.__originalMappings;\n\t  }\n\t});\n\t\n\tSourceMapConsumer.prototype._charIsMappingSeparator =\n\t  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n\t    var c = aStr.charAt(index);\n\t    return c === \";\" || c === \",\";\n\t  };\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tSourceMapConsumer.prototype._parseMappings =\n\t  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    throw new Error(\"Subclasses must implement _parseMappings\");\n\t  };\n\t\n\tSourceMapConsumer.GENERATED_ORDER = 1;\n\tSourceMapConsumer.ORIGINAL_ORDER = 2;\n\t\n\tSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\n\tSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\t\n\t/**\n\t * Iterate over each mapping between an original source/line/column and a\n\t * generated line/column in this source map.\n\t *\n\t * @param Function aCallback\n\t *        The function that is called with each mapping.\n\t * @param Object aContext\n\t *        Optional. If specified, this object will be the value of `this` every\n\t *        time that `aCallback` is called.\n\t * @param aOrder\n\t *        Either `SourceMapConsumer.GENERATED_ORDER` or\n\t *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n\t *        iterate over the mappings sorted by the generated file's line/column\n\t *        order or the original's source/line/column order, respectively. Defaults to\n\t *        `SourceMapConsumer.GENERATED_ORDER`.\n\t */\n\tSourceMapConsumer.prototype.eachMapping =\n\t  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n\t    var context = aContext || null;\n\t    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\t\n\t    var mappings;\n\t    switch (order) {\n\t    case SourceMapConsumer.GENERATED_ORDER:\n\t      mappings = this._generatedMappings;\n\t      break;\n\t    case SourceMapConsumer.ORIGINAL_ORDER:\n\t      mappings = this._originalMappings;\n\t      break;\n\t    default:\n\t      throw new Error(\"Unknown order of iteration.\");\n\t    }\n\t\n\t    var sourceRoot = this.sourceRoot;\n\t    mappings.map(function (mapping) {\n\t      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n\t      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n\t      return {\n\t        source: source,\n\t        generatedLine: mapping.generatedLine,\n\t        generatedColumn: mapping.generatedColumn,\n\t        originalLine: mapping.originalLine,\n\t        originalColumn: mapping.originalColumn,\n\t        name: mapping.name === null ? null : this._names.at(mapping.name)\n\t      };\n\t    }, this).forEach(aCallback, context);\n\t  };\n\t\n\t/**\n\t * Returns all generated line and column information for the original source,\n\t * line, and column provided. If no column is provided, returns all mappings\n\t * corresponding to a either the line we are searching for or the next\n\t * closest line that has any mappings. Otherwise, returns all mappings\n\t * corresponding to the given line and either the column we are searching for\n\t * or the next closest column that has any offsets.\n\t *\n\t * The only argument is an object with the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number is 1-based.\n\t *   - column: Optional. the column number in the original source.\n\t *    The column number is 0-based.\n\t *\n\t * and an array of objects is returned, each with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *    line number is 1-based.\n\t *   - column: The column number in the generated source, or null.\n\t *    The column number is 0-based.\n\t */\n\tSourceMapConsumer.prototype.allGeneratedPositionsFor =\n\t  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n\t    var line = util.getArg(aArgs, 'line');\n\t\n\t    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n\t    // returns the index of the closest mapping less than the needle. By\n\t    // setting needle.originalColumn to 0, we thus find the last mapping for\n\t    // the given line, provided such a mapping exists.\n\t    var needle = {\n\t      source: util.getArg(aArgs, 'source'),\n\t      originalLine: line,\n\t      originalColumn: util.getArg(aArgs, 'column', 0)\n\t    };\n\t\n\t    needle.source = this._findSourceIndex(needle.source);\n\t    if (needle.source < 0) {\n\t      return [];\n\t    }\n\t\n\t    var mappings = [];\n\t\n\t    var index = this._findMapping(needle,\n\t                                  this._originalMappings,\n\t                                  \"originalLine\",\n\t                                  \"originalColumn\",\n\t                                  util.compareByOriginalPositions,\n\t                                  binarySearch.LEAST_UPPER_BOUND);\n\t    if (index >= 0) {\n\t      var mapping = this._originalMappings[index];\n\t\n\t      if (aArgs.column === undefined) {\n\t        var originalLine = mapping.originalLine;\n\t\n\t        // Iterate until either we run out of mappings, or we run into\n\t        // a mapping for a different line than the one we found. Since\n\t        // mappings are sorted, this is guaranteed to find all mappings for\n\t        // the line we found.\n\t        while (mapping && mapping.originalLine === originalLine) {\n\t          mappings.push({\n\t            line: util.getArg(mapping, 'generatedLine', null),\n\t            column: util.getArg(mapping, 'generatedColumn', null),\n\t            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t          });\n\t\n\t          mapping = this._originalMappings[++index];\n\t        }\n\t      } else {\n\t        var originalColumn = mapping.originalColumn;\n\t\n\t        // Iterate until either we run out of mappings, or we run into\n\t        // a mapping for a different line than the one we were searching for.\n\t        // Since mappings are sorted, this is guaranteed to find all mappings for\n\t        // the line we are searching for.\n\t        while (mapping &&\n\t               mapping.originalLine === line &&\n\t               mapping.originalColumn == originalColumn) {\n\t          mappings.push({\n\t            line: util.getArg(mapping, 'generatedLine', null),\n\t            column: util.getArg(mapping, 'generatedColumn', null),\n\t            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t          });\n\t\n\t          mapping = this._originalMappings[++index];\n\t        }\n\t      }\n\t    }\n\t\n\t    return mappings;\n\t  };\n\t\n\texports.SourceMapConsumer = SourceMapConsumer;\n\t\n\t/**\n\t * A BasicSourceMapConsumer instance represents a parsed source map which we can\n\t * query for information about the original file positions by giving it a file\n\t * position in the generated source.\n\t *\n\t * The first parameter is the raw source map (either as a JSON string, or\n\t * already parsed to an object). According to the spec, source maps have the\n\t * following attributes:\n\t *\n\t *   - version: Which version of the source map spec this map is following.\n\t *   - sources: An array of URLs to the original source files.\n\t *   - names: An array of identifiers which can be referrenced by individual mappings.\n\t *   - sourceRoot: Optional. The URL root from which all sources are relative.\n\t *   - sourcesContent: Optional. An array of contents of the original source files.\n\t *   - mappings: A string of base64 VLQs which contain the actual mappings.\n\t *   - file: Optional. The generated file this source map is associated with.\n\t *\n\t * Here is an example source map, taken from the source map spec[0]:\n\t *\n\t *     {\n\t *       version : 3,\n\t *       file: \"out.js\",\n\t *       sourceRoot : \"\",\n\t *       sources: [\"foo.js\", \"bar.js\"],\n\t *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n\t *       mappings: \"AA,AB;;ABCDE;\"\n\t *     }\n\t *\n\t * The second parameter, if given, is a string whose value is the URL\n\t * at which the source map was found.  This URL is used to compute the\n\t * sources array.\n\t *\n\t * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n\t */\n\tfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  var version = util.getArg(sourceMap, 'version');\n\t  var sources = util.getArg(sourceMap, 'sources');\n\t  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n\t  // requires the array) to play nice here.\n\t  var names = util.getArg(sourceMap, 'names', []);\n\t  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n\t  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n\t  var mappings = util.getArg(sourceMap, 'mappings');\n\t  var file = util.getArg(sourceMap, 'file', null);\n\t\n\t  // Once again, Sass deviates from the spec and supplies the version as a\n\t  // string rather than a number, so we use loose equality checking here.\n\t  if (version != this._version) {\n\t    throw new Error('Unsupported version: ' + version);\n\t  }\n\t\n\t  if (sourceRoot) {\n\t    sourceRoot = util.normalize(sourceRoot);\n\t  }\n\t\n\t  sources = sources\n\t    .map(String)\n\t    // Some source maps produce relative source paths like \"./foo.js\" instead of\n\t    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n\t    // See bugzil.la/1090768.\n\t    .map(util.normalize)\n\t    // Always ensure that absolute sources are internally stored relative to\n\t    // the source root, if the source root is absolute. Not doing this would\n\t    // be particularly problematic when the source root is a prefix of the\n\t    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n\t    .map(function (source) {\n\t      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n\t        ? util.relative(sourceRoot, source)\n\t        : source;\n\t    });\n\t\n\t  // Pass `true` below to allow duplicate names and sources. While source maps\n\t  // are intended to be compressed and deduplicated, the TypeScript compiler\n\t  // sometimes generates source maps with duplicates in them. See Github issue\n\t  // #72 and bugzil.la/889492.\n\t  this._names = ArraySet.fromArray(names.map(String), true);\n\t  this._sources = ArraySet.fromArray(sources, true);\n\t\n\t  this._absoluteSources = this._sources.toArray().map(function (s) {\n\t    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n\t  });\n\t\n\t  this.sourceRoot = sourceRoot;\n\t  this.sourcesContent = sourcesContent;\n\t  this._mappings = mappings;\n\t  this._sourceMapURL = aSourceMapURL;\n\t  this.file = file;\n\t}\n\t\n\tBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\n\tBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\t\n\t/**\n\t * Utility function to find the index of a source.  Returns -1 if not\n\t * found.\n\t */\n\tBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n\t  var relativeSource = aSource;\n\t  if (this.sourceRoot != null) {\n\t    relativeSource = util.relative(this.sourceRoot, relativeSource);\n\t  }\n\t\n\t  if (this._sources.has(relativeSource)) {\n\t    return this._sources.indexOf(relativeSource);\n\t  }\n\t\n\t  // Maybe aSource is an absolute URL as returned by |sources|.  In\n\t  // this case we can't simply undo the transform.\n\t  var i;\n\t  for (i = 0; i < this._absoluteSources.length; ++i) {\n\t    if (this._absoluteSources[i] == aSource) {\n\t      return i;\n\t    }\n\t  }\n\t\n\t  return -1;\n\t};\n\t\n\t/**\n\t * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n\t *\n\t * @param SourceMapGenerator aSourceMap\n\t *        The source map that will be consumed.\n\t * @param String aSourceMapURL\n\t *        The URL at which the source map can be found (optional)\n\t * @returns BasicSourceMapConsumer\n\t */\n\tBasicSourceMapConsumer.fromSourceMap =\n\t  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n\t    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\t\n\t    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n\t    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n\t    smc.sourceRoot = aSourceMap._sourceRoot;\n\t    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n\t                                                            smc.sourceRoot);\n\t    smc.file = aSourceMap._file;\n\t    smc._sourceMapURL = aSourceMapURL;\n\t    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n\t      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n\t    });\n\t\n\t    // Because we are modifying the entries (by converting string sources and\n\t    // names to indices into the sources and names ArraySets), we have to make\n\t    // a copy of the entry or else bad things happen. Shared mutable state\n\t    // strikes again! See github issue #191.\n\t\n\t    var generatedMappings = aSourceMap._mappings.toArray().slice();\n\t    var destGeneratedMappings = smc.__generatedMappings = [];\n\t    var destOriginalMappings = smc.__originalMappings = [];\n\t\n\t    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n\t      var srcMapping = generatedMappings[i];\n\t      var destMapping = new Mapping;\n\t      destMapping.generatedLine = srcMapping.generatedLine;\n\t      destMapping.generatedColumn = srcMapping.generatedColumn;\n\t\n\t      if (srcMapping.source) {\n\t        destMapping.source = sources.indexOf(srcMapping.source);\n\t        destMapping.originalLine = srcMapping.originalLine;\n\t        destMapping.originalColumn = srcMapping.originalColumn;\n\t\n\t        if (srcMapping.name) {\n\t          destMapping.name = names.indexOf(srcMapping.name);\n\t        }\n\t\n\t        destOriginalMappings.push(destMapping);\n\t      }\n\t\n\t      destGeneratedMappings.push(destMapping);\n\t    }\n\t\n\t    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\t\n\t    return smc;\n\t  };\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tBasicSourceMapConsumer.prototype._version = 3;\n\t\n\t/**\n\t * The list of original sources.\n\t */\n\tObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n\t  get: function () {\n\t    return this._absoluteSources.slice();\n\t  }\n\t});\n\t\n\t/**\n\t * Provide the JIT with a nice shape / hidden class.\n\t */\n\tfunction Mapping() {\n\t  this.generatedLine = 0;\n\t  this.generatedColumn = 0;\n\t  this.source = null;\n\t  this.originalLine = null;\n\t  this.originalColumn = null;\n\t  this.name = null;\n\t}\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tBasicSourceMapConsumer.prototype._parseMappings =\n\t  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    var generatedLine = 1;\n\t    var previousGeneratedColumn = 0;\n\t    var previousOriginalLine = 0;\n\t    var previousOriginalColumn = 0;\n\t    var previousSource = 0;\n\t    var previousName = 0;\n\t    var length = aStr.length;\n\t    var index = 0;\n\t    var cachedSegments = {};\n\t    var temp = {};\n\t    var originalMappings = [];\n\t    var generatedMappings = [];\n\t    var mapping, str, segment, end, value;\n\t\n\t    while (index < length) {\n\t      if (aStr.charAt(index) === ';') {\n\t        generatedLine++;\n\t        index++;\n\t        previousGeneratedColumn = 0;\n\t      }\n\t      else if (aStr.charAt(index) === ',') {\n\t        index++;\n\t      }\n\t      else {\n\t        mapping = new Mapping();\n\t        mapping.generatedLine = generatedLine;\n\t\n\t        // Because each offset is encoded relative to the previous one,\n\t        // many segments often have the same encoding. We can exploit this\n\t        // fact by caching the parsed variable length fields of each segment,\n\t        // allowing us to avoid a second parse if we encounter the same\n\t        // segment again.\n\t        for (end = index; end < length; end++) {\n\t          if (this._charIsMappingSeparator(aStr, end)) {\n\t            break;\n\t          }\n\t        }\n\t        str = aStr.slice(index, end);\n\t\n\t        segment = cachedSegments[str];\n\t        if (segment) {\n\t          index += str.length;\n\t        } else {\n\t          segment = [];\n\t          while (index < end) {\n\t            base64VLQ.decode(aStr, index, temp);\n\t            value = temp.value;\n\t            index = temp.rest;\n\t            segment.push(value);\n\t          }\n\t\n\t          if (segment.length === 2) {\n\t            throw new Error('Found a source, but no line and column');\n\t          }\n\t\n\t          if (segment.length === 3) {\n\t            throw new Error('Found a source and line, but no column');\n\t          }\n\t\n\t          cachedSegments[str] = segment;\n\t        }\n\t\n\t        // Generated column.\n\t        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n\t        previousGeneratedColumn = mapping.generatedColumn;\n\t\n\t        if (segment.length > 1) {\n\t          // Original source.\n\t          mapping.source = previousSource + segment[1];\n\t          previousSource += segment[1];\n\t\n\t          // Original line.\n\t          mapping.originalLine = previousOriginalLine + segment[2];\n\t          previousOriginalLine = mapping.originalLine;\n\t          // Lines are stored 0-based\n\t          mapping.originalLine += 1;\n\t\n\t          // Original column.\n\t          mapping.originalColumn = previousOriginalColumn + segment[3];\n\t          previousOriginalColumn = mapping.originalColumn;\n\t\n\t          if (segment.length > 4) {\n\t            // Original name.\n\t            mapping.name = previousName + segment[4];\n\t            previousName += segment[4];\n\t          }\n\t        }\n\t\n\t        generatedMappings.push(mapping);\n\t        if (typeof mapping.originalLine === 'number') {\n\t          originalMappings.push(mapping);\n\t        }\n\t      }\n\t    }\n\t\n\t    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n\t    this.__generatedMappings = generatedMappings;\n\t\n\t    quickSort(originalMappings, util.compareByOriginalPositions);\n\t    this.__originalMappings = originalMappings;\n\t  };\n\t\n\t/**\n\t * Find the mapping that best matches the hypothetical \"needle\" mapping that\n\t * we are searching for in the given \"haystack\" of mappings.\n\t */\n\tBasicSourceMapConsumer.prototype._findMapping =\n\t  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n\t                                         aColumnName, aComparator, aBias) {\n\t    // To return the position we are searching for, we must first find the\n\t    // mapping for the given position and then return the opposite position it\n\t    // points to. Because the mappings are sorted, we can use binary search to\n\t    // find the best mapping.\n\t\n\t    if (aNeedle[aLineName] <= 0) {\n\t      throw new TypeError('Line must be greater than or equal to 1, got '\n\t                          + aNeedle[aLineName]);\n\t    }\n\t    if (aNeedle[aColumnName] < 0) {\n\t      throw new TypeError('Column must be greater than or equal to 0, got '\n\t                          + aNeedle[aColumnName]);\n\t    }\n\t\n\t    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n\t  };\n\t\n\t/**\n\t * Compute the last column for each generated mapping. The last column is\n\t * inclusive.\n\t */\n\tBasicSourceMapConsumer.prototype.computeColumnSpans =\n\t  function SourceMapConsumer_computeColumnSpans() {\n\t    for (var index = 0; index < this._generatedMappings.length; ++index) {\n\t      var mapping = this._generatedMappings[index];\n\t\n\t      // Mappings do not contain a field for the last generated columnt. We\n\t      // can come up with an optimistic estimate, however, by assuming that\n\t      // mappings are contiguous (i.e. given two consecutive mappings, the\n\t      // first mapping ends where the second one starts).\n\t      if (index + 1 < this._generatedMappings.length) {\n\t        var nextMapping = this._generatedMappings[index + 1];\n\t\n\t        if (mapping.generatedLine === nextMapping.generatedLine) {\n\t          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n\t          continue;\n\t        }\n\t      }\n\t\n\t      // The last mapping for each line spans the entire line.\n\t      mapping.lastGeneratedColumn = Infinity;\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the original source, line, and column information for the generated\n\t * source's line and column positions provided. The only argument is an object\n\t * with the following properties:\n\t *\n\t *   - line: The line number in the generated source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the generated source.  The column\n\t *     number is 0-based.\n\t *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n\t *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - source: The original source file, or null.\n\t *   - line: The line number in the original source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the original source, or null.  The\n\t *     column number is 0-based.\n\t *   - name: The original identifier, or null.\n\t */\n\tBasicSourceMapConsumer.prototype.originalPositionFor =\n\t  function SourceMapConsumer_originalPositionFor(aArgs) {\n\t    var needle = {\n\t      generatedLine: util.getArg(aArgs, 'line'),\n\t      generatedColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    var index = this._findMapping(\n\t      needle,\n\t      this._generatedMappings,\n\t      \"generatedLine\",\n\t      \"generatedColumn\",\n\t      util.compareByGeneratedPositionsDeflated,\n\t      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n\t    );\n\t\n\t    if (index >= 0) {\n\t      var mapping = this._generatedMappings[index];\n\t\n\t      if (mapping.generatedLine === needle.generatedLine) {\n\t        var source = util.getArg(mapping, 'source', null);\n\t        if (source !== null) {\n\t          source = this._sources.at(source);\n\t          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n\t        }\n\t        var name = util.getArg(mapping, 'name', null);\n\t        if (name !== null) {\n\t          name = this._names.at(name);\n\t        }\n\t        return {\n\t          source: source,\n\t          line: util.getArg(mapping, 'originalLine', null),\n\t          column: util.getArg(mapping, 'originalColumn', null),\n\t          name: name\n\t        };\n\t      }\n\t    }\n\t\n\t    return {\n\t      source: null,\n\t      line: null,\n\t      column: null,\n\t      name: null\n\t    };\n\t  };\n\t\n\t/**\n\t * Return true if we have the source content for every source in the source\n\t * map, false otherwise.\n\t */\n\tBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n\t  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n\t    if (!this.sourcesContent) {\n\t      return false;\n\t    }\n\t    return this.sourcesContent.length >= this._sources.size() &&\n\t      !this.sourcesContent.some(function (sc) { return sc == null; });\n\t  };\n\t\n\t/**\n\t * Returns the original source content. The only argument is the url of the\n\t * original source file. Returns null if no original source content is\n\t * available.\n\t */\n\tBasicSourceMapConsumer.prototype.sourceContentFor =\n\t  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n\t    if (!this.sourcesContent) {\n\t      return null;\n\t    }\n\t\n\t    var index = this._findSourceIndex(aSource);\n\t    if (index >= 0) {\n\t      return this.sourcesContent[index];\n\t    }\n\t\n\t    var relativeSource = aSource;\n\t    if (this.sourceRoot != null) {\n\t      relativeSource = util.relative(this.sourceRoot, relativeSource);\n\t    }\n\t\n\t    var url;\n\t    if (this.sourceRoot != null\n\t        && (url = util.urlParse(this.sourceRoot))) {\n\t      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n\t      // many users. We can help them out when they expect file:// URIs to\n\t      // behave like it would if they were running a local HTTP server. See\n\t      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n\t      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n\t      if (url.scheme == \"file\"\n\t          && this._sources.has(fileUriAbsPath)) {\n\t        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n\t      }\n\t\n\t      if ((!url.path || url.path == \"/\")\n\t          && this._sources.has(\"/\" + relativeSource)) {\n\t        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n\t      }\n\t    }\n\t\n\t    // This function is used recursively from\n\t    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n\t    // don't want to throw if we can't find the source - we just want to\n\t    // return null, so we provide a flag to exit gracefully.\n\t    if (nullOnMissing) {\n\t      return null;\n\t    }\n\t    else {\n\t      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the generated line and column information for the original source,\n\t * line, and column positions provided. The only argument is an object with\n\t * the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the original source.  The column\n\t *     number is 0-based.\n\t *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n\t *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the generated source, or null.\n\t *     The column number is 0-based.\n\t */\n\tBasicSourceMapConsumer.prototype.generatedPositionFor =\n\t  function SourceMapConsumer_generatedPositionFor(aArgs) {\n\t    var source = util.getArg(aArgs, 'source');\n\t    source = this._findSourceIndex(source);\n\t    if (source < 0) {\n\t      return {\n\t        line: null,\n\t        column: null,\n\t        lastColumn: null\n\t      };\n\t    }\n\t\n\t    var needle = {\n\t      source: source,\n\t      originalLine: util.getArg(aArgs, 'line'),\n\t      originalColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    var index = this._findMapping(\n\t      needle,\n\t      this._originalMappings,\n\t      \"originalLine\",\n\t      \"originalColumn\",\n\t      util.compareByOriginalPositions,\n\t      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n\t    );\n\t\n\t    if (index >= 0) {\n\t      var mapping = this._originalMappings[index];\n\t\n\t      if (mapping.source === needle.source) {\n\t        return {\n\t          line: util.getArg(mapping, 'generatedLine', null),\n\t          column: util.getArg(mapping, 'generatedColumn', null),\n\t          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n\t        };\n\t      }\n\t    }\n\t\n\t    return {\n\t      line: null,\n\t      column: null,\n\t      lastColumn: null\n\t    };\n\t  };\n\t\n\texports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\t\n\t/**\n\t * An IndexedSourceMapConsumer instance represents a parsed source map which\n\t * we can query for information. It differs from BasicSourceMapConsumer in\n\t * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n\t * input.\n\t *\n\t * The first parameter is a raw source map (either as a JSON string, or already\n\t * parsed to an object). According to the spec for indexed source maps, they\n\t * have the following attributes:\n\t *\n\t *   - version: Which version of the source map spec this map is following.\n\t *   - file: Optional. The generated file this source map is associated with.\n\t *   - sections: A list of section definitions.\n\t *\n\t * Each value under the \"sections\" field has two fields:\n\t *   - offset: The offset into the original specified at which this section\n\t *       begins to apply, defined as an object with a \"line\" and \"column\"\n\t *       field.\n\t *   - map: A source map definition. This source map could also be indexed,\n\t *       but doesn't have to be.\n\t *\n\t * Instead of the \"map\" field, it's also possible to have a \"url\" field\n\t * specifying a URL to retrieve a source map from, but that's currently\n\t * unsupported.\n\t *\n\t * Here's an example source map, taken from the source map spec[0], but\n\t * modified to omit a section which uses the \"url\" field.\n\t *\n\t *  {\n\t *    version : 3,\n\t *    file: \"app.js\",\n\t *    sections: [{\n\t *      offset: {line:100, column:10},\n\t *      map: {\n\t *        version : 3,\n\t *        file: \"section.js\",\n\t *        sources: [\"foo.js\", \"bar.js\"],\n\t *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n\t *        mappings: \"AAAA,E;;ABCDE;\"\n\t *      }\n\t *    }],\n\t *  }\n\t *\n\t * The second parameter, if given, is a string whose value is the URL\n\t * at which the source map was found.  This URL is used to compute the\n\t * sources array.\n\t *\n\t * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n\t */\n\tfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n\t  var sourceMap = aSourceMap;\n\t  if (typeof aSourceMap === 'string') {\n\t    sourceMap = util.parseSourceMapInput(aSourceMap);\n\t  }\n\t\n\t  var version = util.getArg(sourceMap, 'version');\n\t  var sections = util.getArg(sourceMap, 'sections');\n\t\n\t  if (version != this._version) {\n\t    throw new Error('Unsupported version: ' + version);\n\t  }\n\t\n\t  this._sources = new ArraySet();\n\t  this._names = new ArraySet();\n\t\n\t  var lastOffset = {\n\t    line: -1,\n\t    column: 0\n\t  };\n\t  this._sections = sections.map(function (s) {\n\t    if (s.url) {\n\t      // The url field will require support for asynchronicity.\n\t      // See https://github.com/mozilla/source-map/issues/16\n\t      throw new Error('Support for url field in sections not implemented.');\n\t    }\n\t    var offset = util.getArg(s, 'offset');\n\t    var offsetLine = util.getArg(offset, 'line');\n\t    var offsetColumn = util.getArg(offset, 'column');\n\t\n\t    if (offsetLine < lastOffset.line ||\n\t        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n\t      throw new Error('Section offsets must be ordered and non-overlapping.');\n\t    }\n\t    lastOffset = offset;\n\t\n\t    return {\n\t      generatedOffset: {\n\t        // The offset fields are 0-based, but we use 1-based indices when\n\t        // encoding/decoding from VLQ.\n\t        generatedLine: offsetLine + 1,\n\t        generatedColumn: offsetColumn + 1\n\t      },\n\t      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n\t    }\n\t  });\n\t}\n\t\n\tIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\n\tIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\t\n\t/**\n\t * The version of the source mapping spec that we are consuming.\n\t */\n\tIndexedSourceMapConsumer.prototype._version = 3;\n\t\n\t/**\n\t * The list of original sources.\n\t */\n\tObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n\t  get: function () {\n\t    var sources = [];\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n\t        sources.push(this._sections[i].consumer.sources[j]);\n\t      }\n\t    }\n\t    return sources;\n\t  }\n\t});\n\t\n\t/**\n\t * Returns the original source, line, and column information for the generated\n\t * source's line and column positions provided. The only argument is an object\n\t * with the following properties:\n\t *\n\t *   - line: The line number in the generated source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the generated source.  The column\n\t *     number is 0-based.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - source: The original source file, or null.\n\t *   - line: The line number in the original source, or null.  The\n\t *     line number is 1-based.\n\t *   - column: The column number in the original source, or null.  The\n\t *     column number is 0-based.\n\t *   - name: The original identifier, or null.\n\t */\n\tIndexedSourceMapConsumer.prototype.originalPositionFor =\n\t  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n\t    var needle = {\n\t      generatedLine: util.getArg(aArgs, 'line'),\n\t      generatedColumn: util.getArg(aArgs, 'column')\n\t    };\n\t\n\t    // Find the section containing the generated position we're trying to map\n\t    // to an original position.\n\t    var sectionIndex = binarySearch.search(needle, this._sections,\n\t      function(needle, section) {\n\t        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n\t        if (cmp) {\n\t          return cmp;\n\t        }\n\t\n\t        return (needle.generatedColumn -\n\t                section.generatedOffset.generatedColumn);\n\t      });\n\t    var section = this._sections[sectionIndex];\n\t\n\t    if (!section) {\n\t      return {\n\t        source: null,\n\t        line: null,\n\t        column: null,\n\t        name: null\n\t      };\n\t    }\n\t\n\t    return section.consumer.originalPositionFor({\n\t      line: needle.generatedLine -\n\t        (section.generatedOffset.generatedLine - 1),\n\t      column: needle.generatedColumn -\n\t        (section.generatedOffset.generatedLine === needle.generatedLine\n\t         ? section.generatedOffset.generatedColumn - 1\n\t         : 0),\n\t      bias: aArgs.bias\n\t    });\n\t  };\n\t\n\t/**\n\t * Return true if we have the source content for every source in the source\n\t * map, false otherwise.\n\t */\n\tIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n\t  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n\t    return this._sections.every(function (s) {\n\t      return s.consumer.hasContentsOfAllSources();\n\t    });\n\t  };\n\t\n\t/**\n\t * Returns the original source content. The only argument is the url of the\n\t * original source file. Returns null if no original source content is\n\t * available.\n\t */\n\tIndexedSourceMapConsumer.prototype.sourceContentFor =\n\t  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t\n\t      var content = section.consumer.sourceContentFor(aSource, true);\n\t      if (content) {\n\t        return content;\n\t      }\n\t    }\n\t    if (nullOnMissing) {\n\t      return null;\n\t    }\n\t    else {\n\t      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n\t    }\n\t  };\n\t\n\t/**\n\t * Returns the generated line and column information for the original source,\n\t * line, and column positions provided. The only argument is an object with\n\t * the following properties:\n\t *\n\t *   - source: The filename of the original source.\n\t *   - line: The line number in the original source.  The line number\n\t *     is 1-based.\n\t *   - column: The column number in the original source.  The column\n\t *     number is 0-based.\n\t *\n\t * and an object is returned with the following properties:\n\t *\n\t *   - line: The line number in the generated source, or null.  The\n\t *     line number is 1-based. \n\t *   - column: The column number in the generated source, or null.\n\t *     The column number is 0-based.\n\t */\n\tIndexedSourceMapConsumer.prototype.generatedPositionFor =\n\t  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t\n\t      // Only consider this section if the requested source is in the list of\n\t      // sources of the consumer.\n\t      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n\t        continue;\n\t      }\n\t      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n\t      if (generatedPosition) {\n\t        var ret = {\n\t          line: generatedPosition.line +\n\t            (section.generatedOffset.generatedLine - 1),\n\t          column: generatedPosition.column +\n\t            (section.generatedOffset.generatedLine === generatedPosition.line\n\t             ? section.generatedOffset.generatedColumn - 1\n\t             : 0)\n\t        };\n\t        return ret;\n\t      }\n\t    }\n\t\n\t    return {\n\t      line: null,\n\t      column: null\n\t    };\n\t  };\n\t\n\t/**\n\t * Parse the mappings in a string in to a data structure which we can easily\n\t * query (the ordered arrays in the `this.__generatedMappings` and\n\t * `this.__originalMappings` properties).\n\t */\n\tIndexedSourceMapConsumer.prototype._parseMappings =\n\t  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n\t    this.__generatedMappings = [];\n\t    this.__originalMappings = [];\n\t    for (var i = 0; i < this._sections.length; i++) {\n\t      var section = this._sections[i];\n\t      var sectionMappings = section.consumer._generatedMappings;\n\t      for (var j = 0; j < sectionMappings.length; j++) {\n\t        var mapping = sectionMappings[j];\n\t\n\t        var source = section.consumer._sources.at(mapping.source);\n\t        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n\t        this._sources.add(source);\n\t        source = this._sources.indexOf(source);\n\t\n\t        var name = null;\n\t        if (mapping.name) {\n\t          name = section.consumer._names.at(mapping.name);\n\t          this._names.add(name);\n\t          name = this._names.indexOf(name);\n\t        }\n\t\n\t        // The mappings coming from the consumer for the section have\n\t        // generated positions relative to the start of the section, so we\n\t        // need to offset them to be relative to the start of the concatenated\n\t        // generated file.\n\t        var adjustedMapping = {\n\t          source: source,\n\t          generatedLine: mapping.generatedLine +\n\t            (section.generatedOffset.generatedLine - 1),\n\t          generatedColumn: mapping.generatedColumn +\n\t            (section.generatedOffset.generatedLine === mapping.generatedLine\n\t            ? section.generatedOffset.generatedColumn - 1\n\t            : 0),\n\t          originalLine: mapping.originalLine,\n\t          originalColumn: mapping.originalColumn,\n\t          name: name\n\t        };\n\t\n\t        this.__generatedMappings.push(adjustedMapping);\n\t        if (typeof adjustedMapping.originalLine === 'number') {\n\t          this.__originalMappings.push(adjustedMapping);\n\t        }\n\t      }\n\t    }\n\t\n\t    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n\t    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n\t  };\n\t\n\texports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n/***/ }),\n/* 8 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\texports.GREATEST_LOWER_BOUND = 1;\n\texports.LEAST_UPPER_BOUND = 2;\n\t\n\t/**\n\t * Recursive implementation of binary search.\n\t *\n\t * @param aLow Indices here and lower do not contain the needle.\n\t * @param aHigh Indices here and higher do not contain the needle.\n\t * @param aNeedle The element being searched for.\n\t * @param aHaystack The non-empty array being searched.\n\t * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n\t * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n\t *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t */\n\tfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n\t  // This function terminates when one of the following is true:\n\t  //\n\t  //   1. We find the exact element we are looking for.\n\t  //\n\t  //   2. We did not find the exact element, but we can return the index of\n\t  //      the next-closest element.\n\t  //\n\t  //   3. We did not find the exact element, and there is no next-closest\n\t  //      element than the one we are searching for, so we return -1.\n\t  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n\t  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n\t  if (cmp === 0) {\n\t    // Found the element we are looking for.\n\t    return mid;\n\t  }\n\t  else if (cmp > 0) {\n\t    // Our needle is greater than aHaystack[mid].\n\t    if (aHigh - mid > 1) {\n\t      // The element is in the upper half.\n\t      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n\t    }\n\t\n\t    // The exact needle element was not found in this haystack. Determine if\n\t    // we are in termination case (3) or (2) and return the appropriate thing.\n\t    if (aBias == exports.LEAST_UPPER_BOUND) {\n\t      return aHigh < aHaystack.length ? aHigh : -1;\n\t    } else {\n\t      return mid;\n\t    }\n\t  }\n\t  else {\n\t    // Our needle is less than aHaystack[mid].\n\t    if (mid - aLow > 1) {\n\t      // The element is in the lower half.\n\t      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n\t    }\n\t\n\t    // we are in termination case (3) or (2) and return the appropriate thing.\n\t    if (aBias == exports.LEAST_UPPER_BOUND) {\n\t      return mid;\n\t    } else {\n\t      return aLow < 0 ? -1 : aLow;\n\t    }\n\t  }\n\t}\n\t\n\t/**\n\t * This is an implementation of binary search which will always try and return\n\t * the index of the closest element if there is no exact hit. This is because\n\t * mappings between original and generated line/col pairs are single points,\n\t * and there is an implicit region between each of them, so a miss just means\n\t * that you aren't on the very start of a region.\n\t *\n\t * @param aNeedle The element you are looking for.\n\t * @param aHaystack The array that is being searched.\n\t * @param aCompare A function which takes the needle and an element in the\n\t *     array and returns -1, 0, or 1 depending on whether the needle is less\n\t *     than, equal to, or greater than the element, respectively.\n\t * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n\t *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n\t *     closest element that is smaller than or greater than the one we are\n\t *     searching for, respectively, if the exact element cannot be found.\n\t *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n\t */\n\texports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n\t  if (aHaystack.length === 0) {\n\t    return -1;\n\t  }\n\t\n\t  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n\t                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n\t  if (index < 0) {\n\t    return -1;\n\t  }\n\t\n\t  // We have found either the exact element, or the next-closest element than\n\t  // the one we are searching for. However, there may be more than one such\n\t  // element. Make sure we always return the smallest of these.\n\t  while (index - 1 >= 0) {\n\t    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n\t      break;\n\t    }\n\t    --index;\n\t  }\n\t\n\t  return index;\n\t};\n\n\n/***/ }),\n/* 9 */\n/***/ (function(module, exports) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\t// It turns out that some (most?) JavaScript engines don't self-host\n\t// `Array.prototype.sort`. This makes sense because C++ will likely remain\n\t// faster than JS when doing raw CPU-intensive sorting. However, when using a\n\t// custom comparator function, calling back and forth between the VM's C++ and\n\t// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n\t// worse generated code for the comparator function than would be optimal. In\n\t// fact, when sorting with a comparator, these costs outweigh the benefits of\n\t// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n\t// a ~3500ms mean speed-up in `bench/bench.html`.\n\t\n\t/**\n\t * Swap the elements indexed by `x` and `y` in the array `ary`.\n\t *\n\t * @param {Array} ary\n\t *        The array.\n\t * @param {Number} x\n\t *        The index of the first item.\n\t * @param {Number} y\n\t *        The index of the second item.\n\t */\n\tfunction swap(ary, x, y) {\n\t  var temp = ary[x];\n\t  ary[x] = ary[y];\n\t  ary[y] = temp;\n\t}\n\t\n\t/**\n\t * Returns a random integer within the range `low .. high` inclusive.\n\t *\n\t * @param {Number} low\n\t *        The lower bound on the range.\n\t * @param {Number} high\n\t *        The upper bound on the range.\n\t */\n\tfunction randomIntInRange(low, high) {\n\t  return Math.round(low + (Math.random() * (high - low)));\n\t}\n\t\n\t/**\n\t * The Quick Sort algorithm.\n\t *\n\t * @param {Array} ary\n\t *        An array to sort.\n\t * @param {function} comparator\n\t *        Function to use to compare two items.\n\t * @param {Number} p\n\t *        Start index of the array\n\t * @param {Number} r\n\t *        End index of the array\n\t */\n\tfunction doQuickSort(ary, comparator, p, r) {\n\t  // If our lower bound is less than our upper bound, we (1) partition the\n\t  // array into two pieces and (2) recurse on each half. If it is not, this is\n\t  // the empty array and our base case.\n\t\n\t  if (p < r) {\n\t    // (1) Partitioning.\n\t    //\n\t    // The partitioning chooses a pivot between `p` and `r` and moves all\n\t    // elements that are less than or equal to the pivot to the before it, and\n\t    // all the elements that are greater than it after it. The effect is that\n\t    // once partition is done, the pivot is in the exact place it will be when\n\t    // the array is put in sorted order, and it will not need to be moved\n\t    // again. This runs in O(n) time.\n\t\n\t    // Always choose a random pivot so that an input array which is reverse\n\t    // sorted does not cause O(n^2) running time.\n\t    var pivotIndex = randomIntInRange(p, r);\n\t    var i = p - 1;\n\t\n\t    swap(ary, pivotIndex, r);\n\t    var pivot = ary[r];\n\t\n\t    // Immediately after `j` is incremented in this loop, the following hold\n\t    // true:\n\t    //\n\t    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n\t    //\n\t    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n\t    for (var j = p; j < r; j++) {\n\t      if (comparator(ary[j], pivot) <= 0) {\n\t        i += 1;\n\t        swap(ary, i, j);\n\t      }\n\t    }\n\t\n\t    swap(ary, i + 1, j);\n\t    var q = i + 1;\n\t\n\t    // (2) Recurse on each half.\n\t\n\t    doQuickSort(ary, comparator, p, q - 1);\n\t    doQuickSort(ary, comparator, q + 1, r);\n\t  }\n\t}\n\t\n\t/**\n\t * Sort the given array in-place with the given comparator function.\n\t *\n\t * @param {Array} ary\n\t *        An array to sort.\n\t * @param {function} comparator\n\t *        Function to use to compare two items.\n\t */\n\texports.quickSort = function (ary, comparator) {\n\t  doQuickSort(ary, comparator, 0, ary.length - 1);\n\t};\n\n\n/***/ }),\n/* 10 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\t/* -*- Mode: js; js-indent-level: 2; -*- */\n\t/*\n\t * Copyright 2011 Mozilla Foundation and contributors\n\t * Licensed under the New BSD license. See LICENSE or:\n\t * http://opensource.org/licenses/BSD-3-Clause\n\t */\n\t\n\tvar SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;\n\tvar util = __webpack_require__(4);\n\t\n\t// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n\t// operating systems these days (capturing the result).\n\tvar REGEX_NEWLINE = /(\\r?\\n)/;\n\t\n\t// Newline character code for charCodeAt() comparisons\n\tvar NEWLINE_CODE = 10;\n\t\n\t// Private symbol for identifying `SourceNode`s when multiple versions of\n\t// the source-map library are loaded. This MUST NOT CHANGE across\n\t// versions!\n\tvar isSourceNode = \"$$$isSourceNode$$$\";\n\t\n\t/**\n\t * SourceNodes provide a way to abstract over interpolating/concatenating\n\t * snippets of generated JavaScript source code while maintaining the line and\n\t * column information associated with the original source code.\n\t *\n\t * @param aLine The original line number.\n\t * @param aColumn The original column number.\n\t * @param aSource The original source's filename.\n\t * @param aChunks Optional. An array of strings which are snippets of\n\t *        generated JS, or other SourceNodes.\n\t * @param aName The original identifier.\n\t */\n\tfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n\t  this.children = [];\n\t  this.sourceContents = {};\n\t  this.line = aLine == null ? null : aLine;\n\t  this.column = aColumn == null ? null : aColumn;\n\t  this.source = aSource == null ? null : aSource;\n\t  this.name = aName == null ? null : aName;\n\t  this[isSourceNode] = true;\n\t  if (aChunks != null) this.add(aChunks);\n\t}\n\t\n\t/**\n\t * Creates a SourceNode from generated code and a SourceMapConsumer.\n\t *\n\t * @param aGeneratedCode The generated code\n\t * @param aSourceMapConsumer The SourceMap for the generated code\n\t * @param aRelativePath Optional. The path that relative sources in the\n\t *        SourceMapConsumer should be relative to.\n\t */\n\tSourceNode.fromStringWithSourceMap =\n\t  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n\t    // The SourceNode we want to fill with the generated code\n\t    // and the SourceMap\n\t    var node = new SourceNode();\n\t\n\t    // All even indices of this array are one line of the generated code,\n\t    // while all odd indices are the newlines between two adjacent lines\n\t    // (since `REGEX_NEWLINE` captures its match).\n\t    // Processed fragments are accessed by calling `shiftNextLine`.\n\t    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n\t    var remainingLinesIndex = 0;\n\t    var shiftNextLine = function() {\n\t      var lineContents = getNextLine();\n\t      // The last line of a file might not have a newline.\n\t      var newLine = getNextLine() || \"\";\n\t      return lineContents + newLine;\n\t\n\t      function getNextLine() {\n\t        return remainingLinesIndex < remainingLines.length ?\n\t            remainingLines[remainingLinesIndex++] : undefined;\n\t      }\n\t    };\n\t\n\t    // We need to remember the position of \"remainingLines\"\n\t    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\t\n\t    // The generate SourceNodes we need a code range.\n\t    // To extract it current and last mapping is used.\n\t    // Here we store the last mapping.\n\t    var lastMapping = null;\n\t\n\t    aSourceMapConsumer.eachMapping(function (mapping) {\n\t      if (lastMapping !== null) {\n\t        // We add the code from \"lastMapping\" to \"mapping\":\n\t        // First check if there is a new line in between.\n\t        if (lastGeneratedLine < mapping.generatedLine) {\n\t          // Associate first line with \"lastMapping\"\n\t          addMappingWithCode(lastMapping, shiftNextLine());\n\t          lastGeneratedLine++;\n\t          lastGeneratedColumn = 0;\n\t          // The remaining code is added without mapping\n\t        } else {\n\t          // There is no new line in between.\n\t          // Associate the code between \"lastGeneratedColumn\" and\n\t          // \"mapping.generatedColumn\" with \"lastMapping\"\n\t          var nextLine = remainingLines[remainingLinesIndex] || '';\n\t          var code = nextLine.substr(0, mapping.generatedColumn -\n\t                                        lastGeneratedColumn);\n\t          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n\t                                              lastGeneratedColumn);\n\t          lastGeneratedColumn = mapping.generatedColumn;\n\t          addMappingWithCode(lastMapping, code);\n\t          // No more remaining code, continue\n\t          lastMapping = mapping;\n\t          return;\n\t        }\n\t      }\n\t      // We add the generated code until the first mapping\n\t      // to the SourceNode without any mapping.\n\t      // Each line is added as separate string.\n\t      while (lastGeneratedLine < mapping.generatedLine) {\n\t        node.add(shiftNextLine());\n\t        lastGeneratedLine++;\n\t      }\n\t      if (lastGeneratedColumn < mapping.generatedColumn) {\n\t        var nextLine = remainingLines[remainingLinesIndex] || '';\n\t        node.add(nextLine.substr(0, mapping.generatedColumn));\n\t        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n\t        lastGeneratedColumn = mapping.generatedColumn;\n\t      }\n\t      lastMapping = mapping;\n\t    }, this);\n\t    // We have processed all mappings.\n\t    if (remainingLinesIndex < remainingLines.length) {\n\t      if (lastMapping) {\n\t        // Associate the remaining code in the current line with \"lastMapping\"\n\t        addMappingWithCode(lastMapping, shiftNextLine());\n\t      }\n\t      // and add the remaining lines without any mapping\n\t      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n\t    }\n\t\n\t    // Copy sourcesContent into SourceNode\n\t    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n\t      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n\t      if (content != null) {\n\t        if (aRelativePath != null) {\n\t          sourceFile = util.join(aRelativePath, sourceFile);\n\t        }\n\t        node.setSourceContent(sourceFile, content);\n\t      }\n\t    });\n\t\n\t    return node;\n\t\n\t    function addMappingWithCode(mapping, code) {\n\t      if (mapping === null || mapping.source === undefined) {\n\t        node.add(code);\n\t      } else {\n\t        var source = aRelativePath\n\t          ? util.join(aRelativePath, mapping.source)\n\t          : mapping.source;\n\t        node.add(new SourceNode(mapping.originalLine,\n\t                                mapping.originalColumn,\n\t                                source,\n\t                                code,\n\t                                mapping.name));\n\t      }\n\t    }\n\t  };\n\t\n\t/**\n\t * Add a chunk of generated JS to this source node.\n\t *\n\t * @param aChunk A string snippet of generated JS code, another instance of\n\t *        SourceNode, or an array where each member is one of those things.\n\t */\n\tSourceNode.prototype.add = function SourceNode_add(aChunk) {\n\t  if (Array.isArray(aChunk)) {\n\t    aChunk.forEach(function (chunk) {\n\t      this.add(chunk);\n\t    }, this);\n\t  }\n\t  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n\t    if (aChunk) {\n\t      this.children.push(aChunk);\n\t    }\n\t  }\n\t  else {\n\t    throw new TypeError(\n\t      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n\t    );\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Add a chunk of generated JS to the beginning of this source node.\n\t *\n\t * @param aChunk A string snippet of generated JS code, another instance of\n\t *        SourceNode, or an array where each member is one of those things.\n\t */\n\tSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n\t  if (Array.isArray(aChunk)) {\n\t    for (var i = aChunk.length-1; i >= 0; i--) {\n\t      this.prepend(aChunk[i]);\n\t    }\n\t  }\n\t  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n\t    this.children.unshift(aChunk);\n\t  }\n\t  else {\n\t    throw new TypeError(\n\t      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n\t    );\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Walk over the tree of JS snippets in this node and its children. The\n\t * walking function is called once for each snippet of JS and is passed that\n\t * snippet and the its original associated source's line/column location.\n\t *\n\t * @param aFn The traversal function.\n\t */\n\tSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n\t  var chunk;\n\t  for (var i = 0, len = this.children.length; i < len; i++) {\n\t    chunk = this.children[i];\n\t    if (chunk[isSourceNode]) {\n\t      chunk.walk(aFn);\n\t    }\n\t    else {\n\t      if (chunk !== '') {\n\t        aFn(chunk, { source: this.source,\n\t                     line: this.line,\n\t                     column: this.column,\n\t                     name: this.name });\n\t      }\n\t    }\n\t  }\n\t};\n\t\n\t/**\n\t * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n\t * each of `this.children`.\n\t *\n\t * @param aSep The separator.\n\t */\n\tSourceNode.prototype.join = function SourceNode_join(aSep) {\n\t  var newChildren;\n\t  var i;\n\t  var len = this.children.length;\n\t  if (len > 0) {\n\t    newChildren = [];\n\t    for (i = 0; i < len-1; i++) {\n\t      newChildren.push(this.children[i]);\n\t      newChildren.push(aSep);\n\t    }\n\t    newChildren.push(this.children[i]);\n\t    this.children = newChildren;\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Call String.prototype.replace on the very right-most source snippet. Useful\n\t * for trimming whitespace from the end of a source node, etc.\n\t *\n\t * @param aPattern The pattern to replace.\n\t * @param aReplacement The thing to replace the pattern with.\n\t */\n\tSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n\t  var lastChild = this.children[this.children.length - 1];\n\t  if (lastChild[isSourceNode]) {\n\t    lastChild.replaceRight(aPattern, aReplacement);\n\t  }\n\t  else if (typeof lastChild === 'string') {\n\t    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n\t  }\n\t  else {\n\t    this.children.push(''.replace(aPattern, aReplacement));\n\t  }\n\t  return this;\n\t};\n\t\n\t/**\n\t * Set the source content for a source file. This will be added to the SourceMapGenerator\n\t * in the sourcesContent field.\n\t *\n\t * @param aSourceFile The filename of the source file\n\t * @param aSourceContent The content of the source file\n\t */\n\tSourceNode.prototype.setSourceContent =\n\t  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n\t    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n\t  };\n\t\n\t/**\n\t * Walk over the tree of SourceNodes. The walking function is called for each\n\t * source file content and is passed the filename and source content.\n\t *\n\t * @param aFn The traversal function.\n\t */\n\tSourceNode.prototype.walkSourceContents =\n\t  function SourceNode_walkSourceContents(aFn) {\n\t    for (var i = 0, len = this.children.length; i < len; i++) {\n\t      if (this.children[i][isSourceNode]) {\n\t        this.children[i].walkSourceContents(aFn);\n\t      }\n\t    }\n\t\n\t    var sources = Object.keys(this.sourceContents);\n\t    for (var i = 0, len = sources.length; i < len; i++) {\n\t      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n\t    }\n\t  };\n\t\n\t/**\n\t * Return the string representation of this source node. Walks over the tree\n\t * and concatenates all the various snippets together to one string.\n\t */\n\tSourceNode.prototype.toString = function SourceNode_toString() {\n\t  var str = \"\";\n\t  this.walk(function (chunk) {\n\t    str += chunk;\n\t  });\n\t  return str;\n\t};\n\t\n\t/**\n\t * Returns the string representation of this source node along with a source\n\t * map.\n\t */\n\tSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n\t  var generated = {\n\t    code: \"\",\n\t    line: 1,\n\t    column: 0\n\t  };\n\t  var map = new SourceMapGenerator(aArgs);\n\t  var sourceMappingActive = false;\n\t  var lastOriginalSource = null;\n\t  var lastOriginalLine = null;\n\t  var lastOriginalColumn = null;\n\t  var lastOriginalName = null;\n\t  this.walk(function (chunk, original) {\n\t    generated.code += chunk;\n\t    if (original.source !== null\n\t        && original.line !== null\n\t        && original.column !== null) {\n\t      if(lastOriginalSource !== original.source\n\t         || lastOriginalLine !== original.line\n\t         || lastOriginalColumn !== original.column\n\t         || lastOriginalName !== original.name) {\n\t        map.addMapping({\n\t          source: original.source,\n\t          original: {\n\t            line: original.line,\n\t            column: original.column\n\t          },\n\t          generated: {\n\t            line: generated.line,\n\t            column: generated.column\n\t          },\n\t          name: original.name\n\t        });\n\t      }\n\t      lastOriginalSource = original.source;\n\t      lastOriginalLine = original.line;\n\t      lastOriginalColumn = original.column;\n\t      lastOriginalName = original.name;\n\t      sourceMappingActive = true;\n\t    } else if (sourceMappingActive) {\n\t      map.addMapping({\n\t        generated: {\n\t          line: generated.line,\n\t          column: generated.column\n\t        }\n\t      });\n\t      lastOriginalSource = null;\n\t      sourceMappingActive = false;\n\t    }\n\t    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n\t      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n\t        generated.line++;\n\t        generated.column = 0;\n\t        // Mappings end at eol\n\t        if (idx + 1 === length) {\n\t          lastOriginalSource = null;\n\t          sourceMappingActive = false;\n\t        } else if (sourceMappingActive) {\n\t          map.addMapping({\n\t            source: original.source,\n\t            original: {\n\t              line: original.line,\n\t              column: original.column\n\t            },\n\t            generated: {\n\t              line: generated.line,\n\t              column: generated.column\n\t            },\n\t            name: original.name\n\t          });\n\t        }\n\t      } else {\n\t        generated.column++;\n\t      }\n\t    }\n\t  });\n\t  this.walkSourceContents(function (sourceFile, sourceContent) {\n\t    map.setSourceContent(sourceFile, sourceContent);\n\t  });\n\t\n\t  return { code: generated.code, map: map };\n\t};\n\t\n\texports.SourceNode = SourceNode;\n\n\n/***/ })\n/******/ ])\n});\n;\n\n\n// WEBPACK FOOTER //\n// source-map.min.js"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId])\n \t\t\treturn installedModules[moduleId].exports;\n\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\texports: {},\n \t\t\tid: moduleId,\n \t\t\tloaded: false\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.loaded = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(0);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 0fd5815da764db5fb9fe","/*\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 */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./source-map.js\n// module id = 0\n// module chunks = 0","/* -*- 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\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar 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 */\nfunction 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\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\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(sourceRoot, newMapping.source);\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 */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\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 */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\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 */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\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\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 */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\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 (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\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 (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\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 */\nSourceMapGenerator.prototype._serializeMappings =\n  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      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\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(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\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\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\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(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  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(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-generator.js\n// module id = 1\n// module chunks = 0","/* -*- 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\nvar 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\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar 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 */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (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 */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.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 */\nexports.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(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\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\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/base64-vlq.js\n// module id = 2\n// module chunks = 0","/* -*- 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\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.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 */\nexports.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//////////////////\n// WEBPACK FOOTER\n// ./lib/base64.js\n// module id = 3\n// module chunks = 0","/* -*- 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 */\nfunction 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}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction 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}\nexports.urlParse = urlParse;\n\nfunction 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}\nexports.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 '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction 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}\nexports.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 */\nfunction 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 = 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}\nexports.join = join;\n\nexports.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 */\nfunction 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}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction 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 */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction 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 (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    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 */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\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}\nexports.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 */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\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}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction 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 */\nfunction 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}\nexports.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 */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.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 */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\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}\nexports.computeSourceURL = computeSourceURL;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/util.js\n// module id = 4\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar 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 */\nfunction 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 */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\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 */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : 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 */\nArraySet.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 */\nArraySet.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 */\nArraySet.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 */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/array-set.js\n// module id = 5\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction 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 lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\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 */\nfunction 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 */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.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 */\nMappingList.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\nexports.MappingList = MappingList;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/mapping-list.js\n// module id = 6\n// module chunks = 0","/* -*- 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\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction 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\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.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\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\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\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\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\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\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 */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.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 */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\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.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).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 */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\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(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\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 (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\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\nexports.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 */\nfunction 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 && util.isAbsolute(sourceRoot) && 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\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.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 */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\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 */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.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 */\nfunction 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 */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\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      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\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(generatedMappings, util.compareByGeneratedPositionsDeflated);\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 */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\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('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\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 */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  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 */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\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(this.sourceRoot, source, this._sourceMapURL);\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 */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\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 */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\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 (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\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\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\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    }\n    else {\n      throw new Error('\"' + relativeSource + '\" 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 *   - 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 */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\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\nexports.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 */\nfunction 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('Support for url field in sections not implemented.');\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 (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\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(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\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 */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\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(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\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: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: 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 */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  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 */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\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    }\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 */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\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 (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === 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 */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\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(section.consumer.sourceRoot, source, this._sourceMapURL);\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: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === 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(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-map-consumer.js\n// module id = 7\n// module chunks = 0","/* -*- 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\nexports.GREATEST_LOWER_BOUND = 1;\nexports.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 */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\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  }\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(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\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  }\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(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\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 */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\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//////////////////\n// WEBPACK FOOTER\n// ./lib/binary-search.js\n// module id = 8\n// module chunks = 0","/* -*- 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 */\nfunction 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 */\nfunction 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 */\nfunction 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 */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/quick-sort.js\n// module id = 9\n// module chunks = 0","/* -*- 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\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar 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).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar 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!\nvar 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 */\nfunction 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 */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\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++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, 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(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\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(mapping.generatedColumn);\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(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\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 */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + 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 */\nSourceNode.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  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + 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 */\nSourceNode.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    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\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 */\nSourceNode.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 */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, 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 */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\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 */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\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(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\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 */\nSourceNode.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 */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\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 (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\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\nexports.SourceNode = SourceNode;\n\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./lib/source-node.js\n// module id = 10\n// module chunks = 0"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/recast/node_modules/source-map/lib/array-set.js b/node_modules/recast/node_modules/source-map/lib/array-set.js
new file mode 100644
index 0000000..fbd5c81
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/array-set.js
@@ -0,0 +1,121 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+var has = Object.prototype.hasOwnProperty;
+var hasNativeMap = typeof Map !== "undefined";
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+function ArraySet() {
+  this._array = [];
+  this._set = hasNativeMap ? new Map() : Object.create(null);
+}
+
+/**
+ * Static method for creating ArraySet instances from an existing array.
+ */
+ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+  var set = new ArraySet();
+  for (var i = 0, len = aArray.length; i < len; i++) {
+    set.add(aArray[i], aAllowDuplicates);
+  }
+  return set;
+};
+
+/**
+ * Return how many unique items are in this ArraySet. If duplicates have been
+ * added, than those do not count towards the size.
+ *
+ * @returns Number
+ */
+ArraySet.prototype.size = function ArraySet_size() {
+  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+};
+
+/**
+ * Add the given string to this set.
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+  var idx = this._array.length;
+  if (!isDuplicate || aAllowDuplicates) {
+    this._array.push(aStr);
+  }
+  if (!isDuplicate) {
+    if (hasNativeMap) {
+      this._set.set(aStr, idx);
+    } else {
+      this._set[sStr] = idx;
+    }
+  }
+};
+
+/**
+ * Is the given string a member of this set?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.has = function ArraySet_has(aStr) {
+  if (hasNativeMap) {
+    return this._set.has(aStr);
+  } else {
+    var sStr = util.toSetString(aStr);
+    return has.call(this._set, sStr);
+  }
+};
+
+/**
+ * What is the index of the given string in the array?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+  if (hasNativeMap) {
+    var idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+  } else {
+    var sStr = util.toSetString(aStr);
+    if (has.call(this._set, sStr)) {
+      return this._set[sStr];
+    }
+  }
+
+  throw new Error('"' + aStr + '" is not in the set.');
+};
+
+/**
+ * What is the element at the given index?
+ *
+ * @param Number aIdx
+ */
+ArraySet.prototype.at = function ArraySet_at(aIdx) {
+  if (aIdx >= 0 && aIdx < this._array.length) {
+    return this._array[aIdx];
+  }
+  throw new Error('No element indexed by ' + aIdx);
+};
+
+/**
+ * Returns the array representation of this set (which has the proper indices
+ * indicated by indexOf). Note that this is a copy of the internal array used
+ * for storing the members so that no one can mess with internal state.
+ */
+ArraySet.prototype.toArray = function ArraySet_toArray() {
+  return this._array.slice();
+};
+
+exports.ArraySet = ArraySet;
diff --git a/node_modules/recast/node_modules/source-map/lib/base64-vlq.js b/node_modules/recast/node_modules/source-map/lib/base64-vlq.js
new file mode 100644
index 0000000..612b404
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/base64-vlq.js
@@ -0,0 +1,140 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+var base64 = require('./base64');
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+var VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+function fromVLQSigned(aValue) {
+  var isNegative = (aValue & 1) === 1;
+  var shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  var encoded = "";
+  var digit;
+
+  var vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+/**
+ * Decodes the next base 64 VLQ value from the given string and returns the
+ * value and the rest of the string via the out parameter.
+ */
+exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+  var strLen = aStr.length;
+  var result = 0;
+  var shift = 0;
+  var continuation, digit;
+
+  do {
+    if (aIndex >= strLen) {
+      throw new Error("Expected more digits in base 64 VLQ value.");
+    }
+
+    digit = base64.decode(aStr.charCodeAt(aIndex++));
+    if (digit === -1) {
+      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+    }
+
+    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+    digit &= VLQ_BASE_MASK;
+    result = result + (digit << shift);
+    shift += VLQ_BASE_SHIFT;
+  } while (continuation);
+
+  aOutParam.value = fromVLQSigned(result);
+  aOutParam.rest = aIndex;
+};
diff --git a/node_modules/recast/node_modules/source-map/lib/base64.js b/node_modules/recast/node_modules/source-map/lib/base64.js
new file mode 100644
index 0000000..8aa86b3
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/base64.js
@@ -0,0 +1,67 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function (number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+/**
+ * Decode a single base 64 character code digit to an integer. Returns -1 on
+ * failure.
+ */
+exports.decode = function (charCode) {
+  var bigA = 65;     // 'A'
+  var bigZ = 90;     // 'Z'
+
+  var littleA = 97;  // 'a'
+  var littleZ = 122; // 'z'
+
+  var zero = 48;     // '0'
+  var nine = 57;     // '9'
+
+  var plus = 43;     // '+'
+  var slash = 47;    // '/'
+
+  var littleOffset = 26;
+  var numberOffset = 52;
+
+  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+  if (bigA <= charCode && charCode <= bigZ) {
+    return (charCode - bigA);
+  }
+
+  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+  if (littleA <= charCode && charCode <= littleZ) {
+    return (charCode - littleA + littleOffset);
+  }
+
+  // 52 - 61: 0123456789
+  if (zero <= charCode && charCode <= nine) {
+    return (charCode - zero + numberOffset);
+  }
+
+  // 62: +
+  if (charCode == plus) {
+    return 62;
+  }
+
+  // 63: /
+  if (charCode == slash) {
+    return 63;
+  }
+
+  // Invalid base64 digit.
+  return -1;
+};
diff --git a/node_modules/recast/node_modules/source-map/lib/binary-search.js b/node_modules/recast/node_modules/source-map/lib/binary-search.js
new file mode 100644
index 0000000..010ac94
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/binary-search.js
@@ -0,0 +1,111 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  }
+  else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    } else {
+      return mid;
+    }
+  }
+  else {
+    // Our needle is less than aHaystack[mid].
+    if (mid - aLow > 1) {
+      // The element is in the lower half.
+      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return mid;
+    } else {
+      return aLow < 0 ? -1 : aLow;
+    }
+  }
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
diff --git a/node_modules/recast/node_modules/source-map/lib/mapping-list.js b/node_modules/recast/node_modules/source-map/lib/mapping-list.js
new file mode 100644
index 0000000..06d1274
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/mapping-list.js
@@ -0,0 +1,79 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  var lineA = mappingA.generatedLine;
+  var lineB = mappingB.generatedLine;
+  var columnA = mappingA.generatedColumn;
+  var columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a neglibable overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+function MappingList() {
+  this._array = [];
+  this._sorted = true;
+  // Serves as infimum
+  this._last = {generatedLine: -1, generatedColumn: 0};
+}
+
+/**
+ * Iterate through internal items. This method takes the same arguments that
+ * `Array.prototype.forEach` takes.
+ *
+ * NOTE: The order of the mappings is NOT guaranteed.
+ */
+MappingList.prototype.unsortedForEach =
+  function MappingList_forEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  };
+
+/**
+ * Add the given source mapping.
+ *
+ * @param Object aMapping
+ */
+MappingList.prototype.add = function MappingList_add(aMapping) {
+  if (generatedPositionAfter(this._last, aMapping)) {
+    this._last = aMapping;
+    this._array.push(aMapping);
+  } else {
+    this._sorted = false;
+    this._array.push(aMapping);
+  }
+};
+
+/**
+ * Returns the flat, sorted array of mappings. The mappings are sorted by
+ * generated position.
+ *
+ * WARNING: This method returns internal data without copying, for
+ * performance. The return value must NOT be mutated, and should be treated as
+ * an immutable borrow. If you want to take ownership, you must make your own
+ * copy.
+ */
+MappingList.prototype.toArray = function MappingList_toArray() {
+  if (!this._sorted) {
+    this._array.sort(util.compareByGeneratedPositionsInflated);
+    this._sorted = true;
+  }
+  return this._array;
+};
+
+exports.MappingList = MappingList;
diff --git a/node_modules/recast/node_modules/source-map/lib/quick-sort.js b/node_modules/recast/node_modules/source-map/lib/quick-sort.js
new file mode 100644
index 0000000..6a7caad
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/quick-sort.js
@@ -0,0 +1,114 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+// It turns out that some (most?) JavaScript engines don't self-host
+// `Array.prototype.sort`. This makes sense because C++ will likely remain
+// faster than JS when doing raw CPU-intensive sorting. However, when using a
+// custom comparator function, calling back and forth between the VM's C++ and
+// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+// worse generated code for the comparator function than would be optimal. In
+// fact, when sorting with a comparator, these costs outweigh the benefits of
+// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+// a ~3500ms mean speed-up in `bench/bench.html`.
+
+/**
+ * Swap the elements indexed by `x` and `y` in the array `ary`.
+ *
+ * @param {Array} ary
+ *        The array.
+ * @param {Number} x
+ *        The index of the first item.
+ * @param {Number} y
+ *        The index of the second item.
+ */
+function swap(ary, x, y) {
+  var temp = ary[x];
+  ary[x] = ary[y];
+  ary[y] = temp;
+}
+
+/**
+ * Returns a random integer within the range `low .. high` inclusive.
+ *
+ * @param {Number} low
+ *        The lower bound on the range.
+ * @param {Number} high
+ *        The upper bound on the range.
+ */
+function randomIntInRange(low, high) {
+  return Math.round(low + (Math.random() * (high - low)));
+}
+
+/**
+ * The Quick Sort algorithm.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ * @param {Number} p
+ *        Start index of the array
+ * @param {Number} r
+ *        End index of the array
+ */
+function doQuickSort(ary, comparator, p, r) {
+  // If our lower bound is less than our upper bound, we (1) partition the
+  // array into two pieces and (2) recurse on each half. If it is not, this is
+  // the empty array and our base case.
+
+  if (p < r) {
+    // (1) Partitioning.
+    //
+    // The partitioning chooses a pivot between `p` and `r` and moves all
+    // elements that are less than or equal to the pivot to the before it, and
+    // all the elements that are greater than it after it. The effect is that
+    // once partition is done, the pivot is in the exact place it will be when
+    // the array is put in sorted order, and it will not need to be moved
+    // again. This runs in O(n) time.
+
+    // Always choose a random pivot so that an input array which is reverse
+    // sorted does not cause O(n^2) running time.
+    var pivotIndex = randomIntInRange(p, r);
+    var i = p - 1;
+
+    swap(ary, pivotIndex, r);
+    var pivot = ary[r];
+
+    // Immediately after `j` is incremented in this loop, the following hold
+    // true:
+    //
+    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+    //
+    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+    for (var j = p; j < r; j++) {
+      if (comparator(ary[j], pivot) <= 0) {
+        i += 1;
+        swap(ary, i, j);
+      }
+    }
+
+    swap(ary, i + 1, j);
+    var q = i + 1;
+
+    // (2) Recurse on each half.
+
+    doQuickSort(ary, comparator, p, q - 1);
+    doQuickSort(ary, comparator, q + 1, r);
+  }
+}
+
+/**
+ * Sort the given array in-place with the given comparator function.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ */
+exports.quickSort = function (ary, comparator) {
+  doQuickSort(ary, comparator, 0, ary.length - 1);
+};
diff --git a/node_modules/recast/node_modules/source-map/lib/source-map-consumer.js b/node_modules/recast/node_modules/source-map/lib/source-map-consumer.js
new file mode 100644
index 0000000..7b99d1d
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/source-map-consumer.js
@@ -0,0 +1,1145 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+var binarySearch = require('./binary-search');
+var ArraySet = require('./array-set').ArraySet;
+var base64VLQ = require('./base64-vlq');
+var quickSort = require('./quick-sort').quickSort;
+
+function SourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  return sourceMap.sections != null
+    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+}
+
+SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+
+// `__generatedMappings` and `__originalMappings` are arrays that hold the
+// parsed mapping coordinates from the source map's "mappings" attribute. They
+// are lazily instantiated, accessed via the `_generatedMappings` and
+// `_originalMappings` getters respectively, and we only parse the mappings
+// and create these arrays once queried for a source location. We jump through
+// these hoops because there can be many thousands of mappings, and parsing
+// them is expensive, so we only want to do it if we must.
+//
+// Each object in the arrays is of the form:
+//
+//     {
+//       generatedLine: The line number in the generated code,
+//       generatedColumn: The column number in the generated code,
+//       source: The path to the original source file that generated this
+//               chunk of code,
+//       originalLine: The line number in the original source that
+//                     corresponds to this chunk of generated code,
+//       originalColumn: The column number in the original source that
+//                       corresponds to this chunk of generated code,
+//       name: The name of the original symbol which generated this chunk of
+//             code.
+//     }
+//
+// All properties except for `generatedLine` and `generatedColumn` can be
+// `null`.
+//
+// `_generatedMappings` is ordered by the generated positions.
+//
+// `_originalMappings` is ordered by the original positions.
+
+SourceMapConsumer.prototype.__generatedMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {
+  configurable: true,
+  enumerable: true,
+  get: function () {
+    if (!this.__generatedMappings) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappings;
+  }
+});
+
+SourceMapConsumer.prototype.__originalMappings = null;
+Object.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {
+  configurable: true,
+  enumerable: true,
+  get: function () {
+    if (!this.__originalMappings) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappings;
+  }
+});
+
+SourceMapConsumer.prototype._charIsMappingSeparator =
+  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {
+    var c = aStr.charAt(index);
+    return c === ";" || c === ",";
+  };
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+SourceMapConsumer.prototype._parseMappings =
+  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  };
+
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Iterate over each mapping between an original source/line/column and a
+ * generated line/column in this source map.
+ *
+ * @param Function aCallback
+ *        The function that is called with each mapping.
+ * @param Object aContext
+ *        Optional. If specified, this object will be the value of `this` every
+ *        time that `aCallback` is called.
+ * @param aOrder
+ *        Either `SourceMapConsumer.GENERATED_ORDER` or
+ *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+ *        iterate over the mappings sorted by the generated file's line/column
+ *        order or the original's source/line/column order, respectively. Defaults to
+ *        `SourceMapConsumer.GENERATED_ORDER`.
+ */
+SourceMapConsumer.prototype.eachMapping =
+  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {
+    var context = aContext || null;
+    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    var mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    var sourceRoot = this.sourceRoot;
+    mappings.map(function (mapping) {
+      var source = mapping.source === null ? null : this._sources.at(mapping.source);
+      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      return {
+        source: source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  };
+
+/**
+ * Returns all generated line and column information for the original source,
+ * line, and column provided. If no column is provided, returns all mappings
+ * corresponding to a either the line we are searching for or the next
+ * closest line that has any mappings. Otherwise, returns all mappings
+ * corresponding to the given line and either the column we are searching for
+ * or the next closest column that has any offsets.
+ *
+ * The only argument is an object with the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number is 1-based.
+ *   - column: Optional. the column number in the original source.
+ *    The column number is 0-based.
+ *
+ * and an array of objects is returned, each with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *    line number is 1-based.
+ *   - column: The column number in the generated source, or null.
+ *    The column number is 0-based.
+ */
+SourceMapConsumer.prototype.allGeneratedPositionsFor =
+  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {
+    var line = util.getArg(aArgs, 'line');
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    var needle = {
+      source: util.getArg(aArgs, 'source'),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, 'column', 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    var mappings = [];
+
+    var index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      var mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        var originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          mappings.push({
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        var originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          mappings.push({
+            line: util.getArg(mapping, 'generatedLine', null),
+            column: util.getArg(mapping, 'generatedColumn', null),
+            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  };
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referrenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  var version = util.getArg(sourceMap, 'version');
+  var sources = util.getArg(sourceMap, 'sources');
+  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+  // requires the array) to play nice here.
+  var names = util.getArg(sourceMap, 'names', []);
+  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);
+  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);
+  var mappings = util.getArg(sourceMap, 'mappings');
+  var file = util.getArg(sourceMap, 'file', null);
+
+  // Once again, Sass deviates from the spec and supplies the version as a
+  // string rather than a number, so we use loose equality checking here.
+  if (version != this._version) {
+    throw new Error('Unsupported version: ' + version);
+  }
+
+  if (sourceRoot) {
+    sourceRoot = util.normalize(sourceRoot);
+  }
+
+  sources = sources
+    .map(String)
+    // Some source maps produce relative source paths like "./foo.js" instead of
+    // "foo.js".  Normalize these first so that future comparisons will succeed.
+    // See bugzil.la/1090768.
+    .map(util.normalize)
+    // Always ensure that absolute sources are internally stored relative to
+    // the source root, if the source root is absolute. Not doing this would
+    // be particularly problematic when the source root is a prefix of the
+    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+    .map(function (source) {
+      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+        ? util.relative(sourceRoot, source)
+        : source;
+    });
+
+  // Pass `true` below to allow duplicate names and sources. While source maps
+  // are intended to be compressed and deduplicated, the TypeScript compiler
+  // sometimes generates source maps with duplicates in them. See Github issue
+  // #72 and bugzil.la/889492.
+  this._names = ArraySet.fromArray(names.map(String), true);
+  this._sources = ArraySet.fromArray(sources, true);
+
+  this._absoluteSources = this._sources.toArray().map(function (s) {
+    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+  });
+
+  this.sourceRoot = sourceRoot;
+  this.sourcesContent = sourcesContent;
+  this._mappings = mappings;
+  this._sourceMapURL = aSourceMapURL;
+  this.file = file;
+}
+
+BasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+
+/**
+ * Utility function to find the index of a source.  Returns -1 if not
+ * found.
+ */
+BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {
+  var relativeSource = aSource;
+  if (this.sourceRoot != null) {
+    relativeSource = util.relative(this.sourceRoot, relativeSource);
+  }
+
+  if (this._sources.has(relativeSource)) {
+    return this._sources.indexOf(relativeSource);
+  }
+
+  // Maybe aSource is an absolute URL as returned by |sources|.  In
+  // this case we can't simply undo the transform.
+  var i;
+  for (i = 0; i < this._absoluteSources.length; ++i) {
+    if (this._absoluteSources[i] == aSource) {
+      return i;
+    }
+  }
+
+  return -1;
+};
+
+/**
+ * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+ *
+ * @param SourceMapGenerator aSourceMap
+ *        The source map that will be consumed.
+ * @param String aSourceMapURL
+ *        The URL at which the source map can be found (optional)
+ * @returns BasicSourceMapConsumer
+ */
+BasicSourceMapConsumer.fromSourceMap =
+  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {
+    var smc = Object.create(BasicSourceMapConsumer.prototype);
+
+    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);
+    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);
+    smc.sourceRoot = aSourceMap._sourceRoot;
+    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),
+                                                            smc.sourceRoot);
+    smc.file = aSourceMap._file;
+    smc._sourceMapURL = aSourceMapURL;
+    smc._absoluteSources = smc._sources.toArray().map(function (s) {
+      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);
+    });
+
+    // Because we are modifying the entries (by converting string sources and
+    // names to indices into the sources and names ArraySets), we have to make
+    // a copy of the entry or else bad things happen. Shared mutable state
+    // strikes again! See github issue #191.
+
+    var generatedMappings = aSourceMap._mappings.toArray().slice();
+    var destGeneratedMappings = smc.__generatedMappings = [];
+    var destOriginalMappings = smc.__originalMappings = [];
+
+    for (var i = 0, length = generatedMappings.length; i < length; i++) {
+      var srcMapping = generatedMappings[i];
+      var destMapping = new Mapping;
+      destMapping.generatedLine = srcMapping.generatedLine;
+      destMapping.generatedColumn = srcMapping.generatedColumn;
+
+      if (srcMapping.source) {
+        destMapping.source = sources.indexOf(srcMapping.source);
+        destMapping.originalLine = srcMapping.originalLine;
+        destMapping.originalColumn = srcMapping.originalColumn;
+
+        if (srcMapping.name) {
+          destMapping.name = names.indexOf(srcMapping.name);
+        }
+
+        destOriginalMappings.push(destMapping);
+      }
+
+      destGeneratedMappings.push(destMapping);
+    }
+
+    quickSort(smc.__originalMappings, util.compareByOriginalPositions);
+
+    return smc;
+  };
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+BasicSourceMapConsumer.prototype._version = 3;
+
+/**
+ * The list of original sources.
+ */
+Object.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {
+  get: function () {
+    return this._absoluteSources.slice();
+  }
+});
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+BasicSourceMapConsumer.prototype._parseMappings =
+  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    var generatedLine = 1;
+    var previousGeneratedColumn = 0;
+    var previousOriginalLine = 0;
+    var previousOriginalColumn = 0;
+    var previousSource = 0;
+    var previousName = 0;
+    var length = aStr.length;
+    var index = 0;
+    var cachedSegments = {};
+    var temp = {};
+    var originalMappings = [];
+    var generatedMappings = [];
+    var mapping, str, segment, end, value;
+
+    while (index < length) {
+      if (aStr.charAt(index) === ';') {
+        generatedLine++;
+        index++;
+        previousGeneratedColumn = 0;
+      }
+      else if (aStr.charAt(index) === ',') {
+        index++;
+      }
+      else {
+        mapping = new Mapping();
+        mapping.generatedLine = generatedLine;
+
+        // Because each offset is encoded relative to the previous one,
+        // many segments often have the same encoding. We can exploit this
+        // fact by caching the parsed variable length fields of each segment,
+        // allowing us to avoid a second parse if we encounter the same
+        // segment again.
+        for (end = index; end < length; end++) {
+          if (this._charIsMappingSeparator(aStr, end)) {
+            break;
+          }
+        }
+        str = aStr.slice(index, end);
+
+        segment = cachedSegments[str];
+        if (segment) {
+          index += str.length;
+        } else {
+          segment = [];
+          while (index < end) {
+            base64VLQ.decode(aStr, index, temp);
+            value = temp.value;
+            index = temp.rest;
+            segment.push(value);
+          }
+
+          if (segment.length === 2) {
+            throw new Error('Found a source, but no line and column');
+          }
+
+          if (segment.length === 3) {
+            throw new Error('Found a source and line, but no column');
+          }
+
+          cachedSegments[str] = segment;
+        }
+
+        // Generated column.
+        mapping.generatedColumn = previousGeneratedColumn + segment[0];
+        previousGeneratedColumn = mapping.generatedColumn;
+
+        if (segment.length > 1) {
+          // Original source.
+          mapping.source = previousSource + segment[1];
+          previousSource += segment[1];
+
+          // Original line.
+          mapping.originalLine = previousOriginalLine + segment[2];
+          previousOriginalLine = mapping.originalLine;
+          // Lines are stored 0-based
+          mapping.originalLine += 1;
+
+          // Original column.
+          mapping.originalColumn = previousOriginalColumn + segment[3];
+          previousOriginalColumn = mapping.originalColumn;
+
+          if (segment.length > 4) {
+            // Original name.
+            mapping.name = previousName + segment[4];
+            previousName += segment[4];
+          }
+        }
+
+        generatedMappings.push(mapping);
+        if (typeof mapping.originalLine === 'number') {
+          originalMappings.push(mapping);
+        }
+      }
+    }
+
+    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = generatedMappings;
+
+    quickSort(originalMappings, util.compareByOriginalPositions);
+    this.__originalMappings = originalMappings;
+  };
+
+/**
+ * Find the mapping that best matches the hypothetical "needle" mapping that
+ * we are searching for in the given "haystack" of mappings.
+ */
+BasicSourceMapConsumer.prototype._findMapping =
+  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,
+                                         aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError('Line must be greater than or equal to 1, got '
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError('Column must be greater than or equal to 0, got '
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  };
+
+/**
+ * Compute the last column for each generated mapping. The last column is
+ * inclusive.
+ */
+BasicSourceMapConsumer.prototype.computeColumnSpans =
+  function SourceMapConsumer_computeColumnSpans() {
+    for (var index = 0; index < this._generatedMappings.length; ++index) {
+      var mapping = this._generatedMappings[index];
+
+      // Mappings do not contain a field for the last generated columnt. We
+      // can come up with an optimistic estimate, however, by assuming that
+      // mappings are contiguous (i.e. given two consecutive mappings, the
+      // first mapping ends where the second one starts).
+      if (index + 1 < this._generatedMappings.length) {
+        var nextMapping = this._generatedMappings[index + 1];
+
+        if (mapping.generatedLine === nextMapping.generatedLine) {
+          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;
+          continue;
+        }
+      }
+
+      // The last mapping for each line spans the entire line.
+      mapping.lastGeneratedColumn = Infinity;
+    }
+  };
+
+/**
+ * Returns the original source, line, and column information for the generated
+ * source's line and column positions provided. The only argument is an object
+ * with the following properties:
+ *
+ *   - line: The line number in the generated source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the generated source.  The column
+ *     number is 0-based.
+ *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+ *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - source: The original source file, or null.
+ *   - line: The line number in the original source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the original source, or null.  The
+ *     column number is 0-based.
+ *   - name: The original identifier, or null.
+ */
+BasicSourceMapConsumer.prototype.originalPositionFor =
+  function SourceMapConsumer_originalPositionFor(aArgs) {
+    var needle = {
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
+    };
+
+    var index = this._findMapping(
+      needle,
+      this._generatedMappings,
+      "generatedLine",
+      "generatedColumn",
+      util.compareByGeneratedPositionsDeflated,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+    );
+
+    if (index >= 0) {
+      var mapping = this._generatedMappings[index];
+
+      if (mapping.generatedLine === needle.generatedLine) {
+        var source = util.getArg(mapping, 'source', null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+        var name = util.getArg(mapping, 'name', null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+        return {
+          source: source,
+          line: util.getArg(mapping, 'originalLine', null),
+          column: util.getArg(mapping, 'originalColumn', null),
+          name: name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  };
+
+/**
+ * Return true if we have the source content for every source in the source
+ * map, false otherwise.
+ */
+BasicSourceMapConsumer.prototype.hasContentsOfAllSources =
+  function BasicSourceMapConsumer_hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function (sc) { return sc == null; });
+  };
+
+/**
+ * Returns the original source content. The only argument is the url of the
+ * original source file. Returns null if no original source content is
+ * available.
+ */
+BasicSourceMapConsumer.prototype.sourceContentFor =
+  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    var index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    var relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    var url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      var fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+    else {
+      throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+    }
+  };
+
+/**
+ * Returns the generated line and column information for the original source,
+ * line, and column positions provided. The only argument is an object with
+ * the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the original source.  The column
+ *     number is 0-based.
+ *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+ *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the generated source, or null.
+ *     The column number is 0-based.
+ */
+BasicSourceMapConsumer.prototype.generatedPositionFor =
+  function SourceMapConsumer_generatedPositionFor(aArgs) {
+    var source = util.getArg(aArgs, 'source');
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    var needle = {
+      source: source,
+      originalLine: util.getArg(aArgs, 'line'),
+      originalColumn: util.getArg(aArgs, 'column')
+    };
+
+    var index = this._findMapping(
+      needle,
+      this._originalMappings,
+      "originalLine",
+      "originalColumn",
+      util.compareByOriginalPositions,
+      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)
+    );
+
+    if (index >= 0) {
+      var mapping = this._originalMappings[index];
+
+      if (mapping.source === needle.source) {
+        return {
+          line: util.getArg(mapping, 'generatedLine', null),
+          column: util.getArg(mapping, 'generatedColumn', null),
+          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  };
+
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {
+  var sourceMap = aSourceMap;
+  if (typeof aSourceMap === 'string') {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  var version = util.getArg(sourceMap, 'version');
+  var sections = util.getArg(sourceMap, 'sections');
+
+  if (version != this._version) {
+    throw new Error('Unsupported version: ' + version);
+  }
+
+  this._sources = new ArraySet();
+  this._names = new ArraySet();
+
+  var lastOffset = {
+    line: -1,
+    column: 0
+  };
+  this._sections = sections.map(function (s) {
+    if (s.url) {
+      // The url field will require support for asynchronicity.
+      // See https://github.com/mozilla/source-map/issues/16
+      throw new Error('Support for url field in sections not implemented.');
+    }
+    var offset = util.getArg(s, 'offset');
+    var offsetLine = util.getArg(offset, 'line');
+    var offsetColumn = util.getArg(offset, 'column');
+
+    if (offsetLine < lastOffset.line ||
+        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+      throw new Error('Section offsets must be ordered and non-overlapping.');
+    }
+    lastOffset = offset;
+
+    return {
+      generatedOffset: {
+        // The offset fields are 0-based, but we use 1-based indices when
+        // encoding/decoding from VLQ.
+        generatedLine: offsetLine + 1,
+        generatedColumn: offsetColumn + 1
+      },
+      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)
+    }
+  });
+}
+
+IndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);
+IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+IndexedSourceMapConsumer.prototype._version = 3;
+
+/**
+ * The list of original sources.
+ */
+Object.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {
+  get: function () {
+    var sources = [];
+    for (var i = 0; i < this._sections.length; i++) {
+      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+});
+
+/**
+ * Returns the original source, line, and column information for the generated
+ * source's line and column positions provided. The only argument is an object
+ * with the following properties:
+ *
+ *   - line: The line number in the generated source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the generated source.  The column
+ *     number is 0-based.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - source: The original source file, or null.
+ *   - line: The line number in the original source, or null.  The
+ *     line number is 1-based.
+ *   - column: The column number in the original source, or null.  The
+ *     column number is 0-based.
+ *   - name: The original identifier, or null.
+ */
+IndexedSourceMapConsumer.prototype.originalPositionFor =
+  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {
+    var needle = {
+      generatedLine: util.getArg(aArgs, 'line'),
+      generatedColumn: util.getArg(aArgs, 'column')
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    var sectionIndex = binarySearch.search(needle, this._sections,
+      function(needle, section) {
+        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (needle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    var section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  };
+
+/**
+ * Return true if we have the source content for every source in the source
+ * map, false otherwise.
+ */
+IndexedSourceMapConsumer.prototype.hasContentsOfAllSources =
+  function IndexedSourceMapConsumer_hasContentsOfAllSources() {
+    return this._sections.every(function (s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  };
+
+/**
+ * Returns the original source content. The only argument is the url of the
+ * original source file. Returns null if no original source content is
+ * available.
+ */
+IndexedSourceMapConsumer.prototype.sourceContentFor =
+  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+
+      var content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    else {
+      throw new Error('"' + aSource + '" is not in the SourceMap.');
+    }
+  };
+
+/**
+ * Returns the generated line and column information for the original source,
+ * line, and column positions provided. The only argument is an object with
+ * the following properties:
+ *
+ *   - source: The filename of the original source.
+ *   - line: The line number in the original source.  The line number
+ *     is 1-based.
+ *   - column: The column number in the original source.  The column
+ *     number is 0-based.
+ *
+ * and an object is returned with the following properties:
+ *
+ *   - line: The line number in the generated source, or null.  The
+ *     line number is 1-based. 
+ *   - column: The column number in the generated source, or null.
+ *     The column number is 0-based.
+ */
+IndexedSourceMapConsumer.prototype.generatedPositionFor =
+  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {
+        continue;
+      }
+      var generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        var ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  };
+
+/**
+ * Parse the mappings in a string in to a data structure which we can easily
+ * query (the ordered arrays in the `this.__generatedMappings` and
+ * `this.__originalMappings` properties).
+ */
+IndexedSourceMapConsumer.prototype._parseMappings =
+  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {
+    this.__generatedMappings = [];
+    this.__originalMappings = [];
+    for (var i = 0; i < this._sections.length; i++) {
+      var section = this._sections[i];
+      var sectionMappings = section.consumer._generatedMappings;
+      for (var j = 0; j < sectionMappings.length; j++) {
+        var mapping = sectionMappings[j];
+
+        var source = section.consumer._sources.at(mapping.source);
+        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        var name = null;
+        if (mapping.name) {
+          name = section.consumer._names.at(mapping.name);
+          this._names.add(name);
+          name = this._names.indexOf(name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        var adjustedMapping = {
+          source: source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name: name
+        };
+
+        this.__generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === 'number') {
+          this.__originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+
+    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);
+    quickSort(this.__originalMappings, util.compareByOriginalPositions);
+  };
+
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
diff --git a/node_modules/recast/node_modules/source-map/lib/source-map-generator.js b/node_modules/recast/node_modules/source-map/lib/source-map-generator.js
new file mode 100644
index 0000000..508bcfb
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/source-map-generator.js
@@ -0,0 +1,425 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var base64VLQ = require('./base64-vlq');
+var util = require('./util');
+var ArraySet = require('./array-set').ArraySet;
+var MappingList = require('./mapping-list').MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+function SourceMapGenerator(aArgs) {
+  if (!aArgs) {
+    aArgs = {};
+  }
+  this._file = util.getArg(aArgs, 'file', null);
+  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+  this._sources = new ArraySet();
+  this._names = new ArraySet();
+  this._mappings = new MappingList();
+  this._sourcesContents = null;
+}
+
+SourceMapGenerator.prototype._version = 3;
+
+/**
+ * Creates a new SourceMapGenerator based on a SourceMapConsumer
+ *
+ * @param aSourceMapConsumer The SourceMap.
+ */
+SourceMapGenerator.fromSourceMap =
+  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+    var sourceRoot = aSourceMapConsumer.sourceRoot;
+    var generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot: sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      var newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  };
+
+/**
+ * Add a single mapping from original source line and column to the generated
+ * source's line and column for this source map being created. The mapping
+ * object should have the following properties:
+ *
+ *   - generated: An object with the generated line and column positions.
+ *   - original: An object with the original line and column positions.
+ *   - source: The original source file (relative to the sourceRoot).
+ *   - name: An optional original token name for this mapping.
+ */
+SourceMapGenerator.prototype.addMapping =
+  function SourceMapGenerator_addMapping(aArgs) {
+    var generated = util.getArg(aArgs, 'generated');
+    var original = util.getArg(aArgs, 'original', null);
+    var source = util.getArg(aArgs, 'source', null);
+    var name = util.getArg(aArgs, 'name', null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source: source,
+      name: name
+    });
+  };
+
+/**
+ * Set the source content for a source file.
+ */
+SourceMapGenerator.prototype.setSourceContent =
+  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+    var source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  };
+
+/**
+ * Applies the mappings of a sub-source-map for a specific source file to the
+ * source map being generated. Each mapping to the supplied source file is
+ * rewritten using the supplied source map. Note: The resolution for the
+ * resulting mappings is the minimium of this map and the supplied map.
+ *
+ * @param aSourceMapConsumer The source map to be applied.
+ * @param aSourceFile Optional. The filename of the source file.
+ *        If omitted, SourceMapConsumer's file property will be used.
+ * @param aSourceMapPath Optional. The dirname of the path to the source map
+ *        to be applied. If relative, it is relative to the SourceMapConsumer.
+ *        This parameter is needed when the two source maps aren't in the same
+ *        directory, and the source map to be applied contains relative source
+ *        paths. If so, those relative source paths need to be rewritten
+ *        relative to the SourceMapGenerator.
+ */
+SourceMapGenerator.prototype.applySourceMap =
+  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    var sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    var sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    var newSources = new ArraySet();
+    var newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function (mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        var original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source)
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      var source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      var name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          sourceFile = util.join(aSourceMapPath, sourceFile);
+        }
+        if (sourceRoot != null) {
+          sourceFile = util.relative(sourceRoot, sourceFile);
+        }
+        this.setSourceContent(sourceFile, content);
+      }
+    }, this);
+  };
+
+/**
+ * A mapping can have one of the three levels of data:
+ *
+ *   1. Just the generated position.
+ *   2. The Generated position, original position, and original source.
+ *   3. Generated and original position, original source, as well as a name
+ *      token.
+ *
+ * To maintain consistency, we validate that any new mapping being added falls
+ * in to one of these categories.
+ */
+SourceMapGenerator.prototype._validateMapping =
+  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+                                              aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+        throw new Error(
+            'original.line and original.column are not numbers -- you probably meant to omit ' +
+            'the original mapping entirely and only map the generated position. If so, pass ' +
+            'null for the original mapping instead of an object with empty or null values.'
+        );
+    }
+
+    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+      return;
+    }
+    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+      return;
+    }
+    else {
+      throw new Error('Invalid mapping: ' + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  };
+
+/**
+ * Serialize the accumulated mappings in to the stream of base 64 VLQs
+ * specified by the source map format.
+ */
+SourceMapGenerator.prototype._serializeMappings =
+  function SourceMapGenerator_serializeMappings() {
+    var previousGeneratedColumn = 0;
+    var previousGeneratedLine = 1;
+    var previousOriginalColumn = 0;
+    var previousOriginalLine = 0;
+    var previousName = 0;
+    var previousSource = 0;
+    var result = '';
+    var next;
+    var mapping;
+    var nameIdx;
+    var sourceIdx;
+
+    var mappings = this._mappings.toArray();
+    for (var i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = ''
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ';';
+          previousGeneratedLine++;
+        }
+      }
+      else {
+        if (i > 0) {
+          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+            continue;
+          }
+          next += ',';
+        }
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  };
+
+SourceMapGenerator.prototype._generateSourcesContent =
+  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function (source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      var key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  };
+
+/**
+ * Externalize the source map.
+ */
+SourceMapGenerator.prototype.toJSON =
+  function SourceMapGenerator_toJSON() {
+    var map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  };
+
+/**
+ * Render the source map being generated to a string.
+ */
+SourceMapGenerator.prototype.toString =
+  function SourceMapGenerator_toString() {
+    return JSON.stringify(this.toJSON());
+  };
+
+exports.SourceMapGenerator = SourceMapGenerator;
diff --git a/node_modules/recast/node_modules/source-map/lib/source-node.js b/node_modules/recast/node_modules/source-map/lib/source-node.js
new file mode 100644
index 0000000..8bcdbe3
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/source-node.js
@@ -0,0 +1,413 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;
+var util = require('./util');
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+var REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+var NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+var isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+  this.children = [];
+  this.sourceContents = {};
+  this.line = aLine == null ? null : aLine;
+  this.column = aColumn == null ? null : aColumn;
+  this.source = aSource == null ? null : aSource;
+  this.name = aName == null ? null : aName;
+  this[isSourceNode] = true;
+  if (aChunks != null) this.add(aChunks);
+}
+
+/**
+ * Creates a SourceNode from generated code and a SourceMapConsumer.
+ *
+ * @param aGeneratedCode The generated code
+ * @param aSourceMapConsumer The SourceMap for the generated code
+ * @param aRelativePath Optional. The path that relative sources in the
+ *        SourceMapConsumer should be relative to.
+ */
+SourceNode.fromStringWithSourceMap =
+  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    var node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    var remainingLinesIndex = 0;
+    var shiftNextLine = function() {
+      var lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      var newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    var lastMapping = null;
+
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          var nextLine = remainingLines[remainingLinesIndex] || '';
+          var code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        var nextLine = remainingLines[remainingLinesIndex] || '';
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        var source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  };
+
+/**
+ * Add a chunk of generated JS to this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.add = function SourceNode_add(aChunk) {
+  if (Array.isArray(aChunk)) {
+    aChunk.forEach(function (chunk) {
+      this.add(chunk);
+    }, this);
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    if (aChunk) {
+      this.children.push(aChunk);
+    }
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Add a chunk of generated JS to the beginning of this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+  if (Array.isArray(aChunk)) {
+    for (var i = aChunk.length-1; i >= 0; i--) {
+      this.prepend(aChunk[i]);
+    }
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    this.children.unshift(aChunk);
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Walk over the tree of JS snippets in this node and its children. The
+ * walking function is called once for each snippet of JS and is passed that
+ * snippet and the its original associated source's line/column location.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+  var chunk;
+  for (var i = 0, len = this.children.length; i < len; i++) {
+    chunk = this.children[i];
+    if (chunk[isSourceNode]) {
+      chunk.walk(aFn);
+    }
+    else {
+      if (chunk !== '') {
+        aFn(chunk, { source: this.source,
+                     line: this.line,
+                     column: this.column,
+                     name: this.name });
+      }
+    }
+  }
+};
+
+/**
+ * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+ * each of `this.children`.
+ *
+ * @param aSep The separator.
+ */
+SourceNode.prototype.join = function SourceNode_join(aSep) {
+  var newChildren;
+  var i;
+  var len = this.children.length;
+  if (len > 0) {
+    newChildren = [];
+    for (i = 0; i < len-1; i++) {
+      newChildren.push(this.children[i]);
+      newChildren.push(aSep);
+    }
+    newChildren.push(this.children[i]);
+    this.children = newChildren;
+  }
+  return this;
+};
+
+/**
+ * Call String.prototype.replace on the very right-most source snippet. Useful
+ * for trimming whitespace from the end of a source node, etc.
+ *
+ * @param aPattern The pattern to replace.
+ * @param aReplacement The thing to replace the pattern with.
+ */
+SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+  var lastChild = this.children[this.children.length - 1];
+  if (lastChild[isSourceNode]) {
+    lastChild.replaceRight(aPattern, aReplacement);
+  }
+  else if (typeof lastChild === 'string') {
+    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+  }
+  else {
+    this.children.push(''.replace(aPattern, aReplacement));
+  }
+  return this;
+};
+
+/**
+ * Set the source content for a source file. This will be added to the SourceMapGenerator
+ * in the sourcesContent field.
+ *
+ * @param aSourceFile The filename of the source file
+ * @param aSourceContent The content of the source file
+ */
+SourceNode.prototype.setSourceContent =
+  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  };
+
+/**
+ * Walk over the tree of SourceNodes. The walking function is called for each
+ * source file content and is passed the filename and source content.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walkSourceContents =
+  function SourceNode_walkSourceContents(aFn) {
+    for (var i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    var sources = Object.keys(this.sourceContents);
+    for (var i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  };
+
+/**
+ * Return the string representation of this source node. Walks over the tree
+ * and concatenates all the various snippets together to one string.
+ */
+SourceNode.prototype.toString = function SourceNode_toString() {
+  var str = "";
+  this.walk(function (chunk) {
+    str += chunk;
+  });
+  return str;
+};
+
+/**
+ * Returns the string representation of this source node along with a source
+ * map.
+ */
+SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+  var generated = {
+    code: "",
+    line: 1,
+    column: 0
+  };
+  var map = new SourceMapGenerator(aArgs);
+  var sourceMappingActive = false;
+  var lastOriginalSource = null;
+  var lastOriginalLine = null;
+  var lastOriginalColumn = null;
+  var lastOriginalName = null;
+  this.walk(function (chunk, original) {
+    generated.code += chunk;
+    if (original.source !== null
+        && original.line !== null
+        && original.column !== null) {
+      if(lastOriginalSource !== original.source
+         || lastOriginalLine !== original.line
+         || lastOriginalColumn !== original.column
+         || lastOriginalName !== original.name) {
+        map.addMapping({
+          source: original.source,
+          original: {
+            line: original.line,
+            column: original.column
+          },
+          generated: {
+            line: generated.line,
+            column: generated.column
+          },
+          name: original.name
+        });
+      }
+      lastOriginalSource = original.source;
+      lastOriginalLine = original.line;
+      lastOriginalColumn = original.column;
+      lastOriginalName = original.name;
+      sourceMappingActive = true;
+    } else if (sourceMappingActive) {
+      map.addMapping({
+        generated: {
+          line: generated.line,
+          column: generated.column
+        }
+      });
+      lastOriginalSource = null;
+      sourceMappingActive = false;
+    }
+    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+        generated.line++;
+        generated.column = 0;
+        // Mappings end at eol
+        if (idx + 1 === length) {
+          lastOriginalSource = null;
+          sourceMappingActive = false;
+        } else if (sourceMappingActive) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+      } else {
+        generated.column++;
+      }
+    }
+  });
+  this.walkSourceContents(function (sourceFile, sourceContent) {
+    map.setSourceContent(sourceFile, sourceContent);
+  });
+
+  return { code: generated.code, map: map };
+};
+
+exports.SourceNode = SourceNode;
diff --git a/node_modules/recast/node_modules/source-map/lib/util.js b/node_modules/recast/node_modules/source-map/lib/util.js
new file mode 100644
index 0000000..3ca92e5
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/lib/util.js
@@ -0,0 +1,488 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  } else {
+    throw new Error('"' + aName + '" is a required argument.');
+  }
+}
+exports.getArg = getArg;
+
+var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+var dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  var match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  var url = '';
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ':';
+  }
+  url += '//';
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + '@';
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+function normalize(aPath) {
+  var path = aPath;
+  var url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  var isAbsolute = exports.isAbsolute(path);
+
+  var parts = path.split(/\/+/);
+  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+    part = parts[i];
+    if (part === '.') {
+      parts.splice(i, 1);
+    } else if (part === '..') {
+      up++;
+    } else if (up > 0) {
+      if (part === '') {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join('/');
+
+  if (path === '') {
+    path = isAbsolute ? '/' : '.';
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+}
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  var aPathUrl = urlParse(aPath);
+  var aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || '/';
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  var joined = aPath.charAt(0) === '/'
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function (aPath) {
+  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, '');
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  var level = 0;
+  while (aPath.indexOf(aRoot + '/') !== 0) {
+    var index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+var supportsNullProto = (function () {
+  var obj = Object.create(null);
+  return !('__proto__' in obj);
+}());
+
+function identity (s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return '$' + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  var length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+
+  for (var i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  var cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || '';
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+      sourceRoot += '/';
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    var parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      var index = parsed.path.lastIndexOf('/');
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
diff --git a/node_modules/recast/node_modules/source-map/package.json b/node_modules/recast/node_modules/source-map/package.json
new file mode 100644
index 0000000..3678c0e
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/package.json
@@ -0,0 +1,212 @@
+{
+  "_from": "source-map@~0.6.1",
+  "_id": "source-map@0.6.1",
+  "_inBundle": false,
+  "_integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==",
+  "_location": "/recast/source-map",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "source-map@~0.6.1",
+    "name": "source-map",
+    "escapedName": "source-map",
+    "rawSpec": "~0.6.1",
+    "saveSpec": null,
+    "fetchSpec": "~0.6.1"
+  },
+  "_requiredBy": [
+    "/recast"
+  ],
+  "_resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz",
+  "_shasum": "74722af32e9614e9c287a8d0bbde48b5e2f1a263",
+  "_spec": "source-map@~0.6.1",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/recast",
+  "author": {
+    "name": "Nick Fitzgerald",
+    "email": "nfitzgerald@mozilla.com"
+  },
+  "bugs": {
+    "url": "https://github.com/mozilla/source-map/issues"
+  },
+  "bundleDependencies": false,
+  "contributors": [
+    {
+      "name": "Tobias Koppers",
+      "email": "tobias.koppers@googlemail.com"
+    },
+    {
+      "name": "Duncan Beevers",
+      "email": "duncan@dweebd.com"
+    },
+    {
+      "name": "Stephen Crane",
+      "email": "scrane@mozilla.com"
+    },
+    {
+      "name": "Ryan Seddon",
+      "email": "seddon.ryan@gmail.com"
+    },
+    {
+      "name": "Miles Elam",
+      "email": "miles.elam@deem.com"
+    },
+    {
+      "name": "Mihai Bazon",
+      "email": "mihai.bazon@gmail.com"
+    },
+    {
+      "name": "Michael Ficarra",
+      "email": "github.public.email@michael.ficarra.me"
+    },
+    {
+      "name": "Todd Wolfson",
+      "email": "todd@twolfson.com"
+    },
+    {
+      "name": "Alexander Solovyov",
+      "email": "alexander@solovyov.net"
+    },
+    {
+      "name": "Felix Gnass",
+      "email": "fgnass@gmail.com"
+    },
+    {
+      "name": "Conrad Irwin",
+      "email": "conrad.irwin@gmail.com"
+    },
+    {
+      "name": "usrbincc",
+      "email": "usrbincc@yahoo.com"
+    },
+    {
+      "name": "David Glasser",
+      "email": "glasser@davidglasser.net"
+    },
+    {
+      "name": "Chase Douglas",
+      "email": "chase@newrelic.com"
+    },
+    {
+      "name": "Evan Wallace",
+      "email": "evan.exe@gmail.com"
+    },
+    {
+      "name": "Heather Arthur",
+      "email": "fayearthur@gmail.com"
+    },
+    {
+      "name": "Hugh Kennedy",
+      "email": "hughskennedy@gmail.com"
+    },
+    {
+      "name": "David Glasser",
+      "email": "glasser@davidglasser.net"
+    },
+    {
+      "name": "Simon Lydell",
+      "email": "simon.lydell@gmail.com"
+    },
+    {
+      "name": "Jmeas Smith",
+      "email": "jellyes2@gmail.com"
+    },
+    {
+      "name": "Michael Z Goddard",
+      "email": "mzgoddard@gmail.com"
+    },
+    {
+      "name": "azu",
+      "email": "azu@users.noreply.github.com"
+    },
+    {
+      "name": "John Gozde",
+      "email": "john@gozde.ca"
+    },
+    {
+      "name": "Adam Kirkton",
+      "email": "akirkton@truefitinnovation.com"
+    },
+    {
+      "name": "Chris Montgomery",
+      "email": "christopher.montgomery@dowjones.com"
+    },
+    {
+      "name": "J. Ryan Stinnett",
+      "email": "jryans@gmail.com"
+    },
+    {
+      "name": "Jack Herrington",
+      "email": "jherrington@walmartlabs.com"
+    },
+    {
+      "name": "Chris Truter",
+      "email": "jeffpalentine@gmail.com"
+    },
+    {
+      "name": "Daniel Espeset",
+      "email": "daniel@danielespeset.com"
+    },
+    {
+      "name": "Jamie Wong",
+      "email": "jamie.lf.wong@gmail.com"
+    },
+    {
+      "name": "Eddy Bruël",
+      "email": "ejpbruel@mozilla.com"
+    },
+    {
+      "name": "Hawken Rives",
+      "email": "hawkrives@gmail.com"
+    },
+    {
+      "name": "Gilad Peleg",
+      "email": "giladp007@gmail.com"
+    },
+    {
+      "name": "djchie",
+      "email": "djchie.dev@gmail.com"
+    },
+    {
+      "name": "Gary Ye",
+      "email": "garysye@gmail.com"
+    },
+    {
+      "name": "Nicolas Lalevée",
+      "email": "nicolas.lalevee@hibnet.org"
+    }
+  ],
+  "deprecated": false,
+  "description": "Generates and consumes source maps",
+  "devDependencies": {
+    "doctoc": "^0.15.0",
+    "webpack": "^1.12.0"
+  },
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "files": [
+    "source-map.js",
+    "source-map.d.ts",
+    "lib/",
+    "dist/source-map.debug.js",
+    "dist/source-map.js",
+    "dist/source-map.min.js",
+    "dist/source-map.min.js.map"
+  ],
+  "homepage": "https://github.com/mozilla/source-map",
+  "license": "BSD-3-Clause",
+  "main": "./source-map.js",
+  "name": "source-map",
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://git@github.com/mozilla/source-map.git"
+  },
+  "scripts": {
+    "build": "webpack --color",
+    "test": "npm run build && node test/run-tests.js",
+    "toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
+  },
+  "typings": "source-map",
+  "version": "0.6.1"
+}
diff --git a/node_modules/recast/node_modules/source-map/source-map.d.ts b/node_modules/recast/node_modules/source-map/source-map.d.ts
new file mode 100644
index 0000000..8f972b0
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/source-map.d.ts
@@ -0,0 +1,98 @@
+export interface StartOfSourceMap {
+    file?: string;
+    sourceRoot?: string;
+}
+
+export interface RawSourceMap extends StartOfSourceMap {
+    version: string;
+    sources: string[];
+    names: string[];
+    sourcesContent?: string[];
+    mappings: string;
+}
+
+export interface Position {
+    line: number;
+    column: number;
+}
+
+export interface LineRange extends Position {
+    lastColumn: number;
+}
+
+export interface FindPosition extends Position {
+    // SourceMapConsumer.GREATEST_LOWER_BOUND or SourceMapConsumer.LEAST_UPPER_BOUND
+    bias?: number;
+}
+
+export interface SourceFindPosition extends FindPosition {
+    source: string;
+}
+
+export interface MappedPosition extends Position {
+    source: string;
+    name?: string;
+}
+
+export interface MappingItem {
+    source: string;
+    generatedLine: number;
+    generatedColumn: number;
+    originalLine: number;
+    originalColumn: number;
+    name: string;
+}
+
+export class SourceMapConsumer {
+    static GENERATED_ORDER: number;
+    static ORIGINAL_ORDER: number;
+
+    static GREATEST_LOWER_BOUND: number;
+    static LEAST_UPPER_BOUND: number;
+
+    constructor(rawSourceMap: RawSourceMap);
+    computeColumnSpans(): void;
+    originalPositionFor(generatedPosition: FindPosition): MappedPosition;
+    generatedPositionFor(originalPosition: SourceFindPosition): LineRange;
+    allGeneratedPositionsFor(originalPosition: MappedPosition): Position[];
+    hasContentsOfAllSources(): boolean;
+    sourceContentFor(source: string, returnNullOnMissing?: boolean): string;
+    eachMapping(callback: (mapping: MappingItem) => void, context?: any, order?: number): void;
+}
+
+export interface Mapping {
+    generated: Position;
+    original: Position;
+    source: string;
+    name?: string;
+}
+
+export class SourceMapGenerator {
+    constructor(startOfSourceMap?: StartOfSourceMap);
+    static fromSourceMap(sourceMapConsumer: SourceMapConsumer): SourceMapGenerator;
+    addMapping(mapping: Mapping): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    applySourceMap(sourceMapConsumer: SourceMapConsumer, sourceFile?: string, sourceMapPath?: string): void;
+    toString(): string;
+}
+
+export interface CodeWithSourceMap {
+    code: string;
+    map: SourceMapGenerator;
+}
+
+export class SourceNode {
+    constructor();
+    constructor(line: number, column: number, source: string);
+    constructor(line: number, column: number, source: string, chunk?: string, name?: string);
+    static fromStringWithSourceMap(code: string, sourceMapConsumer: SourceMapConsumer, relativePath?: string): SourceNode;
+    add(chunk: string): void;
+    prepend(chunk: string): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    walk(fn: (chunk: string, mapping: MappedPosition) => void): void;
+    walkSourceContents(fn: (file: string, content: string) => void): void;
+    join(sep: string): SourceNode;
+    replaceRight(pattern: string, replacement: string): SourceNode;
+    toString(): string;
+    toStringWithSourceMap(startOfSourceMap?: StartOfSourceMap): CodeWithSourceMap;
+}
diff --git a/node_modules/recast/node_modules/source-map/source-map.js b/node_modules/recast/node_modules/source-map/source-map.js
new file mode 100644
index 0000000..bc88fe8
--- /dev/null
+++ b/node_modules/recast/node_modules/source-map/source-map.js
@@ -0,0 +1,8 @@
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;
+exports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;
+exports.SourceNode = require('./lib/source-node').SourceNode;
diff --git a/node_modules/recast/package.json b/node_modules/recast/package.json
new file mode 100644
index 0000000..4de4823
--- /dev/null
+++ b/node_modules/recast/package.json
@@ -0,0 +1,93 @@
+{
+  "_from": "recast@^0.18.2",
+  "_id": "recast@0.18.2",
+  "_inBundle": false,
+  "_integrity": "sha512-MbuHc1lzIDIn7bpxaqIAGwwtyaokkzPqINf1Vm/LA0BSyVrTgXNVTTT7RzWC9kP+vqrUoYVpd6wHhI8x75ej8w==",
+  "_location": "/recast",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "recast@^0.18.2",
+    "name": "recast",
+    "escapedName": "recast",
+    "rawSpec": "^0.18.2",
+    "saveSpec": null,
+    "fetchSpec": "^0.18.2"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/recast/-/recast-0.18.2.tgz",
+  "_shasum": "ada263677edc70c45408caf20e6ae990958fdea8",
+  "_spec": "recast@^0.18.2",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "Ben Newman",
+    "email": "bn@cs.stanford.edu"
+  },
+  "browser": {
+    "fs": false
+  },
+  "bugs": {
+    "url": "https://github.com/benjamn/recast/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "ast-types": "0.13.2",
+    "esprima": "~4.0.0",
+    "private": "^0.1.8",
+    "source-map": "~0.6.1"
+  },
+  "deprecated": false,
+  "description": "JavaScript syntax tree transformer, nondestructive pretty-printer, and automatic source map generator",
+  "devDependencies": {
+    "@babel/core": "7.4.4",
+    "@babel/parser": "7.4.4",
+    "@babel/preset-env": "7.4.4",
+    "@types/esprima": "4.0.2",
+    "@types/glob": "7.1.1",
+    "@types/mocha": "5.2.6",
+    "@types/node": "12.0.2",
+    "esprima-fb": "15001.1001.0-dev-harmony-fb",
+    "flow-parser": "0.98.1",
+    "glob": "7.1.4",
+    "mocha": "6.1.4",
+    "reify": "0.20.12",
+    "ts-emit-clean": "1.0.0",
+    "ts-node": "7.0.1",
+    "typescript": "3.4.5"
+  },
+  "engines": {
+    "node": ">= 4"
+  },
+  "homepage": "http://github.com/benjamn/recast",
+  "keywords": [
+    "ast",
+    "rewriting",
+    "refactoring",
+    "codegen",
+    "syntax",
+    "transformation",
+    "parsing",
+    "pretty-printing"
+  ],
+  "license": "MIT",
+  "main": "main.js",
+  "name": "recast",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/benjamn/recast.git"
+  },
+  "scripts": {
+    "build": "npm run clean && tsc",
+    "clean": "ts-emit-clean",
+    "debug": "test/run.sh --inspect-brk",
+    "mocha": "test/run.sh",
+    "postpack": "npm run clean",
+    "prepack": "npm run build",
+    "test": "npm run build && npm run mocha"
+  },
+  "types": "main.d.ts",
+  "version": "0.18.2"
+}
diff --git a/node_modules/recast/parsers/_babel_options.d.ts b/node_modules/recast/parsers/_babel_options.d.ts
new file mode 100644
index 0000000..57bf4c6
--- /dev/null
+++ b/node_modules/recast/parsers/_babel_options.d.ts
@@ -0,0 +1,8 @@
+import { ParserOptions, ParserPlugin } from "@babel/parser";
+export declare type Overrides = Partial<{
+    sourceType: ParserOptions["sourceType"];
+    strictMode: ParserOptions["strictMode"];
+}>;
+export default function getBabelOptions(options?: Overrides): ParserOptions & {
+    plugins: ParserPlugin[];
+};
diff --git a/node_modules/recast/parsers/_babel_options.js b/node_modules/recast/parsers/_babel_options.js
new file mode 100644
index 0000000..f0101d8
--- /dev/null
+++ b/node_modules/recast/parsers/_babel_options.js
@@ -0,0 +1,42 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var util_1 = require("../lib/util");
+function getBabelOptions(options) {
+    // The goal here is to tolerate as much syntax as possible, since Recast
+    // is not in the business of forbidding anything. If you want your
+    // parser to be more restrictive for some reason, you can always pass
+    // your own parser object to recast.parse.
+    return {
+        sourceType: util_1.getOption(options, "sourceType", "module"),
+        strictMode: util_1.getOption(options, "strictMode", false),
+        allowImportExportEverywhere: true,
+        allowReturnOutsideFunction: true,
+        startLine: 1,
+        tokens: true,
+        plugins: [
+            "asyncGenerators",
+            "bigInt",
+            "classPrivateMethods",
+            "classPrivateProperties",
+            "classProperties",
+            "decorators-legacy",
+            "doExpressions",
+            "dynamicImport",
+            "exportDefaultFrom",
+            "exportExtensions",
+            "exportNamespaceFrom",
+            "functionBind",
+            "functionSent",
+            "importMeta",
+            "nullishCoalescingOperator",
+            "numericSeparator",
+            "objectRestSpread",
+            "optionalCatchBinding",
+            "optionalChaining",
+            ["pipelineOperator", { proposal: "minimal" }],
+            "throwExpressions",
+        ]
+    };
+}
+exports.default = getBabelOptions;
+;
diff --git a/node_modules/recast/parsers/acorn.d.ts b/node_modules/recast/parsers/acorn.d.ts
new file mode 100644
index 0000000..4ad6653
--- /dev/null
+++ b/node_modules/recast/parsers/acorn.d.ts
@@ -0,0 +1 @@
+export declare function parse(source: string, options?: any): any;
diff --git a/node_modules/recast/parsers/acorn.js b/node_modules/recast/parsers/acorn.js
new file mode 100644
index 0000000..d887c20
--- /dev/null
+++ b/node_modules/recast/parsers/acorn.js
@@ -0,0 +1,33 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+// This module is suitable for passing as options.parser when calling
+// recast.parse to process JavaScript code with Acorn:
+//
+//   const ast = recast.parse(source, {
+//     parser: require("recast/parsers/acorn")
+//   });
+//
+var util_1 = require("../lib/util");
+function parse(source, options) {
+    var comments = [];
+    var tokens = [];
+    var ast = require("acorn").parse(source, {
+        allowHashBang: true,
+        allowImportExportEverywhere: true,
+        allowReturnOutsideFunction: true,
+        ecmaVersion: util_1.getOption(options, "ecmaVersion", 8),
+        sourceType: util_1.getOption(options, "sourceType", "module"),
+        locations: true,
+        onComment: comments,
+        onToken: tokens,
+    });
+    if (!ast.comments) {
+        ast.comments = comments;
+    }
+    if (!ast.tokens) {
+        ast.tokens = tokens;
+    }
+    return ast;
+}
+exports.parse = parse;
+;
diff --git a/node_modules/recast/parsers/babel.d.ts b/node_modules/recast/parsers/babel.d.ts
new file mode 100644
index 0000000..8e5dee2
--- /dev/null
+++ b/node_modules/recast/parsers/babel.d.ts
@@ -0,0 +1,8 @@
+import { parse as babelParse } from "@babel/parser";
+import { Overrides } from "./_babel_options";
+declare type BabelParser = {
+    parse: typeof babelParse;
+};
+export declare const parser: BabelParser;
+export declare function parse(source: string, options?: Overrides): import("@babel/types").File;
+export {};
diff --git a/node_modules/recast/parsers/babel.js b/node_modules/recast/parsers/babel.js
new file mode 100644
index 0000000..1daa879
--- /dev/null
+++ b/node_modules/recast/parsers/babel.js
@@ -0,0 +1,30 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var _babel_options_1 = __importDefault(require("./_babel_options"));
+// Prefer the new @babel/parser package, but fall back to babylon if
+// that's what's available.
+exports.parser = function () {
+    try {
+        return require("@babel/parser");
+    }
+    catch (e) {
+        return require("babylon");
+    }
+}();
+// This module is suitable for passing as options.parser when calling
+// recast.parse to process JavaScript code with Babel:
+//
+//   const ast = recast.parse(source, {
+//     parser: require("recast/parsers/babel")
+//   });
+//
+function parse(source, options) {
+    var babelOptions = _babel_options_1.default(options);
+    babelOptions.plugins.push("jsx", "flow");
+    return exports.parser.parse(source, babelOptions);
+}
+exports.parse = parse;
+;
diff --git a/node_modules/recast/parsers/babylon.d.ts b/node_modules/recast/parsers/babylon.d.ts
new file mode 100644
index 0000000..60fce87
--- /dev/null
+++ b/node_modules/recast/parsers/babylon.d.ts
@@ -0,0 +1 @@
+export * from "./babel";
diff --git a/node_modules/recast/parsers/babylon.js b/node_modules/recast/parsers/babylon.js
new file mode 100644
index 0000000..47d19bf
--- /dev/null
+++ b/node_modules/recast/parsers/babylon.js
@@ -0,0 +1,6 @@
+"use strict";
+function __export(m) {
+    for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
+}
+Object.defineProperty(exports, "__esModule", { value: true });
+__export(require("./babel"));
diff --git a/node_modules/recast/parsers/esprima.d.ts b/node_modules/recast/parsers/esprima.d.ts
new file mode 100644
index 0000000..4ad6653
--- /dev/null
+++ b/node_modules/recast/parsers/esprima.d.ts
@@ -0,0 +1 @@
+export declare function parse(source: string, options?: any): any;
diff --git a/node_modules/recast/parsers/esprima.js b/node_modules/recast/parsers/esprima.js
new file mode 100644
index 0000000..a926329
--- /dev/null
+++ b/node_modules/recast/parsers/esprima.js
@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+// This module is suitable for passing as options.parser when calling
+// recast.parse to process ECMAScript code with Esprima:
+//
+//   const ast = recast.parse(source, {
+//     parser: require("recast/parsers/esprima")
+//   });
+//
+var util_1 = require("../lib/util");
+function parse(source, options) {
+    var comments = [];
+    var ast = require("esprima").parse(source, {
+        loc: true,
+        locations: true,
+        comment: true,
+        onComment: comments,
+        range: util_1.getOption(options, "range", false),
+        tolerant: util_1.getOption(options, "tolerant", true),
+        tokens: true
+    });
+    if (!Array.isArray(ast.comments)) {
+        ast.comments = comments;
+    }
+    return ast;
+}
+exports.parse = parse;
+;
diff --git a/node_modules/recast/parsers/flow.d.ts b/node_modules/recast/parsers/flow.d.ts
new file mode 100644
index 0000000..b37ee68
--- /dev/null
+++ b/node_modules/recast/parsers/flow.d.ts
@@ -0,0 +1,2 @@
+import { Overrides } from "./_babel_options";
+export declare function parse(source: string, options?: Overrides): import("@babel/types").File;
diff --git a/node_modules/recast/parsers/flow.js b/node_modules/recast/parsers/flow.js
new file mode 100644
index 0000000..75139ec
--- /dev/null
+++ b/node_modules/recast/parsers/flow.js
@@ -0,0 +1,21 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var babel_1 = require("./babel");
+var _babel_options_1 = __importDefault(require("./_babel_options"));
+// This module is suitable for passing as options.parser when calling
+// recast.parse to process Flow code:
+//
+//   const ast = recast.parse(source, {
+//     parser: require("recast/parsers/flow")
+//   });
+//
+function parse(source, options) {
+    var babelOptions = _babel_options_1.default(options);
+    babelOptions.plugins.push("jsx", "flow");
+    return babel_1.parser.parse(source, babelOptions);
+}
+exports.parse = parse;
+;
diff --git a/node_modules/recast/parsers/typescript.d.ts b/node_modules/recast/parsers/typescript.d.ts
new file mode 100644
index 0000000..b37ee68
--- /dev/null
+++ b/node_modules/recast/parsers/typescript.d.ts
@@ -0,0 +1,2 @@
+import { Overrides } from "./_babel_options";
+export declare function parse(source: string, options?: Overrides): import("@babel/types").File;
diff --git a/node_modules/recast/parsers/typescript.js b/node_modules/recast/parsers/typescript.js
new file mode 100644
index 0000000..a7c83e0
--- /dev/null
+++ b/node_modules/recast/parsers/typescript.js
@@ -0,0 +1,21 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var babel_1 = require("./babel");
+var _babel_options_1 = __importDefault(require("./_babel_options"));
+// This module is suitable for passing as options.parser when calling
+// recast.parse to process TypeScript code:
+//
+//   const ast = recast.parse(source, {
+//     parser: require("recast/parsers/typescript")
+//   });
+//
+function parse(source, options) {
+    var babelOptions = _babel_options_1.default(options);
+    babelOptions.plugins.push("typescript");
+    return babel_1.parser.parse(source, babelOptions);
+}
+exports.parse = parse;
+;
diff --git a/node_modules/recast/tsconfig.json b/node_modules/recast/tsconfig.json
new file mode 100644
index 0000000..afbe6ba
--- /dev/null
+++ b/node_modules/recast/tsconfig.json
@@ -0,0 +1,20 @@
+{
+  "compilerOptions": {
+    "target": "es5",
+    "lib": ["es2015"],
+    "module": "commonjs",
+    "declaration": true,
+    "rootDir": ".",
+    "strict": true,
+    "noUnusedLocals": true,
+    "noUnusedParameters": true,
+    "noImplicitReturns": true,
+    "moduleResolution": "node",
+    "esModuleInterop": true,
+    "stripInternal": true
+  },
+  "exclude": [
+    "node_modules",
+    "test/data"
+  ]
+}
diff --git a/node_modules/riot/LICENSE.txt b/node_modules/riot/LICENSE.txt
new file mode 100644
index 0000000..e9e6dd8
--- /dev/null
+++ b/node_modules/riot/LICENSE.txt
@@ -0,0 +1,25 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-present
+Originally created by Muut Inc.
+Actively maintained by:
+ - Gianluca Guarini https://github.com/GianlucaGuarini
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
diff --git a/node_modules/riot/README.md b/node_modules/riot/README.md
new file mode 100644
index 0000000..8a00d01
--- /dev/null
+++ b/node_modules/riot/README.md
@@ -0,0 +1,250 @@
+
+[![Riot logo](https://riot.js.org/img/logo/riot-logo.svg)](https://riot.js.org)
+
+## Simple and elegant component-based UI library
+
+[![Build Status][travis-image]][travis-url]
+[![MIT License][license-image]][license-url]
+[![Join the chat at https://gitter.im/riot/riot][gitter-image]][gitter-url]
+[![Join the discord community channel][discord-image]][discord-url]
+[![Join the chat (ja) at https://riot-jp-slackin.herokuapp.com/][slack-ja-image]][slack-ja-url]
+[![OpenCollective Backers][backer-badge]][backer-url] [![OpenCollective Sponsors][sponsor-badge]][sponsor-url]
+
+[![NPM version][npm-version-image]][npm-url]
+[![NPM downloads][npm-downloads-image]][npm-url]
+[![jsDelivr Hits][jsdelivr-image]][jsdelivr-url]
+[![Coverage Status][coverage-image]][coverage-url]
+![Riot Size][lib-size]
+[![Code Quality][codeclimate-image]][codeclimate-url]
+
+[![Sauce Test Status][saucelabs-image]][saucelabs-url]
+
+
+### Custom components • Concise syntax • Simple API • Tiny Size
+
+Riot brings custom components to all modern browsers. It is designed to offer you everything you wished native the web components API looked like.
+
+#### Tag definition
+
+```html
+<timer>
+  <p>Seconds Elapsed: { state.time }</p>
+
+  <script>
+    export default {
+      tick() {
+        this.update({ time: ++this.state.time })
+      },
+      onBeforeMount(props) {
+        // create the component initial state
+        this.state = {
+          time: props.start
+        }
+
+        this.timer = setInterval(this.tick, 1000)
+      },
+      onUnmounted() {
+        clearInterval(this.timer)
+      }
+    }
+  </script>
+</timer>
+```
+
+[Open this example on Plunker](https://riot.js.org/examples/plunker/?app=timer)
+
+#### Mounting
+
+```javascript
+// mount the timer with its initial props
+riot.mount('timer', { start: 0 })
+```
+
+#### Nesting
+
+Custom components let you build complex views with HTML.
+
+```html
+<timetable>
+  <timer start="0"></timer>
+  <timer start="10"></timer>
+  <timer start="20"></timer>
+</timetable>
+```
+
+HTML syntax is the de facto language on the web and it's designed for building user interfaces. The syntax is explicit, nesting is inherent to the language and attributes offer a clean way to provide options for custom tags.
+
+
+### Performant and predictable
+- Absolutely the smallest possible amount of DOM updates and reflows.
+- Fast expressions bindings instead of virtual DOM memory performance issues and drawbacks.
+- One way data flow: updates and unmounts are propagated downwards from parent to children.
+- No "magic" or "smart" reactive properties or hooks
+- Expressions are pre-compiled and cached for high performance.
+- Lifecycle methods for more control.
+
+
+### Close to standards
+- No proprietary event system.
+- Future proof thanks to the javascript module syntax.
+- The rendered DOM can be freely manipulated with other tools.
+- No extra HTML root elements, `data-` attributes or fancy custom attributes.
+- No new syntax to learn.
+- Plays well with any frontend framework.
+
+
+### Use your dearest language and tools
+- Create components with CoffeeScript, Jade, LiveScript, Typescript, ES6 or [any pre-processor](https://riot.js.org/compiler/#pre-processors) you want.
+- Build with [@riotjs/cli](https://github.com/riot/cli), [webpack](https://github.com/riot/webpack-loader), [Rollup](https://github.com/riot/rollup-plugin-riot), [parcel](https://github.com/riot/parcel-plugin-riot), [Browserify](https://github.com/riot/riotify).
+- Test with however you like, you can [load your riot tags directly in node](https://github.com/riot/ssr#render---to-render-only-markup)
+
+
+### Powerful and modular ecosystem
+
+The Riot.js ecosystem is completely modular, it's designed to let you pick only the stuff you really need:
+
+  - [@riotjs/cli](https://github.com/riot/cli) - CLI to compile locally your tags to javascript
+  - [@riotjs/ssr](https://github.com/riot/ssr) - Super simple server side rendering
+  - [@riotjs/hydrate](https://github.com/riot/hydrate) - Hydration strategy for your SPA
+  - [@riotjs/hot-reload](https://github.com/riot/hot-reload) - Live reload plugin
+  - [@riotjs/compiler](https://github.com/riot/compiler) - Advanced tags compiler
+  - [@riotjs/parser](https://github.com/riot/parser) - HTML parser
+  - [@riotjs/dom-bindings](https://github.com/riot/dom-bindings) - Expressions based template engine
+  - [@riotjs/now](https://github.com/riot/now) - https://zeit.co/ now integration
+  - [@riotjs/custom-elements](https://github.com/riot/custom-elements) - native custom elements implementation
+
+### CDN hosting
+- [unpkg](https://unpkg.com/riot/riot.js)
+- [jsDelivr](https://www.jsdelivr.com/projects/riot)
+- [cdnjs](https://cdnjs.com/libraries/riot)
+
+### How to contribute
+
+If you are reading this it's already a good sign and I am thankful for it! I try my best working as much as I can on riot but your help is always appreciated.
+
+If you want to contribute to riot helping the project maintenance please check first the list of [open issues](https://github.com/riot/riot/issues) to understand whether there is a task where you could help.
+
+Riot is mainly developed on UNIX systems so you will be able to run all the commands necessary to build and test the library using our [Makefile](Makefile). If you are on a Microsoft machine it could be harder to set up you development environment properly.
+
+Following the steps below you should be able to properly submit your patch to the project
+
+#### 1) Clone the repo and browse to the riot folder
+
+```shell
+$ git clone git@github.com:riot/riot.git && cd riot
+```
+#### 2) Set up your git branch
+
+```shell
+$ git checkout -b feature/my-awesome-patch
+```
+
+#### 3) Install the npm dependencies
+
+```shell
+$ npm i
+```
+
+#### 4) Build and test riot using the Makefile
+
+```shell
+# To build and test riot
+$ make riot
+
+# To build without testing
+$ make raw
+```
+
+#### 5) Pull request only against the `dev` branch making sure you have read [our pull request template](.github/PULL_REQUEST_TEMPLATE.md)
+
+#### 6) Be patient
+
+
+### Credits
+
+Riot is actively maintained with :heart: by:
+
+<table>
+  <tbody>
+    <tr>
+      <td valign="top">
+        <img width="125" height="125" src="https://github.com/GianlucaGuarini.png?s=125?s=125">
+        <br>
+        <a href="https://github.com/GianlucaGuarini">Gianluca Guarini</a>
+      </td>
+     </tr>
+  </tbody>
+</table>
+
+Many thanks to all smart people from all over the world who helped improving it.
+
+## Official Website
+
+https://riot.js.org
+
+## Backers
+
+Support us with a monthly donation and help us continue our activities. [Become a backer][support-url]
+
+[![Backers][backers-image]][support-url]
+
+## Sponsors
+
+Become a sponsor to get your logo on our README. [Become a sponsor][support-url]
+
+[![Sponsors][sponsors-image]][support-url]
+
+## Thanks
+
+Special thanks to Browserstack for their support
+
+<a href='https://www.browserstack.com/'>
+  <img width='70px' src="https://cdn.worldvectorlogo.com/logos/browserstack.svg" alt="browser stack">
+</a>
+
+[travis-image]:https://img.shields.io/travis/riot/riot.svg?style=flat-square
+[travis-url]:https://travis-ci.org/riot/riot
+
+[license-image]:https://img.shields.io/badge/license-MIT-000000.svg?style=flat-square
+[license-url]:LICENSE.txt
+
+[npm-version-image]:https://img.shields.io/npm/v/riot.svg?style=flat-square
+[npm-downloads-image]:https://img.shields.io/npm/dm/riot.svg?style=flat-square
+[npm-url]:https://npmjs.org/package/riot
+
+[coverage-image]:https://img.shields.io/coveralls/riot/riot/dev.svg?style=flat-square
+[coverage-url]:https://coveralls.io/r/riot/riot?branch=dev
+
+[saucelabs-image]:https://saucelabs.com/browser-matrix/testsriotjs.svg?1
+[saucelabs-url]:https://saucelabs.com/u/testsriotjs
+
+[gitter-image]:https://img.shields.io/badge/GITTER-JOIN_CHAT_%E2%86%92-1dce73.svg?style=flat-square
+[gitter-url]:https://gitter.im/riot/riot?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge
+
+[discord-url]:https://discord.gg/PagXe5Y
+[discord-image]:https://img.shields.io/badge/DISCORD-JOIN_CHANNEL_%E2%86%92-7289da.svg?style=flat-square
+
+[slack-ja-image]:https://img.shields.io/badge/SLACK_(ja)-JOIN_CHAT_%E2%86%92-551a8b.svg?style=flat-square
+[slack-ja-url]:https://riot-jp-slackin.herokuapp.com/
+
+[codeclimate-image]:https://api.codeclimate.com/v1/badges/b81ddf3c77e8189876da/maintainability
+[codeclimate-url]:https://codeclimate.com/github/riot/riot
+
+[donations-campaign-url]:https://pledgie.com/campaigns/31139
+[donations-campaign-image]:https://pledgie.com/campaigns/31139.png?skin_name=chrome
+
+[jsdelivr-image]: https://data.jsdelivr.com/v1/package/npm/riot/badge
+[jsdelivr-url]: https://www.jsdelivr.com/package/npm/riot
+
+
+[backer-url]: #backers
+[backer-badge]: https://opencollective.com/riot/backers/badge.svg?color=blue
+[sponsor-url]: #sponsors
+[sponsor-badge]: https://opencollective.com/riot/sponsors/badge.svg?color=blue
+
+[support-url]: https://opencollective.com/riot#support
+
+[lib-size]: https://img.badgesize.io/https://unpkg.com/riot/riot.min.js?compression=gzip
+
+[backers-image]: https://opencollective.com/riot/backers.svg
+[sponsors-image]: https://opencollective.com/riot/sponsors.svg
diff --git a/node_modules/riot/package.json b/node_modules/riot/package.json
new file mode 100644
index 0000000..61eb810
--- /dev/null
+++ b/node_modules/riot/package.json
@@ -0,0 +1,123 @@
+{
+  "_from": "riot",
+  "_id": "riot@4.5.0",
+  "_inBundle": false,
+  "_integrity": "sha512-eyDJvZIXxo192jVO8TJliK2jX6HYrECO6IEkjXsvAzysRcu81OgozRtzd3Vtf/ASiuCmJYnw5ahAVZK5zx0d4w==",
+  "_location": "/riot",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "tag",
+    "registry": true,
+    "raw": "riot",
+    "name": "riot",
+    "escapedName": "riot",
+    "rawSpec": "",
+    "saveSpec": null,
+    "fetchSpec": "latest"
+  },
+  "_requiredBy": [
+    "#USER",
+    "/"
+  ],
+  "_resolved": "https://registry.npmjs.org/riot/-/riot-4.5.0.tgz",
+  "_shasum": "a80c0a8587fe70ebb065bb30145db04a71fc358d",
+  "_spec": "riot",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page",
+  "author": {
+    "name": "Gianluca Guarini",
+    "email": "gianluca.guarini@gmail.com",
+    "url": "http://gianlucaguarini.com"
+  },
+  "bugs": {
+    "url": "https://github.com/riot/riot/issues"
+  },
+  "bundleDependencies": false,
+  "dependencies": {
+    "@riotjs/compiler": "^4.3.11",
+    "@riotjs/dom-bindings": "^4.2.5",
+    "bianco.attr": "^1.0.0",
+    "bianco.query": "^1.0.0",
+    "cumpa": "^1.0.1",
+    "curri": "^1.0.1"
+  },
+  "deprecated": false,
+  "description": "Simple and elegant component-based UI library",
+  "devDependencies": {
+    "@babel/core": "^7.5.5",
+    "@babel/preset-env": "^7.5.5",
+    "babel-plugin-istanbul": "^5.2.0",
+    "chai": "^4.2.0",
+    "core-js": "^3.2.1",
+    "coveralls": "^3.0.6",
+    "eslint": "^6.2.1",
+    "eslint-config-riot": "^3.0.0",
+    "jsdom": "15.1.1",
+    "jsdom-global": "3.0.2",
+    "karma": "^4.2.0",
+    "karma-chrome-launcher": "^3.1.0",
+    "karma-coverage": "^2.0.1",
+    "karma-mocha": "^1.3.0",
+    "karma-rollup-preprocessor": "^7.0.2",
+    "karma-sauce-launcher": "^2.0.2",
+    "mocha": "^6.2.0",
+    "rollup": "^1.20.1",
+    "rollup-plugin-babel": "^4.3.3",
+    "rollup-plugin-commonjs": "^9.3.4",
+    "rollup-plugin-ignore": "^1.0.5",
+    "rollup-plugin-json": "^4.0.0",
+    "rollup-plugin-node-resolve": "^5.2.0",
+    "rollup-plugin-riot": "^4.0.0",
+    "sinon": "^7.4.1",
+    "sinon-chai": "^3.3.0",
+    "terser": "^4.2.0",
+    "typescript": "^3.5.3"
+  },
+  "engines": {
+    "node": ">=8.0.0"
+  },
+  "files": [
+    "src",
+    "riot.js",
+    "riot.d.ts",
+    "riot.esm.js",
+    "riot.min.js",
+    "riot+compiler.js",
+    "riot+compiler.min.js"
+  ],
+  "homepage": "http://riot.js.org/",
+  "jsnext:main": "riot.esm.js",
+  "keywords": [
+    "custom tags",
+    "custom elements",
+    "web components",
+    "virtual dom",
+    "shadow dom",
+    "minimal",
+    "minimalist",
+    "client-side",
+    "framework",
+    "declarative",
+    "templating",
+    "template",
+    "data binding",
+    "mvc",
+    "model",
+    "view",
+    "controller",
+    "riotjs",
+    "riot.js"
+  ],
+  "license": "MIT",
+  "main": "riot.js",
+  "module": "riot.esm.js",
+  "name": "riot",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/riot/riot.git"
+  },
+  "scripts": {
+    "test": "make riot"
+  },
+  "types": "./riot.d.ts",
+  "version": "4.5.0"
+}
diff --git a/node_modules/riot/riot+compiler.js b/node_modules/riot/riot+compiler.js
new file mode 100644
index 0000000..c32d313
--- /dev/null
+++ b/node_modules/riot/riot+compiler.js
@@ -0,0 +1,7393 @@
+/* Riot v4.5.0, @license MIT */
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+  typeof define === 'function' && define.amd ? define(factory) :
+  (global = global || self, global.riot = factory());
+}(this, function () { 'use strict';
+
+  const COMPONENTS_IMPLEMENTATION_MAP = new Map(),
+        DOM_COMPONENT_INSTANCE_PROPERTY = Symbol('riot-component'),
+        PLUGINS_SET = new Set(),
+        IS_DIRECTIVE = 'is',
+        VALUE_ATTRIBUTE = 'value',
+        ATTRIBUTES_KEY_SYMBOL = Symbol('attributes'),
+        TEMPLATE_KEY_SYMBOL = Symbol('template');
+
+  var globals = /*#__PURE__*/Object.freeze({
+    COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP,
+    DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY,
+    PLUGINS_SET: PLUGINS_SET,
+    IS_DIRECTIVE: IS_DIRECTIVE,
+    VALUE_ATTRIBUTE: VALUE_ATTRIBUTE,
+    ATTRIBUTES_KEY_SYMBOL: ATTRIBUTES_KEY_SYMBOL,
+    TEMPLATE_KEY_SYMBOL: TEMPLATE_KEY_SYMBOL
+  });
+
+  /**
+   * Remove the child nodes from any DOM node
+   * @param   {HTMLElement} node - target node
+   * @returns {undefined}
+   */
+  function cleanNode(node) {
+    clearChildren(node.childNodes);
+  }
+  /**
+   * Clear multiple children in a node
+   * @param   {HTMLElement[]} children - direct children nodes
+   * @returns {undefined}
+   */
+
+
+  function clearChildren(children) {
+    Array.from(children).forEach(n => n.parentNode && n.parentNode.removeChild(n));
+  }
+
+  const EACH = 0;
+  const IF = 1;
+  const SIMPLE = 2;
+  const TAG = 3;
+  const SLOT = 4;
+  var bindingTypes = {
+    EACH,
+    IF,
+    SIMPLE,
+    TAG,
+    SLOT
+  };
+  /**
+   * Create the template meta object in case of <template> fragments
+   * @param   {TemplateChunk} componentTemplate - template chunk object
+   * @returns {Object} the meta property that will be passed to the mount function of the TemplateChunk
+   */
+
+  function createTemplateMeta(componentTemplate) {
+    const fragment = componentTemplate.dom.cloneNode(true);
+    return {
+      avoidDOMInjection: true,
+      fragment,
+      children: Array.from(fragment.childNodes)
+    };
+  }
+  /* get rid of the @ungap/essential-map polyfill */
+
+
+  const {
+    indexOf: iOF
+  } = [];
+
+  const append = (get, parent, children, start, end, before) => {
+    const isSelect = 'selectedIndex' in parent;
+    let noSelection = isSelect;
+
+    while (start < end) {
+      const child = get(children[start], 1);
+      parent.insertBefore(child, before);
+
+      if (isSelect && noSelection && child.selected) {
+        noSelection = !noSelection;
+        let {
+          selectedIndex
+        } = parent;
+        parent.selectedIndex = selectedIndex < 0 ? start : iOF.call(parent.querySelectorAll('option'), child);
+      }
+
+      start++;
+    }
+  };
+
+  const eqeq = (a, b) => a == b;
+
+  const identity = O => O;
+
+  const indexOf = (moreNodes, moreStart, moreEnd, lessNodes, lessStart, lessEnd, compare) => {
+    const length = lessEnd - lessStart;
+    /* istanbul ignore if */
+
+    if (length < 1) return -1;
+
+    while (moreEnd - moreStart >= length) {
+      let m = moreStart;
+      let l = lessStart;
+
+      while (m < moreEnd && l < lessEnd && compare(moreNodes[m], lessNodes[l])) {
+        m++;
+        l++;
+      }
+
+      if (l === lessEnd) return moreStart;
+      moreStart = m + 1;
+    }
+
+    return -1;
+  };
+
+  const isReversed = (futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare) => {
+    while (currentStart < currentEnd && compare(currentNodes[currentStart], futureNodes[futureEnd - 1])) {
+      currentStart++;
+      futureEnd--;
+    }
+
+    return futureEnd === 0;
+  };
+
+  const next = (get, list, i, length, before) => i < length ? get(list[i], 0) : 0 < i ? get(list[i - 1], -0).nextSibling : before;
+
+  const remove = (get, parent, children, start, end) => {
+    if (end - start < 2) parent.removeChild(get(children[start], -1));else {
+      const range = parent.ownerDocument.createRange();
+      range.setStartBefore(get(children[start], -1));
+      range.setEndAfter(get(children[end - 1], -1));
+      range.deleteContents();
+    }
+  }; // - - - - - - - - - - - - - - - - - - -
+  // diff related constants and utilities
+  // - - - - - - - - - - - - - - - - - - -
+
+
+  const DELETION = -1;
+  const INSERTION = 1;
+  const SKIP = 0;
+  const SKIP_OND = 50;
+
+  const HS = (futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges) => {
+    let k = 0;
+    /* istanbul ignore next */
+
+    let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+    const link = Array(minLen++);
+    const tresh = Array(minLen);
+    tresh[0] = -1;
+
+    for (let i = 1; i < minLen; i++) tresh[i] = currentEnd;
+
+    const keymap = new Map();
+
+    for (let i = currentStart; i < currentEnd; i++) keymap.set(currentNodes[i], i);
+
+    for (let i = futureStart; i < futureEnd; i++) {
+      const idxInOld = keymap.get(futureNodes[i]);
+
+      if (idxInOld != null) {
+        k = findK(tresh, minLen, idxInOld);
+        /* istanbul ignore else */
+
+        if (-1 < k) {
+          tresh[k] = idxInOld;
+          link[k] = {
+            newi: i,
+            oldi: idxInOld,
+            prev: link[k - 1]
+          };
+        }
+      }
+    }
+
+    k = --minLen;
+    --currentEnd;
+
+    while (tresh[k] > currentEnd) --k;
+
+    minLen = currentChanges + futureChanges - k;
+    const diff = Array(minLen);
+    let ptr = link[k];
+    --futureEnd;
+
+    while (ptr) {
+      const {
+        newi,
+        oldi
+      } = ptr;
+
+      while (futureEnd > newi) {
+        diff[--minLen] = INSERTION;
+        --futureEnd;
+      }
+
+      while (currentEnd > oldi) {
+        diff[--minLen] = DELETION;
+        --currentEnd;
+      }
+
+      diff[--minLen] = SKIP;
+      --futureEnd;
+      --currentEnd;
+      ptr = ptr.prev;
+    }
+
+    while (futureEnd >= futureStart) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+
+    while (currentEnd >= currentStart) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+
+    return diff;
+  }; // this is pretty much the same petit-dom code without the delete map part
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+
+
+  const OND = (futureNodes, futureStart, rows, currentNodes, currentStart, cols, compare) => {
+    const length = rows + cols;
+    const v = [];
+    let d, k, r, c, pv, cv, pd;
+
+    outer: for (d = 0; d <= length; d++) {
+      /* istanbul ignore if */
+      if (d > SKIP_OND) return null;
+      pd = d - 1;
+      /* istanbul ignore next */
+
+      pv = d ? v[d - 1] : [0, 0];
+      cv = v[d] = [];
+
+      for (k = -d; k <= d; k += 2) {
+        if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+          c = pv[pd + k + 1];
+        } else {
+          c = pv[pd + k - 1] + 1;
+        }
+
+        r = c - k;
+
+        while (c < cols && r < rows && compare(currentNodes[currentStart + c], futureNodes[futureStart + r])) {
+          c++;
+          r++;
+        }
+
+        if (c === cols && r === rows) {
+          break outer;
+        }
+
+        cv[d + k] = c;
+      }
+    }
+
+    const diff = Array(d / 2 + length / 2);
+    let diffIdx = diff.length - 1;
+
+    for (d = v.length - 1; d >= 0; d--) {
+      while (c > 0 && r > 0 && compare(currentNodes[currentStart + c - 1], futureNodes[futureStart + r - 1])) {
+        // diagonal edge = equality
+        diff[diffIdx--] = SKIP;
+        c--;
+        r--;
+      }
+
+      if (!d) break;
+      pd = d - 1;
+      /* istanbul ignore next */
+
+      pv = d ? v[d - 1] : [0, 0];
+      k = c - r;
+
+      if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+        // vertical edge = insertion
+        r--;
+        diff[diffIdx--] = INSERTION;
+      } else {
+        // horizontal edge = deletion
+        c--;
+        diff[diffIdx--] = DELETION;
+      }
+    }
+
+    return diff;
+  };
+
+  const applyDiff = (diff, get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before) => {
+    const live = new Map();
+    const length = diff.length;
+    let currentIndex = currentStart;
+    let i = 0;
+
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          futureStart++;
+          currentIndex++;
+          break;
+
+        case INSERTION:
+          // TODO: bulk appends for sequential nodes
+          live.set(futureNodes[futureStart], 1);
+          append(get, parentNode, futureNodes, futureStart++, futureStart, currentIndex < currentLength ? get(currentNodes[currentIndex], 0) : before);
+          break;
+
+        case DELETION:
+          currentIndex++;
+          break;
+      }
+    }
+
+    i = 0;
+
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          currentStart++;
+          break;
+
+        case DELETION:
+          // TODO: bulk removes for sequential nodes
+          if (live.has(currentNodes[currentStart])) currentStart++;else remove(get, parentNode, currentNodes, currentStart++, currentStart);
+          break;
+      }
+    }
+  };
+
+  const findK = (ktr, length, j) => {
+    let lo = 1;
+    let hi = length;
+
+    while (lo < hi) {
+      const mid = (lo + hi) / 2 >>> 0;
+      if (j < ktr[mid]) hi = mid;else lo = mid + 1;
+    }
+
+    return lo;
+  };
+
+  const smartDiff = (get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before) => {
+    applyDiff(OND(futureNodes, futureStart, futureChanges, currentNodes, currentStart, currentChanges, compare) || HS(futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges), get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before);
+  };
+  /*! (c) 2018 Andrea Giammarchi (ISC) */
+
+
+  const domdiff = (parentNode, // where changes happen
+  currentNodes, // Array of current items/nodes
+  futureNodes, // Array of future items/nodes
+  options // optional object with one of the following properties
+  //  before: domNode
+  //  compare(generic, generic) => true if same generic
+  //  node(generic) => Node
+  ) => {
+    if (!options) options = {};
+    const compare = options.compare || eqeq;
+    const get = options.node || identity;
+    const before = options.before == null ? null : get(options.before, 0);
+    const currentLength = currentNodes.length;
+    let currentEnd = currentLength;
+    let currentStart = 0;
+    let futureEnd = futureNodes.length;
+    let futureStart = 0; // common prefix
+
+    while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentStart], futureNodes[futureStart])) {
+      currentStart++;
+      futureStart++;
+    } // common suffix
+
+
+    while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])) {
+      currentEnd--;
+      futureEnd--;
+    }
+
+    const currentSame = currentStart === currentEnd;
+    const futureSame = futureStart === futureEnd; // same list
+
+    if (currentSame && futureSame) return futureNodes; // only stuff to add
+
+    if (currentSame && futureStart < futureEnd) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentStart, currentLength, before));
+      return futureNodes;
+    } // only stuff to remove
+
+
+    if (futureSame && currentStart < currentEnd) {
+      remove(get, parentNode, currentNodes, currentStart, currentEnd);
+      return futureNodes;
+    }
+
+    const currentChanges = currentEnd - currentStart;
+    const futureChanges = futureEnd - futureStart;
+    let i = -1; // 2 simple indels: the shortest sequence is a subsequence of the longest
+
+    if (currentChanges < futureChanges) {
+      i = indexOf(futureNodes, futureStart, futureEnd, currentNodes, currentStart, currentEnd, compare); // inner diff
+
+      if (-1 < i) {
+        append(get, parentNode, futureNodes, futureStart, i, get(currentNodes[currentStart], 0));
+        append(get, parentNode, futureNodes, i + currentChanges, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+        return futureNodes;
+      }
+    }
+    /* istanbul ignore else */
+    else if (futureChanges < currentChanges) {
+        i = indexOf(currentNodes, currentStart, currentEnd, futureNodes, futureStart, futureEnd, compare); // outer diff
+
+        if (-1 < i) {
+          remove(get, parentNode, currentNodes, currentStart, i);
+          remove(get, parentNode, currentNodes, i + futureChanges, currentEnd);
+          return futureNodes;
+        }
+      } // common case with one replacement for many nodes
+    // or many nodes replaced for a single one
+
+    /* istanbul ignore else */
+
+
+    if (currentChanges < 2 || futureChanges < 2) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, get(currentNodes[currentStart], 0));
+      remove(get, parentNode, currentNodes, currentStart, currentEnd);
+      return futureNodes;
+    } // the half match diff part has been skipped in petit-dom
+    // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+    // accordingly, I think it's safe to skip in here too
+    // if one day it'll come out like the speediest thing ever to do
+    // then I might add it in here too
+    // Extra: before going too fancy, what about reversed lists ?
+    //        This should bail out pretty quickly if that's not the case.
+
+
+    if (currentChanges === futureChanges && isReversed(futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare)) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+      return futureNodes;
+    } // last resort through a smart diff
+
+
+    smartDiff(get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before);
+    return futureNodes;
+  };
+  /**
+   * Check if a value is null or undefined
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the 'undefined' and 'null' types
+   */
+
+
+  function isNil(value) {
+    return value === null || value === undefined;
+  }
+  /**
+   * Check if an element is a template tag
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if it's a <template>
+   */
+
+
+  function isTemplate(el) {
+    return !isNil(el.content);
+  }
+
+  const EachBinding = Object.seal({
+    // dynamic binding properties
+    childrenMap: null,
+    node: null,
+    root: null,
+    condition: null,
+    evaluate: null,
+    template: null,
+    isTemplateTag: false,
+    nodes: [],
+    getKey: null,
+    indexName: null,
+    itemName: null,
+    afterPlaceholder: null,
+    placeholder: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      return this.update(scope, parentScope);
+    },
+
+    update(scope, parentScope) {
+      const {
+        placeholder
+      } = this;
+      const collection = this.evaluate(scope);
+      const items = collection ? Array.from(collection) : [];
+      const parent = placeholder.parentNode; // prepare the diffing
+
+      const {
+        newChildrenMap,
+        batches,
+        futureNodes
+      } = createPatch(items, scope, parentScope, this); // patch the DOM only if there are new nodes
+
+      if (futureNodes.length) {
+        domdiff(parent, this.nodes, futureNodes, {
+          before: placeholder,
+          node: patch(Array.from(this.childrenMap.values()), parentScope)
+        });
+      } else {
+        // remove all redundant templates
+        unmountRedundant(this.childrenMap);
+      } // trigger the mounts and the updates
+
+
+      batches.forEach(fn => fn()); // update the children map
+
+      this.childrenMap = newChildrenMap;
+      this.nodes = futureNodes;
+      return this;
+    },
+
+    unmount(scope, parentScope) {
+      unmountRedundant(this.childrenMap, parentScope);
+      this.childrenMap = new Map();
+      this.nodes = [];
+      return this;
+    }
+
+  });
+  /**
+   * Patch the DOM while diffing
+   * @param   {TemplateChunk[]} redundant - redundant tepmplate chunks
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {Function} patch function used by domdiff
+   */
+
+  function patch(redundant, parentScope) {
+    return (item, info) => {
+      if (info < 0) {
+        const {
+          template,
+          context
+        } = redundant.pop(); // notice that we pass null as last argument because
+        // the root node and its children will be removed by domdiff
+
+        template.unmount(context, parentScope, null);
+      }
+
+      return item;
+    };
+  }
+  /**
+   * Unmount the remaining template instances
+   * @param   {Map} childrenMap - map containing the children template to unmount
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {TemplateChunk[]} collection containing the template chunks unmounted
+   */
+
+
+  function unmountRedundant(childrenMap, parentScope) {
+    return Array.from(childrenMap.values()).map((_ref) => {
+      let {
+        template,
+        context
+      } = _ref;
+      return template.unmount(context, parentScope, true);
+    });
+  }
+  /**
+   * Check whether a template must be filtered from a loop
+   * @param   {Function} condition - filter function
+   * @param   {Object} context - argument passed to the filter function
+   * @returns {boolean} true if this item should be skipped
+   */
+
+
+  function mustFilterItem(condition, context) {
+    return condition ? Boolean(condition(context)) === false : false;
+  }
+  /**
+   * Extend the scope of the looped template
+   * @param   {Object} scope - current template scope
+   * @param   {string} options.itemName - key to identify the looped item in the new context
+   * @param   {string} options.indexName - key to identify the index of the looped item
+   * @param   {number} options.index - current index
+   * @param   {*} options.item - collection item looped
+   * @returns {Object} enhanced scope object
+   */
+
+
+  function extendScope(scope, _ref2) {
+    let {
+      itemName,
+      indexName,
+      index,
+      item
+    } = _ref2;
+    scope[itemName] = item;
+    if (indexName) scope[indexName] = index;
+    return scope;
+  }
+  /**
+   * Loop the current template items
+   * @param   {Array} items - expression collection value
+   * @param   {*} scope - template scope
+   * @param   {*} parentScope - scope of the parent template
+   * @param   {EeachBinding} binding - each binding object instance
+   * @returns {Object} data
+   * @returns {Map} data.newChildrenMap - a Map containing the new children template structure
+   * @returns {Array} data.batches - array containing the template lifecycle functions to trigger
+   * @returns {Array} data.futureNodes - array containing the nodes we need to diff
+   */
+
+
+  function createPatch(items, scope, parentScope, binding) {
+    const {
+      condition,
+      template,
+      childrenMap,
+      itemName,
+      getKey,
+      indexName,
+      root,
+      isTemplateTag
+    } = binding;
+    const newChildrenMap = new Map();
+    const batches = [];
+    const futureNodes = [];
+    items.forEach((item, index) => {
+      const context = extendScope(Object.create(scope), {
+        itemName,
+        indexName,
+        index,
+        item
+      });
+      const key = getKey ? getKey(context) : index;
+      const oldItem = childrenMap.get(key);
+
+      if (mustFilterItem(condition, context)) {
+        return;
+      }
+
+      const componentTemplate = oldItem ? oldItem.template : template.clone();
+      const el = oldItem ? componentTemplate.el : root.cloneNode();
+      const mustMount = !oldItem;
+      const meta = isTemplateTag && mustMount ? createTemplateMeta(componentTemplate) : {};
+
+      if (mustMount) {
+        batches.push(() => componentTemplate.mount(el, context, parentScope, meta));
+      } else {
+        componentTemplate.update(context, parentScope);
+      } // create the collection of nodes to update or to add
+      // in case of template tags we need to add all its children nodes
+
+
+      if (isTemplateTag) {
+        futureNodes.push(...(meta.children || componentTemplate.children));
+      } else {
+        futureNodes.push(el);
+      } // delete the old item from the children map
+
+
+      childrenMap.delete(key); // update the children map
+
+      newChildrenMap.set(key, {
+        template: componentTemplate,
+        context,
+        index
+      });
+    });
+    return {
+      newChildrenMap,
+      batches,
+      futureNodes
+    };
+  }
+
+  function create(node, _ref3) {
+    let {
+      evaluate,
+      condition,
+      itemName,
+      indexName,
+      getKey,
+      template
+    } = _ref3;
+    const placeholder = document.createTextNode('');
+    const parent = node.parentNode;
+    const root = node.cloneNode();
+    parent.insertBefore(placeholder, node);
+    parent.removeChild(node);
+    return Object.assign({}, EachBinding, {
+      childrenMap: new Map(),
+      node,
+      root,
+      condition,
+      evaluate,
+      isTemplateTag: isTemplate(root),
+      template: template.createDOM(node),
+      getKey,
+      indexName,
+      itemName,
+      placeholder
+    });
+  }
+  /**
+   * Binding responsible for the `if` directive
+   */
+
+
+  const IfBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    parent: null,
+    isTemplateTag: false,
+    placeholder: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      this.parent.insertBefore(this.placeholder, this.node);
+      this.parent.removeChild(this.node);
+      return this.update(scope, parentScope);
+    },
+
+    update(scope, parentScope) {
+      const value = !!this.evaluate(scope);
+      const mustMount = !this.value && value;
+      const mustUnmount = this.value && !value;
+
+      const mount = () => {
+        const pristine = this.node.cloneNode();
+        this.parent.insertBefore(pristine, this.placeholder);
+        this.template = this.template.clone();
+        this.template.mount(pristine, scope, parentScope);
+      };
+
+      switch (true) {
+        case mustMount:
+          mount();
+          break;
+
+        case mustUnmount:
+          this.unmount(scope);
+          break;
+
+        default:
+          if (value) this.template.update(scope, parentScope);
+      }
+
+      this.value = value;
+      return this;
+    },
+
+    unmount(scope, parentScope) {
+      this.template.unmount(scope, parentScope, true);
+      return this;
+    }
+
+  });
+
+  function create$1(node, _ref4) {
+    let {
+      evaluate,
+      template
+    } = _ref4;
+    return Object.assign({}, IfBinding, {
+      node,
+      evaluate,
+      parent: node.parentNode,
+      placeholder: document.createTextNode(''),
+      template: template.createDOM(node)
+    });
+  }
+
+  const ATTRIBUTE = 0;
+  const EVENT = 1;
+  const TEXT = 2;
+  const VALUE = 3;
+  var expressionTypes = {
+    ATTRIBUTE,
+    EVENT,
+    TEXT,
+    VALUE
+  };
+  /**
+   * Check if a value is a Boolean
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is a boolean
+   */
+
+  function isBoolean(value) {
+    return typeof value === 'boolean';
+  }
+  /**
+   * Check if a value is an Object
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is an object
+   */
+
+
+  function isObject(value) {
+    return typeof value === 'object';
+  }
+
+  const REMOVE_ATTRIBUTE = 'removeAttribute';
+  const SET_ATTIBUTE = 'setAttribute';
+  /**
+   * Add all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing the attributes names and values
+   * @returns {undefined} sorry it's a void function :(
+   */
+
+  function setAllAttributes(node, attributes) {
+    Object.entries(attributes).forEach((_ref5) => {
+      let [name, value] = _ref5;
+      return attributeExpression(node, {
+        name
+      }, value);
+    });
+  }
+  /**
+   * Remove all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing all the attribute names
+   * @returns {undefined} sorry it's a void function :(
+   */
+
+
+  function removeAllAttributes(node, attributes) {
+    Object.keys(attributes).forEach(attribute => node.removeAttribute(attribute));
+  }
+  /**
+   * This methods handles the DOM attributes updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - attribute name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - the old expression cached value
+   * @returns {undefined}
+   */
+
+
+  function attributeExpression(node, _ref6, value, oldValue) {
+    let {
+      name
+    } = _ref6;
+
+    // is it a spread operator? {...attributes}
+    if (!name) {
+      // is the value still truthy?
+      if (value) {
+        setAllAttributes(node, value);
+      } else if (oldValue) {
+        // otherwise remove all the old attributes
+        removeAllAttributes(node, oldValue);
+      }
+
+      return;
+    } // handle boolean attributes
+
+
+    if (isBoolean(value) || isObject(value)) {
+      node[name] = value;
+    }
+
+    node[getMethod(value)](name, normalizeValue(name, value));
+  }
+  /**
+   * Get the attribute modifier method
+   * @param   {*} value - if truthy we return `setAttribute` othewise `removeAttribute`
+   * @returns {string} the node attribute modifier method name
+   */
+
+
+  function getMethod(value) {
+    return isNil(value) || value === false || value === '' || isObject(value) ? REMOVE_ATTRIBUTE : SET_ATTIBUTE;
+  }
+  /**
+   * Get the value as string
+   * @param   {string} name - attribute name
+   * @param   {*} value - user input value
+   * @returns {string} input value as string
+   */
+
+
+  function normalizeValue(name, value) {
+    // be sure that expressions like selected={ true } will be always rendered as selected='selected'
+    if (value === true) return name;
+    return value;
+  }
+
+  const RE_EVENTS_PREFIX = /^on/;
+  /**
+   * Set a new event listener
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - event name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - old expression value
+   * @returns {value} the callback just received
+   */
+
+  function eventExpression(node, _ref7, value, oldValue) {
+    let {
+      name
+    } = _ref7;
+    const normalizedEventName = name.replace(RE_EVENTS_PREFIX, '');
+
+    if (oldValue) {
+      node.removeEventListener(normalizedEventName, oldValue);
+    }
+
+    if (value) {
+      node.addEventListener(normalizedEventName, value, false);
+    }
+
+    return value;
+  }
+  /**
+   * This methods handles a simple text expression update
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {number} expression.childNodeIndex - index to find the text node to update
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+
+
+  function textExpression(node, _ref8, value) {
+    let {
+      childNodeIndex
+    } = _ref8;
+    const target = node.childNodes[childNodeIndex];
+    const val = normalizeValue$1(value); // replace the target if it's a placeholder comment
+
+    if (target.nodeType === Node.COMMENT_NODE) {
+      const textNode = document.createTextNode(val);
+      node.replaceChild(textNode, target);
+    } else {
+      target.data = normalizeValue$1(val);
+    }
+  }
+  /**
+   * Normalize the user value in order to render a empty string in case of falsy values
+   * @param   {*} value - user input value
+   * @returns {string} hopefully a string
+   */
+
+
+  function normalizeValue$1(value) {
+    return isNil(value) ? '' : value;
+  }
+  /**
+   * This methods handles the input fileds value updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+
+
+  function valueExpression(node, expression, value) {
+    node.value = value;
+  }
+
+  var expressions = {
+    [ATTRIBUTE]: attributeExpression,
+    [EVENT]: eventExpression,
+    [TEXT]: textExpression,
+    [VALUE]: valueExpression
+  };
+  const Expression = Object.seal({
+    // Static props
+    node: null,
+    value: null,
+
+    // API methods
+
+    /**
+     * Mount the expression evaluating its initial value
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    mount(scope) {
+      // hopefully a pure function
+      this.value = this.evaluate(scope); // IO() DOM updates
+
+      apply(this, this.value);
+      return this;
+    },
+
+    /**
+     * Update the expression if its value changed
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    update(scope) {
+      // pure function
+      const value = this.evaluate(scope);
+
+      if (this.value !== value) {
+        // IO() DOM updates
+        apply(this, value);
+        this.value = value;
+      }
+
+      return this;
+    },
+
+    /**
+     * Expression teardown method
+     * @returns {Expression} self
+     */
+    unmount() {
+      // unmount only the event handling expressions
+      if (this.type === EVENT) apply(this, null);
+      return this;
+    }
+
+  });
+  /**
+   * IO() function to handle the DOM updates
+   * @param {Expression} expression - expression object
+   * @param {*} value - current expression value
+   * @returns {undefined}
+   */
+
+  function apply(expression, value) {
+    return expressions[expression.type](expression.node, expression, value, expression.value);
+  }
+
+  function create$2(node, data) {
+    return Object.assign({}, Expression, {}, data, {
+      node
+    });
+  }
+  /**
+   * Create a flat object having as keys a list of methods that if dispatched will propagate
+   * on the whole collection
+   * @param   {Array} collection - collection to iterate
+   * @param   {Array<string>} methods - methods to execute on each item of the collection
+   * @param   {*} context - context returned by the new methods created
+   * @returns {Object} a new object to simplify the the nested methods dispatching
+   */
+
+
+  function flattenCollectionMethods(collection, methods, context) {
+    return methods.reduce((acc, method) => {
+      return Object.assign({}, acc, {
+        [method]: scope => {
+          return collection.map(item => item[method](scope)) && context;
+        }
+      });
+    }, {});
+  }
+
+  function create$3(node, _ref9) {
+    let {
+      expressions
+    } = _ref9;
+    return Object.assign({}, flattenCollectionMethods(expressions.map(expression => create$2(node, expression)), ['mount', 'update', 'unmount']));
+  }
+
+  const SlotBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    name: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      const templateData = scope.slots ? scope.slots.find((_ref10) => {
+        let {
+          id
+        } = _ref10;
+        return id === this.name;
+      }) : false;
+      const {
+        parentNode
+      } = this.node;
+      this.template = templateData && create$6(templateData.html, templateData.bindings).createDOM(parentNode);
+
+      if (this.template) {
+        this.template.mount(this.node, parentScope);
+        moveSlotInnerContent(this.node);
+      }
+
+      parentNode.removeChild(this.node);
+      return this;
+    },
+
+    update(scope, parentScope) {
+      if (this.template && parentScope) {
+        this.template.update(parentScope);
+      }
+
+      return this;
+    },
+
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.template) {
+        this.template.unmount(parentScope, null, mustRemoveRoot);
+      }
+
+      return this;
+    }
+
+  });
+  /**
+   * Move the inner content of the slots outside of them
+   * @param   {HTMLNode} slot - slot node
+   * @returns {undefined} it's a void function
+   */
+
+  function moveSlotInnerContent(slot) {
+    if (slot.firstChild) {
+      slot.parentNode.insertBefore(slot.firstChild, slot);
+      moveSlotInnerContent(slot);
+    }
+  }
+  /**
+   * Create a single slot binding
+   * @param   {HTMLElement} node - slot node
+   * @param   {string} options.name - slot id
+   * @returns {Object} Slot binding object
+   */
+
+
+  function createSlot(node, _ref11) {
+    let {
+      name
+    } = _ref11;
+    return Object.assign({}, SlotBinding, {
+      node,
+      name
+    });
+  }
+  /**
+   * Create a new tag object if it was registered before, otherwise fallback to the simple
+   * template chunk
+   * @param   {Function} component - component factory function
+   * @param   {Array<Object>} slots - array containing the slots markup
+   * @param   {Array} attributes - dynamic attributes that will be received by the tag element
+   * @returns {TagImplementation|TemplateChunk} a tag implementation or a template chunk as fallback
+   */
+
+
+  function getTag(component, slots, attributes) {
+    if (slots === void 0) {
+      slots = [];
+    }
+
+    if (attributes === void 0) {
+      attributes = [];
+    }
+
+    // if this tag was registered before we will return its implementation
+    if (component) {
+      return component({
+        slots,
+        attributes
+      });
+    } // otherwise we return a template chunk
+
+
+    return create$6(slotsToMarkup(slots), [...slotBindings(slots), {
+      // the attributes should be registered as binding
+      // if we fallback to a normal template chunk
+      expressions: attributes.map(attr => {
+        return Object.assign({
+          type: ATTRIBUTE
+        }, attr);
+      })
+    }]);
+  }
+  /**
+   * Merge all the slots bindings into a single array
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {Array<Bindings>} flatten bindings array
+   */
+
+
+  function slotBindings(slots) {
+    return slots.reduce((acc, _ref12) => {
+      let {
+        bindings
+      } = _ref12;
+      return acc.concat(bindings);
+    }, []);
+  }
+  /**
+   * Merge all the slots together in a single markup string
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {string} markup of all the slots in a single string
+   */
+
+
+  function slotsToMarkup(slots) {
+    return slots.reduce((acc, slot) => {
+      return acc + slot.html;
+    }, '');
+  }
+
+  const TagBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    name: null,
+    slots: null,
+    tag: null,
+    attributes: null,
+    getComponent: null,
+
+    mount(scope) {
+      return this.update(scope);
+    },
+
+    update(scope, parentScope) {
+      const name = this.evaluate(scope); // simple update
+
+      if (name === this.name) {
+        this.tag.update(scope);
+      } else {
+        // unmount the old tag if it exists
+        this.unmount(scope, parentScope, true); // mount the new tag
+
+        this.name = name;
+        this.tag = getTag(this.getComponent(name), this.slots, this.attributes);
+        this.tag.mount(this.node, scope);
+      }
+
+      return this;
+    },
+
+    unmount(scope, parentScope, keepRootTag) {
+      if (this.tag) {
+        // keep the root tag
+        this.tag.unmount(keepRootTag);
+      }
+
+      return this;
+    }
+
+  });
+
+  function create$4(node, _ref13) {
+    let {
+      evaluate,
+      getComponent,
+      slots,
+      attributes
+    } = _ref13;
+    return Object.assign({}, TagBinding, {
+      node,
+      evaluate,
+      slots,
+      attributes,
+      getComponent
+    });
+  }
+
+  var bindings = {
+    [IF]: create$1,
+    [SIMPLE]: create$3,
+    [EACH]: create,
+    [TAG]: create$4,
+    [SLOT]: createSlot
+  };
+  /**
+   * Bind a new expression object to a DOM node
+   * @param   {HTMLElement} root - DOM node where to bind the expression
+   * @param   {Object} binding - binding data
+   * @returns {Expression} Expression object
+   */
+
+  function create$5(root, binding) {
+    const {
+      selector,
+      type,
+      redundantAttribute,
+      expressions
+    } = binding; // find the node to apply the bindings
+
+    const node = selector ? root.querySelector(selector) : root; // remove eventually additional attributes created only to select this node
+
+    if (redundantAttribute) node.removeAttribute(redundantAttribute); // init the binding
+
+    return (bindings[type] || bindings[SIMPLE])(node, Object.assign({}, binding, {
+      expressions: expressions || []
+    }));
+  }
+  /**
+   * Check if an element is part of an svg
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if we are in an svg context
+   */
+
+
+  function isSvg(el) {
+    const owner = el.ownerSVGElement;
+    return !!owner || owner === null;
+  } // in this case a simple innerHTML is enough
+
+
+  function createHTMLTree(html, root) {
+    const template = isTemplate(root) ? root : document.createElement('template');
+    template.innerHTML = html;
+    return template.content;
+  } // for svg nodes we need a bit more work
+
+
+  function createSVGTree(html, container) {
+    // create the SVGNode
+    const svgNode = container.ownerDocument.importNode(new window.DOMParser().parseFromString(`<svg xmlns="http://www.w3.org/2000/svg">${html}</svg>`, 'application/xml').documentElement, true);
+    return svgNode;
+  }
+  /**
+   * Create the DOM that will be injected
+   * @param {Object} root - DOM node to find out the context where the fragment will be created
+   * @param   {string} html - DOM to create as string
+   * @returns {HTMLDocumentFragment|HTMLElement} a new html fragment
+   */
+
+
+  function createDOMTree(root, html) {
+    if (isSvg(root)) return createSVGTree(html, root);
+    return createHTMLTree(html, root);
+  }
+  /**
+   * Move all the child nodes from a source tag to another
+   * @param   {HTMLElement} source - source node
+   * @param   {HTMLElement} target - target node
+   * @returns {undefined} it's a void method ¯\_(ツ)_/¯
+   */
+  // Ignore this helper because it's needed only for svg tags
+
+  /* istanbul ignore next */
+
+
+  function moveChildren(source, target) {
+    if (source.firstChild) {
+      target.appendChild(source.firstChild);
+      moveChildren(source, target);
+    }
+  }
+  /**
+   * Inject the DOM tree into a target node
+   * @param   {HTMLElement} el - target element
+   * @param   {HTMLFragment|SVGElement} dom - dom tree to inject
+   * @returns {undefined}
+   */
+
+
+  function injectDOM(el, dom) {
+    switch (true) {
+      case isSvg(el):
+        moveChildren(dom, el);
+        break;
+
+      case isTemplate(el):
+        el.parentNode.replaceChild(dom, el);
+        break;
+
+      default:
+        el.appendChild(dom);
+    }
+  }
+  /**
+   * Create the Template DOM skeleton
+   * @param   {HTMLElement} el - root node where the DOM will be injected
+   * @param   {string} html - markup that will be injected into the root node
+   * @returns {HTMLFragment} fragment that will be injected into the root node
+   */
+
+
+  function createTemplateDOM(el, html) {
+    return html && (typeof html === 'string' ? createDOMTree(el, html) : html);
+  }
+  /**
+   * Template Chunk model
+   * @type {Object}
+   */
+
+
+  const TemplateChunk = Object.freeze({
+    // Static props
+    bindings: null,
+    bindingsData: null,
+    html: null,
+    isTemplateTag: false,
+    fragment: null,
+    children: null,
+    dom: null,
+    el: null,
+
+    /**
+     * Create the template DOM structure that will be cloned on each mount
+     * @param   {HTMLElement} el - the root node
+     * @returns {TemplateChunk} self
+     */
+    createDOM(el) {
+      // make sure that the DOM gets created before cloning the template
+      this.dom = this.dom || createTemplateDOM(el, this.html);
+      return this;
+    },
+
+    // API methods
+
+    /**
+     * Attach the template to a DOM node
+     * @param   {HTMLElement} el - target DOM node
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {Object} meta - meta properties needed to handle the <template> tags in loops
+     * @returns {TemplateChunk} self
+     */
+    mount(el, scope, parentScope, meta) {
+      if (meta === void 0) {
+        meta = {};
+      }
+
+      if (!el) throw new Error('Please provide DOM node to mount properly your template');
+      if (this.el) this.unmount(scope); // <template> tags require a bit more work
+      // the template fragment might be already created via meta outside of this call
+
+      const {
+        fragment,
+        children,
+        avoidDOMInjection
+      } = meta; // <template> bindings of course can not have a root element
+      // so we check the parent node to set the query selector bindings
+
+      const {
+        parentNode
+      } = children ? children[0] : el;
+      this.isTemplateTag = isTemplate(el); // create the DOM if it wasn't created before
+
+      this.createDOM(el);
+
+      if (this.dom) {
+        // create the new template dom fragment if it want already passed in via meta
+        this.fragment = fragment || this.dom.cloneNode(true);
+      } // store root node
+      // notice that for template tags the root note will be the parent tag
+
+
+      this.el = this.isTemplateTag ? parentNode : el; // create the children array only for the <template> fragments
+
+      this.children = this.isTemplateTag ? children || Array.from(this.fragment.childNodes) : null; // inject the DOM into the el only if a fragment is available
+
+      if (!avoidDOMInjection && this.fragment) injectDOM(el, this.fragment); // create the bindings
+
+      this.bindings = this.bindingsData.map(binding => create$5(this.el, binding));
+      this.bindings.forEach(b => b.mount(scope, parentScope));
+      return this;
+    },
+
+    /**
+     * Update the template with fresh data
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @returns {TemplateChunk} self
+     */
+    update(scope, parentScope) {
+      this.bindings.forEach(b => b.update(scope, parentScope));
+      return this;
+    },
+
+    /**
+     * Remove the template from the node where it was initially mounted
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {boolean|null} mustRemoveRoot - if true remove the root element,
+     * if false or undefined clean the root tag content, if null don't touch the DOM
+     * @returns {TemplateChunk} self
+     */
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.el) {
+        this.bindings.forEach(b => b.unmount(scope, parentScope, mustRemoveRoot));
+
+        switch (true) {
+          // <template> tags should be treated a bit differently
+          // we need to clear their children only if it's explicitly required by the caller
+          // via mustRemoveRoot !== null
+          case this.isTemplateTag === true && mustRemoveRoot !== null:
+            clearChildren(this.children);
+            break;
+          // remove the root node only if the mustRemoveRoot === true
+
+          case mustRemoveRoot === true && this.el.parentNode !== null:
+            this.el.parentNode.removeChild(this.el);
+            break;
+          // otherwise we clean the node children
+
+          case mustRemoveRoot !== null:
+            cleanNode(this.el);
+            break;
+        }
+
+        this.el = null;
+      }
+
+      return this;
+    },
+
+    /**
+     * Clone the template chunk
+     * @returns {TemplateChunk} a clone of this object resetting the this.el property
+     */
+    clone() {
+      return Object.assign({}, this, {
+        el: null
+      });
+    }
+
+  });
+  /**
+   * Create a template chunk wiring also the bindings
+   * @param   {string|HTMLElement} html - template string
+   * @param   {Array} bindings - bindings collection
+   * @returns {TemplateChunk} a new TemplateChunk copy
+   */
+
+  function create$6(html, bindings) {
+    if (bindings === void 0) {
+      bindings = [];
+    }
+
+    return Object.assign({}, TemplateChunk, {
+      html,
+      bindingsData: bindings
+    });
+  }
+
+  /**
+   * Quick type checking
+   * @param   {*} element - anything
+   * @param   {string} type - type definition
+   * @returns {boolean} true if the type corresponds
+   */
+  function checkType(element, type) {
+    return typeof element === type;
+  }
+  /**
+   * Check that will be passed if its argument is a function
+   * @param   {*} value - value to check
+   * @returns {boolean} - true if the value is a function
+   */
+
+  function isFunction(value) {
+    return checkType(value, 'function');
+  }
+
+  /* eslint-disable fp/no-mutating-methods */
+  /**
+   * Throw an error
+   * @param {string} error - error message
+   * @returns {undefined} it's a IO void function
+   */
+
+  function panic(error) {
+    throw new Error(error);
+  }
+  /**
+   * Call the first argument received only if it's a function otherwise return it as it is
+   * @param   {*} source - anything
+   * @returns {*} anything
+   */
+
+  function callOrAssign(source) {
+    return isFunction(source) ? source.prototype && source.prototype.constructor ? new source() : source() : source;
+  }
+  /**
+   * Convert a string from camel case to dash-case
+   * @param   {string} string - probably a component tag name
+   * @returns {string} component name normalized
+   */
+
+  function camelToDashCase(string) {
+    return string.replace(/([a-z])([A-Z])/g, '$1-$2').toLowerCase();
+  }
+  /**
+   * Convert a string containing dashes to camel case
+   * @param   {string} string - input string
+   * @returns {string} my-string -> myString
+   */
+
+  function dashToCamelCase(string) {
+    return string.replace(/-(\w)/g, (_, c) => c.toUpperCase());
+  }
+  /**
+   * Define default properties if they don't exist on the source object
+   * @param   {Object} source - object that will receive the default properties
+   * @param   {Object} defaults - object containing additional optional keys
+   * @returns {Object} the original object received enhanced
+   */
+
+  function defineDefaults(source, defaults) {
+    Object.entries(defaults).forEach((_ref) => {
+      let [key, value] = _ref;
+      if (!source[key]) source[key] = value;
+    });
+    return source;
+  } // doese simply nothing
+
+  function noop() {
+    return this;
+  }
+  /**
+   * Autobind the methods of a source object to itself
+   * @param   {Object} source - probably a riot tag instance
+   * @param   {Array<string>} methods - list of the methods to autobind
+   * @returns {Object} the original object received
+   */
+
+  function autobindMethods(source, methods) {
+    methods.forEach(method => {
+      source[method] = source[method].bind(source);
+    });
+    return source;
+  }
+  /**
+   * Helper function to set an immutable property
+   * @param   {Object} source - object where the new property will be set
+   * @param   {string} key - object key where the new property will be stored
+   * @param   {*} value - value of the new property
+   * @param   {Object} options - set the propery overriding the default options
+   * @returns {Object} - the original object modified
+   */
+
+  function defineProperty(source, key, value, options) {
+    if (options === void 0) {
+      options = {};
+    }
+
+    Object.defineProperty(source, key, Object.assign({
+      value,
+      enumerable: false,
+      writable: false,
+      configurable: true
+    }, options));
+    return source;
+  }
+  /**
+   * Define multiple properties on a target object
+   * @param   {Object} source - object where the new properties will be set
+   * @param   {Object} properties - object containing as key pair the key + value properties
+   * @param   {Object} options - set the propery overriding the default options
+   * @returns {Object} the original object modified
+   */
+
+  function defineProperties(source, properties, options) {
+    Object.entries(properties).forEach((_ref2) => {
+      let [key, value] = _ref2;
+      defineProperty(source, key, value, options);
+    });
+    return source;
+  }
+  /**
+   * Evaluate a list of attribute expressions
+   * @param   {Array} attributes - attribute expressions generated by the riot compiler
+   * @returns {Object} key value pairs with the result of the computation
+   */
+
+  function evaluateAttributeExpressions(attributes) {
+    return attributes.reduce((acc, attribute) => {
+      const {
+        value,
+        type
+      } = attribute;
+
+      switch (true) {
+        // spread attribute
+        case !attribute.name && type === expressionTypes.ATTRIBUTE:
+          return Object.assign({}, acc, {}, value);
+        // value attribute
+
+        case type === expressionTypes.VALUE:
+          acc[VALUE_ATTRIBUTE] = attribute.value;
+          break;
+        // normal attributes
+
+        default:
+          acc[dashToCamelCase(attribute.name)] = attribute.value;
+      }
+
+      return acc;
+    }, {});
+  }
+
+  /**
+   * Converts any DOM node/s to a loopable array
+   * @param   { HTMLElement|NodeList } els - single html element or a node list
+   * @returns { Array } always a loopable object
+   */
+  function domToArray(els) {
+    // can this object be already looped?
+    if (!Array.isArray(els)) {
+      // is it a node list?
+      if (/^\[object (HTMLCollection|NodeList|Object)\]$/.test(Object.prototype.toString.call(els)) && typeof els.length === 'number') return Array.from(els);else // if it's a single node
+        // it will be returned as "array" with one single entry
+        return [els];
+    } // this object could be looped out of the box
+
+
+    return els;
+  }
+
+  /**
+   * Normalize the return values, in case of a single value we avoid to return an array
+   * @param   { Array } values - list of values we want to return
+   * @returns { Array|string|boolean } either the whole list of values or the single one found
+   * @private
+   */
+
+  const normalize = values => values.length === 1 ? values[0] : values;
+  /**
+   * Parse all the nodes received to get/remove/check their attributes
+   * @param   { HTMLElement|NodeList|Array } els    - DOM node/s to parse
+   * @param   { string|Array }               name   - name or list of attributes
+   * @param   { string }                     method - method that will be used to parse the attributes
+   * @returns { Array|string } result of the parsing in a list or a single value
+   * @private
+   */
+
+
+  function parseNodes(els, name, method) {
+    const names = typeof name === 'string' ? [name] : name;
+    return normalize(domToArray(els).map(el => {
+      return normalize(names.map(n => el[method](n)));
+    }));
+  }
+  /**
+   * Set any attribute on a single or a list of DOM nodes
+   * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+   * @param   { string|Object }              name  - either the name of the attribute to set
+   *                                                 or a list of properties as object key - value
+   * @param   { string }                     value - the new value of the attribute (optional)
+   * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+   *
+   * @example
+   *
+   * import { set } from 'bianco.attr'
+   *
+   * const img = document.createElement('img')
+   *
+   * set(img, 'width', 100)
+   *
+   * // or also
+   * set(img, {
+   *   width: 300,
+   *   height: 300
+   * })
+   *
+   */
+
+
+  function set(els, name, value) {
+    const attrs = typeof name === 'object' ? name : {
+      [name]: value
+    };
+    const props = Object.keys(attrs);
+    domToArray(els).forEach(el => {
+      props.forEach(prop => el.setAttribute(prop, attrs[prop]));
+    });
+    return els;
+  }
+  /**
+   * Get any attribute from a single or a list of DOM nodes
+   * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+   * @param   { string|Array }               name  - name or list of attributes to get
+   * @returns { Array|string } list of the attributes found
+   *
+   * @example
+   *
+   * import { get } from 'bianco.attr'
+   *
+   * const img = document.createElement('img')
+   *
+   * get(img, 'width') // => '200'
+   *
+   * // or also
+   * get(img, ['width', 'height']) // => ['200', '300']
+   *
+   * // or also
+   * get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+   */
+
+  function get(els, name) {
+    return parseNodes(els, name, 'getAttribute');
+  }
+
+  /**
+   * Get all the element attributes as object
+   * @param   {HTMLElement} element - DOM node we want to parse
+   * @returns {Object} all the attributes found as a key value pairs
+   */
+
+  function DOMattributesToObject(element) {
+    return Array.from(element.attributes).reduce((acc, attribute) => {
+      acc[dashToCamelCase(attribute.name)] = attribute.value;
+      return acc;
+    }, {});
+  }
+  /**
+   * Get the tag name of any DOM node
+   * @param   {HTMLElement} element - DOM node we want to inspect
+   * @returns {string} name to identify this dom node in riot
+   */
+
+  function getName(element) {
+    return get(element, IS_DIRECTIVE) || element.tagName.toLowerCase();
+  }
+
+  /**
+   * Simple helper to find DOM nodes returning them as array like loopable object
+   * @param   { string|DOMNodeList } selector - either the query or the DOM nodes to arraify
+   * @param   { HTMLElement }        ctx      - context defining where the query will search for the DOM nodes
+   * @returns { Array } DOM nodes found as array
+   */
+
+  function $(selector, ctx) {
+    return domToArray(typeof selector === 'string' ? (ctx || document).querySelectorAll(selector) : selector);
+  }
+
+  const CSS_BY_NAME = new Map();
+  const STYLE_NODE_SELECTOR = 'style[riot]'; // memoized curried function
+
+  const getStyleNode = (style => {
+    return () => {
+      // lazy evaluation:
+      // if this function was already called before
+      // we return its cached result
+      if (style) return style; // create a new style element or use an existing one
+      // and cache it internally
+
+      style = $(STYLE_NODE_SELECTOR)[0] || document.createElement('style');
+      set(style, 'type', 'text/css');
+      /* istanbul ignore next */
+
+      if (!style.parentNode) document.head.appendChild(style);
+      return style;
+    };
+  })();
+  /**
+   * Object that will be used to inject and manage the css of every tag instance
+   */
+
+
+  var cssManager = {
+    CSS_BY_NAME,
+
+    /**
+     * Save a tag style to be later injected into DOM
+     * @param { string } name - if it's passed we will map the css to a tagname
+     * @param { string } css - css string
+     * @returns {Object} self
+     */
+    add(name, css) {
+      if (!CSS_BY_NAME.has(name)) {
+        CSS_BY_NAME.set(name, css);
+        this.inject();
+      }
+
+      return this;
+    },
+
+    /**
+     * Inject all previously saved tag styles into DOM
+     * innerHTML seems slow: http://jsperf.com/riot-insert-style
+     * @returns {Object} self
+     */
+    inject() {
+      getStyleNode().innerHTML = [...CSS_BY_NAME.values()].join('\n');
+      return this;
+    },
+
+    /**
+     * Remove a tag style from the DOM
+     * @param {string} name a registered tagname
+     * @returns {Object} self
+     */
+    remove(name) {
+      if (CSS_BY_NAME.has(name)) {
+        CSS_BY_NAME.delete(name);
+        this.inject();
+      }
+
+      return this;
+    }
+
+  };
+
+  /**
+   * Function to curry any javascript method
+   * @param   {Function}  fn - the target function we want to curry
+   * @param   {...[args]} acc - initial arguments
+   * @returns {Function|*} it will return a function until the target function
+   *                       will receive all of its arguments
+   */
+  function curry(fn) {
+    for (var _len = arguments.length, acc = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      acc[_key - 1] = arguments[_key];
+    }
+
+    return function () {
+      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        args[_key2] = arguments[_key2];
+      }
+
+      args = [...acc, ...args];
+      return args.length < fn.length ? curry(fn, ...args) : fn(...args);
+    };
+  }
+
+  const COMPONENT_CORE_HELPERS = Object.freeze({
+    // component helpers
+    $(selector) {
+      return $(selector, this.root)[0];
+    },
+
+    $$(selector) {
+      return $(selector, this.root);
+    }
+
+  });
+  const COMPONENT_LIFECYCLE_METHODS = Object.freeze({
+    shouldUpdate: noop,
+    onBeforeMount: noop,
+    onMounted: noop,
+    onBeforeUpdate: noop,
+    onUpdated: noop,
+    onBeforeUnmount: noop,
+    onUnmounted: noop
+  });
+  const MOCKED_TEMPLATE_INTERFACE = {
+    update: noop,
+    mount: noop,
+    unmount: noop,
+    clone: noop,
+    createDOM: noop
+    /**
+     * Factory function to create the component templates only once
+     * @param   {Function} template - component template creation function
+     * @param   {Object} components - object containing the nested components
+     * @returns {TemplateChunk} template chunk object
+     */
+
+  };
+
+  function componentTemplateFactory(template, components) {
+    return template(create$6, expressionTypes, bindingTypes, name => {
+      return components[name] || COMPONENTS_IMPLEMENTATION_MAP.get(name);
+    });
+  }
+  /**
+   * Create the component interface needed for the @riotjs/dom-bindings tag bindings
+   * @param   {string} options.css - component css
+   * @param   {Function} options.template - functon that will return the dom-bindings template function
+   * @param   {Object} options.exports - component interface
+   * @param   {string} options.name - component name
+   * @returns {Object} component like interface
+   */
+
+
+  function createComponent(_ref) {
+    let {
+      css,
+      template,
+      exports,
+      name
+    } = _ref;
+    const templateFn = template ? componentTemplateFactory(template, exports ? createSubcomponents(exports.components) : {}) : MOCKED_TEMPLATE_INTERFACE;
+    return (_ref2) => {
+      let {
+        slots,
+        attributes,
+        props
+      } = _ref2;
+      const componentAPI = callOrAssign(exports) || {};
+      const component = defineComponent({
+        css,
+        template: templateFn,
+        componentAPI,
+        name
+      })({
+        slots,
+        attributes,
+        props
+      }); // notice that for the components create via tag binding
+      // we need to invert the mount (state/parentScope) arguments
+      // the template bindings will only forward the parentScope updates
+      // and never deal with the component state
+
+      return {
+        mount(element, parentScope, state) {
+          return component.mount(element, state, parentScope);
+        },
+
+        update(parentScope, state) {
+          return component.update(state, parentScope);
+        },
+
+        unmount(preserveRoot) {
+          return component.unmount(preserveRoot);
+        }
+
+      };
+    };
+  }
+  /**
+   * Component definition function
+   * @param   {Object} implementation - the componen implementation will be generated via compiler
+   * @param   {Object} component - the component initial properties
+   * @returns {Object} a new component implementation object
+   */
+
+  function defineComponent(_ref3) {
+    let {
+      css,
+      template,
+      componentAPI,
+      name
+    } = _ref3;
+    // add the component css into the DOM
+    if (css && name) cssManager.add(name, css);
+    return curry(enhanceComponentAPI)(defineProperties( // set the component defaults without overriding the original component API
+    defineDefaults(componentAPI, Object.assign({}, COMPONENT_LIFECYCLE_METHODS, {
+      state: {}
+    })), Object.assign({
+      // defined during the component creation
+      slots: null,
+      root: null
+    }, COMPONENT_CORE_HELPERS, {
+      name,
+      css,
+      template
+    })));
+  }
+  /**
+   * Evaluate the component properties either from its real attributes or from its attribute expressions
+   * @param   {HTMLElement} element - component root
+   * @param   {Array}  attributeExpressions - attribute values generated via createAttributeBindings
+   * @returns {Object} attributes key value pairs
+   */
+
+  function evaluateProps(element, attributeExpressions) {
+    if (attributeExpressions === void 0) {
+      attributeExpressions = [];
+    }
+
+    return Object.assign({}, DOMattributesToObject(element), {}, evaluateAttributeExpressions(attributeExpressions));
+  }
+  /**
+   * Create the bindings to update the component attributes
+   * @param   {HTMLElement} node - node where we will bind the expressions
+   * @param   {Array} attributes - list of attribute bindings
+   * @returns {TemplateChunk} - template bindings object
+   */
+
+
+  function createAttributeBindings(node, attributes) {
+    if (attributes === void 0) {
+      attributes = [];
+    }
+
+    const expressions = attributes.map(a => create$2(node, a));
+    const binding = {};
+
+    const updateValues = method => scope => {
+      expressions.forEach(e => e[method](scope));
+      return binding;
+    };
+
+    return Object.assign(binding, {
+      expressions,
+      mount: updateValues('mount'),
+      update: updateValues('update'),
+      unmount: updateValues('unmount')
+    });
+  }
+  /**
+   * Create the subcomponents that can be included inside a tag in runtime
+   * @param   {Object} components - components imported in runtime
+   * @returns {Object} all the components transformed into Riot.Component factory functions
+   */
+
+
+  function createSubcomponents(components) {
+    if (components === void 0) {
+      components = {};
+    }
+
+    return Object.entries(callOrAssign(components)).reduce((acc, _ref4) => {
+      let [key, value] = _ref4;
+      acc[camelToDashCase(key)] = createComponent(value);
+      return acc;
+    }, {});
+  }
+  /**
+   * Run the component instance through all the plugins set by the user
+   * @param   {Object} component - component instance
+   * @returns {Object} the component enhanced by the plugins
+   */
+
+
+  function runPlugins(component) {
+    return [...PLUGINS_SET].reduce((c, fn) => fn(c) || c, component);
+  }
+  /**
+   * Compute the component current state merging it with its previous state
+   * @param   {Object} oldState - previous state object
+   * @param   {Object} newState - new state givent to the `update` call
+   * @returns {Object} new object state
+   */
+
+
+  function computeState(oldState, newState) {
+    return Object.assign({}, oldState, {}, callOrAssign(newState));
+  }
+  /**
+   * Add eventually the "is" attribute to link this DOM node to its css
+   * @param {HTMLElement} element - target root node
+   * @param {string} name - name of the component mounted
+   * @returns {undefined} it's a void function
+   */
+
+
+  function addCssHook(element, name) {
+    if (getName(element) !== name) {
+      set(element, 'is', name);
+    }
+  }
+  /**
+   * Component creation factory function that will enhance the user provided API
+   * @param   {Object} component - a component implementation previously defined
+   * @param   {Array} options.slots - component slots generated via riot compiler
+   * @param   {Array} options.attributes - attribute expressions generated via riot compiler
+   * @returns {Riot.Component} a riot component instance
+   */
+
+
+  function enhanceComponentAPI(component, _ref5) {
+    let {
+      slots,
+      attributes,
+      props
+    } = _ref5;
+    const initialProps = callOrAssign(props);
+    return autobindMethods(runPlugins(defineProperties(Object.create(component), {
+      mount(element, state, parentScope) {
+        if (state === void 0) {
+          state = {};
+        }
+
+        this[ATTRIBUTES_KEY_SYMBOL] = createAttributeBindings(element, attributes).mount(parentScope);
+        this.props = Object.freeze(Object.assign({}, initialProps, {}, evaluateProps(element, this[ATTRIBUTES_KEY_SYMBOL].expressions)));
+        this.state = computeState(this.state, state);
+        this[TEMPLATE_KEY_SYMBOL] = this.template.createDOM(element).clone(); // link this object to the DOM node
+
+        element[DOM_COMPONENT_INSTANCE_PROPERTY] = this; // add eventually the 'is' attribute
+
+        component.name && addCssHook(element, component.name); // define the root element
+
+        defineProperty(this, 'root', element); // define the slots array
+
+        defineProperty(this, 'slots', slots); // before mount lifecycle event
+
+        this.onBeforeMount(this.props, this.state); // mount the template
+
+        this[TEMPLATE_KEY_SYMBOL].mount(element, this, parentScope);
+        this.onMounted(this.props, this.state);
+        return this;
+      },
+
+      update(state, parentScope) {
+        if (state === void 0) {
+          state = {};
+        }
+
+        if (parentScope) {
+          this[ATTRIBUTES_KEY_SYMBOL].update(parentScope);
+        }
+
+        const newProps = evaluateProps(this.root, this[ATTRIBUTES_KEY_SYMBOL].expressions);
+        if (this.shouldUpdate(newProps, this.props) === false) return;
+        this.props = Object.freeze(Object.assign({}, initialProps, {}, newProps));
+        this.state = computeState(this.state, state);
+        this.onBeforeUpdate(this.props, this.state);
+        this[TEMPLATE_KEY_SYMBOL].update(this, parentScope);
+        this.onUpdated(this.props, this.state);
+        return this;
+      },
+
+      unmount(preserveRoot) {
+        this.onBeforeUnmount(this.props, this.state);
+        this[ATTRIBUTES_KEY_SYMBOL].unmount(); // if the preserveRoot is null the template html will be left untouched
+        // in that case the DOM cleanup will happen differently from a parent node
+
+        this[TEMPLATE_KEY_SYMBOL].unmount(this, {}, preserveRoot === null ? null : !preserveRoot);
+        this.onUnmounted(this.props, this.state);
+        return this;
+      }
+
+    })), Object.keys(component).filter(prop => isFunction(component[prop])));
+  }
+  /**
+   * Component initialization function starting from a DOM node
+   * @param   {HTMLElement} element - element to upgrade
+   * @param   {Object} initialProps - initial component properties
+   * @param   {string} componentName - component id
+   * @returns {Object} a new component instance bound to a DOM node
+   */
+
+  function mountComponent(element, initialProps, componentName) {
+    const name = componentName || getName(element);
+    if (!COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component named "${name}" was never registered`);
+    const component = COMPONENTS_IMPLEMENTATION_MAP.get(name)({
+      props: initialProps
+    });
+    return component.mount(element);
+  }
+
+  /**
+   * Similar to compose but performs from left-to-right function composition.<br/>
+   * {@link https://30secondsofcode.org/function#composeright see also}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+  /**
+   * Performs right-to-left function composition.<br/>
+   * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+   * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+   * {@link https://30secondsofcode.org/function#compose original source code}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+
+  function compose() {
+    for (var _len2 = arguments.length, fns = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      fns[_key2] = arguments[_key2];
+    }
+
+    return fns.reduce((f, g) => function () {
+      return f(g(...arguments));
+    });
+  }
+
+  const {
+    DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY$1,
+    COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP$1,
+    PLUGINS_SET: PLUGINS_SET$1
+  } = globals;
+  /**
+   * Riot public api
+   */
+
+  /**
+   * Register a custom tag by name
+   * @param   {string} name - component name
+   * @param   {Object} implementation - tag implementation
+   * @returns {Map} map containing all the components implementations
+   */
+
+  function register(name, _ref) {
+    let {
+      css,
+      template,
+      exports
+    } = _ref;
+    if (COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was already registered`);
+    COMPONENTS_IMPLEMENTATION_MAP$1.set(name, createComponent({
+      name,
+      css,
+      template,
+      exports
+    }));
+    return COMPONENTS_IMPLEMENTATION_MAP$1;
+  }
+  /**
+   * Unregister a riot web component
+   * @param   {string} name - component name
+   * @returns {Map} map containing all the components implementations
+   */
+
+  function unregister(name) {
+    if (!COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was never registered`);
+    COMPONENTS_IMPLEMENTATION_MAP$1.delete(name);
+    cssManager.remove(name);
+    return COMPONENTS_IMPLEMENTATION_MAP$1;
+  }
+  /**
+   * Mounting function that will work only for the components that were globally registered
+   * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+   * @param   {Object} initialProps - the initial component properties
+   * @param   {string} name - optional component name
+   * @returns {Array} list of nodes upgraded
+   */
+
+  function mount(selector, initialProps, name) {
+    return $(selector).map(element => mountComponent(element, initialProps, name));
+  }
+  /**
+   * Sweet unmounting helper function for the DOM node mounted manually by the user
+   * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+   * @param   {boolean|null} keepRootElement - if true keep the root element
+   * @returns {Array} list of nodes unmounted
+   */
+
+  function unmount(selector, keepRootElement) {
+    return $(selector).map(element => {
+      if (element[DOM_COMPONENT_INSTANCE_PROPERTY$1]) {
+        element[DOM_COMPONENT_INSTANCE_PROPERTY$1].unmount(keepRootElement);
+      }
+
+      return element;
+    });
+  }
+  /**
+   * Define a riot plugin
+   * @param   {Function} plugin - function that will receive all the components created
+   * @returns {Set} the set containing all the plugins installed
+   */
+
+  function install(plugin) {
+    if (!isFunction(plugin)) panic('Plugins must be of type function');
+    if (PLUGINS_SET$1.has(plugin)) panic('This plugin was already install');
+    PLUGINS_SET$1.add(plugin);
+    return PLUGINS_SET$1;
+  }
+  /**
+   * Uninstall a riot plugin
+   * @param   {Function} plugin - plugin previously installed
+   * @returns {Set} the set containing all the plugins installed
+   */
+
+  function uninstall(plugin) {
+    if (!PLUGINS_SET$1.has(plugin)) panic('This plugin was never installed');
+    PLUGINS_SET$1.delete(plugin);
+    return PLUGINS_SET$1;
+  }
+  /**
+   * Helpter method to create component without relying on the registered ones
+   * @param   {Object} implementation - component implementation
+   * @returns {Function} function that will allow you to mount a riot component on a DOM node
+   */
+
+  function component(implementation) {
+    return (el, props) => compose(c => c.mount(el), c => c({
+      props
+    }), createComponent)(implementation);
+  }
+  /** @type {string} current riot version */
+
+  const version = 'v4.5.0'; // expose some internal stuff that might be used from external tools
+
+  const __ = {
+    cssManager,
+    defineComponent,
+    globals
+  };
+
+  var riot = /*#__PURE__*/Object.freeze({
+    register: register,
+    unregister: unregister,
+    mount: mount,
+    unmount: unmount,
+    install: install,
+    uninstall: uninstall,
+    component: component,
+    version: version,
+    __: __
+  });
+
+  var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
+
+  function unwrapExports (x) {
+  	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+  }
+
+  function createCommonjsModule(fn, module) {
+  	return module = { exports: {} }, fn(module, module.exports), module.exports;
+  }
+
+  function getCjsExportFromNamespace (n) {
+  	return n && n['default'] || n;
+  }
+
+  var _empty_module = {};
+
+  var _empty_module$1 = /*#__PURE__*/Object.freeze({
+    'default': _empty_module
+  });
+
+  var require$$1 = getCjsExportFromNamespace(_empty_module$1);
+
+  var compiler=createCommonjsModule(function(module,exports){/* Riot Compiler v4.5.0, @license MIT */(function(global,factory){factory(exports,require$$1,require$$1);})(commonjsGlobal,function(exports,fs,path$1){fs=fs&&fs.hasOwnProperty('default')?fs['default']:fs;path$1=path$1&&path$1.hasOwnProperty('default')?path$1['default']:path$1;const TAG_LOGIC_PROPERTY='exports';const TAG_CSS_PROPERTY='css';const TAG_TEMPLATE_PROPERTY='template';const TAG_NAME_PROPERTY='name';function unwrapExports(x){return x&&x.__esModule&&Object.prototype.hasOwnProperty.call(x,'default')?x['default']:x;}function createCommonjsModule(fn,module){return module={exports:{}},fn(module,module.exports),module.exports;}function getCjsExportFromNamespace(n){return n&&n['default']||n;}var types=createCommonjsModule(function(module,exports){var __extends=this&&this.__extends||function(){var _extendStatics=function extendStatics(d,b){_extendStatics=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(d,b){d.__proto__=b;}||function(d,b){for(var p in b)if(b.hasOwnProperty(p))d[p]=b[p];};return _extendStatics(d,b);};return function(d,b){_extendStatics(d,b);function __(){this.constructor=d;}d.prototype=b===null?Object.create(b):(__.prototype=b.prototype,new __());};}();Object.defineProperty(exports,"__esModule",{value:true});var Op=Object.prototype;var objToStr=Op.toString;var hasOwn=Op.hasOwnProperty;var BaseType=/** @class */function(){function BaseType(){}BaseType.prototype.assert=function(value,deep){if(!this.check(value,deep)){var str=shallowStringify(value);throw new Error(str+" does not match type "+this);}return true;};BaseType.prototype.arrayOf=function(){var elemType=this;return new ArrayType(elemType);};return BaseType;}();var ArrayType=/** @class */function(_super){__extends(ArrayType,_super);function ArrayType(elemType){var _this=_super.call(this)||this;_this.elemType=elemType;_this.kind="ArrayType";return _this;}ArrayType.prototype.toString=function(){return "["+this.elemType+"]";};ArrayType.prototype.check=function(value,deep){var _this=this;return Array.isArray(value)&&value.every(function(elem){return _this.elemType.check(elem,deep);});};return ArrayType;}(BaseType);var IdentityType=/** @class */function(_super){__extends(IdentityType,_super);function IdentityType(value){var _this=_super.call(this)||this;_this.value=value;_this.kind="IdentityType";return _this;}IdentityType.prototype.toString=function(){return String(this.value);};IdentityType.prototype.check=function(value,deep){var result=value===this.value;if(!result&&typeof deep==="function"){deep(this,value);}return result;};return IdentityType;}(BaseType);var ObjectType=/** @class */function(_super){__extends(ObjectType,_super);function ObjectType(fields){var _this=_super.call(this)||this;_this.fields=fields;_this.kind="ObjectType";return _this;}ObjectType.prototype.toString=function(){return "{ "+this.fields.join(", ")+" }";};ObjectType.prototype.check=function(value,deep){return objToStr.call(value)===objToStr.call({})&&this.fields.every(function(field){return field.type.check(value[field.name],deep);});};return ObjectType;}(BaseType);var OrType=/** @class */function(_super){__extends(OrType,_super);function OrType(types){var _this=_super.call(this)||this;_this.types=types;_this.kind="OrType";return _this;}OrType.prototype.toString=function(){return this.types.join(" | ");};OrType.prototype.check=function(value,deep){return this.types.some(function(type){return type.check(value,deep);});};return OrType;}(BaseType);var PredicateType=/** @class */function(_super){__extends(PredicateType,_super);function PredicateType(name,predicate){var _this=_super.call(this)||this;_this.name=name;_this.predicate=predicate;_this.kind="PredicateType";return _this;}PredicateType.prototype.toString=function(){return this.name;};PredicateType.prototype.check=function(value,deep){var result=this.predicate(value,deep);if(!result&&typeof deep==="function"){deep(this,value);}return result;};return PredicateType;}(BaseType);var Def=/** @class */function(){function Def(type,typeName){this.type=type;this.typeName=typeName;this.baseNames=[];this.ownFields=Object.create(null);// Includes own typeName. Populated during finalization.
+  this.allSupertypes=Object.create(null);// Linear inheritance hierarchy. Populated during finalization.
+  this.supertypeList=[];// Includes inherited fields.
+  this.allFields=Object.create(null);// Non-hidden keys of allFields.
+  this.fieldNames=[];// This property will be overridden as true by individual Def instances
+  // when they are finalized.
+  this.finalized=false;// False by default until .build(...) is called on an instance.
+  this.buildable=false;this.buildParams=[];}Def.prototype.isSupertypeOf=function(that){if(that instanceof Def){if(this.finalized!==true||that.finalized!==true){throw new Error("");}return hasOwn.call(that.allSupertypes,this.typeName);}else{throw new Error(that+" is not a Def");}};Def.prototype.checkAllFields=function(value,deep){var allFields=this.allFields;if(this.finalized!==true){throw new Error(""+this.typeName);}function checkFieldByName(name){var field=allFields[name];var type=field.type;var child=field.getValue(value);return type.check(child,deep);}return value!==null&&typeof value==="object"&&Object.keys(allFields).every(checkFieldByName);};Def.prototype.bases=function(){var supertypeNames=[];for(var _i=0;_i<arguments.length;_i++){supertypeNames[_i]=arguments[_i];}var bases=this.baseNames;if(this.finalized){if(supertypeNames.length!==bases.length){throw new Error("");}for(var i=0;i<supertypeNames.length;i++){if(supertypeNames[i]!==bases[i]){throw new Error("");}}return this;}supertypeNames.forEach(function(baseName){// This indexOf lookup may be O(n), but the typical number of base
+  // names is very small, and indexOf is a native Array method.
+  if(bases.indexOf(baseName)<0){bases.push(baseName);}});return this;// For chaining.
+  };return Def;}();exports.Def=Def;var Field=/** @class */function(){function Field(name,type,defaultFn,hidden){this.name=name;this.type=type;this.defaultFn=defaultFn;this.hidden=!!hidden;}Field.prototype.toString=function(){return JSON.stringify(this.name)+": "+this.type;};Field.prototype.getValue=function(obj){var value=obj[this.name];if(typeof value!=="undefined"){return value;}if(typeof this.defaultFn==="function"){value=this.defaultFn.call(obj);}return value;};return Field;}();function shallowStringify(value){if(Array.isArray(value)){return "["+value.map(shallowStringify).join(", ")+"]";}if(value&&typeof value==="object"){return "{ "+Object.keys(value).map(function(key){return key+": "+value[key];}).join(", ")+" }";}return JSON.stringify(value);}function typesPlugin(_fork){var Type={or:function or(){var types=[];for(var _i=0;_i<arguments.length;_i++){types[_i]=arguments[_i];}return new OrType(types.map(function(type){return Type.from(type);}));},from:function from(value,name){if(value instanceof ArrayType||value instanceof IdentityType||value instanceof ObjectType||value instanceof OrType||value instanceof PredicateType){return value;}// The Def type is used as a helper for constructing compound
+  // interface types for AST nodes.
+  if(value instanceof Def){return value.type;}// Support [ElemType] syntax.
+  if(isArray.check(value)){if(value.length!==1){throw new Error("only one element type is permitted for typed arrays");}return new ArrayType(Type.from(value[0]));}// Support { someField: FieldType, ... } syntax.
+  if(isObject.check(value)){return new ObjectType(Object.keys(value).map(function(name){return new Field(name,Type.from(value[name],name));}));}if(typeof value==="function"){var bicfIndex=builtInCtorFns.indexOf(value);if(bicfIndex>=0){return builtInCtorTypes[bicfIndex];}if(typeof name!=="string"){throw new Error("missing name");}return new PredicateType(name,value);}// As a last resort, toType returns a type that matches any value that
+  // is === from. This is primarily useful for literal values like
+  // toType(null), but it has the additional advantage of allowing
+  // toType to be a total function.
+  return new IdentityType(value);},// Define a type whose name is registered in a namespace (the defCache) so
+  // that future definitions will return the same type given the same name.
+  // In particular, this system allows for circular and forward definitions.
+  // The Def object d returned from Type.def may be used to configure the
+  // type d.type by calling methods such as d.bases, d.build, and d.field.
+  def:function def(typeName){return hasOwn.call(defCache,typeName)?defCache[typeName]:defCache[typeName]=new DefImpl(typeName);},hasDef:function hasDef(typeName){return hasOwn.call(defCache,typeName);}};var builtInCtorFns=[];var builtInCtorTypes=[];var builtInTypes={};function defBuiltInType(example,name){var objStr=objToStr.call(example);var type=new PredicateType(name,function(value){return objToStr.call(value)===objStr;});builtInTypes[name]=type;if(example&&typeof example.constructor==="function"){builtInCtorFns.push(example.constructor);builtInCtorTypes.push(type);}return type;}// These types check the underlying [[Class]] attribute of the given
+  // value, rather than using the problematic typeof operator. Note however
+  // that no subtyping is considered; so, for instance, isObject.check
+  // returns false for [], /./, new Date, and null.
+  var isString=defBuiltInType("truthy","string");var isFunction=defBuiltInType(function(){},"function");var isArray=defBuiltInType([],"array");var isObject=defBuiltInType({},"object");var isRegExp=defBuiltInType(/./,"RegExp");var isDate=defBuiltInType(new Date(),"Date");var isNumber=defBuiltInType(3,"number");var isBoolean=defBuiltInType(true,"boolean");var isNull=defBuiltInType(null,"null");var isUndefined=defBuiltInType(void 0,"undefined");// In order to return the same Def instance every time Type.def is called
+  // with a particular name, those instances need to be stored in a cache.
+  var defCache=Object.create(null);function defFromValue(value){if(value&&typeof value==="object"){var type=value.type;if(typeof type==="string"&&hasOwn.call(defCache,type)){var d=defCache[type];if(d.finalized){return d;}}}return null;}var DefImpl=/** @class */function(_super){__extends(DefImpl,_super);function DefImpl(typeName){var _this=_super.call(this,new PredicateType(typeName,function(value,deep){return _this.check(value,deep);}),typeName)||this;return _this;}DefImpl.prototype.check=function(value,deep){if(this.finalized!==true){throw new Error("prematurely checking unfinalized type "+this.typeName);}// A Def type can only match an object value.
+  if(value===null||typeof value!=="object"){return false;}var vDef=defFromValue(value);if(!vDef){// If we couldn't infer the Def associated with the given value,
+  // and we expected it to be a SourceLocation or a Position, it was
+  // probably just missing a "type" field (because Esprima does not
+  // assign a type property to such nodes). Be optimistic and let
+  // this.checkAllFields make the final decision.
+  if(this.typeName==="SourceLocation"||this.typeName==="Position"){return this.checkAllFields(value,deep);}// Calling this.checkAllFields for any other type of node is both
+  // bad for performance and way too forgiving.
+  return false;}// If checking deeply and vDef === this, then we only need to call
+  // checkAllFields once. Calling checkAllFields is too strict when deep
+  // is false, because then we only care about this.isSupertypeOf(vDef).
+  if(deep&&vDef===this){return this.checkAllFields(value,deep);}// In most cases we rely exclusively on isSupertypeOf to make O(1)
+  // subtyping determinations. This suffices in most situations outside
+  // of unit tests, since interface conformance is checked whenever new
+  // instances are created using builder functions.
+  if(!this.isSupertypeOf(vDef)){return false;}// The exception is when deep is true; then, we recursively check all
+  // fields.
+  if(!deep){return true;}// Use the more specific Def (vDef) to perform the deep check, but
+  // shallow-check fields defined by the less specific Def (this).
+  return vDef.checkAllFields(value,deep)&&this.checkAllFields(value,false);};DefImpl.prototype.build=function(){var _this=this;var buildParams=[];for(var _i=0;_i<arguments.length;_i++){buildParams[_i]=arguments[_i];}// Calling Def.prototype.build multiple times has the effect of merely
+  // redefining this property.
+  this.buildParams=buildParams;if(this.buildable){// If this Def is already buildable, update self.buildParams and
+  // continue using the old builder function.
+  return this;}// Every buildable type will have its "type" field filled in
+  // automatically. This includes types that are not subtypes of Node,
+  // like SourceLocation, but that seems harmless (TODO?).
+  this.field("type",String,function(){return _this.typeName;});// Override Dp.buildable for this Def instance.
+  this.buildable=true;var addParam=function addParam(built,param,arg,isArgAvailable){if(hasOwn.call(built,param))return;var all=_this.allFields;if(!hasOwn.call(all,param)){throw new Error(""+param);}var field=all[param];var type=field.type;var value;if(isArgAvailable){value=arg;}else if(field.defaultFn){// Expose the partially-built object to the default
+  // function as its `this` object.
+  value=field.defaultFn.call(built);}else{var message="no value or default function given for field "+JSON.stringify(param)+" of "+_this.typeName+"("+_this.buildParams.map(function(name){return all[name];}).join(", ")+")";throw new Error(message);}if(!type.check(value)){throw new Error(shallowStringify(value)+" does not match field "+field+" of type "+_this.typeName);}built[param]=value;};// Calling the builder function will construct an instance of the Def,
+  // with positional arguments mapped to the fields original passed to .build.
+  // If not enough arguments are provided, the default value for the remaining fields
+  // will be used.
+  var builder=function builder(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var argc=args.length;if(!_this.finalized){throw new Error("attempting to instantiate unfinalized type "+_this.typeName);}var built=Object.create(nodePrototype);_this.buildParams.forEach(function(param,i){if(i<argc){addParam(built,param,args[i],true);}else{addParam(built,param,null,false);}});Object.keys(_this.allFields).forEach(function(param){// Use the default value.
+  addParam(built,param,null,false);});// Make sure that the "type" field was filled automatically.
+  if(built.type!==_this.typeName){throw new Error("");}return built;};// Calling .from on the builder function will construct an instance of the Def,
+  // using field values from the passed object. For fields missing from the passed object,
+  // their default value will be used.
+  builder.from=function(obj){if(!_this.finalized){throw new Error("attempting to instantiate unfinalized type "+_this.typeName);}var built=Object.create(nodePrototype);Object.keys(_this.allFields).forEach(function(param){if(hasOwn.call(obj,param)){addParam(built,param,obj[param],true);}else{addParam(built,param,null,false);}});// Make sure that the "type" field was filled automatically.
+  if(built.type!==_this.typeName){throw new Error("");}return built;};Object.defineProperty(builders,getBuilderName(this.typeName),{enumerable:true,value:builder});return this;};// The reason fields are specified using .field(...) instead of an object
+  // literal syntax is somewhat subtle: the object literal syntax would
+  // support only one key and one value, but with .field(...) we can pass
+  // any number of arguments to specify the field.
+  DefImpl.prototype.field=function(name,type,defaultFn,hidden){if(this.finalized){console.error("Ignoring attempt to redefine field "+JSON.stringify(name)+" of finalized type "+JSON.stringify(this.typeName));return this;}this.ownFields[name]=new Field(name,Type.from(type),defaultFn,hidden);return this;// For chaining.
+  };DefImpl.prototype.finalize=function(){var _this=this;// It's not an error to finalize a type more than once, but only the
+  // first call to .finalize does anything.
+  if(!this.finalized){var allFields=this.allFields;var allSupertypes=this.allSupertypes;this.baseNames.forEach(function(name){var def=defCache[name];if(def instanceof Def){def.finalize();extend(allFields,def.allFields);extend(allSupertypes,def.allSupertypes);}else{var message="unknown supertype name "+JSON.stringify(name)+" for subtype "+JSON.stringify(_this.typeName);throw new Error(message);}});// TODO Warn if fields are overridden with incompatible types.
+  extend(allFields,this.ownFields);allSupertypes[this.typeName]=this;this.fieldNames.length=0;for(var fieldName in allFields){if(hasOwn.call(allFields,fieldName)&&!allFields[fieldName].hidden){this.fieldNames.push(fieldName);}}// Types are exported only once they have been finalized.
+  Object.defineProperty(namedTypes,this.typeName,{enumerable:true,value:this.type});this.finalized=true;// A linearization of the inheritance hierarchy.
+  populateSupertypeList(this.typeName,this.supertypeList);if(this.buildable&&this.supertypeList.lastIndexOf("Expression")>=0){wrapExpressionBuilderWithStatement(this.typeName);}}};return DefImpl;}(Def);// Note that the list returned by this function is a copy of the internal
+  // supertypeList, *without* the typeName itself as the first element.
+  function getSupertypeNames(typeName){if(!hasOwn.call(defCache,typeName)){throw new Error("");}var d=defCache[typeName];if(d.finalized!==true){throw new Error("");}return d.supertypeList.slice(1);}// Returns an object mapping from every known type in the defCache to the
+  // most specific supertype whose name is an own property of the candidates
+  // object.
+  function computeSupertypeLookupTable(candidates){var table={};var typeNames=Object.keys(defCache);var typeNameCount=typeNames.length;for(var i=0;i<typeNameCount;++i){var typeName=typeNames[i];var d=defCache[typeName];if(d.finalized!==true){throw new Error(""+typeName);}for(var j=0;j<d.supertypeList.length;++j){var superTypeName=d.supertypeList[j];if(hasOwn.call(candidates,superTypeName)){table[typeName]=superTypeName;break;}}}return table;}var builders=Object.create(null);// This object is used as prototype for any node created by a builder.
+  var nodePrototype={};// Call this function to define a new method to be shared by all AST
+  // nodes. The replaced method (if any) is returned for easy wrapping.
+  function defineMethod(name,func){var old=nodePrototype[name];// Pass undefined as func to delete nodePrototype[name].
+  if(isUndefined.check(func)){delete nodePrototype[name];}else{isFunction.assert(func);Object.defineProperty(nodePrototype,name,{enumerable:true,configurable:true,value:func});}return old;}function getBuilderName(typeName){return typeName.replace(/^[A-Z]+/,function(upperCasePrefix){var len=upperCasePrefix.length;switch(len){case 0:return "";// If there's only one initial capital letter, just lower-case it.
+  case 1:return upperCasePrefix.toLowerCase();default:// If there's more than one initial capital letter, lower-case
+  // all but the last one, so that XMLDefaultDeclaration (for
+  // example) becomes xmlDefaultDeclaration.
+  return upperCasePrefix.slice(0,len-1).toLowerCase()+upperCasePrefix.charAt(len-1);}});}function getStatementBuilderName(typeName){typeName=getBuilderName(typeName);return typeName.replace(/(Expression)?$/,"Statement");}var namedTypes={};// Like Object.keys, but aware of what fields each AST type should have.
+  function getFieldNames(object){var d=defFromValue(object);if(d){return d.fieldNames.slice(0);}if("type"in object){throw new Error("did not recognize object of type "+JSON.stringify(object.type));}return Object.keys(object);}// Get the value of an object property, taking object.type and default
+  // functions into account.
+  function getFieldValue(object,fieldName){var d=defFromValue(object);if(d){var field=d.allFields[fieldName];if(field){return field.getValue(object);}}return object&&object[fieldName];}// Iterate over all defined fields of an object, including those missing
+  // or undefined, passing each field name and effective value (as returned
+  // by getFieldValue) to the callback. If the object has no corresponding
+  // Def, the callback will never be called.
+  function eachField(object,callback,context){getFieldNames(object).forEach(function(name){callback.call(this,name,getFieldValue(object,name));},context);}// Similar to eachField, except that iteration stops as soon as the
+  // callback returns a truthy value. Like Array.prototype.some, the final
+  // result is either true or false to indicates whether the callback
+  // returned true for any element or not.
+  function someField(object,callback,context){return getFieldNames(object).some(function(name){return callback.call(this,name,getFieldValue(object,name));},context);}// Adds an additional builder for Expression subtypes
+  // that wraps the built Expression in an ExpressionStatements.
+  function wrapExpressionBuilderWithStatement(typeName){var wrapperName=getStatementBuilderName(typeName);// skip if the builder already exists
+  if(builders[wrapperName])return;// the builder function to wrap with builders.ExpressionStatement
+  var wrapped=builders[getBuilderName(typeName)];// skip if there is nothing to wrap
+  if(!wrapped)return;var builder=function builder(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}return builders.expressionStatement(wrapped.apply(builders,args));};builder.from=function(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}return builders.expressionStatement(wrapped.from.apply(builders,args));};builders[wrapperName]=builder;}function populateSupertypeList(typeName,list){list.length=0;list.push(typeName);var lastSeen=Object.create(null);for(var pos=0;pos<list.length;++pos){typeName=list[pos];var d=defCache[typeName];if(d.finalized!==true){throw new Error("");}// If we saw typeName earlier in the breadth-first traversal,
+  // delete the last-seen occurrence.
+  if(hasOwn.call(lastSeen,typeName)){delete list[lastSeen[typeName]];}// Record the new index of the last-seen occurrence of typeName.
+  lastSeen[typeName]=pos;// Enqueue the base names of this type.
+  list.push.apply(list,d.baseNames);}// Compaction loop to remove array holes.
+  for(var to=0,from=to,len=list.length;from<len;++from){if(hasOwn.call(list,from)){list[to++]=list[from];}}list.length=to;}function extend(into,from){Object.keys(from).forEach(function(name){into[name]=from[name];});return into;}function finalize(){Object.keys(defCache).forEach(function(name){defCache[name].finalize();});}return {Type:Type,builtInTypes:builtInTypes,getSupertypeNames:getSupertypeNames,computeSupertypeLookupTable:computeSupertypeLookupTable,builders:builders,defineMethod:defineMethod,getBuilderName:getBuilderName,getStatementBuilderName:getStatementBuilderName,namedTypes:namedTypes,getFieldNames:getFieldNames,getFieldValue:getFieldValue,eachField:eachField,someField:someField,finalize:finalize};}exports.default=typesPlugin;});unwrapExports(types);var types_1=types.Def;var path=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var Op=Object.prototype;var hasOwn=Op.hasOwnProperty;function pathPlugin(fork){var types=fork.use(types_1.default);var isArray=types.builtInTypes.array;var isNumber=types.builtInTypes.number;var Path=function Path(value,parentPath,name){if(!(this instanceof Path)){throw new Error("Path constructor cannot be invoked without 'new'");}if(parentPath){if(!(parentPath instanceof Path)){throw new Error("");}}else{parentPath=null;name=null;}// The value encapsulated by this Path, generally equal to
+  // parentPath.value[name] if we have a parentPath.
+  this.value=value;// The immediate parent Path of this Path.
+  this.parentPath=parentPath;// The name of the property of parentPath.value through which this
+  // Path's value was reached.
+  this.name=name;// Calling path.get("child") multiple times always returns the same
+  // child Path object, for both performance and consistency reasons.
+  this.__childCache=null;};var Pp=Path.prototype;function getChildCache(path){// Lazily create the child cache. This also cheapens cache
+  // invalidation, since you can just reset path.__childCache to null.
+  return path.__childCache||(path.__childCache=Object.create(null));}function getChildPath(path,name){var cache=getChildCache(path);var actualChildValue=path.getValueProperty(name);var childPath=cache[name];if(!hasOwn.call(cache,name)||// Ensure consistency between cache and reality.
+  childPath.value!==actualChildValue){childPath=cache[name]=new path.constructor(actualChildValue,path,name);}return childPath;}// This method is designed to be overridden by subclasses that need to
+  // handle missing properties, etc.
+  Pp.getValueProperty=function getValueProperty(name){return this.value[name];};Pp.get=function get(){var names=[];for(var _i=0;_i<arguments.length;_i++){names[_i]=arguments[_i];}var path=this;var count=names.length;for(var i=0;i<count;++i){path=getChildPath(path,names[i]);}return path;};Pp.each=function each(callback,context){var childPaths=[];var len=this.value.length;var i=0;// Collect all the original child paths before invoking the callback.
+  for(var i=0;i<len;++i){if(hasOwn.call(this.value,i)){childPaths[i]=this.get(i);}}// Invoke the callback on just the original child paths, regardless of
+  // any modifications made to the array by the callback. I chose these
+  // semantics over cleverly invoking the callback on new elements because
+  // this way is much easier to reason about.
+  context=context||this;for(i=0;i<len;++i){if(hasOwn.call(childPaths,i)){callback.call(context,childPaths[i]);}}};Pp.map=function map(callback,context){var result=[];this.each(function(childPath){result.push(callback.call(this,childPath));},context);return result;};Pp.filter=function filter(callback,context){var result=[];this.each(function(childPath){if(callback.call(this,childPath)){result.push(childPath);}},context);return result;};function emptyMoves(){}function getMoves(path,offset,start,end){isArray.assert(path.value);if(offset===0){return emptyMoves;}var length=path.value.length;if(length<1){return emptyMoves;}var argc=arguments.length;if(argc===2){start=0;end=length;}else if(argc===3){start=Math.max(start,0);end=length;}else{start=Math.max(start,0);end=Math.min(end,length);}isNumber.assert(start);isNumber.assert(end);var moves=Object.create(null);var cache=getChildCache(path);for(var i=start;i<end;++i){if(hasOwn.call(path.value,i)){var childPath=path.get(i);if(childPath.name!==i){throw new Error("");}var newIndex=i+offset;childPath.name=newIndex;moves[newIndex]=childPath;delete cache[i];}}delete cache.length;return function(){for(var newIndex in moves){var childPath=moves[newIndex];if(childPath.name!==+newIndex){throw new Error("");}cache[newIndex]=childPath;path.value[newIndex]=childPath.value;}};}Pp.shift=function shift(){var move=getMoves(this,-1);var result=this.value.shift();move();return result;};Pp.unshift=function unshift(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var move=getMoves(this,args.length);var result=this.value.unshift.apply(this.value,args);move();return result;};Pp.push=function push(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}isArray.assert(this.value);delete getChildCache(this).length;return this.value.push.apply(this.value,args);};Pp.pop=function pop(){isArray.assert(this.value);var cache=getChildCache(this);delete cache[this.value.length-1];delete cache.length;return this.value.pop();};Pp.insertAt=function insertAt(index){var argc=arguments.length;var move=getMoves(this,argc-1,index);if(move===emptyMoves&&argc<=1){return this;}index=Math.max(index,0);for(var i=1;i<argc;++i){this.value[index+i-1]=arguments[i];}move();return this;};Pp.insertBefore=function insertBefore(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var pp=this.parentPath;var argc=args.length;var insertAtArgs=[this.name];for(var i=0;i<argc;++i){insertAtArgs.push(args[i]);}return pp.insertAt.apply(pp,insertAtArgs);};Pp.insertAfter=function insertAfter(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var pp=this.parentPath;var argc=args.length;var insertAtArgs=[this.name+1];for(var i=0;i<argc;++i){insertAtArgs.push(args[i]);}return pp.insertAt.apply(pp,insertAtArgs);};function repairRelationshipWithParent(path){if(!(path instanceof Path)){throw new Error("");}var pp=path.parentPath;if(!pp){// Orphan paths have no relationship to repair.
+  return path;}var parentValue=pp.value;var parentCache=getChildCache(pp);// Make sure parentCache[path.name] is populated.
+  if(parentValue[path.name]===path.value){parentCache[path.name]=path;}else if(isArray.check(parentValue)){// Something caused path.name to become out of date, so attempt to
+  // recover by searching for path.value in parentValue.
+  var i=parentValue.indexOf(path.value);if(i>=0){parentCache[path.name=i]=path;}}else{// If path.value disagrees with parentValue[path.name], and
+  // path.name is not an array index, let path.value become the new
+  // parentValue[path.name] and update parentCache accordingly.
+  parentValue[path.name]=path.value;parentCache[path.name]=path;}if(parentValue[path.name]!==path.value){throw new Error("");}if(path.parentPath.get(path.name)!==path){throw new Error("");}return path;}Pp.replace=function replace(replacement){var results=[];var parentValue=this.parentPath.value;var parentCache=getChildCache(this.parentPath);var count=arguments.length;repairRelationshipWithParent(this);if(isArray.check(parentValue)){var originalLength=parentValue.length;var move=getMoves(this.parentPath,count-1,this.name+1);var spliceArgs=[this.name,1];for(var i=0;i<count;++i){spliceArgs.push(arguments[i]);}var splicedOut=parentValue.splice.apply(parentValue,spliceArgs);if(splicedOut[0]!==this.value){throw new Error("");}if(parentValue.length!==originalLength-1+count){throw new Error("");}move();if(count===0){delete this.value;delete parentCache[this.name];this.__childCache=null;}else{if(parentValue[this.name]!==replacement){throw new Error("");}if(this.value!==replacement){this.value=replacement;this.__childCache=null;}for(i=0;i<count;++i){results.push(this.parentPath.get(this.name+i));}if(results[0]!==this){throw new Error("");}}}else if(count===1){if(this.value!==replacement){this.__childCache=null;}this.value=parentValue[this.name]=replacement;results.push(this);}else if(count===0){delete parentValue[this.name];delete this.value;this.__childCache=null;// Leave this path cached as parentCache[this.name], even though
+  // it no longer has a value defined.
+  }else{throw new Error("Could not replace path");}return results;};return Path;}exports.default=pathPlugin;module.exports=exports["default"];});unwrapExports(path);var scope=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var hasOwn=Object.prototype.hasOwnProperty;function scopePlugin(fork){var types=fork.use(types_1.default);var Type=types.Type;var namedTypes=types.namedTypes;var Node=namedTypes.Node;var Expression=namedTypes.Expression;var isArray=types.builtInTypes.array;var b=types.builders;var Scope=function Scope(path,parentScope){if(!(this instanceof Scope)){throw new Error("Scope constructor cannot be invoked without 'new'");}ScopeType.assert(path.value);var depth;if(parentScope){if(!(parentScope instanceof Scope)){throw new Error("");}depth=parentScope.depth+1;}else{parentScope=null;depth=0;}Object.defineProperties(this,{path:{value:path},node:{value:path.value},isGlobal:{value:!parentScope,enumerable:true},depth:{value:depth},parent:{value:parentScope},bindings:{value:{}},types:{value:{}}});};var scopeTypes=[// Program nodes introduce global scopes.
+  namedTypes.Program,// Function is the supertype of FunctionExpression,
+  // FunctionDeclaration, ArrowExpression, etc.
+  namedTypes.Function,// In case you didn't know, the caught parameter shadows any variable
+  // of the same name in an outer scope.
+  namedTypes.CatchClause];var ScopeType=Type.or.apply(Type,scopeTypes);Scope.isEstablishedBy=function(node){return ScopeType.check(node);};var Sp=Scope.prototype;// Will be overridden after an instance lazily calls scanScope.
+  Sp.didScan=false;Sp.declares=function(name){this.scan();return hasOwn.call(this.bindings,name);};Sp.declaresType=function(name){this.scan();return hasOwn.call(this.types,name);};Sp.declareTemporary=function(prefix){if(prefix){if(!/^[a-z$_]/i.test(prefix)){throw new Error("");}}else{prefix="t$";}// Include this.depth in the name to make sure the name does not
+  // collide with any variables in nested/enclosing scopes.
+  prefix+=this.depth.toString(36)+"$";this.scan();var index=0;while(this.declares(prefix+index)){++index;}var name=prefix+index;return this.bindings[name]=types.builders.identifier(name);};Sp.injectTemporary=function(identifier,init){identifier||(identifier=this.declareTemporary());var bodyPath=this.path.get("body");if(namedTypes.BlockStatement.check(bodyPath.value)){bodyPath=bodyPath.get("body");}bodyPath.unshift(b.variableDeclaration("var",[b.variableDeclarator(identifier,init||null)]));return identifier;};Sp.scan=function(force){if(force||!this.didScan){for(var name in this.bindings){// Empty out this.bindings, just in cases.
+  delete this.bindings[name];}scanScope(this.path,this.bindings,this.types);this.didScan=true;}};Sp.getBindings=function(){this.scan();return this.bindings;};Sp.getTypes=function(){this.scan();return this.types;};function scanScope(path,bindings,scopeTypes){var node=path.value;ScopeType.assert(node);if(namedTypes.CatchClause.check(node)){// A catch clause establishes a new scope but the only variable
+  // bound in that scope is the catch parameter. Any other
+  // declarations create bindings in the outer scope.
+  addPattern(path.get("param"),bindings);}else{recursiveScanScope(path,bindings,scopeTypes);}}function recursiveScanScope(path,bindings,scopeTypes){var node=path.value;if(path.parent&&namedTypes.FunctionExpression.check(path.parent.node)&&path.parent.node.id){addPattern(path.parent.get("id"),bindings);}if(!node);else if(isArray.check(node)){path.each(function(childPath){recursiveScanChild(childPath,bindings,scopeTypes);});}else if(namedTypes.Function.check(node)){path.get("params").each(function(paramPath){addPattern(paramPath,bindings);});recursiveScanChild(path.get("body"),bindings,scopeTypes);}else if(namedTypes.TypeAlias&&namedTypes.TypeAlias.check(node)||namedTypes.InterfaceDeclaration&&namedTypes.InterfaceDeclaration.check(node)||namedTypes.TSTypeAliasDeclaration&&namedTypes.TSTypeAliasDeclaration.check(node)||namedTypes.TSInterfaceDeclaration&&namedTypes.TSInterfaceDeclaration.check(node)){addTypePattern(path.get("id"),scopeTypes);}else if(namedTypes.VariableDeclarator.check(node)){addPattern(path.get("id"),bindings);recursiveScanChild(path.get("init"),bindings,scopeTypes);}else if(node.type==="ImportSpecifier"||node.type==="ImportNamespaceSpecifier"||node.type==="ImportDefaultSpecifier"){addPattern(// Esprima used to use the .name field to refer to the local
+  // binding identifier for ImportSpecifier nodes, but .id for
+  // ImportNamespaceSpecifier and ImportDefaultSpecifier nodes.
+  // ESTree/Acorn/ESpree use .local for all three node types.
+  path.get(node.local?"local":node.name?"name":"id"),bindings);}else if(Node.check(node)&&!Expression.check(node)){types.eachField(node,function(name,child){var childPath=path.get(name);if(!pathHasValue(childPath,child)){throw new Error("");}recursiveScanChild(childPath,bindings,scopeTypes);});}}function pathHasValue(path,value){if(path.value===value){return true;}// Empty arrays are probably produced by defaults.emptyArray, in which
+  // case is makes sense to regard them as equivalent, if not ===.
+  if(Array.isArray(path.value)&&path.value.length===0&&Array.isArray(value)&&value.length===0){return true;}return false;}function recursiveScanChild(path,bindings,scopeTypes){var node=path.value;if(!node||Expression.check(node));else if(namedTypes.FunctionDeclaration.check(node)&&node.id!==null){addPattern(path.get("id"),bindings);}else if(namedTypes.ClassDeclaration&&namedTypes.ClassDeclaration.check(node)){addPattern(path.get("id"),bindings);}else if(ScopeType.check(node)){if(namedTypes.CatchClause.check(node)&&// TODO Broaden this to accept any pattern.
+  namedTypes.Identifier.check(node.param)){var catchParamName=node.param.name;var hadBinding=hasOwn.call(bindings,catchParamName);// Any declarations that occur inside the catch body that do
+  // not have the same name as the catch parameter should count
+  // as bindings in the outer scope.
+  recursiveScanScope(path.get("body"),bindings,scopeTypes);// If a new binding matching the catch parameter name was
+  // created while scanning the catch body, ignore it because it
+  // actually refers to the catch parameter and not the outer
+  // scope that we're currently scanning.
+  if(!hadBinding){delete bindings[catchParamName];}}}else{recursiveScanScope(path,bindings,scopeTypes);}}function addPattern(patternPath,bindings){var pattern=patternPath.value;namedTypes.Pattern.assert(pattern);if(namedTypes.Identifier.check(pattern)){if(hasOwn.call(bindings,pattern.name)){bindings[pattern.name].push(patternPath);}else{bindings[pattern.name]=[patternPath];}}else if(namedTypes.AssignmentPattern&&namedTypes.AssignmentPattern.check(pattern)){addPattern(patternPath.get('left'),bindings);}else if(namedTypes.ObjectPattern&&namedTypes.ObjectPattern.check(pattern)){patternPath.get('properties').each(function(propertyPath){var property=propertyPath.value;if(namedTypes.Pattern.check(property)){addPattern(propertyPath,bindings);}else if(namedTypes.Property.check(property)){addPattern(propertyPath.get('value'),bindings);}else if(namedTypes.SpreadProperty&&namedTypes.SpreadProperty.check(property)){addPattern(propertyPath.get('argument'),bindings);}});}else if(namedTypes.ArrayPattern&&namedTypes.ArrayPattern.check(pattern)){patternPath.get('elements').each(function(elementPath){var element=elementPath.value;if(namedTypes.Pattern.check(element)){addPattern(elementPath,bindings);}else if(namedTypes.SpreadElement&&namedTypes.SpreadElement.check(element)){addPattern(elementPath.get("argument"),bindings);}});}else if(namedTypes.PropertyPattern&&namedTypes.PropertyPattern.check(pattern)){addPattern(patternPath.get('pattern'),bindings);}else if(namedTypes.SpreadElementPattern&&namedTypes.SpreadElementPattern.check(pattern)||namedTypes.SpreadPropertyPattern&&namedTypes.SpreadPropertyPattern.check(pattern)){addPattern(patternPath.get('argument'),bindings);}}function addTypePattern(patternPath,types){var pattern=patternPath.value;namedTypes.Pattern.assert(pattern);if(namedTypes.Identifier.check(pattern)){if(hasOwn.call(types,pattern.name)){types[pattern.name].push(patternPath);}else{types[pattern.name]=[patternPath];}}}Sp.lookup=function(name){for(var scope=this;scope;scope=scope.parent)if(scope.declares(name))break;return scope;};Sp.lookupType=function(name){for(var scope=this;scope;scope=scope.parent)if(scope.declaresType(name))break;return scope;};Sp.getGlobalScope=function(){var scope=this;while(!scope.isGlobal)scope=scope.parent;return scope;};return Scope;}exports.default=scopePlugin;module.exports=exports["default"];});unwrapExports(scope);var nodePath=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var path_1=__importDefault(path);var scope_1=__importDefault(scope);function nodePathPlugin(fork){var types=fork.use(types_1.default);var n=types.namedTypes;var b=types.builders;var isNumber=types.builtInTypes.number;var isArray=types.builtInTypes.array;var Path=fork.use(path_1.default);var Scope=fork.use(scope_1.default);var NodePath=function NodePath(value,parentPath,name){if(!(this instanceof NodePath)){throw new Error("NodePath constructor cannot be invoked without 'new'");}Path.call(this,value,parentPath,name);};var NPp=NodePath.prototype=Object.create(Path.prototype,{constructor:{value:NodePath,enumerable:false,writable:true,configurable:true}});Object.defineProperties(NPp,{node:{get:function get(){Object.defineProperty(this,"node",{configurable:true,value:this._computeNode()});return this.node;}},parent:{get:function get(){Object.defineProperty(this,"parent",{configurable:true,value:this._computeParent()});return this.parent;}},scope:{get:function get(){Object.defineProperty(this,"scope",{configurable:true,value:this._computeScope()});return this.scope;}}});NPp.replace=function(){delete this.node;delete this.parent;delete this.scope;return Path.prototype.replace.apply(this,arguments);};NPp.prune=function(){var remainingNodePath=this.parent;this.replace();return cleanUpNodesAfterPrune(remainingNodePath);};// The value of the first ancestor Path whose value is a Node.
+  NPp._computeNode=function(){var value=this.value;if(n.Node.check(value)){return value;}var pp=this.parentPath;return pp&&pp.node||null;};// The first ancestor Path whose value is a Node distinct from this.node.
+  NPp._computeParent=function(){var value=this.value;var pp=this.parentPath;if(!n.Node.check(value)){while(pp&&!n.Node.check(pp.value)){pp=pp.parentPath;}if(pp){pp=pp.parentPath;}}while(pp&&!n.Node.check(pp.value)){pp=pp.parentPath;}return pp||null;};// The closest enclosing scope that governs this node.
+  NPp._computeScope=function(){var value=this.value;var pp=this.parentPath;var scope=pp&&pp.scope;if(n.Node.check(value)&&Scope.isEstablishedBy(value)){scope=new Scope(this,scope);}return scope||null;};NPp.getValueProperty=function(name){return types.getFieldValue(this.value,name);};/**
+  	     * Determine whether this.node needs to be wrapped in parentheses in order
+  	     * for a parser to reproduce the same local AST structure.
+  	     *
+  	     * For instance, in the expression `(1 + 2) * 3`, the BinaryExpression
+  	     * whose operator is "+" needs parentheses, because `1 + 2 * 3` would
+  	     * parse differently.
+  	     *
+  	     * If assumeExpressionContext === true, we don't worry about edge cases
+  	     * like an anonymous FunctionExpression appearing lexically first in its
+  	     * enclosing statement and thus needing parentheses to avoid being parsed
+  	     * as a FunctionDeclaration with a missing name.
+  	     */NPp.needsParens=function(assumeExpressionContext){var pp=this.parentPath;if(!pp){return false;}var node=this.value;// Only expressions need parentheses.
+  if(!n.Expression.check(node)){return false;}// Identifiers never need parentheses.
+  if(node.type==="Identifier"){return false;}while(!n.Node.check(pp.value)){pp=pp.parentPath;if(!pp){return false;}}var parent=pp.value;switch(node.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return parent.type==="MemberExpression"&&this.name==="object"&&parent.object===node;case"BinaryExpression":case"LogicalExpression":switch(parent.type){case"CallExpression":return this.name==="callee"&&parent.callee===node;case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return true;case"MemberExpression":return this.name==="object"&&parent.object===node;case"BinaryExpression":case"LogicalExpression":{var n_1=node;var po=parent.operator;var pp_1=PRECEDENCE[po];var no=n_1.operator;var np=PRECEDENCE[no];if(pp_1>np){return true;}if(pp_1===np&&this.name==="right"){if(parent.right!==n_1){throw new Error("Nodes must be equal");}return true;}}default:return false;}case"SequenceExpression":switch(parent.type){case"ForStatement":// Although parentheses wouldn't hurt around sequence
+  // expressions in the head of for loops, traditional style
+  // dictates that e.g. i++, j++ should not be wrapped with
+  // parentheses.
+  return false;case"ExpressionStatement":return this.name!=="expression";default:// Otherwise err on the side of overparenthesization, adding
+  // explicit exceptions above if this proves overzealous.
+  return true;}case"YieldExpression":switch(parent.type){case"BinaryExpression":case"LogicalExpression":case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"CallExpression":case"MemberExpression":case"NewExpression":case"ConditionalExpression":case"YieldExpression":return true;default:return false;}case"Literal":return parent.type==="MemberExpression"&&isNumber.check(node.value)&&this.name==="object"&&parent.object===node;case"AssignmentExpression":case"ConditionalExpression":switch(parent.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"BinaryExpression":case"LogicalExpression":return true;case"CallExpression":return this.name==="callee"&&parent.callee===node;case"ConditionalExpression":return this.name==="test"&&parent.test===node;case"MemberExpression":return this.name==="object"&&parent.object===node;default:return false;}default:if(parent.type==="NewExpression"&&this.name==="callee"&&parent.callee===node){return containsCallExpression(node);}}if(assumeExpressionContext!==true&&!this.canBeFirstInStatement()&&this.firstInStatement())return true;return false;};function isBinary(node){return n.BinaryExpression.check(node)||n.LogicalExpression.check(node);}var PRECEDENCE={};[["||"],["&&"],["|"],["^"],["&"],["==","===","!=","!=="],["<",">","<=",">=","in","instanceof"],[">>","<<",">>>"],["+","-"],["*","/","%"]].forEach(function(tier,i){tier.forEach(function(op){PRECEDENCE[op]=i;});});function containsCallExpression(node){if(n.CallExpression.check(node)){return true;}if(isArray.check(node)){return node.some(containsCallExpression);}if(n.Node.check(node)){return types.someField(node,function(_name,child){return containsCallExpression(child);});}return false;}NPp.canBeFirstInStatement=function(){var node=this.node;return !n.FunctionExpression.check(node)&&!n.ObjectExpression.check(node);};NPp.firstInStatement=function(){return firstInStatement(this);};function firstInStatement(path){for(var node,parent;path.parent;path=path.parent){node=path.node;parent=path.parent.node;if(n.BlockStatement.check(parent)&&path.parent.name==="body"&&path.name===0){if(parent.body[0]!==node){throw new Error("Nodes must be equal");}return true;}if(n.ExpressionStatement.check(parent)&&path.name==="expression"){if(parent.expression!==node){throw new Error("Nodes must be equal");}return true;}if(n.SequenceExpression.check(parent)&&path.parent.name==="expressions"&&path.name===0){if(parent.expressions[0]!==node){throw new Error("Nodes must be equal");}continue;}if(n.CallExpression.check(parent)&&path.name==="callee"){if(parent.callee!==node){throw new Error("Nodes must be equal");}continue;}if(n.MemberExpression.check(parent)&&path.name==="object"){if(parent.object!==node){throw new Error("Nodes must be equal");}continue;}if(n.ConditionalExpression.check(parent)&&path.name==="test"){if(parent.test!==node){throw new Error("Nodes must be equal");}continue;}if(isBinary(parent)&&path.name==="left"){if(parent.left!==node){throw new Error("Nodes must be equal");}continue;}if(n.UnaryExpression.check(parent)&&!parent.prefix&&path.name==="argument"){if(parent.argument!==node){throw new Error("Nodes must be equal");}continue;}return false;}return true;}/**
+  	     * Pruning certain nodes will result in empty or incomplete nodes, here we clean those nodes up.
+  	     */function cleanUpNodesAfterPrune(remainingNodePath){if(n.VariableDeclaration.check(remainingNodePath.node)){var declarations=remainingNodePath.get('declarations').value;if(!declarations||declarations.length===0){return remainingNodePath.prune();}}else if(n.ExpressionStatement.check(remainingNodePath.node)){if(!remainingNodePath.get('expression').value){return remainingNodePath.prune();}}else if(n.IfStatement.check(remainingNodePath.node)){cleanUpIfStatementAfterPrune(remainingNodePath);}return remainingNodePath;}function cleanUpIfStatementAfterPrune(ifStatement){var testExpression=ifStatement.get('test').value;var alternate=ifStatement.get('alternate').value;var consequent=ifStatement.get('consequent').value;if(!consequent&&!alternate){var testExpressionStatement=b.expressionStatement(testExpression);ifStatement.replace(testExpressionStatement);}else if(!consequent&&alternate){var negatedTestExpression=b.unaryExpression('!',testExpression,true);if(n.UnaryExpression.check(testExpression)&&testExpression.operator==='!'){negatedTestExpression=testExpression.argument;}ifStatement.get("test").replace(negatedTestExpression);ifStatement.get("consequent").replace(alternate);ifStatement.get("alternate").replace();}}return NodePath;}exports.default=nodePathPlugin;module.exports=exports["default"];});unwrapExports(nodePath);var pathVisitor=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var node_path_1=__importDefault(nodePath);var hasOwn=Object.prototype.hasOwnProperty;function pathVisitorPlugin(fork){var types=fork.use(types_1.default);var NodePath=fork.use(node_path_1.default);var isArray=types.builtInTypes.array;var isObject=types.builtInTypes.object;var isFunction=types.builtInTypes.function;var undefined$1;var PathVisitor=function PathVisitor(){if(!(this instanceof PathVisitor)){throw new Error("PathVisitor constructor cannot be invoked without 'new'");}// Permanent state.
+  this._reusableContextStack=[];this._methodNameTable=computeMethodNameTable(this);this._shouldVisitComments=hasOwn.call(this._methodNameTable,"Block")||hasOwn.call(this._methodNameTable,"Line");this.Context=makeContextConstructor(this);// State reset every time PathVisitor.prototype.visit is called.
+  this._visiting=false;this._changeReported=false;};function computeMethodNameTable(visitor){var typeNames=Object.create(null);for(var methodName in visitor){if(/^visit[A-Z]/.test(methodName)){typeNames[methodName.slice("visit".length)]=true;}}var supertypeTable=types.computeSupertypeLookupTable(typeNames);var methodNameTable=Object.create(null);var typeNameKeys=Object.keys(supertypeTable);var typeNameCount=typeNameKeys.length;for(var i=0;i<typeNameCount;++i){var typeName=typeNameKeys[i];methodName="visit"+supertypeTable[typeName];if(isFunction.check(visitor[methodName])){methodNameTable[typeName]=methodName;}}return methodNameTable;}PathVisitor.fromMethodsObject=function fromMethodsObject(methods){if(methods instanceof PathVisitor){return methods;}if(!isObject.check(methods)){// An empty visitor?
+  return new PathVisitor();}var Visitor=function Visitor(){if(!(this instanceof Visitor)){throw new Error("Visitor constructor cannot be invoked without 'new'");}PathVisitor.call(this);};var Vp=Visitor.prototype=Object.create(PVp);Vp.constructor=Visitor;extend(Vp,methods);extend(Visitor,PathVisitor);isFunction.assert(Visitor.fromMethodsObject);isFunction.assert(Visitor.visit);return new Visitor();};function extend(target,source){for(var property in source){if(hasOwn.call(source,property)){target[property]=source[property];}}return target;}PathVisitor.visit=function visit(node,methods){return PathVisitor.fromMethodsObject(methods).visit(node);};var PVp=PathVisitor.prototype;PVp.visit=function(){if(this._visiting){throw new Error("Recursively calling visitor.visit(path) resets visitor state. "+"Try this.visit(path) or this.traverse(path) instead.");}// Private state that needs to be reset before every traversal.
+  this._visiting=true;this._changeReported=false;this._abortRequested=false;var argc=arguments.length;var args=new Array(argc);for(var i=0;i<argc;++i){args[i]=arguments[i];}if(!(args[0]instanceof NodePath)){args[0]=new NodePath({root:args[0]}).get("root");}// Called with the same arguments as .visit.
+  this.reset.apply(this,args);var didNotThrow;try{var root=this.visitWithoutReset(args[0]);didNotThrow=true;}finally{this._visiting=false;if(!didNotThrow&&this._abortRequested){// If this.visitWithoutReset threw an exception and
+  // this._abortRequested was set to true, return the root of
+  // the AST instead of letting the exception propagate, so that
+  // client code does not have to provide a try-catch block to
+  // intercept the AbortRequest exception.  Other kinds of
+  // exceptions will propagate without being intercepted and
+  // rethrown by a catch block, so their stacks will accurately
+  // reflect the original throwing context.
+  return args[0].value;}}return root;};PVp.AbortRequest=function AbortRequest(){};PVp.abort=function(){var visitor=this;visitor._abortRequested=true;var request=new visitor.AbortRequest();// If you decide to catch this exception and stop it from propagating,
+  // make sure to call its cancel method to avoid silencing other
+  // exceptions that might be thrown later in the traversal.
+  request.cancel=function(){visitor._abortRequested=false;};throw request;};PVp.reset=function(_path/*, additional arguments */){// Empty stub; may be reassigned or overridden by subclasses.
+  };PVp.visitWithoutReset=function(path){if(this instanceof this.Context){// Since this.Context.prototype === this, there's a chance we
+  // might accidentally call context.visitWithoutReset. If that
+  // happens, re-invoke the method against context.visitor.
+  return this.visitor.visitWithoutReset(path);}if(!(path instanceof NodePath)){throw new Error("");}var value=path.value;var methodName=value&&typeof value==="object"&&typeof value.type==="string"&&this._methodNameTable[value.type];if(methodName){var context=this.acquireContext(path);try{return context.invokeVisitorMethod(methodName);}finally{this.releaseContext(context);}}else{// If there was no visitor method to call, visit the children of
+  // this node generically.
+  return visitChildren(path,this);}};function visitChildren(path,visitor){if(!(path instanceof NodePath)){throw new Error("");}if(!(visitor instanceof PathVisitor)){throw new Error("");}var value=path.value;if(isArray.check(value)){path.each(visitor.visitWithoutReset,visitor);}else if(!isObject.check(value));else{var childNames=types.getFieldNames(value);// The .comments field of the Node type is hidden, so we only
+  // visit it if the visitor defines visitBlock or visitLine, and
+  // value.comments is defined.
+  if(visitor._shouldVisitComments&&value.comments&&childNames.indexOf("comments")<0){childNames.push("comments");}var childCount=childNames.length;var childPaths=[];for(var i=0;i<childCount;++i){var childName=childNames[i];if(!hasOwn.call(value,childName)){value[childName]=types.getFieldValue(value,childName);}childPaths.push(path.get(childName));}for(var i=0;i<childCount;++i){visitor.visitWithoutReset(childPaths[i]);}}return path.value;}PVp.acquireContext=function(path){if(this._reusableContextStack.length===0){return new this.Context(path);}return this._reusableContextStack.pop().reset(path);};PVp.releaseContext=function(context){if(!(context instanceof this.Context)){throw new Error("");}this._reusableContextStack.push(context);context.currentPath=null;};PVp.reportChanged=function(){this._changeReported=true;};PVp.wasChangeReported=function(){return this._changeReported;};function makeContextConstructor(visitor){function Context(path){if(!(this instanceof Context)){throw new Error("");}if(!(this instanceof PathVisitor)){throw new Error("");}if(!(path instanceof NodePath)){throw new Error("");}Object.defineProperty(this,"visitor",{value:visitor,writable:false,enumerable:true,configurable:false});this.currentPath=path;this.needToCallTraverse=true;Object.seal(this);}if(!(visitor instanceof PathVisitor)){throw new Error("");}// Note that the visitor object is the prototype of Context.prototype,
+  // so all visitor methods are inherited by context objects.
+  var Cp=Context.prototype=Object.create(visitor);Cp.constructor=Context;extend(Cp,sharedContextProtoMethods);return Context;}// Every PathVisitor has a different this.Context constructor and
+  // this.Context.prototype object, but those prototypes can all use the
+  // same reset, invokeVisitorMethod, and traverse function objects.
+  var sharedContextProtoMethods=Object.create(null);sharedContextProtoMethods.reset=function reset(path){if(!(this instanceof this.Context)){throw new Error("");}if(!(path instanceof NodePath)){throw new Error("");}this.currentPath=path;this.needToCallTraverse=true;return this;};sharedContextProtoMethods.invokeVisitorMethod=function invokeVisitorMethod(methodName){if(!(this instanceof this.Context)){throw new Error("");}if(!(this.currentPath instanceof NodePath)){throw new Error("");}var result=this.visitor[methodName].call(this,this.currentPath);if(result===false){// Visitor methods return false to indicate that they have handled
+  // their own traversal needs, and we should not complain if
+  // this.needToCallTraverse is still true.
+  this.needToCallTraverse=false;}else if(result!==undefined$1){// Any other non-undefined value returned from the visitor method
+  // is interpreted as a replacement value.
+  this.currentPath=this.currentPath.replace(result)[0];if(this.needToCallTraverse){// If this.traverse still hasn't been called, visit the
+  // children of the replacement node.
+  this.traverse(this.currentPath);}}if(this.needToCallTraverse!==false){throw new Error("Must either call this.traverse or return false in "+methodName);}var path=this.currentPath;return path&&path.value;};sharedContextProtoMethods.traverse=function traverse(path,newVisitor){if(!(this instanceof this.Context)){throw new Error("");}if(!(path instanceof NodePath)){throw new Error("");}if(!(this.currentPath instanceof NodePath)){throw new Error("");}this.needToCallTraverse=false;return visitChildren(path,PathVisitor.fromMethodsObject(newVisitor||this.visitor));};sharedContextProtoMethods.visit=function visit(path,newVisitor){if(!(this instanceof this.Context)){throw new Error("");}if(!(path instanceof NodePath)){throw new Error("");}if(!(this.currentPath instanceof NodePath)){throw new Error("");}this.needToCallTraverse=false;return PathVisitor.fromMethodsObject(newVisitor||this.visitor).visitWithoutReset(path);};sharedContextProtoMethods.reportChanged=function reportChanged(){this.visitor.reportChanged();};sharedContextProtoMethods.abort=function abort(){this.needToCallTraverse=false;this.visitor.abort();};return PathVisitor;}exports.default=pathVisitorPlugin;module.exports=exports["default"];});unwrapExports(pathVisitor);var equiv=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);function default_1(fork){var types=fork.use(types_1.default);var getFieldNames=types.getFieldNames;var getFieldValue=types.getFieldValue;var isArray=types.builtInTypes.array;var isObject=types.builtInTypes.object;var isDate=types.builtInTypes.Date;var isRegExp=types.builtInTypes.RegExp;var hasOwn=Object.prototype.hasOwnProperty;function astNodesAreEquivalent(a,b,problemPath){if(isArray.check(problemPath)){problemPath.length=0;}else{problemPath=null;}return areEquivalent(a,b,problemPath);}astNodesAreEquivalent.assert=function(a,b){var problemPath=[];if(!astNodesAreEquivalent(a,b,problemPath)){if(problemPath.length===0){if(a!==b){throw new Error("Nodes must be equal");}}else{throw new Error("Nodes differ in the following path: "+problemPath.map(subscriptForProperty).join(""));}}};function subscriptForProperty(property){if(/[_$a-z][_$a-z0-9]*/i.test(property)){return "."+property;}return "["+JSON.stringify(property)+"]";}function areEquivalent(a,b,problemPath){if(a===b){return true;}if(isArray.check(a)){return arraysAreEquivalent(a,b,problemPath);}if(isObject.check(a)){return objectsAreEquivalent(a,b,problemPath);}if(isDate.check(a)){return isDate.check(b)&&+a===+b;}if(isRegExp.check(a)){return isRegExp.check(b)&&a.source===b.source&&a.global===b.global&&a.multiline===b.multiline&&a.ignoreCase===b.ignoreCase;}return a==b;}function arraysAreEquivalent(a,b,problemPath){isArray.assert(a);var aLength=a.length;if(!isArray.check(b)||b.length!==aLength){if(problemPath){problemPath.push("length");}return false;}for(var i=0;i<aLength;++i){if(problemPath){problemPath.push(i);}if(i in a!==i in b){return false;}if(!areEquivalent(a[i],b[i],problemPath)){return false;}if(problemPath){var problemPathTail=problemPath.pop();if(problemPathTail!==i){throw new Error(""+problemPathTail);}}}return true;}function objectsAreEquivalent(a,b,problemPath){isObject.assert(a);if(!isObject.check(b)){return false;}// Fast path for a common property of AST nodes.
+  if(a.type!==b.type){if(problemPath){problemPath.push("type");}return false;}var aNames=getFieldNames(a);var aNameCount=aNames.length;var bNames=getFieldNames(b);var bNameCount=bNames.length;if(aNameCount===bNameCount){for(var i=0;i<aNameCount;++i){var name=aNames[i];var aChild=getFieldValue(a,name);var bChild=getFieldValue(b,name);if(problemPath){problemPath.push(name);}if(!areEquivalent(aChild,bChild,problemPath)){return false;}if(problemPath){var problemPathTail=problemPath.pop();if(problemPathTail!==name){throw new Error(""+problemPathTail);}}}return true;}if(!problemPath){return false;}// Since aNameCount !== bNameCount, we need to find some name that's
+  // missing in aNames but present in bNames, or vice-versa.
+  var seenNames=Object.create(null);for(i=0;i<aNameCount;++i){seenNames[aNames[i]]=true;}for(i=0;i<bNameCount;++i){name=bNames[i];if(!hasOwn.call(seenNames,name)){problemPath.push(name);return false;}delete seenNames[name];}for(name in seenNames){problemPath.push(name);break;}return false;}return astNodesAreEquivalent;}exports.default=default_1;module.exports=exports["default"];});unwrapExports(equiv);var fork=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var path_visitor_1=__importDefault(pathVisitor);var equiv_1=__importDefault(equiv);var path_1=__importDefault(path);var node_path_1=__importDefault(nodePath);function default_1(defs){var fork=createFork();var types=fork.use(types_1.default);defs.forEach(fork.use);types.finalize();var PathVisitor=fork.use(path_visitor_1.default);return {Type:types.Type,builtInTypes:types.builtInTypes,namedTypes:types.namedTypes,builders:types.builders,defineMethod:types.defineMethod,getFieldNames:types.getFieldNames,getFieldValue:types.getFieldValue,eachField:types.eachField,someField:types.someField,getSupertypeNames:types.getSupertypeNames,getBuilderName:types.getBuilderName,astNodesAreEquivalent:fork.use(equiv_1.default),finalize:types.finalize,Path:fork.use(path_1.default),NodePath:fork.use(node_path_1.default),PathVisitor:PathVisitor,use:fork.use,visit:PathVisitor.visit};}exports.default=default_1;function createFork(){var used=[];var usedResult=[];function use(plugin){var idx=used.indexOf(plugin);if(idx===-1){idx=used.length;used.push(plugin);usedResult[idx]=plugin(fork);}return usedResult[idx];}var fork={use:use};return fork;}module.exports=exports["default"];});unwrapExports(fork);var shared=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);function default_1(fork){var types=fork.use(types_1.default);var Type=types.Type;var builtin=types.builtInTypes;var isNumber=builtin.number;// An example of constructing a new type with arbitrary constraints from
+  // an existing type.
+  function geq(than){return Type.from(function(value){return isNumber.check(value)&&value>=than;},isNumber+" >= "+than);}// Default value-returning functions that may optionally be passed as a
+  // third argument to Def.prototype.field.
+  var defaults={// Functions were used because (among other reasons) that's the most
+  // elegant way to allow for the emptyArray one always to give a new
+  // array instance.
+  "null":function _null(){return null;},"emptyArray":function emptyArray(){return [];},"false":function _false(){return false;},"true":function _true(){return true;},"undefined":function undefined$1(){},"use strict":function useStrict(){return "use strict";}};var naiveIsPrimitive=Type.or(builtin.string,builtin.number,builtin.boolean,builtin.null,builtin.undefined);var isPrimitive=Type.from(function(value){if(value===null)return true;var type=typeof value;if(type==="object"||type==="function"){return false;}return true;},naiveIsPrimitive.toString());return {geq:geq,defaults:defaults,isPrimitive:isPrimitive};}exports.default=default_1;module.exports=exports["default"];});unwrapExports(shared);var core=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){var types=fork.use(types_1.default);var Type=types.Type;var def=Type.def;var or=Type.or;var shared=fork.use(shared_1.default);var defaults=shared.defaults;var geq=shared.geq;// Abstract supertype of all syntactic entities that are allowed to have a
+  // .loc field.
+  def("Printable").field("loc",or(def("SourceLocation"),null),defaults["null"],true);def("Node").bases("Printable").field("type",String).field("comments",or([def("Comment")],null),defaults["null"],true);def("SourceLocation").field("start",def("Position")).field("end",def("Position")).field("source",or(String,null),defaults["null"]);def("Position").field("line",geq(1)).field("column",geq(0));def("File").bases("Node").build("program","name").field("program",def("Program")).field("name",or(String,null),defaults["null"]);def("Program").bases("Node").build("body").field("body",[def("Statement")]);def("Function").bases("Node").field("id",or(def("Identifier"),null),defaults["null"]).field("params",[def("Pattern")]).field("body",def("BlockStatement")).field("generator",Boolean,defaults["false"]).field("async",Boolean,defaults["false"]);def("Statement").bases("Node");// The empty .build() here means that an EmptyStatement can be constructed
+  // (i.e. it's not abstract) but that it needs no arguments.
+  def("EmptyStatement").bases("Statement").build();def("BlockStatement").bases("Statement").build("body").field("body",[def("Statement")]);// TODO Figure out how to silently coerce Expressions to
+  // ExpressionStatements where a Statement was expected.
+  def("ExpressionStatement").bases("Statement").build("expression").field("expression",def("Expression"));def("IfStatement").bases("Statement").build("test","consequent","alternate").field("test",def("Expression")).field("consequent",def("Statement")).field("alternate",or(def("Statement"),null),defaults["null"]);def("LabeledStatement").bases("Statement").build("label","body").field("label",def("Identifier")).field("body",def("Statement"));def("BreakStatement").bases("Statement").build("label").field("label",or(def("Identifier"),null),defaults["null"]);def("ContinueStatement").bases("Statement").build("label").field("label",or(def("Identifier"),null),defaults["null"]);def("WithStatement").bases("Statement").build("object","body").field("object",def("Expression")).field("body",def("Statement"));def("SwitchStatement").bases("Statement").build("discriminant","cases","lexical").field("discriminant",def("Expression")).field("cases",[def("SwitchCase")]).field("lexical",Boolean,defaults["false"]);def("ReturnStatement").bases("Statement").build("argument").field("argument",or(def("Expression"),null));def("ThrowStatement").bases("Statement").build("argument").field("argument",def("Expression"));def("TryStatement").bases("Statement").build("block","handler","finalizer").field("block",def("BlockStatement")).field("handler",or(def("CatchClause"),null),function(){return this.handlers&&this.handlers[0]||null;}).field("handlers",[def("CatchClause")],function(){return this.handler?[this.handler]:[];},true)// Indicates this field is hidden from eachField iteration.
+  .field("guardedHandlers",[def("CatchClause")],defaults.emptyArray).field("finalizer",or(def("BlockStatement"),null),defaults["null"]);def("CatchClause").bases("Node").build("param","guard","body")// https://github.com/tc39/proposal-optional-catch-binding
+  .field("param",or(def("Pattern"),null),defaults["null"]).field("guard",or(def("Expression"),null),defaults["null"]).field("body",def("BlockStatement"));def("WhileStatement").bases("Statement").build("test","body").field("test",def("Expression")).field("body",def("Statement"));def("DoWhileStatement").bases("Statement").build("body","test").field("body",def("Statement")).field("test",def("Expression"));def("ForStatement").bases("Statement").build("init","test","update","body").field("init",or(def("VariableDeclaration"),def("Expression"),null)).field("test",or(def("Expression"),null)).field("update",or(def("Expression"),null)).field("body",def("Statement"));def("ForInStatement").bases("Statement").build("left","right","body").field("left",or(def("VariableDeclaration"),def("Expression"))).field("right",def("Expression")).field("body",def("Statement"));def("DebuggerStatement").bases("Statement").build();def("Declaration").bases("Statement");def("FunctionDeclaration").bases("Function","Declaration").build("id","params","body").field("id",def("Identifier"));def("FunctionExpression").bases("Function","Expression").build("id","params","body");def("VariableDeclaration").bases("Declaration").build("kind","declarations").field("kind",or("var","let","const")).field("declarations",[def("VariableDeclarator")]);def("VariableDeclarator").bases("Node").build("id","init").field("id",def("Pattern")).field("init",or(def("Expression"),null),defaults["null"]);def("Expression").bases("Node");def("ThisExpression").bases("Expression").build();def("ArrayExpression").bases("Expression").build("elements").field("elements",[or(def("Expression"),null)]);def("ObjectExpression").bases("Expression").build("properties").field("properties",[def("Property")]);// TODO Not in the Mozilla Parser API, but used by Esprima.
+  def("Property").bases("Node")// Want to be able to visit Property Nodes.
+  .build("kind","key","value").field("kind",or("init","get","set")).field("key",or(def("Literal"),def("Identifier"))).field("value",def("Expression"));def("SequenceExpression").bases("Expression").build("expressions").field("expressions",[def("Expression")]);var UnaryOperator=or("-","+","!","~","typeof","void","delete");def("UnaryExpression").bases("Expression").build("operator","argument","prefix").field("operator",UnaryOperator).field("argument",def("Expression"))// Esprima doesn't bother with this field, presumably because it's
+  // always true for unary operators.
+  .field("prefix",Boolean,defaults["true"]);var BinaryOperator=or("==","!=","===","!==","<","<=",">",">=","<<",">>",">>>","+","-","*","/","%","**","&",// TODO Missing from the Parser API.
+  "|","^","in","instanceof");def("BinaryExpression").bases("Expression").build("operator","left","right").field("operator",BinaryOperator).field("left",def("Expression")).field("right",def("Expression"));var AssignmentOperator=or("=","+=","-=","*=","/=","%=","<<=",">>=",">>>=","|=","^=","&=");def("AssignmentExpression").bases("Expression").build("operator","left","right").field("operator",AssignmentOperator).field("left",or(def("Pattern"),def("MemberExpression"))).field("right",def("Expression"));var UpdateOperator=or("++","--");def("UpdateExpression").bases("Expression").build("operator","argument","prefix").field("operator",UpdateOperator).field("argument",def("Expression")).field("prefix",Boolean);var LogicalOperator=or("||","&&");def("LogicalExpression").bases("Expression").build("operator","left","right").field("operator",LogicalOperator).field("left",def("Expression")).field("right",def("Expression"));def("ConditionalExpression").bases("Expression").build("test","consequent","alternate").field("test",def("Expression")).field("consequent",def("Expression")).field("alternate",def("Expression"));def("NewExpression").bases("Expression").build("callee","arguments").field("callee",def("Expression"))// The Mozilla Parser API gives this type as [or(def("Expression"),
+  // null)], but null values don't really make sense at the call site.
+  // TODO Report this nonsense.
+  .field("arguments",[def("Expression")]);def("CallExpression").bases("Expression").build("callee","arguments").field("callee",def("Expression"))// See comment for NewExpression above.
+  .field("arguments",[def("Expression")]);def("MemberExpression").bases("Expression").build("object","property","computed").field("object",def("Expression")).field("property",or(def("Identifier"),def("Expression"))).field("computed",Boolean,function(){var type=this.property.type;if(type==='Literal'||type==='MemberExpression'||type==='BinaryExpression'){return true;}return false;});def("Pattern").bases("Node");def("SwitchCase").bases("Node").build("test","consequent").field("test",or(def("Expression"),null)).field("consequent",[def("Statement")]);def("Identifier").bases("Expression","Pattern").build("name").field("name",String).field("optional",Boolean,defaults["false"]);def("Literal").bases("Expression").build("value").field("value",or(String,Boolean,null,Number,RegExp)).field("regex",or({pattern:String,flags:String},null),function(){if(this.value instanceof RegExp){var flags="";if(this.value.ignoreCase)flags+="i";if(this.value.multiline)flags+="m";if(this.value.global)flags+="g";return {pattern:this.value.source,flags:flags};}return null;});// Abstract (non-buildable) comment supertype. Not a Node.
+  def("Comment").bases("Printable").field("value",String)// A .leading comment comes before the node, whereas a .trailing
+  // comment comes after it. These two fields should not both be true,
+  // but they might both be false when the comment falls inside a node
+  // and the node has no children for the comment to lead or trail,
+  // e.g. { /*dangling*/ }.
+  .field("leading",Boolean,defaults["true"]).field("trailing",Boolean,defaults["false"]);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(core);var es6=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var core_1=__importDefault(core);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){fork.use(core_1.default);var types=fork.use(types_1.default);var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;def("Function").field("generator",Boolean,defaults["false"]).field("expression",Boolean,defaults["false"]).field("defaults",[or(def("Expression"),null)],defaults.emptyArray)// TODO This could be represented as a RestElement in .params.
+  .field("rest",or(def("Identifier"),null),defaults["null"]);// The ESTree way of representing a ...rest parameter.
+  def("RestElement").bases("Pattern").build("argument").field("argument",def("Pattern")).field("typeAnnotation",// for Babylon. Flow parser puts it on the identifier
+  or(def("TypeAnnotation"),def("TSTypeAnnotation"),null),defaults["null"]);def("SpreadElementPattern").bases("Pattern").build("argument").field("argument",def("Pattern"));def("FunctionDeclaration").build("id","params","body","generator","expression");def("FunctionExpression").build("id","params","body","generator","expression");// The Parser API calls this ArrowExpression, but Esprima and all other
+  // actual parsers use ArrowFunctionExpression.
+  def("ArrowFunctionExpression").bases("Function","Expression").build("params","body","expression")// The forced null value here is compatible with the overridden
+  // definition of the "id" field in the Function interface.
+  .field("id",null,defaults["null"])// Arrow function bodies are allowed to be expressions.
+  .field("body",or(def("BlockStatement"),def("Expression")))// The current spec forbids arrow generators, so I have taken the
+  // liberty of enforcing that. TODO Report this.
+  .field("generator",false,defaults["false"]);def("ForOfStatement").bases("Statement").build("left","right","body").field("left",or(def("VariableDeclaration"),def("Pattern"))).field("right",def("Expression")).field("body",def("Statement"));def("YieldExpression").bases("Expression").build("argument","delegate").field("argument",or(def("Expression"),null)).field("delegate",Boolean,defaults["false"]);def("GeneratorExpression").bases("Expression").build("body","blocks","filter").field("body",def("Expression")).field("blocks",[def("ComprehensionBlock")]).field("filter",or(def("Expression"),null));def("ComprehensionExpression").bases("Expression").build("body","blocks","filter").field("body",def("Expression")).field("blocks",[def("ComprehensionBlock")]).field("filter",or(def("Expression"),null));def("ComprehensionBlock").bases("Node").build("left","right","each").field("left",def("Pattern")).field("right",def("Expression")).field("each",Boolean);def("Property").field("key",or(def("Literal"),def("Identifier"),def("Expression"))).field("value",or(def("Expression"),def("Pattern"))).field("method",Boolean,defaults["false"]).field("shorthand",Boolean,defaults["false"]).field("computed",Boolean,defaults["false"]);def("ObjectProperty").field("shorthand",Boolean,defaults["false"]);def("PropertyPattern").bases("Pattern").build("key","pattern").field("key",or(def("Literal"),def("Identifier"),def("Expression"))).field("pattern",def("Pattern")).field("computed",Boolean,defaults["false"]);def("ObjectPattern").bases("Pattern").build("properties").field("properties",[or(def("PropertyPattern"),def("Property"))]);def("ArrayPattern").bases("Pattern").build("elements").field("elements",[or(def("Pattern"),null)]);def("MethodDefinition").bases("Declaration").build("kind","key","value","static").field("kind",or("constructor","method","get","set")).field("key",def("Expression")).field("value",def("Function")).field("computed",Boolean,defaults["false"]).field("static",Boolean,defaults["false"]);def("SpreadElement").bases("Node").build("argument").field("argument",def("Expression"));def("ArrayExpression").field("elements",[or(def("Expression"),def("SpreadElement"),def("RestElement"),null)]);def("NewExpression").field("arguments",[or(def("Expression"),def("SpreadElement"))]);def("CallExpression").field("arguments",[or(def("Expression"),def("SpreadElement"))]);// Note: this node type is *not* an AssignmentExpression with a Pattern on
+  // the left-hand side! The existing AssignmentExpression type already
+  // supports destructuring assignments. AssignmentPattern nodes may appear
+  // wherever a Pattern is allowed, and the right-hand side represents a
+  // default value to be destructured against the left-hand side, if no
+  // value is otherwise provided. For example: default parameter values.
+  def("AssignmentPattern").bases("Pattern").build("left","right").field("left",def("Pattern")).field("right",def("Expression"));var ClassBodyElement=or(def("MethodDefinition"),def("VariableDeclarator"),def("ClassPropertyDefinition"),def("ClassProperty"));def("ClassProperty").bases("Declaration").build("key").field("key",or(def("Literal"),def("Identifier"),def("Expression"))).field("computed",Boolean,defaults["false"]);def("ClassPropertyDefinition")// static property
+  .bases("Declaration").build("definition")// Yes, Virginia, circular definitions are permitted.
+  .field("definition",ClassBodyElement);def("ClassBody").bases("Declaration").build("body").field("body",[ClassBodyElement]);def("ClassDeclaration").bases("Declaration").build("id","body","superClass").field("id",or(def("Identifier"),null)).field("body",def("ClassBody")).field("superClass",or(def("Expression"),null),defaults["null"]);def("ClassExpression").bases("Expression").build("id","body","superClass").field("id",or(def("Identifier"),null),defaults["null"]).field("body",def("ClassBody")).field("superClass",or(def("Expression"),null),defaults["null"]);// Specifier and ModuleSpecifier are abstract non-standard types
+  // introduced for definitional convenience.
+  def("Specifier").bases("Node");// This supertype is shared/abused by both def/babel.js and
+  // def/esprima.js. In the future, it will be possible to load only one set
+  // of definitions appropriate for a given parser, but until then we must
+  // rely on default functions to reconcile the conflicting AST formats.
+  def("ModuleSpecifier").bases("Specifier")// This local field is used by Babel/Acorn. It should not technically
+  // be optional in the Babel/Acorn AST format, but it must be optional
+  // in the Esprima AST format.
+  .field("local",or(def("Identifier"),null),defaults["null"])// The id and name fields are used by Esprima. The id field should not
+  // technically be optional in the Esprima AST format, but it must be
+  // optional in the Babel/Acorn AST format.
+  .field("id",or(def("Identifier"),null),defaults["null"]).field("name",or(def("Identifier"),null),defaults["null"]);// Like ModuleSpecifier, except type:"ImportSpecifier" and buildable.
+  // import {<id [as name]>} from ...;
+  def("ImportSpecifier").bases("ModuleSpecifier").build("id","name");// import <* as id> from ...;
+  def("ImportNamespaceSpecifier").bases("ModuleSpecifier").build("id");// import <id> from ...;
+  def("ImportDefaultSpecifier").bases("ModuleSpecifier").build("id");def("ImportDeclaration").bases("Declaration").build("specifiers","source","importKind").field("specifiers",[or(def("ImportSpecifier"),def("ImportNamespaceSpecifier"),def("ImportDefaultSpecifier"))],defaults.emptyArray).field("source",def("Literal")).field("importKind",or("value","type"),function(){return "value";});def("TaggedTemplateExpression").bases("Expression").build("tag","quasi").field("tag",def("Expression")).field("quasi",def("TemplateLiteral"));def("TemplateLiteral").bases("Expression").build("quasis","expressions").field("quasis",[def("TemplateElement")]).field("expressions",[def("Expression")]);def("TemplateElement").bases("Node").build("value","tail").field("value",{"cooked":String,"raw":String}).field("tail",Boolean);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(es6);var es7=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var es6_1=__importDefault(es6);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){fork.use(es6_1.default);var types=fork.use(types_1.default);var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;def("Function").field("async",Boolean,defaults["false"]);def("SpreadProperty").bases("Node").build("argument").field("argument",def("Expression"));def("ObjectExpression").field("properties",[or(def("Property"),def("SpreadProperty"),def("SpreadElement"))]);def("SpreadPropertyPattern").bases("Pattern").build("argument").field("argument",def("Pattern"));def("ObjectPattern").field("properties",[or(def("Property"),def("PropertyPattern"),def("SpreadPropertyPattern"))]);def("AwaitExpression").bases("Expression").build("argument","all").field("argument",or(def("Expression"),null)).field("all",Boolean,defaults["false"]);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(es7);var jsx=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var es7_1=__importDefault(es7);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){fork.use(es7_1.default);var types=fork.use(types_1.default);var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;def("JSXAttribute").bases("Node").build("name","value").field("name",or(def("JSXIdentifier"),def("JSXNamespacedName"))).field("value",or(def("Literal"),// attr="value"
+  def("JSXExpressionContainer"),// attr={value}
+  null// attr= or just attr
+  ),defaults["null"]);def("JSXIdentifier").bases("Identifier").build("name").field("name",String);def("JSXNamespacedName").bases("Node").build("namespace","name").field("namespace",def("JSXIdentifier")).field("name",def("JSXIdentifier"));def("JSXMemberExpression").bases("MemberExpression").build("object","property").field("object",or(def("JSXIdentifier"),def("JSXMemberExpression"))).field("property",def("JSXIdentifier")).field("computed",Boolean,defaults.false);var JSXElementName=or(def("JSXIdentifier"),def("JSXNamespacedName"),def("JSXMemberExpression"));def("JSXSpreadAttribute").bases("Node").build("argument").field("argument",def("Expression"));var JSXAttributes=[or(def("JSXAttribute"),def("JSXSpreadAttribute"))];def("JSXExpressionContainer").bases("Expression").build("expression").field("expression",def("Expression"));def("JSXElement").bases("Expression").build("openingElement","closingElement","children").field("openingElement",def("JSXOpeningElement")).field("closingElement",or(def("JSXClosingElement"),null),defaults["null"]).field("children",[or(def("JSXElement"),def("JSXExpressionContainer"),def("JSXFragment"),def("JSXText"),def("Literal")// TODO Esprima should return JSXText instead.
+  )],defaults.emptyArray).field("name",JSXElementName,function(){// Little-known fact: the `this` object inside a default function
+  // is none other than the partially-built object itself, and any
+  // fields initialized directly from builder function arguments
+  // (like openingElement, closingElement, and children) are
+  // guaranteed to be available.
+  return this.openingElement.name;},true)// hidden from traversal
+  .field("selfClosing",Boolean,function(){return this.openingElement.selfClosing;},true)// hidden from traversal
+  .field("attributes",JSXAttributes,function(){return this.openingElement.attributes;},true);// hidden from traversal
+  def("JSXOpeningElement").bases("Node")// TODO Does this make sense? Can't really be an JSXElement.
+  .build("name","attributes","selfClosing").field("name",JSXElementName).field("attributes",JSXAttributes,defaults.emptyArray).field("selfClosing",Boolean,defaults["false"]);def("JSXClosingElement").bases("Node")// TODO Same concern.
+  .build("name").field("name",JSXElementName);def("JSXFragment").bases("Expression").build("openingElement","closingElement","children").field("openingElement",def("JSXOpeningFragment")).field("closingElement",def("JSXClosingFragment")).field("children",[or(def("JSXElement"),def("JSXExpressionContainer"),def("JSXFragment"),def("JSXText"),def("Literal")// TODO Esprima should return JSXText instead.
+  )],defaults.emptyArray);def("JSXOpeningFragment").bases("Node")// TODO Same concern.
+  .build();def("JSXClosingFragment").bases("Node")// TODO Same concern.
+  .build();def("JSXText").bases("Literal").build("value").field("value",String);def("JSXEmptyExpression").bases("Expression").build();// This PR has caused many people issues, but supporting it seems like a
+  // good idea anyway: https://github.com/babel/babel/pull/4988
+  def("JSXSpreadChild").bases("Expression").build("expression").field("expression",def("Expression"));}exports.default=default_1;module.exports=exports["default"];});unwrapExports(jsx);var typeAnnotations=createCommonjsModule(function(module,exports){/**
+  	 * Type annotation defs shared between Flow and TypeScript.
+  	 * These defs could not be defined in ./flow.ts or ./typescript.ts directly
+  	 * because they use the same name.
+  	 */var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){var types=fork.use(types_1.default);var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;var TypeAnnotation=or(def("TypeAnnotation"),def("TSTypeAnnotation"),null);var TypeParamDecl=or(def("TypeParameterDeclaration"),def("TSTypeParameterDeclaration"),null);def("Identifier").field("typeAnnotation",TypeAnnotation,defaults["null"]);def("ObjectPattern").field("typeAnnotation",TypeAnnotation,defaults["null"]);def("Function").field("returnType",TypeAnnotation,defaults["null"]).field("typeParameters",TypeParamDecl,defaults["null"]);def("ClassProperty").build("key","value","typeAnnotation","static").field("value",or(def("Expression"),null)).field("static",Boolean,defaults["false"]).field("typeAnnotation",TypeAnnotation,defaults["null"]);["ClassDeclaration","ClassExpression"].forEach(function(typeName){def(typeName).field("typeParameters",TypeParamDecl,defaults["null"]).field("superTypeParameters",or(def("TypeParameterInstantiation"),def("TSTypeParameterInstantiation"),null),defaults["null"]).field("implements",or([def("ClassImplements")],[def("TSExpressionWithTypeArguments")]),defaults.emptyArray);});}exports.default=default_1;module.exports=exports["default"];});unwrapExports(typeAnnotations);var flow=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var es7_1=__importDefault(es7);var type_annotations_1=__importDefault(typeAnnotations);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){fork.use(es7_1.default);fork.use(type_annotations_1.default);var types=fork.use(types_1.default);var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;// Base types
+  def("Flow").bases("Node");def("FlowType").bases("Flow");// Type annotations
+  def("AnyTypeAnnotation").bases("FlowType").build();def("EmptyTypeAnnotation").bases("FlowType").build();def("MixedTypeAnnotation").bases("FlowType").build();def("VoidTypeAnnotation").bases("FlowType").build();def("NumberTypeAnnotation").bases("FlowType").build();def("NumberLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Number).field("raw",String);// Babylon 6 differs in AST from Flow
+  // same as NumberLiteralTypeAnnotation
+  def("NumericLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Number).field("raw",String);def("StringTypeAnnotation").bases("FlowType").build();def("StringLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",String).field("raw",String);def("BooleanTypeAnnotation").bases("FlowType").build();def("BooleanLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Boolean).field("raw",String);def("TypeAnnotation").bases("Node").build("typeAnnotation").field("typeAnnotation",def("FlowType"));def("NullableTypeAnnotation").bases("FlowType").build("typeAnnotation").field("typeAnnotation",def("FlowType"));def("NullLiteralTypeAnnotation").bases("FlowType").build();def("NullTypeAnnotation").bases("FlowType").build();def("ThisTypeAnnotation").bases("FlowType").build();def("ExistsTypeAnnotation").bases("FlowType").build();def("ExistentialTypeParam").bases("FlowType").build();def("FunctionTypeAnnotation").bases("FlowType").build("params","returnType","rest","typeParameters").field("params",[def("FunctionTypeParam")]).field("returnType",def("FlowType")).field("rest",or(def("FunctionTypeParam"),null)).field("typeParameters",or(def("TypeParameterDeclaration"),null));def("FunctionTypeParam").bases("Node").build("name","typeAnnotation","optional").field("name",def("Identifier")).field("typeAnnotation",def("FlowType")).field("optional",Boolean);def("ArrayTypeAnnotation").bases("FlowType").build("elementType").field("elementType",def("FlowType"));def("ObjectTypeAnnotation").bases("FlowType").build("properties","indexers","callProperties").field("properties",[or(def("ObjectTypeProperty"),def("ObjectTypeSpreadProperty"))]).field("indexers",[def("ObjectTypeIndexer")],defaults.emptyArray).field("callProperties",[def("ObjectTypeCallProperty")],defaults.emptyArray).field("inexact",or(Boolean,void 0),defaults["undefined"]).field("exact",Boolean,defaults["false"]).field("internalSlots",[def("ObjectTypeInternalSlot")],defaults.emptyArray);def("Variance").bases("Node").build("kind").field("kind",or("plus","minus"));var LegacyVariance=or(def("Variance"),"plus","minus",null);def("ObjectTypeProperty").bases("Node").build("key","value","optional").field("key",or(def("Literal"),def("Identifier"))).field("value",def("FlowType")).field("optional",Boolean).field("variance",LegacyVariance,defaults["null"]);def("ObjectTypeIndexer").bases("Node").build("id","key","value").field("id",def("Identifier")).field("key",def("FlowType")).field("value",def("FlowType")).field("variance",LegacyVariance,defaults["null"]);def("ObjectTypeCallProperty").bases("Node").build("value").field("value",def("FunctionTypeAnnotation")).field("static",Boolean,defaults["false"]);def("QualifiedTypeIdentifier").bases("Node").build("qualification","id").field("qualification",or(def("Identifier"),def("QualifiedTypeIdentifier"))).field("id",def("Identifier"));def("GenericTypeAnnotation").bases("FlowType").build("id","typeParameters").field("id",or(def("Identifier"),def("QualifiedTypeIdentifier"))).field("typeParameters",or(def("TypeParameterInstantiation"),null));def("MemberTypeAnnotation").bases("FlowType").build("object","property").field("object",def("Identifier")).field("property",or(def("MemberTypeAnnotation"),def("GenericTypeAnnotation")));def("UnionTypeAnnotation").bases("FlowType").build("types").field("types",[def("FlowType")]);def("IntersectionTypeAnnotation").bases("FlowType").build("types").field("types",[def("FlowType")]);def("TypeofTypeAnnotation").bases("FlowType").build("argument").field("argument",def("FlowType"));def("ObjectTypeSpreadProperty").bases("Node").build("argument").field("argument",def("FlowType"));def("ObjectTypeInternalSlot").bases("Node").build("id","value","optional","static","method").field("id",def("Identifier")).field("value",def("FlowType")).field("optional",Boolean).field("static",Boolean).field("method",Boolean);def("TypeParameterDeclaration").bases("Node").build("params").field("params",[def("TypeParameter")]);def("TypeParameterInstantiation").bases("Node").build("params").field("params",[def("FlowType")]);def("TypeParameter").bases("FlowType").build("name","variance","bound").field("name",String).field("variance",LegacyVariance,defaults["null"]).field("bound",or(def("TypeAnnotation"),null),defaults["null"]);def("ClassProperty").field("variance",LegacyVariance,defaults["null"]);def("ClassImplements").bases("Node").build("id").field("id",def("Identifier")).field("superClass",or(def("Expression"),null),defaults["null"]).field("typeParameters",or(def("TypeParameterInstantiation"),null),defaults["null"]);def("InterfaceTypeAnnotation").bases("FlowType").build("body","extends").field("body",def("ObjectTypeAnnotation")).field("extends",or([def("InterfaceExtends")],null),defaults["null"]);def("InterfaceDeclaration").bases("Declaration").build("id","body","extends").field("id",def("Identifier")).field("typeParameters",or(def("TypeParameterDeclaration"),null),defaults["null"]).field("body",def("ObjectTypeAnnotation")).field("extends",[def("InterfaceExtends")]);def("DeclareInterface").bases("InterfaceDeclaration").build("id","body","extends");def("InterfaceExtends").bases("Node").build("id").field("id",def("Identifier")).field("typeParameters",or(def("TypeParameterInstantiation"),null),defaults["null"]);def("TypeAlias").bases("Declaration").build("id","typeParameters","right").field("id",def("Identifier")).field("typeParameters",or(def("TypeParameterDeclaration"),null)).field("right",def("FlowType"));def("OpaqueType").bases("Declaration").build("id","typeParameters","impltype","supertype").field("id",def("Identifier")).field("typeParameters",or(def("TypeParameterDeclaration"),null)).field("impltype",def("FlowType")).field("supertype",def("FlowType"));def("DeclareTypeAlias").bases("TypeAlias").build("id","typeParameters","right");def("DeclareOpaqueType").bases("TypeAlias").build("id","typeParameters","supertype");def("TypeCastExpression").bases("Expression").build("expression","typeAnnotation").field("expression",def("Expression")).field("typeAnnotation",def("TypeAnnotation"));def("TupleTypeAnnotation").bases("FlowType").build("types").field("types",[def("FlowType")]);def("DeclareVariable").bases("Statement").build("id").field("id",def("Identifier"));def("DeclareFunction").bases("Statement").build("id").field("id",def("Identifier"));def("DeclareClass").bases("InterfaceDeclaration").build("id");def("DeclareModule").bases("Statement").build("id","body").field("id",or(def("Identifier"),def("Literal"))).field("body",def("BlockStatement"));def("DeclareModuleExports").bases("Statement").build("typeAnnotation").field("typeAnnotation",def("TypeAnnotation"));def("DeclareExportDeclaration").bases("Declaration").build("default","declaration","specifiers","source").field("default",Boolean).field("declaration",or(def("DeclareVariable"),def("DeclareFunction"),def("DeclareClass"),def("FlowType"),// Implies default.
+  null)).field("specifiers",[or(def("ExportSpecifier"),def("ExportBatchSpecifier"))],defaults.emptyArray).field("source",or(def("Literal"),null),defaults["null"]);def("DeclareExportAllDeclaration").bases("Declaration").build("source").field("source",or(def("Literal"),null),defaults["null"]);def("FlowPredicate").bases("Flow");def("InferredPredicate").bases("FlowPredicate").build();def("DeclaredPredicate").bases("FlowPredicate").build("value").field("value",def("Expression"));def("CallExpression").field("typeArguments",or(null,def("TypeParameterInstantiation")),defaults["null"]);def("NewExpression").field("typeArguments",or(null,def("TypeParameterInstantiation")),defaults["null"]);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(flow);var esprima=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var es7_1=__importDefault(es7);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){fork.use(es7_1.default);var types=fork.use(types_1.default);var defaults=fork.use(shared_1.default).defaults;var def=types.Type.def;var or=types.Type.or;def("VariableDeclaration").field("declarations",[or(def("VariableDeclarator"),def("Identifier")// Esprima deviation.
+  )]);def("Property").field("value",or(def("Expression"),def("Pattern")// Esprima deviation.
+  ));def("ArrayPattern").field("elements",[or(def("Pattern"),def("SpreadElement"),null)]);def("ObjectPattern").field("properties",[or(def("Property"),def("PropertyPattern"),def("SpreadPropertyPattern"),def("SpreadProperty")// Used by Esprima.
+  )]);// Like ModuleSpecifier, except type:"ExportSpecifier" and buildable.
+  // export {<id [as name]>} [from ...];
+  def("ExportSpecifier").bases("ModuleSpecifier").build("id","name");// export <*> from ...;
+  def("ExportBatchSpecifier").bases("Specifier").build();def("ExportDeclaration").bases("Declaration").build("default","declaration","specifiers","source").field("default",Boolean).field("declaration",or(def("Declaration"),def("Expression"),// Implies default.
+  null)).field("specifiers",[or(def("ExportSpecifier"),def("ExportBatchSpecifier"))],defaults.emptyArray).field("source",or(def("Literal"),null),defaults["null"]);def("Block").bases("Comment").build("value",/*optional:*/"leading","trailing");def("Line").bases("Comment").build("value",/*optional:*/"leading","trailing");}exports.default=default_1;module.exports=exports["default"];});unwrapExports(esprima);var babelCore=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var shared_1=__importDefault(shared);var es7_1=__importDefault(es7);function default_1(fork){fork.use(es7_1.default);var types=fork.use(types_1.default);var defaults=fork.use(shared_1.default).defaults;var def=types.Type.def;var or=types.Type.or;def("Noop").bases("Statement").build();def("DoExpression").bases("Expression").build("body").field("body",[def("Statement")]);def("Super").bases("Expression").build();def("BindExpression").bases("Expression").build("object","callee").field("object",or(def("Expression"),null)).field("callee",def("Expression"));def("Decorator").bases("Node").build("expression").field("expression",def("Expression"));def("Property").field("decorators",or([def("Decorator")],null),defaults["null"]);def("MethodDefinition").field("decorators",or([def("Decorator")],null),defaults["null"]);def("MetaProperty").bases("Expression").build("meta","property").field("meta",def("Identifier")).field("property",def("Identifier"));def("ParenthesizedExpression").bases("Expression").build("expression").field("expression",def("Expression"));def("ImportSpecifier").bases("ModuleSpecifier").build("imported","local").field("imported",def("Identifier"));def("ImportDefaultSpecifier").bases("ModuleSpecifier").build("local");def("ImportNamespaceSpecifier").bases("ModuleSpecifier").build("local");def("ExportDefaultDeclaration").bases("Declaration").build("declaration").field("declaration",or(def("Declaration"),def("Expression")));def("ExportNamedDeclaration").bases("Declaration").build("declaration","specifiers","source").field("declaration",or(def("Declaration"),null)).field("specifiers",[def("ExportSpecifier")],defaults.emptyArray).field("source",or(def("Literal"),null),defaults["null"]);def("ExportSpecifier").bases("ModuleSpecifier").build("local","exported").field("exported",def("Identifier"));def("ExportNamespaceSpecifier").bases("Specifier").build("exported").field("exported",def("Identifier"));def("ExportDefaultSpecifier").bases("Specifier").build("exported").field("exported",def("Identifier"));def("ExportAllDeclaration").bases("Declaration").build("exported","source").field("exported",or(def("Identifier"),null)).field("source",def("Literal"));def("CommentBlock").bases("Comment").build("value",/*optional:*/"leading","trailing");def("CommentLine").bases("Comment").build("value",/*optional:*/"leading","trailing");def("Directive").bases("Node").build("value").field("value",def("DirectiveLiteral"));def("DirectiveLiteral").bases("Node","Expression").build("value").field("value",String,defaults["use strict"]);def("InterpreterDirective").bases("Node").build("value").field("value",String);def("BlockStatement").bases("Statement").build("body").field("body",[def("Statement")]).field("directives",[def("Directive")],defaults.emptyArray);def("Program").bases("Node").build("body").field("body",[def("Statement")]).field("directives",[def("Directive")],defaults.emptyArray).field("interpreter",or(def("InterpreterDirective"),null),defaults["null"]);// Split Literal
+  def("StringLiteral").bases("Literal").build("value").field("value",String);def("NumericLiteral").bases("Literal").build("value").field("value",Number).field("raw",or(String,null),defaults["null"]).field("extra",{rawValue:Number,raw:String},function getDefault(){return {rawValue:this.value,raw:this.value+""};});def("BigIntLiteral").bases("Literal").build("value")// Only String really seems appropriate here, since BigInt values
+  // often exceed the limits of JS numbers.
+  .field("value",or(String,Number)).field("extra",{rawValue:String,raw:String},function getDefault(){return {rawValue:String(this.value),raw:this.value+"n"};});def("NullLiteral").bases("Literal").build().field("value",null,defaults["null"]);def("BooleanLiteral").bases("Literal").build("value").field("value",Boolean);def("RegExpLiteral").bases("Literal").build("pattern","flags").field("pattern",String).field("flags",String).field("value",RegExp,function(){return new RegExp(this.pattern,this.flags);});var ObjectExpressionProperty=or(def("Property"),def("ObjectMethod"),def("ObjectProperty"),def("SpreadProperty"),def("SpreadElement"));// Split Property -> ObjectProperty and ObjectMethod
+  def("ObjectExpression").bases("Expression").build("properties").field("properties",[ObjectExpressionProperty]);// ObjectMethod hoist .value properties to own properties
+  def("ObjectMethod").bases("Node","Function").build("kind","key","params","body","computed").field("kind",or("method","get","set")).field("key",or(def("Literal"),def("Identifier"),def("Expression"))).field("params",[def("Pattern")]).field("body",def("BlockStatement")).field("computed",Boolean,defaults["false"]).field("generator",Boolean,defaults["false"]).field("async",Boolean,defaults["false"]).field("accessibility",// TypeScript
+  or(def("Literal"),null),defaults["null"]).field("decorators",or([def("Decorator")],null),defaults["null"]);def("ObjectProperty").bases("Node").build("key","value").field("key",or(def("Literal"),def("Identifier"),def("Expression"))).field("value",or(def("Expression"),def("Pattern"))).field("accessibility",// TypeScript
+  or(def("Literal"),null),defaults["null"]).field("computed",Boolean,defaults["false"]);var ClassBodyElement=or(def("MethodDefinition"),def("VariableDeclarator"),def("ClassPropertyDefinition"),def("ClassProperty"),def("ClassPrivateProperty"),def("ClassMethod"),def("ClassPrivateMethod"));// MethodDefinition -> ClassMethod
+  def("ClassBody").bases("Declaration").build("body").field("body",[ClassBodyElement]);def("ClassMethod").bases("Declaration","Function").build("kind","key","params","body","computed","static").field("key",or(def("Literal"),def("Identifier"),def("Expression")));def("ClassPrivateMethod").bases("Declaration","Function").build("key","params","body","kind","computed","static").field("key",def("PrivateName"));["ClassMethod","ClassPrivateMethod"].forEach(function(typeName){def(typeName).field("kind",or("get","set","method","constructor"),function(){return "method";}).field("body",def("BlockStatement")).field("computed",Boolean,defaults["false"]).field("static",or(Boolean,null),defaults["null"]).field("abstract",or(Boolean,null),defaults["null"]).field("access",or("public","private","protected",null),defaults["null"]).field("accessibility",or("public","private","protected",null),defaults["null"]).field("decorators",or([def("Decorator")],null),defaults["null"]).field("optional",or(Boolean,null),defaults["null"]);});def("ClassPrivateProperty").bases("ClassProperty").build("key","value").field("key",def("PrivateName")).field("value",or(def("Expression"),null),defaults["null"]);def("PrivateName").bases("Expression","Pattern").build("id").field("id",def("Identifier"));var ObjectPatternProperty=or(def("Property"),def("PropertyPattern"),def("SpreadPropertyPattern"),def("SpreadProperty"),// Used by Esprima
+  def("ObjectProperty"),// Babel 6
+  def("RestProperty")// Babel 6
+  );// Split into RestProperty and SpreadProperty
+  def("ObjectPattern").bases("Pattern").build("properties").field("properties",[ObjectPatternProperty]).field("decorators",or([def("Decorator")],null),defaults["null"]);def("SpreadProperty").bases("Node").build("argument").field("argument",def("Expression"));def("RestProperty").bases("Node").build("argument").field("argument",def("Expression"));def("ForAwaitStatement").bases("Statement").build("left","right","body").field("left",or(def("VariableDeclaration"),def("Expression"))).field("right",def("Expression")).field("body",def("Statement"));// The callee node of a dynamic import(...) expression.
+  def("Import").bases("Expression").build();}exports.default=default_1;module.exports=exports["default"];});unwrapExports(babelCore);var babel=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var babel_core_1=__importDefault(babelCore);var flow_1=__importDefault(flow);function default_1(fork){fork.use(babel_core_1.default);fork.use(flow_1.default);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(babel);var typescript=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var babel_core_1=__importDefault(babelCore);var type_annotations_1=__importDefault(typeAnnotations);var types_1=__importDefault(types);var shared_1=__importDefault(shared);function default_1(fork){// Since TypeScript is parsed by Babylon, include the core Babylon types
+  // but omit the Flow-related types.
+  fork.use(babel_core_1.default);fork.use(type_annotations_1.default);var types=fork.use(types_1.default);var n=types.namedTypes;var def=types.Type.def;var or=types.Type.or;var defaults=fork.use(shared_1.default).defaults;var StringLiteral=types.Type.from(function(value,deep){if(n.StringLiteral&&n.StringLiteral.check(value,deep)){return true;}if(n.Literal&&n.Literal.check(value,deep)&&typeof value.value==="string"){return true;}return false;},"StringLiteral");def("TSType").bases("Node");var TSEntityName=or(def("Identifier"),def("TSQualifiedName"));def("TSTypeReference").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("typeName","typeParameters").field("typeName",TSEntityName);// An abstract (non-buildable) base type that provide a commonly-needed
+  // optional .typeParameters field.
+  def("TSHasOptionalTypeParameterInstantiation").field("typeParameters",or(def("TSTypeParameterInstantiation"),null),defaults["null"]);// An abstract (non-buildable) base type that provide a commonly-needed
+  // optional .typeParameters field.
+  def("TSHasOptionalTypeParameters").field("typeParameters",or(def("TSTypeParameterDeclaration"),null,void 0),defaults["null"]);// An abstract (non-buildable) base type that provide a commonly-needed
+  // optional .typeAnnotation field.
+  def("TSHasOptionalTypeAnnotation").field("typeAnnotation",or(def("TSTypeAnnotation"),null),defaults["null"]);def("TSQualifiedName").bases("Node").build("left","right").field("left",TSEntityName).field("right",TSEntityName);def("TSAsExpression").bases("Expression","Pattern").build("expression","typeAnnotation").field("expression",def("Expression")).field("typeAnnotation",def("TSType")).field("extra",or({parenthesized:Boolean},null),defaults["null"]);def("TSNonNullExpression").bases("Expression","Pattern").build("expression").field("expression",def("Expression"));["TSAnyKeyword","TSBigIntKeyword","TSBooleanKeyword","TSNeverKeyword","TSNullKeyword","TSNumberKeyword","TSObjectKeyword","TSStringKeyword","TSSymbolKeyword","TSUndefinedKeyword","TSUnknownKeyword","TSVoidKeyword","TSThisType"].forEach(function(keywordType){def(keywordType).bases("TSType").build();});def("TSArrayType").bases("TSType").build("elementType").field("elementType",def("TSType"));def("TSLiteralType").bases("TSType").build("literal").field("literal",or(def("NumericLiteral"),def("StringLiteral"),def("BooleanLiteral"),def("TemplateLiteral"),def("UnaryExpression")));["TSUnionType","TSIntersectionType"].forEach(function(typeName){def(typeName).bases("TSType").build("types").field("types",[def("TSType")]);});def("TSConditionalType").bases("TSType").build("checkType","extendsType","trueType","falseType").field("checkType",def("TSType")).field("extendsType",def("TSType")).field("trueType",def("TSType")).field("falseType",def("TSType"));def("TSInferType").bases("TSType").build("typeParameter").field("typeParameter",def("TSTypeParameter"));def("TSParenthesizedType").bases("TSType").build("typeAnnotation").field("typeAnnotation",def("TSType"));var ParametersType=[or(def("Identifier"),def("RestElement"),def("ArrayPattern"),def("ObjectPattern"))];["TSFunctionType","TSConstructorType"].forEach(function(typeName){def(typeName).bases("TSType","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("parameters").field("parameters",ParametersType);});def("TSDeclareFunction").bases("Declaration","TSHasOptionalTypeParameters").build("id","params","returnType").field("declare",Boolean,defaults["false"]).field("async",Boolean,defaults["false"]).field("generator",Boolean,defaults["false"]).field("id",or(def("Identifier"),null),defaults["null"]).field("params",[def("Pattern")])// tSFunctionTypeAnnotationCommon
+  .field("returnType",or(def("TSTypeAnnotation"),def("Noop"),// Still used?
+  null),defaults["null"]);def("TSDeclareMethod").bases("Declaration","TSHasOptionalTypeParameters").build("key","params","returnType").field("async",Boolean,defaults["false"]).field("generator",Boolean,defaults["false"]).field("params",[def("Pattern")])// classMethodOrPropertyCommon
+  .field("abstract",Boolean,defaults["false"]).field("accessibility",or("public","private","protected",void 0),defaults["undefined"]).field("static",Boolean,defaults["false"]).field("computed",Boolean,defaults["false"]).field("optional",Boolean,defaults["false"]).field("key",or(def("Identifier"),def("StringLiteral"),def("NumericLiteral"),// Only allowed if .computed is true.
+  def("Expression")))// classMethodOrDeclareMethodCommon
+  .field("kind",or("get","set","method","constructor"),function getDefault(){return "method";}).field("access",// Not "accessibility"?
+  or("public","private","protected",void 0),defaults["undefined"]).field("decorators",or([def("Decorator")],null),defaults["null"])// tSFunctionTypeAnnotationCommon
+  .field("returnType",or(def("TSTypeAnnotation"),def("Noop"),// Still used?
+  null),defaults["null"]);def("TSMappedType").bases("TSType").build("typeParameter","typeAnnotation").field("readonly",or(Boolean,"+","-"),defaults["false"]).field("typeParameter",def("TSTypeParameter")).field("optional",or(Boolean,"+","-"),defaults["false"]).field("typeAnnotation",or(def("TSType"),null),defaults["null"]);def("TSTupleType").bases("TSType").build("elementTypes").field("elementTypes",[def("TSType")]);def("TSRestType").bases("TSType").build("typeAnnotation").field("typeAnnotation",def("TSType"));def("TSOptionalType").bases("TSType").build("typeAnnotation").field("typeAnnotation",def("TSType"));def("TSIndexedAccessType").bases("TSType").build("objectType","indexType").field("objectType",def("TSType")).field("indexType",def("TSType"));def("TSTypeOperator").bases("TSType").build("operator").field("operator",String).field("typeAnnotation",def("TSType"));def("TSTypeAnnotation").bases("Node").build("typeAnnotation").field("typeAnnotation",or(def("TSType"),def("TSTypeAnnotation")));def("TSIndexSignature").bases("Declaration","TSHasOptionalTypeAnnotation").build("parameters","typeAnnotation").field("parameters",[def("Identifier")])// Length === 1
+  .field("readonly",Boolean,defaults["false"]);def("TSPropertySignature").bases("Declaration","TSHasOptionalTypeAnnotation").build("key","typeAnnotation","optional").field("key",def("Expression")).field("computed",Boolean,defaults["false"]).field("readonly",Boolean,defaults["false"]).field("optional",Boolean,defaults["false"]).field("initializer",or(def("Expression"),null),defaults["null"]);def("TSMethodSignature").bases("Declaration","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("key","parameters","typeAnnotation").field("key",def("Expression")).field("computed",Boolean,defaults["false"]).field("optional",Boolean,defaults["false"]).field("parameters",ParametersType);def("TSTypePredicate").bases("TSTypeAnnotation").build("parameterName","typeAnnotation").field("parameterName",or(def("Identifier"),def("TSThisType"))).field("typeAnnotation",def("TSTypeAnnotation"));["TSCallSignatureDeclaration","TSConstructSignatureDeclaration"].forEach(function(typeName){def(typeName).bases("Declaration","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("parameters","typeAnnotation").field("parameters",ParametersType);});def("TSEnumMember").bases("Node").build("id","initializer").field("id",or(def("Identifier"),StringLiteral)).field("initializer",or(def("Expression"),null),defaults["null"]);def("TSTypeQuery").bases("TSType").build("exprName").field("exprName",or(TSEntityName,def("TSImportType")));// Inferred from Babylon's tsParseTypeMember method.
+  var TSTypeMember=or(def("TSCallSignatureDeclaration"),def("TSConstructSignatureDeclaration"),def("TSIndexSignature"),def("TSMethodSignature"),def("TSPropertySignature"));def("TSTypeLiteral").bases("TSType").build("members").field("members",[TSTypeMember]);def("TSTypeParameter").bases("Identifier").build("name","constraint","default").field("name",String).field("constraint",or(def("TSType"),void 0),defaults["undefined"]).field("default",or(def("TSType"),void 0),defaults["undefined"]);def("TSTypeAssertion").bases("Expression","Pattern").build("typeAnnotation","expression").field("typeAnnotation",def("TSType")).field("expression",def("Expression")).field("extra",or({parenthesized:Boolean},null),defaults["null"]);def("TSTypeParameterDeclaration").bases("Declaration").build("params").field("params",[def("TSTypeParameter")]);def("TSTypeParameterInstantiation").bases("Node").build("params").field("params",[def("TSType")]);def("TSEnumDeclaration").bases("Declaration").build("id","members").field("id",def("Identifier")).field("const",Boolean,defaults["false"]).field("declare",Boolean,defaults["false"]).field("members",[def("TSEnumMember")]).field("initializer",or(def("Expression"),null),defaults["null"]);def("TSTypeAliasDeclaration").bases("Declaration","TSHasOptionalTypeParameters").build("id","typeAnnotation").field("id",def("Identifier")).field("declare",Boolean,defaults["false"]).field("typeAnnotation",def("TSType"));def("TSModuleBlock").bases("Node").build("body").field("body",[def("Statement")]);def("TSModuleDeclaration").bases("Declaration").build("id","body").field("id",or(StringLiteral,TSEntityName)).field("declare",Boolean,defaults["false"]).field("global",Boolean,defaults["false"]).field("body",or(def("TSModuleBlock"),def("TSModuleDeclaration"),null),defaults["null"]);def("TSImportType").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("argument","qualifier","typeParameters").field("argument",StringLiteral).field("qualifier",or(TSEntityName,void 0),defaults["undefined"]);def("TSImportEqualsDeclaration").bases("Declaration").build("id","moduleReference").field("id",def("Identifier")).field("isExport",Boolean,defaults["false"]).field("moduleReference",or(TSEntityName,def("TSExternalModuleReference")));def("TSExternalModuleReference").bases("Declaration").build("expression").field("expression",StringLiteral);def("TSExportAssignment").bases("Statement").build("expression").field("expression",def("Expression"));def("TSNamespaceExportDeclaration").bases("Declaration").build("id").field("id",def("Identifier"));def("TSInterfaceBody").bases("Node").build("body").field("body",[TSTypeMember]);def("TSExpressionWithTypeArguments").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("expression","typeParameters").field("expression",TSEntityName);def("TSInterfaceDeclaration").bases("Declaration","TSHasOptionalTypeParameters").build("id","body").field("id",TSEntityName).field("declare",Boolean,defaults["false"]).field("extends",or([def("TSExpressionWithTypeArguments")],null),defaults["null"]).field("body",def("TSInterfaceBody"));def("TSParameterProperty").bases("Pattern").build("parameter").field("accessibility",or("public","private","protected",void 0),defaults["undefined"]).field("readonly",Boolean,defaults["false"]).field("parameter",or(def("Identifier"),def("AssignmentPattern")));def("ClassProperty").field("access",// Not "accessibility"?
+  or("public","private","protected",void 0),defaults["undefined"]);// Defined already in es6 and babel-core.
+  def("ClassBody").field("body",[or(def("MethodDefinition"),def("VariableDeclarator"),def("ClassPropertyDefinition"),def("ClassProperty"),def("ClassPrivateProperty"),def("ClassMethod"),def("ClassPrivateMethod"),// Just need to add these types:
+  def("TSDeclareMethod"),TSTypeMember)]);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(typescript);var esProposals=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var types_1=__importDefault(types);var shared_1=__importDefault(shared);var core_1=__importDefault(core);function default_1(fork){fork.use(core_1.default);var types=fork.use(types_1.default);var Type=types.Type;var def=types.Type.def;var or=Type.or;var shared=fork.use(shared_1.default);var defaults=shared.defaults;// https://github.com/tc39/proposal-optional-chaining
+  // `a?.b` as per https://github.com/estree/estree/issues/146
+  def("OptionalMemberExpression").bases("MemberExpression").build("object","property","computed","optional").field("optional",Boolean,defaults["true"]);// a?.b()
+  def("OptionalCallExpression").bases("CallExpression").build("callee","arguments","optional").field("optional",Boolean,defaults["true"]);// https://github.com/tc39/proposal-nullish-coalescing
+  // `a ?? b` as per https://github.com/babel/babylon/pull/761/files
+  var LogicalOperator=or("||","&&","??");def("LogicalExpression").field("operator",LogicalOperator);}exports.default=default_1;module.exports=exports["default"];});unwrapExports(esProposals);var namedTypes_1=createCommonjsModule(function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});var namedTypes;(function(namedTypes){})(namedTypes=exports.namedTypes||(exports.namedTypes={}));});unwrapExports(namedTypes_1);var namedTypes_2=namedTypes_1.namedTypes;var main=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var fork_1=__importDefault(fork);var core_1=__importDefault(core);var es6_1=__importDefault(es6);var es7_1=__importDefault(es7);var jsx_1=__importDefault(jsx);var flow_1=__importDefault(flow);var esprima_1=__importDefault(esprima);var babel_1=__importDefault(babel);var typescript_1=__importDefault(typescript);var es_proposals_1=__importDefault(esProposals);exports.namedTypes=namedTypes_1.namedTypes;var _a=fork_1.default([// This core module of AST types captures ES5 as it is parsed today by
+  // git://github.com/ariya/esprima.git#master.
+  core_1.default,// Feel free to add to or remove from this list of extension modules to
+  // configure the precise type hierarchy that you need.
+  es6_1.default,es7_1.default,jsx_1.default,flow_1.default,esprima_1.default,babel_1.default,typescript_1.default,es_proposals_1.default]),astNodesAreEquivalent=_a.astNodesAreEquivalent,builders=_a.builders,builtInTypes=_a.builtInTypes,defineMethod=_a.defineMethod,eachField=_a.eachField,finalize=_a.finalize,getBuilderName=_a.getBuilderName,getFieldNames=_a.getFieldNames,getFieldValue=_a.getFieldValue,getSupertypeNames=_a.getSupertypeNames,n=_a.namedTypes,NodePath=_a.NodePath,Path=_a.Path,PathVisitor=_a.PathVisitor,someField=_a.someField,Type=_a.Type,use=_a.use,visit=_a.visit;exports.astNodesAreEquivalent=astNodesAreEquivalent;exports.builders=builders;exports.builtInTypes=builtInTypes;exports.defineMethod=defineMethod;exports.eachField=eachField;exports.finalize=finalize;exports.getBuilderName=getBuilderName;exports.getFieldNames=getFieldNames;exports.getFieldValue=getFieldValue;exports.getSupertypeNames=getSupertypeNames;exports.NodePath=NodePath;exports.Path=Path;exports.PathVisitor=PathVisitor;exports.someField=someField;exports.Type=Type;exports.use=use;exports.visit=visit;// Populate the exported fields of the namedTypes namespace, while still
+  // retaining its member types.
+  Object.assign(namedTypes_1.namedTypes,n);});unwrapExports(main);var main_1=main.namedTypes;var main_2=main.astNodesAreEquivalent;var main_3=main.builders;var main_4=main.builtInTypes;var main_5=main.defineMethod;var main_6=main.eachField;var main_7=main.finalize;var main_8=main.getBuilderName;var main_9=main.getFieldNames;var main_10=main.getFieldValue;var main_11=main.getSupertypeNames;var main_12=main.NodePath;var main_13=main.Path;var main_14=main.PathVisitor;var main_15=main.someField;var main_16=main.Type;var main_17=main.use;var main_18=main.visit;var lookup=[];var revLookup=[];var Arr=typeof Uint8Array!=='undefined'?Uint8Array:Array;var inited=false;function init(){inited=true;var code='ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';for(var i=0,len=code.length;i<len;++i){lookup[i]=code[i];revLookup[code.charCodeAt(i)]=i;}revLookup['-'.charCodeAt(0)]=62;revLookup['_'.charCodeAt(0)]=63;}function toByteArray(b64){if(!inited){init();}var i,j,l,tmp,placeHolders,arr;var len=b64.length;if(len%4>0){throw new Error('Invalid string. Length must be a multiple of 4');}// the number of equal signs (place holders)
+  // if there are two placeholders, than the two characters before it
+  // represent one byte
+  // if there is only one, then the three characters before it represent 2 bytes
+  // this is just a cheap hack to not do indexOf twice
+  placeHolders=b64[len-2]==='='?2:b64[len-1]==='='?1:0;// base64 is 4/3 + up to two characters of the original data
+  arr=new Arr(len*3/4-placeHolders);// if there are placeholders, only get up to the last complete 4 chars
+  l=placeHolders>0?len-4:len;var L=0;for(i=0,j=0;i<l;i+=4,j+=3){tmp=revLookup[b64.charCodeAt(i)]<<18|revLookup[b64.charCodeAt(i+1)]<<12|revLookup[b64.charCodeAt(i+2)]<<6|revLookup[b64.charCodeAt(i+3)];arr[L++]=tmp>>16&0xFF;arr[L++]=tmp>>8&0xFF;arr[L++]=tmp&0xFF;}if(placeHolders===2){tmp=revLookup[b64.charCodeAt(i)]<<2|revLookup[b64.charCodeAt(i+1)]>>4;arr[L++]=tmp&0xFF;}else if(placeHolders===1){tmp=revLookup[b64.charCodeAt(i)]<<10|revLookup[b64.charCodeAt(i+1)]<<4|revLookup[b64.charCodeAt(i+2)]>>2;arr[L++]=tmp>>8&0xFF;arr[L++]=tmp&0xFF;}return arr;}function tripletToBase64(num){return lookup[num>>18&0x3F]+lookup[num>>12&0x3F]+lookup[num>>6&0x3F]+lookup[num&0x3F];}function encodeChunk(uint8,start,end){var tmp;var output=[];for(var i=start;i<end;i+=3){tmp=(uint8[i]<<16)+(uint8[i+1]<<8)+uint8[i+2];output.push(tripletToBase64(tmp));}return output.join('');}function fromByteArray(uint8){if(!inited){init();}var tmp;var len=uint8.length;var extraBytes=len%3;// if we have 1 byte left, pad 2 bytes
+  var output='';var parts=[];var maxChunkLength=16383;// must be multiple of 3
+  // go through the array every three bytes, we'll deal with trailing stuff later
+  for(var i=0,len2=len-extraBytes;i<len2;i+=maxChunkLength){parts.push(encodeChunk(uint8,i,i+maxChunkLength>len2?len2:i+maxChunkLength));}// pad the end with zeros, but make sure to not forget the extra bytes
+  if(extraBytes===1){tmp=uint8[len-1];output+=lookup[tmp>>2];output+=lookup[tmp<<4&0x3F];output+='==';}else if(extraBytes===2){tmp=(uint8[len-2]<<8)+uint8[len-1];output+=lookup[tmp>>10];output+=lookup[tmp>>4&0x3F];output+=lookup[tmp<<2&0x3F];output+='=';}parts.push(output);return parts.join('');}function read(buffer,offset,isLE,mLen,nBytes){var e,m;var eLen=nBytes*8-mLen-1;var eMax=(1<<eLen)-1;var eBias=eMax>>1;var nBits=-7;var i=isLE?nBytes-1:0;var d=isLE?-1:1;var s=buffer[offset+i];i+=d;e=s&(1<<-nBits)-1;s>>=-nBits;nBits+=eLen;for(;nBits>0;e=e*256+buffer[offset+i],i+=d,nBits-=8){}m=e&(1<<-nBits)-1;e>>=-nBits;nBits+=mLen;for(;nBits>0;m=m*256+buffer[offset+i],i+=d,nBits-=8){}if(e===0){e=1-eBias;}else if(e===eMax){return m?NaN:(s?-1:1)*Infinity;}else{m=m+Math.pow(2,mLen);e=e-eBias;}return (s?-1:1)*m*Math.pow(2,e-mLen);}function write(buffer,value,offset,isLE,mLen,nBytes){var e,m,c;var eLen=nBytes*8-mLen-1;var eMax=(1<<eLen)-1;var eBias=eMax>>1;var rt=mLen===23?Math.pow(2,-24)-Math.pow(2,-77):0;var i=isLE?0:nBytes-1;var d=isLE?1:-1;var s=value<0||value===0&&1/value<0?1:0;value=Math.abs(value);if(isNaN(value)||value===Infinity){m=isNaN(value)?1:0;e=eMax;}else{e=Math.floor(Math.log(value)/Math.LN2);if(value*(c=Math.pow(2,-e))<1){e--;c*=2;}if(e+eBias>=1){value+=rt/c;}else{value+=rt*Math.pow(2,1-eBias);}if(value*c>=2){e++;c/=2;}if(e+eBias>=eMax){m=0;e=eMax;}else if(e+eBias>=1){m=(value*c-1)*Math.pow(2,mLen);e=e+eBias;}else{m=value*Math.pow(2,eBias-1)*Math.pow(2,mLen);e=0;}}for(;mLen>=8;buffer[offset+i]=m&0xff,i+=d,m/=256,mLen-=8){}e=e<<mLen|m;eLen+=mLen;for(;eLen>0;buffer[offset+i]=e&0xff,i+=d,e/=256,eLen-=8){}buffer[offset+i-d]|=s*128;}var toString={}.toString;var isArray=Array.isArray||function(arr){return toString.call(arr)=='[object Array]';};/*!
+  	 * The buffer module from node.js, for the browser.
+  	 *
+  	 * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+  	 * @license  MIT
+  	 */var INSPECT_MAX_BYTES=50;/**
+  	 * If `Buffer.TYPED_ARRAY_SUPPORT`:
+  	 *   === true    Use Uint8Array implementation (fastest)
+  	 *   === false   Use Object implementation (most compatible, even IE6)
+  	 *
+  	 * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
+  	 * Opera 11.6+, iOS 4.2+.
+  	 *
+  	 * Due to various browser bugs, sometimes the Object implementation will be used even
+  	 * when the browser supports typed arrays.
+  	 *
+  	 * Note:
+  	 *
+  	 *   - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,
+  	 *     See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
+  	 *
+  	 *   - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
+  	 *
+  	 *   - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
+  	 *     incorrect length in some situations.
+
+  	 * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they
+  	 * get the Object implementation, which is slower but behaves correctly.
+  	 */Buffer.TYPED_ARRAY_SUPPORT=commonjsGlobal.TYPED_ARRAY_SUPPORT!==undefined?commonjsGlobal.TYPED_ARRAY_SUPPORT:true;function kMaxLength(){return Buffer.TYPED_ARRAY_SUPPORT?0x7fffffff:0x3fffffff;}function createBuffer(that,length){if(kMaxLength()<length){throw new RangeError('Invalid typed array length');}if(Buffer.TYPED_ARRAY_SUPPORT){// Return an augmented `Uint8Array` instance, for best performance
+  that=new Uint8Array(length);that.__proto__=Buffer.prototype;}else{// Fallback: Return an object instance of the Buffer class
+  if(that===null){that=new Buffer(length);}that.length=length;}return that;}/**
+  	 * The Buffer constructor returns instances of `Uint8Array` that have their
+  	 * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
+  	 * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
+  	 * and the `Uint8Array` methods. Square bracket notation works as expected -- it
+  	 * returns a single octet.
+  	 *
+  	 * The `Uint8Array` prototype remains unmodified.
+  	 */function Buffer(arg,encodingOrOffset,length){if(!Buffer.TYPED_ARRAY_SUPPORT&&!(this instanceof Buffer)){return new Buffer(arg,encodingOrOffset,length);}// Common case.
+  if(typeof arg==='number'){if(typeof encodingOrOffset==='string'){throw new Error('If encoding is specified then the first argument must be a string');}return allocUnsafe(this,arg);}return from(this,arg,encodingOrOffset,length);}Buffer.poolSize=8192;// not used by this implementation
+  // TODO: Legacy, not needed anymore. Remove in next major version.
+  Buffer._augment=function(arr){arr.__proto__=Buffer.prototype;return arr;};function from(that,value,encodingOrOffset,length){if(typeof value==='number'){throw new TypeError('"value" argument must not be a number');}if(typeof ArrayBuffer!=='undefined'&&value instanceof ArrayBuffer){return fromArrayBuffer(that,value,encodingOrOffset,length);}if(typeof value==='string'){return fromString(that,value,encodingOrOffset);}return fromObject(that,value);}/**
+  	 * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
+  	 * if value is a number.
+  	 * Buffer.from(str[, encoding])
+  	 * Buffer.from(array)
+  	 * Buffer.from(buffer)
+  	 * Buffer.from(arrayBuffer[, byteOffset[, length]])
+  	 **/Buffer.from=function(value,encodingOrOffset,length){return from(null,value,encodingOrOffset,length);};if(Buffer.TYPED_ARRAY_SUPPORT){Buffer.prototype.__proto__=Uint8Array.prototype;Buffer.__proto__=Uint8Array;}function assertSize(size){if(typeof size!=='number'){throw new TypeError('"size" argument must be a number');}else if(size<0){throw new RangeError('"size" argument must not be negative');}}function alloc(that,size,fill,encoding){assertSize(size);if(size<=0){return createBuffer(that,size);}if(fill!==undefined){// Only pay attention to encoding if it's a string. This
+  // prevents accidentally sending in a number that would
+  // be interpretted as a start offset.
+  return typeof encoding==='string'?createBuffer(that,size).fill(fill,encoding):createBuffer(that,size).fill(fill);}return createBuffer(that,size);}/**
+  	 * Creates a new filled Buffer instance.
+  	 * alloc(size[, fill[, encoding]])
+  	 **/Buffer.alloc=function(size,fill,encoding){return alloc(null,size,fill,encoding);};function allocUnsafe(that,size){assertSize(size);that=createBuffer(that,size<0?0:checked(size)|0);if(!Buffer.TYPED_ARRAY_SUPPORT){for(var i=0;i<size;++i){that[i]=0;}}return that;}/**
+  	 * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
+  	 * */Buffer.allocUnsafe=function(size){return allocUnsafe(null,size);};/**
+  	 * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
+  	 */Buffer.allocUnsafeSlow=function(size){return allocUnsafe(null,size);};function fromString(that,string,encoding){if(typeof encoding!=='string'||encoding===''){encoding='utf8';}if(!Buffer.isEncoding(encoding)){throw new TypeError('"encoding" must be a valid string encoding');}var length=byteLength(string,encoding)|0;that=createBuffer(that,length);var actual=that.write(string,encoding);if(actual!==length){// Writing a hex string, for example, that contains invalid characters will
+  // cause everything after the first invalid character to be ignored. (e.g.
+  // 'abxxcd' will be treated as 'ab')
+  that=that.slice(0,actual);}return that;}function fromArrayLike(that,array){var length=array.length<0?0:checked(array.length)|0;that=createBuffer(that,length);for(var i=0;i<length;i+=1){that[i]=array[i]&255;}return that;}function fromArrayBuffer(that,array,byteOffset,length){array.byteLength;// this throws if `array` is not a valid ArrayBuffer
+  if(byteOffset<0||array.byteLength<byteOffset){throw new RangeError('\'offset\' is out of bounds');}if(array.byteLength<byteOffset+(length||0)){throw new RangeError('\'length\' is out of bounds');}if(byteOffset===undefined&&length===undefined){array=new Uint8Array(array);}else if(length===undefined){array=new Uint8Array(array,byteOffset);}else{array=new Uint8Array(array,byteOffset,length);}if(Buffer.TYPED_ARRAY_SUPPORT){// Return an augmented `Uint8Array` instance, for best performance
+  that=array;that.__proto__=Buffer.prototype;}else{// Fallback: Return an object instance of the Buffer class
+  that=fromArrayLike(that,array);}return that;}function fromObject(that,obj){if(internalIsBuffer(obj)){var len=checked(obj.length)|0;that=createBuffer(that,len);if(that.length===0){return that;}obj.copy(that,0,0,len);return that;}if(obj){if(typeof ArrayBuffer!=='undefined'&&obj.buffer instanceof ArrayBuffer||'length'in obj){if(typeof obj.length!=='number'||isnan(obj.length)){return createBuffer(that,0);}return fromArrayLike(that,obj);}if(obj.type==='Buffer'&&isArray(obj.data)){return fromArrayLike(that,obj.data);}}throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.');}function checked(length){// Note: cannot use `length < kMaxLength()` here because that fails when
+  // length is NaN (which is otherwise coerced to zero.)
+  if(length>=kMaxLength()){throw new RangeError('Attempt to allocate Buffer larger than maximum '+'size: 0x'+kMaxLength().toString(16)+' bytes');}return length|0;}Buffer.isBuffer=isBuffer;function internalIsBuffer(b){return !!(b!=null&&b._isBuffer);}Buffer.compare=function compare(a,b){if(!internalIsBuffer(a)||!internalIsBuffer(b)){throw new TypeError('Arguments must be Buffers');}if(a===b)return 0;var x=a.length;var y=b.length;for(var i=0,len=Math.min(x,y);i<len;++i){if(a[i]!==b[i]){x=a[i];y=b[i];break;}}if(x<y)return -1;if(y<x)return 1;return 0;};Buffer.isEncoding=function isEncoding(encoding){switch(String(encoding).toLowerCase()){case'hex':case'utf8':case'utf-8':case'ascii':case'latin1':case'binary':case'base64':case'ucs2':case'ucs-2':case'utf16le':case'utf-16le':return true;default:return false;}};Buffer.concat=function concat(list,length){if(!isArray(list)){throw new TypeError('"list" argument must be an Array of Buffers');}if(list.length===0){return Buffer.alloc(0);}var i;if(length===undefined){length=0;for(i=0;i<list.length;++i){length+=list[i].length;}}var buffer=Buffer.allocUnsafe(length);var pos=0;for(i=0;i<list.length;++i){var buf=list[i];if(!internalIsBuffer(buf)){throw new TypeError('"list" argument must be an Array of Buffers');}buf.copy(buffer,pos);pos+=buf.length;}return buffer;};function byteLength(string,encoding){if(internalIsBuffer(string)){return string.length;}if(typeof ArrayBuffer!=='undefined'&&typeof ArrayBuffer.isView==='function'&&(ArrayBuffer.isView(string)||string instanceof ArrayBuffer)){return string.byteLength;}if(typeof string!=='string'){string=''+string;}var len=string.length;if(len===0)return 0;// Use a for loop to avoid recursion
+  var loweredCase=false;for(;;){switch(encoding){case'ascii':case'latin1':case'binary':return len;case'utf8':case'utf-8':case undefined:return utf8ToBytes(string).length;case'ucs2':case'ucs-2':case'utf16le':case'utf-16le':return len*2;case'hex':return len>>>1;case'base64':return base64ToBytes(string).length;default:if(loweredCase)return utf8ToBytes(string).length;// assume utf8
+  encoding=(''+encoding).toLowerCase();loweredCase=true;}}}Buffer.byteLength=byteLength;function slowToString(encoding,start,end){var loweredCase=false;// No need to verify that "this.length <= MAX_UINT32" since it's a read-only
+  // property of a typed array.
+  // This behaves neither like String nor Uint8Array in that we set start/end
+  // to their upper/lower bounds if the value passed is out of range.
+  // undefined is handled specially as per ECMA-262 6th Edition,
+  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
+  if(start===undefined||start<0){start=0;}// Return early if start > this.length. Done here to prevent potential uint32
+  // coercion fail below.
+  if(start>this.length){return '';}if(end===undefined||end>this.length){end=this.length;}if(end<=0){return '';}// Force coersion to uint32. This will also coerce falsey/NaN values to 0.
+  end>>>=0;start>>>=0;if(end<=start){return '';}if(!encoding)encoding='utf8';while(true){switch(encoding){case'hex':return hexSlice(this,start,end);case'utf8':case'utf-8':return utf8Slice(this,start,end);case'ascii':return asciiSlice(this,start,end);case'latin1':case'binary':return latin1Slice(this,start,end);case'base64':return base64Slice(this,start,end);case'ucs2':case'ucs-2':case'utf16le':case'utf-16le':return utf16leSlice(this,start,end);default:if(loweredCase)throw new TypeError('Unknown encoding: '+encoding);encoding=(encoding+'').toLowerCase();loweredCase=true;}}}// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect
+  // Buffer instances.
+  Buffer.prototype._isBuffer=true;function swap(b,n,m){var i=b[n];b[n]=b[m];b[m]=i;}Buffer.prototype.swap16=function swap16(){var len=this.length;if(len%2!==0){throw new RangeError('Buffer size must be a multiple of 16-bits');}for(var i=0;i<len;i+=2){swap(this,i,i+1);}return this;};Buffer.prototype.swap32=function swap32(){var len=this.length;if(len%4!==0){throw new RangeError('Buffer size must be a multiple of 32-bits');}for(var i=0;i<len;i+=4){swap(this,i,i+3);swap(this,i+1,i+2);}return this;};Buffer.prototype.swap64=function swap64(){var len=this.length;if(len%8!==0){throw new RangeError('Buffer size must be a multiple of 64-bits');}for(var i=0;i<len;i+=8){swap(this,i,i+7);swap(this,i+1,i+6);swap(this,i+2,i+5);swap(this,i+3,i+4);}return this;};Buffer.prototype.toString=function toString(){var length=this.length|0;if(length===0)return '';if(arguments.length===0)return utf8Slice(this,0,length);return slowToString.apply(this,arguments);};Buffer.prototype.equals=function equals(b){if(!internalIsBuffer(b))throw new TypeError('Argument must be a Buffer');if(this===b)return true;return Buffer.compare(this,b)===0;};Buffer.prototype.inspect=function inspect(){var str='';var max=INSPECT_MAX_BYTES;if(this.length>0){str=this.toString('hex',0,max).match(/.{2}/g).join(' ');if(this.length>max)str+=' ... ';}return '<Buffer '+str+'>';};Buffer.prototype.compare=function compare(target,start,end,thisStart,thisEnd){if(!internalIsBuffer(target)){throw new TypeError('Argument must be a Buffer');}if(start===undefined){start=0;}if(end===undefined){end=target?target.length:0;}if(thisStart===undefined){thisStart=0;}if(thisEnd===undefined){thisEnd=this.length;}if(start<0||end>target.length||thisStart<0||thisEnd>this.length){throw new RangeError('out of range index');}if(thisStart>=thisEnd&&start>=end){return 0;}if(thisStart>=thisEnd){return -1;}if(start>=end){return 1;}start>>>=0;end>>>=0;thisStart>>>=0;thisEnd>>>=0;if(this===target)return 0;var x=thisEnd-thisStart;var y=end-start;var len=Math.min(x,y);var thisCopy=this.slice(thisStart,thisEnd);var targetCopy=target.slice(start,end);for(var i=0;i<len;++i){if(thisCopy[i]!==targetCopy[i]){x=thisCopy[i];y=targetCopy[i];break;}}if(x<y)return -1;if(y<x)return 1;return 0;};// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
+  // OR the last index of `val` in `buffer` at offset <= `byteOffset`.
+  //
+  // Arguments:
+  // - buffer - a Buffer to search
+  // - val - a string, Buffer, or number
+  // - byteOffset - an index into `buffer`; will be clamped to an int32
+  // - encoding - an optional encoding, relevant is val is a string
+  // - dir - true for indexOf, false for lastIndexOf
+  function bidirectionalIndexOf(buffer,val,byteOffset,encoding,dir){// Empty buffer means no match
+  if(buffer.length===0)return -1;// Normalize byteOffset
+  if(typeof byteOffset==='string'){encoding=byteOffset;byteOffset=0;}else if(byteOffset>0x7fffffff){byteOffset=0x7fffffff;}else if(byteOffset<-0x80000000){byteOffset=-0x80000000;}byteOffset=+byteOffset;// Coerce to Number.
+  if(isNaN(byteOffset)){// byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
+  byteOffset=dir?0:buffer.length-1;}// Normalize byteOffset: negative offsets start from the end of the buffer
+  if(byteOffset<0)byteOffset=buffer.length+byteOffset;if(byteOffset>=buffer.length){if(dir)return -1;else byteOffset=buffer.length-1;}else if(byteOffset<0){if(dir)byteOffset=0;else return -1;}// Normalize val
+  if(typeof val==='string'){val=Buffer.from(val,encoding);}// Finally, search either indexOf (if dir is true) or lastIndexOf
+  if(internalIsBuffer(val)){// Special case: looking for empty string/buffer always fails
+  if(val.length===0){return -1;}return arrayIndexOf(buffer,val,byteOffset,encoding,dir);}else if(typeof val==='number'){val=val&0xFF;// Search for a byte value [0-255]
+  if(Buffer.TYPED_ARRAY_SUPPORT&&typeof Uint8Array.prototype.indexOf==='function'){if(dir){return Uint8Array.prototype.indexOf.call(buffer,val,byteOffset);}else{return Uint8Array.prototype.lastIndexOf.call(buffer,val,byteOffset);}}return arrayIndexOf(buffer,[val],byteOffset,encoding,dir);}throw new TypeError('val must be string, number or Buffer');}function arrayIndexOf(arr,val,byteOffset,encoding,dir){var indexSize=1;var arrLength=arr.length;var valLength=val.length;if(encoding!==undefined){encoding=String(encoding).toLowerCase();if(encoding==='ucs2'||encoding==='ucs-2'||encoding==='utf16le'||encoding==='utf-16le'){if(arr.length<2||val.length<2){return -1;}indexSize=2;arrLength/=2;valLength/=2;byteOffset/=2;}}function read(buf,i){if(indexSize===1){return buf[i];}else{return buf.readUInt16BE(i*indexSize);}}var i;if(dir){var foundIndex=-1;for(i=byteOffset;i<arrLength;i++){if(read(arr,i)===read(val,foundIndex===-1?0:i-foundIndex)){if(foundIndex===-1)foundIndex=i;if(i-foundIndex+1===valLength)return foundIndex*indexSize;}else{if(foundIndex!==-1)i-=i-foundIndex;foundIndex=-1;}}}else{if(byteOffset+valLength>arrLength)byteOffset=arrLength-valLength;for(i=byteOffset;i>=0;i--){var found=true;for(var j=0;j<valLength;j++){if(read(arr,i+j)!==read(val,j)){found=false;break;}}if(found)return i;}}return -1;}Buffer.prototype.includes=function includes(val,byteOffset,encoding){return this.indexOf(val,byteOffset,encoding)!==-1;};Buffer.prototype.indexOf=function indexOf(val,byteOffset,encoding){return bidirectionalIndexOf(this,val,byteOffset,encoding,true);};Buffer.prototype.lastIndexOf=function lastIndexOf(val,byteOffset,encoding){return bidirectionalIndexOf(this,val,byteOffset,encoding,false);};function hexWrite(buf,string,offset,length){offset=Number(offset)||0;var remaining=buf.length-offset;if(!length){length=remaining;}else{length=Number(length);if(length>remaining){length=remaining;}}// must be an even number of digits
+  var strLen=string.length;if(strLen%2!==0)throw new TypeError('Invalid hex string');if(length>strLen/2){length=strLen/2;}for(var i=0;i<length;++i){var parsed=parseInt(string.substr(i*2,2),16);if(isNaN(parsed))return i;buf[offset+i]=parsed;}return i;}function utf8Write(buf,string,offset,length){return blitBuffer(utf8ToBytes(string,buf.length-offset),buf,offset,length);}function asciiWrite(buf,string,offset,length){return blitBuffer(asciiToBytes(string),buf,offset,length);}function latin1Write(buf,string,offset,length){return asciiWrite(buf,string,offset,length);}function base64Write(buf,string,offset,length){return blitBuffer(base64ToBytes(string),buf,offset,length);}function ucs2Write(buf,string,offset,length){return blitBuffer(utf16leToBytes(string,buf.length-offset),buf,offset,length);}Buffer.prototype.write=function write(string,offset,length,encoding){// Buffer#write(string)
+  if(offset===undefined){encoding='utf8';length=this.length;offset=0;// Buffer#write(string, encoding)
+  }else if(length===undefined&&typeof offset==='string'){encoding=offset;length=this.length;offset=0;// Buffer#write(string, offset[, length][, encoding])
+  }else if(isFinite(offset)){offset=offset|0;if(isFinite(length)){length=length|0;if(encoding===undefined)encoding='utf8';}else{encoding=length;length=undefined;}// legacy write(string, encoding, offset, length) - remove in v0.13
+  }else{throw new Error('Buffer.write(string, encoding, offset[, length]) is no longer supported');}var remaining=this.length-offset;if(length===undefined||length>remaining)length=remaining;if(string.length>0&&(length<0||offset<0)||offset>this.length){throw new RangeError('Attempt to write outside buffer bounds');}if(!encoding)encoding='utf8';var loweredCase=false;for(;;){switch(encoding){case'hex':return hexWrite(this,string,offset,length);case'utf8':case'utf-8':return utf8Write(this,string,offset,length);case'ascii':return asciiWrite(this,string,offset,length);case'latin1':case'binary':return latin1Write(this,string,offset,length);case'base64':// Warning: maxLength not taken into account in base64Write
+  return base64Write(this,string,offset,length);case'ucs2':case'ucs-2':case'utf16le':case'utf-16le':return ucs2Write(this,string,offset,length);default:if(loweredCase)throw new TypeError('Unknown encoding: '+encoding);encoding=(''+encoding).toLowerCase();loweredCase=true;}}};Buffer.prototype.toJSON=function toJSON(){return {type:'Buffer',data:Array.prototype.slice.call(this._arr||this,0)};};function base64Slice(buf,start,end){if(start===0&&end===buf.length){return fromByteArray(buf);}else{return fromByteArray(buf.slice(start,end));}}function utf8Slice(buf,start,end){end=Math.min(buf.length,end);var res=[];var i=start;while(i<end){var firstByte=buf[i];var codePoint=null;var bytesPerSequence=firstByte>0xEF?4:firstByte>0xDF?3:firstByte>0xBF?2:1;if(i+bytesPerSequence<=end){var secondByte,thirdByte,fourthByte,tempCodePoint;switch(bytesPerSequence){case 1:if(firstByte<0x80){codePoint=firstByte;}break;case 2:secondByte=buf[i+1];if((secondByte&0xC0)===0x80){tempCodePoint=(firstByte&0x1F)<<0x6|secondByte&0x3F;if(tempCodePoint>0x7F){codePoint=tempCodePoint;}}break;case 3:secondByte=buf[i+1];thirdByte=buf[i+2];if((secondByte&0xC0)===0x80&&(thirdByte&0xC0)===0x80){tempCodePoint=(firstByte&0xF)<<0xC|(secondByte&0x3F)<<0x6|thirdByte&0x3F;if(tempCodePoint>0x7FF&&(tempCodePoint<0xD800||tempCodePoint>0xDFFF)){codePoint=tempCodePoint;}}break;case 4:secondByte=buf[i+1];thirdByte=buf[i+2];fourthByte=buf[i+3];if((secondByte&0xC0)===0x80&&(thirdByte&0xC0)===0x80&&(fourthByte&0xC0)===0x80){tempCodePoint=(firstByte&0xF)<<0x12|(secondByte&0x3F)<<0xC|(thirdByte&0x3F)<<0x6|fourthByte&0x3F;if(tempCodePoint>0xFFFF&&tempCodePoint<0x110000){codePoint=tempCodePoint;}}}}if(codePoint===null){// we did not generate a valid codePoint so insert a
+  // replacement char (U+FFFD) and advance only 1 byte
+  codePoint=0xFFFD;bytesPerSequence=1;}else if(codePoint>0xFFFF){// encode to utf16 (surrogate pair dance)
+  codePoint-=0x10000;res.push(codePoint>>>10&0x3FF|0xD800);codePoint=0xDC00|codePoint&0x3FF;}res.push(codePoint);i+=bytesPerSequence;}return decodeCodePointsArray(res);}// Based on http://stackoverflow.com/a/22747272/680742, the browser with
+  // the lowest limit is Chrome, with 0x10000 args.
+  // We go 1 magnitude less, for safety
+  var MAX_ARGUMENTS_LENGTH=0x1000;function decodeCodePointsArray(codePoints){var len=codePoints.length;if(len<=MAX_ARGUMENTS_LENGTH){return String.fromCharCode.apply(String,codePoints);// avoid extra slice()
+  }// Decode in chunks to avoid "call stack size exceeded".
+  var res='';var i=0;while(i<len){res+=String.fromCharCode.apply(String,codePoints.slice(i,i+=MAX_ARGUMENTS_LENGTH));}return res;}function asciiSlice(buf,start,end){var ret='';end=Math.min(buf.length,end);for(var i=start;i<end;++i){ret+=String.fromCharCode(buf[i]&0x7F);}return ret;}function latin1Slice(buf,start,end){var ret='';end=Math.min(buf.length,end);for(var i=start;i<end;++i){ret+=String.fromCharCode(buf[i]);}return ret;}function hexSlice(buf,start,end){var len=buf.length;if(!start||start<0)start=0;if(!end||end<0||end>len)end=len;var out='';for(var i=start;i<end;++i){out+=toHex(buf[i]);}return out;}function utf16leSlice(buf,start,end){var bytes=buf.slice(start,end);var res='';for(var i=0;i<bytes.length;i+=2){res+=String.fromCharCode(bytes[i]+bytes[i+1]*256);}return res;}Buffer.prototype.slice=function slice(start,end){var len=this.length;start=~~start;end=end===undefined?len:~~end;if(start<0){start+=len;if(start<0)start=0;}else if(start>len){start=len;}if(end<0){end+=len;if(end<0)end=0;}else if(end>len){end=len;}if(end<start)end=start;var newBuf;if(Buffer.TYPED_ARRAY_SUPPORT){newBuf=this.subarray(start,end);newBuf.__proto__=Buffer.prototype;}else{var sliceLen=end-start;newBuf=new Buffer(sliceLen,undefined);for(var i=0;i<sliceLen;++i){newBuf[i]=this[i+start];}}return newBuf;};/*
+  	 * Need to make sure that buffer isn't trying to write out of bounds.
+  	 */function checkOffset(offset,ext,length){if(offset%1!==0||offset<0)throw new RangeError('offset is not uint');if(offset+ext>length)throw new RangeError('Trying to access beyond buffer length');}Buffer.prototype.readUIntLE=function readUIntLE(offset,byteLength,noAssert){offset=offset|0;byteLength=byteLength|0;if(!noAssert)checkOffset(offset,byteLength,this.length);var val=this[offset];var mul=1;var i=0;while(++i<byteLength&&(mul*=0x100)){val+=this[offset+i]*mul;}return val;};Buffer.prototype.readUIntBE=function readUIntBE(offset,byteLength,noAssert){offset=offset|0;byteLength=byteLength|0;if(!noAssert){checkOffset(offset,byteLength,this.length);}var val=this[offset+--byteLength];var mul=1;while(byteLength>0&&(mul*=0x100)){val+=this[offset+--byteLength]*mul;}return val;};Buffer.prototype.readUInt8=function readUInt8(offset,noAssert){if(!noAssert)checkOffset(offset,1,this.length);return this[offset];};Buffer.prototype.readUInt16LE=function readUInt16LE(offset,noAssert){if(!noAssert)checkOffset(offset,2,this.length);return this[offset]|this[offset+1]<<8;};Buffer.prototype.readUInt16BE=function readUInt16BE(offset,noAssert){if(!noAssert)checkOffset(offset,2,this.length);return this[offset]<<8|this[offset+1];};Buffer.prototype.readUInt32LE=function readUInt32LE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return (this[offset]|this[offset+1]<<8|this[offset+2]<<16)+this[offset+3]*0x1000000;};Buffer.prototype.readUInt32BE=function readUInt32BE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return this[offset]*0x1000000+(this[offset+1]<<16|this[offset+2]<<8|this[offset+3]);};Buffer.prototype.readIntLE=function readIntLE(offset,byteLength,noAssert){offset=offset|0;byteLength=byteLength|0;if(!noAssert)checkOffset(offset,byteLength,this.length);var val=this[offset];var mul=1;var i=0;while(++i<byteLength&&(mul*=0x100)){val+=this[offset+i]*mul;}mul*=0x80;if(val>=mul)val-=Math.pow(2,8*byteLength);return val;};Buffer.prototype.readIntBE=function readIntBE(offset,byteLength,noAssert){offset=offset|0;byteLength=byteLength|0;if(!noAssert)checkOffset(offset,byteLength,this.length);var i=byteLength;var mul=1;var val=this[offset+--i];while(i>0&&(mul*=0x100)){val+=this[offset+--i]*mul;}mul*=0x80;if(val>=mul)val-=Math.pow(2,8*byteLength);return val;};Buffer.prototype.readInt8=function readInt8(offset,noAssert){if(!noAssert)checkOffset(offset,1,this.length);if(!(this[offset]&0x80))return this[offset];return (0xff-this[offset]+1)*-1;};Buffer.prototype.readInt16LE=function readInt16LE(offset,noAssert){if(!noAssert)checkOffset(offset,2,this.length);var val=this[offset]|this[offset+1]<<8;return val&0x8000?val|0xFFFF0000:val;};Buffer.prototype.readInt16BE=function readInt16BE(offset,noAssert){if(!noAssert)checkOffset(offset,2,this.length);var val=this[offset+1]|this[offset]<<8;return val&0x8000?val|0xFFFF0000:val;};Buffer.prototype.readInt32LE=function readInt32LE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return this[offset]|this[offset+1]<<8|this[offset+2]<<16|this[offset+3]<<24;};Buffer.prototype.readInt32BE=function readInt32BE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return this[offset]<<24|this[offset+1]<<16|this[offset+2]<<8|this[offset+3];};Buffer.prototype.readFloatLE=function readFloatLE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return read(this,offset,true,23,4);};Buffer.prototype.readFloatBE=function readFloatBE(offset,noAssert){if(!noAssert)checkOffset(offset,4,this.length);return read(this,offset,false,23,4);};Buffer.prototype.readDoubleLE=function readDoubleLE(offset,noAssert){if(!noAssert)checkOffset(offset,8,this.length);return read(this,offset,true,52,8);};Buffer.prototype.readDoubleBE=function readDoubleBE(offset,noAssert){if(!noAssert)checkOffset(offset,8,this.length);return read(this,offset,false,52,8);};function checkInt(buf,value,offset,ext,max,min){if(!internalIsBuffer(buf))throw new TypeError('"buffer" argument must be a Buffer instance');if(value>max||value<min)throw new RangeError('"value" argument is out of bounds');if(offset+ext>buf.length)throw new RangeError('Index out of range');}Buffer.prototype.writeUIntLE=function writeUIntLE(value,offset,byteLength,noAssert){value=+value;offset=offset|0;byteLength=byteLength|0;if(!noAssert){var maxBytes=Math.pow(2,8*byteLength)-1;checkInt(this,value,offset,byteLength,maxBytes,0);}var mul=1;var i=0;this[offset]=value&0xFF;while(++i<byteLength&&(mul*=0x100)){this[offset+i]=value/mul&0xFF;}return offset+byteLength;};Buffer.prototype.writeUIntBE=function writeUIntBE(value,offset,byteLength,noAssert){value=+value;offset=offset|0;byteLength=byteLength|0;if(!noAssert){var maxBytes=Math.pow(2,8*byteLength)-1;checkInt(this,value,offset,byteLength,maxBytes,0);}var i=byteLength-1;var mul=1;this[offset+i]=value&0xFF;while(--i>=0&&(mul*=0x100)){this[offset+i]=value/mul&0xFF;}return offset+byteLength;};Buffer.prototype.writeUInt8=function writeUInt8(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,1,0xff,0);if(!Buffer.TYPED_ARRAY_SUPPORT)value=Math.floor(value);this[offset]=value&0xff;return offset+1;};function objectWriteUInt16(buf,value,offset,littleEndian){if(value<0)value=0xffff+value+1;for(var i=0,j=Math.min(buf.length-offset,2);i<j;++i){buf[offset+i]=(value&0xff<<8*(littleEndian?i:1-i))>>>(littleEndian?i:1-i)*8;}}Buffer.prototype.writeUInt16LE=function writeUInt16LE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,2,0xffff,0);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value&0xff;this[offset+1]=value>>>8;}else{objectWriteUInt16(this,value,offset,true);}return offset+2;};Buffer.prototype.writeUInt16BE=function writeUInt16BE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,2,0xffff,0);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value>>>8;this[offset+1]=value&0xff;}else{objectWriteUInt16(this,value,offset,false);}return offset+2;};function objectWriteUInt32(buf,value,offset,littleEndian){if(value<0)value=0xffffffff+value+1;for(var i=0,j=Math.min(buf.length-offset,4);i<j;++i){buf[offset+i]=value>>>(littleEndian?i:3-i)*8&0xff;}}Buffer.prototype.writeUInt32LE=function writeUInt32LE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,4,0xffffffff,0);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset+3]=value>>>24;this[offset+2]=value>>>16;this[offset+1]=value>>>8;this[offset]=value&0xff;}else{objectWriteUInt32(this,value,offset,true);}return offset+4;};Buffer.prototype.writeUInt32BE=function writeUInt32BE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,4,0xffffffff,0);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value>>>24;this[offset+1]=value>>>16;this[offset+2]=value>>>8;this[offset+3]=value&0xff;}else{objectWriteUInt32(this,value,offset,false);}return offset+4;};Buffer.prototype.writeIntLE=function writeIntLE(value,offset,byteLength,noAssert){value=+value;offset=offset|0;if(!noAssert){var limit=Math.pow(2,8*byteLength-1);checkInt(this,value,offset,byteLength,limit-1,-limit);}var i=0;var mul=1;var sub=0;this[offset]=value&0xFF;while(++i<byteLength&&(mul*=0x100)){if(value<0&&sub===0&&this[offset+i-1]!==0){sub=1;}this[offset+i]=(value/mul>>0)-sub&0xFF;}return offset+byteLength;};Buffer.prototype.writeIntBE=function writeIntBE(value,offset,byteLength,noAssert){value=+value;offset=offset|0;if(!noAssert){var limit=Math.pow(2,8*byteLength-1);checkInt(this,value,offset,byteLength,limit-1,-limit);}var i=byteLength-1;var mul=1;var sub=0;this[offset+i]=value&0xFF;while(--i>=0&&(mul*=0x100)){if(value<0&&sub===0&&this[offset+i+1]!==0){sub=1;}this[offset+i]=(value/mul>>0)-sub&0xFF;}return offset+byteLength;};Buffer.prototype.writeInt8=function writeInt8(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,1,0x7f,-0x80);if(!Buffer.TYPED_ARRAY_SUPPORT)value=Math.floor(value);if(value<0)value=0xff+value+1;this[offset]=value&0xff;return offset+1;};Buffer.prototype.writeInt16LE=function writeInt16LE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,2,0x7fff,-0x8000);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value&0xff;this[offset+1]=value>>>8;}else{objectWriteUInt16(this,value,offset,true);}return offset+2;};Buffer.prototype.writeInt16BE=function writeInt16BE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,2,0x7fff,-0x8000);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value>>>8;this[offset+1]=value&0xff;}else{objectWriteUInt16(this,value,offset,false);}return offset+2;};Buffer.prototype.writeInt32LE=function writeInt32LE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,4,0x7fffffff,-0x80000000);if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value&0xff;this[offset+1]=value>>>8;this[offset+2]=value>>>16;this[offset+3]=value>>>24;}else{objectWriteUInt32(this,value,offset,true);}return offset+4;};Buffer.prototype.writeInt32BE=function writeInt32BE(value,offset,noAssert){value=+value;offset=offset|0;if(!noAssert)checkInt(this,value,offset,4,0x7fffffff,-0x80000000);if(value<0)value=0xffffffff+value+1;if(Buffer.TYPED_ARRAY_SUPPORT){this[offset]=value>>>24;this[offset+1]=value>>>16;this[offset+2]=value>>>8;this[offset+3]=value&0xff;}else{objectWriteUInt32(this,value,offset,false);}return offset+4;};function checkIEEE754(buf,value,offset,ext,max,min){if(offset+ext>buf.length)throw new RangeError('Index out of range');if(offset<0)throw new RangeError('Index out of range');}function writeFloat(buf,value,offset,littleEndian,noAssert){if(!noAssert){checkIEEE754(buf,value,offset,4);}write(buf,value,offset,littleEndian,23,4);return offset+4;}Buffer.prototype.writeFloatLE=function writeFloatLE(value,offset,noAssert){return writeFloat(this,value,offset,true,noAssert);};Buffer.prototype.writeFloatBE=function writeFloatBE(value,offset,noAssert){return writeFloat(this,value,offset,false,noAssert);};function writeDouble(buf,value,offset,littleEndian,noAssert){if(!noAssert){checkIEEE754(buf,value,offset,8);}write(buf,value,offset,littleEndian,52,8);return offset+8;}Buffer.prototype.writeDoubleLE=function writeDoubleLE(value,offset,noAssert){return writeDouble(this,value,offset,true,noAssert);};Buffer.prototype.writeDoubleBE=function writeDoubleBE(value,offset,noAssert){return writeDouble(this,value,offset,false,noAssert);};// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
+  Buffer.prototype.copy=function copy(target,targetStart,start,end){if(!start)start=0;if(!end&&end!==0)end=this.length;if(targetStart>=target.length)targetStart=target.length;if(!targetStart)targetStart=0;if(end>0&&end<start)end=start;// Copy 0 bytes; we're done
+  if(end===start)return 0;if(target.length===0||this.length===0)return 0;// Fatal error conditions
+  if(targetStart<0){throw new RangeError('targetStart out of bounds');}if(start<0||start>=this.length)throw new RangeError('sourceStart out of bounds');if(end<0)throw new RangeError('sourceEnd out of bounds');// Are we oob?
+  if(end>this.length)end=this.length;if(target.length-targetStart<end-start){end=target.length-targetStart+start;}var len=end-start;var i;if(this===target&&start<targetStart&&targetStart<end){// descending copy from end
+  for(i=len-1;i>=0;--i){target[i+targetStart]=this[i+start];}}else if(len<1000||!Buffer.TYPED_ARRAY_SUPPORT){// ascending copy from start
+  for(i=0;i<len;++i){target[i+targetStart]=this[i+start];}}else{Uint8Array.prototype.set.call(target,this.subarray(start,start+len),targetStart);}return len;};// Usage:
+  //    buffer.fill(number[, offset[, end]])
+  //    buffer.fill(buffer[, offset[, end]])
+  //    buffer.fill(string[, offset[, end]][, encoding])
+  Buffer.prototype.fill=function fill(val,start,end,encoding){// Handle string cases:
+  if(typeof val==='string'){if(typeof start==='string'){encoding=start;start=0;end=this.length;}else if(typeof end==='string'){encoding=end;end=this.length;}if(val.length===1){var code=val.charCodeAt(0);if(code<256){val=code;}}if(encoding!==undefined&&typeof encoding!=='string'){throw new TypeError('encoding must be a string');}if(typeof encoding==='string'&&!Buffer.isEncoding(encoding)){throw new TypeError('Unknown encoding: '+encoding);}}else if(typeof val==='number'){val=val&255;}// Invalid ranges are not set to a default, so can range check early.
+  if(start<0||this.length<start||this.length<end){throw new RangeError('Out of range index');}if(end<=start){return this;}start=start>>>0;end=end===undefined?this.length:end>>>0;if(!val)val=0;var i;if(typeof val==='number'){for(i=start;i<end;++i){this[i]=val;}}else{var bytes=internalIsBuffer(val)?val:utf8ToBytes(new Buffer(val,encoding).toString());var len=bytes.length;for(i=0;i<end-start;++i){this[i+start]=bytes[i%len];}}return this;};// HELPER FUNCTIONS
+  // ================
+  var INVALID_BASE64_RE=/[^+\/0-9A-Za-z-_]/g;function base64clean(str){// Node strips out invalid characters like \n and \t from the string, base64-js does not
+  str=stringtrim(str).replace(INVALID_BASE64_RE,'');// Node converts strings with length < 2 to ''
+  if(str.length<2)return '';// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
+  while(str.length%4!==0){str=str+'=';}return str;}function stringtrim(str){if(str.trim)return str.trim();return str.replace(/^\s+|\s+$/g,'');}function toHex(n){if(n<16)return '0'+n.toString(16);return n.toString(16);}function utf8ToBytes(string,units){units=units||Infinity;var codePoint;var length=string.length;var leadSurrogate=null;var bytes=[];for(var i=0;i<length;++i){codePoint=string.charCodeAt(i);// is surrogate component
+  if(codePoint>0xD7FF&&codePoint<0xE000){// last char was a lead
+  if(!leadSurrogate){// no lead yet
+  if(codePoint>0xDBFF){// unexpected trail
+  if((units-=3)>-1)bytes.push(0xEF,0xBF,0xBD);continue;}else if(i+1===length){// unpaired lead
+  if((units-=3)>-1)bytes.push(0xEF,0xBF,0xBD);continue;}// valid lead
+  leadSurrogate=codePoint;continue;}// 2 leads in a row
+  if(codePoint<0xDC00){if((units-=3)>-1)bytes.push(0xEF,0xBF,0xBD);leadSurrogate=codePoint;continue;}// valid surrogate pair
+  codePoint=(leadSurrogate-0xD800<<10|codePoint-0xDC00)+0x10000;}else if(leadSurrogate){// valid bmp char, but last char was a lead
+  if((units-=3)>-1)bytes.push(0xEF,0xBF,0xBD);}leadSurrogate=null;// encode utf8
+  if(codePoint<0x80){if((units-=1)<0)break;bytes.push(codePoint);}else if(codePoint<0x800){if((units-=2)<0)break;bytes.push(codePoint>>0x6|0xC0,codePoint&0x3F|0x80);}else if(codePoint<0x10000){if((units-=3)<0)break;bytes.push(codePoint>>0xC|0xE0,codePoint>>0x6&0x3F|0x80,codePoint&0x3F|0x80);}else if(codePoint<0x110000){if((units-=4)<0)break;bytes.push(codePoint>>0x12|0xF0,codePoint>>0xC&0x3F|0x80,codePoint>>0x6&0x3F|0x80,codePoint&0x3F|0x80);}else{throw new Error('Invalid code point');}}return bytes;}function asciiToBytes(str){var byteArray=[];for(var i=0;i<str.length;++i){// Node's code seems to be doing this and not & 0x7F..
+  byteArray.push(str.charCodeAt(i)&0xFF);}return byteArray;}function utf16leToBytes(str,units){var c,hi,lo;var byteArray=[];for(var i=0;i<str.length;++i){if((units-=2)<0)break;c=str.charCodeAt(i);hi=c>>8;lo=c%256;byteArray.push(lo);byteArray.push(hi);}return byteArray;}function base64ToBytes(str){return toByteArray(base64clean(str));}function blitBuffer(src,dst,offset,length){for(var i=0;i<length;++i){if(i+offset>=dst.length||i>=src.length)break;dst[i+offset]=src[i];}return i;}function isnan(val){return val!==val;// eslint-disable-line no-self-compare
+  }// the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence
+  // The _isBuffer check is for Safari 5-7 support, because it's missing
+  // Object.prototype.constructor. Remove this eventually
+  function isBuffer(obj){return obj!=null&&(!!obj._isBuffer||isFastBuffer(obj)||isSlowBuffer(obj));}function isFastBuffer(obj){return !!obj.constructor&&typeof obj.constructor.isBuffer==='function'&&obj.constructor.isBuffer(obj);}// For Node v0.10 support. Remove this eventually.
+  function isSlowBuffer(obj){return typeof obj.readFloatLE==='function'&&typeof obj.slice==='function'&&isFastBuffer(obj.slice(0,0));}// shim for using process in browser
+  if(typeof commonjsGlobal.setTimeout==='function');if(typeof commonjsGlobal.clearTimeout==='function');// from https://github.com/kumavis/browser-process-hrtime/blob/master/index.js
+  var performance=commonjsGlobal.performance||{};var performanceNow=performance.now||performance.mozNow||performance.msNow||performance.oNow||performance.webkitNow||function(){return new Date().getTime();};var inherits;if(typeof Object.create==='function'){inherits=function inherits(ctor,superCtor){// implementation from standard node.js 'util' module
+  ctor.super_=superCtor;ctor.prototype=Object.create(superCtor.prototype,{constructor:{value:ctor,enumerable:false,writable:true,configurable:true}});};}else{inherits=function inherits(ctor,superCtor){ctor.super_=superCtor;var TempCtor=function TempCtor(){};TempCtor.prototype=superCtor.prototype;ctor.prototype=new TempCtor();ctor.prototype.constructor=ctor;};}var inherits$1=inherits;// Copyright Joyent, Inc. and other Node contributors.
+  /**
+  	 * Echos the value of a value. Trys to print the value out
+  	 * in the best way possible given the different types.
+  	 *
+  	 * @param {Object} obj The object to print out.
+  	 * @param {Object} opts Optional options object that alters the output.
+  	 */ /* legacy: obj, showHidden, depth, colors*/function inspect(obj,opts){// default options
+  var ctx={seen:[],stylize:stylizeNoColor};// legacy...
+  if(arguments.length>=3)ctx.depth=arguments[2];if(arguments.length>=4)ctx.colors=arguments[3];if(isBoolean(opts)){// legacy...
+  ctx.showHidden=opts;}else if(opts){// got an "options" object
+  _extend(ctx,opts);}// set default options
+  if(isUndefined(ctx.showHidden))ctx.showHidden=false;if(isUndefined(ctx.depth))ctx.depth=2;if(isUndefined(ctx.colors))ctx.colors=false;if(isUndefined(ctx.customInspect))ctx.customInspect=true;if(ctx.colors)ctx.stylize=stylizeWithColor;return formatValue(ctx,obj,ctx.depth);}// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
+  inspect.colors={'bold':[1,22],'italic':[3,23],'underline':[4,24],'inverse':[7,27],'white':[37,39],'grey':[90,39],'black':[30,39],'blue':[34,39],'cyan':[36,39],'green':[32,39],'magenta':[35,39],'red':[31,39],'yellow':[33,39]};// Don't use 'blue' not visible on cmd.exe
+  inspect.styles={'special':'cyan','number':'yellow','boolean':'yellow','undefined':'grey','null':'bold','string':'green','date':'magenta',// "name": intentionally not styling
+  'regexp':'red'};function stylizeWithColor(str,styleType){var style=inspect.styles[styleType];if(style){return '\u001b['+inspect.colors[style][0]+'m'+str+'\u001b['+inspect.colors[style][1]+'m';}else{return str;}}function stylizeNoColor(str,styleType){return str;}function arrayToHash(array){var hash={};array.forEach(function(val,idx){hash[val]=true;});return hash;}function formatValue(ctx,value,recurseTimes){// Provide a hook for user-specified inspect functions.
+  // Check that value is an object with an inspect function on it
+  if(ctx.customInspect&&value&&isFunction(value.inspect)&&// Filter out the util module, it's inspect function is special
+  value.inspect!==inspect&&// Also filter out any prototype objects using the circular check.
+  !(value.constructor&&value.constructor.prototype===value)){var ret=value.inspect(recurseTimes,ctx);if(!isString(ret)){ret=formatValue(ctx,ret,recurseTimes);}return ret;}// Primitive types cannot have properties
+  var primitive=formatPrimitive(ctx,value);if(primitive){return primitive;}// Look up the keys of the object.
+  var keys=Object.keys(value);var visibleKeys=arrayToHash(keys);if(ctx.showHidden){keys=Object.getOwnPropertyNames(value);}// IE doesn't make error fields non-enumerable
+  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
+  if(isError(value)&&(keys.indexOf('message')>=0||keys.indexOf('description')>=0)){return formatError(value);}// Some type of object without properties can be shortcutted.
+  if(keys.length===0){if(isFunction(value)){var name=value.name?': '+value.name:'';return ctx.stylize('[Function'+name+']','special');}if(isRegExp(value)){return ctx.stylize(RegExp.prototype.toString.call(value),'regexp');}if(isDate(value)){return ctx.stylize(Date.prototype.toString.call(value),'date');}if(isError(value)){return formatError(value);}}var base='',array=false,braces=['{','}'];// Make Array say that they are Array
+  if(isArray$1(value)){array=true;braces=['[',']'];}// Make functions say that they are functions
+  if(isFunction(value)){var n=value.name?': '+value.name:'';base=' [Function'+n+']';}// Make RegExps say that they are RegExps
+  if(isRegExp(value)){base=' '+RegExp.prototype.toString.call(value);}// Make dates with properties first say the date
+  if(isDate(value)){base=' '+Date.prototype.toUTCString.call(value);}// Make error with message first say the error
+  if(isError(value)){base=' '+formatError(value);}if(keys.length===0&&(!array||value.length==0)){return braces[0]+base+braces[1];}if(recurseTimes<0){if(isRegExp(value)){return ctx.stylize(RegExp.prototype.toString.call(value),'regexp');}else{return ctx.stylize('[Object]','special');}}ctx.seen.push(value);var output;if(array){output=formatArray(ctx,value,recurseTimes,visibleKeys,keys);}else{output=keys.map(function(key){return formatProperty(ctx,value,recurseTimes,visibleKeys,key,array);});}ctx.seen.pop();return reduceToSingleString(output,base,braces);}function formatPrimitive(ctx,value){if(isUndefined(value))return ctx.stylize('undefined','undefined');if(isString(value)){var simple='\''+JSON.stringify(value).replace(/^"|"$/g,'').replace(/'/g,"\\'").replace(/\\"/g,'"')+'\'';return ctx.stylize(simple,'string');}if(isNumber(value))return ctx.stylize(''+value,'number');if(isBoolean(value))return ctx.stylize(''+value,'boolean');// For some reason typeof null is "object", so special case here.
+  if(isNull(value))return ctx.stylize('null','null');}function formatError(value){return '['+Error.prototype.toString.call(value)+']';}function formatArray(ctx,value,recurseTimes,visibleKeys,keys){var output=[];for(var i=0,l=value.length;i<l;++i){if(hasOwnProperty(value,String(i))){output.push(formatProperty(ctx,value,recurseTimes,visibleKeys,String(i),true));}else{output.push('');}}keys.forEach(function(key){if(!key.match(/^\d+$/)){output.push(formatProperty(ctx,value,recurseTimes,visibleKeys,key,true));}});return output;}function formatProperty(ctx,value,recurseTimes,visibleKeys,key,array){var name,str,desc;desc=Object.getOwnPropertyDescriptor(value,key)||{value:value[key]};if(desc.get){if(desc.set){str=ctx.stylize('[Getter/Setter]','special');}else{str=ctx.stylize('[Getter]','special');}}else{if(desc.set){str=ctx.stylize('[Setter]','special');}}if(!hasOwnProperty(visibleKeys,key)){name='['+key+']';}if(!str){if(ctx.seen.indexOf(desc.value)<0){if(isNull(recurseTimes)){str=formatValue(ctx,desc.value,null);}else{str=formatValue(ctx,desc.value,recurseTimes-1);}if(str.indexOf('\n')>-1){if(array){str=str.split('\n').map(function(line){return '  '+line;}).join('\n').substr(2);}else{str='\n'+str.split('\n').map(function(line){return '   '+line;}).join('\n');}}}else{str=ctx.stylize('[Circular]','special');}}if(isUndefined(name)){if(array&&key.match(/^\d+$/)){return str;}name=JSON.stringify(''+key);if(name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)){name=name.substr(1,name.length-2);name=ctx.stylize(name,'name');}else{name=name.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'");name=ctx.stylize(name,'string');}}return name+': '+str;}function reduceToSingleString(output,base,braces){var length=output.reduce(function(prev,cur){if(cur.indexOf('\n')>=0);return prev+cur.replace(/\u001b\[\d\d?m/g,'').length+1;},0);if(length>60){return braces[0]+(base===''?'':base+'\n ')+' '+output.join(',\n  ')+' '+braces[1];}return braces[0]+base+' '+output.join(', ')+' '+braces[1];}// NOTE: These type checking functions intentionally don't use `instanceof`
+  // because it is fragile and can be easily faked with `Object.create()`.
+  function isArray$1(ar){return Array.isArray(ar);}function isBoolean(arg){return typeof arg==='boolean';}function isNull(arg){return arg===null;}function isNumber(arg){return typeof arg==='number';}function isString(arg){return typeof arg==='string';}function isUndefined(arg){return arg===void 0;}function isRegExp(re){return isObject(re)&&objectToString(re)==='[object RegExp]';}function isObject(arg){return typeof arg==='object'&&arg!==null;}function isDate(d){return isObject(d)&&objectToString(d)==='[object Date]';}function isError(e){return isObject(e)&&(objectToString(e)==='[object Error]'||e instanceof Error);}function isFunction(arg){return typeof arg==='function';}function isPrimitive(arg){return arg===null||typeof arg==='boolean'||typeof arg==='number'||typeof arg==='string'||typeof arg==='symbol'||// ES6 symbol
+  typeof arg==='undefined';}function objectToString(o){return Object.prototype.toString.call(o);}function _extend(origin,add){// Don't do anything if add isn't an object
+  if(!add||!isObject(add))return origin;var keys=Object.keys(add);var i=keys.length;while(i--){origin[keys[i]]=add[keys[i]];}return origin;}function hasOwnProperty(obj,prop){return Object.prototype.hasOwnProperty.call(obj,prop);}function compare(a,b){if(a===b){return 0;}var x=a.length;var y=b.length;for(var i=0,len=Math.min(x,y);i<len;++i){if(a[i]!==b[i]){x=a[i];y=b[i];break;}}if(x<y){return -1;}if(y<x){return 1;}return 0;}var hasOwn=Object.prototype.hasOwnProperty;var objectKeys=Object.keys||function(obj){var keys=[];for(var key in obj){if(hasOwn.call(obj,key))keys.push(key);}return keys;};var pSlice=Array.prototype.slice;var _functionsHaveNames;function functionsHaveNames(){if(typeof _functionsHaveNames!=='undefined'){return _functionsHaveNames;}return _functionsHaveNames=function(){return function foo(){}.name==='foo';}();}function pToString(obj){return Object.prototype.toString.call(obj);}function isView(arrbuf){if(isBuffer(arrbuf)){return false;}if(typeof commonjsGlobal.ArrayBuffer!=='function'){return false;}if(typeof ArrayBuffer.isView==='function'){return ArrayBuffer.isView(arrbuf);}if(!arrbuf){return false;}if(arrbuf instanceof DataView){return true;}if(arrbuf.buffer&&arrbuf.buffer instanceof ArrayBuffer){return true;}return false;}// 1. The assert module provides functions that throw
+  // AssertionError's when particular conditions are not met. The
+  // assert module must conform to the following interface.
+  function assert(value,message){if(!value)fail(value,true,message,'==',ok);}// 2. The AssertionError is defined in assert.
+  // new assert.AssertionError({ message: message,
+  //                             actual: actual,
+  //                             expected: expected })
+  var regex=/\s*function\s+([^\(\s]*)\s*/;// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js
+  function getName(func){if(!isFunction(func)){return;}if(functionsHaveNames()){return func.name;}var str=func.toString();var match=str.match(regex);return match&&match[1];}assert.AssertionError=AssertionError;function AssertionError(options){this.name='AssertionError';this.actual=options.actual;this.expected=options.expected;this.operator=options.operator;if(options.message){this.message=options.message;this.generatedMessage=false;}else{this.message=getMessage(this);this.generatedMessage=true;}var stackStartFunction=options.stackStartFunction||fail;if(Error.captureStackTrace){Error.captureStackTrace(this,stackStartFunction);}else{// non v8 browsers so we can have a stacktrace
+  var err=new Error();if(err.stack){var out=err.stack;// try to strip useless frames
+  var fn_name=getName(stackStartFunction);var idx=out.indexOf('\n'+fn_name);if(idx>=0){// once we have located the function frame
+  // we need to strip out everything before it (and its line)
+  var next_line=out.indexOf('\n',idx+1);out=out.substring(next_line+1);}this.stack=out;}}}// assert.AssertionError instanceof Error
+  inherits$1(AssertionError,Error);function truncate(s,n){if(typeof s==='string'){return s.length<n?s:s.slice(0,n);}else{return s;}}function inspect$1(something){if(functionsHaveNames()||!isFunction(something)){return inspect(something);}var rawname=getName(something);var name=rawname?': '+rawname:'';return '[Function'+name+']';}function getMessage(self){return truncate(inspect$1(self.actual),128)+' '+self.operator+' '+truncate(inspect$1(self.expected),128);}// At present only the three keys mentioned above are used and
+  // understood by the spec. Implementations or sub modules can pass
+  // other keys to the AssertionError's constructor - they will be
+  // ignored.
+  // 3. All of the following functions must throw an AssertionError
+  // when a corresponding condition is not met, with a message that
+  // may be undefined if not provided.  All assertion methods provide
+  // both the actual and expected values to the assertion error for
+  // display purposes.
+  function fail(actual,expected,message,operator,stackStartFunction){throw new AssertionError({message:message,actual:actual,expected:expected,operator:operator,stackStartFunction:stackStartFunction});}// EXTENSION! allows for well behaved errors defined elsewhere.
+  assert.fail=fail;// 4. Pure assertion tests whether a value is truthy, as determined
+  // by !!guard.
+  // assert.ok(guard, message_opt);
+  // This statement is equivalent to assert.equal(true, !!guard,
+  // message_opt);. To test strictly for the value true, use
+  // assert.strictEqual(true, guard, message_opt);.
+  function ok(value,message){if(!value)fail(value,true,message,'==',ok);}assert.ok=ok;// 5. The equality assertion tests shallow, coercive equality with
+  // ==.
+  // assert.equal(actual, expected, message_opt);
+  assert.equal=equal;function equal(actual,expected,message){if(actual!=expected)fail(actual,expected,message,'==',equal);}// 6. The non-equality assertion tests for whether two objects are not equal
+  // with != assert.notEqual(actual, expected, message_opt);
+  assert.notEqual=notEqual;function notEqual(actual,expected,message){if(actual==expected){fail(actual,expected,message,'!=',notEqual);}}// 7. The equivalence assertion tests a deep equality relation.
+  // assert.deepEqual(actual, expected, message_opt);
+  assert.deepEqual=deepEqual;function deepEqual(actual,expected,message){if(!_deepEqual(actual,expected,false)){fail(actual,expected,message,'deepEqual',deepEqual);}}assert.deepStrictEqual=deepStrictEqual;function deepStrictEqual(actual,expected,message){if(!_deepEqual(actual,expected,true)){fail(actual,expected,message,'deepStrictEqual',deepStrictEqual);}}function _deepEqual(actual,expected,strict,memos){// 7.1. All identical values are equivalent, as determined by ===.
+  if(actual===expected){return true;}else if(isBuffer(actual)&&isBuffer(expected)){return compare(actual,expected)===0;// 7.2. If the expected value is a Date object, the actual value is
+  // equivalent if it is also a Date object that refers to the same time.
+  }else if(isDate(actual)&&isDate(expected)){return actual.getTime()===expected.getTime();// 7.3 If the expected value is a RegExp object, the actual value is
+  // equivalent if it is also a RegExp object with the same source and
+  // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
+  }else if(isRegExp(actual)&&isRegExp(expected)){return actual.source===expected.source&&actual.global===expected.global&&actual.multiline===expected.multiline&&actual.lastIndex===expected.lastIndex&&actual.ignoreCase===expected.ignoreCase;// 7.4. Other pairs that do not both pass typeof value == 'object',
+  // equivalence is determined by ==.
+  }else if((actual===null||typeof actual!=='object')&&(expected===null||typeof expected!=='object')){return strict?actual===expected:actual==expected;// If both values are instances of typed arrays, wrap their underlying
+  // ArrayBuffers in a Buffer each to increase performance
+  // This optimization requires the arrays to have the same type as checked by
+  // Object.prototype.toString (aka pToString). Never perform binary
+  // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their
+  // bit patterns are not identical.
+  }else if(isView(actual)&&isView(expected)&&pToString(actual)===pToString(expected)&&!(actual instanceof Float32Array||actual instanceof Float64Array)){return compare(new Uint8Array(actual.buffer),new Uint8Array(expected.buffer))===0;// 7.5 For all other Object pairs, including Array objects, equivalence is
+  // determined by having the same number of owned properties (as verified
+  // with Object.prototype.hasOwnProperty.call), the same set of keys
+  // (although not necessarily the same order), equivalent values for every
+  // corresponding key, and an identical 'prototype' property. Note: this
+  // accounts for both named and indexed properties on Arrays.
+  }else if(isBuffer(actual)!==isBuffer(expected)){return false;}else{memos=memos||{actual:[],expected:[]};var actualIndex=memos.actual.indexOf(actual);if(actualIndex!==-1){if(actualIndex===memos.expected.indexOf(expected)){return true;}}memos.actual.push(actual);memos.expected.push(expected);return objEquiv(actual,expected,strict,memos);}}function isArguments(object){return Object.prototype.toString.call(object)=='[object Arguments]';}function objEquiv(a,b,strict,actualVisitedObjects){if(a===null||a===undefined||b===null||b===undefined)return false;// if one is a primitive, the other must be same
+  if(isPrimitive(a)||isPrimitive(b))return a===b;if(strict&&Object.getPrototypeOf(a)!==Object.getPrototypeOf(b))return false;var aIsArgs=isArguments(a);var bIsArgs=isArguments(b);if(aIsArgs&&!bIsArgs||!aIsArgs&&bIsArgs)return false;if(aIsArgs){a=pSlice.call(a);b=pSlice.call(b);return _deepEqual(a,b,strict);}var ka=objectKeys(a);var kb=objectKeys(b);var key,i;// having the same number of owned properties (keys incorporates
+  // hasOwnProperty)
+  if(ka.length!==kb.length)return false;//the same set of keys (although not necessarily the same order),
+  ka.sort();kb.sort();//~~~cheap key test
+  for(i=ka.length-1;i>=0;i--){if(ka[i]!==kb[i])return false;}//equivalent values for every corresponding key, and
+  //~~~possibly expensive deep test
+  for(i=ka.length-1;i>=0;i--){key=ka[i];if(!_deepEqual(a[key],b[key],strict,actualVisitedObjects))return false;}return true;}// 8. The non-equivalence assertion tests for any deep inequality.
+  // assert.notDeepEqual(actual, expected, message_opt);
+  assert.notDeepEqual=notDeepEqual;function notDeepEqual(actual,expected,message){if(_deepEqual(actual,expected,false)){fail(actual,expected,message,'notDeepEqual',notDeepEqual);}}assert.notDeepStrictEqual=notDeepStrictEqual;function notDeepStrictEqual(actual,expected,message){if(_deepEqual(actual,expected,true)){fail(actual,expected,message,'notDeepStrictEqual',notDeepStrictEqual);}}// 9. The strict equality assertion tests strict equality, as determined by ===.
+  // assert.strictEqual(actual, expected, message_opt);
+  assert.strictEqual=strictEqual;function strictEqual(actual,expected,message){if(actual!==expected){fail(actual,expected,message,'===',strictEqual);}}// 10. The strict non-equality assertion tests for strict inequality, as
+  // determined by !==.  assert.notStrictEqual(actual, expected, message_opt);
+  assert.notStrictEqual=notStrictEqual;function notStrictEqual(actual,expected,message){if(actual===expected){fail(actual,expected,message,'!==',notStrictEqual);}}function expectedException(actual,expected){if(!actual||!expected){return false;}if(Object.prototype.toString.call(expected)=='[object RegExp]'){return expected.test(actual);}try{if(actual instanceof expected){return true;}}catch(e){// Ignore.  The instanceof check doesn't work for arrow functions.
+  }if(Error.isPrototypeOf(expected)){return false;}return expected.call({},actual)===true;}function _tryBlock(block){var error;try{block();}catch(e){error=e;}return error;}function _throws(shouldThrow,block,expected,message){var actual;if(typeof block!=='function'){throw new TypeError('"block" argument must be a function');}if(typeof expected==='string'){message=expected;expected=null;}actual=_tryBlock(block);message=(expected&&expected.name?' ('+expected.name+').':'.')+(message?' '+message:'.');if(shouldThrow&&!actual){fail(actual,expected,'Missing expected exception'+message);}var userProvidedMessage=typeof message==='string';var isUnwantedException=!shouldThrow&&isError(actual);var isUnexpectedException=!shouldThrow&&actual&&!expected;if(isUnwantedException&&userProvidedMessage&&expectedException(actual,expected)||isUnexpectedException){fail(actual,expected,'Got unwanted exception'+message);}if(shouldThrow&&actual&&expected&&!expectedException(actual,expected)||!shouldThrow&&actual){throw actual;}}// 11. Expected to throw an error:
+  // assert.throws(block, Error_opt, message_opt);
+  assert.throws=throws;function throws(block,/*optional*/error,/*optional*/message){_throws(true,block,error,message);}// EXTENSION! This is annoying to write outside this module.
+  assert.doesNotThrow=doesNotThrow;function doesNotThrow(block,/*optional*/error,/*optional*/message){_throws(false,block,error,message);}assert.ifError=ifError;function ifError(err){if(err)throw err;}/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var intToCharMap='ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');/**
+  	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+  	 */var encode=function encode(number){if(0<=number&&number<intToCharMap.length){return intToCharMap[number];}throw new TypeError("Must be between 0 and 63: "+number);};/**
+  	 * Decode a single base 64 character code digit to an integer. Returns -1 on
+  	 * failure.
+  	 */var decode=function decode(charCode){var bigA=65;// 'A'
+  var bigZ=90;// 'Z'
+  var littleA=97;// 'a'
+  var littleZ=122;// 'z'
+  var zero=48;// '0'
+  var nine=57;// '9'
+  var plus=43;// '+'
+  var slash=47;// '/'
+  var littleOffset=26;var numberOffset=52;// 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+  if(bigA<=charCode&&charCode<=bigZ){return charCode-bigA;}// 26 - 51: abcdefghijklmnopqrstuvwxyz
+  if(littleA<=charCode&&charCode<=littleZ){return charCode-littleA+littleOffset;}// 52 - 61: 0123456789
+  if(zero<=charCode&&charCode<=nine){return charCode-zero+numberOffset;}// 62: +
+  if(charCode==plus){return 62;}// 63: /
+  if(charCode==slash){return 63;}// Invalid base64 digit.
+  return -1;};var base64={encode:encode,decode:decode};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 *
+  	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+  	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+  	 *
+  	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+  	 * Redistribution and use in source and binary forms, with or without
+  	 * modification, are permitted provided that the following conditions are
+  	 * met:
+  	 *
+  	 *  * Redistributions of source code must retain the above copyright
+  	 *    notice, this list of conditions and the following disclaimer.
+  	 *  * Redistributions in binary form must reproduce the above
+  	 *    copyright notice, this list of conditions and the following
+  	 *    disclaimer in the documentation and/or other materials provided
+  	 *    with the distribution.
+  	 *  * Neither the name of Google Inc. nor the names of its
+  	 *    contributors may be used to endorse or promote products derived
+  	 *    from this software without specific prior written permission.
+  	 *
+  	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+  	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+  	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+  	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+  	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+  	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+  	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+  	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+  	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+  	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+  	 */ // A single base 64 digit can contain 6 bits of data. For the base 64 variable
+  // length quantities we use in the source map spec, the first bit is the sign,
+  // the next four bits are the actual value, and the 6th bit is the
+  // continuation bit. The continuation bit tells us whether there are more
+  // digits in this value following this digit.
+  //
+  //   Continuation
+  //   |    Sign
+  //   |    |
+  //   V    V
+  //   101011
+  var VLQ_BASE_SHIFT=5;// binary: 100000
+  var VLQ_BASE=1<<VLQ_BASE_SHIFT;// binary: 011111
+  var VLQ_BASE_MASK=VLQ_BASE-1;// binary: 100000
+  var VLQ_CONTINUATION_BIT=VLQ_BASE;/**
+  	 * Converts from a two-complement value to a value where the sign bit is
+  	 * placed in the least significant bit.  For example, as decimals:
+  	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+  	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+  	 */function toVLQSigned(aValue){return aValue<0?(-aValue<<1)+1:(aValue<<1)+0;}/**
+  	 * Converts to a two-complement value from a value where the sign bit is
+  	 * placed in the least significant bit.  For example, as decimals:
+  	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+  	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+  	 */function fromVLQSigned(aValue){var isNegative=(aValue&1)===1;var shifted=aValue>>1;return isNegative?-shifted:shifted;}/**
+  	 * Returns the base 64 VLQ encoded value.
+  	 */var encode$1=function base64VLQ_encode(aValue){var encoded="";var digit;var vlq=toVLQSigned(aValue);do{digit=vlq&VLQ_BASE_MASK;vlq>>>=VLQ_BASE_SHIFT;if(vlq>0){// There are still more digits in this value, so we must make sure the
+  // continuation bit is marked.
+  digit|=VLQ_CONTINUATION_BIT;}encoded+=base64.encode(digit);}while(vlq>0);return encoded;};/**
+  	 * Decodes the next base 64 VLQ value from the given string and returns the
+  	 * value and the rest of the string via the out parameter.
+  	 */var decode$1=function base64VLQ_decode(aStr,aIndex,aOutParam){var strLen=aStr.length;var result=0;var shift=0;var continuation,digit;do{if(aIndex>=strLen){throw new Error("Expected more digits in base 64 VLQ value.");}digit=base64.decode(aStr.charCodeAt(aIndex++));if(digit===-1){throw new Error("Invalid base64 digit: "+aStr.charAt(aIndex-1));}continuation=!!(digit&VLQ_CONTINUATION_BIT);digit&=VLQ_BASE_MASK;result=result+(digit<<shift);shift+=VLQ_BASE_SHIFT;}while(continuation);aOutParam.value=fromVLQSigned(result);aOutParam.rest=aIndex;};var base64Vlq={encode:encode$1,decode:decode$1};var util=createCommonjsModule(function(module,exports){/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ /**
+  	 * This is a helper function for getting values from parameter/options
+  	 * objects.
+  	 *
+  	 * @param args The object we are extracting values from
+  	 * @param name The name of the property we are getting.
+  	 * @param defaultValue An optional value to return if the property is missing
+  	 * from the object. If this is not specified and the property is missing, an
+  	 * error will be thrown.
+  	 */function getArg(aArgs,aName,aDefaultValue){if(aName in aArgs){return aArgs[aName];}else if(arguments.length===3){return aDefaultValue;}else{throw new Error('"'+aName+'" is a required argument.');}}exports.getArg=getArg;var urlRegexp=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;var dataUrlRegexp=/^data:.+\,.+$/;function urlParse(aUrl){var match=aUrl.match(urlRegexp);if(!match){return null;}return {scheme:match[1],auth:match[2],host:match[3],port:match[4],path:match[5]};}exports.urlParse=urlParse;function urlGenerate(aParsedUrl){var url='';if(aParsedUrl.scheme){url+=aParsedUrl.scheme+':';}url+='//';if(aParsedUrl.auth){url+=aParsedUrl.auth+'@';}if(aParsedUrl.host){url+=aParsedUrl.host;}if(aParsedUrl.port){url+=":"+aParsedUrl.port;}if(aParsedUrl.path){url+=aParsedUrl.path;}return url;}exports.urlGenerate=urlGenerate;/**
+  	 * Normalizes a path, or the path portion of a URL:
+  	 *
+  	 * - Replaces consecutive slashes with one slash.
+  	 * - Removes unnecessary '.' parts.
+  	 * - Removes unnecessary '<dir>/..' parts.
+  	 *
+  	 * Based on code in the Node.js 'path' core module.
+  	 *
+  	 * @param aPath The path or url to normalize.
+  	 */function normalize(aPath){var path=aPath;var url=urlParse(aPath);if(url){if(!url.path){return aPath;}path=url.path;}var isAbsolute=exports.isAbsolute(path);var parts=path.split(/\/+/);for(var part,up=0,i=parts.length-1;i>=0;i--){part=parts[i];if(part==='.'){parts.splice(i,1);}else if(part==='..'){up++;}else if(up>0){if(part===''){// The first part is blank if the path is absolute. Trying to go
+  // above the root is a no-op. Therefore we can remove all '..' parts
+  // directly after the root.
+  parts.splice(i+1,up);up=0;}else{parts.splice(i,2);up--;}}}path=parts.join('/');if(path===''){path=isAbsolute?'/':'.';}if(url){url.path=path;return urlGenerate(url);}return path;}exports.normalize=normalize;/**
+  	 * Joins two paths/URLs.
+  	 *
+  	 * @param aRoot The root path or URL.
+  	 * @param aPath The path or URL to be joined with the root.
+  	 *
+  	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+  	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+  	 *   first.
+  	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+  	 *   is updated with the result and aRoot is returned. Otherwise the result
+  	 *   is returned.
+  	 *   - If aPath is absolute, the result is aPath.
+  	 *   - Otherwise the two paths are joined with a slash.
+  	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+  	 */function join(aRoot,aPath){if(aRoot===""){aRoot=".";}if(aPath===""){aPath=".";}var aPathUrl=urlParse(aPath);var aRootUrl=urlParse(aRoot);if(aRootUrl){aRoot=aRootUrl.path||'/';}// `join(foo, '//www.example.org')`
+  if(aPathUrl&&!aPathUrl.scheme){if(aRootUrl){aPathUrl.scheme=aRootUrl.scheme;}return urlGenerate(aPathUrl);}if(aPathUrl||aPath.match(dataUrlRegexp)){return aPath;}// `join('http://', 'www.example.com')`
+  if(aRootUrl&&!aRootUrl.host&&!aRootUrl.path){aRootUrl.host=aPath;return urlGenerate(aRootUrl);}var joined=aPath.charAt(0)==='/'?aPath:normalize(aRoot.replace(/\/+$/,'')+'/'+aPath);if(aRootUrl){aRootUrl.path=joined;return urlGenerate(aRootUrl);}return joined;}exports.join=join;exports.isAbsolute=function(aPath){return aPath.charAt(0)==='/'||urlRegexp.test(aPath);};/**
+  	 * Make a path relative to a URL or another path.
+  	 *
+  	 * @param aRoot The root path or URL.
+  	 * @param aPath The path or URL to be made relative to aRoot.
+  	 */function relative(aRoot,aPath){if(aRoot===""){aRoot=".";}aRoot=aRoot.replace(/\/$/,'');// It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  var level=0;while(aPath.indexOf(aRoot+'/')!==0){var index=aRoot.lastIndexOf("/");if(index<0){return aPath;}// If the only part of the root that is left is the scheme (i.e. http://,
+  // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+  // have exhausted all components, so the path is not relative to the root.
+  aRoot=aRoot.slice(0,index);if(aRoot.match(/^([^\/]+:\/)?\/*$/)){return aPath;}++level;}// Make sure we add a "../" for each component we removed from the root.
+  return Array(level+1).join("../")+aPath.substr(aRoot.length+1);}exports.relative=relative;var supportsNullProto=function(){var obj=Object.create(null);return !('__proto__'in obj);}();function identity(s){return s;}/**
+  	 * Because behavior goes wacky when you set `__proto__` on objects, we
+  	 * have to prefix all the strings in our set with an arbitrary character.
+  	 *
+  	 * See https://github.com/mozilla/source-map/pull/31 and
+  	 * https://github.com/mozilla/source-map/issues/30
+  	 *
+  	 * @param String aStr
+  	 */function toSetString(aStr){if(isProtoString(aStr)){return '$'+aStr;}return aStr;}exports.toSetString=supportsNullProto?identity:toSetString;function fromSetString(aStr){if(isProtoString(aStr)){return aStr.slice(1);}return aStr;}exports.fromSetString=supportsNullProto?identity:fromSetString;function isProtoString(s){if(!s){return false;}var length=s.length;if(length<9/* "__proto__".length */){return false;}if(s.charCodeAt(length-1)!==95/* '_' */||s.charCodeAt(length-2)!==95/* '_' */||s.charCodeAt(length-3)!==111/* 'o' */||s.charCodeAt(length-4)!==116/* 't' */||s.charCodeAt(length-5)!==111/* 'o' */||s.charCodeAt(length-6)!==114/* 'r' */||s.charCodeAt(length-7)!==112/* 'p' */||s.charCodeAt(length-8)!==95/* '_' */||s.charCodeAt(length-9)!==95/* '_' */){return false;}for(var i=length-10;i>=0;i--){if(s.charCodeAt(i)!==36/* '$' */){return false;}}return true;}/**
+  	 * Comparator between two mappings where the original positions are compared.
+  	 *
+  	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+  	 * mappings with the same original source/line/column, but different generated
+  	 * line and column the same. Useful when searching for a mapping with a
+  	 * stubbed out mapping.
+  	 */function compareByOriginalPositions(mappingA,mappingB,onlyCompareOriginal){var cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0||onlyCompareOriginal){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0){return cmp;}cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByOriginalPositions=compareByOriginalPositions;/**
+  	 * Comparator between two mappings with deflated source and name indices where
+  	 * the generated positions are compared.
+  	 *
+  	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+  	 * mappings with the same generated line and column, but different
+  	 * source/name/original line and column the same. Useful when searching for a
+  	 * mapping with a stubbed out mapping.
+  	 */function compareByGeneratedPositionsDeflated(mappingA,mappingB,onlyCompareGenerated){var cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0||onlyCompareGenerated){return cmp;}cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByGeneratedPositionsDeflated=compareByGeneratedPositionsDeflated;function strcmp(aStr1,aStr2){if(aStr1===aStr2){return 0;}if(aStr1===null){return 1;// aStr2 !== null
+  }if(aStr2===null){return -1;// aStr1 !== null
+  }if(aStr1>aStr2){return 1;}return -1;}/**
+  	 * Comparator between two mappings with inflated source and name strings where
+  	 * the generated positions are compared.
+  	 */function compareByGeneratedPositionsInflated(mappingA,mappingB){var cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0){return cmp;}cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByGeneratedPositionsInflated=compareByGeneratedPositionsInflated;/**
+  	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+  	 * in the source maps specification), and then parse the string as
+  	 * JSON.
+  	 */function parseSourceMapInput(str){return JSON.parse(str.replace(/^\)]}'[^\n]*\n/,''));}exports.parseSourceMapInput=parseSourceMapInput;/**
+  	 * Compute the URL of a source given the the source root, the source's
+  	 * URL, and the source map's URL.
+  	 */function computeSourceURL(sourceRoot,sourceURL,sourceMapURL){sourceURL=sourceURL||'';if(sourceRoot){// This follows what Chrome does.
+  if(sourceRoot[sourceRoot.length-1]!=='/'&&sourceURL[0]!=='/'){sourceRoot+='/';}// The spec says:
+  //   Line 4: An optional source root, useful for relocating source
+  //   files on a server or removing repeated values in the
+  //   “sources” entry.  This value is prepended to the individual
+  //   entries in the “source” field.
+  sourceURL=sourceRoot+sourceURL;}// Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if(sourceMapURL){var parsed=urlParse(sourceMapURL);if(!parsed){throw new Error("sourceMapURL could not be parsed");}if(parsed.path){// Strip the last path component, but keep the "/".
+  var index=parsed.path.lastIndexOf('/');if(index>=0){parsed.path=parsed.path.substring(0,index+1);}}sourceURL=join(urlGenerate(parsed),sourceURL);}return normalize(sourceURL);}exports.computeSourceURL=computeSourceURL;});var util_1=util.getArg;var util_2=util.urlParse;var util_3=util.urlGenerate;var util_4=util.normalize;var util_5=util.join;var util_6=util.isAbsolute;var util_7=util.relative;var util_8=util.toSetString;var util_9=util.fromSetString;var util_10=util.compareByOriginalPositions;var util_11=util.compareByGeneratedPositionsDeflated;var util_12=util.compareByGeneratedPositionsInflated;var util_13=util.parseSourceMapInput;var util_14=util.computeSourceURL;/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var has=Object.prototype.hasOwnProperty;var hasNativeMap=typeof Map!=="undefined";/**
+  	 * A data structure which is a combination of an array and a set. Adding a new
+  	 * member is O(1), testing for membership is O(1), and finding the index of an
+  	 * element is O(1). Removing elements from the set is not supported. Only
+  	 * strings are supported for membership.
+  	 */function ArraySet(){this._array=[];this._set=hasNativeMap?new Map():Object.create(null);}/**
+  	 * Static method for creating ArraySet instances from an existing array.
+  	 */ArraySet.fromArray=function ArraySet_fromArray(aArray,aAllowDuplicates){var set=new ArraySet();for(var i=0,len=aArray.length;i<len;i++){set.add(aArray[i],aAllowDuplicates);}return set;};/**
+  	 * Return how many unique items are in this ArraySet. If duplicates have been
+  	 * added, than those do not count towards the size.
+  	 *
+  	 * @returns Number
+  	 */ArraySet.prototype.size=function ArraySet_size(){return hasNativeMap?this._set.size:Object.getOwnPropertyNames(this._set).length;};/**
+  	 * Add the given string to this set.
+  	 *
+  	 * @param String aStr
+  	 */ArraySet.prototype.add=function ArraySet_add(aStr,aAllowDuplicates){var sStr=hasNativeMap?aStr:util.toSetString(aStr);var isDuplicate=hasNativeMap?this.has(aStr):has.call(this._set,sStr);var idx=this._array.length;if(!isDuplicate||aAllowDuplicates){this._array.push(aStr);}if(!isDuplicate){if(hasNativeMap){this._set.set(aStr,idx);}else{this._set[sStr]=idx;}}};/**
+  	 * Is the given string a member of this set?
+  	 *
+  	 * @param String aStr
+  	 */ArraySet.prototype.has=function ArraySet_has(aStr){if(hasNativeMap){return this._set.has(aStr);}else{var sStr=util.toSetString(aStr);return has.call(this._set,sStr);}};/**
+  	 * What is the index of the given string in the array?
+  	 *
+  	 * @param String aStr
+  	 */ArraySet.prototype.indexOf=function ArraySet_indexOf(aStr){if(hasNativeMap){var idx=this._set.get(aStr);if(idx>=0){return idx;}}else{var sStr=util.toSetString(aStr);if(has.call(this._set,sStr)){return this._set[sStr];}}throw new Error('"'+aStr+'" is not in the set.');};/**
+  	 * What is the element at the given index?
+  	 *
+  	 * @param Number aIdx
+  	 */ArraySet.prototype.at=function ArraySet_at(aIdx){if(aIdx>=0&&aIdx<this._array.length){return this._array[aIdx];}throw new Error('No element indexed by '+aIdx);};/**
+  	 * Returns the array representation of this set (which has the proper indices
+  	 * indicated by indexOf). Note that this is a copy of the internal array used
+  	 * for storing the members so that no one can mess with internal state.
+  	 */ArraySet.prototype.toArray=function ArraySet_toArray(){return this._array.slice();};var ArraySet_1=ArraySet;var arraySet={ArraySet:ArraySet_1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2014 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ /**
+  	 * Determine whether mappingB is after mappingA with respect to generated
+  	 * position.
+  	 */function generatedPositionAfter(mappingA,mappingB){// Optimized for most common case
+  var lineA=mappingA.generatedLine;var lineB=mappingB.generatedLine;var columnA=mappingA.generatedColumn;var columnB=mappingB.generatedColumn;return lineB>lineA||lineB==lineA&&columnB>=columnA||util.compareByGeneratedPositionsInflated(mappingA,mappingB)<=0;}/**
+  	 * A data structure to provide a sorted view of accumulated mappings in a
+  	 * performance conscious manner. It trades a neglibable overhead in general
+  	 * case for a large speedup in case of mappings being added in order.
+  	 */function MappingList(){this._array=[];this._sorted=true;// Serves as infimum
+  this._last={generatedLine:-1,generatedColumn:0};}/**
+  	 * Iterate through internal items. This method takes the same arguments that
+  	 * `Array.prototype.forEach` takes.
+  	 *
+  	 * NOTE: The order of the mappings is NOT guaranteed.
+  	 */MappingList.prototype.unsortedForEach=function MappingList_forEach(aCallback,aThisArg){this._array.forEach(aCallback,aThisArg);};/**
+  	 * Add the given source mapping.
+  	 *
+  	 * @param Object aMapping
+  	 */MappingList.prototype.add=function MappingList_add(aMapping){if(generatedPositionAfter(this._last,aMapping)){this._last=aMapping;this._array.push(aMapping);}else{this._sorted=false;this._array.push(aMapping);}};/**
+  	 * Returns the flat, sorted array of mappings. The mappings are sorted by
+  	 * generated position.
+  	 *
+  	 * WARNING: This method returns internal data without copying, for
+  	 * performance. The return value must NOT be mutated, and should be treated as
+  	 * an immutable borrow. If you want to take ownership, you must make your own
+  	 * copy.
+  	 */MappingList.prototype.toArray=function MappingList_toArray(){if(!this._sorted){this._array.sort(util.compareByGeneratedPositionsInflated);this._sorted=true;}return this._array;};var MappingList_1=MappingList;var mappingList={MappingList:MappingList_1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var ArraySet$1=arraySet.ArraySet;var MappingList$1=mappingList.MappingList;/**
+  	 * An instance of the SourceMapGenerator represents a source map which is
+  	 * being built incrementally. You may pass an object with the following
+  	 * properties:
+  	 *
+  	 *   - file: The filename of the generated source.
+  	 *   - sourceRoot: A root for all relative URLs in this source map.
+  	 */function SourceMapGenerator(aArgs){if(!aArgs){aArgs={};}this._file=util.getArg(aArgs,'file',null);this._sourceRoot=util.getArg(aArgs,'sourceRoot',null);this._skipValidation=util.getArg(aArgs,'skipValidation',false);this._sources=new ArraySet$1();this._names=new ArraySet$1();this._mappings=new MappingList$1();this._sourcesContents=null;}SourceMapGenerator.prototype._version=3;/**
+  	 * Creates a new SourceMapGenerator based on a SourceMapConsumer
+  	 *
+  	 * @param aSourceMapConsumer The SourceMap.
+  	 */SourceMapGenerator.fromSourceMap=function SourceMapGenerator_fromSourceMap(aSourceMapConsumer){var sourceRoot=aSourceMapConsumer.sourceRoot;var generator=new SourceMapGenerator({file:aSourceMapConsumer.file,sourceRoot:sourceRoot});aSourceMapConsumer.eachMapping(function(mapping){var newMapping={generated:{line:mapping.generatedLine,column:mapping.generatedColumn}};if(mapping.source!=null){newMapping.source=mapping.source;if(sourceRoot!=null){newMapping.source=util.relative(sourceRoot,newMapping.source);}newMapping.original={line:mapping.originalLine,column:mapping.originalColumn};if(mapping.name!=null){newMapping.name=mapping.name;}}generator.addMapping(newMapping);});aSourceMapConsumer.sources.forEach(function(sourceFile){var sourceRelative=sourceFile;if(sourceRoot!==null){sourceRelative=util.relative(sourceRoot,sourceFile);}if(!generator._sources.has(sourceRelative)){generator._sources.add(sourceRelative);}var content=aSourceMapConsumer.sourceContentFor(sourceFile);if(content!=null){generator.setSourceContent(sourceFile,content);}});return generator;};/**
+  	 * Add a single mapping from original source line and column to the generated
+  	 * source's line and column for this source map being created. The mapping
+  	 * object should have the following properties:
+  	 *
+  	 *   - generated: An object with the generated line and column positions.
+  	 *   - original: An object with the original line and column positions.
+  	 *   - source: The original source file (relative to the sourceRoot).
+  	 *   - name: An optional original token name for this mapping.
+  	 */SourceMapGenerator.prototype.addMapping=function SourceMapGenerator_addMapping(aArgs){var generated=util.getArg(aArgs,'generated');var original=util.getArg(aArgs,'original',null);var source=util.getArg(aArgs,'source',null);var name=util.getArg(aArgs,'name',null);if(!this._skipValidation){this._validateMapping(generated,original,source,name);}if(source!=null){source=String(source);if(!this._sources.has(source)){this._sources.add(source);}}if(name!=null){name=String(name);if(!this._names.has(name)){this._names.add(name);}}this._mappings.add({generatedLine:generated.line,generatedColumn:generated.column,originalLine:original!=null&&original.line,originalColumn:original!=null&&original.column,source:source,name:name});};/**
+  	 * Set the source content for a source file.
+  	 */SourceMapGenerator.prototype.setSourceContent=function SourceMapGenerator_setSourceContent(aSourceFile,aSourceContent){var source=aSourceFile;if(this._sourceRoot!=null){source=util.relative(this._sourceRoot,source);}if(aSourceContent!=null){// Add the source content to the _sourcesContents map.
+  // Create a new _sourcesContents map if the property is null.
+  if(!this._sourcesContents){this._sourcesContents=Object.create(null);}this._sourcesContents[util.toSetString(source)]=aSourceContent;}else if(this._sourcesContents){// Remove the source file from the _sourcesContents map.
+  // If the _sourcesContents map is empty, set the property to null.
+  delete this._sourcesContents[util.toSetString(source)];if(Object.keys(this._sourcesContents).length===0){this._sourcesContents=null;}}};/**
+  	 * Applies the mappings of a sub-source-map for a specific source file to the
+  	 * source map being generated. Each mapping to the supplied source file is
+  	 * rewritten using the supplied source map. Note: The resolution for the
+  	 * resulting mappings is the minimium of this map and the supplied map.
+  	 *
+  	 * @param aSourceMapConsumer The source map to be applied.
+  	 * @param aSourceFile Optional. The filename of the source file.
+  	 *        If omitted, SourceMapConsumer's file property will be used.
+  	 * @param aSourceMapPath Optional. The dirname of the path to the source map
+  	 *        to be applied. If relative, it is relative to the SourceMapConsumer.
+  	 *        This parameter is needed when the two source maps aren't in the same
+  	 *        directory, and the source map to be applied contains relative source
+  	 *        paths. If so, those relative source paths need to be rewritten
+  	 *        relative to the SourceMapGenerator.
+  	 */SourceMapGenerator.prototype.applySourceMap=function SourceMapGenerator_applySourceMap(aSourceMapConsumer,aSourceFile,aSourceMapPath){var sourceFile=aSourceFile;// If aSourceFile is omitted, we will use the file property of the SourceMap
+  if(aSourceFile==null){if(aSourceMapConsumer.file==null){throw new Error('SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, '+'or the source map\'s "file" property. Both were omitted.');}sourceFile=aSourceMapConsumer.file;}var sourceRoot=this._sourceRoot;// Make "sourceFile" relative if an absolute Url is passed.
+  if(sourceRoot!=null){sourceFile=util.relative(sourceRoot,sourceFile);}// Applying the SourceMap can add and remove items from the sources and
+  // the names array.
+  var newSources=new ArraySet$1();var newNames=new ArraySet$1();// Find mappings for the "sourceFile"
+  this._mappings.unsortedForEach(function(mapping){if(mapping.source===sourceFile&&mapping.originalLine!=null){// Check if it can be mapped by the source map, then update the mapping.
+  var original=aSourceMapConsumer.originalPositionFor({line:mapping.originalLine,column:mapping.originalColumn});if(original.source!=null){// Copy mapping
+  mapping.source=original.source;if(aSourceMapPath!=null){mapping.source=util.join(aSourceMapPath,mapping.source);}if(sourceRoot!=null){mapping.source=util.relative(sourceRoot,mapping.source);}mapping.originalLine=original.line;mapping.originalColumn=original.column;if(original.name!=null){mapping.name=original.name;}}}var source=mapping.source;if(source!=null&&!newSources.has(source)){newSources.add(source);}var name=mapping.name;if(name!=null&&!newNames.has(name)){newNames.add(name);}},this);this._sources=newSources;this._names=newNames;// Copy sourcesContents of applied map.
+  aSourceMapConsumer.sources.forEach(function(sourceFile){var content=aSourceMapConsumer.sourceContentFor(sourceFile);if(content!=null){if(aSourceMapPath!=null){sourceFile=util.join(aSourceMapPath,sourceFile);}if(sourceRoot!=null){sourceFile=util.relative(sourceRoot,sourceFile);}this.setSourceContent(sourceFile,content);}},this);};/**
+  	 * A mapping can have one of the three levels of data:
+  	 *
+  	 *   1. Just the generated position.
+  	 *   2. The Generated position, original position, and original source.
+  	 *   3. Generated and original position, original source, as well as a name
+  	 *      token.
+  	 *
+  	 * To maintain consistency, we validate that any new mapping being added falls
+  	 * in to one of these categories.
+  	 */SourceMapGenerator.prototype._validateMapping=function SourceMapGenerator_validateMapping(aGenerated,aOriginal,aSource,aName){// When aOriginal is truthy but has empty values for .line and .column,
+  // it is most likely a programmer error. In this case we throw a very
+  // specific error message to try to guide them the right way.
+  // For example: https://github.com/Polymer/polymer-bundler/pull/519
+  if(aOriginal&&typeof aOriginal.line!=='number'&&typeof aOriginal.column!=='number'){throw new Error('original.line and original.column are not numbers -- you probably meant to omit '+'the original mapping entirely and only map the generated position. If so, pass '+'null for the original mapping instead of an object with empty or null values.');}if(aGenerated&&'line'in aGenerated&&'column'in aGenerated&&aGenerated.line>0&&aGenerated.column>=0&&!aOriginal&&!aSource&&!aName){// Case 1.
+  return;}else if(aGenerated&&'line'in aGenerated&&'column'in aGenerated&&aOriginal&&'line'in aOriginal&&'column'in aOriginal&&aGenerated.line>0&&aGenerated.column>=0&&aOriginal.line>0&&aOriginal.column>=0&&aSource){// Cases 2 and 3.
+  return;}else{throw new Error('Invalid mapping: '+JSON.stringify({generated:aGenerated,source:aSource,original:aOriginal,name:aName}));}};/**
+  	 * Serialize the accumulated mappings in to the stream of base 64 VLQs
+  	 * specified by the source map format.
+  	 */SourceMapGenerator.prototype._serializeMappings=function SourceMapGenerator_serializeMappings(){var previousGeneratedColumn=0;var previousGeneratedLine=1;var previousOriginalColumn=0;var previousOriginalLine=0;var previousName=0;var previousSource=0;var result='';var next;var mapping;var nameIdx;var sourceIdx;var mappings=this._mappings.toArray();for(var i=0,len=mappings.length;i<len;i++){mapping=mappings[i];next='';if(mapping.generatedLine!==previousGeneratedLine){previousGeneratedColumn=0;while(mapping.generatedLine!==previousGeneratedLine){next+=';';previousGeneratedLine++;}}else{if(i>0){if(!util.compareByGeneratedPositionsInflated(mapping,mappings[i-1])){continue;}next+=',';}}next+=base64Vlq.encode(mapping.generatedColumn-previousGeneratedColumn);previousGeneratedColumn=mapping.generatedColumn;if(mapping.source!=null){sourceIdx=this._sources.indexOf(mapping.source);next+=base64Vlq.encode(sourceIdx-previousSource);previousSource=sourceIdx;// lines are stored 0-based in SourceMap spec version 3
+  next+=base64Vlq.encode(mapping.originalLine-1-previousOriginalLine);previousOriginalLine=mapping.originalLine-1;next+=base64Vlq.encode(mapping.originalColumn-previousOriginalColumn);previousOriginalColumn=mapping.originalColumn;if(mapping.name!=null){nameIdx=this._names.indexOf(mapping.name);next+=base64Vlq.encode(nameIdx-previousName);previousName=nameIdx;}}result+=next;}return result;};SourceMapGenerator.prototype._generateSourcesContent=function SourceMapGenerator_generateSourcesContent(aSources,aSourceRoot){return aSources.map(function(source){if(!this._sourcesContents){return null;}if(aSourceRoot!=null){source=util.relative(aSourceRoot,source);}var key=util.toSetString(source);return Object.prototype.hasOwnProperty.call(this._sourcesContents,key)?this._sourcesContents[key]:null;},this);};/**
+  	 * Externalize the source map.
+  	 */SourceMapGenerator.prototype.toJSON=function SourceMapGenerator_toJSON(){var map={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};if(this._file!=null){map.file=this._file;}if(this._sourceRoot!=null){map.sourceRoot=this._sourceRoot;}if(this._sourcesContents){map.sourcesContent=this._generateSourcesContent(map.sources,map.sourceRoot);}return map;};/**
+  	 * Render the source map being generated to a string.
+  	 */SourceMapGenerator.prototype.toString=function SourceMapGenerator_toString(){return JSON.stringify(this.toJSON());};var SourceMapGenerator_1=SourceMapGenerator;var sourceMapGenerator={SourceMapGenerator:SourceMapGenerator_1};var binarySearch=createCommonjsModule(function(module,exports){/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */exports.GREATEST_LOWER_BOUND=1;exports.LEAST_UPPER_BOUND=2;/**
+  	 * Recursive implementation of binary search.
+  	 *
+  	 * @param aLow Indices here and lower do not contain the needle.
+  	 * @param aHigh Indices here and higher do not contain the needle.
+  	 * @param aNeedle The element being searched for.
+  	 * @param aHaystack The non-empty array being searched.
+  	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+  	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+  	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 */function recursiveSearch(aLow,aHigh,aNeedle,aHaystack,aCompare,aBias){// This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  var mid=Math.floor((aHigh-aLow)/2)+aLow;var cmp=aCompare(aNeedle,aHaystack[mid],true);if(cmp===0){// Found the element we are looking for.
+  return mid;}else if(cmp>0){// Our needle is greater than aHaystack[mid].
+  if(aHigh-mid>1){// The element is in the upper half.
+  return recursiveSearch(mid,aHigh,aNeedle,aHaystack,aCompare,aBias);}// The exact needle element was not found in this haystack. Determine if
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if(aBias==exports.LEAST_UPPER_BOUND){return aHigh<aHaystack.length?aHigh:-1;}else{return mid;}}else{// Our needle is less than aHaystack[mid].
+  if(mid-aLow>1){// The element is in the lower half.
+  return recursiveSearch(aLow,mid,aNeedle,aHaystack,aCompare,aBias);}// we are in termination case (3) or (2) and return the appropriate thing.
+  if(aBias==exports.LEAST_UPPER_BOUND){return mid;}else{return aLow<0?-1:aLow;}}}/**
+  	 * This is an implementation of binary search which will always try and return
+  	 * the index of the closest element if there is no exact hit. This is because
+  	 * mappings between original and generated line/col pairs are single points,
+  	 * and there is an implicit region between each of them, so a miss just means
+  	 * that you aren't on the very start of a region.
+  	 *
+  	 * @param aNeedle The element you are looking for.
+  	 * @param aHaystack The array that is being searched.
+  	 * @param aCompare A function which takes the needle and an element in the
+  	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+  	 *     than, equal to, or greater than the element, respectively.
+  	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+  	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+  	 */exports.search=function search(aNeedle,aHaystack,aCompare,aBias){if(aHaystack.length===0){return -1;}var index=recursiveSearch(-1,aHaystack.length,aNeedle,aHaystack,aCompare,aBias||exports.GREATEST_LOWER_BOUND);if(index<0){return -1;}// We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while(index-1>=0){if(aCompare(aHaystack[index],aHaystack[index-1],true)!==0){break;}--index;}return index;};});var binarySearch_1=binarySearch.GREATEST_LOWER_BOUND;var binarySearch_2=binarySearch.LEAST_UPPER_BOUND;var binarySearch_3=binarySearch.search;/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ // It turns out that some (most?) JavaScript engines don't self-host
+  // `Array.prototype.sort`. This makes sense because C++ will likely remain
+  // faster than JS when doing raw CPU-intensive sorting. However, when using a
+  // custom comparator function, calling back and forth between the VM's C++ and
+  // JIT'd JS is rather slow *and* loses JIT type information, resulting in
+  // worse generated code for the comparator function than would be optimal. In
+  // fact, when sorting with a comparator, these costs outweigh the benefits of
+  // sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+  // a ~3500ms mean speed-up in `bench/bench.html`.
+  /**
+  	 * Swap the elements indexed by `x` and `y` in the array `ary`.
+  	 *
+  	 * @param {Array} ary
+  	 *        The array.
+  	 * @param {Number} x
+  	 *        The index of the first item.
+  	 * @param {Number} y
+  	 *        The index of the second item.
+  	 */function swap$1(ary,x,y){var temp=ary[x];ary[x]=ary[y];ary[y]=temp;}/**
+  	 * Returns a random integer within the range `low .. high` inclusive.
+  	 *
+  	 * @param {Number} low
+  	 *        The lower bound on the range.
+  	 * @param {Number} high
+  	 *        The upper bound on the range.
+  	 */function randomIntInRange(low,high){return Math.round(low+Math.random()*(high-low));}/**
+  	 * The Quick Sort algorithm.
+  	 *
+  	 * @param {Array} ary
+  	 *        An array to sort.
+  	 * @param {function} comparator
+  	 *        Function to use to compare two items.
+  	 * @param {Number} p
+  	 *        Start index of the array
+  	 * @param {Number} r
+  	 *        End index of the array
+  	 */function doQuickSort(ary,comparator,p,r){// If our lower bound is less than our upper bound, we (1) partition the
+  // array into two pieces and (2) recurse on each half. If it is not, this is
+  // the empty array and our base case.
+  if(p<r){// (1) Partitioning.
+  //
+  // The partitioning chooses a pivot between `p` and `r` and moves all
+  // elements that are less than or equal to the pivot to the before it, and
+  // all the elements that are greater than it after it. The effect is that
+  // once partition is done, the pivot is in the exact place it will be when
+  // the array is put in sorted order, and it will not need to be moved
+  // again. This runs in O(n) time.
+  // Always choose a random pivot so that an input array which is reverse
+  // sorted does not cause O(n^2) running time.
+  var pivotIndex=randomIntInRange(p,r);var i=p-1;swap$1(ary,pivotIndex,r);var pivot=ary[r];// Immediately after `j` is incremented in this loop, the following hold
+  // true:
+  //
+  //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+  //
+  //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+  for(var j=p;j<r;j++){if(comparator(ary[j],pivot)<=0){i+=1;swap$1(ary,i,j);}}swap$1(ary,i+1,j);var q=i+1;// (2) Recurse on each half.
+  doQuickSort(ary,comparator,p,q-1);doQuickSort(ary,comparator,q+1,r);}}/**
+  	 * Sort the given array in-place with the given comparator function.
+  	 *
+  	 * @param {Array} ary
+  	 *        An array to sort.
+  	 * @param {function} comparator
+  	 *        Function to use to compare two items.
+  	 */var quickSort_1=function quickSort_1(ary,comparator){doQuickSort(ary,comparator,0,ary.length-1);};var quickSort={quickSort:quickSort_1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var ArraySet$2=arraySet.ArraySet;var quickSort$1=quickSort.quickSort;function SourceMapConsumer(aSourceMap,aSourceMapURL){var sourceMap=aSourceMap;if(typeof aSourceMap==='string'){sourceMap=util.parseSourceMapInput(aSourceMap);}return sourceMap.sections!=null?new IndexedSourceMapConsumer(sourceMap,aSourceMapURL):new BasicSourceMapConsumer(sourceMap,aSourceMapURL);}SourceMapConsumer.fromSourceMap=function(aSourceMap,aSourceMapURL){return BasicSourceMapConsumer.fromSourceMap(aSourceMap,aSourceMapURL);};/**
+  	 * The version of the source mapping spec that we are consuming.
+  	 */SourceMapConsumer.prototype._version=3;// `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  SourceMapConsumer.prototype.__generatedMappings=null;Object.defineProperty(SourceMapConsumer.prototype,'_generatedMappings',{configurable:true,enumerable:true,get:function get(){if(!this.__generatedMappings){this._parseMappings(this._mappings,this.sourceRoot);}return this.__generatedMappings;}});SourceMapConsumer.prototype.__originalMappings=null;Object.defineProperty(SourceMapConsumer.prototype,'_originalMappings',{configurable:true,enumerable:true,get:function get(){if(!this.__originalMappings){this._parseMappings(this._mappings,this.sourceRoot);}return this.__originalMappings;}});SourceMapConsumer.prototype._charIsMappingSeparator=function SourceMapConsumer_charIsMappingSeparator(aStr,index){var c=aStr.charAt(index);return c===";"||c===",";};/**
+  	 * Parse the mappings in a string in to a data structure which we can easily
+  	 * query (the ordered arrays in the `this.__generatedMappings` and
+  	 * `this.__originalMappings` properties).
+  	 */SourceMapConsumer.prototype._parseMappings=function SourceMapConsumer_parseMappings(aStr,aSourceRoot){throw new Error("Subclasses must implement _parseMappings");};SourceMapConsumer.GENERATED_ORDER=1;SourceMapConsumer.ORIGINAL_ORDER=2;SourceMapConsumer.GREATEST_LOWER_BOUND=1;SourceMapConsumer.LEAST_UPPER_BOUND=2;/**
+  	 * Iterate over each mapping between an original source/line/column and a
+  	 * generated line/column in this source map.
+  	 *
+  	 * @param Function aCallback
+  	 *        The function that is called with each mapping.
+  	 * @param Object aContext
+  	 *        Optional. If specified, this object will be the value of `this` every
+  	 *        time that `aCallback` is called.
+  	 * @param aOrder
+  	 *        Either `SourceMapConsumer.GENERATED_ORDER` or
+  	 *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+  	 *        iterate over the mappings sorted by the generated file's line/column
+  	 *        order or the original's source/line/column order, respectively. Defaults to
+  	 *        `SourceMapConsumer.GENERATED_ORDER`.
+  	 */SourceMapConsumer.prototype.eachMapping=function SourceMapConsumer_eachMapping(aCallback,aContext,aOrder){var context=aContext||null;var order=aOrder||SourceMapConsumer.GENERATED_ORDER;var mappings;switch(order){case SourceMapConsumer.GENERATED_ORDER:mappings=this._generatedMappings;break;case SourceMapConsumer.ORIGINAL_ORDER:mappings=this._originalMappings;break;default:throw new Error("Unknown order of iteration.");}var sourceRoot=this.sourceRoot;mappings.map(function(mapping){var source=mapping.source===null?null:this._sources.at(mapping.source);source=util.computeSourceURL(sourceRoot,source,this._sourceMapURL);return {source:source,generatedLine:mapping.generatedLine,generatedColumn:mapping.generatedColumn,originalLine:mapping.originalLine,originalColumn:mapping.originalColumn,name:mapping.name===null?null:this._names.at(mapping.name)};},this).forEach(aCallback,context);};/**
+  	 * Returns all generated line and column information for the original source,
+  	 * line, and column provided. If no column is provided, returns all mappings
+  	 * corresponding to a either the line we are searching for or the next
+  	 * closest line that has any mappings. Otherwise, returns all mappings
+  	 * corresponding to the given line and either the column we are searching for
+  	 * or the next closest column that has any offsets.
+  	 *
+  	 * The only argument is an object with the following properties:
+  	 *
+  	 *   - source: The filename of the original source.
+  	 *   - line: The line number in the original source.  The line number is 1-based.
+  	 *   - column: Optional. the column number in the original source.
+  	 *    The column number is 0-based.
+  	 *
+  	 * and an array of objects is returned, each with the following properties:
+  	 *
+  	 *   - line: The line number in the generated source, or null.  The
+  	 *    line number is 1-based.
+  	 *   - column: The column number in the generated source, or null.
+  	 *    The column number is 0-based.
+  	 */SourceMapConsumer.prototype.allGeneratedPositionsFor=function SourceMapConsumer_allGeneratedPositionsFor(aArgs){var line=util.getArg(aArgs,'line');// When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+  // returns the index of the closest mapping less than the needle. By
+  // setting needle.originalColumn to 0, we thus find the last mapping for
+  // the given line, provided such a mapping exists.
+  var needle={source:util.getArg(aArgs,'source'),originalLine:line,originalColumn:util.getArg(aArgs,'column',0)};needle.source=this._findSourceIndex(needle.source);if(needle.source<0){return [];}var mappings=[];var index=this._findMapping(needle,this._originalMappings,"originalLine","originalColumn",util.compareByOriginalPositions,binarySearch.LEAST_UPPER_BOUND);if(index>=0){var mapping=this._originalMappings[index];if(aArgs.column===undefined){var originalLine=mapping.originalLine;// Iterate until either we run out of mappings, or we run into
+  // a mapping for a different line than the one we found. Since
+  // mappings are sorted, this is guaranteed to find all mappings for
+  // the line we found.
+  while(mapping&&mapping.originalLine===originalLine){mappings.push({line:util.getArg(mapping,'generatedLine',null),column:util.getArg(mapping,'generatedColumn',null),lastColumn:util.getArg(mapping,'lastGeneratedColumn',null)});mapping=this._originalMappings[++index];}}else{var originalColumn=mapping.originalColumn;// Iterate until either we run out of mappings, or we run into
+  // a mapping for a different line than the one we were searching for.
+  // Since mappings are sorted, this is guaranteed to find all mappings for
+  // the line we are searching for.
+  while(mapping&&mapping.originalLine===line&&mapping.originalColumn==originalColumn){mappings.push({line:util.getArg(mapping,'generatedLine',null),column:util.getArg(mapping,'generatedColumn',null),lastColumn:util.getArg(mapping,'lastGeneratedColumn',null)});mapping=this._originalMappings[++index];}}}return mappings;};var SourceMapConsumer_1=SourceMapConsumer;/**
+  	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+  	 * query for information about the original file positions by giving it a file
+  	 * position in the generated source.
+  	 *
+  	 * The first parameter is the raw source map (either as a JSON string, or
+  	 * already parsed to an object). According to the spec, source maps have the
+  	 * following attributes:
+  	 *
+  	 *   - version: Which version of the source map spec this map is following.
+  	 *   - sources: An array of URLs to the original source files.
+  	 *   - names: An array of identifiers which can be referrenced by individual mappings.
+  	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+  	 *   - sourcesContent: Optional. An array of contents of the original source files.
+  	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+  	 *   - file: Optional. The generated file this source map is associated with.
+  	 *
+  	 * Here is an example source map, taken from the source map spec[0]:
+  	 *
+  	 *     {
+  	 *       version : 3,
+  	 *       file: "out.js",
+  	 *       sourceRoot : "",
+  	 *       sources: ["foo.js", "bar.js"],
+  	 *       names: ["src", "maps", "are", "fun"],
+  	 *       mappings: "AA,AB;;ABCDE;"
+  	 *     }
+  	 *
+  	 * The second parameter, if given, is a string whose value is the URL
+  	 * at which the source map was found.  This URL is used to compute the
+  	 * sources array.
+  	 *
+  	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+  	 */function BasicSourceMapConsumer(aSourceMap,aSourceMapURL){var sourceMap=aSourceMap;if(typeof aSourceMap==='string'){sourceMap=util.parseSourceMapInput(aSourceMap);}var version=util.getArg(sourceMap,'version');var sources=util.getArg(sourceMap,'sources');// Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+  // requires the array) to play nice here.
+  var names=util.getArg(sourceMap,'names',[]);var sourceRoot=util.getArg(sourceMap,'sourceRoot',null);var sourcesContent=util.getArg(sourceMap,'sourcesContent',null);var mappings=util.getArg(sourceMap,'mappings');var file=util.getArg(sourceMap,'file',null);// Once again, Sass deviates from the spec and supplies the version as a
+  // string rather than a number, so we use loose equality checking here.
+  if(version!=this._version){throw new Error('Unsupported version: '+version);}if(sourceRoot){sourceRoot=util.normalize(sourceRoot);}sources=sources.map(String)// Some source maps produce relative source paths like "./foo.js" instead of
+  // "foo.js".  Normalize these first so that future comparisons will succeed.
+  // See bugzil.la/1090768.
+  .map(util.normalize)// Always ensure that absolute sources are internally stored relative to
+  // the source root, if the source root is absolute. Not doing this would
+  // be particularly problematic when the source root is a prefix of the
+  // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+  .map(function(source){return sourceRoot&&util.isAbsolute(sourceRoot)&&util.isAbsolute(source)?util.relative(sourceRoot,source):source;});// Pass `true` below to allow duplicate names and sources. While source maps
+  // are intended to be compressed and deduplicated, the TypeScript compiler
+  // sometimes generates source maps with duplicates in them. See Github issue
+  // #72 and bugzil.la/889492.
+  this._names=ArraySet$2.fromArray(names.map(String),true);this._sources=ArraySet$2.fromArray(sources,true);this._absoluteSources=this._sources.toArray().map(function(s){return util.computeSourceURL(sourceRoot,s,aSourceMapURL);});this.sourceRoot=sourceRoot;this.sourcesContent=sourcesContent;this._mappings=mappings;this._sourceMapURL=aSourceMapURL;this.file=file;}BasicSourceMapConsumer.prototype=Object.create(SourceMapConsumer.prototype);BasicSourceMapConsumer.prototype.consumer=SourceMapConsumer;/**
+  	 * Utility function to find the index of a source.  Returns -1 if not
+  	 * found.
+  	 */BasicSourceMapConsumer.prototype._findSourceIndex=function(aSource){var relativeSource=aSource;if(this.sourceRoot!=null){relativeSource=util.relative(this.sourceRoot,relativeSource);}if(this._sources.has(relativeSource)){return this._sources.indexOf(relativeSource);}// Maybe aSource is an absolute URL as returned by |sources|.  In
+  // this case we can't simply undo the transform.
+  var i;for(i=0;i<this._absoluteSources.length;++i){if(this._absoluteSources[i]==aSource){return i;}}return -1;};/**
+  	 * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+  	 *
+  	 * @param SourceMapGenerator aSourceMap
+  	 *        The source map that will be consumed.
+  	 * @param String aSourceMapURL
+  	 *        The URL at which the source map can be found (optional)
+  	 * @returns BasicSourceMapConsumer
+  	 */BasicSourceMapConsumer.fromSourceMap=function SourceMapConsumer_fromSourceMap(aSourceMap,aSourceMapURL){var smc=Object.create(BasicSourceMapConsumer.prototype);var names=smc._names=ArraySet$2.fromArray(aSourceMap._names.toArray(),true);var sources=smc._sources=ArraySet$2.fromArray(aSourceMap._sources.toArray(),true);smc.sourceRoot=aSourceMap._sourceRoot;smc.sourcesContent=aSourceMap._generateSourcesContent(smc._sources.toArray(),smc.sourceRoot);smc.file=aSourceMap._file;smc._sourceMapURL=aSourceMapURL;smc._absoluteSources=smc._sources.toArray().map(function(s){return util.computeSourceURL(smc.sourceRoot,s,aSourceMapURL);});// Because we are modifying the entries (by converting string sources and
+  // names to indices into the sources and names ArraySets), we have to make
+  // a copy of the entry or else bad things happen. Shared mutable state
+  // strikes again! See github issue #191.
+  var generatedMappings=aSourceMap._mappings.toArray().slice();var destGeneratedMappings=smc.__generatedMappings=[];var destOriginalMappings=smc.__originalMappings=[];for(var i=0,length=generatedMappings.length;i<length;i++){var srcMapping=generatedMappings[i];var destMapping=new Mapping();destMapping.generatedLine=srcMapping.generatedLine;destMapping.generatedColumn=srcMapping.generatedColumn;if(srcMapping.source){destMapping.source=sources.indexOf(srcMapping.source);destMapping.originalLine=srcMapping.originalLine;destMapping.originalColumn=srcMapping.originalColumn;if(srcMapping.name){destMapping.name=names.indexOf(srcMapping.name);}destOriginalMappings.push(destMapping);}destGeneratedMappings.push(destMapping);}quickSort$1(smc.__originalMappings,util.compareByOriginalPositions);return smc;};/**
+  	 * The version of the source mapping spec that we are consuming.
+  	 */BasicSourceMapConsumer.prototype._version=3;/**
+  	 * The list of original sources.
+  	 */Object.defineProperty(BasicSourceMapConsumer.prototype,'sources',{get:function get(){return this._absoluteSources.slice();}});/**
+  	 * Provide the JIT with a nice shape / hidden class.
+  	 */function Mapping(){this.generatedLine=0;this.generatedColumn=0;this.source=null;this.originalLine=null;this.originalColumn=null;this.name=null;}/**
+  	 * Parse the mappings in a string in to a data structure which we can easily
+  	 * query (the ordered arrays in the `this.__generatedMappings` and
+  	 * `this.__originalMappings` properties).
+  	 */BasicSourceMapConsumer.prototype._parseMappings=function SourceMapConsumer_parseMappings(aStr,aSourceRoot){var generatedLine=1;var previousGeneratedColumn=0;var previousOriginalLine=0;var previousOriginalColumn=0;var previousSource=0;var previousName=0;var length=aStr.length;var index=0;var cachedSegments={};var temp={};var originalMappings=[];var generatedMappings=[];var mapping,str,segment,end,value;while(index<length){if(aStr.charAt(index)===';'){generatedLine++;index++;previousGeneratedColumn=0;}else if(aStr.charAt(index)===','){index++;}else{mapping=new Mapping();mapping.generatedLine=generatedLine;// Because each offset is encoded relative to the previous one,
+  // many segments often have the same encoding. We can exploit this
+  // fact by caching the parsed variable length fields of each segment,
+  // allowing us to avoid a second parse if we encounter the same
+  // segment again.
+  for(end=index;end<length;end++){if(this._charIsMappingSeparator(aStr,end)){break;}}str=aStr.slice(index,end);segment=cachedSegments[str];if(segment){index+=str.length;}else{segment=[];while(index<end){base64Vlq.decode(aStr,index,temp);value=temp.value;index=temp.rest;segment.push(value);}if(segment.length===2){throw new Error('Found a source, but no line and column');}if(segment.length===3){throw new Error('Found a source and line, but no column');}cachedSegments[str]=segment;}// Generated column.
+  mapping.generatedColumn=previousGeneratedColumn+segment[0];previousGeneratedColumn=mapping.generatedColumn;if(segment.length>1){// Original source.
+  mapping.source=previousSource+segment[1];previousSource+=segment[1];// Original line.
+  mapping.originalLine=previousOriginalLine+segment[2];previousOriginalLine=mapping.originalLine;// Lines are stored 0-based
+  mapping.originalLine+=1;// Original column.
+  mapping.originalColumn=previousOriginalColumn+segment[3];previousOriginalColumn=mapping.originalColumn;if(segment.length>4){// Original name.
+  mapping.name=previousName+segment[4];previousName+=segment[4];}}generatedMappings.push(mapping);if(typeof mapping.originalLine==='number'){originalMappings.push(mapping);}}}quickSort$1(generatedMappings,util.compareByGeneratedPositionsDeflated);this.__generatedMappings=generatedMappings;quickSort$1(originalMappings,util.compareByOriginalPositions);this.__originalMappings=originalMappings;};/**
+  	 * Find the mapping that best matches the hypothetical "needle" mapping that
+  	 * we are searching for in the given "haystack" of mappings.
+  	 */BasicSourceMapConsumer.prototype._findMapping=function SourceMapConsumer_findMapping(aNeedle,aMappings,aLineName,aColumnName,aComparator,aBias){// To return the position we are searching for, we must first find the
+  // mapping for the given position and then return the opposite position it
+  // points to. Because the mappings are sorted, we can use binary search to
+  // find the best mapping.
+  if(aNeedle[aLineName]<=0){throw new TypeError('Line must be greater than or equal to 1, got '+aNeedle[aLineName]);}if(aNeedle[aColumnName]<0){throw new TypeError('Column must be greater than or equal to 0, got '+aNeedle[aColumnName]);}return binarySearch.search(aNeedle,aMappings,aComparator,aBias);};/**
+  	 * Compute the last column for each generated mapping. The last column is
+  	 * inclusive.
+  	 */BasicSourceMapConsumer.prototype.computeColumnSpans=function SourceMapConsumer_computeColumnSpans(){for(var index=0;index<this._generatedMappings.length;++index){var mapping=this._generatedMappings[index];// Mappings do not contain a field for the last generated columnt. We
+  // can come up with an optimistic estimate, however, by assuming that
+  // mappings are contiguous (i.e. given two consecutive mappings, the
+  // first mapping ends where the second one starts).
+  if(index+1<this._generatedMappings.length){var nextMapping=this._generatedMappings[index+1];if(mapping.generatedLine===nextMapping.generatedLine){mapping.lastGeneratedColumn=nextMapping.generatedColumn-1;continue;}}// The last mapping for each line spans the entire line.
+  mapping.lastGeneratedColumn=Infinity;}};/**
+  	 * Returns the original source, line, and column information for the generated
+  	 * source's line and column positions provided. The only argument is an object
+  	 * with the following properties:
+  	 *
+  	 *   - line: The line number in the generated source.  The line number
+  	 *     is 1-based.
+  	 *   - column: The column number in the generated source.  The column
+  	 *     number is 0-based.
+  	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+  	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+  	 *
+  	 * and an object is returned with the following properties:
+  	 *
+  	 *   - source: The original source file, or null.
+  	 *   - line: The line number in the original source, or null.  The
+  	 *     line number is 1-based.
+  	 *   - column: The column number in the original source, or null.  The
+  	 *     column number is 0-based.
+  	 *   - name: The original identifier, or null.
+  	 */BasicSourceMapConsumer.prototype.originalPositionFor=function SourceMapConsumer_originalPositionFor(aArgs){var needle={generatedLine:util.getArg(aArgs,'line'),generatedColumn:util.getArg(aArgs,'column')};var index=this._findMapping(needle,this._generatedMappings,"generatedLine","generatedColumn",util.compareByGeneratedPositionsDeflated,util.getArg(aArgs,'bias',SourceMapConsumer.GREATEST_LOWER_BOUND));if(index>=0){var mapping=this._generatedMappings[index];if(mapping.generatedLine===needle.generatedLine){var source=util.getArg(mapping,'source',null);if(source!==null){source=this._sources.at(source);source=util.computeSourceURL(this.sourceRoot,source,this._sourceMapURL);}var name=util.getArg(mapping,'name',null);if(name!==null){name=this._names.at(name);}return {source:source,line:util.getArg(mapping,'originalLine',null),column:util.getArg(mapping,'originalColumn',null),name:name};}}return {source:null,line:null,column:null,name:null};};/**
+  	 * Return true if we have the source content for every source in the source
+  	 * map, false otherwise.
+  	 */BasicSourceMapConsumer.prototype.hasContentsOfAllSources=function BasicSourceMapConsumer_hasContentsOfAllSources(){if(!this.sourcesContent){return false;}return this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(sc){return sc==null;});};/**
+  	 * Returns the original source content. The only argument is the url of the
+  	 * original source file. Returns null if no original source content is
+  	 * available.
+  	 */BasicSourceMapConsumer.prototype.sourceContentFor=function SourceMapConsumer_sourceContentFor(aSource,nullOnMissing){if(!this.sourcesContent){return null;}var index=this._findSourceIndex(aSource);if(index>=0){return this.sourcesContent[index];}var relativeSource=aSource;if(this.sourceRoot!=null){relativeSource=util.relative(this.sourceRoot,relativeSource);}var url;if(this.sourceRoot!=null&&(url=util.urlParse(this.sourceRoot))){// XXX: file:// URIs and absolute paths lead to unexpected behavior for
+  // many users. We can help them out when they expect file:// URIs to
+  // behave like it would if they were running a local HTTP server. See
+  // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+  var fileUriAbsPath=relativeSource.replace(/^file:\/\//,"");if(url.scheme=="file"&&this._sources.has(fileUriAbsPath)){return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];}if((!url.path||url.path=="/")&&this._sources.has("/"+relativeSource)){return this.sourcesContent[this._sources.indexOf("/"+relativeSource)];}}// This function is used recursively from
+  // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+  // don't want to throw if we can't find the source - we just want to
+  // return null, so we provide a flag to exit gracefully.
+  if(nullOnMissing){return null;}else{throw new Error('"'+relativeSource+'" is not in the SourceMap.');}};/**
+  	 * Returns the generated line and column information for the original source,
+  	 * line, and column positions provided. The only argument is an object with
+  	 * the following properties:
+  	 *
+  	 *   - source: The filename of the original source.
+  	 *   - line: The line number in the original source.  The line number
+  	 *     is 1-based.
+  	 *   - column: The column number in the original source.  The column
+  	 *     number is 0-based.
+  	 *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+  	 *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+  	 *
+  	 * and an object is returned with the following properties:
+  	 *
+  	 *   - line: The line number in the generated source, or null.  The
+  	 *     line number is 1-based.
+  	 *   - column: The column number in the generated source, or null.
+  	 *     The column number is 0-based.
+  	 */BasicSourceMapConsumer.prototype.generatedPositionFor=function SourceMapConsumer_generatedPositionFor(aArgs){var source=util.getArg(aArgs,'source');source=this._findSourceIndex(source);if(source<0){return {line:null,column:null,lastColumn:null};}var needle={source:source,originalLine:util.getArg(aArgs,'line'),originalColumn:util.getArg(aArgs,'column')};var index=this._findMapping(needle,this._originalMappings,"originalLine","originalColumn",util.compareByOriginalPositions,util.getArg(aArgs,'bias',SourceMapConsumer.GREATEST_LOWER_BOUND));if(index>=0){var mapping=this._originalMappings[index];if(mapping.source===needle.source){return {line:util.getArg(mapping,'generatedLine',null),column:util.getArg(mapping,'generatedColumn',null),lastColumn:util.getArg(mapping,'lastGeneratedColumn',null)};}}return {line:null,column:null,lastColumn:null};};var BasicSourceMapConsumer_1=BasicSourceMapConsumer;/**
+  	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+  	 * we can query for information. It differs from BasicSourceMapConsumer in
+  	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+  	 * input.
+  	 *
+  	 * The first parameter is a raw source map (either as a JSON string, or already
+  	 * parsed to an object). According to the spec for indexed source maps, they
+  	 * have the following attributes:
+  	 *
+  	 *   - version: Which version of the source map spec this map is following.
+  	 *   - file: Optional. The generated file this source map is associated with.
+  	 *   - sections: A list of section definitions.
+  	 *
+  	 * Each value under the "sections" field has two fields:
+  	 *   - offset: The offset into the original specified at which this section
+  	 *       begins to apply, defined as an object with a "line" and "column"
+  	 *       field.
+  	 *   - map: A source map definition. This source map could also be indexed,
+  	 *       but doesn't have to be.
+  	 *
+  	 * Instead of the "map" field, it's also possible to have a "url" field
+  	 * specifying a URL to retrieve a source map from, but that's currently
+  	 * unsupported.
+  	 *
+  	 * Here's an example source map, taken from the source map spec[0], but
+  	 * modified to omit a section which uses the "url" field.
+  	 *
+  	 *  {
+  	 *    version : 3,
+  	 *    file: "app.js",
+  	 *    sections: [{
+  	 *      offset: {line:100, column:10},
+  	 *      map: {
+  	 *        version : 3,
+  	 *        file: "section.js",
+  	 *        sources: ["foo.js", "bar.js"],
+  	 *        names: ["src", "maps", "are", "fun"],
+  	 *        mappings: "AAAA,E;;ABCDE;"
+  	 *      }
+  	 *    }],
+  	 *  }
+  	 *
+  	 * The second parameter, if given, is a string whose value is the URL
+  	 * at which the source map was found.  This URL is used to compute the
+  	 * sources array.
+  	 *
+  	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+  	 */function IndexedSourceMapConsumer(aSourceMap,aSourceMapURL){var sourceMap=aSourceMap;if(typeof aSourceMap==='string'){sourceMap=util.parseSourceMapInput(aSourceMap);}var version=util.getArg(sourceMap,'version');var sections=util.getArg(sourceMap,'sections');if(version!=this._version){throw new Error('Unsupported version: '+version);}this._sources=new ArraySet$2();this._names=new ArraySet$2();var lastOffset={line:-1,column:0};this._sections=sections.map(function(s){if(s.url){// The url field will require support for asynchronicity.
+  // See https://github.com/mozilla/source-map/issues/16
+  throw new Error('Support for url field in sections not implemented.');}var offset=util.getArg(s,'offset');var offsetLine=util.getArg(offset,'line');var offsetColumn=util.getArg(offset,'column');if(offsetLine<lastOffset.line||offsetLine===lastOffset.line&&offsetColumn<lastOffset.column){throw new Error('Section offsets must be ordered and non-overlapping.');}lastOffset=offset;return {generatedOffset:{// The offset fields are 0-based, but we use 1-based indices when
+  // encoding/decoding from VLQ.
+  generatedLine:offsetLine+1,generatedColumn:offsetColumn+1},consumer:new SourceMapConsumer(util.getArg(s,'map'),aSourceMapURL)};});}IndexedSourceMapConsumer.prototype=Object.create(SourceMapConsumer.prototype);IndexedSourceMapConsumer.prototype.constructor=SourceMapConsumer;/**
+  	 * The version of the source mapping spec that we are consuming.
+  	 */IndexedSourceMapConsumer.prototype._version=3;/**
+  	 * The list of original sources.
+  	 */Object.defineProperty(IndexedSourceMapConsumer.prototype,'sources',{get:function get(){var sources=[];for(var i=0;i<this._sections.length;i++){for(var j=0;j<this._sections[i].consumer.sources.length;j++){sources.push(this._sections[i].consumer.sources[j]);}}return sources;}});/**
+  	 * Returns the original source, line, and column information for the generated
+  	 * source's line and column positions provided. The only argument is an object
+  	 * with the following properties:
+  	 *
+  	 *   - line: The line number in the generated source.  The line number
+  	 *     is 1-based.
+  	 *   - column: The column number in the generated source.  The column
+  	 *     number is 0-based.
+  	 *
+  	 * and an object is returned with the following properties:
+  	 *
+  	 *   - source: The original source file, or null.
+  	 *   - line: The line number in the original source, or null.  The
+  	 *     line number is 1-based.
+  	 *   - column: The column number in the original source, or null.  The
+  	 *     column number is 0-based.
+  	 *   - name: The original identifier, or null.
+  	 */IndexedSourceMapConsumer.prototype.originalPositionFor=function IndexedSourceMapConsumer_originalPositionFor(aArgs){var needle={generatedLine:util.getArg(aArgs,'line'),generatedColumn:util.getArg(aArgs,'column')};// Find the section containing the generated position we're trying to map
+  // to an original position.
+  var sectionIndex=binarySearch.search(needle,this._sections,function(needle,section){var cmp=needle.generatedLine-section.generatedOffset.generatedLine;if(cmp){return cmp;}return needle.generatedColumn-section.generatedOffset.generatedColumn;});var section=this._sections[sectionIndex];if(!section){return {source:null,line:null,column:null,name:null};}return section.consumer.originalPositionFor({line:needle.generatedLine-(section.generatedOffset.generatedLine-1),column:needle.generatedColumn-(section.generatedOffset.generatedLine===needle.generatedLine?section.generatedOffset.generatedColumn-1:0),bias:aArgs.bias});};/**
+  	 * Return true if we have the source content for every source in the source
+  	 * map, false otherwise.
+  	 */IndexedSourceMapConsumer.prototype.hasContentsOfAllSources=function IndexedSourceMapConsumer_hasContentsOfAllSources(){return this._sections.every(function(s){return s.consumer.hasContentsOfAllSources();});};/**
+  	 * Returns the original source content. The only argument is the url of the
+  	 * original source file. Returns null if no original source content is
+  	 * available.
+  	 */IndexedSourceMapConsumer.prototype.sourceContentFor=function IndexedSourceMapConsumer_sourceContentFor(aSource,nullOnMissing){for(var i=0;i<this._sections.length;i++){var section=this._sections[i];var content=section.consumer.sourceContentFor(aSource,true);if(content){return content;}}if(nullOnMissing){return null;}else{throw new Error('"'+aSource+'" is not in the SourceMap.');}};/**
+  	 * Returns the generated line and column information for the original source,
+  	 * line, and column positions provided. The only argument is an object with
+  	 * the following properties:
+  	 *
+  	 *   - source: The filename of the original source.
+  	 *   - line: The line number in the original source.  The line number
+  	 *     is 1-based.
+  	 *   - column: The column number in the original source.  The column
+  	 *     number is 0-based.
+  	 *
+  	 * and an object is returned with the following properties:
+  	 *
+  	 *   - line: The line number in the generated source, or null.  The
+  	 *     line number is 1-based. 
+  	 *   - column: The column number in the generated source, or null.
+  	 *     The column number is 0-based.
+  	 */IndexedSourceMapConsumer.prototype.generatedPositionFor=function IndexedSourceMapConsumer_generatedPositionFor(aArgs){for(var i=0;i<this._sections.length;i++){var section=this._sections[i];// Only consider this section if the requested source is in the list of
+  // sources of the consumer.
+  if(section.consumer._findSourceIndex(util.getArg(aArgs,'source'))===-1){continue;}var generatedPosition=section.consumer.generatedPositionFor(aArgs);if(generatedPosition){var ret={line:generatedPosition.line+(section.generatedOffset.generatedLine-1),column:generatedPosition.column+(section.generatedOffset.generatedLine===generatedPosition.line?section.generatedOffset.generatedColumn-1:0)};return ret;}}return {line:null,column:null};};/**
+  	 * Parse the mappings in a string in to a data structure which we can easily
+  	 * query (the ordered arrays in the `this.__generatedMappings` and
+  	 * `this.__originalMappings` properties).
+  	 */IndexedSourceMapConsumer.prototype._parseMappings=function IndexedSourceMapConsumer_parseMappings(aStr,aSourceRoot){this.__generatedMappings=[];this.__originalMappings=[];for(var i=0;i<this._sections.length;i++){var section=this._sections[i];var sectionMappings=section.consumer._generatedMappings;for(var j=0;j<sectionMappings.length;j++){var mapping=sectionMappings[j];var source=section.consumer._sources.at(mapping.source);source=util.computeSourceURL(section.consumer.sourceRoot,source,this._sourceMapURL);this._sources.add(source);source=this._sources.indexOf(source);var name=null;if(mapping.name){name=section.consumer._names.at(mapping.name);this._names.add(name);name=this._names.indexOf(name);}// The mappings coming from the consumer for the section have
+  // generated positions relative to the start of the section, so we
+  // need to offset them to be relative to the start of the concatenated
+  // generated file.
+  var adjustedMapping={source:source,generatedLine:mapping.generatedLine+(section.generatedOffset.generatedLine-1),generatedColumn:mapping.generatedColumn+(section.generatedOffset.generatedLine===mapping.generatedLine?section.generatedOffset.generatedColumn-1:0),originalLine:mapping.originalLine,originalColumn:mapping.originalColumn,name:name};this.__generatedMappings.push(adjustedMapping);if(typeof adjustedMapping.originalLine==='number'){this.__originalMappings.push(adjustedMapping);}}}quickSort$1(this.__generatedMappings,util.compareByGeneratedPositionsDeflated);quickSort$1(this.__originalMappings,util.compareByOriginalPositions);};var IndexedSourceMapConsumer_1=IndexedSourceMapConsumer;var sourceMapConsumer={SourceMapConsumer:SourceMapConsumer_1,BasicSourceMapConsumer:BasicSourceMapConsumer_1,IndexedSourceMapConsumer:IndexedSourceMapConsumer_1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var SourceMapGenerator$1=sourceMapGenerator.SourceMapGenerator;// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+  // operating systems these days (capturing the result).
+  var REGEX_NEWLINE=/(\r?\n)/;// Newline character code for charCodeAt() comparisons
+  var NEWLINE_CODE=10;// Private symbol for identifying `SourceNode`s when multiple versions of
+  // the source-map library are loaded. This MUST NOT CHANGE across
+  // versions!
+  var isSourceNode="$$$isSourceNode$$$";/**
+  	 * SourceNodes provide a way to abstract over interpolating/concatenating
+  	 * snippets of generated JavaScript source code while maintaining the line and
+  	 * column information associated with the original source code.
+  	 *
+  	 * @param aLine The original line number.
+  	 * @param aColumn The original column number.
+  	 * @param aSource The original source's filename.
+  	 * @param aChunks Optional. An array of strings which are snippets of
+  	 *        generated JS, or other SourceNodes.
+  	 * @param aName The original identifier.
+  	 */function SourceNode(aLine,aColumn,aSource,aChunks,aName){this.children=[];this.sourceContents={};this.line=aLine==null?null:aLine;this.column=aColumn==null?null:aColumn;this.source=aSource==null?null:aSource;this.name=aName==null?null:aName;this[isSourceNode]=true;if(aChunks!=null)this.add(aChunks);}/**
+  	 * Creates a SourceNode from generated code and a SourceMapConsumer.
+  	 *
+  	 * @param aGeneratedCode The generated code
+  	 * @param aSourceMapConsumer The SourceMap for the generated code
+  	 * @param aRelativePath Optional. The path that relative sources in the
+  	 *        SourceMapConsumer should be relative to.
+  	 */SourceNode.fromStringWithSourceMap=function SourceNode_fromStringWithSourceMap(aGeneratedCode,aSourceMapConsumer,aRelativePath){// The SourceNode we want to fill with the generated code
+  // and the SourceMap
+  var node=new SourceNode();// All even indices of this array are one line of the generated code,
+  // while all odd indices are the newlines between two adjacent lines
+  // (since `REGEX_NEWLINE` captures its match).
+  // Processed fragments are accessed by calling `shiftNextLine`.
+  var remainingLines=aGeneratedCode.split(REGEX_NEWLINE);var remainingLinesIndex=0;var shiftNextLine=function shiftNextLine(){var lineContents=getNextLine();// The last line of a file might not have a newline.
+  var newLine=getNextLine()||"";return lineContents+newLine;function getNextLine(){return remainingLinesIndex<remainingLines.length?remainingLines[remainingLinesIndex++]:undefined;}};// We need to remember the position of "remainingLines"
+  var lastGeneratedLine=1,lastGeneratedColumn=0;// The generate SourceNodes we need a code range.
+  // To extract it current and last mapping is used.
+  // Here we store the last mapping.
+  var lastMapping=null;aSourceMapConsumer.eachMapping(function(mapping){if(lastMapping!==null){// We add the code from "lastMapping" to "mapping":
+  // First check if there is a new line in between.
+  if(lastGeneratedLine<mapping.generatedLine){// Associate first line with "lastMapping"
+  addMappingWithCode(lastMapping,shiftNextLine());lastGeneratedLine++;lastGeneratedColumn=0;// The remaining code is added without mapping
+  }else{// There is no new line in between.
+  // Associate the code between "lastGeneratedColumn" and
+  // "mapping.generatedColumn" with "lastMapping"
+  var nextLine=remainingLines[remainingLinesIndex]||'';var code=nextLine.substr(0,mapping.generatedColumn-lastGeneratedColumn);remainingLines[remainingLinesIndex]=nextLine.substr(mapping.generatedColumn-lastGeneratedColumn);lastGeneratedColumn=mapping.generatedColumn;addMappingWithCode(lastMapping,code);// No more remaining code, continue
+  lastMapping=mapping;return;}}// We add the generated code until the first mapping
+  // to the SourceNode without any mapping.
+  // Each line is added as separate string.
+  while(lastGeneratedLine<mapping.generatedLine){node.add(shiftNextLine());lastGeneratedLine++;}if(lastGeneratedColumn<mapping.generatedColumn){var nextLine=remainingLines[remainingLinesIndex]||'';node.add(nextLine.substr(0,mapping.generatedColumn));remainingLines[remainingLinesIndex]=nextLine.substr(mapping.generatedColumn);lastGeneratedColumn=mapping.generatedColumn;}lastMapping=mapping;},this);// We have processed all mappings.
+  if(remainingLinesIndex<remainingLines.length){if(lastMapping){// Associate the remaining code in the current line with "lastMapping"
+  addMappingWithCode(lastMapping,shiftNextLine());}// and add the remaining lines without any mapping
+  node.add(remainingLines.splice(remainingLinesIndex).join(""));}// Copy sourcesContent into SourceNode
+  aSourceMapConsumer.sources.forEach(function(sourceFile){var content=aSourceMapConsumer.sourceContentFor(sourceFile);if(content!=null){if(aRelativePath!=null){sourceFile=util.join(aRelativePath,sourceFile);}node.setSourceContent(sourceFile,content);}});return node;function addMappingWithCode(mapping,code){if(mapping===null||mapping.source===undefined){node.add(code);}else{var source=aRelativePath?util.join(aRelativePath,mapping.source):mapping.source;node.add(new SourceNode(mapping.originalLine,mapping.originalColumn,source,code,mapping.name));}}};/**
+  	 * Add a chunk of generated JS to this source node.
+  	 *
+  	 * @param aChunk A string snippet of generated JS code, another instance of
+  	 *        SourceNode, or an array where each member is one of those things.
+  	 */SourceNode.prototype.add=function SourceNode_add(aChunk){if(Array.isArray(aChunk)){aChunk.forEach(function(chunk){this.add(chunk);},this);}else if(aChunk[isSourceNode]||typeof aChunk==="string"){if(aChunk){this.children.push(aChunk);}}else{throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+aChunk);}return this;};/**
+  	 * Add a chunk of generated JS to the beginning of this source node.
+  	 *
+  	 * @param aChunk A string snippet of generated JS code, another instance of
+  	 *        SourceNode, or an array where each member is one of those things.
+  	 */SourceNode.prototype.prepend=function SourceNode_prepend(aChunk){if(Array.isArray(aChunk)){for(var i=aChunk.length-1;i>=0;i--){this.prepend(aChunk[i]);}}else if(aChunk[isSourceNode]||typeof aChunk==="string"){this.children.unshift(aChunk);}else{throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+aChunk);}return this;};/**
+  	 * Walk over the tree of JS snippets in this node and its children. The
+  	 * walking function is called once for each snippet of JS and is passed that
+  	 * snippet and the its original associated source's line/column location.
+  	 *
+  	 * @param aFn The traversal function.
+  	 */SourceNode.prototype.walk=function SourceNode_walk(aFn){var chunk;for(var i=0,len=this.children.length;i<len;i++){chunk=this.children[i];if(chunk[isSourceNode]){chunk.walk(aFn);}else{if(chunk!==''){aFn(chunk,{source:this.source,line:this.line,column:this.column,name:this.name});}}}};/**
+  	 * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+  	 * each of `this.children`.
+  	 *
+  	 * @param aSep The separator.
+  	 */SourceNode.prototype.join=function SourceNode_join(aSep){var newChildren;var i;var len=this.children.length;if(len>0){newChildren=[];for(i=0;i<len-1;i++){newChildren.push(this.children[i]);newChildren.push(aSep);}newChildren.push(this.children[i]);this.children=newChildren;}return this;};/**
+  	 * Call String.prototype.replace on the very right-most source snippet. Useful
+  	 * for trimming whitespace from the end of a source node, etc.
+  	 *
+  	 * @param aPattern The pattern to replace.
+  	 * @param aReplacement The thing to replace the pattern with.
+  	 */SourceNode.prototype.replaceRight=function SourceNode_replaceRight(aPattern,aReplacement){var lastChild=this.children[this.children.length-1];if(lastChild[isSourceNode]){lastChild.replaceRight(aPattern,aReplacement);}else if(typeof lastChild==='string'){this.children[this.children.length-1]=lastChild.replace(aPattern,aReplacement);}else{this.children.push(''.replace(aPattern,aReplacement));}return this;};/**
+  	 * Set the source content for a source file. This will be added to the SourceMapGenerator
+  	 * in the sourcesContent field.
+  	 *
+  	 * @param aSourceFile The filename of the source file
+  	 * @param aSourceContent The content of the source file
+  	 */SourceNode.prototype.setSourceContent=function SourceNode_setSourceContent(aSourceFile,aSourceContent){this.sourceContents[util.toSetString(aSourceFile)]=aSourceContent;};/**
+  	 * Walk over the tree of SourceNodes. The walking function is called for each
+  	 * source file content and is passed the filename and source content.
+  	 *
+  	 * @param aFn The traversal function.
+  	 */SourceNode.prototype.walkSourceContents=function SourceNode_walkSourceContents(aFn){for(var i=0,len=this.children.length;i<len;i++){if(this.children[i][isSourceNode]){this.children[i].walkSourceContents(aFn);}}var sources=Object.keys(this.sourceContents);for(var i=0,len=sources.length;i<len;i++){aFn(util.fromSetString(sources[i]),this.sourceContents[sources[i]]);}};/**
+  	 * Return the string representation of this source node. Walks over the tree
+  	 * and concatenates all the various snippets together to one string.
+  	 */SourceNode.prototype.toString=function SourceNode_toString(){var str="";this.walk(function(chunk){str+=chunk;});return str;};/**
+  	 * Returns the string representation of this source node along with a source
+  	 * map.
+  	 */SourceNode.prototype.toStringWithSourceMap=function SourceNode_toStringWithSourceMap(aArgs){var generated={code:"",line:1,column:0};var map=new SourceMapGenerator$1(aArgs);var sourceMappingActive=false;var lastOriginalSource=null;var lastOriginalLine=null;var lastOriginalColumn=null;var lastOriginalName=null;this.walk(function(chunk,original){generated.code+=chunk;if(original.source!==null&&original.line!==null&&original.column!==null){if(lastOriginalSource!==original.source||lastOriginalLine!==original.line||lastOriginalColumn!==original.column||lastOriginalName!==original.name){map.addMapping({source:original.source,original:{line:original.line,column:original.column},generated:{line:generated.line,column:generated.column},name:original.name});}lastOriginalSource=original.source;lastOriginalLine=original.line;lastOriginalColumn=original.column;lastOriginalName=original.name;sourceMappingActive=true;}else if(sourceMappingActive){map.addMapping({generated:{line:generated.line,column:generated.column}});lastOriginalSource=null;sourceMappingActive=false;}for(var idx=0,length=chunk.length;idx<length;idx++){if(chunk.charCodeAt(idx)===NEWLINE_CODE){generated.line++;generated.column=0;// Mappings end at eol
+  if(idx+1===length){lastOriginalSource=null;sourceMappingActive=false;}else if(sourceMappingActive){map.addMapping({source:original.source,original:{line:original.line,column:original.column},generated:{line:generated.line,column:generated.column},name:original.name});}}else{generated.column++;}}});this.walkSourceContents(function(sourceFile,sourceContent){map.setSourceContent(sourceFile,sourceContent);});return {code:generated.code,map:map};};var SourceNode_1=SourceNode;var sourceNode={SourceNode:SourceNode_1};/*
+  	 * Copyright 2009-2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE.txt or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var SourceMapGenerator$2=sourceMapGenerator.SourceMapGenerator;var SourceMapConsumer$1=sourceMapConsumer.SourceMapConsumer;var SourceNode$1=sourceNode.SourceNode;var sourceMap={SourceMapGenerator:SourceMapGenerator$2,SourceMapConsumer:SourceMapConsumer$1,SourceNode:SourceNode$1};var util$1=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var types=__importStar(main);var n=types.namedTypes;var source_map_1=__importDefault(sourceMap);var SourceMapConsumer=source_map_1.default.SourceMapConsumer;var SourceMapGenerator=source_map_1.default.SourceMapGenerator;var hasOwn=Object.prototype.hasOwnProperty;function getOption(options,key,defaultValue){if(options&&hasOwn.call(options,key)){return options[key];}return defaultValue;}exports.getOption=getOption;function getUnionOfKeys(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var result={};var argc=args.length;for(var i=0;i<argc;++i){var keys=Object.keys(args[i]);var keyCount=keys.length;for(var j=0;j<keyCount;++j){result[keys[j]]=true;}}return result;}exports.getUnionOfKeys=getUnionOfKeys;function comparePos(pos1,pos2){return pos1.line-pos2.line||pos1.column-pos2.column;}exports.comparePos=comparePos;function copyPos(pos){return {line:pos.line,column:pos.column};}exports.copyPos=copyPos;function composeSourceMaps(formerMap,latterMap){if(formerMap){if(!latterMap){return formerMap;}}else{return latterMap||null;}var smcFormer=new SourceMapConsumer(formerMap);var smcLatter=new SourceMapConsumer(latterMap);var smg=new SourceMapGenerator({file:latterMap.file,sourceRoot:latterMap.sourceRoot});var sourcesToContents={};smcLatter.eachMapping(function(mapping){var origPos=smcFormer.originalPositionFor({line:mapping.originalLine,column:mapping.originalColumn});var sourceName=origPos.source;if(sourceName===null){return;}smg.addMapping({source:sourceName,original:copyPos(origPos),generated:{line:mapping.generatedLine,column:mapping.generatedColumn},name:mapping.name});var sourceContent=smcFormer.sourceContentFor(sourceName);if(sourceContent&&!hasOwn.call(sourcesToContents,sourceName)){sourcesToContents[sourceName]=sourceContent;smg.setSourceContent(sourceName,sourceContent);}});return smg.toJSON();}exports.composeSourceMaps=composeSourceMaps;function getTrueLoc(node,lines){// It's possible that node is newly-created (not parsed by Esprima),
+  // in which case it probably won't have a .loc property (or an
+  // .original property for that matter). That's fine; we'll just
+  // pretty-print it as usual.
+  if(!node.loc){return null;}var result={start:node.loc.start,end:node.loc.end};function include(node){expandLoc(result,node.loc);}// If the node is an export declaration and its .declaration has any
+  // decorators, their locations might contribute to the true start/end
+  // positions of the export declaration node.
+  if(node.declaration&&node.declaration.decorators&&isExportDeclaration(node)){node.declaration.decorators.forEach(include);}if(comparePos(result.start,result.end)<0){// Trim leading whitespace.
+  result.start=copyPos(result.start);lines.skipSpaces(result.start,false,true);if(comparePos(result.start,result.end)<0){// Trim trailing whitespace, if the end location is not already the
+  // same as the start location.
+  result.end=copyPos(result.end);lines.skipSpaces(result.end,true,true);}}// If the node has any comments, their locations might contribute to
+  // the true start/end positions of the node.
+  if(node.comments){node.comments.forEach(include);}return result;}exports.getTrueLoc=getTrueLoc;function expandLoc(parentLoc,childLoc){if(parentLoc&&childLoc){if(comparePos(childLoc.start,parentLoc.start)<0){parentLoc.start=childLoc.start;}if(comparePos(parentLoc.end,childLoc.end)<0){parentLoc.end=childLoc.end;}}}function fixFaultyLocations(node,lines){var loc=node.loc;if(loc){if(loc.start.line<1){loc.start.line=1;}if(loc.end.line<1){loc.end.line=1;}}if(node.type==="File"){// Babylon returns File nodes whose .loc.{start,end} do not include
+  // leading or trailing whitespace.
+  loc.start=lines.firstPos();loc.end=lines.lastPos();}fixForLoopHead(node,lines);fixTemplateLiteral(node,lines);if(loc&&node.decorators){// Expand the .loc of the node responsible for printing the decorators
+  // (here, the decorated node) so that it includes node.decorators.
+  node.decorators.forEach(function(decorator){expandLoc(loc,decorator.loc);});}else if(node.declaration&&isExportDeclaration(node)){// Nullify .loc information for the child declaration so that we never
+  // try to reprint it without also reprinting the export declaration.
+  node.declaration.loc=null;// Expand the .loc of the node responsible for printing the decorators
+  // (here, the export declaration) so that it includes node.decorators.
+  var decorators=node.declaration.decorators;if(decorators){decorators.forEach(function(decorator){expandLoc(loc,decorator.loc);});}}else if(n.MethodDefinition&&n.MethodDefinition.check(node)||n.Property.check(node)&&(node.method||node.shorthand)){// If the node is a MethodDefinition or a .method or .shorthand
+  // Property, then the location information stored in
+  // node.value.loc is very likely untrustworthy (just the {body}
+  // part of a method, or nothing in the case of shorthand
+  // properties), so we null out that information to prevent
+  // accidental reuse of bogus source code during reprinting.
+  node.value.loc=null;if(n.FunctionExpression.check(node.value)){// FunctionExpression method values should be anonymous,
+  // because their .id fields are ignored anyway.
+  node.value.id=null;}}else if(node.type==="ObjectTypeProperty"){var loc=node.loc;var end=loc&&loc.end;if(end){end=copyPos(end);if(lines.prevPos(end)&&lines.charAt(end)===","){// Some parsers accidentally include trailing commas in the
+  // .loc.end information for ObjectTypeProperty nodes.
+  if(end=lines.skipSpaces(end,true,true)){loc.end=end;}}}}}exports.fixFaultyLocations=fixFaultyLocations;function fixForLoopHead(node,lines){if(node.type!=="ForStatement"){return;}function fix(child){var loc=child&&child.loc;var start=loc&&loc.start;var end=loc&&copyPos(loc.end);while(start&&end&&comparePos(start,end)<0){lines.prevPos(end);if(lines.charAt(end)===";"){// Update child.loc.end to *exclude* the ';' character.
+  loc.end.line=end.line;loc.end.column=end.column;}else{break;}}}fix(node.init);fix(node.test);fix(node.update);}function fixTemplateLiteral(node,lines){if(node.type!=="TemplateLiteral"){return;}if(node.quasis.length===0){// If there are no quasi elements, then there is nothing to fix.
+  return;}// node.loc is not present when using export default with a template literal
+  if(node.loc){// First we need to exclude the opening ` from the .loc of the first
+  // quasi element, in case the parser accidentally decided to include it.
+  var afterLeftBackTickPos=copyPos(node.loc.start);assert_1.default.strictEqual(lines.charAt(afterLeftBackTickPos),"`");assert_1.default.ok(lines.nextPos(afterLeftBackTickPos));var firstQuasi=node.quasis[0];if(comparePos(firstQuasi.loc.start,afterLeftBackTickPos)<0){firstQuasi.loc.start=afterLeftBackTickPos;}// Next we need to exclude the closing ` from the .loc of the last quasi
+  // element, in case the parser accidentally decided to include it.
+  var rightBackTickPos=copyPos(node.loc.end);assert_1.default.ok(lines.prevPos(rightBackTickPos));assert_1.default.strictEqual(lines.charAt(rightBackTickPos),"`");var lastQuasi=node.quasis[node.quasis.length-1];if(comparePos(rightBackTickPos,lastQuasi.loc.end)<0){lastQuasi.loc.end=rightBackTickPos;}}// Now we need to exclude ${ and } characters from the .loc's of all
+  // quasi elements, since some parsers accidentally include them.
+  node.expressions.forEach(function(expr,i){// Rewind from expr.loc.start over any whitespace and the ${ that
+  // precedes the expression. The position of the $ should be the same
+  // as the .loc.end of the preceding quasi element, but some parsers
+  // accidentally include the ${ in the .loc of the quasi element.
+  var dollarCurlyPos=lines.skipSpaces(expr.loc.start,true,false);if(lines.prevPos(dollarCurlyPos)&&lines.charAt(dollarCurlyPos)==="{"&&lines.prevPos(dollarCurlyPos)&&lines.charAt(dollarCurlyPos)==="$"){var quasiBefore=node.quasis[i];if(comparePos(dollarCurlyPos,quasiBefore.loc.end)<0){quasiBefore.loc.end=dollarCurlyPos;}}// Likewise, some parsers accidentally include the } that follows
+  // the expression in the .loc of the following quasi element.
+  var rightCurlyPos=lines.skipSpaces(expr.loc.end,false,false);if(lines.charAt(rightCurlyPos)==="}"){assert_1.default.ok(lines.nextPos(rightCurlyPos));// Now rightCurlyPos is technically the position just after the }.
+  var quasiAfter=node.quasis[i+1];if(comparePos(quasiAfter.loc.start,rightCurlyPos)<0){quasiAfter.loc.start=rightCurlyPos;}}});}function isExportDeclaration(node){if(node)switch(node.type){case"ExportDeclaration":case"ExportDefaultDeclaration":case"ExportDefaultSpecifier":case"DeclareExportDeclaration":case"ExportNamedDeclaration":case"ExportAllDeclaration":return true;}return false;}exports.isExportDeclaration=isExportDeclaration;function getParentExportDeclaration(path){var parentNode=path.getParentNode();if(path.getName()==="declaration"&&isExportDeclaration(parentNode)){return parentNode;}return null;}exports.getParentExportDeclaration=getParentExportDeclaration;function isTrailingCommaEnabled(options,context){var trailingComma=options.trailingComma;if(typeof trailingComma==="object"){return !!trailingComma[context];}return !!trailingComma;}exports.isTrailingCommaEnabled=isTrailingCommaEnabled;});unwrapExports(util$1);var util_1$1=util$1.getOption;var util_2$1=util$1.getUnionOfKeys;var util_3$1=util$1.comparePos;var util_4$1=util$1.copyPos;var util_5$1=util$1.composeSourceMaps;var util_6$1=util$1.getTrueLoc;var util_7$1=util$1.fixFaultyLocations;var util_8$1=util$1.isExportDeclaration;var util_9$1=util$1.getParentExportDeclaration;var util_10$1=util$1.isTrailingCommaEnabled;var esprima$1=createCommonjsModule(function(module,exports){(function webpackUniversalModuleDefinition(root,factory){/* istanbul ignore next */module.exports=factory();})(this,function(){return(/******/function(modules){// webpackBootstrap
+  /******/ // The module cache
+  /******/var installedModules={};/******/ // The require function
+  /******/function __webpack_require__(moduleId){/******/ // Check if module is in cache
+  /* istanbul ignore if */ /******/if(installedModules[moduleId])/******/return installedModules[moduleId].exports;/******/ // Create a new module (and put it into the cache)
+  /******/var module=installedModules[moduleId]={/******/exports:{},/******/id:moduleId,/******/loaded:false/******/};/******/ // Execute the module function
+  /******/modules[moduleId].call(module.exports,module,module.exports,__webpack_require__);/******/ // Flag the module as loaded
+  /******/module.loaded=true;/******/ // Return the exports of the module
+  /******/return module.exports;/******/}/******/ // expose the modules object (__webpack_modules__)
+  /******/__webpack_require__.m=modules;/******/ // expose the module cache
+  /******/__webpack_require__.c=installedModules;/******/ // __webpack_public_path__
+  /******/__webpack_require__.p="";/******/ // Load entry module and return exports
+  /******/return __webpack_require__(0);/******/}(/************************************************************************/ /******/[/* 0 */ /***/function(module,exports,__webpack_require__){/*
+  		  Copyright JS Foundation and other contributors, https://js.foundation/
+
+  		  Redistribution and use in source and binary forms, with or without
+  		  modification, are permitted provided that the following conditions are met:
+
+  		    * Redistributions of source code must retain the above copyright
+  		      notice, this list of conditions and the following disclaimer.
+  		    * Redistributions in binary form must reproduce the above copyright
+  		      notice, this list of conditions and the following disclaimer in the
+  		      documentation and/or other materials provided with the distribution.
+
+  		  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  		  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  		  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  		  ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+  		  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+  		  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  		  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+  		  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  		  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+  		  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+  		*/Object.defineProperty(exports,"__esModule",{value:true});var comment_handler_1=__webpack_require__(1);var jsx_parser_1=__webpack_require__(3);var parser_1=__webpack_require__(8);var tokenizer_1=__webpack_require__(15);function parse(code,options,delegate){var commentHandler=null;var proxyDelegate=function proxyDelegate(node,metadata){if(delegate){delegate(node,metadata);}if(commentHandler){commentHandler.visit(node,metadata);}};var parserDelegate=typeof delegate==='function'?proxyDelegate:null;var collectComment=false;if(options){collectComment=typeof options.comment==='boolean'&&options.comment;var attachComment=typeof options.attachComment==='boolean'&&options.attachComment;if(collectComment||attachComment){commentHandler=new comment_handler_1.CommentHandler();commentHandler.attach=attachComment;options.comment=true;parserDelegate=proxyDelegate;}}var isModule=false;if(options&&typeof options.sourceType==='string'){isModule=options.sourceType==='module';}var parser;if(options&&typeof options.jsx==='boolean'&&options.jsx){parser=new jsx_parser_1.JSXParser(code,options,parserDelegate);}else{parser=new parser_1.Parser(code,options,parserDelegate);}var program=isModule?parser.parseModule():parser.parseScript();var ast=program;if(collectComment&&commentHandler){ast.comments=commentHandler.comments;}if(parser.config.tokens){ast.tokens=parser.tokens;}if(parser.config.tolerant){ast.errors=parser.errorHandler.errors;}return ast;}exports.parse=parse;function parseModule(code,options,delegate){var parsingOptions=options||{};parsingOptions.sourceType='module';return parse(code,parsingOptions,delegate);}exports.parseModule=parseModule;function parseScript(code,options,delegate){var parsingOptions=options||{};parsingOptions.sourceType='script';return parse(code,parsingOptions,delegate);}exports.parseScript=parseScript;function tokenize(code,options,delegate){var tokenizer=new tokenizer_1.Tokenizer(code,options);var tokens;tokens=[];try{while(true){var token=tokenizer.getNextToken();if(!token){break;}if(delegate){token=delegate(token);}tokens.push(token);}}catch(e){tokenizer.errorHandler.tolerate(e);}if(tokenizer.errorHandler.tolerant){tokens.errors=tokenizer.errors();}return tokens;}exports.tokenize=tokenize;var syntax_1=__webpack_require__(2);exports.Syntax=syntax_1.Syntax;// Sync with *.json manifests.
+  exports.version='4.0.1';/***/},/* 1 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var syntax_1=__webpack_require__(2);var CommentHandler=function(){function CommentHandler(){this.attach=false;this.comments=[];this.stack=[];this.leading=[];this.trailing=[];}CommentHandler.prototype.insertInnerComments=function(node,metadata){//  innnerComments for properties empty block
+  //  `function a() {/** comments **\/}`
+  if(node.type===syntax_1.Syntax.BlockStatement&&node.body.length===0){var innerComments=[];for(var i=this.leading.length-1;i>=0;--i){var entry=this.leading[i];if(metadata.end.offset>=entry.start){innerComments.unshift(entry.comment);this.leading.splice(i,1);this.trailing.splice(i,1);}}if(innerComments.length){node.innerComments=innerComments;}}};CommentHandler.prototype.findTrailingComments=function(metadata){var trailingComments=[];if(this.trailing.length>0){for(var i=this.trailing.length-1;i>=0;--i){var entry_1=this.trailing[i];if(entry_1.start>=metadata.end.offset){trailingComments.unshift(entry_1.comment);}}this.trailing.length=0;return trailingComments;}var entry=this.stack[this.stack.length-1];if(entry&&entry.node.trailingComments){var firstComment=entry.node.trailingComments[0];if(firstComment&&firstComment.range[0]>=metadata.end.offset){trailingComments=entry.node.trailingComments;delete entry.node.trailingComments;}}return trailingComments;};CommentHandler.prototype.findLeadingComments=function(metadata){var leadingComments=[];var target;while(this.stack.length>0){var entry=this.stack[this.stack.length-1];if(entry&&entry.start>=metadata.start.offset){target=entry.node;this.stack.pop();}else{break;}}if(target){var count=target.leadingComments?target.leadingComments.length:0;for(var i=count-1;i>=0;--i){var comment=target.leadingComments[i];if(comment.range[1]<=metadata.start.offset){leadingComments.unshift(comment);target.leadingComments.splice(i,1);}}if(target.leadingComments&&target.leadingComments.length===0){delete target.leadingComments;}return leadingComments;}for(var i=this.leading.length-1;i>=0;--i){var entry=this.leading[i];if(entry.start<=metadata.start.offset){leadingComments.unshift(entry.comment);this.leading.splice(i,1);}}return leadingComments;};CommentHandler.prototype.visitNode=function(node,metadata){if(node.type===syntax_1.Syntax.Program&&node.body.length>0){return;}this.insertInnerComments(node,metadata);var trailingComments=this.findTrailingComments(metadata);var leadingComments=this.findLeadingComments(metadata);if(leadingComments.length>0){node.leadingComments=leadingComments;}if(trailingComments.length>0){node.trailingComments=trailingComments;}this.stack.push({node:node,start:metadata.start.offset});};CommentHandler.prototype.visitComment=function(node,metadata){var type=node.type[0]==='L'?'Line':'Block';var comment={type:type,value:node.value};if(node.range){comment.range=node.range;}if(node.loc){comment.loc=node.loc;}this.comments.push(comment);if(this.attach){var entry={comment:{type:type,value:node.value,range:[metadata.start.offset,metadata.end.offset]},start:metadata.start.offset};if(node.loc){entry.comment.loc=node.loc;}node.type=type;this.leading.push(entry);this.trailing.push(entry);}};CommentHandler.prototype.visit=function(node,metadata){if(node.type==='LineComment'){this.visitComment(node,metadata);}else if(node.type==='BlockComment'){this.visitComment(node,metadata);}else if(this.attach){this.visitNode(node,metadata);}};return CommentHandler;}();exports.CommentHandler=CommentHandler;/***/},/* 2 */ /***/function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});exports.Syntax={AssignmentExpression:'AssignmentExpression',AssignmentPattern:'AssignmentPattern',ArrayExpression:'ArrayExpression',ArrayPattern:'ArrayPattern',ArrowFunctionExpression:'ArrowFunctionExpression',AwaitExpression:'AwaitExpression',BlockStatement:'BlockStatement',BinaryExpression:'BinaryExpression',BreakStatement:'BreakStatement',CallExpression:'CallExpression',CatchClause:'CatchClause',ClassBody:'ClassBody',ClassDeclaration:'ClassDeclaration',ClassExpression:'ClassExpression',ConditionalExpression:'ConditionalExpression',ContinueStatement:'ContinueStatement',DoWhileStatement:'DoWhileStatement',DebuggerStatement:'DebuggerStatement',EmptyStatement:'EmptyStatement',ExportAllDeclaration:'ExportAllDeclaration',ExportDefaultDeclaration:'ExportDefaultDeclaration',ExportNamedDeclaration:'ExportNamedDeclaration',ExportSpecifier:'ExportSpecifier',ExpressionStatement:'ExpressionStatement',ForStatement:'ForStatement',ForOfStatement:'ForOfStatement',ForInStatement:'ForInStatement',FunctionDeclaration:'FunctionDeclaration',FunctionExpression:'FunctionExpression',Identifier:'Identifier',IfStatement:'IfStatement',ImportDeclaration:'ImportDeclaration',ImportDefaultSpecifier:'ImportDefaultSpecifier',ImportNamespaceSpecifier:'ImportNamespaceSpecifier',ImportSpecifier:'ImportSpecifier',Literal:'Literal',LabeledStatement:'LabeledStatement',LogicalExpression:'LogicalExpression',MemberExpression:'MemberExpression',MetaProperty:'MetaProperty',MethodDefinition:'MethodDefinition',NewExpression:'NewExpression',ObjectExpression:'ObjectExpression',ObjectPattern:'ObjectPattern',Program:'Program',Property:'Property',RestElement:'RestElement',ReturnStatement:'ReturnStatement',SequenceExpression:'SequenceExpression',SpreadElement:'SpreadElement',Super:'Super',SwitchCase:'SwitchCase',SwitchStatement:'SwitchStatement',TaggedTemplateExpression:'TaggedTemplateExpression',TemplateElement:'TemplateElement',TemplateLiteral:'TemplateLiteral',ThisExpression:'ThisExpression',ThrowStatement:'ThrowStatement',TryStatement:'TryStatement',UnaryExpression:'UnaryExpression',UpdateExpression:'UpdateExpression',VariableDeclaration:'VariableDeclaration',VariableDeclarator:'VariableDeclarator',WhileStatement:'WhileStatement',WithStatement:'WithStatement',YieldExpression:'YieldExpression'};/***/},/* 3 */ /***/function(module,exports,__webpack_require__){/* istanbul ignore next */var __extends=this&&this.__extends||function(){var extendStatics=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(d,b){d.__proto__=b;}||function(d,b){for(var p in b)if(b.hasOwnProperty(p))d[p]=b[p];};return function(d,b){extendStatics(d,b);function __(){this.constructor=d;}d.prototype=b===null?Object.create(b):(__.prototype=b.prototype,new __());};}();Object.defineProperty(exports,"__esModule",{value:true});var character_1=__webpack_require__(4);var JSXNode=__webpack_require__(5);var jsx_syntax_1=__webpack_require__(6);var Node=__webpack_require__(7);var parser_1=__webpack_require__(8);var token_1=__webpack_require__(13);var xhtml_entities_1=__webpack_require__(14);token_1.TokenName[100/* Identifier */]='JSXIdentifier';token_1.TokenName[101/* Text */]='JSXText';// Fully qualified element name, e.g. <svg:path> returns "svg:path"
+  function getQualifiedElementName(elementName){var qualifiedName;switch(elementName.type){case jsx_syntax_1.JSXSyntax.JSXIdentifier:var id=elementName;qualifiedName=id.name;break;case jsx_syntax_1.JSXSyntax.JSXNamespacedName:var ns=elementName;qualifiedName=getQualifiedElementName(ns.namespace)+':'+getQualifiedElementName(ns.name);break;case jsx_syntax_1.JSXSyntax.JSXMemberExpression:var expr=elementName;qualifiedName=getQualifiedElementName(expr.object)+'.'+getQualifiedElementName(expr.property);break;/* istanbul ignore next */default:break;}return qualifiedName;}var JSXParser=function(_super){__extends(JSXParser,_super);function JSXParser(code,options,delegate){return _super.call(this,code,options,delegate)||this;}JSXParser.prototype.parsePrimaryExpression=function(){return this.match('<')?this.parseJSXRoot():_super.prototype.parsePrimaryExpression.call(this);};JSXParser.prototype.startJSX=function(){// Unwind the scanner before the lookahead token.
+  this.scanner.index=this.startMarker.index;this.scanner.lineNumber=this.startMarker.line;this.scanner.lineStart=this.startMarker.index-this.startMarker.column;};JSXParser.prototype.finishJSX=function(){// Prime the next lookahead.
+  this.nextToken();};JSXParser.prototype.reenterJSX=function(){this.startJSX();this.expectJSX('}');// Pop the closing '}' added from the lookahead.
+  if(this.config.tokens){this.tokens.pop();}};JSXParser.prototype.createJSXNode=function(){this.collectComments();return {index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart};};JSXParser.prototype.createJSXChildNode=function(){return {index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart};};JSXParser.prototype.scanXHTMLEntity=function(quote){var result='&';var valid=true;var terminated=false;var numeric=false;var hex=false;while(!this.scanner.eof()&&valid&&!terminated){var ch=this.scanner.source[this.scanner.index];if(ch===quote){break;}terminated=ch===';';result+=ch;++this.scanner.index;if(!terminated){switch(result.length){case 2:// e.g. '&#123;'
+  numeric=ch==='#';break;case 3:if(numeric){// e.g. '&#x41;'
+  hex=ch==='x';valid=hex||character_1.Character.isDecimalDigit(ch.charCodeAt(0));numeric=numeric&&!hex;}break;default:valid=valid&&!(numeric&&!character_1.Character.isDecimalDigit(ch.charCodeAt(0)));valid=valid&&!(hex&&!character_1.Character.isHexDigit(ch.charCodeAt(0)));break;}}}if(valid&&terminated&&result.length>2){// e.g. '&#x41;' becomes just '#x41'
+  var str=result.substr(1,result.length-2);if(numeric&&str.length>1){result=String.fromCharCode(parseInt(str.substr(1),10));}else if(hex&&str.length>2){result=String.fromCharCode(parseInt('0'+str.substr(1),16));}else if(!numeric&&!hex&&xhtml_entities_1.XHTMLEntities[str]){result=xhtml_entities_1.XHTMLEntities[str];}}return result;};// Scan the next JSX token. This replaces Scanner#lex when in JSX mode.
+  JSXParser.prototype.lexJSX=function(){var cp=this.scanner.source.charCodeAt(this.scanner.index);// < > / : = { }
+  if(cp===60||cp===62||cp===47||cp===58||cp===61||cp===123||cp===125){var value=this.scanner.source[this.scanner.index++];return {type:7/* Punctuator */,value:value,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:this.scanner.index-1,end:this.scanner.index};}// " '
+  if(cp===34||cp===39){var start=this.scanner.index;var quote=this.scanner.source[this.scanner.index++];var str='';while(!this.scanner.eof()){var ch=this.scanner.source[this.scanner.index++];if(ch===quote){break;}else if(ch==='&'){str+=this.scanXHTMLEntity(quote);}else{str+=ch;}}return {type:8/* StringLiteral */,value:str,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:start,end:this.scanner.index};}// ... or .
+  if(cp===46){var n1=this.scanner.source.charCodeAt(this.scanner.index+1);var n2=this.scanner.source.charCodeAt(this.scanner.index+2);var value=n1===46&&n2===46?'...':'.';var start=this.scanner.index;this.scanner.index+=value.length;return {type:7/* Punctuator */,value:value,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:start,end:this.scanner.index};}// `
+  if(cp===96){// Only placeholder, since it will be rescanned as a real assignment expression.
+  return {type:10/* Template */,value:'',lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:this.scanner.index,end:this.scanner.index};}// Identifer can not contain backslash (char code 92).
+  if(character_1.Character.isIdentifierStart(cp)&&cp!==92){var start=this.scanner.index;++this.scanner.index;while(!this.scanner.eof()){var ch=this.scanner.source.charCodeAt(this.scanner.index);if(character_1.Character.isIdentifierPart(ch)&&ch!==92){++this.scanner.index;}else if(ch===45){// Hyphen (char code 45) can be part of an identifier.
+  ++this.scanner.index;}else{break;}}var id=this.scanner.source.slice(start,this.scanner.index);return {type:100/* Identifier */,value:id,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:start,end:this.scanner.index};}return this.scanner.lex();};JSXParser.prototype.nextJSXToken=function(){this.collectComments();this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart;var token=this.lexJSX();this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;if(this.config.tokens){this.tokens.push(this.convertToken(token));}return token;};JSXParser.prototype.nextJSXText=function(){this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart;var start=this.scanner.index;var text='';while(!this.scanner.eof()){var ch=this.scanner.source[this.scanner.index];if(ch==='{'||ch==='<'){break;}++this.scanner.index;text+=ch;if(character_1.Character.isLineTerminator(ch.charCodeAt(0))){++this.scanner.lineNumber;if(ch==='\r'&&this.scanner.source[this.scanner.index]==='\n'){++this.scanner.index;}this.scanner.lineStart=this.scanner.index;}}this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;var token={type:101/* Text */,value:text,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:start,end:this.scanner.index};if(text.length>0&&this.config.tokens){this.tokens.push(this.convertToken(token));}return token;};JSXParser.prototype.peekJSXToken=function(){var state=this.scanner.saveState();this.scanner.scanComments();var next=this.lexJSX();this.scanner.restoreState(state);return next;};// Expect the next JSX token to match the specified punctuator.
+  // If not, an exception will be thrown.
+  JSXParser.prototype.expectJSX=function(value){var token=this.nextJSXToken();if(token.type!==7/* Punctuator */||token.value!==value){this.throwUnexpectedToken(token);}};// Return true if the next JSX token matches the specified punctuator.
+  JSXParser.prototype.matchJSX=function(value){var next=this.peekJSXToken();return next.type===7/* Punctuator */&&next.value===value;};JSXParser.prototype.parseJSXIdentifier=function(){var node=this.createJSXNode();var token=this.nextJSXToken();if(token.type!==100/* Identifier */){this.throwUnexpectedToken(token);}return this.finalize(node,new JSXNode.JSXIdentifier(token.value));};JSXParser.prototype.parseJSXElementName=function(){var node=this.createJSXNode();var elementName=this.parseJSXIdentifier();if(this.matchJSX(':')){var namespace=elementName;this.expectJSX(':');var name_1=this.parseJSXIdentifier();elementName=this.finalize(node,new JSXNode.JSXNamespacedName(namespace,name_1));}else if(this.matchJSX('.')){while(this.matchJSX('.')){var object=elementName;this.expectJSX('.');var property=this.parseJSXIdentifier();elementName=this.finalize(node,new JSXNode.JSXMemberExpression(object,property));}}return elementName;};JSXParser.prototype.parseJSXAttributeName=function(){var node=this.createJSXNode();var attributeName;var identifier=this.parseJSXIdentifier();if(this.matchJSX(':')){var namespace=identifier;this.expectJSX(':');var name_2=this.parseJSXIdentifier();attributeName=this.finalize(node,new JSXNode.JSXNamespacedName(namespace,name_2));}else{attributeName=identifier;}return attributeName;};JSXParser.prototype.parseJSXStringLiteralAttribute=function(){var node=this.createJSXNode();var token=this.nextJSXToken();if(token.type!==8/* StringLiteral */){this.throwUnexpectedToken(token);}var raw=this.getTokenRaw(token);return this.finalize(node,new Node.Literal(token.value,raw));};JSXParser.prototype.parseJSXExpressionAttribute=function(){var node=this.createJSXNode();this.expectJSX('{');this.finishJSX();if(this.match('}')){this.tolerateError('JSX attributes must only be assigned a non-empty expression');}var expression=this.parseAssignmentExpression();this.reenterJSX();return this.finalize(node,new JSXNode.JSXExpressionContainer(expression));};JSXParser.prototype.parseJSXAttributeValue=function(){return this.matchJSX('{')?this.parseJSXExpressionAttribute():this.matchJSX('<')?this.parseJSXElement():this.parseJSXStringLiteralAttribute();};JSXParser.prototype.parseJSXNameValueAttribute=function(){var node=this.createJSXNode();var name=this.parseJSXAttributeName();var value=null;if(this.matchJSX('=')){this.expectJSX('=');value=this.parseJSXAttributeValue();}return this.finalize(node,new JSXNode.JSXAttribute(name,value));};JSXParser.prototype.parseJSXSpreadAttribute=function(){var node=this.createJSXNode();this.expectJSX('{');this.expectJSX('...');this.finishJSX();var argument=this.parseAssignmentExpression();this.reenterJSX();return this.finalize(node,new JSXNode.JSXSpreadAttribute(argument));};JSXParser.prototype.parseJSXAttributes=function(){var attributes=[];while(!this.matchJSX('/')&&!this.matchJSX('>')){var attribute=this.matchJSX('{')?this.parseJSXSpreadAttribute():this.parseJSXNameValueAttribute();attributes.push(attribute);}return attributes;};JSXParser.prototype.parseJSXOpeningElement=function(){var node=this.createJSXNode();this.expectJSX('<');var name=this.parseJSXElementName();var attributes=this.parseJSXAttributes();var selfClosing=this.matchJSX('/');if(selfClosing){this.expectJSX('/');}this.expectJSX('>');return this.finalize(node,new JSXNode.JSXOpeningElement(name,selfClosing,attributes));};JSXParser.prototype.parseJSXBoundaryElement=function(){var node=this.createJSXNode();this.expectJSX('<');if(this.matchJSX('/')){this.expectJSX('/');var name_3=this.parseJSXElementName();this.expectJSX('>');return this.finalize(node,new JSXNode.JSXClosingElement(name_3));}var name=this.parseJSXElementName();var attributes=this.parseJSXAttributes();var selfClosing=this.matchJSX('/');if(selfClosing){this.expectJSX('/');}this.expectJSX('>');return this.finalize(node,new JSXNode.JSXOpeningElement(name,selfClosing,attributes));};JSXParser.prototype.parseJSXEmptyExpression=function(){var node=this.createJSXChildNode();this.collectComments();this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;return this.finalize(node,new JSXNode.JSXEmptyExpression());};JSXParser.prototype.parseJSXExpressionContainer=function(){var node=this.createJSXNode();this.expectJSX('{');var expression;if(this.matchJSX('}')){expression=this.parseJSXEmptyExpression();this.expectJSX('}');}else{this.finishJSX();expression=this.parseAssignmentExpression();this.reenterJSX();}return this.finalize(node,new JSXNode.JSXExpressionContainer(expression));};JSXParser.prototype.parseJSXChildren=function(){var children=[];while(!this.scanner.eof()){var node=this.createJSXChildNode();var token=this.nextJSXText();if(token.start<token.end){var raw=this.getTokenRaw(token);var child=this.finalize(node,new JSXNode.JSXText(token.value,raw));children.push(child);}if(this.scanner.source[this.scanner.index]==='{'){var container=this.parseJSXExpressionContainer();children.push(container);}else{break;}}return children;};JSXParser.prototype.parseComplexJSXElement=function(el){var stack=[];while(!this.scanner.eof()){el.children=el.children.concat(this.parseJSXChildren());var node=this.createJSXChildNode();var element=this.parseJSXBoundaryElement();if(element.type===jsx_syntax_1.JSXSyntax.JSXOpeningElement){var opening=element;if(opening.selfClosing){var child=this.finalize(node,new JSXNode.JSXElement(opening,[],null));el.children.push(child);}else{stack.push(el);el={node:node,opening:opening,closing:null,children:[]};}}if(element.type===jsx_syntax_1.JSXSyntax.JSXClosingElement){el.closing=element;var open_1=getQualifiedElementName(el.opening.name);var close_1=getQualifiedElementName(el.closing.name);if(open_1!==close_1){this.tolerateError('Expected corresponding JSX closing tag for %0',open_1);}if(stack.length>0){var child=this.finalize(el.node,new JSXNode.JSXElement(el.opening,el.children,el.closing));el=stack[stack.length-1];el.children.push(child);stack.pop();}else{break;}}}return el;};JSXParser.prototype.parseJSXElement=function(){var node=this.createJSXNode();var opening=this.parseJSXOpeningElement();var children=[];var closing=null;if(!opening.selfClosing){var el=this.parseComplexJSXElement({node:node,opening:opening,closing:closing,children:children});children=el.children;closing=el.closing;}return this.finalize(node,new JSXNode.JSXElement(opening,children,closing));};JSXParser.prototype.parseJSXRoot=function(){// Pop the opening '<' added from the lookahead.
+  if(this.config.tokens){this.tokens.pop();}this.startJSX();var element=this.parseJSXElement();this.finishJSX();return element;};JSXParser.prototype.isStartOfExpression=function(){return _super.prototype.isStartOfExpression.call(this)||this.match('<');};return JSXParser;}(parser_1.Parser);exports.JSXParser=JSXParser;/***/},/* 4 */ /***/function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});// See also tools/generate-unicode-regex.js.
+  var Regex={// Unicode v8.0.0 NonAsciiIdentifierStart:
+  NonAsciiIdentifierStart:/[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B4\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\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-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\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\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,// Unicode v8.0.0 NonAsciiIdentifierPart:
+  NonAsciiIdentifierPart:/[\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF]/};exports.Character={/* tslint:disable:no-bitwise */fromCodePoint:function fromCodePoint(cp){return cp<0x10000?String.fromCharCode(cp):String.fromCharCode(0xD800+(cp-0x10000>>10))+String.fromCharCode(0xDC00+(cp-0x10000&1023));},// https://tc39.github.io/ecma262/#sec-white-space
+  isWhiteSpace:function isWhiteSpace(cp){return cp===0x20||cp===0x09||cp===0x0B||cp===0x0C||cp===0xA0||cp>=0x1680&&[0x1680,0x2000,0x2001,0x2002,0x2003,0x2004,0x2005,0x2006,0x2007,0x2008,0x2009,0x200A,0x202F,0x205F,0x3000,0xFEFF].indexOf(cp)>=0;},// https://tc39.github.io/ecma262/#sec-line-terminators
+  isLineTerminator:function isLineTerminator(cp){return cp===0x0A||cp===0x0D||cp===0x2028||cp===0x2029;},// https://tc39.github.io/ecma262/#sec-names-and-keywords
+  isIdentifierStart:function isIdentifierStart(cp){return cp===0x24||cp===0x5F||cp>=0x41&&cp<=0x5A||cp>=0x61&&cp<=0x7A||cp===0x5C||cp>=0x80&&Regex.NonAsciiIdentifierStart.test(exports.Character.fromCodePoint(cp));},isIdentifierPart:function isIdentifierPart(cp){return cp===0x24||cp===0x5F||cp>=0x41&&cp<=0x5A||cp>=0x61&&cp<=0x7A||cp>=0x30&&cp<=0x39||cp===0x5C||cp>=0x80&&Regex.NonAsciiIdentifierPart.test(exports.Character.fromCodePoint(cp));},// https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+  isDecimalDigit:function isDecimalDigit(cp){return cp>=0x30&&cp<=0x39;// 0..9
+  },isHexDigit:function isHexDigit(cp){return cp>=0x30&&cp<=0x39||cp>=0x41&&cp<=0x46||cp>=0x61&&cp<=0x66;// a..f
+  },isOctalDigit:function isOctalDigit(cp){return cp>=0x30&&cp<=0x37;// 0..7
+  }};/***/},/* 5 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var jsx_syntax_1=__webpack_require__(6);/* tslint:disable:max-classes-per-file */var JSXClosingElement=function(){function JSXClosingElement(name){this.type=jsx_syntax_1.JSXSyntax.JSXClosingElement;this.name=name;}return JSXClosingElement;}();exports.JSXClosingElement=JSXClosingElement;var JSXElement=function(){function JSXElement(openingElement,children,closingElement){this.type=jsx_syntax_1.JSXSyntax.JSXElement;this.openingElement=openingElement;this.children=children;this.closingElement=closingElement;}return JSXElement;}();exports.JSXElement=JSXElement;var JSXEmptyExpression=function(){function JSXEmptyExpression(){this.type=jsx_syntax_1.JSXSyntax.JSXEmptyExpression;}return JSXEmptyExpression;}();exports.JSXEmptyExpression=JSXEmptyExpression;var JSXExpressionContainer=function(){function JSXExpressionContainer(expression){this.type=jsx_syntax_1.JSXSyntax.JSXExpressionContainer;this.expression=expression;}return JSXExpressionContainer;}();exports.JSXExpressionContainer=JSXExpressionContainer;var JSXIdentifier=function(){function JSXIdentifier(name){this.type=jsx_syntax_1.JSXSyntax.JSXIdentifier;this.name=name;}return JSXIdentifier;}();exports.JSXIdentifier=JSXIdentifier;var JSXMemberExpression=function(){function JSXMemberExpression(object,property){this.type=jsx_syntax_1.JSXSyntax.JSXMemberExpression;this.object=object;this.property=property;}return JSXMemberExpression;}();exports.JSXMemberExpression=JSXMemberExpression;var JSXAttribute=function(){function JSXAttribute(name,value){this.type=jsx_syntax_1.JSXSyntax.JSXAttribute;this.name=name;this.value=value;}return JSXAttribute;}();exports.JSXAttribute=JSXAttribute;var JSXNamespacedName=function(){function JSXNamespacedName(namespace,name){this.type=jsx_syntax_1.JSXSyntax.JSXNamespacedName;this.namespace=namespace;this.name=name;}return JSXNamespacedName;}();exports.JSXNamespacedName=JSXNamespacedName;var JSXOpeningElement=function(){function JSXOpeningElement(name,selfClosing,attributes){this.type=jsx_syntax_1.JSXSyntax.JSXOpeningElement;this.name=name;this.selfClosing=selfClosing;this.attributes=attributes;}return JSXOpeningElement;}();exports.JSXOpeningElement=JSXOpeningElement;var JSXSpreadAttribute=function(){function JSXSpreadAttribute(argument){this.type=jsx_syntax_1.JSXSyntax.JSXSpreadAttribute;this.argument=argument;}return JSXSpreadAttribute;}();exports.JSXSpreadAttribute=JSXSpreadAttribute;var JSXText=function(){function JSXText(value,raw){this.type=jsx_syntax_1.JSXSyntax.JSXText;this.value=value;this.raw=raw;}return JSXText;}();exports.JSXText=JSXText;/***/},/* 6 */ /***/function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});exports.JSXSyntax={JSXAttribute:'JSXAttribute',JSXClosingElement:'JSXClosingElement',JSXElement:'JSXElement',JSXEmptyExpression:'JSXEmptyExpression',JSXExpressionContainer:'JSXExpressionContainer',JSXIdentifier:'JSXIdentifier',JSXMemberExpression:'JSXMemberExpression',JSXNamespacedName:'JSXNamespacedName',JSXOpeningElement:'JSXOpeningElement',JSXSpreadAttribute:'JSXSpreadAttribute',JSXText:'JSXText'};/***/},/* 7 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var syntax_1=__webpack_require__(2);/* tslint:disable:max-classes-per-file */var ArrayExpression=function(){function ArrayExpression(elements){this.type=syntax_1.Syntax.ArrayExpression;this.elements=elements;}return ArrayExpression;}();exports.ArrayExpression=ArrayExpression;var ArrayPattern=function(){function ArrayPattern(elements){this.type=syntax_1.Syntax.ArrayPattern;this.elements=elements;}return ArrayPattern;}();exports.ArrayPattern=ArrayPattern;var ArrowFunctionExpression=function(){function ArrowFunctionExpression(params,body,expression){this.type=syntax_1.Syntax.ArrowFunctionExpression;this.id=null;this.params=params;this.body=body;this.generator=false;this.expression=expression;this.async=false;}return ArrowFunctionExpression;}();exports.ArrowFunctionExpression=ArrowFunctionExpression;var AssignmentExpression=function(){function AssignmentExpression(operator,left,right){this.type=syntax_1.Syntax.AssignmentExpression;this.operator=operator;this.left=left;this.right=right;}return AssignmentExpression;}();exports.AssignmentExpression=AssignmentExpression;var AssignmentPattern=function(){function AssignmentPattern(left,right){this.type=syntax_1.Syntax.AssignmentPattern;this.left=left;this.right=right;}return AssignmentPattern;}();exports.AssignmentPattern=AssignmentPattern;var AsyncArrowFunctionExpression=function(){function AsyncArrowFunctionExpression(params,body,expression){this.type=syntax_1.Syntax.ArrowFunctionExpression;this.id=null;this.params=params;this.body=body;this.generator=false;this.expression=expression;this.async=true;}return AsyncArrowFunctionExpression;}();exports.AsyncArrowFunctionExpression=AsyncArrowFunctionExpression;var AsyncFunctionDeclaration=function(){function AsyncFunctionDeclaration(id,params,body){this.type=syntax_1.Syntax.FunctionDeclaration;this.id=id;this.params=params;this.body=body;this.generator=false;this.expression=false;this.async=true;}return AsyncFunctionDeclaration;}();exports.AsyncFunctionDeclaration=AsyncFunctionDeclaration;var AsyncFunctionExpression=function(){function AsyncFunctionExpression(id,params,body){this.type=syntax_1.Syntax.FunctionExpression;this.id=id;this.params=params;this.body=body;this.generator=false;this.expression=false;this.async=true;}return AsyncFunctionExpression;}();exports.AsyncFunctionExpression=AsyncFunctionExpression;var AwaitExpression=function(){function AwaitExpression(argument){this.type=syntax_1.Syntax.AwaitExpression;this.argument=argument;}return AwaitExpression;}();exports.AwaitExpression=AwaitExpression;var BinaryExpression=function(){function BinaryExpression(operator,left,right){var logical=operator==='||'||operator==='&&';this.type=logical?syntax_1.Syntax.LogicalExpression:syntax_1.Syntax.BinaryExpression;this.operator=operator;this.left=left;this.right=right;}return BinaryExpression;}();exports.BinaryExpression=BinaryExpression;var BlockStatement=function(){function BlockStatement(body){this.type=syntax_1.Syntax.BlockStatement;this.body=body;}return BlockStatement;}();exports.BlockStatement=BlockStatement;var BreakStatement=function(){function BreakStatement(label){this.type=syntax_1.Syntax.BreakStatement;this.label=label;}return BreakStatement;}();exports.BreakStatement=BreakStatement;var CallExpression=function(){function CallExpression(callee,args){this.type=syntax_1.Syntax.CallExpression;this.callee=callee;this.arguments=args;}return CallExpression;}();exports.CallExpression=CallExpression;var CatchClause=function(){function CatchClause(param,body){this.type=syntax_1.Syntax.CatchClause;this.param=param;this.body=body;}return CatchClause;}();exports.CatchClause=CatchClause;var ClassBody=function(){function ClassBody(body){this.type=syntax_1.Syntax.ClassBody;this.body=body;}return ClassBody;}();exports.ClassBody=ClassBody;var ClassDeclaration=function(){function ClassDeclaration(id,superClass,body){this.type=syntax_1.Syntax.ClassDeclaration;this.id=id;this.superClass=superClass;this.body=body;}return ClassDeclaration;}();exports.ClassDeclaration=ClassDeclaration;var ClassExpression=function(){function ClassExpression(id,superClass,body){this.type=syntax_1.Syntax.ClassExpression;this.id=id;this.superClass=superClass;this.body=body;}return ClassExpression;}();exports.ClassExpression=ClassExpression;var ComputedMemberExpression=function(){function ComputedMemberExpression(object,property){this.type=syntax_1.Syntax.MemberExpression;this.computed=true;this.object=object;this.property=property;}return ComputedMemberExpression;}();exports.ComputedMemberExpression=ComputedMemberExpression;var ConditionalExpression=function(){function ConditionalExpression(test,consequent,alternate){this.type=syntax_1.Syntax.ConditionalExpression;this.test=test;this.consequent=consequent;this.alternate=alternate;}return ConditionalExpression;}();exports.ConditionalExpression=ConditionalExpression;var ContinueStatement=function(){function ContinueStatement(label){this.type=syntax_1.Syntax.ContinueStatement;this.label=label;}return ContinueStatement;}();exports.ContinueStatement=ContinueStatement;var DebuggerStatement=function(){function DebuggerStatement(){this.type=syntax_1.Syntax.DebuggerStatement;}return DebuggerStatement;}();exports.DebuggerStatement=DebuggerStatement;var Directive=function(){function Directive(expression,directive){this.type=syntax_1.Syntax.ExpressionStatement;this.expression=expression;this.directive=directive;}return Directive;}();exports.Directive=Directive;var DoWhileStatement=function(){function DoWhileStatement(body,test){this.type=syntax_1.Syntax.DoWhileStatement;this.body=body;this.test=test;}return DoWhileStatement;}();exports.DoWhileStatement=DoWhileStatement;var EmptyStatement=function(){function EmptyStatement(){this.type=syntax_1.Syntax.EmptyStatement;}return EmptyStatement;}();exports.EmptyStatement=EmptyStatement;var ExportAllDeclaration=function(){function ExportAllDeclaration(source){this.type=syntax_1.Syntax.ExportAllDeclaration;this.source=source;}return ExportAllDeclaration;}();exports.ExportAllDeclaration=ExportAllDeclaration;var ExportDefaultDeclaration=function(){function ExportDefaultDeclaration(declaration){this.type=syntax_1.Syntax.ExportDefaultDeclaration;this.declaration=declaration;}return ExportDefaultDeclaration;}();exports.ExportDefaultDeclaration=ExportDefaultDeclaration;var ExportNamedDeclaration=function(){function ExportNamedDeclaration(declaration,specifiers,source){this.type=syntax_1.Syntax.ExportNamedDeclaration;this.declaration=declaration;this.specifiers=specifiers;this.source=source;}return ExportNamedDeclaration;}();exports.ExportNamedDeclaration=ExportNamedDeclaration;var ExportSpecifier=function(){function ExportSpecifier(local,exported){this.type=syntax_1.Syntax.ExportSpecifier;this.exported=exported;this.local=local;}return ExportSpecifier;}();exports.ExportSpecifier=ExportSpecifier;var ExpressionStatement=function(){function ExpressionStatement(expression){this.type=syntax_1.Syntax.ExpressionStatement;this.expression=expression;}return ExpressionStatement;}();exports.ExpressionStatement=ExpressionStatement;var ForInStatement=function(){function ForInStatement(left,right,body){this.type=syntax_1.Syntax.ForInStatement;this.left=left;this.right=right;this.body=body;this.each=false;}return ForInStatement;}();exports.ForInStatement=ForInStatement;var ForOfStatement=function(){function ForOfStatement(left,right,body){this.type=syntax_1.Syntax.ForOfStatement;this.left=left;this.right=right;this.body=body;}return ForOfStatement;}();exports.ForOfStatement=ForOfStatement;var ForStatement=function(){function ForStatement(init,test,update,body){this.type=syntax_1.Syntax.ForStatement;this.init=init;this.test=test;this.update=update;this.body=body;}return ForStatement;}();exports.ForStatement=ForStatement;var FunctionDeclaration=function(){function FunctionDeclaration(id,params,body,generator){this.type=syntax_1.Syntax.FunctionDeclaration;this.id=id;this.params=params;this.body=body;this.generator=generator;this.expression=false;this.async=false;}return FunctionDeclaration;}();exports.FunctionDeclaration=FunctionDeclaration;var FunctionExpression=function(){function FunctionExpression(id,params,body,generator){this.type=syntax_1.Syntax.FunctionExpression;this.id=id;this.params=params;this.body=body;this.generator=generator;this.expression=false;this.async=false;}return FunctionExpression;}();exports.FunctionExpression=FunctionExpression;var Identifier=function(){function Identifier(name){this.type=syntax_1.Syntax.Identifier;this.name=name;}return Identifier;}();exports.Identifier=Identifier;var IfStatement=function(){function IfStatement(test,consequent,alternate){this.type=syntax_1.Syntax.IfStatement;this.test=test;this.consequent=consequent;this.alternate=alternate;}return IfStatement;}();exports.IfStatement=IfStatement;var ImportDeclaration=function(){function ImportDeclaration(specifiers,source){this.type=syntax_1.Syntax.ImportDeclaration;this.specifiers=specifiers;this.source=source;}return ImportDeclaration;}();exports.ImportDeclaration=ImportDeclaration;var ImportDefaultSpecifier=function(){function ImportDefaultSpecifier(local){this.type=syntax_1.Syntax.ImportDefaultSpecifier;this.local=local;}return ImportDefaultSpecifier;}();exports.ImportDefaultSpecifier=ImportDefaultSpecifier;var ImportNamespaceSpecifier=function(){function ImportNamespaceSpecifier(local){this.type=syntax_1.Syntax.ImportNamespaceSpecifier;this.local=local;}return ImportNamespaceSpecifier;}();exports.ImportNamespaceSpecifier=ImportNamespaceSpecifier;var ImportSpecifier=function(){function ImportSpecifier(local,imported){this.type=syntax_1.Syntax.ImportSpecifier;this.local=local;this.imported=imported;}return ImportSpecifier;}();exports.ImportSpecifier=ImportSpecifier;var LabeledStatement=function(){function LabeledStatement(label,body){this.type=syntax_1.Syntax.LabeledStatement;this.label=label;this.body=body;}return LabeledStatement;}();exports.LabeledStatement=LabeledStatement;var Literal=function(){function Literal(value,raw){this.type=syntax_1.Syntax.Literal;this.value=value;this.raw=raw;}return Literal;}();exports.Literal=Literal;var MetaProperty=function(){function MetaProperty(meta,property){this.type=syntax_1.Syntax.MetaProperty;this.meta=meta;this.property=property;}return MetaProperty;}();exports.MetaProperty=MetaProperty;var MethodDefinition=function(){function MethodDefinition(key,computed,value,kind,isStatic){this.type=syntax_1.Syntax.MethodDefinition;this.key=key;this.computed=computed;this.value=value;this.kind=kind;this.static=isStatic;}return MethodDefinition;}();exports.MethodDefinition=MethodDefinition;var Module=function(){function Module(body){this.type=syntax_1.Syntax.Program;this.body=body;this.sourceType='module';}return Module;}();exports.Module=Module;var NewExpression=function(){function NewExpression(callee,args){this.type=syntax_1.Syntax.NewExpression;this.callee=callee;this.arguments=args;}return NewExpression;}();exports.NewExpression=NewExpression;var ObjectExpression=function(){function ObjectExpression(properties){this.type=syntax_1.Syntax.ObjectExpression;this.properties=properties;}return ObjectExpression;}();exports.ObjectExpression=ObjectExpression;var ObjectPattern=function(){function ObjectPattern(properties){this.type=syntax_1.Syntax.ObjectPattern;this.properties=properties;}return ObjectPattern;}();exports.ObjectPattern=ObjectPattern;var Property=function(){function Property(kind,key,computed,value,method,shorthand){this.type=syntax_1.Syntax.Property;this.key=key;this.computed=computed;this.value=value;this.kind=kind;this.method=method;this.shorthand=shorthand;}return Property;}();exports.Property=Property;var RegexLiteral=function(){function RegexLiteral(value,raw,pattern,flags){this.type=syntax_1.Syntax.Literal;this.value=value;this.raw=raw;this.regex={pattern:pattern,flags:flags};}return RegexLiteral;}();exports.RegexLiteral=RegexLiteral;var RestElement=function(){function RestElement(argument){this.type=syntax_1.Syntax.RestElement;this.argument=argument;}return RestElement;}();exports.RestElement=RestElement;var ReturnStatement=function(){function ReturnStatement(argument){this.type=syntax_1.Syntax.ReturnStatement;this.argument=argument;}return ReturnStatement;}();exports.ReturnStatement=ReturnStatement;var Script=function(){function Script(body){this.type=syntax_1.Syntax.Program;this.body=body;this.sourceType='script';}return Script;}();exports.Script=Script;var SequenceExpression=function(){function SequenceExpression(expressions){this.type=syntax_1.Syntax.SequenceExpression;this.expressions=expressions;}return SequenceExpression;}();exports.SequenceExpression=SequenceExpression;var SpreadElement=function(){function SpreadElement(argument){this.type=syntax_1.Syntax.SpreadElement;this.argument=argument;}return SpreadElement;}();exports.SpreadElement=SpreadElement;var StaticMemberExpression=function(){function StaticMemberExpression(object,property){this.type=syntax_1.Syntax.MemberExpression;this.computed=false;this.object=object;this.property=property;}return StaticMemberExpression;}();exports.StaticMemberExpression=StaticMemberExpression;var Super=function(){function Super(){this.type=syntax_1.Syntax.Super;}return Super;}();exports.Super=Super;var SwitchCase=function(){function SwitchCase(test,consequent){this.type=syntax_1.Syntax.SwitchCase;this.test=test;this.consequent=consequent;}return SwitchCase;}();exports.SwitchCase=SwitchCase;var SwitchStatement=function(){function SwitchStatement(discriminant,cases){this.type=syntax_1.Syntax.SwitchStatement;this.discriminant=discriminant;this.cases=cases;}return SwitchStatement;}();exports.SwitchStatement=SwitchStatement;var TaggedTemplateExpression=function(){function TaggedTemplateExpression(tag,quasi){this.type=syntax_1.Syntax.TaggedTemplateExpression;this.tag=tag;this.quasi=quasi;}return TaggedTemplateExpression;}();exports.TaggedTemplateExpression=TaggedTemplateExpression;var TemplateElement=function(){function TemplateElement(value,tail){this.type=syntax_1.Syntax.TemplateElement;this.value=value;this.tail=tail;}return TemplateElement;}();exports.TemplateElement=TemplateElement;var TemplateLiteral=function(){function TemplateLiteral(quasis,expressions){this.type=syntax_1.Syntax.TemplateLiteral;this.quasis=quasis;this.expressions=expressions;}return TemplateLiteral;}();exports.TemplateLiteral=TemplateLiteral;var ThisExpression=function(){function ThisExpression(){this.type=syntax_1.Syntax.ThisExpression;}return ThisExpression;}();exports.ThisExpression=ThisExpression;var ThrowStatement=function(){function ThrowStatement(argument){this.type=syntax_1.Syntax.ThrowStatement;this.argument=argument;}return ThrowStatement;}();exports.ThrowStatement=ThrowStatement;var TryStatement=function(){function TryStatement(block,handler,finalizer){this.type=syntax_1.Syntax.TryStatement;this.block=block;this.handler=handler;this.finalizer=finalizer;}return TryStatement;}();exports.TryStatement=TryStatement;var UnaryExpression=function(){function UnaryExpression(operator,argument){this.type=syntax_1.Syntax.UnaryExpression;this.operator=operator;this.argument=argument;this.prefix=true;}return UnaryExpression;}();exports.UnaryExpression=UnaryExpression;var UpdateExpression=function(){function UpdateExpression(operator,argument,prefix){this.type=syntax_1.Syntax.UpdateExpression;this.operator=operator;this.argument=argument;this.prefix=prefix;}return UpdateExpression;}();exports.UpdateExpression=UpdateExpression;var VariableDeclaration=function(){function VariableDeclaration(declarations,kind){this.type=syntax_1.Syntax.VariableDeclaration;this.declarations=declarations;this.kind=kind;}return VariableDeclaration;}();exports.VariableDeclaration=VariableDeclaration;var VariableDeclarator=function(){function VariableDeclarator(id,init){this.type=syntax_1.Syntax.VariableDeclarator;this.id=id;this.init=init;}return VariableDeclarator;}();exports.VariableDeclarator=VariableDeclarator;var WhileStatement=function(){function WhileStatement(test,body){this.type=syntax_1.Syntax.WhileStatement;this.test=test;this.body=body;}return WhileStatement;}();exports.WhileStatement=WhileStatement;var WithStatement=function(){function WithStatement(object,body){this.type=syntax_1.Syntax.WithStatement;this.object=object;this.body=body;}return WithStatement;}();exports.WithStatement=WithStatement;var YieldExpression=function(){function YieldExpression(argument,delegate){this.type=syntax_1.Syntax.YieldExpression;this.argument=argument;this.delegate=delegate;}return YieldExpression;}();exports.YieldExpression=YieldExpression;/***/},/* 8 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__webpack_require__(9);var error_handler_1=__webpack_require__(10);var messages_1=__webpack_require__(11);var Node=__webpack_require__(7);var scanner_1=__webpack_require__(12);var syntax_1=__webpack_require__(2);var token_1=__webpack_require__(13);var ArrowParameterPlaceHolder='ArrowParameterPlaceHolder';var Parser=function(){function Parser(code,options,delegate){if(options===void 0){options={};}this.config={range:typeof options.range==='boolean'&&options.range,loc:typeof options.loc==='boolean'&&options.loc,source:null,tokens:typeof options.tokens==='boolean'&&options.tokens,comment:typeof options.comment==='boolean'&&options.comment,tolerant:typeof options.tolerant==='boolean'&&options.tolerant};if(this.config.loc&&options.source&&options.source!==null){this.config.source=String(options.source);}this.delegate=delegate;this.errorHandler=new error_handler_1.ErrorHandler();this.errorHandler.tolerant=this.config.tolerant;this.scanner=new scanner_1.Scanner(code,this.errorHandler);this.scanner.trackComment=this.config.comment;this.operatorPrecedence={')':0,';':0,',':0,'=':0,']':0,'||':1,'&&':2,'|':3,'^':4,'&':5,'==':6,'!=':6,'===':6,'!==':6,'<':7,'>':7,'<=':7,'>=':7,'<<':8,'>>':8,'>>>':8,'+':9,'-':9,'*':11,'/':11,'%':11};this.lookahead={type:2/* EOF */,value:'',lineNumber:this.scanner.lineNumber,lineStart:0,start:0,end:0};this.hasLineTerminator=false;this.context={isModule:false,await:false,allowIn:true,allowStrictDirective:true,allowYield:true,firstCoverInitializedNameError:null,isAssignmentTarget:false,isBindingElement:false,inFunctionBody:false,inIteration:false,inSwitch:false,labelSet:{},strict:false};this.tokens=[];this.startMarker={index:0,line:this.scanner.lineNumber,column:0};this.lastMarker={index:0,line:this.scanner.lineNumber,column:0};this.nextToken();this.lastMarker={index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart};}Parser.prototype.throwError=function(messageFormat){var values=[];for(var _i=1;_i<arguments.length;_i++){values[_i-1]=arguments[_i];}var args=Array.prototype.slice.call(arguments,1);var msg=messageFormat.replace(/%(\d)/g,function(whole,idx){assert_1.assert(idx<args.length,'Message reference must be in range');return args[idx];});var index=this.lastMarker.index;var line=this.lastMarker.line;var column=this.lastMarker.column+1;throw this.errorHandler.createError(index,line,column,msg);};Parser.prototype.tolerateError=function(messageFormat){var values=[];for(var _i=1;_i<arguments.length;_i++){values[_i-1]=arguments[_i];}var args=Array.prototype.slice.call(arguments,1);var msg=messageFormat.replace(/%(\d)/g,function(whole,idx){assert_1.assert(idx<args.length,'Message reference must be in range');return args[idx];});var index=this.lastMarker.index;var line=this.scanner.lineNumber;var column=this.lastMarker.column+1;this.errorHandler.tolerateError(index,line,column,msg);};// Throw an exception because of the token.
+  Parser.prototype.unexpectedTokenError=function(token,message){var msg=message||messages_1.Messages.UnexpectedToken;var value;if(token){if(!message){msg=token.type===2/* EOF */?messages_1.Messages.UnexpectedEOS:token.type===3/* Identifier */?messages_1.Messages.UnexpectedIdentifier:token.type===6/* NumericLiteral */?messages_1.Messages.UnexpectedNumber:token.type===8/* StringLiteral */?messages_1.Messages.UnexpectedString:token.type===10/* Template */?messages_1.Messages.UnexpectedTemplate:messages_1.Messages.UnexpectedToken;if(token.type===4/* Keyword */){if(this.scanner.isFutureReservedWord(token.value)){msg=messages_1.Messages.UnexpectedReserved;}else if(this.context.strict&&this.scanner.isStrictModeReservedWord(token.value)){msg=messages_1.Messages.StrictReservedWord;}}}value=token.value;}else{value='ILLEGAL';}msg=msg.replace('%0',value);if(token&&typeof token.lineNumber==='number'){var index=token.start;var line=token.lineNumber;var lastMarkerLineStart=this.lastMarker.index-this.lastMarker.column;var column=token.start-lastMarkerLineStart+1;return this.errorHandler.createError(index,line,column,msg);}else{var index=this.lastMarker.index;var line=this.lastMarker.line;var column=this.lastMarker.column+1;return this.errorHandler.createError(index,line,column,msg);}};Parser.prototype.throwUnexpectedToken=function(token,message){throw this.unexpectedTokenError(token,message);};Parser.prototype.tolerateUnexpectedToken=function(token,message){this.errorHandler.tolerate(this.unexpectedTokenError(token,message));};Parser.prototype.collectComments=function(){if(!this.config.comment){this.scanner.scanComments();}else{var comments=this.scanner.scanComments();if(comments.length>0&&this.delegate){for(var i=0;i<comments.length;++i){var e=comments[i];var node=void 0;node={type:e.multiLine?'BlockComment':'LineComment',value:this.scanner.source.slice(e.slice[0],e.slice[1])};if(this.config.range){node.range=e.range;}if(this.config.loc){node.loc=e.loc;}var metadata={start:{line:e.loc.start.line,column:e.loc.start.column,offset:e.range[0]},end:{line:e.loc.end.line,column:e.loc.end.column,offset:e.range[1]}};this.delegate(node,metadata);}}}};// From internal representation to an external structure
+  Parser.prototype.getTokenRaw=function(token){return this.scanner.source.slice(token.start,token.end);};Parser.prototype.convertToken=function(token){var t={type:token_1.TokenName[token.type],value:this.getTokenRaw(token)};if(this.config.range){t.range=[token.start,token.end];}if(this.config.loc){t.loc={start:{line:this.startMarker.line,column:this.startMarker.column},end:{line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart}};}if(token.type===9/* RegularExpression */){var pattern=token.pattern;var flags=token.flags;t.regex={pattern:pattern,flags:flags};}return t;};Parser.prototype.nextToken=function(){var token=this.lookahead;this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;this.collectComments();if(this.scanner.index!==this.startMarker.index){this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart;}var next=this.scanner.lex();this.hasLineTerminator=token.lineNumber!==next.lineNumber;if(next&&this.context.strict&&next.type===3/* Identifier */){if(this.scanner.isStrictModeReservedWord(next.value)){next.type=4/* Keyword */;}}this.lookahead=next;if(this.config.tokens&&next.type!==2/* EOF */){this.tokens.push(this.convertToken(next));}return token;};Parser.prototype.nextRegexToken=function(){this.collectComments();var token=this.scanner.scanRegExp();if(this.config.tokens){// Pop the previous token, '/' or '/='
+  // This is added from the lookahead token.
+  this.tokens.pop();this.tokens.push(this.convertToken(token));}// Prime the next lookahead.
+  this.lookahead=token;this.nextToken();return token;};Parser.prototype.createNode=function(){return {index:this.startMarker.index,line:this.startMarker.line,column:this.startMarker.column};};Parser.prototype.startNode=function(token,lastLineStart){if(lastLineStart===void 0){lastLineStart=0;}var column=token.start-token.lineStart;var line=token.lineNumber;if(column<0){column+=lastLineStart;line--;}return {index:token.start,line:line,column:column};};Parser.prototype.finalize=function(marker,node){if(this.config.range){node.range=[marker.index,this.lastMarker.index];}if(this.config.loc){node.loc={start:{line:marker.line,column:marker.column},end:{line:this.lastMarker.line,column:this.lastMarker.column}};if(this.config.source){node.loc.source=this.config.source;}}if(this.delegate){var metadata={start:{line:marker.line,column:marker.column,offset:marker.index},end:{line:this.lastMarker.line,column:this.lastMarker.column,offset:this.lastMarker.index}};this.delegate(node,metadata);}return node;};// Expect the next token to match the specified punctuator.
+  // If not, an exception will be thrown.
+  Parser.prototype.expect=function(value){var token=this.nextToken();if(token.type!==7/* Punctuator */||token.value!==value){this.throwUnexpectedToken(token);}};// Quietly expect a comma when in tolerant mode, otherwise delegates to expect().
+  Parser.prototype.expectCommaSeparator=function(){if(this.config.tolerant){var token=this.lookahead;if(token.type===7/* Punctuator */&&token.value===','){this.nextToken();}else if(token.type===7/* Punctuator */&&token.value===';'){this.nextToken();this.tolerateUnexpectedToken(token);}else{this.tolerateUnexpectedToken(token,messages_1.Messages.UnexpectedToken);}}else{this.expect(',');}};// Expect the next token to match the specified keyword.
+  // If not, an exception will be thrown.
+  Parser.prototype.expectKeyword=function(keyword){var token=this.nextToken();if(token.type!==4/* Keyword */||token.value!==keyword){this.throwUnexpectedToken(token);}};// Return true if the next token matches the specified punctuator.
+  Parser.prototype.match=function(value){return this.lookahead.type===7/* Punctuator */&&this.lookahead.value===value;};// Return true if the next token matches the specified keyword
+  Parser.prototype.matchKeyword=function(keyword){return this.lookahead.type===4/* Keyword */&&this.lookahead.value===keyword;};// Return true if the next token matches the specified contextual keyword
+  // (where an identifier is sometimes a keyword depending on the context)
+  Parser.prototype.matchContextualKeyword=function(keyword){return this.lookahead.type===3/* Identifier */&&this.lookahead.value===keyword;};// Return true if the next token is an assignment operator
+  Parser.prototype.matchAssign=function(){if(this.lookahead.type!==7/* Punctuator */){return false;}var op=this.lookahead.value;return op==='='||op==='*='||op==='**='||op==='/='||op==='%='||op==='+='||op==='-='||op==='<<='||op==='>>='||op==='>>>='||op==='&='||op==='^='||op==='|=';};// Cover grammar support.
+  //
+  // When an assignment expression position starts with an left parenthesis, the determination of the type
+  // of the syntax is to be deferred arbitrarily long until the end of the parentheses pair (plus a lookahead)
+  // or the first comma. This situation also defers the determination of all the expressions nested in the pair.
+  //
+  // There are three productions that can be parsed in a parentheses pair that needs to be determined
+  // after the outermost pair is closed. They are:
+  //
+  //   1. AssignmentExpression
+  //   2. BindingElements
+  //   3. AssignmentTargets
+  //
+  // In order to avoid exponential backtracking, we use two flags to denote if the production can be
+  // binding element or assignment target.
+  //
+  // The three productions have the relationship:
+  //
+  //   BindingElements ⊆ AssignmentTargets ⊆ AssignmentExpression
+  //
+  // with a single exception that CoverInitializedName when used directly in an Expression, generates
+  // an early error. Therefore, we need the third state, firstCoverInitializedNameError, to track the
+  // first usage of CoverInitializedName and report it when we reached the end of the parentheses pair.
+  //
+  // isolateCoverGrammar function runs the given parser function with a new cover grammar context, and it does not
+  // effect the current flags. This means the production the parser parses is only used as an expression. Therefore
+  // the CoverInitializedName check is conducted.
+  //
+  // inheritCoverGrammar function runs the given parse function with a new cover grammar context, and it propagates
+  // the flags outside of the parser. This means the production the parser parses is used as a part of a potential
+  // pattern. The CoverInitializedName check is deferred.
+  Parser.prototype.isolateCoverGrammar=function(parseFunction){var previousIsBindingElement=this.context.isBindingElement;var previousIsAssignmentTarget=this.context.isAssignmentTarget;var previousFirstCoverInitializedNameError=this.context.firstCoverInitializedNameError;this.context.isBindingElement=true;this.context.isAssignmentTarget=true;this.context.firstCoverInitializedNameError=null;var result=parseFunction.call(this);if(this.context.firstCoverInitializedNameError!==null){this.throwUnexpectedToken(this.context.firstCoverInitializedNameError);}this.context.isBindingElement=previousIsBindingElement;this.context.isAssignmentTarget=previousIsAssignmentTarget;this.context.firstCoverInitializedNameError=previousFirstCoverInitializedNameError;return result;};Parser.prototype.inheritCoverGrammar=function(parseFunction){var previousIsBindingElement=this.context.isBindingElement;var previousIsAssignmentTarget=this.context.isAssignmentTarget;var previousFirstCoverInitializedNameError=this.context.firstCoverInitializedNameError;this.context.isBindingElement=true;this.context.isAssignmentTarget=true;this.context.firstCoverInitializedNameError=null;var result=parseFunction.call(this);this.context.isBindingElement=this.context.isBindingElement&&previousIsBindingElement;this.context.isAssignmentTarget=this.context.isAssignmentTarget&&previousIsAssignmentTarget;this.context.firstCoverInitializedNameError=previousFirstCoverInitializedNameError||this.context.firstCoverInitializedNameError;return result;};Parser.prototype.consumeSemicolon=function(){if(this.match(';')){this.nextToken();}else if(!this.hasLineTerminator){if(this.lookahead.type!==2/* EOF */&&!this.match('}')){this.throwUnexpectedToken(this.lookahead);}this.lastMarker.index=this.startMarker.index;this.lastMarker.line=this.startMarker.line;this.lastMarker.column=this.startMarker.column;}};// https://tc39.github.io/ecma262/#sec-primary-expression
+  Parser.prototype.parsePrimaryExpression=function(){var node=this.createNode();var expr;var token,raw;switch(this.lookahead.type){case 3/* Identifier */:if((this.context.isModule||this.context.await)&&this.lookahead.value==='await'){this.tolerateUnexpectedToken(this.lookahead);}expr=this.matchAsyncFunction()?this.parseFunctionExpression():this.finalize(node,new Node.Identifier(this.nextToken().value));break;case 6/* NumericLiteral */:case 8/* StringLiteral */:if(this.context.strict&&this.lookahead.octal){this.tolerateUnexpectedToken(this.lookahead,messages_1.Messages.StrictOctalLiteral);}this.context.isAssignmentTarget=false;this.context.isBindingElement=false;token=this.nextToken();raw=this.getTokenRaw(token);expr=this.finalize(node,new Node.Literal(token.value,raw));break;case 1/* BooleanLiteral */:this.context.isAssignmentTarget=false;this.context.isBindingElement=false;token=this.nextToken();raw=this.getTokenRaw(token);expr=this.finalize(node,new Node.Literal(token.value==='true',raw));break;case 5/* NullLiteral */:this.context.isAssignmentTarget=false;this.context.isBindingElement=false;token=this.nextToken();raw=this.getTokenRaw(token);expr=this.finalize(node,new Node.Literal(null,raw));break;case 10/* Template */:expr=this.parseTemplateLiteral();break;case 7/* Punctuator */:switch(this.lookahead.value){case'(':this.context.isBindingElement=false;expr=this.inheritCoverGrammar(this.parseGroupExpression);break;case'[':expr=this.inheritCoverGrammar(this.parseArrayInitializer);break;case'{':expr=this.inheritCoverGrammar(this.parseObjectInitializer);break;case'/':case'/=':this.context.isAssignmentTarget=false;this.context.isBindingElement=false;this.scanner.index=this.startMarker.index;token=this.nextRegexToken();raw=this.getTokenRaw(token);expr=this.finalize(node,new Node.RegexLiteral(token.regex,raw,token.pattern,token.flags));break;default:expr=this.throwUnexpectedToken(this.nextToken());}break;case 4/* Keyword */:if(!this.context.strict&&this.context.allowYield&&this.matchKeyword('yield')){expr=this.parseIdentifierName();}else if(!this.context.strict&&this.matchKeyword('let')){expr=this.finalize(node,new Node.Identifier(this.nextToken().value));}else{this.context.isAssignmentTarget=false;this.context.isBindingElement=false;if(this.matchKeyword('function')){expr=this.parseFunctionExpression();}else if(this.matchKeyword('this')){this.nextToken();expr=this.finalize(node,new Node.ThisExpression());}else if(this.matchKeyword('class')){expr=this.parseClassExpression();}else{expr=this.throwUnexpectedToken(this.nextToken());}}break;default:expr=this.throwUnexpectedToken(this.nextToken());}return expr;};// https://tc39.github.io/ecma262/#sec-array-initializer
+  Parser.prototype.parseSpreadElement=function(){var node=this.createNode();this.expect('...');var arg=this.inheritCoverGrammar(this.parseAssignmentExpression);return this.finalize(node,new Node.SpreadElement(arg));};Parser.prototype.parseArrayInitializer=function(){var node=this.createNode();var elements=[];this.expect('[');while(!this.match(']')){if(this.match(',')){this.nextToken();elements.push(null);}else if(this.match('...')){var element=this.parseSpreadElement();if(!this.match(']')){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;this.expect(',');}elements.push(element);}else{elements.push(this.inheritCoverGrammar(this.parseAssignmentExpression));if(!this.match(']')){this.expect(',');}}}this.expect(']');return this.finalize(node,new Node.ArrayExpression(elements));};// https://tc39.github.io/ecma262/#sec-object-initializer
+  Parser.prototype.parsePropertyMethod=function(params){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var previousStrict=this.context.strict;var previousAllowStrictDirective=this.context.allowStrictDirective;this.context.allowStrictDirective=params.simple;var body=this.isolateCoverGrammar(this.parseFunctionSourceElements);if(this.context.strict&&params.firstRestricted){this.tolerateUnexpectedToken(params.firstRestricted,params.message);}if(this.context.strict&&params.stricted){this.tolerateUnexpectedToken(params.stricted,params.message);}this.context.strict=previousStrict;this.context.allowStrictDirective=previousAllowStrictDirective;return body;};Parser.prototype.parsePropertyMethodFunction=function(){var isGenerator=false;var node=this.createNode();var previousAllowYield=this.context.allowYield;this.context.allowYield=true;var params=this.parseFormalParameters();var method=this.parsePropertyMethod(params);this.context.allowYield=previousAllowYield;return this.finalize(node,new Node.FunctionExpression(null,params.params,method,isGenerator));};Parser.prototype.parsePropertyMethodAsyncFunction=function(){var node=this.createNode();var previousAllowYield=this.context.allowYield;var previousAwait=this.context.await;this.context.allowYield=false;this.context.await=true;var params=this.parseFormalParameters();var method=this.parsePropertyMethod(params);this.context.allowYield=previousAllowYield;this.context.await=previousAwait;return this.finalize(node,new Node.AsyncFunctionExpression(null,params.params,method));};Parser.prototype.parseObjectPropertyKey=function(){var node=this.createNode();var token=this.nextToken();var key;switch(token.type){case 8/* StringLiteral */:case 6/* NumericLiteral */:if(this.context.strict&&token.octal){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictOctalLiteral);}var raw=this.getTokenRaw(token);key=this.finalize(node,new Node.Literal(token.value,raw));break;case 3/* Identifier */:case 1/* BooleanLiteral */:case 5/* NullLiteral */:case 4/* Keyword */:key=this.finalize(node,new Node.Identifier(token.value));break;case 7/* Punctuator */:if(token.value==='['){key=this.isolateCoverGrammar(this.parseAssignmentExpression);this.expect(']');}else{key=this.throwUnexpectedToken(token);}break;default:key=this.throwUnexpectedToken(token);}return key;};Parser.prototype.isPropertyKey=function(key,value){return key.type===syntax_1.Syntax.Identifier&&key.name===value||key.type===syntax_1.Syntax.Literal&&key.value===value;};Parser.prototype.parseObjectProperty=function(hasProto){var node=this.createNode();var token=this.lookahead;var kind;var key=null;var value=null;var computed=false;var method=false;var shorthand=false;var isAsync=false;if(token.type===3/* Identifier */){var id=token.value;this.nextToken();computed=this.match('[');isAsync=!this.hasLineTerminator&&id==='async'&&!this.match(':')&&!this.match('(')&&!this.match('*')&&!this.match(',');key=isAsync?this.parseObjectPropertyKey():this.finalize(node,new Node.Identifier(id));}else if(this.match('*')){this.nextToken();}else{computed=this.match('[');key=this.parseObjectPropertyKey();}var lookaheadPropertyKey=this.qualifiedPropertyName(this.lookahead);if(token.type===3/* Identifier */&&!isAsync&&token.value==='get'&&lookaheadPropertyKey){kind='get';computed=this.match('[');key=this.parseObjectPropertyKey();this.context.allowYield=false;value=this.parseGetterMethod();}else if(token.type===3/* Identifier */&&!isAsync&&token.value==='set'&&lookaheadPropertyKey){kind='set';computed=this.match('[');key=this.parseObjectPropertyKey();value=this.parseSetterMethod();}else if(token.type===7/* Punctuator */&&token.value==='*'&&lookaheadPropertyKey){kind='init';computed=this.match('[');key=this.parseObjectPropertyKey();value=this.parseGeneratorMethod();method=true;}else{if(!key){this.throwUnexpectedToken(this.lookahead);}kind='init';if(this.match(':')&&!isAsync){if(!computed&&this.isPropertyKey(key,'__proto__')){if(hasProto.value){this.tolerateError(messages_1.Messages.DuplicateProtoProperty);}hasProto.value=true;}this.nextToken();value=this.inheritCoverGrammar(this.parseAssignmentExpression);}else if(this.match('(')){value=isAsync?this.parsePropertyMethodAsyncFunction():this.parsePropertyMethodFunction();method=true;}else if(token.type===3/* Identifier */){var id=this.finalize(node,new Node.Identifier(token.value));if(this.match('=')){this.context.firstCoverInitializedNameError=this.lookahead;this.nextToken();shorthand=true;var init=this.isolateCoverGrammar(this.parseAssignmentExpression);value=this.finalize(node,new Node.AssignmentPattern(id,init));}else{shorthand=true;value=id;}}else{this.throwUnexpectedToken(this.nextToken());}}return this.finalize(node,new Node.Property(kind,key,computed,value,method,shorthand));};Parser.prototype.parseObjectInitializer=function(){var node=this.createNode();this.expect('{');var properties=[];var hasProto={value:false};while(!this.match('}')){properties.push(this.parseObjectProperty(hasProto));if(!this.match('}')){this.expectCommaSeparator();}}this.expect('}');return this.finalize(node,new Node.ObjectExpression(properties));};// https://tc39.github.io/ecma262/#sec-template-literals
+  Parser.prototype.parseTemplateHead=function(){assert_1.assert(this.lookahead.head,'Template literal must start with a template head');var node=this.createNode();var token=this.nextToken();var raw=token.value;var cooked=token.cooked;return this.finalize(node,new Node.TemplateElement({raw:raw,cooked:cooked},token.tail));};Parser.prototype.parseTemplateElement=function(){if(this.lookahead.type!==10/* Template */){this.throwUnexpectedToken();}var node=this.createNode();var token=this.nextToken();var raw=token.value;var cooked=token.cooked;return this.finalize(node,new Node.TemplateElement({raw:raw,cooked:cooked},token.tail));};Parser.prototype.parseTemplateLiteral=function(){var node=this.createNode();var expressions=[];var quasis=[];var quasi=this.parseTemplateHead();quasis.push(quasi);while(!quasi.tail){expressions.push(this.parseExpression());quasi=this.parseTemplateElement();quasis.push(quasi);}return this.finalize(node,new Node.TemplateLiteral(quasis,expressions));};// https://tc39.github.io/ecma262/#sec-grouping-operator
+  Parser.prototype.reinterpretExpressionAsPattern=function(expr){switch(expr.type){case syntax_1.Syntax.Identifier:case syntax_1.Syntax.MemberExpression:case syntax_1.Syntax.RestElement:case syntax_1.Syntax.AssignmentPattern:break;case syntax_1.Syntax.SpreadElement:expr.type=syntax_1.Syntax.RestElement;this.reinterpretExpressionAsPattern(expr.argument);break;case syntax_1.Syntax.ArrayExpression:expr.type=syntax_1.Syntax.ArrayPattern;for(var i=0;i<expr.elements.length;i++){if(expr.elements[i]!==null){this.reinterpretExpressionAsPattern(expr.elements[i]);}}break;case syntax_1.Syntax.ObjectExpression:expr.type=syntax_1.Syntax.ObjectPattern;for(var i=0;i<expr.properties.length;i++){this.reinterpretExpressionAsPattern(expr.properties[i].value);}break;case syntax_1.Syntax.AssignmentExpression:expr.type=syntax_1.Syntax.AssignmentPattern;delete expr.operator;this.reinterpretExpressionAsPattern(expr.left);break;default:// Allow other node type for tolerant parsing.
+  break;}};Parser.prototype.parseGroupExpression=function(){var expr;this.expect('(');if(this.match(')')){this.nextToken();if(!this.match('=>')){this.expect('=>');}expr={type:ArrowParameterPlaceHolder,params:[],async:false};}else{var startToken=this.lookahead;var params=[];if(this.match('...')){expr=this.parseRestElement(params);this.expect(')');if(!this.match('=>')){this.expect('=>');}expr={type:ArrowParameterPlaceHolder,params:[expr],async:false};}else{var arrow=false;this.context.isBindingElement=true;expr=this.inheritCoverGrammar(this.parseAssignmentExpression);if(this.match(',')){var expressions=[];this.context.isAssignmentTarget=false;expressions.push(expr);while(this.lookahead.type!==2/* EOF */){if(!this.match(',')){break;}this.nextToken();if(this.match(')')){this.nextToken();for(var i=0;i<expressions.length;i++){this.reinterpretExpressionAsPattern(expressions[i]);}arrow=true;expr={type:ArrowParameterPlaceHolder,params:expressions,async:false};}else if(this.match('...')){if(!this.context.isBindingElement){this.throwUnexpectedToken(this.lookahead);}expressions.push(this.parseRestElement(params));this.expect(')');if(!this.match('=>')){this.expect('=>');}this.context.isBindingElement=false;for(var i=0;i<expressions.length;i++){this.reinterpretExpressionAsPattern(expressions[i]);}arrow=true;expr={type:ArrowParameterPlaceHolder,params:expressions,async:false};}else{expressions.push(this.inheritCoverGrammar(this.parseAssignmentExpression));}if(arrow){break;}}if(!arrow){expr=this.finalize(this.startNode(startToken),new Node.SequenceExpression(expressions));}}if(!arrow){this.expect(')');if(this.match('=>')){if(expr.type===syntax_1.Syntax.Identifier&&expr.name==='yield'){arrow=true;expr={type:ArrowParameterPlaceHolder,params:[expr],async:false};}if(!arrow){if(!this.context.isBindingElement){this.throwUnexpectedToken(this.lookahead);}if(expr.type===syntax_1.Syntax.SequenceExpression){for(var i=0;i<expr.expressions.length;i++){this.reinterpretExpressionAsPattern(expr.expressions[i]);}}else{this.reinterpretExpressionAsPattern(expr);}var parameters=expr.type===syntax_1.Syntax.SequenceExpression?expr.expressions:[expr];expr={type:ArrowParameterPlaceHolder,params:parameters,async:false};}}this.context.isBindingElement=false;}}}return expr;};// https://tc39.github.io/ecma262/#sec-left-hand-side-expressions
+  Parser.prototype.parseArguments=function(){this.expect('(');var args=[];if(!this.match(')')){while(true){var expr=this.match('...')?this.parseSpreadElement():this.isolateCoverGrammar(this.parseAssignmentExpression);args.push(expr);if(this.match(')')){break;}this.expectCommaSeparator();if(this.match(')')){break;}}}this.expect(')');return args;};Parser.prototype.isIdentifierName=function(token){return token.type===3/* Identifier */||token.type===4/* Keyword */||token.type===1/* BooleanLiteral */||token.type===5/* NullLiteral */;};Parser.prototype.parseIdentifierName=function(){var node=this.createNode();var token=this.nextToken();if(!this.isIdentifierName(token)){this.throwUnexpectedToken(token);}return this.finalize(node,new Node.Identifier(token.value));};Parser.prototype.parseNewExpression=function(){var node=this.createNode();var id=this.parseIdentifierName();assert_1.assert(id.name==='new','New expression must start with `new`');var expr;if(this.match('.')){this.nextToken();if(this.lookahead.type===3/* Identifier */&&this.context.inFunctionBody&&this.lookahead.value==='target'){var property=this.parseIdentifierName();expr=new Node.MetaProperty(id,property);}else{this.throwUnexpectedToken(this.lookahead);}}else{var callee=this.isolateCoverGrammar(this.parseLeftHandSideExpression);var args=this.match('(')?this.parseArguments():[];expr=new Node.NewExpression(callee,args);this.context.isAssignmentTarget=false;this.context.isBindingElement=false;}return this.finalize(node,expr);};Parser.prototype.parseAsyncArgument=function(){var arg=this.parseAssignmentExpression();this.context.firstCoverInitializedNameError=null;return arg;};Parser.prototype.parseAsyncArguments=function(){this.expect('(');var args=[];if(!this.match(')')){while(true){var expr=this.match('...')?this.parseSpreadElement():this.isolateCoverGrammar(this.parseAsyncArgument);args.push(expr);if(this.match(')')){break;}this.expectCommaSeparator();if(this.match(')')){break;}}}this.expect(')');return args;};Parser.prototype.parseLeftHandSideExpressionAllowCall=function(){var startToken=this.lookahead;var maybeAsync=this.matchContextualKeyword('async');var previousAllowIn=this.context.allowIn;this.context.allowIn=true;var expr;if(this.matchKeyword('super')&&this.context.inFunctionBody){expr=this.createNode();this.nextToken();expr=this.finalize(expr,new Node.Super());if(!this.match('(')&&!this.match('.')&&!this.match('[')){this.throwUnexpectedToken(this.lookahead);}}else{expr=this.inheritCoverGrammar(this.matchKeyword('new')?this.parseNewExpression:this.parsePrimaryExpression);}while(true){if(this.match('.')){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect('.');var property=this.parseIdentifierName();expr=this.finalize(this.startNode(startToken),new Node.StaticMemberExpression(expr,property));}else if(this.match('(')){var asyncArrow=maybeAsync&&startToken.lineNumber===this.lookahead.lineNumber;this.context.isBindingElement=false;this.context.isAssignmentTarget=false;var args=asyncArrow?this.parseAsyncArguments():this.parseArguments();expr=this.finalize(this.startNode(startToken),new Node.CallExpression(expr,args));if(asyncArrow&&this.match('=>')){for(var i=0;i<args.length;++i){this.reinterpretExpressionAsPattern(args[i]);}expr={type:ArrowParameterPlaceHolder,params:args,async:true};}}else if(this.match('[')){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect('[');var property=this.isolateCoverGrammar(this.parseExpression);this.expect(']');expr=this.finalize(this.startNode(startToken),new Node.ComputedMemberExpression(expr,property));}else if(this.lookahead.type===10/* Template */&&this.lookahead.head){var quasi=this.parseTemplateLiteral();expr=this.finalize(this.startNode(startToken),new Node.TaggedTemplateExpression(expr,quasi));}else{break;}}this.context.allowIn=previousAllowIn;return expr;};Parser.prototype.parseSuper=function(){var node=this.createNode();this.expectKeyword('super');if(!this.match('[')&&!this.match('.')){this.throwUnexpectedToken(this.lookahead);}return this.finalize(node,new Node.Super());};Parser.prototype.parseLeftHandSideExpression=function(){assert_1.assert(this.context.allowIn,'callee of new expression always allow in keyword.');var node=this.startNode(this.lookahead);var expr=this.matchKeyword('super')&&this.context.inFunctionBody?this.parseSuper():this.inheritCoverGrammar(this.matchKeyword('new')?this.parseNewExpression:this.parsePrimaryExpression);while(true){if(this.match('[')){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect('[');var property=this.isolateCoverGrammar(this.parseExpression);this.expect(']');expr=this.finalize(node,new Node.ComputedMemberExpression(expr,property));}else if(this.match('.')){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect('.');var property=this.parseIdentifierName();expr=this.finalize(node,new Node.StaticMemberExpression(expr,property));}else if(this.lookahead.type===10/* Template */&&this.lookahead.head){var quasi=this.parseTemplateLiteral();expr=this.finalize(node,new Node.TaggedTemplateExpression(expr,quasi));}else{break;}}return expr;};// https://tc39.github.io/ecma262/#sec-update-expressions
+  Parser.prototype.parseUpdateExpression=function(){var expr;var startToken=this.lookahead;if(this.match('++')||this.match('--')){var node=this.startNode(startToken);var token=this.nextToken();expr=this.inheritCoverGrammar(this.parseUnaryExpression);if(this.context.strict&&expr.type===syntax_1.Syntax.Identifier&&this.scanner.isRestrictedWord(expr.name)){this.tolerateError(messages_1.Messages.StrictLHSPrefix);}if(!this.context.isAssignmentTarget){this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);}var prefix=true;expr=this.finalize(node,new Node.UpdateExpression(token.value,expr,prefix));this.context.isAssignmentTarget=false;this.context.isBindingElement=false;}else{expr=this.inheritCoverGrammar(this.parseLeftHandSideExpressionAllowCall);if(!this.hasLineTerminator&&this.lookahead.type===7/* Punctuator */){if(this.match('++')||this.match('--')){if(this.context.strict&&expr.type===syntax_1.Syntax.Identifier&&this.scanner.isRestrictedWord(expr.name)){this.tolerateError(messages_1.Messages.StrictLHSPostfix);}if(!this.context.isAssignmentTarget){this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);}this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var operator=this.nextToken().value;var prefix=false;expr=this.finalize(this.startNode(startToken),new Node.UpdateExpression(operator,expr,prefix));}}}return expr;};// https://tc39.github.io/ecma262/#sec-unary-operators
+  Parser.prototype.parseAwaitExpression=function(){var node=this.createNode();this.nextToken();var argument=this.parseUnaryExpression();return this.finalize(node,new Node.AwaitExpression(argument));};Parser.prototype.parseUnaryExpression=function(){var expr;if(this.match('+')||this.match('-')||this.match('~')||this.match('!')||this.matchKeyword('delete')||this.matchKeyword('void')||this.matchKeyword('typeof')){var node=this.startNode(this.lookahead);var token=this.nextToken();expr=this.inheritCoverGrammar(this.parseUnaryExpression);expr=this.finalize(node,new Node.UnaryExpression(token.value,expr));if(this.context.strict&&expr.operator==='delete'&&expr.argument.type===syntax_1.Syntax.Identifier){this.tolerateError(messages_1.Messages.StrictDelete);}this.context.isAssignmentTarget=false;this.context.isBindingElement=false;}else if(this.context.await&&this.matchContextualKeyword('await')){expr=this.parseAwaitExpression();}else{expr=this.parseUpdateExpression();}return expr;};Parser.prototype.parseExponentiationExpression=function(){var startToken=this.lookahead;var expr=this.inheritCoverGrammar(this.parseUnaryExpression);if(expr.type!==syntax_1.Syntax.UnaryExpression&&this.match('**')){this.nextToken();this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var left=expr;var right=this.isolateCoverGrammar(this.parseExponentiationExpression);expr=this.finalize(this.startNode(startToken),new Node.BinaryExpression('**',left,right));}return expr;};// https://tc39.github.io/ecma262/#sec-exp-operator
+  // https://tc39.github.io/ecma262/#sec-multiplicative-operators
+  // https://tc39.github.io/ecma262/#sec-additive-operators
+  // https://tc39.github.io/ecma262/#sec-bitwise-shift-operators
+  // https://tc39.github.io/ecma262/#sec-relational-operators
+  // https://tc39.github.io/ecma262/#sec-equality-operators
+  // https://tc39.github.io/ecma262/#sec-binary-bitwise-operators
+  // https://tc39.github.io/ecma262/#sec-binary-logical-operators
+  Parser.prototype.binaryPrecedence=function(token){var op=token.value;var precedence;if(token.type===7/* Punctuator */){precedence=this.operatorPrecedence[op]||0;}else if(token.type===4/* Keyword */){precedence=op==='instanceof'||this.context.allowIn&&op==='in'?7:0;}else{precedence=0;}return precedence;};Parser.prototype.parseBinaryExpression=function(){var startToken=this.lookahead;var expr=this.inheritCoverGrammar(this.parseExponentiationExpression);var token=this.lookahead;var prec=this.binaryPrecedence(token);if(prec>0){this.nextToken();this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var markers=[startToken,this.lookahead];var left=expr;var right=this.isolateCoverGrammar(this.parseExponentiationExpression);var stack=[left,token.value,right];var precedences=[prec];while(true){prec=this.binaryPrecedence(this.lookahead);if(prec<=0){break;}// Reduce: make a binary expression from the three topmost entries.
+  while(stack.length>2&&prec<=precedences[precedences.length-1]){right=stack.pop();var operator=stack.pop();precedences.pop();left=stack.pop();markers.pop();var node=this.startNode(markers[markers.length-1]);stack.push(this.finalize(node,new Node.BinaryExpression(operator,left,right)));}// Shift.
+  stack.push(this.nextToken().value);precedences.push(prec);markers.push(this.lookahead);stack.push(this.isolateCoverGrammar(this.parseExponentiationExpression));}// Final reduce to clean-up the stack.
+  var i=stack.length-1;expr=stack[i];var lastMarker=markers.pop();while(i>1){var marker=markers.pop();var lastLineStart=lastMarker&&lastMarker.lineStart;var node=this.startNode(marker,lastLineStart);var operator=stack[i-1];expr=this.finalize(node,new Node.BinaryExpression(operator,stack[i-2],expr));i-=2;lastMarker=marker;}}return expr;};// https://tc39.github.io/ecma262/#sec-conditional-operator
+  Parser.prototype.parseConditionalExpression=function(){var startToken=this.lookahead;var expr=this.inheritCoverGrammar(this.parseBinaryExpression);if(this.match('?')){this.nextToken();var previousAllowIn=this.context.allowIn;this.context.allowIn=true;var consequent=this.isolateCoverGrammar(this.parseAssignmentExpression);this.context.allowIn=previousAllowIn;this.expect(':');var alternate=this.isolateCoverGrammar(this.parseAssignmentExpression);expr=this.finalize(this.startNode(startToken),new Node.ConditionalExpression(expr,consequent,alternate));this.context.isAssignmentTarget=false;this.context.isBindingElement=false;}return expr;};// https://tc39.github.io/ecma262/#sec-assignment-operators
+  Parser.prototype.checkPatternParam=function(options,param){switch(param.type){case syntax_1.Syntax.Identifier:this.validateParam(options,param,param.name);break;case syntax_1.Syntax.RestElement:this.checkPatternParam(options,param.argument);break;case syntax_1.Syntax.AssignmentPattern:this.checkPatternParam(options,param.left);break;case syntax_1.Syntax.ArrayPattern:for(var i=0;i<param.elements.length;i++){if(param.elements[i]!==null){this.checkPatternParam(options,param.elements[i]);}}break;case syntax_1.Syntax.ObjectPattern:for(var i=0;i<param.properties.length;i++){this.checkPatternParam(options,param.properties[i].value);}break;default:break;}options.simple=options.simple&&param instanceof Node.Identifier;};Parser.prototype.reinterpretAsCoverFormalsList=function(expr){var params=[expr];var options;var asyncArrow=false;switch(expr.type){case syntax_1.Syntax.Identifier:break;case ArrowParameterPlaceHolder:params=expr.params;asyncArrow=expr.async;break;default:return null;}options={simple:true,paramSet:{}};for(var i=0;i<params.length;++i){var param=params[i];if(param.type===syntax_1.Syntax.AssignmentPattern){if(param.right.type===syntax_1.Syntax.YieldExpression){if(param.right.argument){this.throwUnexpectedToken(this.lookahead);}param.right.type=syntax_1.Syntax.Identifier;param.right.name='yield';delete param.right.argument;delete param.right.delegate;}}else if(asyncArrow&&param.type===syntax_1.Syntax.Identifier&&param.name==='await'){this.throwUnexpectedToken(this.lookahead);}this.checkPatternParam(options,param);params[i]=param;}if(this.context.strict||!this.context.allowYield){for(var i=0;i<params.length;++i){var param=params[i];if(param.type===syntax_1.Syntax.YieldExpression){this.throwUnexpectedToken(this.lookahead);}}}if(options.message===messages_1.Messages.StrictParamDupe){var token=this.context.strict?options.stricted:options.firstRestricted;this.throwUnexpectedToken(token,options.message);}return {simple:options.simple,params:params,stricted:options.stricted,firstRestricted:options.firstRestricted,message:options.message};};Parser.prototype.parseAssignmentExpression=function(){var expr;if(!this.context.allowYield&&this.matchKeyword('yield')){expr=this.parseYieldExpression();}else{var startToken=this.lookahead;var token=startToken;expr=this.parseConditionalExpression();if(token.type===3/* Identifier */&&token.lineNumber===this.lookahead.lineNumber&&token.value==='async'){if(this.lookahead.type===3/* Identifier */||this.matchKeyword('yield')){var arg=this.parsePrimaryExpression();this.reinterpretExpressionAsPattern(arg);expr={type:ArrowParameterPlaceHolder,params:[arg],async:true};}}if(expr.type===ArrowParameterPlaceHolder||this.match('=>')){// https://tc39.github.io/ecma262/#sec-arrow-function-definitions
+  this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var isAsync=expr.async;var list=this.reinterpretAsCoverFormalsList(expr);if(list){if(this.hasLineTerminator){this.tolerateUnexpectedToken(this.lookahead);}this.context.firstCoverInitializedNameError=null;var previousStrict=this.context.strict;var previousAllowStrictDirective=this.context.allowStrictDirective;this.context.allowStrictDirective=list.simple;var previousAllowYield=this.context.allowYield;var previousAwait=this.context.await;this.context.allowYield=true;this.context.await=isAsync;var node=this.startNode(startToken);this.expect('=>');var body=void 0;if(this.match('{')){var previousAllowIn=this.context.allowIn;this.context.allowIn=true;body=this.parseFunctionSourceElements();this.context.allowIn=previousAllowIn;}else{body=this.isolateCoverGrammar(this.parseAssignmentExpression);}var expression=body.type!==syntax_1.Syntax.BlockStatement;if(this.context.strict&&list.firstRestricted){this.throwUnexpectedToken(list.firstRestricted,list.message);}if(this.context.strict&&list.stricted){this.tolerateUnexpectedToken(list.stricted,list.message);}expr=isAsync?this.finalize(node,new Node.AsyncArrowFunctionExpression(list.params,body,expression)):this.finalize(node,new Node.ArrowFunctionExpression(list.params,body,expression));this.context.strict=previousStrict;this.context.allowStrictDirective=previousAllowStrictDirective;this.context.allowYield=previousAllowYield;this.context.await=previousAwait;}}else{if(this.matchAssign()){if(!this.context.isAssignmentTarget){this.tolerateError(messages_1.Messages.InvalidLHSInAssignment);}if(this.context.strict&&expr.type===syntax_1.Syntax.Identifier){var id=expr;if(this.scanner.isRestrictedWord(id.name)){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictLHSAssignment);}if(this.scanner.isStrictModeReservedWord(id.name)){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictReservedWord);}}if(!this.match('=')){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;}else{this.reinterpretExpressionAsPattern(expr);}token=this.nextToken();var operator=token.value;var right=this.isolateCoverGrammar(this.parseAssignmentExpression);expr=this.finalize(this.startNode(startToken),new Node.AssignmentExpression(operator,expr,right));this.context.firstCoverInitializedNameError=null;}}}return expr;};// https://tc39.github.io/ecma262/#sec-comma-operator
+  Parser.prototype.parseExpression=function(){var startToken=this.lookahead;var expr=this.isolateCoverGrammar(this.parseAssignmentExpression);if(this.match(',')){var expressions=[];expressions.push(expr);while(this.lookahead.type!==2/* EOF */){if(!this.match(',')){break;}this.nextToken();expressions.push(this.isolateCoverGrammar(this.parseAssignmentExpression));}expr=this.finalize(this.startNode(startToken),new Node.SequenceExpression(expressions));}return expr;};// https://tc39.github.io/ecma262/#sec-block
+  Parser.prototype.parseStatementListItem=function(){var statement;this.context.isAssignmentTarget=true;this.context.isBindingElement=true;if(this.lookahead.type===4/* Keyword */){switch(this.lookahead.value){case'export':if(!this.context.isModule){this.tolerateUnexpectedToken(this.lookahead,messages_1.Messages.IllegalExportDeclaration);}statement=this.parseExportDeclaration();break;case'import':if(!this.context.isModule){this.tolerateUnexpectedToken(this.lookahead,messages_1.Messages.IllegalImportDeclaration);}statement=this.parseImportDeclaration();break;case'const':statement=this.parseLexicalDeclaration({inFor:false});break;case'function':statement=this.parseFunctionDeclaration();break;case'class':statement=this.parseClassDeclaration();break;case'let':statement=this.isLexicalDeclaration()?this.parseLexicalDeclaration({inFor:false}):this.parseStatement();break;default:statement=this.parseStatement();break;}}else{statement=this.parseStatement();}return statement;};Parser.prototype.parseBlock=function(){var node=this.createNode();this.expect('{');var block=[];while(true){if(this.match('}')){break;}block.push(this.parseStatementListItem());}this.expect('}');return this.finalize(node,new Node.BlockStatement(block));};// https://tc39.github.io/ecma262/#sec-let-and-const-declarations
+  Parser.prototype.parseLexicalBinding=function(kind,options){var node=this.createNode();var params=[];var id=this.parsePattern(params,kind);if(this.context.strict&&id.type===syntax_1.Syntax.Identifier){if(this.scanner.isRestrictedWord(id.name)){this.tolerateError(messages_1.Messages.StrictVarName);}}var init=null;if(kind==='const'){if(!this.matchKeyword('in')&&!this.matchContextualKeyword('of')){if(this.match('=')){this.nextToken();init=this.isolateCoverGrammar(this.parseAssignmentExpression);}else{this.throwError(messages_1.Messages.DeclarationMissingInitializer,'const');}}}else if(!options.inFor&&id.type!==syntax_1.Syntax.Identifier||this.match('=')){this.expect('=');init=this.isolateCoverGrammar(this.parseAssignmentExpression);}return this.finalize(node,new Node.VariableDeclarator(id,init));};Parser.prototype.parseBindingList=function(kind,options){var list=[this.parseLexicalBinding(kind,options)];while(this.match(',')){this.nextToken();list.push(this.parseLexicalBinding(kind,options));}return list;};Parser.prototype.isLexicalDeclaration=function(){var state=this.scanner.saveState();this.scanner.scanComments();var next=this.scanner.lex();this.scanner.restoreState(state);return next.type===3/* Identifier */||next.type===7/* Punctuator */&&next.value==='['||next.type===7/* Punctuator */&&next.value==='{'||next.type===4/* Keyword */&&next.value==='let'||next.type===4/* Keyword */&&next.value==='yield';};Parser.prototype.parseLexicalDeclaration=function(options){var node=this.createNode();var kind=this.nextToken().value;assert_1.assert(kind==='let'||kind==='const','Lexical declaration must be either let or const');var declarations=this.parseBindingList(kind,options);this.consumeSemicolon();return this.finalize(node,new Node.VariableDeclaration(declarations,kind));};// https://tc39.github.io/ecma262/#sec-destructuring-binding-patterns
+  Parser.prototype.parseBindingRestElement=function(params,kind){var node=this.createNode();this.expect('...');var arg=this.parsePattern(params,kind);return this.finalize(node,new Node.RestElement(arg));};Parser.prototype.parseArrayPattern=function(params,kind){var node=this.createNode();this.expect('[');var elements=[];while(!this.match(']')){if(this.match(',')){this.nextToken();elements.push(null);}else{if(this.match('...')){elements.push(this.parseBindingRestElement(params,kind));break;}else{elements.push(this.parsePatternWithDefault(params,kind));}if(!this.match(']')){this.expect(',');}}}this.expect(']');return this.finalize(node,new Node.ArrayPattern(elements));};Parser.prototype.parsePropertyPattern=function(params,kind){var node=this.createNode();var computed=false;var shorthand=false;var method=false;var key;var value;if(this.lookahead.type===3/* Identifier */){var keyToken=this.lookahead;key=this.parseVariableIdentifier();var init=this.finalize(node,new Node.Identifier(keyToken.value));if(this.match('=')){params.push(keyToken);shorthand=true;this.nextToken();var expr=this.parseAssignmentExpression();value=this.finalize(this.startNode(keyToken),new Node.AssignmentPattern(init,expr));}else if(!this.match(':')){params.push(keyToken);shorthand=true;value=init;}else{this.expect(':');value=this.parsePatternWithDefault(params,kind);}}else{computed=this.match('[');key=this.parseObjectPropertyKey();this.expect(':');value=this.parsePatternWithDefault(params,kind);}return this.finalize(node,new Node.Property('init',key,computed,value,method,shorthand));};Parser.prototype.parseObjectPattern=function(params,kind){var node=this.createNode();var properties=[];this.expect('{');while(!this.match('}')){properties.push(this.parsePropertyPattern(params,kind));if(!this.match('}')){this.expect(',');}}this.expect('}');return this.finalize(node,new Node.ObjectPattern(properties));};Parser.prototype.parsePattern=function(params,kind){var pattern;if(this.match('[')){pattern=this.parseArrayPattern(params,kind);}else if(this.match('{')){pattern=this.parseObjectPattern(params,kind);}else{if(this.matchKeyword('let')&&(kind==='const'||kind==='let')){this.tolerateUnexpectedToken(this.lookahead,messages_1.Messages.LetInLexicalBinding);}params.push(this.lookahead);pattern=this.parseVariableIdentifier(kind);}return pattern;};Parser.prototype.parsePatternWithDefault=function(params,kind){var startToken=this.lookahead;var pattern=this.parsePattern(params,kind);if(this.match('=')){this.nextToken();var previousAllowYield=this.context.allowYield;this.context.allowYield=true;var right=this.isolateCoverGrammar(this.parseAssignmentExpression);this.context.allowYield=previousAllowYield;pattern=this.finalize(this.startNode(startToken),new Node.AssignmentPattern(pattern,right));}return pattern;};// https://tc39.github.io/ecma262/#sec-variable-statement
+  Parser.prototype.parseVariableIdentifier=function(kind){var node=this.createNode();var token=this.nextToken();if(token.type===4/* Keyword */&&token.value==='yield'){if(this.context.strict){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictReservedWord);}else if(!this.context.allowYield){this.throwUnexpectedToken(token);}}else if(token.type!==3/* Identifier */){if(this.context.strict&&token.type===4/* Keyword */&&this.scanner.isStrictModeReservedWord(token.value)){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictReservedWord);}else{if(this.context.strict||token.value!=='let'||kind!=='var'){this.throwUnexpectedToken(token);}}}else if((this.context.isModule||this.context.await)&&token.type===3/* Identifier */&&token.value==='await'){this.tolerateUnexpectedToken(token);}return this.finalize(node,new Node.Identifier(token.value));};Parser.prototype.parseVariableDeclaration=function(options){var node=this.createNode();var params=[];var id=this.parsePattern(params,'var');if(this.context.strict&&id.type===syntax_1.Syntax.Identifier){if(this.scanner.isRestrictedWord(id.name)){this.tolerateError(messages_1.Messages.StrictVarName);}}var init=null;if(this.match('=')){this.nextToken();init=this.isolateCoverGrammar(this.parseAssignmentExpression);}else if(id.type!==syntax_1.Syntax.Identifier&&!options.inFor){this.expect('=');}return this.finalize(node,new Node.VariableDeclarator(id,init));};Parser.prototype.parseVariableDeclarationList=function(options){var opt={inFor:options.inFor};var list=[];list.push(this.parseVariableDeclaration(opt));while(this.match(',')){this.nextToken();list.push(this.parseVariableDeclaration(opt));}return list;};Parser.prototype.parseVariableStatement=function(){var node=this.createNode();this.expectKeyword('var');var declarations=this.parseVariableDeclarationList({inFor:false});this.consumeSemicolon();return this.finalize(node,new Node.VariableDeclaration(declarations,'var'));};// https://tc39.github.io/ecma262/#sec-empty-statement
+  Parser.prototype.parseEmptyStatement=function(){var node=this.createNode();this.expect(';');return this.finalize(node,new Node.EmptyStatement());};// https://tc39.github.io/ecma262/#sec-expression-statement
+  Parser.prototype.parseExpressionStatement=function(){var node=this.createNode();var expr=this.parseExpression();this.consumeSemicolon();return this.finalize(node,new Node.ExpressionStatement(expr));};// https://tc39.github.io/ecma262/#sec-if-statement
+  Parser.prototype.parseIfClause=function(){if(this.context.strict&&this.matchKeyword('function')){this.tolerateError(messages_1.Messages.StrictFunction);}return this.parseStatement();};Parser.prototype.parseIfStatement=function(){var node=this.createNode();var consequent;var alternate=null;this.expectKeyword('if');this.expect('(');var test=this.parseExpression();if(!this.match(')')&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());consequent=this.finalize(this.createNode(),new Node.EmptyStatement());}else{this.expect(')');consequent=this.parseIfClause();if(this.matchKeyword('else')){this.nextToken();alternate=this.parseIfClause();}}return this.finalize(node,new Node.IfStatement(test,consequent,alternate));};// https://tc39.github.io/ecma262/#sec-do-while-statement
+  Parser.prototype.parseDoWhileStatement=function(){var node=this.createNode();this.expectKeyword('do');var previousInIteration=this.context.inIteration;this.context.inIteration=true;var body=this.parseStatement();this.context.inIteration=previousInIteration;this.expectKeyword('while');this.expect('(');var test=this.parseExpression();if(!this.match(')')&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());}else{this.expect(')');if(this.match(';')){this.nextToken();}}return this.finalize(node,new Node.DoWhileStatement(body,test));};// https://tc39.github.io/ecma262/#sec-while-statement
+  Parser.prototype.parseWhileStatement=function(){var node=this.createNode();var body;this.expectKeyword('while');this.expect('(');var test=this.parseExpression();if(!this.match(')')&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());body=this.finalize(this.createNode(),new Node.EmptyStatement());}else{this.expect(')');var previousInIteration=this.context.inIteration;this.context.inIteration=true;body=this.parseStatement();this.context.inIteration=previousInIteration;}return this.finalize(node,new Node.WhileStatement(test,body));};// https://tc39.github.io/ecma262/#sec-for-statement
+  // https://tc39.github.io/ecma262/#sec-for-in-and-for-of-statements
+  Parser.prototype.parseForStatement=function(){var init=null;var test=null;var update=null;var forIn=true;var left,right;var node=this.createNode();this.expectKeyword('for');this.expect('(');if(this.match(';')){this.nextToken();}else{if(this.matchKeyword('var')){init=this.createNode();this.nextToken();var previousAllowIn=this.context.allowIn;this.context.allowIn=false;var declarations=this.parseVariableDeclarationList({inFor:true});this.context.allowIn=previousAllowIn;if(declarations.length===1&&this.matchKeyword('in')){var decl=declarations[0];if(decl.init&&(decl.id.type===syntax_1.Syntax.ArrayPattern||decl.id.type===syntax_1.Syntax.ObjectPattern||this.context.strict)){this.tolerateError(messages_1.Messages.ForInOfLoopInitializer,'for-in');}init=this.finalize(init,new Node.VariableDeclaration(declarations,'var'));this.nextToken();left=init;right=this.parseExpression();init=null;}else if(declarations.length===1&&declarations[0].init===null&&this.matchContextualKeyword('of')){init=this.finalize(init,new Node.VariableDeclaration(declarations,'var'));this.nextToken();left=init;right=this.parseAssignmentExpression();init=null;forIn=false;}else{init=this.finalize(init,new Node.VariableDeclaration(declarations,'var'));this.expect(';');}}else if(this.matchKeyword('const')||this.matchKeyword('let')){init=this.createNode();var kind=this.nextToken().value;if(!this.context.strict&&this.lookahead.value==='in'){init=this.finalize(init,new Node.Identifier(kind));this.nextToken();left=init;right=this.parseExpression();init=null;}else{var previousAllowIn=this.context.allowIn;this.context.allowIn=false;var declarations=this.parseBindingList(kind,{inFor:true});this.context.allowIn=previousAllowIn;if(declarations.length===1&&declarations[0].init===null&&this.matchKeyword('in')){init=this.finalize(init,new Node.VariableDeclaration(declarations,kind));this.nextToken();left=init;right=this.parseExpression();init=null;}else if(declarations.length===1&&declarations[0].init===null&&this.matchContextualKeyword('of')){init=this.finalize(init,new Node.VariableDeclaration(declarations,kind));this.nextToken();left=init;right=this.parseAssignmentExpression();init=null;forIn=false;}else{this.consumeSemicolon();init=this.finalize(init,new Node.VariableDeclaration(declarations,kind));}}}else{var initStartToken=this.lookahead;var previousAllowIn=this.context.allowIn;this.context.allowIn=false;init=this.inheritCoverGrammar(this.parseAssignmentExpression);this.context.allowIn=previousAllowIn;if(this.matchKeyword('in')){if(!this.context.isAssignmentTarget||init.type===syntax_1.Syntax.AssignmentExpression){this.tolerateError(messages_1.Messages.InvalidLHSInForIn);}this.nextToken();this.reinterpretExpressionAsPattern(init);left=init;right=this.parseExpression();init=null;}else if(this.matchContextualKeyword('of')){if(!this.context.isAssignmentTarget||init.type===syntax_1.Syntax.AssignmentExpression){this.tolerateError(messages_1.Messages.InvalidLHSInForLoop);}this.nextToken();this.reinterpretExpressionAsPattern(init);left=init;right=this.parseAssignmentExpression();init=null;forIn=false;}else{if(this.match(',')){var initSeq=[init];while(this.match(',')){this.nextToken();initSeq.push(this.isolateCoverGrammar(this.parseAssignmentExpression));}init=this.finalize(this.startNode(initStartToken),new Node.SequenceExpression(initSeq));}this.expect(';');}}}if(typeof left==='undefined'){if(!this.match(';')){test=this.parseExpression();}this.expect(';');if(!this.match(')')){update=this.parseExpression();}}var body;if(!this.match(')')&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());body=this.finalize(this.createNode(),new Node.EmptyStatement());}else{this.expect(')');var previousInIteration=this.context.inIteration;this.context.inIteration=true;body=this.isolateCoverGrammar(this.parseStatement);this.context.inIteration=previousInIteration;}return typeof left==='undefined'?this.finalize(node,new Node.ForStatement(init,test,update,body)):forIn?this.finalize(node,new Node.ForInStatement(left,right,body)):this.finalize(node,new Node.ForOfStatement(left,right,body));};// https://tc39.github.io/ecma262/#sec-continue-statement
+  Parser.prototype.parseContinueStatement=function(){var node=this.createNode();this.expectKeyword('continue');var label=null;if(this.lookahead.type===3/* Identifier */&&!this.hasLineTerminator){var id=this.parseVariableIdentifier();label=id;var key='$'+id.name;if(!Object.prototype.hasOwnProperty.call(this.context.labelSet,key)){this.throwError(messages_1.Messages.UnknownLabel,id.name);}}this.consumeSemicolon();if(label===null&&!this.context.inIteration){this.throwError(messages_1.Messages.IllegalContinue);}return this.finalize(node,new Node.ContinueStatement(label));};// https://tc39.github.io/ecma262/#sec-break-statement
+  Parser.prototype.parseBreakStatement=function(){var node=this.createNode();this.expectKeyword('break');var label=null;if(this.lookahead.type===3/* Identifier */&&!this.hasLineTerminator){var id=this.parseVariableIdentifier();var key='$'+id.name;if(!Object.prototype.hasOwnProperty.call(this.context.labelSet,key)){this.throwError(messages_1.Messages.UnknownLabel,id.name);}label=id;}this.consumeSemicolon();if(label===null&&!this.context.inIteration&&!this.context.inSwitch){this.throwError(messages_1.Messages.IllegalBreak);}return this.finalize(node,new Node.BreakStatement(label));};// https://tc39.github.io/ecma262/#sec-return-statement
+  Parser.prototype.parseReturnStatement=function(){if(!this.context.inFunctionBody){this.tolerateError(messages_1.Messages.IllegalReturn);}var node=this.createNode();this.expectKeyword('return');var hasArgument=!this.match(';')&&!this.match('}')&&!this.hasLineTerminator&&this.lookahead.type!==2/* EOF */||this.lookahead.type===8/* StringLiteral */||this.lookahead.type===10/* Template */;var argument=hasArgument?this.parseExpression():null;this.consumeSemicolon();return this.finalize(node,new Node.ReturnStatement(argument));};// https://tc39.github.io/ecma262/#sec-with-statement
+  Parser.prototype.parseWithStatement=function(){if(this.context.strict){this.tolerateError(messages_1.Messages.StrictModeWith);}var node=this.createNode();var body;this.expectKeyword('with');this.expect('(');var object=this.parseExpression();if(!this.match(')')&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());body=this.finalize(this.createNode(),new Node.EmptyStatement());}else{this.expect(')');body=this.parseStatement();}return this.finalize(node,new Node.WithStatement(object,body));};// https://tc39.github.io/ecma262/#sec-switch-statement
+  Parser.prototype.parseSwitchCase=function(){var node=this.createNode();var test;if(this.matchKeyword('default')){this.nextToken();test=null;}else{this.expectKeyword('case');test=this.parseExpression();}this.expect(':');var consequent=[];while(true){if(this.match('}')||this.matchKeyword('default')||this.matchKeyword('case')){break;}consequent.push(this.parseStatementListItem());}return this.finalize(node,new Node.SwitchCase(test,consequent));};Parser.prototype.parseSwitchStatement=function(){var node=this.createNode();this.expectKeyword('switch');this.expect('(');var discriminant=this.parseExpression();this.expect(')');var previousInSwitch=this.context.inSwitch;this.context.inSwitch=true;var cases=[];var defaultFound=false;this.expect('{');while(true){if(this.match('}')){break;}var clause=this.parseSwitchCase();if(clause.test===null){if(defaultFound){this.throwError(messages_1.Messages.MultipleDefaultsInSwitch);}defaultFound=true;}cases.push(clause);}this.expect('}');this.context.inSwitch=previousInSwitch;return this.finalize(node,new Node.SwitchStatement(discriminant,cases));};// https://tc39.github.io/ecma262/#sec-labelled-statements
+  Parser.prototype.parseLabelledStatement=function(){var node=this.createNode();var expr=this.parseExpression();var statement;if(expr.type===syntax_1.Syntax.Identifier&&this.match(':')){this.nextToken();var id=expr;var key='$'+id.name;if(Object.prototype.hasOwnProperty.call(this.context.labelSet,key)){this.throwError(messages_1.Messages.Redeclaration,'Label',id.name);}this.context.labelSet[key]=true;var body=void 0;if(this.matchKeyword('class')){this.tolerateUnexpectedToken(this.lookahead);body=this.parseClassDeclaration();}else if(this.matchKeyword('function')){var token=this.lookahead;var declaration=this.parseFunctionDeclaration();if(this.context.strict){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictFunction);}else if(declaration.generator){this.tolerateUnexpectedToken(token,messages_1.Messages.GeneratorInLegacyContext);}body=declaration;}else{body=this.parseStatement();}delete this.context.labelSet[key];statement=new Node.LabeledStatement(id,body);}else{this.consumeSemicolon();statement=new Node.ExpressionStatement(expr);}return this.finalize(node,statement);};// https://tc39.github.io/ecma262/#sec-throw-statement
+  Parser.prototype.parseThrowStatement=function(){var node=this.createNode();this.expectKeyword('throw');if(this.hasLineTerminator){this.throwError(messages_1.Messages.NewlineAfterThrow);}var argument=this.parseExpression();this.consumeSemicolon();return this.finalize(node,new Node.ThrowStatement(argument));};// https://tc39.github.io/ecma262/#sec-try-statement
+  Parser.prototype.parseCatchClause=function(){var node=this.createNode();this.expectKeyword('catch');this.expect('(');if(this.match(')')){this.throwUnexpectedToken(this.lookahead);}var params=[];var param=this.parsePattern(params);var paramMap={};for(var i=0;i<params.length;i++){var key='$'+params[i].value;if(Object.prototype.hasOwnProperty.call(paramMap,key)){this.tolerateError(messages_1.Messages.DuplicateBinding,params[i].value);}paramMap[key]=true;}if(this.context.strict&&param.type===syntax_1.Syntax.Identifier){if(this.scanner.isRestrictedWord(param.name)){this.tolerateError(messages_1.Messages.StrictCatchVariable);}}this.expect(')');var body=this.parseBlock();return this.finalize(node,new Node.CatchClause(param,body));};Parser.prototype.parseFinallyClause=function(){this.expectKeyword('finally');return this.parseBlock();};Parser.prototype.parseTryStatement=function(){var node=this.createNode();this.expectKeyword('try');var block=this.parseBlock();var handler=this.matchKeyword('catch')?this.parseCatchClause():null;var finalizer=this.matchKeyword('finally')?this.parseFinallyClause():null;if(!handler&&!finalizer){this.throwError(messages_1.Messages.NoCatchOrFinally);}return this.finalize(node,new Node.TryStatement(block,handler,finalizer));};// https://tc39.github.io/ecma262/#sec-debugger-statement
+  Parser.prototype.parseDebuggerStatement=function(){var node=this.createNode();this.expectKeyword('debugger');this.consumeSemicolon();return this.finalize(node,new Node.DebuggerStatement());};// https://tc39.github.io/ecma262/#sec-ecmascript-language-statements-and-declarations
+  Parser.prototype.parseStatement=function(){var statement;switch(this.lookahead.type){case 1/* BooleanLiteral */:case 5/* NullLiteral */:case 6/* NumericLiteral */:case 8/* StringLiteral */:case 10/* Template */:case 9/* RegularExpression */:statement=this.parseExpressionStatement();break;case 7/* Punctuator */:var value=this.lookahead.value;if(value==='{'){statement=this.parseBlock();}else if(value==='('){statement=this.parseExpressionStatement();}else if(value===';'){statement=this.parseEmptyStatement();}else{statement=this.parseExpressionStatement();}break;case 3/* Identifier */:statement=this.matchAsyncFunction()?this.parseFunctionDeclaration():this.parseLabelledStatement();break;case 4/* Keyword */:switch(this.lookahead.value){case'break':statement=this.parseBreakStatement();break;case'continue':statement=this.parseContinueStatement();break;case'debugger':statement=this.parseDebuggerStatement();break;case'do':statement=this.parseDoWhileStatement();break;case'for':statement=this.parseForStatement();break;case'function':statement=this.parseFunctionDeclaration();break;case'if':statement=this.parseIfStatement();break;case'return':statement=this.parseReturnStatement();break;case'switch':statement=this.parseSwitchStatement();break;case'throw':statement=this.parseThrowStatement();break;case'try':statement=this.parseTryStatement();break;case'var':statement=this.parseVariableStatement();break;case'while':statement=this.parseWhileStatement();break;case'with':statement=this.parseWithStatement();break;default:statement=this.parseExpressionStatement();break;}break;default:statement=this.throwUnexpectedToken(this.lookahead);}return statement;};// https://tc39.github.io/ecma262/#sec-function-definitions
+  Parser.prototype.parseFunctionSourceElements=function(){var node=this.createNode();this.expect('{');var body=this.parseDirectivePrologues();var previousLabelSet=this.context.labelSet;var previousInIteration=this.context.inIteration;var previousInSwitch=this.context.inSwitch;var previousInFunctionBody=this.context.inFunctionBody;this.context.labelSet={};this.context.inIteration=false;this.context.inSwitch=false;this.context.inFunctionBody=true;while(this.lookahead.type!==2/* EOF */){if(this.match('}')){break;}body.push(this.parseStatementListItem());}this.expect('}');this.context.labelSet=previousLabelSet;this.context.inIteration=previousInIteration;this.context.inSwitch=previousInSwitch;this.context.inFunctionBody=previousInFunctionBody;return this.finalize(node,new Node.BlockStatement(body));};Parser.prototype.validateParam=function(options,param,name){var key='$'+name;if(this.context.strict){if(this.scanner.isRestrictedWord(name)){options.stricted=param;options.message=messages_1.Messages.StrictParamName;}if(Object.prototype.hasOwnProperty.call(options.paramSet,key)){options.stricted=param;options.message=messages_1.Messages.StrictParamDupe;}}else if(!options.firstRestricted){if(this.scanner.isRestrictedWord(name)){options.firstRestricted=param;options.message=messages_1.Messages.StrictParamName;}else if(this.scanner.isStrictModeReservedWord(name)){options.firstRestricted=param;options.message=messages_1.Messages.StrictReservedWord;}else if(Object.prototype.hasOwnProperty.call(options.paramSet,key)){options.stricted=param;options.message=messages_1.Messages.StrictParamDupe;}}/* istanbul ignore next */if(typeof Object.defineProperty==='function'){Object.defineProperty(options.paramSet,key,{value:true,enumerable:true,writable:true,configurable:true});}else{options.paramSet[key]=true;}};Parser.prototype.parseRestElement=function(params){var node=this.createNode();this.expect('...');var arg=this.parsePattern(params);if(this.match('=')){this.throwError(messages_1.Messages.DefaultRestParameter);}if(!this.match(')')){this.throwError(messages_1.Messages.ParameterAfterRestParameter);}return this.finalize(node,new Node.RestElement(arg));};Parser.prototype.parseFormalParameter=function(options){var params=[];var param=this.match('...')?this.parseRestElement(params):this.parsePatternWithDefault(params);for(var i=0;i<params.length;i++){this.validateParam(options,params[i],params[i].value);}options.simple=options.simple&&param instanceof Node.Identifier;options.params.push(param);};Parser.prototype.parseFormalParameters=function(firstRestricted){var options;options={simple:true,params:[],firstRestricted:firstRestricted};this.expect('(');if(!this.match(')')){options.paramSet={};while(this.lookahead.type!==2/* EOF */){this.parseFormalParameter(options);if(this.match(')')){break;}this.expect(',');if(this.match(')')){break;}}}this.expect(')');return {simple:options.simple,params:options.params,stricted:options.stricted,firstRestricted:options.firstRestricted,message:options.message};};Parser.prototype.matchAsyncFunction=function(){var match=this.matchContextualKeyword('async');if(match){var state=this.scanner.saveState();this.scanner.scanComments();var next=this.scanner.lex();this.scanner.restoreState(state);match=state.lineNumber===next.lineNumber&&next.type===4/* Keyword */&&next.value==='function';}return match;};Parser.prototype.parseFunctionDeclaration=function(identifierIsOptional){var node=this.createNode();var isAsync=this.matchContextualKeyword('async');if(isAsync){this.nextToken();}this.expectKeyword('function');var isGenerator=isAsync?false:this.match('*');if(isGenerator){this.nextToken();}var message;var id=null;var firstRestricted=null;if(!identifierIsOptional||!this.match('(')){var token=this.lookahead;id=this.parseVariableIdentifier();if(this.context.strict){if(this.scanner.isRestrictedWord(token.value)){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictFunctionName);}}else{if(this.scanner.isRestrictedWord(token.value)){firstRestricted=token;message=messages_1.Messages.StrictFunctionName;}else if(this.scanner.isStrictModeReservedWord(token.value)){firstRestricted=token;message=messages_1.Messages.StrictReservedWord;}}}var previousAllowAwait=this.context.await;var previousAllowYield=this.context.allowYield;this.context.await=isAsync;this.context.allowYield=!isGenerator;var formalParameters=this.parseFormalParameters(firstRestricted);var params=formalParameters.params;var stricted=formalParameters.stricted;firstRestricted=formalParameters.firstRestricted;if(formalParameters.message){message=formalParameters.message;}var previousStrict=this.context.strict;var previousAllowStrictDirective=this.context.allowStrictDirective;this.context.allowStrictDirective=formalParameters.simple;var body=this.parseFunctionSourceElements();if(this.context.strict&&firstRestricted){this.throwUnexpectedToken(firstRestricted,message);}if(this.context.strict&&stricted){this.tolerateUnexpectedToken(stricted,message);}this.context.strict=previousStrict;this.context.allowStrictDirective=previousAllowStrictDirective;this.context.await=previousAllowAwait;this.context.allowYield=previousAllowYield;return isAsync?this.finalize(node,new Node.AsyncFunctionDeclaration(id,params,body)):this.finalize(node,new Node.FunctionDeclaration(id,params,body,isGenerator));};Parser.prototype.parseFunctionExpression=function(){var node=this.createNode();var isAsync=this.matchContextualKeyword('async');if(isAsync){this.nextToken();}this.expectKeyword('function');var isGenerator=isAsync?false:this.match('*');if(isGenerator){this.nextToken();}var message;var id=null;var firstRestricted;var previousAllowAwait=this.context.await;var previousAllowYield=this.context.allowYield;this.context.await=isAsync;this.context.allowYield=!isGenerator;if(!this.match('(')){var token=this.lookahead;id=!this.context.strict&&!isGenerator&&this.matchKeyword('yield')?this.parseIdentifierName():this.parseVariableIdentifier();if(this.context.strict){if(this.scanner.isRestrictedWord(token.value)){this.tolerateUnexpectedToken(token,messages_1.Messages.StrictFunctionName);}}else{if(this.scanner.isRestrictedWord(token.value)){firstRestricted=token;message=messages_1.Messages.StrictFunctionName;}else if(this.scanner.isStrictModeReservedWord(token.value)){firstRestricted=token;message=messages_1.Messages.StrictReservedWord;}}}var formalParameters=this.parseFormalParameters(firstRestricted);var params=formalParameters.params;var stricted=formalParameters.stricted;firstRestricted=formalParameters.firstRestricted;if(formalParameters.message){message=formalParameters.message;}var previousStrict=this.context.strict;var previousAllowStrictDirective=this.context.allowStrictDirective;this.context.allowStrictDirective=formalParameters.simple;var body=this.parseFunctionSourceElements();if(this.context.strict&&firstRestricted){this.throwUnexpectedToken(firstRestricted,message);}if(this.context.strict&&stricted){this.tolerateUnexpectedToken(stricted,message);}this.context.strict=previousStrict;this.context.allowStrictDirective=previousAllowStrictDirective;this.context.await=previousAllowAwait;this.context.allowYield=previousAllowYield;return isAsync?this.finalize(node,new Node.AsyncFunctionExpression(id,params,body)):this.finalize(node,new Node.FunctionExpression(id,params,body,isGenerator));};// https://tc39.github.io/ecma262/#sec-directive-prologues-and-the-use-strict-directive
+  Parser.prototype.parseDirective=function(){var token=this.lookahead;var node=this.createNode();var expr=this.parseExpression();var directive=expr.type===syntax_1.Syntax.Literal?this.getTokenRaw(token).slice(1,-1):null;this.consumeSemicolon();return this.finalize(node,directive?new Node.Directive(expr,directive):new Node.ExpressionStatement(expr));};Parser.prototype.parseDirectivePrologues=function(){var firstRestricted=null;var body=[];while(true){var token=this.lookahead;if(token.type!==8/* StringLiteral */){break;}var statement=this.parseDirective();body.push(statement);var directive=statement.directive;if(typeof directive!=='string'){break;}if(directive==='use strict'){this.context.strict=true;if(firstRestricted){this.tolerateUnexpectedToken(firstRestricted,messages_1.Messages.StrictOctalLiteral);}if(!this.context.allowStrictDirective){this.tolerateUnexpectedToken(token,messages_1.Messages.IllegalLanguageModeDirective);}}else{if(!firstRestricted&&token.octal){firstRestricted=token;}}}return body;};// https://tc39.github.io/ecma262/#sec-method-definitions
+  Parser.prototype.qualifiedPropertyName=function(token){switch(token.type){case 3/* Identifier */:case 8/* StringLiteral */:case 1/* BooleanLiteral */:case 5/* NullLiteral */:case 6/* NumericLiteral */:case 4/* Keyword */:return true;case 7/* Punctuator */:return token.value==='[';default:break;}return false;};Parser.prototype.parseGetterMethod=function(){var node=this.createNode();var isGenerator=false;var previousAllowYield=this.context.allowYield;this.context.allowYield=!isGenerator;var formalParameters=this.parseFormalParameters();if(formalParameters.params.length>0){this.tolerateError(messages_1.Messages.BadGetterArity);}var method=this.parsePropertyMethod(formalParameters);this.context.allowYield=previousAllowYield;return this.finalize(node,new Node.FunctionExpression(null,formalParameters.params,method,isGenerator));};Parser.prototype.parseSetterMethod=function(){var node=this.createNode();var isGenerator=false;var previousAllowYield=this.context.allowYield;this.context.allowYield=!isGenerator;var formalParameters=this.parseFormalParameters();if(formalParameters.params.length!==1){this.tolerateError(messages_1.Messages.BadSetterArity);}else if(formalParameters.params[0]instanceof Node.RestElement){this.tolerateError(messages_1.Messages.BadSetterRestParameter);}var method=this.parsePropertyMethod(formalParameters);this.context.allowYield=previousAllowYield;return this.finalize(node,new Node.FunctionExpression(null,formalParameters.params,method,isGenerator));};Parser.prototype.parseGeneratorMethod=function(){var node=this.createNode();var isGenerator=true;var previousAllowYield=this.context.allowYield;this.context.allowYield=true;var params=this.parseFormalParameters();this.context.allowYield=false;var method=this.parsePropertyMethod(params);this.context.allowYield=previousAllowYield;return this.finalize(node,new Node.FunctionExpression(null,params.params,method,isGenerator));};// https://tc39.github.io/ecma262/#sec-generator-function-definitions
+  Parser.prototype.isStartOfExpression=function(){var start=true;var value=this.lookahead.value;switch(this.lookahead.type){case 7/* Punctuator */:start=value==='['||value==='('||value==='{'||value==='+'||value==='-'||value==='!'||value==='~'||value==='++'||value==='--'||value==='/'||value==='/=';// regular expression literal
+  break;case 4/* Keyword */:start=value==='class'||value==='delete'||value==='function'||value==='let'||value==='new'||value==='super'||value==='this'||value==='typeof'||value==='void'||value==='yield';break;default:break;}return start;};Parser.prototype.parseYieldExpression=function(){var node=this.createNode();this.expectKeyword('yield');var argument=null;var delegate=false;if(!this.hasLineTerminator){var previousAllowYield=this.context.allowYield;this.context.allowYield=false;delegate=this.match('*');if(delegate){this.nextToken();argument=this.parseAssignmentExpression();}else if(this.isStartOfExpression()){argument=this.parseAssignmentExpression();}this.context.allowYield=previousAllowYield;}return this.finalize(node,new Node.YieldExpression(argument,delegate));};// https://tc39.github.io/ecma262/#sec-class-definitions
+  Parser.prototype.parseClassElement=function(hasConstructor){var token=this.lookahead;var node=this.createNode();var kind='';var key=null;var value=null;var computed=false;var method=false;var isStatic=false;var isAsync=false;if(this.match('*')){this.nextToken();}else{computed=this.match('[');key=this.parseObjectPropertyKey();var id=key;if(id.name==='static'&&(this.qualifiedPropertyName(this.lookahead)||this.match('*'))){token=this.lookahead;isStatic=true;computed=this.match('[');if(this.match('*')){this.nextToken();}else{key=this.parseObjectPropertyKey();}}if(token.type===3/* Identifier */&&!this.hasLineTerminator&&token.value==='async'){var punctuator=this.lookahead.value;if(punctuator!==':'&&punctuator!=='('&&punctuator!=='*'){isAsync=true;token=this.lookahead;key=this.parseObjectPropertyKey();if(token.type===3/* Identifier */&&token.value==='constructor'){this.tolerateUnexpectedToken(token,messages_1.Messages.ConstructorIsAsync);}}}}var lookaheadPropertyKey=this.qualifiedPropertyName(this.lookahead);if(token.type===3/* Identifier */){if(token.value==='get'&&lookaheadPropertyKey){kind='get';computed=this.match('[');key=this.parseObjectPropertyKey();this.context.allowYield=false;value=this.parseGetterMethod();}else if(token.value==='set'&&lookaheadPropertyKey){kind='set';computed=this.match('[');key=this.parseObjectPropertyKey();value=this.parseSetterMethod();}}else if(token.type===7/* Punctuator */&&token.value==='*'&&lookaheadPropertyKey){kind='init';computed=this.match('[');key=this.parseObjectPropertyKey();value=this.parseGeneratorMethod();method=true;}if(!kind&&key&&this.match('(')){kind='init';value=isAsync?this.parsePropertyMethodAsyncFunction():this.parsePropertyMethodFunction();method=true;}if(!kind){this.throwUnexpectedToken(this.lookahead);}if(kind==='init'){kind='method';}if(!computed){if(isStatic&&this.isPropertyKey(key,'prototype')){this.throwUnexpectedToken(token,messages_1.Messages.StaticPrototype);}if(!isStatic&&this.isPropertyKey(key,'constructor')){if(kind!=='method'||!method||value&&value.generator){this.throwUnexpectedToken(token,messages_1.Messages.ConstructorSpecialMethod);}if(hasConstructor.value){this.throwUnexpectedToken(token,messages_1.Messages.DuplicateConstructor);}else{hasConstructor.value=true;}kind='constructor';}}return this.finalize(node,new Node.MethodDefinition(key,computed,value,kind,isStatic));};Parser.prototype.parseClassElementList=function(){var body=[];var hasConstructor={value:false};this.expect('{');while(!this.match('}')){if(this.match(';')){this.nextToken();}else{body.push(this.parseClassElement(hasConstructor));}}this.expect('}');return body;};Parser.prototype.parseClassBody=function(){var node=this.createNode();var elementList=this.parseClassElementList();return this.finalize(node,new Node.ClassBody(elementList));};Parser.prototype.parseClassDeclaration=function(identifierIsOptional){var node=this.createNode();var previousStrict=this.context.strict;this.context.strict=true;this.expectKeyword('class');var id=identifierIsOptional&&this.lookahead.type!==3/* Identifier */?null:this.parseVariableIdentifier();var superClass=null;if(this.matchKeyword('extends')){this.nextToken();superClass=this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);}var classBody=this.parseClassBody();this.context.strict=previousStrict;return this.finalize(node,new Node.ClassDeclaration(id,superClass,classBody));};Parser.prototype.parseClassExpression=function(){var node=this.createNode();var previousStrict=this.context.strict;this.context.strict=true;this.expectKeyword('class');var id=this.lookahead.type===3/* Identifier */?this.parseVariableIdentifier():null;var superClass=null;if(this.matchKeyword('extends')){this.nextToken();superClass=this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall);}var classBody=this.parseClassBody();this.context.strict=previousStrict;return this.finalize(node,new Node.ClassExpression(id,superClass,classBody));};// https://tc39.github.io/ecma262/#sec-scripts
+  // https://tc39.github.io/ecma262/#sec-modules
+  Parser.prototype.parseModule=function(){this.context.strict=true;this.context.isModule=true;this.scanner.isModule=true;var node=this.createNode();var body=this.parseDirectivePrologues();while(this.lookahead.type!==2/* EOF */){body.push(this.parseStatementListItem());}return this.finalize(node,new Node.Module(body));};Parser.prototype.parseScript=function(){var node=this.createNode();var body=this.parseDirectivePrologues();while(this.lookahead.type!==2/* EOF */){body.push(this.parseStatementListItem());}return this.finalize(node,new Node.Script(body));};// https://tc39.github.io/ecma262/#sec-imports
+  Parser.prototype.parseModuleSpecifier=function(){var node=this.createNode();if(this.lookahead.type!==8/* StringLiteral */){this.throwError(messages_1.Messages.InvalidModuleSpecifier);}var token=this.nextToken();var raw=this.getTokenRaw(token);return this.finalize(node,new Node.Literal(token.value,raw));};// import {<foo as bar>} ...;
+  Parser.prototype.parseImportSpecifier=function(){var node=this.createNode();var imported;var local;if(this.lookahead.type===3/* Identifier */){imported=this.parseVariableIdentifier();local=imported;if(this.matchContextualKeyword('as')){this.nextToken();local=this.parseVariableIdentifier();}}else{imported=this.parseIdentifierName();local=imported;if(this.matchContextualKeyword('as')){this.nextToken();local=this.parseVariableIdentifier();}else{this.throwUnexpectedToken(this.nextToken());}}return this.finalize(node,new Node.ImportSpecifier(local,imported));};// {foo, bar as bas}
+  Parser.prototype.parseNamedImports=function(){this.expect('{');var specifiers=[];while(!this.match('}')){specifiers.push(this.parseImportSpecifier());if(!this.match('}')){this.expect(',');}}this.expect('}');return specifiers;};// import <foo> ...;
+  Parser.prototype.parseImportDefaultSpecifier=function(){var node=this.createNode();var local=this.parseIdentifierName();return this.finalize(node,new Node.ImportDefaultSpecifier(local));};// import <* as foo> ...;
+  Parser.prototype.parseImportNamespaceSpecifier=function(){var node=this.createNode();this.expect('*');if(!this.matchContextualKeyword('as')){this.throwError(messages_1.Messages.NoAsAfterImportNamespace);}this.nextToken();var local=this.parseIdentifierName();return this.finalize(node,new Node.ImportNamespaceSpecifier(local));};Parser.prototype.parseImportDeclaration=function(){if(this.context.inFunctionBody){this.throwError(messages_1.Messages.IllegalImportDeclaration);}var node=this.createNode();this.expectKeyword('import');var src;var specifiers=[];if(this.lookahead.type===8/* StringLiteral */){// import 'foo';
+  src=this.parseModuleSpecifier();}else{if(this.match('{')){// import {bar}
+  specifiers=specifiers.concat(this.parseNamedImports());}else if(this.match('*')){// import * as foo
+  specifiers.push(this.parseImportNamespaceSpecifier());}else if(this.isIdentifierName(this.lookahead)&&!this.matchKeyword('default')){// import foo
+  specifiers.push(this.parseImportDefaultSpecifier());if(this.match(',')){this.nextToken();if(this.match('*')){// import foo, * as foo
+  specifiers.push(this.parseImportNamespaceSpecifier());}else if(this.match('{')){// import foo, {bar}
+  specifiers=specifiers.concat(this.parseNamedImports());}else{this.throwUnexpectedToken(this.lookahead);}}}else{this.throwUnexpectedToken(this.nextToken());}if(!this.matchContextualKeyword('from')){var message=this.lookahead.value?messages_1.Messages.UnexpectedToken:messages_1.Messages.MissingFromClause;this.throwError(message,this.lookahead.value);}this.nextToken();src=this.parseModuleSpecifier();}this.consumeSemicolon();return this.finalize(node,new Node.ImportDeclaration(specifiers,src));};// https://tc39.github.io/ecma262/#sec-exports
+  Parser.prototype.parseExportSpecifier=function(){var node=this.createNode();var local=this.parseIdentifierName();var exported=local;if(this.matchContextualKeyword('as')){this.nextToken();exported=this.parseIdentifierName();}return this.finalize(node,new Node.ExportSpecifier(local,exported));};Parser.prototype.parseExportDeclaration=function(){if(this.context.inFunctionBody){this.throwError(messages_1.Messages.IllegalExportDeclaration);}var node=this.createNode();this.expectKeyword('export');var exportDeclaration;if(this.matchKeyword('default')){// export default ...
+  this.nextToken();if(this.matchKeyword('function')){// export default function foo () {}
+  // export default function () {}
+  var declaration=this.parseFunctionDeclaration(true);exportDeclaration=this.finalize(node,new Node.ExportDefaultDeclaration(declaration));}else if(this.matchKeyword('class')){// export default class foo {}
+  var declaration=this.parseClassDeclaration(true);exportDeclaration=this.finalize(node,new Node.ExportDefaultDeclaration(declaration));}else if(this.matchContextualKeyword('async')){// export default async function f () {}
+  // export default async function () {}
+  // export default async x => x
+  var declaration=this.matchAsyncFunction()?this.parseFunctionDeclaration(true):this.parseAssignmentExpression();exportDeclaration=this.finalize(node,new Node.ExportDefaultDeclaration(declaration));}else{if(this.matchContextualKeyword('from')){this.throwError(messages_1.Messages.UnexpectedToken,this.lookahead.value);}// export default {};
+  // export default [];
+  // export default (1 + 2);
+  var declaration=this.match('{')?this.parseObjectInitializer():this.match('[')?this.parseArrayInitializer():this.parseAssignmentExpression();this.consumeSemicolon();exportDeclaration=this.finalize(node,new Node.ExportDefaultDeclaration(declaration));}}else if(this.match('*')){// export * from 'foo';
+  this.nextToken();if(!this.matchContextualKeyword('from')){var message=this.lookahead.value?messages_1.Messages.UnexpectedToken:messages_1.Messages.MissingFromClause;this.throwError(message,this.lookahead.value);}this.nextToken();var src=this.parseModuleSpecifier();this.consumeSemicolon();exportDeclaration=this.finalize(node,new Node.ExportAllDeclaration(src));}else if(this.lookahead.type===4/* Keyword */){// export var f = 1;
+  var declaration=void 0;switch(this.lookahead.value){case'let':case'const':declaration=this.parseLexicalDeclaration({inFor:false});break;case'var':case'class':case'function':declaration=this.parseStatementListItem();break;default:this.throwUnexpectedToken(this.lookahead);}exportDeclaration=this.finalize(node,new Node.ExportNamedDeclaration(declaration,[],null));}else if(this.matchAsyncFunction()){var declaration=this.parseFunctionDeclaration();exportDeclaration=this.finalize(node,new Node.ExportNamedDeclaration(declaration,[],null));}else{var specifiers=[];var source=null;var isExportFromIdentifier=false;this.expect('{');while(!this.match('}')){isExportFromIdentifier=isExportFromIdentifier||this.matchKeyword('default');specifiers.push(this.parseExportSpecifier());if(!this.match('}')){this.expect(',');}}this.expect('}');if(this.matchContextualKeyword('from')){// export {default} from 'foo';
+  // export {foo} from 'foo';
+  this.nextToken();source=this.parseModuleSpecifier();this.consumeSemicolon();}else if(isExportFromIdentifier){// export {default}; // missing fromClause
+  var message=this.lookahead.value?messages_1.Messages.UnexpectedToken:messages_1.Messages.MissingFromClause;this.throwError(message,this.lookahead.value);}else{// export {foo};
+  this.consumeSemicolon();}exportDeclaration=this.finalize(node,new Node.ExportNamedDeclaration(null,specifiers,source));}return exportDeclaration;};return Parser;}();exports.Parser=Parser;/***/},/* 9 */ /***/function(module,exports){// Ensure the condition is true, otherwise throw an error.
+  // This is only to have a better contract semantic, i.e. another safety net
+  // to catch a logic error. The condition shall be fulfilled in normal case.
+  // Do NOT use this to enforce a certain condition on any user input.
+  Object.defineProperty(exports,"__esModule",{value:true});function assert(condition,message){/* istanbul ignore if */if(!condition){throw new Error('ASSERT: '+message);}}exports.assert=assert;/***/},/* 10 */ /***/function(module,exports){/* tslint:disable:max-classes-per-file */Object.defineProperty(exports,"__esModule",{value:true});var ErrorHandler=function(){function ErrorHandler(){this.errors=[];this.tolerant=false;}ErrorHandler.prototype.recordError=function(error){this.errors.push(error);};ErrorHandler.prototype.tolerate=function(error){if(this.tolerant){this.recordError(error);}else{throw error;}};ErrorHandler.prototype.constructError=function(msg,column){var error=new Error(msg);try{throw error;}catch(base){/* istanbul ignore else */if(Object.create&&Object.defineProperty){error=Object.create(base);Object.defineProperty(error,'column',{value:column});}}/* istanbul ignore next */return error;};ErrorHandler.prototype.createError=function(index,line,col,description){var msg='Line '+line+': '+description;var error=this.constructError(msg,col);error.index=index;error.lineNumber=line;error.description=description;return error;};ErrorHandler.prototype.throwError=function(index,line,col,description){throw this.createError(index,line,col,description);};ErrorHandler.prototype.tolerateError=function(index,line,col,description){var error=this.createError(index,line,col,description);if(this.tolerant){this.recordError(error);}else{throw error;}};return ErrorHandler;}();exports.ErrorHandler=ErrorHandler;/***/},/* 11 */ /***/function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});// Error messages should be identical to V8.
+  exports.Messages={BadGetterArity:'Getter must not have any formal parameters',BadSetterArity:'Setter must have exactly one formal parameter',BadSetterRestParameter:'Setter function argument must not be a rest parameter',ConstructorIsAsync:'Class constructor may not be an async method',ConstructorSpecialMethod:'Class constructor may not be an accessor',DeclarationMissingInitializer:'Missing initializer in %0 declaration',DefaultRestParameter:'Unexpected token =',DuplicateBinding:'Duplicate binding %0',DuplicateConstructor:'A class may only have one constructor',DuplicateProtoProperty:'Duplicate __proto__ fields are not allowed in object literals',ForInOfLoopInitializer:'%0 loop variable declaration may not have an initializer',GeneratorInLegacyContext:'Generator declarations are not allowed in legacy contexts',IllegalBreak:'Illegal break statement',IllegalContinue:'Illegal continue statement',IllegalExportDeclaration:'Unexpected token',IllegalImportDeclaration:'Unexpected token',IllegalLanguageModeDirective:'Illegal \'use strict\' directive in function with non-simple parameter list',IllegalReturn:'Illegal return statement',InvalidEscapedReservedWord:'Keyword must not contain escaped characters',InvalidHexEscapeSequence:'Invalid hexadecimal escape sequence',InvalidLHSInAssignment:'Invalid left-hand side in assignment',InvalidLHSInForIn:'Invalid left-hand side in for-in',InvalidLHSInForLoop:'Invalid left-hand side in for-loop',InvalidModuleSpecifier:'Unexpected token',InvalidRegExp:'Invalid regular expression',LetInLexicalBinding:'let is disallowed as a lexically bound name',MissingFromClause:'Unexpected token',MultipleDefaultsInSwitch:'More than one default clause in switch statement',NewlineAfterThrow:'Illegal newline after throw',NoAsAfterImportNamespace:'Unexpected token',NoCatchOrFinally:'Missing catch or finally after try',ParameterAfterRestParameter:'Rest parameter must be last formal parameter',Redeclaration:'%0 \'%1\' has already been declared',StaticPrototype:'Classes may not have static property named prototype',StrictCatchVariable:'Catch variable may not be eval or arguments in strict mode',StrictDelete:'Delete of an unqualified identifier in strict mode.',StrictFunction:'In strict mode code, functions can only be declared at top level or inside a block',StrictFunctionName:'Function name may not be eval or arguments in strict mode',StrictLHSAssignment:'Assignment to eval or arguments is not allowed in strict mode',StrictLHSPostfix:'Postfix increment/decrement may not have eval or arguments operand in strict mode',StrictLHSPrefix:'Prefix increment/decrement may not have eval or arguments operand in strict mode',StrictModeWith:'Strict mode code may not include a with statement',StrictOctalLiteral:'Octal literals are not allowed in strict mode.',StrictParamDupe:'Strict mode function may not have duplicate parameter names',StrictParamName:'Parameter name eval or arguments is not allowed in strict mode',StrictReservedWord:'Use of future reserved word in strict mode',StrictVarName:'Variable name may not be eval or arguments in strict mode',TemplateOctalLiteral:'Octal literals are not allowed in template strings.',UnexpectedEOS:'Unexpected end of input',UnexpectedIdentifier:'Unexpected identifier',UnexpectedNumber:'Unexpected number',UnexpectedReserved:'Unexpected reserved word',UnexpectedString:'Unexpected string',UnexpectedTemplate:'Unexpected quasi %0',UnexpectedToken:'Unexpected token %0',UnexpectedTokenIllegal:'Unexpected token ILLEGAL',UnknownLabel:'Undefined label \'%0\'',UnterminatedRegExp:'Invalid regular expression: missing /'};/***/},/* 12 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__webpack_require__(9);var character_1=__webpack_require__(4);var messages_1=__webpack_require__(11);function hexValue(ch){return '0123456789abcdef'.indexOf(ch.toLowerCase());}function octalValue(ch){return '01234567'.indexOf(ch);}var Scanner=function(){function Scanner(code,handler){this.source=code;this.errorHandler=handler;this.trackComment=false;this.isModule=false;this.length=code.length;this.index=0;this.lineNumber=code.length>0?1:0;this.lineStart=0;this.curlyStack=[];}Scanner.prototype.saveState=function(){return {index:this.index,lineNumber:this.lineNumber,lineStart:this.lineStart};};Scanner.prototype.restoreState=function(state){this.index=state.index;this.lineNumber=state.lineNumber;this.lineStart=state.lineStart;};Scanner.prototype.eof=function(){return this.index>=this.length;};Scanner.prototype.throwUnexpectedToken=function(message){if(message===void 0){message=messages_1.Messages.UnexpectedTokenIllegal;}return this.errorHandler.throwError(this.index,this.lineNumber,this.index-this.lineStart+1,message);};Scanner.prototype.tolerateUnexpectedToken=function(message){if(message===void 0){message=messages_1.Messages.UnexpectedTokenIllegal;}this.errorHandler.tolerateError(this.index,this.lineNumber,this.index-this.lineStart+1,message);};// https://tc39.github.io/ecma262/#sec-comments
+  Scanner.prototype.skipSingleLineComment=function(offset){var comments=[];var start,loc;if(this.trackComment){comments=[];start=this.index-offset;loc={start:{line:this.lineNumber,column:this.index-this.lineStart-offset},end:{}};}while(!this.eof()){var ch=this.source.charCodeAt(this.index);++this.index;if(character_1.Character.isLineTerminator(ch)){if(this.trackComment){loc.end={line:this.lineNumber,column:this.index-this.lineStart-1};var entry={multiLine:false,slice:[start+offset,this.index-1],range:[start,this.index-1],loc:loc};comments.push(entry);}if(ch===13&&this.source.charCodeAt(this.index)===10){++this.index;}++this.lineNumber;this.lineStart=this.index;return comments;}}if(this.trackComment){loc.end={line:this.lineNumber,column:this.index-this.lineStart};var entry={multiLine:false,slice:[start+offset,this.index],range:[start,this.index],loc:loc};comments.push(entry);}return comments;};Scanner.prototype.skipMultiLineComment=function(){var comments=[];var start,loc;if(this.trackComment){comments=[];start=this.index-2;loc={start:{line:this.lineNumber,column:this.index-this.lineStart-2},end:{}};}while(!this.eof()){var ch=this.source.charCodeAt(this.index);if(character_1.Character.isLineTerminator(ch)){if(ch===0x0D&&this.source.charCodeAt(this.index+1)===0x0A){++this.index;}++this.lineNumber;++this.index;this.lineStart=this.index;}else if(ch===0x2A){// Block comment ends with '*/'.
+  if(this.source.charCodeAt(this.index+1)===0x2F){this.index+=2;if(this.trackComment){loc.end={line:this.lineNumber,column:this.index-this.lineStart};var entry={multiLine:true,slice:[start+2,this.index-2],range:[start,this.index],loc:loc};comments.push(entry);}return comments;}++this.index;}else{++this.index;}}// Ran off the end of the file - the whole thing is a comment
+  if(this.trackComment){loc.end={line:this.lineNumber,column:this.index-this.lineStart};var entry={multiLine:true,slice:[start+2,this.index],range:[start,this.index],loc:loc};comments.push(entry);}this.tolerateUnexpectedToken();return comments;};Scanner.prototype.scanComments=function(){var comments;if(this.trackComment){comments=[];}var start=this.index===0;while(!this.eof()){var ch=this.source.charCodeAt(this.index);if(character_1.Character.isWhiteSpace(ch)){++this.index;}else if(character_1.Character.isLineTerminator(ch)){++this.index;if(ch===0x0D&&this.source.charCodeAt(this.index)===0x0A){++this.index;}++this.lineNumber;this.lineStart=this.index;start=true;}else if(ch===0x2F){ch=this.source.charCodeAt(this.index+1);if(ch===0x2F){this.index+=2;var comment=this.skipSingleLineComment(2);if(this.trackComment){comments=comments.concat(comment);}start=true;}else if(ch===0x2A){this.index+=2;var comment=this.skipMultiLineComment();if(this.trackComment){comments=comments.concat(comment);}}else{break;}}else if(start&&ch===0x2D){// U+003E is '>'
+  if(this.source.charCodeAt(this.index+1)===0x2D&&this.source.charCodeAt(this.index+2)===0x3E){// '-->' is a single-line comment
+  this.index+=3;var comment=this.skipSingleLineComment(3);if(this.trackComment){comments=comments.concat(comment);}}else{break;}}else if(ch===0x3C&&!this.isModule){if(this.source.slice(this.index+1,this.index+4)==='!--'){this.index+=4;// `<!--`
+  var comment=this.skipSingleLineComment(4);if(this.trackComment){comments=comments.concat(comment);}}else{break;}}else{break;}}return comments;};// https://tc39.github.io/ecma262/#sec-future-reserved-words
+  Scanner.prototype.isFutureReservedWord=function(id){switch(id){case'enum':case'export':case'import':case'super':return true;default:return false;}};Scanner.prototype.isStrictModeReservedWord=function(id){switch(id){case'implements':case'interface':case'package':case'private':case'protected':case'public':case'static':case'yield':case'let':return true;default:return false;}};Scanner.prototype.isRestrictedWord=function(id){return id==='eval'||id==='arguments';};// https://tc39.github.io/ecma262/#sec-keywords
+  Scanner.prototype.isKeyword=function(id){switch(id.length){case 2:return id==='if'||id==='in'||id==='do';case 3:return id==='var'||id==='for'||id==='new'||id==='try'||id==='let';case 4:return id==='this'||id==='else'||id==='case'||id==='void'||id==='with'||id==='enum';case 5:return id==='while'||id==='break'||id==='catch'||id==='throw'||id==='const'||id==='yield'||id==='class'||id==='super';case 6:return id==='return'||id==='typeof'||id==='delete'||id==='switch'||id==='export'||id==='import';case 7:return id==='default'||id==='finally'||id==='extends';case 8:return id==='function'||id==='continue'||id==='debugger';case 10:return id==='instanceof';default:return false;}};Scanner.prototype.codePointAt=function(i){var cp=this.source.charCodeAt(i);if(cp>=0xD800&&cp<=0xDBFF){var second=this.source.charCodeAt(i+1);if(second>=0xDC00&&second<=0xDFFF){var first=cp;cp=(first-0xD800)*0x400+second-0xDC00+0x10000;}}return cp;};Scanner.prototype.scanHexEscape=function(prefix){var len=prefix==='u'?4:2;var code=0;for(var i=0;i<len;++i){if(!this.eof()&&character_1.Character.isHexDigit(this.source.charCodeAt(this.index))){code=code*16+hexValue(this.source[this.index++]);}else{return null;}}return String.fromCharCode(code);};Scanner.prototype.scanUnicodeCodePointEscape=function(){var ch=this.source[this.index];var code=0;// At least, one hex digit is required.
+  if(ch==='}'){this.throwUnexpectedToken();}while(!this.eof()){ch=this.source[this.index++];if(!character_1.Character.isHexDigit(ch.charCodeAt(0))){break;}code=code*16+hexValue(ch);}if(code>0x10FFFF||ch!=='}'){this.throwUnexpectedToken();}return character_1.Character.fromCodePoint(code);};Scanner.prototype.getIdentifier=function(){var start=this.index++;while(!this.eof()){var ch=this.source.charCodeAt(this.index);if(ch===0x5C){// Blackslash (U+005C) marks Unicode escape sequence.
+  this.index=start;return this.getComplexIdentifier();}else if(ch>=0xD800&&ch<0xDFFF){// Need to handle surrogate pairs.
+  this.index=start;return this.getComplexIdentifier();}if(character_1.Character.isIdentifierPart(ch)){++this.index;}else{break;}}return this.source.slice(start,this.index);};Scanner.prototype.getComplexIdentifier=function(){var cp=this.codePointAt(this.index);var id=character_1.Character.fromCodePoint(cp);this.index+=id.length;// '\u' (U+005C, U+0075) denotes an escaped character.
+  var ch;if(cp===0x5C){if(this.source.charCodeAt(this.index)!==0x75){this.throwUnexpectedToken();}++this.index;if(this.source[this.index]==='{'){++this.index;ch=this.scanUnicodeCodePointEscape();}else{ch=this.scanHexEscape('u');if(ch===null||ch==='\\'||!character_1.Character.isIdentifierStart(ch.charCodeAt(0))){this.throwUnexpectedToken();}}id=ch;}while(!this.eof()){cp=this.codePointAt(this.index);if(!character_1.Character.isIdentifierPart(cp)){break;}ch=character_1.Character.fromCodePoint(cp);id+=ch;this.index+=ch.length;// '\u' (U+005C, U+0075) denotes an escaped character.
+  if(cp===0x5C){id=id.substr(0,id.length-1);if(this.source.charCodeAt(this.index)!==0x75){this.throwUnexpectedToken();}++this.index;if(this.source[this.index]==='{'){++this.index;ch=this.scanUnicodeCodePointEscape();}else{ch=this.scanHexEscape('u');if(ch===null||ch==='\\'||!character_1.Character.isIdentifierPart(ch.charCodeAt(0))){this.throwUnexpectedToken();}}id+=ch;}}return id;};Scanner.prototype.octalToDecimal=function(ch){// \0 is not octal escape sequence
+  var octal=ch!=='0';var code=octalValue(ch);if(!this.eof()&&character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))){octal=true;code=code*8+octalValue(this.source[this.index++]);// 3 digits are only allowed when string starts
+  // with 0, 1, 2, 3
+  if('0123'.indexOf(ch)>=0&&!this.eof()&&character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))){code=code*8+octalValue(this.source[this.index++]);}}return {code:code,octal:octal};};// https://tc39.github.io/ecma262/#sec-names-and-keywords
+  Scanner.prototype.scanIdentifier=function(){var type;var start=this.index;// Backslash (U+005C) starts an escaped character.
+  var id=this.source.charCodeAt(start)===0x5C?this.getComplexIdentifier():this.getIdentifier();// There is no keyword or literal with only one character.
+  // Thus, it must be an identifier.
+  if(id.length===1){type=3/* Identifier */;}else if(this.isKeyword(id)){type=4/* Keyword */;}else if(id==='null'){type=5/* NullLiteral */;}else if(id==='true'||id==='false'){type=1/* BooleanLiteral */;}else{type=3/* Identifier */;}if(type!==3/* Identifier */&&start+id.length!==this.index){var restore=this.index;this.index=start;this.tolerateUnexpectedToken(messages_1.Messages.InvalidEscapedReservedWord);this.index=restore;}return {type:type,value:id,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};// https://tc39.github.io/ecma262/#sec-punctuators
+  Scanner.prototype.scanPunctuator=function(){var start=this.index;// Check for most common single-character punctuators.
+  var str=this.source[this.index];switch(str){case'(':case'{':if(str==='{'){this.curlyStack.push('{');}++this.index;break;case'.':++this.index;if(this.source[this.index]==='.'&&this.source[this.index+1]==='.'){// Spread operator: ...
+  this.index+=2;str='...';}break;case'}':++this.index;this.curlyStack.pop();break;case')':case';':case',':case'[':case']':case':':case'?':case'~':++this.index;break;default:// 4-character punctuator.
+  str=this.source.substr(this.index,4);if(str==='>>>='){this.index+=4;}else{// 3-character punctuators.
+  str=str.substr(0,3);if(str==='==='||str==='!=='||str==='>>>'||str==='<<='||str==='>>='||str==='**='){this.index+=3;}else{// 2-character punctuators.
+  str=str.substr(0,2);if(str==='&&'||str==='||'||str==='=='||str==='!='||str==='+='||str==='-='||str==='*='||str==='/='||str==='++'||str==='--'||str==='<<'||str==='>>'||str==='&='||str==='|='||str==='^='||str==='%='||str==='<='||str==='>='||str==='=>'||str==='**'){this.index+=2;}else{// 1-character punctuators.
+  str=this.source[this.index];if('<>=!+-*%&|^/'.indexOf(str)>=0){++this.index;}}}}}if(this.index===start){this.throwUnexpectedToken();}return {type:7/* Punctuator */,value:str,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};// https://tc39.github.io/ecma262/#sec-literals-numeric-literals
+  Scanner.prototype.scanHexLiteral=function(start){var num='';while(!this.eof()){if(!character_1.Character.isHexDigit(this.source.charCodeAt(this.index))){break;}num+=this.source[this.index++];}if(num.length===0){this.throwUnexpectedToken();}if(character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))){this.throwUnexpectedToken();}return {type:6/* NumericLiteral */,value:parseInt('0x'+num,16),lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};Scanner.prototype.scanBinaryLiteral=function(start){var num='';var ch;while(!this.eof()){ch=this.source[this.index];if(ch!=='0'&&ch!=='1'){break;}num+=this.source[this.index++];}if(num.length===0){// only 0b or 0B
+  this.throwUnexpectedToken();}if(!this.eof()){ch=this.source.charCodeAt(this.index);/* istanbul ignore else */if(character_1.Character.isIdentifierStart(ch)||character_1.Character.isDecimalDigit(ch)){this.throwUnexpectedToken();}}return {type:6/* NumericLiteral */,value:parseInt(num,2),lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};Scanner.prototype.scanOctalLiteral=function(prefix,start){var num='';var octal=false;if(character_1.Character.isOctalDigit(prefix.charCodeAt(0))){octal=true;num='0'+this.source[this.index++];}else{++this.index;}while(!this.eof()){if(!character_1.Character.isOctalDigit(this.source.charCodeAt(this.index))){break;}num+=this.source[this.index++];}if(!octal&&num.length===0){// only 0o or 0O
+  this.throwUnexpectedToken();}if(character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))||character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){this.throwUnexpectedToken();}return {type:6/* NumericLiteral */,value:parseInt(num,8),octal:octal,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};Scanner.prototype.isImplicitOctalLiteral=function(){// Implicit octal, unless there is a non-octal digit.
+  // (Annex B.1.1 on Numeric Literals)
+  for(var i=this.index+1;i<this.length;++i){var ch=this.source[i];if(ch==='8'||ch==='9'){return false;}if(!character_1.Character.isOctalDigit(ch.charCodeAt(0))){return true;}}return true;};Scanner.prototype.scanNumericLiteral=function(){var start=this.index;var ch=this.source[start];assert_1.assert(character_1.Character.isDecimalDigit(ch.charCodeAt(0))||ch==='.','Numeric literal must start with a decimal digit or a decimal point');var num='';if(ch!=='.'){num=this.source[this.index++];ch=this.source[this.index];// Hex number starts with '0x'.
+  // Octal number starts with '0'.
+  // Octal number in ES6 starts with '0o'.
+  // Binary number in ES6 starts with '0b'.
+  if(num==='0'){if(ch==='x'||ch==='X'){++this.index;return this.scanHexLiteral(start);}if(ch==='b'||ch==='B'){++this.index;return this.scanBinaryLiteral(start);}if(ch==='o'||ch==='O'){return this.scanOctalLiteral(ch,start);}if(ch&&character_1.Character.isOctalDigit(ch.charCodeAt(0))){if(this.isImplicitOctalLiteral()){return this.scanOctalLiteral(ch,start);}}}while(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){num+=this.source[this.index++];}ch=this.source[this.index];}if(ch==='.'){num+=this.source[this.index++];while(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){num+=this.source[this.index++];}ch=this.source[this.index];}if(ch==='e'||ch==='E'){num+=this.source[this.index++];ch=this.source[this.index];if(ch==='+'||ch==='-'){num+=this.source[this.index++];}if(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){while(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){num+=this.source[this.index++];}}else{this.throwUnexpectedToken();}}if(character_1.Character.isIdentifierStart(this.source.charCodeAt(this.index))){this.throwUnexpectedToken();}return {type:6/* NumericLiteral */,value:parseFloat(num),lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};// https://tc39.github.io/ecma262/#sec-literals-string-literals
+  Scanner.prototype.scanStringLiteral=function(){var start=this.index;var quote=this.source[start];assert_1.assert(quote==='\''||quote==='"','String literal must starts with a quote');++this.index;var octal=false;var str='';while(!this.eof()){var ch=this.source[this.index++];if(ch===quote){quote='';break;}else if(ch==='\\'){ch=this.source[this.index++];if(!ch||!character_1.Character.isLineTerminator(ch.charCodeAt(0))){switch(ch){case'u':if(this.source[this.index]==='{'){++this.index;str+=this.scanUnicodeCodePointEscape();}else{var unescaped_1=this.scanHexEscape(ch);if(unescaped_1===null){this.throwUnexpectedToken();}str+=unescaped_1;}break;case'x':var unescaped=this.scanHexEscape(ch);if(unescaped===null){this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);}str+=unescaped;break;case'n':str+='\n';break;case'r':str+='\r';break;case't':str+='\t';break;case'b':str+='\b';break;case'f':str+='\f';break;case'v':str+='\x0B';break;case'8':case'9':str+=ch;this.tolerateUnexpectedToken();break;default:if(ch&&character_1.Character.isOctalDigit(ch.charCodeAt(0))){var octToDec=this.octalToDecimal(ch);octal=octToDec.octal||octal;str+=String.fromCharCode(octToDec.code);}else{str+=ch;}break;}}else{++this.lineNumber;if(ch==='\r'&&this.source[this.index]==='\n'){++this.index;}this.lineStart=this.index;}}else if(character_1.Character.isLineTerminator(ch.charCodeAt(0))){break;}else{str+=ch;}}if(quote!==''){this.index=start;this.throwUnexpectedToken();}return {type:8/* StringLiteral */,value:str,octal:octal,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};// https://tc39.github.io/ecma262/#sec-template-literal-lexical-components
+  Scanner.prototype.scanTemplate=function(){var cooked='';var terminated=false;var start=this.index;var head=this.source[start]==='`';var tail=false;var rawOffset=2;++this.index;while(!this.eof()){var ch=this.source[this.index++];if(ch==='`'){rawOffset=1;tail=true;terminated=true;break;}else if(ch==='$'){if(this.source[this.index]==='{'){this.curlyStack.push('${');++this.index;terminated=true;break;}cooked+=ch;}else if(ch==='\\'){ch=this.source[this.index++];if(!character_1.Character.isLineTerminator(ch.charCodeAt(0))){switch(ch){case'n':cooked+='\n';break;case'r':cooked+='\r';break;case't':cooked+='\t';break;case'u':if(this.source[this.index]==='{'){++this.index;cooked+=this.scanUnicodeCodePointEscape();}else{var restore=this.index;var unescaped_2=this.scanHexEscape(ch);if(unescaped_2!==null){cooked+=unescaped_2;}else{this.index=restore;cooked+=ch;}}break;case'x':var unescaped=this.scanHexEscape(ch);if(unescaped===null){this.throwUnexpectedToken(messages_1.Messages.InvalidHexEscapeSequence);}cooked+=unescaped;break;case'b':cooked+='\b';break;case'f':cooked+='\f';break;case'v':cooked+='\v';break;default:if(ch==='0'){if(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index))){// Illegal: \01 \02 and so on
+  this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);}cooked+='\0';}else if(character_1.Character.isOctalDigit(ch.charCodeAt(0))){// Illegal: \1 \2
+  this.throwUnexpectedToken(messages_1.Messages.TemplateOctalLiteral);}else{cooked+=ch;}break;}}else{++this.lineNumber;if(ch==='\r'&&this.source[this.index]==='\n'){++this.index;}this.lineStart=this.index;}}else if(character_1.Character.isLineTerminator(ch.charCodeAt(0))){++this.lineNumber;if(ch==='\r'&&this.source[this.index]==='\n'){++this.index;}this.lineStart=this.index;cooked+='\n';}else{cooked+=ch;}}if(!terminated){this.throwUnexpectedToken();}if(!head){this.curlyStack.pop();}return {type:10/* Template */,value:this.source.slice(start+1,this.index-rawOffset),cooked:cooked,head:head,tail:tail,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};// https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+  Scanner.prototype.testRegExp=function(pattern,flags){// The BMP character to use as a replacement for astral symbols when
+  // translating an ES6 "u"-flagged pattern to an ES5-compatible
+  // approximation.
+  // Note: replacing with '\uFFFF' enables false positives in unlikely
+  // scenarios. For example, `[\u{1044f}-\u{10440}]` is an invalid
+  // pattern that would not be detected by this substitution.
+  var astralSubstitute='\uFFFF';var tmp=pattern;var self=this;if(flags.indexOf('u')>=0){tmp=tmp.replace(/\\u\{([0-9a-fA-F]+)\}|\\u([a-fA-F0-9]{4})/g,function($0,$1,$2){var codePoint=parseInt($1||$2,16);if(codePoint>0x10FFFF){self.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);}if(codePoint<=0xFFFF){return String.fromCharCode(codePoint);}return astralSubstitute;}).replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g,astralSubstitute);}// First, detect invalid regular expressions.
+  try{RegExp(tmp);}catch(e){this.throwUnexpectedToken(messages_1.Messages.InvalidRegExp);}// Return a regular expression object for this pattern-flag pair, or
+  // `null` in case the current environment doesn't support the flags it
+  // uses.
+  try{return new RegExp(pattern,flags);}catch(exception){/* istanbul ignore next */return null;}};Scanner.prototype.scanRegExpBody=function(){var ch=this.source[this.index];assert_1.assert(ch==='/','Regular expression literal must start with a slash');var str=this.source[this.index++];var classMarker=false;var terminated=false;while(!this.eof()){ch=this.source[this.index++];str+=ch;if(ch==='\\'){ch=this.source[this.index++];// https://tc39.github.io/ecma262/#sec-literals-regular-expression-literals
+  if(character_1.Character.isLineTerminator(ch.charCodeAt(0))){this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);}str+=ch;}else if(character_1.Character.isLineTerminator(ch.charCodeAt(0))){this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);}else if(classMarker){if(ch===']'){classMarker=false;}}else{if(ch==='/'){terminated=true;break;}else if(ch==='['){classMarker=true;}}}if(!terminated){this.throwUnexpectedToken(messages_1.Messages.UnterminatedRegExp);}// Exclude leading and trailing slash.
+  return str.substr(1,str.length-2);};Scanner.prototype.scanRegExpFlags=function(){var str='';var flags='';while(!this.eof()){var ch=this.source[this.index];if(!character_1.Character.isIdentifierPart(ch.charCodeAt(0))){break;}++this.index;if(ch==='\\'&&!this.eof()){ch=this.source[this.index];if(ch==='u'){++this.index;var restore=this.index;var char=this.scanHexEscape('u');if(char!==null){flags+=char;for(str+='\\u';restore<this.index;++restore){str+=this.source[restore];}}else{this.index=restore;flags+='u';str+='\\u';}this.tolerateUnexpectedToken();}else{str+='\\';this.tolerateUnexpectedToken();}}else{flags+=ch;str+=ch;}}return flags;};Scanner.prototype.scanRegExp=function(){var start=this.index;var pattern=this.scanRegExpBody();var flags=this.scanRegExpFlags();var value=this.testRegExp(pattern,flags);return {type:9/* RegularExpression */,value:'',pattern:pattern,flags:flags,regex:value,lineNumber:this.lineNumber,lineStart:this.lineStart,start:start,end:this.index};};Scanner.prototype.lex=function(){if(this.eof()){return {type:2/* EOF */,value:'',lineNumber:this.lineNumber,lineStart:this.lineStart,start:this.index,end:this.index};}var cp=this.source.charCodeAt(this.index);if(character_1.Character.isIdentifierStart(cp)){return this.scanIdentifier();}// Very common: ( and ) and ;
+  if(cp===0x28||cp===0x29||cp===0x3B){return this.scanPunctuator();}// String literal starts with single quote (U+0027) or double quote (U+0022).
+  if(cp===0x27||cp===0x22){return this.scanStringLiteral();}// Dot (.) U+002E can also start a floating-point number, hence the need
+  // to check the next character.
+  if(cp===0x2E){if(character_1.Character.isDecimalDigit(this.source.charCodeAt(this.index+1))){return this.scanNumericLiteral();}return this.scanPunctuator();}if(character_1.Character.isDecimalDigit(cp)){return this.scanNumericLiteral();}// Template literals start with ` (U+0060) for template head
+  // or } (U+007D) for template middle or template tail.
+  if(cp===0x60||cp===0x7D&&this.curlyStack[this.curlyStack.length-1]==='${'){return this.scanTemplate();}// Possible identifier start in a surrogate pair.
+  if(cp>=0xD800&&cp<0xDFFF){if(character_1.Character.isIdentifierStart(this.codePointAt(this.index))){return this.scanIdentifier();}}return this.scanPunctuator();};return Scanner;}();exports.Scanner=Scanner;/***/},/* 13 */ /***/function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});exports.TokenName={};exports.TokenName[1/* BooleanLiteral */]='Boolean';exports.TokenName[2/* EOF */]='<end>';exports.TokenName[3/* Identifier */]='Identifier';exports.TokenName[4/* Keyword */]='Keyword';exports.TokenName[5/* NullLiteral */]='Null';exports.TokenName[6/* NumericLiteral */]='Numeric';exports.TokenName[7/* Punctuator */]='Punctuator';exports.TokenName[8/* StringLiteral */]='String';exports.TokenName[9/* RegularExpression */]='RegularExpression';exports.TokenName[10/* Template */]='Template';/***/},/* 14 */ /***/function(module,exports){// Generated by generate-xhtml-entities.js. DO NOT MODIFY!
+  Object.defineProperty(exports,"__esModule",{value:true});exports.XHTMLEntities={quot:'\u0022',amp:'\u0026',apos:'\u0027',gt:'\u003E',nbsp:'\u00A0',iexcl:'\u00A1',cent:'\u00A2',pound:'\u00A3',curren:'\u00A4',yen:'\u00A5',brvbar:'\u00A6',sect:'\u00A7',uml:'\u00A8',copy:'\u00A9',ordf:'\u00AA',laquo:'\u00AB',not:'\u00AC',shy:'\u00AD',reg:'\u00AE',macr:'\u00AF',deg:'\u00B0',plusmn:'\u00B1',sup2:'\u00B2',sup3:'\u00B3',acute:'\u00B4',micro:'\u00B5',para:'\u00B6',middot:'\u00B7',cedil:'\u00B8',sup1:'\u00B9',ordm:'\u00BA',raquo:'\u00BB',frac14:'\u00BC',frac12:'\u00BD',frac34:'\u00BE',iquest:'\u00BF',Agrave:'\u00C0',Aacute:'\u00C1',Acirc:'\u00C2',Atilde:'\u00C3',Auml:'\u00C4',Aring:'\u00C5',AElig:'\u00C6',Ccedil:'\u00C7',Egrave:'\u00C8',Eacute:'\u00C9',Ecirc:'\u00CA',Euml:'\u00CB',Igrave:'\u00CC',Iacute:'\u00CD',Icirc:'\u00CE',Iuml:'\u00CF',ETH:'\u00D0',Ntilde:'\u00D1',Ograve:'\u00D2',Oacute:'\u00D3',Ocirc:'\u00D4',Otilde:'\u00D5',Ouml:'\u00D6',times:'\u00D7',Oslash:'\u00D8',Ugrave:'\u00D9',Uacute:'\u00DA',Ucirc:'\u00DB',Uuml:'\u00DC',Yacute:'\u00DD',THORN:'\u00DE',szlig:'\u00DF',agrave:'\u00E0',aacute:'\u00E1',acirc:'\u00E2',atilde:'\u00E3',auml:'\u00E4',aring:'\u00E5',aelig:'\u00E6',ccedil:'\u00E7',egrave:'\u00E8',eacute:'\u00E9',ecirc:'\u00EA',euml:'\u00EB',igrave:'\u00EC',iacute:'\u00ED',icirc:'\u00EE',iuml:'\u00EF',eth:'\u00F0',ntilde:'\u00F1',ograve:'\u00F2',oacute:'\u00F3',ocirc:'\u00F4',otilde:'\u00F5',ouml:'\u00F6',divide:'\u00F7',oslash:'\u00F8',ugrave:'\u00F9',uacute:'\u00FA',ucirc:'\u00FB',uuml:'\u00FC',yacute:'\u00FD',thorn:'\u00FE',yuml:'\u00FF',OElig:'\u0152',oelig:'\u0153',Scaron:'\u0160',scaron:'\u0161',Yuml:'\u0178',fnof:'\u0192',circ:'\u02C6',tilde:'\u02DC',Alpha:'\u0391',Beta:'\u0392',Gamma:'\u0393',Delta:'\u0394',Epsilon:'\u0395',Zeta:'\u0396',Eta:'\u0397',Theta:'\u0398',Iota:'\u0399',Kappa:'\u039A',Lambda:'\u039B',Mu:'\u039C',Nu:'\u039D',Xi:'\u039E',Omicron:'\u039F',Pi:'\u03A0',Rho:'\u03A1',Sigma:'\u03A3',Tau:'\u03A4',Upsilon:'\u03A5',Phi:'\u03A6',Chi:'\u03A7',Psi:'\u03A8',Omega:'\u03A9',alpha:'\u03B1',beta:'\u03B2',gamma:'\u03B3',delta:'\u03B4',epsilon:'\u03B5',zeta:'\u03B6',eta:'\u03B7',theta:'\u03B8',iota:'\u03B9',kappa:'\u03BA',lambda:'\u03BB',mu:'\u03BC',nu:'\u03BD',xi:'\u03BE',omicron:'\u03BF',pi:'\u03C0',rho:'\u03C1',sigmaf:'\u03C2',sigma:'\u03C3',tau:'\u03C4',upsilon:'\u03C5',phi:'\u03C6',chi:'\u03C7',psi:'\u03C8',omega:'\u03C9',thetasym:'\u03D1',upsih:'\u03D2',piv:'\u03D6',ensp:'\u2002',emsp:'\u2003',thinsp:'\u2009',zwnj:'\u200C',zwj:'\u200D',lrm:'\u200E',rlm:'\u200F',ndash:'\u2013',mdash:'\u2014',lsquo:'\u2018',rsquo:'\u2019',sbquo:'\u201A',ldquo:'\u201C',rdquo:'\u201D',bdquo:'\u201E',dagger:'\u2020',Dagger:'\u2021',bull:'\u2022',hellip:'\u2026',permil:'\u2030',prime:'\u2032',Prime:'\u2033',lsaquo:'\u2039',rsaquo:'\u203A',oline:'\u203E',frasl:'\u2044',euro:'\u20AC',image:'\u2111',weierp:'\u2118',real:'\u211C',trade:'\u2122',alefsym:'\u2135',larr:'\u2190',uarr:'\u2191',rarr:'\u2192',darr:'\u2193',harr:'\u2194',crarr:'\u21B5',lArr:'\u21D0',uArr:'\u21D1',rArr:'\u21D2',dArr:'\u21D3',hArr:'\u21D4',forall:'\u2200',part:'\u2202',exist:'\u2203',empty:'\u2205',nabla:'\u2207',isin:'\u2208',notin:'\u2209',ni:'\u220B',prod:'\u220F',sum:'\u2211',minus:'\u2212',lowast:'\u2217',radic:'\u221A',prop:'\u221D',infin:'\u221E',ang:'\u2220',and:'\u2227',or:'\u2228',cap:'\u2229',cup:'\u222A',int:'\u222B',there4:'\u2234',sim:'\u223C',cong:'\u2245',asymp:'\u2248',ne:'\u2260',equiv:'\u2261',le:'\u2264',ge:'\u2265',sub:'\u2282',sup:'\u2283',nsub:'\u2284',sube:'\u2286',supe:'\u2287',oplus:'\u2295',otimes:'\u2297',perp:'\u22A5',sdot:'\u22C5',lceil:'\u2308',rceil:'\u2309',lfloor:'\u230A',rfloor:'\u230B',loz:'\u25CA',spades:'\u2660',clubs:'\u2663',hearts:'\u2665',diams:'\u2666',lang:'\u27E8',rang:'\u27E9'};/***/},/* 15 */ /***/function(module,exports,__webpack_require__){Object.defineProperty(exports,"__esModule",{value:true});var error_handler_1=__webpack_require__(10);var scanner_1=__webpack_require__(12);var token_1=__webpack_require__(13);var Reader=function(){function Reader(){this.values=[];this.curly=this.paren=-1;}// A function following one of those tokens is an expression.
+  Reader.prototype.beforeFunctionExpression=function(t){return ['(','{','[','in','typeof','instanceof','new','return','case','delete','throw','void',// assignment operators
+  '=','+=','-=','*=','**=','/=','%=','<<=','>>=','>>>=','&=','|=','^=',',',// binary/unary operators
+  '+','-','*','**','/','%','++','--','<<','>>','>>>','&','|','^','!','~','&&','||','?',':','===','==','>=','<=','<','>','!=','!=='].indexOf(t)>=0;};// Determine if forward slash (/) is an operator or part of a regular expression
+  // https://github.com/mozilla/sweet.js/wiki/design
+  Reader.prototype.isRegexStart=function(){var previous=this.values[this.values.length-1];var regex=previous!==null;switch(previous){case'this':case']':regex=false;break;case')':var keyword=this.values[this.paren-1];regex=keyword==='if'||keyword==='while'||keyword==='for'||keyword==='with';break;case'}':// Dividing a function by anything makes little sense,
+  // but we have to check for that.
+  regex=false;if(this.values[this.curly-3]==='function'){// Anonymous function, e.g. function(){} /42
+  var check=this.values[this.curly-4];regex=check?!this.beforeFunctionExpression(check):false;}else if(this.values[this.curly-4]==='function'){// Named function, e.g. function f(){} /42/
+  var check=this.values[this.curly-5];regex=check?!this.beforeFunctionExpression(check):true;}break;default:break;}return regex;};Reader.prototype.push=function(token){if(token.type===7/* Punctuator */||token.type===4/* Keyword */){if(token.value==='{'){this.curly=this.values.length;}else if(token.value==='('){this.paren=this.values.length;}this.values.push(token.value);}else{this.values.push(null);}};return Reader;}();var Tokenizer=function(){function Tokenizer(code,config){this.errorHandler=new error_handler_1.ErrorHandler();this.errorHandler.tolerant=config?typeof config.tolerant==='boolean'&&config.tolerant:false;this.scanner=new scanner_1.Scanner(code,this.errorHandler);this.scanner.trackComment=config?typeof config.comment==='boolean'&&config.comment:false;this.trackRange=config?typeof config.range==='boolean'&&config.range:false;this.trackLoc=config?typeof config.loc==='boolean'&&config.loc:false;this.buffer=[];this.reader=new Reader();}Tokenizer.prototype.errors=function(){return this.errorHandler.errors;};Tokenizer.prototype.getNextToken=function(){if(this.buffer.length===0){var comments=this.scanner.scanComments();if(this.scanner.trackComment){for(var i=0;i<comments.length;++i){var e=comments[i];var value=this.scanner.source.slice(e.slice[0],e.slice[1]);var comment={type:e.multiLine?'BlockComment':'LineComment',value:value};if(this.trackRange){comment.range=e.range;}if(this.trackLoc){comment.loc=e.loc;}this.buffer.push(comment);}}if(!this.scanner.eof()){var loc=void 0;if(this.trackLoc){loc={start:{line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart},end:{}};}var startRegex=this.scanner.source[this.scanner.index]==='/'&&this.reader.isRegexStart();var token=startRegex?this.scanner.scanRegExp():this.scanner.lex();this.reader.push(token);var entry={type:token_1.TokenName[token.type],value:this.scanner.source.slice(token.start,token.end)};if(this.trackRange){entry.range=[token.start,token.end];}if(this.trackLoc){loc.end={line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart};entry.loc=loc;}if(token.type===9/* RegularExpression */){var pattern=token.pattern;var flags=token.flags;entry.regex={pattern:pattern,flags:flags};}this.buffer.push(entry);}}return this.buffer.shift();};return Tokenizer;}();exports.Tokenizer=Tokenizer;/***/}/******/]));});});unwrapExports(esprima$1);var esprima$2=createCommonjsModule(function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});// This module is suitable for passing as options.parser when calling
+  // recast.parse to process ECMAScript code with Esprima:
+  //
+  //   const ast = recast.parse(source, {
+  //     parser: require("recast/parsers/esprima")
+  //   });
+  //
+  function parse(source,options){var comments=[];var ast=esprima$1.parse(source,{loc:true,locations:true,comment:true,onComment:comments,range:util$1.getOption(options,"range",false),tolerant:util$1.getOption(options,"tolerant",true),tokens:true});if(!Array.isArray(ast.comments)){ast.comments=comments;}return ast;}exports.parse=parse;});unwrapExports(esprima$2);var esprima_1=esprima$2.parse;/*
+  	The MIT License (MIT)
+
+  	Copyright (c) 2016 CoderPuppy
+
+  	Permission is hereby granted, free of charge, to any person obtaining a copy
+  	of this software and associated documentation files (the "Software"), to deal
+  	in the Software without restriction, including without limitation the rights
+  	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+  	copies of the Software, and to permit persons to whom the Software is
+  	furnished to do so, subject to the following conditions:
+
+  	The above copyright notice and this permission notice shall be included in all
+  	copies or substantial portions of the Software.
+
+  	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+  	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+  	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+  	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+  	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+  	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+  	SOFTWARE.
+
+  	*/var _endianness;function endianness(){if(typeof _endianness==='undefined'){var a=new ArrayBuffer(2);var b=new Uint8Array(a);var c=new Uint16Array(a);b[0]=1;b[1]=2;if(c[0]===258){_endianness='BE';}else if(c[0]===513){_endianness='LE';}else{throw new Error('unable to figure out endianess');}}return _endianness;}function hostname(){if(typeof commonjsGlobal.location!=='undefined'){return commonjsGlobal.location.hostname;}else return '';}function loadavg(){return [];}function uptime(){return 0;}function freemem(){return Number.MAX_VALUE;}function totalmem(){return Number.MAX_VALUE;}function cpus(){return [];}function type(){return 'Browser';}function release(){if(typeof commonjsGlobal.navigator!=='undefined'){return commonjsGlobal.navigator.appVersion;}return '';}function networkInterfaces(){}function getNetworkInterfaces(){}function tmpDir(){return '/tmp';}var tmpdir=tmpDir;var EOL='\n';var require$$1={EOL:EOL,tmpdir:tmpdir,tmpDir:tmpDir,networkInterfaces:networkInterfaces,getNetworkInterfaces:getNetworkInterfaces,release:release,type:type,cpus:cpus,totalmem:totalmem,freemem:freemem,uptime:uptime,loadavg:loadavg,hostname:hostname,endianness:endianness};var options=createCommonjsModule(function(module,exports){Object.defineProperty(exports,"__esModule",{value:true});var defaults={parser:esprima$2,tabWidth:4,useTabs:false,reuseWhitespace:true,lineTerminator:require$$1.EOL,wrapColumn:74,sourceFileName:null,sourceMapName:null,sourceRoot:null,inputSourceMap:null,range:false,tolerant:true,quote:null,trailingComma:false,arrayBracketSpacing:false,objectCurlySpacing:true,arrowParensAlways:false,flowObjectCommas:true,tokens:true},hasOwn=defaults.hasOwnProperty;// Copy options and fill in default values.
+  function normalize(opts){var options=opts||defaults;function get(key){return hasOwn.call(options,key)?options[key]:defaults[key];}return {tabWidth:+get("tabWidth"),useTabs:!!get("useTabs"),reuseWhitespace:!!get("reuseWhitespace"),lineTerminator:get("lineTerminator"),wrapColumn:Math.max(get("wrapColumn"),0),sourceFileName:get("sourceFileName"),sourceMapName:get("sourceMapName"),sourceRoot:get("sourceRoot"),inputSourceMap:get("inputSourceMap"),parser:get("esprima")||get("parser"),range:get("range"),tolerant:get("tolerant"),quote:get("quote"),trailingComma:get("trailingComma"),arrayBracketSpacing:get("arrayBracketSpacing"),objectCurlySpacing:get("objectCurlySpacing"),arrowParensAlways:get("arrowParensAlways"),flowObjectCommas:get("flowObjectCommas"),tokens:!!get("tokens")};}exports.normalize=normalize;});unwrapExports(options);var options_1=options.normalize;var mapping=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var Mapping=/** @class */function(){function Mapping(sourceLines,sourceLoc,targetLoc){if(targetLoc===void 0){targetLoc=sourceLoc;}this.sourceLines=sourceLines;this.sourceLoc=sourceLoc;this.targetLoc=targetLoc;}Mapping.prototype.slice=function(lines,start,end){if(end===void 0){end=lines.lastPos();}var sourceLines=this.sourceLines;var sourceLoc=this.sourceLoc;var targetLoc=this.targetLoc;function skip(name){var sourceFromPos=sourceLoc[name];var targetFromPos=targetLoc[name];var targetToPos=start;if(name==="end"){targetToPos=end;}else{assert_1.default.strictEqual(name,"start");}return skipChars(sourceLines,sourceFromPos,lines,targetFromPos,targetToPos);}if(util$1.comparePos(start,targetLoc.start)<=0){if(util$1.comparePos(targetLoc.end,end)<=0){targetLoc={start:subtractPos(targetLoc.start,start.line,start.column),end:subtractPos(targetLoc.end,start.line,start.column)};// The sourceLoc can stay the same because the contents of the
+  // targetLoc have not changed.
+  }else if(util$1.comparePos(end,targetLoc.start)<=0){return null;}else{sourceLoc={start:sourceLoc.start,end:skip("end")};targetLoc={start:subtractPos(targetLoc.start,start.line,start.column),end:subtractPos(end,start.line,start.column)};}}else{if(util$1.comparePos(targetLoc.end,start)<=0){return null;}if(util$1.comparePos(targetLoc.end,end)<=0){sourceLoc={start:skip("start"),end:sourceLoc.end};targetLoc={// Same as subtractPos(start, start.line, start.column):
+  start:{line:1,column:0},end:subtractPos(targetLoc.end,start.line,start.column)};}else{sourceLoc={start:skip("start"),end:skip("end")};targetLoc={// Same as subtractPos(start, start.line, start.column):
+  start:{line:1,column:0},end:subtractPos(end,start.line,start.column)};}}return new Mapping(this.sourceLines,sourceLoc,targetLoc);};Mapping.prototype.add=function(line,column){return new Mapping(this.sourceLines,this.sourceLoc,{start:addPos(this.targetLoc.start,line,column),end:addPos(this.targetLoc.end,line,column)});};Mapping.prototype.subtract=function(line,column){return new Mapping(this.sourceLines,this.sourceLoc,{start:subtractPos(this.targetLoc.start,line,column),end:subtractPos(this.targetLoc.end,line,column)});};Mapping.prototype.indent=function(by,skipFirstLine,noNegativeColumns){if(skipFirstLine===void 0){skipFirstLine=false;}if(noNegativeColumns===void 0){noNegativeColumns=false;}if(by===0){return this;}var targetLoc=this.targetLoc;var startLine=targetLoc.start.line;var endLine=targetLoc.end.line;if(skipFirstLine&&startLine===1&&endLine===1){return this;}targetLoc={start:targetLoc.start,end:targetLoc.end};if(!skipFirstLine||startLine>1){var startColumn=targetLoc.start.column+by;targetLoc.start={line:startLine,column:noNegativeColumns?Math.max(0,startColumn):startColumn};}if(!skipFirstLine||endLine>1){var endColumn=targetLoc.end.column+by;targetLoc.end={line:endLine,column:noNegativeColumns?Math.max(0,endColumn):endColumn};}return new Mapping(this.sourceLines,this.sourceLoc,targetLoc);};return Mapping;}();exports.default=Mapping;function addPos(toPos,line,column){return {line:toPos.line+line-1,column:toPos.line===1?toPos.column+column:toPos.column};}function subtractPos(fromPos,line,column){return {line:fromPos.line-line+1,column:fromPos.line===line?fromPos.column-column:fromPos.column};}function skipChars(sourceLines,sourceFromPos,targetLines,targetFromPos,targetToPos){var targetComparison=util$1.comparePos(targetFromPos,targetToPos);if(targetComparison===0){// Trivial case: no characters to skip.
+  return sourceFromPos;}if(targetComparison<0){// Skipping forward.
+  var sourceCursor=sourceLines.skipSpaces(sourceFromPos)||sourceLines.lastPos();var targetCursor=targetLines.skipSpaces(targetFromPos)||targetLines.lastPos();var lineDiff=targetToPos.line-targetCursor.line;sourceCursor.line+=lineDiff;targetCursor.line+=lineDiff;if(lineDiff>0){// If jumping to later lines, reset columns to the beginnings
+  // of those lines.
+  sourceCursor.column=0;targetCursor.column=0;}else{assert_1.default.strictEqual(lineDiff,0);}while(util$1.comparePos(targetCursor,targetToPos)<0&&targetLines.nextPos(targetCursor,true)){assert_1.default.ok(sourceLines.nextPos(sourceCursor,true));assert_1.default.strictEqual(sourceLines.charAt(sourceCursor),targetLines.charAt(targetCursor));}}else{// Skipping backward.
+  var sourceCursor=sourceLines.skipSpaces(sourceFromPos,true)||sourceLines.firstPos();var targetCursor=targetLines.skipSpaces(targetFromPos,true)||targetLines.firstPos();var lineDiff=targetToPos.line-targetCursor.line;sourceCursor.line+=lineDiff;targetCursor.line+=lineDiff;if(lineDiff<0){// If jumping to earlier lines, reset columns to the ends of
+  // those lines.
+  sourceCursor.column=sourceLines.getLineLength(sourceCursor.line);targetCursor.column=targetLines.getLineLength(targetCursor.line);}else{assert_1.default.strictEqual(lineDiff,0);}while(util$1.comparePos(targetToPos,targetCursor)<0&&targetLines.prevPos(targetCursor,true)){assert_1.default.ok(sourceLines.prevPos(sourceCursor,true));assert_1.default.strictEqual(sourceLines.charAt(sourceCursor),targetLines.charAt(targetCursor));}}return sourceCursor;}});unwrapExports(mapping);var lines=createCommonjsModule(function(module,exports){var __assign=this&&this.__assign||function(){__assign=Object.assign||function(t){for(var s,i=1,n=arguments.length;i<n;i++){s=arguments[i];for(var p in s)if(Object.prototype.hasOwnProperty.call(s,p))t[p]=s[p];}return t;};return __assign.apply(this,arguments);};var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var source_map_1=__importDefault(sourceMap);var mapping_1=__importDefault(mapping);var Lines=/** @class */function(){function Lines(infos,sourceFileName){if(sourceFileName===void 0){sourceFileName=null;}this.infos=infos;this.mappings=[];this.cachedSourceMap=null;this.cachedTabWidth=void 0;assert_1.default.ok(infos.length>0);this.length=infos.length;this.name=sourceFileName||null;if(this.name){this.mappings.push(new mapping_1.default(this,{start:this.firstPos(),end:this.lastPos()}));}}Lines.prototype.toString=function(options){return this.sliceString(this.firstPos(),this.lastPos(),options);};Lines.prototype.getSourceMap=function(sourceMapName,sourceRoot){if(!sourceMapName){// Although we could make up a name or generate an anonymous
+  // source map, instead we assume that any consumer who does not
+  // provide a name does not actually want a source map.
+  return null;}var targetLines=this;function updateJSON(json){json=json||{};json.file=sourceMapName;if(sourceRoot){json.sourceRoot=sourceRoot;}return json;}if(targetLines.cachedSourceMap){// Since Lines objects are immutable, we can reuse any source map
+  // that was previously generated. Nevertheless, we return a new
+  // JSON object here to protect the cached source map from outside
+  // modification.
+  return updateJSON(targetLines.cachedSourceMap.toJSON());}var smg=new source_map_1.default.SourceMapGenerator(updateJSON());var sourcesToContents={};targetLines.mappings.forEach(function(mapping){var sourceCursor=mapping.sourceLines.skipSpaces(mapping.sourceLoc.start)||mapping.sourceLines.lastPos();var targetCursor=targetLines.skipSpaces(mapping.targetLoc.start)||targetLines.lastPos();while(util$1.comparePos(sourceCursor,mapping.sourceLoc.end)<0&&util$1.comparePos(targetCursor,mapping.targetLoc.end)<0){var sourceChar=mapping.sourceLines.charAt(sourceCursor);var targetChar=targetLines.charAt(targetCursor);assert_1.default.strictEqual(sourceChar,targetChar);var sourceName=mapping.sourceLines.name;// Add mappings one character at a time for maximum resolution.
+  smg.addMapping({source:sourceName,original:{line:sourceCursor.line,column:sourceCursor.column},generated:{line:targetCursor.line,column:targetCursor.column}});if(!hasOwn.call(sourcesToContents,sourceName)){var sourceContent=mapping.sourceLines.toString();smg.setSourceContent(sourceName,sourceContent);sourcesToContents[sourceName]=sourceContent;}targetLines.nextPos(targetCursor,true);mapping.sourceLines.nextPos(sourceCursor,true);}});targetLines.cachedSourceMap=smg;return smg.toJSON();};Lines.prototype.bootstrapCharAt=function(pos){assert_1.default.strictEqual(typeof pos,"object");assert_1.default.strictEqual(typeof pos.line,"number");assert_1.default.strictEqual(typeof pos.column,"number");var line=pos.line,column=pos.column,strings=this.toString().split(lineTerminatorSeqExp),string=strings[line-1];if(typeof string==="undefined")return "";if(column===string.length&&line<strings.length)return "\n";if(column>=string.length)return "";return string.charAt(column);};Lines.prototype.charAt=function(pos){assert_1.default.strictEqual(typeof pos,"object");assert_1.default.strictEqual(typeof pos.line,"number");assert_1.default.strictEqual(typeof pos.column,"number");var line=pos.line,column=pos.column,secret=this,infos=secret.infos,info=infos[line-1],c=column;if(typeof info==="undefined"||c<0)return "";var indent=this.getIndentAt(line);if(c<indent)return " ";c+=info.sliceStart-indent;if(c===info.sliceEnd&&line<this.length)return "\n";if(c>=info.sliceEnd)return "";return info.line.charAt(c);};Lines.prototype.stripMargin=function(width,skipFirstLine){if(width===0)return this;assert_1.default.ok(width>0,"negative margin: "+width);if(skipFirstLine&&this.length===1)return this;var lines=new Lines(this.infos.map(function(info,i){if(info.line&&(i>0||!skipFirstLine)){info=__assign({},info,{indent:Math.max(0,info.indent-width)});}return info;}));if(this.mappings.length>0){var newMappings=lines.mappings;assert_1.default.strictEqual(newMappings.length,0);this.mappings.forEach(function(mapping){newMappings.push(mapping.indent(width,skipFirstLine,true));});}return lines;};Lines.prototype.indent=function(by){if(by===0){return this;}var lines=new Lines(this.infos.map(function(info){if(info.line&&!info.locked){info=__assign({},info,{indent:info.indent+by});}return info;}));if(this.mappings.length>0){var newMappings=lines.mappings;assert_1.default.strictEqual(newMappings.length,0);this.mappings.forEach(function(mapping){newMappings.push(mapping.indent(by));});}return lines;};Lines.prototype.indentTail=function(by){if(by===0){return this;}if(this.length<2){return this;}var lines=new Lines(this.infos.map(function(info,i){if(i>0&&info.line&&!info.locked){info=__assign({},info,{indent:info.indent+by});}return info;}));if(this.mappings.length>0){var newMappings=lines.mappings;assert_1.default.strictEqual(newMappings.length,0);this.mappings.forEach(function(mapping){newMappings.push(mapping.indent(by,true));});}return lines;};Lines.prototype.lockIndentTail=function(){if(this.length<2){return this;}return new Lines(this.infos.map(function(info,i){return __assign({},info,{locked:i>0});}));};Lines.prototype.getIndentAt=function(line){assert_1.default.ok(line>=1,"no line "+line+" (line numbers start from 1)");return Math.max(this.infos[line-1].indent,0);};Lines.prototype.guessTabWidth=function(){if(typeof this.cachedTabWidth==="number"){return this.cachedTabWidth;}var counts=[];// Sparse array.
+  var lastIndent=0;for(var line=1,last=this.length;line<=last;++line){var info=this.infos[line-1];var sliced=info.line.slice(info.sliceStart,info.sliceEnd);// Whitespace-only lines don't tell us much about the likely tab
+  // width of this code.
+  if(isOnlyWhitespace(sliced)){continue;}var diff=Math.abs(info.indent-lastIndent);counts[diff]=~~counts[diff]+1;lastIndent=info.indent;}var maxCount=-1;var result=2;for(var tabWidth=1;tabWidth<counts.length;tabWidth+=1){if(hasOwn.call(counts,tabWidth)&&counts[tabWidth]>maxCount){maxCount=counts[tabWidth];result=tabWidth;}}return this.cachedTabWidth=result;};// Determine if the list of lines has a first line that starts with a //
+  // or /* comment. If this is the case, the code may need to be wrapped in
+  // parens to avoid ASI issues.
+  Lines.prototype.startsWithComment=function(){if(this.infos.length===0){return false;}var firstLineInfo=this.infos[0],sliceStart=firstLineInfo.sliceStart,sliceEnd=firstLineInfo.sliceEnd,firstLine=firstLineInfo.line.slice(sliceStart,sliceEnd).trim();return firstLine.length===0||firstLine.slice(0,2)==="//"||firstLine.slice(0,2)==="/*";};Lines.prototype.isOnlyWhitespace=function(){return isOnlyWhitespace(this.toString());};Lines.prototype.isPrecededOnlyByWhitespace=function(pos){var info=this.infos[pos.line-1];var indent=Math.max(info.indent,0);var diff=pos.column-indent;if(diff<=0){// If pos.column does not exceed the indentation amount, then
+  // there must be only whitespace before it.
+  return true;}var start=info.sliceStart;var end=Math.min(start+diff,info.sliceEnd);var prefix=info.line.slice(start,end);return isOnlyWhitespace(prefix);};Lines.prototype.getLineLength=function(line){var info=this.infos[line-1];return this.getIndentAt(line)+info.sliceEnd-info.sliceStart;};Lines.prototype.nextPos=function(pos,skipSpaces){if(skipSpaces===void 0){skipSpaces=false;}var l=Math.max(pos.line,0),c=Math.max(pos.column,0);if(c<this.getLineLength(l)){pos.column+=1;return skipSpaces?!!this.skipSpaces(pos,false,true):true;}if(l<this.length){pos.line+=1;pos.column=0;return skipSpaces?!!this.skipSpaces(pos,false,true):true;}return false;};Lines.prototype.prevPos=function(pos,skipSpaces){if(skipSpaces===void 0){skipSpaces=false;}var l=pos.line,c=pos.column;if(c<1){l-=1;if(l<1)return false;c=this.getLineLength(l);}else{c=Math.min(c-1,this.getLineLength(l));}pos.line=l;pos.column=c;return skipSpaces?!!this.skipSpaces(pos,true,true):true;};Lines.prototype.firstPos=function(){// Trivial, but provided for completeness.
+  return {line:1,column:0};};Lines.prototype.lastPos=function(){return {line:this.length,column:this.getLineLength(this.length)};};Lines.prototype.skipSpaces=function(pos,backward,modifyInPlace){if(backward===void 0){backward=false;}if(modifyInPlace===void 0){modifyInPlace=false;}if(pos){pos=modifyInPlace?pos:{line:pos.line,column:pos.column};}else if(backward){pos=this.lastPos();}else{pos=this.firstPos();}if(backward){while(this.prevPos(pos)){if(!isOnlyWhitespace(this.charAt(pos))&&this.nextPos(pos)){return pos;}}return null;}else{while(isOnlyWhitespace(this.charAt(pos))){if(!this.nextPos(pos)){return null;}}return pos;}};Lines.prototype.trimLeft=function(){var pos=this.skipSpaces(this.firstPos(),false,true);return pos?this.slice(pos):emptyLines;};Lines.prototype.trimRight=function(){var pos=this.skipSpaces(this.lastPos(),true,true);return pos?this.slice(this.firstPos(),pos):emptyLines;};Lines.prototype.trim=function(){var start=this.skipSpaces(this.firstPos(),false,true);if(start===null){return emptyLines;}var end=this.skipSpaces(this.lastPos(),true,true);if(end===null){return emptyLines;}return this.slice(start,end);};Lines.prototype.eachPos=function(callback,startPos,skipSpaces){if(startPos===void 0){startPos=this.firstPos();}if(skipSpaces===void 0){skipSpaces=false;}var pos=this.firstPos();if(startPos){pos.line=startPos.line,pos.column=startPos.column;}if(skipSpaces&&!this.skipSpaces(pos,false,true)){return;// Encountered nothing but spaces.
+  }do callback.call(this,pos);while(this.nextPos(pos,skipSpaces));};Lines.prototype.bootstrapSlice=function(start,end){var strings=this.toString().split(lineTerminatorSeqExp).slice(start.line-1,end.line);if(strings.length>0){strings.push(strings.pop().slice(0,end.column));strings[0]=strings[0].slice(start.column);}return fromString(strings.join("\n"));};Lines.prototype.slice=function(start,end){if(!end){if(!start){// The client seems to want a copy of this Lines object, but
+  // Lines objects are immutable, so it's perfectly adequate to
+  // return the same object.
+  return this;}// Slice to the end if no end position was provided.
+  end=this.lastPos();}if(!start){throw new Error("cannot slice with end but not start");}var sliced=this.infos.slice(start.line-1,end.line);if(start.line===end.line){sliced[0]=sliceInfo(sliced[0],start.column,end.column);}else{assert_1.default.ok(start.line<end.line);sliced[0]=sliceInfo(sliced[0],start.column);sliced.push(sliceInfo(sliced.pop(),0,end.column));}var lines=new Lines(sliced);if(this.mappings.length>0){var newMappings=lines.mappings;assert_1.default.strictEqual(newMappings.length,0);this.mappings.forEach(function(mapping){var sliced=mapping.slice(this,start,end);if(sliced){newMappings.push(sliced);}},this);}return lines;};Lines.prototype.bootstrapSliceString=function(start,end,options){return this.slice(start,end).toString(options);};Lines.prototype.sliceString=function(start,end,options$1){if(start===void 0){start=this.firstPos();}if(end===void 0){end=this.lastPos();}options$1=options.normalize(options$1);var parts=[];var _a=options$1.tabWidth,tabWidth=_a===void 0?2:_a;for(var line=start.line;line<=end.line;++line){var info=this.infos[line-1];if(line===start.line){if(line===end.line){info=sliceInfo(info,start.column,end.column);}else{info=sliceInfo(info,start.column);}}else if(line===end.line){info=sliceInfo(info,0,end.column);}var indent=Math.max(info.indent,0);var before=info.line.slice(0,info.sliceStart);if(options$1.reuseWhitespace&&isOnlyWhitespace(before)&&countSpaces(before,options$1.tabWidth)===indent){// Reuse original spaces if the indentation is correct.
+  parts.push(info.line.slice(0,info.sliceEnd));continue;}var tabs=0;var spaces=indent;if(options$1.useTabs){tabs=Math.floor(indent/tabWidth);spaces-=tabs*tabWidth;}var result="";if(tabs>0){result+=new Array(tabs+1).join("\t");}if(spaces>0){result+=new Array(spaces+1).join(" ");}result+=info.line.slice(info.sliceStart,info.sliceEnd);parts.push(result);}return parts.join(options$1.lineTerminator);};Lines.prototype.isEmpty=function(){return this.length<2&&this.getLineLength(1)<1;};Lines.prototype.join=function(elements){var separator=this;var infos=[];var mappings=[];var prevInfo;function appendLines(linesOrNull){if(linesOrNull===null){return;}if(prevInfo){var info=linesOrNull.infos[0];var indent=new Array(info.indent+1).join(" ");var prevLine=infos.length;var prevColumn=Math.max(prevInfo.indent,0)+prevInfo.sliceEnd-prevInfo.sliceStart;prevInfo.line=prevInfo.line.slice(0,prevInfo.sliceEnd)+indent+info.line.slice(info.sliceStart,info.sliceEnd);// If any part of a line is indentation-locked, the whole line
+  // will be indentation-locked.
+  prevInfo.locked=prevInfo.locked||info.locked;prevInfo.sliceEnd=prevInfo.line.length;if(linesOrNull.mappings.length>0){linesOrNull.mappings.forEach(function(mapping){mappings.push(mapping.add(prevLine,prevColumn));});}}else if(linesOrNull.mappings.length>0){mappings.push.apply(mappings,linesOrNull.mappings);}linesOrNull.infos.forEach(function(info,i){if(!prevInfo||i>0){prevInfo=__assign({},info);infos.push(prevInfo);}});}function appendWithSeparator(linesOrNull,i){if(i>0)appendLines(separator);appendLines(linesOrNull);}elements.map(function(elem){var lines=fromString(elem);if(lines.isEmpty())return null;return lines;}).forEach(function(linesOrNull,i){if(separator.isEmpty()){appendLines(linesOrNull);}else{appendWithSeparator(linesOrNull,i);}});if(infos.length<1)return emptyLines;var lines=new Lines(infos);lines.mappings=mappings;return lines;};Lines.prototype.concat=function(){var args=[];for(var _i=0;_i<arguments.length;_i++){args[_i]=arguments[_i];}var list=[this];list.push.apply(list,args);assert_1.default.strictEqual(list.length,args.length+1);return emptyLines.join(list);};return Lines;}();exports.Lines=Lines;var fromStringCache={};var hasOwn=fromStringCache.hasOwnProperty;var maxCacheKeyLen=10;function countSpaces(spaces,tabWidth){var count=0;var len=spaces.length;for(var i=0;i<len;++i){switch(spaces.charCodeAt(i)){case 9:// '\t'
+  assert_1.default.strictEqual(typeof tabWidth,"number");assert_1.default.ok(tabWidth>0);var next=Math.ceil(count/tabWidth)*tabWidth;if(next===count){count+=tabWidth;}else{count=next;}break;case 11:// '\v'
+  case 12:// '\f'
+  case 13:// '\r'
+  case 0xfeff:// zero-width non-breaking space
+  // These characters contribute nothing to indentation.
+  break;case 32:// ' '
+  default:// Treat all other whitespace like ' '.
+  count+=1;break;}}return count;}exports.countSpaces=countSpaces;var leadingSpaceExp=/^\s*/;// As specified here: http://www.ecma-international.org/ecma-262/6.0/#sec-line-terminators
+  var lineTerminatorSeqExp=/\u000D\u000A|\u000D(?!\u000A)|\u000A|\u2028|\u2029/;/**
+  	 * @param {Object} options - Options object that configures printing.
+  	 */function fromString(string,options$1){if(string instanceof Lines)return string;string+="";var tabWidth=options$1&&options$1.tabWidth;var tabless=string.indexOf("\t")<0;var cacheable=!options$1&&tabless&&string.length<=maxCacheKeyLen;assert_1.default.ok(tabWidth||tabless,"No tab width specified but encountered tabs in string\n"+string);if(cacheable&&hasOwn.call(fromStringCache,string))return fromStringCache[string];var lines=new Lines(string.split(lineTerminatorSeqExp).map(function(line){// TODO: handle null exec result
+  var spaces=leadingSpaceExp.exec(line)[0];return {line:line,indent:countSpaces(spaces,tabWidth),// Boolean indicating whether this line can be reindented.
+  locked:false,sliceStart:spaces.length,sliceEnd:line.length};}),options.normalize(options$1).sourceFileName);if(cacheable)fromStringCache[string]=lines;return lines;}exports.fromString=fromString;function isOnlyWhitespace(string){return !/\S/.test(string);}function sliceInfo(info,startCol,endCol){var sliceStart=info.sliceStart;var sliceEnd=info.sliceEnd;var indent=Math.max(info.indent,0);var lineLength=indent+sliceEnd-sliceStart;if(typeof endCol==="undefined"){endCol=lineLength;}startCol=Math.max(startCol,0);endCol=Math.min(endCol,lineLength);endCol=Math.max(endCol,startCol);if(endCol<indent){indent=endCol;sliceEnd=sliceStart;}else{sliceEnd-=lineLength-endCol;}lineLength=endCol;lineLength-=startCol;if(startCol<indent){indent-=startCol;}else{startCol-=indent;indent=0;sliceStart+=startCol;}assert_1.default.ok(indent>=0);assert_1.default.ok(sliceStart<=sliceEnd);assert_1.default.strictEqual(lineLength,indent+sliceEnd-sliceStart);if(info.indent===indent&&info.sliceStart===sliceStart&&info.sliceEnd===sliceEnd){return info;}return {line:info.line,indent:indent,// A destructive slice always unlocks indentation.
+  locked:false,sliceStart:sliceStart,sliceEnd:sliceEnd};}function concat(elements){return emptyLines.join(elements);}exports.concat=concat;// The emptyLines object needs to be created all the way down here so that
+  // Lines.prototype will be fully populated.
+  var emptyLines=fromString("");});unwrapExports(lines);var lines_1=lines.Lines;var lines_2=lines.countSpaces;var lines_3=lines.fromString;var lines_4=lines.concat;var originalObject=Object;var originalDefProp=Object.defineProperty;var originalCreate=Object.create;function defProp(obj,name,value){if(originalDefProp)try{originalDefProp.call(originalObject,obj,name,{value:value});}catch(definePropertyIsBrokenInIE8){obj[name]=value;}else{obj[name]=value;}}// For functions that will be invoked using .call or .apply, we need to
+  // define those methods on the function objects themselves, rather than
+  // inheriting them from Function.prototype, so that a malicious or clumsy
+  // third party cannot interfere with the functionality of this module by
+  // redefining Function.prototype.call or .apply.
+  function makeSafeToCall(fun){if(fun){defProp(fun,"call",fun.call);defProp(fun,"apply",fun.apply);}return fun;}makeSafeToCall(originalDefProp);makeSafeToCall(originalCreate);var hasOwn$1=makeSafeToCall(Object.prototype.hasOwnProperty);var numToStr=makeSafeToCall(Number.prototype.toString);var strSlice=makeSafeToCall(String.prototype.slice);var cloner=function cloner(){};function create(prototype){if(originalCreate){return originalCreate.call(originalObject,prototype);}cloner.prototype=prototype||null;return new cloner();}var rand=Math.random;var uniqueKeys=create(null);function makeUniqueKey(){// Collisions are highly unlikely, but this module is in the business of
+  // making guarantees rather than safe bets.
+  do var uniqueKey=internString(strSlice.call(numToStr.call(rand(),36),2));while(hasOwn$1.call(uniqueKeys,uniqueKey));return uniqueKeys[uniqueKey]=uniqueKey;}function internString(str){var obj={};obj[str]=true;return Object.keys(obj)[0];}// External users might find this function useful, but it is not necessary
+  // for the typical use of this module.
+  var makeUniqueKey_1=makeUniqueKey;// Object.getOwnPropertyNames is the only way to enumerate non-enumerable
+  // properties, so if we wrap it to ignore our secret keys, there should be
+  // no way (except guessing) to access those properties.
+  var originalGetOPNs=Object.getOwnPropertyNames;Object.getOwnPropertyNames=function getOwnPropertyNames(object){for(var names=originalGetOPNs(object),src=0,dst=0,len=names.length;src<len;++src){if(!hasOwn$1.call(uniqueKeys,names[src])){if(src>dst){names[dst]=names[src];}++dst;}}names.length=dst;return names;};function defaultCreatorFn(object){return create(null);}function makeAccessor(secretCreatorFn){var brand=makeUniqueKey();var passkey=create(null);secretCreatorFn=secretCreatorFn||defaultCreatorFn;function register(object){var secret;// Created lazily.
+  function vault(key,forget){// Only code that has access to the passkey can retrieve (or forget)
+  // the secret object.
+  if(key===passkey){return forget?secret=null:secret||(secret=secretCreatorFn(object));}}defProp(object,brand,vault);}function accessor(object){if(!hasOwn$1.call(object,brand))register(object);return object[brand](passkey);}accessor.forget=function(object){if(hasOwn$1.call(object,brand))object[brand](passkey,true);};return accessor;}var makeAccessor_1=makeAccessor;var _private={makeUniqueKey:makeUniqueKey_1,makeAccessor:makeAccessor_1};var comments=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var types=__importStar(main);var n=types.namedTypes;var isArray=types.builtInTypes.array;var isObject=types.builtInTypes.object;var childNodesCacheKey=_private.makeUniqueKey();// TODO Move a non-caching implementation of this function into ast-types,
+  // and implement a caching wrapper function here.
+  function getSortedChildNodes(node,lines,resultArray){if(!node){return;}// The .loc checks below are sensitive to some of the problems that
+  // are fixed by this utility function. Specifically, if it decides to
+  // set node.loc to null, indicating that the node's .loc information
+  // is unreliable, then we don't want to add node to the resultArray.
+  util$1.fixFaultyLocations(node,lines);if(resultArray){if(n.Node.check(node)&&n.SourceLocation.check(node.loc)){// This reverse insertion sort almost always takes constant
+  // time because we almost always (maybe always?) append the
+  // nodes in order anyway.
+  for(var i=resultArray.length-1;i>=0;--i){if(util$1.comparePos(resultArray[i].loc.end,node.loc.start)<=0){break;}}resultArray.splice(i+1,0,node);return;}}else if(node[childNodesCacheKey]){return node[childNodesCacheKey];}var names;if(isArray.check(node)){names=Object.keys(node);}else if(isObject.check(node)){names=types.getFieldNames(node);}else{return;}if(!resultArray){Object.defineProperty(node,childNodesCacheKey,{value:resultArray=[],enumerable:false});}for(var i=0,nameCount=names.length;i<nameCount;++i){getSortedChildNodes(node[names[i]],lines,resultArray);}return resultArray;}// As efficiently as possible, decorate the comment object with
+  // .precedingNode, .enclosingNode, and/or .followingNode properties, at
+  // least one of which is guaranteed to be defined.
+  function decorateComment(node,comment,lines){var childNodes=getSortedChildNodes(node,lines);// Time to dust off the old binary search robes and wizard hat.
+  var left=0,right=childNodes.length;while(left<right){var middle=left+right>>1;var child=childNodes[middle];if(util$1.comparePos(child.loc.start,comment.loc.start)<=0&&util$1.comparePos(comment.loc.end,child.loc.end)<=0){// The comment is completely contained by this child node.
+  decorateComment(comment.enclosingNode=child,comment,lines);return;// Abandon the binary search at this level.
+  }if(util$1.comparePos(child.loc.end,comment.loc.start)<=0){// This child node falls completely before the comment.
+  // Because we will never consider this node or any nodes
+  // before it again, this node must be the closest preceding
+  // node we have encountered so far.
+  var precedingNode=child;left=middle+1;continue;}if(util$1.comparePos(comment.loc.end,child.loc.start)<=0){// This child node falls completely after the comment.
+  // Because we will never consider this node or any nodes after
+  // it again, this node must be the closest following node we
+  // have encountered so far.
+  var followingNode=child;right=middle;continue;}throw new Error("Comment location overlaps with node location");}if(precedingNode){comment.precedingNode=precedingNode;}if(followingNode){comment.followingNode=followingNode;}}function attach(comments,ast,lines){if(!isArray.check(comments)){return;}var tiesToBreak=[];comments.forEach(function(comment){comment.loc.lines=lines;decorateComment(ast,comment,lines);var pn=comment.precedingNode;var en=comment.enclosingNode;var fn=comment.followingNode;if(pn&&fn){var tieCount=tiesToBreak.length;if(tieCount>0){var lastTie=tiesToBreak[tieCount-1];assert_1.default.strictEqual(lastTie.precedingNode===comment.precedingNode,lastTie.followingNode===comment.followingNode);if(lastTie.followingNode!==comment.followingNode){breakTies(tiesToBreak,lines);}}tiesToBreak.push(comment);}else if(pn){// No contest: we have a trailing comment.
+  breakTies(tiesToBreak,lines);addTrailingComment(pn,comment);}else if(fn){// No contest: we have a leading comment.
+  breakTies(tiesToBreak,lines);addLeadingComment(fn,comment);}else if(en){// The enclosing node has no child nodes at all, so what we
+  // have here is a dangling comment, e.g. [/* crickets */].
+  breakTies(tiesToBreak,lines);addDanglingComment(en,comment);}else{throw new Error("AST contains no nodes at all?");}});breakTies(tiesToBreak,lines);comments.forEach(function(comment){// These node references were useful for breaking ties, but we
+  // don't need them anymore, and they create cycles in the AST that
+  // may lead to infinite recursion if we don't delete them here.
+  delete comment.precedingNode;delete comment.enclosingNode;delete comment.followingNode;});}exports.attach=attach;function breakTies(tiesToBreak,lines){var tieCount=tiesToBreak.length;if(tieCount===0){return;}var pn=tiesToBreak[0].precedingNode;var fn=tiesToBreak[0].followingNode;var gapEndPos=fn.loc.start;// Iterate backwards through tiesToBreak, examining the gaps
+  // between the tied comments. In order to qualify as leading, a
+  // comment must be separated from fn by an unbroken series of
+  // whitespace-only gaps (or other comments).
+  for(var indexOfFirstLeadingComment=tieCount;indexOfFirstLeadingComment>0;--indexOfFirstLeadingComment){var comment=tiesToBreak[indexOfFirstLeadingComment-1];assert_1.default.strictEqual(comment.precedingNode,pn);assert_1.default.strictEqual(comment.followingNode,fn);var gap=lines.sliceString(comment.loc.end,gapEndPos);if(/\S/.test(gap)){// The gap string contained something other than whitespace.
+  break;}gapEndPos=comment.loc.start;}while(indexOfFirstLeadingComment<=tieCount&&(comment=tiesToBreak[indexOfFirstLeadingComment])&&(// If the comment is a //-style comment and indented more
+  // deeply than the node itself, reconsider it as trailing.
+  comment.type==="Line"||comment.type==="CommentLine")&&comment.loc.start.column>fn.loc.start.column){++indexOfFirstLeadingComment;}tiesToBreak.forEach(function(comment,i){if(i<indexOfFirstLeadingComment){addTrailingComment(pn,comment);}else{addLeadingComment(fn,comment);}});tiesToBreak.length=0;}function addCommentHelper(node,comment){var comments=node.comments||(node.comments=[]);comments.push(comment);}function addLeadingComment(node,comment){comment.leading=true;comment.trailing=false;addCommentHelper(node,comment);}function addDanglingComment(node,comment){comment.leading=false;comment.trailing=false;addCommentHelper(node,comment);}function addTrailingComment(node,comment){comment.leading=false;comment.trailing=true;addCommentHelper(node,comment);}function printLeadingComment(commentPath,print){var comment=commentPath.getValue();n.Comment.assert(comment);var loc=comment.loc;var lines$1=loc&&loc.lines;var parts=[print(commentPath)];if(comment.trailing){// When we print trailing comments as leading comments, we don't
+  // want to bring any trailing spaces along.
+  parts.push("\n");}else if(lines$1 instanceof lines.Lines){var trailingSpace=lines$1.slice(loc.end,lines$1.skipSpaces(loc.end)||lines$1.lastPos());if(trailingSpace.length===1){// If the trailing space contains no newlines, then we want to
+  // preserve it exactly as we found it.
+  parts.push(trailingSpace);}else{// If the trailing space contains newlines, then replace it
+  // with just that many newlines, with all other spaces removed.
+  parts.push(new Array(trailingSpace.length).join("\n"));}}else{parts.push("\n");}return lines.concat(parts);}function printTrailingComment(commentPath,print){var comment=commentPath.getValue(commentPath);n.Comment.assert(comment);var loc=comment.loc;var lines$1=loc&&loc.lines;var parts=[];if(lines$1 instanceof lines.Lines){var fromPos=lines$1.skipSpaces(loc.start,true)||lines$1.firstPos();var leadingSpace=lines$1.slice(fromPos,loc.start);if(leadingSpace.length===1){// If the leading space contains no newlines, then we want to
+  // preserve it exactly as we found it.
+  parts.push(leadingSpace);}else{// If the leading space contains newlines, then replace it
+  // with just that many newlines, sans all other spaces.
+  parts.push(new Array(leadingSpace.length).join("\n"));}}parts.push(print(commentPath));return lines.concat(parts);}function printComments(path,print){var value=path.getValue();var innerLines=print(path);var comments=n.Node.check(value)&&types.getFieldValue(value,"comments");if(!comments||comments.length===0){return innerLines;}var leadingParts=[];var trailingParts=[innerLines];path.each(function(commentPath){var comment=commentPath.getValue();var leading=types.getFieldValue(comment,"leading");var trailing=types.getFieldValue(comment,"trailing");if(leading||trailing&&!(n.Statement.check(value)||comment.type==="Block"||comment.type==="CommentBlock")){leadingParts.push(printLeadingComment(commentPath,print));}else if(trailing){trailingParts.push(printTrailingComment(commentPath,print));}},"comments");leadingParts.push.apply(leadingParts,trailingParts);return lines.concat(leadingParts);}exports.printComments=printComments;});unwrapExports(comments);var comments_1=comments.attach;var comments_2=comments.printComments;var parser=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var types=__importStar(main);var b=types.builders;var isObject=types.builtInTypes.object;var isArray=types.builtInTypes.array;var util=__importStar(util$1);function parse(source,options$1){options$1=options.normalize(options$1);var lines$1=lines.fromString(source,options$1);var sourceWithoutTabs=lines$1.toString({tabWidth:options$1.tabWidth,reuseWhitespace:false,useTabs:false});var comments$1=[];var ast=options$1.parser.parse(sourceWithoutTabs,{jsx:true,loc:true,locations:true,range:options$1.range,comment:true,onComment:comments$1,tolerant:util.getOption(options$1,"tolerant",true),ecmaVersion:6,sourceType:util.getOption(options$1,"sourceType","module")});// Use ast.tokens if possible, and otherwise fall back to the Esprima
+  // tokenizer. All the preconfigured ../parsers/* expose ast.tokens
+  // automatically, but custom parsers might need additional configuration
+  // to avoid this fallback.
+  var tokens=Array.isArray(ast.tokens)?ast.tokens:esprima$1.tokenize(sourceWithoutTabs,{loc:true});// We will reattach the tokens array to the file object below.
+  delete ast.tokens;// Make sure every token has a token.value string.
+  tokens.forEach(function(token){if(typeof token.value!=="string"){token.value=lines$1.sliceString(token.loc.start,token.loc.end);}});if(Array.isArray(ast.comments)){comments$1=ast.comments;delete ast.comments;}if(ast.loc){// If the source was empty, some parsers give loc.{start,end}.line
+  // values of 0, instead of the minimum of 1.
+  util.fixFaultyLocations(ast,lines$1);}else{ast.loc={start:lines$1.firstPos(),end:lines$1.lastPos()};}ast.loc.lines=lines$1;ast.loc.indent=0;var file;var program;if(ast.type==="Program"){program=ast;// In order to ensure we reprint leading and trailing program
+  // comments, wrap the original Program node with a File node. Only
+  // ESTree parsers (Acorn and Esprima) return a Program as the root AST
+  // node. Most other (Babylon-like) parsers return a File.
+  file=b.file(ast,options$1.sourceFileName||null);file.loc={start:lines$1.firstPos(),end:lines$1.lastPos(),lines:lines$1,indent:0};}else if(ast.type==="File"){file=ast;program=file.program;}// Expose file.tokens unless the caller passed false for options.tokens.
+  if(options$1.tokens){file.tokens=tokens;}// Expand the Program's .loc to include all comments (not just those
+  // attached to the Program node, as its children may have comments as
+  // well), since sometimes program.loc.{start,end} will coincide with the
+  // .loc.{start,end} of the first and last *statements*, mistakenly
+  // excluding comments that fall outside that region.
+  var trueProgramLoc=util.getTrueLoc({type:program.type,loc:program.loc,body:[],comments:comments$1},lines$1);program.loc.start=trueProgramLoc.start;program.loc.end=trueProgramLoc.end;// Passing file.program here instead of just file means that initial
+  // comments will be attached to program.body[0] instead of program.
+  comments.attach(comments$1,program.body.length?file.program:file,lines$1);// Return a copy of the original AST so that any changes made may be
+  // compared to the original.
+  return new TreeCopier(lines$1,tokens).copy(file);}exports.parse=parse;var TreeCopier=function TreeCopier(lines,tokens){assert_1.default.ok(this instanceof TreeCopier);this.lines=lines;this.tokens=tokens;this.startTokenIndex=0;this.endTokenIndex=tokens.length;this.indent=0;this.seen=new Map();};var TCp=TreeCopier.prototype;TCp.copy=function(node){if(this.seen.has(node)){return this.seen.get(node);}if(isArray.check(node)){var copy=new Array(node.length);this.seen.set(node,copy);node.forEach(function(item,i){copy[i]=this.copy(item);},this);return copy;}if(!isObject.check(node)){return node;}util.fixFaultyLocations(node,this.lines);var copy=Object.create(Object.getPrototypeOf(node),{original:{value:node,configurable:false,enumerable:false,writable:true}});this.seen.set(node,copy);var loc=node.loc;var oldIndent=this.indent;var newIndent=oldIndent;var oldStartTokenIndex=this.startTokenIndex;var oldEndTokenIndex=this.endTokenIndex;if(loc){// When node is a comment, we set node.loc.indent to
+  // node.loc.start.column so that, when/if we print the comment by
+  // itself, we can strip that much whitespace from the left margin of
+  // the comment. This only really matters for multiline Block comments,
+  // but it doesn't hurt for Line comments.
+  if(node.type==="Block"||node.type==="Line"||node.type==="CommentBlock"||node.type==="CommentLine"||this.lines.isPrecededOnlyByWhitespace(loc.start)){newIndent=this.indent=loc.start.column;}// Every node.loc has a reference to the original source lines as well
+  // as a complete list of source tokens.
+  loc.lines=this.lines;loc.tokens=this.tokens;loc.indent=newIndent;// Set loc.start.token and loc.end.token such that
+  // loc.tokens.slice(loc.start.token, loc.end.token) returns a list of
+  // all the tokens that make up this node.
+  this.findTokenRange(loc);}var keys=Object.keys(node);var keyCount=keys.length;for(var i=0;i<keyCount;++i){var key=keys[i];if(key==="loc"){copy[key]=node[key];}else if(key==="tokens"&&node.type==="File"){// Preserve file.tokens (uncopied) in case client code cares about
+  // it, even though Recast ignores it when reprinting.
+  copy[key]=node[key];}else{copy[key]=this.copy(node[key]);}}this.indent=oldIndent;this.startTokenIndex=oldStartTokenIndex;this.endTokenIndex=oldEndTokenIndex;return copy;};// If we didn't have any idea where in loc.tokens to look for tokens
+  // contained by this loc, a binary search would be appropriate, but
+  // because we maintain this.startTokenIndex and this.endTokenIndex as we
+  // traverse the AST, we only need to make small (linear) adjustments to
+  // those indexes with each recursive iteration.
+  TCp.findTokenRange=function(loc){// In the unlikely event that loc.tokens[this.startTokenIndex] starts
+  // *after* loc.start, we need to rewind this.startTokenIndex first.
+  while(this.startTokenIndex>0){var token=loc.tokens[this.startTokenIndex];if(util.comparePos(loc.start,token.loc.start)<0){--this.startTokenIndex;}else break;}// In the unlikely event that loc.tokens[this.endTokenIndex - 1] ends
+  // *before* loc.end, we need to fast-forward this.endTokenIndex first.
+  while(this.endTokenIndex<loc.tokens.length){var token=loc.tokens[this.endTokenIndex];if(util.comparePos(token.loc.end,loc.end)<0){++this.endTokenIndex;}else break;}// Increment this.startTokenIndex until we've found the first token
+  // contained by this node.
+  while(this.startTokenIndex<this.endTokenIndex){var token=loc.tokens[this.startTokenIndex];if(util.comparePos(token.loc.start,loc.start)<0){++this.startTokenIndex;}else break;}// Index into loc.tokens of the first token within this node.
+  loc.start.token=this.startTokenIndex;// Decrement this.endTokenIndex until we've found the first token after
+  // this node (not contained by the node).
+  while(this.endTokenIndex>this.startTokenIndex){var token=loc.tokens[this.endTokenIndex-1];if(util.comparePos(loc.end,token.loc.end)<0){--this.endTokenIndex;}else break;}// Index into loc.tokens of the first token *after* this node.
+  // If loc.start.token === loc.end.token, the node contains no tokens,
+  // and the index is that of the next token following this node.
+  loc.end.token=this.endTokenIndex;};});unwrapExports(parser);var parser_1=parser.parse;var fastPath=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var types=__importStar(main);var n=types.namedTypes;var isArray=types.builtInTypes.array;var isNumber=types.builtInTypes.number;var util=__importStar(util$1);var FastPath=function FastPath(value){assert_1.default.ok(this instanceof FastPath);this.stack=[value];};var FPp=FastPath.prototype;// Static convenience function for coercing a value to a FastPath.
+  FastPath.from=function(obj){if(obj instanceof FastPath){// Return a defensive copy of any existing FastPath instances.
+  return obj.copy();}if(obj instanceof types.NodePath){// For backwards compatibility, unroll NodePath instances into
+  // lightweight FastPath [..., name, value] stacks.
+  var copy=Object.create(FastPath.prototype);var stack=[obj.value];for(var pp;pp=obj.parentPath;obj=pp)stack.push(obj.name,pp.value);copy.stack=stack.reverse();return copy;}// Otherwise use obj as the value of the new FastPath instance.
+  return new FastPath(obj);};FPp.copy=function copy(){var copy=Object.create(FastPath.prototype);copy.stack=this.stack.slice(0);return copy;};// The name of the current property is always the penultimate element of
+  // this.stack, and always a String.
+  FPp.getName=function getName(){var s=this.stack;var len=s.length;if(len>1){return s[len-2];}// Since the name is always a string, null is a safe sentinel value to
+  // return if we do not know the name of the (root) value.
+  return null;};// The value of the current property is always the final element of
+  // this.stack.
+  FPp.getValue=function getValue(){var s=this.stack;return s[s.length-1];};FPp.valueIsDuplicate=function(){var s=this.stack;var valueIndex=s.length-1;return s.lastIndexOf(s[valueIndex],valueIndex-1)>=0;};function getNodeHelper(path,count){var s=path.stack;for(var i=s.length-1;i>=0;i-=2){var value=s[i];if(n.Node.check(value)&&--count<0){return value;}}return null;}FPp.getNode=function getNode(count){if(count===void 0){count=0;}return getNodeHelper(this,~~count);};FPp.getParentNode=function getParentNode(count){if(count===void 0){count=0;}return getNodeHelper(this,~~count+1);};// The length of the stack can be either even or odd, depending on whether
+  // or not we have a name for the root value. The difference between the
+  // index of the root value and the index of the final value is always
+  // even, though, which allows us to return the root value in constant time
+  // (i.e. without iterating backwards through the stack).
+  FPp.getRootValue=function getRootValue(){var s=this.stack;if(s.length%2===0){return s[1];}return s[0];};// Temporarily push properties named by string arguments given after the
+  // callback function onto this.stack, then call the callback with a
+  // reference to this (modified) FastPath object. Note that the stack will
+  // be restored to its original state after the callback is finished, so it
+  // is probably a mistake to retain a reference to the path.
+  FPp.call=function call(callback/*, name1, name2, ... */){var s=this.stack;var origLen=s.length;var value=s[origLen-1];var argc=arguments.length;for(var i=1;i<argc;++i){var name=arguments[i];value=value[name];s.push(name,value);}var result=callback(this);s.length=origLen;return result;};// Similar to FastPath.prototype.call, except that the value obtained by
+  // accessing this.getValue()[name1][name2]... should be array-like. The
+  // callback will be called with a reference to this path object for each
+  // element of the array.
+  FPp.each=function each(callback/*, name1, name2, ... */){var s=this.stack;var origLen=s.length;var value=s[origLen-1];var argc=arguments.length;for(var i=1;i<argc;++i){var name=arguments[i];value=value[name];s.push(name,value);}for(var i=0;i<value.length;++i){if(i in value){s.push(i,value[i]);// If the callback needs to know the value of i, call
+  // path.getName(), assuming path is the parameter name.
+  callback(this);s.length-=2;}}s.length=origLen;};// Similar to FastPath.prototype.each, except that the results of the
+  // callback function invocations are stored in an array and returned at
+  // the end of the iteration.
+  FPp.map=function map(callback/*, name1, name2, ... */){var s=this.stack;var origLen=s.length;var value=s[origLen-1];var argc=arguments.length;for(var i=1;i<argc;++i){var name=arguments[i];value=value[name];s.push(name,value);}var result=new Array(value.length);for(var i=0;i<value.length;++i){if(i in value){s.push(i,value[i]);result[i]=callback(this,i);s.length-=2;}}s.length=origLen;return result;};// Returns true if the node at the tip of the path is wrapped with
+  // parentheses, OR if the only reason the node needed parentheses was that
+  // it couldn't be the first expression in the enclosing statement (see
+  // FastPath#canBeFirstInStatement), and it has an opening `(` character.
+  // For example, the FunctionExpression in `(function(){}())` appears to
+  // need parentheses only because it's the first expression in the AST, but
+  // since it happens to be preceded by a `(` (which is not apparent from
+  // the AST but can be determined using FastPath#getPrevToken), there is no
+  // ambiguity about how to parse it, so it counts as having parentheses,
+  // even though it is not immediately followed by a `)`.
+  FPp.hasParens=function(){var node=this.getNode();var prevToken=this.getPrevToken(node);if(!prevToken){return false;}var nextToken=this.getNextToken(node);if(!nextToken){return false;}if(prevToken.value==="("){if(nextToken.value===")"){// If the node preceded by a `(` token and followed by a `)` token,
+  // then of course it has parentheses.
+  return true;}// If this is one of the few Expression types that can't come first in
+  // the enclosing statement because of parsing ambiguities (namely,
+  // FunctionExpression, ObjectExpression, and ClassExpression) and
+  // this.firstInStatement() returns true, and the node would not need
+  // parentheses in an expression context because this.needsParens(true)
+  // returns false, then it just needs an opening parenthesis to resolve
+  // the parsing ambiguity that made it appear to need parentheses.
+  var justNeedsOpeningParen=!this.canBeFirstInStatement()&&this.firstInStatement()&&!this.needsParens(true);if(justNeedsOpeningParen){return true;}}return false;};FPp.getPrevToken=function(node){node=node||this.getNode();var loc=node&&node.loc;var tokens=loc&&loc.tokens;if(tokens&&loc.start.token>0){var token=tokens[loc.start.token-1];if(token){// Do not return tokens that fall outside the root subtree.
+  var rootLoc=this.getRootValue().loc;if(util.comparePos(rootLoc.start,token.loc.start)<=0){return token;}}}return null;};FPp.getNextToken=function(node){node=node||this.getNode();var loc=node&&node.loc;var tokens=loc&&loc.tokens;if(tokens&&loc.end.token<tokens.length){var token=tokens[loc.end.token];if(token){// Do not return tokens that fall outside the root subtree.
+  var rootLoc=this.getRootValue().loc;if(util.comparePos(token.loc.end,rootLoc.end)<=0){return token;}}}return null;};// Inspired by require("ast-types").NodePath.prototype.needsParens, but
+  // more efficient because we're iterating backwards through a stack.
+  FPp.needsParens=function(assumeExpressionContext){var node=this.getNode();// This needs to come before `if (!parent) { return false }` because
+  // an object destructuring assignment requires parens for
+  // correctness even when it's the topmost expression.
+  if(node.type==="AssignmentExpression"&&node.left.type==='ObjectPattern'){return true;}var parent=this.getParentNode();if(!parent){return false;}var name=this.getName();// If the value of this path is some child of a Node and not a Node
+  // itself, then it doesn't need parentheses. Only Node objects (in fact,
+  // only Expression nodes) need parentheses.
+  if(this.getValue()!==node){return false;}// Only statements don't need parentheses.
+  if(n.Statement.check(node)){return false;}// Identifiers never need parentheses.
+  if(node.type==="Identifier"){return false;}if(parent.type==="ParenthesizedExpression"){return false;}switch(node.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return parent.type==="MemberExpression"&&name==="object"&&parent.object===node;case"BinaryExpression":case"LogicalExpression":switch(parent.type){case"CallExpression":return name==="callee"&&parent.callee===node;case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return true;case"MemberExpression":return name==="object"&&parent.object===node;case"BinaryExpression":case"LogicalExpression":var po=parent.operator;var pp=PRECEDENCE[po];var no=node.operator;var np=PRECEDENCE[no];if(pp>np){return true;}if(pp===np&&name==="right"){assert_1.default.strictEqual(parent.right,node);return true;}default:return false;}case"SequenceExpression":switch(parent.type){case"ReturnStatement":return false;case"ForStatement":// Although parentheses wouldn't hurt around sequence expressions in
+  // the head of for loops, traditional style dictates that e.g. i++,
+  // j++ should not be wrapped with parentheses.
+  return false;case"ExpressionStatement":return name!=="expression";default:// Otherwise err on the side of overparenthesization, adding
+  // explicit exceptions above if this proves overzealous.
+  return true;}case"YieldExpression":switch(parent.type){case"BinaryExpression":case"LogicalExpression":case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"CallExpression":case"MemberExpression":case"NewExpression":case"ConditionalExpression":case"YieldExpression":return true;default:return false;}case"IntersectionTypeAnnotation":case"UnionTypeAnnotation":return parent.type==="NullableTypeAnnotation";case"Literal":return parent.type==="MemberExpression"&&isNumber.check(node.value)&&name==="object"&&parent.object===node;// Babel 6 Literal split
+  case"NumericLiteral":return parent.type==="MemberExpression"&&name==="object"&&parent.object===node;case"AssignmentExpression":case"ConditionalExpression":switch(parent.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"BinaryExpression":case"LogicalExpression":return true;case"CallExpression":case"NewExpression":return name==="callee"&&parent.callee===node;case"ConditionalExpression":return name==="test"&&parent.test===node;case"MemberExpression":return name==="object"&&parent.object===node;default:return false;}case"ArrowFunctionExpression":if(n.CallExpression.check(parent)&&name==='callee'){return true;}if(n.MemberExpression.check(parent)&&name==='object'){return true;}return isBinary(parent);case"ObjectExpression":if(parent.type==="ArrowFunctionExpression"&&name==="body"){return true;}break;case"CallExpression":if(name==="declaration"&&n.ExportDefaultDeclaration.check(parent)&&n.FunctionExpression.check(node.callee)){return true;}}if(parent.type==="NewExpression"&&name==="callee"&&parent.callee===node){return containsCallExpression(node);}if(assumeExpressionContext!==true&&!this.canBeFirstInStatement()&&this.firstInStatement()){return true;}return false;};function isBinary(node){return n.BinaryExpression.check(node)||n.LogicalExpression.check(node);}var PRECEDENCE={};[["||"],["&&"],["|"],["^"],["&"],["==","===","!=","!=="],["<",">","<=",">=","in","instanceof"],[">>","<<",">>>"],["+","-"],["*","/","%","**"]].forEach(function(tier,i){tier.forEach(function(op){PRECEDENCE[op]=i;});});function containsCallExpression(node){if(n.CallExpression.check(node)){return true;}if(isArray.check(node)){return node.some(containsCallExpression);}if(n.Node.check(node)){return types.someField(node,function(_name,child){return containsCallExpression(child);});}return false;}FPp.canBeFirstInStatement=function(){var node=this.getNode();if(n.FunctionExpression.check(node)){return false;}if(n.ObjectExpression.check(node)){return false;}if(n.ClassExpression.check(node)){return false;}return true;};FPp.firstInStatement=function(){var s=this.stack;var parentName,parent;var childName,child;for(var i=s.length-1;i>=0;i-=2){if(n.Node.check(s[i])){childName=parentName;child=parent;parentName=s[i-1];parent=s[i];}if(!parent||!child){continue;}if(n.BlockStatement.check(parent)&&parentName==="body"&&childName===0){assert_1.default.strictEqual(parent.body[0],child);return true;}if(n.ExpressionStatement.check(parent)&&childName==="expression"){assert_1.default.strictEqual(parent.expression,child);return true;}if(n.AssignmentExpression.check(parent)&&childName==="left"){assert_1.default.strictEqual(parent.left,child);return true;}if(n.ArrowFunctionExpression.check(parent)&&childName==="body"){assert_1.default.strictEqual(parent.body,child);return true;}if(n.SequenceExpression.check(parent)&&parentName==="expressions"&&childName===0){assert_1.default.strictEqual(parent.expressions[0],child);continue;}if(n.CallExpression.check(parent)&&childName==="callee"){assert_1.default.strictEqual(parent.callee,child);continue;}if(n.MemberExpression.check(parent)&&childName==="object"){assert_1.default.strictEqual(parent.object,child);continue;}if(n.ConditionalExpression.check(parent)&&childName==="test"){assert_1.default.strictEqual(parent.test,child);continue;}if(isBinary(parent)&&childName==="left"){assert_1.default.strictEqual(parent.left,child);continue;}if(n.UnaryExpression.check(parent)&&!parent.prefix&&childName==="argument"){assert_1.default.strictEqual(parent.argument,child);continue;}return false;}return true;};exports.default=FastPath;});unwrapExports(fastPath);var patcher=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var linesModule=__importStar(lines);var types=__importStar(main);var Printable=types.namedTypes.Printable;var Expression=types.namedTypes.Expression;var ReturnStatement=types.namedTypes.ReturnStatement;var SourceLocation=types.namedTypes.SourceLocation;var fast_path_1=__importDefault(fastPath);var isObject=types.builtInTypes.object;var isArray=types.builtInTypes.array;var isString=types.builtInTypes.string;var riskyAdjoiningCharExp=/[0-9a-z_$]/i;var Patcher=function Patcher(lines){assert_1.default.ok(this instanceof Patcher);assert_1.default.ok(lines instanceof linesModule.Lines);var self=this,replacements=[];self.replace=function(loc,lines){if(isString.check(lines))lines=linesModule.fromString(lines);replacements.push({lines:lines,start:loc.start,end:loc.end});};self.get=function(loc){// If no location is provided, return the complete Lines object.
+  loc=loc||{start:{line:1,column:0},end:{line:lines.length,column:lines.getLineLength(lines.length)}};var sliceFrom=loc.start,toConcat=[];function pushSlice(from,to){assert_1.default.ok(util$1.comparePos(from,to)<=0);toConcat.push(lines.slice(from,to));}replacements.sort(function(a,b){return util$1.comparePos(a.start,b.start);}).forEach(function(rep){if(util$1.comparePos(sliceFrom,rep.start)>0);else{pushSlice(sliceFrom,rep.start);toConcat.push(rep.lines);sliceFrom=rep.end;}});pushSlice(sliceFrom,loc.end);return linesModule.concat(toConcat);};};exports.Patcher=Patcher;var Pp=Patcher.prototype;Pp.tryToReprintComments=function(newNode,oldNode,print){var patcher=this;if(!newNode.comments&&!oldNode.comments){// We were (vacuously) able to reprint all the comments!
+  return true;}var newPath=fast_path_1.default.from(newNode);var oldPath=fast_path_1.default.from(oldNode);newPath.stack.push("comments",getSurroundingComments(newNode));oldPath.stack.push("comments",getSurroundingComments(oldNode));var reprints=[];var ableToReprintComments=findArrayReprints(newPath,oldPath,reprints);// No need to pop anything from newPath.stack or oldPath.stack, since
+  // newPath and oldPath are fresh local variables.
+  if(ableToReprintComments&&reprints.length>0){reprints.forEach(function(reprint){var oldComment=reprint.oldPath.getValue();assert_1.default.ok(oldComment.leading||oldComment.trailing);patcher.replace(oldComment.loc,// Comments can't have .comments, so it doesn't matter whether we
+  // print with comments or without.
+  print(reprint.newPath).indentTail(oldComment.loc.indent));});}return ableToReprintComments;};// Get all comments that are either leading or trailing, ignoring any
+  // comments that occur inside node.loc. Returns an empty array for nodes
+  // with no leading or trailing comments.
+  function getSurroundingComments(node){var result=[];if(node.comments&&node.comments.length>0){node.comments.forEach(function(comment){if(comment.leading||comment.trailing){result.push(comment);}});}return result;}Pp.deleteComments=function(node){if(!node.comments){return;}var patcher=this;node.comments.forEach(function(comment){if(comment.leading){// Delete leading comments along with any trailing whitespace they
+  // might have.
+  patcher.replace({start:comment.loc.start,end:node.loc.lines.skipSpaces(comment.loc.end,false,false)},"");}else if(comment.trailing){// Delete trailing comments along with any leading whitespace they
+  // might have.
+  patcher.replace({start:node.loc.lines.skipSpaces(comment.loc.start,true,false),end:comment.loc.end},"");}});};function getReprinter(path){assert_1.default.ok(path instanceof fast_path_1.default);// Make sure that this path refers specifically to a Node, rather than
+  // some non-Node subproperty of a Node.
+  var node=path.getValue();if(!Printable.check(node))return;var orig=node.original;var origLoc=orig&&orig.loc;var lines=origLoc&&origLoc.lines;var reprints=[];if(!lines||!findReprints(path,reprints))return;return function(print){var patcher=new Patcher(lines);reprints.forEach(function(reprint){var newNode=reprint.newPath.getValue();var oldNode=reprint.oldPath.getValue();SourceLocation.assert(oldNode.loc,true);var needToPrintNewPathWithComments=!patcher.tryToReprintComments(newNode,oldNode,print);if(needToPrintNewPathWithComments){// Since we were not able to preserve all leading/trailing
+  // comments, we delete oldNode's comments, print newPath with
+  // comments, and then patch the resulting lines where oldNode used
+  // to be.
+  patcher.deleteComments(oldNode);}var newLines=print(reprint.newPath,{includeComments:needToPrintNewPathWithComments,// If the oldNode we're replacing already had parentheses, we may
+  // not need to print the new node with any extra parentheses,
+  // because the existing parentheses will suffice. However, if the
+  // newNode has a different type than the oldNode, let the printer
+  // decide if reprint.newPath needs parentheses, as usual.
+  avoidRootParens:oldNode.type===newNode.type&&reprint.oldPath.hasParens()}).indentTail(oldNode.loc.indent);var nls=needsLeadingSpace(lines,oldNode.loc,newLines);var nts=needsTrailingSpace(lines,oldNode.loc,newLines);// If we try to replace the argument of a ReturnStatement like
+  // return"asdf" with e.g. a literal null expression, we run the risk
+  // of ending up with returnnull, so we need to add an extra leading
+  // space in situations where that might happen. Likewise for
+  // "asdf"in obj. See #170.
+  if(nls||nts){var newParts=[];nls&&newParts.push(" ");newParts.push(newLines);nts&&newParts.push(" ");newLines=linesModule.concat(newParts);}patcher.replace(oldNode.loc,newLines);});// Recall that origLoc is the .loc of an ancestor node that is
+  // guaranteed to contain all the reprinted nodes and comments.
+  var patchedLines=patcher.get(origLoc).indentTail(-orig.loc.indent);if(path.needsParens()){return linesModule.concat(["(",patchedLines,")"]);}return patchedLines;};}exports.getReprinter=getReprinter;// If the last character before oldLoc and the first character of newLines
+  // are both identifier characters, they must be separated by a space,
+  // otherwise they will most likely get fused together into a single token.
+  function needsLeadingSpace(oldLines,oldLoc,newLines){var posBeforeOldLoc=util$1.copyPos(oldLoc.start);// The character just before the location occupied by oldNode.
+  var charBeforeOldLoc=oldLines.prevPos(posBeforeOldLoc)&&oldLines.charAt(posBeforeOldLoc);// First character of the reprinted node.
+  var newFirstChar=newLines.charAt(newLines.firstPos());return charBeforeOldLoc&&riskyAdjoiningCharExp.test(charBeforeOldLoc)&&newFirstChar&&riskyAdjoiningCharExp.test(newFirstChar);}// If the last character of newLines and the first character after oldLoc
+  // are both identifier characters, they must be separated by a space,
+  // otherwise they will most likely get fused together into a single token.
+  function needsTrailingSpace(oldLines,oldLoc,newLines){// The character just after the location occupied by oldNode.
+  var charAfterOldLoc=oldLines.charAt(oldLoc.end);var newLastPos=newLines.lastPos();// Last character of the reprinted node.
+  var newLastChar=newLines.prevPos(newLastPos)&&newLines.charAt(newLastPos);return newLastChar&&riskyAdjoiningCharExp.test(newLastChar)&&charAfterOldLoc&&riskyAdjoiningCharExp.test(charAfterOldLoc);}function findReprints(newPath,reprints){var newNode=newPath.getValue();Printable.assert(newNode);var oldNode=newNode.original;Printable.assert(oldNode);assert_1.default.deepEqual(reprints,[]);if(newNode.type!==oldNode.type){return false;}var oldPath=new fast_path_1.default(oldNode);var canReprint=findChildReprints(newPath,oldPath,reprints);if(!canReprint){// Make absolutely sure the calling code does not attempt to reprint
+  // any nodes.
+  reprints.length=0;}return canReprint;}function findAnyReprints(newPath,oldPath,reprints){var newNode=newPath.getValue();var oldNode=oldPath.getValue();if(newNode===oldNode)return true;if(isArray.check(newNode))return findArrayReprints(newPath,oldPath,reprints);if(isObject.check(newNode))return findObjectReprints(newPath,oldPath,reprints);return false;}function findArrayReprints(newPath,oldPath,reprints){var newNode=newPath.getValue();var oldNode=oldPath.getValue();if(newNode===oldNode||newPath.valueIsDuplicate()||oldPath.valueIsDuplicate()){return true;}isArray.assert(newNode);var len=newNode.length;if(!(isArray.check(oldNode)&&oldNode.length===len))return false;for(var i=0;i<len;++i){newPath.stack.push(i,newNode[i]);oldPath.stack.push(i,oldNode[i]);var canReprint=findAnyReprints(newPath,oldPath,reprints);newPath.stack.length-=2;oldPath.stack.length-=2;if(!canReprint){return false;}}return true;}function findObjectReprints(newPath,oldPath,reprints){var newNode=newPath.getValue();isObject.assert(newNode);if(newNode.original===null){// If newNode.original node was set to null, reprint the node.
+  return false;}var oldNode=oldPath.getValue();if(!isObject.check(oldNode))return false;if(newNode===oldNode||newPath.valueIsDuplicate()||oldPath.valueIsDuplicate()){return true;}if(Printable.check(newNode)){if(!Printable.check(oldNode)){return false;}// Here we need to decide whether the reprinted code for newNode is
+  // appropriate for patching into the location of oldNode.
+  if(newNode.type===oldNode.type){var childReprints=[];if(findChildReprints(newPath,oldPath,childReprints)){reprints.push.apply(reprints,childReprints);}else if(oldNode.loc){// If we have no .loc information for oldNode, then we won't be
+  // able to reprint it.
+  reprints.push({oldPath:oldPath.copy(),newPath:newPath.copy()});}else{return false;}return true;}if(Expression.check(newNode)&&Expression.check(oldNode)&&// If we have no .loc information for oldNode, then we won't be
+  // able to reprint it.
+  oldNode.loc){// If both nodes are subtypes of Expression, then we should be able
+  // to fill the location occupied by the old node with code printed
+  // for the new node with no ill consequences.
+  reprints.push({oldPath:oldPath.copy(),newPath:newPath.copy()});return true;}// The nodes have different types, and at least one of the types is
+  // not a subtype of the Expression type, so we cannot safely assume
+  // the nodes are syntactically interchangeable.
+  return false;}return findChildReprints(newPath,oldPath,reprints);}function findChildReprints(newPath,oldPath,reprints){var newNode=newPath.getValue();var oldNode=oldPath.getValue();isObject.assert(newNode);isObject.assert(oldNode);if(newNode.original===null){// If newNode.original node was set to null, reprint the node.
+  return false;}// If this node needs parentheses and will not be wrapped with
+  // parentheses when reprinted, then return false to skip reprinting and
+  // let it be printed generically.
+  if(newPath.needsParens()&&!oldPath.hasParens()){return false;}var keys=util$1.getUnionOfKeys(oldNode,newNode);if(oldNode.type==="File"||newNode.type==="File"){// Don't bother traversing file.tokens, an often very large array
+  // returned by Babylon, and useless for our purposes.
+  delete keys.tokens;}// Don't bother traversing .loc objects looking for reprintable nodes.
+  delete keys.loc;var originalReprintCount=reprints.length;for(var k in keys){if(k.charAt(0)==="_"){// Ignore "private" AST properties added by e.g. Babel plugins and
+  // parsers like Babylon.
+  continue;}newPath.stack.push(k,types.getFieldValue(newNode,k));oldPath.stack.push(k,types.getFieldValue(oldNode,k));var canReprint=findAnyReprints(newPath,oldPath,reprints);newPath.stack.length-=2;oldPath.stack.length-=2;if(!canReprint){return false;}}// Return statements might end up running into ASI issues due to
+  // comments inserted deep within the tree, so reprint them if anything
+  // changed within them.
+  if(ReturnStatement.check(newPath.getNode())&&reprints.length>originalReprintCount){return false;}return true;}});unwrapExports(patcher);var patcher_1=patcher.Patcher;var patcher_2=patcher.getReprinter;var printer=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var assert_1=__importDefault(assert);var types=__importStar(main);var namedTypes=types.namedTypes;var isString=types.builtInTypes.string;var isObject=types.builtInTypes.object;var fast_path_1=__importDefault(fastPath);var util=__importStar(util$1);var PrintResult=function PrintResult(code,sourceMap){assert_1.default.ok(this instanceof PrintResult);isString.assert(code);this.code=code;if(sourceMap){isObject.assert(sourceMap);this.map=sourceMap;}};var PRp=PrintResult.prototype;var warnedAboutToString=false;PRp.toString=function(){if(!warnedAboutToString){console.warn("Deprecation warning: recast.print now returns an object with "+"a .code property. You appear to be treating the object as a "+"string, which might still work but is strongly discouraged.");warnedAboutToString=true;}return this.code;};var emptyPrintResult=new PrintResult("");var Printer=function Printer(config){assert_1.default.ok(this instanceof Printer);var explicitTabWidth=config&&config.tabWidth;config=options.normalize(config);// It's common for client code to pass the same options into both
+  // recast.parse and recast.print, but the Printer doesn't need (and
+  // can be confused by) config.sourceFileName, so we null it out.
+  config.sourceFileName=null;// Non-destructively modifies options with overrides, and returns a
+  // new print function that uses the modified options.
+  function makePrintFunctionWith(options,overrides){options=Object.assign({},options,overrides);return function(path){return print(path,options);};}function print(path,options){assert_1.default.ok(path instanceof fast_path_1.default);options=options||{};if(options.includeComments){return comments.printComments(path,makePrintFunctionWith(options,{includeComments:false}));}var oldTabWidth=config.tabWidth;if(!explicitTabWidth){var loc=path.getNode().loc;if(loc&&loc.lines&&loc.lines.guessTabWidth){config.tabWidth=loc.lines.guessTabWidth();}}var reprinter=patcher.getReprinter(path);var lines=reprinter// Since the print function that we pass to the reprinter will
+  // be used to print "new" nodes, it's tempting to think we
+  // should pass printRootGenerically instead of print, to avoid
+  // calling maybeReprint again, but that would be a mistake
+  // because the new nodes might not be entirely new, but merely
+  // moved from elsewhere in the AST. The print function is the
+  // right choice because it gives us the opportunity to reprint
+  // such nodes using their original source.
+  ?reprinter(print):genericPrint(path,config,options,makePrintFunctionWith(options,{includeComments:true,avoidRootParens:false}));config.tabWidth=oldTabWidth;return lines;}this.print=function(ast){if(!ast){return emptyPrintResult;}var lines=print(fast_path_1.default.from(ast),{includeComments:true,avoidRootParens:false});return new PrintResult(lines.toString(config),util.composeSourceMaps(config.inputSourceMap,lines.getSourceMap(config.sourceMapName,config.sourceRoot)));};this.printGenerically=function(ast){if(!ast){return emptyPrintResult;}// Print the entire AST generically.
+  function printGenerically(path){return comments.printComments(path,function(path){return genericPrint(path,config,{includeComments:true,avoidRootParens:false},printGenerically);});}var path=fast_path_1.default.from(ast);var oldReuseWhitespace=config.reuseWhitespace;// Do not reuse whitespace (or anything else, for that matter)
+  // when printing generically.
+  config.reuseWhitespace=false;// TODO Allow printing of comments?
+  var pr=new PrintResult(printGenerically(path).toString(config));config.reuseWhitespace=oldReuseWhitespace;return pr;};};exports.Printer=Printer;function genericPrint(path,config,options,printPath){assert_1.default.ok(path instanceof fast_path_1.default);var node=path.getValue();var parts=[];var linesWithoutParens=genericPrintNoParens(path,config,printPath);if(!node||linesWithoutParens.isEmpty()){return linesWithoutParens;}var shouldAddParens=false;var decoratorsLines=printDecorators(path,printPath);if(decoratorsLines.isEmpty()){// Nodes with decorators can't have parentheses, so we can avoid
+  // computing path.needsParens() except in this case.
+  if(!options.avoidRootParens){shouldAddParens=path.needsParens();}}else{parts.push(decoratorsLines);}if(shouldAddParens){parts.unshift("(");}parts.push(linesWithoutParens);if(shouldAddParens){parts.push(")");}return lines.concat(parts);}// Note that the `options` parameter of this function is what other
+  // functions in this file call the `config` object (that is, the
+  // configuration object originally passed into the Printer constructor).
+  // Its properties are documented in lib/options.js.
+  function genericPrintNoParens(path,options,print){var n=path.getValue();if(!n){return lines.fromString("");}if(typeof n==="string"){return lines.fromString(n,options);}namedTypes.Printable.assert(n);var parts=[];switch(n.type){case"File":return path.call(print,"program");case"Program":// Babel 6
+  if(n.directives){path.each(function(childPath){parts.push(print(childPath),";\n");},"directives");}if(n.interpreter){parts.push(path.call(print,"interpreter"));}parts.push(path.call(function(bodyPath){return printStatementSequence(bodyPath,options,print);},"body"));return lines.concat(parts);case"Noop":// Babel extension.
+  case"EmptyStatement":return lines.fromString("");case"ExpressionStatement":return lines.concat([path.call(print,"expression"),";"]);case"ParenthesizedExpression":// Babel extension.
+  return lines.concat(["(",path.call(print,"expression"),")"]);case"BinaryExpression":case"LogicalExpression":case"AssignmentExpression":return lines.fromString(" ").join([path.call(print,"left"),n.operator,path.call(print,"right")]);case"AssignmentPattern":return lines.concat([path.call(print,"left")," = ",path.call(print,"right")]);case"MemberExpression":case"OptionalMemberExpression":parts.push(path.call(print,"object"));var property=path.call(print,"property");var optional=n.type==="OptionalMemberExpression"&&n.optional;if(n.computed){parts.push(optional?"?.[":"[",property,"]");}else{parts.push(optional?"?.":".",property);}return lines.concat(parts);case"MetaProperty":return lines.concat([path.call(print,"meta"),".",path.call(print,"property")]);case"BindExpression":if(n.object){parts.push(path.call(print,"object"));}parts.push("::",path.call(print,"callee"));return lines.concat(parts);case"Path":return lines.fromString(".").join(n.body);case"Identifier":return lines.concat([lines.fromString(n.name,options),n.optional?"?":"",path.call(print,"typeAnnotation")]);case"SpreadElement":case"SpreadElementPattern":case"RestProperty":// Babel 6 for ObjectPattern
+  case"SpreadProperty":case"SpreadPropertyPattern":case"ObjectTypeSpreadProperty":case"RestElement":return lines.concat(["...",path.call(print,"argument"),path.call(print,"typeAnnotation")]);case"FunctionDeclaration":case"FunctionExpression":case"TSDeclareFunction":if(n.declare){parts.push("declare ");}if(n.async){parts.push("async ");}parts.push("function");if(n.generator)parts.push("*");if(n.id){parts.push(" ",path.call(print,"id"),path.call(print,"typeParameters"));}else{if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}}parts.push("(",printFunctionParams(path,options,print),")",path.call(print,"returnType"));if(n.body){parts.push(" ",path.call(print,"body"));}return lines.concat(parts);case"ArrowFunctionExpression":if(n.async){parts.push("async ");}if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}if(!options.arrowParensAlways&&n.params.length===1&&!n.rest&&n.params[0].type==='Identifier'&&!n.params[0].typeAnnotation&&!n.returnType){parts.push(path.call(print,"params",0));}else{parts.push("(",printFunctionParams(path,options,print),")",path.call(print,"returnType"));}parts.push(" => ",path.call(print,"body"));return lines.concat(parts);case"MethodDefinition":return printMethod(path,options,print);case"YieldExpression":parts.push("yield");if(n.delegate)parts.push("*");if(n.argument)parts.push(" ",path.call(print,"argument"));return lines.concat(parts);case"AwaitExpression":parts.push("await");if(n.all)parts.push("*");if(n.argument)parts.push(" ",path.call(print,"argument"));return lines.concat(parts);case"ModuleDeclaration":parts.push("module",path.call(print,"id"));if(n.source){assert_1.default.ok(!n.body);parts.push("from",path.call(print,"source"));}else{parts.push(path.call(print,"body"));}return lines.fromString(" ").join(parts);case"ImportSpecifier":if(n.importKind&&n.importKind!=="value"){parts.push(n.importKind+" ");}if(n.imported){parts.push(path.call(print,"imported"));if(n.local&&n.local.name!==n.imported.name){parts.push(" as ",path.call(print,"local"));}}else if(n.id){parts.push(path.call(print,"id"));if(n.name){parts.push(" as ",path.call(print,"name"));}}return lines.concat(parts);case"ExportSpecifier":if(n.local){parts.push(path.call(print,"local"));if(n.exported&&n.exported.name!==n.local.name){parts.push(" as ",path.call(print,"exported"));}}else if(n.id){parts.push(path.call(print,"id"));if(n.name){parts.push(" as ",path.call(print,"name"));}}return lines.concat(parts);case"ExportBatchSpecifier":return lines.fromString("*");case"ImportNamespaceSpecifier":parts.push("* as ");if(n.local){parts.push(path.call(print,"local"));}else if(n.id){parts.push(path.call(print,"id"));}return lines.concat(parts);case"ImportDefaultSpecifier":if(n.local){return path.call(print,"local");}return path.call(print,"id");case"TSExportAssignment":return lines.concat(["export = ",path.call(print,"expression")]);case"ExportDeclaration":case"ExportDefaultDeclaration":case"ExportNamedDeclaration":return printExportDeclaration(path,options,print);case"ExportAllDeclaration":parts.push("export *");if(n.exported){parts.push(" as ",path.call(print,"exported"));}parts.push(" from ",path.call(print,"source"),";");return lines.concat(parts);case"TSNamespaceExportDeclaration":parts.push("export as namespace ",path.call(print,"id"));return maybeAddSemicolon(lines.concat(parts));case"ExportNamespaceSpecifier":return lines.concat(["* as ",path.call(print,"exported")]);case"ExportDefaultSpecifier":return path.call(print,"exported");case"Import":return lines.fromString("import",options);case"ImportDeclaration":{parts.push("import ");if(n.importKind&&n.importKind!=="value"){parts.push(n.importKind+" ");}if(n.specifiers&&n.specifiers.length>0){var unbracedSpecifiers_1=[];var bracedSpecifiers_1=[];path.each(function(specifierPath){var spec=specifierPath.getValue();if(spec.type==="ImportSpecifier"){bracedSpecifiers_1.push(print(specifierPath));}else if(spec.type==="ImportDefaultSpecifier"||spec.type==="ImportNamespaceSpecifier"){unbracedSpecifiers_1.push(print(specifierPath));}},"specifiers");unbracedSpecifiers_1.forEach(function(lines,i){if(i>0){parts.push(", ");}parts.push(lines);});if(bracedSpecifiers_1.length>0){var lines_2=lines.fromString(", ").join(bracedSpecifiers_1);if(lines_2.getLineLength(1)>options.wrapColumn){lines_2=lines.concat([lines.fromString(",\n").join(bracedSpecifiers_1).indent(options.tabWidth),","]);}if(unbracedSpecifiers_1.length>0){parts.push(", ");}if(lines_2.length>1){parts.push("{\n",lines_2,"\n}");}else if(options.objectCurlySpacing){parts.push("{ ",lines_2," }");}else{parts.push("{",lines_2,"}");}}parts.push(" from ");}parts.push(path.call(print,"source"),";");return lines.concat(parts);}case"BlockStatement":var naked=path.call(function(bodyPath){return printStatementSequence(bodyPath,options,print);},"body");if(naked.isEmpty()){if(!n.directives||n.directives.length===0){return lines.fromString("{}");}}parts.push("{\n");// Babel 6
+  if(n.directives){path.each(function(childPath){parts.push(print(childPath).indent(options.tabWidth),";",n.directives.length>1||!naked.isEmpty()?"\n":"");},"directives");}parts.push(naked.indent(options.tabWidth));parts.push("\n}");return lines.concat(parts);case"ReturnStatement":parts.push("return");if(n.argument){var argLines=path.call(print,"argument");if(argLines.startsWithComment()||argLines.length>1&&namedTypes.JSXElement&&namedTypes.JSXElement.check(n.argument)){parts.push(" (\n",argLines.indent(options.tabWidth),"\n)");}else{parts.push(" ",argLines);}}parts.push(";");return lines.concat(parts);case"CallExpression":case"OptionalCallExpression":parts.push(path.call(print,"callee"));if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}if(n.typeArguments){parts.push(path.call(print,"typeArguments"));}if(n.type==="OptionalCallExpression"&&n.callee.type!=="OptionalMemberExpression"){parts.push("?.");}parts.push(printArgumentsList(path,options,print));return lines.concat(parts);case"ObjectExpression":case"ObjectPattern":case"ObjectTypeAnnotation":var allowBreak=false;var isTypeAnnotation=n.type==="ObjectTypeAnnotation";var separator=options.flowObjectCommas?",":isTypeAnnotation?";":",";var fields=[];if(isTypeAnnotation){fields.push("indexers","callProperties");if(n.internalSlots!=null){fields.push("internalSlots");}}fields.push("properties");var len=0;fields.forEach(function(field){len+=n[field].length;});var oneLine=isTypeAnnotation&&len===1||len===0;var leftBrace=n.exact?"{|":"{";var rightBrace=n.exact?"|}":"}";parts.push(oneLine?leftBrace:leftBrace+"\n");var leftBraceIndex=parts.length-1;var i=0;fields.forEach(function(field){path.each(function(childPath){var lines=print(childPath);if(!oneLine){lines=lines.indent(options.tabWidth);}var multiLine=!isTypeAnnotation&&lines.length>1;if(multiLine&&allowBreak){// Similar to the logic for BlockStatement.
+  parts.push("\n");}parts.push(lines);if(i<len-1){// Add an extra line break if the previous object property
+  // had a multi-line value.
+  parts.push(separator+(multiLine?"\n\n":"\n"));allowBreak=!multiLine;}else if(len!==1&&isTypeAnnotation){parts.push(separator);}else if(!oneLine&&util.isTrailingCommaEnabled(options,"objects")){parts.push(separator);}i++;},field);});if(n.inexact){var line=lines.fromString("...",options);if(oneLine){if(len>0){parts.push(separator," ");}parts.push(line);}else{// No trailing separator after ... to maintain parity with prettier.
+  parts.push("\n",line.indent(options.tabWidth));}}parts.push(oneLine?rightBrace:"\n"+rightBrace);if(i!==0&&oneLine&&options.objectCurlySpacing){parts[leftBraceIndex]=leftBrace+" ";parts[parts.length-1]=" "+rightBrace;}if(n.typeAnnotation){parts.push(path.call(print,"typeAnnotation"));}return lines.concat(parts);case"PropertyPattern":return lines.concat([path.call(print,"key"),": ",path.call(print,"pattern")]);case"ObjectProperty":// Babel 6
+  case"Property":// Non-standard AST node type.
+  if(n.method||n.kind==="get"||n.kind==="set"){return printMethod(path,options,print);}var key=path.call(print,"key");if(n.computed){parts.push("[",key,"]");}else{parts.push(key);}if(!n.shorthand){parts.push(": ",path.call(print,"value"));}return lines.concat(parts);case"ClassMethod":// Babel 6
+  case"ObjectMethod":// Babel 6
+  case"ClassPrivateMethod":case"TSDeclareMethod":return printMethod(path,options,print);case"PrivateName":return lines.concat(["#",path.call(print,"id")]);case"Decorator":return lines.concat(["@",path.call(print,"expression")]);case"ArrayExpression":case"ArrayPattern":var elems=n.elements,len=elems.length;var printed=path.map(print,"elements");var joined=lines.fromString(", ").join(printed);var oneLine=joined.getLineLength(1)<=options.wrapColumn;if(oneLine){if(options.arrayBracketSpacing){parts.push("[ ");}else{parts.push("[");}}else{parts.push("[\n");}path.each(function(elemPath){var i=elemPath.getName();var elem=elemPath.getValue();if(!elem){// If the array expression ends with a hole, that hole
+  // will be ignored by the interpreter, but if it ends with
+  // two (or more) holes, we need to write out two (or more)
+  // commas so that the resulting code is interpreted with
+  // both (all) of the holes.
+  parts.push(",");}else{var lines=printed[i];if(oneLine){if(i>0)parts.push(" ");}else{lines=lines.indent(options.tabWidth);}parts.push(lines);if(i<len-1||!oneLine&&util.isTrailingCommaEnabled(options,"arrays"))parts.push(",");if(!oneLine)parts.push("\n");}},"elements");if(oneLine&&options.arrayBracketSpacing){parts.push(" ]");}else{parts.push("]");}return lines.concat(parts);case"SequenceExpression":return lines.fromString(", ").join(path.map(print,"expressions"));case"ThisExpression":return lines.fromString("this");case"Super":return lines.fromString("super");case"NullLiteral":// Babel 6 Literal split
+  return lines.fromString("null");case"RegExpLiteral":// Babel 6 Literal split
+  return lines.fromString(n.extra.raw);case"BigIntLiteral":// Babel 7 Literal split
+  return lines.fromString(n.value+"n");case"NumericLiteral":// Babel 6 Literal Split
+  // Keep original representation for numeric values not in base 10.
+  if(n.extra&&typeof n.extra.raw==="string"&&Number(n.extra.raw)===n.value){return lines.fromString(n.extra.raw,options);}return lines.fromString(n.value,options);case"BooleanLiteral":// Babel 6 Literal split
+  case"StringLiteral":// Babel 6 Literal split
+  case"Literal":// Numeric values may be in bases other than 10. Use their raw
+  // representation if equivalent.
+  if(typeof n.value==="number"&&typeof n.raw==="string"&&Number(n.raw)===n.value){return lines.fromString(n.raw,options);}if(typeof n.value!=="string"){return lines.fromString(n.value,options);}return lines.fromString(nodeStr(n.value,options),options);case"Directive":// Babel 6
+  return path.call(print,"value");case"DirectiveLiteral":// Babel 6
+  return lines.fromString(nodeStr(n.value,options));case"InterpreterDirective":return lines.fromString("#!"+n.value+"\n",options);case"ModuleSpecifier":if(n.local){throw new Error("The ESTree ModuleSpecifier type should be abstract");}// The Esprima ModuleSpecifier type is just a string-valued
+  // Literal identifying the imported-from module.
+  return lines.fromString(nodeStr(n.value,options),options);case"UnaryExpression":parts.push(n.operator);if(/[a-z]$/.test(n.operator))parts.push(" ");parts.push(path.call(print,"argument"));return lines.concat(parts);case"UpdateExpression":parts.push(path.call(print,"argument"),n.operator);if(n.prefix)parts.reverse();return lines.concat(parts);case"ConditionalExpression":return lines.concat([path.call(print,"test")," ? ",path.call(print,"consequent")," : ",path.call(print,"alternate")]);case"NewExpression":parts.push("new ",path.call(print,"callee"));if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}if(n.typeArguments){parts.push(path.call(print,"typeArguments"));}var args=n.arguments;if(args){parts.push(printArgumentsList(path,options,print));}return lines.concat(parts);case"VariableDeclaration":if(n.declare){parts.push("declare ");}parts.push(n.kind," ");var maxLen=0;var printed=path.map(function(childPath){var lines=print(childPath);maxLen=Math.max(lines.length,maxLen);return lines;},"declarations");if(maxLen===1){parts.push(lines.fromString(", ").join(printed));}else if(printed.length>1){parts.push(lines.fromString(",\n").join(printed).indentTail(n.kind.length+1));}else{parts.push(printed[0]);}// We generally want to terminate all variable declarations with a
+  // semicolon, except when they are children of for loops.
+  var parentNode=path.getParentNode();if(!namedTypes.ForStatement.check(parentNode)&&!namedTypes.ForInStatement.check(parentNode)&&!(namedTypes.ForOfStatement&&namedTypes.ForOfStatement.check(parentNode))&&!(namedTypes.ForAwaitStatement&&namedTypes.ForAwaitStatement.check(parentNode))){parts.push(";");}return lines.concat(parts);case"VariableDeclarator":return n.init?lines.fromString(" = ").join([path.call(print,"id"),path.call(print,"init")]):path.call(print,"id");case"WithStatement":return lines.concat(["with (",path.call(print,"object"),") ",path.call(print,"body")]);case"IfStatement":var con=adjustClause(path.call(print,"consequent"),options);parts.push("if (",path.call(print,"test"),")",con);if(n.alternate)parts.push(endsWithBrace(con)?" else":"\nelse",adjustClause(path.call(print,"alternate"),options));return lines.concat(parts);case"ForStatement":// TODO Get the for (;;) case right.
+  var init=path.call(print,"init"),sep=init.length>1?";\n":"; ",forParen="for (",indented=lines.fromString(sep).join([init,path.call(print,"test"),path.call(print,"update")]).indentTail(forParen.length),head=lines.concat([forParen,indented,")"]),clause=adjustClause(path.call(print,"body"),options);parts.push(head);if(head.length>1){parts.push("\n");clause=clause.trimLeft();}parts.push(clause);return lines.concat(parts);case"WhileStatement":return lines.concat(["while (",path.call(print,"test"),")",adjustClause(path.call(print,"body"),options)]);case"ForInStatement":// Note: esprima can't actually parse "for each (".
+  return lines.concat([n.each?"for each (":"for (",path.call(print,"left")," in ",path.call(print,"right"),")",adjustClause(path.call(print,"body"),options)]);case"ForOfStatement":case"ForAwaitStatement":parts.push("for ");if(n.await||n.type==="ForAwaitStatement"){parts.push("await ");}parts.push("(",path.call(print,"left")," of ",path.call(print,"right"),")",adjustClause(path.call(print,"body"),options));return lines.concat(parts);case"DoWhileStatement":var doBody=lines.concat(["do",adjustClause(path.call(print,"body"),options)]);parts.push(doBody);if(endsWithBrace(doBody))parts.push(" while");else parts.push("\nwhile");parts.push(" (",path.call(print,"test"),");");return lines.concat(parts);case"DoExpression":var statements=path.call(function(bodyPath){return printStatementSequence(bodyPath,options,print);},"body");return lines.concat(["do {\n",statements.indent(options.tabWidth),"\n}"]);case"BreakStatement":parts.push("break");if(n.label)parts.push(" ",path.call(print,"label"));parts.push(";");return lines.concat(parts);case"ContinueStatement":parts.push("continue");if(n.label)parts.push(" ",path.call(print,"label"));parts.push(";");return lines.concat(parts);case"LabeledStatement":return lines.concat([path.call(print,"label"),":\n",path.call(print,"body")]);case"TryStatement":parts.push("try ",path.call(print,"block"));if(n.handler){parts.push(" ",path.call(print,"handler"));}else if(n.handlers){path.each(function(handlerPath){parts.push(" ",print(handlerPath));},"handlers");}if(n.finalizer){parts.push(" finally ",path.call(print,"finalizer"));}return lines.concat(parts);case"CatchClause":parts.push("catch ");if(n.param){parts.push("(",path.call(print,"param"));}if(n.guard){// Note: esprima does not recognize conditional catch clauses.
+  parts.push(" if ",path.call(print,"guard"));}if(n.param){parts.push(") ");}parts.push(path.call(print,"body"));return lines.concat(parts);case"ThrowStatement":return lines.concat(["throw ",path.call(print,"argument"),";"]);case"SwitchStatement":return lines.concat(["switch (",path.call(print,"discriminant"),") {\n",lines.fromString("\n").join(path.map(print,"cases")),"\n}"]);// Note: ignoring n.lexical because it has no printing consequences.
+  case"SwitchCase":if(n.test)parts.push("case ",path.call(print,"test"),":");else parts.push("default:");if(n.consequent.length>0){parts.push("\n",path.call(function(consequentPath){return printStatementSequence(consequentPath,options,print);},"consequent").indent(options.tabWidth));}return lines.concat(parts);case"DebuggerStatement":return lines.fromString("debugger;");// JSX extensions below.
+  case"JSXAttribute":parts.push(path.call(print,"name"));if(n.value)parts.push("=",path.call(print,"value"));return lines.concat(parts);case"JSXIdentifier":return lines.fromString(n.name,options);case"JSXNamespacedName":return lines.fromString(":").join([path.call(print,"namespace"),path.call(print,"name")]);case"JSXMemberExpression":return lines.fromString(".").join([path.call(print,"object"),path.call(print,"property")]);case"JSXSpreadAttribute":return lines.concat(["{...",path.call(print,"argument"),"}"]);case"JSXSpreadChild":return lines.concat(["{...",path.call(print,"expression"),"}"]);case"JSXExpressionContainer":return lines.concat(["{",path.call(print,"expression"),"}"]);case"JSXElement":case"JSXFragment":var openingPropName="opening"+(n.type==="JSXElement"?"Element":"Fragment");var closingPropName="closing"+(n.type==="JSXElement"?"Element":"Fragment");var openingLines=path.call(print,openingPropName);if(n[openingPropName].selfClosing){assert_1.default.ok(!n[closingPropName],"unexpected "+closingPropName+" element in self-closing "+n.type);return openingLines;}var childLines=lines.concat(path.map(function(childPath){var child=childPath.getValue();if(namedTypes.Literal.check(child)&&typeof child.value==="string"){if(/\S/.test(child.value)){return child.value.replace(/^\s+|\s+$/g,"");}else if(/\n/.test(child.value)){return "\n";}}return print(childPath);},"children")).indentTail(options.tabWidth);var closingLines=path.call(print,closingPropName);return lines.concat([openingLines,childLines,closingLines]);case"JSXOpeningElement":parts.push("<",path.call(print,"name"));var attrParts=[];path.each(function(attrPath){attrParts.push(" ",print(attrPath));},"attributes");var attrLines=lines.concat(attrParts);var needLineWrap=attrLines.length>1||attrLines.getLineLength(1)>options.wrapColumn;if(needLineWrap){attrParts.forEach(function(part,i){if(part===" "){assert_1.default.strictEqual(i%2,0);attrParts[i]="\n";}});attrLines=lines.concat(attrParts).indentTail(options.tabWidth);}parts.push(attrLines,n.selfClosing?" />":">");return lines.concat(parts);case"JSXClosingElement":return lines.concat(["</",path.call(print,"name"),">"]);case"JSXOpeningFragment":return lines.fromString("<>");case"JSXClosingFragment":return lines.fromString("</>");case"JSXText":return lines.fromString(n.value,options);case"JSXEmptyExpression":return lines.fromString("");case"TypeAnnotatedIdentifier":return lines.concat([path.call(print,"annotation")," ",path.call(print,"identifier")]);case"ClassBody":if(n.body.length===0){return lines.fromString("{}");}return lines.concat(["{\n",path.call(function(bodyPath){return printStatementSequence(bodyPath,options,print);},"body").indent(options.tabWidth),"\n}"]);case"ClassPropertyDefinition":parts.push("static ",path.call(print,"definition"));if(!namedTypes.MethodDefinition.check(n.definition))parts.push(";");return lines.concat(parts);case"ClassProperty":var access=n.accessibility||n.access;if(typeof access==="string"){parts.push(access," ");}if(n.static){parts.push("static ");}if(n.abstract){parts.push("abstract ");}if(n.readonly){parts.push("readonly ");}var key=path.call(print,"key");if(n.computed){key=lines.concat(["[",key,"]"]);}if(n.variance){key=lines.concat([printVariance(path,print),key]);}parts.push(key);if(n.optional){parts.push("?");}if(n.typeAnnotation){parts.push(path.call(print,"typeAnnotation"));}if(n.value){parts.push(" = ",path.call(print,"value"));}parts.push(";");return lines.concat(parts);case"ClassPrivateProperty":if(n.static){parts.push("static ");}parts.push(path.call(print,"key"));if(n.typeAnnotation){parts.push(path.call(print,"typeAnnotation"));}if(n.value){parts.push(" = ",path.call(print,"value"));}parts.push(";");return lines.concat(parts);case"ClassDeclaration":case"ClassExpression":if(n.declare){parts.push("declare ");}if(n.abstract){parts.push("abstract ");}parts.push("class");if(n.id){parts.push(" ",path.call(print,"id"));}if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}if(n.superClass){parts.push(" extends ",path.call(print,"superClass"),path.call(print,"superTypeParameters"));}if(n["implements"]&&n['implements'].length>0){parts.push(" implements ",lines.fromString(", ").join(path.map(print,"implements")));}parts.push(" ",path.call(print,"body"));return lines.concat(parts);case"TemplateElement":return lines.fromString(n.value.raw,options).lockIndentTail();case"TemplateLiteral":var expressions=path.map(print,"expressions");parts.push("`");path.each(function(childPath){var i=childPath.getName();parts.push(print(childPath));if(i<expressions.length){parts.push("${",expressions[i],"}");}},"quasis");parts.push("`");return lines.concat(parts).lockIndentTail();case"TaggedTemplateExpression":return lines.concat([path.call(print,"tag"),path.call(print,"quasi")]);// These types are unprintable because they serve as abstract
+  // supertypes for other (printable) types.
+  case"Node":case"Printable":case"SourceLocation":case"Position":case"Statement":case"Function":case"Pattern":case"Expression":case"Declaration":case"Specifier":case"NamedSpecifier":case"Comment":// Supertype of Block and Line
+  case"Flow":// Supertype of all Flow AST node types
+  case"FlowType":// Supertype of all Flow types
+  case"FlowPredicate":// Supertype of InferredPredicate and DeclaredPredicate
+  case"MemberTypeAnnotation":// Flow
+  case"Type":// Flow
+  case"TSHasOptionalTypeParameterInstantiation":case"TSHasOptionalTypeParameters":case"TSHasOptionalTypeAnnotation":throw new Error("unprintable type: "+JSON.stringify(n.type));case"CommentBlock":// Babel block comment.
+  case"Block":// Esprima block comment.
+  return lines.concat(["/*",lines.fromString(n.value,options),"*/"]);case"CommentLine":// Babel line comment.
+  case"Line":// Esprima line comment.
+  return lines.concat(["//",lines.fromString(n.value,options)]);// Type Annotations for Facebook Flow, typically stripped out or
+  // transformed away before printing.
+  case"TypeAnnotation":if(n.typeAnnotation){if(n.typeAnnotation.type!=="FunctionTypeAnnotation"){parts.push(": ");}parts.push(path.call(print,"typeAnnotation"));return lines.concat(parts);}return lines.fromString("");case"ExistentialTypeParam":case"ExistsTypeAnnotation":return lines.fromString("*",options);case"EmptyTypeAnnotation":return lines.fromString("empty",options);case"AnyTypeAnnotation":return lines.fromString("any",options);case"MixedTypeAnnotation":return lines.fromString("mixed",options);case"ArrayTypeAnnotation":return lines.concat([path.call(print,"elementType"),"[]"]);case"TupleTypeAnnotation":var printed=path.map(print,"types");var joined=lines.fromString(", ").join(printed);var oneLine=joined.getLineLength(1)<=options.wrapColumn;if(oneLine){if(options.arrayBracketSpacing){parts.push("[ ");}else{parts.push("[");}}else{parts.push("[\n");}path.each(function(elemPath){var i=elemPath.getName();var elem=elemPath.getValue();if(!elem){// If the array expression ends with a hole, that hole
+  // will be ignored by the interpreter, but if it ends with
+  // two (or more) holes, we need to write out two (or more)
+  // commas so that the resulting code is interpreted with
+  // both (all) of the holes.
+  parts.push(",");}else{var lines=printed[i];if(oneLine){if(i>0)parts.push(" ");}else{lines=lines.indent(options.tabWidth);}parts.push(lines);if(i<n.types.length-1||!oneLine&&util.isTrailingCommaEnabled(options,"arrays"))parts.push(",");if(!oneLine)parts.push("\n");}},"types");if(oneLine&&options.arrayBracketSpacing){parts.push(" ]");}else{parts.push("]");}return lines.concat(parts);case"BooleanTypeAnnotation":return lines.fromString("boolean",options);case"BooleanLiteralTypeAnnotation":assert_1.default.strictEqual(typeof n.value,"boolean");return lines.fromString(""+n.value,options);case"InterfaceTypeAnnotation":parts.push("interface");if(n.extends&&n.extends.length>0){parts.push(" extends ",lines.fromString(", ").join(path.map(print,"extends")));}parts.push(" ",path.call(print,"body"));return lines.concat(parts);case"DeclareClass":return printFlowDeclaration(path,["class ",path.call(print,"id")," ",path.call(print,"body")]);case"DeclareFunction":return printFlowDeclaration(path,["function ",path.call(print,"id"),";"]);case"DeclareModule":return printFlowDeclaration(path,["module ",path.call(print,"id")," ",path.call(print,"body")]);case"DeclareModuleExports":return printFlowDeclaration(path,["module.exports",path.call(print,"typeAnnotation")]);case"DeclareVariable":return printFlowDeclaration(path,["var ",path.call(print,"id"),";"]);case"DeclareExportDeclaration":case"DeclareExportAllDeclaration":return lines.concat(["declare ",printExportDeclaration(path,options,print)]);case"InferredPredicate":return lines.fromString("%checks",options);case"DeclaredPredicate":return lines.concat(["%checks(",path.call(print,"value"),")"]);case"FunctionTypeAnnotation":// FunctionTypeAnnotation is ambiguous:
+  // declare function(a: B): void; OR
+  // var A: (a: B) => void;
+  var parent=path.getParentNode(0);var isArrowFunctionTypeAnnotation=!(namedTypes.ObjectTypeCallProperty.check(parent)||namedTypes.ObjectTypeInternalSlot.check(parent)&&parent.method||namedTypes.DeclareFunction.check(path.getParentNode(2)));var needsColon=isArrowFunctionTypeAnnotation&&!namedTypes.FunctionTypeParam.check(parent);if(needsColon){parts.push(": ");}parts.push("(",printFunctionParams(path,options,print),")");// The returnType is not wrapped in a TypeAnnotation, so the colon
+  // needs to be added separately.
+  if(n.returnType){parts.push(isArrowFunctionTypeAnnotation?" => ":": ",path.call(print,"returnType"));}return lines.concat(parts);case"FunctionTypeParam":return lines.concat([path.call(print,"name"),n.optional?'?':'',": ",path.call(print,"typeAnnotation")]);case"GenericTypeAnnotation":return lines.concat([path.call(print,"id"),path.call(print,"typeParameters")]);case"DeclareInterface":parts.push("declare ");// Fall through to InterfaceDeclaration...
+  case"InterfaceDeclaration":case"TSInterfaceDeclaration":if(n.declare){parts.push("declare ");}parts.push("interface ",path.call(print,"id"),path.call(print,"typeParameters")," ");if(n["extends"]&&n["extends"].length>0){parts.push("extends ",lines.fromString(", ").join(path.map(print,"extends"))," ");}if(n.body){parts.push(path.call(print,"body"));}return lines.concat(parts);case"ClassImplements":case"InterfaceExtends":return lines.concat([path.call(print,"id"),path.call(print,"typeParameters")]);case"IntersectionTypeAnnotation":return lines.fromString(" & ").join(path.map(print,"types"));case"NullableTypeAnnotation":return lines.concat(["?",path.call(print,"typeAnnotation")]);case"NullLiteralTypeAnnotation":return lines.fromString("null",options);case"ThisTypeAnnotation":return lines.fromString("this",options);case"NumberTypeAnnotation":return lines.fromString("number",options);case"ObjectTypeCallProperty":return path.call(print,"value");case"ObjectTypeIndexer":return lines.concat([printVariance(path,print),"[",path.call(print,"id"),": ",path.call(print,"key"),"]: ",path.call(print,"value")]);case"ObjectTypeProperty":return lines.concat([printVariance(path,print),path.call(print,"key"),n.optional?"?":"",": ",path.call(print,"value")]);case"ObjectTypeInternalSlot":return lines.concat([n.static?"static ":"","[[",path.call(print,"id"),"]]",n.optional?"?":"",n.value.type!=="FunctionTypeAnnotation"?": ":"",path.call(print,"value")]);case"QualifiedTypeIdentifier":return lines.concat([path.call(print,"qualification"),".",path.call(print,"id")]);case"StringLiteralTypeAnnotation":return lines.fromString(nodeStr(n.value,options),options);case"NumberLiteralTypeAnnotation":case"NumericLiteralTypeAnnotation":assert_1.default.strictEqual(typeof n.value,"number");return lines.fromString(JSON.stringify(n.value),options);case"StringTypeAnnotation":return lines.fromString("string",options);case"DeclareTypeAlias":parts.push("declare ");// Fall through to TypeAlias...
+  case"TypeAlias":return lines.concat(["type ",path.call(print,"id"),path.call(print,"typeParameters")," = ",path.call(print,"right"),";"]);case"DeclareOpaqueType":parts.push("declare ");// Fall through to OpaqueType...
+  case"OpaqueType":parts.push("opaque type ",path.call(print,"id"),path.call(print,"typeParameters"));if(n["supertype"]){parts.push(": ",path.call(print,"supertype"));}if(n["impltype"]){parts.push(" = ",path.call(print,"impltype"));}parts.push(";");return lines.concat(parts);case"TypeCastExpression":return lines.concat(["(",path.call(print,"expression"),path.call(print,"typeAnnotation"),")"]);case"TypeParameterDeclaration":case"TypeParameterInstantiation":return lines.concat(["<",lines.fromString(", ").join(path.map(print,"params")),">"]);case"Variance":if(n.kind==="plus"){return lines.fromString("+");}if(n.kind==="minus"){return lines.fromString("-");}return lines.fromString("");case"TypeParameter":if(n.variance){parts.push(printVariance(path,print));}parts.push(path.call(print,'name'));if(n.bound){parts.push(path.call(print,'bound'));}if(n['default']){parts.push('=',path.call(print,'default'));}return lines.concat(parts);case"TypeofTypeAnnotation":return lines.concat([lines.fromString("typeof ",options),path.call(print,"argument")]);case"UnionTypeAnnotation":return lines.fromString(" | ").join(path.map(print,"types"));case"VoidTypeAnnotation":return lines.fromString("void",options);case"NullTypeAnnotation":return lines.fromString("null",options);// Type Annotations for TypeScript (when using Babylon as parser)
+  case"TSType":throw new Error("unprintable type: "+JSON.stringify(n.type));case"TSNumberKeyword":return lines.fromString("number",options);case"TSBigIntKeyword":return lines.fromString("bigint",options);case"TSObjectKeyword":return lines.fromString("object",options);case"TSBooleanKeyword":return lines.fromString("boolean",options);case"TSStringKeyword":return lines.fromString("string",options);case"TSSymbolKeyword":return lines.fromString("symbol",options);case"TSAnyKeyword":return lines.fromString("any",options);case"TSVoidKeyword":return lines.fromString("void",options);case"TSThisType":return lines.fromString("this",options);case"TSNullKeyword":return lines.fromString("null",options);case"TSUndefinedKeyword":return lines.fromString("undefined",options);case"TSUnknownKeyword":return lines.fromString("unknown",options);case"TSNeverKeyword":return lines.fromString("never",options);case"TSArrayType":return lines.concat([path.call(print,"elementType"),"[]"]);case"TSLiteralType":return path.call(print,"literal");case"TSUnionType":return lines.fromString(" | ").join(path.map(print,"types"));case"TSIntersectionType":return lines.fromString(" & ").join(path.map(print,"types"));case"TSConditionalType":parts.push(path.call(print,"checkType")," extends ",path.call(print,"extendsType")," ? ",path.call(print,"trueType")," : ",path.call(print,"falseType"));return lines.concat(parts);case"TSInferType":parts.push("infer ",path.call(print,"typeParameter"));return lines.concat(parts);case"TSParenthesizedType":return lines.concat(["(",path.call(print,"typeAnnotation"),")"]);case"TSFunctionType":case"TSConstructorType":return lines.concat([path.call(print,"typeParameters"),"(",printFunctionParams(path,options,print),")",path.call(print,"typeAnnotation")]);case"TSMappedType":{parts.push(n.readonly?"readonly ":"","[",path.call(print,"typeParameter"),"]",n.optional?"?":"");if(n.typeAnnotation){parts.push(": ",path.call(print,"typeAnnotation"),";");}return lines.concat(["{\n",lines.concat(parts).indent(options.tabWidth),"\n}"]);}case"TSTupleType":return lines.concat(["[",lines.fromString(", ").join(path.map(print,"elementTypes")),"]"]);case"TSRestType":return lines.concat(["...",path.call(print,"typeAnnotation"),"[]"]);case"TSOptionalType":return lines.concat([path.call(print,"typeAnnotation"),"?"]);case"TSIndexedAccessType":return lines.concat([path.call(print,"objectType"),"[",path.call(print,"indexType"),"]"]);case"TSTypeOperator":return lines.concat([path.call(print,"operator")," ",path.call(print,"typeAnnotation")]);case"TSTypeLiteral":{var memberLines_1=lines.fromString(",\n").join(path.map(print,"members"));if(memberLines_1.isEmpty()){return lines.fromString("{}",options);}parts.push("{\n",memberLines_1.indent(options.tabWidth),"\n}");return lines.concat(parts);}case"TSEnumMember":parts.push(path.call(print,"id"));if(n.initializer){parts.push(" = ",path.call(print,"initializer"));}return lines.concat(parts);case"TSTypeQuery":return lines.concat(["typeof ",path.call(print,"exprName")]);case"TSParameterProperty":if(n.accessibility){parts.push(n.accessibility," ");}if(n.export){parts.push("export ");}if(n.static){parts.push("static ");}if(n.readonly){parts.push("readonly ");}parts.push(path.call(print,"parameter"));return lines.concat(parts);case"TSTypeReference":return lines.concat([path.call(print,"typeName"),path.call(print,"typeParameters")]);case"TSQualifiedName":return lines.concat([path.call(print,"left"),".",path.call(print,"right")]);case"TSAsExpression":{var withParens=n.extra&&n.extra.parenthesized===true;if(withParens)parts.push("(");parts.push(path.call(print,"expression"),lines.fromString(" as "),path.call(print,"typeAnnotation"));if(withParens)parts.push(")");return lines.concat(parts);}case"TSNonNullExpression":return lines.concat([path.call(print,"expression"),"!"]);case"TSTypeAnnotation":{// similar to flow's FunctionTypeAnnotation, this can be
+  // ambiguous: it can be prefixed by => or :
+  // in a type predicate, it takes the for u is U
+  var parent=path.getParentNode(0);var prefix=": ";if(namedTypes.TSFunctionType.check(parent)){prefix=" => ";}if(namedTypes.TSTypePredicate.check(parent)){prefix=" is ";}return lines.concat([prefix,path.call(print,"typeAnnotation")]);}case"TSIndexSignature":return lines.concat([n.readonly?"readonly ":"","[",path.map(print,"parameters"),"]",path.call(print,"typeAnnotation")]);case"TSPropertySignature":parts.push(printVariance(path,print),n.readonly?"readonly ":"");if(n.computed){parts.push("[",path.call(print,"key"),"]");}else{parts.push(path.call(print,"key"));}parts.push(n.optional?"?":"",path.call(print,"typeAnnotation"));return lines.concat(parts);case"TSMethodSignature":if(n.computed){parts.push("[",path.call(print,"key"),"]");}else{parts.push(path.call(print,"key"));}if(n.optional){parts.push("?");}parts.push(path.call(print,"typeParameters"),"(",printFunctionParams(path,options,print),")",path.call(print,"typeAnnotation"));return lines.concat(parts);case"TSTypePredicate":return lines.concat([path.call(print,"parameterName"),path.call(print,"typeAnnotation")]);case"TSCallSignatureDeclaration":return lines.concat([path.call(print,"typeParameters"),"(",printFunctionParams(path,options,print),")",path.call(print,"typeAnnotation")]);case"TSConstructSignatureDeclaration":if(n.typeParameters){parts.push("new",path.call(print,"typeParameters"));}else{parts.push("new ");}parts.push("(",printFunctionParams(path,options,print),")",path.call(print,"typeAnnotation"));return lines.concat(parts);case"TSTypeAliasDeclaration":return lines.concat([n.declare?"declare ":"","type ",path.call(print,"id"),path.call(print,"typeParameters")," = ",path.call(print,"typeAnnotation"),";"]);case"TSTypeParameter":parts.push(path.call(print,"name"));// ambiguous because of TSMappedType
+  var parent=path.getParentNode(0);var isInMappedType=namedTypes.TSMappedType.check(parent);if(n.constraint){parts.push(isInMappedType?" in ":" extends ",path.call(print,"constraint"));}if(n["default"]){parts.push(" = ",path.call(print,"default"));}return lines.concat(parts);case"TSTypeAssertion":var withParens=n.extra&&n.extra.parenthesized===true;if(withParens){parts.push("(");}parts.push("<",path.call(print,"typeAnnotation"),"> ",path.call(print,"expression"));if(withParens){parts.push(")");}return lines.concat(parts);case"TSTypeParameterDeclaration":case"TSTypeParameterInstantiation":return lines.concat(["<",lines.fromString(", ").join(path.map(print,"params")),">"]);case"TSEnumDeclaration":parts.push(n.declare?"declare ":"",n.const?"const ":"","enum ",path.call(print,"id"));var memberLines=lines.fromString(",\n").join(path.map(print,"members"));if(memberLines.isEmpty()){parts.push(" {}");}else{parts.push(" {\n",memberLines.indent(options.tabWidth),"\n}");}return lines.concat(parts);case"TSExpressionWithTypeArguments":return lines.concat([path.call(print,"expression"),path.call(print,"typeParameters")]);case"TSInterfaceBody":var lines$1=lines.fromString(";\n").join(path.map(print,"body"));if(lines$1.isEmpty()){return lines.fromString("{}",options);}return lines.concat(["{\n",lines$1.indent(options.tabWidth),";","\n}"]);case"TSImportType":parts.push("import(",path.call(print,"argument"),")");if(n.qualifier){parts.push(".",path.call(print,"qualifier"));}if(n.typeParameters){parts.push(path.call(print,"typeParameters"));}return lines.concat(parts);case"TSImportEqualsDeclaration":if(n.isExport){parts.push("export ");}parts.push("import ",path.call(print,"id")," = ",path.call(print,"moduleReference"));return maybeAddSemicolon(lines.concat(parts));case"TSExternalModuleReference":return lines.concat(["require(",path.call(print,"expression"),")"]);case"TSModuleDeclaration":{var parent_1=path.getParentNode();if(parent_1.type==="TSModuleDeclaration"){parts.push(".");}else{if(n.declare){parts.push("declare ");}if(!n.global){var isExternal=n.id.type==="StringLiteral"||n.id.type==="Literal"&&typeof n.id.value==="string";if(isExternal){parts.push("module ");}else if(n.loc&&n.loc.lines&&n.id.loc){var prefix_1=n.loc.lines.sliceString(n.loc.start,n.id.loc.start);// These keywords are fundamentally ambiguous in the
+  // Babylon parser, and not reflected in the AST, so
+  // the best we can do is to match the original code,
+  // when possible.
+  if(prefix_1.indexOf("module")>=0){parts.push("module ");}else{parts.push("namespace ");}}else{parts.push("namespace ");}}}parts.push(path.call(print,"id"));if(n.body&&n.body.type==="TSModuleDeclaration"){parts.push(path.call(print,"body"));}else if(n.body){var bodyLines=path.call(print,"body");if(bodyLines.isEmpty()){parts.push(" {}");}else{parts.push(" {\n",bodyLines.indent(options.tabWidth),"\n}");}}return lines.concat(parts);}case"TSModuleBlock":return path.call(function(bodyPath){return printStatementSequence(bodyPath,options,print);},"body");// Unhandled types below. If encountered, nodes of these types should
+  // be either left alone or desugared into AST types that are fully
+  // supported by the pretty-printer.
+  case"ClassHeritage":// TODO
+  case"ComprehensionBlock":// TODO
+  case"ComprehensionExpression":// TODO
+  case"Glob":// TODO
+  case"GeneratorExpression":// TODO
+  case"LetStatement":// TODO
+  case"LetExpression":// TODO
+  case"GraphExpression":// TODO
+  case"GraphIndexExpression":// TODO
+  // XML types that nobody cares about or needs to print.
+  case"XMLDefaultDeclaration":case"XMLAnyName":case"XMLQualifiedIdentifier":case"XMLFunctionQualifiedIdentifier":case"XMLAttributeSelector":case"XMLFilterExpression":case"XML":case"XMLElement":case"XMLList":case"XMLEscape":case"XMLText":case"XMLStartTag":case"XMLEndTag":case"XMLPointTag":case"XMLName":case"XMLAttribute":case"XMLCdata":case"XMLComment":case"XMLProcessingInstruction":default:debugger;throw new Error("unknown type: "+JSON.stringify(n.type));}}function printDecorators(path,printPath){var parts=[];var node=path.getValue();if(node.decorators&&node.decorators.length>0&&// If the parent node is an export declaration, it will be
+  // responsible for printing node.decorators.
+  !util.getParentExportDeclaration(path)){path.each(function(decoratorPath){parts.push(printPath(decoratorPath),"\n");},"decorators");}else if(util.isExportDeclaration(node)&&node.declaration&&node.declaration.decorators){// Export declarations are responsible for printing any decorators
+  // that logically apply to node.declaration.
+  path.each(function(decoratorPath){parts.push(printPath(decoratorPath),"\n");},"declaration","decorators");}return lines.concat(parts);}function printStatementSequence(path,options,print){var filtered=[];var sawComment=false;var sawStatement=false;path.each(function(stmtPath){var stmt=stmtPath.getValue();// Just in case the AST has been modified to contain falsy
+  // "statements," it's safer simply to skip them.
+  if(!stmt){return;}// Skip printing EmptyStatement nodes to avoid leaving stray
+  // semicolons lying around.
+  if(stmt.type==="EmptyStatement"&&!(stmt.comments&&stmt.comments.length>0)){return;}if(namedTypes.Comment.check(stmt)){// The pretty printer allows a dangling Comment node to act as
+  // a Statement when the Comment can't be attached to any other
+  // non-Comment node in the tree.
+  sawComment=true;}else if(namedTypes.Statement.check(stmt)){sawStatement=true;}else{// When the pretty printer encounters a string instead of an
+  // AST node, it just prints the string. This behavior can be
+  // useful for fine-grained formatting decisions like inserting
+  // blank lines.
+  isString.assert(stmt);}// We can't hang onto stmtPath outside of this function, because
+  // it's just a reference to a mutable FastPath object, so we have
+  // to go ahead and print it here.
+  filtered.push({node:stmt,printed:print(stmtPath)});});if(sawComment){assert_1.default.strictEqual(sawStatement,false,"Comments may appear as statements in otherwise empty statement "+"lists, but may not coexist with non-Comment nodes.");}var prevTrailingSpace=null;var len=filtered.length;var parts=[];filtered.forEach(function(info,i){var printed=info.printed;var stmt=info.node;var multiLine=printed.length>1;var notFirst=i>0;var notLast=i<len-1;var leadingSpace;var trailingSpace;var lines=stmt&&stmt.loc&&stmt.loc.lines;var trueLoc=lines&&options.reuseWhitespace&&util.getTrueLoc(stmt,lines);if(notFirst){if(trueLoc){var beforeStart=lines.skipSpaces(trueLoc.start,true);var beforeStartLine=beforeStart?beforeStart.line:1;var leadingGap=trueLoc.start.line-beforeStartLine;leadingSpace=Array(leadingGap+1).join("\n");}else{leadingSpace=multiLine?"\n\n":"\n";}}else{leadingSpace="";}if(notLast){if(trueLoc){var afterEnd=lines.skipSpaces(trueLoc.end);var afterEndLine=afterEnd?afterEnd.line:lines.length;var trailingGap=afterEndLine-trueLoc.end.line;trailingSpace=Array(trailingGap+1).join("\n");}else{trailingSpace=multiLine?"\n\n":"\n";}}else{trailingSpace="";}parts.push(maxSpace(prevTrailingSpace,leadingSpace),printed);if(notLast){prevTrailingSpace=trailingSpace;}else if(trailingSpace){parts.push(trailingSpace);}});return lines.concat(parts);}function maxSpace(s1,s2){if(!s1&&!s2){return lines.fromString("");}if(!s1){return lines.fromString(s2);}if(!s2){return lines.fromString(s1);}var spaceLines1=lines.fromString(s1);var spaceLines2=lines.fromString(s2);if(spaceLines2.length>spaceLines1.length){return spaceLines2;}return spaceLines1;}function printMethod(path,options,print){var node=path.getNode();var kind=node.kind;var parts=[];var nodeValue=node.value;if(!namedTypes.FunctionExpression.check(nodeValue)){nodeValue=node;}var access=node.accessibility||node.access;if(typeof access==="string"){parts.push(access," ");}if(node.static){parts.push("static ");}if(node.abstract){parts.push("abstract ");}if(node.readonly){parts.push("readonly ");}if(nodeValue.async){parts.push("async ");}if(nodeValue.generator){parts.push("*");}if(kind==="get"||kind==="set"){parts.push(kind," ");}var key=path.call(print,"key");if(node.computed){key=lines.concat(["[",key,"]"]);}parts.push(key);if(node.optional){parts.push("?");}if(node===nodeValue){parts.push(path.call(print,"typeParameters"),"(",printFunctionParams(path,options,print),")",path.call(print,"returnType"));if(node.body){parts.push(" ",path.call(print,"body"));}else{parts.push(";");}}else{parts.push(path.call(print,"value","typeParameters"),"(",path.call(function(valuePath){return printFunctionParams(valuePath,options,print);},"value"),")",path.call(print,"value","returnType"));if(nodeValue.body){parts.push(" ",path.call(print,"value","body"));}else{parts.push(";");}}return lines.concat(parts);}function printArgumentsList(path,options,print){var printed=path.map(print,"arguments");var trailingComma=util.isTrailingCommaEnabled(options,"parameters");var joined=lines.fromString(", ").join(printed);if(joined.getLineLength(1)>options.wrapColumn){joined=lines.fromString(",\n").join(printed);return lines.concat(["(\n",joined.indent(options.tabWidth),trailingComma?",\n)":"\n)"]);}return lines.concat(["(",joined,")"]);}function printFunctionParams(path,options,print){var fun=path.getValue();if(fun.params){var params=fun.params;var printed=path.map(print,"params");}else if(fun.parameters){params=fun.parameters;printed=path.map(print,"parameters");}if(fun.defaults){path.each(function(defExprPath){var i=defExprPath.getName();var p=printed[i];if(p&&defExprPath.getValue()){printed[i]=lines.concat([p," = ",print(defExprPath)]);}},"defaults");}if(fun.rest){printed.push(lines.concat(["...",path.call(print,"rest")]));}var joined=lines.fromString(", ").join(printed);if(joined.length>1||joined.getLineLength(1)>options.wrapColumn){joined=lines.fromString(",\n").join(printed);if(util.isTrailingCommaEnabled(options,"parameters")&&!fun.rest&&params[params.length-1].type!=='RestElement'){joined=lines.concat([joined,",\n"]);}else{joined=lines.concat([joined,"\n"]);}return lines.concat(["\n",joined.indent(options.tabWidth)]);}return joined;}function printExportDeclaration(path,options,print){var decl=path.getValue();var parts=["export "];if(decl.exportKind&&decl.exportKind!=="value"){parts.push(decl.exportKind+" ");}var shouldPrintSpaces=options.objectCurlySpacing;namedTypes.Declaration.assert(decl);if(decl["default"]||decl.type==="ExportDefaultDeclaration"){parts.push("default ");}if(decl.declaration){parts.push(path.call(print,"declaration"));}else if(decl.specifiers){if(decl.specifiers.length===1&&decl.specifiers[0].type==="ExportBatchSpecifier"){parts.push("*");}else if(decl.specifiers.length===0){parts.push("{}");}else if(decl.specifiers[0].type==='ExportDefaultSpecifier'){var unbracedSpecifiers_2=[];var bracedSpecifiers_2=[];path.each(function(specifierPath){var spec=specifierPath.getValue();if(spec.type==="ExportDefaultSpecifier"){unbracedSpecifiers_2.push(print(specifierPath));}else{bracedSpecifiers_2.push(print(specifierPath));}},"specifiers");unbracedSpecifiers_2.forEach(function(lines,i){if(i>0){parts.push(", ");}parts.push(lines);});if(bracedSpecifiers_2.length>0){var lines_3=lines.fromString(", ").join(bracedSpecifiers_2);if(lines_3.getLineLength(1)>options.wrapColumn){lines_3=lines.concat([lines.fromString(",\n").join(bracedSpecifiers_2).indent(options.tabWidth),","]);}if(unbracedSpecifiers_2.length>0){parts.push(", ");}if(lines_3.length>1){parts.push("{\n",lines_3,"\n}");}else if(options.objectCurlySpacing){parts.push("{ ",lines_3," }");}else{parts.push("{",lines_3,"}");}}}else{parts.push(shouldPrintSpaces?"{ ":"{",lines.fromString(", ").join(path.map(print,"specifiers")),shouldPrintSpaces?" }":"}");}if(decl.source){parts.push(" from ",path.call(print,"source"));}}var lines$1=lines.concat(parts);if(lastNonSpaceCharacter(lines$1)!==";"&&!(decl.declaration&&(decl.declaration.type==="FunctionDeclaration"||decl.declaration.type==="ClassDeclaration"||decl.declaration.type==="TSModuleDeclaration"||decl.declaration.type==="TSInterfaceDeclaration"||decl.declaration.type==="TSEnumDeclaration"))){lines$1=lines.concat([lines$1,";"]);}return lines$1;}function printFlowDeclaration(path,parts){var parentExportDecl=util.getParentExportDeclaration(path);if(parentExportDecl){assert_1.default.strictEqual(parentExportDecl.type,"DeclareExportDeclaration");}else{// If the parent node has type DeclareExportDeclaration, then it
+  // will be responsible for printing the "declare" token. Otherwise
+  // it needs to be printed with this non-exported declaration node.
+  parts.unshift("declare ");}return lines.concat(parts);}function printVariance(path,print){return path.call(function(variancePath){var value=variancePath.getValue();if(value){if(value==="plus"){return lines.fromString("+");}if(value==="minus"){return lines.fromString("-");}return print(variancePath);}return lines.fromString("");},"variance");}function adjustClause(clause,options){if(clause.length>1)return lines.concat([" ",clause]);return lines.concat(["\n",maybeAddSemicolon(clause).indent(options.tabWidth)]);}function lastNonSpaceCharacter(lines){var pos=lines.lastPos();do{var ch=lines.charAt(pos);if(/\S/.test(ch))return ch;}while(lines.prevPos(pos));}function endsWithBrace(lines){return lastNonSpaceCharacter(lines)==="}";}function swapQuotes(str){return str.replace(/['"]/g,function(m){return m==='"'?'\'':'"';});}function nodeStr(str,options){isString.assert(str);switch(options.quote){case"auto":var double=JSON.stringify(str);var single=swapQuotes(JSON.stringify(swapQuotes(str)));return double.length>single.length?single:double;case"single":return swapQuotes(JSON.stringify(swapQuotes(str)));case"double":default:return JSON.stringify(str);}}function maybeAddSemicolon(lines$1){var eoc=lastNonSpaceCharacter(lines$1);if(!eoc||"\n};".indexOf(eoc)<0)return lines.concat([lines$1,";"]);return lines$1;}});unwrapExports(printer);var printer_1=printer.Printer;var main$1=createCommonjsModule(function(module,exports){var __importDefault=this&&this.__importDefault||function(mod){return mod&&mod.__esModule?mod:{"default":mod};};var __importStar=this&&this.__importStar||function(mod){if(mod&&mod.__esModule)return mod;var result={};if(mod!=null)for(var k in mod)if(Object.hasOwnProperty.call(mod,k))result[k]=mod[k];result["default"]=mod;return result;};Object.defineProperty(exports,"__esModule",{value:true});var fs_1=__importDefault(fs);var types=__importStar(main);exports.types=types;exports.parse=parser.parse;/**
+  	 * Traverse and potentially modify an abstract syntax tree using a
+  	 * convenient visitor syntax:
+  	 *
+  	 *   recast.visit(ast, {
+  	 *     names: [],
+  	 *     visitIdentifier: function(path) {
+  	 *       var node = path.value;
+  	 *       this.visitor.names.push(node.name);
+  	 *       this.traverse(path);
+  	 *     }
+  	 *   });
+  	 */var ast_types_1=main;exports.visit=ast_types_1.visit;/**
+  	 * Reprint a modified syntax tree using as much of the original source
+  	 * code as possible.
+  	 */function print(node,options){return new printer.Printer(options).print(node);}exports.print=print;/**
+  	 * Print without attempting to reuse any original source code.
+  	 */function prettyPrint(node,options){return new printer.Printer(options).printGenerically(node);}exports.prettyPrint=prettyPrint;/**
+  	 * Convenient command-line interface (see e.g. example/add-braces).
+  	 */function run(transformer,options){return runFile(process.argv[2],transformer,options);}exports.run=run;function runFile(path,transformer,options){fs_1.default.readFile(path,"utf-8",function(err,code){if(err){console.error(err);return;}runString(code,transformer,options);});}function defaultWriteback(output){process.stdout.write(output);}function runString(code,transformer,options){var writeback=options&&options.writeback||defaultWriteback;transformer(parser.parse(code,options),function(node){writeback(print(node,options).code);});}});unwrapExports(main$1);var main_1$1=main$1.types;var main_2$1=main$1.parse;var main_3$1=main$1.visit;var main_4$1=main$1.print;var main_5$1=main$1.prettyPrint;var main_6$1=main$1.run;const types$1=main_1$1;const builders=main_1$1.builders;const namedTypes=main_1$1.namedTypes;function nullNode(){return builders.literal(null);}function simplePropertyNode(key,value){return builders.property('init',builders.literal(key),value,false);}/**
+  	 * Return a source map as JSON, it it has not the toJSON method it means it can
+  	 * be used right the way
+  	 * @param   { SourceMapGenerator|Object } map - a sourcemap generator or simply an json object
+  	 * @returns { Object } the source map as JSON
+  	 */function sourcemapAsJSON(map){if(map&&map.toJSON)return map.toJSON();return map;}/**
+  	 * Detect node js environements
+  	 * @returns { boolean } true if the runtime is node
+  	 */function isNode(){return typeof process!=='undefined';}/**
+  	 * Compose two sourcemaps
+  	 * @param   { SourceMapGenerator } formerMap - original sourcemap
+  	 * @param   { SourceMapGenerator } latterMap - target sourcemap
+  	 * @returns { Object } sourcemap json
+  	 */function composeSourcemaps(formerMap,latterMap){if(isNode()&&formerMap&&latterMap&&latterMap.mappings){return util_5$1(sourcemapAsJSON(formerMap),sourcemapAsJSON(latterMap));}else if(isNode()&&formerMap){return sourcemapAsJSON(formerMap);}return {};}/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */const intToCharMap$1="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");/**
+  	 * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+  	 */var encode$2=function encode$2(number){if(0<=number&&number<intToCharMap$1.length){return intToCharMap$1[number];}throw new TypeError("Must be between 0 and 63: "+number);};var base64$1={encode:encode$2};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 *
+  	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+  	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+  	 *
+  	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+  	 * Redistribution and use in source and binary forms, with or without
+  	 * modification, are permitted provided that the following conditions are
+  	 * met:
+  	 *
+  	 *  * Redistributions of source code must retain the above copyright
+  	 *    notice, this list of conditions and the following disclaimer.
+  	 *  * Redistributions in binary form must reproduce the above
+  	 *    copyright notice, this list of conditions and the following
+  	 *    disclaimer in the documentation and/or other materials provided
+  	 *    with the distribution.
+  	 *  * Neither the name of Google Inc. nor the names of its
+  	 *    contributors may be used to endorse or promote products derived
+  	 *    from this software without specific prior written permission.
+  	 *
+  	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+  	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+  	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+  	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+  	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+  	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+  	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+  	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+  	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+  	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+  	 */ // A single base 64 digit can contain 6 bits of data. For the base 64 variable
+  // length quantities we use in the source map spec, the first bit is the sign,
+  // the next four bits are the actual value, and the 6th bit is the
+  // continuation bit. The continuation bit tells us whether there are more
+  // digits in this value following this digit.
+  //
+  //   Continuation
+  //   |    Sign
+  //   |    |
+  //   V    V
+  //   101011
+  const VLQ_BASE_SHIFT$1=5;// binary: 100000
+  const VLQ_BASE$1=1<<VLQ_BASE_SHIFT$1;// binary: 011111
+  const VLQ_BASE_MASK$1=VLQ_BASE$1-1;// binary: 100000
+  const VLQ_CONTINUATION_BIT$1=VLQ_BASE$1;/**
+  	 * Converts from a two-complement value to a value where the sign bit is
+  	 * placed in the least significant bit.  For example, as decimals:
+  	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+  	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+  	 */function toVLQSigned$1(aValue){return aValue<0?(-aValue<<1)+1:(aValue<<1)+0;}/**
+  	 * Returns the base 64 VLQ encoded value.
+  	 */var encode$3=function base64VLQ_encode(aValue){let encoded="";let digit;let vlq=toVLQSigned$1(aValue);do{digit=vlq&VLQ_BASE_MASK$1;vlq>>>=VLQ_BASE_SHIFT$1;if(vlq>0){// There are still more digits in this value, so we must make sure the
+  // continuation bit is marked.
+  digit|=VLQ_CONTINUATION_BIT$1;}encoded+=base64$1.encode(digit);}while(vlq>0);return encoded;};var base64Vlq$1={encode:encode$3};var util$2=createCommonjsModule(function(module,exports){/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ /**
+  	 * This is a helper function for getting values from parameter/options
+  	 * objects.
+  	 *
+  	 * @param args The object we are extracting values from
+  	 * @param name The name of the property we are getting.
+  	 * @param defaultValue An optional value to return if the property is missing
+  	 * from the object. If this is not specified and the property is missing, an
+  	 * error will be thrown.
+  	 */function getArg(aArgs,aName,aDefaultValue){if(aName in aArgs){return aArgs[aName];}else if(arguments.length===3){return aDefaultValue;}throw new Error('"'+aName+'" is a required argument.');}exports.getArg=getArg;const urlRegexp=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;const dataUrlRegexp=/^data:.+\,.+$/;function urlParse(aUrl){const match=aUrl.match(urlRegexp);if(!match){return null;}return {scheme:match[1],auth:match[2],host:match[3],port:match[4],path:match[5]};}exports.urlParse=urlParse;function urlGenerate(aParsedUrl){let url="";if(aParsedUrl.scheme){url+=aParsedUrl.scheme+":";}url+="//";if(aParsedUrl.auth){url+=aParsedUrl.auth+"@";}if(aParsedUrl.host){url+=aParsedUrl.host;}if(aParsedUrl.port){url+=":"+aParsedUrl.port;}if(aParsedUrl.path){url+=aParsedUrl.path;}return url;}exports.urlGenerate=urlGenerate;const MAX_CACHED_INPUTS=32;/**
+  	 * Takes some function `f(input) -> result` and returns a memoized version of
+  	 * `f`.
+  	 *
+  	 * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+  	 * memoization is a dumb-simple, linear least-recently-used cache.
+  	 */function lruMemoize(f){const cache=[];return function(input){for(let i=0;i<cache.length;i++){if(cache[i].input===input){const temp=cache[0];cache[0]=cache[i];cache[i]=temp;return cache[0].result;}}const result=f(input);cache.unshift({input,result});if(cache.length>MAX_CACHED_INPUTS){cache.pop();}return result;};}/**
+  	 * Normalizes a path, or the path portion of a URL:
+  	 *
+  	 * - Replaces consecutive slashes with one slash.
+  	 * - Removes unnecessary '.' parts.
+  	 * - Removes unnecessary '<dir>/..' parts.
+  	 *
+  	 * Based on code in the Node.js 'path' core module.
+  	 *
+  	 * @param aPath The path or url to normalize.
+  	 */const normalize=lruMemoize(function normalize(aPath){let path=aPath;const url=urlParse(aPath);if(url){if(!url.path){return aPath;}path=url.path;}const isAbsolute=exports.isAbsolute(path);// Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  const parts=[];let start=0;let i=0;while(true){start=i;i=path.indexOf("/",start);if(i===-1){parts.push(path.slice(start));break;}else{parts.push(path.slice(start,i));while(i<path.length&&path[i]==="/"){i++;}}}let up=0;for(i=parts.length-1;i>=0;i--){const part=parts[i];if(part==="."){parts.splice(i,1);}else if(part===".."){up++;}else if(up>0){if(part===""){// The first part is blank if the path is absolute. Trying to go
+  // above the root is a no-op. Therefore we can remove all '..' parts
+  // directly after the root.
+  parts.splice(i+1,up);up=0;}else{parts.splice(i,2);up--;}}}path=parts.join("/");if(path===""){path=isAbsolute?"/":".";}if(url){url.path=path;return urlGenerate(url);}return path;});exports.normalize=normalize;/**
+  	 * Joins two paths/URLs.
+  	 *
+  	 * @param aRoot The root path or URL.
+  	 * @param aPath The path or URL to be joined with the root.
+  	 *
+  	 * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+  	 *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+  	 *   first.
+  	 * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+  	 *   is updated with the result and aRoot is returned. Otherwise the result
+  	 *   is returned.
+  	 *   - If aPath is absolute, the result is aPath.
+  	 *   - Otherwise the two paths are joined with a slash.
+  	 * - Joining for example 'http://' and 'www.example.com' is also supported.
+  	 */function join(aRoot,aPath){if(aRoot===""){aRoot=".";}if(aPath===""){aPath=".";}const aPathUrl=urlParse(aPath);const aRootUrl=urlParse(aRoot);if(aRootUrl){aRoot=aRootUrl.path||"/";}// `join(foo, '//www.example.org')`
+  if(aPathUrl&&!aPathUrl.scheme){if(aRootUrl){aPathUrl.scheme=aRootUrl.scheme;}return urlGenerate(aPathUrl);}if(aPathUrl||aPath.match(dataUrlRegexp)){return aPath;}// `join('http://', 'www.example.com')`
+  if(aRootUrl&&!aRootUrl.host&&!aRootUrl.path){aRootUrl.host=aPath;return urlGenerate(aRootUrl);}const joined=aPath.charAt(0)==="/"?aPath:normalize(aRoot.replace(/\/+$/,"")+"/"+aPath);if(aRootUrl){aRootUrl.path=joined;return urlGenerate(aRootUrl);}return joined;}exports.join=join;exports.isAbsolute=function(aPath){return aPath.charAt(0)==="/"||urlRegexp.test(aPath);};/**
+  	 * Make a path relative to a URL or another path.
+  	 *
+  	 * @param aRoot The root path or URL.
+  	 * @param aPath The path or URL to be made relative to aRoot.
+  	 */function relative(aRoot,aPath){if(aRoot===""){aRoot=".";}aRoot=aRoot.replace(/\/$/,"");// It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  let level=0;while(aPath.indexOf(aRoot+"/")!==0){const index=aRoot.lastIndexOf("/");if(index<0){return aPath;}// If the only part of the root that is left is the scheme (i.e. http://,
+  // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+  // have exhausted all components, so the path is not relative to the root.
+  aRoot=aRoot.slice(0,index);if(aRoot.match(/^([^\/]+:\/)?\/*$/)){return aPath;}++level;}// Make sure we add a "../" for each component we removed from the root.
+  return Array(level+1).join("../")+aPath.substr(aRoot.length+1);}exports.relative=relative;const supportsNullProto=function(){const obj=Object.create(null);return !("__proto__"in obj);}();function identity(s){return s;}/**
+  	 * Because behavior goes wacky when you set `__proto__` on objects, we
+  	 * have to prefix all the strings in our set with an arbitrary character.
+  	 *
+  	 * See https://github.com/mozilla/source-map/pull/31 and
+  	 * https://github.com/mozilla/source-map/issues/30
+  	 *
+  	 * @param String aStr
+  	 */function toSetString(aStr){if(isProtoString(aStr)){return "$"+aStr;}return aStr;}exports.toSetString=supportsNullProto?identity:toSetString;function fromSetString(aStr){if(isProtoString(aStr)){return aStr.slice(1);}return aStr;}exports.fromSetString=supportsNullProto?identity:fromSetString;function isProtoString(s){if(!s){return false;}const length=s.length;if(length<9/* "__proto__".length */){return false;}/* eslint-disable no-multi-spaces */if(s.charCodeAt(length-1)!==95/* '_' */||s.charCodeAt(length-2)!==95/* '_' */||s.charCodeAt(length-3)!==111/* 'o' */||s.charCodeAt(length-4)!==116/* 't' */||s.charCodeAt(length-5)!==111/* 'o' */||s.charCodeAt(length-6)!==114/* 'r' */||s.charCodeAt(length-7)!==112/* 'p' */||s.charCodeAt(length-8)!==95/* '_' */||s.charCodeAt(length-9)!==95/* '_' */){return false;}/* eslint-enable no-multi-spaces */for(let i=length-10;i>=0;i--){if(s.charCodeAt(i)!==36/* '$' */){return false;}}return true;}/**
+  	 * Comparator between two mappings where the original positions are compared.
+  	 *
+  	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+  	 * mappings with the same original source/line/column, but different generated
+  	 * line and column the same. Useful when searching for a mapping with a
+  	 * stubbed out mapping.
+  	 */function compareByOriginalPositions(mappingA,mappingB,onlyCompareOriginal){let cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0||onlyCompareOriginal){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0){return cmp;}cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByOriginalPositions=compareByOriginalPositions;/**
+  	 * Comparator between two mappings with deflated source and name indices where
+  	 * the generated positions are compared.
+  	 *
+  	 * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+  	 * mappings with the same generated line and column, but different
+  	 * source/name/original line and column the same. Useful when searching for a
+  	 * mapping with a stubbed out mapping.
+  	 */function compareByGeneratedPositionsDeflated(mappingA,mappingB,onlyCompareGenerated){let cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0||onlyCompareGenerated){return cmp;}cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByGeneratedPositionsDeflated=compareByGeneratedPositionsDeflated;function strcmp(aStr1,aStr2){if(aStr1===aStr2){return 0;}if(aStr1===null){return 1;// aStr2 !== null
+  }if(aStr2===null){return -1;// aStr1 !== null
+  }if(aStr1>aStr2){return 1;}return -1;}/**
+  	 * Comparator between two mappings with inflated source and name strings where
+  	 * the generated positions are compared.
+  	 */function compareByGeneratedPositionsInflated(mappingA,mappingB){let cmp=mappingA.generatedLine-mappingB.generatedLine;if(cmp!==0){return cmp;}cmp=mappingA.generatedColumn-mappingB.generatedColumn;if(cmp!==0){return cmp;}cmp=strcmp(mappingA.source,mappingB.source);if(cmp!==0){return cmp;}cmp=mappingA.originalLine-mappingB.originalLine;if(cmp!==0){return cmp;}cmp=mappingA.originalColumn-mappingB.originalColumn;if(cmp!==0){return cmp;}return strcmp(mappingA.name,mappingB.name);}exports.compareByGeneratedPositionsInflated=compareByGeneratedPositionsInflated;/**
+  	 * Strip any JSON XSSI avoidance prefix from the string (as documented
+  	 * in the source maps specification), and then parse the string as
+  	 * JSON.
+  	 */function parseSourceMapInput(str){return JSON.parse(str.replace(/^\)]}'[^\n]*\n/,""));}exports.parseSourceMapInput=parseSourceMapInput;/**
+  	 * Compute the URL of a source given the the source root, the source's
+  	 * URL, and the source map's URL.
+  	 */function computeSourceURL(sourceRoot,sourceURL,sourceMapURL){sourceURL=sourceURL||"";if(sourceRoot){// This follows what Chrome does.
+  if(sourceRoot[sourceRoot.length-1]!=="/"&&sourceURL[0]!=="/"){sourceRoot+="/";}// The spec says:
+  //   Line 4: An optional source root, useful for relocating source
+  //   files on a server or removing repeated values in the
+  //   “sources” entry.  This value is prepended to the individual
+  //   entries in the “source” field.
+  sourceURL=sourceRoot+sourceURL;}// Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if(sourceMapURL){const parsed=urlParse(sourceMapURL);if(!parsed){throw new Error("sourceMapURL could not be parsed");}if(parsed.path){// Strip the last path component, but keep the "/".
+  const index=parsed.path.lastIndexOf("/");if(index>=0){parsed.path=parsed.path.substring(0,index+1);}}sourceURL=join(urlGenerate(parsed),sourceURL);}return normalize(sourceURL);}exports.computeSourceURL=computeSourceURL;});var util_1$2=util$2.getArg;var util_2$2=util$2.urlParse;var util_3$2=util$2.urlGenerate;var util_4$2=util$2.normalize;var util_5$2=util$2.join;var util_6$2=util$2.isAbsolute;var util_7$2=util$2.relative;var util_8$2=util$2.toSetString;var util_9$2=util$2.fromSetString;var util_10$2=util$2.compareByOriginalPositions;var util_11$1=util$2.compareByGeneratedPositionsDeflated;var util_12$1=util$2.compareByGeneratedPositionsInflated;var util_13$1=util$2.parseSourceMapInput;var util_14$1=util$2.computeSourceURL;/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ /**
+  	 * A data structure which is a combination of an array and a set. Adding a new
+  	 * member is O(1), testing for membership is O(1), and finding the index of an
+  	 * element is O(1). Removing elements from the set is not supported. Only
+  	 * strings are supported for membership.
+  	 */class ArraySet$3{constructor(){this._array=[];this._set=new Map();}/**
+  	   * Static method for creating ArraySet instances from an existing array.
+  	   */static fromArray(aArray,aAllowDuplicates){const set=new ArraySet$3();for(let i=0,len=aArray.length;i<len;i++){set.add(aArray[i],aAllowDuplicates);}return set;}/**
+  	   * Return how many unique items are in this ArraySet. If duplicates have been
+  	   * added, than those do not count towards the size.
+  	   *
+  	   * @returns Number
+  	   */size(){return this._set.size;}/**
+  	   * Add the given string to this set.
+  	   *
+  	   * @param String aStr
+  	   */add(aStr,aAllowDuplicates){const isDuplicate=this.has(aStr);const idx=this._array.length;if(!isDuplicate||aAllowDuplicates){this._array.push(aStr);}if(!isDuplicate){this._set.set(aStr,idx);}}/**
+  	   * Is the given string a member of this set?
+  	   *
+  	   * @param String aStr
+  	   */has(aStr){return this._set.has(aStr);}/**
+  	   * What is the index of the given string in the array?
+  	   *
+  	   * @param String aStr
+  	   */indexOf(aStr){const idx=this._set.get(aStr);if(idx>=0){return idx;}throw new Error('"'+aStr+'" is not in the set.');}/**
+  	   * What is the element at the given index?
+  	   *
+  	   * @param Number aIdx
+  	   */at(aIdx){if(aIdx>=0&&aIdx<this._array.length){return this._array[aIdx];}throw new Error("No element indexed by "+aIdx);}/**
+  	   * Returns the array representation of this set (which has the proper indices
+  	   * indicated by indexOf). Note that this is a copy of the internal array used
+  	   * for storing the members so that no one can mess with internal state.
+  	   */toArray(){return this._array.slice();}}var ArraySet_1$1=ArraySet$3;var arraySet$1={ArraySet:ArraySet_1$1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2014 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */ /**
+  	 * Determine whether mappingB is after mappingA with respect to generated
+  	 * position.
+  	 */function generatedPositionAfter$1(mappingA,mappingB){// Optimized for most common case
+  const lineA=mappingA.generatedLine;const lineB=mappingB.generatedLine;const columnA=mappingA.generatedColumn;const columnB=mappingB.generatedColumn;return lineB>lineA||lineB==lineA&&columnB>=columnA||util$2.compareByGeneratedPositionsInflated(mappingA,mappingB)<=0;}/**
+  	 * A data structure to provide a sorted view of accumulated mappings in a
+  	 * performance conscious manner. It trades a negligible overhead in general
+  	 * case for a large speedup in case of mappings being added in order.
+  	 */class MappingList$2{constructor(){this._array=[];this._sorted=true;// Serves as infimum
+  this._last={generatedLine:-1,generatedColumn:0};}/**
+  	   * Iterate through internal items. This method takes the same arguments that
+  	   * `Array.prototype.forEach` takes.
+  	   *
+  	   * NOTE: The order of the mappings is NOT guaranteed.
+  	   */unsortedForEach(aCallback,aThisArg){this._array.forEach(aCallback,aThisArg);}/**
+  	   * Add the given source mapping.
+  	   *
+  	   * @param Object aMapping
+  	   */add(aMapping){if(generatedPositionAfter$1(this._last,aMapping)){this._last=aMapping;this._array.push(aMapping);}else{this._sorted=false;this._array.push(aMapping);}}/**
+  	   * Returns the flat, sorted array of mappings. The mappings are sorted by
+  	   * generated position.
+  	   *
+  	   * WARNING: This method returns internal data without copying, for
+  	   * performance. The return value must NOT be mutated, and should be treated as
+  	   * an immutable borrow. If you want to take ownership, you must make your own
+  	   * copy.
+  	   */toArray(){if(!this._sorted){this._array.sort(util$2.compareByGeneratedPositionsInflated);this._sorted=true;}return this._array;}}var MappingList_1$1=MappingList$2;var mappingList$1={MappingList:MappingList_1$1};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */const ArraySet$4=arraySet$1.ArraySet;const MappingList$3=mappingList$1.MappingList;/**
+  	 * An instance of the SourceMapGenerator represents a source map which is
+  	 * being built incrementally. You may pass an object with the following
+  	 * properties:
+  	 *
+  	 *   - file: The filename of the generated source.
+  	 *   - sourceRoot: A root for all relative URLs in this source map.
+  	 */class SourceMapGenerator$3{constructor(aArgs){if(!aArgs){aArgs={};}this._file=util$2.getArg(aArgs,"file",null);this._sourceRoot=util$2.getArg(aArgs,"sourceRoot",null);this._skipValidation=util$2.getArg(aArgs,"skipValidation",false);this._sources=new ArraySet$4();this._names=new ArraySet$4();this._mappings=new MappingList$3();this._sourcesContents=null;}/**
+  	   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+  	   *
+  	   * @param aSourceMapConsumer The SourceMap.
+  	   */static fromSourceMap(aSourceMapConsumer){const sourceRoot=aSourceMapConsumer.sourceRoot;const generator=new SourceMapGenerator$3({file:aSourceMapConsumer.file,sourceRoot});aSourceMapConsumer.eachMapping(function(mapping){const newMapping={generated:{line:mapping.generatedLine,column:mapping.generatedColumn}};if(mapping.source!=null){newMapping.source=mapping.source;if(sourceRoot!=null){newMapping.source=util$2.relative(sourceRoot,newMapping.source);}newMapping.original={line:mapping.originalLine,column:mapping.originalColumn};if(mapping.name!=null){newMapping.name=mapping.name;}}generator.addMapping(newMapping);});aSourceMapConsumer.sources.forEach(function(sourceFile){let sourceRelative=sourceFile;if(sourceRoot!==null){sourceRelative=util$2.relative(sourceRoot,sourceFile);}if(!generator._sources.has(sourceRelative)){generator._sources.add(sourceRelative);}const content=aSourceMapConsumer.sourceContentFor(sourceFile);if(content!=null){generator.setSourceContent(sourceFile,content);}});return generator;}/**
+  	   * Add a single mapping from original source line and column to the generated
+  	   * source's line and column for this source map being created. The mapping
+  	   * object should have the following properties:
+  	   *
+  	   *   - generated: An object with the generated line and column positions.
+  	   *   - original: An object with the original line and column positions.
+  	   *   - source: The original source file (relative to the sourceRoot).
+  	   *   - name: An optional original token name for this mapping.
+  	   */addMapping(aArgs){const generated=util$2.getArg(aArgs,"generated");const original=util$2.getArg(aArgs,"original",null);let source=util$2.getArg(aArgs,"source",null);let name=util$2.getArg(aArgs,"name",null);if(!this._skipValidation){this._validateMapping(generated,original,source,name);}if(source!=null){source=String(source);if(!this._sources.has(source)){this._sources.add(source);}}if(name!=null){name=String(name);if(!this._names.has(name)){this._names.add(name);}}this._mappings.add({generatedLine:generated.line,generatedColumn:generated.column,originalLine:original!=null&&original.line,originalColumn:original!=null&&original.column,source,name});}/**
+  	   * Set the source content for a source file.
+  	   */setSourceContent(aSourceFile,aSourceContent){let source=aSourceFile;if(this._sourceRoot!=null){source=util$2.relative(this._sourceRoot,source);}if(aSourceContent!=null){// Add the source content to the _sourcesContents map.
+  // Create a new _sourcesContents map if the property is null.
+  if(!this._sourcesContents){this._sourcesContents=Object.create(null);}this._sourcesContents[util$2.toSetString(source)]=aSourceContent;}else if(this._sourcesContents){// Remove the source file from the _sourcesContents map.
+  // If the _sourcesContents map is empty, set the property to null.
+  delete this._sourcesContents[util$2.toSetString(source)];if(Object.keys(this._sourcesContents).length===0){this._sourcesContents=null;}}}/**
+  	   * Applies the mappings of a sub-source-map for a specific source file to the
+  	   * source map being generated. Each mapping to the supplied source file is
+  	   * rewritten using the supplied source map. Note: The resolution for the
+  	   * resulting mappings is the minimium of this map and the supplied map.
+  	   *
+  	   * @param aSourceMapConsumer The source map to be applied.
+  	   * @param aSourceFile Optional. The filename of the source file.
+  	   *        If omitted, SourceMapConsumer's file property will be used.
+  	   * @param aSourceMapPath Optional. The dirname of the path to the source map
+  	   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+  	   *        This parameter is needed when the two source maps aren't in the same
+  	   *        directory, and the source map to be applied contains relative source
+  	   *        paths. If so, those relative source paths need to be rewritten
+  	   *        relative to the SourceMapGenerator.
+  	   */applySourceMap(aSourceMapConsumer,aSourceFile,aSourceMapPath){let sourceFile=aSourceFile;// If aSourceFile is omitted, we will use the file property of the SourceMap
+  if(aSourceFile==null){if(aSourceMapConsumer.file==null){throw new Error("SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, "+'or the source map\'s "file" property. Both were omitted.');}sourceFile=aSourceMapConsumer.file;}const sourceRoot=this._sourceRoot;// Make "sourceFile" relative if an absolute Url is passed.
+  if(sourceRoot!=null){sourceFile=util$2.relative(sourceRoot,sourceFile);}// Applying the SourceMap can add and remove items from the sources and
+  // the names array.
+  const newSources=this._mappings.toArray().length>0?new ArraySet$4():this._sources;const newNames=new ArraySet$4();// Find mappings for the "sourceFile"
+  this._mappings.unsortedForEach(function(mapping){if(mapping.source===sourceFile&&mapping.originalLine!=null){// Check if it can be mapped by the source map, then update the mapping.
+  const original=aSourceMapConsumer.originalPositionFor({line:mapping.originalLine,column:mapping.originalColumn});if(original.source!=null){// Copy mapping
+  mapping.source=original.source;if(aSourceMapPath!=null){mapping.source=util$2.join(aSourceMapPath,mapping.source);}if(sourceRoot!=null){mapping.source=util$2.relative(sourceRoot,mapping.source);}mapping.originalLine=original.line;mapping.originalColumn=original.column;if(original.name!=null){mapping.name=original.name;}}}const source=mapping.source;if(source!=null&&!newSources.has(source)){newSources.add(source);}const name=mapping.name;if(name!=null&&!newNames.has(name)){newNames.add(name);}},this);this._sources=newSources;this._names=newNames;// Copy sourcesContents of applied map.
+  aSourceMapConsumer.sources.forEach(function(srcFile){const content=aSourceMapConsumer.sourceContentFor(srcFile);if(content!=null){if(aSourceMapPath!=null){srcFile=util$2.join(aSourceMapPath,srcFile);}if(sourceRoot!=null){srcFile=util$2.relative(sourceRoot,srcFile);}this.setSourceContent(srcFile,content);}},this);}/**
+  	   * A mapping can have one of the three levels of data:
+  	   *
+  	   *   1. Just the generated position.
+  	   *   2. The Generated position, original position, and original source.
+  	   *   3. Generated and original position, original source, as well as a name
+  	   *      token.
+  	   *
+  	   * To maintain consistency, we validate that any new mapping being added falls
+  	   * in to one of these categories.
+  	   */_validateMapping(aGenerated,aOriginal,aSource,aName){// When aOriginal is truthy but has empty values for .line and .column,
+  // it is most likely a programmer error. In this case we throw a very
+  // specific error message to try to guide them the right way.
+  // For example: https://github.com/Polymer/polymer-bundler/pull/519
+  if(aOriginal&&typeof aOriginal.line!=="number"&&typeof aOriginal.column!=="number"){throw new Error("original.line and original.column are not numbers -- you probably meant to omit "+"the original mapping entirely and only map the generated position. If so, pass "+"null for the original mapping instead of an object with empty or null values.");}if(aGenerated&&"line"in aGenerated&&"column"in aGenerated&&aGenerated.line>0&&aGenerated.column>=0&&!aOriginal&&!aSource&&!aName);else if(aGenerated&&"line"in aGenerated&&"column"in aGenerated&&aOriginal&&"line"in aOriginal&&"column"in aOriginal&&aGenerated.line>0&&aGenerated.column>=0&&aOriginal.line>0&&aOriginal.column>=0&&aSource);else{throw new Error("Invalid mapping: "+JSON.stringify({generated:aGenerated,source:aSource,original:aOriginal,name:aName}));}}/**
+  	   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+  	   * specified by the source map format.
+  	   */_serializeMappings(){let previousGeneratedColumn=0;let previousGeneratedLine=1;let previousOriginalColumn=0;let previousOriginalLine=0;let previousName=0;let previousSource=0;let result="";let next;let mapping;let nameIdx;let sourceIdx;const mappings=this._mappings.toArray();for(let i=0,len=mappings.length;i<len;i++){mapping=mappings[i];next="";if(mapping.generatedLine!==previousGeneratedLine){previousGeneratedColumn=0;while(mapping.generatedLine!==previousGeneratedLine){next+=";";previousGeneratedLine++;}}else if(i>0){if(!util$2.compareByGeneratedPositionsInflated(mapping,mappings[i-1])){continue;}next+=",";}next+=base64Vlq$1.encode(mapping.generatedColumn-previousGeneratedColumn);previousGeneratedColumn=mapping.generatedColumn;if(mapping.source!=null){sourceIdx=this._sources.indexOf(mapping.source);next+=base64Vlq$1.encode(sourceIdx-previousSource);previousSource=sourceIdx;// lines are stored 0-based in SourceMap spec version 3
+  next+=base64Vlq$1.encode(mapping.originalLine-1-previousOriginalLine);previousOriginalLine=mapping.originalLine-1;next+=base64Vlq$1.encode(mapping.originalColumn-previousOriginalColumn);previousOriginalColumn=mapping.originalColumn;if(mapping.name!=null){nameIdx=this._names.indexOf(mapping.name);next+=base64Vlq$1.encode(nameIdx-previousName);previousName=nameIdx;}}result+=next;}return result;}_generateSourcesContent(aSources,aSourceRoot){return aSources.map(function(source){if(!this._sourcesContents){return null;}if(aSourceRoot!=null){source=util$2.relative(aSourceRoot,source);}const key=util$2.toSetString(source);return Object.prototype.hasOwnProperty.call(this._sourcesContents,key)?this._sourcesContents[key]:null;},this);}/**
+  	   * Externalize the source map.
+  	   */toJSON(){const map={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};if(this._file!=null){map.file=this._file;}if(this._sourceRoot!=null){map.sourceRoot=this._sourceRoot;}if(this._sourcesContents){map.sourcesContent=this._generateSourcesContent(map.sources,map.sourceRoot);}return map;}/**
+  	   * Render the source map being generated to a string.
+  	   */toString(){return JSON.stringify(this.toJSON());}}SourceMapGenerator$3.prototype._version=3;var SourceMapGenerator_1$1=SourceMapGenerator$3;var sourceMapGenerator$1={SourceMapGenerator:SourceMapGenerator_1$1};var binarySearch$1=createCommonjsModule(function(module,exports){/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */exports.GREATEST_LOWER_BOUND=1;exports.LEAST_UPPER_BOUND=2;/**
+  	 * Recursive implementation of binary search.
+  	 *
+  	 * @param aLow Indices here and lower do not contain the needle.
+  	 * @param aHigh Indices here and higher do not contain the needle.
+  	 * @param aNeedle The element being searched for.
+  	 * @param aHaystack The non-empty array being searched.
+  	 * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+  	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+  	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 */function recursiveSearch(aLow,aHigh,aNeedle,aHaystack,aCompare,aBias){// This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  const mid=Math.floor((aHigh-aLow)/2)+aLow;const cmp=aCompare(aNeedle,aHaystack[mid],true);if(cmp===0){// Found the element we are looking for.
+  return mid;}else if(cmp>0){// Our needle is greater than aHaystack[mid].
+  if(aHigh-mid>1){// The element is in the upper half.
+  return recursiveSearch(mid,aHigh,aNeedle,aHaystack,aCompare,aBias);}// The exact needle element was not found in this haystack. Determine if
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if(aBias==exports.LEAST_UPPER_BOUND){return aHigh<aHaystack.length?aHigh:-1;}return mid;}// Our needle is less than aHaystack[mid].
+  if(mid-aLow>1){// The element is in the lower half.
+  return recursiveSearch(aLow,mid,aNeedle,aHaystack,aCompare,aBias);}// we are in termination case (3) or (2) and return the appropriate thing.
+  if(aBias==exports.LEAST_UPPER_BOUND){return mid;}return aLow<0?-1:aLow;}/**
+  	 * This is an implementation of binary search which will always try and return
+  	 * the index of the closest element if there is no exact hit. This is because
+  	 * mappings between original and generated line/col pairs are single points,
+  	 * and there is an implicit region between each of them, so a miss just means
+  	 * that you aren't on the very start of a region.
+  	 *
+  	 * @param aNeedle The element you are looking for.
+  	 * @param aHaystack The array that is being searched.
+  	 * @param aCompare A function which takes the needle and an element in the
+  	 *     array and returns -1, 0, or 1 depending on whether the needle is less
+  	 *     than, equal to, or greater than the element, respectively.
+  	 * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+  	 *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	 *     closest element that is smaller than or greater than the one we are
+  	 *     searching for, respectively, if the exact element cannot be found.
+  	 *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+  	 */exports.search=function search(aNeedle,aHaystack,aCompare,aBias){if(aHaystack.length===0){return -1;}let index=recursiveSearch(-1,aHaystack.length,aNeedle,aHaystack,aCompare,aBias||exports.GREATEST_LOWER_BOUND);if(index<0){return -1;}// We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while(index-1>=0){if(aCompare(aHaystack[index],aHaystack[index-1],true)!==0){break;}--index;}return index;};});var binarySearch_1$1=binarySearch$1.GREATEST_LOWER_BOUND;var binarySearch_2$1=binarySearch$1.LEAST_UPPER_BOUND;var binarySearch_3$1=binarySearch$1.search;var readWasm=createCommonjsModule(function(module){if(typeof fetch==="function"){// Web version of reading a wasm file into an array buffer.
+  let mappingsWasmUrl=null;module.exports=function readWasm(){if(typeof mappingsWasmUrl!=="string"){throw new Error("You must provide the URL of lib/mappings.wasm by calling "+"SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) "+"before using SourceMapConsumer");}return fetch(mappingsWasmUrl).then(response=>response.arrayBuffer());};module.exports.initialize=url=>mappingsWasmUrl=url;}else{// Node version of reading a wasm file into an array buffer.
+  const fs$1=fs;const path=path$1;module.exports=function readWasm(){return new Promise((resolve,reject)=>{const wasmPath=path.join(__dirname,"mappings.wasm");fs$1.readFile(wasmPath,null,(error,data)=>{if(error){reject(error);return;}resolve(data.buffer);});});};module.exports.initialize=_=>{console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");};}});var readWasm_1=readWasm.initialize;/**
+  	 * Provide the JIT with a nice shape / hidden class.
+  	 */function Mapping$1(){this.generatedLine=0;this.generatedColumn=0;this.lastGeneratedColumn=null;this.source=null;this.originalLine=null;this.originalColumn=null;this.name=null;}let cachedWasm=null;var wasm=function wasm(){if(cachedWasm){return cachedWasm;}const callbackStack=[];cachedWasm=readWasm().then(buffer=>{return WebAssembly.instantiate(buffer,{env:{mapping_callback(generatedLine,generatedColumn,hasLastGeneratedColumn,lastGeneratedColumn,hasOriginal,source,originalLine,originalColumn,hasName,name){const mapping=new Mapping$1();// JS uses 1-based line numbers, wasm uses 0-based.
+  mapping.generatedLine=generatedLine+1;mapping.generatedColumn=generatedColumn;if(hasLastGeneratedColumn){// JS uses inclusive last generated column, wasm uses exclusive.
+  mapping.lastGeneratedColumn=lastGeneratedColumn-1;}if(hasOriginal){mapping.source=source;// JS uses 1-based line numbers, wasm uses 0-based.
+  mapping.originalLine=originalLine+1;mapping.originalColumn=originalColumn;if(hasName){mapping.name=name;}}callbackStack[callbackStack.length-1](mapping);},start_all_generated_locations_for(){console.time("all_generated_locations_for");},end_all_generated_locations_for(){console.timeEnd("all_generated_locations_for");},start_compute_column_spans(){console.time("compute_column_spans");},end_compute_column_spans(){console.timeEnd("compute_column_spans");},start_generated_location_for(){console.time("generated_location_for");},end_generated_location_for(){console.timeEnd("generated_location_for");},start_original_location_for(){console.time("original_location_for");},end_original_location_for(){console.timeEnd("original_location_for");},start_parse_mappings(){console.time("parse_mappings");},end_parse_mappings(){console.timeEnd("parse_mappings");},start_sort_by_generated_location(){console.time("sort_by_generated_location");},end_sort_by_generated_location(){console.timeEnd("sort_by_generated_location");},start_sort_by_original_location(){console.time("sort_by_original_location");},end_sort_by_original_location(){console.timeEnd("sort_by_original_location");}}});}).then(Wasm=>{return {exports:Wasm.instance.exports,withMappingCallback:(mappingCallback,f)=>{callbackStack.push(mappingCallback);try{f();}finally{callbackStack.pop();}}};}).then(null,e=>{cachedWasm=null;throw e;});return cachedWasm;};/* -*- Mode: js; js-indent-level: 2; -*- */ /*
+  	 * Copyright 2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */const ArraySet$5=arraySet$1.ArraySet;// eslint-disable-line no-unused-vars
+  const INTERNAL=Symbol("smcInternal");class SourceMapConsumer$2{constructor(aSourceMap,aSourceMapURL){// If the constructor was called by super(), just return Promise<this>.
+  // Yes, this is a hack to retain the pre-existing API of the base-class
+  // constructor also being an async factory function.
+  if(aSourceMap==INTERNAL){return Promise.resolve(this);}return _factory(aSourceMap,aSourceMapURL);}static initialize(opts){readWasm.initialize(opts["lib/mappings.wasm"]);}static fromSourceMap(aSourceMap,aSourceMapURL){return _factoryBSM(aSourceMap,aSourceMapURL);}/**
+  	   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+  	   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+  	   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+  	   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+  	   * value.
+  	   *
+  	   * You must not use the consumer after `f` completes!
+  	   *
+  	   * By using `with`, you do not have to remember to manually call `destroy` on
+  	   * the consumer, since it will be called automatically once `f` completes.
+  	   *
+  	   * ```js
+  	   * const xSquared = await SourceMapConsumer.with(
+  	   *   myRawSourceMap,
+  	   *   null,
+  	   *   async function (consumer) {
+  	   *     // Use `consumer` inside here and don't worry about remembering
+  	   *     // to call `destroy`.
+  	   *
+  	   *     const x = await whatever(consumer);
+  	   *     return x * x;
+  	   *   }
+  	   * );
+  	   *
+  	   * // You may not use that `consumer` anymore out here; it has
+  	   * // been destroyed. But you can use `xSquared`.
+  	   * console.log(xSquared);
+  	   * ```
+  	   */static with(rawSourceMap,sourceMapUrl,f){// Note: The `acorn` version that `webpack` currently depends on doesn't
+  // support `async` functions, and the nodes that we support don't all have
+  // `.finally`. Therefore, this is written a bit more convolutedly than it
+  // should really be.
+  let consumer=null;const promise=new SourceMapConsumer$2(rawSourceMap,sourceMapUrl);return promise.then(c=>{consumer=c;return f(c);}).then(x=>{if(consumer){consumer.destroy();}return x;},e=>{if(consumer){consumer.destroy();}throw e;});}/**
+  	   * Parse the mappings in a string in to a data structure which we can easily
+  	   * query (the ordered arrays in the `this.__generatedMappings` and
+  	   * `this.__originalMappings` properties).
+  	   */_parseMappings(aStr,aSourceRoot){throw new Error("Subclasses must implement _parseMappings");}/**
+  	   * Iterate over each mapping between an original source/line/column and a
+  	   * generated line/column in this source map.
+  	   *
+  	   * @param Function aCallback
+  	   *        The function that is called with each mapping.
+  	   * @param Object aContext
+  	   *        Optional. If specified, this object will be the value of `this` every
+  	   *        time that `aCallback` is called.
+  	   * @param aOrder
+  	   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+  	   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+  	   *        iterate over the mappings sorted by the generated file's line/column
+  	   *        order or the original's source/line/column order, respectively. Defaults to
+  	   *        `SourceMapConsumer.GENERATED_ORDER`.
+  	   */eachMapping(aCallback,aContext,aOrder){throw new Error("Subclasses must implement eachMapping");}/**
+  	   * Returns all generated line and column information for the original source,
+  	   * line, and column provided. If no column is provided, returns all mappings
+  	   * corresponding to a either the line we are searching for or the next
+  	   * closest line that has any mappings. Otherwise, returns all mappings
+  	   * corresponding to the given line and either the column we are searching for
+  	   * or the next closest column that has any offsets.
+  	   *
+  	   * The only argument is an object with the following properties:
+  	   *
+  	   *   - source: The filename of the original source.
+  	   *   - line: The line number in the original source.  The line number is 1-based.
+  	   *   - column: Optional. the column number in the original source.
+  	   *    The column number is 0-based.
+  	   *
+  	   * and an array of objects is returned, each with the following properties:
+  	   *
+  	   *   - line: The line number in the generated source, or null.  The
+  	   *    line number is 1-based.
+  	   *   - column: The column number in the generated source, or null.
+  	   *    The column number is 0-based.
+  	   */allGeneratedPositionsFor(aArgs){throw new Error("Subclasses must implement allGeneratedPositionsFor");}destroy(){throw new Error("Subclasses must implement destroy");}}/**
+  	 * The version of the source mapping spec that we are consuming.
+  	 */SourceMapConsumer$2.prototype._version=3;SourceMapConsumer$2.GENERATED_ORDER=1;SourceMapConsumer$2.ORIGINAL_ORDER=2;SourceMapConsumer$2.GREATEST_LOWER_BOUND=1;SourceMapConsumer$2.LEAST_UPPER_BOUND=2;/**
+  	 * A BasicSourceMapConsumer instance represents a parsed source map which we can
+  	 * query for information about the original file positions by giving it a file
+  	 * position in the generated source.
+  	 *
+  	 * The first parameter is the raw source map (either as a JSON string, or
+  	 * already parsed to an object). According to the spec, source maps have the
+  	 * following attributes:
+  	 *
+  	 *   - version: Which version of the source map spec this map is following.
+  	 *   - sources: An array of URLs to the original source files.
+  	 *   - names: An array of identifiers which can be referenced by individual mappings.
+  	 *   - sourceRoot: Optional. The URL root from which all sources are relative.
+  	 *   - sourcesContent: Optional. An array of contents of the original source files.
+  	 *   - mappings: A string of base64 VLQs which contain the actual mappings.
+  	 *   - file: Optional. The generated file this source map is associated with.
+  	 *
+  	 * Here is an example source map, taken from the source map spec[0]:
+  	 *
+  	 *     {
+  	 *       version : 3,
+  	 *       file: "out.js",
+  	 *       sourceRoot : "",
+  	 *       sources: ["foo.js", "bar.js"],
+  	 *       names: ["src", "maps", "are", "fun"],
+  	 *       mappings: "AA,AB;;ABCDE;"
+  	 *     }
+  	 *
+  	 * The second parameter, if given, is a string whose value is the URL
+  	 * at which the source map was found.  This URL is used to compute the
+  	 * sources array.
+  	 *
+  	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+  	 */class BasicSourceMapConsumer$1 extends SourceMapConsumer$2{constructor(aSourceMap,aSourceMapURL){return super(INTERNAL).then(that=>{let sourceMap=aSourceMap;if(typeof aSourceMap==="string"){sourceMap=util$2.parseSourceMapInput(aSourceMap);}const version=util$2.getArg(sourceMap,"version");let sources=util$2.getArg(sourceMap,"sources");// Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+  // requires the array) to play nice here.
+  const names=util$2.getArg(sourceMap,"names",[]);let sourceRoot=util$2.getArg(sourceMap,"sourceRoot",null);const sourcesContent=util$2.getArg(sourceMap,"sourcesContent",null);const mappings=util$2.getArg(sourceMap,"mappings");const file=util$2.getArg(sourceMap,"file",null);// Once again, Sass deviates from the spec and supplies the version as a
+  // string rather than a number, so we use loose equality checking here.
+  if(version!=that._version){throw new Error("Unsupported version: "+version);}if(sourceRoot){sourceRoot=util$2.normalize(sourceRoot);}sources=sources.map(String)// Some source maps produce relative source paths like "./foo.js" instead of
+  // "foo.js".  Normalize these first so that future comparisons will succeed.
+  // See bugzil.la/1090768.
+  .map(util$2.normalize)// Always ensure that absolute sources are internally stored relative to
+  // the source root, if the source root is absolute. Not doing this would
+  // be particularly problematic when the source root is a prefix of the
+  // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+  .map(function(source){return sourceRoot&&util$2.isAbsolute(sourceRoot)&&util$2.isAbsolute(source)?util$2.relative(sourceRoot,source):source;});// Pass `true` below to allow duplicate names and sources. While source maps
+  // are intended to be compressed and deduplicated, the TypeScript compiler
+  // sometimes generates source maps with duplicates in them. See Github issue
+  // #72 and bugzil.la/889492.
+  that._names=ArraySet$5.fromArray(names.map(String),true);that._sources=ArraySet$5.fromArray(sources,true);that._absoluteSources=that._sources.toArray().map(function(s){return util$2.computeSourceURL(sourceRoot,s,aSourceMapURL);});that.sourceRoot=sourceRoot;that.sourcesContent=sourcesContent;that._mappings=mappings;that._sourceMapURL=aSourceMapURL;that.file=file;that._computedColumnSpans=false;that._mappingsPtr=0;that._wasm=null;return wasm().then(w=>{that._wasm=w;return that;});});}/**
+  	   * Utility function to find the index of a source.  Returns -1 if not
+  	   * found.
+  	   */_findSourceIndex(aSource){let relativeSource=aSource;if(this.sourceRoot!=null){relativeSource=util$2.relative(this.sourceRoot,relativeSource);}if(this._sources.has(relativeSource)){return this._sources.indexOf(relativeSource);}// Maybe aSource is an absolute URL as returned by |sources|.  In
+  // this case we can't simply undo the transform.
+  for(let i=0;i<this._absoluteSources.length;++i){if(this._absoluteSources[i]==aSource){return i;}}return -1;}/**
+  	   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+  	   *
+  	   * @param SourceMapGenerator aSourceMap
+  	   *        The source map that will be consumed.
+  	   * @param String aSourceMapURL
+  	   *        The URL at which the source map can be found (optional)
+  	   * @returns BasicSourceMapConsumer
+  	   */static fromSourceMap(aSourceMap,aSourceMapURL){return new BasicSourceMapConsumer$1(aSourceMap.toString());}get sources(){return this._absoluteSources.slice();}_getMappingsPtr(){if(this._mappingsPtr===0){this._parseMappings(this._mappings,this.sourceRoot);}return this._mappingsPtr;}/**
+  	   * Parse the mappings in a string in to a data structure which we can easily
+  	   * query (the ordered arrays in the `this.__generatedMappings` and
+  	   * `this.__originalMappings` properties).
+  	   */_parseMappings(aStr,aSourceRoot){const size=aStr.length;const mappingsBufPtr=this._wasm.exports.allocate_mappings(size);const mappingsBuf=new Uint8Array(this._wasm.exports.memory.buffer,mappingsBufPtr,size);for(let i=0;i<size;i++){mappingsBuf[i]=aStr.charCodeAt(i);}const mappingsPtr=this._wasm.exports.parse_mappings(mappingsBufPtr);if(!mappingsPtr){const error=this._wasm.exports.get_last_error();let msg=`Error parsing mappings (code ${error}): `;// XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+  switch(error){case 1:msg+="the mappings contained a negative line, column, source index, or name index";break;case 2:msg+="the mappings contained a number larger than 2**32";break;case 3:msg+="reached EOF while in the middle of parsing a VLQ";break;case 4:msg+="invalid base 64 character while parsing a VLQ";break;default:msg+="unknown error code";break;}throw new Error(msg);}this._mappingsPtr=mappingsPtr;}eachMapping(aCallback,aContext,aOrder){const context=aContext||null;const order=aOrder||SourceMapConsumer$2.GENERATED_ORDER;const sourceRoot=this.sourceRoot;this._wasm.withMappingCallback(mapping=>{if(mapping.source!==null){mapping.source=this._sources.at(mapping.source);mapping.source=util$2.computeSourceURL(sourceRoot,mapping.source,this._sourceMapURL);if(mapping.name!==null){mapping.name=this._names.at(mapping.name);}}aCallback.call(context,mapping);},()=>{switch(order){case SourceMapConsumer$2.GENERATED_ORDER:this._wasm.exports.by_generated_location(this._getMappingsPtr());break;case SourceMapConsumer$2.ORIGINAL_ORDER:this._wasm.exports.by_original_location(this._getMappingsPtr());break;default:throw new Error("Unknown order of iteration.");}});}allGeneratedPositionsFor(aArgs){let source=util$2.getArg(aArgs,"source");const originalLine=util$2.getArg(aArgs,"line");const originalColumn=aArgs.column||0;source=this._findSourceIndex(source);if(source<0){return [];}if(originalLine<1){throw new Error("Line numbers must be >= 1");}if(originalColumn<0){throw new Error("Column numbers must be >= 0");}const mappings=[];this._wasm.withMappingCallback(m=>{let lastColumn=m.lastGeneratedColumn;if(this._computedColumnSpans&&lastColumn===null){lastColumn=Infinity;}mappings.push({line:m.generatedLine,column:m.generatedColumn,lastColumn});},()=>{this._wasm.exports.all_generated_locations_for(this._getMappingsPtr(),source,originalLine-1,"column"in aArgs,originalColumn);});return mappings;}destroy(){if(this._mappingsPtr!==0){this._wasm.exports.free_mappings(this._mappingsPtr);this._mappingsPtr=0;}}/**
+  	   * Compute the last column for each generated mapping. The last column is
+  	   * inclusive.
+  	   */computeColumnSpans(){if(this._computedColumnSpans){return;}this._wasm.exports.compute_column_spans(this._getMappingsPtr());this._computedColumnSpans=true;}/**
+  	   * Returns the original source, line, and column information for the generated
+  	   * source's line and column positions provided. The only argument is an object
+  	   * with the following properties:
+  	   *
+  	   *   - line: The line number in the generated source.  The line number
+  	   *     is 1-based.
+  	   *   - column: The column number in the generated source.  The column
+  	   *     number is 0-based.
+  	   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+  	   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	   *     closest element that is smaller than or greater than the one we are
+  	   *     searching for, respectively, if the exact element cannot be found.
+  	   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+  	   *
+  	   * and an object is returned with the following properties:
+  	   *
+  	   *   - source: The original source file, or null.
+  	   *   - line: The line number in the original source, or null.  The
+  	   *     line number is 1-based.
+  	   *   - column: The column number in the original source, or null.  The
+  	   *     column number is 0-based.
+  	   *   - name: The original identifier, or null.
+  	   */originalPositionFor(aArgs){const needle={generatedLine:util$2.getArg(aArgs,"line"),generatedColumn:util$2.getArg(aArgs,"column")};if(needle.generatedLine<1){throw new Error("Line numbers must be >= 1");}if(needle.generatedColumn<0){throw new Error("Column numbers must be >= 0");}let bias=util$2.getArg(aArgs,"bias",SourceMapConsumer$2.GREATEST_LOWER_BOUND);if(bias==null){bias=SourceMapConsumer$2.GREATEST_LOWER_BOUND;}let mapping;this._wasm.withMappingCallback(m=>mapping=m,()=>{this._wasm.exports.original_location_for(this._getMappingsPtr(),needle.generatedLine-1,needle.generatedColumn,bias);});if(mapping){if(mapping.generatedLine===needle.generatedLine){let source=util$2.getArg(mapping,"source",null);if(source!==null){source=this._sources.at(source);source=util$2.computeSourceURL(this.sourceRoot,source,this._sourceMapURL);}let name=util$2.getArg(mapping,"name",null);if(name!==null){name=this._names.at(name);}return {source,line:util$2.getArg(mapping,"originalLine",null),column:util$2.getArg(mapping,"originalColumn",null),name};}}return {source:null,line:null,column:null,name:null};}/**
+  	   * Return true if we have the source content for every source in the source
+  	   * map, false otherwise.
+  	   */hasContentsOfAllSources(){if(!this.sourcesContent){return false;}return this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(sc){return sc==null;});}/**
+  	   * Returns the original source content. The only argument is the url of the
+  	   * original source file. Returns null if no original source content is
+  	   * available.
+  	   */sourceContentFor(aSource,nullOnMissing){if(!this.sourcesContent){return null;}const index=this._findSourceIndex(aSource);if(index>=0){return this.sourcesContent[index];}let relativeSource=aSource;if(this.sourceRoot!=null){relativeSource=util$2.relative(this.sourceRoot,relativeSource);}let url;if(this.sourceRoot!=null&&(url=util$2.urlParse(this.sourceRoot))){// XXX: file:// URIs and absolute paths lead to unexpected behavior for
+  // many users. We can help them out when they expect file:// URIs to
+  // behave like it would if they were running a local HTTP server. See
+  // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+  const fileUriAbsPath=relativeSource.replace(/^file:\/\//,"");if(url.scheme=="file"&&this._sources.has(fileUriAbsPath)){return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];}if((!url.path||url.path=="/")&&this._sources.has("/"+relativeSource)){return this.sourcesContent[this._sources.indexOf("/"+relativeSource)];}}// This function is used recursively from
+  // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+  // don't want to throw if we can't find the source - we just want to
+  // return null, so we provide a flag to exit gracefully.
+  if(nullOnMissing){return null;}throw new Error('"'+relativeSource+'" is not in the SourceMap.');}/**
+  	   * Returns the generated line and column information for the original source,
+  	   * line, and column positions provided. The only argument is an object with
+  	   * the following properties:
+  	   *
+  	   *   - source: The filename of the original source.
+  	   *   - line: The line number in the original source.  The line number
+  	   *     is 1-based.
+  	   *   - column: The column number in the original source.  The column
+  	   *     number is 0-based.
+  	   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+  	   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+  	   *     closest element that is smaller than or greater than the one we are
+  	   *     searching for, respectively, if the exact element cannot be found.
+  	   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+  	   *
+  	   * and an object is returned with the following properties:
+  	   *
+  	   *   - line: The line number in the generated source, or null.  The
+  	   *     line number is 1-based.
+  	   *   - column: The column number in the generated source, or null.
+  	   *     The column number is 0-based.
+  	   */generatedPositionFor(aArgs){let source=util$2.getArg(aArgs,"source");source=this._findSourceIndex(source);if(source<0){return {line:null,column:null,lastColumn:null};}const needle={source,originalLine:util$2.getArg(aArgs,"line"),originalColumn:util$2.getArg(aArgs,"column")};if(needle.originalLine<1){throw new Error("Line numbers must be >= 1");}if(needle.originalColumn<0){throw new Error("Column numbers must be >= 0");}let bias=util$2.getArg(aArgs,"bias",SourceMapConsumer$2.GREATEST_LOWER_BOUND);if(bias==null){bias=SourceMapConsumer$2.GREATEST_LOWER_BOUND;}let mapping;this._wasm.withMappingCallback(m=>mapping=m,()=>{this._wasm.exports.generated_location_for(this._getMappingsPtr(),needle.source,needle.originalLine-1,needle.originalColumn,bias);});if(mapping){if(mapping.source===needle.source){let lastColumn=mapping.lastGeneratedColumn;if(this._computedColumnSpans&&lastColumn===null){lastColumn=Infinity;}return {line:util$2.getArg(mapping,"generatedLine",null),column:util$2.getArg(mapping,"generatedColumn",null),lastColumn};}}return {line:null,column:null,lastColumn:null};}}BasicSourceMapConsumer$1.prototype.consumer=SourceMapConsumer$2;/**
+  	 * An IndexedSourceMapConsumer instance represents a parsed source map which
+  	 * we can query for information. It differs from BasicSourceMapConsumer in
+  	 * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+  	 * input.
+  	 *
+  	 * The first parameter is a raw source map (either as a JSON string, or already
+  	 * parsed to an object). According to the spec for indexed source maps, they
+  	 * have the following attributes:
+  	 *
+  	 *   - version: Which version of the source map spec this map is following.
+  	 *   - file: Optional. The generated file this source map is associated with.
+  	 *   - sections: A list of section definitions.
+  	 *
+  	 * Each value under the "sections" field has two fields:
+  	 *   - offset: The offset into the original specified at which this section
+  	 *       begins to apply, defined as an object with a "line" and "column"
+  	 *       field.
+  	 *   - map: A source map definition. This source map could also be indexed,
+  	 *       but doesn't have to be.
+  	 *
+  	 * Instead of the "map" field, it's also possible to have a "url" field
+  	 * specifying a URL to retrieve a source map from, but that's currently
+  	 * unsupported.
+  	 *
+  	 * Here's an example source map, taken from the source map spec[0], but
+  	 * modified to omit a section which uses the "url" field.
+  	 *
+  	 *  {
+  	 *    version : 3,
+  	 *    file: "app.js",
+  	 *    sections: [{
+  	 *      offset: {line:100, column:10},
+  	 *      map: {
+  	 *        version : 3,
+  	 *        file: "section.js",
+  	 *        sources: ["foo.js", "bar.js"],
+  	 *        names: ["src", "maps", "are", "fun"],
+  	 *        mappings: "AAAA,E;;ABCDE;"
+  	 *      }
+  	 *    }],
+  	 *  }
+  	 *
+  	 * The second parameter, if given, is a string whose value is the URL
+  	 * at which the source map was found.  This URL is used to compute the
+  	 * sources array.
+  	 *
+  	 * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+  	 */class IndexedSourceMapConsumer$1 extends SourceMapConsumer$2{constructor(aSourceMap,aSourceMapURL){return super(INTERNAL).then(that=>{let sourceMap=aSourceMap;if(typeof aSourceMap==="string"){sourceMap=util$2.parseSourceMapInput(aSourceMap);}const version=util$2.getArg(sourceMap,"version");const sections=util$2.getArg(sourceMap,"sections");if(version!=that._version){throw new Error("Unsupported version: "+version);}that._sources=new ArraySet$5();that._names=new ArraySet$5();that.__generatedMappings=null;that.__originalMappings=null;that.__generatedMappingsUnsorted=null;that.__originalMappingsUnsorted=null;let lastOffset={line:-1,column:0};return Promise.all(sections.map(s=>{if(s.url){// The url field will require support for asynchronicity.
+  // See https://github.com/mozilla/source-map/issues/16
+  throw new Error("Support for url field in sections not implemented.");}const offset=util$2.getArg(s,"offset");const offsetLine=util$2.getArg(offset,"line");const offsetColumn=util$2.getArg(offset,"column");if(offsetLine<lastOffset.line||offsetLine===lastOffset.line&&offsetColumn<lastOffset.column){throw new Error("Section offsets must be ordered and non-overlapping.");}lastOffset=offset;const cons=new SourceMapConsumer$2(util$2.getArg(s,"map"),aSourceMapURL);return cons.then(consumer=>{return {generatedOffset:{// The offset fields are 0-based, but we use 1-based indices when
+  // encoding/decoding from VLQ.
+  generatedLine:offsetLine+1,generatedColumn:offsetColumn+1},consumer};});})).then(s=>{that._sections=s;return that;});});}// `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  get _generatedMappings(){if(!this.__generatedMappings){this._sortGeneratedMappings();}return this.__generatedMappings;}get _originalMappings(){if(!this.__originalMappings){this._sortOriginalMappings();}return this.__originalMappings;}get _generatedMappingsUnsorted(){if(!this.__generatedMappingsUnsorted){this._parseMappings(this._mappings,this.sourceRoot);}return this.__generatedMappingsUnsorted;}get _originalMappingsUnsorted(){if(!this.__originalMappingsUnsorted){this._parseMappings(this._mappings,this.sourceRoot);}return this.__originalMappingsUnsorted;}_sortGeneratedMappings(){const mappings=this._generatedMappingsUnsorted;mappings.sort(util$2.compareByGeneratedPositionsDeflated);this.__generatedMappings=mappings;}_sortOriginalMappings(){const mappings=this._originalMappingsUnsorted;mappings.sort(util$2.compareByOriginalPositions);this.__originalMappings=mappings;}/**
+  	   * The list of original sources.
+  	   */get sources(){const sources=[];for(let i=0;i<this._sections.length;i++){for(let j=0;j<this._sections[i].consumer.sources.length;j++){sources.push(this._sections[i].consumer.sources[j]);}}return sources;}/**
+  	   * Returns the original source, line, and column information for the generated
+  	   * source's line and column positions provided. The only argument is an object
+  	   * with the following properties:
+  	   *
+  	   *   - line: The line number in the generated source.  The line number
+  	   *     is 1-based.
+  	   *   - column: The column number in the generated source.  The column
+  	   *     number is 0-based.
+  	   *
+  	   * and an object is returned with the following properties:
+  	   *
+  	   *   - source: The original source file, or null.
+  	   *   - line: The line number in the original source, or null.  The
+  	   *     line number is 1-based.
+  	   *   - column: The column number in the original source, or null.  The
+  	   *     column number is 0-based.
+  	   *   - name: The original identifier, or null.
+  	   */originalPositionFor(aArgs){const needle={generatedLine:util$2.getArg(aArgs,"line"),generatedColumn:util$2.getArg(aArgs,"column")};// Find the section containing the generated position we're trying to map
+  // to an original position.
+  const sectionIndex=binarySearch$1.search(needle,this._sections,function(aNeedle,section){const cmp=aNeedle.generatedLine-section.generatedOffset.generatedLine;if(cmp){return cmp;}return aNeedle.generatedColumn-section.generatedOffset.generatedColumn;});const section=this._sections[sectionIndex];if(!section){return {source:null,line:null,column:null,name:null};}return section.consumer.originalPositionFor({line:needle.generatedLine-(section.generatedOffset.generatedLine-1),column:needle.generatedColumn-(section.generatedOffset.generatedLine===needle.generatedLine?section.generatedOffset.generatedColumn-1:0),bias:aArgs.bias});}/**
+  	   * Return true if we have the source content for every source in the source
+  	   * map, false otherwise.
+  	   */hasContentsOfAllSources(){return this._sections.every(function(s){return s.consumer.hasContentsOfAllSources();});}/**
+  	   * Returns the original source content. The only argument is the url of the
+  	   * original source file. Returns null if no original source content is
+  	   * available.
+  	   */sourceContentFor(aSource,nullOnMissing){for(let i=0;i<this._sections.length;i++){const section=this._sections[i];const content=section.consumer.sourceContentFor(aSource,true);if(content){return content;}}if(nullOnMissing){return null;}throw new Error('"'+aSource+'" is not in the SourceMap.');}/**
+  	   * Returns the generated line and column information for the original source,
+  	   * line, and column positions provided. The only argument is an object with
+  	   * the following properties:
+  	   *
+  	   *   - source: The filename of the original source.
+  	   *   - line: The line number in the original source.  The line number
+  	   *     is 1-based.
+  	   *   - column: The column number in the original source.  The column
+  	   *     number is 0-based.
+  	   *
+  	   * and an object is returned with the following properties:
+  	   *
+  	   *   - line: The line number in the generated source, or null.  The
+  	   *     line number is 1-based.
+  	   *   - column: The column number in the generated source, or null.
+  	   *     The column number is 0-based.
+  	   */generatedPositionFor(aArgs){for(let i=0;i<this._sections.length;i++){const section=this._sections[i];// Only consider this section if the requested source is in the list of
+  // sources of the consumer.
+  if(section.consumer._findSourceIndex(util$2.getArg(aArgs,"source"))===-1){continue;}const generatedPosition=section.consumer.generatedPositionFor(aArgs);if(generatedPosition){const ret={line:generatedPosition.line+(section.generatedOffset.generatedLine-1),column:generatedPosition.column+(section.generatedOffset.generatedLine===generatedPosition.line?section.generatedOffset.generatedColumn-1:0)};return ret;}}return {line:null,column:null};}/**
+  	   * Parse the mappings in a string in to a data structure which we can easily
+  	   * query (the ordered arrays in the `this.__generatedMappings` and
+  	   * `this.__originalMappings` properties).
+  	   */_parseMappings(aStr,aSourceRoot){const generatedMappings=this.__generatedMappingsUnsorted=[];const originalMappings=this.__originalMappingsUnsorted=[];for(let i=0;i<this._sections.length;i++){const section=this._sections[i];const sectionMappings=[];section.consumer.eachMapping(m=>sectionMappings.push(m));for(let j=0;j<sectionMappings.length;j++){const mapping=sectionMappings[j];// TODO: test if null is correct here.  The original code used
+  // `source`, which would actually have gotten used as null because
+  // var's get hoisted.
+  // See: https://github.com/mozilla/source-map/issues/333
+  let source=util$2.computeSourceURL(section.consumer.sourceRoot,null,this._sourceMapURL);this._sources.add(source);source=this._sources.indexOf(source);let name=null;if(mapping.name){this._names.add(mapping.name);name=this._names.indexOf(mapping.name);}// The mappings coming from the consumer for the section have
+  // generated positions relative to the start of the section, so we
+  // need to offset them to be relative to the start of the concatenated
+  // generated file.
+  const adjustedMapping={source,generatedLine:mapping.generatedLine+(section.generatedOffset.generatedLine-1),generatedColumn:mapping.generatedColumn+(section.generatedOffset.generatedLine===mapping.generatedLine?section.generatedOffset.generatedColumn-1:0),originalLine:mapping.originalLine,originalColumn:mapping.originalColumn,name};generatedMappings.push(adjustedMapping);if(typeof adjustedMapping.originalLine==="number"){originalMappings.push(adjustedMapping);}}}}eachMapping(aCallback,aContext,aOrder){const context=aContext||null;const order=aOrder||SourceMapConsumer$2.GENERATED_ORDER;let mappings;switch(order){case SourceMapConsumer$2.GENERATED_ORDER:mappings=this._generatedMappings;break;case SourceMapConsumer$2.ORIGINAL_ORDER:mappings=this._originalMappings;break;default:throw new Error("Unknown order of iteration.");}const sourceRoot=this.sourceRoot;mappings.map(function(mapping){let source=null;if(mapping.source!==null){source=this._sources.at(mapping.source);source=util$2.computeSourceURL(sourceRoot,source,this._sourceMapURL);}return {source,generatedLine:mapping.generatedLine,generatedColumn:mapping.generatedColumn,originalLine:mapping.originalLine,originalColumn:mapping.originalColumn,name:mapping.name===null?null:this._names.at(mapping.name)};},this).forEach(aCallback,context);}/**
+  	   * Find the mapping that best matches the hypothetical "needle" mapping that
+  	   * we are searching for in the given "haystack" of mappings.
+  	   */_findMapping(aNeedle,aMappings,aLineName,aColumnName,aComparator,aBias){// To return the position we are searching for, we must first find the
+  // mapping for the given position and then return the opposite position it
+  // points to. Because the mappings are sorted, we can use binary search to
+  // find the best mapping.
+  if(aNeedle[aLineName]<=0){throw new TypeError("Line must be greater than or equal to 1, got "+aNeedle[aLineName]);}if(aNeedle[aColumnName]<0){throw new TypeError("Column must be greater than or equal to 0, got "+aNeedle[aColumnName]);}return binarySearch$1.search(aNeedle,aMappings,aComparator,aBias);}allGeneratedPositionsFor(aArgs){const line=util$2.getArg(aArgs,"line");// When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+  // returns the index of the closest mapping less than the needle. By
+  // setting needle.originalColumn to 0, we thus find the last mapping for
+  // the given line, provided such a mapping exists.
+  const needle={source:util$2.getArg(aArgs,"source"),originalLine:line,originalColumn:util$2.getArg(aArgs,"column",0)};needle.source=this._findSourceIndex(needle.source);if(needle.source<0){return [];}if(needle.originalLine<1){throw new Error("Line numbers must be >= 1");}if(needle.originalColumn<0){throw new Error("Column numbers must be >= 0");}const mappings=[];let index=this._findMapping(needle,this._originalMappings,"originalLine","originalColumn",util$2.compareByOriginalPositions,binarySearch$1.LEAST_UPPER_BOUND);if(index>=0){let mapping=this._originalMappings[index];if(aArgs.column===undefined){const originalLine=mapping.originalLine;// Iterate until either we run out of mappings, or we run into
+  // a mapping for a different line than the one we found. Since
+  // mappings are sorted, this is guaranteed to find all mappings for
+  // the line we found.
+  while(mapping&&mapping.originalLine===originalLine){let lastColumn=mapping.lastGeneratedColumn;if(this._computedColumnSpans&&lastColumn===null){lastColumn=Infinity;}mappings.push({line:util$2.getArg(mapping,"generatedLine",null),column:util$2.getArg(mapping,"generatedColumn",null),lastColumn});mapping=this._originalMappings[++index];}}else{const originalColumn=mapping.originalColumn;// Iterate until either we run out of mappings, or we run into
+  // a mapping for a different line than the one we were searching for.
+  // Since mappings are sorted, this is guaranteed to find all mappings for
+  // the line we are searching for.
+  while(mapping&&mapping.originalLine===line&&mapping.originalColumn==originalColumn){let lastColumn=mapping.lastGeneratedColumn;if(this._computedColumnSpans&&lastColumn===null){lastColumn=Infinity;}mappings.push({line:util$2.getArg(mapping,"generatedLine",null),column:util$2.getArg(mapping,"generatedColumn",null),lastColumn});mapping=this._originalMappings[++index];}}}return mappings;}destroy(){for(let i=0;i<this._sections.length;i++){this._sections[i].consumer.destroy();}}}/*
+  	 * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+  	 * where it has access to non-hoisted classes, but it gets hoisted itself.
+  	 */function _factory(aSourceMap,aSourceMapURL){let sourceMap=aSourceMap;if(typeof aSourceMap==="string"){sourceMap=util$2.parseSourceMapInput(aSourceMap);}const consumer=sourceMap.sections!=null?new IndexedSourceMapConsumer$1(sourceMap,aSourceMapURL):new BasicSourceMapConsumer$1(sourceMap,aSourceMapURL);return Promise.resolve(consumer);}function _factoryBSM(aSourceMap,aSourceMapURL){return BasicSourceMapConsumer$1.fromSourceMap(aSourceMap,aSourceMapURL);}/*
+  	 * Copyright 2009-2011 Mozilla Foundation and contributors
+  	 * Licensed under the New BSD license. See LICENSE.txt or:
+  	 * http://opensource.org/licenses/BSD-3-Clause
+  	 */var SourceMapGenerator$4=sourceMapGenerator$1.SourceMapGenerator;/**
+  	 * Create a new sourcemap generator
+  	 * @param   { Object } options - sourcemap options
+  	 * @returns { SourceMapGenerator } SourceMapGenerator instance
+  	 */function createSourcemap(options){return new SourceMapGenerator$4(options);}const Output=Object.freeze({code:'',ast:[],meta:{},map:null});/**
+  	 * Create the right output data result of a parsing
+  	 * @param   { Object } data - output data
+  	 * @param   { string } data.code - code generated
+  	 * @param   { AST } data.ast - ast representing the code
+  	 * @param   { SourceMapGenerator } data.map - source map generated along with the code
+  	 * @param   { Object } meta - compilation meta infomration
+  	 * @returns { Output } output container object
+  	 */function createOutput(data,meta){const output=Object.assign({},Output,{},data,{meta});if(!output.map&&meta&&meta.options&&meta.options.file)return Object.assign({},output,{map:createSourcemap({file:meta.options.file})});return output;}/**
+  	 * Transform the source code received via a compiler function
+  	 * @param   { Function } compiler - function needed to generate the output code
+  	 * @param   { Object } meta - compilation meta information
+  	 * @param   { string } source - source code
+  	 * @returns { Output } output - the result of the compiler
+  	 */function transform(compiler,meta,source){const result=compiler?compiler(source,meta):{code:source};return createOutput(result,meta);}/**
+  	 * Throw an error with a descriptive message
+  	 * @param   { string } message - error message
+  	 * @returns { undefined } hoppla.. at this point the program should stop working
+  	 */function panic(message){throw new Error(message);}const postprocessors=new Set();/**
+  	 * Register a postprocessor that will be used after the parsing and compilation of the riot tags
+  	 * @param { Function } postprocessor - transformer that will receive the output code ans sourcemap
+  	 * @returns { Set } the postprocessors collection
+  	 */function register(postprocessor){if(postprocessors.has(postprocessor)){panic(`This postprocessor "${postprocessor.name||postprocessor.toString()}" was already registered`);}postprocessors.add(postprocessor);return postprocessors;}/**
+  	 * Exec all the postprocessors in sequence combining the sourcemaps generated
+  	 * @param   { Output } compilerOutput - output generated by the compiler
+  	 * @param   { Object } meta - compiling meta information
+  	 * @returns { Output } object containing output code and source map
+  	 */function execute(compilerOutput,meta){return Array.from(postprocessors).reduce(function(acc,postprocessor){const{code,map}=acc;const output=postprocessor(code,meta);return {code:output.code,map:composeSourcemaps(map,output.map)};},createOutput(compilerOutput,meta));}/**
+  	 * Parsers that can be registered by users to preparse components fragments
+  	 * @type { Object }
+  	 */const preprocessors=Object.freeze({javascript:new Map(),css:new Map(),template:new Map().set('default',code=>({code}))});// throw a processor type error
+  function preprocessorTypeError(type){panic(`No preprocessor of type "${type}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`);}// throw an error if the preprocessor was not registered
+  function preprocessorNameNotFoundError(name){panic(`No preprocessor named "${name}" was found, are you sure you have registered it?'`);}/**
+  	 * Register a custom preprocessor
+  	 * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+  	 * @param   { string } name - unique preprocessor id
+  	 * @param   { Function } preprocessor - preprocessor function
+  	 * @returns { Map } - the preprocessors map
+  	 */function register$1(type,name,preprocessor){if(!type)panic('Please define the type of preprocessor you want to register \'javascript\', \'css\' or \'template\'');if(!name)panic('Please define a name for your preprocessor');if(!preprocessor)panic('Please provide a preprocessor function');if(!preprocessors[type])preprocessorTypeError(type);if(preprocessors[type].has(name))panic(`The preprocessor ${name} was already registered before`);preprocessors[type].set(name,preprocessor);return preprocessors;}/**
+  	 * Exec the compilation of a preprocessor
+  	 * @param   { string } type - preprocessor type either 'js', 'css' or 'template'
+  	 * @param   { string } name - unique preprocessor id
+  	 * @param   { Object } meta - preprocessor meta information
+  	 * @param   { string } source - source code
+  	 * @returns { Output } object containing a sourcemap and a code string
+  	 */function execute$1(type,name,meta,source){if(!preprocessors[type])preprocessorTypeError(type);if(!preprocessors[type].has(name))preprocessorNameNotFoundError(name);return transform(preprocessors[type].get(name),meta,source);}/**
+  	 * Similar to compose but performs from left-to-right function composition.<br/>
+  	 * {@link https://30secondsofcode.org/function#composeright see also}
+  	 * @param   {...[function]} fns) - list of unary function
+  	 * @returns {*} result of the computation
+  	 */ /**
+  	 * Performs right-to-left function composition.<br/>
+  	 * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+  	 * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+  	 * {@link https://30secondsofcode.org/function#compose original source code}
+  	 * @param   {...[function]} fns) - list of unary function
+  	 * @returns {*} result of the computation
+  	 */function compose(){for(var _len=arguments.length,fns=new Array(_len),_key=0;_key<_len;_key++){fns[_key]=arguments[_key];}return fns.reduce((f,g)=>function(){return f(g(...arguments));});}/*! https://mths.be/cssesc v3.0.0 by @mathias */var object={};var hasOwnProperty$1=object.hasOwnProperty;var merge=function merge(options,defaults){if(!options){return defaults;}var result={};for(var key in defaults){// `if (defaults.hasOwnProperty(key) { … }` is not needed here, since
+  // only recognized option names are used.
+  result[key]=hasOwnProperty$1.call(options,key)?options[key]:defaults[key];}return result;};var regexAnySingleEscape=/[ -,\.\/:-@\[-\^`\{-~]/;var regexSingleEscape=/[ -,\.\/:-@\[\]\^`\{-~]/;var regexExcessiveSpaces=/(^|\\+)?(\\[A-F0-9]{1,6})\x20(?![a-fA-F0-9\x20])/g;// https://mathiasbynens.be/notes/css-escapes#css
+  var cssesc=function cssesc(string,options){options=merge(options,cssesc.options);if(options.quotes!='single'&&options.quotes!='double'){options.quotes='single';}var quote=options.quotes=='double'?'"':'\'';var isIdentifier=options.isIdentifier;var firstChar=string.charAt(0);var output='';var counter=0;var length=string.length;while(counter<length){var character=string.charAt(counter++);var codePoint=character.charCodeAt();var value=void 0;// If it’s not a printable ASCII character…
+  if(codePoint<0x20||codePoint>0x7E){if(codePoint>=0xD800&&codePoint<=0xDBFF&&counter<length){// It’s a high surrogate, and there is a next character.
+  var extra=string.charCodeAt(counter++);if((extra&0xFC00)==0xDC00){// next character is low surrogate
+  codePoint=((codePoint&0x3FF)<<10)+(extra&0x3FF)+0x10000;}else{// It’s an unmatched surrogate; only append this code unit, in case
+  // the next code unit is the high surrogate of a surrogate pair.
+  counter--;}}value='\\'+codePoint.toString(16).toUpperCase()+' ';}else{if(options.escapeEverything){if(regexAnySingleEscape.test(character)){value='\\'+character;}else{value='\\'+codePoint.toString(16).toUpperCase()+' ';}}else if(/[\t\n\f\r\x0B]/.test(character)){value='\\'+codePoint.toString(16).toUpperCase()+' ';}else if(character=='\\'||!isIdentifier&&(character=='"'&&quote==character||character=='\''&&quote==character)||isIdentifier&&regexSingleEscape.test(character)){value='\\'+character;}else{value=character;}}output+=value;}if(isIdentifier){if(/^-[-\d]/.test(output)){output='\\-'+output.slice(1);}else if(/\d/.test(firstChar)){output='\\3'+firstChar+' '+output.slice(1);}}// Remove spaces after `\HEX` escapes that are not followed by a hex digit,
+  // since they’re redundant. Note that this is only possible if the escape
+  // sequence isn’t preceded by an odd number of backslashes.
+  output=output.replace(regexExcessiveSpaces,function($0,$1,$2){if($1&&$1.length%2){// It’s not safe to remove the space, so don’t.
+  return $0;}// Strip the space.
+  return ($1||'')+$2;});if(!isIdentifier&&options.wrap){return quote+output+quote;}return output;};// Expose default options (so they can be overridden globally).
+  cssesc.options={'escapeEverything':false,'isIdentifier':false,'quotes':'single','wrap':false};cssesc.version='3.0.0';var cssesc_1=cssesc;const ATTRIBUTE_TYPE_NAME='type';/**
+  	 * Get the type attribute from a node generated by the riot parser
+  	 * @param   { Object} sourceNode - riot parser node
+  	 * @returns { string|null } a valid type to identify the preprocessor to use or nothing
+  	 */function getPreprocessorTypeByAttribute(sourceNode){const typeAttribute=sourceNode.attributes?sourceNode.attributes.find(attribute=>attribute.name===ATTRIBUTE_TYPE_NAME):null;return typeAttribute?normalize(typeAttribute.value):null;}/**
+  	 * Remove the noise in case a user has defined the preprocessor type='text/scss'
+  	 * @param   { string } value - input string
+  	 * @returns { string } normalized string
+  	 */function normalize(value){return value.replace('text/','');}/**
+  	 * Preprocess a riot parser node
+  	 * @param   { string } preprocessorType - either css, js
+  	 * @param   { string } preprocessorName - preprocessor id
+  	 * @param   { Object } meta - compilation meta information
+  	 * @param   { RiotParser.nodeTypes } node - css node detected by the parser
+  	 * @returns { Output } code and sourcemap generated by the preprocessor
+  	 */function preprocess(preprocessorType,preprocessorName,meta,node){const code=node.text;return preprocessorName?execute$1(preprocessorType,preprocessorName,meta,code):{code};}/**
+  	 * Matches valid, multiline JavaScript comments in almost all its forms.
+  	 * @const {RegExp}
+  	 * @static
+  	 */const R_MLCOMMS=/\/\*[^*]*\*+(?:[^*/][^*]*\*+)*\//g;/**
+  	 * Source for creating regexes matching valid quoted, single-line JavaScript strings.
+  	 * It recognizes escape characters, including nested quotes and line continuation.
+  	 * @const {string}
+  	 */const S_LINESTR=/"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source;/**
+  	 * Matches CSS selectors, excluding those beginning with '@' and quoted strings.
+  	 * @const {RegExp}
+  	 */const CSS_SELECTOR=RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${S_LINESTR}`,'g');/**
+  	 * Parses styles enclosed in a "scoped" tag
+  	 * The "css" string is received without comments or surrounding spaces.
+  	 *
+  	 * @param   {string} tag - Tag name of the root element
+  	 * @param   {string} css - The CSS code
+  	 * @returns {string} CSS with the styles scoped to the root element
+  	 */function scopedCSS(tag,css){const host=':host';const selectorsBlacklist=['from','to'];return css.replace(CSS_SELECTOR,function(m,p1,p2){// skip quoted strings
+  if(!p2)return m;// we have a selector list, parse each individually
+  p2=p2.replace(/[^,]+/g,function(sel){const s=sel.trim();// skip selectors already using the tag name
+  if(s.indexOf(tag)===0){return sel;}// skips the keywords and percents of css animations
+  if(!s||selectorsBlacklist.indexOf(s)>-1||s.slice(-1)==='%'){return sel;}// replace the `:host` pseudo-selector, where it is, with the root tag name;
+  // if `:host` was not included, add the tag name as prefix, and mirror all
+  // `[data-is]`
+  if(s.indexOf(host)<0){return `${tag} ${s},[is="${tag}"] ${s}`;}else{return `${s.replace(host,tag)},${s.replace(host,`[is="${tag}"]`)}`;}});// add the danling bracket char and return the processed selector list
+  return p1?`${p1} ${p2}`:p2;});}/**
+  	 * Remove comments, compact and trim whitespace
+  	 * @param { string } code - compiled css code
+  	 * @returns { string } css code normalized
+  	 */function compactCss(code){return code.replace(R_MLCOMMS,'').replace(/\s+/g,' ').trim();}const escapeBackslashes=s=>s.replace(/\\/g,'\\\\');const escapeIdentifier=identifier=>escapeBackslashes(cssesc_1(identifier,{isIdentifier:true}));/**
+  	 * Generate the component css
+  	 * @param   { Object } sourceNode - node generated by the riot compiler
+  	 * @param   { string } source - original component source code
+  	 * @param   { Object } meta - compilation meta information
+  	 * @param   { AST } ast - current AST output
+  	 * @returns { AST } the AST generated
+  	 */function css(sourceNode,source,meta,ast){const preprocessorName=getPreprocessorTypeByAttribute(sourceNode);const{options}=meta;const preprocessorOutput=preprocess('css',preprocessorName,meta,sourceNode.text);const normalizedCssCode=compactCss(preprocessorOutput.code);const escapedCssIdentifier=escapeIdentifier(meta.tagName);const cssCode=(options.scopedCss?scopedCSS(escapedCssIdentifier,escapeBackslashes(normalizedCssCode)):escapeBackslashes(normalizedCssCode)).trim();types$1.visit(ast,{visitProperty(path){if(path.value.key.value===TAG_CSS_PROPERTY){path.value.value=builders.templateLiteral([builders.templateElement({raw:cssCode,cooked:''},false)],[]);return false;}this.traverse(path);}});return ast;}/**
+  	 * Function to curry any javascript method
+  	 * @param   {Function}  fn - the target function we want to curry
+  	 * @param   {...[args]} acc - initial arguments
+  	 * @returns {Function|*} it will return a function until the target function
+  	 *                       will receive all of its arguments
+  	 */function curry(fn){for(var _len2=arguments.length,acc=new Array(_len2>1?_len2-1:0),_key2=1;_key2<_len2;_key2++){acc[_key2-1]=arguments[_key2];}return function(){for(var _len3=arguments.length,args=new Array(_len3),_key3=0;_key3<_len3;_key3++){args[_key3]=arguments[_key3];}args=[...acc,...args];return args.length<fn.length?curry(fn,...args):fn(...args);};}/**
+  	 * Generate the javascript from an ast source
+  	 * @param   {AST} ast - ast object
+  	 * @param   {Object} options - printer options
+  	 * @returns {Object} code + map
+  	 */function generateJavascript(ast,options){return main_4$1(ast,Object.assign({},options,{tabWidth:2,quote:'single'}));}/**
+  	 * True if the sourcemap has no mappings, it is empty
+  	 * @param   {Object}  map - sourcemap json
+  	 * @returns {boolean} true if empty
+  	 */function isEmptySourcemap(map){return !map||!map.mappings||!map.mappings.length;}const LINES_RE=/\r\n?|\n/g;/**
+  	 * Split a string into a rows array generated from its EOL matches
+  	 * @param   { string } string [description]
+  	 * @returns { Array } array containing all the string rows
+  	 */function splitStringByEOL(string){return string.split(LINES_RE);}/**
+  	 * Get the line and the column of a source text based on its position in the string
+  	 * @param   { string } string - target string
+  	 * @param   { number } position - target position
+  	 * @returns { Object } object containing the source text line and column
+  	 */function getLineAndColumnByPosition(string,position){const lines=splitStringByEOL(string.slice(0,position));return {line:lines.length,column:lines[lines.length-1].length};}/**
+  	 * Add the offset to the code that must be parsed in order to generate properly the sourcemaps
+  	 * @param {string} input - input string
+  	 * @param {string} source - original source code
+  	 * @param {RiotParser.Node} node - node that we are going to transform
+  	 * @return {string} the input string with the offset properly set
+  	 */function addLineOffset(input,source,node){const{column,line}=getLineAndColumnByPosition(source,node.start);return `${'\n'.repeat(line-1)}${' '.repeat(column+1)}${input}`;}// Reserved word lists for various dialects of the language
+  var reservedWords={3:"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",5:"class enum extends super const export import",6:"enum",strict:"implements interface let package private protected public static yield",strictBind:"eval arguments"};// And the keywords
+  var ecma5AndLessKeywords="break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";var keywords={5:ecma5AndLessKeywords,"5module":ecma5AndLessKeywords+" export import",6:ecma5AndLessKeywords+" const class extends export import super"};var keywordRelationalOperator=/^in(stanceof)?$/;// ## Character categories
+  // Big ugly regular expressions that match characters in the
+  // whitespace, identifier, and identifier-start categories. These
+  // are only applied when a character is found to actually have a
+  // code point above 128.
+  // Generated by `bin/generate-identifier-regex.js`.
+  var nonASCIIidentifierStartChars="\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u08a0-\u08b4\u08b6-\u08bd\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\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\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fef\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7bf\ua7c2-\ua7c6\ua7f7-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab67\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";var nonASCIIidentifierChars="\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08d3-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1df9\u1dfb-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";var nonASCIIidentifierStart=new RegExp("["+nonASCIIidentifierStartChars+"]");var nonASCIIidentifier=new RegExp("["+nonASCIIidentifierStartChars+nonASCIIidentifierChars+"]");nonASCIIidentifierStartChars=nonASCIIidentifierChars=null;// These are a run-length and offset encoded representation of the
+  // >0xffff code points that are a valid part of identifiers. The
+  // offset starts at 0x10000, and each pair of numbers represents an
+  // offset to the next range, and then a size of the range. They were
+  // generated by bin/generate-identifier-regex.js
+  // eslint-disable-next-line comma-spacing
+  var astralIdentifierStartCodes=[0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,155,22,13,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,0,33,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,0,161,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,754,9486,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541];// eslint-disable-next-line comma-spacing
+  var astralIdentifierCodes=[509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,232,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,792487,239];// This has a complexity linear to the value of the code. The
+  // assumption is that looking up astral identifier characters is
+  // rare.
+  function isInAstralSet(code,set){var pos=0x10000;for(var i=0;i<set.length;i+=2){pos+=set[i];if(pos>code){return false;}pos+=set[i+1];if(pos>=code){return true;}}}// Test whether a given character code starts an identifier.
+  function isIdentifierStart(code,astral){if(code<65){return code===36;}if(code<91){return true;}if(code<97){return code===95;}if(code<123){return true;}if(code<=0xffff){return code>=0xaa&&nonASCIIidentifierStart.test(String.fromCharCode(code));}if(astral===false){return false;}return isInAstralSet(code,astralIdentifierStartCodes);}// Test whether a given character is part of an identifier.
+  function isIdentifierChar(code,astral){if(code<48){return code===36;}if(code<58){return true;}if(code<65){return false;}if(code<91){return true;}if(code<97){return code===95;}if(code<123){return true;}if(code<=0xffff){return code>=0xaa&&nonASCIIidentifier.test(String.fromCharCode(code));}if(astral===false){return false;}return isInAstralSet(code,astralIdentifierStartCodes)||isInAstralSet(code,astralIdentifierCodes);}// ## Token types
+  // The assignment of fine-grained, information-carrying type objects
+  // allows the tokenizer to store the information it has about a
+  // token in a way that is very cheap for the parser to look up.
+  // All token type variables start with an underscore, to make them
+  // easy to recognize.
+  // The `beforeExpr` property is used to disambiguate between regular
+  // expressions and divisions. It is set on all token types that can
+  // be followed by an expression (thus, a slash after them would be a
+  // regular expression).
+  //
+  // The `startsExpr` property is used to check if the token ends a
+  // `yield` expression. It is set on all token types that either can
+  // directly start an expression (like a quotation mark) or can
+  // continue an expression (like the body of a string).
+  //
+  // `isLoop` marks a keyword as starting a loop, which is important
+  // to know when parsing a label, in order to allow or disallow
+  // continue jumps to that label.
+  var TokenType=function TokenType(label,conf){if(conf===void 0)conf={};this.label=label;this.keyword=conf.keyword;this.beforeExpr=!!conf.beforeExpr;this.startsExpr=!!conf.startsExpr;this.isLoop=!!conf.isLoop;this.isAssign=!!conf.isAssign;this.prefix=!!conf.prefix;this.postfix=!!conf.postfix;this.binop=conf.binop||null;this.updateContext=null;};function binop(name,prec){return new TokenType(name,{beforeExpr:true,binop:prec});}var beforeExpr={beforeExpr:true},startsExpr={startsExpr:true};// Map keyword names to token types.
+  var keywords$1={};// Succinct definitions of keyword token types
+  function kw(name,options){if(options===void 0)options={};options.keyword=name;return keywords$1[name]=new TokenType(name,options);}var types$2={num:new TokenType("num",startsExpr),regexp:new TokenType("regexp",startsExpr),string:new TokenType("string",startsExpr),name:new TokenType("name",startsExpr),eof:new TokenType("eof"),// Punctuation token types.
+  bracketL:new TokenType("[",{beforeExpr:true,startsExpr:true}),bracketR:new TokenType("]"),braceL:new TokenType("{",{beforeExpr:true,startsExpr:true}),braceR:new TokenType("}"),parenL:new TokenType("(",{beforeExpr:true,startsExpr:true}),parenR:new TokenType(")"),comma:new TokenType(",",beforeExpr),semi:new TokenType(";",beforeExpr),colon:new TokenType(":",beforeExpr),dot:new TokenType("."),question:new TokenType("?",beforeExpr),arrow:new TokenType("=>",beforeExpr),template:new TokenType("template"),invalidTemplate:new TokenType("invalidTemplate"),ellipsis:new TokenType("...",beforeExpr),backQuote:new TokenType("`",startsExpr),dollarBraceL:new TokenType("${",{beforeExpr:true,startsExpr:true}),// Operators. These carry several kinds of properties to help the
+  // parser use them properly (the presence of these properties is
+  // what categorizes them as operators).
+  //
+  // `binop`, when present, specifies that this operator is a binary
+  // operator, and will refer to its precedence.
+  //
+  // `prefix` and `postfix` mark the operator as a prefix or postfix
+  // unary operator.
+  //
+  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
+  // binary operators with a very low precedence, that should result
+  // in AssignmentExpression nodes.
+  eq:new TokenType("=",{beforeExpr:true,isAssign:true}),assign:new TokenType("_=",{beforeExpr:true,isAssign:true}),incDec:new TokenType("++/--",{prefix:true,postfix:true,startsExpr:true}),prefix:new TokenType("!/~",{beforeExpr:true,prefix:true,startsExpr:true}),logicalOR:binop("||",1),logicalAND:binop("&&",2),bitwiseOR:binop("|",3),bitwiseXOR:binop("^",4),bitwiseAND:binop("&",5),equality:binop("==/!=/===/!==",6),relational:binop("</>/<=/>=",7),bitShift:binop("<</>>/>>>",8),plusMin:new TokenType("+/-",{beforeExpr:true,binop:9,prefix:true,startsExpr:true}),modulo:binop("%",10),star:binop("*",10),slash:binop("/",10),starstar:new TokenType("**",{beforeExpr:true}),// Keyword token types.
+  _break:kw("break"),_case:kw("case",beforeExpr),_catch:kw("catch"),_continue:kw("continue"),_debugger:kw("debugger"),_default:kw("default",beforeExpr),_do:kw("do",{isLoop:true,beforeExpr:true}),_else:kw("else",beforeExpr),_finally:kw("finally"),_for:kw("for",{isLoop:true}),_function:kw("function",startsExpr),_if:kw("if"),_return:kw("return",beforeExpr),_switch:kw("switch"),_throw:kw("throw",beforeExpr),_try:kw("try"),_var:kw("var"),_const:kw("const"),_while:kw("while",{isLoop:true}),_with:kw("with"),_new:kw("new",{beforeExpr:true,startsExpr:true}),_this:kw("this",startsExpr),_super:kw("super",startsExpr),_class:kw("class",startsExpr),_extends:kw("extends",beforeExpr),_export:kw("export"),_import:kw("import",startsExpr),_null:kw("null",startsExpr),_true:kw("true",startsExpr),_false:kw("false",startsExpr),_in:kw("in",{beforeExpr:true,binop:7}),_instanceof:kw("instanceof",{beforeExpr:true,binop:7}),_typeof:kw("typeof",{beforeExpr:true,prefix:true,startsExpr:true}),_void:kw("void",{beforeExpr:true,prefix:true,startsExpr:true}),_delete:kw("delete",{beforeExpr:true,prefix:true,startsExpr:true})};// Matches a whole line break (where CRLF is considered a single
+  // line break). Used to count lines.
+  var lineBreak=/\r\n?|\n|\u2028|\u2029/;var lineBreakG=new RegExp(lineBreak.source,"g");function isNewLine(code,ecma2019String){return code===10||code===13||!ecma2019String&&(code===0x2028||code===0x2029);}var nonASCIIwhitespace=/[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;var skipWhiteSpace=/(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;var ref=Object.prototype;var hasOwnProperty$2=ref.hasOwnProperty;var toString$1=ref.toString;// Checks if an object has a property.
+  function has$1(obj,propName){return hasOwnProperty$2.call(obj,propName);}var isArray$2=Array.isArray||function(obj){return toString$1.call(obj)==="[object Array]";};function wordsRegexp(words){return new RegExp("^(?:"+words.replace(/ /g,"|")+")$");}// These are used when `options.locations` is on, for the
+  // `startLoc` and `endLoc` properties.
+  var Position=function Position(line,col){this.line=line;this.column=col;};Position.prototype.offset=function offset(n){return new Position(this.line,this.column+n);};var SourceLocation=function SourceLocation(p,start,end){this.start=start;this.end=end;if(p.sourceFile!==null){this.source=p.sourceFile;}};// The `getLineInfo` function is mostly useful when the
+  // `locations` option is off (for performance reasons) and you
+  // want to find the line/column position for a given character
+  // offset. `input` should be the code string that the offset refers
+  // into.
+  function getLineInfo(input,offset){for(var line=1,cur=0;;){lineBreakG.lastIndex=cur;var match=lineBreakG.exec(input);if(match&&match.index<offset){++line;cur=match.index+match[0].length;}else{return new Position(line,offset-cur);}}}// A second optional argument can be given to further configure
+  // the parser process. These options are recognized:
+  var defaultOptions={// `ecmaVersion` indicates the ECMAScript version to parse. Must be
+  // either 3, 5, 6 (2015), 7 (2016), 8 (2017), 9 (2018), or 10
+  // (2019). This influences support for strict mode, the set of
+  // reserved words, and support for new syntax features. The default
+  // is 10.
+  ecmaVersion:10,// `sourceType` indicates the mode the code should be parsed in.
+  // Can be either `"script"` or `"module"`. This influences global
+  // strict mode and parsing of `import` and `export` declarations.
+  sourceType:"script",// `onInsertedSemicolon` can be a callback that will be called
+  // when a semicolon is automatically inserted. It will be passed
+  // the position of the comma as an offset, and if `locations` is
+  // enabled, it is given the location as a `{line, column}` object
+  // as second argument.
+  onInsertedSemicolon:null,// `onTrailingComma` is similar to `onInsertedSemicolon`, but for
+  // trailing commas.
+  onTrailingComma:null,// By default, reserved words are only enforced if ecmaVersion >= 5.
+  // Set `allowReserved` to a boolean value to explicitly turn this on
+  // an off. When this option has the value "never", reserved words
+  // and keywords can also not be used as property names.
+  allowReserved:null,// When enabled, a return at the top level is not considered an
+  // error.
+  allowReturnOutsideFunction:false,// When enabled, import/export statements are not constrained to
+  // appearing at the top of the program.
+  allowImportExportEverywhere:false,// When enabled, await identifiers are allowed to appear at the top-level scope,
+  // but they are still not allowed in non-async functions.
+  allowAwaitOutsideFunction:false,// When enabled, hashbang directive in the beginning of file
+  // is allowed and treated as a line comment.
+  allowHashBang:false,// When `locations` is on, `loc` properties holding objects with
+  // `start` and `end` properties in `{line, column}` form (with
+  // line being 1-based and column 0-based) will be attached to the
+  // nodes.
+  locations:false,// A function can be passed as `onToken` option, which will
+  // cause Acorn to call that function with object in the same
+  // format as tokens returned from `tokenizer().getToken()`. Note
+  // that you are not allowed to call the parser from the
+  // callback—that will corrupt its internal state.
+  onToken:null,// A function can be passed as `onComment` option, which will
+  // cause Acorn to call that function with `(block, text, start,
+  // end)` parameters whenever a comment is skipped. `block` is a
+  // boolean indicating whether this is a block (`/* */`) comment,
+  // `text` is the content of the comment, and `start` and `end` are
+  // character offsets that denote the start and end of the comment.
+  // When the `locations` option is on, two more parameters are
+  // passed, the full `{line, column}` locations of the start and
+  // end of the comments. Note that you are not allowed to call the
+  // parser from the callback—that will corrupt its internal state.
+  onComment:null,// Nodes have their start and end characters offsets recorded in
+  // `start` and `end` properties (directly on the node, rather than
+  // the `loc` object, which holds line/column data. To also add a
+  // [semi-standardized][range] `range` property holding a `[start,
+  // end]` array with the same numbers, set the `ranges` option to
+  // `true`.
+  //
+  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
+  ranges:false,// It is possible to parse multiple files into a single AST by
+  // passing the tree produced by parsing the first file as
+  // `program` option in subsequent parses. This will add the
+  // toplevel forms of the parsed file to the `Program` (top) node
+  // of an existing parse tree.
+  program:null,// When `locations` is on, you can pass this to record the source
+  // file in every node's `loc` object.
+  sourceFile:null,// This value, if given, is stored in every node, whether
+  // `locations` is on or off.
+  directSourceFile:null,// When enabled, parenthesized expressions are represented by
+  // (non-standard) ParenthesizedExpression nodes
+  preserveParens:false};// Interpret and default an options object
+  function getOptions(opts){var options={};for(var opt in defaultOptions){options[opt]=opts&&has$1(opts,opt)?opts[opt]:defaultOptions[opt];}if(options.ecmaVersion>=2015){options.ecmaVersion-=2009;}if(options.allowReserved==null){options.allowReserved=options.ecmaVersion<5;}if(isArray$2(options.onToken)){var tokens=options.onToken;options.onToken=function(token){return tokens.push(token);};}if(isArray$2(options.onComment)){options.onComment=pushComment(options,options.onComment);}return options;}function pushComment(options,array){return function(block,text,start,end,startLoc,endLoc){var comment={type:block?"Block":"Line",value:text,start:start,end:end};if(options.locations){comment.loc=new SourceLocation(this,startLoc,endLoc);}if(options.ranges){comment.range=[start,end];}array.push(comment);};}// Each scope gets a bitset that may contain these flags
+  var SCOPE_TOP=1,SCOPE_FUNCTION=2,SCOPE_VAR=SCOPE_TOP|SCOPE_FUNCTION,SCOPE_ASYNC=4,SCOPE_GENERATOR=8,SCOPE_ARROW=16,SCOPE_SIMPLE_CATCH=32,SCOPE_SUPER=64,SCOPE_DIRECT_SUPER=128;function functionFlags(async,generator){return SCOPE_FUNCTION|(async?SCOPE_ASYNC:0)|(generator?SCOPE_GENERATOR:0);}// Used in checkLVal and declareName to determine the type of a binding
+  var BIND_NONE=0,// Not a binding
+  BIND_VAR=1,// Var-style binding
+  BIND_LEXICAL=2,// Let- or const-style binding
+  BIND_FUNCTION=3,// Function declaration
+  BIND_SIMPLE_CATCH=4,// Simple (identifier pattern) catch binding
+  BIND_OUTSIDE=5;// Special case for function names as bound inside the function
+  var Parser=function Parser(options,input,startPos){this.options=options=getOptions(options);this.sourceFile=options.sourceFile;this.keywords=wordsRegexp(keywords[options.ecmaVersion>=6?6:options.sourceType==="module"?"5module":5]);var reserved="";if(options.allowReserved!==true){for(var v=options.ecmaVersion;;v--){if(reserved=reservedWords[v]){break;}}if(options.sourceType==="module"){reserved+=" await";}}this.reservedWords=wordsRegexp(reserved);var reservedStrict=(reserved?reserved+" ":"")+reservedWords.strict;this.reservedWordsStrict=wordsRegexp(reservedStrict);this.reservedWordsStrictBind=wordsRegexp(reservedStrict+" "+reservedWords.strictBind);this.input=String(input);// Used to signal to callers of `readWord1` whether the word
+  // contained any escape sequences. This is needed because words with
+  // escape sequences must not be interpreted as keywords.
+  this.containsEsc=false;// Set up token state
+  // The current position of the tokenizer in the input.
+  if(startPos){this.pos=startPos;this.lineStart=this.input.lastIndexOf("\n",startPos-1)+1;this.curLine=this.input.slice(0,this.lineStart).split(lineBreak).length;}else{this.pos=this.lineStart=0;this.curLine=1;}// Properties of the current token:
+  // Its type
+  this.type=types$2.eof;// For tokens that include more information than their type, the value
+  this.value=null;// Its start and end offset
+  this.start=this.end=this.pos;// And, if locations are used, the {line, column} object
+  // corresponding to those offsets
+  this.startLoc=this.endLoc=this.curPosition();// Position information for the previous token
+  this.lastTokEndLoc=this.lastTokStartLoc=null;this.lastTokStart=this.lastTokEnd=this.pos;// The context stack is used to superficially track syntactic
+  // context to predict whether a regular expression is allowed in a
+  // given position.
+  this.context=this.initialContext();this.exprAllowed=true;// Figure out if it's a module code.
+  this.inModule=options.sourceType==="module";this.strict=this.inModule||this.strictDirective(this.pos);// Used to signify the start of a potential arrow function
+  this.potentialArrowAt=-1;// Positions to delayed-check that yield/await does not exist in default parameters.
+  this.yieldPos=this.awaitPos=this.awaitIdentPos=0;// Labels in scope.
+  this.labels=[];// Thus-far undefined exports.
+  this.undefinedExports={};// If enabled, skip leading hashbang line.
+  if(this.pos===0&&options.allowHashBang&&this.input.slice(0,2)==="#!"){this.skipLineComment(2);}// Scope tracking for duplicate variable names (see scope.js)
+  this.scopeStack=[];this.enterScope(SCOPE_TOP);// For RegExp validation
+  this.regexpState=null;};var prototypeAccessors={inFunction:{configurable:true},inGenerator:{configurable:true},inAsync:{configurable:true},allowSuper:{configurable:true},allowDirectSuper:{configurable:true},treatFunctionsAsVar:{configurable:true}};Parser.prototype.parse=function parse(){var node=this.options.program||this.startNode();this.nextToken();return this.parseTopLevel(node);};prototypeAccessors.inFunction.get=function(){return (this.currentVarScope().flags&SCOPE_FUNCTION)>0;};prototypeAccessors.inGenerator.get=function(){return (this.currentVarScope().flags&SCOPE_GENERATOR)>0;};prototypeAccessors.inAsync.get=function(){return (this.currentVarScope().flags&SCOPE_ASYNC)>0;};prototypeAccessors.allowSuper.get=function(){return (this.currentThisScope().flags&SCOPE_SUPER)>0;};prototypeAccessors.allowDirectSuper.get=function(){return (this.currentThisScope().flags&SCOPE_DIRECT_SUPER)>0;};prototypeAccessors.treatFunctionsAsVar.get=function(){return this.treatFunctionsAsVarInScope(this.currentScope());};// Switch to a getter for 7.0.0.
+  Parser.prototype.inNonArrowFunction=function inNonArrowFunction(){return (this.currentThisScope().flags&SCOPE_FUNCTION)>0;};Parser.extend=function extend(){var plugins=[],len=arguments.length;while(len--)plugins[len]=arguments[len];var cls=this;for(var i=0;i<plugins.length;i++){cls=plugins[i](cls);}return cls;};Parser.parse=function parse(input,options){return new this(options,input).parse();};Parser.parseExpressionAt=function parseExpressionAt(input,pos,options){var parser=new this(options,input,pos);parser.nextToken();return parser.parseExpression();};Parser.tokenizer=function tokenizer(input,options){return new this(options,input);};Object.defineProperties(Parser.prototype,prototypeAccessors);var pp=Parser.prototype;// ## Parser utilities
+  var literal=/^(?:'((?:\\.|[^'])*?)'|"((?:\\.|[^"])*?)")/;pp.strictDirective=function(start){for(;;){// Try to find string literal.
+  skipWhiteSpace.lastIndex=start;start+=skipWhiteSpace.exec(this.input)[0].length;var match=literal.exec(this.input.slice(start));if(!match){return false;}if((match[1]||match[2])==="use strict"){return true;}start+=match[0].length;// Skip semicolon, if any.
+  skipWhiteSpace.lastIndex=start;start+=skipWhiteSpace.exec(this.input)[0].length;if(this.input[start]===";"){start++;}}};// Predicate that tests whether the next token is of the given
+  // type, and if yes, consumes it as a side effect.
+  pp.eat=function(type){if(this.type===type){this.next();return true;}else{return false;}};// Tests whether parsed token is a contextual keyword.
+  pp.isContextual=function(name){return this.type===types$2.name&&this.value===name&&!this.containsEsc;};// Consumes contextual keyword if possible.
+  pp.eatContextual=function(name){if(!this.isContextual(name)){return false;}this.next();return true;};// Asserts that following token is given contextual keyword.
+  pp.expectContextual=function(name){if(!this.eatContextual(name)){this.unexpected();}};// Test whether a semicolon can be inserted at the current position.
+  pp.canInsertSemicolon=function(){return this.type===types$2.eof||this.type===types$2.braceR||lineBreak.test(this.input.slice(this.lastTokEnd,this.start));};pp.insertSemicolon=function(){if(this.canInsertSemicolon()){if(this.options.onInsertedSemicolon){this.options.onInsertedSemicolon(this.lastTokEnd,this.lastTokEndLoc);}return true;}};// Consume a semicolon, or, failing that, see if we are allowed to
+  // pretend that there is a semicolon at this position.
+  pp.semicolon=function(){if(!this.eat(types$2.semi)&&!this.insertSemicolon()){this.unexpected();}};pp.afterTrailingComma=function(tokType,notNext){if(this.type===tokType){if(this.options.onTrailingComma){this.options.onTrailingComma(this.lastTokStart,this.lastTokStartLoc);}if(!notNext){this.next();}return true;}};// Expect a token of a given type. If found, consume it, otherwise,
+  // raise an unexpected token error.
+  pp.expect=function(type){this.eat(type)||this.unexpected();};// Raise an unexpected token error.
+  pp.unexpected=function(pos){this.raise(pos!=null?pos:this.start,"Unexpected token");};function DestructuringErrors(){this.shorthandAssign=this.trailingComma=this.parenthesizedAssign=this.parenthesizedBind=this.doubleProto=-1;}pp.checkPatternErrors=function(refDestructuringErrors,isAssign){if(!refDestructuringErrors){return;}if(refDestructuringErrors.trailingComma>-1){this.raiseRecoverable(refDestructuringErrors.trailingComma,"Comma is not permitted after the rest element");}var parens=isAssign?refDestructuringErrors.parenthesizedAssign:refDestructuringErrors.parenthesizedBind;if(parens>-1){this.raiseRecoverable(parens,"Parenthesized pattern");}};pp.checkExpressionErrors=function(refDestructuringErrors,andThrow){if(!refDestructuringErrors){return false;}var shorthandAssign=refDestructuringErrors.shorthandAssign;var doubleProto=refDestructuringErrors.doubleProto;if(!andThrow){return shorthandAssign>=0||doubleProto>=0;}if(shorthandAssign>=0){this.raise(shorthandAssign,"Shorthand property assignments are valid only in destructuring patterns");}if(doubleProto>=0){this.raiseRecoverable(doubleProto,"Redefinition of __proto__ property");}};pp.checkYieldAwaitInDefaultParams=function(){if(this.yieldPos&&(!this.awaitPos||this.yieldPos<this.awaitPos)){this.raise(this.yieldPos,"Yield expression cannot be a default value");}if(this.awaitPos){this.raise(this.awaitPos,"Await expression cannot be a default value");}};pp.isSimpleAssignTarget=function(expr){if(expr.type==="ParenthesizedExpression"){return this.isSimpleAssignTarget(expr.expression);}return expr.type==="Identifier"||expr.type==="MemberExpression";};var pp$1=Parser.prototype;// ### Statement parsing
+  // Parse a program. Initializes the parser, reads any number of
+  // statements, and wraps them in a Program node.  Optionally takes a
+  // `program` argument.  If present, the statements will be appended
+  // to its body instead of creating a new node.
+  pp$1.parseTopLevel=function(node){var exports={};if(!node.body){node.body=[];}while(this.type!==types$2.eof){var stmt=this.parseStatement(null,true,exports);node.body.push(stmt);}if(this.inModule){for(var i=0,list=Object.keys(this.undefinedExports);i<list.length;i+=1){var name=list[i];this.raiseRecoverable(this.undefinedExports[name].start,"Export '"+name+"' is not defined");}}this.adaptDirectivePrologue(node.body);this.next();node.sourceType=this.options.sourceType;return this.finishNode(node,"Program");};var loopLabel={kind:"loop"},switchLabel={kind:"switch"};pp$1.isLet=function(context){if(this.options.ecmaVersion<6||!this.isContextual("let")){return false;}skipWhiteSpace.lastIndex=this.pos;var skip=skipWhiteSpace.exec(this.input);var next=this.pos+skip[0].length,nextCh=this.input.charCodeAt(next);// For ambiguous cases, determine if a LexicalDeclaration (or only a
+  // Statement) is allowed here. If context is not empty then only a Statement
+  // is allowed. However, `let [` is an explicit negative lookahead for
+  // ExpressionStatement, so special-case it first.
+  if(nextCh===91){return true;}// '['
+  if(context){return false;}if(nextCh===123){return true;}// '{'
+  if(isIdentifierStart(nextCh,true)){var pos=next+1;while(isIdentifierChar(this.input.charCodeAt(pos),true)){++pos;}var ident=this.input.slice(next,pos);if(!keywordRelationalOperator.test(ident)){return true;}}return false;};// check 'async [no LineTerminator here] function'
+  // - 'async /*foo*/ function' is OK.
+  // - 'async /*\n*/ function' is invalid.
+  pp$1.isAsyncFunction=function(){if(this.options.ecmaVersion<8||!this.isContextual("async")){return false;}skipWhiteSpace.lastIndex=this.pos;var skip=skipWhiteSpace.exec(this.input);var next=this.pos+skip[0].length;return !lineBreak.test(this.input.slice(this.pos,next))&&this.input.slice(next,next+8)==="function"&&(next+8===this.input.length||!isIdentifierChar(this.input.charAt(next+8)));};// Parse a single statement.
+  //
+  // If expecting a statement and finding a slash operator, parse a
+  // regular expression literal. This is to handle cases like
+  // `if (foo) /blah/.exec(foo)`, where looking at the previous token
+  // does not help.
+  pp$1.parseStatement=function(context,topLevel,exports){var starttype=this.type,node=this.startNode(),kind;if(this.isLet(context)){starttype=types$2._var;kind="let";}// Most types of statements are recognized by the keyword they
+  // start with. Many are trivial to parse, some require a bit of
+  // complexity.
+  switch(starttype){case types$2._break:case types$2._continue:return this.parseBreakContinueStatement(node,starttype.keyword);case types$2._debugger:return this.parseDebuggerStatement(node);case types$2._do:return this.parseDoStatement(node);case types$2._for:return this.parseForStatement(node);case types$2._function:// Function as sole body of either an if statement or a labeled statement
+  // works, but not when it is part of a labeled statement that is the sole
+  // body of an if statement.
+  if(context&&(this.strict||context!=="if"&&context!=="label")&&this.options.ecmaVersion>=6){this.unexpected();}return this.parseFunctionStatement(node,false,!context);case types$2._class:if(context){this.unexpected();}return this.parseClass(node,true);case types$2._if:return this.parseIfStatement(node);case types$2._return:return this.parseReturnStatement(node);case types$2._switch:return this.parseSwitchStatement(node);case types$2._throw:return this.parseThrowStatement(node);case types$2._try:return this.parseTryStatement(node);case types$2._const:case types$2._var:kind=kind||this.value;if(context&&kind!=="var"){this.unexpected();}return this.parseVarStatement(node,kind);case types$2._while:return this.parseWhileStatement(node);case types$2._with:return this.parseWithStatement(node);case types$2.braceL:return this.parseBlock(true,node);case types$2.semi:return this.parseEmptyStatement(node);case types$2._export:case types$2._import:if(this.options.ecmaVersion>10&&starttype===types$2._import){skipWhiteSpace.lastIndex=this.pos;var skip=skipWhiteSpace.exec(this.input);var next=this.pos+skip[0].length,nextCh=this.input.charCodeAt(next);if(nextCh===40)// '('
+  {return this.parseExpressionStatement(node,this.parseExpression());}}if(!this.options.allowImportExportEverywhere){if(!topLevel){this.raise(this.start,"'import' and 'export' may only appear at the top level");}if(!this.inModule){this.raise(this.start,"'import' and 'export' may appear only with 'sourceType: module'");}}return starttype===types$2._import?this.parseImport(node):this.parseExport(node,exports);// If the statement does not start with a statement keyword or a
+  // brace, it's an ExpressionStatement or LabeledStatement. We
+  // simply start parsing an expression, and afterwards, if the
+  // next token is a colon and the expression was a simple
+  // Identifier node, we switch to interpreting it as a label.
+  default:if(this.isAsyncFunction()){if(context){this.unexpected();}this.next();return this.parseFunctionStatement(node,true,!context);}var maybeName=this.value,expr=this.parseExpression();if(starttype===types$2.name&&expr.type==="Identifier"&&this.eat(types$2.colon)){return this.parseLabeledStatement(node,maybeName,expr,context);}else{return this.parseExpressionStatement(node,expr);}}};pp$1.parseBreakContinueStatement=function(node,keyword){var isBreak=keyword==="break";this.next();if(this.eat(types$2.semi)||this.insertSemicolon()){node.label=null;}else if(this.type!==types$2.name){this.unexpected();}else{node.label=this.parseIdent();this.semicolon();}// Verify that there is an actual destination to break or
+  // continue to.
+  var i=0;for(;i<this.labels.length;++i){var lab=this.labels[i];if(node.label==null||lab.name===node.label.name){if(lab.kind!=null&&(isBreak||lab.kind==="loop")){break;}if(node.label&&isBreak){break;}}}if(i===this.labels.length){this.raise(node.start,"Unsyntactic "+keyword);}return this.finishNode(node,isBreak?"BreakStatement":"ContinueStatement");};pp$1.parseDebuggerStatement=function(node){this.next();this.semicolon();return this.finishNode(node,"DebuggerStatement");};pp$1.parseDoStatement=function(node){this.next();this.labels.push(loopLabel);node.body=this.parseStatement("do");this.labels.pop();this.expect(types$2._while);node.test=this.parseParenExpression();if(this.options.ecmaVersion>=6){this.eat(types$2.semi);}else{this.semicolon();}return this.finishNode(node,"DoWhileStatement");};// Disambiguating between a `for` and a `for`/`in` or `for`/`of`
+  // loop is non-trivial. Basically, we have to parse the init `var`
+  // statement or expression, disallowing the `in` operator (see
+  // the second parameter to `parseExpression`), and then check
+  // whether the next token is `in` or `of`. When there is no init
+  // part (semicolon immediately after the opening parenthesis), it
+  // is a regular `for` loop.
+  pp$1.parseForStatement=function(node){this.next();var awaitAt=this.options.ecmaVersion>=9&&(this.inAsync||!this.inFunction&&this.options.allowAwaitOutsideFunction)&&this.eatContextual("await")?this.lastTokStart:-1;this.labels.push(loopLabel);this.enterScope(0);this.expect(types$2.parenL);if(this.type===types$2.semi){if(awaitAt>-1){this.unexpected(awaitAt);}return this.parseFor(node,null);}var isLet=this.isLet();if(this.type===types$2._var||this.type===types$2._const||isLet){var init$1=this.startNode(),kind=isLet?"let":this.value;this.next();this.parseVar(init$1,true,kind);this.finishNode(init$1,"VariableDeclaration");if((this.type===types$2._in||this.options.ecmaVersion>=6&&this.isContextual("of"))&&init$1.declarations.length===1){if(this.options.ecmaVersion>=9){if(this.type===types$2._in){if(awaitAt>-1){this.unexpected(awaitAt);}}else{node.await=awaitAt>-1;}}return this.parseForIn(node,init$1);}if(awaitAt>-1){this.unexpected(awaitAt);}return this.parseFor(node,init$1);}var refDestructuringErrors=new DestructuringErrors();var init=this.parseExpression(true,refDestructuringErrors);if(this.type===types$2._in||this.options.ecmaVersion>=6&&this.isContextual("of")){if(this.options.ecmaVersion>=9){if(this.type===types$2._in){if(awaitAt>-1){this.unexpected(awaitAt);}}else{node.await=awaitAt>-1;}}this.toAssignable(init,false,refDestructuringErrors);this.checkLVal(init);return this.parseForIn(node,init);}else{this.checkExpressionErrors(refDestructuringErrors,true);}if(awaitAt>-1){this.unexpected(awaitAt);}return this.parseFor(node,init);};pp$1.parseFunctionStatement=function(node,isAsync,declarationPosition){this.next();return this.parseFunction(node,FUNC_STATEMENT|(declarationPosition?0:FUNC_HANGING_STATEMENT),false,isAsync);};pp$1.parseIfStatement=function(node){this.next();node.test=this.parseParenExpression();// allow function declarations in branches, but only in non-strict mode
+  node.consequent=this.parseStatement("if");node.alternate=this.eat(types$2._else)?this.parseStatement("if"):null;return this.finishNode(node,"IfStatement");};pp$1.parseReturnStatement=function(node){if(!this.inFunction&&!this.options.allowReturnOutsideFunction){this.raise(this.start,"'return' outside of function");}this.next();// In `return` (and `break`/`continue`), the keywords with
+  // optional arguments, we eagerly look for a semicolon or the
+  // possibility to insert one.
+  if(this.eat(types$2.semi)||this.insertSemicolon()){node.argument=null;}else{node.argument=this.parseExpression();this.semicolon();}return this.finishNode(node,"ReturnStatement");};pp$1.parseSwitchStatement=function(node){this.next();node.discriminant=this.parseParenExpression();node.cases=[];this.expect(types$2.braceL);this.labels.push(switchLabel);this.enterScope(0);// Statements under must be grouped (by label) in SwitchCase
+  // nodes. `cur` is used to keep the node that we are currently
+  // adding statements to.
+  var cur;for(var sawDefault=false;this.type!==types$2.braceR;){if(this.type===types$2._case||this.type===types$2._default){var isCase=this.type===types$2._case;if(cur){this.finishNode(cur,"SwitchCase");}node.cases.push(cur=this.startNode());cur.consequent=[];this.next();if(isCase){cur.test=this.parseExpression();}else{if(sawDefault){this.raiseRecoverable(this.lastTokStart,"Multiple default clauses");}sawDefault=true;cur.test=null;}this.expect(types$2.colon);}else{if(!cur){this.unexpected();}cur.consequent.push(this.parseStatement(null));}}this.exitScope();if(cur){this.finishNode(cur,"SwitchCase");}this.next();// Closing brace
+  this.labels.pop();return this.finishNode(node,"SwitchStatement");};pp$1.parseThrowStatement=function(node){this.next();if(lineBreak.test(this.input.slice(this.lastTokEnd,this.start))){this.raise(this.lastTokEnd,"Illegal newline after throw");}node.argument=this.parseExpression();this.semicolon();return this.finishNode(node,"ThrowStatement");};// Reused empty array added for node fields that are always empty.
+  var empty=[];pp$1.parseTryStatement=function(node){this.next();node.block=this.parseBlock();node.handler=null;if(this.type===types$2._catch){var clause=this.startNode();this.next();if(this.eat(types$2.parenL)){clause.param=this.parseBindingAtom();var simple=clause.param.type==="Identifier";this.enterScope(simple?SCOPE_SIMPLE_CATCH:0);this.checkLVal(clause.param,simple?BIND_SIMPLE_CATCH:BIND_LEXICAL);this.expect(types$2.parenR);}else{if(this.options.ecmaVersion<10){this.unexpected();}clause.param=null;this.enterScope(0);}clause.body=this.parseBlock(false);this.exitScope();node.handler=this.finishNode(clause,"CatchClause");}node.finalizer=this.eat(types$2._finally)?this.parseBlock():null;if(!node.handler&&!node.finalizer){this.raise(node.start,"Missing catch or finally clause");}return this.finishNode(node,"TryStatement");};pp$1.parseVarStatement=function(node,kind){this.next();this.parseVar(node,false,kind);this.semicolon();return this.finishNode(node,"VariableDeclaration");};pp$1.parseWhileStatement=function(node){this.next();node.test=this.parseParenExpression();this.labels.push(loopLabel);node.body=this.parseStatement("while");this.labels.pop();return this.finishNode(node,"WhileStatement");};pp$1.parseWithStatement=function(node){if(this.strict){this.raise(this.start,"'with' in strict mode");}this.next();node.object=this.parseParenExpression();node.body=this.parseStatement("with");return this.finishNode(node,"WithStatement");};pp$1.parseEmptyStatement=function(node){this.next();return this.finishNode(node,"EmptyStatement");};pp$1.parseLabeledStatement=function(node,maybeName,expr,context){for(var i$1=0,list=this.labels;i$1<list.length;i$1+=1){var label=list[i$1];if(label.name===maybeName){this.raise(expr.start,"Label '"+maybeName+"' is already declared");}}var kind=this.type.isLoop?"loop":this.type===types$2._switch?"switch":null;for(var i=this.labels.length-1;i>=0;i--){var label$1=this.labels[i];if(label$1.statementStart===node.start){// Update information about previous labels on this node
+  label$1.statementStart=this.start;label$1.kind=kind;}else{break;}}this.labels.push({name:maybeName,kind:kind,statementStart:this.start});node.body=this.parseStatement(context?context.indexOf("label")===-1?context+"label":context:"label");this.labels.pop();node.label=expr;return this.finishNode(node,"LabeledStatement");};pp$1.parseExpressionStatement=function(node,expr){node.expression=expr;this.semicolon();return this.finishNode(node,"ExpressionStatement");};// Parse a semicolon-enclosed block of statements, handling `"use
+  // strict"` declarations when `allowStrict` is true (used for
+  // function bodies).
+  pp$1.parseBlock=function(createNewLexicalScope,node){if(createNewLexicalScope===void 0)createNewLexicalScope=true;if(node===void 0)node=this.startNode();node.body=[];this.expect(types$2.braceL);if(createNewLexicalScope){this.enterScope(0);}while(!this.eat(types$2.braceR)){var stmt=this.parseStatement(null);node.body.push(stmt);}if(createNewLexicalScope){this.exitScope();}return this.finishNode(node,"BlockStatement");};// Parse a regular `for` loop. The disambiguation code in
+  // `parseStatement` will already have parsed the init statement or
+  // expression.
+  pp$1.parseFor=function(node,init){node.init=init;this.expect(types$2.semi);node.test=this.type===types$2.semi?null:this.parseExpression();this.expect(types$2.semi);node.update=this.type===types$2.parenR?null:this.parseExpression();this.expect(types$2.parenR);node.body=this.parseStatement("for");this.exitScope();this.labels.pop();return this.finishNode(node,"ForStatement");};// Parse a `for`/`in` and `for`/`of` loop, which are almost
+  // same from parser's perspective.
+  pp$1.parseForIn=function(node,init){var isForIn=this.type===types$2._in;this.next();if(init.type==="VariableDeclaration"&&init.declarations[0].init!=null&&(!isForIn||this.options.ecmaVersion<8||this.strict||init.kind!=="var"||init.declarations[0].id.type!=="Identifier")){this.raise(init.start,(isForIn?"for-in":"for-of")+" loop variable declaration may not have an initializer");}else if(init.type==="AssignmentPattern"){this.raise(init.start,"Invalid left-hand side in for-loop");}node.left=init;node.right=isForIn?this.parseExpression():this.parseMaybeAssign();this.expect(types$2.parenR);node.body=this.parseStatement("for");this.exitScope();this.labels.pop();return this.finishNode(node,isForIn?"ForInStatement":"ForOfStatement");};// Parse a list of variable declarations.
+  pp$1.parseVar=function(node,isFor,kind){node.declarations=[];node.kind=kind;for(;;){var decl=this.startNode();this.parseVarId(decl,kind);if(this.eat(types$2.eq)){decl.init=this.parseMaybeAssign(isFor);}else if(kind==="const"&&!(this.type===types$2._in||this.options.ecmaVersion>=6&&this.isContextual("of"))){this.unexpected();}else if(decl.id.type!=="Identifier"&&!(isFor&&(this.type===types$2._in||this.isContextual("of")))){this.raise(this.lastTokEnd,"Complex binding patterns require an initialization value");}else{decl.init=null;}node.declarations.push(this.finishNode(decl,"VariableDeclarator"));if(!this.eat(types$2.comma)){break;}}return node;};pp$1.parseVarId=function(decl,kind){decl.id=this.parseBindingAtom();this.checkLVal(decl.id,kind==="var"?BIND_VAR:BIND_LEXICAL,false);};var FUNC_STATEMENT=1,FUNC_HANGING_STATEMENT=2,FUNC_NULLABLE_ID=4;// Parse a function declaration or literal (depending on the
+  // `statement & FUNC_STATEMENT`).
+  // Remove `allowExpressionBody` for 7.0.0, as it is only called with false
+  pp$1.parseFunction=function(node,statement,allowExpressionBody,isAsync){this.initFunction(node);if(this.options.ecmaVersion>=9||this.options.ecmaVersion>=6&&!isAsync){if(this.type===types$2.star&&statement&FUNC_HANGING_STATEMENT){this.unexpected();}node.generator=this.eat(types$2.star);}if(this.options.ecmaVersion>=8){node.async=!!isAsync;}if(statement&FUNC_STATEMENT){node.id=statement&FUNC_NULLABLE_ID&&this.type!==types$2.name?null:this.parseIdent();if(node.id&&!(statement&FUNC_HANGING_STATEMENT))// If it is a regular function declaration in sloppy mode, then it is
+  // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding
+  // mode depends on properties of the current scope (see
+  // treatFunctionsAsVar).
+  {this.checkLVal(node.id,this.strict||node.generator||node.async?this.treatFunctionsAsVar?BIND_VAR:BIND_LEXICAL:BIND_FUNCTION);}}var oldYieldPos=this.yieldPos,oldAwaitPos=this.awaitPos,oldAwaitIdentPos=this.awaitIdentPos;this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;this.enterScope(functionFlags(node.async,node.generator));if(!(statement&FUNC_STATEMENT)){node.id=this.type===types$2.name?this.parseIdent():null;}this.parseFunctionParams(node);this.parseFunctionBody(node,allowExpressionBody,false);this.yieldPos=oldYieldPos;this.awaitPos=oldAwaitPos;this.awaitIdentPos=oldAwaitIdentPos;return this.finishNode(node,statement&FUNC_STATEMENT?"FunctionDeclaration":"FunctionExpression");};pp$1.parseFunctionParams=function(node){this.expect(types$2.parenL);node.params=this.parseBindingList(types$2.parenR,false,this.options.ecmaVersion>=8);this.checkYieldAwaitInDefaultParams();};// Parse a class declaration or literal (depending on the
+  // `isStatement` parameter).
+  pp$1.parseClass=function(node,isStatement){this.next();// ecma-262 14.6 Class Definitions
+  // A class definition is always strict mode code.
+  var oldStrict=this.strict;this.strict=true;this.parseClassId(node,isStatement);this.parseClassSuper(node);var classBody=this.startNode();var hadConstructor=false;classBody.body=[];this.expect(types$2.braceL);while(!this.eat(types$2.braceR)){var element=this.parseClassElement(node.superClass!==null);if(element){classBody.body.push(element);if(element.type==="MethodDefinition"&&element.kind==="constructor"){if(hadConstructor){this.raise(element.start,"Duplicate constructor in the same class");}hadConstructor=true;}}}node.body=this.finishNode(classBody,"ClassBody");this.strict=oldStrict;return this.finishNode(node,isStatement?"ClassDeclaration":"ClassExpression");};pp$1.parseClassElement=function(constructorAllowsSuper){var this$1=this;if(this.eat(types$2.semi)){return null;}var method=this.startNode();var tryContextual=function tryContextual(k,noLineBreak){if(noLineBreak===void 0)noLineBreak=false;var start=this$1.start,startLoc=this$1.startLoc;if(!this$1.eatContextual(k)){return false;}if(this$1.type!==types$2.parenL&&(!noLineBreak||!this$1.canInsertSemicolon())){return true;}if(method.key){this$1.unexpected();}method.computed=false;method.key=this$1.startNodeAt(start,startLoc);method.key.name=k;this$1.finishNode(method.key,"Identifier");return false;};method.kind="method";method.static=tryContextual("static");var isGenerator=this.eat(types$2.star);var isAsync=false;if(!isGenerator){if(this.options.ecmaVersion>=8&&tryContextual("async",true)){isAsync=true;isGenerator=this.options.ecmaVersion>=9&&this.eat(types$2.star);}else if(tryContextual("get")){method.kind="get";}else if(tryContextual("set")){method.kind="set";}}if(!method.key){this.parsePropertyName(method);}var key=method.key;var allowsDirectSuper=false;if(!method.computed&&!method.static&&(key.type==="Identifier"&&key.name==="constructor"||key.type==="Literal"&&key.value==="constructor")){if(method.kind!=="method"){this.raise(key.start,"Constructor can't have get/set modifier");}if(isGenerator){this.raise(key.start,"Constructor can't be a generator");}if(isAsync){this.raise(key.start,"Constructor can't be an async method");}method.kind="constructor";allowsDirectSuper=constructorAllowsSuper;}else if(method.static&&key.type==="Identifier"&&key.name==="prototype"){this.raise(key.start,"Classes may not have a static property named prototype");}this.parseClassMethod(method,isGenerator,isAsync,allowsDirectSuper);if(method.kind==="get"&&method.value.params.length!==0){this.raiseRecoverable(method.value.start,"getter should have no params");}if(method.kind==="set"&&method.value.params.length!==1){this.raiseRecoverable(method.value.start,"setter should have exactly one param");}if(method.kind==="set"&&method.value.params[0].type==="RestElement"){this.raiseRecoverable(method.value.params[0].start,"Setter cannot use rest params");}return method;};pp$1.parseClassMethod=function(method,isGenerator,isAsync,allowsDirectSuper){method.value=this.parseMethod(isGenerator,isAsync,allowsDirectSuper);return this.finishNode(method,"MethodDefinition");};pp$1.parseClassId=function(node,isStatement){if(this.type===types$2.name){node.id=this.parseIdent();if(isStatement){this.checkLVal(node.id,BIND_LEXICAL,false);}}else{if(isStatement===true){this.unexpected();}node.id=null;}};pp$1.parseClassSuper=function(node){node.superClass=this.eat(types$2._extends)?this.parseExprSubscripts():null;};// Parses module export declaration.
+  pp$1.parseExport=function(node,exports){this.next();// export * from '...'
+  if(this.eat(types$2.star)){this.expectContextual("from");if(this.type!==types$2.string){this.unexpected();}node.source=this.parseExprAtom();this.semicolon();return this.finishNode(node,"ExportAllDeclaration");}if(this.eat(types$2._default)){// export default ...
+  this.checkExport(exports,"default",this.lastTokStart);var isAsync;if(this.type===types$2._function||(isAsync=this.isAsyncFunction())){var fNode=this.startNode();this.next();if(isAsync){this.next();}node.declaration=this.parseFunction(fNode,FUNC_STATEMENT|FUNC_NULLABLE_ID,false,isAsync);}else if(this.type===types$2._class){var cNode=this.startNode();node.declaration=this.parseClass(cNode,"nullableID");}else{node.declaration=this.parseMaybeAssign();this.semicolon();}return this.finishNode(node,"ExportDefaultDeclaration");}// export var|const|let|function|class ...
+  if(this.shouldParseExportStatement()){node.declaration=this.parseStatement(null);if(node.declaration.type==="VariableDeclaration"){this.checkVariableExport(exports,node.declaration.declarations);}else{this.checkExport(exports,node.declaration.id.name,node.declaration.id.start);}node.specifiers=[];node.source=null;}else{// export { x, y as z } [from '...']
+  node.declaration=null;node.specifiers=this.parseExportSpecifiers(exports);if(this.eatContextual("from")){if(this.type!==types$2.string){this.unexpected();}node.source=this.parseExprAtom();}else{for(var i=0,list=node.specifiers;i<list.length;i+=1){// check for keywords used as local names
+  var spec=list[i];this.checkUnreserved(spec.local);// check if export is defined
+  this.checkLocalExport(spec.local);}node.source=null;}this.semicolon();}return this.finishNode(node,"ExportNamedDeclaration");};pp$1.checkExport=function(exports,name,pos){if(!exports){return;}if(has$1(exports,name)){this.raiseRecoverable(pos,"Duplicate export '"+name+"'");}exports[name]=true;};pp$1.checkPatternExport=function(exports,pat){var type=pat.type;if(type==="Identifier"){this.checkExport(exports,pat.name,pat.start);}else if(type==="ObjectPattern"){for(var i=0,list=pat.properties;i<list.length;i+=1){var prop=list[i];this.checkPatternExport(exports,prop);}}else if(type==="ArrayPattern"){for(var i$1=0,list$1=pat.elements;i$1<list$1.length;i$1+=1){var elt=list$1[i$1];if(elt){this.checkPatternExport(exports,elt);}}}else if(type==="Property"){this.checkPatternExport(exports,pat.value);}else if(type==="AssignmentPattern"){this.checkPatternExport(exports,pat.left);}else if(type==="RestElement"){this.checkPatternExport(exports,pat.argument);}else if(type==="ParenthesizedExpression"){this.checkPatternExport(exports,pat.expression);}};pp$1.checkVariableExport=function(exports,decls){if(!exports){return;}for(var i=0,list=decls;i<list.length;i+=1){var decl=list[i];this.checkPatternExport(exports,decl.id);}};pp$1.shouldParseExportStatement=function(){return this.type.keyword==="var"||this.type.keyword==="const"||this.type.keyword==="class"||this.type.keyword==="function"||this.isLet()||this.isAsyncFunction();};// Parses a comma-separated list of module exports.
+  pp$1.parseExportSpecifiers=function(exports){var nodes=[],first=true;// export { x, y as z } [from '...']
+  this.expect(types$2.braceL);while(!this.eat(types$2.braceR)){if(!first){this.expect(types$2.comma);if(this.afterTrailingComma(types$2.braceR)){break;}}else{first=false;}var node=this.startNode();node.local=this.parseIdent(true);node.exported=this.eatContextual("as")?this.parseIdent(true):node.local;this.checkExport(exports,node.exported.name,node.exported.start);nodes.push(this.finishNode(node,"ExportSpecifier"));}return nodes;};// Parses import declaration.
+  pp$1.parseImport=function(node){this.next();// import '...'
+  if(this.type===types$2.string){node.specifiers=empty;node.source=this.parseExprAtom();}else{node.specifiers=this.parseImportSpecifiers();this.expectContextual("from");node.source=this.type===types$2.string?this.parseExprAtom():this.unexpected();}this.semicolon();return this.finishNode(node,"ImportDeclaration");};// Parses a comma-separated list of module imports.
+  pp$1.parseImportSpecifiers=function(){var nodes=[],first=true;if(this.type===types$2.name){// import defaultObj, { x, y as z } from '...'
+  var node=this.startNode();node.local=this.parseIdent();this.checkLVal(node.local,BIND_LEXICAL);nodes.push(this.finishNode(node,"ImportDefaultSpecifier"));if(!this.eat(types$2.comma)){return nodes;}}if(this.type===types$2.star){var node$1=this.startNode();this.next();this.expectContextual("as");node$1.local=this.parseIdent();this.checkLVal(node$1.local,BIND_LEXICAL);nodes.push(this.finishNode(node$1,"ImportNamespaceSpecifier"));return nodes;}this.expect(types$2.braceL);while(!this.eat(types$2.braceR)){if(!first){this.expect(types$2.comma);if(this.afterTrailingComma(types$2.braceR)){break;}}else{first=false;}var node$2=this.startNode();node$2.imported=this.parseIdent(true);if(this.eatContextual("as")){node$2.local=this.parseIdent();}else{this.checkUnreserved(node$2.imported);node$2.local=node$2.imported;}this.checkLVal(node$2.local,BIND_LEXICAL);nodes.push(this.finishNode(node$2,"ImportSpecifier"));}return nodes;};// Set `ExpressionStatement#directive` property for directive prologues.
+  pp$1.adaptDirectivePrologue=function(statements){for(var i=0;i<statements.length&&this.isDirectiveCandidate(statements[i]);++i){statements[i].directive=statements[i].expression.raw.slice(1,-1);}};pp$1.isDirectiveCandidate=function(statement){return statement.type==="ExpressionStatement"&&statement.expression.type==="Literal"&&typeof statement.expression.value==="string"&&(// Reject parenthesized strings.
+  this.input[statement.start]==="\""||this.input[statement.start]==="'");};var pp$2=Parser.prototype;// Convert existing expression atom to assignable pattern
+  // if possible.
+  pp$2.toAssignable=function(node,isBinding,refDestructuringErrors){if(this.options.ecmaVersion>=6&&node){switch(node.type){case"Identifier":if(this.inAsync&&node.name==="await"){this.raise(node.start,"Cannot use 'await' as identifier inside an async function");}break;case"ObjectPattern":case"ArrayPattern":case"RestElement":break;case"ObjectExpression":node.type="ObjectPattern";if(refDestructuringErrors){this.checkPatternErrors(refDestructuringErrors,true);}for(var i=0,list=node.properties;i<list.length;i+=1){var prop=list[i];this.toAssignable(prop,isBinding);// Early error:
+  //   AssignmentRestProperty[Yield, Await] :
+  //     `...` DestructuringAssignmentTarget[Yield, Await]
+  //
+  //   It is a Syntax Error if |DestructuringAssignmentTarget| is an |ArrayLiteral| or an |ObjectLiteral|.
+  if(prop.type==="RestElement"&&(prop.argument.type==="ArrayPattern"||prop.argument.type==="ObjectPattern")){this.raise(prop.argument.start,"Unexpected token");}}break;case"Property":// AssignmentProperty has type === "Property"
+  if(node.kind!=="init"){this.raise(node.key.start,"Object pattern can't contain getter or setter");}this.toAssignable(node.value,isBinding);break;case"ArrayExpression":node.type="ArrayPattern";if(refDestructuringErrors){this.checkPatternErrors(refDestructuringErrors,true);}this.toAssignableList(node.elements,isBinding);break;case"SpreadElement":node.type="RestElement";this.toAssignable(node.argument,isBinding);if(node.argument.type==="AssignmentPattern"){this.raise(node.argument.start,"Rest elements cannot have a default value");}break;case"AssignmentExpression":if(node.operator!=="="){this.raise(node.left.end,"Only '=' operator can be used for specifying default value.");}node.type="AssignmentPattern";delete node.operator;this.toAssignable(node.left,isBinding);// falls through to AssignmentPattern
+  case"AssignmentPattern":break;case"ParenthesizedExpression":this.toAssignable(node.expression,isBinding,refDestructuringErrors);break;case"MemberExpression":if(!isBinding){break;}default:this.raise(node.start,"Assigning to rvalue");}}else if(refDestructuringErrors){this.checkPatternErrors(refDestructuringErrors,true);}return node;};// Convert list of expression atoms to binding list.
+  pp$2.toAssignableList=function(exprList,isBinding){var end=exprList.length;for(var i=0;i<end;i++){var elt=exprList[i];if(elt){this.toAssignable(elt,isBinding);}}if(end){var last=exprList[end-1];if(this.options.ecmaVersion===6&&isBinding&&last&&last.type==="RestElement"&&last.argument.type!=="Identifier"){this.unexpected(last.argument.start);}}return exprList;};// Parses spread element.
+  pp$2.parseSpread=function(refDestructuringErrors){var node=this.startNode();this.next();node.argument=this.parseMaybeAssign(false,refDestructuringErrors);return this.finishNode(node,"SpreadElement");};pp$2.parseRestBinding=function(){var node=this.startNode();this.next();// RestElement inside of a function parameter must be an identifier
+  if(this.options.ecmaVersion===6&&this.type!==types$2.name){this.unexpected();}node.argument=this.parseBindingAtom();return this.finishNode(node,"RestElement");};// Parses lvalue (assignable) atom.
+  pp$2.parseBindingAtom=function(){if(this.options.ecmaVersion>=6){switch(this.type){case types$2.bracketL:var node=this.startNode();this.next();node.elements=this.parseBindingList(types$2.bracketR,true,true);return this.finishNode(node,"ArrayPattern");case types$2.braceL:return this.parseObj(true);}}return this.parseIdent();};pp$2.parseBindingList=function(close,allowEmpty,allowTrailingComma){var elts=[],first=true;while(!this.eat(close)){if(first){first=false;}else{this.expect(types$2.comma);}if(allowEmpty&&this.type===types$2.comma){elts.push(null);}else if(allowTrailingComma&&this.afterTrailingComma(close)){break;}else if(this.type===types$2.ellipsis){var rest=this.parseRestBinding();this.parseBindingListItem(rest);elts.push(rest);if(this.type===types$2.comma){this.raise(this.start,"Comma is not permitted after the rest element");}this.expect(close);break;}else{var elem=this.parseMaybeDefault(this.start,this.startLoc);this.parseBindingListItem(elem);elts.push(elem);}}return elts;};pp$2.parseBindingListItem=function(param){return param;};// Parses assignment pattern around given atom if possible.
+  pp$2.parseMaybeDefault=function(startPos,startLoc,left){left=left||this.parseBindingAtom();if(this.options.ecmaVersion<6||!this.eat(types$2.eq)){return left;}var node=this.startNodeAt(startPos,startLoc);node.left=left;node.right=this.parseMaybeAssign();return this.finishNode(node,"AssignmentPattern");};// Verify that a node is an lval — something that can be assigned
+  // to.
+  // bindingType can be either:
+  // 'var' indicating that the lval creates a 'var' binding
+  // 'let' indicating that the lval creates a lexical ('let' or 'const') binding
+  // 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references
+  pp$2.checkLVal=function(expr,bindingType,checkClashes){if(bindingType===void 0)bindingType=BIND_NONE;switch(expr.type){case"Identifier":if(bindingType===BIND_LEXICAL&&expr.name==="let"){this.raiseRecoverable(expr.start,"let is disallowed as a lexically bound name");}if(this.strict&&this.reservedWordsStrictBind.test(expr.name)){this.raiseRecoverable(expr.start,(bindingType?"Binding ":"Assigning to ")+expr.name+" in strict mode");}if(checkClashes){if(has$1(checkClashes,expr.name)){this.raiseRecoverable(expr.start,"Argument name clash");}checkClashes[expr.name]=true;}if(bindingType!==BIND_NONE&&bindingType!==BIND_OUTSIDE){this.declareName(expr.name,bindingType,expr.start);}break;case"MemberExpression":if(bindingType){this.raiseRecoverable(expr.start,"Binding member expression");}break;case"ObjectPattern":for(var i=0,list=expr.properties;i<list.length;i+=1){var prop=list[i];this.checkLVal(prop,bindingType,checkClashes);}break;case"Property":// AssignmentProperty has type === "Property"
+  this.checkLVal(expr.value,bindingType,checkClashes);break;case"ArrayPattern":for(var i$1=0,list$1=expr.elements;i$1<list$1.length;i$1+=1){var elem=list$1[i$1];if(elem){this.checkLVal(elem,bindingType,checkClashes);}}break;case"AssignmentPattern":this.checkLVal(expr.left,bindingType,checkClashes);break;case"RestElement":this.checkLVal(expr.argument,bindingType,checkClashes);break;case"ParenthesizedExpression":this.checkLVal(expr.expression,bindingType,checkClashes);break;default:this.raise(expr.start,(bindingType?"Binding":"Assigning to")+" rvalue");}};// A recursive descent parser operates by defining functions for all
+  var pp$3=Parser.prototype;// Check if property name clashes with already added.
+  // Object/class getters and setters are not allowed to clash —
+  // either with each other or with an init property — and in
+  // strict mode, init properties are also not allowed to be repeated.
+  pp$3.checkPropClash=function(prop,propHash,refDestructuringErrors){if(this.options.ecmaVersion>=9&&prop.type==="SpreadElement"){return;}if(this.options.ecmaVersion>=6&&(prop.computed||prop.method||prop.shorthand)){return;}var key=prop.key;var name;switch(key.type){case"Identifier":name=key.name;break;case"Literal":name=String(key.value);break;default:return;}var kind=prop.kind;if(this.options.ecmaVersion>=6){if(name==="__proto__"&&kind==="init"){if(propHash.proto){if(refDestructuringErrors&&refDestructuringErrors.doubleProto<0){refDestructuringErrors.doubleProto=key.start;}// Backwards-compat kludge. Can be removed in version 6.0
+  else{this.raiseRecoverable(key.start,"Redefinition of __proto__ property");}}propHash.proto=true;}return;}name="$"+name;var other=propHash[name];if(other){var redefinition;if(kind==="init"){redefinition=this.strict&&other.init||other.get||other.set;}else{redefinition=other.init||other[kind];}if(redefinition){this.raiseRecoverable(key.start,"Redefinition of property");}}else{other=propHash[name]={init:false,get:false,set:false};}other[kind]=true;};// ### Expression parsing
+  // These nest, from the most general expression type at the top to
+  // 'atomic', nondivisible expression types at the bottom. Most of
+  // the functions will simply let the function(s) below them parse,
+  // and, *if* the syntactic construct they handle is present, wrap
+  // the AST node that the inner parser gave them in another node.
+  // Parse a full expression. The optional arguments are used to
+  // forbid the `in` operator (in for loops initalization expressions)
+  // and provide reference for storing '=' operator inside shorthand
+  // property assignment in contexts where both object expression
+  // and object pattern might appear (so it's possible to raise
+  // delayed syntax error at correct position).
+  pp$3.parseExpression=function(noIn,refDestructuringErrors){var startPos=this.start,startLoc=this.startLoc;var expr=this.parseMaybeAssign(noIn,refDestructuringErrors);if(this.type===types$2.comma){var node=this.startNodeAt(startPos,startLoc);node.expressions=[expr];while(this.eat(types$2.comma)){node.expressions.push(this.parseMaybeAssign(noIn,refDestructuringErrors));}return this.finishNode(node,"SequenceExpression");}return expr;};// Parse an assignment expression. This includes applications of
+  // operators like `+=`.
+  pp$3.parseMaybeAssign=function(noIn,refDestructuringErrors,afterLeftParse){if(this.isContextual("yield")){if(this.inGenerator){return this.parseYield(noIn);}// The tokenizer will assume an expression is allowed after
+  // `yield`, but this isn't that kind of yield
+  else{this.exprAllowed=false;}}var ownDestructuringErrors=false,oldParenAssign=-1,oldTrailingComma=-1,oldShorthandAssign=-1;if(refDestructuringErrors){oldParenAssign=refDestructuringErrors.parenthesizedAssign;oldTrailingComma=refDestructuringErrors.trailingComma;oldShorthandAssign=refDestructuringErrors.shorthandAssign;refDestructuringErrors.parenthesizedAssign=refDestructuringErrors.trailingComma=refDestructuringErrors.shorthandAssign=-1;}else{refDestructuringErrors=new DestructuringErrors();ownDestructuringErrors=true;}var startPos=this.start,startLoc=this.startLoc;if(this.type===types$2.parenL||this.type===types$2.name){this.potentialArrowAt=this.start;}var left=this.parseMaybeConditional(noIn,refDestructuringErrors);if(afterLeftParse){left=afterLeftParse.call(this,left,startPos,startLoc);}if(this.type.isAssign){var node=this.startNodeAt(startPos,startLoc);node.operator=this.value;node.left=this.type===types$2.eq?this.toAssignable(left,false,refDestructuringErrors):left;if(!ownDestructuringErrors){DestructuringErrors.call(refDestructuringErrors);}refDestructuringErrors.shorthandAssign=-1;// reset because shorthand default was used correctly
+  this.checkLVal(left);this.next();node.right=this.parseMaybeAssign(noIn);return this.finishNode(node,"AssignmentExpression");}else{if(ownDestructuringErrors){this.checkExpressionErrors(refDestructuringErrors,true);}}if(oldParenAssign>-1){refDestructuringErrors.parenthesizedAssign=oldParenAssign;}if(oldTrailingComma>-1){refDestructuringErrors.trailingComma=oldTrailingComma;}if(oldShorthandAssign>-1){refDestructuringErrors.shorthandAssign=oldShorthandAssign;}return left;};// Parse a ternary conditional (`?:`) operator.
+  pp$3.parseMaybeConditional=function(noIn,refDestructuringErrors){var startPos=this.start,startLoc=this.startLoc;var expr=this.parseExprOps(noIn,refDestructuringErrors);if(this.checkExpressionErrors(refDestructuringErrors)){return expr;}if(this.eat(types$2.question)){var node=this.startNodeAt(startPos,startLoc);node.test=expr;node.consequent=this.parseMaybeAssign();this.expect(types$2.colon);node.alternate=this.parseMaybeAssign(noIn);return this.finishNode(node,"ConditionalExpression");}return expr;};// Start the precedence parser.
+  pp$3.parseExprOps=function(noIn,refDestructuringErrors){var startPos=this.start,startLoc=this.startLoc;var expr=this.parseMaybeUnary(refDestructuringErrors,false);if(this.checkExpressionErrors(refDestructuringErrors)){return expr;}return expr.start===startPos&&expr.type==="ArrowFunctionExpression"?expr:this.parseExprOp(expr,startPos,startLoc,-1,noIn);};// Parse binary operators with the operator precedence parsing
+  // algorithm. `left` is the left-hand side of the operator.
+  // `minPrec` provides context that allows the function to stop and
+  // defer further parser to one of its callers when it encounters an
+  // operator that has a lower precedence than the set it is parsing.
+  pp$3.parseExprOp=function(left,leftStartPos,leftStartLoc,minPrec,noIn){var prec=this.type.binop;if(prec!=null&&(!noIn||this.type!==types$2._in)){if(prec>minPrec){var logical=this.type===types$2.logicalOR||this.type===types$2.logicalAND;var op=this.value;this.next();var startPos=this.start,startLoc=this.startLoc;var right=this.parseExprOp(this.parseMaybeUnary(null,false),startPos,startLoc,prec,noIn);var node=this.buildBinary(leftStartPos,leftStartLoc,left,right,op,logical);return this.parseExprOp(node,leftStartPos,leftStartLoc,minPrec,noIn);}}return left;};pp$3.buildBinary=function(startPos,startLoc,left,right,op,logical){var node=this.startNodeAt(startPos,startLoc);node.left=left;node.operator=op;node.right=right;return this.finishNode(node,logical?"LogicalExpression":"BinaryExpression");};// Parse unary operators, both prefix and postfix.
+  pp$3.parseMaybeUnary=function(refDestructuringErrors,sawUnary){var startPos=this.start,startLoc=this.startLoc,expr;if(this.isContextual("await")&&(this.inAsync||!this.inFunction&&this.options.allowAwaitOutsideFunction)){expr=this.parseAwait();sawUnary=true;}else if(this.type.prefix){var node=this.startNode(),update=this.type===types$2.incDec;node.operator=this.value;node.prefix=true;this.next();node.argument=this.parseMaybeUnary(null,true);this.checkExpressionErrors(refDestructuringErrors,true);if(update){this.checkLVal(node.argument);}else if(this.strict&&node.operator==="delete"&&node.argument.type==="Identifier"){this.raiseRecoverable(node.start,"Deleting local variable in strict mode");}else{sawUnary=true;}expr=this.finishNode(node,update?"UpdateExpression":"UnaryExpression");}else{expr=this.parseExprSubscripts(refDestructuringErrors);if(this.checkExpressionErrors(refDestructuringErrors)){return expr;}while(this.type.postfix&&!this.canInsertSemicolon()){var node$1=this.startNodeAt(startPos,startLoc);node$1.operator=this.value;node$1.prefix=false;node$1.argument=expr;this.checkLVal(expr);this.next();expr=this.finishNode(node$1,"UpdateExpression");}}if(!sawUnary&&this.eat(types$2.starstar)){return this.buildBinary(startPos,startLoc,expr,this.parseMaybeUnary(null,false),"**",false);}else{return expr;}};// Parse call, dot, and `[]`-subscript expressions.
+  pp$3.parseExprSubscripts=function(refDestructuringErrors){var startPos=this.start,startLoc=this.startLoc;var expr=this.parseExprAtom(refDestructuringErrors);var skipArrowSubscripts=expr.type==="ArrowFunctionExpression"&&this.input.slice(this.lastTokStart,this.lastTokEnd)!==")";if(this.checkExpressionErrors(refDestructuringErrors)||skipArrowSubscripts){return expr;}var result=this.parseSubscripts(expr,startPos,startLoc);if(refDestructuringErrors&&result.type==="MemberExpression"){if(refDestructuringErrors.parenthesizedAssign>=result.start){refDestructuringErrors.parenthesizedAssign=-1;}if(refDestructuringErrors.parenthesizedBind>=result.start){refDestructuringErrors.parenthesizedBind=-1;}}return result;};pp$3.parseSubscripts=function(base,startPos,startLoc,noCalls){var maybeAsyncArrow=this.options.ecmaVersion>=8&&base.type==="Identifier"&&base.name==="async"&&this.lastTokEnd===base.end&&!this.canInsertSemicolon()&&this.input.slice(base.start,base.end)==="async";while(true){var element=this.parseSubscript(base,startPos,startLoc,noCalls,maybeAsyncArrow);if(element===base||element.type==="ArrowFunctionExpression"){return element;}base=element;}};pp$3.parseSubscript=function(base,startPos,startLoc,noCalls,maybeAsyncArrow){var computed=this.eat(types$2.bracketL);if(computed||this.eat(types$2.dot)){var node=this.startNodeAt(startPos,startLoc);node.object=base;node.property=computed?this.parseExpression():this.parseIdent(this.options.allowReserved!=="never");node.computed=!!computed;if(computed){this.expect(types$2.bracketR);}base=this.finishNode(node,"MemberExpression");}else if(!noCalls&&this.eat(types$2.parenL)){var refDestructuringErrors=new DestructuringErrors(),oldYieldPos=this.yieldPos,oldAwaitPos=this.awaitPos,oldAwaitIdentPos=this.awaitIdentPos;this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;var exprList=this.parseExprList(types$2.parenR,this.options.ecmaVersion>=8,false,refDestructuringErrors);if(maybeAsyncArrow&&!this.canInsertSemicolon()&&this.eat(types$2.arrow)){this.checkPatternErrors(refDestructuringErrors,false);this.checkYieldAwaitInDefaultParams();if(this.awaitIdentPos>0){this.raise(this.awaitIdentPos,"Cannot use 'await' as identifier inside an async function");}this.yieldPos=oldYieldPos;this.awaitPos=oldAwaitPos;this.awaitIdentPos=oldAwaitIdentPos;return this.parseArrowExpression(this.startNodeAt(startPos,startLoc),exprList,true);}this.checkExpressionErrors(refDestructuringErrors,true);this.yieldPos=oldYieldPos||this.yieldPos;this.awaitPos=oldAwaitPos||this.awaitPos;this.awaitIdentPos=oldAwaitIdentPos||this.awaitIdentPos;var node$1=this.startNodeAt(startPos,startLoc);node$1.callee=base;node$1.arguments=exprList;base=this.finishNode(node$1,"CallExpression");}else if(this.type===types$2.backQuote){var node$2=this.startNodeAt(startPos,startLoc);node$2.tag=base;node$2.quasi=this.parseTemplate({isTagged:true});base=this.finishNode(node$2,"TaggedTemplateExpression");}return base;};// Parse an atomic expression — either a single token that is an
+  // expression, an expression started by a keyword like `function` or
+  // `new`, or an expression wrapped in punctuation like `()`, `[]`,
+  // or `{}`.
+  pp$3.parseExprAtom=function(refDestructuringErrors){// If a division operator appears in an expression position, the
+  // tokenizer got confused, and we force it to read a regexp instead.
+  if(this.type===types$2.slash){this.readRegexp();}var node,canBeArrow=this.potentialArrowAt===this.start;switch(this.type){case types$2._super:if(!this.allowSuper){this.raise(this.start,"'super' keyword outside a method");}node=this.startNode();this.next();if(this.type===types$2.parenL&&!this.allowDirectSuper){this.raise(node.start,"super() call outside constructor of a subclass");}// The `super` keyword can appear at below:
+  // SuperProperty:
+  //     super [ Expression ]
+  //     super . IdentifierName
+  // SuperCall:
+  //     super Arguments
+  if(this.type!==types$2.dot&&this.type!==types$2.bracketL&&this.type!==types$2.parenL){this.unexpected();}return this.finishNode(node,"Super");case types$2._this:node=this.startNode();this.next();return this.finishNode(node,"ThisExpression");case types$2.name:var startPos=this.start,startLoc=this.startLoc,containsEsc=this.containsEsc;var id=this.parseIdent(false);if(this.options.ecmaVersion>=8&&!containsEsc&&id.name==="async"&&!this.canInsertSemicolon()&&this.eat(types$2._function)){return this.parseFunction(this.startNodeAt(startPos,startLoc),0,false,true);}if(canBeArrow&&!this.canInsertSemicolon()){if(this.eat(types$2.arrow)){return this.parseArrowExpression(this.startNodeAt(startPos,startLoc),[id],false);}if(this.options.ecmaVersion>=8&&id.name==="async"&&this.type===types$2.name&&!containsEsc){id=this.parseIdent(false);if(this.canInsertSemicolon()||!this.eat(types$2.arrow)){this.unexpected();}return this.parseArrowExpression(this.startNodeAt(startPos,startLoc),[id],true);}}return id;case types$2.regexp:var value=this.value;node=this.parseLiteral(value.value);node.regex={pattern:value.pattern,flags:value.flags};return node;case types$2.num:case types$2.string:return this.parseLiteral(this.value);case types$2._null:case types$2._true:case types$2._false:node=this.startNode();node.value=this.type===types$2._null?null:this.type===types$2._true;node.raw=this.type.keyword;this.next();return this.finishNode(node,"Literal");case types$2.parenL:var start=this.start,expr=this.parseParenAndDistinguishExpression(canBeArrow);if(refDestructuringErrors){if(refDestructuringErrors.parenthesizedAssign<0&&!this.isSimpleAssignTarget(expr)){refDestructuringErrors.parenthesizedAssign=start;}if(refDestructuringErrors.parenthesizedBind<0){refDestructuringErrors.parenthesizedBind=start;}}return expr;case types$2.bracketL:node=this.startNode();this.next();node.elements=this.parseExprList(types$2.bracketR,true,true,refDestructuringErrors);return this.finishNode(node,"ArrayExpression");case types$2.braceL:return this.parseObj(false,refDestructuringErrors);case types$2._function:node=this.startNode();this.next();return this.parseFunction(node,0);case types$2._class:return this.parseClass(this.startNode(),false);case types$2._new:return this.parseNew();case types$2.backQuote:return this.parseTemplate();case types$2._import:if(this.options.ecmaVersion>=11){return this.parseExprImport();}else{return this.unexpected();}default:this.unexpected();}};pp$3.parseExprImport=function(){var node=this.startNode();this.next();// skip `import`
+  switch(this.type){case types$2.parenL:return this.parseDynamicImport(node);default:this.unexpected();}};pp$3.parseDynamicImport=function(node){this.next();// skip `(`
+  // Parse node.source.
+  node.source=this.parseMaybeAssign();// Verify ending.
+  if(!this.eat(types$2.parenR)){var errorPos=this.start;if(this.eat(types$2.comma)&&this.eat(types$2.parenR)){this.raiseRecoverable(errorPos,"Trailing comma is not allowed in import()");}else{this.unexpected(errorPos);}}return this.finishNode(node,"ImportExpression");};pp$3.parseLiteral=function(value){var node=this.startNode();node.value=value;node.raw=this.input.slice(this.start,this.end);if(node.raw.charCodeAt(node.raw.length-1)===110){node.bigint=node.raw.slice(0,-1);}this.next();return this.finishNode(node,"Literal");};pp$3.parseParenExpression=function(){this.expect(types$2.parenL);var val=this.parseExpression();this.expect(types$2.parenR);return val;};pp$3.parseParenAndDistinguishExpression=function(canBeArrow){var startPos=this.start,startLoc=this.startLoc,val,allowTrailingComma=this.options.ecmaVersion>=8;if(this.options.ecmaVersion>=6){this.next();var innerStartPos=this.start,innerStartLoc=this.startLoc;var exprList=[],first=true,lastIsComma=false;var refDestructuringErrors=new DestructuringErrors(),oldYieldPos=this.yieldPos,oldAwaitPos=this.awaitPos,spreadStart;this.yieldPos=0;this.awaitPos=0;// Do not save awaitIdentPos to allow checking awaits nested in parameters
+  while(this.type!==types$2.parenR){first?first=false:this.expect(types$2.comma);if(allowTrailingComma&&this.afterTrailingComma(types$2.parenR,true)){lastIsComma=true;break;}else if(this.type===types$2.ellipsis){spreadStart=this.start;exprList.push(this.parseParenItem(this.parseRestBinding()));if(this.type===types$2.comma){this.raise(this.start,"Comma is not permitted after the rest element");}break;}else{exprList.push(this.parseMaybeAssign(false,refDestructuringErrors,this.parseParenItem));}}var innerEndPos=this.start,innerEndLoc=this.startLoc;this.expect(types$2.parenR);if(canBeArrow&&!this.canInsertSemicolon()&&this.eat(types$2.arrow)){this.checkPatternErrors(refDestructuringErrors,false);this.checkYieldAwaitInDefaultParams();this.yieldPos=oldYieldPos;this.awaitPos=oldAwaitPos;return this.parseParenArrowList(startPos,startLoc,exprList);}if(!exprList.length||lastIsComma){this.unexpected(this.lastTokStart);}if(spreadStart){this.unexpected(spreadStart);}this.checkExpressionErrors(refDestructuringErrors,true);this.yieldPos=oldYieldPos||this.yieldPos;this.awaitPos=oldAwaitPos||this.awaitPos;if(exprList.length>1){val=this.startNodeAt(innerStartPos,innerStartLoc);val.expressions=exprList;this.finishNodeAt(val,"SequenceExpression",innerEndPos,innerEndLoc);}else{val=exprList[0];}}else{val=this.parseParenExpression();}if(this.options.preserveParens){var par=this.startNodeAt(startPos,startLoc);par.expression=val;return this.finishNode(par,"ParenthesizedExpression");}else{return val;}};pp$3.parseParenItem=function(item){return item;};pp$3.parseParenArrowList=function(startPos,startLoc,exprList){return this.parseArrowExpression(this.startNodeAt(startPos,startLoc),exprList);};// New's precedence is slightly tricky. It must allow its argument to
+  // be a `[]` or dot subscript expression, but not a call — at least,
+  // not without wrapping it in parentheses. Thus, it uses the noCalls
+  // argument to parseSubscripts to prevent it from consuming the
+  // argument list.
+  var empty$1=[];pp$3.parseNew=function(){var node=this.startNode();var meta=this.parseIdent(true);if(this.options.ecmaVersion>=6&&this.eat(types$2.dot)){node.meta=meta;var containsEsc=this.containsEsc;node.property=this.parseIdent(true);if(node.property.name!=="target"||containsEsc){this.raiseRecoverable(node.property.start,"The only valid meta property for new is new.target");}if(!this.inNonArrowFunction()){this.raiseRecoverable(node.start,"new.target can only be used in functions");}return this.finishNode(node,"MetaProperty");}var startPos=this.start,startLoc=this.startLoc,isImport=this.type===types$2._import;node.callee=this.parseSubscripts(this.parseExprAtom(),startPos,startLoc,true);if(isImport&&node.callee.type==="ImportExpression"){this.raise(startPos,"Cannot use new with import()");}if(this.eat(types$2.parenL)){node.arguments=this.parseExprList(types$2.parenR,this.options.ecmaVersion>=8,false);}else{node.arguments=empty$1;}return this.finishNode(node,"NewExpression");};// Parse template expression.
+  pp$3.parseTemplateElement=function(ref){var isTagged=ref.isTagged;var elem=this.startNode();if(this.type===types$2.invalidTemplate){if(!isTagged){this.raiseRecoverable(this.start,"Bad escape sequence in untagged template literal");}elem.value={raw:this.value,cooked:null};}else{elem.value={raw:this.input.slice(this.start,this.end).replace(/\r\n?/g,"\n"),cooked:this.value};}this.next();elem.tail=this.type===types$2.backQuote;return this.finishNode(elem,"TemplateElement");};pp$3.parseTemplate=function(ref){if(ref===void 0)ref={};var isTagged=ref.isTagged;if(isTagged===void 0)isTagged=false;var node=this.startNode();this.next();node.expressions=[];var curElt=this.parseTemplateElement({isTagged:isTagged});node.quasis=[curElt];while(!curElt.tail){if(this.type===types$2.eof){this.raise(this.pos,"Unterminated template literal");}this.expect(types$2.dollarBraceL);node.expressions.push(this.parseExpression());this.expect(types$2.braceR);node.quasis.push(curElt=this.parseTemplateElement({isTagged:isTagged}));}this.next();return this.finishNode(node,"TemplateLiteral");};pp$3.isAsyncProp=function(prop){return !prop.computed&&prop.key.type==="Identifier"&&prop.key.name==="async"&&(this.type===types$2.name||this.type===types$2.num||this.type===types$2.string||this.type===types$2.bracketL||this.type.keyword||this.options.ecmaVersion>=9&&this.type===types$2.star)&&!lineBreak.test(this.input.slice(this.lastTokEnd,this.start));};// Parse an object literal or binding pattern.
+  pp$3.parseObj=function(isPattern,refDestructuringErrors){var node=this.startNode(),first=true,propHash={};node.properties=[];this.next();while(!this.eat(types$2.braceR)){if(!first){this.expect(types$2.comma);if(this.afterTrailingComma(types$2.braceR)){break;}}else{first=false;}var prop=this.parseProperty(isPattern,refDestructuringErrors);if(!isPattern){this.checkPropClash(prop,propHash,refDestructuringErrors);}node.properties.push(prop);}return this.finishNode(node,isPattern?"ObjectPattern":"ObjectExpression");};pp$3.parseProperty=function(isPattern,refDestructuringErrors){var prop=this.startNode(),isGenerator,isAsync,startPos,startLoc;if(this.options.ecmaVersion>=9&&this.eat(types$2.ellipsis)){if(isPattern){prop.argument=this.parseIdent(false);if(this.type===types$2.comma){this.raise(this.start,"Comma is not permitted after the rest element");}return this.finishNode(prop,"RestElement");}// To disallow parenthesized identifier via `this.toAssignable()`.
+  if(this.type===types$2.parenL&&refDestructuringErrors){if(refDestructuringErrors.parenthesizedAssign<0){refDestructuringErrors.parenthesizedAssign=this.start;}if(refDestructuringErrors.parenthesizedBind<0){refDestructuringErrors.parenthesizedBind=this.start;}}// Parse argument.
+  prop.argument=this.parseMaybeAssign(false,refDestructuringErrors);// To disallow trailing comma via `this.toAssignable()`.
+  if(this.type===types$2.comma&&refDestructuringErrors&&refDestructuringErrors.trailingComma<0){refDestructuringErrors.trailingComma=this.start;}// Finish
+  return this.finishNode(prop,"SpreadElement");}if(this.options.ecmaVersion>=6){prop.method=false;prop.shorthand=false;if(isPattern||refDestructuringErrors){startPos=this.start;startLoc=this.startLoc;}if(!isPattern){isGenerator=this.eat(types$2.star);}}var containsEsc=this.containsEsc;this.parsePropertyName(prop);if(!isPattern&&!containsEsc&&this.options.ecmaVersion>=8&&!isGenerator&&this.isAsyncProp(prop)){isAsync=true;isGenerator=this.options.ecmaVersion>=9&&this.eat(types$2.star);this.parsePropertyName(prop,refDestructuringErrors);}else{isAsync=false;}this.parsePropertyValue(prop,isPattern,isGenerator,isAsync,startPos,startLoc,refDestructuringErrors,containsEsc);return this.finishNode(prop,"Property");};pp$3.parsePropertyValue=function(prop,isPattern,isGenerator,isAsync,startPos,startLoc,refDestructuringErrors,containsEsc){if((isGenerator||isAsync)&&this.type===types$2.colon){this.unexpected();}if(this.eat(types$2.colon)){prop.value=isPattern?this.parseMaybeDefault(this.start,this.startLoc):this.parseMaybeAssign(false,refDestructuringErrors);prop.kind="init";}else if(this.options.ecmaVersion>=6&&this.type===types$2.parenL){if(isPattern){this.unexpected();}prop.kind="init";prop.method=true;prop.value=this.parseMethod(isGenerator,isAsync);}else if(!isPattern&&!containsEsc&&this.options.ecmaVersion>=5&&!prop.computed&&prop.key.type==="Identifier"&&(prop.key.name==="get"||prop.key.name==="set")&&this.type!==types$2.comma&&this.type!==types$2.braceR){if(isGenerator||isAsync){this.unexpected();}prop.kind=prop.key.name;this.parsePropertyName(prop);prop.value=this.parseMethod(false);var paramCount=prop.kind==="get"?0:1;if(prop.value.params.length!==paramCount){var start=prop.value.start;if(prop.kind==="get"){this.raiseRecoverable(start,"getter should have no params");}else{this.raiseRecoverable(start,"setter should have exactly one param");}}else{if(prop.kind==="set"&&prop.value.params[0].type==="RestElement"){this.raiseRecoverable(prop.value.params[0].start,"Setter cannot use rest params");}}}else if(this.options.ecmaVersion>=6&&!prop.computed&&prop.key.type==="Identifier"){if(isGenerator||isAsync){this.unexpected();}this.checkUnreserved(prop.key);if(prop.key.name==="await"&&!this.awaitIdentPos){this.awaitIdentPos=startPos;}prop.kind="init";if(isPattern){prop.value=this.parseMaybeDefault(startPos,startLoc,prop.key);}else if(this.type===types$2.eq&&refDestructuringErrors){if(refDestructuringErrors.shorthandAssign<0){refDestructuringErrors.shorthandAssign=this.start;}prop.value=this.parseMaybeDefault(startPos,startLoc,prop.key);}else{prop.value=prop.key;}prop.shorthand=true;}else{this.unexpected();}};pp$3.parsePropertyName=function(prop){if(this.options.ecmaVersion>=6){if(this.eat(types$2.bracketL)){prop.computed=true;prop.key=this.parseMaybeAssign();this.expect(types$2.bracketR);return prop.key;}else{prop.computed=false;}}return prop.key=this.type===types$2.num||this.type===types$2.string?this.parseExprAtom():this.parseIdent(this.options.allowReserved!=="never");};// Initialize empty function node.
+  pp$3.initFunction=function(node){node.id=null;if(this.options.ecmaVersion>=6){node.generator=node.expression=false;}if(this.options.ecmaVersion>=8){node.async=false;}};// Parse object or class method.
+  pp$3.parseMethod=function(isGenerator,isAsync,allowDirectSuper){var node=this.startNode(),oldYieldPos=this.yieldPos,oldAwaitPos=this.awaitPos,oldAwaitIdentPos=this.awaitIdentPos;this.initFunction(node);if(this.options.ecmaVersion>=6){node.generator=isGenerator;}if(this.options.ecmaVersion>=8){node.async=!!isAsync;}this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;this.enterScope(functionFlags(isAsync,node.generator)|SCOPE_SUPER|(allowDirectSuper?SCOPE_DIRECT_SUPER:0));this.expect(types$2.parenL);node.params=this.parseBindingList(types$2.parenR,false,this.options.ecmaVersion>=8);this.checkYieldAwaitInDefaultParams();this.parseFunctionBody(node,false,true);this.yieldPos=oldYieldPos;this.awaitPos=oldAwaitPos;this.awaitIdentPos=oldAwaitIdentPos;return this.finishNode(node,"FunctionExpression");};// Parse arrow function expression with given parameters.
+  pp$3.parseArrowExpression=function(node,params,isAsync){var oldYieldPos=this.yieldPos,oldAwaitPos=this.awaitPos,oldAwaitIdentPos=this.awaitIdentPos;this.enterScope(functionFlags(isAsync,false)|SCOPE_ARROW);this.initFunction(node);if(this.options.ecmaVersion>=8){node.async=!!isAsync;}this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;node.params=this.toAssignableList(params,true);this.parseFunctionBody(node,true,false);this.yieldPos=oldYieldPos;this.awaitPos=oldAwaitPos;this.awaitIdentPos=oldAwaitIdentPos;return this.finishNode(node,"ArrowFunctionExpression");};// Parse function body and check parameters.
+  pp$3.parseFunctionBody=function(node,isArrowFunction,isMethod){var isExpression=isArrowFunction&&this.type!==types$2.braceL;var oldStrict=this.strict,useStrict=false;if(isExpression){node.body=this.parseMaybeAssign();node.expression=true;this.checkParams(node,false);}else{var nonSimple=this.options.ecmaVersion>=7&&!this.isSimpleParamList(node.params);if(!oldStrict||nonSimple){useStrict=this.strictDirective(this.end);// If this is a strict mode function, verify that argument names
+  // are not repeated, and it does not try to bind the words `eval`
+  // or `arguments`.
+  if(useStrict&&nonSimple){this.raiseRecoverable(node.start,"Illegal 'use strict' directive in function with non-simple parameter list");}}// Start a new scope with regard to labels and the `inFunction`
+  // flag (restore them to their old value afterwards).
+  var oldLabels=this.labels;this.labels=[];if(useStrict){this.strict=true;}// Add the params to varDeclaredNames to ensure that an error is thrown
+  // if a let/const declaration in the function clashes with one of the params.
+  this.checkParams(node,!oldStrict&&!useStrict&&!isArrowFunction&&!isMethod&&this.isSimpleParamList(node.params));node.body=this.parseBlock(false);node.expression=false;this.adaptDirectivePrologue(node.body.body);this.labels=oldLabels;}this.exitScope();// Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'
+  if(this.strict&&node.id){this.checkLVal(node.id,BIND_OUTSIDE);}this.strict=oldStrict;};pp$3.isSimpleParamList=function(params){for(var i=0,list=params;i<list.length;i+=1){var param=list[i];if(param.type!=="Identifier"){return false;}}return true;};// Checks function params for various disallowed patterns such as using "eval"
+  // or "arguments" and duplicate parameters.
+  pp$3.checkParams=function(node,allowDuplicates){var nameHash={};for(var i=0,list=node.params;i<list.length;i+=1){var param=list[i];this.checkLVal(param,BIND_VAR,allowDuplicates?null:nameHash);}};// Parses a comma-separated list of expressions, and returns them as
+  // an array. `close` is the token type that ends the list, and
+  // `allowEmpty` can be turned on to allow subsequent commas with
+  // nothing in between them to be parsed as `null` (which is needed
+  // for array literals).
+  pp$3.parseExprList=function(close,allowTrailingComma,allowEmpty,refDestructuringErrors){var elts=[],first=true;while(!this.eat(close)){if(!first){this.expect(types$2.comma);if(allowTrailingComma&&this.afterTrailingComma(close)){break;}}else{first=false;}var elt=void 0;if(allowEmpty&&this.type===types$2.comma){elt=null;}else if(this.type===types$2.ellipsis){elt=this.parseSpread(refDestructuringErrors);if(refDestructuringErrors&&this.type===types$2.comma&&refDestructuringErrors.trailingComma<0){refDestructuringErrors.trailingComma=this.start;}}else{elt=this.parseMaybeAssign(false,refDestructuringErrors);}elts.push(elt);}return elts;};pp$3.checkUnreserved=function(ref){var start=ref.start;var end=ref.end;var name=ref.name;if(this.inGenerator&&name==="yield"){this.raiseRecoverable(start,"Cannot use 'yield' as identifier inside a generator");}if(this.inAsync&&name==="await"){this.raiseRecoverable(start,"Cannot use 'await' as identifier inside an async function");}if(this.keywords.test(name)){this.raise(start,"Unexpected keyword '"+name+"'");}if(this.options.ecmaVersion<6&&this.input.slice(start,end).indexOf("\\")!==-1){return;}var re=this.strict?this.reservedWordsStrict:this.reservedWords;if(re.test(name)){if(!this.inAsync&&name==="await"){this.raiseRecoverable(start,"Cannot use keyword 'await' outside an async function");}this.raiseRecoverable(start,"The keyword '"+name+"' is reserved");}};// Parse the next token as an identifier. If `liberal` is true (used
+  // when parsing properties), it will also convert keywords into
+  // identifiers.
+  pp$3.parseIdent=function(liberal,isBinding){var node=this.startNode();if(this.type===types$2.name){node.name=this.value;}else if(this.type.keyword){node.name=this.type.keyword;// To fix https://github.com/acornjs/acorn/issues/575
+  // `class` and `function` keywords push new context into this.context.
+  // But there is no chance to pop the context if the keyword is consumed as an identifier such as a property name.
+  // If the previous token is a dot, this does not apply because the context-managing code already ignored the keyword
+  if((node.name==="class"||node.name==="function")&&(this.lastTokEnd!==this.lastTokStart+1||this.input.charCodeAt(this.lastTokStart)!==46)){this.context.pop();}}else{this.unexpected();}this.next();this.finishNode(node,"Identifier");if(!liberal){this.checkUnreserved(node);if(node.name==="await"&&!this.awaitIdentPos){this.awaitIdentPos=node.start;}}return node;};// Parses yield expression inside generator.
+  pp$3.parseYield=function(noIn){if(!this.yieldPos){this.yieldPos=this.start;}var node=this.startNode();this.next();if(this.type===types$2.semi||this.canInsertSemicolon()||this.type!==types$2.star&&!this.type.startsExpr){node.delegate=false;node.argument=null;}else{node.delegate=this.eat(types$2.star);node.argument=this.parseMaybeAssign(noIn);}return this.finishNode(node,"YieldExpression");};pp$3.parseAwait=function(){if(!this.awaitPos){this.awaitPos=this.start;}var node=this.startNode();this.next();node.argument=this.parseMaybeUnary(null,true);return this.finishNode(node,"AwaitExpression");};var pp$4=Parser.prototype;// This function is used to raise exceptions on parse errors. It
+  // takes an offset integer (into the current `input`) to indicate
+  // the location of the error, attaches the position to the end
+  // of the error message, and then raises a `SyntaxError` with that
+  // message.
+  pp$4.raise=function(pos,message){var loc=getLineInfo(this.input,pos);message+=" ("+loc.line+":"+loc.column+")";var err=new SyntaxError(message);err.pos=pos;err.loc=loc;err.raisedAt=this.pos;throw err;};pp$4.raiseRecoverable=pp$4.raise;pp$4.curPosition=function(){if(this.options.locations){return new Position(this.curLine,this.pos-this.lineStart);}};var pp$5=Parser.prototype;var Scope=function Scope(flags){this.flags=flags;// A list of var-declared names in the current lexical scope
+  this.var=[];// A list of lexically-declared names in the current lexical scope
+  this.lexical=[];// A list of lexically-declared FunctionDeclaration names in the current lexical scope
+  this.functions=[];};// The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names.
+  pp$5.enterScope=function(flags){this.scopeStack.push(new Scope(flags));};pp$5.exitScope=function(){this.scopeStack.pop();};// The spec says:
+  // > At the top level of a function, or script, function declarations are
+  // > treated like var declarations rather than like lexical declarations.
+  pp$5.treatFunctionsAsVarInScope=function(scope){return scope.flags&SCOPE_FUNCTION||!this.inModule&&scope.flags&SCOPE_TOP;};pp$5.declareName=function(name,bindingType,pos){var redeclared=false;if(bindingType===BIND_LEXICAL){var scope=this.currentScope();redeclared=scope.lexical.indexOf(name)>-1||scope.functions.indexOf(name)>-1||scope.var.indexOf(name)>-1;scope.lexical.push(name);if(this.inModule&&scope.flags&SCOPE_TOP){delete this.undefinedExports[name];}}else if(bindingType===BIND_SIMPLE_CATCH){var scope$1=this.currentScope();scope$1.lexical.push(name);}else if(bindingType===BIND_FUNCTION){var scope$2=this.currentScope();if(this.treatFunctionsAsVar){redeclared=scope$2.lexical.indexOf(name)>-1;}else{redeclared=scope$2.lexical.indexOf(name)>-1||scope$2.var.indexOf(name)>-1;}scope$2.functions.push(name);}else{for(var i=this.scopeStack.length-1;i>=0;--i){var scope$3=this.scopeStack[i];if(scope$3.lexical.indexOf(name)>-1&&!(scope$3.flags&SCOPE_SIMPLE_CATCH&&scope$3.lexical[0]===name)||!this.treatFunctionsAsVarInScope(scope$3)&&scope$3.functions.indexOf(name)>-1){redeclared=true;break;}scope$3.var.push(name);if(this.inModule&&scope$3.flags&SCOPE_TOP){delete this.undefinedExports[name];}if(scope$3.flags&SCOPE_VAR){break;}}}if(redeclared){this.raiseRecoverable(pos,"Identifier '"+name+"' has already been declared");}};pp$5.checkLocalExport=function(id){// scope.functions must be empty as Module code is always strict.
+  if(this.scopeStack[0].lexical.indexOf(id.name)===-1&&this.scopeStack[0].var.indexOf(id.name)===-1){this.undefinedExports[id.name]=id;}};pp$5.currentScope=function(){return this.scopeStack[this.scopeStack.length-1];};pp$5.currentVarScope=function(){for(var i=this.scopeStack.length-1;;i--){var scope=this.scopeStack[i];if(scope.flags&SCOPE_VAR){return scope;}}};// Could be useful for `this`, `new.target`, `super()`, `super.property`, and `super[property]`.
+  pp$5.currentThisScope=function(){for(var i=this.scopeStack.length-1;;i--){var scope=this.scopeStack[i];if(scope.flags&SCOPE_VAR&&!(scope.flags&SCOPE_ARROW)){return scope;}}};var Node=function Node(parser,pos,loc){this.type="";this.start=pos;this.end=0;if(parser.options.locations){this.loc=new SourceLocation(parser,loc);}if(parser.options.directSourceFile){this.sourceFile=parser.options.directSourceFile;}if(parser.options.ranges){this.range=[pos,0];}};// Start an AST node, attaching a start offset.
+  var pp$6=Parser.prototype;pp$6.startNode=function(){return new Node(this,this.start,this.startLoc);};pp$6.startNodeAt=function(pos,loc){return new Node(this,pos,loc);};// Finish an AST node, adding `type` and `end` properties.
+  function finishNodeAt(node,type,pos,loc){node.type=type;node.end=pos;if(this.options.locations){node.loc.end=loc;}if(this.options.ranges){node.range[1]=pos;}return node;}pp$6.finishNode=function(node,type){return finishNodeAt.call(this,node,type,this.lastTokEnd,this.lastTokEndLoc);};// Finish node at given position
+  pp$6.finishNodeAt=function(node,type,pos,loc){return finishNodeAt.call(this,node,type,pos,loc);};// The algorithm used to determine whether a regexp can appear at a
+  var TokContext=function TokContext(token,isExpr,preserveSpace,override,generator){this.token=token;this.isExpr=!!isExpr;this.preserveSpace=!!preserveSpace;this.override=override;this.generator=!!generator;};var types$1$1={b_stat:new TokContext("{",false),b_expr:new TokContext("{",true),b_tmpl:new TokContext("${",false),p_stat:new TokContext("(",false),p_expr:new TokContext("(",true),q_tmpl:new TokContext("`",true,true,function(p){return p.tryReadTemplateToken();}),f_stat:new TokContext("function",false),f_expr:new TokContext("function",true),f_expr_gen:new TokContext("function",true,false,null,true),f_gen:new TokContext("function",false,false,null,true)};var pp$7=Parser.prototype;pp$7.initialContext=function(){return [types$1$1.b_stat];};pp$7.braceIsBlock=function(prevType){var parent=this.curContext();if(parent===types$1$1.f_expr||parent===types$1$1.f_stat){return true;}if(prevType===types$2.colon&&(parent===types$1$1.b_stat||parent===types$1$1.b_expr)){return !parent.isExpr;}// The check for `tt.name && exprAllowed` detects whether we are
+  // after a `yield` or `of` construct. See the `updateContext` for
+  // `tt.name`.
+  if(prevType===types$2._return||prevType===types$2.name&&this.exprAllowed){return lineBreak.test(this.input.slice(this.lastTokEnd,this.start));}if(prevType===types$2._else||prevType===types$2.semi||prevType===types$2.eof||prevType===types$2.parenR||prevType===types$2.arrow){return true;}if(prevType===types$2.braceL){return parent===types$1$1.b_stat;}if(prevType===types$2._var||prevType===types$2._const||prevType===types$2.name){return false;}return !this.exprAllowed;};pp$7.inGeneratorContext=function(){for(var i=this.context.length-1;i>=1;i--){var context=this.context[i];if(context.token==="function"){return context.generator;}}return false;};pp$7.updateContext=function(prevType){var update,type=this.type;if(type.keyword&&prevType===types$2.dot){this.exprAllowed=false;}else if(update=type.updateContext){update.call(this,prevType);}else{this.exprAllowed=type.beforeExpr;}};// Token-specific context update code
+  types$2.parenR.updateContext=types$2.braceR.updateContext=function(){if(this.context.length===1){this.exprAllowed=true;return;}var out=this.context.pop();if(out===types$1$1.b_stat&&this.curContext().token==="function"){out=this.context.pop();}this.exprAllowed=!out.isExpr;};types$2.braceL.updateContext=function(prevType){this.context.push(this.braceIsBlock(prevType)?types$1$1.b_stat:types$1$1.b_expr);this.exprAllowed=true;};types$2.dollarBraceL.updateContext=function(){this.context.push(types$1$1.b_tmpl);this.exprAllowed=true;};types$2.parenL.updateContext=function(prevType){var statementParens=prevType===types$2._if||prevType===types$2._for||prevType===types$2._with||prevType===types$2._while;this.context.push(statementParens?types$1$1.p_stat:types$1$1.p_expr);this.exprAllowed=true;};types$2.incDec.updateContext=function(){// tokExprAllowed stays unchanged
+  };types$2._function.updateContext=types$2._class.updateContext=function(prevType){if(prevType.beforeExpr&&prevType!==types$2.semi&&prevType!==types$2._else&&!(prevType===types$2._return&&lineBreak.test(this.input.slice(this.lastTokEnd,this.start)))&&!((prevType===types$2.colon||prevType===types$2.braceL)&&this.curContext()===types$1$1.b_stat)){this.context.push(types$1$1.f_expr);}else{this.context.push(types$1$1.f_stat);}this.exprAllowed=false;};types$2.backQuote.updateContext=function(){if(this.curContext()===types$1$1.q_tmpl){this.context.pop();}else{this.context.push(types$1$1.q_tmpl);}this.exprAllowed=false;};types$2.star.updateContext=function(prevType){if(prevType===types$2._function){var index=this.context.length-1;if(this.context[index]===types$1$1.f_expr){this.context[index]=types$1$1.f_expr_gen;}else{this.context[index]=types$1$1.f_gen;}}this.exprAllowed=true;};types$2.name.updateContext=function(prevType){var allowed=false;if(this.options.ecmaVersion>=6&&prevType!==types$2.dot){if(this.value==="of"&&!this.exprAllowed||this.value==="yield"&&this.inGeneratorContext()){allowed=true;}}this.exprAllowed=allowed;};// This file contains Unicode properties extracted from the ECMAScript
+  // specification. The lists are extracted like so:
+  // $$('#table-binary-unicode-properties > figure > table > tbody > tr > td:nth-child(1) code').map(el => el.innerText)
+  // #table-binary-unicode-properties
+  var ecma9BinaryProperties="ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";var ecma10BinaryProperties=ecma9BinaryProperties+" Extended_Pictographic";var ecma11BinaryProperties=ecma10BinaryProperties;var unicodeBinaryProperties={9:ecma9BinaryProperties,10:ecma10BinaryProperties,11:ecma11BinaryProperties};// #table-unicode-general-category-values
+  var unicodeGeneralCategoryValues="Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";// #table-unicode-script-values
+  var ecma9ScriptValues="Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";var ecma10ScriptValues=ecma9ScriptValues+" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";var ecma11ScriptValues=ecma10ScriptValues+" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";var unicodeScriptValues={9:ecma9ScriptValues,10:ecma10ScriptValues,11:ecma11ScriptValues};var data={};function buildUnicodeData(ecmaVersion){var d=data[ecmaVersion]={binary:wordsRegexp(unicodeBinaryProperties[ecmaVersion]+" "+unicodeGeneralCategoryValues),nonBinary:{General_Category:wordsRegexp(unicodeGeneralCategoryValues),Script:wordsRegexp(unicodeScriptValues[ecmaVersion])}};d.nonBinary.Script_Extensions=d.nonBinary.Script;d.nonBinary.gc=d.nonBinary.General_Category;d.nonBinary.sc=d.nonBinary.Script;d.nonBinary.scx=d.nonBinary.Script_Extensions;}buildUnicodeData(9);buildUnicodeData(10);buildUnicodeData(11);var pp$8=Parser.prototype;var RegExpValidationState=function RegExpValidationState(parser){this.parser=parser;this.validFlags="gim"+(parser.options.ecmaVersion>=6?"uy":"")+(parser.options.ecmaVersion>=9?"s":"");this.unicodeProperties=data[parser.options.ecmaVersion>=11?11:parser.options.ecmaVersion];this.source="";this.flags="";this.start=0;this.switchU=false;this.switchN=false;this.pos=0;this.lastIntValue=0;this.lastStringValue="";this.lastAssertionIsQuantifiable=false;this.numCapturingParens=0;this.maxBackReference=0;this.groupNames=[];this.backReferenceNames=[];};RegExpValidationState.prototype.reset=function reset(start,pattern,flags){var unicode=flags.indexOf("u")!==-1;this.start=start|0;this.source=pattern+"";this.flags=flags;this.switchU=unicode&&this.parser.options.ecmaVersion>=6;this.switchN=unicode&&this.parser.options.ecmaVersion>=9;};RegExpValidationState.prototype.raise=function raise(message){this.parser.raiseRecoverable(this.start,"Invalid regular expression: /"+this.source+"/: "+message);};// If u flag is given, this returns the code point at the index (it combines a surrogate pair).
+  // Otherwise, this returns the code unit of the index (can be a part of a surrogate pair).
+  RegExpValidationState.prototype.at=function at(i){var s=this.source;var l=s.length;if(i>=l){return -1;}var c=s.charCodeAt(i);if(!this.switchU||c<=0xD7FF||c>=0xE000||i+1>=l){return c;}return (c<<10)+s.charCodeAt(i+1)-0x35FDC00;};RegExpValidationState.prototype.nextIndex=function nextIndex(i){var s=this.source;var l=s.length;if(i>=l){return l;}var c=s.charCodeAt(i);if(!this.switchU||c<=0xD7FF||c>=0xE000||i+1>=l){return i+1;}return i+2;};RegExpValidationState.prototype.current=function current(){return this.at(this.pos);};RegExpValidationState.prototype.lookahead=function lookahead(){return this.at(this.nextIndex(this.pos));};RegExpValidationState.prototype.advance=function advance(){this.pos=this.nextIndex(this.pos);};RegExpValidationState.prototype.eat=function eat(ch){if(this.current()===ch){this.advance();return true;}return false;};function codePointToString(ch){if(ch<=0xFFFF){return String.fromCharCode(ch);}ch-=0x10000;return String.fromCharCode((ch>>10)+0xD800,(ch&0x03FF)+0xDC00);}/**
+  	 * Validate the flags part of a given RegExpLiteral.
+  	 *
+  	 * @param {RegExpValidationState} state The state to validate RegExp.
+  	 * @returns {void}
+  	 */pp$8.validateRegExpFlags=function(state){var validFlags=state.validFlags;var flags=state.flags;for(var i=0;i<flags.length;i++){var flag=flags.charAt(i);if(validFlags.indexOf(flag)===-1){this.raise(state.start,"Invalid regular expression flag");}if(flags.indexOf(flag,i+1)>-1){this.raise(state.start,"Duplicate regular expression flag");}}};/**
+  	 * Validate the pattern part of a given RegExpLiteral.
+  	 *
+  	 * @param {RegExpValidationState} state The state to validate RegExp.
+  	 * @returns {void}
+  	 */pp$8.validateRegExpPattern=function(state){this.regexp_pattern(state);// The goal symbol for the parse is |Pattern[~U, ~N]|. If the result of
+  // parsing contains a |GroupName|, reparse with the goal symbol
+  // |Pattern[~U, +N]| and use this result instead. Throw a *SyntaxError*
+  // exception if _P_ did not conform to the grammar, if any elements of _P_
+  // were not matched by the parse, or if any Early Error conditions exist.
+  if(!state.switchN&&this.options.ecmaVersion>=9&&state.groupNames.length>0){state.switchN=true;this.regexp_pattern(state);}};// https://www.ecma-international.org/ecma-262/8.0/#prod-Pattern
+  pp$8.regexp_pattern=function(state){state.pos=0;state.lastIntValue=0;state.lastStringValue="";state.lastAssertionIsQuantifiable=false;state.numCapturingParens=0;state.maxBackReference=0;state.groupNames.length=0;state.backReferenceNames.length=0;this.regexp_disjunction(state);if(state.pos!==state.source.length){// Make the same messages as V8.
+  if(state.eat(0x29/* ) */)){state.raise("Unmatched ')'");}if(state.eat(0x5D/* [ */)||state.eat(0x7D/* } */)){state.raise("Lone quantifier brackets");}}if(state.maxBackReference>state.numCapturingParens){state.raise("Invalid escape");}for(var i=0,list=state.backReferenceNames;i<list.length;i+=1){var name=list[i];if(state.groupNames.indexOf(name)===-1){state.raise("Invalid named capture referenced");}}};// https://www.ecma-international.org/ecma-262/8.0/#prod-Disjunction
+  pp$8.regexp_disjunction=function(state){this.regexp_alternative(state);while(state.eat(0x7C/* | */)){this.regexp_alternative(state);}// Make the same message as V8.
+  if(this.regexp_eatQuantifier(state,true)){state.raise("Nothing to repeat");}if(state.eat(0x7B/* { */)){state.raise("Lone quantifier brackets");}};// https://www.ecma-international.org/ecma-262/8.0/#prod-Alternative
+  pp$8.regexp_alternative=function(state){while(state.pos<state.source.length&&this.regexp_eatTerm(state)){}};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Term
+  pp$8.regexp_eatTerm=function(state){if(this.regexp_eatAssertion(state)){// Handle `QuantifiableAssertion Quantifier` alternative.
+  // `state.lastAssertionIsQuantifiable` is true if the last eaten Assertion
+  // is a QuantifiableAssertion.
+  if(state.lastAssertionIsQuantifiable&&this.regexp_eatQuantifier(state)){// Make the same message as V8.
+  if(state.switchU){state.raise("Invalid quantifier");}}return true;}if(state.switchU?this.regexp_eatAtom(state):this.regexp_eatExtendedAtom(state)){this.regexp_eatQuantifier(state);return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-Assertion
+  pp$8.regexp_eatAssertion=function(state){var start=state.pos;state.lastAssertionIsQuantifiable=false;// ^, $
+  if(state.eat(0x5E/* ^ */)||state.eat(0x24/* $ */)){return true;}// \b \B
+  if(state.eat(0x5C/* \ */)){if(state.eat(0x42/* B */)||state.eat(0x62/* b */)){return true;}state.pos=start;}// Lookahead / Lookbehind
+  if(state.eat(0x28/* ( */)&&state.eat(0x3F/* ? */)){var lookbehind=false;if(this.options.ecmaVersion>=9){lookbehind=state.eat(0x3C/* < */);}if(state.eat(0x3D/* = */)||state.eat(0x21/* ! */)){this.regexp_disjunction(state);if(!state.eat(0x29/* ) */)){state.raise("Unterminated group");}state.lastAssertionIsQuantifiable=!lookbehind;return true;}}state.pos=start;return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-Quantifier
+  pp$8.regexp_eatQuantifier=function(state,noError){if(noError===void 0)noError=false;if(this.regexp_eatQuantifierPrefix(state,noError)){state.eat(0x3F/* ? */);return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-QuantifierPrefix
+  pp$8.regexp_eatQuantifierPrefix=function(state,noError){return state.eat(0x2A/* * */)||state.eat(0x2B/* + */)||state.eat(0x3F/* ? */)||this.regexp_eatBracedQuantifier(state,noError);};pp$8.regexp_eatBracedQuantifier=function(state,noError){var start=state.pos;if(state.eat(0x7B/* { */)){var min=0,max=-1;if(this.regexp_eatDecimalDigits(state)){min=state.lastIntValue;if(state.eat(0x2C/* , */)&&this.regexp_eatDecimalDigits(state)){max=state.lastIntValue;}if(state.eat(0x7D/* } */)){// SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-term
+  if(max!==-1&&max<min&&!noError){state.raise("numbers out of order in {} quantifier");}return true;}}if(state.switchU&&!noError){state.raise("Incomplete quantifier");}state.pos=start;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-Atom
+  pp$8.regexp_eatAtom=function(state){return this.regexp_eatPatternCharacters(state)||state.eat(0x2E/* . */)||this.regexp_eatReverseSolidusAtomEscape(state)||this.regexp_eatCharacterClass(state)||this.regexp_eatUncapturingGroup(state)||this.regexp_eatCapturingGroup(state);};pp$8.regexp_eatReverseSolidusAtomEscape=function(state){var start=state.pos;if(state.eat(0x5C/* \ */)){if(this.regexp_eatAtomEscape(state)){return true;}state.pos=start;}return false;};pp$8.regexp_eatUncapturingGroup=function(state){var start=state.pos;if(state.eat(0x28/* ( */)){if(state.eat(0x3F/* ? */)&&state.eat(0x3A/* : */)){this.regexp_disjunction(state);if(state.eat(0x29/* ) */)){return true;}state.raise("Unterminated group");}state.pos=start;}return false;};pp$8.regexp_eatCapturingGroup=function(state){if(state.eat(0x28/* ( */)){if(this.options.ecmaVersion>=9){this.regexp_groupSpecifier(state);}else if(state.current()===0x3F/* ? */){state.raise("Invalid group");}this.regexp_disjunction(state);if(state.eat(0x29/* ) */)){state.numCapturingParens+=1;return true;}state.raise("Unterminated group");}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedAtom
+  pp$8.regexp_eatExtendedAtom=function(state){return state.eat(0x2E/* . */)||this.regexp_eatReverseSolidusAtomEscape(state)||this.regexp_eatCharacterClass(state)||this.regexp_eatUncapturingGroup(state)||this.regexp_eatCapturingGroup(state)||this.regexp_eatInvalidBracedQuantifier(state)||this.regexp_eatExtendedPatternCharacter(state);};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-InvalidBracedQuantifier
+  pp$8.regexp_eatInvalidBracedQuantifier=function(state){if(this.regexp_eatBracedQuantifier(state,true)){state.raise("Nothing to repeat");}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-SyntaxCharacter
+  pp$8.regexp_eatSyntaxCharacter=function(state){var ch=state.current();if(isSyntaxCharacter(ch)){state.lastIntValue=ch;state.advance();return true;}return false;};function isSyntaxCharacter(ch){return ch===0x24/* $ */||ch>=0x28/* ( */&&ch<=0x2B/* + */||ch===0x2E/* . */||ch===0x3F/* ? */||ch>=0x5B/* [ */&&ch<=0x5E/* ^ */||ch>=0x7B/* { */&&ch<=0x7D/* } */;}// https://www.ecma-international.org/ecma-262/8.0/#prod-PatternCharacter
+  // But eat eager.
+  pp$8.regexp_eatPatternCharacters=function(state){var start=state.pos;var ch=0;while((ch=state.current())!==-1&&!isSyntaxCharacter(ch)){state.advance();}return state.pos!==start;};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ExtendedPatternCharacter
+  pp$8.regexp_eatExtendedPatternCharacter=function(state){var ch=state.current();if(ch!==-1&&ch!==0x24/* $ */&&!(ch>=0x28/* ( */&&ch<=0x2B/* + */)&&ch!==0x2E/* . */&&ch!==0x3F/* ? */&&ch!==0x5B/* [ */&&ch!==0x5E/* ^ */&&ch!==0x7C/* | */){state.advance();return true;}return false;};// GroupSpecifier[U] ::
+  //   [empty]
+  //   `?` GroupName[?U]
+  pp$8.regexp_groupSpecifier=function(state){if(state.eat(0x3F/* ? */)){if(this.regexp_eatGroupName(state)){if(state.groupNames.indexOf(state.lastStringValue)!==-1){state.raise("Duplicate capture group name");}state.groupNames.push(state.lastStringValue);return;}state.raise("Invalid group");}};// GroupName[U] ::
+  //   `<` RegExpIdentifierName[?U] `>`
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$8.regexp_eatGroupName=function(state){state.lastStringValue="";if(state.eat(0x3C/* < */)){if(this.regexp_eatRegExpIdentifierName(state)&&state.eat(0x3E/* > */)){return true;}state.raise("Invalid capture group name");}return false;};// RegExpIdentifierName[U] ::
+  //   RegExpIdentifierStart[?U]
+  //   RegExpIdentifierName[?U] RegExpIdentifierPart[?U]
+  // Note: this updates `state.lastStringValue` property with the eaten name.
+  pp$8.regexp_eatRegExpIdentifierName=function(state){state.lastStringValue="";if(this.regexp_eatRegExpIdentifierStart(state)){state.lastStringValue+=codePointToString(state.lastIntValue);while(this.regexp_eatRegExpIdentifierPart(state)){state.lastStringValue+=codePointToString(state.lastIntValue);}return true;}return false;};// RegExpIdentifierStart[U] ::
+  //   UnicodeIDStart
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[?U]
+  pp$8.regexp_eatRegExpIdentifierStart=function(state){var start=state.pos;var ch=state.current();state.advance();if(ch===0x5C/* \ */&&this.regexp_eatRegExpUnicodeEscapeSequence(state)){ch=state.lastIntValue;}if(isRegExpIdentifierStart(ch)){state.lastIntValue=ch;return true;}state.pos=start;return false;};function isRegExpIdentifierStart(ch){return isIdentifierStart(ch,true)||ch===0x24/* $ */||ch===0x5F;/* _ */}// RegExpIdentifierPart[U] ::
+  //   UnicodeIDContinue
+  //   `$`
+  //   `_`
+  //   `\` RegExpUnicodeEscapeSequence[?U]
+  //   <ZWNJ>
+  //   <ZWJ>
+  pp$8.regexp_eatRegExpIdentifierPart=function(state){var start=state.pos;var ch=state.current();state.advance();if(ch===0x5C/* \ */&&this.regexp_eatRegExpUnicodeEscapeSequence(state)){ch=state.lastIntValue;}if(isRegExpIdentifierPart(ch)){state.lastIntValue=ch;return true;}state.pos=start;return false;};function isRegExpIdentifierPart(ch){return isIdentifierChar(ch,true)||ch===0x24/* $ */||ch===0x5F/* _ */||ch===0x200C/* <ZWNJ> */||ch===0x200D;/* <ZWJ> */}// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-AtomEscape
+  pp$8.regexp_eatAtomEscape=function(state){if(this.regexp_eatBackReference(state)||this.regexp_eatCharacterClassEscape(state)||this.regexp_eatCharacterEscape(state)||state.switchN&&this.regexp_eatKGroupName(state)){return true;}if(state.switchU){// Make the same message as V8.
+  if(state.current()===0x63/* c */){state.raise("Invalid unicode escape");}state.raise("Invalid escape");}return false;};pp$8.regexp_eatBackReference=function(state){var start=state.pos;if(this.regexp_eatDecimalEscape(state)){var n=state.lastIntValue;if(state.switchU){// For SyntaxError in https://www.ecma-international.org/ecma-262/8.0/#sec-atomescape
+  if(n>state.maxBackReference){state.maxBackReference=n;}return true;}if(n<=state.numCapturingParens){return true;}state.pos=start;}return false;};pp$8.regexp_eatKGroupName=function(state){if(state.eat(0x6B/* k */)){if(this.regexp_eatGroupName(state)){state.backReferenceNames.push(state.lastStringValue);return true;}state.raise("Invalid named reference");}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-CharacterEscape
+  pp$8.regexp_eatCharacterEscape=function(state){return this.regexp_eatControlEscape(state)||this.regexp_eatCControlLetter(state)||this.regexp_eatZero(state)||this.regexp_eatHexEscapeSequence(state)||this.regexp_eatRegExpUnicodeEscapeSequence(state)||!state.switchU&&this.regexp_eatLegacyOctalEscapeSequence(state)||this.regexp_eatIdentityEscape(state);};pp$8.regexp_eatCControlLetter=function(state){var start=state.pos;if(state.eat(0x63/* c */)){if(this.regexp_eatControlLetter(state)){return true;}state.pos=start;}return false;};pp$8.regexp_eatZero=function(state){if(state.current()===0x30/* 0 */&&!isDecimalDigit(state.lookahead())){state.lastIntValue=0;state.advance();return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlEscape
+  pp$8.regexp_eatControlEscape=function(state){var ch=state.current();if(ch===0x74/* t */){state.lastIntValue=0x09;/* \t */state.advance();return true;}if(ch===0x6E/* n */){state.lastIntValue=0x0A;/* \n */state.advance();return true;}if(ch===0x76/* v */){state.lastIntValue=0x0B;/* \v */state.advance();return true;}if(ch===0x66/* f */){state.lastIntValue=0x0C;/* \f */state.advance();return true;}if(ch===0x72/* r */){state.lastIntValue=0x0D;/* \r */state.advance();return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-ControlLetter
+  pp$8.regexp_eatControlLetter=function(state){var ch=state.current();if(isControlLetter(ch)){state.lastIntValue=ch%0x20;state.advance();return true;}return false;};function isControlLetter(ch){return ch>=0x41/* A */&&ch<=0x5A/* Z */||ch>=0x61/* a */&&ch<=0x7A/* z */;}// https://www.ecma-international.org/ecma-262/8.0/#prod-RegExpUnicodeEscapeSequence
+  pp$8.regexp_eatRegExpUnicodeEscapeSequence=function(state){var start=state.pos;if(state.eat(0x75/* u */)){if(this.regexp_eatFixedHexDigits(state,4)){var lead=state.lastIntValue;if(state.switchU&&lead>=0xD800&&lead<=0xDBFF){var leadSurrogateEnd=state.pos;if(state.eat(0x5C/* \ */)&&state.eat(0x75/* u */)&&this.regexp_eatFixedHexDigits(state,4)){var trail=state.lastIntValue;if(trail>=0xDC00&&trail<=0xDFFF){state.lastIntValue=(lead-0xD800)*0x400+(trail-0xDC00)+0x10000;return true;}}state.pos=leadSurrogateEnd;state.lastIntValue=lead;}return true;}if(state.switchU&&state.eat(0x7B/* { */)&&this.regexp_eatHexDigits(state)&&state.eat(0x7D/* } */)&&isValidUnicode(state.lastIntValue)){return true;}if(state.switchU){state.raise("Invalid unicode escape");}state.pos=start;}return false;};function isValidUnicode(ch){return ch>=0&&ch<=0x10FFFF;}// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-IdentityEscape
+  pp$8.regexp_eatIdentityEscape=function(state){if(state.switchU){if(this.regexp_eatSyntaxCharacter(state)){return true;}if(state.eat(0x2F/* / */)){state.lastIntValue=0x2F;/* / */return true;}return false;}var ch=state.current();if(ch!==0x63/* c */&&(!state.switchN||ch!==0x6B/* k */)){state.lastIntValue=ch;state.advance();return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalEscape
+  pp$8.regexp_eatDecimalEscape=function(state){state.lastIntValue=0;var ch=state.current();if(ch>=0x31/* 1 */&&ch<=0x39/* 9 */){do{state.lastIntValue=10*state.lastIntValue+(ch-0x30/* 0 */);state.advance();}while((ch=state.current())>=0x30/* 0 */&&ch<=0x39/* 9 */);return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClassEscape
+  pp$8.regexp_eatCharacterClassEscape=function(state){var ch=state.current();if(isCharacterClassEscape(ch)){state.lastIntValue=-1;state.advance();return true;}if(state.switchU&&this.options.ecmaVersion>=9&&(ch===0x50/* P */||ch===0x70/* p */)){state.lastIntValue=-1;state.advance();if(state.eat(0x7B/* { */)&&this.regexp_eatUnicodePropertyValueExpression(state)&&state.eat(0x7D/* } */)){return true;}state.raise("Invalid property name");}return false;};function isCharacterClassEscape(ch){return ch===0x64/* d */||ch===0x44/* D */||ch===0x73/* s */||ch===0x53/* S */||ch===0x77/* w */||ch===0x57/* W */;}// UnicodePropertyValueExpression ::
+  //   UnicodePropertyName `=` UnicodePropertyValue
+  //   LoneUnicodePropertyNameOrValue
+  pp$8.regexp_eatUnicodePropertyValueExpression=function(state){var start=state.pos;// UnicodePropertyName `=` UnicodePropertyValue
+  if(this.regexp_eatUnicodePropertyName(state)&&state.eat(0x3D/* = */)){var name=state.lastStringValue;if(this.regexp_eatUnicodePropertyValue(state)){var value=state.lastStringValue;this.regexp_validateUnicodePropertyNameAndValue(state,name,value);return true;}}state.pos=start;// LoneUnicodePropertyNameOrValue
+  if(this.regexp_eatLoneUnicodePropertyNameOrValue(state)){var nameOrValue=state.lastStringValue;this.regexp_validateUnicodePropertyNameOrValue(state,nameOrValue);return true;}return false;};pp$8.regexp_validateUnicodePropertyNameAndValue=function(state,name,value){if(!has$1(state.unicodeProperties.nonBinary,name)){state.raise("Invalid property name");}if(!state.unicodeProperties.nonBinary[name].test(value)){state.raise("Invalid property value");}};pp$8.regexp_validateUnicodePropertyNameOrValue=function(state,nameOrValue){if(!state.unicodeProperties.binary.test(nameOrValue)){state.raise("Invalid property name");}};// UnicodePropertyName ::
+  //   UnicodePropertyNameCharacters
+  pp$8.regexp_eatUnicodePropertyName=function(state){var ch=0;state.lastStringValue="";while(isUnicodePropertyNameCharacter(ch=state.current())){state.lastStringValue+=codePointToString(ch);state.advance();}return state.lastStringValue!=="";};function isUnicodePropertyNameCharacter(ch){return isControlLetter(ch)||ch===0x5F;/* _ */}// UnicodePropertyValue ::
+  //   UnicodePropertyValueCharacters
+  pp$8.regexp_eatUnicodePropertyValue=function(state){var ch=0;state.lastStringValue="";while(isUnicodePropertyValueCharacter(ch=state.current())){state.lastStringValue+=codePointToString(ch);state.advance();}return state.lastStringValue!=="";};function isUnicodePropertyValueCharacter(ch){return isUnicodePropertyNameCharacter(ch)||isDecimalDigit(ch);}// LoneUnicodePropertyNameOrValue ::
+  //   UnicodePropertyValueCharacters
+  pp$8.regexp_eatLoneUnicodePropertyNameOrValue=function(state){return this.regexp_eatUnicodePropertyValue(state);};// https://www.ecma-international.org/ecma-262/8.0/#prod-CharacterClass
+  pp$8.regexp_eatCharacterClass=function(state){if(state.eat(0x5B/* [ */)){state.eat(0x5E/* ^ */);this.regexp_classRanges(state);if(state.eat(0x5D/* [ */)){return true;}// Unreachable since it threw "unterminated regular expression" error before.
+  state.raise("Unterminated character class");}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRanges
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-NonemptyClassRangesNoDash
+  pp$8.regexp_classRanges=function(state){while(this.regexp_eatClassAtom(state)){var left=state.lastIntValue;if(state.eat(0x2D/* - */)&&this.regexp_eatClassAtom(state)){var right=state.lastIntValue;if(state.switchU&&(left===-1||right===-1)){state.raise("Invalid character class");}if(left!==-1&&right!==-1&&left>right){state.raise("Range out of order in character class");}}}};// https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtom
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-ClassAtomNoDash
+  pp$8.regexp_eatClassAtom=function(state){var start=state.pos;if(state.eat(0x5C/* \ */)){if(this.regexp_eatClassEscape(state)){return true;}if(state.switchU){// Make the same message as V8.
+  var ch$1=state.current();if(ch$1===0x63/* c */||isOctalDigit(ch$1)){state.raise("Invalid class escape");}state.raise("Invalid escape");}state.pos=start;}var ch=state.current();if(ch!==0x5D/* [ */){state.lastIntValue=ch;state.advance();return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassEscape
+  pp$8.regexp_eatClassEscape=function(state){var start=state.pos;if(state.eat(0x62/* b */)){state.lastIntValue=0x08;/* <BS> */return true;}if(state.switchU&&state.eat(0x2D/* - */)){state.lastIntValue=0x2D;/* - */return true;}if(!state.switchU&&state.eat(0x63/* c */)){if(this.regexp_eatClassControlLetter(state)){return true;}state.pos=start;}return this.regexp_eatCharacterClassEscape(state)||this.regexp_eatCharacterEscape(state);};// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-ClassControlLetter
+  pp$8.regexp_eatClassControlLetter=function(state){var ch=state.current();if(isDecimalDigit(ch)||ch===0x5F/* _ */){state.lastIntValue=ch%0x20;state.advance();return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$8.regexp_eatHexEscapeSequence=function(state){var start=state.pos;if(state.eat(0x78/* x */)){if(this.regexp_eatFixedHexDigits(state,2)){return true;}if(state.switchU){state.raise("Invalid escape");}state.pos=start;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-DecimalDigits
+  pp$8.regexp_eatDecimalDigits=function(state){var start=state.pos;var ch=0;state.lastIntValue=0;while(isDecimalDigit(ch=state.current())){state.lastIntValue=10*state.lastIntValue+(ch-0x30/* 0 */);state.advance();}return state.pos!==start;};function isDecimalDigit(ch){return ch>=0x30/* 0 */&&ch<=0x39;/* 9 */}// https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigits
+  pp$8.regexp_eatHexDigits=function(state){var start=state.pos;var ch=0;state.lastIntValue=0;while(isHexDigit(ch=state.current())){state.lastIntValue=16*state.lastIntValue+hexToInt(ch);state.advance();}return state.pos!==start;};function isHexDigit(ch){return ch>=0x30/* 0 */&&ch<=0x39/* 9 */||ch>=0x41/* A */&&ch<=0x46/* F */||ch>=0x61/* a */&&ch<=0x66/* f */;}function hexToInt(ch){if(ch>=0x41/* A */&&ch<=0x46/* F */){return 10+(ch-0x41/* A */);}if(ch>=0x61/* a */&&ch<=0x66/* f */){return 10+(ch-0x61/* a */);}return ch-0x30;/* 0 */}// https://www.ecma-international.org/ecma-262/8.0/#prod-annexB-LegacyOctalEscapeSequence
+  // Allows only 0-377(octal) i.e. 0-255(decimal).
+  pp$8.regexp_eatLegacyOctalEscapeSequence=function(state){if(this.regexp_eatOctalDigit(state)){var n1=state.lastIntValue;if(this.regexp_eatOctalDigit(state)){var n2=state.lastIntValue;if(n1<=3&&this.regexp_eatOctalDigit(state)){state.lastIntValue=n1*64+n2*8+state.lastIntValue;}else{state.lastIntValue=n1*8+n2;}}else{state.lastIntValue=n1;}return true;}return false;};// https://www.ecma-international.org/ecma-262/8.0/#prod-OctalDigit
+  pp$8.regexp_eatOctalDigit=function(state){var ch=state.current();if(isOctalDigit(ch)){state.lastIntValue=ch-0x30;/* 0 */state.advance();return true;}state.lastIntValue=0;return false;};function isOctalDigit(ch){return ch>=0x30/* 0 */&&ch<=0x37;/* 7 */}// https://www.ecma-international.org/ecma-262/8.0/#prod-Hex4Digits
+  // https://www.ecma-international.org/ecma-262/8.0/#prod-HexDigit
+  // And HexDigit HexDigit in https://www.ecma-international.org/ecma-262/8.0/#prod-HexEscapeSequence
+  pp$8.regexp_eatFixedHexDigits=function(state,length){var start=state.pos;state.lastIntValue=0;for(var i=0;i<length;++i){var ch=state.current();if(!isHexDigit(ch)){state.pos=start;return false;}state.lastIntValue=16*state.lastIntValue+hexToInt(ch);state.advance();}return true;};// Object type used to represent tokens. Note that normally, tokens
+  // simply exist as properties on the parser object. This is only
+  // used for the onToken callback and the external tokenizer.
+  var Token=function Token(p){this.type=p.type;this.value=p.value;this.start=p.start;this.end=p.end;if(p.options.locations){this.loc=new SourceLocation(p,p.startLoc,p.endLoc);}if(p.options.ranges){this.range=[p.start,p.end];}};// ## Tokenizer
+  var pp$9=Parser.prototype;// Move to the next token
+  pp$9.next=function(){if(this.options.onToken){this.options.onToken(new Token(this));}this.lastTokEnd=this.end;this.lastTokStart=this.start;this.lastTokEndLoc=this.endLoc;this.lastTokStartLoc=this.startLoc;this.nextToken();};pp$9.getToken=function(){this.next();return new Token(this);};// If we're in an ES6 environment, make parsers iterable
+  if(typeof Symbol!=="undefined"){pp$9[Symbol.iterator]=function(){var this$1=this;return {next:function next(){var token=this$1.getToken();return {done:token.type===types$2.eof,value:token};}};};}// Toggle strict mode. Re-reads the next number or string to please
+  // pedantic tests (`"use strict"; 010;` should fail).
+  pp$9.curContext=function(){return this.context[this.context.length-1];};// Read a single token, updating the parser object's token-related
+  // properties.
+  pp$9.nextToken=function(){var curContext=this.curContext();if(!curContext||!curContext.preserveSpace){this.skipSpace();}this.start=this.pos;if(this.options.locations){this.startLoc=this.curPosition();}if(this.pos>=this.input.length){return this.finishToken(types$2.eof);}if(curContext.override){return curContext.override(this);}else{this.readToken(this.fullCharCodeAtPos());}};pp$9.readToken=function(code){// Identifier or keyword. '\uXXXX' sequences are allowed in
+  // identifiers, so '\' also dispatches to that.
+  if(isIdentifierStart(code,this.options.ecmaVersion>=6)||code===92/* '\' */){return this.readWord();}return this.getTokenFromCode(code);};pp$9.fullCharCodeAtPos=function(){var code=this.input.charCodeAt(this.pos);if(code<=0xd7ff||code>=0xe000){return code;}var next=this.input.charCodeAt(this.pos+1);return (code<<10)+next-0x35fdc00;};pp$9.skipBlockComment=function(){var startLoc=this.options.onComment&&this.curPosition();var start=this.pos,end=this.input.indexOf("*/",this.pos+=2);if(end===-1){this.raise(this.pos-2,"Unterminated comment");}this.pos=end+2;if(this.options.locations){lineBreakG.lastIndex=start;var match;while((match=lineBreakG.exec(this.input))&&match.index<this.pos){++this.curLine;this.lineStart=match.index+match[0].length;}}if(this.options.onComment){this.options.onComment(true,this.input.slice(start+2,end),start,this.pos,startLoc,this.curPosition());}};pp$9.skipLineComment=function(startSkip){var start=this.pos;var startLoc=this.options.onComment&&this.curPosition();var ch=this.input.charCodeAt(this.pos+=startSkip);while(this.pos<this.input.length&&!isNewLine(ch)){ch=this.input.charCodeAt(++this.pos);}if(this.options.onComment){this.options.onComment(false,this.input.slice(start+startSkip,this.pos),start,this.pos,startLoc,this.curPosition());}};// Called at the start of the parse and after every token. Skips
+  // whitespace and comments, and.
+  pp$9.skipSpace=function(){loop:while(this.pos<this.input.length){var ch=this.input.charCodeAt(this.pos);switch(ch){case 32:case 160:// ' '
+  ++this.pos;break;case 13:if(this.input.charCodeAt(this.pos+1)===10){++this.pos;}case 10:case 8232:case 8233:++this.pos;if(this.options.locations){++this.curLine;this.lineStart=this.pos;}break;case 47:// '/'
+  switch(this.input.charCodeAt(this.pos+1)){case 42:// '*'
+  this.skipBlockComment();break;case 47:this.skipLineComment(2);break;default:break loop;}break;default:if(ch>8&&ch<14||ch>=5760&&nonASCIIwhitespace.test(String.fromCharCode(ch))){++this.pos;}else{break loop;}}}};// Called at the end of every token. Sets `end`, `val`, and
+  // maintains `context` and `exprAllowed`, and skips the space after
+  // the token, so that the next one's `start` will point at the
+  // right position.
+  pp$9.finishToken=function(type,val){this.end=this.pos;if(this.options.locations){this.endLoc=this.curPosition();}var prevType=this.type;this.type=type;this.value=val;this.updateContext(prevType);};// ### Token reading
+  // This is the function that is called to fetch the next token. It
+  // is somewhat obscure, because it works in character codes rather
+  // than characters, and because operator parsing has been inlined
+  // into it.
+  //
+  // All in the name of speed.
+  //
+  pp$9.readToken_dot=function(){var next=this.input.charCodeAt(this.pos+1);if(next>=48&&next<=57){return this.readNumber(true);}var next2=this.input.charCodeAt(this.pos+2);if(this.options.ecmaVersion>=6&&next===46&&next2===46){// 46 = dot '.'
+  this.pos+=3;return this.finishToken(types$2.ellipsis);}else{++this.pos;return this.finishToken(types$2.dot);}};pp$9.readToken_slash=function(){// '/'
+  var next=this.input.charCodeAt(this.pos+1);if(this.exprAllowed){++this.pos;return this.readRegexp();}if(next===61){return this.finishOp(types$2.assign,2);}return this.finishOp(types$2.slash,1);};pp$9.readToken_mult_modulo_exp=function(code){// '%*'
+  var next=this.input.charCodeAt(this.pos+1);var size=1;var tokentype=code===42?types$2.star:types$2.modulo;// exponentiation operator ** and **=
+  if(this.options.ecmaVersion>=7&&code===42&&next===42){++size;tokentype=types$2.starstar;next=this.input.charCodeAt(this.pos+2);}if(next===61){return this.finishOp(types$2.assign,size+1);}return this.finishOp(tokentype,size);};pp$9.readToken_pipe_amp=function(code){// '|&'
+  var next=this.input.charCodeAt(this.pos+1);if(next===code){return this.finishOp(code===124?types$2.logicalOR:types$2.logicalAND,2);}if(next===61){return this.finishOp(types$2.assign,2);}return this.finishOp(code===124?types$2.bitwiseOR:types$2.bitwiseAND,1);};pp$9.readToken_caret=function(){// '^'
+  var next=this.input.charCodeAt(this.pos+1);if(next===61){return this.finishOp(types$2.assign,2);}return this.finishOp(types$2.bitwiseXOR,1);};pp$9.readToken_plus_min=function(code){// '+-'
+  var next=this.input.charCodeAt(this.pos+1);if(next===code){if(next===45&&!this.inModule&&this.input.charCodeAt(this.pos+2)===62&&(this.lastTokEnd===0||lineBreak.test(this.input.slice(this.lastTokEnd,this.pos)))){// A `-->` line comment
+  this.skipLineComment(3);this.skipSpace();return this.nextToken();}return this.finishOp(types$2.incDec,2);}if(next===61){return this.finishOp(types$2.assign,2);}return this.finishOp(types$2.plusMin,1);};pp$9.readToken_lt_gt=function(code){// '<>'
+  var next=this.input.charCodeAt(this.pos+1);var size=1;if(next===code){size=code===62&&this.input.charCodeAt(this.pos+2)===62?3:2;if(this.input.charCodeAt(this.pos+size)===61){return this.finishOp(types$2.assign,size+1);}return this.finishOp(types$2.bitShift,size);}if(next===33&&code===60&&!this.inModule&&this.input.charCodeAt(this.pos+2)===45&&this.input.charCodeAt(this.pos+3)===45){// `<!--`, an XML-style comment that should be interpreted as a line comment
+  this.skipLineComment(4);this.skipSpace();return this.nextToken();}if(next===61){size=2;}return this.finishOp(types$2.relational,size);};pp$9.readToken_eq_excl=function(code){// '=!'
+  var next=this.input.charCodeAt(this.pos+1);if(next===61){return this.finishOp(types$2.equality,this.input.charCodeAt(this.pos+2)===61?3:2);}if(code===61&&next===62&&this.options.ecmaVersion>=6){// '=>'
+  this.pos+=2;return this.finishToken(types$2.arrow);}return this.finishOp(code===61?types$2.eq:types$2.prefix,1);};pp$9.getTokenFromCode=function(code){switch(code){// The interpretation of a dot depends on whether it is followed
+  // by a digit or another two dots.
+  case 46:// '.'
+  return this.readToken_dot();// Punctuation tokens.
+  case 40:++this.pos;return this.finishToken(types$2.parenL);case 41:++this.pos;return this.finishToken(types$2.parenR);case 59:++this.pos;return this.finishToken(types$2.semi);case 44:++this.pos;return this.finishToken(types$2.comma);case 91:++this.pos;return this.finishToken(types$2.bracketL);case 93:++this.pos;return this.finishToken(types$2.bracketR);case 123:++this.pos;return this.finishToken(types$2.braceL);case 125:++this.pos;return this.finishToken(types$2.braceR);case 58:++this.pos;return this.finishToken(types$2.colon);case 63:++this.pos;return this.finishToken(types$2.question);case 96:// '`'
+  if(this.options.ecmaVersion<6){break;}++this.pos;return this.finishToken(types$2.backQuote);case 48:// '0'
+  var next=this.input.charCodeAt(this.pos+1);if(next===120||next===88){return this.readRadixNumber(16);}// '0x', '0X' - hex number
+  if(this.options.ecmaVersion>=6){if(next===111||next===79){return this.readRadixNumber(8);}// '0o', '0O' - octal number
+  if(next===98||next===66){return this.readRadixNumber(2);}// '0b', '0B' - binary number
+  }// Anything else beginning with a digit is an integer, octal
+  // number, or float.
+  case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:// 1-9
+  return this.readNumber(false);// Quotes produce strings.
+  case 34:case 39:// '"', "'"
+  return this.readString(code);// Operators are parsed inline in tiny state machines. '=' (61) is
+  // often referred to. `finishOp` simply skips the amount of
+  // characters it is given as second argument, and returns a token
+  // of the type given by its first argument.
+  case 47:// '/'
+  return this.readToken_slash();case 37:case 42:// '%*'
+  return this.readToken_mult_modulo_exp(code);case 124:case 38:// '|&'
+  return this.readToken_pipe_amp(code);case 94:// '^'
+  return this.readToken_caret();case 43:case 45:// '+-'
+  return this.readToken_plus_min(code);case 60:case 62:// '<>'
+  return this.readToken_lt_gt(code);case 61:case 33:// '=!'
+  return this.readToken_eq_excl(code);case 126:// '~'
+  return this.finishOp(types$2.prefix,1);}this.raise(this.pos,"Unexpected character '"+codePointToString$1(code)+"'");};pp$9.finishOp=function(type,size){var str=this.input.slice(this.pos,this.pos+size);this.pos+=size;return this.finishToken(type,str);};pp$9.readRegexp=function(){var escaped,inClass,start=this.pos;for(;;){if(this.pos>=this.input.length){this.raise(start,"Unterminated regular expression");}var ch=this.input.charAt(this.pos);if(lineBreak.test(ch)){this.raise(start,"Unterminated regular expression");}if(!escaped){if(ch==="["){inClass=true;}else if(ch==="]"&&inClass){inClass=false;}else if(ch==="/"&&!inClass){break;}escaped=ch==="\\";}else{escaped=false;}++this.pos;}var pattern=this.input.slice(start,this.pos);++this.pos;var flagsStart=this.pos;var flags=this.readWord1();if(this.containsEsc){this.unexpected(flagsStart);}// Validate pattern
+  var state=this.regexpState||(this.regexpState=new RegExpValidationState(this));state.reset(start,pattern,flags);this.validateRegExpFlags(state);this.validateRegExpPattern(state);// Create Literal#value property value.
+  var value=null;try{value=new RegExp(pattern,flags);}catch(e){// ESTree requires null if it failed to instantiate RegExp object.
+  // https://github.com/estree/estree/blob/a27003adf4fd7bfad44de9cef372a2eacd527b1c/es5.md#regexpliteral
+  }return this.finishToken(types$2.regexp,{pattern:pattern,flags:flags,value:value});};// Read an integer in the given radix. Return null if zero digits
+  // were read, the integer value otherwise. When `len` is given, this
+  // will return `null` unless the integer has exactly `len` digits.
+  pp$9.readInt=function(radix,len){var start=this.pos,total=0;for(var i=0,e=len==null?Infinity:len;i<e;++i){var code=this.input.charCodeAt(this.pos),val=void 0;if(code>=97){val=code-97+10;}// a
+  else if(code>=65){val=code-65+10;}// A
+  else if(code>=48&&code<=57){val=code-48;}// 0-9
+  else{val=Infinity;}if(val>=radix){break;}++this.pos;total=total*radix+val;}if(this.pos===start||len!=null&&this.pos-start!==len){return null;}return total;};pp$9.readRadixNumber=function(radix){var start=this.pos;this.pos+=2;// 0x
+  var val=this.readInt(radix);if(val==null){this.raise(this.start+2,"Expected number in radix "+radix);}if(this.options.ecmaVersion>=11&&this.input.charCodeAt(this.pos)===110){val=typeof BigInt!=="undefined"?BigInt(this.input.slice(start,this.pos)):null;++this.pos;}else if(isIdentifierStart(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number");}return this.finishToken(types$2.num,val);};// Read an integer, octal integer, or floating-point number.
+  pp$9.readNumber=function(startsWithDot){var start=this.pos;if(!startsWithDot&&this.readInt(10)===null){this.raise(start,"Invalid number");}var octal=this.pos-start>=2&&this.input.charCodeAt(start)===48;if(octal&&this.strict){this.raise(start,"Invalid number");}if(octal&&/[89]/.test(this.input.slice(start,this.pos))){octal=false;}var next=this.input.charCodeAt(this.pos);if(!octal&&!startsWithDot&&this.options.ecmaVersion>=11&&next===110){var str$1=this.input.slice(start,this.pos);var val$1=typeof BigInt!=="undefined"?BigInt(str$1):null;++this.pos;if(isIdentifierStart(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number");}return this.finishToken(types$2.num,val$1);}if(next===46&&!octal){// '.'
+  ++this.pos;this.readInt(10);next=this.input.charCodeAt(this.pos);}if((next===69||next===101)&&!octal){// 'eE'
+  next=this.input.charCodeAt(++this.pos);if(next===43||next===45){++this.pos;}// '+-'
+  if(this.readInt(10)===null){this.raise(start,"Invalid number");}}if(isIdentifierStart(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number");}var str=this.input.slice(start,this.pos);var val=octal?parseInt(str,8):parseFloat(str);return this.finishToken(types$2.num,val);};// Read a string value, interpreting backslash-escapes.
+  pp$9.readCodePoint=function(){var ch=this.input.charCodeAt(this.pos),code;if(ch===123){// '{'
+  if(this.options.ecmaVersion<6){this.unexpected();}var codePos=++this.pos;code=this.readHexChar(this.input.indexOf("}",this.pos)-this.pos);++this.pos;if(code>0x10FFFF){this.invalidStringToken(codePos,"Code point out of bounds");}}else{code=this.readHexChar(4);}return code;};function codePointToString$1(code){// UTF-16 Decoding
+  if(code<=0xFFFF){return String.fromCharCode(code);}code-=0x10000;return String.fromCharCode((code>>10)+0xD800,(code&1023)+0xDC00);}pp$9.readString=function(quote){var out="",chunkStart=++this.pos;for(;;){if(this.pos>=this.input.length){this.raise(this.start,"Unterminated string constant");}var ch=this.input.charCodeAt(this.pos);if(ch===quote){break;}if(ch===92){// '\'
+  out+=this.input.slice(chunkStart,this.pos);out+=this.readEscapedChar(false);chunkStart=this.pos;}else{if(isNewLine(ch,this.options.ecmaVersion>=10)){this.raise(this.start,"Unterminated string constant");}++this.pos;}}out+=this.input.slice(chunkStart,this.pos++);return this.finishToken(types$2.string,out);};// Reads template string tokens.
+  var INVALID_TEMPLATE_ESCAPE_ERROR={};pp$9.tryReadTemplateToken=function(){this.inTemplateElement=true;try{this.readTmplToken();}catch(err){if(err===INVALID_TEMPLATE_ESCAPE_ERROR){this.readInvalidTemplateToken();}else{throw err;}}this.inTemplateElement=false;};pp$9.invalidStringToken=function(position,message){if(this.inTemplateElement&&this.options.ecmaVersion>=9){throw INVALID_TEMPLATE_ESCAPE_ERROR;}else{this.raise(position,message);}};pp$9.readTmplToken=function(){var out="",chunkStart=this.pos;for(;;){if(this.pos>=this.input.length){this.raise(this.start,"Unterminated template");}var ch=this.input.charCodeAt(this.pos);if(ch===96||ch===36&&this.input.charCodeAt(this.pos+1)===123){// '`', '${'
+  if(this.pos===this.start&&(this.type===types$2.template||this.type===types$2.invalidTemplate)){if(ch===36){this.pos+=2;return this.finishToken(types$2.dollarBraceL);}else{++this.pos;return this.finishToken(types$2.backQuote);}}out+=this.input.slice(chunkStart,this.pos);return this.finishToken(types$2.template,out);}if(ch===92){// '\'
+  out+=this.input.slice(chunkStart,this.pos);out+=this.readEscapedChar(true);chunkStart=this.pos;}else if(isNewLine(ch)){out+=this.input.slice(chunkStart,this.pos);++this.pos;switch(ch){case 13:if(this.input.charCodeAt(this.pos)===10){++this.pos;}case 10:out+="\n";break;default:out+=String.fromCharCode(ch);break;}if(this.options.locations){++this.curLine;this.lineStart=this.pos;}chunkStart=this.pos;}else{++this.pos;}}};// Reads a template token to search for the end, without validating any escape sequences
+  pp$9.readInvalidTemplateToken=function(){for(;this.pos<this.input.length;this.pos++){switch(this.input[this.pos]){case"\\":++this.pos;break;case"$":if(this.input[this.pos+1]!=="{"){break;}// falls through
+  case"`":return this.finishToken(types$2.invalidTemplate,this.input.slice(this.start,this.pos));// no default
+  }}this.raise(this.start,"Unterminated template");};// Used to read escaped characters
+  pp$9.readEscapedChar=function(inTemplate){var ch=this.input.charCodeAt(++this.pos);++this.pos;switch(ch){case 110:return "\n";// 'n' -> '\n'
+  case 114:return "\r";// 'r' -> '\r'
+  case 120:return String.fromCharCode(this.readHexChar(2));// 'x'
+  case 117:return codePointToString$1(this.readCodePoint());// 'u'
+  case 116:return "\t";// 't' -> '\t'
+  case 98:return "\b";// 'b' -> '\b'
+  case 118:return "\u000b";// 'v' -> '\u000b'
+  case 102:return "\f";// 'f' -> '\f'
+  case 13:if(this.input.charCodeAt(this.pos)===10){++this.pos;}// '\r\n'
+  case 10:// ' \n'
+  if(this.options.locations){this.lineStart=this.pos;++this.curLine;}return "";default:if(ch>=48&&ch<=55){var octalStr=this.input.substr(this.pos-1,3).match(/^[0-7]+/)[0];var octal=parseInt(octalStr,8);if(octal>255){octalStr=octalStr.slice(0,-1);octal=parseInt(octalStr,8);}this.pos+=octalStr.length-1;ch=this.input.charCodeAt(this.pos);if((octalStr!=="0"||ch===56||ch===57)&&(this.strict||inTemplate)){this.invalidStringToken(this.pos-1-octalStr.length,inTemplate?"Octal literal in template string":"Octal literal in strict mode");}return String.fromCharCode(octal);}if(isNewLine(ch)){// Unicode new line characters after \ get removed from output in both
+  // template literals and strings
+  return "";}return String.fromCharCode(ch);}};// Used to read character escape sequences ('\x', '\u', '\U').
+  pp$9.readHexChar=function(len){var codePos=this.pos;var n=this.readInt(16,len);if(n===null){this.invalidStringToken(codePos,"Bad character escape sequence");}return n;};// Read an identifier, and return it as a string. Sets `this.containsEsc`
+  // to whether the word contained a '\u' escape.
+  //
+  // Incrementally adds only escaped chars, adding other chunks as-is
+  // as a micro-optimization.
+  pp$9.readWord1=function(){this.containsEsc=false;var word="",first=true,chunkStart=this.pos;var astral=this.options.ecmaVersion>=6;while(this.pos<this.input.length){var ch=this.fullCharCodeAtPos();if(isIdentifierChar(ch,astral)){this.pos+=ch<=0xffff?1:2;}else if(ch===92){// "\"
+  this.containsEsc=true;word+=this.input.slice(chunkStart,this.pos);var escStart=this.pos;if(this.input.charCodeAt(++this.pos)!==117)// "u"
+  {this.invalidStringToken(this.pos,"Expecting Unicode escape sequence \\uXXXX");}++this.pos;var esc=this.readCodePoint();if(!(first?isIdentifierStart:isIdentifierChar)(esc,astral)){this.invalidStringToken(escStart,"Invalid Unicode escape");}word+=codePointToString$1(esc);chunkStart=this.pos;}else{break;}first=false;}return word+this.input.slice(chunkStart,this.pos);};// Read an identifier or keyword token. Will check for reserved
+  // words when necessary.
+  pp$9.readWord=function(){var word=this.readWord1();var type=types$2.name;if(this.keywords.test(word)){if(this.containsEsc){this.raiseRecoverable(this.start,"Escape sequence in keyword "+word);}type=keywords$1[word];}return this.finishToken(type,word);};/**
+  	 * Parse a js source to generate the AST
+  	 * @param   {string} source - javascript source
+  	 * @param   {Object} options - parser options
+  	 * @returns {AST} AST tree
+  	 */function generateAST(source,options){return main_2$1(source,Object.assign({parser:{parse(source,opts){return Parser.parse(source,Object.assign({},opts,{ecmaVersion:2020}));}}},options));}var builtin={"Array":false,"ArrayBuffer":false,Atomics:false,BigInt:false,BigInt64Array:false,BigUint64Array:false,"Boolean":false,constructor:false,"DataView":false,"Date":false,"decodeURI":false,"decodeURIComponent":false,"encodeURI":false,"encodeURIComponent":false,"Error":false,"escape":false,"eval":false,"EvalError":false,"Float32Array":false,"Float64Array":false,"Function":false,globalThis:false,hasOwnProperty:false,"Infinity":false,"Int16Array":false,"Int32Array":false,"Int8Array":false,"isFinite":false,"isNaN":false,isPrototypeOf:false,"JSON":false,"Map":false,"Math":false,"NaN":false,"Number":false,"Object":false,"parseFloat":false,"parseInt":false,"Promise":false,propertyIsEnumerable:false,"Proxy":false,"RangeError":false,"ReferenceError":false,"Reflect":false,"RegExp":false,"Set":false,SharedArrayBuffer:false,"String":false,"Symbol":false,"SyntaxError":false,toLocaleString:false,toString:false,"TypeError":false,"Uint16Array":false,"Uint32Array":false,"Uint8Array":false,"Uint8ClampedArray":false,"undefined":false,"unescape":false,"URIError":false,valueOf:false,"WeakMap":false,"WeakSet":false};var es5={"Array":false,"Boolean":false,constructor:false,"Date":false,"decodeURI":false,"decodeURIComponent":false,"encodeURI":false,"encodeURIComponent":false,"Error":false,"escape":false,"eval":false,"EvalError":false,"Function":false,hasOwnProperty:false,"Infinity":false,"isFinite":false,"isNaN":false,isPrototypeOf:false,"JSON":false,"Math":false,"NaN":false,"Number":false,"Object":false,"parseFloat":false,"parseInt":false,propertyIsEnumerable:false,"RangeError":false,"ReferenceError":false,"RegExp":false,"String":false,"SyntaxError":false,toLocaleString:false,toString:false,"TypeError":false,"undefined":false,"unescape":false,"URIError":false,valueOf:false};var es2015={"Array":false,"ArrayBuffer":false,"Boolean":false,constructor:false,"DataView":false,"Date":false,"decodeURI":false,"decodeURIComponent":false,"encodeURI":false,"encodeURIComponent":false,"Error":false,"escape":false,"eval":false,"EvalError":false,"Float32Array":false,"Float64Array":false,"Function":false,hasOwnProperty:false,"Infinity":false,"Int16Array":false,"Int32Array":false,"Int8Array":false,"isFinite":false,"isNaN":false,isPrototypeOf:false,"JSON":false,"Map":false,"Math":false,"NaN":false,"Number":false,"Object":false,"parseFloat":false,"parseInt":false,"Promise":false,propertyIsEnumerable:false,"Proxy":false,"RangeError":false,"ReferenceError":false,"Reflect":false,"RegExp":false,"Set":false,"String":false,"Symbol":false,"SyntaxError":false,toLocaleString:false,toString:false,"TypeError":false,"Uint16Array":false,"Uint32Array":false,"Uint8Array":false,"Uint8ClampedArray":false,"undefined":false,"unescape":false,"URIError":false,valueOf:false,"WeakMap":false,"WeakSet":false};var es2017={"Array":false,"ArrayBuffer":false,Atomics:false,"Boolean":false,constructor:false,"DataView":false,"Date":false,"decodeURI":false,"decodeURIComponent":false,"encodeURI":false,"encodeURIComponent":false,"Error":false,"escape":false,"eval":false,"EvalError":false,"Float32Array":false,"Float64Array":false,"Function":false,hasOwnProperty:false,"Infinity":false,"Int16Array":false,"Int32Array":false,"Int8Array":false,"isFinite":false,"isNaN":false,isPrototypeOf:false,"JSON":false,"Map":false,"Math":false,"NaN":false,"Number":false,"Object":false,"parseFloat":false,"parseInt":false,"Promise":false,propertyIsEnumerable:false,"Proxy":false,"RangeError":false,"ReferenceError":false,"Reflect":false,"RegExp":false,"Set":false,SharedArrayBuffer:false,"String":false,"Symbol":false,"SyntaxError":false,toLocaleString:false,toString:false,"TypeError":false,"Uint16Array":false,"Uint32Array":false,"Uint8Array":false,"Uint8ClampedArray":false,"undefined":false,"unescape":false,"URIError":false,valueOf:false,"WeakMap":false,"WeakSet":false};var browser={AbortController:false,AbortSignal:false,addEventListener:false,alert:false,AnalyserNode:false,Animation:false,AnimationEffectReadOnly:false,AnimationEffectTiming:false,AnimationEffectTimingReadOnly:false,AnimationEvent:false,AnimationPlaybackEvent:false,AnimationTimeline:false,applicationCache:false,ApplicationCache:false,ApplicationCacheErrorEvent:false,atob:false,Attr:false,Audio:false,AudioBuffer:false,AudioBufferSourceNode:false,AudioContext:false,AudioDestinationNode:false,AudioListener:false,AudioNode:false,AudioParam:false,AudioProcessingEvent:false,AudioScheduledSourceNode:false,"AudioWorkletGlobalScope ":false,AudioWorkletNode:false,AudioWorkletProcessor:false,BarProp:false,BaseAudioContext:false,BatteryManager:false,BeforeUnloadEvent:false,BiquadFilterNode:false,Blob:false,BlobEvent:false,blur:false,BroadcastChannel:false,btoa:false,BudgetService:false,ByteLengthQueuingStrategy:false,Cache:false,caches:false,CacheStorage:false,cancelAnimationFrame:false,cancelIdleCallback:false,CanvasCaptureMediaStreamTrack:false,CanvasGradient:false,CanvasPattern:false,CanvasRenderingContext2D:false,ChannelMergerNode:false,ChannelSplitterNode:false,CharacterData:false,clearInterval:false,clearTimeout:false,clientInformation:false,ClipboardEvent:false,close:false,closed:false,CloseEvent:false,Comment:false,CompositionEvent:false,confirm:false,console:false,ConstantSourceNode:false,ConvolverNode:false,CountQueuingStrategy:false,createImageBitmap:false,Credential:false,CredentialsContainer:false,crypto:false,Crypto:false,CryptoKey:false,CSS:false,CSSConditionRule:false,CSSFontFaceRule:false,CSSGroupingRule:false,CSSImportRule:false,CSSKeyframeRule:false,CSSKeyframesRule:false,CSSMediaRule:false,CSSNamespaceRule:false,CSSPageRule:false,CSSRule:false,CSSRuleList:false,CSSStyleDeclaration:false,CSSStyleRule:false,CSSStyleSheet:false,CSSSupportsRule:false,CustomElementRegistry:false,customElements:false,CustomEvent:false,DataTransfer:false,DataTransferItem:false,DataTransferItemList:false,defaultstatus:false,defaultStatus:false,DelayNode:false,DeviceMotionEvent:false,DeviceOrientationEvent:false,devicePixelRatio:false,dispatchEvent:false,document:false,Document:false,DocumentFragment:false,DocumentType:false,DOMError:false,DOMException:false,DOMImplementation:false,DOMMatrix:false,DOMMatrixReadOnly:false,DOMParser:false,DOMPoint:false,DOMPointReadOnly:false,DOMQuad:false,DOMRect:false,DOMRectReadOnly:false,DOMStringList:false,DOMStringMap:false,DOMTokenList:false,DragEvent:false,DynamicsCompressorNode:false,Element:false,ErrorEvent:false,event:false,Event:false,EventSource:false,EventTarget:false,external:false,fetch:false,File:false,FileList:false,FileReader:false,find:false,focus:false,FocusEvent:false,FontFace:false,FontFaceSetLoadEvent:false,FormData:false,frameElement:false,frames:false,GainNode:false,Gamepad:false,GamepadButton:false,GamepadEvent:false,getComputedStyle:false,getSelection:false,HashChangeEvent:false,Headers:false,history:false,History:false,HTMLAllCollection:false,HTMLAnchorElement:false,HTMLAreaElement:false,HTMLAudioElement:false,HTMLBaseElement:false,HTMLBodyElement:false,HTMLBRElement:false,HTMLButtonElement:false,HTMLCanvasElement:false,HTMLCollection:false,HTMLContentElement:false,HTMLDataElement:false,HTMLDataListElement:false,HTMLDetailsElement:false,HTMLDialogElement:false,HTMLDirectoryElement:false,HTMLDivElement:false,HTMLDListElement:false,HTMLDocument:false,HTMLElement:false,HTMLEmbedElement:false,HTMLFieldSetElement:false,HTMLFontElement:false,HTMLFormControlsCollection:false,HTMLFormElement:false,HTMLFrameElement:false,HTMLFrameSetElement:false,HTMLHeadElement:false,HTMLHeadingElement:false,HTMLHRElement:false,HTMLHtmlElement:false,HTMLIFrameElement:false,HTMLImageElement:false,HTMLInputElement:false,HTMLLabelElement:false,HTMLLegendElement:false,HTMLLIElement:false,HTMLLinkElement:false,HTMLMapElement:false,HTMLMarqueeElement:false,HTMLMediaElement:false,HTMLMenuElement:false,HTMLMetaElement:false,HTMLMeterElement:false,HTMLModElement:false,HTMLObjectElement:false,HTMLOListElement:false,HTMLOptGroupElement:false,HTMLOptionElement:false,HTMLOptionsCollection:false,HTMLOutputElement:false,HTMLParagraphElement:false,HTMLParamElement:false,HTMLPictureElement:false,HTMLPreElement:false,HTMLProgressElement:false,HTMLQuoteElement:false,HTMLScriptElement:false,HTMLSelectElement:false,HTMLShadowElement:false,HTMLSlotElement:false,HTMLSourceElement:false,HTMLSpanElement:false,HTMLStyleElement:false,HTMLTableCaptionElement:false,HTMLTableCellElement:false,HTMLTableColElement:false,HTMLTableElement:false,HTMLTableRowElement:false,HTMLTableSectionElement:false,HTMLTemplateElement:false,HTMLTextAreaElement:false,HTMLTimeElement:false,HTMLTitleElement:false,HTMLTrackElement:false,HTMLUListElement:false,HTMLUnknownElement:false,HTMLVideoElement:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,IdleDeadline:false,IIRFilterNode:false,Image:false,ImageBitmap:false,ImageBitmapRenderingContext:false,ImageCapture:false,ImageData:false,indexedDB:false,innerHeight:false,innerWidth:false,InputEvent:false,IntersectionObserver:false,IntersectionObserverEntry:false,"Intl":false,isSecureContext:false,KeyboardEvent:false,KeyframeEffect:false,KeyframeEffectReadOnly:false,length:false,localStorage:false,location:true,Location:false,locationbar:false,matchMedia:false,MediaDeviceInfo:false,MediaDevices:false,MediaElementAudioSourceNode:false,MediaEncryptedEvent:false,MediaError:false,MediaKeyMessageEvent:false,MediaKeySession:false,MediaKeyStatusMap:false,MediaKeySystemAccess:false,MediaList:false,MediaQueryList:false,MediaQueryListEvent:false,MediaRecorder:false,MediaSettingsRange:false,MediaSource:false,MediaStream:false,MediaStreamAudioDestinationNode:false,MediaStreamAudioSourceNode:false,MediaStreamEvent:false,MediaStreamTrack:false,MediaStreamTrackEvent:false,menubar:false,MessageChannel:false,MessageEvent:false,MessagePort:false,MIDIAccess:false,MIDIConnectionEvent:false,MIDIInput:false,MIDIInputMap:false,MIDIMessageEvent:false,MIDIOutput:false,MIDIOutputMap:false,MIDIPort:false,MimeType:false,MimeTypeArray:false,MouseEvent:false,moveBy:false,moveTo:false,MutationEvent:false,MutationObserver:false,MutationRecord:false,name:false,NamedNodeMap:false,NavigationPreloadManager:false,navigator:false,Navigator:false,NetworkInformation:false,Node:false,NodeFilter:false,NodeIterator:false,NodeList:false,Notification:false,OfflineAudioCompletionEvent:false,OfflineAudioContext:false,offscreenBuffering:false,OffscreenCanvas:true,onabort:true,onafterprint:true,onanimationend:true,onanimationiteration:true,onanimationstart:true,onappinstalled:true,onauxclick:true,onbeforeinstallprompt:true,onbeforeprint:true,onbeforeunload:true,onblur:true,oncancel:true,oncanplay:true,oncanplaythrough:true,onchange:true,onclick:true,onclose:true,oncontextmenu:true,oncuechange:true,ondblclick:true,ondevicemotion:true,ondeviceorientation:true,ondeviceorientationabsolute:true,ondrag:true,ondragend:true,ondragenter:true,ondragleave:true,ondragover:true,ondragstart:true,ondrop:true,ondurationchange:true,onemptied:true,onended:true,onerror:true,onfocus:true,ongotpointercapture:true,onhashchange:true,oninput:true,oninvalid:true,onkeydown:true,onkeypress:true,onkeyup:true,onlanguagechange:true,onload:true,onloadeddata:true,onloadedmetadata:true,onloadstart:true,onlostpointercapture:true,onmessage:true,onmessageerror:true,onmousedown:true,onmouseenter:true,onmouseleave:true,onmousemove:true,onmouseout:true,onmouseover:true,onmouseup:true,onmousewheel:true,onoffline:true,ononline:true,onpagehide:true,onpageshow:true,onpause:true,onplay:true,onplaying:true,onpointercancel:true,onpointerdown:true,onpointerenter:true,onpointerleave:true,onpointermove:true,onpointerout:true,onpointerover:true,onpointerup:true,onpopstate:true,onprogress:true,onratechange:true,onrejectionhandled:true,onreset:true,onresize:true,onscroll:true,onsearch:true,onseeked:true,onseeking:true,onselect:true,onstalled:true,onstorage:true,onsubmit:true,onsuspend:true,ontimeupdate:true,ontoggle:true,ontransitionend:true,onunhandledrejection:true,onunload:true,onvolumechange:true,onwaiting:true,onwheel:true,open:false,openDatabase:false,opener:false,Option:false,origin:false,OscillatorNode:false,outerHeight:false,outerWidth:false,PageTransitionEvent:false,pageXOffset:false,pageYOffset:false,PannerNode:false,parent:false,Path2D:false,PaymentAddress:false,PaymentRequest:false,PaymentRequestUpdateEvent:false,PaymentResponse:false,performance:false,Performance:false,PerformanceEntry:false,PerformanceLongTaskTiming:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceNavigationTiming:false,PerformanceObserver:false,PerformanceObserverEntryList:false,PerformancePaintTiming:false,PerformanceResourceTiming:false,PerformanceTiming:false,PeriodicWave:false,Permissions:false,PermissionStatus:false,personalbar:false,PhotoCapabilities:false,Plugin:false,PluginArray:false,PointerEvent:false,PopStateEvent:false,postMessage:false,Presentation:false,PresentationAvailability:false,PresentationConnection:false,PresentationConnectionAvailableEvent:false,PresentationConnectionCloseEvent:false,PresentationConnectionList:false,PresentationReceiver:false,PresentationRequest:false,print:false,ProcessingInstruction:false,ProgressEvent:false,PromiseRejectionEvent:false,prompt:false,PushManager:false,PushSubscription:false,PushSubscriptionOptions:false,queueMicrotask:false,RadioNodeList:false,Range:false,ReadableStream:false,registerProcessor:false,RemotePlayback:false,removeEventListener:false,Request:false,requestAnimationFrame:false,requestIdleCallback:false,resizeBy:false,ResizeObserver:false,ResizeObserverEntry:false,resizeTo:false,Response:false,RTCCertificate:false,RTCDataChannel:false,RTCDataChannelEvent:false,RTCDtlsTransport:false,RTCIceCandidate:false,RTCIceGatherer:false,RTCIceTransport:false,RTCPeerConnection:false,RTCPeerConnectionIceEvent:false,RTCRtpContributingSource:false,RTCRtpReceiver:false,RTCRtpSender:false,RTCSctpTransport:false,RTCSessionDescription:false,RTCStatsReport:false,RTCTrackEvent:false,screen:false,Screen:false,screenLeft:false,ScreenOrientation:false,screenTop:false,screenX:false,screenY:false,ScriptProcessorNode:false,scroll:false,scrollbars:false,scrollBy:false,scrollTo:false,scrollX:false,scrollY:false,SecurityPolicyViolationEvent:false,Selection:false,self:false,ServiceWorker:false,ServiceWorkerContainer:false,ServiceWorkerRegistration:false,sessionStorage:false,setInterval:false,setTimeout:false,ShadowRoot:false,SharedWorker:false,SourceBuffer:false,SourceBufferList:false,speechSynthesis:false,SpeechSynthesisEvent:false,SpeechSynthesisUtterance:false,StaticRange:false,status:false,statusbar:false,StereoPannerNode:false,stop:false,Storage:false,StorageEvent:false,StorageManager:false,styleMedia:false,StyleSheet:false,StyleSheetList:false,SubtleCrypto:false,SVGAElement:false,SVGAngle:false,SVGAnimatedAngle:false,SVGAnimatedBoolean:false,SVGAnimatedEnumeration:false,SVGAnimatedInteger:false,SVGAnimatedLength:false,SVGAnimatedLengthList:false,SVGAnimatedNumber:false,SVGAnimatedNumberList:false,SVGAnimatedPreserveAspectRatio:false,SVGAnimatedRect:false,SVGAnimatedString:false,SVGAnimatedTransformList:false,SVGAnimateElement:false,SVGAnimateMotionElement:false,SVGAnimateTransformElement:false,SVGAnimationElement:false,SVGCircleElement:false,SVGClipPathElement:false,SVGComponentTransferFunctionElement:false,SVGDefsElement:false,SVGDescElement:false,SVGDiscardElement:false,SVGElement:false,SVGEllipseElement:false,SVGFEBlendElement:false,SVGFEColorMatrixElement:false,SVGFEComponentTransferElement:false,SVGFECompositeElement:false,SVGFEConvolveMatrixElement:false,SVGFEDiffuseLightingElement:false,SVGFEDisplacementMapElement:false,SVGFEDistantLightElement:false,SVGFEDropShadowElement:false,SVGFEFloodElement:false,SVGFEFuncAElement:false,SVGFEFuncBElement:false,SVGFEFuncGElement:false,SVGFEFuncRElement:false,SVGFEGaussianBlurElement:false,SVGFEImageElement:false,SVGFEMergeElement:false,SVGFEMergeNodeElement:false,SVGFEMorphologyElement:false,SVGFEOffsetElement:false,SVGFEPointLightElement:false,SVGFESpecularLightingElement:false,SVGFESpotLightElement:false,SVGFETileElement:false,SVGFETurbulenceElement:false,SVGFilterElement:false,SVGForeignObjectElement:false,SVGGElement:false,SVGGeometryElement:false,SVGGradientElement:false,SVGGraphicsElement:false,SVGImageElement:false,SVGLength:false,SVGLengthList:false,SVGLinearGradientElement:false,SVGLineElement:false,SVGMarkerElement:false,SVGMaskElement:false,SVGMatrix:false,SVGMetadataElement:false,SVGMPathElement:false,SVGNumber:false,SVGNumberList:false,SVGPathElement:false,SVGPatternElement:false,SVGPoint:false,SVGPointList:false,SVGPolygonElement:false,SVGPolylineElement:false,SVGPreserveAspectRatio:false,SVGRadialGradientElement:false,SVGRect:false,SVGRectElement:false,SVGScriptElement:false,SVGSetElement:false,SVGStopElement:false,SVGStringList:false,SVGStyleElement:false,SVGSVGElement:false,SVGSwitchElement:false,SVGSymbolElement:false,SVGTextContentElement:false,SVGTextElement:false,SVGTextPathElement:false,SVGTextPositioningElement:false,SVGTitleElement:false,SVGTransform:false,SVGTransformList:false,SVGTSpanElement:false,SVGUnitTypes:false,SVGUseElement:false,SVGViewElement:false,TaskAttributionTiming:false,Text:false,TextDecoder:false,TextEncoder:false,TextEvent:false,TextMetrics:false,TextTrack:false,TextTrackCue:false,TextTrackCueList:false,TextTrackList:false,TimeRanges:false,toolbar:false,top:false,Touch:false,TouchEvent:false,TouchList:false,TrackEvent:false,TransitionEvent:false,TreeWalker:false,UIEvent:false,URL:false,URLSearchParams:false,ValidityState:false,visualViewport:false,VisualViewport:false,VTTCue:false,WaveShaperNode:false,WebAssembly:false,WebGL2RenderingContext:false,WebGLActiveInfo:false,WebGLBuffer:false,WebGLContextEvent:false,WebGLFramebuffer:false,WebGLProgram:false,WebGLQuery:false,WebGLRenderbuffer:false,WebGLRenderingContext:false,WebGLSampler:false,WebGLShader:false,WebGLShaderPrecisionFormat:false,WebGLSync:false,WebGLTexture:false,WebGLTransformFeedback:false,WebGLUniformLocation:false,WebGLVertexArrayObject:false,WebSocket:false,WheelEvent:false,window:false,Window:false,Worker:false,WritableStream:false,XMLDocument:false,XMLHttpRequest:false,XMLHttpRequestEventTarget:false,XMLHttpRequestUpload:false,XMLSerializer:false,XPathEvaluator:false,XPathExpression:false,XPathResult:false,XSLTProcessor:false};var worker={addEventListener:false,applicationCache:false,atob:false,Blob:false,BroadcastChannel:false,btoa:false,Cache:false,caches:false,clearInterval:false,clearTimeout:false,close:true,console:false,fetch:false,FileReaderSync:false,FormData:false,Headers:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,ImageData:false,importScripts:true,indexedDB:false,location:false,MessageChannel:false,MessagePort:false,name:false,navigator:false,Notification:false,onclose:true,onconnect:true,onerror:true,onlanguagechange:true,onmessage:true,onoffline:true,ononline:true,onrejectionhandled:true,onunhandledrejection:true,performance:false,Performance:false,PerformanceEntry:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceResourceTiming:false,PerformanceTiming:false,postMessage:true,"Promise":false,queueMicrotask:false,removeEventListener:false,Request:false,Response:false,self:true,ServiceWorkerRegistration:false,setInterval:false,setTimeout:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false,WebSocket:false,Worker:false,WorkerGlobalScope:false,XMLHttpRequest:false};var node={__dirname:false,__filename:false,Buffer:false,clearImmediate:false,clearInterval:false,clearTimeout:false,console:false,exports:true,global:false,"Intl":false,module:false,process:false,queueMicrotask:false,require:false,setImmediate:false,setInterval:false,setTimeout:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false};var commonjs={exports:true,global:false,module:false,require:false};var amd={define:false,require:false};var mocha={after:false,afterEach:false,before:false,beforeEach:false,context:false,describe:false,it:false,mocha:false,run:false,setup:false,specify:false,suite:false,suiteSetup:false,suiteTeardown:false,teardown:false,test:false,xcontext:false,xdescribe:false,xit:false,xspecify:false};var jasmine={afterAll:false,afterEach:false,beforeAll:false,beforeEach:false,describe:false,expect:false,fail:false,fdescribe:false,fit:false,it:false,jasmine:false,pending:false,runs:false,spyOn:false,spyOnProperty:false,waits:false,waitsFor:false,xdescribe:false,xit:false};var jest={afterAll:false,afterEach:false,beforeAll:false,beforeEach:false,describe:false,expect:false,fdescribe:false,fit:false,it:false,jest:false,pit:false,require:false,test:false,xdescribe:false,xit:false,xtest:false};var qunit={asyncTest:false,deepEqual:false,equal:false,expect:false,module:false,notDeepEqual:false,notEqual:false,notOk:false,notPropEqual:false,notStrictEqual:false,ok:false,propEqual:false,QUnit:false,raises:false,start:false,stop:false,strictEqual:false,test:false,throws:false};var phantomjs={console:true,exports:true,phantom:true,require:true,WebPage:true};var couch={emit:false,exports:false,getRow:false,log:false,module:false,provides:false,require:false,respond:false,send:false,start:false,sum:false};var rhino={defineClass:false,deserialize:false,gc:false,help:false,importClass:false,importPackage:false,java:false,load:false,loadClass:false,Packages:false,print:false,quit:false,readFile:false,readUrl:false,runCommand:false,seal:false,serialize:false,spawn:false,sync:false,toint32:false,version:false};var nashorn={__DIR__:false,__FILE__:false,__LINE__:false,com:false,edu:false,exit:false,java:false,Java:false,javafx:false,JavaImporter:false,javax:false,JSAdapter:false,load:false,loadWithNewGlobal:false,org:false,Packages:false,print:false,quit:false};var wsh={ActiveXObject:true,Enumerator:true,GetObject:true,ScriptEngine:true,ScriptEngineBuildVersion:true,ScriptEngineMajorVersion:true,ScriptEngineMinorVersion:true,VBArray:true,WScript:true,WSH:true,XDomainRequest:true};var jquery={$:false,jQuery:false};var yui={YAHOO:false,YAHOO_config:false,YUI:false,YUI_config:false};var shelljs={cat:false,cd:false,chmod:false,config:false,cp:false,dirs:false,echo:false,env:false,error:false,exec:false,exit:false,find:false,grep:false,ln:false,ls:false,mkdir:false,mv:false,popd:false,pushd:false,pwd:false,rm:false,sed:false,set:false,target:false,tempdir:false,test:false,touch:false,which:false};var prototypejs={$:false,$$:false,$A:false,$break:false,$continue:false,$F:false,$H:false,$R:false,$w:false,Abstract:false,Ajax:false,Autocompleter:false,Builder:false,Class:false,Control:false,Draggable:false,Draggables:false,Droppables:false,Effect:false,Element:false,Enumerable:false,Event:false,Field:false,Form:false,Hash:false,Insertion:false,ObjectRange:false,PeriodicalExecuter:false,Position:false,Prototype:false,Scriptaculous:false,Selector:false,Sortable:false,SortableObserver:false,Sound:false,Template:false,Toggle:false,Try:false};var meteor={_:false,$:false,Accounts:false,AccountsClient:false,AccountsCommon:false,AccountsServer:false,App:false,Assets:false,Blaze:false,check:false,Cordova:false,DDP:false,DDPRateLimiter:false,DDPServer:false,Deps:false,EJSON:false,Email:false,HTTP:false,Log:false,Match:false,Meteor:false,Mongo:false,MongoInternals:false,Npm:false,Package:false,Plugin:false,process:false,Random:false,ReactiveDict:false,ReactiveVar:false,Router:false,ServiceConfiguration:false,Session:false,share:false,Spacebars:false,Template:false,Tinytest:false,Tracker:false,UI:false,Utils:false,WebApp:false,WebAppInternals:false};var mongo={_isWindows:false,_rand:false,BulkWriteResult:false,cat:false,cd:false,connect:false,db:false,getHostName:false,getMemInfo:false,hostname:false,ISODate:false,listFiles:false,load:false,ls:false,md5sumFile:false,mkdir:false,Mongo:false,NumberInt:false,NumberLong:false,ObjectId:false,PlanCache:false,print:false,printjson:false,pwd:false,quit:false,removeFile:false,rs:false,sh:false,UUID:false,version:false,WriteResult:false};var applescript={$:false,Application:false,Automation:false,console:false,delay:false,Library:false,ObjC:false,ObjectSpecifier:false,Path:false,Progress:false,Ref:false};var serviceworker={addEventListener:false,applicationCache:false,atob:false,Blob:false,BroadcastChannel:false,btoa:false,Cache:false,caches:false,CacheStorage:false,clearInterval:false,clearTimeout:false,Client:false,clients:false,Clients:false,close:true,console:false,ExtendableEvent:false,ExtendableMessageEvent:false,fetch:false,FetchEvent:false,FileReaderSync:false,FormData:false,Headers:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,ImageData:false,importScripts:false,indexedDB:false,location:false,MessageChannel:false,MessagePort:false,name:false,navigator:false,Notification:false,onclose:true,onconnect:true,onerror:true,onfetch:true,oninstall:true,onlanguagechange:true,onmessage:true,onmessageerror:true,onnotificationclick:true,onnotificationclose:true,onoffline:true,ononline:true,onpush:true,onpushsubscriptionchange:true,onrejectionhandled:true,onsync:true,onunhandledrejection:true,performance:false,Performance:false,PerformanceEntry:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceResourceTiming:false,PerformanceTiming:false,postMessage:true,"Promise":false,queueMicrotask:false,registration:false,removeEventListener:false,Request:false,Response:false,self:false,ServiceWorker:false,ServiceWorkerContainer:false,ServiceWorkerGlobalScope:false,ServiceWorkerMessageEvent:false,ServiceWorkerRegistration:false,setInterval:false,setTimeout:false,skipWaiting:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false,WebSocket:false,WindowClient:false,Worker:false,WorkerGlobalScope:false,XMLHttpRequest:false};var atomtest={advanceClock:false,fakeClearInterval:false,fakeClearTimeout:false,fakeSetInterval:false,fakeSetTimeout:false,resetTimeouts:false,waitsForPromise:false};var embertest={andThen:false,click:false,currentPath:false,currentRouteName:false,currentURL:false,fillIn:false,find:false,findAll:false,findWithAssert:false,keyEvent:false,pauseTest:false,resumeTest:false,triggerEvent:false,visit:false,wait:false};var protractor={$:false,$$:false,browser:false,by:false,By:false,DartObject:false,element:false,protractor:false};var webextensions={browser:false,chrome:false,opr:false};var greasemonkey={cloneInto:false,createObjectIn:false,exportFunction:false,GM:false,GM_addStyle:false,GM_deleteValue:false,GM_getResourceText:false,GM_getResourceURL:false,GM_getValue:false,GM_info:false,GM_listValues:false,GM_log:false,GM_openInTab:false,GM_registerMenuCommand:false,GM_setClipboard:false,GM_setValue:false,GM_xmlhttpRequest:false,unsafeWindow:false};var devtools={$:false,$_:false,$$:false,$0:false,$1:false,$2:false,$3:false,$4:false,$x:false,chrome:false,clear:false,copy:false,debug:false,dir:false,dirxml:false,getEventListeners:false,inspect:false,keys:false,monitor:false,monitorEvents:false,profile:false,profileEnd:false,queryObjects:false,table:false,undebug:false,unmonitor:false,unmonitorEvents:false,values:false};var globals={builtin:builtin,es5:es5,es2015:es2015,es2017:es2017,browser:browser,worker:worker,node:node,commonjs:commonjs,amd:amd,mocha:mocha,jasmine:jasmine,jest:jest,qunit:qunit,phantomjs:phantomjs,couch:couch,rhino:rhino,nashorn:nashorn,wsh:wsh,jquery:jquery,yui:yui,shelljs:shelljs,prototypejs:prototypejs,meteor:meteor,mongo:mongo,applescript:applescript,serviceworker:serviceworker,atomtest:atomtest,embertest:embertest,protractor:protractor,"shared-node-browser":{clearInterval:false,clearTimeout:false,console:false,setInterval:false,setTimeout:false,URL:false,URLSearchParams:false},webextensions:webextensions,greasemonkey:greasemonkey,devtools:devtools};var globals$1=/*#__PURE__*/Object.freeze({builtin:builtin,es5:es5,es2015:es2015,es2017:es2017,browser:browser,worker:worker,node:node,commonjs:commonjs,amd:amd,mocha:mocha,jasmine:jasmine,jest:jest,qunit:qunit,phantomjs:phantomjs,couch:couch,rhino:rhino,nashorn:nashorn,wsh:wsh,jquery:jquery,yui:yui,shelljs:shelljs,prototypejs:prototypejs,meteor:meteor,mongo:mongo,applescript:applescript,serviceworker:serviceworker,atomtest:atomtest,embertest:embertest,protractor:protractor,webextensions:webextensions,greasemonkey:greasemonkey,devtools:devtools,'default':globals});var require$$0=getCjsExportFromNamespace(globals$1);var globals$2=require$$0;const browserAPIs=Object.keys(globals$2.browser);const builtinAPIs=Object.keys(globals$2.builtin);const isIdentifier=namedTypes.Identifier.check.bind(namedTypes.Identifier);const isLiteral=namedTypes.Literal.check.bind(namedTypes.Literal);const isExpressionStatement=namedTypes.ExpressionStatement.check.bind(namedTypes.ExpressionStatement);const isObjectExpression=namedTypes.ObjectExpression.check.bind(namedTypes.ObjectExpression);const isThisExpression=namedTypes.ThisExpression.check.bind(namedTypes.ThisExpression);const isNewExpression=namedTypes.NewExpression.check.bind(namedTypes.NewExpression);const isSequenceExpression=namedTypes.SequenceExpression.check.bind(namedTypes.SequenceExpression);const isBinaryExpression=namedTypes.BinaryExpression.check.bind(namedTypes.BinaryExpression);const isExportDefaultStatement=namedTypes.ExportDefaultDeclaration.check.bind(namedTypes.ExportDefaultDeclaration);const isBrowserAPI=(_ref)=>{let{name}=_ref;return browserAPIs.includes(name);};const isBuiltinAPI=(_ref2)=>{let{name}=_ref2;return builtinAPIs.includes(name);};const isRaw=node=>node&&node.raw;// eslint-disable-line
+  /**
+  	 * Find the export default statement
+  	 * @param   { Array } body - tree structure containing the program code
+  	 * @returns { Object } node containing only the code of the export default statement
+  	 */function findExportDefaultStatement(body){return body.find(isExportDefaultStatement);}/**
+  	 * Find all the code in an ast program except for the export default statements
+  	 * @param   { Array } body - tree structure containing the program code
+  	 * @returns { Array } array containing all the program code except the export default expressions
+  	 */function filterNonExportDefaultStatements(body){return body.filter(node=>!isExportDefaultStatement(node));}/**
+  	 * Get the body of the AST structure
+  	 * @param   { Object } ast - ast object generated by recast
+  	 * @returns { Array } array containing the program code
+  	 */function getProgramBody(ast){return ast.body||ast.program.body;}/**
+  	 * Extend the AST adding the new tag method containing our tag sourcecode
+  	 * @param   { Object } ast - current output ast
+  	 * @param   { Object } exportDefaultNode - tag export default node
+  	 * @returns { Object } the output ast having the "tag" key extended with the content of the export default
+  	 */function extendTagProperty(ast,exportDefaultNode){types$1.visit(ast,{visitProperty(path){if(path.value.key.value===TAG_LOGIC_PROPERTY){path.value.value=exportDefaultNode.declaration;return false;}this.traverse(path);}});return ast;}/**
+  	 * Generate the component javascript logic
+  	 * @param   { Object } sourceNode - node generated by the riot compiler
+  	 * @param   { string } source - original component source code
+  	 * @param   { Object } meta - compilation meta information
+  	 * @param   { AST } ast - current AST output
+  	 * @returns { AST } the AST generated
+  	 */function javascript(sourceNode,source,meta,ast){const preprocessorName=getPreprocessorTypeByAttribute(sourceNode);const javascriptNode=addLineOffset(sourceNode.text.text,source,sourceNode);const{options}=meta;const preprocessorOutput=preprocess('javascript',preprocessorName,meta,Object.assign({},sourceNode,{text:javascriptNode}));const inputSourceMap=sourcemapAsJSON(preprocessorOutput.map);const generatedAst=generateAST(preprocessorOutput.code,{sourceFileName:options.file,inputSourceMap:isEmptySourcemap(inputSourceMap)?null:inputSourceMap});const generatedAstBody=getProgramBody(generatedAst);const bodyWithoutExportDefault=filterNonExportDefaultStatements(generatedAstBody);const exportDefaultNode=findExportDefaultStatement(generatedAstBody);const outputBody=getProgramBody(ast);// add to the ast the "private" javascript content of our tag script node
+  outputBody.unshift(...bodyWithoutExportDefault);// convert the export default adding its content to the "tag" property exported
+  if(exportDefaultNode)extendTagProperty(ast,exportDefaultNode);return ast;}/**
+  	 * Not all the types are handled in this module.
+  	 *
+  	 * @enum {number}
+  	 * @readonly
+  	 */const TAG=1;/* TAG */const ATTR=2;/* ATTR */const TEXT=3;/* TEXT */const CDATA=4;/* CDATA */const COMMENT=8;/* COMMENT */const DOCUMENT=9;/* DOCUMENT */const DOCTYPE=10;/* DOCTYPE */const DOCUMENT_FRAGMENT=11;/* DOCUMENT_FRAGMENT */var types$3=/*#__PURE__*/Object.freeze({TAG:TAG,ATTR:ATTR,TEXT:TEXT,CDATA:CDATA,COMMENT:COMMENT,DOCUMENT:DOCUMENT,DOCTYPE:DOCTYPE,DOCUMENT_FRAGMENT:DOCUMENT_FRAGMENT});const rootTagNotFound='Root tag not found.';const unclosedTemplateLiteral='Unclosed ES6 template literal.';const unexpectedEndOfFile='Unexpected end of file.';const unclosedComment='Unclosed comment.';const unclosedNamedBlock='Unclosed "%1" block.';const duplicatedNamedTag='Duplicate tag "<%1>".';const unexpectedCharInExpression='Unexpected character %1.';const unclosedExpression='Unclosed expression.';/**
+  	 * Matches the start of valid tags names; used with the first 2 chars after the `'<'`.
+  	 * @const
+  	 * @private
+  	 */const TAG_2C=/^(?:\/[a-zA-Z]|[a-zA-Z][^\s>/]?)/;/**
+  	 * Matches valid tags names AFTER the validation with `TAG_2C`.
+  	 * $1: tag name including any `'/'`, $2: non self-closing brace (`>`) w/o attributes.
+  	 * @const
+  	 * @private
+  	 */const TAG_NAME=/(\/?[^\s>/]+)\s*(>)?/g;/**
+  	 * Matches an attribute name-value pair (both can be empty).
+  	 * $1: attribute name, $2: value including any quotes.
+  	 * @const
+  	 * @private
+  	 */const ATTR_START=/(\S[^>/=\s]*)(?:\s*=\s*([^>/])?)?/g;/**
+  	 * Matches the spread operator
+  	 * it will be used for the spread attributes
+  	 * @type {RegExp}
+  	 */const SPREAD_OPERATOR=/\.\.\./;/**
+  	 * Matches the closing tag of a `script` and `style` block.
+  	 * Used by parseText fo find the end of the block.
+  	 * @const
+  	 * @private
+  	 */const RE_SCRYLE={script:/<\/script\s*>/gi,style:/<\/style\s*>/gi,textarea:/<\/textarea\s*>/gi};// Do not touch text content inside this tags
+  const RAW_TAGS=/^\/?(?:pre|textarea)$/;const JAVASCRIPT_OUTPUT_NAME='javascript';const CSS_OUTPUT_NAME='css';const TEMPLATE_OUTPUT_NAME='template';// Tag names
+  const JAVASCRIPT_TAG='script';const STYLE_TAG='style';const TEXTAREA_TAG='textarea';// Boolean attributes
+  const IS_RAW='isRaw';const IS_SELF_CLOSING='isSelfClosing';const IS_VOID='isVoid';const IS_BOOLEAN='isBoolean';const IS_CUSTOM='isCustom';const IS_SPREAD='isSpread';/**
+  	 * Add an item into a collection, if the collection is not an array
+  	 * we create one and add the item to it
+  	 * @param   {Array} collection - target collection
+  	 * @param   {*} item - item to add to the collection
+  	 * @returns {Array} array containing the new item added to it
+  	 */function addToCollection(collection,item){if(collection===void 0){collection=[];}collection.push(item);return collection;}/**
+  	 * Run RegExp.exec starting from a specific position
+  	 * @param   {RegExp} re - regex
+  	 * @param   {number} pos - last index position
+  	 * @param   {string} string - regex target
+  	 * @returns {Array} regex result
+  	 */function execFromPos(re,pos,string){re.lastIndex=pos;return re.exec(string);}/**
+  	 * Escape special characters in a given string, in preparation to create a regex.
+  	 *
+  	 * @param   {string} str - Raw string
+  	 * @returns {string} Escaped string.
+  	 */var escapeStr=str=>str.replace(/(?=[-[\](){^*+?.$|\\])/g,'\\');function formatError$1(data,message,pos){if(!pos){pos=data.length;}// count unix/mac/win eols
+  const line=(data.slice(0,pos).match(/\r\n?|\n/g)||'').length+1;let col=0;while(--pos>=0&&!/[\r\n]/.test(data[pos])){++col;}return `[${line},${col}]: ${message}`;}const $_ES6_BQ='`';/**
+  	 * Searches the next backquote that signals the end of the ES6 Template Literal
+  	 * or the "${" sequence that starts a JS expression, skipping any escaped
+  	 * character.
+  	 *
+  	 * @param   {string}    code  - Whole code
+  	 * @param   {number}    pos   - The start position of the template
+  	 * @param   {string[]}  stack - To save nested ES6 TL count
+  	 * @returns {number}    The end of the string (-1 if not found)
+  	 */function skipES6TL(code,pos,stack){// we are in the char following the backquote (`),
+  // find the next unescaped backquote or the sequence "${"
+  const re=/[`$\\]/g;let c;while(re.lastIndex=pos,re.exec(code)){pos=re.lastIndex;c=code[pos-1];if(c==='`'){return pos;}if(c==='$'&&code[pos++]==='{'){stack.push($_ES6_BQ,'}');return pos;}// else this is an escaped char
+  }throw formatError$1(code,unclosedTemplateLiteral,pos);}/**
+  	 * Custom error handler can be implemented replacing this method.
+  	 * The `state` object includes the buffer (`data`)
+  	 * The error position (`loc`) contains line (base 1) and col (base 0).
+  	 * @param {string} data - string containing the error
+  	 * @param {string} msg - Error message
+  	 * @param {number} pos - Position of the error
+  	 * @returns {undefined} throw an exception error
+  	 */function panic$1(data,msg,pos){const message=formatError$1(data,msg,pos);throw new Error(message);}// forked from https://github.com/aMarCruz/skip-regex
+  // safe characters to precced a regex (including `=>`, `**`, and `...`)
+  const beforeReChars='[{(,;:?=|&!^~>%*/';const beforeReSign=`${beforeReChars}+-`;// keyword that can preceed a regex (`in` is handled as special case)
+  const beforeReWords=['case','default','do','else','in','instanceof','prefix','return','typeof','void','yield'];// Last chars of all the beforeReWords elements to speed up the process.
+  const wordsEndChar=beforeReWords.reduce((s,w)=>s+w.slice(-1),'');// Matches literal regex from the start of the buffer.
+  // The buffer to search must not include line-endings.
+  const RE_LIT_REGEX=/^\/(?=[^*>/])[^[/\\]*(?:(?:\\.|\[(?:\\.|[^\]\\]*)*\])[^[\\/]*)*?\/[gimuy]*/;// Valid characters for JavaScript variable names and literal numbers.
+  const RE_JS_VCHAR=/[$\w]/;// Match dot characters that could be part of tricky regex
+  const RE_DOT_CHAR=/.*/g;/**
+  	 * Searches the position of the previous non-blank character inside `code`,
+  	 * starting with `pos - 1`.
+  	 *
+  	 * @param   {string} code - Buffer to search
+  	 * @param   {number} pos  - Starting position
+  	 * @returns {number} Position of the first non-blank character to the left.
+  	 * @private
+  	 */function _prev(code,pos){while(--pos>=0&&/\s/.test(code[pos]));return pos;}/**
+  	 * Check if the character in the `start` position within `code` can be a regex
+  	 * and returns the position following this regex or `start+1` if this is not
+  	 * one.
+  	 *
+  	 * NOTE: Ensure `start` points to a slash (this is not checked).
+  	 *
+  	 * @function skipRegex
+  	 * @param   {string} code  - Buffer to test in
+  	 * @param   {number} start - Position the first slash inside `code`
+  	 * @returns {number} Position of the char following the regex.
+  	 *
+  	 */ /* istanbul ignore next */function skipRegex(code,start){let pos=RE_DOT_CHAR.lastIndex=start++;// `exec()` will extract from the slash to the end of the line
+  //   and the chained `match()` will match the possible regex.
+  const match=(RE_DOT_CHAR.exec(code)||' ')[0].match(RE_LIT_REGEX);if(match){const next=pos+match[0].length;// result comes from `re.match`
+  pos=_prev(code,pos);let c=code[pos];// start of buffer or safe prefix?
+  if(pos<0||beforeReChars.includes(c)){return next;}// from here, `pos` is >= 0 and `c` is code[pos]
+  if(c==='.'){// can be `...` or something silly like 5./2
+  if(code[pos-1]==='.'){start=next;}}else{if(c==='+'||c==='-'){// tricky case
+  if(code[--pos]!==c||// if have a single operator or
+  (pos=_prev(code,pos))<0||// ...have `++` and no previous token
+  beforeReSign.includes(c=code[pos])){return next;// ...this is a regex
+  }}if(wordsEndChar.includes(c)){// looks like a keyword?
+  const end=pos+1;// get the complete (previous) keyword
+  while(--pos>=0&&RE_JS_VCHAR.test(code[pos]));// it is in the allowed keywords list?
+  if(beforeReWords.includes(code.slice(pos+1,end))){start=next;}}}}return start;}/*
+  	 * Mini-parser for expressions.
+  	 * The main pourpose of this module is to find the end of an expression
+  	 * and return its text without the enclosing brackets.
+  	 * Does not works with comments, but supports ES6 template strings.
+  	 */ /**
+  	 * @exports exprExtr
+  	 */const S_SQ_STR=/'[^'\n\r\\]*(?:\\(?:\r\n?|[\S\s])[^'\n\r\\]*)*'/.source;/**
+  	 * Matches double quoted JS strings taking care about nested quotes
+  	 * and EOLs (escaped EOLs are Ok).
+  	 *
+  	 * @const
+  	 * @private
+  	 */const S_STRING=`${S_SQ_STR}|${S_SQ_STR.replace(/'/g,'"')}`;/**
+  	 * Regex cache
+  	 *
+  	 * @type {Object.<string, RegExp>}
+  	 * @const
+  	 * @private
+  	 */const reBr={};/**
+  	 * Makes an optimal regex that matches quoted strings, brackets, backquotes
+  	 * and the closing brackets of an expression.
+  	 *
+  	 * @param   {string} b - Closing brackets
+  	 * @returns {RegExp} - optimized regex
+  	 */function _regex(b){let re=reBr[b];if(!re){let s=escapeStr(b);if(b.length>1){s=`${s}|[`;}else{s=/[{}[\]()]/.test(b)?'[':`[${s}`;}reBr[b]=re=new RegExp(`${S_STRING}|${s}\`/\\{}[\\]()]`,'g');}return re;}/**
+  	 * Update the scopes stack removing or adding closures to it
+  	 * @param   {Array} stack - array stacking the expression closures
+  	 * @param   {string} char - current char to add or remove from the stack
+  	 * @param   {string} idx  - matching index
+  	 * @param   {string} code - expression code
+  	 * @returns {Object} result
+  	 * @returns {Object} result.char - either the char received or the closing braces
+  	 * @returns {Object} result.index - either a new index to skip part of the source code,
+  	 *                                  or 0 to keep from parsing from the old position
+  	 */function updateStack(stack,char,idx,code){let index=0;switch(char){case'[':case'(':case'{':stack.push(char==='['?']':char==='('?')':'}');break;case')':case']':case'}':if(char!==stack.pop()){panic$1(code,unexpectedCharInExpression.replace('%1',char),index);}if(char==='}'&&stack[stack.length-1]===$_ES6_BQ){char=stack.pop();}index=idx+1;break;case'/':index=skipRegex(code,idx);}return {char,index};}/**
+  	   * Parses the code string searching the end of the expression.
+  	   * It skips braces, quoted strings, regexes, and ES6 template literals.
+  	   *
+  	   * @function exprExtr
+  	   * @param   {string}  code  - Buffer to parse
+  	   * @param   {number}  start - Position of the opening brace
+  	   * @param   {[string,string]} bp - Brackets pair
+  	   * @returns {Object} Expression's end (after the closing brace) or -1
+  	   *                            if it is not an expr.
+  	   */function exprExtr(code,start,bp){const[openingBraces,closingBraces]=bp;const offset=start+openingBraces.length;// skips the opening brace
+  const stack=[];// expected closing braces ('`' for ES6 TL)
+  const re=_regex(closingBraces);re.lastIndex=offset;// begining of the expression
+  let end;let match;while(match=re.exec(code)){// eslint-disable-line
+  const idx=match.index;const str=match[0];end=re.lastIndex;// end the iteration
+  if(str===closingBraces&&!stack.length){return {text:code.slice(offset,idx),start,end};}const{char,index}=updateStack(stack,str[0],idx,code);// update the end value depending on the new index received
+  end=index||end;// update the regex last index
+  re.lastIndex=char===$_ES6_BQ?skipES6TL(code,end,stack):end;}if(stack.length){panic$1(code,unclosedExpression,end);}}/**
+  	 * Outputs the last parsed node. Can be used with a builder too.
+  	 *
+  	 * @param   {ParserStore} store - Parsing store
+  	 * @returns {undefined} void function
+  	 * @private
+  	 */function flush(store){const last=store.last;store.last=null;if(last&&store.root){store.builder.push(last);}}/**
+  	 * Get the code chunks from start and end range
+  	 * @param   {string}  source  - source code
+  	 * @param   {number}  start   - Start position of the chunk we want to extract
+  	 * @param   {number}  end     - Ending position of the chunk we need
+  	 * @returns {string}  chunk of code extracted from the source code received
+  	 * @private
+  	 */function getChunk(source,start,end){return source.slice(start,end);}/**
+  	 * states text in the last text node, or creates a new one if needed.
+  	 *
+  	 * @param {ParserState}   state   - Current parser state
+  	 * @param {number}  start   - Start position of the tag
+  	 * @param {number}  end     - Ending position (last char of the tag)
+  	 * @param {Object}  extra   - extra properties to add to the text node
+  	 * @param {RawExpr[]} extra.expressions  - Found expressions
+  	 * @param {string}    extra.unescape     - Brackets to unescape
+  	 * @returns {undefined} - void function
+  	 * @private
+  	 */function pushText(state,start,end,extra){if(extra===void 0){extra={};}const text=getChunk(state.data,start,end);const expressions=extra.expressions;const unescape=extra.unescape;let q=state.last;state.pos=end;if(q&&q.type===TEXT){q.text+=text;q.end=end;}else{flush(state);state.last=q={type:TEXT,text,start,end};}if(expressions&&expressions.length){q.expressions=(q.expressions||[]).concat(expressions);}if(unescape){q.unescape=unescape;}return TEXT;}/**
+  	 * Find the end of the attribute value or text node
+  	 * Extract expressions.
+  	 * Detect if value have escaped brackets.
+  	 *
+  	 * @param   {ParserState} state  - Parser state
+  	 * @param   {HasExpr} node       - Node if attr, info if text
+  	 * @param   {string} endingChars - Ends the value or text
+  	 * @param   {number} start       - Starting position
+  	 * @returns {number} Ending position
+  	 * @private
+  	 */function expr(state,node,endingChars,start){const re=b0re(state,endingChars);re.lastIndex=start;// reset re position
+  const{unescape,expressions,end}=parseExpressions(state,re);if(node){if(unescape){node.unescape=unescape;}if(expressions.length){node.expressions=expressions;}}else{pushText(state,start,end,{expressions,unescape});}return end;}/**
+  	 * Parse a text chunk finding all the expressions in it
+  	 * @param   {ParserState} state  - Parser state
+  	 * @param   {RegExp} re - regex to match the expressions contents
+  	 * @returns {Object} result containing the expression found, the string to unescape and the end position
+  	 */function parseExpressions(state,re){const{data,options}=state;const{brackets}=options;const expressions=[];let unescape,pos,match;// Anything captured in $1 (closing quote or character) ends the loop...
+  while((match=re.exec(data))&&!match[1]){// ...else, we have an opening bracket and maybe an expression.
+  pos=match.index;if(data[pos-1]==='\\'){unescape=match[0];// it is an escaped opening brace
+  }else{const tmpExpr=exprExtr(data,pos,brackets);if(tmpExpr){expressions.push(tmpExpr);re.lastIndex=tmpExpr.end;}}}// Even for text, the parser needs match a closing char
+  if(!match){panic$1(data,unexpectedEndOfFile,pos);}return {unescape,expressions,end:match.index};}/**
+  	 * Creates a regex for the given string and the left bracket.
+  	 * The string is captured in $1.
+  	 *
+  	 * @param   {ParserState} state  - Parser state
+  	 * @param   {string} str - String to search
+  	 * @returns {RegExp} Resulting regex.
+  	 * @private
+  	 */function b0re(state,str){const{brackets}=state.options;const re=state.regexCache[str];if(re)return re;const b0=escapeStr(brackets[0]);// cache the regex extending the regexCache object
+  Object.assign(state.regexCache,{[str]:new RegExp(`(${str})|${b0}`,'g')});return state.regexCache[str];}// similar to _.uniq
+  const uniq=l=>l.filter((x,i,a)=>a.indexOf(x)===i);/**
+  	 * SVG void elements that cannot be auto-closed and shouldn't contain child nodes.
+  	 * @const {Array}
+  	 */const VOID_SVG_TAGS_LIST=['circle','ellipse','line','path','polygon','polyline','rect','stop','use'];/**
+  	 * List of html elements where the value attribute is allowed
+  	 * @type {Array}
+  	 */const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST=['button','data','input','select','li','meter','option','output','progress','textarea','param'];/**
+  	 * List of all the available svg tags
+  	 * @const {Array}
+  	 * @see {@link https://github.com/wooorm/svg-tag-names}
+  	 */const SVG_TAGS_LIST=uniq(['a','altGlyph','altGlyphDef','altGlyphItem','animate','animateColor','animateMotion','animateTransform','animation','audio','canvas','clipPath','color-profile','cursor','defs','desc','discard','feBlend','feColorMatrix','feComponentTransfer','feComposite','feConvolveMatrix','feDiffuseLighting','feDisplacementMap','feDistantLight','feDropShadow','feFlood','feFuncA','feFuncB','feFuncG','feFuncR','feGaussianBlur','feImage','feMerge','feMergeNode','feMorphology','feOffset','fePointLight','feSpecularLighting','feSpotLight','feTile','feTurbulence','filter','font','font-face','font-face-format','font-face-name','font-face-src','font-face-uri','foreignObject','g','glyph','glyphRef','handler','hatch','hatchpath','hkern','iframe','image','linearGradient','listener','marker','mask','mesh','meshgradient','meshpatch','meshrow','metadata','missing-glyph','mpath','pattern','prefetch','radialGradient','script','set','solidColor','solidcolor','style','svg','switch','symbol','tbreak','text','textArea','textPath','title','tref','tspan','unknown','video','view','vkern'].concat(VOID_SVG_TAGS_LIST)).sort();/**
+  	 * HTML void elements that cannot be auto-closed and shouldn't contain child nodes.
+  	 * @type {Array}
+  	 * @see   {@link http://www.w3.org/TR/html-markup/syntax.html#syntax-elements}
+  	 * @see   {@link http://www.w3.org/TR/html5/syntax.html#void-elements}
+  	 */const VOID_HTML_TAGS_LIST=['area','base','br','col','embed','hr','img','input','keygen','link','menuitem','meta','param','source','track','wbr'];/**
+  	 * List of all the html tags
+  	 * @const {Array}
+  	 * @see {@link https://github.com/sindresorhus/html-tags}
+  	 */const HTML_TAGS_LIST=uniq(['a','abbr','address','article','aside','audio','b','bdi','bdo','blockquote','body','canvas','caption','cite','code','colgroup','datalist','dd','del','details','dfn','dialog','div','dl','dt','em','fieldset','figcaption','figure','footer','form','h1','h2','h3','h4','h5','h6','head','header','hgroup','html','i','iframe','ins','kbd','label','legend','main','map','mark','math','menu','nav','noscript','object','ol','optgroup','p','picture','pre','q','rb','rp','rt','rtc','ruby','s','samp','script','section','select','slot','small','span','strong','style','sub','summary','sup','svg','table','tbody','td','template','tfoot','th','thead','time','title','tr','u','ul','var','video'].concat(VOID_HTML_TAGS_LIST).concat(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST)).sort();/**
+  	 * List of all boolean HTML attributes
+  	 * @const {RegExp}
+  	 * @see {@link https://www.w3.org/TR/html5/infrastructure.html#sec-boolean-attributes}
+  	 */const BOOLEAN_ATTRIBUTES_LIST=['disabled','visible','checked','readonly','required','allowfullscreen','autofocus','autoplay','compact','controls','default','formnovalidate','hidden','ismap','itemscope','loop','multiple','muted','noresize','noshade','novalidate','nowrap','open','reversed','seamless','selected','sortable','truespeed','typemustmatch'];/**
+  	 * Join a list of items with the pipe symbol (usefull for regex list concatenation)
+  	 * @private
+  	 * @param   {Array} list - list of strings
+  	 * @returns {string} the list received joined with pipes
+  	 */function joinWithPipe(list){return list.join('|');}/**
+  	 * Convert list of strings to regex in order to test against it ignoring the cases
+  	 * @private
+  	 * @param   {...Array} lists - array of strings
+  	 * @returns {RegExp} regex that will match all the strings in the array received ignoring the cases
+  	 */function listsToRegex(){for(var _len4=arguments.length,lists=new Array(_len4),_key4=0;_key4<_len4;_key4++){lists[_key4]=arguments[_key4];}return new RegExp(`^/?(?:${joinWithPipe(lists.map(joinWithPipe))})$`,'i');}/**
+  	 * Regex matching all the html tags ignoring the cases
+  	 * @const {RegExp}
+  	 */const HTML_TAGS_RE=listsToRegex(HTML_TAGS_LIST);/**
+  	 * Regex matching all the svg tags ignoring the cases
+  	 * @const {RegExp}
+  	 */const SVG_TAGS_RE=listsToRegex(SVG_TAGS_LIST);/**
+  	 * Regex matching all the void html tags ignoring the cases
+  	 * @const {RegExp}
+  	 */const VOID_HTML_TAGS_RE=listsToRegex(VOID_HTML_TAGS_LIST);/**
+  	 * Regex matching all the void svg tags ignoring the cases
+  	 * @const {RegExp}
+  	 */const VOID_SVG_TAGS_RE=listsToRegex(VOID_SVG_TAGS_LIST);/**
+  	 * Regex matching all the html tags where the value tag is allowed
+  	 * @const {RegExp}
+  	 */const HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE=listsToRegex(HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_LIST);/**
+  	 * Regex matching all the boolean attributes
+  	 * @const {RegExp}
+  	 */const BOOLEAN_ATTRIBUTES_RE=listsToRegex(BOOLEAN_ATTRIBUTES_LIST);/**
+  	 * True if it's a self closing tag
+  	 * @param   {string}  tag - test tag
+  	 * @returns {boolean} true if void
+  	 * @example
+  	 * isVoid('meta') // true
+  	 * isVoid('circle') // true
+  	 * isVoid('IMG') // true
+  	 * isVoid('div') // false
+  	 * isVoid('mask') // false
+  	 */function isVoid(tag){return [VOID_HTML_TAGS_RE,VOID_SVG_TAGS_RE].some(r=>r.test(tag));}/**
+  	 * True if it's not SVG nor a HTML known tag
+  	 * @param   {string}  tag - test tag
+  	 * @returns {boolean} true if custom element
+  	 * @example
+  	 * isCustom('my-component') // true
+  	 * isCustom('div') // false
+  	 */function isCustom(tag){return [HTML_TAGS_RE,SVG_TAGS_RE].every(l=>!l.test(tag));}/**
+  	 * True if the value attribute is allowed on this tag
+  	 * @param   {string}  tag - test tag
+  	 * @returns {boolean} true if the value attribute is allowed
+  	 * @example
+  	 * hasValueAttribute('input') // true
+  	 * hasValueAttribute('div') // false
+  	 */function hasValueAttribute(tag){return HTML_ELEMENTS_HAVING_VALUE_ATTRIBUTE_RE.test(tag);}/**
+  	 * True if it's a boolean attribute
+  	 * @param   {string} attribute - test attribute
+  	 * @returns {boolean} true if the attribute is a boolean type
+  	 * @example
+  	 * isBoolAttribute('selected') // true
+  	 * isBoolAttribute('class') // false
+  	 */function isBoolAttribute(attribute){return BOOLEAN_ATTRIBUTES_RE.test(attribute);}/**
+  	 * Memoization function
+  	 * @param   {Function} fn - function to memoize
+  	 * @returns {*} return of the function to memoize
+  	 */function memoize(fn){const cache=new WeakMap();return function(){if(cache.has(arguments.length<=0?undefined:arguments[0]))return cache.get(arguments.length<=0?undefined:arguments[0]);const ret=fn(...arguments);cache.set(arguments.length<=0?undefined:arguments[0],ret);return ret;};}const expressionsContentRe=memoize(brackets=>RegExp(`(${brackets[0]}[^${brackets[1]}]*?${brackets[1]})`,'g'));const isSpreadAttribute=name=>SPREAD_OPERATOR.test(name);const isAttributeExpression=(name,brackets)=>name[0]===brackets[0];const getAttributeEnd=(state,attr)=>expr(state,attr,'[>/\\s]',attr.start);/**
+  	 * The more complex parsing is for attributes as it can contain quoted or
+  	 * unquoted values or expressions.
+  	 *
+  	 * @param   {ParserStore} state  - Parser state
+  	 * @returns {number} New parser mode.
+  	 * @private
+  	 */function attr(state){const{data,last,pos,root}=state;const tag=last;// the last (current) tag in the output
+  const _CH=/\S/g;// matches the first non-space char
+  const ch=execFromPos(_CH,pos,data);switch(true){case!ch:state.pos=data.length;// reaching the end of the buffer with
+  // NodeTypes.ATTR will generate error
+  break;case ch[0]==='>':// closing char found. If this is a self-closing tag with the name of the
+  // Root tag, we need decrement the counter as we are changing mode.
+  state.pos=tag.end=_CH.lastIndex;if(tag[IS_SELF_CLOSING]){state.scryle=null;// allow selfClosing script/style tags
+  if(root&&root.name===tag.name){state.count--;// "pop" root tag
+  }}return TEXT;case ch[0]==='/':state.pos=_CH.lastIndex;// maybe. delegate the validation
+  tag[IS_SELF_CLOSING]=true;// the next loop
+  break;default:delete tag[IS_SELF_CLOSING];// ensure unmark as selfclosing tag
+  setAttribute(state,ch.index,tag);}return ATTR;}/**
+  	 * Parses an attribute and its expressions.
+  	 *
+  	 * @param   {ParserStore}  state  - Parser state
+  	 * @param   {number} pos    - Starting position of the attribute
+  	 * @param   {Object} tag    - Current parent tag
+  	 * @returns {undefined} void function
+  	 * @private
+  	 */function setAttribute(state,pos,tag){const{data}=state;const expressionContent=expressionsContentRe(state.options.brackets);const re=ATTR_START;// (\S[^>/=\s]*)(?:\s*=\s*([^>/])?)? g
+  const start=re.lastIndex=expressionContent.lastIndex=pos;// first non-whitespace
+  const attrMatches=re.exec(data);const isExpressionName=isAttributeExpression(attrMatches[1],state.options.brackets);const match=isExpressionName?[null,expressionContent.exec(data)[1],null]:attrMatches;if(match){const end=re.lastIndex;const attr=parseAttribute(state,match,start,end,isExpressionName);//assert(q && q.type === Mode.TAG, 'no previous tag for the attr!')
+  // Pushes the attribute and shifts the `end` position of the tag (`last`).
+  state.pos=tag.end=attr.end;tag.attributes=addToCollection(tag.attributes,attr);}}function parseNomalAttribute(state,attr,quote){const{data}=state;let{end}=attr;if(isBoolAttribute(attr.name)){attr[IS_BOOLEAN]=true;}// parse the whole value (if any) and get any expressions on it
+  if(quote){// Usually, the value's first char (`quote`) is a quote and the lastIndex
+  // (`end`) is the start of the value.
+  let valueStart=end;// If it not, this is an unquoted value and we need adjust the start.
+  if(quote!=='"'&&quote!=='\''){quote='';// first char of value is not a quote
+  valueStart--;// adjust the starting position
+  }end=expr(state,attr,quote||'[>/\\s]',valueStart);// adjust the bounds of the value and save its content
+  return Object.assign(attr,{value:getChunk(data,valueStart,end),valueStart,end:quote?++end:end});}return attr;}/**
+  	 * Parse expression names <a {href}>
+  	 * @param   {ParserStore}  state  - Parser state
+  	 * @param   {Object} attr - attribute object parsed
+  	 * @returns {Object} normalized attribute object
+  	 */function parseSpreadAttribute(state,attr){const end=getAttributeEnd(state,attr);return {[IS_SPREAD]:true,start:attr.start,expressions:attr.expressions.map(expr=>Object.assign(expr,{text:expr.text.replace(SPREAD_OPERATOR,'').trim()})),end:end};}/**
+  	 * Parse expression names <a {href}>
+  	 * @param   {ParserStore}  state  - Parser state
+  	 * @param   {Object} attr - attribute object parsed
+  	 * @returns {Object} normalized attribute object
+  	 */function parseExpressionNameAttribute(state,attr){const end=getAttributeEnd(state,attr);return {start:attr.start,name:attr.expressions[0].text.trim(),expressions:attr.expressions,end:end};}/**
+  	 * Parse the attribute values normalising the quotes
+  	 * @param   {ParserStore}  state  - Parser state
+  	 * @param   {Array} match - results of the attributes regex
+  	 * @param   {number} start - attribute start position
+  	 * @param   {number} end - attribute end position
+  	 * @param   {boolean} isExpressionName - true if the attribute name is an expression
+  	 * @returns {Object} attribute object
+  	 */function parseAttribute(state,match,start,end,isExpressionName){const attr={name:match[1],value:'',start,end};const quote=match[2];// first letter of value or nothing
+  switch(true){case isSpreadAttribute(attr.name):return parseSpreadAttribute(state,attr);case isExpressionName===true:return parseExpressionNameAttribute(state,attr);default:return parseNomalAttribute(state,attr,quote);}}/**
+  	 * Parses comments in long or short form
+  	 * (any DOCTYPE & CDATA blocks are parsed as comments).
+  	 *
+  	 * @param   {ParserState} state  - Parser state
+  	 * @param   {string} data       - Buffer to parse
+  	 * @param   {number} start      - Position of the '<!' sequence
+  	 * @returns {number} node type id
+  	 * @private
+  	 */function comment(state,data,start){const pos=start+2;// skip '<!'
+  const str=data.substr(pos,2)==='--'?'-->':'>';const end=data.indexOf(str,pos);if(end<0){panic$1(data,unclosedComment,start);}pushComment$1(state,start,end+str.length);return TEXT;}/**
+  	 * Parse a comment.
+  	 *
+  	 * @param   {ParserState}  state - Current parser state
+  	 * @param   {number}  start - Start position of the tag
+  	 * @param   {number}  end   - Ending position (last char of the tag)
+  	 * @returns {undefined} void function
+  	 * @private
+  	 */function pushComment$1(state,start,end){flush(state);state.pos=end;if(state.options.comments===true){state.last={type:COMMENT,start,end};}}/**
+  	 * Pushes a new *tag* and set `last` to this, so any attributes
+  	 * will be included on this and shifts the `end`.
+  	 *
+  	 * @param   {ParserState} state  - Current parser state
+  	 * @param   {string}  name      - Name of the node including any slash
+  	 * @param   {number}  start     - Start position of the tag
+  	 * @param   {number}  end       - Ending position (last char of the tag + 1)
+  	 * @returns {undefined} - void function
+  	 * @private
+  	 */function pushTag(state,name,start,end){const root=state.root;const last={type:TAG,name,start,end};if(isCustom(name)){last[IS_CUSTOM]=true;}if(isVoid(name)){last[IS_VOID]=true;}state.pos=end;if(root){if(name===root.name){state.count++;}else if(name===root.close){state.count--;}flush(state);}else{// start with root (keep ref to output)
+  state.root={name:last.name,close:`/${name}`};state.count=1;}state.last=last;}/**
+  	 * Parse the tag following a '<' character, or delegate to other parser
+  	 * if an invalid tag name is found.
+  	 *
+  	 * @param   {ParserState} state  - Parser state
+  	 * @returns {number} New parser mode
+  	 * @private
+  	 */function tag(state){const{pos,data}=state;// pos of the char following '<'
+  const start=pos-1;// pos of '<'
+  const str=data.substr(pos,2);// first two chars following '<'
+  switch(true){case str[0]==='!':return comment(state,data,start);case TAG_2C.test(str):return parseTag(state,start);default:return pushText(state,start,pos);// pushes the '<' as text
+  }}function parseTag(state,start){const{data,pos}=state;const re=TAG_NAME;// (\/?[^\s>/]+)\s*(>)? g
+  const match=execFromPos(re,pos,data);const end=re.lastIndex;const name=match[1].toLowerCase();// $1: tag name including any '/'
+  // script/style block is parsed as another tag to extract attributes
+  if(name in RE_SCRYLE){state.scryle=name;// used by parseText
+  }pushTag(state,name,start,end);// only '>' can ends the tag here, the '/' is handled in parseAttribute
+  if(!match[2]){return ATTR;}return TEXT;}/**
+  	 * Parses regular text and script/style blocks ...scryle for short :-)
+  	 * (the content of script and style is text as well)
+  	 *
+  	 * @param   {ParserState} state - Parser state
+  	 * @returns {number} New parser mode.
+  	 * @private
+  	 */function text(state){const{pos,data,scryle}=state;switch(true){case typeof scryle==='string':{const name=scryle;const re=RE_SCRYLE[name];const match=execFromPos(re,pos,data);if(!match){panic$1(data,unclosedNamedBlock.replace('%1',name),pos-1);}const start=match.index;const end=re.lastIndex;state.scryle=null;// reset the script/style flag now
+  // write the tag content, if any
+  if(start>pos){parseSpecialTagsContent(state,name,match);}// now the closing tag, either </script> or </style>
+  pushTag(state,`/${name}`,start,end);break;}case data[pos]==='<':state.pos++;return TAG;default:expr(state,null,'<',pos);}return TEXT;}/**
+  	 * Parse the text content depending on the name
+  	 * @param   {ParserState} state - Parser state
+  	 * @param   {string} name  - one of the tags matched by the RE_SCRYLE regex
+  	 * @param   {Array}  match - result of the regex matching the content of the parsed tag
+  	 * @returns {undefined} void function
+  	 */function parseSpecialTagsContent(state,name,match){const{pos}=state;const start=match.index;if(name===TEXTAREA_TAG){expr(state,null,match[0],pos);}else{pushText(state,pos,start);}}/*---------------------------------------------------------------------
+  	 * Tree builder for the riot tag parser.
+  	 *
+  	 * The output has a root property and separate arrays for `html`, `css`,
+  	 * and `js` tags.
+  	 *
+  	 * The root tag is included as first element in the `html` array.
+  	 * Script tags marked with "defer" are included in `html` instead `js`.
+  	 *
+  	 * - Mark SVG tags
+  	 * - Mark raw tags
+  	 * - Mark void tags
+  	 * - Split prefixes from expressions
+  	 * - Unescape escaped brackets and escape EOLs and backslashes
+  	 * - Compact whitespace (option `compact`) for non-raw tags
+  	 * - Create an array `parts` for text nodes and attributes
+  	 *
+  	 * Throws on unclosed tags or closing tags without start tag.
+  	 * Selfclosing and void tags has no nodes[] property.
+  	 */ /**
+  	 * Escape the carriage return and the line feed from a string
+  	 * @param   {string} string - input string
+  	 * @returns {string} output string escaped
+  	 */function escapeReturn(string){return string.replace(/\r/g,'\\r').replace(/\n/g,'\\n');}/**
+  	 * Escape double slashes in a string
+  	 * @param   {string} string - input string
+  	 * @returns {string} output string escaped
+  	 */function escapeSlashes(string){return string.replace(/\\/g,'\\\\');}/**
+  	 * Replace the multiple spaces with only one
+  	 * @param   {string} string - input string
+  	 * @returns {string} string without trailing spaces
+  	 */function cleanSpaces(string){return string.replace(/\s+/g,' ');}const TREE_BUILDER_STRUCT=Object.seal({get(){const store=this.store;// The real root tag is in store.root.nodes[0]
+  return {[TEMPLATE_OUTPUT_NAME]:store.root.nodes[0],[CSS_OUTPUT_NAME]:store[STYLE_TAG],[JAVASCRIPT_OUTPUT_NAME]:store[JAVASCRIPT_TAG]};},/**
+  	  * Process the current tag or text.
+  	  * @param {Object} node - Raw pseudo-node from the parser
+  	  * @returns {undefined} void function
+  	  */push(node){const store=this.store;switch(node.type){case TEXT:this.pushText(store,node);break;case TAG:{const name=node.name;const closingTagChar='/';const[firstChar]=name;if(firstChar===closingTagChar&&!node.isVoid){this.closeTag(store,node,name);}else if(firstChar!==closingTagChar){this.openTag(store,node);}break;}}},closeTag(store,node){const last=store.scryle||store.last;last.end=node.end;if(store.scryle){store.scryle=null;}else{store.last=store.stack.pop();}},openTag(store,node){const name=node.name;const attrs=node.attributes;if([JAVASCRIPT_TAG,STYLE_TAG].includes(name)){// Only accept one of each
+  if(store[name]){panic$1(this.store.data,duplicatedNamedTag.replace('%1',name),node.start);}store[name]=node;store.scryle=store[name];}else{// store.last holds the last tag pushed in the stack and this are
+  // non-void, non-empty tags, so we are sure the `lastTag` here
+  // have a `nodes` property.
+  const lastTag=store.last;const newNode=node;lastTag.nodes.push(newNode);if(lastTag[IS_RAW]||RAW_TAGS.test(name)){node[IS_RAW]=true;}if(!node[IS_SELF_CLOSING]&&!node[IS_VOID]){store.stack.push(lastTag);newNode.nodes=[];store.last=newNode;}}if(attrs){this.attrs(attrs);}},attrs(attributes){attributes.forEach(attr=>{if(attr.value){this.split(attr,attr.value,attr.valueStart,true);}});},pushText(store,node){const text=node.text;const empty=!/\S/.test(text);const scryle=store.scryle;if(!scryle){// store.last always have a nodes property
+  const parent=store.last;const pack=this.compact&&!parent[IS_RAW];if(pack&&empty){return;}this.split(node,text,node.start,pack);parent.nodes.push(node);}else if(!empty){scryle.text=node;}},split(node,source,start,pack){const expressions=node.expressions;const parts=[];if(expressions){let pos=0;expressions.forEach(expr=>{const text=source.slice(pos,expr.start-start);const code=expr.text;parts.push(this.sanitise(node,text,pack),escapeReturn(escapeSlashes(code).trim()));pos=expr.end-start;});if(pos<node.end){parts.push(this.sanitise(node,source.slice(pos),pack));}}else{parts[0]=this.sanitise(node,source,pack);}node.parts=parts.filter(p=>p);// remove the empty strings
+  },// unescape escaped brackets and split prefixes of expressions
+  sanitise(node,text,pack){let rep=node.unescape;if(rep){let idx=0;rep=`\\${rep}`;while((idx=text.indexOf(rep,idx))!==-1){text=text.substr(0,idx)+text.substr(idx+1);idx++;}}text=escapeSlashes(text);return pack?cleanSpaces(text):escapeReturn(text);}});function createTreeBuilder(data,options){const root={type:TAG,name:'',start:0,end:0,nodes:[]};return Object.assign(Object.create(TREE_BUILDER_STRUCT),{compact:options.compact!==false,store:{last:root,stack:[],scryle:null,root,style:null,script:null,data}});}/**
+  	 * Factory for the Parser class, exposing only the `parse` method.
+  	 * The export adds the Parser class as property.
+  	 *
+  	 * @param   {Object}   options - User Options
+  	 * @param   {Function} customBuilder - Tree builder factory
+  	 * @returns {Function} Public Parser implementation.
+  	 */function parser$1(options,customBuilder){const state=curry(createParserState)(options,customBuilder||createTreeBuilder);return {parse:data=>_parse(state(data))};}/**
+  	 * Create a new state object
+  	 * @param   {Object} userOptions - parser options
+  	 * @param   {Function} builder - Tree builder factory
+  	 * @param   {string} data - data to parse
+  	 * @returns {ParserState} it represents the current parser state
+  	 */function createParserState(userOptions,builder,data){const options=Object.assign({brackets:['{','}']},userOptions);return {options,regexCache:{},pos:0,count:-1,root:null,last:null,scryle:null,builder:builder(data,options),data};}/**
+  	 * It creates a raw output of pseudo-nodes with one of three different types,
+  	 * all of them having a start/end position:
+  	 *
+  	 * - TAG     -- Opening or closing tags
+  	 * - TEXT    -- Raw text
+  	 * - COMMENT -- Comments
+  	 *
+  	 * @param   {ParserState}  state - Current parser state
+  	 * @returns {ParserResult} Result, contains data and output properties.
+  	 */function _parse(state){const{data}=state;walk(state);flush(state);if(state.count){panic$1(data,state.count>0?unexpectedEndOfFile:rootTagNotFound,state.pos);}return {data,output:state.builder.get()};}/**
+  	 * Parser walking recursive function
+  	 * @param {ParserState}  state - Current parser state
+  	 * @param {string} type - current parsing context
+  	 * @returns {undefined} void function
+  	 */function walk(state,type){const{data}=state;// extend the state adding the tree builder instance and the initial data
+  const length=data.length;// The "count" property is set to 1 when the first tag is found.
+  // This becomes the root and precedent text or comments are discarded.
+  // So, at the end of the parsing count must be zero.
+  if(state.pos<length&&state.count){walk(state,eat(state,type));}}/**
+  	 * Function to help iterating on the current parser state
+  	 * @param {ParserState}  state - Current parser state
+  	 * @param   {string} type - current parsing context
+  	 * @returns {string} parsing context
+  	 */function eat(state,type){switch(type){case TAG:return tag(state);case ATTR:return attr(state);default:return text(state);}}/**
+  	 * The nodeTypes definition
+  	 */const nodeTypes=types$3;// import {IS_BOOLEAN,IS_CUSTOM,IS_RAW,IS_SPREAD,IS_VOID} from '@riotjs/parser/src/constants'
+  const BINDING_TYPES='bindingTypes';const EACH_BINDING_TYPE='EACH';const IF_BINDING_TYPE='IF';const TAG_BINDING_TYPE='TAG';const SLOT_BINDING_TYPE='SLOT';const EXPRESSION_TYPES='expressionTypes';const ATTRIBUTE_EXPRESSION_TYPE='ATTRIBUTE';const VALUE_EXPRESSION_TYPE='VALUE';const TEXT_EXPRESSION_TYPE='TEXT';const EVENT_EXPRESSION_TYPE='EVENT';const TEMPLATE_FN='template';const SCOPE='scope';const GET_COMPONENT_FN='getComponent';// keys needed to create the DOM bindings
+  const BINDING_SELECTOR_KEY='selector';const BINDING_GET_COMPONENT_KEY='getComponent';const BINDING_TEMPLATE_KEY='template';const BINDING_TYPE_KEY='type';const BINDING_REDUNDANT_ATTRIBUTE_KEY='redundantAttribute';const BINDING_CONDITION_KEY='condition';const BINDING_ITEM_NAME_KEY='itemName';const BINDING_GET_KEY_KEY='getKey';const BINDING_INDEX_NAME_KEY='indexName';const BINDING_EVALUATE_KEY='evaluate';const BINDING_NAME_KEY='name';const BINDING_SLOTS_KEY='slots';const BINDING_EXPRESSIONS_KEY='expressions';const BINDING_CHILD_NODE_INDEX_KEY='childNodeIndex';// slots keys
+  const BINDING_BINDINGS_KEY='bindings';const BINDING_ID_KEY='id';const BINDING_HTML_KEY='html';const BINDING_ATTRIBUTES_KEY='attributes';// DOM directives
+  const IF_DIRECTIVE='if';const EACH_DIRECTIVE='each';const KEY_ATTRIBUTE='key';const SLOT_ATTRIBUTE='slot';const NAME_ATTRIBUTE='name';const IS_DIRECTIVE='is';// Misc
+  const DEFAULT_SLOT_NAME='default';const TEXT_NODE_EXPRESSION_PLACEHOLDER='<!---->';const BINDING_SELECTOR_PREFIX='expr';const SLOT_TAG_NODE_NAME='slot';const PROGRESS_TAG_NODE_NAME='progress';const IS_VOID_NODE='isVoid';const IS_CUSTOM_NODE='isCustom';const IS_BOOLEAN_ATTRIBUTE='isBoolean';const IS_SPREAD_ATTRIBUTE='isSpread';/**
+  	 * True if the node has not expression set nor bindings directives
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only if it's a static node that doesn't need bindings or expressions
+  	 */function isStaticNode(node){return [hasExpressions,findEachAttribute,findIfAttribute,isCustomNode,isSlotNode].every(test=>!test(node));}/**
+  	 * Check if a node name is part of the browser or builtin javascript api or it belongs to the current scope
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @returns {boolean} true if it's a global api variable
+  	 */function isGlobal(_ref3){let{scope,node}=_ref3;return Boolean(isRaw(node)||isBuiltinAPI(node)||isBrowserAPI(node)||isNewExpression(node)||isNodeInScope(scope,node));}/**
+  	 * Checks if the identifier of a given node exists in a scope
+  	 * @param {Scope} scope - scope where to search for the identifier
+  	 * @param {types.Node} node - node to search for the identifier
+  	 * @returns {boolean} true if the node identifier is defined in the given scope
+  	 */function isNodeInScope(scope,node){const traverse=function traverse(isInScope){if(isInScope===void 0){isInScope=false;}types$1.visit(node,{visitIdentifier(path){if(scope.lookup(getName$1(path.node))){isInScope=true;}this.abort();}});return isInScope;};return traverse();}/**
+  	 * True if the node has the isCustom attribute set
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true if either it's a riot component or a custom element
+  	 */function isCustomNode(node){return !!(node[IS_CUSTOM_NODE]||hasIsAttribute(node));}/**
+  	 * True the node is <slot>
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true if it's a slot node
+  	 */function isSlotNode(node){return node.name===SLOT_TAG_NODE_NAME;}/**
+  	 * True if the node has the isVoid attribute set
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true if the node is self closing
+  	 */function isVoidNode(node){return !!node[IS_VOID_NODE];}/**
+  	 * True if the riot parser did find a tag node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for the tag nodes
+  	 */function isTagNode(node){return node.type===nodeTypes.TAG;}/**
+  	 * True if the riot parser did find a text node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for the text nodes
+  	 */function isTextNode(node){return node.type===nodeTypes.TEXT;}/**
+  	 * True if the node parsed is the root one
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for the root nodes
+  	 */function isRootNode(node){return node.isRoot;}/**
+  	 * True if the attribute parsed is of type spread one
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true if the attribute node is of type spread
+  	 */function isSpreadAttribute$1(node){return node[IS_SPREAD_ATTRIBUTE];}/**
+  	 * True if the node is an attribute and its name is "value"
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for value attribute nodes
+  	 */function isValueAttribute(node){return node.name==='value';}/**
+  	 * True if the DOM node is a progress tag
+  	 * @param   {RiotParser.Node}  node - riot parser node
+  	 * @returns {boolean} true for the progress tags
+  	 */function isProgressNode(node){return node.name===PROGRESS_TAG_NODE_NAME;}/**
+  	 * True if the node is an attribute and a DOM handler
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for dom listener attribute nodes
+  	 */const isEventAttribute=(()=>{const EVENT_ATTR_RE=/^on/;return node=>EVENT_ATTR_RE.test(node.name);})();/**
+  	 * True if the node has expressions or expression attributes
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} ditto
+  	 */function hasExpressions(node){return !!(node.expressions||// has expression attributes
+  getNodeAttributes(node).some(attribute=>hasExpressions(attribute))||// has child text nodes with expressions
+  node.nodes&&node.nodes.some(node=>isTextNode(node)&&hasExpressions(node)));}/**
+  	 * True if the node is a directive having its own template
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {boolean} true only for the IF EACH and TAG bindings
+  	 */function hasItsOwnTemplate(node){return [findEachAttribute,findIfAttribute,isCustomNode].some(test=>test(node));}const hasIfAttribute=compose(Boolean,findIfAttribute);const hasEachAttribute=compose(Boolean,findEachAttribute);const hasIsAttribute=compose(Boolean,findIsAttribute);const hasKeyAttribute=compose(Boolean,findKeyAttribute);/**
+  	 * Find the attribute node
+  	 * @param   { string } name -  name of the attribute we want to find
+  	 * @param   { riotParser.nodeTypes.TAG } node - a tag node
+  	 * @returns { riotParser.nodeTypes.ATTR } attribute node
+  	 */function findAttribute(name,node){return node.attributes&&node.attributes.find(attr=>getName$1(attr)===name);}function findIfAttribute(node){return findAttribute(IF_DIRECTIVE,node);}function findEachAttribute(node){return findAttribute(EACH_DIRECTIVE,node);}function findKeyAttribute(node){return findAttribute(KEY_ATTRIBUTE,node);}function findIsAttribute(node){return findAttribute(IS_DIRECTIVE,node);}/**
+  	 * Find all the node attributes that are not expressions
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {Array} list of all the static attributes
+  	 */function findStaticAttributes(node){return getNodeAttributes(node).filter(attribute=>!hasExpressions(attribute));}/**
+  	 * Find all the node attributes that have expressions
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {Array} list of all the dynamic attributes
+  	 */function findDynamicAttributes(node){return getNodeAttributes(node).filter(hasExpressions);}/**
+  	 * Unescape the user escaped chars
+  	 * @param   {string} string - input string
+  	 * @param   {string} char - probably a '{' or anything the user want's to escape
+  	 * @returns {string} cleaned up string
+  	 */function unescapeChar(string,char){return string.replace(RegExp(`\\\\${char}`,'gm'),char);}const scope$1=builders.identifier(SCOPE);const getName$1=node=>node&&node.name?node.name:node;/**
+  	 * Replace the path scope with a member Expression
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @param   { types.Node } property - node we want to prefix with the scope identifier
+  	 * @returns {undefined} this is a void function
+  	 */function replacePathScope(path,property){path.replace(builders.memberExpression(scope$1,property,false));}/**
+  	 * Change the nodes scope adding the `scope` prefix
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @returns { boolean } return false if we want to stop the tree traversal
+  	 * @context { types.visit }
+  	 */function updateNodeScope(path){if(!isGlobal(path)){replacePathScope(path,path.node);return false;}this.traverse(path);}/**
+  	 * Change the scope of the member expressions
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @returns { boolean } return always false because we want to check only the first node object
+  	 */function visitMemberExpression(path){if(!isGlobal(path)&&!isGlobal({node:path.node.object,scope:path.scope})){if(path.value.computed){this.traverse(path);}else if(isBinaryExpression(path.node.object)||path.node.object.computed){this.traverse(path.get('object'));}else if(!path.node.object.callee){replacePathScope(path,isThisExpression(path.node.object)?path.node.property:path.node);}else{this.traverse(path.get('object'));}}return false;}/**
+  	 * Objects properties should be handled a bit differently from the Identifier
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @returns { boolean } return false if we want to stop the tree traversal
+  	 */function visitProperty(path){const value=path.node.value;if(isIdentifier(value)){updateNodeScope(path.get('value'));}else{this.traverse(path.get('value'));}return false;}/**
+  	 * The this expressions should be replaced with the scope
+  	 * @param   { types.NodePath } path - containing the current node visited
+  	 * @returns { boolean|undefined } return false if we want to stop the tree traversal
+  	 */function visitThisExpression(path){path.replace(scope$1);this.traverse(path);}/**
+  	 * Update the scope of the global nodes
+  	 * @param   { Object } ast - ast program
+  	 * @returns { Object } the ast program with all the global nodes updated
+  	 */function updateNodesScope(ast){const ignorePath=()=>false;types$1.visit(ast,{visitIdentifier:updateNodeScope,visitMemberExpression,visitProperty,visitThisExpression,visitClassExpression:ignorePath});return ast;}/**
+  	 * Convert any expression to an AST tree
+  	 * @param   { Object } expression - expression parsed by the riot parser
+  	 * @param   { string } sourceFile - original tag file
+  	 * @param   { string } sourceCode - original tag source code
+  	 * @returns { Object } the ast generated
+  	 */function createASTFromExpression(expression,sourceFile,sourceCode){const code=sourceFile?addLineOffset(expression.text,sourceCode,expression):expression.text;return generateAST(`(${code})`,{sourceFileName:sourceFile});}/**
+  	 * Create the bindings template property
+  	 * @param   {Array} args - arguments to pass to the template function
+  	 * @returns {ASTNode} a binding template key
+  	 */function createTemplateProperty(args){return simplePropertyNode(BINDING_TEMPLATE_KEY,args?callTemplateFunction(...args):nullNode());}/**
+  	 * Try to get the expression of an attribute node
+  	 * @param   { RiotParser.Node.Attribute } attribute - riot parser attribute node
+  	 * @returns { RiotParser.Node.Expression } attribute expression value
+  	 */function getAttributeExpression(attribute){return attribute.expressions?attribute.expressions[0]:Object.assign({},attribute,{text:attribute.value});}/**
+  	 * Wrap the ast generated in a function call providing the scope argument
+  	 * @param   {Object} ast - function body
+  	 * @returns {FunctionExpresion} function having the scope argument injected
+  	 */function wrapASTInFunctionWithScope(ast){return builders.functionExpression(null,[scope$1],builders.blockStatement([builders.returnStatement(ast)]));}/**
+  	 * Convert any parser option to a valid template one
+  	 * @param   { RiotParser.Node.Expression } expression - expression parsed by the riot parser
+  	 * @param   { string } sourceFile - original tag file
+  	 * @param   { string } sourceCode - original tag source code
+  	 * @returns { Object } a FunctionExpression object
+  	 *
+  	 * @example
+  	 *  toScopedFunction('foo + bar') // scope.foo + scope.bar
+  	 *
+  	 * @example
+  	 *  toScopedFunction('foo.baz + bar') // scope.foo.baz + scope.bar
+  	 */function toScopedFunction(expression,sourceFile,sourceCode){return compose(wrapASTInFunctionWithScope,transformExpression)(expression,sourceFile,sourceCode);}/**
+  	 * Transform an expression node updating its global scope
+  	 * @param   {RiotParser.Node.Expr} expression - riot parser expression node
+  	 * @param   {string} sourceFile - source file
+  	 * @param   {string} sourceCode - source code
+  	 * @returns {ASTExpression} ast expression generated from the riot parser expression node
+  	 */function transformExpression(expression,sourceFile,sourceCode){return compose(getExpressionAST,updateNodesScope,createASTFromExpression)(expression,sourceFile,sourceCode);}/**
+  	 * Get the parsed AST expression of riot expression node
+  	 * @param   {AST.Program} sourceAST - raw node parsed
+  	 * @returns {AST.Expression} program expression output
+  	 */function getExpressionAST(sourceAST){const astBody=sourceAST.program.body;return astBody[0]?astBody[0].expression:astBody;}/**
+  	 * Create the template call function
+  	 * @param   {Array|string|Node.Literal} template - template string
+  	 * @param   {Array<AST.Nodes>} bindings - template bindings provided as AST nodes
+  	 * @returns {Node.CallExpression} template call expression
+  	 */function callTemplateFunction(template,bindings){return builders.callExpression(builders.identifier(TEMPLATE_FN),[template?builders.literal(template):nullNode(),bindings?builders.arrayExpression(bindings):nullNode()]);}/**
+  	 * Convert any DOM attribute into a valid DOM selector useful for the querySelector API
+  	 * @param   { string } attributeName - name of the attribute to query
+  	 * @returns { string } the attribute transformed to a query selector
+  	 */const attributeNameToDOMQuerySelector=attributeName=>`[${attributeName}]`;/**
+  	 * Create the properties to query a DOM node
+  	 * @param   { string } attributeName - attribute name needed to identify a DOM node
+  	 * @returns { Array<AST.Node> } array containing the selector properties needed for the binding
+  	 */function createSelectorProperties(attributeName){return attributeName?[simplePropertyNode(BINDING_REDUNDANT_ATTRIBUTE_KEY,builders.literal(attributeName)),simplePropertyNode(BINDING_SELECTOR_KEY,compose(builders.literal,attributeNameToDOMQuerySelector)(attributeName))]:[];}/**
+  	 * Clone the node filtering out the selector attribute from the attributes list
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @param   {string} selectorAttribute - name of the selector attribute to filter out
+  	 * @returns {RiotParser.Node} the node with the attribute cleaned up
+  	 */function cloneNodeWithoutSelectorAttribute(node,selectorAttribute){return Object.assign({},node,{attributes:getAttributesWithoutSelector(getNodeAttributes(node),selectorAttribute)});}/**
+  	 * Get the node attributes without the selector one
+  	 * @param   {Array<RiotParser.Attr>} attributes - attributes list
+  	 * @param   {string} selectorAttribute - name of the selector attribute to filter out
+  	 * @returns {Array<RiotParser.Attr>} filtered attributes
+  	 */function getAttributesWithoutSelector(attributes,selectorAttribute){if(selectorAttribute)return attributes.filter(attribute=>attribute.name!==selectorAttribute);return attributes;}/**
+  	 * Clean binding or custom attributes
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {Array<RiotParser.Node.Attr>} only the attributes that are not bindings or directives
+  	 */function cleanAttributes(node){return getNodeAttributes(node).filter(attribute=>![IF_DIRECTIVE,EACH_DIRECTIVE,KEY_ATTRIBUTE,SLOT_ATTRIBUTE,IS_DIRECTIVE].includes(attribute.name));}/**
+  	 * Create a root node proxing only its nodes and attributes
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {RiotParser.Node} root node
+  	 */function createRootNode(node){return {nodes:getChildrenNodes(node),isRoot:true,// root nodes shuold't have directives
+  attributes:cleanAttributes(node)};}/**
+  	 * Get all the child nodes of a RiotParser.Node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {Array<RiotParser.Node>} all the child nodes found
+  	 */function getChildrenNodes(node){return node&&node.nodes?node.nodes:[];}/**
+  	 * Get all the attributes of a riot parser node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {Array<RiotParser.Node.Attribute>} all the attributes find
+  	 */function getNodeAttributes(node){return node.attributes?node.attributes:[];}/**
+  	 * Get the name of a custom node transforming it into an expression node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {RiotParser.Node.Attr} the node name as expression attribute
+  	 */function getCustomNodeNameAsExpression(node){const isAttribute=findIsAttribute(node);const toRawString=val=>`'${val}'`;if(isAttribute){return isAttribute.expressions?isAttribute.expressions[0]:Object.assign({},isAttribute,{text:toRawString(isAttribute.value)});}return Object.assign({},node,{text:toRawString(getName$1(node))});}/**
+  	 * Convert all the node static attributes to strings
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {string} all the node static concatenated as string
+  	 */function staticAttributesToString(node){return findStaticAttributes(node).map(attribute=>attribute[IS_BOOLEAN_ATTRIBUTE]||!attribute.value?attribute.name:`${attribute.name}="${unescapeNode(attribute,'value').value}"`).join(' ');}/**
+  	 * Make sure that node escaped chars will be unescaped
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @param   {string} key - key property to unescape
+  	 * @returns {RiotParser.Node} node with the text property unescaped
+  	 */function unescapeNode(node,key){if(node.unescape){return Object.assign({},node,{[key]:unescapeChar(node[key],node.unescape)});}return node;}/**
+  	 * Convert a riot parser opening node into a string
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {string} the node as string
+  	 */function nodeToString(node){const attributes=staticAttributesToString(node);switch(true){case isTagNode(node):return `<${node.name}${attributes?` ${attributes}`:''}${isVoidNode(node)?'/':''}>`;case isTextNode(node):return hasExpressions(node)?TEXT_NODE_EXPRESSION_PLACEHOLDER:unescapeNode(node,'text').text;default:return '';}}/**
+  	 * Close an html node
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @returns {string} the closing tag of the html tag node passed to this function
+  	 */function closeTag(node){return node.name?`</${node.name}>`:'';}/**
+  	 * Create a strings array with the `join` call to transform it into a string
+  	 * @param   {Array} stringsArray - array containing all the strings to concatenate
+  	 * @returns {AST.CallExpression} array with a `join` call
+  	 */function createArrayString(stringsArray){return builders.callExpression(builders.memberExpression(builders.arrayExpression(stringsArray),builders.identifier('join'),false),[builders.literal('')]);}/**
+  	 * Simple expression bindings might contain multiple expressions like for example: "class="{foo} red {bar}""
+  	 * This helper aims to merge them in a template literal if it's necessary
+  	 * @param   {RiotParser.Attr} node - riot parser node
+  	 * @param   {string} sourceFile - original tag file
+  	 * @param   {string} sourceCode - original tag source code
+  	 * @returns { Object } a template literal expression object
+  	 */function mergeAttributeExpressions(node,sourceFile,sourceCode){if(!node.parts||node.parts.length===1){return transformExpression(node.expressions[0],sourceFile,sourceCode);}const stringsArray=[...node.parts.reduce((acc,str)=>{const expression=node.expressions.find(e=>e.text.trim()===str);return [...acc,expression?transformExpression(expression,sourceFile,sourceCode):builders.literal(str)];},[])].filter(expr=>!isLiteral(expr)||expr.value);return createArrayString(stringsArray);}/**
+  	 * Create a selector that will be used to find the node via dom-bindings
+  	 * @param   {number} id - temporary variable that will be increased anytime this function will be called
+  	 * @returns {string} selector attribute needed to bind a riot expression
+  	 */const createBindingSelector=function createSelector(id){if(id===void 0){id=0;}return ()=>`${BINDING_SELECTOR_PREFIX}${id++}`;}();/**
+  	 * Create an attribute evaluation function
+  	 * @param   {RiotParser.Attr} sourceNode - riot parser node
+  	 * @param   {string} sourceFile - original tag file
+  	 * @param   {string} sourceCode - original tag source code
+  	 * @returns { AST.Node } an AST function expression to evaluate the attribute value
+  	 */function createAttributeEvaluationFunction(sourceNode,sourceFile,sourceCode){return hasExpressions(sourceNode)?// dynamic attribute
+  wrapASTInFunctionWithScope(mergeAttributeExpressions(sourceNode,sourceFile,sourceCode)):// static attribute
+  builders.functionExpression(null,[],builders.blockStatement([builders.returnStatement(builders.literal(sourceNode.value||true))]));}/**
+  	 * Simple clone deep function, do not use it for classes or recursive objects!
+  	 * @param   {*} source - possibily an object to clone
+  	 * @returns {*} the object we wanted to clone
+  	 */function cloneDeep(source){return JSON.parse(JSON.stringify(source));}const getEachItemName=expression=>isSequenceExpression(expression.left)?expression.left.expressions[0]:expression.left;const getEachIndexName=expression=>isSequenceExpression(expression.left)?expression.left.expressions[1]:null;const getEachValue=expression=>expression.right;const nameToliteral=compose(builders.literal,getName$1);const generateEachItemNameKey=expression=>simplePropertyNode(BINDING_ITEM_NAME_KEY,compose(nameToliteral,getEachItemName)(expression));const generateEachIndexNameKey=expression=>simplePropertyNode(BINDING_INDEX_NAME_KEY,compose(nameToliteral,getEachIndexName)(expression));const generateEachEvaluateKey=(expression,eachExpression,sourceFile,sourceCode)=>simplePropertyNode(BINDING_EVALUATE_KEY,compose(e=>toScopedFunction(e,sourceFile,sourceCode),e=>Object.assign({},eachExpression,{text:generateJavascript(e).code}),getEachValue)(expression));/**
+  	 * Get the each expression properties to create properly the template binding
+  	 * @param   { DomBinding.Expression } eachExpression - original each expression data
+  	 * @param   { string } sourceFile - original tag file
+  	 * @param   { string } sourceCode - original tag source code
+  	 * @returns { Array } AST nodes that are needed to build an each binding
+  	 */function generateEachExpressionProperties(eachExpression,sourceFile,sourceCode){const ast=createASTFromExpression(eachExpression,sourceFile,sourceCode);const body=ast.program.body;const firstNode=body[0];if(!isExpressionStatement(firstNode)){panic(`The each directives supported should be of type "ExpressionStatement",you have provided a "${firstNode.type}"`);}const{expression}=firstNode;return [generateEachItemNameKey(expression),generateEachIndexNameKey(expression),generateEachEvaluateKey(expression,eachExpression,sourceFile,sourceCode)];}/**
+  	 * Transform a RiotParser.Node.Tag into an each binding
+  	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns { AST.Node } an each binding node
+  	 */function createEachBinding(sourceNode,selectorAttribute,sourceFile,sourceCode){const[ifAttribute,eachAttribute,keyAttribute]=[findIfAttribute,findEachAttribute,findKeyAttribute].map(f=>f(sourceNode));const attributeOrNull=attribute=>attribute?toScopedFunction(getAttributeExpression(attribute),sourceFile,sourceCode):nullNode();return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(BINDING_TYPES),builders.identifier(EACH_BINDING_TYPE),false)),simplePropertyNode(BINDING_GET_KEY_KEY,attributeOrNull(keyAttribute)),simplePropertyNode(BINDING_CONDITION_KEY,attributeOrNull(ifAttribute)),createTemplateProperty(createNestedBindings(sourceNode,sourceFile,sourceCode,selectorAttribute)),...createSelectorProperties(selectorAttribute),...compose(generateEachExpressionProperties,getAttributeExpression)(eachAttribute)]);}/**
+  	 * Transform a RiotParser.Node.Tag into an if binding
+  	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @param   { stiring } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns { AST.Node } an if binding node
+  	 */function createIfBinding(sourceNode,selectorAttribute,sourceFile,sourceCode){const ifAttribute=findIfAttribute(sourceNode);return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(BINDING_TYPES),builders.identifier(IF_BINDING_TYPE),false)),simplePropertyNode(BINDING_EVALUATE_KEY,toScopedFunction(ifAttribute.expressions[0],sourceFile,sourceCode)),...createSelectorProperties(selectorAttribute),createTemplateProperty(createNestedBindings(sourceNode,sourceFile,sourceCode,selectorAttribute))]);}/**
+  	 * Create a simple attribute expression
+  	 * @param   {RiotParser.Node.Attr} sourceNode - the custom tag
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @returns {AST.Node} object containing the expression binding keys
+  	 */function createAttributeExpression(sourceNode,sourceFile,sourceCode){return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(EXPRESSION_TYPES),builders.identifier(ATTRIBUTE_EXPRESSION_TYPE),false)),simplePropertyNode(BINDING_NAME_KEY,isSpreadAttribute$1(sourceNode)?nullNode():builders.literal(sourceNode.name)),simplePropertyNode(BINDING_EVALUATE_KEY,createAttributeEvaluationFunction(sourceNode,sourceFile,sourceCode))]);}/**
+  	 * Create a simple event expression
+  	 * @param   {RiotParser.Node.Attr} sourceNode - attribute containing the event handlers
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @returns {AST.Node} object containing the expression binding keys
+  	 */function createEventExpression(sourceNode,sourceFile,sourceCode){return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(EXPRESSION_TYPES),builders.identifier(EVENT_EXPRESSION_TYPE),false)),simplePropertyNode(BINDING_NAME_KEY,builders.literal(sourceNode.name)),simplePropertyNode(BINDING_EVALUATE_KEY,createAttributeEvaluationFunction(sourceNode,sourceFile,sourceCode))]);}/**
+  	 * Generate the pure immutable string chunks from a RiotParser.Node.Text
+  	 * @param   {RiotParser.Node.Text} node - riot parser text node
+  	 * @param   {string} sourceCode sourceCode - source code
+  	 * @returns {Array} array containing the immutable string chunks
+  	 */function generateLiteralStringChunksFromNode(node,sourceCode){return node.expressions.reduce((chunks,expression,index)=>{const start=index?node.expressions[index-1].end:node.start;chunks.push(sourceCode.substring(start,expression.start));// add the tail to the string
+  if(index===node.expressions.length-1)chunks.push(sourceCode.substring(expression.end,node.end));return chunks;},[]).map(str=>node.unescape?unescapeChar(str,node.unescape):str);}/**
+  	 * Simple bindings might contain multiple expressions like for example: "{foo} and {bar}"
+  	 * This helper aims to merge them in a template literal if it's necessary
+  	 * @param   {RiotParser.Node} node - riot parser node
+  	 * @param   {string} sourceFile - original tag file
+  	 * @param   {string} sourceCode - original tag source code
+  	 * @returns { Object } a template literal expression object
+  	 */function mergeNodeExpressions(node,sourceFile,sourceCode){if(node.parts.length===1)return transformExpression(node.expressions[0],sourceFile,sourceCode);const pureStringChunks=generateLiteralStringChunksFromNode(node,sourceCode);const stringsArray=pureStringChunks.reduce((acc,str,index)=>{const expr=node.expressions[index];return [...acc,builders.literal(str),expr?transformExpression(expr,sourceFile,sourceCode):nullNode()];},[])// filter the empty literal expressions
+  .filter(expr=>!isLiteral(expr)||expr.value);return createArrayString(stringsArray);}/**
+  	 * Create a text expression
+  	 * @param   {RiotParser.Node.Text} sourceNode - text node to parse
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @param   {number} childNodeIndex - position of the child text node in its parent children nodes
+  	 * @returns {AST.Node} object containing the expression binding keys
+  	 */function createTextExpression(sourceNode,sourceFile,sourceCode,childNodeIndex){return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(EXPRESSION_TYPES),builders.identifier(TEXT_EXPRESSION_TYPE),false)),simplePropertyNode(BINDING_CHILD_NODE_INDEX_KEY,builders.literal(childNodeIndex)),simplePropertyNode(BINDING_EVALUATE_KEY,wrapASTInFunctionWithScope(mergeNodeExpressions(sourceNode,sourceFile,sourceCode)))]);}function createValueExpression(sourceNode,sourceFile,sourceCode){return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(EXPRESSION_TYPES),builders.identifier(VALUE_EXPRESSION_TYPE),false)),simplePropertyNode(BINDING_EVALUATE_KEY,createAttributeEvaluationFunction(sourceNode,sourceFile,sourceCode))]);}function createExpression(sourceNode,sourceFile,sourceCode,childNodeIndex,parentNode){switch(true){case isTextNode(sourceNode):return createTextExpression(sourceNode,sourceFile,sourceCode,childNodeIndex);// progress nodes value attributes will be rendered as attributes
+  // see https://github.com/riot/compiler/issues/122
+  case isValueAttribute(sourceNode)&&hasValueAttribute(parentNode.name)&&!isProgressNode(parentNode):return createValueExpression(sourceNode,sourceFile,sourceCode);case isEventAttribute(sourceNode):return createEventExpression(sourceNode,sourceFile,sourceCode);default:return createAttributeExpression(sourceNode,sourceFile,sourceCode);}}/**
+  	 * Create the attribute expressions
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @returns {Array} array containing all the attribute expressions
+  	 */function createAttributeExpressions(sourceNode,sourceFile,sourceCode){return findDynamicAttributes(sourceNode).map(attribute=>createExpression(attribute,sourceFile,sourceCode,0,sourceNode));}/**
+  	 * Create the text node expressions
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @returns {Array} array containing all the text node expressions
+  	 */function createTextNodeExpressions(sourceNode,sourceFile,sourceCode){const childrenNodes=getChildrenNodes(sourceNode);return childrenNodes.filter(isTextNode).filter(hasExpressions).map(node=>createExpression(node,sourceFile,sourceCode,childrenNodes.indexOf(node),sourceNode));}/**
+  	 * Add a simple binding to a riot parser node
+  	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the if attribute
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns { AST.Node } an each binding node
+  	 */function createSimpleBinding(sourceNode,selectorAttribute,sourceFile,sourceCode){return builders.objectExpression([...createSelectorProperties(selectorAttribute),simplePropertyNode(BINDING_EXPRESSIONS_KEY,builders.arrayExpression([...createTextNodeExpressions(sourceNode,sourceFile,sourceCode),...createAttributeExpressions(sourceNode,sourceFile,sourceCode)]))]);}/**
+  	 * Transform a RiotParser.Node.Tag of type slot into a slot binding
+  	 * @param   { RiotParser.Node.Tag } sourceNode - slot node
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @returns { AST.Node } a slot binding node
+  	 */function createSlotBinding(sourceNode,selectorAttribute){const slotNameAttribute=findAttribute(NAME_ATTRIBUTE,sourceNode);const slotName=slotNameAttribute?slotNameAttribute.value:DEFAULT_SLOT_NAME;return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(BINDING_TYPES),builders.identifier(SLOT_BINDING_TYPE),false)),simplePropertyNode(BINDING_NAME_KEY,builders.literal(slotName)),...createSelectorProperties(selectorAttribute)]);}/**
+  	 * Find the slots in the current component and group them under the same id
+  	 * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+  	 * @returns {Object} object containing all the slots grouped by name
+  	 */function groupSlots(sourceNode){return getChildrenNodes(sourceNode).reduce((acc,node)=>{const slotAttribute=findSlotAttribute(node);if(slotAttribute){acc[slotAttribute.value]=node;}else{acc.default=createRootNode({nodes:[...getChildrenNodes(acc.default),node]});}return acc;},{default:null});}/**
+  	 * Create the slot entity to pass to the riot-dom bindings
+  	 * @param   {string} id - slot id
+  	 * @param   {RiotParser.Node.Tag} sourceNode - slot root node
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @returns {AST.Node} ast node containing the slot object properties
+  	 */function buildSlot(id,sourceNode,sourceFile,sourceCode){const cloneNode=Object.assign({},sourceNode,{// avoid to render the slot attribute
+  attributes:getNodeAttributes(sourceNode).filter(attribute=>attribute.name!==SLOT_ATTRIBUTE)});const[html,bindings]=build(cloneNode,sourceFile,sourceCode);return builders.objectExpression([simplePropertyNode(BINDING_ID_KEY,builders.literal(id)),simplePropertyNode(BINDING_HTML_KEY,builders.literal(html)),simplePropertyNode(BINDING_BINDINGS_KEY,builders.arrayExpression(bindings))]);}/**
+  	 * Create the AST array containing the slots
+  	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns {AST.ArrayExpression} array containing the attributes to bind
+  	 */function createSlotsArray(sourceNode,sourceFile,sourceCode){return builders.arrayExpression([...compose(slots=>slots.map((_ref4)=>{let[key,value]=_ref4;return buildSlot(key,value,sourceFile,sourceCode);}),slots=>slots.filter((_ref5)=>{let[,value]=_ref5;return value;}),Object.entries,groupSlots)(sourceNode)]);}/**
+  	 * Create the AST array containing the attributes to bind to this node
+  	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns {AST.ArrayExpression} array containing the slot objects
+  	 */function createBindingAttributes(sourceNode,selectorAttribute,sourceFile,sourceCode){return builders.arrayExpression([...compose(attributes=>attributes.map(attribute=>createExpression(attribute,sourceFile,sourceCode,0,sourceNode)),attributes=>getAttributesWithoutSelector(attributes,selectorAttribute),// eslint-disable-line
+  cleanAttributes)(sourceNode)]);}/**
+  	 * Find the slot attribute if it exists
+  	 * @param   {RiotParser.Node.Tag} sourceNode - the custom tag
+  	 * @returns {RiotParser.Node.Attr|undefined} the slot attribute found
+  	 */function findSlotAttribute(sourceNode){return getNodeAttributes(sourceNode).find(attribute=>attribute.name===SLOT_ATTRIBUTE);}/**
+  	 * Transform a RiotParser.Node.Tag into a tag binding
+  	 * @param   { RiotParser.Node.Tag } sourceNode - the custom tag
+  	 * @param   { string } selectorAttribute - attribute needed to select the target node
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns { AST.Node } tag binding node
+  	 */function createTagBinding(sourceNode,selectorAttribute,sourceFile,sourceCode){return builders.objectExpression([simplePropertyNode(BINDING_TYPE_KEY,builders.memberExpression(builders.identifier(BINDING_TYPES),builders.identifier(TAG_BINDING_TYPE),false)),simplePropertyNode(BINDING_GET_COMPONENT_KEY,builders.identifier(GET_COMPONENT_FN)),simplePropertyNode(BINDING_EVALUATE_KEY,toScopedFunction(getCustomNodeNameAsExpression(sourceNode),sourceFile,sourceCode)),simplePropertyNode(BINDING_SLOTS_KEY,createSlotsArray(sourceNode,sourceFile,sourceCode)),simplePropertyNode(BINDING_ATTRIBUTES_KEY,createBindingAttributes(sourceNode,selectorAttribute,sourceFile,sourceCode)),...createSelectorProperties(selectorAttribute)]);}const BuildingState=Object.freeze({html:[],bindings:[],parent:null});/**
+  	 * Nodes having bindings should be cloned and new selector properties should be added to them
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} bindingsSelector - temporary string to identify the current node
+  	 * @returns {RiotParser.Node} the original node parsed having the new binding selector attribute
+  	 */function createBindingsTag(sourceNode,bindingsSelector){if(!bindingsSelector)return sourceNode;return Object.assign({},sourceNode,{// inject the selector bindings into the node attributes
+  attributes:[{name:bindingsSelector,value:bindingsSelector},...getNodeAttributes(sourceNode)]});}/**
+  	 * Create a generic dynamic node (text or tag) and generate its bindings
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+  	 * @returns {Array} array containing the html output and bindings for the current node
+  	 */function createDynamicNode(sourceNode,sourceFile,sourceCode,state){switch(true){case isTextNode(sourceNode):// text nodes will not have any bindings
+  return [nodeToString(sourceNode),[]];default:return createTagWithBindings(sourceNode,sourceFile,sourceCode);}}/**
+  	 * Create only a dynamic tag node with generating a custom selector and its bindings
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+  	 * @returns {Array} array containing the html output and bindings for the current node
+  	 */function createTagWithBindings(sourceNode,sourceFile,sourceCode){const bindingsSelector=isRootNode(sourceNode)?null:createBindingSelector();const cloneNode=createBindingsTag(sourceNode,bindingsSelector);const tagOpeningHTML=nodeToString(cloneNode);switch(true){// EACH bindings have prio 1
+  case hasEachAttribute(cloneNode):return [tagOpeningHTML,[createEachBinding(cloneNode,bindingsSelector,sourceFile,sourceCode)]];// IF bindings have prio 2
+  case hasIfAttribute(cloneNode):return [tagOpeningHTML,[createIfBinding(cloneNode,bindingsSelector,sourceFile,sourceCode)]];// TAG bindings have prio 3
+  case isCustomNode(cloneNode):return [tagOpeningHTML,[createTagBinding(cloneNode,bindingsSelector,sourceFile,sourceCode)]];// slot tag
+  case isSlotNode(cloneNode):return [tagOpeningHTML,[createSlotBinding(cloneNode,bindingsSelector)]];// this node has expressions bound to it
+  default:return [tagOpeningHTML,[createSimpleBinding(cloneNode,bindingsSelector,sourceFile,sourceCode)]];}}/**
+  	 * Parse a node trying to extract its template and bindings
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+  	 * @returns {Array} array containing the html output and bindings for the current node
+  	 */function parseNode(sourceNode,sourceFile,sourceCode,state){// static nodes have no bindings
+  if(isStaticNode(sourceNode))return [nodeToString(sourceNode),[]];return createDynamicNode(sourceNode,sourceFile,sourceCode);}/**
+  	 * Create the tag binding
+  	 * @param   { RiotParser.Node.Tag } sourceNode - tag containing the each attribute
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @param   { string } selector - binding selector
+  	 * @returns { Array } array with only the tag binding AST
+  	 */function createNestedBindings(sourceNode,sourceFile,sourceCode,selector){const mightBeARiotComponent=isCustomNode(sourceNode);return mightBeARiotComponent?[null,[createTagBinding(cloneNodeWithoutSelectorAttribute(sourceNode,selector),null,sourceFile,sourceCode)]]:build(createRootNode(sourceNode),sourceFile,sourceCode);}/**
+  	 * Build the template and the bindings
+  	 * @param   {RiotParser.Node} sourceNode - any kind of node parsed via riot parser
+  	 * @param   {string} sourceFile - source file path
+  	 * @param   {string} sourceCode - original source
+  	 * @param   {BuildingState} state - state representing the current building tree state during the recursion
+  	 * @returns {Array} array containing the html output and the dom bindings
+  	 */function build(sourceNode,sourceFile,sourceCode,state){if(!sourceNode)panic('Something went wrong with your tag DOM parsing, your tag template can\'t be created');const[nodeHTML,nodeBindings]=parseNode(sourceNode,sourceFile,sourceCode);const childrenNodes=getChildrenNodes(sourceNode);const currentState=Object.assign({},cloneDeep(BuildingState),{},state);// mutate the original arrays
+  currentState.html.push(...nodeHTML);currentState.bindings.push(...nodeBindings);// do recursion if
+  // this tag has children and it has no special directives bound to it
+  if(childrenNodes.length&&!hasItsOwnTemplate(sourceNode)){childrenNodes.forEach(node=>build(node,sourceFile,sourceCode,Object.assign({parent:sourceNode},currentState)));}// close the tag if it's not a void one
+  if(isTagNode(sourceNode)&&!isVoidNode(sourceNode)){currentState.html.push(closeTag(sourceNode));}return [currentState.html.join(''),currentState.bindings];}const templateFunctionArguments=[TEMPLATE_FN,EXPRESSION_TYPES,BINDING_TYPES,GET_COMPONENT_FN].map(builders.identifier);/**
+  	 * Create the content of the template function
+  	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @returns {AST.BlockStatement} the content of the template function
+  	 */function createTemplateFunctionContent(sourceNode,sourceFile,sourceCode){return builders.blockStatement([builders.returnStatement(callTemplateFunction(...build(createRootNode(sourceNode),sourceFile,sourceCode)))]);}/**
+  	 * Extend the AST adding the new template property containing our template call to render the component
+  	 * @param   { Object } ast - current output ast
+  	 * @param   { string } sourceFile - source file path
+  	 * @param   { string } sourceCode - original source
+  	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+  	 * @returns { Object } the output ast having the "template" key
+  	 */function extendTemplateProperty(ast,sourceFile,sourceCode,sourceNode){types$1.visit(ast,{visitProperty(path){if(path.value.key.value===TAG_TEMPLATE_PROPERTY){path.value.value=builders.functionExpression(null,templateFunctionArguments,createTemplateFunctionContent(sourceNode,sourceFile,sourceCode));return false;}this.traverse(path);}});return ast;}/**
+  	 * Generate the component template logic
+  	 * @param   { RiotParser.Node } sourceNode - node generated by the riot compiler
+  	 * @param   { string } source - original component source code
+  	 * @param   { Object } meta - compilation meta information
+  	 * @param   { AST } ast - current AST output
+  	 * @returns { AST } the AST generated
+  	 */function template(sourceNode,source,meta,ast){const{options}=meta;return extendTemplateProperty(ast,options.file,source,sourceNode);}const DEFAULT_OPTIONS={template:'default',file:'[unknown-source-file]',scopedCss:true};/**
+  	 * Create the initial AST
+  	 * @param {string} tagName - the name of the component we have compiled
+  	 * @returns { AST } the initial AST
+  	 *
+  	 * @example
+  	 * // the output represents the following string in AST
+  	 */function createInitialInput(_ref6){let{tagName}=_ref6;/*
+  	  generates
+  	  export default {
+  	     ${TAG_CSS_PROPERTY}: null,
+  	     ${TAG_LOGIC_PROPERTY}: null,
+  	     ${TAG_TEMPLATE_PROPERTY}: null
+  	  }
+  	  */return builders.program([builders.exportDefaultDeclaration(builders.objectExpression([simplePropertyNode(TAG_CSS_PROPERTY,nullNode()),simplePropertyNode(TAG_LOGIC_PROPERTY,nullNode()),simplePropertyNode(TAG_TEMPLATE_PROPERTY,nullNode()),simplePropertyNode(TAG_NAME_PROPERTY,builders.literal(tagName))]))]);}/**
+  	 * Make sure the input sourcemap is valid otherwise we ignore it
+  	 * @param   {SourceMapGenerator} map - preprocessor source map
+  	 * @returns {Object} sourcemap as json or nothing
+  	 */function normaliseInputSourceMap(map){const inputSourceMap=sourcemapAsJSON(map);return isEmptySourcemap(inputSourceMap)?null:inputSourceMap;}/**
+  	 * Override the sourcemap content making sure it will always contain the tag source code
+  	 * @param   {Object} map - sourcemap as json
+  	 * @param   {string} source - component source code
+  	 * @returns {Object} original source map with the "sourcesContent" property overriden
+  	 */function overrideSourcemapContent(map,source){return Object.assign({},map,{sourcesContent:[source]});}/**
+  	 * Create the compilation meta object
+  	 * @param { string } source - source code of the tag we will need to compile
+  	 * @param { string } options - compiling options
+  	 * @returns {Object} meta object
+  	 */function createMeta(source,options){return {tagName:null,fragments:null,options:Object.assign({},DEFAULT_OPTIONS,{},options),source};}/**
+  	 * Generate the output code source together with the sourcemap
+  	 * @param { string } source - source code of the tag we will need to compile
+  	 * @param { string } opts - compiling options
+  	 * @returns { Output } object containing output code and source map
+  	 */function compile(source,opts){if(opts===void 0){opts={};}const meta=createMeta(source,opts);const{options}=meta;const{code,map}=execute$1('template',options.template,meta,source);const{template:template$1,css:css$1,javascript:javascript$1}=parser$1(options).parse(code).output;// extend the meta object with the result of the parsing
+  Object.assign(meta,{tagName:template$1.name,fragments:{template:template$1,css:css$1,javascript:javascript$1}});return compose(result=>Object.assign({},result,{meta}),result=>execute(result,meta),result=>Object.assign({},result,{map:overrideSourcemapContent(result.map,source)}),ast=>meta.ast=ast&&generateJavascript(ast,{sourceMapName:`${options.file}.map`,inputSourceMap:normaliseInputSourceMap(map)}),hookGenerator(template,template$1,code,meta),hookGenerator(javascript,javascript$1,code,meta),hookGenerator(css,css$1,code,meta))(createInitialInput(meta));}/**
+  	 * Prepare the riot parser node transformers
+  	 * @param   { Function } transformer - transformer function
+  	 * @param   { Object } sourceNode - riot parser node
+  	 * @param   { string } source - component source code
+  	 * @param   { Object } meta - compilation meta information
+  	 * @returns { Promise<Output> } object containing output code and source map
+  	 */function hookGenerator(transformer,sourceNode,source,meta){if(// filter missing nodes
+  !sourceNode||// filter nodes without children
+  sourceNode.nodes&&!sourceNode.nodes.length||// filter empty javascript and css nodes
+  !sourceNode.nodes&&!sourceNode.text){return result=>result;}return curry(transformer)(sourceNode,source,meta);}// This function can be used to register new preprocessors
+  // a preprocessor can target either only the css or javascript nodes
+  // or the complete tag source file ('template')
+  const registerPreprocessor=register$1;// This function can allow you to register postprocessors that will parse the output code
+  // here we can run prettifiers, eslint fixes...
+  const registerPostprocessor=register;exports.compile=compile;exports.createInitialInput=createInitialInput;exports.registerPostprocessor=registerPostprocessor;exports.registerPreprocessor=registerPreprocessor;Object.defineProperty(exports,'__esModule',{value:true});});});var compiler$1 = unwrapExports(compiler);
+
+  const GLOBAL_REGISTRY = '__riot_registry__';
+  window[GLOBAL_REGISTRY] = {}; // evaluates a compiled tag within the global context
+
+  function evaluate(js, url) {
+    const node = document.createElement('script');
+    const root = document.documentElement; // make the source available in the "(no domain)" tab
+    // of Chrome DevTools, with a .js extension
+
+    if (url) node.text = `${js}\n//# sourceURL=${url}.js`;
+    root.appendChild(node);
+    root.removeChild(node);
+  } // cheap module transpilation
+
+
+  function transpile(code) {
+    return `(function (global){${code}})(this)`.replace('export default', 'return');
+  }
+
+  function inject(code, tagName, url) {
+    evaluate(`window.${GLOBAL_REGISTRY}['${tagName}'] = ${transpile(code)}`, url);
+    register(tagName, window[GLOBAL_REGISTRY][tagName]);
+  }
+
+  function compileFromString(string, options) {
+    return compiler$1.compile(string, options);
+  }
+
+  async function compileFromUrl(url, options) {
+    const response = await fetch(url);
+    const code = await response.text();
+    return compiler$1.compile(code, Object.assign({
+      file: url
+    }, options));
+  }
+
+  async function compile(options) {
+    const scripts = $('script[type="riot"]');
+    const urls = scripts.map(s => get(s, 'src') || get(s, 'data-src'));
+    const tags = await Promise.all(urls.map(url => compileFromUrl(url, options)));
+    tags.forEach((_ref, i) => {
+      let {
+        code,
+        meta
+      } = _ref;
+      const url = urls[i];
+      const {
+        tagName
+      } = meta;
+      inject(code, tagName, url);
+    });
+  }
+
+  var riot_compiler = Object.assign({}, riot, {
+    compile,
+    inject,
+    compileFromUrl,
+    compileFromString
+  });
+
+  return riot_compiler;
+
+}));
diff --git a/node_modules/riot/riot+compiler.min.js b/node_modules/riot/riot+compiler.min.js
new file mode 100644
index 0000000..f4be8e3
--- /dev/null
+++ b/node_modules/riot/riot+compiler.min.js
@@ -0,0 +1,8 @@
+/* Riot v4.5.0, @license MIT */
+(function(e,t){typeof exports==="object"&&typeof module!=="undefined"?module.exports=t():typeof define==="function"&&define.amd?define(t):(e=e||self,e.riot=t())})(this,function(){"use strict";const e=new Map,t=Symbol("riot-component"),r=new Set,n="is",i="value",s=Symbol("attributes"),a=Symbol("template");var o=Object.freeze({COMPONENTS_IMPLEMENTATION_MAP:e,DOM_COMPONENT_INSTANCE_PROPERTY:t,PLUGINS_SET:r,IS_DIRECTIVE:n,VALUE_ATTRIBUTE:i,ATTRIBUTES_KEY_SYMBOL:s,TEMPLATE_KEY_SYMBOL:a});function l(e){u(e.childNodes)}function u(e){Array.from(e).forEach(e=>e.parentNode&&e.parentNode.removeChild(e))}const c=0;const f=1;const h=2;const p=3;const d=4;var m={EACH:c,IF:f,SIMPLE:h,TAG:p,SLOT:d};function v(e){const t=e.dom.cloneNode(true);return{avoidDOMInjection:true,fragment:t,children:Array.from(t.childNodes)}}const{indexOf:g}=[];const y=(e,t,r,n,i,s)=>{const a="selectedIndex"in t;let o=a;while(n<i){const i=e(r[n],1);t.insertBefore(i,s);if(a&&o&&i.selected){o=!o;let{selectedIndex:e}=t;t.selectedIndex=e<0?n:g.call(t.querySelectorAll("option"),i)}n++}};const x=(e,t)=>e==t;const E=e=>e;const b=(e,t,r,n,i,s,a)=>{const o=s-i;if(o<1)return-1;while(r-t>=o){let o=t;let l=i;while(o<r&&l<s&&a(e[o],n[l])){o++;l++}if(l===s)return t;t=o+1}return-1};const S=(e,t,r,n,i,s)=>{while(n<i&&s(r[n],e[t-1])){n++;t--}return t===0};const D=(e,t,r,n,i)=>r<n?e(t[r],0):0<r?e(t[r-1],-0).nextSibling:i;const C=(e,t,r,n,i)=>{if(i-n<2)t.removeChild(e(r[n],-1));else{const s=t.ownerDocument.createRange();s.setStartBefore(e(r[n],-1));s.setEndAfter(e(r[i-1],-1));s.deleteContents()}};const w=-1;const A=1;const T=0;const k=50;const _=(e,t,r,n,i,s,a,o)=>{let l=0;let u=n<o?n:o;const c=Array(u++);const f=Array(u);f[0]=-1;for(let e=1;e<u;e++)f[e]=a;const h=new Map;for(let e=s;e<a;e++)h.set(i[e],e);for(let n=t;n<r;n++){const t=h.get(e[n]);if(t!=null){l=I(f,u,t);if(-1<l){f[l]=t;c[l]={newi:n,oldi:t,prev:c[l-1]}}}}l=--u;--a;while(f[l]>a)--l;u=o+n-l;const p=Array(u);let d=c[l];--r;while(d){const{newi:e,oldi:t}=d;while(r>e){p[--u]=A;--r}while(a>t){p[--u]=w;--a}p[--u]=T;--r;--a;d=d.prev}while(r>=t){p[--u]=A;--r}while(a>=s){p[--u]=w;--a}return p};const P=(e,t,r,n,i,s,a)=>{const o=r+s;const l=[];let u,c,f,h,p,d,m;e:for(u=0;u<=o;u++){if(u>k)return null;m=u-1;p=u?l[u-1]:[0,0];d=l[u]=[];for(c=-u;c<=u;c+=2){if(c===-u||c!==u&&p[m+c-1]<p[m+c+1]){h=p[m+c+1]}else{h=p[m+c-1]+1}f=h-c;while(h<s&&f<r&&a(n[i+h],e[t+f])){h++;f++}if(h===s&&f===r){break e}d[u+c]=h}}const v=Array(u/2+o/2);let g=v.length-1;for(u=l.length-1;u>=0;u--){while(h>0&&f>0&&a(n[i+h-1],e[t+f-1])){v[g--]=T;h--;f--}if(!u)break;m=u-1;p=u?l[u-1]:[0,0];c=h-f;if(c===-u||c!==u&&p[m+c-1]<p[m+c+1]){f--;v[g--]=A}else{h--;v[g--]=w}}return v};const F=(e,t,r,n,i,s,a,o,l)=>{const u=new Map;const c=e.length;let f=a;let h=0;while(h<c){switch(e[h++]){case T:i++;f++;break;case A:u.set(n[i],1);y(t,r,n,i++,i,f<o?t(s[f],0):l);break;case w:f++;break}}h=0;while(h<c){switch(e[h++]){case T:a++;break;case w:if(u.has(s[a]))a++;else C(t,r,s,a++,a);break}}};const I=(e,t,r)=>{let n=1;let i=t;while(n<i){const t=(n+i)/2>>>0;if(r<e[t])i=t;else n=t+1}return n};const M=(e,t,r,n,i,s,a,o,l,u,c,f,h)=>{F(P(r,n,s,a,o,u,f)||_(r,n,i,s,a,o,l,u),e,t,r,n,a,o,c,h)};const N=(e,t,r,n)=>{if(!n)n={};const i=n.compare||x;const s=n.node||E;const a=n.before==null?null:s(n.before,0);const o=t.length;let l=o;let u=0;let c=r.length;let f=0;while(u<l&&f<c&&i(t[u],r[f])){u++;f++}while(u<l&&f<c&&i(t[l-1],r[c-1])){l--;c--}const h=u===l;const p=f===c;if(h&&p)return r;if(h&&f<c){y(s,e,r,f,c,D(s,t,u,o,a));return r}if(p&&u<l){C(s,e,t,u,l);return r}const d=l-u;const m=c-f;let v=-1;if(d<m){v=b(r,f,c,t,u,l,i);if(-1<v){y(s,e,r,f,v,s(t[u],0));y(s,e,r,v+d,c,D(s,t,l,o,a));return r}}else if(m<d){v=b(t,u,l,r,f,c,i);if(-1<v){C(s,e,t,u,v);C(s,e,t,v+m,l);return r}}if(d<2||m<2){y(s,e,r,f,c,s(t[u],0));C(s,e,t,u,l);return r}if(d===m&&S(r,c,t,u,l,i)){y(s,e,r,f,c,D(s,t,l,o,a));return r}M(s,e,r,f,c,m,t,u,l,d,o,i,a);return r};function L(e){return e===null||e===undefined}function B(e){return!L(e.content)}const O=Object.seal({childrenMap:null,node:null,root:null,condition:null,evaluate:null,template:null,isTemplateTag:false,nodes:[],getKey:null,indexName:null,itemName:null,afterPlaceholder:null,placeholder:null,mount(e,t){return this.update(e,t)},update(e,t){const{placeholder:r}=this;const n=this.evaluate(e);const i=n?Array.from(n):[];const s=r.parentNode;const{newChildrenMap:a,batches:o,futureNodes:l}=G(i,e,t,this);if(l.length){N(s,this.nodes,l,{before:r,node:R(Array.from(this.childrenMap.values()),t)})}else{j(this.childrenMap)}o.forEach(e=>e());this.childrenMap=a;this.nodes=l;return this},unmount(e,t){j(this.childrenMap,t);this.childrenMap=new Map;this.nodes=[];return this}});function R(e,t){return(r,n)=>{if(n<0){const{template:r,context:n}=e.pop();r.unmount(n,t,null)}return r}}function j(e,t){return Array.from(e.values()).map(e=>{let{template:r,context:n}=e;return r.unmount(n,t,true)})}function U(e,t){return e?Boolean(e(t))===false:false}function V(e,t){let{itemName:r,indexName:n,index:i,item:s}=t;e[r]=s;if(n)e[n]=i;return e}function G(e,t,r,n){const{condition:i,template:s,childrenMap:a,itemName:o,getKey:l,indexName:u,root:c,isTemplateTag:f}=n;const h=new Map;const p=[];const d=[];e.forEach((e,n)=>{const m=V(Object.create(t),{itemName:o,indexName:u,index:n,item:e});const g=l?l(m):n;const y=a.get(g);if(U(i,m)){return}const x=y?y.template:s.clone();const E=y?x.el:c.cloneNode();const b=!y;const S=f&&b?v(x):{};if(b){p.push(()=>x.mount(E,m,r,S))}else{x.update(m,r)}if(f){d.push(...S.children||x.children)}else{d.push(E)}a.delete(g);h.set(g,{template:x,context:m,index:n})});return{newChildrenMap:h,batches:p,futureNodes:d}}function z(e,t){let{evaluate:r,condition:n,itemName:i,indexName:s,getKey:a,template:o}=t;const l=document.createTextNode("");const u=e.parentNode;const c=e.cloneNode();u.insertBefore(l,e);u.removeChild(e);return Object.assign({},O,{childrenMap:new Map,node:e,root:c,condition:n,evaluate:r,isTemplateTag:B(c),template:o.createDOM(e),getKey:a,indexName:s,itemName:i,placeholder:l})}const X=Object.seal({node:null,evaluate:null,parent:null,isTemplateTag:false,placeholder:null,template:null,mount(e,t){this.parent.insertBefore(this.placeholder,this.node);this.parent.removeChild(this.node);return this.update(e,t)},update(e,t){const r=!!this.evaluate(e);const n=!this.value&&r;const i=this.value&&!r;const s=()=>{const r=this.node.cloneNode();this.parent.insertBefore(r,this.placeholder);this.template=this.template.clone();this.template.mount(r,e,t)};switch(true){case n:s();break;case i:this.unmount(e);break;default:if(r)this.template.update(e,t)}this.value=r;return this},unmount(e,t){this.template.unmount(e,t,true);return this}});function J(e,t){let{evaluate:r,template:n}=t;return Object.assign({},X,{node:e,evaluate:r,parent:e.parentNode,placeholder:document.createTextNode(""),template:n.createDOM(e)})}const q=0;const W=1;const H=2;const K=3;var $={ATTRIBUTE:q,EVENT:W,TEXT:H,VALUE:K};function Y(e){return typeof e==="boolean"}function Q(e){return typeof e==="object"}const Z="removeAttribute";const ee="setAttribute";function te(e,t){Object.entries(t).forEach(t=>{let[r,n]=t;return ne(e,{name:r},n)})}function re(e,t){Object.keys(t).forEach(t=>e.removeAttribute(t))}function ne(e,t,r,n){let{name:i}=t;if(!i){if(r){te(e,r)}else if(n){re(e,n)}return}if(Y(r)||Q(r)){e[i]=r}e[ie(r)](i,se(i,r))}function ie(e){return L(e)||e===false||e===""||Q(e)?Z:ee}function se(e,t){if(t===true)return e;return t}const ae=/^on/;function oe(e,t,r,n){let{name:i}=t;const s=i.replace(ae,"");if(n){e.removeEventListener(s,n)}if(r){e.addEventListener(s,r,false)}return r}function le(e,t,r){let{childNodeIndex:n}=t;const i=e.childNodes[n];const s=ue(r);if(i.nodeType===Node.COMMENT_NODE){const t=document.createTextNode(s);e.replaceChild(t,i)}else{i.data=ue(s)}}function ue(e){return L(e)?"":e}function ce(e,t,r){e.value=r}var fe={[q]:ne,[W]:oe,[H]:le,[K]:ce};const he=Object.seal({node:null,value:null,mount(e){this.value=this.evaluate(e);pe(this,this.value);return this},update(e){const t=this.evaluate(e);if(this.value!==t){pe(this,t);this.value=t}return this},unmount(){if(this.type===W)pe(this,null);return this}});function pe(e,t){return fe[e.type](e.node,e,t,e.value)}function de(e,t){return Object.assign({},he,{},t,{node:e})}function me(e,t,r){return t.reduce((t,n)=>{return Object.assign({},t,{[n]:t=>{return e.map(e=>e[n](t))&&r}})},{})}function ve(e,t){let{expressions:r}=t;return Object.assign({},me(r.map(t=>de(e,t)),["mount","update","unmount"]))}const ge=Object.seal({node:null,name:null,template:null,mount(e,t){const r=e.slots?e.slots.find(e=>{let{id:t}=e;return t===this.name}):false;const{parentNode:n}=this.node;this.template=r&&Le(r.html,r.bindings).createDOM(n);if(this.template){this.template.mount(this.node,t);ye(this.node)}n.removeChild(this.node);return this},update(e,t){if(this.template&&t){this.template.update(t)}return this},unmount(e,t,r){if(this.template){this.template.unmount(t,null,r)}return this}});function ye(e){if(e.firstChild){e.parentNode.insertBefore(e.firstChild,e);ye(e)}}function xe(e,t){let{name:r}=t;return Object.assign({},ge,{node:e,name:r})}function Ee(e,t,r){if(t===void 0){t=[]}if(r===void 0){r=[]}if(e){return e({slots:t,attributes:r})}return Le(Se(t),[...be(t),{expressions:r.map(e=>{return Object.assign({type:q},e)})}])}function be(e){return e.reduce((e,t)=>{let{bindings:r}=t;return e.concat(r)},[])}function Se(e){return e.reduce((e,t)=>{return e+t.html},"")}const De=Object.seal({node:null,evaluate:null,name:null,slots:null,tag:null,attributes:null,getComponent:null,mount(e){return this.update(e)},update(e,t){const r=this.evaluate(e);if(r===this.name){this.tag.update(e)}else{this.unmount(e,t,true);this.name=r;this.tag=Ee(this.getComponent(r),this.slots,this.attributes);this.tag.mount(this.node,e)}return this},unmount(e,t,r){if(this.tag){this.tag.unmount(r)}return this}});function Ce(e,t){let{evaluate:r,getComponent:n,slots:i,attributes:s}=t;return Object.assign({},De,{node:e,evaluate:r,slots:i,attributes:s,getComponent:n})}var we={[f]:J,[h]:ve,[c]:z,[p]:Ce,[d]:xe};function Ae(e,t){const{selector:r,type:n,redundantAttribute:i,expressions:s}=t;const a=r?e.querySelector(r):e;if(i)a.removeAttribute(i);return(we[n]||we[h])(a,Object.assign({},t,{expressions:s||[]}))}function Te(e){const t=e.ownerSVGElement;return!!t||t===null}function ke(e,t){const r=B(t)?t:document.createElement("template");r.innerHTML=e;return r.content}function _e(e,t){const r=t.ownerDocument.importNode((new window.DOMParser).parseFromString(`<svg xmlns="http://www.w3.org/2000/svg">${e}</svg>`,"application/xml").documentElement,true);return r}function Pe(e,t){if(Te(e))return _e(t,e);return ke(t,e)}function Fe(e,t){if(e.firstChild){t.appendChild(e.firstChild);Fe(e,t)}}function Ie(e,t){switch(true){case Te(e):Fe(t,e);break;case B(e):e.parentNode.replaceChild(t,e);break;default:e.appendChild(t)}}function Me(e,t){return t&&(typeof t==="string"?Pe(e,t):t)}const Ne=Object.freeze({bindings:null,bindingsData:null,html:null,isTemplateTag:false,fragment:null,children:null,dom:null,el:null,createDOM(e){this.dom=this.dom||Me(e,this.html);return this},mount(e,t,r,n){if(n===void 0){n={}}if(!e)throw new Error("Please provide DOM node to mount properly your template");if(this.el)this.unmount(t);const{fragment:i,children:s,avoidDOMInjection:a}=n;const{parentNode:o}=s?s[0]:e;this.isTemplateTag=B(e);this.createDOM(e);if(this.dom){this.fragment=i||this.dom.cloneNode(true)}this.el=this.isTemplateTag?o:e;this.children=this.isTemplateTag?s||Array.from(this.fragment.childNodes):null;if(!a&&this.fragment)Ie(e,this.fragment);this.bindings=this.bindingsData.map(e=>Ae(this.el,e));this.bindings.forEach(e=>e.mount(t,r));return this},update(e,t){this.bindings.forEach(r=>r.update(e,t));return this},unmount(e,t,r){if(this.el){this.bindings.forEach(n=>n.unmount(e,t,r));switch(true){case this.isTemplateTag===true&&r!==null:u(this.children);break;case r===true&&this.el.parentNode!==null:this.el.parentNode.removeChild(this.el);break;case r!==null:l(this.el);break}this.el=null}return this},clone(){return Object.assign({},this,{el:null})}});function Le(e,t){if(t===void 0){t=[]}return Object.assign({},Ne,{html:e,bindingsData:t})}function Be(e,t){return typeof e===t}function Oe(e){return Be(e,"function")}function Re(e){throw new Error(e)}function je(e){return Oe(e)?e.prototype&&e.prototype.constructor?new e:e():e}function Ue(e){return e.replace(/([a-z])([A-Z])/g,"$1-$2").toLowerCase()}function Ve(e){return e.replace(/-(\w)/g,(e,t)=>t.toUpperCase())}function Ge(e,t){Object.entries(t).forEach(t=>{let[r,n]=t;if(!e[r])e[r]=n});return e}function ze(){return this}function Xe(e,t){t.forEach(t=>{e[t]=e[t].bind(e)});return e}function Je(e,t,r,n){if(n===void 0){n={}}Object.defineProperty(e,t,Object.assign({value:r,enumerable:false,writable:false,configurable:true},n));return e}function qe(e,t,r){Object.entries(t).forEach(t=>{let[n,i]=t;Je(e,n,i,r)});return e}function We(e){return e.reduce((e,t)=>{const{value:r,type:n}=t;switch(true){case!t.name&&n===$.ATTRIBUTE:return Object.assign({},e,{},r);case n===$.VALUE:e[i]=t.value;break;default:e[Ve(t.name)]=t.value}return e},{})}function He(e){if(!Array.isArray(e)){if(/^\[object (HTMLCollection|NodeList|Object)\]$/.test(Object.prototype.toString.call(e))&&typeof e.length==="number")return Array.from(e);else return[e]}return e}const Ke=e=>e.length===1?e[0]:e;function $e(e,t,r){const n=typeof t==="string"?[t]:t;return Ke(He(e).map(e=>{return Ke(n.map(t=>e[r](t)))}))}function Ye(e,t,r){const n=typeof t==="object"?t:{[t]:r};const i=Object.keys(n);He(e).forEach(e=>{i.forEach(t=>e.setAttribute(t,n[t]))});return e}function Qe(e,t){return $e(e,t,"getAttribute")}function Ze(e){return Array.from(e.attributes).reduce((e,t)=>{e[Ve(t.name)]=t.value;return e},{})}function et(e){return Qe(e,n)||e.tagName.toLowerCase()}function tt(e,t){return He(typeof e==="string"?(t||document).querySelectorAll(e):e)}const rt=new Map;const nt="style[riot]";const it=(e=>{return()=>{if(e)return e;e=tt(nt)[0]||document.createElement("style");Ye(e,"type","text/css");if(!e.parentNode)document.head.appendChild(e);return e}})();var st={CSS_BY_NAME:rt,add(e,t){if(!rt.has(e)){rt.set(e,t);this.inject()}return this},inject(){it().innerHTML=[...rt.values()].join("\n");return this},remove(e){if(rt.has(e)){rt.delete(e);this.inject()}return this}};function at(e){for(var t=arguments.length,r=new Array(t>1?t-1:0),n=1;n<t;n++){r[n-1]=arguments[n]}return function(){for(var t=arguments.length,n=new Array(t),i=0;i<t;i++){n[i]=arguments[i]}n=[...r,...n];return n.length<e.length?at(e,...n):e(...n)}}const ot=Object.freeze({$(e){return tt(e,this.root)[0]},$$(e){return tt(e,this.root)}});const lt=Object.freeze({shouldUpdate:ze,onBeforeMount:ze,onMounted:ze,onBeforeUpdate:ze,onUpdated:ze,onBeforeUnmount:ze,onUnmounted:ze});const ut={update:ze,mount:ze,unmount:ze,clone:ze,createDOM:ze};function ct(t,r){return t(Le,$,m,t=>{return r[t]||e.get(t)})}function ft(e){let{css:t,template:r,exports:n,name:i}=e;const s=r?ct(r,n?mt(n.components):{}):ut;return e=>{let{slots:r,attributes:a,props:o}=e;const l=je(n)||{};const u=ht({css:t,template:s,componentAPI:l,name:i})({slots:r,attributes:a,props:o});return{mount(e,t,r){return u.mount(e,r,t)},update(e,t){return u.update(t,e)},unmount(e){return u.unmount(e)}}}}function ht(e){let{css:t,template:r,componentAPI:n,name:i}=e;if(t&&i)st.add(i,t);return at(xt)(qe(Ge(n,Object.assign({},lt,{state:{}})),Object.assign({slots:null,root:null},ot,{name:i,css:t,template:r})))}function pt(e,t){if(t===void 0){t=[]}return Object.assign({},Ze(e),{},We(t))}function dt(e,t){if(t===void 0){t=[]}const r=t.map(t=>de(e,t));const n={};const i=e=>t=>{r.forEach(r=>r[e](t));return n};return Object.assign(n,{expressions:r,mount:i("mount"),update:i("update"),unmount:i("unmount")})}function mt(e){if(e===void 0){e={}}return Object.entries(je(e)).reduce((e,t)=>{let[r,n]=t;e[Ue(r)]=ft(n);return e},{})}function vt(e){return[...r].reduce((e,t)=>t(e)||e,e)}function gt(e,t){return Object.assign({},e,{},je(t))}function yt(e,t){if(et(e)!==t){Ye(e,"is",t)}}function xt(e,r){let{slots:n,attributes:i,props:o}=r;const l=je(o);return Xe(vt(qe(Object.create(e),{mount(r,o,u){if(o===void 0){o={}}this[s]=dt(r,i).mount(u);this.props=Object.freeze(Object.assign({},l,{},pt(r,this[s].expressions)));this.state=gt(this.state,o);this[a]=this.template.createDOM(r).clone();r[t]=this;e.name&&yt(r,e.name);Je(this,"root",r);Je(this,"slots",n);this.onBeforeMount(this.props,this.state);this[a].mount(r,this,u);this.onMounted(this.props,this.state);return this},update(e,t){if(e===void 0){e={}}if(t){this[s].update(t)}const r=pt(this.root,this[s].expressions);if(this.shouldUpdate(r,this.props)===false)return;this.props=Object.freeze(Object.assign({},l,{},r));this.state=gt(this.state,e);this.onBeforeUpdate(this.props,this.state);this[a].update(this,t);this.onUpdated(this.props,this.state);return this},unmount(e){this.onBeforeUnmount(this.props,this.state);this[s].unmount();this[a].unmount(this,{},e===null?null:!e);this.onUnmounted(this.props,this.state);return this}})),Object.keys(e).filter(t=>Oe(e[t])))}function Et(t,r,n){const i=n||et(t);if(!e.has(i))Re(`The component named "${i}" was never registered`);const s=e.get(i)({props:r});return s.mount(t)}function bt(){for(var e=arguments.length,t=new Array(e),r=0;r<e;r++){t[r]=arguments[r]}return t.reduce((e,t)=>(function(){return e(t(...arguments))}))}const{DOM_COMPONENT_INSTANCE_PROPERTY:St,COMPONENTS_IMPLEMENTATION_MAP:Dt,PLUGINS_SET:Ct}=o;function wt(e,t){let{css:r,template:n,exports:i}=t;if(Dt.has(e))Re(`The component "${e}" was already registered`);Dt.set(e,ft({name:e,css:r,template:n,exports:i}));return Dt}function At(e){if(!Dt.has(e))Re(`The component "${e}" was never registered`);Dt.delete(e);st.remove(e);return Dt}function Tt(e,t,r){return tt(e).map(e=>Et(e,t,r))}function kt(e,t){return tt(e).map(e=>{if(e[St]){e[St].unmount(t)}return e})}function _t(e){if(!Oe(e))Re("Plugins must be of type function");if(Ct.has(e))Re("This plugin was already install");Ct.add(e);return Ct}function Pt(e){if(!Ct.has(e))Re("This plugin was never installed");Ct.delete(e);return Ct}function Ft(e){return(t,r)=>bt(e=>e.mount(t),e=>e({props:r}),ft)(e)}const It="v4.5.0";const Mt={cssManager:st,defineComponent:ht,globals:o};var Nt=Object.freeze({register:wt,unregister:At,mount:Tt,unmount:kt,install:_t,uninstall:Pt,component:Ft,version:It,__:Mt});var Lt=typeof globalThis!=="undefined"?globalThis:typeof window!=="undefined"?window:typeof global!=="undefined"?global:typeof self!=="undefined"?self:{};function Bt(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e["default"]:e}function Ot(e,t){return t={exports:{}},e(t,t.exports),t.exports}function Rt(e){return e&&e["default"]||e}var jt={};var Ut=Object.freeze({default:jt});var Vt=Rt(Ut);var Gt=Ot(function(e,t){/* Riot Compiler v4.5.0, @license MIT */(function(e,r){r(t,Vt,Vt)})(Lt,function(e,t,r){t=t&&t.hasOwnProperty("default")?t["default"]:t;r=r&&r.hasOwnProperty("default")?r["default"]:r;const n="exports";const i="css";const s="template";const a="name";function o(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e["default"]:e}function l(e,t){return t={exports:{}},e(t,t.exports),t.exports}function u(e){return e&&e["default"]||e}var c=l(function(e,t){var r=this&&this.__extends||function(){var e=function t(r,n){e=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)if(t.hasOwnProperty(r))e[r]=t[r]};return e(r,n)};return function(t,r){e(t,r);function n(){this.constructor=t}t.prototype=r===null?Object.create(r):(n.prototype=r.prototype,new n)}}();Object.defineProperty(t,"__esModule",{value:true});var n=Object.prototype;var i=n.toString;var s=n.hasOwnProperty;var a=function(){function e(){}e.prototype.assert=function(e,t){if(!this.check(e,t)){var r=d(e);throw new Error(r+" does not match type "+this)}return true};e.prototype.arrayOf=function(){var e=this;return new o(e)};return e}();var o=function(e){r(t,e);function t(t){var r=e.call(this)||this;r.elemType=t;r.kind="ArrayType";return r}t.prototype.toString=function(){return"["+this.elemType+"]"};t.prototype.check=function(e,t){var r=this;return Array.isArray(e)&&e.every(function(e){return r.elemType.check(e,t)})};return t}(a);var l=function(e){r(t,e);function t(t){var r=e.call(this)||this;r.value=t;r.kind="IdentityType";return r}t.prototype.toString=function(){return String(this.value)};t.prototype.check=function(e,t){var r=e===this.value;if(!r&&typeof t==="function"){t(this,e)}return r};return t}(a);var u=function(e){r(t,e);function t(t){var r=e.call(this)||this;r.fields=t;r.kind="ObjectType";return r}t.prototype.toString=function(){return"{ "+this.fields.join(", ")+" }"};t.prototype.check=function(e,t){return i.call(e)===i.call({})&&this.fields.every(function(r){return r.type.check(e[r.name],t)})};return t}(a);var c=function(e){r(t,e);function t(t){var r=e.call(this)||this;r.types=t;r.kind="OrType";return r}t.prototype.toString=function(){return this.types.join(" | ")};t.prototype.check=function(e,t){return this.types.some(function(r){return r.check(e,t)})};return t}(a);var f=function(e){r(t,e);function t(t,r){var n=e.call(this)||this;n.name=t;n.predicate=r;n.kind="PredicateType";return n}t.prototype.toString=function(){return this.name};t.prototype.check=function(e,t){var r=this.predicate(e,t);if(!r&&typeof t==="function"){t(this,e)}return r};return t}(a);var h=function(){function e(e,t){this.type=e;this.typeName=t;this.baseNames=[];this.ownFields=Object.create(null);this.allSupertypes=Object.create(null);this.supertypeList=[];this.allFields=Object.create(null);this.fieldNames=[];this.finalized=false;this.buildable=false;this.buildParams=[]}e.prototype.isSupertypeOf=function(t){if(t instanceof e){if(this.finalized!==true||t.finalized!==true){throw new Error("")}return s.call(t.allSupertypes,this.typeName)}else{throw new Error(t+" is not a Def")}};e.prototype.checkAllFields=function(e,t){var r=this.allFields;if(this.finalized!==true){throw new Error(""+this.typeName)}function n(n){var i=r[n];var s=i.type;var a=i.getValue(e);return s.check(a,t)}return e!==null&&typeof e==="object"&&Object.keys(r).every(n)};e.prototype.bases=function(){var e=[];for(var t=0;t<arguments.length;t++){e[t]=arguments[t]}var r=this.baseNames;if(this.finalized){if(e.length!==r.length){throw new Error("")}for(var n=0;n<e.length;n++){if(e[n]!==r[n]){throw new Error("")}}return this}e.forEach(function(e){if(r.indexOf(e)<0){r.push(e)}});return this};return e}();t.Def=h;var p=function(){function e(e,t,r,n){this.name=e;this.type=t;this.defaultFn=r;this.hidden=!!n}e.prototype.toString=function(){return JSON.stringify(this.name)+": "+this.type};e.prototype.getValue=function(e){var t=e[this.name];if(typeof t!=="undefined"){return t}if(typeof this.defaultFn==="function"){t=this.defaultFn.call(e)}return t};return e}();function d(e){if(Array.isArray(e)){return"["+e.map(d).join(", ")+"]"}if(e&&typeof e==="object"){return"{ "+Object.keys(e).map(function(t){return t+": "+e[t]}).join(", ")+" }"}return JSON.stringify(e)}function m(e){var t={or:function e(){var r=[];for(var n=0;n<arguments.length;n++){r[n]=arguments[n]}return new c(r.map(function(e){return t.from(e)}))},from:function e(r,i){if(r instanceof o||r instanceof l||r instanceof u||r instanceof c||r instanceof f){return r}if(r instanceof h){return r.type}if(x.check(r)){if(r.length!==1){throw new Error("only one element type is permitted for typed arrays")}return new o(t.from(r[0]))}if(E.check(r)){return new u(Object.keys(r).map(function(e){return new p(e,t.from(r[e],e))}))}if(typeof r==="function"){var s=n.indexOf(r);if(s>=0){return a[s]}if(typeof i!=="string"){throw new Error("missing name")}return new f(i,r)}return new l(r)},def:function e(t){return s.call(T,t)?T[t]:T[t]=new _(t)},hasDef:function e(t){return s.call(T,t)}};var n=[];var a=[];var m={};function v(e,t){var r=i.call(e);var s=new f(t,function(e){return i.call(e)===r});m[t]=s;if(e&&typeof e.constructor==="function"){n.push(e.constructor);a.push(s)}return s}var g=v("truthy","string");var y=v(function(){},"function");var x=v([],"array");var E=v({},"object");var b=v(/./,"RegExp");var S=v(new Date,"Date");var D=v(3,"number");var C=v(true,"boolean");var w=v(null,"null");var A=v(void 0,"undefined");var T=Object.create(null);function k(e){if(e&&typeof e==="object"){var t=e.type;if(typeof t==="string"&&s.call(T,t)){var r=T[t];if(r.finalized){return r}}}return null}var _=function(e){r(n,e);function n(t){var r=e.call(this,new f(t,function(e,t){return r.check(e,t)}),t)||this;return r}n.prototype.check=function(e,t){if(this.finalized!==true){throw new Error("prematurely checking unfinalized type "+this.typeName)}if(e===null||typeof e!=="object"){return false}var r=k(e);if(!r){if(this.typeName==="SourceLocation"||this.typeName==="Position"){return this.checkAllFields(e,t)}return false}if(t&&r===this){return this.checkAllFields(e,t)}if(!this.isSupertypeOf(r)){return false}if(!t){return true}return r.checkAllFields(e,t)&&this.checkAllFields(e,false)};n.prototype.build=function(){var e=this;var t=[];for(var r=0;r<arguments.length;r++){t[r]=arguments[r]}this.buildParams=t;if(this.buildable){return this}this.field("type",String,function(){return e.typeName});this.buildable=true;var n=function t(r,n,i,a){if(s.call(r,n))return;var o=e.allFields;if(!s.call(o,n)){throw new Error(""+n)}var l=o[n];var u=l.type;var c;if(a){c=i}else if(l.defaultFn){c=l.defaultFn.call(r)}else{var f="no value or default function given for field "+JSON.stringify(n)+" of "+e.typeName+"("+e.buildParams.map(function(e){return o[e]}).join(", ")+")";throw new Error(f)}if(!u.check(c)){throw new Error(d(c)+" does not match field "+l+" of type "+e.typeName)}r[n]=c};var i=function t(){var r=[];for(var i=0;i<arguments.length;i++){r[i]=arguments[i]}var s=r.length;if(!e.finalized){throw new Error("attempting to instantiate unfinalized type "+e.typeName)}var a=Object.create(M);e.buildParams.forEach(function(e,t){if(t<s){n(a,e,r[t],true)}else{n(a,e,null,false)}});Object.keys(e.allFields).forEach(function(e){n(a,e,null,false)});if(a.type!==e.typeName){throw new Error("")}return a};i.from=function(t){if(!e.finalized){throw new Error("attempting to instantiate unfinalized type "+e.typeName)}var r=Object.create(M);Object.keys(e.allFields).forEach(function(e){if(s.call(t,e)){n(r,e,t[e],true)}else{n(r,e,null,false)}});if(r.type!==e.typeName){throw new Error("")}return r};Object.defineProperty(I,L(this.typeName),{enumerable:true,value:i});return this};n.prototype.field=function(e,r,n,i){if(this.finalized){console.error("Ignoring attempt to redefine field "+JSON.stringify(e)+" of finalized type "+JSON.stringify(this.typeName));return this}this.ownFields[e]=new p(e,t.from(r),n,i);return this};n.prototype.finalize=function(){var e=this;if(!this.finalized){var t=this.allFields;var r=this.allSupertypes;this.baseNames.forEach(function(n){var i=T[n];if(i instanceof h){i.finalize();X(t,i.allFields);X(r,i.allSupertypes)}else{var s="unknown supertype name "+JSON.stringify(n)+" for subtype "+JSON.stringify(e.typeName);throw new Error(s)}});X(t,this.ownFields);r[this.typeName]=this;this.fieldNames.length=0;for(var n in t){if(s.call(t,n)&&!t[n].hidden){this.fieldNames.push(n)}}Object.defineProperty(O,this.typeName,{enumerable:true,value:this.type});this.finalized=true;z(this.typeName,this.supertypeList);if(this.buildable&&this.supertypeList.lastIndexOf("Expression")>=0){G(this.typeName)}}};return n}(h);function P(e){if(!s.call(T,e)){throw new Error("")}var t=T[e];if(t.finalized!==true){throw new Error("")}return t.supertypeList.slice(1)}function F(e){var t={};var r=Object.keys(T);var n=r.length;for(var i=0;i<n;++i){var a=r[i];var o=T[a];if(o.finalized!==true){throw new Error(""+a)}for(var l=0;l<o.supertypeList.length;++l){var u=o.supertypeList[l];if(s.call(e,u)){t[a]=u;break}}}return t}var I=Object.create(null);var M={};function N(e,t){var r=M[e];if(A.check(t)){delete M[e]}else{y.assert(t);Object.defineProperty(M,e,{enumerable:true,configurable:true,value:t})}return r}function L(e){return e.replace(/^[A-Z]+/,function(e){var t=e.length;switch(t){case 0:return"";case 1:return e.toLowerCase();default:return e.slice(0,t-1).toLowerCase()+e.charAt(t-1)}})}function B(e){e=L(e);return e.replace(/(Expression)?$/,"Statement")}var O={};function R(e){var t=k(e);if(t){return t.fieldNames.slice(0)}if("type"in e){throw new Error("did not recognize object of type "+JSON.stringify(e.type))}return Object.keys(e)}function j(e,t){var r=k(e);if(r){var n=r.allFields[t];if(n){return n.getValue(e)}}return e&&e[t]}function U(e,t,r){R(e).forEach(function(r){t.call(this,r,j(e,r))},r)}function V(e,t,r){return R(e).some(function(r){return t.call(this,r,j(e,r))},r)}function G(e){var t=B(e);if(I[t])return;var r=I[L(e)];if(!r)return;var n=function e(){var t=[];for(var n=0;n<arguments.length;n++){t[n]=arguments[n]}return I.expressionStatement(r.apply(I,t))};n.from=function(){var e=[];for(var t=0;t<arguments.length;t++){e[t]=arguments[t]}return I.expressionStatement(r.from.apply(I,e))};I[t]=n}function z(e,t){t.length=0;t.push(e);var r=Object.create(null);for(var n=0;n<t.length;++n){e=t[n];var i=T[e];if(i.finalized!==true){throw new Error("")}if(s.call(r,e)){delete t[r[e]]}r[e]=n;t.push.apply(t,i.baseNames)}for(var a=0,o=a,l=t.length;o<l;++o){if(s.call(t,o)){t[a++]=t[o]}}t.length=a}function X(e,t){Object.keys(t).forEach(function(r){e[r]=t[r]});return e}function J(){Object.keys(T).forEach(function(e){T[e].finalize()})}return{Type:t,builtInTypes:m,getSupertypeNames:P,computeSupertypeLookupTable:F,builders:I,defineMethod:N,getBuilderName:L,getStatementBuilderName:B,namedTypes:O,getFieldNames:R,getFieldValue:j,eachField:U,someField:V,finalize:J}}t.default=m});o(c);var f=c.Def;var h=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=Object.prototype;var s=i.hasOwnProperty;function a(e){var t=e.use(n.default);var r=t.builtInTypes.array;var i=t.builtInTypes.number;var a=function e(t,r,n){if(!(this instanceof e)){throw new Error("Path constructor cannot be invoked without 'new'")}if(r){if(!(r instanceof e)){throw new Error("")}}else{r=null;n=null}this.value=t;this.parentPath=r;this.name=n;this.__childCache=null};var o=a.prototype;function l(e){return e.__childCache||(e.__childCache=Object.create(null))}function u(e,t){var r=l(e);var n=e.getValueProperty(t);var i=r[t];if(!s.call(r,t)||i.value!==n){i=r[t]=new e.constructor(n,e,t)}return i}o.getValueProperty=function e(t){return this.value[t]};o.get=function e(){var t=[];for(var r=0;r<arguments.length;r++){t[r]=arguments[r]}var n=this;var i=t.length;for(var s=0;s<i;++s){n=u(n,t[s])}return n};o.each=function e(t,r){var n=[];var i=this.value.length;var a=0;for(var a=0;a<i;++a){if(s.call(this.value,a)){n[a]=this.get(a)}}r=r||this;for(a=0;a<i;++a){if(s.call(n,a)){t.call(r,n[a])}}};o.map=function e(t,r){var n=[];this.each(function(e){n.push(t.call(this,e))},r);return n};o.filter=function e(t,r){var n=[];this.each(function(e){if(t.call(this,e)){n.push(e)}},r);return n};function c(){}function f(e,t,n,a){r.assert(e.value);if(t===0){return c}var o=e.value.length;if(o<1){return c}var u=arguments.length;if(u===2){n=0;a=o}else if(u===3){n=Math.max(n,0);a=o}else{n=Math.max(n,0);a=Math.min(a,o)}i.assert(n);i.assert(a);var f=Object.create(null);var h=l(e);for(var p=n;p<a;++p){if(s.call(e.value,p)){var d=e.get(p);if(d.name!==p){throw new Error("")}var m=p+t;d.name=m;f[m]=d;delete h[p]}}delete h.length;return function(){for(var t in f){var r=f[t];if(r.name!==+t){throw new Error("")}h[t]=r;e.value[t]=r.value}}}o.shift=function e(){var t=f(this,-1);var r=this.value.shift();t();return r};o.unshift=function e(){var t=[];for(var r=0;r<arguments.length;r++){t[r]=arguments[r]}var n=f(this,t.length);var i=this.value.unshift.apply(this.value,t);n();return i};o.push=function e(){var t=[];for(var n=0;n<arguments.length;n++){t[n]=arguments[n]}r.assert(this.value);delete l(this).length;return this.value.push.apply(this.value,t)};o.pop=function e(){r.assert(this.value);var t=l(this);delete t[this.value.length-1];delete t.length;return this.value.pop()};o.insertAt=function e(t){var r=arguments.length;var n=f(this,r-1,t);if(n===c&&r<=1){return this}t=Math.max(t,0);for(var i=1;i<r;++i){this.value[t+i-1]=arguments[i]}n();return this};o.insertBefore=function e(){var t=[];for(var r=0;r<arguments.length;r++){t[r]=arguments[r]}var n=this.parentPath;var i=t.length;var s=[this.name];for(var a=0;a<i;++a){s.push(t[a])}return n.insertAt.apply(n,s)};o.insertAfter=function e(){var t=[];for(var r=0;r<arguments.length;r++){t[r]=arguments[r]}var n=this.parentPath;var i=t.length;var s=[this.name+1];for(var a=0;a<i;++a){s.push(t[a])}return n.insertAt.apply(n,s)};function h(e){if(!(e instanceof a)){throw new Error("")}var t=e.parentPath;if(!t){return e}var n=t.value;var i=l(t);if(n[e.name]===e.value){i[e.name]=e}else if(r.check(n)){var s=n.indexOf(e.value);if(s>=0){i[e.name=s]=e}}else{n[e.name]=e.value;i[e.name]=e}if(n[e.name]!==e.value){throw new Error("")}if(e.parentPath.get(e.name)!==e){throw new Error("")}return e}o.replace=function e(t){var n=[];var i=this.parentPath.value;var s=l(this.parentPath);var a=arguments.length;h(this);if(r.check(i)){var o=i.length;var u=f(this.parentPath,a-1,this.name+1);var c=[this.name,1];for(var p=0;p<a;++p){c.push(arguments[p])}var d=i.splice.apply(i,c);if(d[0]!==this.value){throw new Error("")}if(i.length!==o-1+a){throw new Error("")}u();if(a===0){delete this.value;delete s[this.name];this.__childCache=null}else{if(i[this.name]!==t){throw new Error("")}if(this.value!==t){this.value=t;this.__childCache=null}for(p=0;p<a;++p){n.push(this.parentPath.get(this.name+p))}if(n[0]!==this){throw new Error("")}}}else if(a===1){if(this.value!==t){this.__childCache=null}this.value=i[this.name]=t;n.push(this)}else if(a===0){delete i[this.name];delete this.value;this.__childCache=null}else{throw new Error("Could not replace path")}return n};return a}t.default=a;e.exports=t["default"]});o(h);var p=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=Object.prototype.hasOwnProperty;function s(e){var t=e.use(n.default);var r=t.Type;var s=t.namedTypes;var a=s.Node;var o=s.Expression;var l=t.builtInTypes.array;var u=t.builders;var c=function e(t,r){if(!(this instanceof e)){throw new Error("Scope constructor cannot be invoked without 'new'")}h.assert(t.value);var n;if(r){if(!(r instanceof e)){throw new Error("")}n=r.depth+1}else{r=null;n=0}Object.defineProperties(this,{path:{value:t},node:{value:t.value},isGlobal:{value:!r,enumerable:true},depth:{value:n},parent:{value:r},bindings:{value:{}},types:{value:{}}})};var f=[s.Program,s.Function,s.CatchClause];var h=r.or.apply(r,f);c.isEstablishedBy=function(e){return h.check(e)};var p=c.prototype;p.didScan=false;p.declares=function(e){this.scan();return i.call(this.bindings,e)};p.declaresType=function(e){this.scan();return i.call(this.types,e)};p.declareTemporary=function(e){if(e){if(!/^[a-z$_]/i.test(e)){throw new Error("")}}else{e="t$"}e+=this.depth.toString(36)+"$";this.scan();var r=0;while(this.declares(e+r)){++r}var n=e+r;return this.bindings[n]=t.builders.identifier(n)};p.injectTemporary=function(e,t){e||(e=this.declareTemporary());var r=this.path.get("body");if(s.BlockStatement.check(r.value)){r=r.get("body")}r.unshift(u.variableDeclaration("var",[u.variableDeclarator(e,t||null)]));return e};p.scan=function(e){if(e||!this.didScan){for(var t in this.bindings){delete this.bindings[t]}d(this.path,this.bindings,this.types);this.didScan=true}};p.getBindings=function(){this.scan();return this.bindings};p.getTypes=function(){this.scan();return this.types};function d(e,t,r){var n=e.value;h.assert(n);if(s.CatchClause.check(n)){y(e.get("param"),t)}else{m(e,t,r)}}function m(e,r,n){var i=e.value;if(e.parent&&s.FunctionExpression.check(e.parent.node)&&e.parent.node.id){y(e.parent.get("id"),r)}if(!i);else if(l.check(i)){e.each(function(e){g(e,r,n)})}else if(s.Function.check(i)){e.get("params").each(function(e){y(e,r)});g(e.get("body"),r,n)}else if(s.TypeAlias&&s.TypeAlias.check(i)||s.InterfaceDeclaration&&s.InterfaceDeclaration.check(i)||s.TSTypeAliasDeclaration&&s.TSTypeAliasDeclaration.check(i)||s.TSInterfaceDeclaration&&s.TSInterfaceDeclaration.check(i)){x(e.get("id"),n)}else if(s.VariableDeclarator.check(i)){y(e.get("id"),r);g(e.get("init"),r,n)}else if(i.type==="ImportSpecifier"||i.type==="ImportNamespaceSpecifier"||i.type==="ImportDefaultSpecifier"){y(e.get(i.local?"local":i.name?"name":"id"),r)}else if(a.check(i)&&!o.check(i)){t.eachField(i,function(t,i){var s=e.get(t);if(!v(s,i)){throw new Error("")}g(s,r,n)})}}function v(e,t){if(e.value===t){return true}if(Array.isArray(e.value)&&e.value.length===0&&Array.isArray(t)&&t.length===0){return true}return false}function g(e,t,r){var n=e.value;if(!n||o.check(n));else if(s.FunctionDeclaration.check(n)&&n.id!==null){y(e.get("id"),t)}else if(s.ClassDeclaration&&s.ClassDeclaration.check(n)){y(e.get("id"),t)}else if(h.check(n)){if(s.CatchClause.check(n)&&s.Identifier.check(n.param)){var a=n.param.name;var l=i.call(t,a);m(e.get("body"),t,r);if(!l){delete t[a]}}}else{m(e,t,r)}}function y(e,t){var r=e.value;s.Pattern.assert(r);if(s.Identifier.check(r)){if(i.call(t,r.name)){t[r.name].push(e)}else{t[r.name]=[e]}}else if(s.AssignmentPattern&&s.AssignmentPattern.check(r)){y(e.get("left"),t)}else if(s.ObjectPattern&&s.ObjectPattern.check(r)){e.get("properties").each(function(e){var r=e.value;if(s.Pattern.check(r)){y(e,t)}else if(s.Property.check(r)){y(e.get("value"),t)}else if(s.SpreadProperty&&s.SpreadProperty.check(r)){y(e.get("argument"),t)}})}else if(s.ArrayPattern&&s.ArrayPattern.check(r)){e.get("elements").each(function(e){var r=e.value;if(s.Pattern.check(r)){y(e,t)}else if(s.SpreadElement&&s.SpreadElement.check(r)){y(e.get("argument"),t)}})}else if(s.PropertyPattern&&s.PropertyPattern.check(r)){y(e.get("pattern"),t)}else if(s.SpreadElementPattern&&s.SpreadElementPattern.check(r)||s.SpreadPropertyPattern&&s.SpreadPropertyPattern.check(r)){y(e.get("argument"),t)}}function x(e,t){var r=e.value;s.Pattern.assert(r);if(s.Identifier.check(r)){if(i.call(t,r.name)){t[r.name].push(e)}else{t[r.name]=[e]}}}p.lookup=function(e){for(var t=this;t;t=t.parent)if(t.declares(e))break;return t};p.lookupType=function(e){for(var t=this;t;t=t.parent)if(t.declaresType(e))break;return t};p.getGlobalScope=function(){var e=this;while(!e.isGlobal)e=e.parent;return e};return c}t.default=s;e.exports=t["default"]});o(p);var d=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(h);var s=r(p);function a(e){var t=e.use(n.default);var r=t.namedTypes;var a=t.builders;var o=t.builtInTypes.number;var l=t.builtInTypes.array;var u=e.use(i.default);var c=e.use(s.default);var f=function e(t,r,n){if(!(this instanceof e)){throw new Error("NodePath constructor cannot be invoked without 'new'")}u.call(this,t,r,n)};var h=f.prototype=Object.create(u.prototype,{constructor:{value:f,enumerable:false,writable:true,configurable:true}});Object.defineProperties(h,{node:{get:function e(){Object.defineProperty(this,"node",{configurable:true,value:this._computeNode()});return this.node}},parent:{get:function e(){Object.defineProperty(this,"parent",{configurable:true,value:this._computeParent()});return this.parent}},scope:{get:function e(){Object.defineProperty(this,"scope",{configurable:true,value:this._computeScope()});return this.scope}}});h.replace=function(){delete this.node;delete this.parent;delete this.scope;return u.prototype.replace.apply(this,arguments)};h.prune=function(){var e=this.parent;this.replace();return g(e)};h._computeNode=function(){var e=this.value;if(r.Node.check(e)){return e}var t=this.parentPath;return t&&t.node||null};h._computeParent=function(){var e=this.value;var t=this.parentPath;if(!r.Node.check(e)){while(t&&!r.Node.check(t.value)){t=t.parentPath}if(t){t=t.parentPath}}while(t&&!r.Node.check(t.value)){t=t.parentPath}return t||null};h._computeScope=function(){var e=this.value;var t=this.parentPath;var n=t&&t.scope;if(r.Node.check(e)&&c.isEstablishedBy(e)){n=new c(this,n)}return n||null};h.getValueProperty=function(e){return t.getFieldValue(this.value,e)};h.needsParens=function(e){var t=this.parentPath;if(!t){return false}var n=this.value;if(!r.Expression.check(n)){return false}if(n.type==="Identifier"){return false}while(!r.Node.check(t.value)){t=t.parentPath;if(!t){return false}}var i=t.value;switch(n.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return i.type==="MemberExpression"&&this.name==="object"&&i.object===n;case"BinaryExpression":case"LogicalExpression":switch(i.type){case"CallExpression":return this.name==="callee"&&i.callee===n;case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return true;case"MemberExpression":return this.name==="object"&&i.object===n;case"BinaryExpression":case"LogicalExpression":{var s=n;var a=i.operator;var l=d[a];var u=s.operator;var c=d[u];if(l>c){return true}if(l===c&&this.name==="right"){if(i.right!==s){throw new Error("Nodes must be equal")}return true}}default:return false}case"SequenceExpression":switch(i.type){case"ForStatement":return false;case"ExpressionStatement":return this.name!=="expression";default:return true}case"YieldExpression":switch(i.type){case"BinaryExpression":case"LogicalExpression":case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"CallExpression":case"MemberExpression":case"NewExpression":case"ConditionalExpression":case"YieldExpression":return true;default:return false}case"Literal":return i.type==="MemberExpression"&&o.check(n.value)&&this.name==="object"&&i.object===n;case"AssignmentExpression":case"ConditionalExpression":switch(i.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"BinaryExpression":case"LogicalExpression":return true;case"CallExpression":return this.name==="callee"&&i.callee===n;case"ConditionalExpression":return this.name==="test"&&i.test===n;case"MemberExpression":return this.name==="object"&&i.object===n;default:return false}default:if(i.type==="NewExpression"&&this.name==="callee"&&i.callee===n){return m(n)}}if(e!==true&&!this.canBeFirstInStatement()&&this.firstInStatement())return true;return false};function p(e){return r.BinaryExpression.check(e)||r.LogicalExpression.check(e)}var d={};[["||"],["&&"],["|"],["^"],["&"],["==","===","!=","!=="],["<",">","<=",">=","in","instanceof"],[">>","<<",">>>"],["+","-"],["*","/","%"]].forEach(function(e,t){e.forEach(function(e){d[e]=t})});function m(e){if(r.CallExpression.check(e)){return true}if(l.check(e)){return e.some(m)}if(r.Node.check(e)){return t.someField(e,function(e,t){return m(t)})}return false}h.canBeFirstInStatement=function(){var e=this.node;return!r.FunctionExpression.check(e)&&!r.ObjectExpression.check(e)};h.firstInStatement=function(){return v(this)};function v(e){for(var t,n;e.parent;e=e.parent){t=e.node;n=e.parent.node;if(r.BlockStatement.check(n)&&e.parent.name==="body"&&e.name===0){if(n.body[0]!==t){throw new Error("Nodes must be equal")}return true}if(r.ExpressionStatement.check(n)&&e.name==="expression"){if(n.expression!==t){throw new Error("Nodes must be equal")}return true}if(r.SequenceExpression.check(n)&&e.parent.name==="expressions"&&e.name===0){if(n.expressions[0]!==t){throw new Error("Nodes must be equal")}continue}if(r.CallExpression.check(n)&&e.name==="callee"){if(n.callee!==t){throw new Error("Nodes must be equal")}continue}if(r.MemberExpression.check(n)&&e.name==="object"){if(n.object!==t){throw new Error("Nodes must be equal")}continue}if(r.ConditionalExpression.check(n)&&e.name==="test"){if(n.test!==t){throw new Error("Nodes must be equal")}continue}if(p(n)&&e.name==="left"){if(n.left!==t){throw new Error("Nodes must be equal")}continue}if(r.UnaryExpression.check(n)&&!n.prefix&&e.name==="argument"){if(n.argument!==t){throw new Error("Nodes must be equal")}continue}return false}return true}function g(e){if(r.VariableDeclaration.check(e.node)){var t=e.get("declarations").value;if(!t||t.length===0){return e.prune()}}else if(r.ExpressionStatement.check(e.node)){if(!e.get("expression").value){return e.prune()}}else if(r.IfStatement.check(e.node)){y(e)}return e}function y(e){var t=e.get("test").value;var n=e.get("alternate").value;var i=e.get("consequent").value;if(!i&&!n){var s=a.expressionStatement(t);e.replace(s)}else if(!i&&n){var o=a.unaryExpression("!",t,true);if(r.UnaryExpression.check(t)&&t.operator==="!"){o=t.argument}e.get("test").replace(o);e.get("consequent").replace(n);e.get("alternate").replace()}}return f}t.default=a;e.exports=t["default"]});o(d);var m=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(d);var s=Object.prototype.hasOwnProperty;function a(e){var t=e.use(n.default);var r=e.use(i.default);var a=t.builtInTypes.array;var o=t.builtInTypes.object;var l=t.builtInTypes.function;var u;var c=function e(){if(!(this instanceof e)){throw new Error("PathVisitor constructor cannot be invoked without 'new'")}this._reusableContextStack=[];this._methodNameTable=f(this);this._shouldVisitComments=s.call(this._methodNameTable,"Block")||s.call(this._methodNameTable,"Line");this.Context=m(this);this._visiting=false;this._changeReported=false};function f(e){var r=Object.create(null);for(var n in e){if(/^visit[A-Z]/.test(n)){r[n.slice("visit".length)]=true}}var i=t.computeSupertypeLookupTable(r);var s=Object.create(null);var a=Object.keys(i);var o=a.length;for(var u=0;u<o;++u){var c=a[u];n="visit"+i[c];if(l.check(e[n])){s[c]=n}}return s}c.fromMethodsObject=function e(t){if(t instanceof c){return t}if(!o.check(t)){return new c}var r=function e(){if(!(this instanceof e)){throw new Error("Visitor constructor cannot be invoked without 'new'")}c.call(this)};var n=r.prototype=Object.create(p);n.constructor=r;h(n,t);h(r,c);l.assert(r.fromMethodsObject);l.assert(r.visit);return new r};function h(e,t){for(var r in t){if(s.call(t,r)){e[r]=t[r]}}return e}c.visit=function e(t,r){return c.fromMethodsObject(r).visit(t)};var p=c.prototype;p.visit=function(){if(this._visiting){throw new Error("Recursively calling visitor.visit(path) resets visitor state. "+"Try this.visit(path) or this.traverse(path) instead.")}this._visiting=true;this._changeReported=false;this._abortRequested=false;var e=arguments.length;var t=new Array(e);for(var n=0;n<e;++n){t[n]=arguments[n]}if(!(t[0]instanceof r)){t[0]=new r({root:t[0]}).get("root")}this.reset.apply(this,t);var i;try{var s=this.visitWithoutReset(t[0]);i=true}finally{this._visiting=false;if(!i&&this._abortRequested){return t[0].value}}return s};p.AbortRequest=function e(){};p.abort=function(){var e=this;e._abortRequested=true;var t=new e.AbortRequest;t.cancel=function(){e._abortRequested=false};throw t};p.reset=function(e){};p.visitWithoutReset=function(e){if(this instanceof this.Context){return this.visitor.visitWithoutReset(e)}if(!(e instanceof r)){throw new Error("")}var t=e.value;var n=t&&typeof t==="object"&&typeof t.type==="string"&&this._methodNameTable[t.type];if(n){var i=this.acquireContext(e);try{return i.invokeVisitorMethod(n)}finally{this.releaseContext(i)}}else{return d(e,this)}};function d(e,n){if(!(e instanceof r)){throw new Error("")}if(!(n instanceof c)){throw new Error("")}var i=e.value;if(a.check(i)){e.each(n.visitWithoutReset,n)}else if(!o.check(i));else{var l=t.getFieldNames(i);if(n._shouldVisitComments&&i.comments&&l.indexOf("comments")<0){l.push("comments")}var u=l.length;var f=[];for(var h=0;h<u;++h){var p=l[h];if(!s.call(i,p)){i[p]=t.getFieldValue(i,p)}f.push(e.get(p))}for(var h=0;h<u;++h){n.visitWithoutReset(f[h])}}return e.value}p.acquireContext=function(e){if(this._reusableContextStack.length===0){return new this.Context(e)}return this._reusableContextStack.pop().reset(e)};p.releaseContext=function(e){if(!(e instanceof this.Context)){throw new Error("")}this._reusableContextStack.push(e);e.currentPath=null};p.reportChanged=function(){this._changeReported=true};p.wasChangeReported=function(){return this._changeReported};function m(e){function t(n){if(!(this instanceof t)){throw new Error("")}if(!(this instanceof c)){throw new Error("")}if(!(n instanceof r)){throw new Error("")}Object.defineProperty(this,"visitor",{value:e,writable:false,enumerable:true,configurable:false});this.currentPath=n;this.needToCallTraverse=true;Object.seal(this)}if(!(e instanceof c)){throw new Error("")}var n=t.prototype=Object.create(e);n.constructor=t;h(n,v);return t}var v=Object.create(null);v.reset=function e(t){if(!(this instanceof this.Context)){throw new Error("")}if(!(t instanceof r)){throw new Error("")}this.currentPath=t;this.needToCallTraverse=true;return this};v.invokeVisitorMethod=function e(t){if(!(this instanceof this.Context)){throw new Error("")}if(!(this.currentPath instanceof r)){throw new Error("")}var n=this.visitor[t].call(this,this.currentPath);if(n===false){this.needToCallTraverse=false}else if(n!==u){this.currentPath=this.currentPath.replace(n)[0];if(this.needToCallTraverse){this.traverse(this.currentPath)}}if(this.needToCallTraverse!==false){throw new Error("Must either call this.traverse or return false in "+t)}var i=this.currentPath;return i&&i.value};v.traverse=function e(t,n){if(!(this instanceof this.Context)){throw new Error("")}if(!(t instanceof r)){throw new Error("")}if(!(this.currentPath instanceof r)){throw new Error("")}this.needToCallTraverse=false;return d(t,c.fromMethodsObject(n||this.visitor))};v.visit=function e(t,n){if(!(this instanceof this.Context)){throw new Error("")}if(!(t instanceof r)){throw new Error("")}if(!(this.currentPath instanceof r)){throw new Error("")}this.needToCallTraverse=false;return c.fromMethodsObject(n||this.visitor).visitWithoutReset(t)};v.reportChanged=function e(){this.visitor.reportChanged()};v.abort=function e(){this.needToCallTraverse=false;this.visitor.abort()};return c}t.default=a;e.exports=t["default"]});o(m);var v=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);function i(e){var t=e.use(n.default);var r=t.getFieldNames;var i=t.getFieldValue;var s=t.builtInTypes.array;var a=t.builtInTypes.object;var o=t.builtInTypes.Date;var l=t.builtInTypes.RegExp;var u=Object.prototype.hasOwnProperty;function c(e,t,r){if(s.check(r)){r.length=0}else{r=null}return h(e,t,r)}c.assert=function(e,t){var r=[];if(!c(e,t,r)){if(r.length===0){if(e!==t){throw new Error("Nodes must be equal")}}else{throw new Error("Nodes differ in the following path: "+r.map(f).join(""))}}};function f(e){if(/[_$a-z][_$a-z0-9]*/i.test(e)){return"."+e}return"["+JSON.stringify(e)+"]"}function h(e,t,r){if(e===t){return true}if(s.check(e)){return p(e,t,r)}if(a.check(e)){return d(e,t,r)}if(o.check(e)){return o.check(t)&&+e===+t}if(l.check(e)){return l.check(t)&&e.source===t.source&&e.global===t.global&&e.multiline===t.multiline&&e.ignoreCase===t.ignoreCase}return e==t}function p(e,t,r){s.assert(e);var n=e.length;if(!s.check(t)||t.length!==n){if(r){r.push("length")}return false}for(var i=0;i<n;++i){if(r){r.push(i)}if(i in e!==i in t){return false}if(!h(e[i],t[i],r)){return false}if(r){var a=r.pop();if(a!==i){throw new Error(""+a)}}}return true}function d(e,t,n){a.assert(e);if(!a.check(t)){return false}if(e.type!==t.type){if(n){n.push("type")}return false}var s=r(e);var o=s.length;var l=r(t);var c=l.length;if(o===c){for(var f=0;f<o;++f){var p=s[f];var d=i(e,p);var m=i(t,p);if(n){n.push(p)}if(!h(d,m,n)){return false}if(n){var v=n.pop();if(v!==p){throw new Error(""+v)}}}return true}if(!n){return false}var g=Object.create(null);for(f=0;f<o;++f){g[s[f]]=true}for(f=0;f<c;++f){p=l[f];if(!u.call(g,p)){n.push(p);return false}delete g[p]}for(p in g){n.push(p);break}return false}return c}t.default=i;e.exports=t["default"]});o(v);var g=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(m);var s=r(v);var a=r(h);var o=r(d);function l(e){var t=u();var r=t.use(n.default);e.forEach(t.use);r.finalize();var l=t.use(i.default);return{Type:r.Type,builtInTypes:r.builtInTypes,namedTypes:r.namedTypes,builders:r.builders,defineMethod:r.defineMethod,getFieldNames:r.getFieldNames,getFieldValue:r.getFieldValue,eachField:r.eachField,someField:r.someField,getSupertypeNames:r.getSupertypeNames,getBuilderName:r.getBuilderName,astNodesAreEquivalent:t.use(s.default),finalize:r.finalize,Path:t.use(a.default),NodePath:t.use(o.default),PathVisitor:l,use:t.use,visit:l.visit}}t.default=l;function u(){var e=[];var t=[];function r(r){var i=e.indexOf(r);if(i===-1){i=e.length;e.push(r);t[i]=r(n)}return t[i]}var n={use:r};return n}e.exports=t["default"]});o(g);var y=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);function i(e){var t=e.use(n.default);var r=t.Type;var i=t.builtInTypes;var s=i.number;function a(e){return r.from(function(t){return s.check(t)&&t>=e},s+" >= "+e)}var o={null:function e(){return null},emptyArray:function e(){return[]},false:function e(){return false},true:function e(){return true},undefined:function e(){},"use strict":function e(){return"use strict"}};var l=r.or(i.string,i.number,i.boolean,i.null,i.undefined);var u=r.from(function(e){if(e===null)return true;var t=typeof e;if(t==="object"||t==="function"){return false}return true},l.toString());return{geq:a,defaults:o,isPrimitive:u}}t.default=i;e.exports=t["default"]});o(y);var x=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(y);function s(e){var t=e.use(n.default);var r=t.Type;var s=r.def;var a=r.or;var o=e.use(i.default);var l=o.defaults;var u=o.geq;s("Printable").field("loc",a(s("SourceLocation"),null),l["null"],true);s("Node").bases("Printable").field("type",String).field("comments",a([s("Comment")],null),l["null"],true);s("SourceLocation").field("start",s("Position")).field("end",s("Position")).field("source",a(String,null),l["null"]);s("Position").field("line",u(1)).field("column",u(0));s("File").bases("Node").build("program","name").field("program",s("Program")).field("name",a(String,null),l["null"]);s("Program").bases("Node").build("body").field("body",[s("Statement")]);s("Function").bases("Node").field("id",a(s("Identifier"),null),l["null"]).field("params",[s("Pattern")]).field("body",s("BlockStatement")).field("generator",Boolean,l["false"]).field("async",Boolean,l["false"]);s("Statement").bases("Node");s("EmptyStatement").bases("Statement").build();s("BlockStatement").bases("Statement").build("body").field("body",[s("Statement")]);s("ExpressionStatement").bases("Statement").build("expression").field("expression",s("Expression"));s("IfStatement").bases("Statement").build("test","consequent","alternate").field("test",s("Expression")).field("consequent",s("Statement")).field("alternate",a(s("Statement"),null),l["null"]);s("LabeledStatement").bases("Statement").build("label","body").field("label",s("Identifier")).field("body",s("Statement"));s("BreakStatement").bases("Statement").build("label").field("label",a(s("Identifier"),null),l["null"]);s("ContinueStatement").bases("Statement").build("label").field("label",a(s("Identifier"),null),l["null"]);s("WithStatement").bases("Statement").build("object","body").field("object",s("Expression")).field("body",s("Statement"));s("SwitchStatement").bases("Statement").build("discriminant","cases","lexical").field("discriminant",s("Expression")).field("cases",[s("SwitchCase")]).field("lexical",Boolean,l["false"]);s("ReturnStatement").bases("Statement").build("argument").field("argument",a(s("Expression"),null));s("ThrowStatement").bases("Statement").build("argument").field("argument",s("Expression"));s("TryStatement").bases("Statement").build("block","handler","finalizer").field("block",s("BlockStatement")).field("handler",a(s("CatchClause"),null),function(){return this.handlers&&this.handlers[0]||null}).field("handlers",[s("CatchClause")],function(){return this.handler?[this.handler]:[]},true).field("guardedHandlers",[s("CatchClause")],l.emptyArray).field("finalizer",a(s("BlockStatement"),null),l["null"]);s("CatchClause").bases("Node").build("param","guard","body").field("param",a(s("Pattern"),null),l["null"]).field("guard",a(s("Expression"),null),l["null"]).field("body",s("BlockStatement"));s("WhileStatement").bases("Statement").build("test","body").field("test",s("Expression")).field("body",s("Statement"));s("DoWhileStatement").bases("Statement").build("body","test").field("body",s("Statement")).field("test",s("Expression"));s("ForStatement").bases("Statement").build("init","test","update","body").field("init",a(s("VariableDeclaration"),s("Expression"),null)).field("test",a(s("Expression"),null)).field("update",a(s("Expression"),null)).field("body",s("Statement"));s("ForInStatement").bases("Statement").build("left","right","body").field("left",a(s("VariableDeclaration"),s("Expression"))).field("right",s("Expression")).field("body",s("Statement"));s("DebuggerStatement").bases("Statement").build();s("Declaration").bases("Statement");s("FunctionDeclaration").bases("Function","Declaration").build("id","params","body").field("id",s("Identifier"));s("FunctionExpression").bases("Function","Expression").build("id","params","body");s("VariableDeclaration").bases("Declaration").build("kind","declarations").field("kind",a("var","let","const")).field("declarations",[s("VariableDeclarator")]);s("VariableDeclarator").bases("Node").build("id","init").field("id",s("Pattern")).field("init",a(s("Expression"),null),l["null"]);s("Expression").bases("Node");s("ThisExpression").bases("Expression").build();s("ArrayExpression").bases("Expression").build("elements").field("elements",[a(s("Expression"),null)]);s("ObjectExpression").bases("Expression").build("properties").field("properties",[s("Property")]);s("Property").bases("Node").build("kind","key","value").field("kind",a("init","get","set")).field("key",a(s("Literal"),s("Identifier"))).field("value",s("Expression"));s("SequenceExpression").bases("Expression").build("expressions").field("expressions",[s("Expression")]);var c=a("-","+","!","~","typeof","void","delete");s("UnaryExpression").bases("Expression").build("operator","argument","prefix").field("operator",c).field("argument",s("Expression")).field("prefix",Boolean,l["true"]);var f=a("==","!=","===","!==","<","<=",">",">=","<<",">>",">>>","+","-","*","/","%","**","&","|","^","in","instanceof");s("BinaryExpression").bases("Expression").build("operator","left","right").field("operator",f).field("left",s("Expression")).field("right",s("Expression"));var h=a("=","+=","-=","*=","/=","%=","<<=",">>=",">>>=","|=","^=","&=");s("AssignmentExpression").bases("Expression").build("operator","left","right").field("operator",h).field("left",a(s("Pattern"),s("MemberExpression"))).field("right",s("Expression"));var p=a("++","--");s("UpdateExpression").bases("Expression").build("operator","argument","prefix").field("operator",p).field("argument",s("Expression")).field("prefix",Boolean);var d=a("||","&&");s("LogicalExpression").bases("Expression").build("operator","left","right").field("operator",d).field("left",s("Expression")).field("right",s("Expression"));s("ConditionalExpression").bases("Expression").build("test","consequent","alternate").field("test",s("Expression")).field("consequent",s("Expression")).field("alternate",s("Expression"));s("NewExpression").bases("Expression").build("callee","arguments").field("callee",s("Expression")).field("arguments",[s("Expression")]);s("CallExpression").bases("Expression").build("callee","arguments").field("callee",s("Expression")).field("arguments",[s("Expression")]);s("MemberExpression").bases("Expression").build("object","property","computed").field("object",s("Expression")).field("property",a(s("Identifier"),s("Expression"))).field("computed",Boolean,function(){var e=this.property.type;if(e==="Literal"||e==="MemberExpression"||e==="BinaryExpression"){return true}return false});s("Pattern").bases("Node");s("SwitchCase").bases("Node").build("test","consequent").field("test",a(s("Expression"),null)).field("consequent",[s("Statement")]);s("Identifier").bases("Expression","Pattern").build("name").field("name",String).field("optional",Boolean,l["false"]);s("Literal").bases("Expression").build("value").field("value",a(String,Boolean,null,Number,RegExp)).field("regex",a({pattern:String,flags:String},null),function(){if(this.value instanceof RegExp){var e="";if(this.value.ignoreCase)e+="i";if(this.value.multiline)e+="m";if(this.value.global)e+="g";return{pattern:this.value.source,flags:e}}return null});s("Comment").bases("Printable").field("value",String).field("leading",Boolean,l["true"]).field("trailing",Boolean,l["false"])}t.default=s;e.exports=t["default"]});o(x);var E=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(x);var i=r(c);var s=r(y);function a(e){e.use(n.default);var t=e.use(i.default);var r=t.Type.def;var a=t.Type.or;var o=e.use(s.default).defaults;r("Function").field("generator",Boolean,o["false"]).field("expression",Boolean,o["false"]).field("defaults",[a(r("Expression"),null)],o.emptyArray).field("rest",a(r("Identifier"),null),o["null"]);r("RestElement").bases("Pattern").build("argument").field("argument",r("Pattern")).field("typeAnnotation",a(r("TypeAnnotation"),r("TSTypeAnnotation"),null),o["null"]);r("SpreadElementPattern").bases("Pattern").build("argument").field("argument",r("Pattern"));r("FunctionDeclaration").build("id","params","body","generator","expression");r("FunctionExpression").build("id","params","body","generator","expression");r("ArrowFunctionExpression").bases("Function","Expression").build("params","body","expression").field("id",null,o["null"]).field("body",a(r("BlockStatement"),r("Expression"))).field("generator",false,o["false"]);r("ForOfStatement").bases("Statement").build("left","right","body").field("left",a(r("VariableDeclaration"),r("Pattern"))).field("right",r("Expression")).field("body",r("Statement"));r("YieldExpression").bases("Expression").build("argument","delegate").field("argument",a(r("Expression"),null)).field("delegate",Boolean,o["false"]);r("GeneratorExpression").bases("Expression").build("body","blocks","filter").field("body",r("Expression")).field("blocks",[r("ComprehensionBlock")]).field("filter",a(r("Expression"),null));r("ComprehensionExpression").bases("Expression").build("body","blocks","filter").field("body",r("Expression")).field("blocks",[r("ComprehensionBlock")]).field("filter",a(r("Expression"),null));r("ComprehensionBlock").bases("Node").build("left","right","each").field("left",r("Pattern")).field("right",r("Expression")).field("each",Boolean);r("Property").field("key",a(r("Literal"),r("Identifier"),r("Expression"))).field("value",a(r("Expression"),r("Pattern"))).field("method",Boolean,o["false"]).field("shorthand",Boolean,o["false"]).field("computed",Boolean,o["false"]);r("ObjectProperty").field("shorthand",Boolean,o["false"]);r("PropertyPattern").bases("Pattern").build("key","pattern").field("key",a(r("Literal"),r("Identifier"),r("Expression"))).field("pattern",r("Pattern")).field("computed",Boolean,o["false"]);r("ObjectPattern").bases("Pattern").build("properties").field("properties",[a(r("PropertyPattern"),r("Property"))]);r("ArrayPattern").bases("Pattern").build("elements").field("elements",[a(r("Pattern"),null)]);r("MethodDefinition").bases("Declaration").build("kind","key","value","static").field("kind",a("constructor","method","get","set")).field("key",r("Expression")).field("value",r("Function")).field("computed",Boolean,o["false"]).field("static",Boolean,o["false"]);r("SpreadElement").bases("Node").build("argument").field("argument",r("Expression"));r("ArrayExpression").field("elements",[a(r("Expression"),r("SpreadElement"),r("RestElement"),null)]);r("NewExpression").field("arguments",[a(r("Expression"),r("SpreadElement"))]);r("CallExpression").field("arguments",[a(r("Expression"),r("SpreadElement"))]);r("AssignmentPattern").bases("Pattern").build("left","right").field("left",r("Pattern")).field("right",r("Expression"));var l=a(r("MethodDefinition"),r("VariableDeclarator"),r("ClassPropertyDefinition"),r("ClassProperty"));r("ClassProperty").bases("Declaration").build("key").field("key",a(r("Literal"),r("Identifier"),r("Expression"))).field("computed",Boolean,o["false"]);r("ClassPropertyDefinition").bases("Declaration").build("definition").field("definition",l);r("ClassBody").bases("Declaration").build("body").field("body",[l]);r("ClassDeclaration").bases("Declaration").build("id","body","superClass").field("id",a(r("Identifier"),null)).field("body",r("ClassBody")).field("superClass",a(r("Expression"),null),o["null"]);r("ClassExpression").bases("Expression").build("id","body","superClass").field("id",a(r("Identifier"),null),o["null"]).field("body",r("ClassBody")).field("superClass",a(r("Expression"),null),o["null"]);r("Specifier").bases("Node");r("ModuleSpecifier").bases("Specifier").field("local",a(r("Identifier"),null),o["null"]).field("id",a(r("Identifier"),null),o["null"]).field("name",a(r("Identifier"),null),o["null"]);r("ImportSpecifier").bases("ModuleSpecifier").build("id","name");r("ImportNamespaceSpecifier").bases("ModuleSpecifier").build("id");r("ImportDefaultSpecifier").bases("ModuleSpecifier").build("id");r("ImportDeclaration").bases("Declaration").build("specifiers","source","importKind").field("specifiers",[a(r("ImportSpecifier"),r("ImportNamespaceSpecifier"),r("ImportDefaultSpecifier"))],o.emptyArray).field("source",r("Literal")).field("importKind",a("value","type"),function(){return"value"});r("TaggedTemplateExpression").bases("Expression").build("tag","quasi").field("tag",r("Expression")).field("quasi",r("TemplateLiteral"));r("TemplateLiteral").bases("Expression").build("quasis","expressions").field("quasis",[r("TemplateElement")]).field("expressions",[r("Expression")]);r("TemplateElement").bases("Node").build("value","tail").field("value",{cooked:String,raw:String}).field("tail",Boolean)}t.default=a;e.exports=t["default"]});o(E);var b=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(E);var i=r(c);var s=r(y);function a(e){e.use(n.default);var t=e.use(i.default);var r=t.Type.def;var a=t.Type.or;var o=e.use(s.default).defaults;r("Function").field("async",Boolean,o["false"]);r("SpreadProperty").bases("Node").build("argument").field("argument",r("Expression"));r("ObjectExpression").field("properties",[a(r("Property"),r("SpreadProperty"),r("SpreadElement"))]);r("SpreadPropertyPattern").bases("Pattern").build("argument").field("argument",r("Pattern"));r("ObjectPattern").field("properties",[a(r("Property"),r("PropertyPattern"),r("SpreadPropertyPattern"))]);r("AwaitExpression").bases("Expression").build("argument","all").field("argument",a(r("Expression"),null)).field("all",Boolean,o["false"])}t.default=a;e.exports=t["default"]});o(b);var S=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(b);var i=r(c);var s=r(y);function a(e){e.use(n.default);var t=e.use(i.default);var r=t.Type.def;var a=t.Type.or;var o=e.use(s.default).defaults;r("JSXAttribute").bases("Node").build("name","value").field("name",a(r("JSXIdentifier"),r("JSXNamespacedName"))).field("value",a(r("Literal"),r("JSXExpressionContainer"),null),o["null"]);r("JSXIdentifier").bases("Identifier").build("name").field("name",String);r("JSXNamespacedName").bases("Node").build("namespace","name").field("namespace",r("JSXIdentifier")).field("name",r("JSXIdentifier"));r("JSXMemberExpression").bases("MemberExpression").build("object","property").field("object",a(r("JSXIdentifier"),r("JSXMemberExpression"))).field("property",r("JSXIdentifier")).field("computed",Boolean,o.false);var l=a(r("JSXIdentifier"),r("JSXNamespacedName"),r("JSXMemberExpression"));r("JSXSpreadAttribute").bases("Node").build("argument").field("argument",r("Expression"));var u=[a(r("JSXAttribute"),r("JSXSpreadAttribute"))];r("JSXExpressionContainer").bases("Expression").build("expression").field("expression",r("Expression"));r("JSXElement").bases("Expression").build("openingElement","closingElement","children").field("openingElement",r("JSXOpeningElement")).field("closingElement",a(r("JSXClosingElement"),null),o["null"]).field("children",[a(r("JSXElement"),r("JSXExpressionContainer"),r("JSXFragment"),r("JSXText"),r("Literal"))],o.emptyArray).field("name",l,function(){return this.openingElement.name},true).field("selfClosing",Boolean,function(){return this.openingElement.selfClosing},true).field("attributes",u,function(){return this.openingElement.attributes},true);r("JSXOpeningElement").bases("Node").build("name","attributes","selfClosing").field("name",l).field("attributes",u,o.emptyArray).field("selfClosing",Boolean,o["false"]);r("JSXClosingElement").bases("Node").build("name").field("name",l);r("JSXFragment").bases("Expression").build("openingElement","closingElement","children").field("openingElement",r("JSXOpeningFragment")).field("closingElement",r("JSXClosingFragment")).field("children",[a(r("JSXElement"),r("JSXExpressionContainer"),r("JSXFragment"),r("JSXText"),r("Literal"))],o.emptyArray);r("JSXOpeningFragment").bases("Node").build();r("JSXClosingFragment").bases("Node").build();r("JSXText").bases("Literal").build("value").field("value",String);r("JSXEmptyExpression").bases("Expression").build();r("JSXSpreadChild").bases("Expression").build("expression").field("expression",r("Expression"))}t.default=a;e.exports=t["default"]});o(S);var D=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(y);function s(e){var t=e.use(n.default);var r=t.Type.def;var s=t.Type.or;var a=e.use(i.default).defaults;var o=s(r("TypeAnnotation"),r("TSTypeAnnotation"),null);var l=s(r("TypeParameterDeclaration"),r("TSTypeParameterDeclaration"),null);r("Identifier").field("typeAnnotation",o,a["null"]);r("ObjectPattern").field("typeAnnotation",o,a["null"]);r("Function").field("returnType",o,a["null"]).field("typeParameters",l,a["null"]);r("ClassProperty").build("key","value","typeAnnotation","static").field("value",s(r("Expression"),null)).field("static",Boolean,a["false"]).field("typeAnnotation",o,a["null"]);["ClassDeclaration","ClassExpression"].forEach(function(e){r(e).field("typeParameters",l,a["null"]).field("superTypeParameters",s(r("TypeParameterInstantiation"),r("TSTypeParameterInstantiation"),null),a["null"]).field("implements",s([r("ClassImplements")],[r("TSExpressionWithTypeArguments")]),a.emptyArray)})}t.default=s;e.exports=t["default"]});o(D);var C=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(b);var i=r(D);var s=r(c);var a=r(y);function o(e){e.use(n.default);e.use(i.default);var t=e.use(s.default);var r=t.Type.def;var o=t.Type.or;var l=e.use(a.default).defaults;r("Flow").bases("Node");r("FlowType").bases("Flow");r("AnyTypeAnnotation").bases("FlowType").build();r("EmptyTypeAnnotation").bases("FlowType").build();r("MixedTypeAnnotation").bases("FlowType").build();r("VoidTypeAnnotation").bases("FlowType").build();r("NumberTypeAnnotation").bases("FlowType").build();r("NumberLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Number).field("raw",String);r("NumericLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Number).field("raw",String);r("StringTypeAnnotation").bases("FlowType").build();r("StringLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",String).field("raw",String);r("BooleanTypeAnnotation").bases("FlowType").build();r("BooleanLiteralTypeAnnotation").bases("FlowType").build("value","raw").field("value",Boolean).field("raw",String);r("TypeAnnotation").bases("Node").build("typeAnnotation").field("typeAnnotation",r("FlowType"));r("NullableTypeAnnotation").bases("FlowType").build("typeAnnotation").field("typeAnnotation",r("FlowType"));r("NullLiteralTypeAnnotation").bases("FlowType").build();r("NullTypeAnnotation").bases("FlowType").build();r("ThisTypeAnnotation").bases("FlowType").build();r("ExistsTypeAnnotation").bases("FlowType").build();r("ExistentialTypeParam").bases("FlowType").build();r("FunctionTypeAnnotation").bases("FlowType").build("params","returnType","rest","typeParameters").field("params",[r("FunctionTypeParam")]).field("returnType",r("FlowType")).field("rest",o(r("FunctionTypeParam"),null)).field("typeParameters",o(r("TypeParameterDeclaration"),null));r("FunctionTypeParam").bases("Node").build("name","typeAnnotation","optional").field("name",r("Identifier")).field("typeAnnotation",r("FlowType")).field("optional",Boolean);r("ArrayTypeAnnotation").bases("FlowType").build("elementType").field("elementType",r("FlowType"));r("ObjectTypeAnnotation").bases("FlowType").build("properties","indexers","callProperties").field("properties",[o(r("ObjectTypeProperty"),r("ObjectTypeSpreadProperty"))]).field("indexers",[r("ObjectTypeIndexer")],l.emptyArray).field("callProperties",[r("ObjectTypeCallProperty")],l.emptyArray).field("inexact",o(Boolean,void 0),l["undefined"]).field("exact",Boolean,l["false"]).field("internalSlots",[r("ObjectTypeInternalSlot")],l.emptyArray);r("Variance").bases("Node").build("kind").field("kind",o("plus","minus"));var u=o(r("Variance"),"plus","minus",null);r("ObjectTypeProperty").bases("Node").build("key","value","optional").field("key",o(r("Literal"),r("Identifier"))).field("value",r("FlowType")).field("optional",Boolean).field("variance",u,l["null"]);r("ObjectTypeIndexer").bases("Node").build("id","key","value").field("id",r("Identifier")).field("key",r("FlowType")).field("value",r("FlowType")).field("variance",u,l["null"]);r("ObjectTypeCallProperty").bases("Node").build("value").field("value",r("FunctionTypeAnnotation")).field("static",Boolean,l["false"]);r("QualifiedTypeIdentifier").bases("Node").build("qualification","id").field("qualification",o(r("Identifier"),r("QualifiedTypeIdentifier"))).field("id",r("Identifier"));r("GenericTypeAnnotation").bases("FlowType").build("id","typeParameters").field("id",o(r("Identifier"),r("QualifiedTypeIdentifier"))).field("typeParameters",o(r("TypeParameterInstantiation"),null));r("MemberTypeAnnotation").bases("FlowType").build("object","property").field("object",r("Identifier")).field("property",o(r("MemberTypeAnnotation"),r("GenericTypeAnnotation")));r("UnionTypeAnnotation").bases("FlowType").build("types").field("types",[r("FlowType")]);r("IntersectionTypeAnnotation").bases("FlowType").build("types").field("types",[r("FlowType")]);r("TypeofTypeAnnotation").bases("FlowType").build("argument").field("argument",r("FlowType"));r("ObjectTypeSpreadProperty").bases("Node").build("argument").field("argument",r("FlowType"));r("ObjectTypeInternalSlot").bases("Node").build("id","value","optional","static","method").field("id",r("Identifier")).field("value",r("FlowType")).field("optional",Boolean).field("static",Boolean).field("method",Boolean);r("TypeParameterDeclaration").bases("Node").build("params").field("params",[r("TypeParameter")]);r("TypeParameterInstantiation").bases("Node").build("params").field("params",[r("FlowType")]);r("TypeParameter").bases("FlowType").build("name","variance","bound").field("name",String).field("variance",u,l["null"]).field("bound",o(r("TypeAnnotation"),null),l["null"]);r("ClassProperty").field("variance",u,l["null"]);r("ClassImplements").bases("Node").build("id").field("id",r("Identifier")).field("superClass",o(r("Expression"),null),l["null"]).field("typeParameters",o(r("TypeParameterInstantiation"),null),l["null"]);r("InterfaceTypeAnnotation").bases("FlowType").build("body","extends").field("body",r("ObjectTypeAnnotation")).field("extends",o([r("InterfaceExtends")],null),l["null"]);r("InterfaceDeclaration").bases("Declaration").build("id","body","extends").field("id",r("Identifier")).field("typeParameters",o(r("TypeParameterDeclaration"),null),l["null"]).field("body",r("ObjectTypeAnnotation")).field("extends",[r("InterfaceExtends")]);r("DeclareInterface").bases("InterfaceDeclaration").build("id","body","extends");r("InterfaceExtends").bases("Node").build("id").field("id",r("Identifier")).field("typeParameters",o(r("TypeParameterInstantiation"),null),l["null"]);r("TypeAlias").bases("Declaration").build("id","typeParameters","right").field("id",r("Identifier")).field("typeParameters",o(r("TypeParameterDeclaration"),null)).field("right",r("FlowType"));r("OpaqueType").bases("Declaration").build("id","typeParameters","impltype","supertype").field("id",r("Identifier")).field("typeParameters",o(r("TypeParameterDeclaration"),null)).field("impltype",r("FlowType")).field("supertype",r("FlowType"));r("DeclareTypeAlias").bases("TypeAlias").build("id","typeParameters","right");r("DeclareOpaqueType").bases("TypeAlias").build("id","typeParameters","supertype");r("TypeCastExpression").bases("Expression").build("expression","typeAnnotation").field("expression",r("Expression")).field("typeAnnotation",r("TypeAnnotation"));r("TupleTypeAnnotation").bases("FlowType").build("types").field("types",[r("FlowType")]);r("DeclareVariable").bases("Statement").build("id").field("id",r("Identifier"));r("DeclareFunction").bases("Statement").build("id").field("id",r("Identifier"));r("DeclareClass").bases("InterfaceDeclaration").build("id");r("DeclareModule").bases("Statement").build("id","body").field("id",o(r("Identifier"),r("Literal"))).field("body",r("BlockStatement"));r("DeclareModuleExports").bases("Statement").build("typeAnnotation").field("typeAnnotation",r("TypeAnnotation"));r("DeclareExportDeclaration").bases("Declaration").build("default","declaration","specifiers","source").field("default",Boolean).field("declaration",o(r("DeclareVariable"),r("DeclareFunction"),r("DeclareClass"),r("FlowType"),null)).field("specifiers",[o(r("ExportSpecifier"),r("ExportBatchSpecifier"))],l.emptyArray).field("source",o(r("Literal"),null),l["null"]);r("DeclareExportAllDeclaration").bases("Declaration").build("source").field("source",o(r("Literal"),null),l["null"]);r("FlowPredicate").bases("Flow");r("InferredPredicate").bases("FlowPredicate").build();r("DeclaredPredicate").bases("FlowPredicate").build("value").field("value",r("Expression"));r("CallExpression").field("typeArguments",o(null,r("TypeParameterInstantiation")),l["null"]);r("NewExpression").field("typeArguments",o(null,r("TypeParameterInstantiation")),l["null"])}t.default=o;e.exports=t["default"]});o(C);var w=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(b);var i=r(c);var s=r(y);function a(e){e.use(n.default);var t=e.use(i.default);var r=e.use(s.default).defaults;var a=t.Type.def;var o=t.Type.or;a("VariableDeclaration").field("declarations",[o(a("VariableDeclarator"),a("Identifier"))]);a("Property").field("value",o(a("Expression"),a("Pattern")));a("ArrayPattern").field("elements",[o(a("Pattern"),a("SpreadElement"),null)]);a("ObjectPattern").field("properties",[o(a("Property"),a("PropertyPattern"),a("SpreadPropertyPattern"),a("SpreadProperty"))]);a("ExportSpecifier").bases("ModuleSpecifier").build("id","name");a("ExportBatchSpecifier").bases("Specifier").build();a("ExportDeclaration").bases("Declaration").build("default","declaration","specifiers","source").field("default",Boolean).field("declaration",o(a("Declaration"),a("Expression"),null)).field("specifiers",[o(a("ExportSpecifier"),a("ExportBatchSpecifier"))],r.emptyArray).field("source",o(a("Literal"),null),r["null"]);a("Block").bases("Comment").build("value","leading","trailing");a("Line").bases("Comment").build("value","leading","trailing")}t.default=a;e.exports=t["default"]});o(w);var A=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(y);var s=r(b);function a(e){e.use(s.default);var t=e.use(n.default);var r=e.use(i.default).defaults;var a=t.Type.def;var o=t.Type.or;a("Noop").bases("Statement").build();a("DoExpression").bases("Expression").build("body").field("body",[a("Statement")]);a("Super").bases("Expression").build();a("BindExpression").bases("Expression").build("object","callee").field("object",o(a("Expression"),null)).field("callee",a("Expression"));a("Decorator").bases("Node").build("expression").field("expression",a("Expression"));a("Property").field("decorators",o([a("Decorator")],null),r["null"]);a("MethodDefinition").field("decorators",o([a("Decorator")],null),r["null"]);a("MetaProperty").bases("Expression").build("meta","property").field("meta",a("Identifier")).field("property",a("Identifier"));a("ParenthesizedExpression").bases("Expression").build("expression").field("expression",a("Expression"));a("ImportSpecifier").bases("ModuleSpecifier").build("imported","local").field("imported",a("Identifier"));a("ImportDefaultSpecifier").bases("ModuleSpecifier").build("local");a("ImportNamespaceSpecifier").bases("ModuleSpecifier").build("local");a("ExportDefaultDeclaration").bases("Declaration").build("declaration").field("declaration",o(a("Declaration"),a("Expression")));a("ExportNamedDeclaration").bases("Declaration").build("declaration","specifiers","source").field("declaration",o(a("Declaration"),null)).field("specifiers",[a("ExportSpecifier")],r.emptyArray).field("source",o(a("Literal"),null),r["null"]);a("ExportSpecifier").bases("ModuleSpecifier").build("local","exported").field("exported",a("Identifier"));a("ExportNamespaceSpecifier").bases("Specifier").build("exported").field("exported",a("Identifier"));a("ExportDefaultSpecifier").bases("Specifier").build("exported").field("exported",a("Identifier"));a("ExportAllDeclaration").bases("Declaration").build("exported","source").field("exported",o(a("Identifier"),null)).field("source",a("Literal"));a("CommentBlock").bases("Comment").build("value","leading","trailing");a("CommentLine").bases("Comment").build("value","leading","trailing");a("Directive").bases("Node").build("value").field("value",a("DirectiveLiteral"));a("DirectiveLiteral").bases("Node","Expression").build("value").field("value",String,r["use strict"]);a("InterpreterDirective").bases("Node").build("value").field("value",String);a("BlockStatement").bases("Statement").build("body").field("body",[a("Statement")]).field("directives",[a("Directive")],r.emptyArray);a("Program").bases("Node").build("body").field("body",[a("Statement")]).field("directives",[a("Directive")],r.emptyArray).field("interpreter",o(a("InterpreterDirective"),null),r["null"]);a("StringLiteral").bases("Literal").build("value").field("value",String);a("NumericLiteral").bases("Literal").build("value").field("value",Number).field("raw",o(String,null),r["null"]).field("extra",{rawValue:Number,raw:String},function e(){return{rawValue:this.value,raw:this.value+""}});a("BigIntLiteral").bases("Literal").build("value").field("value",o(String,Number)).field("extra",{rawValue:String,raw:String},function e(){return{rawValue:String(this.value),raw:this.value+"n"}});a("NullLiteral").bases("Literal").build().field("value",null,r["null"]);a("BooleanLiteral").bases("Literal").build("value").field("value",Boolean);a("RegExpLiteral").bases("Literal").build("pattern","flags").field("pattern",String).field("flags",String).field("value",RegExp,function(){return new RegExp(this.pattern,this.flags)});var l=o(a("Property"),a("ObjectMethod"),a("ObjectProperty"),a("SpreadProperty"),a("SpreadElement"));a("ObjectExpression").bases("Expression").build("properties").field("properties",[l]);a("ObjectMethod").bases("Node","Function").build("kind","key","params","body","computed").field("kind",o("method","get","set")).field("key",o(a("Literal"),a("Identifier"),a("Expression"))).field("params",[a("Pattern")]).field("body",a("BlockStatement")).field("computed",Boolean,r["false"]).field("generator",Boolean,r["false"]).field("async",Boolean,r["false"]).field("accessibility",o(a("Literal"),null),r["null"]).field("decorators",o([a("Decorator")],null),r["null"]);a("ObjectProperty").bases("Node").build("key","value").field("key",o(a("Literal"),a("Identifier"),a("Expression"))).field("value",o(a("Expression"),a("Pattern"))).field("accessibility",o(a("Literal"),null),r["null"]).field("computed",Boolean,r["false"]);var u=o(a("MethodDefinition"),a("VariableDeclarator"),a("ClassPropertyDefinition"),a("ClassProperty"),a("ClassPrivateProperty"),a("ClassMethod"),a("ClassPrivateMethod"));a("ClassBody").bases("Declaration").build("body").field("body",[u]);a("ClassMethod").bases("Declaration","Function").build("kind","key","params","body","computed","static").field("key",o(a("Literal"),a("Identifier"),a("Expression")));a("ClassPrivateMethod").bases("Declaration","Function").build("key","params","body","kind","computed","static").field("key",a("PrivateName"));["ClassMethod","ClassPrivateMethod"].forEach(function(e){a(e).field("kind",o("get","set","method","constructor"),function(){return"method"}).field("body",a("BlockStatement")).field("computed",Boolean,r["false"]).field("static",o(Boolean,null),r["null"]).field("abstract",o(Boolean,null),r["null"]).field("access",o("public","private","protected",null),r["null"]).field("accessibility",o("public","private","protected",null),r["null"]).field("decorators",o([a("Decorator")],null),r["null"]).field("optional",o(Boolean,null),r["null"])});a("ClassPrivateProperty").bases("ClassProperty").build("key","value").field("key",a("PrivateName")).field("value",o(a("Expression"),null),r["null"]);a("PrivateName").bases("Expression","Pattern").build("id").field("id",a("Identifier"));var c=o(a("Property"),a("PropertyPattern"),a("SpreadPropertyPattern"),a("SpreadProperty"),a("ObjectProperty"),a("RestProperty"));a("ObjectPattern").bases("Pattern").build("properties").field("properties",[c]).field("decorators",o([a("Decorator")],null),r["null"]);a("SpreadProperty").bases("Node").build("argument").field("argument",a("Expression"));a("RestProperty").bases("Node").build("argument").field("argument",a("Expression"));a("ForAwaitStatement").bases("Statement").build("left","right","body").field("left",o(a("VariableDeclaration"),a("Expression"))).field("right",a("Expression")).field("body",a("Statement"));a("Import").bases("Expression").build()}t.default=a;e.exports=t["default"]});o(A);var T=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(A);var i=r(C);function s(e){e.use(n.default);e.use(i.default)}t.default=s;e.exports=t["default"]});o(T);var k=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(A);var i=r(D);var s=r(c);var a=r(y);function o(e){e.use(n.default);e.use(i.default);var t=e.use(s.default);var r=t.namedTypes;var o=t.Type.def;var l=t.Type.or;var u=e.use(a.default).defaults;var c=t.Type.from(function(e,t){if(r.StringLiteral&&r.StringLiteral.check(e,t)){return true}if(r.Literal&&r.Literal.check(e,t)&&typeof e.value==="string"){return true}return false},"StringLiteral");o("TSType").bases("Node");var f=l(o("Identifier"),o("TSQualifiedName"));o("TSTypeReference").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("typeName","typeParameters").field("typeName",f);o("TSHasOptionalTypeParameterInstantiation").field("typeParameters",l(o("TSTypeParameterInstantiation"),null),u["null"]);o("TSHasOptionalTypeParameters").field("typeParameters",l(o("TSTypeParameterDeclaration"),null,void 0),u["null"]);o("TSHasOptionalTypeAnnotation").field("typeAnnotation",l(o("TSTypeAnnotation"),null),u["null"]);o("TSQualifiedName").bases("Node").build("left","right").field("left",f).field("right",f);o("TSAsExpression").bases("Expression","Pattern").build("expression","typeAnnotation").field("expression",o("Expression")).field("typeAnnotation",o("TSType")).field("extra",l({parenthesized:Boolean},null),u["null"]);o("TSNonNullExpression").bases("Expression","Pattern").build("expression").field("expression",o("Expression"));["TSAnyKeyword","TSBigIntKeyword","TSBooleanKeyword","TSNeverKeyword","TSNullKeyword","TSNumberKeyword","TSObjectKeyword","TSStringKeyword","TSSymbolKeyword","TSUndefinedKeyword","TSUnknownKeyword","TSVoidKeyword","TSThisType"].forEach(function(e){o(e).bases("TSType").build()});o("TSArrayType").bases("TSType").build("elementType").field("elementType",o("TSType"));o("TSLiteralType").bases("TSType").build("literal").field("literal",l(o("NumericLiteral"),o("StringLiteral"),o("BooleanLiteral"),o("TemplateLiteral"),o("UnaryExpression")));["TSUnionType","TSIntersectionType"].forEach(function(e){o(e).bases("TSType").build("types").field("types",[o("TSType")])});o("TSConditionalType").bases("TSType").build("checkType","extendsType","trueType","falseType").field("checkType",o("TSType")).field("extendsType",o("TSType")).field("trueType",o("TSType")).field("falseType",o("TSType"));o("TSInferType").bases("TSType").build("typeParameter").field("typeParameter",o("TSTypeParameter"));o("TSParenthesizedType").bases("TSType").build("typeAnnotation").field("typeAnnotation",o("TSType"));var h=[l(o("Identifier"),o("RestElement"),o("ArrayPattern"),o("ObjectPattern"))];["TSFunctionType","TSConstructorType"].forEach(function(e){o(e).bases("TSType","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("parameters").field("parameters",h)});o("TSDeclareFunction").bases("Declaration","TSHasOptionalTypeParameters").build("id","params","returnType").field("declare",Boolean,u["false"]).field("async",Boolean,u["false"]).field("generator",Boolean,u["false"]).field("id",l(o("Identifier"),null),u["null"]).field("params",[o("Pattern")]).field("returnType",l(o("TSTypeAnnotation"),o("Noop"),null),u["null"]);o("TSDeclareMethod").bases("Declaration","TSHasOptionalTypeParameters").build("key","params","returnType").field("async",Boolean,u["false"]).field("generator",Boolean,u["false"]).field("params",[o("Pattern")]).field("abstract",Boolean,u["false"]).field("accessibility",l("public","private","protected",void 0),u["undefined"]).field("static",Boolean,u["false"]).field("computed",Boolean,u["false"]).field("optional",Boolean,u["false"]).field("key",l(o("Identifier"),o("StringLiteral"),o("NumericLiteral"),o("Expression"))).field("kind",l("get","set","method","constructor"),function e(){return"method"}).field("access",l("public","private","protected",void 0),u["undefined"]).field("decorators",l([o("Decorator")],null),u["null"]).field("returnType",l(o("TSTypeAnnotation"),o("Noop"),null),u["null"]);o("TSMappedType").bases("TSType").build("typeParameter","typeAnnotation").field("readonly",l(Boolean,"+","-"),u["false"]).field("typeParameter",o("TSTypeParameter")).field("optional",l(Boolean,"+","-"),u["false"]).field("typeAnnotation",l(o("TSType"),null),u["null"]);o("TSTupleType").bases("TSType").build("elementTypes").field("elementTypes",[o("TSType")]);o("TSRestType").bases("TSType").build("typeAnnotation").field("typeAnnotation",o("TSType"));o("TSOptionalType").bases("TSType").build("typeAnnotation").field("typeAnnotation",o("TSType"));o("TSIndexedAccessType").bases("TSType").build("objectType","indexType").field("objectType",o("TSType")).field("indexType",o("TSType"));o("TSTypeOperator").bases("TSType").build("operator").field("operator",String).field("typeAnnotation",o("TSType"));o("TSTypeAnnotation").bases("Node").build("typeAnnotation").field("typeAnnotation",l(o("TSType"),o("TSTypeAnnotation")));o("TSIndexSignature").bases("Declaration","TSHasOptionalTypeAnnotation").build("parameters","typeAnnotation").field("parameters",[o("Identifier")]).field("readonly",Boolean,u["false"]);o("TSPropertySignature").bases("Declaration","TSHasOptionalTypeAnnotation").build("key","typeAnnotation","optional").field("key",o("Expression")).field("computed",Boolean,u["false"]).field("readonly",Boolean,u["false"]).field("optional",Boolean,u["false"]).field("initializer",l(o("Expression"),null),u["null"]);o("TSMethodSignature").bases("Declaration","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("key","parameters","typeAnnotation").field("key",o("Expression")).field("computed",Boolean,u["false"]).field("optional",Boolean,u["false"]).field("parameters",h);o("TSTypePredicate").bases("TSTypeAnnotation").build("parameterName","typeAnnotation").field("parameterName",l(o("Identifier"),o("TSThisType"))).field("typeAnnotation",o("TSTypeAnnotation"));["TSCallSignatureDeclaration","TSConstructSignatureDeclaration"].forEach(function(e){o(e).bases("Declaration","TSHasOptionalTypeParameters","TSHasOptionalTypeAnnotation").build("parameters","typeAnnotation").field("parameters",h)});o("TSEnumMember").bases("Node").build("id","initializer").field("id",l(o("Identifier"),c)).field("initializer",l(o("Expression"),null),u["null"]);o("TSTypeQuery").bases("TSType").build("exprName").field("exprName",l(f,o("TSImportType")));var p=l(o("TSCallSignatureDeclaration"),o("TSConstructSignatureDeclaration"),o("TSIndexSignature"),o("TSMethodSignature"),o("TSPropertySignature"));o("TSTypeLiteral").bases("TSType").build("members").field("members",[p]);o("TSTypeParameter").bases("Identifier").build("name","constraint","default").field("name",String).field("constraint",l(o("TSType"),void 0),u["undefined"]).field("default",l(o("TSType"),void 0),u["undefined"]);o("TSTypeAssertion").bases("Expression","Pattern").build("typeAnnotation","expression").field("typeAnnotation",o("TSType")).field("expression",o("Expression")).field("extra",l({parenthesized:Boolean},null),u["null"]);o("TSTypeParameterDeclaration").bases("Declaration").build("params").field("params",[o("TSTypeParameter")]);o("TSTypeParameterInstantiation").bases("Node").build("params").field("params",[o("TSType")]);o("TSEnumDeclaration").bases("Declaration").build("id","members").field("id",o("Identifier")).field("const",Boolean,u["false"]).field("declare",Boolean,u["false"]).field("members",[o("TSEnumMember")]).field("initializer",l(o("Expression"),null),u["null"]);o("TSTypeAliasDeclaration").bases("Declaration","TSHasOptionalTypeParameters").build("id","typeAnnotation").field("id",o("Identifier")).field("declare",Boolean,u["false"]).field("typeAnnotation",o("TSType"));o("TSModuleBlock").bases("Node").build("body").field("body",[o("Statement")]);o("TSModuleDeclaration").bases("Declaration").build("id","body").field("id",l(c,f)).field("declare",Boolean,u["false"]).field("global",Boolean,u["false"]).field("body",l(o("TSModuleBlock"),o("TSModuleDeclaration"),null),u["null"]);o("TSImportType").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("argument","qualifier","typeParameters").field("argument",c).field("qualifier",l(f,void 0),u["undefined"]);o("TSImportEqualsDeclaration").bases("Declaration").build("id","moduleReference").field("id",o("Identifier")).field("isExport",Boolean,u["false"]).field("moduleReference",l(f,o("TSExternalModuleReference")));o("TSExternalModuleReference").bases("Declaration").build("expression").field("expression",c);o("TSExportAssignment").bases("Statement").build("expression").field("expression",o("Expression"));o("TSNamespaceExportDeclaration").bases("Declaration").build("id").field("id",o("Identifier"));o("TSInterfaceBody").bases("Node").build("body").field("body",[p]);o("TSExpressionWithTypeArguments").bases("TSType","TSHasOptionalTypeParameterInstantiation").build("expression","typeParameters").field("expression",f);o("TSInterfaceDeclaration").bases("Declaration","TSHasOptionalTypeParameters").build("id","body").field("id",f).field("declare",Boolean,u["false"]).field("extends",l([o("TSExpressionWithTypeArguments")],null),u["null"]).field("body",o("TSInterfaceBody"));o("TSParameterProperty").bases("Pattern").build("parameter").field("accessibility",l("public","private","protected",void 0),u["undefined"]).field("readonly",Boolean,u["false"]).field("parameter",l(o("Identifier"),o("AssignmentPattern")));o("ClassProperty").field("access",l("public","private","protected",void 0),u["undefined"]);o("ClassBody").field("body",[l(o("MethodDefinition"),o("VariableDeclarator"),o("ClassPropertyDefinition"),o("ClassProperty"),o("ClassPrivateProperty"),o("ClassMethod"),o("ClassPrivateMethod"),o("TSDeclareMethod"),p)])}t.default=o;e.exports=t["default"]});o(k);var _=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(c);var i=r(y);var s=r(x);function a(e){e.use(s.default);var t=e.use(n.default);var r=t.Type;var a=t.Type.def;var o=r.or;var l=e.use(i.default);var u=l.defaults;a("OptionalMemberExpression").bases("MemberExpression").build("object","property","computed","optional").field("optional",Boolean,u["true"]);a("OptionalCallExpression").bases("CallExpression").build("callee","arguments","optional").field("optional",Boolean,u["true"]);var c=o("||","&&","??");a("LogicalExpression").field("operator",c)}t.default=a;e.exports=t["default"]});o(_);var P=l(function(e,t){Object.defineProperty(t,"__esModule",{value:true});var r;(function(e){})(r=t.namedTypes||(t.namedTypes={}))});o(P);var F=P.namedTypes;var I=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(g);var i=r(x);var s=r(E);var a=r(b);var o=r(S);var l=r(C);var u=r(w);var c=r(T);var f=r(k);var h=r(_);t.namedTypes=P.namedTypes;var p=n.default([i.default,s.default,a.default,o.default,l.default,u.default,c.default,f.default,h.default]),d=p.astNodesAreEquivalent,m=p.builders,v=p.builtInTypes,y=p.defineMethod,D=p.eachField,A=p.finalize,F=p.getBuilderName,I=p.getFieldNames,M=p.getFieldValue,N=p.getSupertypeNames,L=p.namedTypes,B=p.NodePath,O=p.Path,R=p.PathVisitor,j=p.someField,U=p.Type,V=p.use,G=p.visit;t.astNodesAreEquivalent=d;t.builders=m;t.builtInTypes=v;t.defineMethod=y;t.eachField=D;t.finalize=A;t.getBuilderName=F;t.getFieldNames=I;t.getFieldValue=M;t.getSupertypeNames=N;t.NodePath=B;t.Path=O;t.PathVisitor=R;t.someField=j;t.Type=U;t.use=V;t.visit=G;Object.assign(P.namedTypes,L)});o(I);var M=I.namedTypes;var N=I.astNodesAreEquivalent;var L=I.builders;var B=I.builtInTypes;var O=I.defineMethod;var R=I.eachField;var j=I.finalize;var U=I.getBuilderName;var V=I.getFieldNames;var G=I.getFieldValue;var z=I.getSupertypeNames;var X=I.NodePath;var J=I.Path;var q=I.PathVisitor;var W=I.someField;var H=I.Type;var K=I.use;var $=I.visit;var Y=[];var Q=[];var Z=typeof Uint8Array!=="undefined"?Uint8Array:Array;var ee=false;function te(){ee=true;var e="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";for(var t=0,r=e.length;t<r;++t){Y[t]=e[t];Q[e.charCodeAt(t)]=t}Q["-".charCodeAt(0)]=62;Q["_".charCodeAt(0)]=63}function re(e){if(!ee){te()}var t,r,n,i,s,a;var o=e.length;if(o%4>0){throw new Error("Invalid string. Length must be a multiple of 4")}s=e[o-2]==="="?2:e[o-1]==="="?1:0;a=new Z(o*3/4-s);n=s>0?o-4:o;var l=0;for(t=0,r=0;t<n;t+=4,r+=3){i=Q[e.charCodeAt(t)]<<18|Q[e.charCodeAt(t+1)]<<12|Q[e.charCodeAt(t+2)]<<6|Q[e.charCodeAt(t+3)];a[l++]=i>>16&255;a[l++]=i>>8&255;a[l++]=i&255}if(s===2){i=Q[e.charCodeAt(t)]<<2|Q[e.charCodeAt(t+1)]>>4;a[l++]=i&255}else if(s===1){i=Q[e.charCodeAt(t)]<<10|Q[e.charCodeAt(t+1)]<<4|Q[e.charCodeAt(t+2)]>>2;a[l++]=i>>8&255;a[l++]=i&255}return a}function ne(e){return Y[e>>18&63]+Y[e>>12&63]+Y[e>>6&63]+Y[e&63]}function ie(e,t,r){var n;var i=[];for(var s=t;s<r;s+=3){n=(e[s]<<16)+(e[s+1]<<8)+e[s+2];i.push(ne(n))}return i.join("")}function se(e){if(!ee){te()}var t;var r=e.length;var n=r%3;var i="";var s=[];var a=16383;for(var o=0,l=r-n;o<l;o+=a){s.push(ie(e,o,o+a>l?l:o+a))}if(n===1){t=e[r-1];i+=Y[t>>2];i+=Y[t<<4&63];i+="=="}else if(n===2){t=(e[r-2]<<8)+e[r-1];i+=Y[t>>10];i+=Y[t>>4&63];i+=Y[t<<2&63];i+="="}s.push(i);return s.join("")}function ae(e,t,r,n,i){var s,a;var o=i*8-n-1;var l=(1<<o)-1;var u=l>>1;var c=-7;var f=r?i-1:0;var h=r?-1:1;var p=e[t+f];f+=h;s=p&(1<<-c)-1;p>>=-c;c+=o;for(;c>0;s=s*256+e[t+f],f+=h,c-=8){}a=s&(1<<-c)-1;s>>=-c;c+=n;for(;c>0;a=a*256+e[t+f],f+=h,c-=8){}if(s===0){s=1-u}else if(s===l){return a?NaN:(p?-1:1)*Infinity}else{a=a+Math.pow(2,n);s=s-u}return(p?-1:1)*a*Math.pow(2,s-n)}function oe(e,t,r,n,i,s){var a,o,l;var u=s*8-i-1;var c=(1<<u)-1;var f=c>>1;var h=i===23?Math.pow(2,-24)-Math.pow(2,-77):0;var p=n?0:s-1;var d=n?1:-1;var m=t<0||t===0&&1/t<0?1:0;t=Math.abs(t);if(isNaN(t)||t===Infinity){o=isNaN(t)?1:0;a=c}else{a=Math.floor(Math.log(t)/Math.LN2);if(t*(l=Math.pow(2,-a))<1){a--;l*=2}if(a+f>=1){t+=h/l}else{t+=h*Math.pow(2,1-f)}if(t*l>=2){a++;l/=2}if(a+f>=c){o=0;a=c}else if(a+f>=1){o=(t*l-1)*Math.pow(2,i);a=a+f}else{o=t*Math.pow(2,f-1)*Math.pow(2,i);a=0}}for(;i>=8;e[r+p]=o&255,p+=d,o/=256,i-=8){}a=a<<i|o;u+=i;for(;u>0;e[r+p]=a&255,p+=d,a/=256,u-=8){}e[r+p-d]|=m*128}var le={}.toString;var ue=Array.isArray||function(e){return le.call(e)=="[object Array]"};
+/*!
+  	 * The buffer module from node.js, for the browser.
+  	 *
+  	 * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+  	 * @license  MIT
+  	 */var ce=50;pe.TYPED_ARRAY_SUPPORT=Lt.TYPED_ARRAY_SUPPORT!==undefined?Lt.TYPED_ARRAY_SUPPORT:true;function fe(){return pe.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function he(e,t){if(fe()<t){throw new RangeError("Invalid typed array length")}if(pe.TYPED_ARRAY_SUPPORT){e=new Uint8Array(t);e.__proto__=pe.prototype}else{if(e===null){e=new pe(t)}e.length=t}return e}function pe(e,t,r){if(!pe.TYPED_ARRAY_SUPPORT&&!(this instanceof pe)){return new pe(e,t,r)}if(typeof e==="number"){if(typeof t==="string"){throw new Error("If encoding is specified then the first argument must be a string")}return ge(this,e)}return de(this,e,t,r)}pe.poolSize=8192;pe._augment=function(e){e.__proto__=pe.prototype;return e};function de(e,t,r,n){if(typeof t==="number"){throw new TypeError('"value" argument must not be a number')}if(typeof ArrayBuffer!=="undefined"&&t instanceof ArrayBuffer){return Ee(e,t,r,n)}if(typeof t==="string"){return ye(e,t,r)}return be(e,t)}pe.from=function(e,t,r){return de(null,e,t,r)};if(pe.TYPED_ARRAY_SUPPORT){pe.prototype.__proto__=Uint8Array.prototype;pe.__proto__=Uint8Array}function me(e){if(typeof e!=="number"){throw new TypeError('"size" argument must be a number')}else if(e<0){throw new RangeError('"size" argument must not be negative')}}function ve(e,t,r,n){me(t);if(t<=0){return he(e,t)}if(r!==undefined){return typeof n==="string"?he(e,t).fill(r,n):he(e,t).fill(r)}return he(e,t)}pe.alloc=function(e,t,r){return ve(null,e,t,r)};function ge(e,t){me(t);e=he(e,t<0?0:Se(t)|0);if(!pe.TYPED_ARRAY_SUPPORT){for(var r=0;r<t;++r){e[r]=0}}return e}pe.allocUnsafe=function(e){return ge(null,e)};pe.allocUnsafeSlow=function(e){return ge(null,e)};function ye(e,t,r){if(typeof r!=="string"||r===""){r="utf8"}if(!pe.isEncoding(r)){throw new TypeError('"encoding" must be a valid string encoding')}var n=Ce(t,r)|0;e=he(e,n);var i=e.write(t,r);if(i!==n){e=e.slice(0,i)}return e}function xe(e,t){var r=t.length<0?0:Se(t.length)|0;e=he(e,r);for(var n=0;n<r;n+=1){e[n]=t[n]&255}return e}function Ee(e,t,r,n){t.byteLength;if(r<0||t.byteLength<r){throw new RangeError("'offset' is out of bounds")}if(t.byteLength<r+(n||0)){throw new RangeError("'length' is out of bounds")}if(r===undefined&&n===undefined){t=new Uint8Array(t)}else if(n===undefined){t=new Uint8Array(t,r)}else{t=new Uint8Array(t,r,n)}if(pe.TYPED_ARRAY_SUPPORT){e=t;e.__proto__=pe.prototype}else{e=xe(e,t)}return e}function be(e,t){if(De(t)){var r=Se(t.length)|0;e=he(e,r);if(e.length===0){return e}t.copy(e,0,0,r);return e}if(t){if(typeof ArrayBuffer!=="undefined"&&t.buffer instanceof ArrayBuffer||"length"in t){if(typeof t.length!=="number"||st(t.length)){return he(e,0)}return xe(e,t)}if(t.type==="Buffer"&&ue(t.data)){return xe(e,t.data)}}throw new TypeError("First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.")}function Se(e){if(e>=fe()){throw new RangeError("Attempt to allocate Buffer larger than maximum "+"size: 0x"+fe().toString(16)+" bytes")}return e|0}pe.isBuffer=at;function De(e){return!!(e!=null&&e._isBuffer)}pe.compare=function e(t,r){if(!De(t)||!De(r)){throw new TypeError("Arguments must be Buffers")}if(t===r)return 0;var n=t.length;var i=r.length;for(var s=0,a=Math.min(n,i);s<a;++s){if(t[s]!==r[s]){n=t[s];i=r[s];break}}if(n<i)return-1;if(i<n)return 1;return 0};pe.isEncoding=function e(t){switch(String(t).toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"latin1":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return true;default:return false}};pe.concat=function e(t,r){if(!ue(t)){throw new TypeError('"list" argument must be an Array of Buffers')}if(t.length===0){return pe.alloc(0)}var n;if(r===undefined){r=0;for(n=0;n<t.length;++n){r+=t[n].length}}var i=pe.allocUnsafe(r);var s=0;for(n=0;n<t.length;++n){var a=t[n];if(!De(a)){throw new TypeError('"list" argument must be an Array of Buffers')}a.copy(i,s);s+=a.length}return i};function Ce(e,t){if(De(e)){return e.length}if(typeof ArrayBuffer!=="undefined"&&typeof ArrayBuffer.isView==="function"&&(ArrayBuffer.isView(e)||e instanceof ArrayBuffer)){return e.byteLength}if(typeof e!=="string"){e=""+e}var r=e.length;if(r===0)return 0;var n=false;for(;;){switch(t){case"ascii":case"latin1":case"binary":return r;case"utf8":case"utf-8":case undefined:return et(e).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return r*2;case"hex":return r>>>1;case"base64":return nt(e).length;default:if(n)return et(e).length;t=(""+t).toLowerCase();n=true}}}pe.byteLength=Ce;function we(e,t,r){var n=false;if(t===undefined||t<0){t=0}if(t>this.length){return""}if(r===undefined||r>this.length){r=this.length}if(r<=0){return""}r>>>=0;t>>>=0;if(r<=t){return""}if(!e)e="utf8";while(true){switch(e){case"hex":return Ve(this,t,r);case"utf8":case"utf-8":return Be(this,t,r);case"ascii":return je(this,t,r);case"latin1":case"binary":return Ue(this,t,r);case"base64":return Le(this,t,r);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return Ge(this,t,r);default:if(n)throw new TypeError("Unknown encoding: "+e);e=(e+"").toLowerCase();n=true}}}pe.prototype._isBuffer=true;function Ae(e,t,r){var n=e[t];e[t]=e[r];e[r]=n}pe.prototype.swap16=function e(){var t=this.length;if(t%2!==0){throw new RangeError("Buffer size must be a multiple of 16-bits")}for(var r=0;r<t;r+=2){Ae(this,r,r+1)}return this};pe.prototype.swap32=function e(){var t=this.length;if(t%4!==0){throw new RangeError("Buffer size must be a multiple of 32-bits")}for(var r=0;r<t;r+=4){Ae(this,r,r+3);Ae(this,r+1,r+2)}return this};pe.prototype.swap64=function e(){var t=this.length;if(t%8!==0){throw new RangeError("Buffer size must be a multiple of 64-bits")}for(var r=0;r<t;r+=8){Ae(this,r,r+7);Ae(this,r+1,r+6);Ae(this,r+2,r+5);Ae(this,r+3,r+4)}return this};pe.prototype.toString=function e(){var t=this.length|0;if(t===0)return"";if(arguments.length===0)return Be(this,0,t);return we.apply(this,arguments)};pe.prototype.equals=function e(t){if(!De(t))throw new TypeError("Argument must be a Buffer");if(this===t)return true;return pe.compare(this,t)===0};pe.prototype.inspect=function e(){var t="";var r=ce;if(this.length>0){t=this.toString("hex",0,r).match(/.{2}/g).join(" ");if(this.length>r)t+=" ... "}return"<Buffer "+t+">"};pe.prototype.compare=function e(t,r,n,i,s){if(!De(t)){throw new TypeError("Argument must be a Buffer")}if(r===undefined){r=0}if(n===undefined){n=t?t.length:0}if(i===undefined){i=0}if(s===undefined){s=this.length}if(r<0||n>t.length||i<0||s>this.length){throw new RangeError("out of range index")}if(i>=s&&r>=n){return 0}if(i>=s){return-1}if(r>=n){return 1}r>>>=0;n>>>=0;i>>>=0;s>>>=0;if(this===t)return 0;var a=s-i;var o=n-r;var l=Math.min(a,o);var u=this.slice(i,s);var c=t.slice(r,n);for(var f=0;f<l;++f){if(u[f]!==c[f]){a=u[f];o=c[f];break}}if(a<o)return-1;if(o<a)return 1;return 0};function Te(e,t,r,n,i){if(e.length===0)return-1;if(typeof r==="string"){n=r;r=0}else if(r>2147483647){r=2147483647}else if(r<-2147483648){r=-2147483648}r=+r;if(isNaN(r)){r=i?0:e.length-1}if(r<0)r=e.length+r;if(r>=e.length){if(i)return-1;else r=e.length-1}else if(r<0){if(i)r=0;else return-1}if(typeof t==="string"){t=pe.from(t,n)}if(De(t)){if(t.length===0){return-1}return ke(e,t,r,n,i)}else if(typeof t==="number"){t=t&255;if(pe.TYPED_ARRAY_SUPPORT&&typeof Uint8Array.prototype.indexOf==="function"){if(i){return Uint8Array.prototype.indexOf.call(e,t,r)}else{return Uint8Array.prototype.lastIndexOf.call(e,t,r)}}return ke(e,[t],r,n,i)}throw new TypeError("val must be string, number or Buffer")}function ke(e,t,r,n,i){var s=1;var a=e.length;var o=t.length;if(n!==undefined){n=String(n).toLowerCase();if(n==="ucs2"||n==="ucs-2"||n==="utf16le"||n==="utf-16le"){if(e.length<2||t.length<2){return-1}s=2;a/=2;o/=2;r/=2}}function l(e,t){if(s===1){return e[t]}else{return e.readUInt16BE(t*s)}}var u;if(i){var c=-1;for(u=r;u<a;u++){if(l(e,u)===l(t,c===-1?0:u-c)){if(c===-1)c=u;if(u-c+1===o)return c*s}else{if(c!==-1)u-=u-c;c=-1}}}else{if(r+o>a)r=a-o;for(u=r;u>=0;u--){var f=true;for(var h=0;h<o;h++){if(l(e,u+h)!==l(t,h)){f=false;break}}if(f)return u}}return-1}pe.prototype.includes=function e(t,r,n){return this.indexOf(t,r,n)!==-1};pe.prototype.indexOf=function e(t,r,n){return Te(this,t,r,n,true)};pe.prototype.lastIndexOf=function e(t,r,n){return Te(this,t,r,n,false)};function _e(e,t,r,n){r=Number(r)||0;var i=e.length-r;if(!n){n=i}else{n=Number(n);if(n>i){n=i}}var s=t.length;if(s%2!==0)throw new TypeError("Invalid hex string");if(n>s/2){n=s/2}for(var a=0;a<n;++a){var o=parseInt(t.substr(a*2,2),16);if(isNaN(o))return a;e[r+a]=o}return a}function Pe(e,t,r,n){return it(et(t,e.length-r),e,r,n)}function Fe(e,t,r,n){return it(tt(t),e,r,n)}function Ie(e,t,r,n){return Fe(e,t,r,n)}function Me(e,t,r,n){return it(nt(t),e,r,n)}function Ne(e,t,r,n){return it(rt(t,e.length-r),e,r,n)}pe.prototype.write=function e(t,r,n,i){if(r===undefined){i="utf8";n=this.length;r=0}else if(n===undefined&&typeof r==="string"){i=r;n=this.length;r=0}else if(isFinite(r)){r=r|0;if(isFinite(n)){n=n|0;if(i===undefined)i="utf8"}else{i=n;n=undefined}}else{throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported")}var s=this.length-r;if(n===undefined||n>s)n=s;if(t.length>0&&(n<0||r<0)||r>this.length){throw new RangeError("Attempt to write outside buffer bounds")}if(!i)i="utf8";var a=false;for(;;){switch(i){case"hex":return _e(this,t,r,n);case"utf8":case"utf-8":return Pe(this,t,r,n);case"ascii":return Fe(this,t,r,n);case"latin1":case"binary":return Ie(this,t,r,n);case"base64":return Me(this,t,r,n);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return Ne(this,t,r,n);default:if(a)throw new TypeError("Unknown encoding: "+i);i=(""+i).toLowerCase();a=true}}};pe.prototype.toJSON=function e(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};function Le(e,t,r){if(t===0&&r===e.length){return se(e)}else{return se(e.slice(t,r))}}function Be(e,t,r){r=Math.min(e.length,r);var n=[];var i=t;while(i<r){var s=e[i];var a=null;var o=s>239?4:s>223?3:s>191?2:1;if(i+o<=r){var l,u,c,f;switch(o){case 1:if(s<128){a=s}break;case 2:l=e[i+1];if((l&192)===128){f=(s&31)<<6|l&63;if(f>127){a=f}}break;case 3:l=e[i+1];u=e[i+2];if((l&192)===128&&(u&192)===128){f=(s&15)<<12|(l&63)<<6|u&63;if(f>2047&&(f<55296||f>57343)){a=f}}break;case 4:l=e[i+1];u=e[i+2];c=e[i+3];if((l&192)===128&&(u&192)===128&&(c&192)===128){f=(s&15)<<18|(l&63)<<12|(u&63)<<6|c&63;if(f>65535&&f<1114112){a=f}}}}if(a===null){a=65533;o=1}else if(a>65535){a-=65536;n.push(a>>>10&1023|55296);a=56320|a&1023}n.push(a);i+=o}return Re(n)}var Oe=4096;function Re(e){var t=e.length;if(t<=Oe){return String.fromCharCode.apply(String,e)}var r="";var n=0;while(n<t){r+=String.fromCharCode.apply(String,e.slice(n,n+=Oe))}return r}function je(e,t,r){var n="";r=Math.min(e.length,r);for(var i=t;i<r;++i){n+=String.fromCharCode(e[i]&127)}return n}function Ue(e,t,r){var n="";r=Math.min(e.length,r);for(var i=t;i<r;++i){n+=String.fromCharCode(e[i])}return n}function Ve(e,t,r){var n=e.length;if(!t||t<0)t=0;if(!r||r<0||r>n)r=n;var i="";for(var s=t;s<r;++s){i+=Ze(e[s])}return i}function Ge(e,t,r){var n=e.slice(t,r);var i="";for(var s=0;s<n.length;s+=2){i+=String.fromCharCode(n[s]+n[s+1]*256)}return i}pe.prototype.slice=function e(t,r){var n=this.length;t=~~t;r=r===undefined?n:~~r;if(t<0){t+=n;if(t<0)t=0}else if(t>n){t=n}if(r<0){r+=n;if(r<0)r=0}else if(r>n){r=n}if(r<t)r=t;var i;if(pe.TYPED_ARRAY_SUPPORT){i=this.subarray(t,r);i.__proto__=pe.prototype}else{var s=r-t;i=new pe(s,undefined);for(var a=0;a<s;++a){i[a]=this[a+t]}}return i};function ze(e,t,r){if(e%1!==0||e<0)throw new RangeError("offset is not uint");if(e+t>r)throw new RangeError("Trying to access beyond buffer length")}pe.prototype.readUIntLE=function e(t,r,n){t=t|0;r=r|0;if(!n)ze(t,r,this.length);var i=this[t];var s=1;var a=0;while(++a<r&&(s*=256)){i+=this[t+a]*s}return i};pe.prototype.readUIntBE=function e(t,r,n){t=t|0;r=r|0;if(!n){ze(t,r,this.length)}var i=this[t+--r];var s=1;while(r>0&&(s*=256)){i+=this[t+--r]*s}return i};pe.prototype.readUInt8=function e(t,r){if(!r)ze(t,1,this.length);return this[t]};pe.prototype.readUInt16LE=function e(t,r){if(!r)ze(t,2,this.length);return this[t]|this[t+1]<<8};pe.prototype.readUInt16BE=function e(t,r){if(!r)ze(t,2,this.length);return this[t]<<8|this[t+1]};pe.prototype.readUInt32LE=function e(t,r){if(!r)ze(t,4,this.length);return(this[t]|this[t+1]<<8|this[t+2]<<16)+this[t+3]*16777216};pe.prototype.readUInt32BE=function e(t,r){if(!r)ze(t,4,this.length);return this[t]*16777216+(this[t+1]<<16|this[t+2]<<8|this[t+3])};pe.prototype.readIntLE=function e(t,r,n){t=t|0;r=r|0;if(!n)ze(t,r,this.length);var i=this[t];var s=1;var a=0;while(++a<r&&(s*=256)){i+=this[t+a]*s}s*=128;if(i>=s)i-=Math.pow(2,8*r);return i};pe.prototype.readIntBE=function e(t,r,n){t=t|0;r=r|0;if(!n)ze(t,r,this.length);var i=r;var s=1;var a=this[t+--i];while(i>0&&(s*=256)){a+=this[t+--i]*s}s*=128;if(a>=s)a-=Math.pow(2,8*r);return a};pe.prototype.readInt8=function e(t,r){if(!r)ze(t,1,this.length);if(!(this[t]&128))return this[t];return(255-this[t]+1)*-1};pe.prototype.readInt16LE=function e(t,r){if(!r)ze(t,2,this.length);var n=this[t]|this[t+1]<<8;return n&32768?n|4294901760:n};pe.prototype.readInt16BE=function e(t,r){if(!r)ze(t,2,this.length);var n=this[t+1]|this[t]<<8;return n&32768?n|4294901760:n};pe.prototype.readInt32LE=function e(t,r){if(!r)ze(t,4,this.length);return this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24};pe.prototype.readInt32BE=function e(t,r){if(!r)ze(t,4,this.length);return this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]};pe.prototype.readFloatLE=function e(t,r){if(!r)ze(t,4,this.length);return ae(this,t,true,23,4)};pe.prototype.readFloatBE=function e(t,r){if(!r)ze(t,4,this.length);return ae(this,t,false,23,4)};pe.prototype.readDoubleLE=function e(t,r){if(!r)ze(t,8,this.length);return ae(this,t,true,52,8)};pe.prototype.readDoubleBE=function e(t,r){if(!r)ze(t,8,this.length);return ae(this,t,false,52,8)};function Xe(e,t,r,n,i,s){if(!De(e))throw new TypeError('"buffer" argument must be a Buffer instance');if(t>i||t<s)throw new RangeError('"value" argument is out of bounds');if(r+n>e.length)throw new RangeError("Index out of range")}pe.prototype.writeUIntLE=function e(t,r,n,i){t=+t;r=r|0;n=n|0;if(!i){var s=Math.pow(2,8*n)-1;Xe(this,t,r,n,s,0)}var a=1;var o=0;this[r]=t&255;while(++o<n&&(a*=256)){this[r+o]=t/a&255}return r+n};pe.prototype.writeUIntBE=function e(t,r,n,i){t=+t;r=r|0;n=n|0;if(!i){var s=Math.pow(2,8*n)-1;Xe(this,t,r,n,s,0)}var a=n-1;var o=1;this[r+a]=t&255;while(--a>=0&&(o*=256)){this[r+a]=t/o&255}return r+n};pe.prototype.writeUInt8=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,1,255,0);if(!pe.TYPED_ARRAY_SUPPORT)t=Math.floor(t);this[r]=t&255;return r+1};function Je(e,t,r,n){if(t<0)t=65535+t+1;for(var i=0,s=Math.min(e.length-r,2);i<s;++i){e[r+i]=(t&255<<8*(n?i:1-i))>>>(n?i:1-i)*8}}pe.prototype.writeUInt16LE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,2,65535,0);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t&255;this[r+1]=t>>>8}else{Je(this,t,r,true)}return r+2};pe.prototype.writeUInt16BE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,2,65535,0);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t>>>8;this[r+1]=t&255}else{Je(this,t,r,false)}return r+2};function qe(e,t,r,n){if(t<0)t=4294967295+t+1;for(var i=0,s=Math.min(e.length-r,4);i<s;++i){e[r+i]=t>>>(n?i:3-i)*8&255}}pe.prototype.writeUInt32LE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,4,4294967295,0);if(pe.TYPED_ARRAY_SUPPORT){this[r+3]=t>>>24;this[r+2]=t>>>16;this[r+1]=t>>>8;this[r]=t&255}else{qe(this,t,r,true)}return r+4};pe.prototype.writeUInt32BE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,4,4294967295,0);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t>>>24;this[r+1]=t>>>16;this[r+2]=t>>>8;this[r+3]=t&255}else{qe(this,t,r,false)}return r+4};pe.prototype.writeIntLE=function e(t,r,n,i){t=+t;r=r|0;if(!i){var s=Math.pow(2,8*n-1);Xe(this,t,r,n,s-1,-s)}var a=0;var o=1;var l=0;this[r]=t&255;while(++a<n&&(o*=256)){if(t<0&&l===0&&this[r+a-1]!==0){l=1}this[r+a]=(t/o>>0)-l&255}return r+n};pe.prototype.writeIntBE=function e(t,r,n,i){t=+t;r=r|0;if(!i){var s=Math.pow(2,8*n-1);Xe(this,t,r,n,s-1,-s)}var a=n-1;var o=1;var l=0;this[r+a]=t&255;while(--a>=0&&(o*=256)){if(t<0&&l===0&&this[r+a+1]!==0){l=1}this[r+a]=(t/o>>0)-l&255}return r+n};pe.prototype.writeInt8=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,1,127,-128);if(!pe.TYPED_ARRAY_SUPPORT)t=Math.floor(t);if(t<0)t=255+t+1;this[r]=t&255;return r+1};pe.prototype.writeInt16LE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,2,32767,-32768);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t&255;this[r+1]=t>>>8}else{Je(this,t,r,true)}return r+2};pe.prototype.writeInt16BE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,2,32767,-32768);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t>>>8;this[r+1]=t&255}else{Je(this,t,r,false)}return r+2};pe.prototype.writeInt32LE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,4,2147483647,-2147483648);if(pe.TYPED_ARRAY_SUPPORT){this[r]=t&255;this[r+1]=t>>>8;this[r+2]=t>>>16;this[r+3]=t>>>24}else{qe(this,t,r,true)}return r+4};pe.prototype.writeInt32BE=function e(t,r,n){t=+t;r=r|0;if(!n)Xe(this,t,r,4,2147483647,-2147483648);if(t<0)t=4294967295+t+1;if(pe.TYPED_ARRAY_SUPPORT){this[r]=t>>>24;this[r+1]=t>>>16;this[r+2]=t>>>8;this[r+3]=t&255}else{qe(this,t,r,false)}return r+4};function We(e,t,r,n,i,s){if(r+n>e.length)throw new RangeError("Index out of range");if(r<0)throw new RangeError("Index out of range")}function He(e,t,r,n,i){if(!i){We(e,t,r,4)}oe(e,t,r,n,23,4);return r+4}pe.prototype.writeFloatLE=function e(t,r,n){return He(this,t,r,true,n)};pe.prototype.writeFloatBE=function e(t,r,n){return He(this,t,r,false,n)};function Ke(e,t,r,n,i){if(!i){We(e,t,r,8)}oe(e,t,r,n,52,8);return r+8}pe.prototype.writeDoubleLE=function e(t,r,n){return Ke(this,t,r,true,n)};pe.prototype.writeDoubleBE=function e(t,r,n){return Ke(this,t,r,false,n)};pe.prototype.copy=function e(t,r,n,i){if(!n)n=0;if(!i&&i!==0)i=this.length;if(r>=t.length)r=t.length;if(!r)r=0;if(i>0&&i<n)i=n;if(i===n)return 0;if(t.length===0||this.length===0)return 0;if(r<0){throw new RangeError("targetStart out of bounds")}if(n<0||n>=this.length)throw new RangeError("sourceStart out of bounds");if(i<0)throw new RangeError("sourceEnd out of bounds");if(i>this.length)i=this.length;if(t.length-r<i-n){i=t.length-r+n}var s=i-n;var a;if(this===t&&n<r&&r<i){for(a=s-1;a>=0;--a){t[a+r]=this[a+n]}}else if(s<1e3||!pe.TYPED_ARRAY_SUPPORT){for(a=0;a<s;++a){t[a+r]=this[a+n]}}else{Uint8Array.prototype.set.call(t,this.subarray(n,n+s),r)}return s};pe.prototype.fill=function e(t,r,n,i){if(typeof t==="string"){if(typeof r==="string"){i=r;r=0;n=this.length}else if(typeof n==="string"){i=n;n=this.length}if(t.length===1){var s=t.charCodeAt(0);if(s<256){t=s}}if(i!==undefined&&typeof i!=="string"){throw new TypeError("encoding must be a string")}if(typeof i==="string"&&!pe.isEncoding(i)){throw new TypeError("Unknown encoding: "+i)}}else if(typeof t==="number"){t=t&255}if(r<0||this.length<r||this.length<n){throw new RangeError("Out of range index")}if(n<=r){return this}r=r>>>0;n=n===undefined?this.length:n>>>0;if(!t)t=0;var a;if(typeof t==="number"){for(a=r;a<n;++a){this[a]=t}}else{var o=De(t)?t:et(new pe(t,i).toString());var l=o.length;for(a=0;a<n-r;++a){this[a+r]=o[a%l]}}return this};var $e=/[^+\/0-9A-Za-z-_]/g;function Ye(e){e=Qe(e).replace($e,"");if(e.length<2)return"";while(e.length%4!==0){e=e+"="}return e}function Qe(e){if(e.trim)return e.trim();return e.replace(/^\s+|\s+$/g,"")}function Ze(e){if(e<16)return"0"+e.toString(16);return e.toString(16)}function et(e,t){t=t||Infinity;var r;var n=e.length;var i=null;var s=[];for(var a=0;a<n;++a){r=e.charCodeAt(a);if(r>55295&&r<57344){if(!i){if(r>56319){if((t-=3)>-1)s.push(239,191,189);continue}else if(a+1===n){if((t-=3)>-1)s.push(239,191,189);continue}i=r;continue}if(r<56320){if((t-=3)>-1)s.push(239,191,189);i=r;continue}r=(i-55296<<10|r-56320)+65536}else if(i){if((t-=3)>-1)s.push(239,191,189)}i=null;if(r<128){if((t-=1)<0)break;s.push(r)}else if(r<2048){if((t-=2)<0)break;s.push(r>>6|192,r&63|128)}else if(r<65536){if((t-=3)<0)break;s.push(r>>12|224,r>>6&63|128,r&63|128)}else if(r<1114112){if((t-=4)<0)break;s.push(r>>18|240,r>>12&63|128,r>>6&63|128,r&63|128)}else{throw new Error("Invalid code point")}}return s}function tt(e){var t=[];for(var r=0;r<e.length;++r){t.push(e.charCodeAt(r)&255)}return t}function rt(e,t){var r,n,i;var s=[];for(var a=0;a<e.length;++a){if((t-=2)<0)break;r=e.charCodeAt(a);n=r>>8;i=r%256;s.push(i);s.push(n)}return s}function nt(e){return re(Ye(e))}function it(e,t,r,n){for(var i=0;i<n;++i){if(i+r>=t.length||i>=e.length)break;t[i+r]=e[i]}return i}function st(e){return e!==e}function at(e){return e!=null&&(!!e._isBuffer||ot(e)||lt(e))}function ot(e){return!!e.constructor&&typeof e.constructor.isBuffer==="function"&&e.constructor.isBuffer(e)}function lt(e){return typeof e.readFloatLE==="function"&&typeof e.slice==="function"&&ot(e.slice(0,0))}if(typeof Lt.setTimeout==="function");if(typeof Lt.clearTimeout==="function");var ut=Lt.performance||{};var ct=ut.now||ut.mozNow||ut.msNow||ut.oNow||ut.webkitNow||function(){return(new Date).getTime()};var ft;if(typeof Object.create==="function"){ft=function e(t,r){t.super_=r;t.prototype=Object.create(r.prototype,{constructor:{value:t,enumerable:false,writable:true,configurable:true}})}}else{ft=function e(t,r){t.super_=r;var n=function e(){};n.prototype=r.prototype;t.prototype=new n;t.prototype.constructor=t}}var ht=ft;function pt(e,t){var r={seen:[],stylize:mt};if(arguments.length>=3)r.depth=arguments[2];if(arguments.length>=4)r.colors=arguments[3];if(Ct(t)){r.showHidden=t}else if(t){Ot(r,t)}if(kt(r.showHidden))r.showHidden=false;if(kt(r.depth))r.depth=2;if(kt(r.colors))r.colors=false;if(kt(r.customInspect))r.customInspect=true;if(r.colors)r.stylize=dt;return gt(r,e,r.depth)}pt.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]};pt.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"};function dt(e,t){var r=pt.styles[t];if(r){return"["+pt.colors[r][0]+"m"+e+"["+pt.colors[r][1]+"m"}else{return e}}function mt(e,t){return e}function vt(e){var t={};e.forEach(function(e,r){t[e]=true});return t}function gt(e,t,r){if(e.customInspect&&t&&Mt(t.inspect)&&t.inspect!==pt&&!(t.constructor&&t.constructor.prototype===t)){var n=t.inspect(r,e);if(!Tt(n)){n=gt(e,n,r)}return n}var i=yt(e,t);if(i){return i}var s=Object.keys(t);var a=vt(s);if(e.showHidden){s=Object.getOwnPropertyNames(t)}if(It(t)&&(s.indexOf("message")>=0||s.indexOf("description")>=0)){return xt(t)}if(s.length===0){if(Mt(t)){var o=t.name?": "+t.name:"";return e.stylize("[Function"+o+"]","special")}if(_t(t)){return e.stylize(RegExp.prototype.toString.call(t),"regexp")}if(Ft(t)){return e.stylize(Date.prototype.toString.call(t),"date")}if(It(t)){return xt(t)}}var l="",u=false,c=["{","}"];if(Dt(t)){u=true;c=["[","]"]}if(Mt(t)){var f=t.name?": "+t.name:"";l=" [Function"+f+"]"}if(_t(t)){l=" "+RegExp.prototype.toString.call(t)}if(Ft(t)){l=" "+Date.prototype.toUTCString.call(t)}if(It(t)){l=" "+xt(t)}if(s.length===0&&(!u||t.length==0)){return c[0]+l+c[1]}if(r<0){if(_t(t)){return e.stylize(RegExp.prototype.toString.call(t),"regexp")}else{return e.stylize("[Object]","special")}}e.seen.push(t);var h;if(u){h=Et(e,t,r,a,s)}else{h=s.map(function(n){return bt(e,t,r,a,n,u)})}e.seen.pop();return St(h,l,c)}function yt(e,t){if(kt(t))return e.stylize("undefined","undefined");if(Tt(t)){var r="'"+JSON.stringify(t).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return e.stylize(r,"string")}if(At(t))return e.stylize(""+t,"number");if(Ct(t))return e.stylize(""+t,"boolean");if(wt(t))return e.stylize("null","null")}function xt(e){return"["+Error.prototype.toString.call(e)+"]"}function Et(e,t,r,n,i){var s=[];for(var a=0,o=t.length;a<o;++a){if(Rt(t,String(a))){s.push(bt(e,t,r,n,String(a),true))}else{s.push("")}}i.forEach(function(i){if(!i.match(/^\d+$/)){s.push(bt(e,t,r,n,i,true))}});return s}function bt(e,t,r,n,i,s){var a,o,l;l=Object.getOwnPropertyDescriptor(t,i)||{value:t[i]};if(l.get){if(l.set){o=e.stylize("[Getter/Setter]","special")}else{o=e.stylize("[Getter]","special")}}else{if(l.set){o=e.stylize("[Setter]","special")}}if(!Rt(n,i)){a="["+i+"]"}if(!o){if(e.seen.indexOf(l.value)<0){if(wt(r)){o=gt(e,l.value,null)}else{o=gt(e,l.value,r-1)}if(o.indexOf("\n")>-1){if(s){o=o.split("\n").map(function(e){return"  "+e}).join("\n").substr(2)}else{o="\n"+o.split("\n").map(function(e){return"   "+e}).join("\n")}}}else{o=e.stylize("[Circular]","special")}}if(kt(a)){if(s&&i.match(/^\d+$/)){return o}a=JSON.stringify(""+i);if(a.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)){a=a.substr(1,a.length-2);a=e.stylize(a,"name")}else{a=a.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'");a=e.stylize(a,"string")}}return a+": "+o}function St(e,t,r){var n=e.reduce(function(e,t){if(t.indexOf("\n")>=0);return e+t.replace(/\u001b\[\d\d?m/g,"").length+1},0);if(n>60){return r[0]+(t===""?"":t+"\n ")+" "+e.join(",\n  ")+" "+r[1]}return r[0]+t+" "+e.join(", ")+" "+r[1]}function Dt(e){return Array.isArray(e)}function Ct(e){return typeof e==="boolean"}function wt(e){return e===null}function At(e){return typeof e==="number"}function Tt(e){return typeof e==="string"}function kt(e){return e===void 0}function _t(e){return Pt(e)&&Bt(e)==="[object RegExp]"}function Pt(e){return typeof e==="object"&&e!==null}function Ft(e){return Pt(e)&&Bt(e)==="[object Date]"}function It(e){return Pt(e)&&(Bt(e)==="[object Error]"||e instanceof Error)}function Mt(e){return typeof e==="function"}function Nt(e){return e===null||typeof e==="boolean"||typeof e==="number"||typeof e==="string"||typeof e==="symbol"||typeof e==="undefined"}function Bt(e){return Object.prototype.toString.call(e)}function Ot(e,t){if(!t||!Pt(t))return e;var r=Object.keys(t);var n=r.length;while(n--){e[r[n]]=t[r[n]]}return e}function Rt(e,t){return Object.prototype.hasOwnProperty.call(e,t)}function jt(e,t){if(e===t){return 0}var r=e.length;var n=t.length;for(var i=0,s=Math.min(r,n);i<s;++i){if(e[i]!==t[i]){r=e[i];n=t[i];break}}if(r<n){return-1}if(n<r){return 1}return 0}var Ut=Object.prototype.hasOwnProperty;var Vt=Object.keys||function(e){var t=[];for(var r in e){if(Ut.call(e,r))t.push(r)}return t};var Gt=Array.prototype.slice;var zt;function Xt(){if(typeof zt!=="undefined"){return zt}return zt=function(){return function e(){}.name==="foo"}()}function Jt(e){return Object.prototype.toString.call(e)}function qt(e){if(at(e)){return false}if(typeof Lt.ArrayBuffer!=="function"){return false}if(typeof ArrayBuffer.isView==="function"){return ArrayBuffer.isView(e)}if(!e){return false}if(e instanceof DataView){return true}if(e.buffer&&e.buffer instanceof ArrayBuffer){return true}return false}function Wt(e,t){if(!e)er(e,true,t,"==",tr)}var Ht=/\s*function\s+([^\(\s]*)\s*/;function Kt(e){if(!Mt(e)){return}if(Xt()){return e.name}var t=e.toString();var r=t.match(Ht);return r&&r[1]}Wt.AssertionError=$t;function $t(e){this.name="AssertionError";this.actual=e.actual;this.expected=e.expected;this.operator=e.operator;if(e.message){this.message=e.message;this.generatedMessage=false}else{this.message=Zt(this);this.generatedMessage=true}var t=e.stackStartFunction||er;if(Error.captureStackTrace){Error.captureStackTrace(this,t)}else{var r=new Error;if(r.stack){var n=r.stack;var i=Kt(t);var s=n.indexOf("\n"+i);if(s>=0){var a=n.indexOf("\n",s+1);n=n.substring(a+1)}this.stack=n}}}ht($t,Error);function Yt(e,t){if(typeof e==="string"){return e.length<t?e:e.slice(0,t)}else{return e}}function Qt(e){if(Xt()||!Mt(e)){return pt(e)}var t=Kt(e);var r=t?": "+t:"";return"[Function"+r+"]"}function Zt(e){return Yt(Qt(e.actual),128)+" "+e.operator+" "+Yt(Qt(e.expected),128)}function er(e,t,r,n,i){throw new $t({message:r,actual:e,expected:t,operator:n,stackStartFunction:i})}Wt.fail=er;function tr(e,t){if(!e)er(e,true,t,"==",tr)}Wt.ok=tr;Wt.equal=rr;function rr(e,t,r){if(e!=t)er(e,t,r,"==",rr)}Wt.notEqual=nr;function nr(e,t,r){if(e==t){er(e,t,r,"!=",nr)}}Wt.deepEqual=ir;function ir(e,t,r){if(!ar(e,t,false)){er(e,t,r,"deepEqual",ir)}}Wt.deepStrictEqual=sr;function sr(e,t,r){if(!ar(e,t,true)){er(e,t,r,"deepStrictEqual",sr)}}function ar(e,t,r,n){if(e===t){return true}else if(at(e)&&at(t)){return jt(e,t)===0}else if(Ft(e)&&Ft(t)){return e.getTime()===t.getTime()}else if(_t(e)&&_t(t)){return e.source===t.source&&e.global===t.global&&e.multiline===t.multiline&&e.lastIndex===t.lastIndex&&e.ignoreCase===t.ignoreCase}else if((e===null||typeof e!=="object")&&(t===null||typeof t!=="object")){return r?e===t:e==t}else if(qt(e)&&qt(t)&&Jt(e)===Jt(t)&&!(e instanceof Float32Array||e instanceof Float64Array)){return jt(new Uint8Array(e.buffer),new Uint8Array(t.buffer))===0}else if(at(e)!==at(t)){return false}else{n=n||{actual:[],expected:[]};var i=n.actual.indexOf(e);if(i!==-1){if(i===n.expected.indexOf(t)){return true}}n.actual.push(e);n.expected.push(t);return lr(e,t,r,n)}}function or(e){return Object.prototype.toString.call(e)=="[object Arguments]"}function lr(e,t,r,n){if(e===null||e===undefined||t===null||t===undefined)return false;if(Nt(e)||Nt(t))return e===t;if(r&&Object.getPrototypeOf(e)!==Object.getPrototypeOf(t))return false;var i=or(e);var s=or(t);if(i&&!s||!i&&s)return false;if(i){e=Gt.call(e);t=Gt.call(t);return ar(e,t,r)}var a=Vt(e);var o=Vt(t);var l,u;if(a.length!==o.length)return false;a.sort();o.sort();for(u=a.length-1;u>=0;u--){if(a[u]!==o[u])return false}for(u=a.length-1;u>=0;u--){l=a[u];if(!ar(e[l],t[l],r,n))return false}return true}Wt.notDeepEqual=ur;function ur(e,t,r){if(ar(e,t,false)){er(e,t,r,"notDeepEqual",ur)}}Wt.notDeepStrictEqual=cr;function cr(e,t,r){if(ar(e,t,true)){er(e,t,r,"notDeepStrictEqual",cr)}}Wt.strictEqual=fr;function fr(e,t,r){if(e!==t){er(e,t,r,"===",fr)}}Wt.notStrictEqual=hr;function hr(e,t,r){if(e===t){er(e,t,r,"!==",hr)}}function pr(e,t){if(!e||!t){return false}if(Object.prototype.toString.call(t)=="[object RegExp]"){return t.test(e)}try{if(e instanceof t){return true}}catch(e){}if(Error.isPrototypeOf(t)){return false}return t.call({},e)===true}function dr(e){var t;try{e()}catch(e){t=e}return t}function mr(e,t,r,n){var i;if(typeof t!=="function"){throw new TypeError('"block" argument must be a function')}if(typeof r==="string"){n=r;r=null}i=dr(t);n=(r&&r.name?" ("+r.name+").":".")+(n?" "+n:".");if(e&&!i){er(i,r,"Missing expected exception"+n)}var s=typeof n==="string";var a=!e&&It(i);var o=!e&&i&&!r;if(a&&s&&pr(i,r)||o){er(i,r,"Got unwanted exception"+n)}if(e&&i&&r&&!pr(i,r)||!e&&i){throw i}}Wt.throws=vr;function vr(e,t,r){mr(true,e,t,r)}Wt.doesNotThrow=gr;function gr(e,t,r){mr(false,e,t,r)}Wt.ifError=yr;function yr(e){if(e)throw e}var xr="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");var Er=function e(t){if(0<=t&&t<xr.length){return xr[t]}throw new TypeError("Must be between 0 and 63: "+t)};var br=function e(t){var r=65;var n=90;var i=97;var s=122;var a=48;var o=57;var l=43;var u=47;var c=26;var f=52;if(r<=t&&t<=n){return t-r}if(i<=t&&t<=s){return t-i+c}if(a<=t&&t<=o){return t-a+f}if(t==l){return 62}if(t==u){return 63}return-1};var Sr={encode:Er,decode:br};var Dr=5;var Cr=1<<Dr;var wr=Cr-1;var Ar=Cr;function Tr(e){return e<0?(-e<<1)+1:(e<<1)+0}function kr(e){var t=(e&1)===1;var r=e>>1;return t?-r:r}var _r=function e(t){var r="";var n;var i=Tr(t);do{n=i&wr;i>>>=Dr;if(i>0){n|=Ar}r+=Sr.encode(n)}while(i>0);return r};var Pr=function e(t,r,n){var i=t.length;var s=0;var a=0;var o,l;do{if(r>=i){throw new Error("Expected more digits in base 64 VLQ value.")}l=Sr.decode(t.charCodeAt(r++));if(l===-1){throw new Error("Invalid base64 digit: "+t.charAt(r-1))}o=!!(l&Ar);l&=wr;s=s+(l<<a);a+=Dr}while(o);n.value=kr(s);n.rest=r};var Fr={encode:_r,decode:Pr};var Ir=l(function(e,t){function r(e,t,r){if(t in e){return e[t]}else if(arguments.length===3){return r}else{throw new Error('"'+t+'" is a required argument.')}}t.getArg=r;var n=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;var i=/^data:.+\,.+$/;function s(e){var t=e.match(n);if(!t){return null}return{scheme:t[1],auth:t[2],host:t[3],port:t[4],path:t[5]}}t.urlParse=s;function a(e){var t="";if(e.scheme){t+=e.scheme+":"}t+="//";if(e.auth){t+=e.auth+"@"}if(e.host){t+=e.host}if(e.port){t+=":"+e.port}if(e.path){t+=e.path}return t}t.urlGenerate=a;function o(e){var r=e;var n=s(e);if(n){if(!n.path){return e}r=n.path}var i=t.isAbsolute(r);var o=r.split(/\/+/);for(var l,u=0,c=o.length-1;c>=0;c--){l=o[c];if(l==="."){o.splice(c,1)}else if(l===".."){u++}else if(u>0){if(l===""){o.splice(c+1,u);u=0}else{o.splice(c,2);u--}}}r=o.join("/");if(r===""){r=i?"/":"."}if(n){n.path=r;return a(n)}return r}t.normalize=o;function l(e,t){if(e===""){e="."}if(t===""){t="."}var r=s(t);var n=s(e);if(n){e=n.path||"/"}if(r&&!r.scheme){if(n){r.scheme=n.scheme}return a(r)}if(r||t.match(i)){return t}if(n&&!n.host&&!n.path){n.host=t;return a(n)}var l=t.charAt(0)==="/"?t:o(e.replace(/\/+$/,"")+"/"+t);if(n){n.path=l;return a(n)}return l}t.join=l;t.isAbsolute=function(e){return e.charAt(0)==="/"||n.test(e)};function u(e,t){if(e===""){e="."}e=e.replace(/\/$/,"");var r=0;while(t.indexOf(e+"/")!==0){var n=e.lastIndexOf("/");if(n<0){return t}e=e.slice(0,n);if(e.match(/^([^\/]+:\/)?\/*$/)){return t}++r}return Array(r+1).join("../")+t.substr(e.length+1)}t.relative=u;var c=function(){var e=Object.create(null);return!("__proto__"in e)}();function f(e){return e}function h(e){if(d(e)){return"$"+e}return e}t.toSetString=c?f:h;function p(e){if(d(e)){return e.slice(1)}return e}t.fromSetString=c?f:p;function d(e){if(!e){return false}var t=e.length;if(t<9){return false}if(e.charCodeAt(t-1)!==95||e.charCodeAt(t-2)!==95||e.charCodeAt(t-3)!==111||e.charCodeAt(t-4)!==116||e.charCodeAt(t-5)!==111||e.charCodeAt(t-6)!==114||e.charCodeAt(t-7)!==112||e.charCodeAt(t-8)!==95||e.charCodeAt(t-9)!==95){return false}for(var r=t-10;r>=0;r--){if(e.charCodeAt(r)!==36){return false}}return true}function m(e,t,r){var n=g(e.source,t.source);if(n!==0){return n}n=e.originalLine-t.originalLine;if(n!==0){return n}n=e.originalColumn-t.originalColumn;if(n!==0||r){return n}n=e.generatedColumn-t.generatedColumn;if(n!==0){return n}n=e.generatedLine-t.generatedLine;if(n!==0){return n}return g(e.name,t.name)}t.compareByOriginalPositions=m;function v(e,t,r){var n=e.generatedLine-t.generatedLine;if(n!==0){return n}n=e.generatedColumn-t.generatedColumn;if(n!==0||r){return n}n=g(e.source,t.source);if(n!==0){return n}n=e.originalLine-t.originalLine;if(n!==0){return n}n=e.originalColumn-t.originalColumn;if(n!==0){return n}return g(e.name,t.name)}t.compareByGeneratedPositionsDeflated=v;function g(e,t){if(e===t){return 0}if(e===null){return 1}if(t===null){return-1}if(e>t){return 1}return-1}function y(e,t){var r=e.generatedLine-t.generatedLine;if(r!==0){return r}r=e.generatedColumn-t.generatedColumn;if(r!==0){return r}r=g(e.source,t.source);if(r!==0){return r}r=e.originalLine-t.originalLine;if(r!==0){return r}r=e.originalColumn-t.originalColumn;if(r!==0){return r}return g(e.name,t.name)}t.compareByGeneratedPositionsInflated=y;function x(e){return JSON.parse(e.replace(/^\)]}'[^\n]*\n/,""))}t.parseSourceMapInput=x;function E(e,t,r){t=t||"";if(e){if(e[e.length-1]!=="/"&&t[0]!=="/"){e+="/"}t=e+t}if(r){var n=s(r);if(!n){throw new Error("sourceMapURL could not be parsed")}if(n.path){var i=n.path.lastIndexOf("/");if(i>=0){n.path=n.path.substring(0,i+1)}}t=l(a(n),t)}return o(t)}t.computeSourceURL=E});var Mr=Ir.getArg;var Nr=Ir.urlParse;var Lr=Ir.urlGenerate;var Br=Ir.normalize;var Or=Ir.join;var Rr=Ir.isAbsolute;var jr=Ir.relative;var Ur=Ir.toSetString;var Vr=Ir.fromSetString;var Gr=Ir.compareByOriginalPositions;var zr=Ir.compareByGeneratedPositionsDeflated;var Xr=Ir.compareByGeneratedPositionsInflated;var Jr=Ir.parseSourceMapInput;var qr=Ir.computeSourceURL;var Wr=Object.prototype.hasOwnProperty;var Hr=typeof Map!=="undefined";function Kr(){this._array=[];this._set=Hr?new Map:Object.create(null)}Kr.fromArray=function e(t,r){var n=new Kr;for(var i=0,s=t.length;i<s;i++){n.add(t[i],r)}return n};Kr.prototype.size=function e(){return Hr?this._set.size:Object.getOwnPropertyNames(this._set).length};Kr.prototype.add=function e(t,r){var n=Hr?t:Ir.toSetString(t);var i=Hr?this.has(t):Wr.call(this._set,n);var s=this._array.length;if(!i||r){this._array.push(t)}if(!i){if(Hr){this._set.set(t,s)}else{this._set[n]=s}}};Kr.prototype.has=function e(t){if(Hr){return this._set.has(t)}else{var r=Ir.toSetString(t);return Wr.call(this._set,r)}};Kr.prototype.indexOf=function e(t){if(Hr){var r=this._set.get(t);if(r>=0){return r}}else{var n=Ir.toSetString(t);if(Wr.call(this._set,n)){return this._set[n]}}throw new Error('"'+t+'" is not in the set.')};Kr.prototype.at=function e(t){if(t>=0&&t<this._array.length){return this._array[t]}throw new Error("No element indexed by "+t)};Kr.prototype.toArray=function e(){return this._array.slice()};var $r=Kr;var Yr={ArraySet:$r};function Qr(e,t){var r=e.generatedLine;var n=t.generatedLine;var i=e.generatedColumn;var s=t.generatedColumn;return n>r||n==r&&s>=i||Ir.compareByGeneratedPositionsInflated(e,t)<=0}function Zr(){this._array=[];this._sorted=true;this._last={generatedLine:-1,generatedColumn:0}}Zr.prototype.unsortedForEach=function e(t,r){this._array.forEach(t,r)};Zr.prototype.add=function e(t){if(Qr(this._last,t)){this._last=t;this._array.push(t)}else{this._sorted=false;this._array.push(t)}};Zr.prototype.toArray=function e(){if(!this._sorted){this._array.sort(Ir.compareByGeneratedPositionsInflated);this._sorted=true}return this._array};var en=Zr;var tn={MappingList:en};var rn=Yr.ArraySet;var nn=tn.MappingList;function sn(e){if(!e){e={}}this._file=Ir.getArg(e,"file",null);this._sourceRoot=Ir.getArg(e,"sourceRoot",null);this._skipValidation=Ir.getArg(e,"skipValidation",false);this._sources=new rn;this._names=new rn;this._mappings=new nn;this._sourcesContents=null}sn.prototype._version=3;sn.fromSourceMap=function e(t){var r=t.sourceRoot;var n=new sn({file:t.file,sourceRoot:r});t.eachMapping(function(e){var t={generated:{line:e.generatedLine,column:e.generatedColumn}};if(e.source!=null){t.source=e.source;if(r!=null){t.source=Ir.relative(r,t.source)}t.original={line:e.originalLine,column:e.originalColumn};if(e.name!=null){t.name=e.name}}n.addMapping(t)});t.sources.forEach(function(e){var i=e;if(r!==null){i=Ir.relative(r,e)}if(!n._sources.has(i)){n._sources.add(i)}var s=t.sourceContentFor(e);if(s!=null){n.setSourceContent(e,s)}});return n};sn.prototype.addMapping=function e(t){var r=Ir.getArg(t,"generated");var n=Ir.getArg(t,"original",null);var i=Ir.getArg(t,"source",null);var s=Ir.getArg(t,"name",null);if(!this._skipValidation){this._validateMapping(r,n,i,s)}if(i!=null){i=String(i);if(!this._sources.has(i)){this._sources.add(i)}}if(s!=null){s=String(s);if(!this._names.has(s)){this._names.add(s)}}this._mappings.add({generatedLine:r.line,generatedColumn:r.column,originalLine:n!=null&&n.line,originalColumn:n!=null&&n.column,source:i,name:s})};sn.prototype.setSourceContent=function e(t,r){var n=t;if(this._sourceRoot!=null){n=Ir.relative(this._sourceRoot,n)}if(r!=null){if(!this._sourcesContents){this._sourcesContents=Object.create(null)}this._sourcesContents[Ir.toSetString(n)]=r}else if(this._sourcesContents){delete this._sourcesContents[Ir.toSetString(n)];if(Object.keys(this._sourcesContents).length===0){this._sourcesContents=null}}};sn.prototype.applySourceMap=function e(t,r,n){var i=r;if(r==null){if(t.file==null){throw new Error("SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, "+'or the source map\'s "file" property. Both were omitted.')}i=t.file}var s=this._sourceRoot;if(s!=null){i=Ir.relative(s,i)}var a=new rn;var o=new rn;this._mappings.unsortedForEach(function(e){if(e.source===i&&e.originalLine!=null){var r=t.originalPositionFor({line:e.originalLine,column:e.originalColumn});if(r.source!=null){e.source=r.source;if(n!=null){e.source=Ir.join(n,e.source)}if(s!=null){e.source=Ir.relative(s,e.source)}e.originalLine=r.line;e.originalColumn=r.column;if(r.name!=null){e.name=r.name}}}var l=e.source;if(l!=null&&!a.has(l)){a.add(l)}var u=e.name;if(u!=null&&!o.has(u)){o.add(u)}},this);this._sources=a;this._names=o;t.sources.forEach(function(e){var r=t.sourceContentFor(e);if(r!=null){if(n!=null){e=Ir.join(n,e)}if(s!=null){e=Ir.relative(s,e)}this.setSourceContent(e,r)}},this)};sn.prototype._validateMapping=function e(t,r,n,i){if(r&&typeof r.line!=="number"&&typeof r.column!=="number"){throw new Error("original.line and original.column are not numbers -- you probably meant to omit "+"the original mapping entirely and only map the generated position. If so, pass "+"null for the original mapping instead of an object with empty or null values.")}if(t&&"line"in t&&"column"in t&&t.line>0&&t.column>=0&&!r&&!n&&!i){return}else if(t&&"line"in t&&"column"in t&&r&&"line"in r&&"column"in r&&t.line>0&&t.column>=0&&r.line>0&&r.column>=0&&n){return}else{throw new Error("Invalid mapping: "+JSON.stringify({generated:t,source:n,original:r,name:i}))}};sn.prototype._serializeMappings=function e(){var t=0;var r=1;var n=0;var i=0;var s=0;var a=0;var o="";var l;var u;var c;var f;var h=this._mappings.toArray();for(var p=0,d=h.length;p<d;p++){u=h[p];l="";if(u.generatedLine!==r){t=0;while(u.generatedLine!==r){l+=";";r++}}else{if(p>0){if(!Ir.compareByGeneratedPositionsInflated(u,h[p-1])){continue}l+=","}}l+=Fr.encode(u.generatedColumn-t);t=u.generatedColumn;if(u.source!=null){f=this._sources.indexOf(u.source);l+=Fr.encode(f-a);a=f;l+=Fr.encode(u.originalLine-1-i);i=u.originalLine-1;l+=Fr.encode(u.originalColumn-n);n=u.originalColumn;if(u.name!=null){c=this._names.indexOf(u.name);l+=Fr.encode(c-s);s=c}}o+=l}return o};sn.prototype._generateSourcesContent=function e(t,r){return t.map(function(e){if(!this._sourcesContents){return null}if(r!=null){e=Ir.relative(r,e)}var t=Ir.toSetString(e);return Object.prototype.hasOwnProperty.call(this._sourcesContents,t)?this._sourcesContents[t]:null},this)};sn.prototype.toJSON=function e(){var t={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};if(this._file!=null){t.file=this._file}if(this._sourceRoot!=null){t.sourceRoot=this._sourceRoot}if(this._sourcesContents){t.sourcesContent=this._generateSourcesContent(t.sources,t.sourceRoot)}return t};sn.prototype.toString=function e(){return JSON.stringify(this.toJSON())};var an=sn;var on={SourceMapGenerator:an};var ln=l(function(e,t){t.GREATEST_LOWER_BOUND=1;t.LEAST_UPPER_BOUND=2;function r(e,n,i,s,a,o){var l=Math.floor((n-e)/2)+e;var u=a(i,s[l],true);if(u===0){return l}else if(u>0){if(n-l>1){return r(l,n,i,s,a,o)}if(o==t.LEAST_UPPER_BOUND){return n<s.length?n:-1}else{return l}}else{if(l-e>1){return r(e,l,i,s,a,o)}if(o==t.LEAST_UPPER_BOUND){return l}else{return e<0?-1:e}}}t.search=function e(n,i,s,a){if(i.length===0){return-1}var o=r(-1,i.length,n,i,s,a||t.GREATEST_LOWER_BOUND);if(o<0){return-1}while(o-1>=0){if(s(i[o],i[o-1],true)!==0){break}--o}return o}});var un=ln.GREATEST_LOWER_BOUND;var cn=ln.LEAST_UPPER_BOUND;var fn=ln.search;function hn(e,t,r){var n=e[t];e[t]=e[r];e[r]=n}function pn(e,t){return Math.round(e+Math.random()*(t-e))}function dn(e,t,r,n){if(r<n){var i=pn(r,n);var s=r-1;hn(e,i,n);var a=e[n];for(var o=r;o<n;o++){if(t(e[o],a)<=0){s+=1;hn(e,s,o)}}hn(e,s+1,o);var l=s+1;dn(e,t,r,l-1);dn(e,t,l+1,n)}}var mn=function e(t,r){dn(t,r,0,t.length-1)};var vn={quickSort:mn};var gn=Yr.ArraySet;var yn=vn.quickSort;function xn(e,t){var r=e;if(typeof e==="string"){r=Ir.parseSourceMapInput(e)}return r.sections!=null?new Cn(r,t):new bn(r,t)}xn.fromSourceMap=function(e,t){return bn.fromSourceMap(e,t)};xn.prototype._version=3;xn.prototype.__generatedMappings=null;Object.defineProperty(xn.prototype,"_generatedMappings",{configurable:true,enumerable:true,get:function e(){if(!this.__generatedMappings){this._parseMappings(this._mappings,this.sourceRoot)}return this.__generatedMappings}});xn.prototype.__originalMappings=null;Object.defineProperty(xn.prototype,"_originalMappings",{configurable:true,enumerable:true,get:function e(){if(!this.__originalMappings){this._parseMappings(this._mappings,this.sourceRoot)}return this.__originalMappings}});xn.prototype._charIsMappingSeparator=function e(t,r){var n=t.charAt(r);return n===";"||n===","};xn.prototype._parseMappings=function e(t,r){throw new Error("Subclasses must implement _parseMappings")};xn.GENERATED_ORDER=1;xn.ORIGINAL_ORDER=2;xn.GREATEST_LOWER_BOUND=1;xn.LEAST_UPPER_BOUND=2;xn.prototype.eachMapping=function e(t,r,n){var i=r||null;var s=n||xn.GENERATED_ORDER;var a;switch(s){case xn.GENERATED_ORDER:a=this._generatedMappings;break;case xn.ORIGINAL_ORDER:a=this._originalMappings;break;default:throw new Error("Unknown order of iteration.")}var o=this.sourceRoot;a.map(function(e){var t=e.source===null?null:this._sources.at(e.source);t=Ir.computeSourceURL(o,t,this._sourceMapURL);return{source:t,generatedLine:e.generatedLine,generatedColumn:e.generatedColumn,originalLine:e.originalLine,originalColumn:e.originalColumn,name:e.name===null?null:this._names.at(e.name)}},this).forEach(t,i)};xn.prototype.allGeneratedPositionsFor=function e(t){var r=Ir.getArg(t,"line");var n={source:Ir.getArg(t,"source"),originalLine:r,originalColumn:Ir.getArg(t,"column",0)};n.source=this._findSourceIndex(n.source);if(n.source<0){return[]}var i=[];var s=this._findMapping(n,this._originalMappings,"originalLine","originalColumn",Ir.compareByOriginalPositions,ln.LEAST_UPPER_BOUND);if(s>=0){var a=this._originalMappings[s];if(t.column===undefined){var o=a.originalLine;while(a&&a.originalLine===o){i.push({line:Ir.getArg(a,"generatedLine",null),column:Ir.getArg(a,"generatedColumn",null),lastColumn:Ir.getArg(a,"lastGeneratedColumn",null)});a=this._originalMappings[++s]}}else{var l=a.originalColumn;while(a&&a.originalLine===r&&a.originalColumn==l){i.push({line:Ir.getArg(a,"generatedLine",null),column:Ir.getArg(a,"generatedColumn",null),lastColumn:Ir.getArg(a,"lastGeneratedColumn",null)});a=this._originalMappings[++s]}}}return i};var En=xn;function bn(e,t){var r=e;if(typeof e==="string"){r=Ir.parseSourceMapInput(e)}var n=Ir.getArg(r,"version");var i=Ir.getArg(r,"sources");var s=Ir.getArg(r,"names",[]);var a=Ir.getArg(r,"sourceRoot",null);var o=Ir.getArg(r,"sourcesContent",null);var l=Ir.getArg(r,"mappings");var u=Ir.getArg(r,"file",null);if(n!=this._version){throw new Error("Unsupported version: "+n)}if(a){a=Ir.normalize(a)}i=i.map(String).map(Ir.normalize).map(function(e){return a&&Ir.isAbsolute(a)&&Ir.isAbsolute(e)?Ir.relative(a,e):e});this._names=gn.fromArray(s.map(String),true);this._sources=gn.fromArray(i,true);this._absoluteSources=this._sources.toArray().map(function(e){return Ir.computeSourceURL(a,e,t)});this.sourceRoot=a;this.sourcesContent=o;this._mappings=l;this._sourceMapURL=t;this.file=u}bn.prototype=Object.create(xn.prototype);bn.prototype.consumer=xn;bn.prototype._findSourceIndex=function(e){var t=e;if(this.sourceRoot!=null){t=Ir.relative(this.sourceRoot,t)}if(this._sources.has(t)){return this._sources.indexOf(t)}var r;for(r=0;r<this._absoluteSources.length;++r){if(this._absoluteSources[r]==e){return r}}return-1};bn.fromSourceMap=function e(t,r){var n=Object.create(bn.prototype);var i=n._names=gn.fromArray(t._names.toArray(),true);var s=n._sources=gn.fromArray(t._sources.toArray(),true);n.sourceRoot=t._sourceRoot;n.sourcesContent=t._generateSourcesContent(n._sources.toArray(),n.sourceRoot);n.file=t._file;n._sourceMapURL=r;n._absoluteSources=n._sources.toArray().map(function(e){return Ir.computeSourceURL(n.sourceRoot,e,r)});var a=t._mappings.toArray().slice();var o=n.__generatedMappings=[];var l=n.__originalMappings=[];for(var u=0,c=a.length;u<c;u++){var f=a[u];var h=new Sn;h.generatedLine=f.generatedLine;h.generatedColumn=f.generatedColumn;if(f.source){h.source=s.indexOf(f.source);h.originalLine=f.originalLine;h.originalColumn=f.originalColumn;if(f.name){h.name=i.indexOf(f.name)}l.push(h)}o.push(h)}yn(n.__originalMappings,Ir.compareByOriginalPositions);return n};bn.prototype._version=3;Object.defineProperty(bn.prototype,"sources",{get:function e(){return this._absoluteSources.slice()}});function Sn(){this.generatedLine=0;this.generatedColumn=0;this.source=null;this.originalLine=null;this.originalColumn=null;this.name=null}bn.prototype._parseMappings=function e(t,r){var n=1;var i=0;var s=0;var a=0;var o=0;var l=0;var u=t.length;var c=0;var f={};var h={};var p=[];var d=[];var m,v,g,y,x;while(c<u){if(t.charAt(c)===";"){n++;c++;i=0}else if(t.charAt(c)===","){c++}else{m=new Sn;m.generatedLine=n;for(y=c;y<u;y++){if(this._charIsMappingSeparator(t,y)){break}}v=t.slice(c,y);g=f[v];if(g){c+=v.length}else{g=[];while(c<y){Fr.decode(t,c,h);x=h.value;c=h.rest;g.push(x)}if(g.length===2){throw new Error("Found a source, but no line and column")}if(g.length===3){throw new Error("Found a source and line, but no column")}f[v]=g}m.generatedColumn=i+g[0];i=m.generatedColumn;if(g.length>1){m.source=o+g[1];o+=g[1];m.originalLine=s+g[2];s=m.originalLine;m.originalLine+=1;m.originalColumn=a+g[3];a=m.originalColumn;if(g.length>4){m.name=l+g[4];l+=g[4]}}d.push(m);if(typeof m.originalLine==="number"){p.push(m)}}}yn(d,Ir.compareByGeneratedPositionsDeflated);this.__generatedMappings=d;yn(p,Ir.compareByOriginalPositions);this.__originalMappings=p};bn.prototype._findMapping=function e(t,r,n,i,s,a){if(t[n]<=0){throw new TypeError("Line must be greater than or equal to 1, got "+t[n])}if(t[i]<0){throw new TypeError("Column must be greater than or equal to 0, got "+t[i])}return ln.search(t,r,s,a)};bn.prototype.computeColumnSpans=function e(){for(var t=0;t<this._generatedMappings.length;++t){var r=this._generatedMappings[t];if(t+1<this._generatedMappings.length){var n=this._generatedMappings[t+1];if(r.generatedLine===n.generatedLine){r.lastGeneratedColumn=n.generatedColumn-1;continue}}r.lastGeneratedColumn=Infinity}};bn.prototype.originalPositionFor=function e(t){var r={generatedLine:Ir.getArg(t,"line"),generatedColumn:Ir.getArg(t,"column")};var n=this._findMapping(r,this._generatedMappings,"generatedLine","generatedColumn",Ir.compareByGeneratedPositionsDeflated,Ir.getArg(t,"bias",xn.GREATEST_LOWER_BOUND));if(n>=0){var i=this._generatedMappings[n];if(i.generatedLine===r.generatedLine){var s=Ir.getArg(i,"source",null);if(s!==null){s=this._sources.at(s);s=Ir.computeSourceURL(this.sourceRoot,s,this._sourceMapURL)}var a=Ir.getArg(i,"name",null);if(a!==null){a=this._names.at(a)}return{source:s,line:Ir.getArg(i,"originalLine",null),column:Ir.getArg(i,"originalColumn",null),name:a}}}return{source:null,line:null,column:null,name:null}};bn.prototype.hasContentsOfAllSources=function e(){if(!this.sourcesContent){return false}return this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(e){return e==null})};bn.prototype.sourceContentFor=function e(t,r){if(!this.sourcesContent){return null}var n=this._findSourceIndex(t);if(n>=0){return this.sourcesContent[n]}var i=t;if(this.sourceRoot!=null){i=Ir.relative(this.sourceRoot,i)}var s;if(this.sourceRoot!=null&&(s=Ir.urlParse(this.sourceRoot))){var a=i.replace(/^file:\/\//,"");if(s.scheme=="file"&&this._sources.has(a)){return this.sourcesContent[this._sources.indexOf(a)]}if((!s.path||s.path=="/")&&this._sources.has("/"+i)){return this.sourcesContent[this._sources.indexOf("/"+i)]}}if(r){return null}else{throw new Error('"'+i+'" is not in the SourceMap.')}};bn.prototype.generatedPositionFor=function e(t){var r=Ir.getArg(t,"source");r=this._findSourceIndex(r);if(r<0){return{line:null,column:null,lastColumn:null}}var n={source:r,originalLine:Ir.getArg(t,"line"),originalColumn:Ir.getArg(t,"column")};var i=this._findMapping(n,this._originalMappings,"originalLine","originalColumn",Ir.compareByOriginalPositions,Ir.getArg(t,"bias",xn.GREATEST_LOWER_BOUND));if(i>=0){var s=this._originalMappings[i];if(s.source===n.source){return{line:Ir.getArg(s,"generatedLine",null),column:Ir.getArg(s,"generatedColumn",null),lastColumn:Ir.getArg(s,"lastGeneratedColumn",null)}}}return{line:null,column:null,lastColumn:null}};var Dn=bn;function Cn(e,t){var r=e;if(typeof e==="string"){r=Ir.parseSourceMapInput(e)}var n=Ir.getArg(r,"version");var i=Ir.getArg(r,"sections");if(n!=this._version){throw new Error("Unsupported version: "+n)}this._sources=new gn;this._names=new gn;var s={line:-1,column:0};this._sections=i.map(function(e){if(e.url){throw new Error("Support for url field in sections not implemented.")}var r=Ir.getArg(e,"offset");var n=Ir.getArg(r,"line");var i=Ir.getArg(r,"column");if(n<s.line||n===s.line&&i<s.column){throw new Error("Section offsets must be ordered and non-overlapping.")}s=r;return{generatedOffset:{generatedLine:n+1,generatedColumn:i+1},consumer:new xn(Ir.getArg(e,"map"),t)}})}Cn.prototype=Object.create(xn.prototype);Cn.prototype.constructor=xn;Cn.prototype._version=3;Object.defineProperty(Cn.prototype,"sources",{get:function e(){var t=[];for(var r=0;r<this._sections.length;r++){for(var n=0;n<this._sections[r].consumer.sources.length;n++){t.push(this._sections[r].consumer.sources[n])}}return t}});Cn.prototype.originalPositionFor=function e(t){var r={generatedLine:Ir.getArg(t,"line"),generatedColumn:Ir.getArg(t,"column")};var n=ln.search(r,this._sections,function(e,t){var r=e.generatedLine-t.generatedOffset.generatedLine;if(r){return r}return e.generatedColumn-t.generatedOffset.generatedColumn});var i=this._sections[n];if(!i){return{source:null,line:null,column:null,name:null}}return i.consumer.originalPositionFor({line:r.generatedLine-(i.generatedOffset.generatedLine-1),column:r.generatedColumn-(i.generatedOffset.generatedLine===r.generatedLine?i.generatedOffset.generatedColumn-1:0),bias:t.bias})};Cn.prototype.hasContentsOfAllSources=function e(){return this._sections.every(function(e){return e.consumer.hasContentsOfAllSources()})};Cn.prototype.sourceContentFor=function e(t,r){for(var n=0;n<this._sections.length;n++){var i=this._sections[n];var s=i.consumer.sourceContentFor(t,true);if(s){return s}}if(r){return null}else{throw new Error('"'+t+'" is not in the SourceMap.')}};Cn.prototype.generatedPositionFor=function e(t){for(var r=0;r<this._sections.length;r++){var n=this._sections[r];if(n.consumer._findSourceIndex(Ir.getArg(t,"source"))===-1){continue}var i=n.consumer.generatedPositionFor(t);if(i){var s={line:i.line+(n.generatedOffset.generatedLine-1),column:i.column+(n.generatedOffset.generatedLine===i.line?n.generatedOffset.generatedColumn-1:0)};return s}}return{line:null,column:null}};Cn.prototype._parseMappings=function e(t,r){this.__generatedMappings=[];this.__originalMappings=[];for(var n=0;n<this._sections.length;n++){var i=this._sections[n];var s=i.consumer._generatedMappings;for(var a=0;a<s.length;a++){var o=s[a];var l=i.consumer._sources.at(o.source);l=Ir.computeSourceURL(i.consumer.sourceRoot,l,this._sourceMapURL);this._sources.add(l);l=this._sources.indexOf(l);var u=null;if(o.name){u=i.consumer._names.at(o.name);this._names.add(u);u=this._names.indexOf(u)}var c={source:l,generatedLine:o.generatedLine+(i.generatedOffset.generatedLine-1),generatedColumn:o.generatedColumn+(i.generatedOffset.generatedLine===o.generatedLine?i.generatedOffset.generatedColumn-1:0),originalLine:o.originalLine,originalColumn:o.originalColumn,name:u};this.__generatedMappings.push(c);if(typeof c.originalLine==="number"){this.__originalMappings.push(c)}}}yn(this.__generatedMappings,Ir.compareByGeneratedPositionsDeflated);yn(this.__originalMappings,Ir.compareByOriginalPositions)};var wn=Cn;var An={SourceMapConsumer:En,BasicSourceMapConsumer:Dn,IndexedSourceMapConsumer:wn};var Tn=on.SourceMapGenerator;var kn=/(\r?\n)/;var _n=10;var Pn="$$$isSourceNode$$$";function Fn(e,t,r,n,i){this.children=[];this.sourceContents={};this.line=e==null?null:e;this.column=t==null?null:t;this.source=r==null?null:r;this.name=i==null?null:i;this[Pn]=true;if(n!=null)this.add(n)}Fn.fromStringWithSourceMap=function e(t,r,n){var i=new Fn;var s=t.split(kn);var a=0;var o=function e(){var t=n();var r=n()||"";return t+r;function n(){return a<s.length?s[a++]:undefined}};var l=1,u=0;var c=null;r.eachMapping(function(e){if(c!==null){if(l<e.generatedLine){f(c,o());l++;u=0}else{var t=s[a]||"";var r=t.substr(0,e.generatedColumn-u);s[a]=t.substr(e.generatedColumn-u);u=e.generatedColumn;f(c,r);c=e;return}}while(l<e.generatedLine){i.add(o());l++}if(u<e.generatedColumn){var t=s[a]||"";i.add(t.substr(0,e.generatedColumn));s[a]=t.substr(e.generatedColumn);u=e.generatedColumn}c=e},this);if(a<s.length){if(c){f(c,o())}i.add(s.splice(a).join(""))}r.sources.forEach(function(e){var t=r.sourceContentFor(e);if(t!=null){if(n!=null){e=Ir.join(n,e)}i.setSourceContent(e,t)}});return i;function f(e,t){if(e===null||e.source===undefined){i.add(t)}else{var r=n?Ir.join(n,e.source):e.source;i.add(new Fn(e.originalLine,e.originalColumn,r,t,e.name))}}};Fn.prototype.add=function e(t){if(Array.isArray(t)){t.forEach(function(e){this.add(e)},this)}else if(t[Pn]||typeof t==="string"){if(t){this.children.push(t)}}else{throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+t)}return this};Fn.prototype.prepend=function e(t){if(Array.isArray(t)){for(var r=t.length-1;r>=0;r--){this.prepend(t[r])}}else if(t[Pn]||typeof t==="string"){this.children.unshift(t)}else{throw new TypeError("Expected a SourceNode, string, or an array of SourceNodes and strings. Got "+t)}return this};Fn.prototype.walk=function e(t){var r;for(var n=0,i=this.children.length;n<i;n++){r=this.children[n];if(r[Pn]){r.walk(t)}else{if(r!==""){t(r,{source:this.source,line:this.line,column:this.column,name:this.name})}}}};Fn.prototype.join=function e(t){var r;var n;var i=this.children.length;if(i>0){r=[];for(n=0;n<i-1;n++){r.push(this.children[n]);r.push(t)}r.push(this.children[n]);this.children=r}return this};Fn.prototype.replaceRight=function e(t,r){var n=this.children[this.children.length-1];if(n[Pn]){n.replaceRight(t,r)}else if(typeof n==="string"){this.children[this.children.length-1]=n.replace(t,r)}else{this.children.push("".replace(t,r))}return this};Fn.prototype.setSourceContent=function e(t,r){this.sourceContents[Ir.toSetString(t)]=r};Fn.prototype.walkSourceContents=function e(t){for(var r=0,n=this.children.length;r<n;r++){if(this.children[r][Pn]){this.children[r].walkSourceContents(t)}}var i=Object.keys(this.sourceContents);for(var r=0,n=i.length;r<n;r++){t(Ir.fromSetString(i[r]),this.sourceContents[i[r]])}};Fn.prototype.toString=function e(){var t="";this.walk(function(e){t+=e});return t};Fn.prototype.toStringWithSourceMap=function e(t){var r={code:"",line:1,column:0};var n=new Tn(t);var i=false;var s=null;var a=null;var o=null;var l=null;this.walk(function(e,t){r.code+=e;if(t.source!==null&&t.line!==null&&t.column!==null){if(s!==t.source||a!==t.line||o!==t.column||l!==t.name){n.addMapping({source:t.source,original:{line:t.line,column:t.column},generated:{line:r.line,column:r.column},name:t.name})}s=t.source;a=t.line;o=t.column;l=t.name;i=true}else if(i){n.addMapping({generated:{line:r.line,column:r.column}});s=null;i=false}for(var u=0,c=e.length;u<c;u++){if(e.charCodeAt(u)===_n){r.line++;r.column=0;if(u+1===c){s=null;i=false}else if(i){n.addMapping({source:t.source,original:{line:t.line,column:t.column},generated:{line:r.line,column:r.column},name:t.name})}}else{r.column++}}});this.walkSourceContents(function(e,t){n.setSourceContent(e,t)});return{code:r.code,map:n}};var In=Fn;var Mn={SourceNode:In};var Nn=on.SourceMapGenerator;var Ln=An.SourceMapConsumer;var Bn=Mn.SourceNode;var On={SourceMapGenerator:Nn,SourceMapConsumer:Ln,SourceNode:Bn};var Rn=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(I);var a=s.namedTypes;var o=r(On);var l=o.default.SourceMapConsumer;var u=o.default.SourceMapGenerator;var c=Object.prototype.hasOwnProperty;function f(e,t,r){if(e&&c.call(e,t)){return e[t]}return r}t.getOption=f;function h(){var e=[];for(var t=0;t<arguments.length;t++){e[t]=arguments[t]}var r={};var n=e.length;for(var i=0;i<n;++i){var s=Object.keys(e[i]);var a=s.length;for(var o=0;o<a;++o){r[s[o]]=true}}return r}t.getUnionOfKeys=h;function p(e,t){return e.line-t.line||e.column-t.column}t.comparePos=p;function d(e){return{line:e.line,column:e.column}}t.copyPos=d;function m(e,t){if(e){if(!t){return e}}else{return t||null}var r=new l(e);var n=new l(t);var i=new u({file:t.file,sourceRoot:t.sourceRoot});var s={};n.eachMapping(function(e){var t=r.originalPositionFor({line:e.originalLine,column:e.originalColumn});var n=t.source;if(n===null){return}i.addMapping({source:n,original:d(t),generated:{line:e.generatedLine,column:e.generatedColumn},name:e.name});var a=r.sourceContentFor(n);if(a&&!c.call(s,n)){s[n]=a;i.setSourceContent(n,a)}});return i.toJSON()}t.composeSourceMaps=m;function v(e,t){if(!e.loc){return null}var r={start:e.loc.start,end:e.loc.end};function n(e){g(r,e.loc)}if(e.declaration&&e.declaration.decorators&&b(e)){e.declaration.decorators.forEach(n)}if(p(r.start,r.end)<0){r.start=d(r.start);t.skipSpaces(r.start,false,true);if(p(r.start,r.end)<0){r.end=d(r.end);t.skipSpaces(r.end,true,true)}}if(e.comments){e.comments.forEach(n)}return r}t.getTrueLoc=v;function g(e,t){if(e&&t){if(p(t.start,e.start)<0){e.start=t.start}if(p(e.end,t.end)<0){e.end=t.end}}}function y(e,t){var r=e.loc;if(r){if(r.start.line<1){r.start.line=1}if(r.end.line<1){r.end.line=1}}if(e.type==="File"){r.start=t.firstPos();r.end=t.lastPos()}x(e,t);E(e,t);if(r&&e.decorators){e.decorators.forEach(function(e){g(r,e.loc)})}else if(e.declaration&&b(e)){e.declaration.loc=null;var n=e.declaration.decorators;if(n){n.forEach(function(e){g(r,e.loc)})}}else if(a.MethodDefinition&&a.MethodDefinition.check(e)||a.Property.check(e)&&(e.method||e.shorthand)){e.value.loc=null;if(a.FunctionExpression.check(e.value)){e.value.id=null}}else if(e.type==="ObjectTypeProperty"){var r=e.loc;var i=r&&r.end;if(i){i=d(i);if(t.prevPos(i)&&t.charAt(i)===","){if(i=t.skipSpaces(i,true,true)){r.end=i}}}}}t.fixFaultyLocations=y;function x(e,t){if(e.type!=="ForStatement"){return}function r(e){var r=e&&e.loc;var n=r&&r.start;var i=r&&d(r.end);while(n&&i&&p(n,i)<0){t.prevPos(i);if(t.charAt(i)===";"){r.end.line=i.line;r.end.column=i.column}else{break}}}r(e.init);r(e.test);r(e.update)}function E(e,t){if(e.type!=="TemplateLiteral"){return}if(e.quasis.length===0){return}if(e.loc){var r=d(e.loc.start);i.default.strictEqual(t.charAt(r),"`");i.default.ok(t.nextPos(r));var n=e.quasis[0];if(p(n.loc.start,r)<0){n.loc.start=r}var s=d(e.loc.end);i.default.ok(t.prevPos(s));i.default.strictEqual(t.charAt(s),"`");var a=e.quasis[e.quasis.length-1];if(p(s,a.loc.end)<0){a.loc.end=s}}e.expressions.forEach(function(r,n){var s=t.skipSpaces(r.loc.start,true,false);if(t.prevPos(s)&&t.charAt(s)==="{"&&t.prevPos(s)&&t.charAt(s)==="$"){var a=e.quasis[n];if(p(s,a.loc.end)<0){a.loc.end=s}}var o=t.skipSpaces(r.loc.end,false,false);if(t.charAt(o)==="}"){i.default.ok(t.nextPos(o));var l=e.quasis[n+1];if(p(l.loc.start,o)<0){l.loc.start=o}}})}function b(e){if(e)switch(e.type){case"ExportDeclaration":case"ExportDefaultDeclaration":case"ExportDefaultSpecifier":case"DeclareExportDeclaration":case"ExportNamedDeclaration":case"ExportAllDeclaration":return true}return false}t.isExportDeclaration=b;function S(e){var t=e.getParentNode();if(e.getName()==="declaration"&&b(t)){return t}return null}t.getParentExportDeclaration=S;function D(e,t){var r=e.trailingComma;if(typeof r==="object"){return!!r[t]}return!!r}t.isTrailingCommaEnabled=D});o(Rn);var jn=Rn.getOption;var Un=Rn.getUnionOfKeys;var Vn=Rn.comparePos;var Gn=Rn.copyPos;var zn=Rn.composeSourceMaps;var Xn=Rn.getTrueLoc;var Jn=Rn.fixFaultyLocations;var qn=Rn.isExportDeclaration;var Wn=Rn.getParentExportDeclaration;var Hn=Rn.isTrailingCommaEnabled;var Kn=l(function(e,t){(function t(r,n){e.exports=n()})(this,function(){return function(e){var t={};function r(n){if(t[n])return t[n].exports;var i=t[n]={exports:{},id:n,loaded:false};e[n].call(i.exports,i,i.exports,r);i.loaded=true;return i.exports}r.m=e;r.c=t;r.p="";return r(0)}([function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(1);var i=r(3);var s=r(8);var a=r(15);function o(e,t,r){var a=null;var o=function e(t,n){if(r){r(t,n)}if(a){a.visit(t,n)}};var l=typeof r==="function"?o:null;var u=false;if(t){u=typeof t.comment==="boolean"&&t.comment;var c=typeof t.attachComment==="boolean"&&t.attachComment;if(u||c){a=new n.CommentHandler;a.attach=c;t.comment=true;l=o}}var f=false;if(t&&typeof t.sourceType==="string"){f=t.sourceType==="module"}var h;if(t&&typeof t.jsx==="boolean"&&t.jsx){h=new i.JSXParser(e,t,l)}else{h=new s.Parser(e,t,l)}var p=f?h.parseModule():h.parseScript();var d=p;if(u&&a){d.comments=a.comments}if(h.config.tokens){d.tokens=h.tokens}if(h.config.tolerant){d.errors=h.errorHandler.errors}return d}t.parse=o;function l(e,t,r){var n=t||{};n.sourceType="module";return o(e,n,r)}t.parseModule=l;function u(e,t,r){var n=t||{};n.sourceType="script";return o(e,n,r)}t.parseScript=u;function c(e,t,r){var n=new a.Tokenizer(e,t);var i;i=[];try{while(true){var s=n.getNextToken();if(!s){break}if(r){s=r(s)}i.push(s)}}catch(e){n.errorHandler.tolerate(e)}if(n.errorHandler.tolerant){i.errors=n.errors()}return i}t.tokenize=c;var f=r(2);t.Syntax=f.Syntax;t.version="4.0.1"},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(2);var i=function(){function e(){this.attach=false;this.comments=[];this.stack=[];this.leading=[];this.trailing=[]}e.prototype.insertInnerComments=function(e,t){if(e.type===n.Syntax.BlockStatement&&e.body.length===0){var r=[];for(var i=this.leading.length-1;i>=0;--i){var s=this.leading[i];if(t.end.offset>=s.start){r.unshift(s.comment);this.leading.splice(i,1);this.trailing.splice(i,1)}}if(r.length){e.innerComments=r}}};e.prototype.findTrailingComments=function(e){var t=[];if(this.trailing.length>0){for(var r=this.trailing.length-1;r>=0;--r){var n=this.trailing[r];if(n.start>=e.end.offset){t.unshift(n.comment)}}this.trailing.length=0;return t}var i=this.stack[this.stack.length-1];if(i&&i.node.trailingComments){var s=i.node.trailingComments[0];if(s&&s.range[0]>=e.end.offset){t=i.node.trailingComments;delete i.node.trailingComments}}return t};e.prototype.findLeadingComments=function(e){var t=[];var r;while(this.stack.length>0){var n=this.stack[this.stack.length-1];if(n&&n.start>=e.start.offset){r=n.node;this.stack.pop()}else{break}}if(r){var i=r.leadingComments?r.leadingComments.length:0;for(var s=i-1;s>=0;--s){var a=r.leadingComments[s];if(a.range[1]<=e.start.offset){t.unshift(a);r.leadingComments.splice(s,1)}}if(r.leadingComments&&r.leadingComments.length===0){delete r.leadingComments}return t}for(var s=this.leading.length-1;s>=0;--s){var n=this.leading[s];if(n.start<=e.start.offset){t.unshift(n.comment);this.leading.splice(s,1)}}return t};e.prototype.visitNode=function(e,t){if(e.type===n.Syntax.Program&&e.body.length>0){return}this.insertInnerComments(e,t);var r=this.findTrailingComments(t);var i=this.findLeadingComments(t);if(i.length>0){e.leadingComments=i}if(r.length>0){e.trailingComments=r}this.stack.push({node:e,start:t.start.offset})};e.prototype.visitComment=function(e,t){var r=e.type[0]==="L"?"Line":"Block";var n={type:r,value:e.value};if(e.range){n.range=e.range}if(e.loc){n.loc=e.loc}this.comments.push(n);if(this.attach){var i={comment:{type:r,value:e.value,range:[t.start.offset,t.end.offset]},start:t.start.offset};if(e.loc){i.comment.loc=e.loc}e.type=r;this.leading.push(i);this.trailing.push(i)}};e.prototype.visit=function(e,t){if(e.type==="LineComment"){this.visitComment(e,t)}else if(e.type==="BlockComment"){this.visitComment(e,t)}else if(this.attach){this.visitNode(e,t)}};return e}();t.CommentHandler=i},function(e,t){Object.defineProperty(t,"__esModule",{value:true});t.Syntax={AssignmentExpression:"AssignmentExpression",AssignmentPattern:"AssignmentPattern",ArrayExpression:"ArrayExpression",ArrayPattern:"ArrayPattern",ArrowFunctionExpression:"ArrowFunctionExpression",AwaitExpression:"AwaitExpression",BlockStatement:"BlockStatement",BinaryExpression:"BinaryExpression",BreakStatement:"BreakStatement",CallExpression:"CallExpression",CatchClause:"CatchClause",ClassBody:"ClassBody",ClassDeclaration:"ClassDeclaration",ClassExpression:"ClassExpression",ConditionalExpression:"ConditionalExpression",ContinueStatement:"ContinueStatement",DoWhileStatement:"DoWhileStatement",DebuggerStatement:"DebuggerStatement",EmptyStatement:"EmptyStatement",ExportAllDeclaration:"ExportAllDeclaration",ExportDefaultDeclaration:"ExportDefaultDeclaration",ExportNamedDeclaration:"ExportNamedDeclaration",ExportSpecifier:"ExportSpecifier",ExpressionStatement:"ExpressionStatement",ForStatement:"ForStatement",ForOfStatement:"ForOfStatement",ForInStatement:"ForInStatement",FunctionDeclaration:"FunctionDeclaration",FunctionExpression:"FunctionExpression",Identifier:"Identifier",IfStatement:"IfStatement",ImportDeclaration:"ImportDeclaration",ImportDefaultSpecifier:"ImportDefaultSpecifier",ImportNamespaceSpecifier:"ImportNamespaceSpecifier",ImportSpecifier:"ImportSpecifier",Literal:"Literal",LabeledStatement:"LabeledStatement",LogicalExpression:"LogicalExpression",MemberExpression:"MemberExpression",MetaProperty:"MetaProperty",MethodDefinition:"MethodDefinition",NewExpression:"NewExpression",ObjectExpression:"ObjectExpression",ObjectPattern:"ObjectPattern",Program:"Program",Property:"Property",RestElement:"RestElement",ReturnStatement:"ReturnStatement",SequenceExpression:"SequenceExpression",SpreadElement:"SpreadElement",Super:"Super",SwitchCase:"SwitchCase",SwitchStatement:"SwitchStatement",TaggedTemplateExpression:"TaggedTemplateExpression",TemplateElement:"TemplateElement",TemplateLiteral:"TemplateLiteral",ThisExpression:"ThisExpression",ThrowStatement:"ThrowStatement",TryStatement:"TryStatement",UnaryExpression:"UnaryExpression",UpdateExpression:"UpdateExpression",VariableDeclaration:"VariableDeclaration",VariableDeclarator:"VariableDeclarator",WhileStatement:"WhileStatement",WithStatement:"WithStatement",YieldExpression:"YieldExpression"}},function(e,t,r){var n=this&&this.__extends||function(){var e=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)if(t.hasOwnProperty(r))e[r]=t[r]};return function(t,r){e(t,r);function n(){this.constructor=t}t.prototype=r===null?Object.create(r):(n.prototype=r.prototype,new n)}}();Object.defineProperty(t,"__esModule",{value:true});var i=r(4);var s=r(5);var a=r(6);var o=r(7);var l=r(8);var u=r(13);var c=r(14);u.TokenName[100]="JSXIdentifier";u.TokenName[101]="JSXText";function f(e){var t;switch(e.type){case a.JSXSyntax.JSXIdentifier:var r=e;t=r.name;break;case a.JSXSyntax.JSXNamespacedName:var n=e;t=f(n.namespace)+":"+f(n.name);break;case a.JSXSyntax.JSXMemberExpression:var i=e;t=f(i.object)+"."+f(i.property);break;default:break}return t}var h=function(e){n(t,e);function t(t,r,n){return e.call(this,t,r,n)||this}t.prototype.parsePrimaryExpression=function(){return this.match("<")?this.parseJSXRoot():e.prototype.parsePrimaryExpression.call(this)};t.prototype.startJSX=function(){this.scanner.index=this.startMarker.index;this.scanner.lineNumber=this.startMarker.line;this.scanner.lineStart=this.startMarker.index-this.startMarker.column};t.prototype.finishJSX=function(){this.nextToken()};t.prototype.reenterJSX=function(){this.startJSX();this.expectJSX("}");if(this.config.tokens){this.tokens.pop()}};t.prototype.createJSXNode=function(){this.collectComments();return{index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart}};t.prototype.createJSXChildNode=function(){return{index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart}};t.prototype.scanXHTMLEntity=function(e){var t="&";var r=true;var n=false;var s=false;var a=false;while(!this.scanner.eof()&&r&&!n){var o=this.scanner.source[this.scanner.index];if(o===e){break}n=o===";";t+=o;++this.scanner.index;if(!n){switch(t.length){case 2:s=o==="#";break;case 3:if(s){a=o==="x";r=a||i.Character.isDecimalDigit(o.charCodeAt(0));s=s&&!a}break;default:r=r&&!(s&&!i.Character.isDecimalDigit(o.charCodeAt(0)));r=r&&!(a&&!i.Character.isHexDigit(o.charCodeAt(0)));break}}}if(r&&n&&t.length>2){var l=t.substr(1,t.length-2);if(s&&l.length>1){t=String.fromCharCode(parseInt(l.substr(1),10))}else if(a&&l.length>2){t=String.fromCharCode(parseInt("0"+l.substr(1),16))}else if(!s&&!a&&c.XHTMLEntities[l]){t=c.XHTMLEntities[l]}}return t};t.prototype.lexJSX=function(){var e=this.scanner.source.charCodeAt(this.scanner.index);if(e===60||e===62||e===47||e===58||e===61||e===123||e===125){var t=this.scanner.source[this.scanner.index++];return{type:7,value:t,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:this.scanner.index-1,end:this.scanner.index}}if(e===34||e===39){var r=this.scanner.index;var n=this.scanner.source[this.scanner.index++];var s="";while(!this.scanner.eof()){var a=this.scanner.source[this.scanner.index++];if(a===n){break}else if(a==="&"){s+=this.scanXHTMLEntity(n)}else{s+=a}}return{type:8,value:s,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:r,end:this.scanner.index}}if(e===46){var o=this.scanner.source.charCodeAt(this.scanner.index+1);var l=this.scanner.source.charCodeAt(this.scanner.index+2);var t=o===46&&l===46?"...":".";var r=this.scanner.index;this.scanner.index+=t.length;return{type:7,value:t,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:r,end:this.scanner.index}}if(e===96){return{type:10,value:"",lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:this.scanner.index,end:this.scanner.index}}if(i.Character.isIdentifierStart(e)&&e!==92){var r=this.scanner.index;++this.scanner.index;while(!this.scanner.eof()){var a=this.scanner.source.charCodeAt(this.scanner.index);if(i.Character.isIdentifierPart(a)&&a!==92){++this.scanner.index}else if(a===45){++this.scanner.index}else{break}}var u=this.scanner.source.slice(r,this.scanner.index);return{type:100,value:u,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:r,end:this.scanner.index}}return this.scanner.lex()};t.prototype.nextJSXToken=function(){this.collectComments();this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart;var e=this.lexJSX();this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;if(this.config.tokens){this.tokens.push(this.convertToken(e))}return e};t.prototype.nextJSXText=function(){this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart;var e=this.scanner.index;var t="";while(!this.scanner.eof()){var r=this.scanner.source[this.scanner.index];if(r==="{"||r==="<"){break}++this.scanner.index;t+=r;if(i.Character.isLineTerminator(r.charCodeAt(0))){++this.scanner.lineNumber;if(r==="\r"&&this.scanner.source[this.scanner.index]==="\n"){++this.scanner.index}this.scanner.lineStart=this.scanner.index}}this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;var n={type:101,value:t,lineNumber:this.scanner.lineNumber,lineStart:this.scanner.lineStart,start:e,end:this.scanner.index};if(t.length>0&&this.config.tokens){this.tokens.push(this.convertToken(n))}return n};t.prototype.peekJSXToken=function(){var e=this.scanner.saveState();this.scanner.scanComments();var t=this.lexJSX();this.scanner.restoreState(e);return t};t.prototype.expectJSX=function(e){var t=this.nextJSXToken();if(t.type!==7||t.value!==e){this.throwUnexpectedToken(t)}};t.prototype.matchJSX=function(e){var t=this.peekJSXToken();return t.type===7&&t.value===e};t.prototype.parseJSXIdentifier=function(){var e=this.createJSXNode();var t=this.nextJSXToken();if(t.type!==100){this.throwUnexpectedToken(t)}return this.finalize(e,new s.JSXIdentifier(t.value))};t.prototype.parseJSXElementName=function(){var e=this.createJSXNode();var t=this.parseJSXIdentifier();if(this.matchJSX(":")){var r=t;this.expectJSX(":");var n=this.parseJSXIdentifier();t=this.finalize(e,new s.JSXNamespacedName(r,n))}else if(this.matchJSX(".")){while(this.matchJSX(".")){var i=t;this.expectJSX(".");var a=this.parseJSXIdentifier();t=this.finalize(e,new s.JSXMemberExpression(i,a))}}return t};t.prototype.parseJSXAttributeName=function(){var e=this.createJSXNode();var t;var r=this.parseJSXIdentifier();if(this.matchJSX(":")){var n=r;this.expectJSX(":");var i=this.parseJSXIdentifier();t=this.finalize(e,new s.JSXNamespacedName(n,i))}else{t=r}return t};t.prototype.parseJSXStringLiteralAttribute=function(){var e=this.createJSXNode();var t=this.nextJSXToken();if(t.type!==8){this.throwUnexpectedToken(t)}var r=this.getTokenRaw(t);return this.finalize(e,new o.Literal(t.value,r))};t.prototype.parseJSXExpressionAttribute=function(){var e=this.createJSXNode();this.expectJSX("{");this.finishJSX();if(this.match("}")){this.tolerateError("JSX attributes must only be assigned a non-empty expression")}var t=this.parseAssignmentExpression();this.reenterJSX();return this.finalize(e,new s.JSXExpressionContainer(t))};t.prototype.parseJSXAttributeValue=function(){return this.matchJSX("{")?this.parseJSXExpressionAttribute():this.matchJSX("<")?this.parseJSXElement():this.parseJSXStringLiteralAttribute()};t.prototype.parseJSXNameValueAttribute=function(){var e=this.createJSXNode();var t=this.parseJSXAttributeName();var r=null;if(this.matchJSX("=")){this.expectJSX("=");r=this.parseJSXAttributeValue()}return this.finalize(e,new s.JSXAttribute(t,r))};t.prototype.parseJSXSpreadAttribute=function(){var e=this.createJSXNode();this.expectJSX("{");this.expectJSX("...");this.finishJSX();var t=this.parseAssignmentExpression();this.reenterJSX();return this.finalize(e,new s.JSXSpreadAttribute(t))};t.prototype.parseJSXAttributes=function(){var e=[];while(!this.matchJSX("/")&&!this.matchJSX(">")){var t=this.matchJSX("{")?this.parseJSXSpreadAttribute():this.parseJSXNameValueAttribute();e.push(t)}return e};t.prototype.parseJSXOpeningElement=function(){var e=this.createJSXNode();this.expectJSX("<");var t=this.parseJSXElementName();var r=this.parseJSXAttributes();var n=this.matchJSX("/");if(n){this.expectJSX("/")}this.expectJSX(">");return this.finalize(e,new s.JSXOpeningElement(t,n,r))};t.prototype.parseJSXBoundaryElement=function(){var e=this.createJSXNode();this.expectJSX("<");if(this.matchJSX("/")){this.expectJSX("/");var t=this.parseJSXElementName();this.expectJSX(">");return this.finalize(e,new s.JSXClosingElement(t))}var r=this.parseJSXElementName();var n=this.parseJSXAttributes();var i=this.matchJSX("/");if(i){this.expectJSX("/")}this.expectJSX(">");return this.finalize(e,new s.JSXOpeningElement(r,i,n))};t.prototype.parseJSXEmptyExpression=function(){var e=this.createJSXChildNode();this.collectComments();this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;return this.finalize(e,new s.JSXEmptyExpression)};t.prototype.parseJSXExpressionContainer=function(){var e=this.createJSXNode();this.expectJSX("{");var t;if(this.matchJSX("}")){t=this.parseJSXEmptyExpression();this.expectJSX("}")}else{this.finishJSX();t=this.parseAssignmentExpression();this.reenterJSX()}return this.finalize(e,new s.JSXExpressionContainer(t))};t.prototype.parseJSXChildren=function(){var e=[];while(!this.scanner.eof()){var t=this.createJSXChildNode();var r=this.nextJSXText();if(r.start<r.end){var n=this.getTokenRaw(r);var i=this.finalize(t,new s.JSXText(r.value,n));e.push(i)}if(this.scanner.source[this.scanner.index]==="{"){var a=this.parseJSXExpressionContainer();e.push(a)}else{break}}return e};t.prototype.parseComplexJSXElement=function(e){var t=[];while(!this.scanner.eof()){e.children=e.children.concat(this.parseJSXChildren());var r=this.createJSXChildNode();var n=this.parseJSXBoundaryElement();if(n.type===a.JSXSyntax.JSXOpeningElement){var i=n;if(i.selfClosing){var o=this.finalize(r,new s.JSXElement(i,[],null));e.children.push(o)}else{t.push(e);e={node:r,opening:i,closing:null,children:[]}}}if(n.type===a.JSXSyntax.JSXClosingElement){e.closing=n;var l=f(e.opening.name);var u=f(e.closing.name);if(l!==u){this.tolerateError("Expected corresponding JSX closing tag for %0",l)}if(t.length>0){var o=this.finalize(e.node,new s.JSXElement(e.opening,e.children,e.closing));e=t[t.length-1];e.children.push(o);t.pop()}else{break}}}return e};t.prototype.parseJSXElement=function(){var e=this.createJSXNode();var t=this.parseJSXOpeningElement();var r=[];var n=null;if(!t.selfClosing){var i=this.parseComplexJSXElement({node:e,opening:t,closing:n,children:r});r=i.children;n=i.closing}return this.finalize(e,new s.JSXElement(t,r,n))};t.prototype.parseJSXRoot=function(){if(this.config.tokens){this.tokens.pop()}this.startJSX();var e=this.parseJSXElement();this.finishJSX();return e};t.prototype.isStartOfExpression=function(){return e.prototype.isStartOfExpression.call(this)||this.match("<")};return t}(l.Parser);t.JSXParser=h},function(e,t){Object.defineProperty(t,"__esModule",{value:true});var r={NonAsciiIdentifierStart:/[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B4\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\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-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\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\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDF00-\uDF19]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]/,NonAsciiIdentifierPart:/[\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B4\u08E3-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0AF9\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58-\u0C5A\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D5F-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\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\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FD5\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA7AD\uA7B0-\uA7B7\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA8FD\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB65\uAB70-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDCA-\uDDCC\uDDD0-\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE37\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF50\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDDD8-\uDDDD\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9\uDF00-\uDF19\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6E\uDC80-\uDD43]|[\uD80C\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD811[\uDC00-\uDE46]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF]/};t.Character={fromCodePoint:function e(t){return t<65536?String.fromCharCode(t):String.fromCharCode(55296+(t-65536>>10))+String.fromCharCode(56320+(t-65536&1023))},isWhiteSpace:function e(t){return t===32||t===9||t===11||t===12||t===160||t>=5760&&[5760,8192,8193,8194,8195,8196,8197,8198,8199,8200,8201,8202,8239,8287,12288,65279].indexOf(t)>=0},isLineTerminator:function e(t){return t===10||t===13||t===8232||t===8233},isIdentifierStart:function e(n){return n===36||n===95||n>=65&&n<=90||n>=97&&n<=122||n===92||n>=128&&r.NonAsciiIdentifierStart.test(t.Character.fromCodePoint(n))},isIdentifierPart:function e(n){return n===36||n===95||n>=65&&n<=90||n>=97&&n<=122||n>=48&&n<=57||n===92||n>=128&&r.NonAsciiIdentifierPart.test(t.Character.fromCodePoint(n))},isDecimalDigit:function e(t){return t>=48&&t<=57},isHexDigit:function e(t){return t>=48&&t<=57||t>=65&&t<=70||t>=97&&t<=102},isOctalDigit:function e(t){return t>=48&&t<=55}}},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(6);var i=function(){function e(e){this.type=n.JSXSyntax.JSXClosingElement;this.name=e}return e}();t.JSXClosingElement=i;var s=function(){function e(e,t,r){this.type=n.JSXSyntax.JSXElement;this.openingElement=e;this.children=t;this.closingElement=r}return e}();t.JSXElement=s;var a=function(){function e(){this.type=n.JSXSyntax.JSXEmptyExpression}return e}();t.JSXEmptyExpression=a;var o=function(){function e(e){this.type=n.JSXSyntax.JSXExpressionContainer;this.expression=e}return e}();t.JSXExpressionContainer=o;var l=function(){function e(e){this.type=n.JSXSyntax.JSXIdentifier;this.name=e}return e}();t.JSXIdentifier=l;var u=function(){function e(e,t){this.type=n.JSXSyntax.JSXMemberExpression;this.object=e;this.property=t}return e}();t.JSXMemberExpression=u;var c=function(){function e(e,t){this.type=n.JSXSyntax.JSXAttribute;this.name=e;this.value=t}return e}();t.JSXAttribute=c;var f=function(){function e(e,t){this.type=n.JSXSyntax.JSXNamespacedName;this.namespace=e;this.name=t}return e}();t.JSXNamespacedName=f;var h=function(){function e(e,t,r){this.type=n.JSXSyntax.JSXOpeningElement;this.name=e;this.selfClosing=t;this.attributes=r}return e}();t.JSXOpeningElement=h;var p=function(){function e(e){this.type=n.JSXSyntax.JSXSpreadAttribute;this.argument=e}return e}();t.JSXSpreadAttribute=p;var d=function(){function e(e,t){this.type=n.JSXSyntax.JSXText;this.value=e;this.raw=t}return e}();t.JSXText=d},function(e,t){Object.defineProperty(t,"__esModule",{value:true});t.JSXSyntax={JSXAttribute:"JSXAttribute",JSXClosingElement:"JSXClosingElement",JSXElement:"JSXElement",JSXEmptyExpression:"JSXEmptyExpression",JSXExpressionContainer:"JSXExpressionContainer",JSXIdentifier:"JSXIdentifier",JSXMemberExpression:"JSXMemberExpression",JSXNamespacedName:"JSXNamespacedName",JSXOpeningElement:"JSXOpeningElement",JSXSpreadAttribute:"JSXSpreadAttribute",JSXText:"JSXText"}},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(2);var i=function(){function e(e){this.type=n.Syntax.ArrayExpression;this.elements=e}return e}();t.ArrayExpression=i;var s=function(){function e(e){this.type=n.Syntax.ArrayPattern;this.elements=e}return e}();t.ArrayPattern=s;var a=function(){function e(e,t,r){this.type=n.Syntax.ArrowFunctionExpression;this.id=null;this.params=e;this.body=t;this.generator=false;this.expression=r;this.async=false}return e}();t.ArrowFunctionExpression=a;var o=function(){function e(e,t,r){this.type=n.Syntax.AssignmentExpression;this.operator=e;this.left=t;this.right=r}return e}();t.AssignmentExpression=o;var l=function(){function e(e,t){this.type=n.Syntax.AssignmentPattern;this.left=e;this.right=t}return e}();t.AssignmentPattern=l;var u=function(){function e(e,t,r){this.type=n.Syntax.ArrowFunctionExpression;this.id=null;this.params=e;this.body=t;this.generator=false;this.expression=r;this.async=true}return e}();t.AsyncArrowFunctionExpression=u;var c=function(){function e(e,t,r){this.type=n.Syntax.FunctionDeclaration;this.id=e;this.params=t;this.body=r;this.generator=false;this.expression=false;this.async=true}return e}();t.AsyncFunctionDeclaration=c;var f=function(){function e(e,t,r){this.type=n.Syntax.FunctionExpression;this.id=e;this.params=t;this.body=r;this.generator=false;this.expression=false;this.async=true}return e}();t.AsyncFunctionExpression=f;var h=function(){function e(e){this.type=n.Syntax.AwaitExpression;this.argument=e}return e}();t.AwaitExpression=h;var p=function(){function e(e,t,r){var i=e==="||"||e==="&&";this.type=i?n.Syntax.LogicalExpression:n.Syntax.BinaryExpression;this.operator=e;this.left=t;this.right=r}return e}();t.BinaryExpression=p;var d=function(){function e(e){this.type=n.Syntax.BlockStatement;this.body=e}return e}();t.BlockStatement=d;var m=function(){function e(e){this.type=n.Syntax.BreakStatement;this.label=e}return e}();t.BreakStatement=m;var v=function(){function e(e,t){this.type=n.Syntax.CallExpression;this.callee=e;this.arguments=t}return e}();t.CallExpression=v;var g=function(){function e(e,t){this.type=n.Syntax.CatchClause;this.param=e;this.body=t}return e}();t.CatchClause=g;var y=function(){function e(e){this.type=n.Syntax.ClassBody;this.body=e}return e}();t.ClassBody=y;var x=function(){function e(e,t,r){this.type=n.Syntax.ClassDeclaration;this.id=e;this.superClass=t;this.body=r}return e}();t.ClassDeclaration=x;var E=function(){function e(e,t,r){this.type=n.Syntax.ClassExpression;this.id=e;this.superClass=t;this.body=r}return e}();t.ClassExpression=E;var b=function(){function e(e,t){this.type=n.Syntax.MemberExpression;this.computed=true;this.object=e;this.property=t}return e}();t.ComputedMemberExpression=b;var S=function(){function e(e,t,r){this.type=n.Syntax.ConditionalExpression;this.test=e;this.consequent=t;this.alternate=r}return e}();t.ConditionalExpression=S;var D=function(){function e(e){this.type=n.Syntax.ContinueStatement;this.label=e}return e}();t.ContinueStatement=D;var C=function(){function e(){this.type=n.Syntax.DebuggerStatement}return e}();t.DebuggerStatement=C;var w=function(){function e(e,t){this.type=n.Syntax.ExpressionStatement;this.expression=e;this.directive=t}return e}();t.Directive=w;var A=function(){function e(e,t){this.type=n.Syntax.DoWhileStatement;this.body=e;this.test=t}return e}();t.DoWhileStatement=A;var T=function(){function e(){this.type=n.Syntax.EmptyStatement}return e}();t.EmptyStatement=T;var k=function(){function e(e){this.type=n.Syntax.ExportAllDeclaration;this.source=e}return e}();t.ExportAllDeclaration=k;var _=function(){function e(e){this.type=n.Syntax.ExportDefaultDeclaration;this.declaration=e}return e}();t.ExportDefaultDeclaration=_;var P=function(){function e(e,t,r){this.type=n.Syntax.ExportNamedDeclaration;this.declaration=e;this.specifiers=t;this.source=r}return e}();t.ExportNamedDeclaration=P;var F=function(){function e(e,t){this.type=n.Syntax.ExportSpecifier;this.exported=t;this.local=e}return e}();t.ExportSpecifier=F;var I=function(){function e(e){this.type=n.Syntax.ExpressionStatement;this.expression=e}return e}();t.ExpressionStatement=I;var M=function(){function e(e,t,r){this.type=n.Syntax.ForInStatement;this.left=e;this.right=t;this.body=r;this.each=false}return e}();t.ForInStatement=M;var N=function(){function e(e,t,r){this.type=n.Syntax.ForOfStatement;this.left=e;this.right=t;this.body=r}return e}();t.ForOfStatement=N;var L=function(){function e(e,t,r,i){this.type=n.Syntax.ForStatement;this.init=e;this.test=t;this.update=r;this.body=i}return e}();t.ForStatement=L;var B=function(){function e(e,t,r,i){this.type=n.Syntax.FunctionDeclaration;this.id=e;this.params=t;this.body=r;this.generator=i;this.expression=false;this.async=false}return e}();t.FunctionDeclaration=B;var O=function(){function e(e,t,r,i){this.type=n.Syntax.FunctionExpression;this.id=e;this.params=t;this.body=r;this.generator=i;this.expression=false;this.async=false}return e}();t.FunctionExpression=O;var R=function(){function e(e){this.type=n.Syntax.Identifier;this.name=e}return e}();t.Identifier=R;var j=function(){function e(e,t,r){this.type=n.Syntax.IfStatement;this.test=e;this.consequent=t;this.alternate=r}return e}();t.IfStatement=j;var U=function(){function e(e,t){this.type=n.Syntax.ImportDeclaration;this.specifiers=e;this.source=t}return e}();t.ImportDeclaration=U;var V=function(){function e(e){this.type=n.Syntax.ImportDefaultSpecifier;this.local=e}return e}();t.ImportDefaultSpecifier=V;var G=function(){function e(e){this.type=n.Syntax.ImportNamespaceSpecifier;this.local=e}return e}();t.ImportNamespaceSpecifier=G;var z=function(){function e(e,t){this.type=n.Syntax.ImportSpecifier;this.local=e;this.imported=t}return e}();t.ImportSpecifier=z;var X=function(){function e(e,t){this.type=n.Syntax.LabeledStatement;this.label=e;this.body=t}return e}();t.LabeledStatement=X;var J=function(){function e(e,t){this.type=n.Syntax.Literal;this.value=e;this.raw=t}return e}();t.Literal=J;var q=function(){function e(e,t){this.type=n.Syntax.MetaProperty;this.meta=e;this.property=t}return e}();t.MetaProperty=q;var W=function(){function e(e,t,r,i,s){this.type=n.Syntax.MethodDefinition;this.key=e;this.computed=t;this.value=r;this.kind=i;this.static=s}return e}();t.MethodDefinition=W;var H=function(){function e(e){this.type=n.Syntax.Program;this.body=e;this.sourceType="module"}return e}();t.Module=H;var K=function(){function e(e,t){this.type=n.Syntax.NewExpression;this.callee=e;this.arguments=t}return e}();t.NewExpression=K;var $=function(){function e(e){this.type=n.Syntax.ObjectExpression;this.properties=e}return e}();t.ObjectExpression=$;var Y=function(){function e(e){this.type=n.Syntax.ObjectPattern;this.properties=e}return e}();t.ObjectPattern=Y;var Q=function(){function e(e,t,r,i,s,a){this.type=n.Syntax.Property;this.key=t;this.computed=r;this.value=i;this.kind=e;this.method=s;this.shorthand=a}return e}();t.Property=Q;var Z=function(){function e(e,t,r,i){this.type=n.Syntax.Literal;this.value=e;this.raw=t;this.regex={pattern:r,flags:i}}return e}();t.RegexLiteral=Z;var ee=function(){function e(e){this.type=n.Syntax.RestElement;this.argument=e}return e}();t.RestElement=ee;var te=function(){function e(e){this.type=n.Syntax.ReturnStatement;this.argument=e}return e}();t.ReturnStatement=te;var re=function(){function e(e){this.type=n.Syntax.Program;this.body=e;this.sourceType="script"}return e}();t.Script=re;var ne=function(){function e(e){this.type=n.Syntax.SequenceExpression;this.expressions=e}return e}();t.SequenceExpression=ne;var ie=function(){function e(e){this.type=n.Syntax.SpreadElement;this.argument=e}return e}();t.SpreadElement=ie;var se=function(){function e(e,t){this.type=n.Syntax.MemberExpression;this.computed=false;this.object=e;this.property=t}return e}();t.StaticMemberExpression=se;var ae=function(){function e(){this.type=n.Syntax.Super}return e}();t.Super=ae;var oe=function(){function e(e,t){this.type=n.Syntax.SwitchCase;this.test=e;this.consequent=t}return e}();t.SwitchCase=oe;var le=function(){function e(e,t){this.type=n.Syntax.SwitchStatement;this.discriminant=e;this.cases=t}return e}();t.SwitchStatement=le;var ue=function(){function e(e,t){this.type=n.Syntax.TaggedTemplateExpression;this.tag=e;this.quasi=t}return e}();t.TaggedTemplateExpression=ue;var ce=function(){function e(e,t){this.type=n.Syntax.TemplateElement;this.value=e;this.tail=t}return e}();t.TemplateElement=ce;var fe=function(){function e(e,t){this.type=n.Syntax.TemplateLiteral;this.quasis=e;this.expressions=t}return e}();t.TemplateLiteral=fe;var he=function(){function e(){this.type=n.Syntax.ThisExpression}return e}();t.ThisExpression=he;var pe=function(){function e(e){this.type=n.Syntax.ThrowStatement;this.argument=e}return e}();t.ThrowStatement=pe;var de=function(){function e(e,t,r){this.type=n.Syntax.TryStatement;this.block=e;this.handler=t;this.finalizer=r}return e}();t.TryStatement=de;var me=function(){function e(e,t){this.type=n.Syntax.UnaryExpression;this.operator=e;this.argument=t;this.prefix=true}return e}();t.UnaryExpression=me;var ve=function(){function e(e,t,r){this.type=n.Syntax.UpdateExpression;this.operator=e;this.argument=t;this.prefix=r}return e}();t.UpdateExpression=ve;var ge=function(){function e(e,t){this.type=n.Syntax.VariableDeclaration;this.declarations=e;this.kind=t}return e}();t.VariableDeclaration=ge;var ye=function(){function e(e,t){this.type=n.Syntax.VariableDeclarator;this.id=e;this.init=t}return e}();t.VariableDeclarator=ye;var xe=function(){function e(e,t){this.type=n.Syntax.WhileStatement;this.test=e;this.body=t}return e}();t.WhileStatement=xe;var Ee=function(){function e(e,t){this.type=n.Syntax.WithStatement;this.object=e;this.body=t}return e}();t.WithStatement=Ee;var be=function(){function e(e,t){this.type=n.Syntax.YieldExpression;this.argument=e;this.delegate=t}return e}();t.YieldExpression=be},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(9);var i=r(10);var s=r(11);var a=r(7);var o=r(12);var l=r(2);var u=r(13);var c="ArrowParameterPlaceHolder";var f=function(){function e(e,t,r){if(t===void 0){t={}}this.config={range:typeof t.range==="boolean"&&t.range,loc:typeof t.loc==="boolean"&&t.loc,source:null,tokens:typeof t.tokens==="boolean"&&t.tokens,comment:typeof t.comment==="boolean"&&t.comment,tolerant:typeof t.tolerant==="boolean"&&t.tolerant};if(this.config.loc&&t.source&&t.source!==null){this.config.source=String(t.source)}this.delegate=r;this.errorHandler=new i.ErrorHandler;this.errorHandler.tolerant=this.config.tolerant;this.scanner=new o.Scanner(e,this.errorHandler);this.scanner.trackComment=this.config.comment;this.operatorPrecedence={")":0,";":0,",":0,"=":0,"]":0,"||":1,"&&":2,"|":3,"^":4,"&":5,"==":6,"!=":6,"===":6,"!==":6,"<":7,">":7,"<=":7,">=":7,"<<":8,">>":8,">>>":8,"+":9,"-":9,"*":11,"/":11,"%":11};this.lookahead={type:2,value:"",lineNumber:this.scanner.lineNumber,lineStart:0,start:0,end:0};this.hasLineTerminator=false;this.context={isModule:false,await:false,allowIn:true,allowStrictDirective:true,allowYield:true,firstCoverInitializedNameError:null,isAssignmentTarget:false,isBindingElement:false,inFunctionBody:false,inIteration:false,inSwitch:false,labelSet:{},strict:false};this.tokens=[];this.startMarker={index:0,line:this.scanner.lineNumber,column:0};this.lastMarker={index:0,line:this.scanner.lineNumber,column:0};this.nextToken();this.lastMarker={index:this.scanner.index,line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart}}e.prototype.throwError=function(e){var t=[];for(var r=1;r<arguments.length;r++){t[r-1]=arguments[r]}var i=Array.prototype.slice.call(arguments,1);var s=e.replace(/%(\d)/g,function(e,t){n.assert(t<i.length,"Message reference must be in range");return i[t]});var a=this.lastMarker.index;var o=this.lastMarker.line;var l=this.lastMarker.column+1;throw this.errorHandler.createError(a,o,l,s)};e.prototype.tolerateError=function(e){var t=[];for(var r=1;r<arguments.length;r++){t[r-1]=arguments[r]}var i=Array.prototype.slice.call(arguments,1);var s=e.replace(/%(\d)/g,function(e,t){n.assert(t<i.length,"Message reference must be in range");return i[t]});var a=this.lastMarker.index;var o=this.scanner.lineNumber;var l=this.lastMarker.column+1;this.errorHandler.tolerateError(a,o,l,s)};e.prototype.unexpectedTokenError=function(e,t){var r=t||s.Messages.UnexpectedToken;var n;if(e){if(!t){r=e.type===2?s.Messages.UnexpectedEOS:e.type===3?s.Messages.UnexpectedIdentifier:e.type===6?s.Messages.UnexpectedNumber:e.type===8?s.Messages.UnexpectedString:e.type===10?s.Messages.UnexpectedTemplate:s.Messages.UnexpectedToken;if(e.type===4){if(this.scanner.isFutureReservedWord(e.value)){r=s.Messages.UnexpectedReserved}else if(this.context.strict&&this.scanner.isStrictModeReservedWord(e.value)){r=s.Messages.StrictReservedWord}}}n=e.value}else{n="ILLEGAL"}r=r.replace("%0",n);if(e&&typeof e.lineNumber==="number"){var i=e.start;var a=e.lineNumber;var o=this.lastMarker.index-this.lastMarker.column;var l=e.start-o+1;return this.errorHandler.createError(i,a,l,r)}else{var i=this.lastMarker.index;var a=this.lastMarker.line;var l=this.lastMarker.column+1;return this.errorHandler.createError(i,a,l,r)}};e.prototype.throwUnexpectedToken=function(e,t){throw this.unexpectedTokenError(e,t)};e.prototype.tolerateUnexpectedToken=function(e,t){this.errorHandler.tolerate(this.unexpectedTokenError(e,t))};e.prototype.collectComments=function(){if(!this.config.comment){this.scanner.scanComments()}else{var e=this.scanner.scanComments();if(e.length>0&&this.delegate){for(var t=0;t<e.length;++t){var r=e[t];var n=void 0;n={type:r.multiLine?"BlockComment":"LineComment",value:this.scanner.source.slice(r.slice[0],r.slice[1])};if(this.config.range){n.range=r.range}if(this.config.loc){n.loc=r.loc}var i={start:{line:r.loc.start.line,column:r.loc.start.column,offset:r.range[0]},end:{line:r.loc.end.line,column:r.loc.end.column,offset:r.range[1]}};this.delegate(n,i)}}}};e.prototype.getTokenRaw=function(e){return this.scanner.source.slice(e.start,e.end)};e.prototype.convertToken=function(e){var t={type:u.TokenName[e.type],value:this.getTokenRaw(e)};if(this.config.range){t.range=[e.start,e.end]}if(this.config.loc){t.loc={start:{line:this.startMarker.line,column:this.startMarker.column},end:{line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart}}}if(e.type===9){var r=e.pattern;var n=e.flags;t.regex={pattern:r,flags:n}}return t};e.prototype.nextToken=function(){var e=this.lookahead;this.lastMarker.index=this.scanner.index;this.lastMarker.line=this.scanner.lineNumber;this.lastMarker.column=this.scanner.index-this.scanner.lineStart;this.collectComments();if(this.scanner.index!==this.startMarker.index){this.startMarker.index=this.scanner.index;this.startMarker.line=this.scanner.lineNumber;this.startMarker.column=this.scanner.index-this.scanner.lineStart}var t=this.scanner.lex();this.hasLineTerminator=e.lineNumber!==t.lineNumber;if(t&&this.context.strict&&t.type===3){if(this.scanner.isStrictModeReservedWord(t.value)){t.type=4}}this.lookahead=t;if(this.config.tokens&&t.type!==2){this.tokens.push(this.convertToken(t))}return e};e.prototype.nextRegexToken=function(){this.collectComments();var e=this.scanner.scanRegExp();if(this.config.tokens){this.tokens.pop();this.tokens.push(this.convertToken(e))}this.lookahead=e;this.nextToken();return e};e.prototype.createNode=function(){return{index:this.startMarker.index,line:this.startMarker.line,column:this.startMarker.column}};e.prototype.startNode=function(e,t){if(t===void 0){t=0}var r=e.start-e.lineStart;var n=e.lineNumber;if(r<0){r+=t;n--}return{index:e.start,line:n,column:r}};e.prototype.finalize=function(e,t){if(this.config.range){t.range=[e.index,this.lastMarker.index]}if(this.config.loc){t.loc={start:{line:e.line,column:e.column},end:{line:this.lastMarker.line,column:this.lastMarker.column}};if(this.config.source){t.loc.source=this.config.source}}if(this.delegate){var r={start:{line:e.line,column:e.column,offset:e.index},end:{line:this.lastMarker.line,column:this.lastMarker.column,offset:this.lastMarker.index}};this.delegate(t,r)}return t};e.prototype.expect=function(e){var t=this.nextToken();if(t.type!==7||t.value!==e){this.throwUnexpectedToken(t)}};e.prototype.expectCommaSeparator=function(){if(this.config.tolerant){var e=this.lookahead;if(e.type===7&&e.value===","){this.nextToken()}else if(e.type===7&&e.value===";"){this.nextToken();this.tolerateUnexpectedToken(e)}else{this.tolerateUnexpectedToken(e,s.Messages.UnexpectedToken)}}else{this.expect(",")}};e.prototype.expectKeyword=function(e){var t=this.nextToken();if(t.type!==4||t.value!==e){this.throwUnexpectedToken(t)}};e.prototype.match=function(e){return this.lookahead.type===7&&this.lookahead.value===e};e.prototype.matchKeyword=function(e){return this.lookahead.type===4&&this.lookahead.value===e};e.prototype.matchContextualKeyword=function(e){return this.lookahead.type===3&&this.lookahead.value===e};e.prototype.matchAssign=function(){if(this.lookahead.type!==7){return false}var e=this.lookahead.value;return e==="="||e==="*="||e==="**="||e==="/="||e==="%="||e==="+="||e==="-="||e==="<<="||e===">>="||e===">>>="||e==="&="||e==="^="||e==="|="};e.prototype.isolateCoverGrammar=function(e){var t=this.context.isBindingElement;var r=this.context.isAssignmentTarget;var n=this.context.firstCoverInitializedNameError;this.context.isBindingElement=true;this.context.isAssignmentTarget=true;this.context.firstCoverInitializedNameError=null;var i=e.call(this);if(this.context.firstCoverInitializedNameError!==null){this.throwUnexpectedToken(this.context.firstCoverInitializedNameError)}this.context.isBindingElement=t;this.context.isAssignmentTarget=r;this.context.firstCoverInitializedNameError=n;return i};e.prototype.inheritCoverGrammar=function(e){var t=this.context.isBindingElement;var r=this.context.isAssignmentTarget;var n=this.context.firstCoverInitializedNameError;this.context.isBindingElement=true;this.context.isAssignmentTarget=true;this.context.firstCoverInitializedNameError=null;var i=e.call(this);this.context.isBindingElement=this.context.isBindingElement&&t;this.context.isAssignmentTarget=this.context.isAssignmentTarget&&r;this.context.firstCoverInitializedNameError=n||this.context.firstCoverInitializedNameError;return i};e.prototype.consumeSemicolon=function(){if(this.match(";")){this.nextToken()}else if(!this.hasLineTerminator){if(this.lookahead.type!==2&&!this.match("}")){this.throwUnexpectedToken(this.lookahead)}this.lastMarker.index=this.startMarker.index;this.lastMarker.line=this.startMarker.line;this.lastMarker.column=this.startMarker.column}};e.prototype.parsePrimaryExpression=function(){var e=this.createNode();var t;var r,n;switch(this.lookahead.type){case 3:if((this.context.isModule||this.context.await)&&this.lookahead.value==="await"){this.tolerateUnexpectedToken(this.lookahead)}t=this.matchAsyncFunction()?this.parseFunctionExpression():this.finalize(e,new a.Identifier(this.nextToken().value));break;case 6:case 8:if(this.context.strict&&this.lookahead.octal){this.tolerateUnexpectedToken(this.lookahead,s.Messages.StrictOctalLiteral)}this.context.isAssignmentTarget=false;this.context.isBindingElement=false;r=this.nextToken();n=this.getTokenRaw(r);t=this.finalize(e,new a.Literal(r.value,n));break;case 1:this.context.isAssignmentTarget=false;this.context.isBindingElement=false;r=this.nextToken();n=this.getTokenRaw(r);t=this.finalize(e,new a.Literal(r.value==="true",n));break;case 5:this.context.isAssignmentTarget=false;this.context.isBindingElement=false;r=this.nextToken();n=this.getTokenRaw(r);t=this.finalize(e,new a.Literal(null,n));break;case 10:t=this.parseTemplateLiteral();break;case 7:switch(this.lookahead.value){case"(":this.context.isBindingElement=false;t=this.inheritCoverGrammar(this.parseGroupExpression);break;case"[":t=this.inheritCoverGrammar(this.parseArrayInitializer);break;case"{":t=this.inheritCoverGrammar(this.parseObjectInitializer);break;case"/":case"/=":this.context.isAssignmentTarget=false;this.context.isBindingElement=false;this.scanner.index=this.startMarker.index;r=this.nextRegexToken();n=this.getTokenRaw(r);t=this.finalize(e,new a.RegexLiteral(r.regex,n,r.pattern,r.flags));break;default:t=this.throwUnexpectedToken(this.nextToken())}break;case 4:if(!this.context.strict&&this.context.allowYield&&this.matchKeyword("yield")){t=this.parseIdentifierName()}else if(!this.context.strict&&this.matchKeyword("let")){t=this.finalize(e,new a.Identifier(this.nextToken().value))}else{this.context.isAssignmentTarget=false;this.context.isBindingElement=false;if(this.matchKeyword("function")){t=this.parseFunctionExpression()}else if(this.matchKeyword("this")){this.nextToken();t=this.finalize(e,new a.ThisExpression)}else if(this.matchKeyword("class")){t=this.parseClassExpression()}else{t=this.throwUnexpectedToken(this.nextToken())}}break;default:t=this.throwUnexpectedToken(this.nextToken())}return t};e.prototype.parseSpreadElement=function(){var e=this.createNode();this.expect("...");var t=this.inheritCoverGrammar(this.parseAssignmentExpression);return this.finalize(e,new a.SpreadElement(t))};e.prototype.parseArrayInitializer=function(){var e=this.createNode();var t=[];this.expect("[");while(!this.match("]")){if(this.match(",")){this.nextToken();t.push(null)}else if(this.match("...")){var r=this.parseSpreadElement();if(!this.match("]")){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;this.expect(",")}t.push(r)}else{t.push(this.inheritCoverGrammar(this.parseAssignmentExpression));if(!this.match("]")){this.expect(",")}}}this.expect("]");return this.finalize(e,new a.ArrayExpression(t))};e.prototype.parsePropertyMethod=function(e){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var t=this.context.strict;var r=this.context.allowStrictDirective;this.context.allowStrictDirective=e.simple;var n=this.isolateCoverGrammar(this.parseFunctionSourceElements);if(this.context.strict&&e.firstRestricted){this.tolerateUnexpectedToken(e.firstRestricted,e.message)}if(this.context.strict&&e.stricted){this.tolerateUnexpectedToken(e.stricted,e.message)}this.context.strict=t;this.context.allowStrictDirective=r;return n};e.prototype.parsePropertyMethodFunction=function(){var e=false;var t=this.createNode();var r=this.context.allowYield;this.context.allowYield=true;var n=this.parseFormalParameters();var i=this.parsePropertyMethod(n);this.context.allowYield=r;return this.finalize(t,new a.FunctionExpression(null,n.params,i,e))};e.prototype.parsePropertyMethodAsyncFunction=function(){var e=this.createNode();var t=this.context.allowYield;var r=this.context.await;this.context.allowYield=false;this.context.await=true;var n=this.parseFormalParameters();var i=this.parsePropertyMethod(n);this.context.allowYield=t;this.context.await=r;return this.finalize(e,new a.AsyncFunctionExpression(null,n.params,i))};e.prototype.parseObjectPropertyKey=function(){var e=this.createNode();var t=this.nextToken();var r;switch(t.type){case 8:case 6:if(this.context.strict&&t.octal){this.tolerateUnexpectedToken(t,s.Messages.StrictOctalLiteral)}var n=this.getTokenRaw(t);r=this.finalize(e,new a.Literal(t.value,n));break;case 3:case 1:case 5:case 4:r=this.finalize(e,new a.Identifier(t.value));break;case 7:if(t.value==="["){r=this.isolateCoverGrammar(this.parseAssignmentExpression);this.expect("]")}else{r=this.throwUnexpectedToken(t)}break;default:r=this.throwUnexpectedToken(t)}return r};e.prototype.isPropertyKey=function(e,t){return e.type===l.Syntax.Identifier&&e.name===t||e.type===l.Syntax.Literal&&e.value===t};e.prototype.parseObjectProperty=function(e){var t=this.createNode();var r=this.lookahead;var n;var i=null;var o=null;var l=false;var u=false;var c=false;var f=false;if(r.type===3){var h=r.value;this.nextToken();l=this.match("[");f=!this.hasLineTerminator&&h==="async"&&!this.match(":")&&!this.match("(")&&!this.match("*")&&!this.match(",");i=f?this.parseObjectPropertyKey():this.finalize(t,new a.Identifier(h))}else if(this.match("*")){this.nextToken()}else{l=this.match("[");i=this.parseObjectPropertyKey()}var p=this.qualifiedPropertyName(this.lookahead);if(r.type===3&&!f&&r.value==="get"&&p){n="get";l=this.match("[");i=this.parseObjectPropertyKey();this.context.allowYield=false;o=this.parseGetterMethod()}else if(r.type===3&&!f&&r.value==="set"&&p){n="set";l=this.match("[");i=this.parseObjectPropertyKey();o=this.parseSetterMethod()}else if(r.type===7&&r.value==="*"&&p){n="init";l=this.match("[");i=this.parseObjectPropertyKey();o=this.parseGeneratorMethod();u=true}else{if(!i){this.throwUnexpectedToken(this.lookahead)}n="init";if(this.match(":")&&!f){if(!l&&this.isPropertyKey(i,"__proto__")){if(e.value){this.tolerateError(s.Messages.DuplicateProtoProperty)}e.value=true}this.nextToken();o=this.inheritCoverGrammar(this.parseAssignmentExpression)}else if(this.match("(")){o=f?this.parsePropertyMethodAsyncFunction():this.parsePropertyMethodFunction();u=true}else if(r.type===3){var h=this.finalize(t,new a.Identifier(r.value));if(this.match("=")){this.context.firstCoverInitializedNameError=this.lookahead;this.nextToken();c=true;var d=this.isolateCoverGrammar(this.parseAssignmentExpression);o=this.finalize(t,new a.AssignmentPattern(h,d))}else{c=true;o=h}}else{this.throwUnexpectedToken(this.nextToken())}}return this.finalize(t,new a.Property(n,i,l,o,u,c))};e.prototype.parseObjectInitializer=function(){var e=this.createNode();this.expect("{");var t=[];var r={value:false};while(!this.match("}")){t.push(this.parseObjectProperty(r));if(!this.match("}")){this.expectCommaSeparator()}}this.expect("}");return this.finalize(e,new a.ObjectExpression(t))};e.prototype.parseTemplateHead=function(){n.assert(this.lookahead.head,"Template literal must start with a template head");var e=this.createNode();var t=this.nextToken();var r=t.value;var i=t.cooked;return this.finalize(e,new a.TemplateElement({raw:r,cooked:i},t.tail))};e.prototype.parseTemplateElement=function(){if(this.lookahead.type!==10){this.throwUnexpectedToken()}var e=this.createNode();var t=this.nextToken();var r=t.value;var n=t.cooked;return this.finalize(e,new a.TemplateElement({raw:r,cooked:n},t.tail))};e.prototype.parseTemplateLiteral=function(){var e=this.createNode();var t=[];var r=[];var n=this.parseTemplateHead();r.push(n);while(!n.tail){t.push(this.parseExpression());n=this.parseTemplateElement();r.push(n)}return this.finalize(e,new a.TemplateLiteral(r,t))};e.prototype.reinterpretExpressionAsPattern=function(e){switch(e.type){case l.Syntax.Identifier:case l.Syntax.MemberExpression:case l.Syntax.RestElement:case l.Syntax.AssignmentPattern:break;case l.Syntax.SpreadElement:e.type=l.Syntax.RestElement;this.reinterpretExpressionAsPattern(e.argument);break;case l.Syntax.ArrayExpression:e.type=l.Syntax.ArrayPattern;for(var t=0;t<e.elements.length;t++){if(e.elements[t]!==null){this.reinterpretExpressionAsPattern(e.elements[t])}}break;case l.Syntax.ObjectExpression:e.type=l.Syntax.ObjectPattern;for(var t=0;t<e.properties.length;t++){this.reinterpretExpressionAsPattern(e.properties[t].value)}break;case l.Syntax.AssignmentExpression:e.type=l.Syntax.AssignmentPattern;delete e.operator;this.reinterpretExpressionAsPattern(e.left);break;default:break}};e.prototype.parseGroupExpression=function(){var e;this.expect("(");if(this.match(")")){this.nextToken();if(!this.match("=>")){this.expect("=>")}e={type:c,params:[],async:false}}else{var t=this.lookahead;var r=[];if(this.match("...")){e=this.parseRestElement(r);this.expect(")");if(!this.match("=>")){this.expect("=>")}e={type:c,params:[e],async:false}}else{var n=false;this.context.isBindingElement=true;e=this.inheritCoverGrammar(this.parseAssignmentExpression);if(this.match(",")){var i=[];this.context.isAssignmentTarget=false;i.push(e);while(this.lookahead.type!==2){if(!this.match(",")){break}this.nextToken();if(this.match(")")){this.nextToken();for(var s=0;s<i.length;s++){this.reinterpretExpressionAsPattern(i[s])}n=true;e={type:c,params:i,async:false}}else if(this.match("...")){if(!this.context.isBindingElement){this.throwUnexpectedToken(this.lookahead)}i.push(this.parseRestElement(r));this.expect(")");if(!this.match("=>")){this.expect("=>")}this.context.isBindingElement=false;for(var s=0;s<i.length;s++){this.reinterpretExpressionAsPattern(i[s])}n=true;e={type:c,params:i,async:false}}else{i.push(this.inheritCoverGrammar(this.parseAssignmentExpression))}if(n){break}}if(!n){e=this.finalize(this.startNode(t),new a.SequenceExpression(i))}}if(!n){this.expect(")");if(this.match("=>")){if(e.type===l.Syntax.Identifier&&e.name==="yield"){n=true;e={type:c,params:[e],async:false}}if(!n){if(!this.context.isBindingElement){this.throwUnexpectedToken(this.lookahead)}if(e.type===l.Syntax.SequenceExpression){for(var s=0;s<e.expressions.length;s++){this.reinterpretExpressionAsPattern(e.expressions[s])}}else{this.reinterpretExpressionAsPattern(e)}var o=e.type===l.Syntax.SequenceExpression?e.expressions:[e];e={type:c,params:o,async:false}}}this.context.isBindingElement=false}}}return e};e.prototype.parseArguments=function(){this.expect("(");var e=[];if(!this.match(")")){while(true){var t=this.match("...")?this.parseSpreadElement():this.isolateCoverGrammar(this.parseAssignmentExpression);e.push(t);if(this.match(")")){break}this.expectCommaSeparator();if(this.match(")")){break}}}this.expect(")");return e};e.prototype.isIdentifierName=function(e){return e.type===3||e.type===4||e.type===1||e.type===5};e.prototype.parseIdentifierName=function(){var e=this.createNode();var t=this.nextToken();if(!this.isIdentifierName(t)){this.throwUnexpectedToken(t)}return this.finalize(e,new a.Identifier(t.value))};e.prototype.parseNewExpression=function(){var e=this.createNode();var t=this.parseIdentifierName();n.assert(t.name==="new","New expression must start with `new`");var r;if(this.match(".")){this.nextToken();if(this.lookahead.type===3&&this.context.inFunctionBody&&this.lookahead.value==="target"){var i=this.parseIdentifierName();r=new a.MetaProperty(t,i)}else{this.throwUnexpectedToken(this.lookahead)}}else{var s=this.isolateCoverGrammar(this.parseLeftHandSideExpression);var o=this.match("(")?this.parseArguments():[];r=new a.NewExpression(s,o);this.context.isAssignmentTarget=false;this.context.isBindingElement=false}return this.finalize(e,r)};e.prototype.parseAsyncArgument=function(){var e=this.parseAssignmentExpression();this.context.firstCoverInitializedNameError=null;return e};e.prototype.parseAsyncArguments=function(){this.expect("(");var e=[];if(!this.match(")")){while(true){var t=this.match("...")?this.parseSpreadElement():this.isolateCoverGrammar(this.parseAsyncArgument);e.push(t);if(this.match(")")){break}this.expectCommaSeparator();if(this.match(")")){break}}}this.expect(")");return e};e.prototype.parseLeftHandSideExpressionAllowCall=function(){var e=this.lookahead;var t=this.matchContextualKeyword("async");var r=this.context.allowIn;this.context.allowIn=true;var n;if(this.matchKeyword("super")&&this.context.inFunctionBody){n=this.createNode();this.nextToken();n=this.finalize(n,new a.Super);if(!this.match("(")&&!this.match(".")&&!this.match("[")){this.throwUnexpectedToken(this.lookahead)}}else{n=this.inheritCoverGrammar(this.matchKeyword("new")?this.parseNewExpression:this.parsePrimaryExpression)}while(true){if(this.match(".")){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect(".");var i=this.parseIdentifierName();n=this.finalize(this.startNode(e),new a.StaticMemberExpression(n,i))}else if(this.match("(")){var s=t&&e.lineNumber===this.lookahead.lineNumber;this.context.isBindingElement=false;this.context.isAssignmentTarget=false;var o=s?this.parseAsyncArguments():this.parseArguments();n=this.finalize(this.startNode(e),new a.CallExpression(n,o));if(s&&this.match("=>")){for(var l=0;l<o.length;++l){this.reinterpretExpressionAsPattern(o[l])}n={type:c,params:o,async:true}}}else if(this.match("[")){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect("[");var i=this.isolateCoverGrammar(this.parseExpression);this.expect("]");n=this.finalize(this.startNode(e),new a.ComputedMemberExpression(n,i))}else if(this.lookahead.type===10&&this.lookahead.head){var u=this.parseTemplateLiteral();n=this.finalize(this.startNode(e),new a.TaggedTemplateExpression(n,u))}else{break}}this.context.allowIn=r;return n};e.prototype.parseSuper=function(){var e=this.createNode();this.expectKeyword("super");if(!this.match("[")&&!this.match(".")){this.throwUnexpectedToken(this.lookahead)}return this.finalize(e,new a.Super)};e.prototype.parseLeftHandSideExpression=function(){n.assert(this.context.allowIn,"callee of new expression always allow in keyword.");var e=this.startNode(this.lookahead);var t=this.matchKeyword("super")&&this.context.inFunctionBody?this.parseSuper():this.inheritCoverGrammar(this.matchKeyword("new")?this.parseNewExpression:this.parsePrimaryExpression);while(true){if(this.match("[")){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect("[");var r=this.isolateCoverGrammar(this.parseExpression);this.expect("]");t=this.finalize(e,new a.ComputedMemberExpression(t,r))}else if(this.match(".")){this.context.isBindingElement=false;this.context.isAssignmentTarget=true;this.expect(".");var r=this.parseIdentifierName();t=this.finalize(e,new a.StaticMemberExpression(t,r))}else if(this.lookahead.type===10&&this.lookahead.head){var i=this.parseTemplateLiteral();t=this.finalize(e,new a.TaggedTemplateExpression(t,i))}else{break}}return t};e.prototype.parseUpdateExpression=function(){var e;var t=this.lookahead;if(this.match("++")||this.match("--")){var r=this.startNode(t);var n=this.nextToken();e=this.inheritCoverGrammar(this.parseUnaryExpression);if(this.context.strict&&e.type===l.Syntax.Identifier&&this.scanner.isRestrictedWord(e.name)){this.tolerateError(s.Messages.StrictLHSPrefix)}if(!this.context.isAssignmentTarget){this.tolerateError(s.Messages.InvalidLHSInAssignment)}var i=true;e=this.finalize(r,new a.UpdateExpression(n.value,e,i));this.context.isAssignmentTarget=false;this.context.isBindingElement=false}else{e=this.inheritCoverGrammar(this.parseLeftHandSideExpressionAllowCall);if(!this.hasLineTerminator&&this.lookahead.type===7){if(this.match("++")||this.match("--")){if(this.context.strict&&e.type===l.Syntax.Identifier&&this.scanner.isRestrictedWord(e.name)){this.tolerateError(s.Messages.StrictLHSPostfix)}if(!this.context.isAssignmentTarget){this.tolerateError(s.Messages.InvalidLHSInAssignment)}this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var o=this.nextToken().value;var i=false;e=this.finalize(this.startNode(t),new a.UpdateExpression(o,e,i))}}}return e};e.prototype.parseAwaitExpression=function(){var e=this.createNode();this.nextToken();var t=this.parseUnaryExpression();return this.finalize(e,new a.AwaitExpression(t))};e.prototype.parseUnaryExpression=function(){var e;if(this.match("+")||this.match("-")||this.match("~")||this.match("!")||this.matchKeyword("delete")||this.matchKeyword("void")||this.matchKeyword("typeof")){var t=this.startNode(this.lookahead);var r=this.nextToken();e=this.inheritCoverGrammar(this.parseUnaryExpression);e=this.finalize(t,new a.UnaryExpression(r.value,e));if(this.context.strict&&e.operator==="delete"&&e.argument.type===l.Syntax.Identifier){this.tolerateError(s.Messages.StrictDelete)}this.context.isAssignmentTarget=false;this.context.isBindingElement=false}else if(this.context.await&&this.matchContextualKeyword("await")){e=this.parseAwaitExpression()}else{e=this.parseUpdateExpression()}return e};e.prototype.parseExponentiationExpression=function(){var e=this.lookahead;var t=this.inheritCoverGrammar(this.parseUnaryExpression);if(t.type!==l.Syntax.UnaryExpression&&this.match("**")){this.nextToken();this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var r=t;var n=this.isolateCoverGrammar(this.parseExponentiationExpression);t=this.finalize(this.startNode(e),new a.BinaryExpression("**",r,n))}return t};e.prototype.binaryPrecedence=function(e){var t=e.value;var r;if(e.type===7){r=this.operatorPrecedence[t]||0}else if(e.type===4){r=t==="instanceof"||this.context.allowIn&&t==="in"?7:0}else{r=0}return r};e.prototype.parseBinaryExpression=function(){var e=this.lookahead;var t=this.inheritCoverGrammar(this.parseExponentiationExpression);var r=this.lookahead;var n=this.binaryPrecedence(r);if(n>0){this.nextToken();this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var i=[e,this.lookahead];var s=t;var o=this.isolateCoverGrammar(this.parseExponentiationExpression);var l=[s,r.value,o];var u=[n];while(true){n=this.binaryPrecedence(this.lookahead);if(n<=0){break}while(l.length>2&&n<=u[u.length-1]){o=l.pop();var c=l.pop();u.pop();s=l.pop();i.pop();var f=this.startNode(i[i.length-1]);l.push(this.finalize(f,new a.BinaryExpression(c,s,o)))}l.push(this.nextToken().value);u.push(n);i.push(this.lookahead);l.push(this.isolateCoverGrammar(this.parseExponentiationExpression))}var h=l.length-1;t=l[h];var p=i.pop();while(h>1){var d=i.pop();var m=p&&p.lineStart;var f=this.startNode(d,m);var c=l[h-1];t=this.finalize(f,new a.BinaryExpression(c,l[h-2],t));h-=2;p=d}}return t};e.prototype.parseConditionalExpression=function(){var e=this.lookahead;var t=this.inheritCoverGrammar(this.parseBinaryExpression);if(this.match("?")){this.nextToken();var r=this.context.allowIn;this.context.allowIn=true;var n=this.isolateCoverGrammar(this.parseAssignmentExpression);this.context.allowIn=r;this.expect(":");var i=this.isolateCoverGrammar(this.parseAssignmentExpression);t=this.finalize(this.startNode(e),new a.ConditionalExpression(t,n,i));this.context.isAssignmentTarget=false;this.context.isBindingElement=false}return t};e.prototype.checkPatternParam=function(e,t){switch(t.type){case l.Syntax.Identifier:this.validateParam(e,t,t.name);break;case l.Syntax.RestElement:this.checkPatternParam(e,t.argument);break;case l.Syntax.AssignmentPattern:this.checkPatternParam(e,t.left);break;case l.Syntax.ArrayPattern:for(var r=0;r<t.elements.length;r++){if(t.elements[r]!==null){this.checkPatternParam(e,t.elements[r])}}break;case l.Syntax.ObjectPattern:for(var r=0;r<t.properties.length;r++){this.checkPatternParam(e,t.properties[r].value)}break;default:break}e.simple=e.simple&&t instanceof a.Identifier};e.prototype.reinterpretAsCoverFormalsList=function(e){var t=[e];var r;var n=false;switch(e.type){case l.Syntax.Identifier:break;case c:t=e.params;n=e.async;break;default:return null}r={simple:true,paramSet:{}};for(var i=0;i<t.length;++i){var a=t[i];if(a.type===l.Syntax.AssignmentPattern){if(a.right.type===l.Syntax.YieldExpression){if(a.right.argument){this.throwUnexpectedToken(this.lookahead)}a.right.type=l.Syntax.Identifier;a.right.name="yield";delete a.right.argument;delete a.right.delegate}}else if(n&&a.type===l.Syntax.Identifier&&a.name==="await"){this.throwUnexpectedToken(this.lookahead)}this.checkPatternParam(r,a);t[i]=a}if(this.context.strict||!this.context.allowYield){for(var i=0;i<t.length;++i){var a=t[i];if(a.type===l.Syntax.YieldExpression){this.throwUnexpectedToken(this.lookahead)}}}if(r.message===s.Messages.StrictParamDupe){var o=this.context.strict?r.stricted:r.firstRestricted;this.throwUnexpectedToken(o,r.message)}return{simple:r.simple,params:t,stricted:r.stricted,firstRestricted:r.firstRestricted,message:r.message}};e.prototype.parseAssignmentExpression=function(){var e;if(!this.context.allowYield&&this.matchKeyword("yield")){e=this.parseYieldExpression()}else{var t=this.lookahead;var r=t;e=this.parseConditionalExpression();if(r.type===3&&r.lineNumber===this.lookahead.lineNumber&&r.value==="async"){if(this.lookahead.type===3||this.matchKeyword("yield")){var n=this.parsePrimaryExpression();this.reinterpretExpressionAsPattern(n);e={type:c,params:[n],async:true}}}if(e.type===c||this.match("=>")){this.context.isAssignmentTarget=false;this.context.isBindingElement=false;var i=e.async;var o=this.reinterpretAsCoverFormalsList(e);if(o){if(this.hasLineTerminator){this.tolerateUnexpectedToken(this.lookahead)}this.context.firstCoverInitializedNameError=null;var u=this.context.strict;var f=this.context.allowStrictDirective;this.context.allowStrictDirective=o.simple;var h=this.context.allowYield;var p=this.context.await;this.context.allowYield=true;this.context.await=i;var d=this.startNode(t);this.expect("=>");var m=void 0;if(this.match("{")){var v=this.context.allowIn;this.context.allowIn=true;m=this.parseFunctionSourceElements();this.context.allowIn=v}else{m=this.isolateCoverGrammar(this.parseAssignmentExpression)}var g=m.type!==l.Syntax.BlockStatement;if(this.context.strict&&o.firstRestricted){this.throwUnexpectedToken(o.firstRestricted,o.message)}if(this.context.strict&&o.stricted){this.tolerateUnexpectedToken(o.stricted,o.message)}e=i?this.finalize(d,new a.AsyncArrowFunctionExpression(o.params,m,g)):this.finalize(d,new a.ArrowFunctionExpression(o.params,m,g));this.context.strict=u;this.context.allowStrictDirective=f;this.context.allowYield=h;this.context.await=p}}else{if(this.matchAssign()){if(!this.context.isAssignmentTarget){this.tolerateError(s.Messages.InvalidLHSInAssignment)}if(this.context.strict&&e.type===l.Syntax.Identifier){var y=e;if(this.scanner.isRestrictedWord(y.name)){this.tolerateUnexpectedToken(r,s.Messages.StrictLHSAssignment)}if(this.scanner.isStrictModeReservedWord(y.name)){this.tolerateUnexpectedToken(r,s.Messages.StrictReservedWord)}}if(!this.match("=")){this.context.isAssignmentTarget=false;this.context.isBindingElement=false}else{this.reinterpretExpressionAsPattern(e)}r=this.nextToken();var x=r.value;var E=this.isolateCoverGrammar(this.parseAssignmentExpression);e=this.finalize(this.startNode(t),new a.AssignmentExpression(x,e,E));this.context.firstCoverInitializedNameError=null}}}return e};e.prototype.parseExpression=function(){var e=this.lookahead;var t=this.isolateCoverGrammar(this.parseAssignmentExpression);if(this.match(",")){var r=[];r.push(t);while(this.lookahead.type!==2){if(!this.match(",")){break}this.nextToken();r.push(this.isolateCoverGrammar(this.parseAssignmentExpression))}t=this.finalize(this.startNode(e),new a.SequenceExpression(r))}return t};e.prototype.parseStatementListItem=function(){var e;this.context.isAssignmentTarget=true;this.context.isBindingElement=true;if(this.lookahead.type===4){switch(this.lookahead.value){case"export":if(!this.context.isModule){this.tolerateUnexpectedToken(this.lookahead,s.Messages.IllegalExportDeclaration)}e=this.parseExportDeclaration();break;case"import":if(!this.context.isModule){this.tolerateUnexpectedToken(this.lookahead,s.Messages.IllegalImportDeclaration)}e=this.parseImportDeclaration();break;case"const":e=this.parseLexicalDeclaration({inFor:false});break;case"function":e=this.parseFunctionDeclaration();break;case"class":e=this.parseClassDeclaration();break;case"let":e=this.isLexicalDeclaration()?this.parseLexicalDeclaration({inFor:false}):this.parseStatement();break;default:e=this.parseStatement();break}}else{e=this.parseStatement()}return e};e.prototype.parseBlock=function(){var e=this.createNode();this.expect("{");var t=[];while(true){if(this.match("}")){break}t.push(this.parseStatementListItem())}this.expect("}");return this.finalize(e,new a.BlockStatement(t))};e.prototype.parseLexicalBinding=function(e,t){var r=this.createNode();var n=[];var i=this.parsePattern(n,e);if(this.context.strict&&i.type===l.Syntax.Identifier){if(this.scanner.isRestrictedWord(i.name)){this.tolerateError(s.Messages.StrictVarName)}}var o=null;if(e==="const"){if(!this.matchKeyword("in")&&!this.matchContextualKeyword("of")){if(this.match("=")){this.nextToken();o=this.isolateCoverGrammar(this.parseAssignmentExpression)}else{this.throwError(s.Messages.DeclarationMissingInitializer,"const")}}}else if(!t.inFor&&i.type!==l.Syntax.Identifier||this.match("=")){this.expect("=");o=this.isolateCoverGrammar(this.parseAssignmentExpression)}return this.finalize(r,new a.VariableDeclarator(i,o))};e.prototype.parseBindingList=function(e,t){var r=[this.parseLexicalBinding(e,t)];while(this.match(",")){this.nextToken();r.push(this.parseLexicalBinding(e,t))}return r};e.prototype.isLexicalDeclaration=function(){var e=this.scanner.saveState();this.scanner.scanComments();var t=this.scanner.lex();this.scanner.restoreState(e);return t.type===3||t.type===7&&t.value==="["||t.type===7&&t.value==="{"||t.type===4&&t.value==="let"||t.type===4&&t.value==="yield"};e.prototype.parseLexicalDeclaration=function(e){var t=this.createNode();var r=this.nextToken().value;n.assert(r==="let"||r==="const","Lexical declaration must be either let or const");var i=this.parseBindingList(r,e);this.consumeSemicolon();return this.finalize(t,new a.VariableDeclaration(i,r))};e.prototype.parseBindingRestElement=function(e,t){var r=this.createNode();this.expect("...");var n=this.parsePattern(e,t);return this.finalize(r,new a.RestElement(n))};e.prototype.parseArrayPattern=function(e,t){var r=this.createNode();this.expect("[");var n=[];while(!this.match("]")){if(this.match(",")){this.nextToken();n.push(null)}else{if(this.match("...")){n.push(this.parseBindingRestElement(e,t));break}else{n.push(this.parsePatternWithDefault(e,t))}if(!this.match("]")){this.expect(",")}}}this.expect("]");return this.finalize(r,new a.ArrayPattern(n))};e.prototype.parsePropertyPattern=function(e,t){var r=this.createNode();var n=false;var i=false;var s=false;var o;var l;if(this.lookahead.type===3){var u=this.lookahead;o=this.parseVariableIdentifier();var c=this.finalize(r,new a.Identifier(u.value));if(this.match("=")){e.push(u);i=true;this.nextToken();var f=this.parseAssignmentExpression();l=this.finalize(this.startNode(u),new a.AssignmentPattern(c,f))}else if(!this.match(":")){e.push(u);i=true;l=c}else{this.expect(":");l=this.parsePatternWithDefault(e,t)}}else{n=this.match("[");o=this.parseObjectPropertyKey();this.expect(":");l=this.parsePatternWithDefault(e,t)}return this.finalize(r,new a.Property("init",o,n,l,s,i))};e.prototype.parseObjectPattern=function(e,t){var r=this.createNode();var n=[];this.expect("{");while(!this.match("}")){n.push(this.parsePropertyPattern(e,t));if(!this.match("}")){this.expect(",")}}this.expect("}");return this.finalize(r,new a.ObjectPattern(n))};e.prototype.parsePattern=function(e,t){var r;if(this.match("[")){r=this.parseArrayPattern(e,t)}else if(this.match("{")){r=this.parseObjectPattern(e,t)}else{if(this.matchKeyword("let")&&(t==="const"||t==="let")){this.tolerateUnexpectedToken(this.lookahead,s.Messages.LetInLexicalBinding)}e.push(this.lookahead);r=this.parseVariableIdentifier(t)}return r};e.prototype.parsePatternWithDefault=function(e,t){var r=this.lookahead;var n=this.parsePattern(e,t);if(this.match("=")){this.nextToken();var i=this.context.allowYield;this.context.allowYield=true;var s=this.isolateCoverGrammar(this.parseAssignmentExpression);this.context.allowYield=i;n=this.finalize(this.startNode(r),new a.AssignmentPattern(n,s))}return n};e.prototype.parseVariableIdentifier=function(e){var t=this.createNode();var r=this.nextToken();if(r.type===4&&r.value==="yield"){if(this.context.strict){this.tolerateUnexpectedToken(r,s.Messages.StrictReservedWord)}else if(!this.context.allowYield){this.throwUnexpectedToken(r)}}else if(r.type!==3){if(this.context.strict&&r.type===4&&this.scanner.isStrictModeReservedWord(r.value)){this.tolerateUnexpectedToken(r,s.Messages.StrictReservedWord)}else{if(this.context.strict||r.value!=="let"||e!=="var"){this.throwUnexpectedToken(r)}}}else if((this.context.isModule||this.context.await)&&r.type===3&&r.value==="await"){this.tolerateUnexpectedToken(r)}return this.finalize(t,new a.Identifier(r.value))};e.prototype.parseVariableDeclaration=function(e){var t=this.createNode();var r=[];var n=this.parsePattern(r,"var");if(this.context.strict&&n.type===l.Syntax.Identifier){if(this.scanner.isRestrictedWord(n.name)){this.tolerateError(s.Messages.StrictVarName)}}var i=null;if(this.match("=")){this.nextToken();i=this.isolateCoverGrammar(this.parseAssignmentExpression)}else if(n.type!==l.Syntax.Identifier&&!e.inFor){this.expect("=")}return this.finalize(t,new a.VariableDeclarator(n,i))};e.prototype.parseVariableDeclarationList=function(e){var t={inFor:e.inFor};var r=[];r.push(this.parseVariableDeclaration(t));while(this.match(",")){this.nextToken();r.push(this.parseVariableDeclaration(t))}return r};e.prototype.parseVariableStatement=function(){var e=this.createNode();this.expectKeyword("var");var t=this.parseVariableDeclarationList({inFor:false});this.consumeSemicolon();return this.finalize(e,new a.VariableDeclaration(t,"var"))};e.prototype.parseEmptyStatement=function(){var e=this.createNode();this.expect(";");return this.finalize(e,new a.EmptyStatement)};e.prototype.parseExpressionStatement=function(){var e=this.createNode();var t=this.parseExpression();this.consumeSemicolon();return this.finalize(e,new a.ExpressionStatement(t))};e.prototype.parseIfClause=function(){if(this.context.strict&&this.matchKeyword("function")){this.tolerateError(s.Messages.StrictFunction)}return this.parseStatement()};e.prototype.parseIfStatement=function(){var e=this.createNode();var t;var r=null;this.expectKeyword("if");this.expect("(");var n=this.parseExpression();if(!this.match(")")&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());t=this.finalize(this.createNode(),new a.EmptyStatement)}else{this.expect(")");t=this.parseIfClause();if(this.matchKeyword("else")){this.nextToken();r=this.parseIfClause()}}return this.finalize(e,new a.IfStatement(n,t,r))};e.prototype.parseDoWhileStatement=function(){var e=this.createNode();this.expectKeyword("do");var t=this.context.inIteration;this.context.inIteration=true;var r=this.parseStatement();this.context.inIteration=t;this.expectKeyword("while");this.expect("(");var n=this.parseExpression();if(!this.match(")")&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken())}else{this.expect(")");if(this.match(";")){this.nextToken()}}return this.finalize(e,new a.DoWhileStatement(r,n))};e.prototype.parseWhileStatement=function(){var e=this.createNode();var t;this.expectKeyword("while");this.expect("(");var r=this.parseExpression();if(!this.match(")")&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());t=this.finalize(this.createNode(),new a.EmptyStatement)}else{this.expect(")");var n=this.context.inIteration;this.context.inIteration=true;t=this.parseStatement();this.context.inIteration=n}return this.finalize(e,new a.WhileStatement(r,t))};e.prototype.parseForStatement=function(){var e=null;var t=null;var r=null;var n=true;var i,o;var u=this.createNode();this.expectKeyword("for");this.expect("(");if(this.match(";")){this.nextToken()}else{if(this.matchKeyword("var")){e=this.createNode();this.nextToken();var c=this.context.allowIn;this.context.allowIn=false;var f=this.parseVariableDeclarationList({inFor:true});this.context.allowIn=c;if(f.length===1&&this.matchKeyword("in")){var h=f[0];if(h.init&&(h.id.type===l.Syntax.ArrayPattern||h.id.type===l.Syntax.ObjectPattern||this.context.strict)){this.tolerateError(s.Messages.ForInOfLoopInitializer,"for-in")}e=this.finalize(e,new a.VariableDeclaration(f,"var"));this.nextToken();i=e;o=this.parseExpression();e=null}else if(f.length===1&&f[0].init===null&&this.matchContextualKeyword("of")){e=this.finalize(e,new a.VariableDeclaration(f,"var"));this.nextToken();i=e;o=this.parseAssignmentExpression();e=null;n=false}else{e=this.finalize(e,new a.VariableDeclaration(f,"var"));this.expect(";")}}else if(this.matchKeyword("const")||this.matchKeyword("let")){e=this.createNode();var p=this.nextToken().value;if(!this.context.strict&&this.lookahead.value==="in"){e=this.finalize(e,new a.Identifier(p));this.nextToken();i=e;o=this.parseExpression();e=null}else{var c=this.context.allowIn;this.context.allowIn=false;var f=this.parseBindingList(p,{inFor:true});this.context.allowIn=c;if(f.length===1&&f[0].init===null&&this.matchKeyword("in")){e=this.finalize(e,new a.VariableDeclaration(f,p));this.nextToken();i=e;o=this.parseExpression();e=null}else if(f.length===1&&f[0].init===null&&this.matchContextualKeyword("of")){e=this.finalize(e,new a.VariableDeclaration(f,p));this.nextToken();i=e;o=this.parseAssignmentExpression();e=null;n=false}else{this.consumeSemicolon();e=this.finalize(e,new a.VariableDeclaration(f,p))}}}else{var d=this.lookahead;var c=this.context.allowIn;this.context.allowIn=false;e=this.inheritCoverGrammar(this.parseAssignmentExpression);this.context.allowIn=c;if(this.matchKeyword("in")){if(!this.context.isAssignmentTarget||e.type===l.Syntax.AssignmentExpression){this.tolerateError(s.Messages.InvalidLHSInForIn)}this.nextToken();this.reinterpretExpressionAsPattern(e);i=e;o=this.parseExpression();e=null}else if(this.matchContextualKeyword("of")){if(!this.context.isAssignmentTarget||e.type===l.Syntax.AssignmentExpression){this.tolerateError(s.Messages.InvalidLHSInForLoop)}this.nextToken();this.reinterpretExpressionAsPattern(e);i=e;o=this.parseAssignmentExpression();e=null;n=false}else{if(this.match(",")){var m=[e];while(this.match(",")){this.nextToken();m.push(this.isolateCoverGrammar(this.parseAssignmentExpression))}e=this.finalize(this.startNode(d),new a.SequenceExpression(m))}this.expect(";")}}}if(typeof i==="undefined"){if(!this.match(";")){t=this.parseExpression()}this.expect(";");if(!this.match(")")){r=this.parseExpression()}}var v;if(!this.match(")")&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());v=this.finalize(this.createNode(),new a.EmptyStatement)}else{this.expect(")");var g=this.context.inIteration;this.context.inIteration=true;v=this.isolateCoverGrammar(this.parseStatement);this.context.inIteration=g}return typeof i==="undefined"?this.finalize(u,new a.ForStatement(e,t,r,v)):n?this.finalize(u,new a.ForInStatement(i,o,v)):this.finalize(u,new a.ForOfStatement(i,o,v))};e.prototype.parseContinueStatement=function(){var e=this.createNode();this.expectKeyword("continue");var t=null;if(this.lookahead.type===3&&!this.hasLineTerminator){var r=this.parseVariableIdentifier();t=r;var n="$"+r.name;if(!Object.prototype.hasOwnProperty.call(this.context.labelSet,n)){this.throwError(s.Messages.UnknownLabel,r.name)}}this.consumeSemicolon();if(t===null&&!this.context.inIteration){this.throwError(s.Messages.IllegalContinue)}return this.finalize(e,new a.ContinueStatement(t))};e.prototype.parseBreakStatement=function(){var e=this.createNode();this.expectKeyword("break");var t=null;if(this.lookahead.type===3&&!this.hasLineTerminator){var r=this.parseVariableIdentifier();var n="$"+r.name;if(!Object.prototype.hasOwnProperty.call(this.context.labelSet,n)){this.throwError(s.Messages.UnknownLabel,r.name)}t=r}this.consumeSemicolon();if(t===null&&!this.context.inIteration&&!this.context.inSwitch){this.throwError(s.Messages.IllegalBreak)}return this.finalize(e,new a.BreakStatement(t))};e.prototype.parseReturnStatement=function(){if(!this.context.inFunctionBody){this.tolerateError(s.Messages.IllegalReturn)}var e=this.createNode();this.expectKeyword("return");var t=!this.match(";")&&!this.match("}")&&!this.hasLineTerminator&&this.lookahead.type!==2||this.lookahead.type===8||this.lookahead.type===10;var r=t?this.parseExpression():null;this.consumeSemicolon();return this.finalize(e,new a.ReturnStatement(r))};e.prototype.parseWithStatement=function(){if(this.context.strict){this.tolerateError(s.Messages.StrictModeWith)}var e=this.createNode();var t;this.expectKeyword("with");this.expect("(");var r=this.parseExpression();if(!this.match(")")&&this.config.tolerant){this.tolerateUnexpectedToken(this.nextToken());t=this.finalize(this.createNode(),new a.EmptyStatement)}else{this.expect(")");t=this.parseStatement()}return this.finalize(e,new a.WithStatement(r,t))};e.prototype.parseSwitchCase=function(){var e=this.createNode();var t;if(this.matchKeyword("default")){this.nextToken();t=null}else{this.expectKeyword("case");t=this.parseExpression()}this.expect(":");var r=[];while(true){if(this.match("}")||this.matchKeyword("default")||this.matchKeyword("case")){break}r.push(this.parseStatementListItem())}return this.finalize(e,new a.SwitchCase(t,r))};e.prototype.parseSwitchStatement=function(){var e=this.createNode();this.expectKeyword("switch");this.expect("(");var t=this.parseExpression();this.expect(")");var r=this.context.inSwitch;this.context.inSwitch=true;var n=[];var i=false;this.expect("{");while(true){if(this.match("}")){break}var o=this.parseSwitchCase();if(o.test===null){if(i){this.throwError(s.Messages.MultipleDefaultsInSwitch)}i=true}n.push(o)}this.expect("}");this.context.inSwitch=r;return this.finalize(e,new a.SwitchStatement(t,n))};e.prototype.parseLabelledStatement=function(){var e=this.createNode();var t=this.parseExpression();var r;if(t.type===l.Syntax.Identifier&&this.match(":")){this.nextToken();var n=t;var i="$"+n.name;if(Object.prototype.hasOwnProperty.call(this.context.labelSet,i)){this.throwError(s.Messages.Redeclaration,"Label",n.name)}this.context.labelSet[i]=true;var o=void 0;if(this.matchKeyword("class")){this.tolerateUnexpectedToken(this.lookahead);o=this.parseClassDeclaration()}else if(this.matchKeyword("function")){var u=this.lookahead;var c=this.parseFunctionDeclaration();if(this.context.strict){this.tolerateUnexpectedToken(u,s.Messages.StrictFunction)}else if(c.generator){this.tolerateUnexpectedToken(u,s.Messages.GeneratorInLegacyContext)}o=c}else{o=this.parseStatement()}delete this.context.labelSet[i];r=new a.LabeledStatement(n,o)}else{this.consumeSemicolon();r=new a.ExpressionStatement(t)}return this.finalize(e,r)};e.prototype.parseThrowStatement=function(){var e=this.createNode();this.expectKeyword("throw");if(this.hasLineTerminator){this.throwError(s.Messages.NewlineAfterThrow)}var t=this.parseExpression();this.consumeSemicolon();return this.finalize(e,new a.ThrowStatement(t))};e.prototype.parseCatchClause=function(){var e=this.createNode();this.expectKeyword("catch");this.expect("(");if(this.match(")")){this.throwUnexpectedToken(this.lookahead)}var t=[];var r=this.parsePattern(t);var n={};for(var i=0;i<t.length;i++){var o="$"+t[i].value;if(Object.prototype.hasOwnProperty.call(n,o)){this.tolerateError(s.Messages.DuplicateBinding,t[i].value)}n[o]=true}if(this.context.strict&&r.type===l.Syntax.Identifier){if(this.scanner.isRestrictedWord(r.name)){this.tolerateError(s.Messages.StrictCatchVariable)}}this.expect(")");var u=this.parseBlock();return this.finalize(e,new a.CatchClause(r,u))};e.prototype.parseFinallyClause=function(){this.expectKeyword("finally");return this.parseBlock()};e.prototype.parseTryStatement=function(){var e=this.createNode();this.expectKeyword("try");var t=this.parseBlock();var r=this.matchKeyword("catch")?this.parseCatchClause():null;var n=this.matchKeyword("finally")?this.parseFinallyClause():null;if(!r&&!n){this.throwError(s.Messages.NoCatchOrFinally)}return this.finalize(e,new a.TryStatement(t,r,n))};e.prototype.parseDebuggerStatement=function(){var e=this.createNode();this.expectKeyword("debugger");this.consumeSemicolon();return this.finalize(e,new a.DebuggerStatement)};e.prototype.parseStatement=function(){var e;switch(this.lookahead.type){case 1:case 5:case 6:case 8:case 10:case 9:e=this.parseExpressionStatement();break;case 7:var t=this.lookahead.value;if(t==="{"){e=this.parseBlock()}else if(t==="("){e=this.parseExpressionStatement()}else if(t===";"){e=this.parseEmptyStatement()}else{e=this.parseExpressionStatement()}break;case 3:e=this.matchAsyncFunction()?this.parseFunctionDeclaration():this.parseLabelledStatement();break;case 4:switch(this.lookahead.value){case"break":e=this.parseBreakStatement();break;case"continue":e=this.parseContinueStatement();break;case"debugger":e=this.parseDebuggerStatement();break;case"do":e=this.parseDoWhileStatement();break;case"for":e=this.parseForStatement();break;case"function":e=this.parseFunctionDeclaration();break;case"if":e=this.parseIfStatement();break;case"return":e=this.parseReturnStatement();break;case"switch":e=this.parseSwitchStatement();break;case"throw":e=this.parseThrowStatement();break;case"try":e=this.parseTryStatement();break;case"var":e=this.parseVariableStatement();break;case"while":e=this.parseWhileStatement();break;case"with":e=this.parseWithStatement();break;default:e=this.parseExpressionStatement();break}break;default:e=this.throwUnexpectedToken(this.lookahead)}return e};e.prototype.parseFunctionSourceElements=function(){var e=this.createNode();this.expect("{");var t=this.parseDirectivePrologues();var r=this.context.labelSet;var n=this.context.inIteration;var i=this.context.inSwitch;var s=this.context.inFunctionBody;this.context.labelSet={};this.context.inIteration=false;this.context.inSwitch=false;this.context.inFunctionBody=true;while(this.lookahead.type!==2){if(this.match("}")){break}t.push(this.parseStatementListItem())}this.expect("}");this.context.labelSet=r;this.context.inIteration=n;this.context.inSwitch=i;this.context.inFunctionBody=s;return this.finalize(e,new a.BlockStatement(t))};e.prototype.validateParam=function(e,t,r){var n="$"+r;if(this.context.strict){if(this.scanner.isRestrictedWord(r)){e.stricted=t;e.message=s.Messages.StrictParamName}if(Object.prototype.hasOwnProperty.call(e.paramSet,n)){e.stricted=t;e.message=s.Messages.StrictParamDupe}}else if(!e.firstRestricted){if(this.scanner.isRestrictedWord(r)){e.firstRestricted=t;e.message=s.Messages.StrictParamName}else if(this.scanner.isStrictModeReservedWord(r)){e.firstRestricted=t;e.message=s.Messages.StrictReservedWord}else if(Object.prototype.hasOwnProperty.call(e.paramSet,n)){e.stricted=t;e.message=s.Messages.StrictParamDupe}}if(typeof Object.defineProperty==="function"){Object.defineProperty(e.paramSet,n,{value:true,enumerable:true,writable:true,configurable:true})}else{e.paramSet[n]=true}};e.prototype.parseRestElement=function(e){var t=this.createNode();this.expect("...");var r=this.parsePattern(e);if(this.match("=")){this.throwError(s.Messages.DefaultRestParameter)}if(!this.match(")")){this.throwError(s.Messages.ParameterAfterRestParameter)}return this.finalize(t,new a.RestElement(r))};e.prototype.parseFormalParameter=function(e){var t=[];var r=this.match("...")?this.parseRestElement(t):this.parsePatternWithDefault(t);for(var n=0;n<t.length;n++){this.validateParam(e,t[n],t[n].value)}e.simple=e.simple&&r instanceof a.Identifier;e.params.push(r)};e.prototype.parseFormalParameters=function(e){var t;t={simple:true,params:[],firstRestricted:e};this.expect("(");if(!this.match(")")){t.paramSet={};while(this.lookahead.type!==2){this.parseFormalParameter(t);if(this.match(")")){break}this.expect(",");if(this.match(")")){break}}}this.expect(")");return{simple:t.simple,params:t.params,stricted:t.stricted,firstRestricted:t.firstRestricted,message:t.message}};e.prototype.matchAsyncFunction=function(){var e=this.matchContextualKeyword("async");if(e){var t=this.scanner.saveState();this.scanner.scanComments();var r=this.scanner.lex();this.scanner.restoreState(t);e=t.lineNumber===r.lineNumber&&r.type===4&&r.value==="function"}return e};e.prototype.parseFunctionDeclaration=function(e){var t=this.createNode();var r=this.matchContextualKeyword("async");if(r){this.nextToken()}this.expectKeyword("function");var n=r?false:this.match("*");if(n){this.nextToken()}var i;var o=null;var l=null;if(!e||!this.match("(")){var u=this.lookahead;o=this.parseVariableIdentifier();if(this.context.strict){if(this.scanner.isRestrictedWord(u.value)){this.tolerateUnexpectedToken(u,s.Messages.StrictFunctionName)}}else{if(this.scanner.isRestrictedWord(u.value)){l=u;i=s.Messages.StrictFunctionName}else if(this.scanner.isStrictModeReservedWord(u.value)){l=u;i=s.Messages.StrictReservedWord}}}var c=this.context.await;var f=this.context.allowYield;this.context.await=r;this.context.allowYield=!n;var h=this.parseFormalParameters(l);var p=h.params;var d=h.stricted;l=h.firstRestricted;if(h.message){i=h.message}var m=this.context.strict;var v=this.context.allowStrictDirective;this.context.allowStrictDirective=h.simple;var g=this.parseFunctionSourceElements();if(this.context.strict&&l){this.throwUnexpectedToken(l,i)}if(this.context.strict&&d){this.tolerateUnexpectedToken(d,i)}this.context.strict=m;this.context.allowStrictDirective=v;this.context.await=c;this.context.allowYield=f;return r?this.finalize(t,new a.AsyncFunctionDeclaration(o,p,g)):this.finalize(t,new a.FunctionDeclaration(o,p,g,n))};e.prototype.parseFunctionExpression=function(){var e=this.createNode();var t=this.matchContextualKeyword("async");if(t){this.nextToken()}this.expectKeyword("function");var r=t?false:this.match("*");if(r){this.nextToken()}var n;var i=null;var o;var l=this.context.await;var u=this.context.allowYield;this.context.await=t;this.context.allowYield=!r;if(!this.match("(")){var c=this.lookahead;i=!this.context.strict&&!r&&this.matchKeyword("yield")?this.parseIdentifierName():this.parseVariableIdentifier();if(this.context.strict){if(this.scanner.isRestrictedWord(c.value)){this.tolerateUnexpectedToken(c,s.Messages.StrictFunctionName)}}else{if(this.scanner.isRestrictedWord(c.value)){o=c;n=s.Messages.StrictFunctionName}else if(this.scanner.isStrictModeReservedWord(c.value)){o=c;n=s.Messages.StrictReservedWord}}}var f=this.parseFormalParameters(o);var h=f.params;var p=f.stricted;o=f.firstRestricted;if(f.message){n=f.message}var d=this.context.strict;var m=this.context.allowStrictDirective;this.context.allowStrictDirective=f.simple;var v=this.parseFunctionSourceElements();if(this.context.strict&&o){this.throwUnexpectedToken(o,n)}if(this.context.strict&&p){this.tolerateUnexpectedToken(p,n)}this.context.strict=d;this.context.allowStrictDirective=m;this.context.await=l;this.context.allowYield=u;return t?this.finalize(e,new a.AsyncFunctionExpression(i,h,v)):this.finalize(e,new a.FunctionExpression(i,h,v,r))};e.prototype.parseDirective=function(){var e=this.lookahead;var t=this.createNode();var r=this.parseExpression();var n=r.type===l.Syntax.Literal?this.getTokenRaw(e).slice(1,-1):null;this.consumeSemicolon();return this.finalize(t,n?new a.Directive(r,n):new a.ExpressionStatement(r))};e.prototype.parseDirectivePrologues=function(){var e=null;var t=[];while(true){var r=this.lookahead;if(r.type!==8){break}var n=this.parseDirective();t.push(n);var i=n.directive;if(typeof i!=="string"){break}if(i==="use strict"){this.context.strict=true;if(e){this.tolerateUnexpectedToken(e,s.Messages.StrictOctalLiteral)}if(!this.context.allowStrictDirective){this.tolerateUnexpectedToken(r,s.Messages.IllegalLanguageModeDirective)}}else{if(!e&&r.octal){e=r}}}return t};e.prototype.qualifiedPropertyName=function(e){switch(e.type){case 3:case 8:case 1:case 5:case 6:case 4:return true;case 7:return e.value==="[";default:break}return false};e.prototype.parseGetterMethod=function(){var e=this.createNode();var t=false;var r=this.context.allowYield;this.context.allowYield=!t;var n=this.parseFormalParameters();if(n.params.length>0){this.tolerateError(s.Messages.BadGetterArity)}var i=this.parsePropertyMethod(n);this.context.allowYield=r;return this.finalize(e,new a.FunctionExpression(null,n.params,i,t))};e.prototype.parseSetterMethod=function(){var e=this.createNode();var t=false;var r=this.context.allowYield;this.context.allowYield=!t;var n=this.parseFormalParameters();if(n.params.length!==1){this.tolerateError(s.Messages.BadSetterArity)}else if(n.params[0]instanceof a.RestElement){this.tolerateError(s.Messages.BadSetterRestParameter)}var i=this.parsePropertyMethod(n);this.context.allowYield=r;return this.finalize(e,new a.FunctionExpression(null,n.params,i,t))};e.prototype.parseGeneratorMethod=function(){var e=this.createNode();var t=true;var r=this.context.allowYield;this.context.allowYield=true;var n=this.parseFormalParameters();this.context.allowYield=false;var i=this.parsePropertyMethod(n);this.context.allowYield=r;return this.finalize(e,new a.FunctionExpression(null,n.params,i,t))};e.prototype.isStartOfExpression=function(){var e=true;var t=this.lookahead.value;switch(this.lookahead.type){case 7:e=t==="["||t==="("||t==="{"||t==="+"||t==="-"||t==="!"||t==="~"||t==="++"||t==="--"||t==="/"||t==="/=";break;case 4:e=t==="class"||t==="delete"||t==="function"||t==="let"||t==="new"||t==="super"||t==="this"||t==="typeof"||t==="void"||t==="yield";break;default:break}return e};e.prototype.parseYieldExpression=function(){var e=this.createNode();this.expectKeyword("yield");var t=null;var r=false;if(!this.hasLineTerminator){var n=this.context.allowYield;this.context.allowYield=false;r=this.match("*");if(r){this.nextToken();t=this.parseAssignmentExpression()}else if(this.isStartOfExpression()){t=this.parseAssignmentExpression()}this.context.allowYield=n}return this.finalize(e,new a.YieldExpression(t,r))};e.prototype.parseClassElement=function(e){var t=this.lookahead;var r=this.createNode();var n="";var i=null;var o=null;var l=false;var u=false;var c=false;var f=false;if(this.match("*")){this.nextToken()}else{l=this.match("[");i=this.parseObjectPropertyKey();var h=i;if(h.name==="static"&&(this.qualifiedPropertyName(this.lookahead)||this.match("*"))){t=this.lookahead;c=true;l=this.match("[");if(this.match("*")){this.nextToken()}else{i=this.parseObjectPropertyKey()}}if(t.type===3&&!this.hasLineTerminator&&t.value==="async"){var p=this.lookahead.value;if(p!==":"&&p!=="("&&p!=="*"){f=true;t=this.lookahead;i=this.parseObjectPropertyKey();if(t.type===3&&t.value==="constructor"){this.tolerateUnexpectedToken(t,s.Messages.ConstructorIsAsync)}}}}var d=this.qualifiedPropertyName(this.lookahead);if(t.type===3){if(t.value==="get"&&d){n="get";l=this.match("[");i=this.parseObjectPropertyKey();this.context.allowYield=false;o=this.parseGetterMethod()}else if(t.value==="set"&&d){n="set";l=this.match("[");i=this.parseObjectPropertyKey();o=this.parseSetterMethod()}}else if(t.type===7&&t.value==="*"&&d){n="init";l=this.match("[");i=this.parseObjectPropertyKey();o=this.parseGeneratorMethod();u=true}if(!n&&i&&this.match("(")){n="init";o=f?this.parsePropertyMethodAsyncFunction():this.parsePropertyMethodFunction();u=true}if(!n){this.throwUnexpectedToken(this.lookahead)}if(n==="init"){n="method"}if(!l){if(c&&this.isPropertyKey(i,"prototype")){this.throwUnexpectedToken(t,s.Messages.StaticPrototype)}if(!c&&this.isPropertyKey(i,"constructor")){if(n!=="method"||!u||o&&o.generator){this.throwUnexpectedToken(t,s.Messages.ConstructorSpecialMethod)}if(e.value){this.throwUnexpectedToken(t,s.Messages.DuplicateConstructor)}else{e.value=true}n="constructor"}}return this.finalize(r,new a.MethodDefinition(i,l,o,n,c))};e.prototype.parseClassElementList=function(){var e=[];var t={value:false};this.expect("{");while(!this.match("}")){if(this.match(";")){this.nextToken()}else{e.push(this.parseClassElement(t))}}this.expect("}");return e};e.prototype.parseClassBody=function(){var e=this.createNode();var t=this.parseClassElementList();return this.finalize(e,new a.ClassBody(t))};e.prototype.parseClassDeclaration=function(e){var t=this.createNode();var r=this.context.strict;this.context.strict=true;this.expectKeyword("class");var n=e&&this.lookahead.type!==3?null:this.parseVariableIdentifier();var i=null;if(this.matchKeyword("extends")){this.nextToken();i=this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall)}var s=this.parseClassBody();this.context.strict=r;return this.finalize(t,new a.ClassDeclaration(n,i,s))};e.prototype.parseClassExpression=function(){var e=this.createNode();var t=this.context.strict;this.context.strict=true;this.expectKeyword("class");var r=this.lookahead.type===3?this.parseVariableIdentifier():null;var n=null;if(this.matchKeyword("extends")){this.nextToken();n=this.isolateCoverGrammar(this.parseLeftHandSideExpressionAllowCall)}var i=this.parseClassBody();this.context.strict=t;return this.finalize(e,new a.ClassExpression(r,n,i))};e.prototype.parseModule=function(){this.context.strict=true;this.context.isModule=true;this.scanner.isModule=true;var e=this.createNode();var t=this.parseDirectivePrologues();while(this.lookahead.type!==2){t.push(this.parseStatementListItem())}return this.finalize(e,new a.Module(t))};e.prototype.parseScript=function(){var e=this.createNode();var t=this.parseDirectivePrologues();while(this.lookahead.type!==2){t.push(this.parseStatementListItem())}return this.finalize(e,new a.Script(t))};e.prototype.parseModuleSpecifier=function(){var e=this.createNode();if(this.lookahead.type!==8){this.throwError(s.Messages.InvalidModuleSpecifier)}var t=this.nextToken();var r=this.getTokenRaw(t);return this.finalize(e,new a.Literal(t.value,r))};e.prototype.parseImportSpecifier=function(){var e=this.createNode();var t;var r;if(this.lookahead.type===3){t=this.parseVariableIdentifier();r=t;if(this.matchContextualKeyword("as")){this.nextToken();r=this.parseVariableIdentifier()}}else{t=this.parseIdentifierName();r=t;if(this.matchContextualKeyword("as")){this.nextToken();r=this.parseVariableIdentifier()}else{this.throwUnexpectedToken(this.nextToken())}}return this.finalize(e,new a.ImportSpecifier(r,t))};e.prototype.parseNamedImports=function(){this.expect("{");var e=[];while(!this.match("}")){e.push(this.parseImportSpecifier());if(!this.match("}")){this.expect(",")}}this.expect("}");return e};e.prototype.parseImportDefaultSpecifier=function(){var e=this.createNode();var t=this.parseIdentifierName();return this.finalize(e,new a.ImportDefaultSpecifier(t))};e.prototype.parseImportNamespaceSpecifier=function(){var e=this.createNode();this.expect("*");if(!this.matchContextualKeyword("as")){this.throwError(s.Messages.NoAsAfterImportNamespace)}this.nextToken();var t=this.parseIdentifierName();return this.finalize(e,new a.ImportNamespaceSpecifier(t))};e.prototype.parseImportDeclaration=function(){if(this.context.inFunctionBody){this.throwError(s.Messages.IllegalImportDeclaration)}var e=this.createNode();this.expectKeyword("import");var t;var r=[];if(this.lookahead.type===8){t=this.parseModuleSpecifier()}else{if(this.match("{")){r=r.concat(this.parseNamedImports())}else if(this.match("*")){r.push(this.parseImportNamespaceSpecifier())}else if(this.isIdentifierName(this.lookahead)&&!this.matchKeyword("default")){r.push(this.parseImportDefaultSpecifier());if(this.match(",")){this.nextToken();if(this.match("*")){r.push(this.parseImportNamespaceSpecifier())}else if(this.match("{")){r=r.concat(this.parseNamedImports())}else{this.throwUnexpectedToken(this.lookahead)}}}else{this.throwUnexpectedToken(this.nextToken())}if(!this.matchContextualKeyword("from")){var n=this.lookahead.value?s.Messages.UnexpectedToken:s.Messages.MissingFromClause;this.throwError(n,this.lookahead.value)}this.nextToken();t=this.parseModuleSpecifier()}this.consumeSemicolon();return this.finalize(e,new a.ImportDeclaration(r,t))};e.prototype.parseExportSpecifier=function(){var e=this.createNode();var t=this.parseIdentifierName();var r=t;if(this.matchContextualKeyword("as")){this.nextToken();r=this.parseIdentifierName()}return this.finalize(e,new a.ExportSpecifier(t,r))};e.prototype.parseExportDeclaration=function(){if(this.context.inFunctionBody){this.throwError(s.Messages.IllegalExportDeclaration)}var e=this.createNode();this.expectKeyword("export");var t;if(this.matchKeyword("default")){this.nextToken();if(this.matchKeyword("function")){var r=this.parseFunctionDeclaration(true);t=this.finalize(e,new a.ExportDefaultDeclaration(r))}else if(this.matchKeyword("class")){var r=this.parseClassDeclaration(true);t=this.finalize(e,new a.ExportDefaultDeclaration(r))}else if(this.matchContextualKeyword("async")){var r=this.matchAsyncFunction()?this.parseFunctionDeclaration(true):this.parseAssignmentExpression();t=this.finalize(e,new a.ExportDefaultDeclaration(r))}else{if(this.matchContextualKeyword("from")){this.throwError(s.Messages.UnexpectedToken,this.lookahead.value)}var r=this.match("{")?this.parseObjectInitializer():this.match("[")?this.parseArrayInitializer():this.parseAssignmentExpression();this.consumeSemicolon();t=this.finalize(e,new a.ExportDefaultDeclaration(r))}}else if(this.match("*")){this.nextToken();if(!this.matchContextualKeyword("from")){var n=this.lookahead.value?s.Messages.UnexpectedToken:s.Messages.MissingFromClause;this.throwError(n,this.lookahead.value)}this.nextToken();var i=this.parseModuleSpecifier();this.consumeSemicolon();t=this.finalize(e,new a.ExportAllDeclaration(i))}else if(this.lookahead.type===4){var r=void 0;switch(this.lookahead.value){case"let":case"const":r=this.parseLexicalDeclaration({inFor:false});break;case"var":case"class":case"function":r=this.parseStatementListItem();break;default:this.throwUnexpectedToken(this.lookahead)}t=this.finalize(e,new a.ExportNamedDeclaration(r,[],null))}else if(this.matchAsyncFunction()){var r=this.parseFunctionDeclaration();t=this.finalize(e,new a.ExportNamedDeclaration(r,[],null))}else{var o=[];var l=null;var u=false;this.expect("{");while(!this.match("}")){u=u||this.matchKeyword("default");o.push(this.parseExportSpecifier());if(!this.match("}")){this.expect(",")}}this.expect("}");if(this.matchContextualKeyword("from")){this.nextToken();l=this.parseModuleSpecifier();this.consumeSemicolon()}else if(u){var n=this.lookahead.value?s.Messages.UnexpectedToken:s.Messages.MissingFromClause;this.throwError(n,this.lookahead.value)}else{this.consumeSemicolon()}t=this.finalize(e,new a.ExportNamedDeclaration(null,o,l))}return t};return e}();t.Parser=f},function(e,t){Object.defineProperty(t,"__esModule",{value:true});function r(e,t){if(!e){throw new Error("ASSERT: "+t)}}t.assert=r},function(e,t){Object.defineProperty(t,"__esModule",{value:true});var r=function(){function e(){this.errors=[];this.tolerant=false}e.prototype.recordError=function(e){this.errors.push(e)};e.prototype.tolerate=function(e){if(this.tolerant){this.recordError(e)}else{throw e}};e.prototype.constructError=function(e,t){var r=new Error(e);try{throw r}catch(e){if(Object.create&&Object.defineProperty){r=Object.create(e);Object.defineProperty(r,"column",{value:t})}}return r};e.prototype.createError=function(e,t,r,n){var i="Line "+t+": "+n;var s=this.constructError(i,r);s.index=e;s.lineNumber=t;s.description=n;return s};e.prototype.throwError=function(e,t,r,n){throw this.createError(e,t,r,n)};e.prototype.tolerateError=function(e,t,r,n){var i=this.createError(e,t,r,n);if(this.tolerant){this.recordError(i)}else{throw i}};return e}();t.ErrorHandler=r},function(e,t){Object.defineProperty(t,"__esModule",{value:true});t.Messages={BadGetterArity:"Getter must not have any formal parameters",BadSetterArity:"Setter must have exactly one formal parameter",BadSetterRestParameter:"Setter function argument must not be a rest parameter",ConstructorIsAsync:"Class constructor may not be an async method",ConstructorSpecialMethod:"Class constructor may not be an accessor",DeclarationMissingInitializer:"Missing initializer in %0 declaration",DefaultRestParameter:"Unexpected token =",DuplicateBinding:"Duplicate binding %0",DuplicateConstructor:"A class may only have one constructor",DuplicateProtoProperty:"Duplicate __proto__ fields are not allowed in object literals",ForInOfLoopInitializer:"%0 loop variable declaration may not have an initializer",GeneratorInLegacyContext:"Generator declarations are not allowed in legacy contexts",IllegalBreak:"Illegal break statement",IllegalContinue:"Illegal continue statement",IllegalExportDeclaration:"Unexpected token",IllegalImportDeclaration:"Unexpected token",IllegalLanguageModeDirective:"Illegal 'use strict' directive in function with non-simple parameter list",IllegalReturn:"Illegal return statement",InvalidEscapedReservedWord:"Keyword must not contain escaped characters",InvalidHexEscapeSequence:"Invalid hexadecimal escape sequence",InvalidLHSInAssignment:"Invalid left-hand side in assignment",InvalidLHSInForIn:"Invalid left-hand side in for-in",InvalidLHSInForLoop:"Invalid left-hand side in for-loop",InvalidModuleSpecifier:"Unexpected token",InvalidRegExp:"Invalid regular expression",LetInLexicalBinding:"let is disallowed as a lexically bound name",MissingFromClause:"Unexpected token",MultipleDefaultsInSwitch:"More than one default clause in switch statement",NewlineAfterThrow:"Illegal newline after throw",NoAsAfterImportNamespace:"Unexpected token",NoCatchOrFinally:"Missing catch or finally after try",ParameterAfterRestParameter:"Rest parameter must be last formal parameter",Redeclaration:"%0 '%1' has already been declared",StaticPrototype:"Classes may not have static property named prototype",StrictCatchVariable:"Catch variable may not be eval or arguments in strict mode",StrictDelete:"Delete of an unqualified identifier in strict mode.",StrictFunction:"In strict mode code, functions can only be declared at top level or inside a block",StrictFunctionName:"Function name may not be eval or arguments in strict mode",StrictLHSAssignment:"Assignment to eval or arguments is not allowed in strict mode",StrictLHSPostfix:"Postfix increment/decrement may not have eval or arguments operand in strict mode",StrictLHSPrefix:"Prefix increment/decrement may not have eval or arguments operand in strict mode",StrictModeWith:"Strict mode code may not include a with statement",StrictOctalLiteral:"Octal literals are not allowed in strict mode.",StrictParamDupe:"Strict mode function may not have duplicate parameter names",StrictParamName:"Parameter name eval or arguments is not allowed in strict mode",StrictReservedWord:"Use of future reserved word in strict mode",StrictVarName:"Variable name may not be eval or arguments in strict mode",TemplateOctalLiteral:"Octal literals are not allowed in template strings.",UnexpectedEOS:"Unexpected end of input",UnexpectedIdentifier:"Unexpected identifier",UnexpectedNumber:"Unexpected number",UnexpectedReserved:"Unexpected reserved word",UnexpectedString:"Unexpected string",UnexpectedTemplate:"Unexpected quasi %0",UnexpectedToken:"Unexpected token %0",UnexpectedTokenIllegal:"Unexpected token ILLEGAL",UnknownLabel:"Undefined label '%0'",UnterminatedRegExp:"Invalid regular expression: missing /"}},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(9);var i=r(4);var s=r(11);function a(e){return"0123456789abcdef".indexOf(e.toLowerCase())}function o(e){return"01234567".indexOf(e)}var l=function(){function e(e,t){this.source=e;this.errorHandler=t;this.trackComment=false;this.isModule=false;this.length=e.length;this.index=0;this.lineNumber=e.length>0?1:0;this.lineStart=0;this.curlyStack=[]}e.prototype.saveState=function(){return{index:this.index,lineNumber:this.lineNumber,lineStart:this.lineStart}};e.prototype.restoreState=function(e){this.index=e.index;this.lineNumber=e.lineNumber;this.lineStart=e.lineStart};e.prototype.eof=function(){return this.index>=this.length};e.prototype.throwUnexpectedToken=function(e){if(e===void 0){e=s.Messages.UnexpectedTokenIllegal}return this.errorHandler.throwError(this.index,this.lineNumber,this.index-this.lineStart+1,e)};e.prototype.tolerateUnexpectedToken=function(e){if(e===void 0){e=s.Messages.UnexpectedTokenIllegal}this.errorHandler.tolerateError(this.index,this.lineNumber,this.index-this.lineStart+1,e)};e.prototype.skipSingleLineComment=function(e){var t=[];var r,n;if(this.trackComment){t=[];r=this.index-e;n={start:{line:this.lineNumber,column:this.index-this.lineStart-e},end:{}}}while(!this.eof()){var s=this.source.charCodeAt(this.index);++this.index;if(i.Character.isLineTerminator(s)){if(this.trackComment){n.end={line:this.lineNumber,column:this.index-this.lineStart-1};var a={multiLine:false,slice:[r+e,this.index-1],range:[r,this.index-1],loc:n};t.push(a)}if(s===13&&this.source.charCodeAt(this.index)===10){++this.index}++this.lineNumber;this.lineStart=this.index;return t}}if(this.trackComment){n.end={line:this.lineNumber,column:this.index-this.lineStart};var a={multiLine:false,slice:[r+e,this.index],range:[r,this.index],loc:n};t.push(a)}return t};e.prototype.skipMultiLineComment=function(){var e=[];var t,r;if(this.trackComment){e=[];t=this.index-2;r={start:{line:this.lineNumber,column:this.index-this.lineStart-2},end:{}}}while(!this.eof()){var n=this.source.charCodeAt(this.index);if(i.Character.isLineTerminator(n)){if(n===13&&this.source.charCodeAt(this.index+1)===10){++this.index}++this.lineNumber;++this.index;this.lineStart=this.index}else if(n===42){if(this.source.charCodeAt(this.index+1)===47){this.index+=2;if(this.trackComment){r.end={line:this.lineNumber,column:this.index-this.lineStart};var s={multiLine:true,slice:[t+2,this.index-2],range:[t,this.index],loc:r};e.push(s)}return e}++this.index}else{++this.index}}if(this.trackComment){r.end={line:this.lineNumber,column:this.index-this.lineStart};var s={multiLine:true,slice:[t+2,this.index],range:[t,this.index],loc:r};e.push(s)}this.tolerateUnexpectedToken();return e};e.prototype.scanComments=function(){var e;if(this.trackComment){e=[]}var t=this.index===0;while(!this.eof()){var r=this.source.charCodeAt(this.index);if(i.Character.isWhiteSpace(r)){++this.index}else if(i.Character.isLineTerminator(r)){++this.index;if(r===13&&this.source.charCodeAt(this.index)===10){++this.index}++this.lineNumber;this.lineStart=this.index;t=true}else if(r===47){r=this.source.charCodeAt(this.index+1);if(r===47){this.index+=2;var n=this.skipSingleLineComment(2);if(this.trackComment){e=e.concat(n)}t=true}else if(r===42){this.index+=2;var n=this.skipMultiLineComment();if(this.trackComment){e=e.concat(n)}}else{break}}else if(t&&r===45){if(this.source.charCodeAt(this.index+1)===45&&this.source.charCodeAt(this.index+2)===62){this.index+=3;var n=this.skipSingleLineComment(3);if(this.trackComment){e=e.concat(n)}}else{break}}else if(r===60&&!this.isModule){if(this.source.slice(this.index+1,this.index+4)==="!--"){this.index+=4;var n=this.skipSingleLineComment(4);if(this.trackComment){e=e.concat(n)}}else{break}}else{break}}return e};e.prototype.isFutureReservedWord=function(e){switch(e){case"enum":case"export":case"import":case"super":return true;default:return false}};e.prototype.isStrictModeReservedWord=function(e){switch(e){case"implements":case"interface":case"package":case"private":case"protected":case"public":case"static":case"yield":case"let":return true;default:return false}};e.prototype.isRestrictedWord=function(e){return e==="eval"||e==="arguments"};e.prototype.isKeyword=function(e){switch(e.length){case 2:return e==="if"||e==="in"||e==="do";case 3:return e==="var"||e==="for"||e==="new"||e==="try"||e==="let";case 4:return e==="this"||e==="else"||e==="case"||e==="void"||e==="with"||e==="enum";case 5:return e==="while"||e==="break"||e==="catch"||e==="throw"||e==="const"||e==="yield"||e==="class"||e==="super";case 6:return e==="return"||e==="typeof"||e==="delete"||e==="switch"||e==="export"||e==="import";case 7:return e==="default"||e==="finally"||e==="extends";case 8:return e==="function"||e==="continue"||e==="debugger";case 10:return e==="instanceof";default:return false}};e.prototype.codePointAt=function(e){var t=this.source.charCodeAt(e);if(t>=55296&&t<=56319){var r=this.source.charCodeAt(e+1);if(r>=56320&&r<=57343){var n=t;t=(n-55296)*1024+r-56320+65536}}return t};e.prototype.scanHexEscape=function(e){var t=e==="u"?4:2;var r=0;for(var n=0;n<t;++n){if(!this.eof()&&i.Character.isHexDigit(this.source.charCodeAt(this.index))){r=r*16+a(this.source[this.index++])}else{return null}}return String.fromCharCode(r)};e.prototype.scanUnicodeCodePointEscape=function(){var e=this.source[this.index];var t=0;if(e==="}"){this.throwUnexpectedToken()}while(!this.eof()){e=this.source[this.index++];if(!i.Character.isHexDigit(e.charCodeAt(0))){break}t=t*16+a(e)}if(t>1114111||e!=="}"){this.throwUnexpectedToken()}return i.Character.fromCodePoint(t)};e.prototype.getIdentifier=function(){var e=this.index++;while(!this.eof()){var t=this.source.charCodeAt(this.index);if(t===92){this.index=e;return this.getComplexIdentifier()}else if(t>=55296&&t<57343){this.index=e;return this.getComplexIdentifier()}if(i.Character.isIdentifierPart(t)){++this.index}else{break}}return this.source.slice(e,this.index)};e.prototype.getComplexIdentifier=function(){var e=this.codePointAt(this.index);var t=i.Character.fromCodePoint(e);this.index+=t.length;var r;if(e===92){if(this.source.charCodeAt(this.index)!==117){this.throwUnexpectedToken()}++this.index;if(this.source[this.index]==="{"){++this.index;r=this.scanUnicodeCodePointEscape()}else{r=this.scanHexEscape("u");if(r===null||r==="\\"||!i.Character.isIdentifierStart(r.charCodeAt(0))){this.throwUnexpectedToken()}}t=r}while(!this.eof()){e=this.codePointAt(this.index);if(!i.Character.isIdentifierPart(e)){break}r=i.Character.fromCodePoint(e);t+=r;this.index+=r.length;if(e===92){t=t.substr(0,t.length-1);if(this.source.charCodeAt(this.index)!==117){this.throwUnexpectedToken()}++this.index;if(this.source[this.index]==="{"){++this.index;r=this.scanUnicodeCodePointEscape()}else{r=this.scanHexEscape("u");if(r===null||r==="\\"||!i.Character.isIdentifierPart(r.charCodeAt(0))){this.throwUnexpectedToken()}}t+=r}}return t};e.prototype.octalToDecimal=function(e){var t=e!=="0";var r=o(e);if(!this.eof()&&i.Character.isOctalDigit(this.source.charCodeAt(this.index))){t=true;r=r*8+o(this.source[this.index++]);if("0123".indexOf(e)>=0&&!this.eof()&&i.Character.isOctalDigit(this.source.charCodeAt(this.index))){r=r*8+o(this.source[this.index++])}}return{code:r,octal:t}};e.prototype.scanIdentifier=function(){var e;var t=this.index;var r=this.source.charCodeAt(t)===92?this.getComplexIdentifier():this.getIdentifier();if(r.length===1){e=3}else if(this.isKeyword(r)){e=4}else if(r==="null"){e=5}else if(r==="true"||r==="false"){e=1}else{e=3}if(e!==3&&t+r.length!==this.index){var n=this.index;this.index=t;this.tolerateUnexpectedToken(s.Messages.InvalidEscapedReservedWord);this.index=n}return{type:e,value:r,lineNumber:this.lineNumber,lineStart:this.lineStart,start:t,end:this.index}};e.prototype.scanPunctuator=function(){var e=this.index;var t=this.source[this.index];switch(t){case"(":case"{":if(t==="{"){this.curlyStack.push("{")}++this.index;break;case".":++this.index;if(this.source[this.index]==="."&&this.source[this.index+1]==="."){this.index+=2;t="..."}break;case"}":++this.index;this.curlyStack.pop();break;case")":case";":case",":case"[":case"]":case":":case"?":case"~":++this.index;break;default:t=this.source.substr(this.index,4);if(t===">>>="){this.index+=4}else{t=t.substr(0,3);if(t==="==="||t==="!=="||t===">>>"||t==="<<="||t===">>="||t==="**="){this.index+=3}else{t=t.substr(0,2);if(t==="&&"||t==="||"||t==="=="||t==="!="||t==="+="||t==="-="||t==="*="||t==="/="||t==="++"||t==="--"||t==="<<"||t===">>"||t==="&="||t==="|="||t==="^="||t==="%="||t==="<="||t===">="||t==="=>"||t==="**"){this.index+=2}else{t=this.source[this.index];if("<>=!+-*%&|^/".indexOf(t)>=0){++this.index}}}}}if(this.index===e){this.throwUnexpectedToken()}return{type:7,value:t,lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.scanHexLiteral=function(e){var t="";while(!this.eof()){if(!i.Character.isHexDigit(this.source.charCodeAt(this.index))){break}t+=this.source[this.index++]}if(t.length===0){this.throwUnexpectedToken()}if(i.Character.isIdentifierStart(this.source.charCodeAt(this.index))){this.throwUnexpectedToken()}return{type:6,value:parseInt("0x"+t,16),lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.scanBinaryLiteral=function(e){var t="";var r;while(!this.eof()){r=this.source[this.index];if(r!=="0"&&r!=="1"){break}t+=this.source[this.index++]}if(t.length===0){this.throwUnexpectedToken()}if(!this.eof()){r=this.source.charCodeAt(this.index);if(i.Character.isIdentifierStart(r)||i.Character.isDecimalDigit(r)){this.throwUnexpectedToken()}}return{type:6,value:parseInt(t,2),lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.scanOctalLiteral=function(e,t){var r="";var n=false;if(i.Character.isOctalDigit(e.charCodeAt(0))){n=true;r="0"+this.source[this.index++]}else{++this.index}while(!this.eof()){if(!i.Character.isOctalDigit(this.source.charCodeAt(this.index))){break}r+=this.source[this.index++]}if(!n&&r.length===0){this.throwUnexpectedToken()}if(i.Character.isIdentifierStart(this.source.charCodeAt(this.index))||i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){this.throwUnexpectedToken()}return{type:6,value:parseInt(r,8),octal:n,lineNumber:this.lineNumber,lineStart:this.lineStart,start:t,end:this.index}};e.prototype.isImplicitOctalLiteral=function(){for(var e=this.index+1;e<this.length;++e){var t=this.source[e];if(t==="8"||t==="9"){return false}if(!i.Character.isOctalDigit(t.charCodeAt(0))){return true}}return true};e.prototype.scanNumericLiteral=function(){var e=this.index;var t=this.source[e];n.assert(i.Character.isDecimalDigit(t.charCodeAt(0))||t===".","Numeric literal must start with a decimal digit or a decimal point");var r="";if(t!=="."){r=this.source[this.index++];t=this.source[this.index];if(r==="0"){if(t==="x"||t==="X"){++this.index;return this.scanHexLiteral(e)}if(t==="b"||t==="B"){++this.index;return this.scanBinaryLiteral(e)}if(t==="o"||t==="O"){return this.scanOctalLiteral(t,e)}if(t&&i.Character.isOctalDigit(t.charCodeAt(0))){if(this.isImplicitOctalLiteral()){return this.scanOctalLiteral(t,e)}}}while(i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){r+=this.source[this.index++]}t=this.source[this.index]}if(t==="."){r+=this.source[this.index++];while(i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){r+=this.source[this.index++]}t=this.source[this.index]}if(t==="e"||t==="E"){r+=this.source[this.index++];t=this.source[this.index];if(t==="+"||t==="-"){r+=this.source[this.index++]}if(i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){while(i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){r+=this.source[this.index++]}}else{this.throwUnexpectedToken()}}if(i.Character.isIdentifierStart(this.source.charCodeAt(this.index))){this.throwUnexpectedToken()}return{type:6,value:parseFloat(r),lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.scanStringLiteral=function(){var e=this.index;var t=this.source[e];n.assert(t==="'"||t==='"',"String literal must starts with a quote");++this.index;var r=false;var a="";while(!this.eof()){var o=this.source[this.index++];if(o===t){t="";break}else if(o==="\\"){o=this.source[this.index++];if(!o||!i.Character.isLineTerminator(o.charCodeAt(0))){switch(o){case"u":if(this.source[this.index]==="{"){++this.index;a+=this.scanUnicodeCodePointEscape()}else{var l=this.scanHexEscape(o);if(l===null){this.throwUnexpectedToken()}a+=l}break;case"x":var u=this.scanHexEscape(o);if(u===null){this.throwUnexpectedToken(s.Messages.InvalidHexEscapeSequence)}a+=u;break;case"n":a+="\n";break;case"r":a+="\r";break;case"t":a+="\t";break;case"b":a+="\b";break;case"f":a+="\f";break;case"v":a+="\v";break;case"8":case"9":a+=o;this.tolerateUnexpectedToken();break;default:if(o&&i.Character.isOctalDigit(o.charCodeAt(0))){var c=this.octalToDecimal(o);r=c.octal||r;a+=String.fromCharCode(c.code)}else{a+=o}break}}else{++this.lineNumber;if(o==="\r"&&this.source[this.index]==="\n"){++this.index}this.lineStart=this.index}}else if(i.Character.isLineTerminator(o.charCodeAt(0))){break}else{a+=o}}if(t!==""){this.index=e;this.throwUnexpectedToken()}return{type:8,value:a,octal:r,lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.scanTemplate=function(){var e="";var t=false;var r=this.index;var n=this.source[r]==="`";var a=false;var o=2;++this.index;while(!this.eof()){var l=this.source[this.index++];if(l==="`"){o=1;a=true;t=true;break}else if(l==="$"){if(this.source[this.index]==="{"){this.curlyStack.push("${");++this.index;t=true;break}e+=l}else if(l==="\\"){l=this.source[this.index++];if(!i.Character.isLineTerminator(l.charCodeAt(0))){switch(l){case"n":e+="\n";break;case"r":e+="\r";break;case"t":e+="\t";break;case"u":if(this.source[this.index]==="{"){++this.index;e+=this.scanUnicodeCodePointEscape()}else{var u=this.index;var c=this.scanHexEscape(l);if(c!==null){e+=c}else{this.index=u;e+=l}}break;case"x":var f=this.scanHexEscape(l);if(f===null){this.throwUnexpectedToken(s.Messages.InvalidHexEscapeSequence)}e+=f;break;case"b":e+="\b";break;case"f":e+="\f";break;case"v":e+="\v";break;default:if(l==="0"){if(i.Character.isDecimalDigit(this.source.charCodeAt(this.index))){this.throwUnexpectedToken(s.Messages.TemplateOctalLiteral)}e+="\0"}else if(i.Character.isOctalDigit(l.charCodeAt(0))){this.throwUnexpectedToken(s.Messages.TemplateOctalLiteral)}else{e+=l}break}}else{++this.lineNumber;if(l==="\r"&&this.source[this.index]==="\n"){++this.index}this.lineStart=this.index}}else if(i.Character.isLineTerminator(l.charCodeAt(0))){++this.lineNumber;if(l==="\r"&&this.source[this.index]==="\n"){++this.index}this.lineStart=this.index;e+="\n"}else{e+=l}}if(!t){this.throwUnexpectedToken()}if(!n){this.curlyStack.pop()}return{type:10,value:this.source.slice(r+1,this.index-o),cooked:e,head:n,tail:a,lineNumber:this.lineNumber,lineStart:this.lineStart,start:r,end:this.index}};e.prototype.testRegExp=function(e,t){var r="￿";var n=e;var i=this;if(t.indexOf("u")>=0){n=n.replace(/\\u\{([0-9a-fA-F]+)\}|\\u([a-fA-F0-9]{4})/g,function(e,t,n){var a=parseInt(t||n,16);if(a>1114111){i.throwUnexpectedToken(s.Messages.InvalidRegExp)}if(a<=65535){return String.fromCharCode(a)}return r}).replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g,r)}try{RegExp(n)}catch(e){this.throwUnexpectedToken(s.Messages.InvalidRegExp)}try{return new RegExp(e,t)}catch(e){return null}};e.prototype.scanRegExpBody=function(){var e=this.source[this.index];n.assert(e==="/","Regular expression literal must start with a slash");var t=this.source[this.index++];var r=false;var a=false;while(!this.eof()){e=this.source[this.index++];t+=e;if(e==="\\"){e=this.source[this.index++];if(i.Character.isLineTerminator(e.charCodeAt(0))){this.throwUnexpectedToken(s.Messages.UnterminatedRegExp)}t+=e}else if(i.Character.isLineTerminator(e.charCodeAt(0))){this.throwUnexpectedToken(s.Messages.UnterminatedRegExp)}else if(r){if(e==="]"){r=false}}else{if(e==="/"){a=true;break}else if(e==="["){r=true}}}if(!a){this.throwUnexpectedToken(s.Messages.UnterminatedRegExp)}return t.substr(1,t.length-2)};e.prototype.scanRegExpFlags=function(){var e="";var t="";while(!this.eof()){var r=this.source[this.index];if(!i.Character.isIdentifierPart(r.charCodeAt(0))){break}++this.index;if(r==="\\"&&!this.eof()){r=this.source[this.index];if(r==="u"){++this.index;var n=this.index;var s=this.scanHexEscape("u");if(s!==null){t+=s;for(e+="\\u";n<this.index;++n){e+=this.source[n]}}else{this.index=n;t+="u";e+="\\u"}this.tolerateUnexpectedToken()}else{e+="\\";this.tolerateUnexpectedToken()}}else{t+=r;e+=r}}return t};e.prototype.scanRegExp=function(){var e=this.index;var t=this.scanRegExpBody();var r=this.scanRegExpFlags();var n=this.testRegExp(t,r);return{type:9,value:"",pattern:t,flags:r,regex:n,lineNumber:this.lineNumber,lineStart:this.lineStart,start:e,end:this.index}};e.prototype.lex=function(){if(this.eof()){return{type:2,value:"",lineNumber:this.lineNumber,lineStart:this.lineStart,start:this.index,end:this.index}}var e=this.source.charCodeAt(this.index);if(i.Character.isIdentifierStart(e)){return this.scanIdentifier()}if(e===40||e===41||e===59){return this.scanPunctuator()}if(e===39||e===34){return this.scanStringLiteral()}if(e===46){if(i.Character.isDecimalDigit(this.source.charCodeAt(this.index+1))){return this.scanNumericLiteral()}return this.scanPunctuator()}if(i.Character.isDecimalDigit(e)){return this.scanNumericLiteral()}if(e===96||e===125&&this.curlyStack[this.curlyStack.length-1]==="${"){return this.scanTemplate()}if(e>=55296&&e<57343){if(i.Character.isIdentifierStart(this.codePointAt(this.index))){return this.scanIdentifier()}}return this.scanPunctuator()};return e}();t.Scanner=l},function(e,t){Object.defineProperty(t,"__esModule",{value:true});t.TokenName={};t.TokenName[1]="Boolean";t.TokenName[2]="<end>";t.TokenName[3]="Identifier";t.TokenName[4]="Keyword";t.TokenName[5]="Null";t.TokenName[6]="Numeric";t.TokenName[7]="Punctuator";t.TokenName[8]="String";t.TokenName[9]="RegularExpression";t.TokenName[10]="Template"},function(e,t){Object.defineProperty(t,"__esModule",{value:true});t.XHTMLEntities={quot:'"',amp:"&",apos:"'",gt:">",nbsp:" ",iexcl:"¡",cent:"¢",pound:"£",curren:"¤",yen:"¥",brvbar:"¦",sect:"§",uml:"¨",copy:"©",ordf:"ª",laquo:"«",not:"¬",shy:"­",reg:"®",macr:"¯",deg:"°",plusmn:"±",sup2:"²",sup3:"³",acute:"´",micro:"µ",para:"¶",middot:"·",cedil:"¸",sup1:"¹",ordm:"º",raquo:"»",frac14:"¼",frac12:"½",frac34:"¾",iquest:"¿",Agrave:"À",Aacute:"Á",Acirc:"Â",Atilde:"Ã",Auml:"Ä",Aring:"Å",AElig:"Æ",Ccedil:"Ç",Egrave:"È",Eacute:"É",Ecirc:"Ê",Euml:"Ë",Igrave:"Ì",Iacute:"Í",Icirc:"Î",Iuml:"Ï",ETH:"Ð",Ntilde:"Ñ",Ograve:"Ò",Oacute:"Ó",Ocirc:"Ô",Otilde:"Õ",Ouml:"Ö",times:"×",Oslash:"Ø",Ugrave:"Ù",Uacute:"Ú",Ucirc:"Û",Uuml:"Ü",Yacute:"Ý",THORN:"Þ",szlig:"ß",agrave:"à",aacute:"á",acirc:"â",atilde:"ã",auml:"ä",aring:"å",aelig:"æ",ccedil:"ç",egrave:"è",eacute:"é",ecirc:"ê",euml:"ë",igrave:"ì",iacute:"í",icirc:"î",iuml:"ï",eth:"ð",ntilde:"ñ",ograve:"ò",oacute:"ó",ocirc:"ô",otilde:"õ",ouml:"ö",divide:"÷",oslash:"ø",ugrave:"ù",uacute:"ú",ucirc:"û",uuml:"ü",yacute:"ý",thorn:"þ",yuml:"ÿ",OElig:"Œ",oelig:"œ",Scaron:"Š",scaron:"š",Yuml:"Ÿ",fnof:"ƒ",circ:"ˆ",tilde:"˜",Alpha:"Α",Beta:"Β",Gamma:"Γ",Delta:"Δ",Epsilon:"Ε",Zeta:"Ζ",Eta:"Η",Theta:"Θ",Iota:"Ι",Kappa:"Κ",Lambda:"Λ",Mu:"Μ",Nu:"Ν",Xi:"Ξ",Omicron:"Ο",Pi:"Π",Rho:"Ρ",Sigma:"Σ",Tau:"Τ",Upsilon:"Υ",Phi:"Φ",Chi:"Χ",Psi:"Ψ",Omega:"Ω",alpha:"α",beta:"β",gamma:"γ",delta:"δ",epsilon:"ε",zeta:"ζ",eta:"η",theta:"θ",iota:"ι",kappa:"κ",lambda:"λ",mu:"μ",nu:"ν",xi:"ξ",omicron:"ο",pi:"π",rho:"ρ",sigmaf:"ς",sigma:"σ",tau:"τ",upsilon:"υ",phi:"φ",chi:"χ",psi:"ψ",omega:"ω",thetasym:"ϑ",upsih:"ϒ",piv:"ϖ",ensp:" ",emsp:" ",thinsp:" ",zwnj:"‌",zwj:"‍",lrm:"‎",rlm:"‏",ndash:"–",mdash:"—",lsquo:"‘",rsquo:"’",sbquo:"‚",ldquo:"“",rdquo:"”",bdquo:"„",dagger:"†",Dagger:"‡",bull:"•",hellip:"…",permil:"‰",prime:"′",Prime:"″",lsaquo:"‹",rsaquo:"›",oline:"‾",frasl:"⁄",euro:"€",image:"ℑ",weierp:"℘",real:"ℜ",trade:"™",alefsym:"ℵ",larr:"←",uarr:"↑",rarr:"→",darr:"↓",harr:"↔",crarr:"↵",lArr:"⇐",uArr:"⇑",rArr:"⇒",dArr:"⇓",hArr:"⇔",forall:"∀",part:"∂",exist:"∃",empty:"∅",nabla:"∇",isin:"∈",notin:"∉",ni:"∋",prod:"∏",sum:"∑",minus:"−",lowast:"∗",radic:"√",prop:"∝",infin:"∞",ang:"∠",and:"∧",or:"∨",cap:"∩",cup:"∪",int:"∫",there4:"∴",sim:"∼",cong:"≅",asymp:"≈",ne:"≠",equiv:"≡",le:"≤",ge:"≥",sub:"⊂",sup:"⊃",nsub:"⊄",sube:"⊆",supe:"⊇",oplus:"⊕",otimes:"⊗",perp:"⊥",sdot:"⋅",lceil:"⌈",rceil:"⌉",lfloor:"⌊",rfloor:"⌋",loz:"◊",spades:"♠",clubs:"♣",hearts:"♥",diams:"♦",lang:"⟨",rang:"⟩"}},function(e,t,r){Object.defineProperty(t,"__esModule",{value:true});var n=r(10);var i=r(12);var s=r(13);var a=function(){function e(){this.values=[];this.curly=this.paren=-1}e.prototype.beforeFunctionExpression=function(e){return["(","{","[","in","typeof","instanceof","new","return","case","delete","throw","void","=","+=","-=","*=","**=","/=","%=","<<=",">>=",">>>=","&=","|=","^=",",","+","-","*","**","/","%","++","--","<<",">>",">>>","&","|","^","!","~","&&","||","?",":","===","==",">=","<=","<",">","!=","!=="].indexOf(e)>=0};e.prototype.isRegexStart=function(){var e=this.values[this.values.length-1];var t=e!==null;switch(e){case"this":case"]":t=false;break;case")":var r=this.values[this.paren-1];t=r==="if"||r==="while"||r==="for"||r==="with";break;case"}":t=false;if(this.values[this.curly-3]==="function"){var n=this.values[this.curly-4];t=n?!this.beforeFunctionExpression(n):false}else if(this.values[this.curly-4]==="function"){var n=this.values[this.curly-5];t=n?!this.beforeFunctionExpression(n):true}break;default:break}return t};e.prototype.push=function(e){if(e.type===7||e.type===4){if(e.value==="{"){this.curly=this.values.length}else if(e.value==="("){this.paren=this.values.length}this.values.push(e.value)}else{this.values.push(null)}};return e}();var o=function(){function e(e,t){this.errorHandler=new n.ErrorHandler;this.errorHandler.tolerant=t?typeof t.tolerant==="boolean"&&t.tolerant:false;this.scanner=new i.Scanner(e,this.errorHandler);this.scanner.trackComment=t?typeof t.comment==="boolean"&&t.comment:false;this.trackRange=t?typeof t.range==="boolean"&&t.range:false;this.trackLoc=t?typeof t.loc==="boolean"&&t.loc:false;this.buffer=[];this.reader=new a}e.prototype.errors=function(){return this.errorHandler.errors};e.prototype.getNextToken=function(){if(this.buffer.length===0){var e=this.scanner.scanComments();if(this.scanner.trackComment){for(var t=0;t<e.length;++t){var r=e[t];var n=this.scanner.source.slice(r.slice[0],r.slice[1]);var i={type:r.multiLine?"BlockComment":"LineComment",value:n};if(this.trackRange){i.range=r.range}if(this.trackLoc){i.loc=r.loc}this.buffer.push(i)}}if(!this.scanner.eof()){var a=void 0;if(this.trackLoc){a={start:{line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart},end:{}}}var o=this.scanner.source[this.scanner.index]==="/"&&this.reader.isRegexStart();var l=o?this.scanner.scanRegExp():this.scanner.lex();this.reader.push(l);var u={type:s.TokenName[l.type],value:this.scanner.source.slice(l.start,l.end)};if(this.trackRange){u.range=[l.start,l.end]}if(this.trackLoc){a.end={line:this.scanner.lineNumber,column:this.scanner.index-this.scanner.lineStart};u.loc=a}if(l.type===9){var c=l.pattern;var f=l.flags;u.regex={pattern:c,flags:f}}this.buffer.push(u)}}return this.buffer.shift()};return e}();t.Tokenizer=o}])})});o(Kn);var $n=l(function(e,t){Object.defineProperty(t,"__esModule",{value:true});function r(e,t){var r=[];var n=Kn.parse(e,{loc:true,locations:true,comment:true,onComment:r,range:Rn.getOption(t,"range",false),tolerant:Rn.getOption(t,"tolerant",true),tokens:true});if(!Array.isArray(n.comments)){n.comments=r}return n}t.parse=r});o($n);var Yn=$n.parse;var Qn;function Zn(){if(typeof Qn==="undefined"){var e=new ArrayBuffer(2);var t=new Uint8Array(e);var r=new Uint16Array(e);t[0]=1;t[1]=2;if(r[0]===258){Qn="BE"}else if(r[0]===513){Qn="LE"}else{throw new Error("unable to figure out endianess")}}return Qn}function ei(){if(typeof Lt.location!=="undefined"){return Lt.location.hostname}else return""}function ti(){return[]}function ri(){return 0}function ni(){return Number.MAX_VALUE}function ii(){return Number.MAX_VALUE}function si(){return[]}function ai(){return"Browser"}function oi(){if(typeof Lt.navigator!=="undefined"){return Lt.navigator.appVersion}return""}function li(){}function ui(){}function ci(){return"/tmp"}var fi=ci;var hi="\n";var pi={EOL:hi,tmpdir:fi,tmpDir:ci,networkInterfaces:li,getNetworkInterfaces:ui,release:oi,type:ai,cpus:si,totalmem:ii,freemem:ni,uptime:ri,loadavg:ti,hostname:ei,endianness:Zn};var di=l(function(e,t){Object.defineProperty(t,"__esModule",{value:true});var r={parser:$n,tabWidth:4,useTabs:false,reuseWhitespace:true,lineTerminator:pi.EOL,wrapColumn:74,sourceFileName:null,sourceMapName:null,sourceRoot:null,inputSourceMap:null,range:false,tolerant:true,quote:null,trailingComma:false,arrayBracketSpacing:false,objectCurlySpacing:true,arrowParensAlways:false,flowObjectCommas:true,tokens:true},n=r.hasOwnProperty;function i(e){var t=e||r;function i(e){return n.call(t,e)?t[e]:r[e]}return{tabWidth:+i("tabWidth"),useTabs:!!i("useTabs"),reuseWhitespace:!!i("reuseWhitespace"),lineTerminator:i("lineTerminator"),wrapColumn:Math.max(i("wrapColumn"),0),sourceFileName:i("sourceFileName"),sourceMapName:i("sourceMapName"),sourceRoot:i("sourceRoot"),inputSourceMap:i("inputSourceMap"),parser:i("esprima")||i("parser"),range:i("range"),tolerant:i("tolerant"),quote:i("quote"),trailingComma:i("trailingComma"),arrayBracketSpacing:i("arrayBracketSpacing"),objectCurlySpacing:i("objectCurlySpacing"),arrowParensAlways:i("arrowParensAlways"),flowObjectCommas:i("flowObjectCommas"),tokens:!!i("tokens")}}t.normalize=i});o(di);var mi=di.normalize;var vi=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var n=r(Wt);var i=function(){function e(e,t,r){if(r===void 0){r=t}this.sourceLines=e;this.sourceLoc=t;this.targetLoc=r}e.prototype.slice=function(t,r,i){if(i===void 0){i=t.lastPos()}var s=this.sourceLines;var l=this.sourceLoc;var u=this.targetLoc;function c(e){var a=l[e];var c=u[e];var f=r;if(e==="end"){f=i}else{n.default.strictEqual(e,"start")}return o(s,a,t,c,f)}if(Rn.comparePos(r,u.start)<=0){if(Rn.comparePos(u.end,i)<=0){u={start:a(u.start,r.line,r.column),end:a(u.end,r.line,r.column)}}else if(Rn.comparePos(i,u.start)<=0){return null}else{l={start:l.start,end:c("end")};u={start:a(u.start,r.line,r.column),end:a(i,r.line,r.column)}}}else{if(Rn.comparePos(u.end,r)<=0){return null}if(Rn.comparePos(u.end,i)<=0){l={start:c("start"),end:l.end};u={start:{line:1,column:0},end:a(u.end,r.line,r.column)}}else{l={start:c("start"),end:c("end")};u={start:{line:1,column:0},end:a(i,r.line,r.column)}}}return new e(this.sourceLines,l,u)};e.prototype.add=function(t,r){return new e(this.sourceLines,this.sourceLoc,{start:s(this.targetLoc.start,t,r),end:s(this.targetLoc.end,t,r)})};e.prototype.subtract=function(t,r){return new e(this.sourceLines,this.sourceLoc,{start:a(this.targetLoc.start,t,r),end:a(this.targetLoc.end,t,r)})};e.prototype.indent=function(t,r,n){if(r===void 0){r=false}if(n===void 0){n=false}if(t===0){return this}var i=this.targetLoc;var s=i.start.line;var a=i.end.line;if(r&&s===1&&a===1){return this}i={start:i.start,end:i.end};if(!r||s>1){var o=i.start.column+t;i.start={line:s,column:n?Math.max(0,o):o}}if(!r||a>1){var l=i.end.column+t;i.end={line:a,column:n?Math.max(0,l):l}}return new e(this.sourceLines,this.sourceLoc,i)};return e}();t.default=i;function s(e,t,r){return{line:e.line+t-1,column:e.line===1?e.column+r:e.column}}function a(e,t,r){return{line:e.line-t+1,column:e.line===t?e.column-r:e.column}}function o(e,t,r,i,s){var a=Rn.comparePos(i,s);if(a===0){return t}if(a<0){var o=e.skipSpaces(t)||e.lastPos();var l=r.skipSpaces(i)||r.lastPos();var u=s.line-l.line;o.line+=u;l.line+=u;if(u>0){o.column=0;l.column=0}else{n.default.strictEqual(u,0)}while(Rn.comparePos(l,s)<0&&r.nextPos(l,true)){n.default.ok(e.nextPos(o,true));n.default.strictEqual(e.charAt(o),r.charAt(l))}}else{var o=e.skipSpaces(t,true)||e.firstPos();var l=r.skipSpaces(i,true)||r.firstPos();var u=s.line-l.line;o.line+=u;l.line+=u;if(u<0){o.column=e.getLineLength(o.line);l.column=r.getLineLength(l.line)}else{n.default.strictEqual(u,0)}while(Rn.comparePos(s,l)<0&&r.prevPos(l,true)){n.default.ok(e.prevPos(o,true));n.default.strictEqual(e.charAt(o),r.charAt(l))}}return o}});o(vi);var gi=l(function(e,t){var r=this&&this.__assign||function(){r=Object.assign||function(e){for(var t,r=1,n=arguments.length;r<n;r++){t=arguments[r];for(var i in t)if(Object.prototype.hasOwnProperty.call(t,i))e[i]=t[i]}return e};return r.apply(this,arguments)};var n=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:true});var i=n(Wt);var s=n(On);var a=n(vi);var o=function(){function e(e,t){if(t===void 0){t=null}this.infos=e;this.mappings=[];this.cachedSourceMap=null;this.cachedTabWidth=void 0;i.default.ok(e.length>0);this.length=e.length;this.name=t||null;if(this.name){this.mappings.push(new a.default(this,{start:this.firstPos(),end:this.lastPos()}))}}e.prototype.toString=function(e){return this.sliceString(this.firstPos(),this.lastPos(),e)};e.prototype.getSourceMap=function(e,t){if(!e){return null}var r=this;function n(r){r=r||{};r.file=e;if(t){r.sourceRoot=t}return r}if(r.cachedSourceMap){return n(r.cachedSourceMap.toJSON())}var a=new s.default.SourceMapGenerator(n());var o={};r.mappings.forEach(function(e){var t=e.sourceLines.skipSpaces(e.sourceLoc.start)||e.sourceLines.lastPos();var n=r.skipSpaces(e.targetLoc.start)||r.lastPos();while(Rn.comparePos(t,e.sourceLoc.end)<0&&Rn.comparePos(n,e.targetLoc.end)<0){var s=e.sourceLines.charAt(t);var l=r.charAt(n);i.default.strictEqual(s,l);var c=e.sourceLines.name;a.addMapping({source:c,original:{line:t.line,column:t.column},generated:{line:n.line,column:n.column}});if(!u.call(o,c)){var f=e.sourceLines.toString();a.setSourceContent(c,f);o[c]=f}r.nextPos(n,true);e.sourceLines.nextPos(t,true)}});r.cachedSourceMap=a;return a.toJSON()};e.prototype.bootstrapCharAt=function(e){i.default.strictEqual(typeof e,"object");i.default.strictEqual(typeof e.line,"number");i.default.strictEqual(typeof e.column,"number");var t=e.line,r=e.column,n=this.toString().split(p),s=n[t-1];if(typeof s==="undefined")return"";if(r===s.length&&t<n.length)return"\n";if(r>=s.length)return"";return s.charAt(r)};e.prototype.charAt=function(e){i.default.strictEqual(typeof e,"object");i.default.strictEqual(typeof e.line,"number");i.default.strictEqual(typeof e.column,"number");var t=e.line,r=e.column,n=this,s=n.infos,a=s[t-1],o=r;if(typeof a==="undefined"||o<0)return"";var l=this.getIndentAt(t);if(o<l)return" ";o+=a.sliceStart-l;if(o===a.sliceEnd&&t<this.length)return"\n";if(o>=a.sliceEnd)return"";return a.line.charAt(o)};e.prototype.stripMargin=function(t,n){if(t===0)return this;i.default.ok(t>0,"negative margin: "+t);if(n&&this.length===1)return this;var s=new e(this.infos.map(function(e,i){if(e.line&&(i>0||!n)){e=r({},e,{indent:Math.max(0,e.indent-t)})}return e}));if(this.mappings.length>0){var a=s.mappings;i.default.strictEqual(a.length,0);this.mappings.forEach(function(e){a.push(e.indent(t,n,true))})}return s};e.prototype.indent=function(t){if(t===0){return this}var n=new e(this.infos.map(function(e){if(e.line&&!e.locked){e=r({},e,{indent:e.indent+t})}return e}));if(this.mappings.length>0){var s=n.mappings;i.default.strictEqual(s.length,0);this.mappings.forEach(function(e){s.push(e.indent(t))})}return n};e.prototype.indentTail=function(t){if(t===0){return this}if(this.length<2){return this}var n=new e(this.infos.map(function(e,n){if(n>0&&e.line&&!e.locked){e=r({},e,{indent:e.indent+t})}return e}));if(this.mappings.length>0){var s=n.mappings;i.default.strictEqual(s.length,0);this.mappings.forEach(function(e){s.push(e.indent(t,true))})}return n};e.prototype.lockIndentTail=function(){if(this.length<2){return this}return new e(this.infos.map(function(e,t){return r({},e,{locked:t>0})}))};e.prototype.getIndentAt=function(e){i.default.ok(e>=1,"no line "+e+" (line numbers start from 1)");return Math.max(this.infos[e-1].indent,0)};e.prototype.guessTabWidth=function(){if(typeof this.cachedTabWidth==="number"){return this.cachedTabWidth}var e=[];var t=0;for(var r=1,n=this.length;r<=n;++r){var i=this.infos[r-1];var s=i.line.slice(i.sliceStart,i.sliceEnd);if(m(s)){continue}var a=Math.abs(i.indent-t);e[a]=~~e[a]+1;t=i.indent}var o=-1;var l=2;for(var c=1;c<e.length;c+=1){if(u.call(e,c)&&e[c]>o){o=e[c];l=c}}return this.cachedTabWidth=l};e.prototype.startsWithComment=function(){if(this.infos.length===0){return false}var e=this.infos[0],t=e.sliceStart,r=e.sliceEnd,n=e.line.slice(t,r).trim();return n.length===0||n.slice(0,2)==="//"||n.slice(0,2)==="/*"};e.prototype.isOnlyWhitespace=function(){return m(this.toString())};e.prototype.isPrecededOnlyByWhitespace=function(e){var t=this.infos[e.line-1];var r=Math.max(t.indent,0);var n=e.column-r;if(n<=0){return true}var i=t.sliceStart;var s=Math.min(i+n,t.sliceEnd);var a=t.line.slice(i,s);return m(a)};e.prototype.getLineLength=function(e){var t=this.infos[e-1];return this.getIndentAt(e)+t.sliceEnd-t.sliceStart};e.prototype.nextPos=function(e,t){if(t===void 0){t=false}var r=Math.max(e.line,0),n=Math.max(e.column,0);if(n<this.getLineLength(r)){e.column+=1;return t?!!this.skipSpaces(e,false,true):true}if(r<this.length){e.line+=1;e.column=0;return t?!!this.skipSpaces(e,false,true):true}return false};e.prototype.prevPos=function(e,t){if(t===void 0){t=false}var r=e.line,n=e.column;if(n<1){r-=1;if(r<1)return false;n=this.getLineLength(r)}else{n=Math.min(n-1,this.getLineLength(r))}e.line=r;e.column=n;return t?!!this.skipSpaces(e,true,true):true};e.prototype.firstPos=function(){return{line:1,column:0}};e.prototype.lastPos=function(){return{line:this.length,column:this.getLineLength(this.length)}};e.prototype.skipSpaces=function(e,t,r){if(t===void 0){t=false}if(r===void 0){r=false}if(e){e=r?e:{line:e.line,column:e.column}}else if(t){e=this.lastPos()}else{e=this.firstPos()}if(t){while(this.prevPos(e)){if(!m(this.charAt(e))&&this.nextPos(e)){return e}}return null}else{while(m(this.charAt(e))){if(!this.nextPos(e)){return null}}return e}};e.prototype.trimLeft=function(){var e=this.skipSpaces(this.firstPos(),false,true);return e?this.slice(e):y};e.prototype.trimRight=function(){var e=this.skipSpaces(this.lastPos(),true,true);return e?this.slice(this.firstPos(),e):y};e.prototype.trim=function(){var e=this.skipSpaces(this.firstPos(),false,true);if(e===null){return y}var t=this.skipSpaces(this.lastPos(),true,true);if(t===null){return y}return this.slice(e,t)};e.prototype.eachPos=function(e,t,r){if(t===void 0){t=this.firstPos()}if(r===void 0){r=false}var n=this.firstPos();if(t){n.line=t.line,n.column=t.column}if(r&&!this.skipSpaces(n,false,true)){return}do{e.call(this,n)}while(this.nextPos(n,r))};e.prototype.bootstrapSlice=function(e,t){var r=this.toString().split(p).slice(e.line-1,t.line);if(r.length>0){r.push(r.pop().slice(0,t.column));r[0]=r[0].slice(e.column)}return d(r.join("\n"))};e.prototype.slice=function(t,r){if(!r){if(!t){return this}r=this.lastPos()}if(!t){throw new Error("cannot slice with end but not start")}var n=this.infos.slice(t.line-1,r.line);if(t.line===r.line){n[0]=v(n[0],t.column,r.column)}else{i.default.ok(t.line<r.line);n[0]=v(n[0],t.column);n.push(v(n.pop(),0,r.column))}var s=new e(n);if(this.mappings.length>0){var a=s.mappings;i.default.strictEqual(a.length,0);this.mappings.forEach(function(e){var n=e.slice(this,t,r);if(n){a.push(n)}},this)}return s};e.prototype.bootstrapSliceString=function(e,t,r){return this.slice(e,t).toString(r)};e.prototype.sliceString=function(e,t,r){if(e===void 0){e=this.firstPos()}if(t===void 0){t=this.lastPos()}r=di.normalize(r);var n=[];var i=r.tabWidth,s=i===void 0?2:i;for(var a=e.line;a<=t.line;++a){var o=this.infos[a-1];if(a===e.line){if(a===t.line){o=v(o,e.column,t.column)}else{o=v(o,e.column)}}else if(a===t.line){o=v(o,0,t.column)}var l=Math.max(o.indent,0);var u=o.line.slice(0,o.sliceStart);if(r.reuseWhitespace&&m(u)&&f(u,r.tabWidth)===l){n.push(o.line.slice(0,o.sliceEnd));continue}var c=0;var h=l;if(r.useTabs){c=Math.floor(l/s);h-=c*s}var p="";if(c>0){p+=new Array(c+1).join("\t")}if(h>0){p+=new Array(h+1).join(" ")}p+=o.line.slice(o.sliceStart,o.sliceEnd);n.push(p)}return n.join(r.lineTerminator)};e.prototype.isEmpty=function(){return this.length<2&&this.getLineLength(1)<1};e.prototype.join=function(t){var n=this;var i=[];var s=[];var a;function o(e){if(e===null){return}if(a){var t=e.infos[0];var n=new Array(t.indent+1).join(" ");var o=i.length;var l=Math.max(a.indent,0)+a.sliceEnd-a.sliceStart;a.line=a.line.slice(0,a.sliceEnd)+n+t.line.slice(t.sliceStart,t.sliceEnd);a.locked=a.locked||t.locked;a.sliceEnd=a.line.length;if(e.mappings.length>0){e.mappings.forEach(function(e){s.push(e.add(o,l))})}}else if(e.mappings.length>0){s.push.apply(s,e.mappings)}e.infos.forEach(function(e,t){if(!a||t>0){a=r({},e);i.push(a)}})}function l(e,t){if(t>0)o(n);o(e)}t.map(function(e){var t=d(e);if(t.isEmpty())return null;return t}).forEach(function(e,t){if(n.isEmpty()){o(e)}else{l(e,t)}});if(i.length<1)return y;var u=new e(i);u.mappings=s;return u};e.prototype.concat=function(){var e=[];for(var t=0;t<arguments.length;t++){e[t]=arguments[t]}var r=[this];r.push.apply(r,e);i.default.strictEqual(r.length,e.length+1);return y.join(r)};return e}();t.Lines=o;var l={};var u=l.hasOwnProperty;var c=10;function f(e,t){var r=0;var n=e.length;for(var s=0;s<n;++s){switch(e.charCodeAt(s)){case 9:i.default.strictEqual(typeof t,"number");i.default.ok(t>0);var a=Math.ceil(r/t)*t;if(a===r){r+=t}else{r=a}break;case 11:case 12:case 13:case 65279:break;case 32:default:r+=1;break}}return r}t.countSpaces=f;var h=/^\s*/;var p=/\u000D\u000A|\u000D(?!\u000A)|\u000A|\u2028|\u2029/;function d(e,t){if(e instanceof o)return e;e+="";var r=t&&t.tabWidth;var n=e.indexOf("\t")<0;var s=!t&&n&&e.length<=c;i.default.ok(r||n,"No tab width specified but encountered tabs in string\n"+e);if(s&&u.call(l,e))return l[e];var a=new o(e.split(p).map(function(e){var t=h.exec(e)[0];return{line:e,indent:f(t,r),locked:false,sliceStart:t.length,sliceEnd:e.length}}),di.normalize(t).sourceFileName);if(s)l[e]=a;return a}t.fromString=d;function m(e){return!/\S/.test(e)}function v(e,t,r){var n=e.sliceStart;var s=e.sliceEnd;var a=Math.max(e.indent,0);var o=a+s-n;if(typeof r==="undefined"){r=o}t=Math.max(t,0);r=Math.min(r,o);r=Math.max(r,t);if(r<a){a=r;s=n}else{s-=o-r}o=r;o-=t;if(t<a){a-=t}else{t-=a;a=0;n+=t}i.default.ok(a>=0);i.default.ok(n<=s);i.default.strictEqual(o,a+s-n);if(e.indent===a&&e.sliceStart===n&&e.sliceEnd===s){return e}return{line:e.line,indent:a,locked:false,sliceStart:n,sliceEnd:s}}function g(e){return y.join(e)}t.concat=g;var y=d("")});o(gi);var yi=gi.Lines;var xi=gi.countSpaces;var Ei=gi.fromString;var bi=gi.concat;var Si=Object;var Di=Object.defineProperty;var Ci=Object.create;function wi(e,t,r){if(Di)try{Di.call(Si,e,t,{value:r})}catch(n){e[t]=r}else{e[t]=r}}function Ai(e){if(e){wi(e,"call",e.call);wi(e,"apply",e.apply)}return e}Ai(Di);Ai(Ci);var Ti=Ai(Object.prototype.hasOwnProperty);var ki=Ai(Number.prototype.toString);var _i=Ai(String.prototype.slice);var Pi=function e(){};function Fi(e){if(Ci){return Ci.call(Si,e)}Pi.prototype=e||null;return new Pi}var Ii=Math.random;var Mi=Fi(null);function Ni(){do{var e=Li(_i.call(ki.call(Ii(),36),2))}while(Ti.call(Mi,e));return Mi[e]=e}function Li(e){var t={};t[e]=true;return Object.keys(t)[0]}var Bi=Ni;var Oi=Object.getOwnPropertyNames;Object.getOwnPropertyNames=function e(t){for(var r=Oi(t),n=0,i=0,s=r.length;n<s;++n){if(!Ti.call(Mi,r[n])){if(n>i){r[i]=r[n]}++i}}r.length=i;return r};function Ri(e){return Fi(null)}function ji(e){var t=Ni();var r=Fi(null);e=e||Ri;function n(n){var i;function s(t,s){if(t===r){return s?i=null:i||(i=e(n))}}wi(n,t,s)}function i(e){if(!Ti.call(e,t))n(e);return e[t](r)}i.forget=function(e){if(Ti.call(e,t))e[t](r,true)};return i}var Ui=ji;var Vi={makeUniqueKey:Bi,makeAccessor:Ui};var Gi=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(I);var a=s.namedTypes;var o=s.builtInTypes.array;var l=s.builtInTypes.object;var u=Vi.makeUniqueKey();function c(e,t,r){if(!e){return}Rn.fixFaultyLocations(e,t);if(r){if(a.Node.check(e)&&a.SourceLocation.check(e.loc)){for(var n=r.length-1;n>=0;--n){if(Rn.comparePos(r[n].loc.end,e.loc.start)<=0){break}}r.splice(n+1,0,e);return}}else if(e[u]){return e[u]}var i;if(o.check(e)){i=Object.keys(e)}else if(l.check(e)){i=s.getFieldNames(e)}else{return}if(!r){Object.defineProperty(e,u,{value:r=[],enumerable:false})}for(var n=0,f=i.length;n<f;++n){c(e[i[n]],t,r)}return r}function f(e,t,r){var n=c(e,r);var i=0,s=n.length;while(i<s){var a=i+s>>1;var o=n[a];if(Rn.comparePos(o.loc.start,t.loc.start)<=0&&Rn.comparePos(t.loc.end,o.loc.end)<=0){f(t.enclosingNode=o,t,r);return}if(Rn.comparePos(o.loc.end,t.loc.start)<=0){var l=o;i=a+1;continue}if(Rn.comparePos(t.loc.end,o.loc.start)<=0){var u=o;s=a;continue}throw new Error("Comment location overlaps with node location")}if(l){t.precedingNode=l}if(u){t.followingNode=u}}function h(e,t,r){if(!o.check(e)){return}var n=[];e.forEach(function(e){e.loc.lines=r;f(t,e,r);var s=e.precedingNode;var a=e.enclosingNode;var o=e.followingNode;if(s&&o){var l=n.length;if(l>0){var u=n[l-1];i.default.strictEqual(u.precedingNode===e.precedingNode,u.followingNode===e.followingNode);if(u.followingNode!==e.followingNode){p(n,r)}}n.push(e)}else if(s){p(n,r);g(s,e)}else if(o){p(n,r);m(o,e)}else if(a){p(n,r);v(a,e)}else{throw new Error("AST contains no nodes at all?")}});p(n,r);e.forEach(function(e){delete e.precedingNode;delete e.enclosingNode;delete e.followingNode})}t.attach=h;function p(e,t){var r=e.length;if(r===0){return}var n=e[0].precedingNode;var s=e[0].followingNode;var a=s.loc.start;for(var o=r;o>0;--o){var l=e[o-1];i.default.strictEqual(l.precedingNode,n);i.default.strictEqual(l.followingNode,s);var u=t.sliceString(l.loc.end,a);if(/\S/.test(u)){break}a=l.loc.start}while(o<=r&&(l=e[o])&&(l.type==="Line"||l.type==="CommentLine")&&l.loc.start.column>s.loc.start.column){++o}e.forEach(function(e,t){if(t<o){g(n,e)}else{m(s,e)}});e.length=0}function d(e,t){var r=e.comments||(e.comments=[]);r.push(t)}function m(e,t){t.leading=true;t.trailing=false;d(e,t)}function v(e,t){t.leading=false;t.trailing=false;d(e,t)}function g(e,t){t.leading=false;t.trailing=true;d(e,t)}function y(e,t){var r=e.getValue();a.Comment.assert(r);var n=r.loc;var i=n&&n.lines;var s=[t(e)];if(r.trailing){s.push("\n")}else if(i instanceof gi.Lines){var o=i.slice(n.end,i.skipSpaces(n.end)||i.lastPos());if(o.length===1){s.push(o)}else{s.push(new Array(o.length).join("\n"))}}else{s.push("\n")}return gi.concat(s)}function x(e,t){var r=e.getValue(e);a.Comment.assert(r);var n=r.loc;var i=n&&n.lines;var s=[];if(i instanceof gi.Lines){var o=i.skipSpaces(n.start,true)||i.firstPos();var l=i.slice(o,n.start);if(l.length===1){s.push(l)}else{s.push(new Array(l.length).join("\n"))}}s.push(t(e));return gi.concat(s)}function E(e,t){var r=e.getValue();var n=t(e);var i=a.Node.check(r)&&s.getFieldValue(r,"comments");if(!i||i.length===0){return n}var o=[];var l=[n];e.each(function(e){var n=e.getValue();var i=s.getFieldValue(n,"leading");var u=s.getFieldValue(n,"trailing");if(i||u&&!(a.Statement.check(r)||n.type==="Block"||n.type==="CommentBlock")){o.push(y(e,t))}else if(u){l.push(x(e,t))}},"comments");o.push.apply(o,l);return gi.concat(o)}t.printComments=E});o(Gi);var zi=Gi.attach;var Xi=Gi.printComments;var Ji=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(I);var a=s.builders;var o=s.builtInTypes.object;var l=s.builtInTypes.array;var u=n(Rn);function c(e,t){t=di.normalize(t);var r=gi.fromString(e,t);var n=r.toString({tabWidth:t.tabWidth,reuseWhitespace:false,useTabs:false});var i=[];var s=t.parser.parse(n,{jsx:true,loc:true,locations:true,range:t.range,comment:true,onComment:i,tolerant:u.getOption(t,"tolerant",true),ecmaVersion:6,sourceType:u.getOption(t,"sourceType","module")});var o=Array.isArray(s.tokens)?s.tokens:Kn.tokenize(n,{loc:true});delete s.tokens;o.forEach(function(e){if(typeof e.value!=="string"){e.value=r.sliceString(e.loc.start,e.loc.end)}});if(Array.isArray(s.comments)){i=s.comments;delete s.comments}if(s.loc){u.fixFaultyLocations(s,r)}else{s.loc={start:r.firstPos(),end:r.lastPos()}}s.loc.lines=r;s.loc.indent=0;var l;var c;if(s.type==="Program"){c=s;l=a.file(s,t.sourceFileName||null);l.loc={start:r.firstPos(),end:r.lastPos(),lines:r,indent:0}}else if(s.type==="File"){l=s;c=l.program}if(t.tokens){l.tokens=o}var h=u.getTrueLoc({type:c.type,loc:c.loc,body:[],comments:i},r);c.loc.start=h.start;c.loc.end=h.end;Gi.attach(i,c.body.length?l.program:l,r);return new f(r,o).copy(l)}t.parse=c;var f=function e(t,r){i.default.ok(this instanceof e);this.lines=t;this.tokens=r;this.startTokenIndex=0;this.endTokenIndex=r.length;this.indent=0;this.seen=new Map};var h=f.prototype;h.copy=function(e){if(this.seen.has(e)){return this.seen.get(e)}if(l.check(e)){var t=new Array(e.length);this.seen.set(e,t);e.forEach(function(e,r){t[r]=this.copy(e)},this);return t}if(!o.check(e)){return e}u.fixFaultyLocations(e,this.lines);var t=Object.create(Object.getPrototypeOf(e),{original:{value:e,configurable:false,enumerable:false,writable:true}});this.seen.set(e,t);var r=e.loc;var n=this.indent;var i=n;var s=this.startTokenIndex;var a=this.endTokenIndex;if(r){if(e.type==="Block"||e.type==="Line"||e.type==="CommentBlock"||e.type==="CommentLine"||this.lines.isPrecededOnlyByWhitespace(r.start)){i=this.indent=r.start.column}r.lines=this.lines;r.tokens=this.tokens;r.indent=i;this.findTokenRange(r)}var c=Object.keys(e);var f=c.length;for(var h=0;h<f;++h){var p=c[h];if(p==="loc"){t[p]=e[p]}else if(p==="tokens"&&e.type==="File"){t[p]=e[p]}else{t[p]=this.copy(e[p])}}this.indent=n;this.startTokenIndex=s;this.endTokenIndex=a;return t};h.findTokenRange=function(e){while(this.startTokenIndex>0){var t=e.tokens[this.startTokenIndex];if(u.comparePos(e.start,t.loc.start)<0){--this.startTokenIndex}else break}while(this.endTokenIndex<e.tokens.length){var t=e.tokens[this.endTokenIndex];if(u.comparePos(t.loc.end,e.end)<0){++this.endTokenIndex}else break}while(this.startTokenIndex<this.endTokenIndex){var t=e.tokens[this.startTokenIndex];if(u.comparePos(t.loc.start,e.start)<0){++this.startTokenIndex}else break}e.start.token=this.startTokenIndex;while(this.endTokenIndex>this.startTokenIndex){var t=e.tokens[this.endTokenIndex-1];if(u.comparePos(e.end,t.loc.end)<0){--this.endTokenIndex}else break}e.end.token=this.endTokenIndex}});o(Ji);var qi=Ji.parse;var Wi=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(I);var a=s.namedTypes;var o=s.builtInTypes.array;var l=s.builtInTypes.number;var u=n(Rn);var c=function e(t){i.default.ok(this instanceof e);this.stack=[t]};var f=c.prototype;c.from=function(e){if(e instanceof c){return e.copy()}if(e instanceof s.NodePath){var t=Object.create(c.prototype);var r=[e.value];for(var n;n=e.parentPath;e=n)r.push(e.name,n.value);t.stack=r.reverse();return t}return new c(e)};f.copy=function e(){var e=Object.create(c.prototype);e.stack=this.stack.slice(0);return e};f.getName=function e(){var t=this.stack;var r=t.length;if(r>1){return t[r-2]}return null};f.getValue=function e(){var t=this.stack;return t[t.length-1]};f.valueIsDuplicate=function(){var e=this.stack;var t=e.length-1;return e.lastIndexOf(e[t],t-1)>=0};function h(e,t){var r=e.stack;for(var n=r.length-1;n>=0;n-=2){var i=r[n];if(a.Node.check(i)&&--t<0){return i}}return null}f.getNode=function e(t){if(t===void 0){t=0}return h(this,~~t)};f.getParentNode=function e(t){if(t===void 0){t=0}return h(this,~~t+1)};f.getRootValue=function e(){var t=this.stack;if(t.length%2===0){return t[1]}return t[0]};f.call=function e(t){var r=this.stack;var n=r.length;var i=r[n-1];var s=arguments.length;for(var a=1;a<s;++a){var o=arguments[a];i=i[o];r.push(o,i)}var l=t(this);r.length=n;return l};f.each=function e(t){var r=this.stack;var n=r.length;var i=r[n-1];var s=arguments.length;for(var a=1;a<s;++a){var o=arguments[a];i=i[o];r.push(o,i)}for(var a=0;a<i.length;++a){if(a in i){r.push(a,i[a]);t(this);r.length-=2}}r.length=n};f.map=function e(t){var r=this.stack;var n=r.length;var i=r[n-1];var s=arguments.length;for(var a=1;a<s;++a){var o=arguments[a];i=i[o];r.push(o,i)}var l=new Array(i.length);for(var a=0;a<i.length;++a){if(a in i){r.push(a,i[a]);l[a]=t(this,a);r.length-=2}}r.length=n;return l};f.hasParens=function(){var e=this.getNode();var t=this.getPrevToken(e);if(!t){return false}var r=this.getNextToken(e);if(!r){return false}if(t.value==="("){if(r.value===")"){return true}var n=!this.canBeFirstInStatement()&&this.firstInStatement()&&!this.needsParens(true);if(n){return true}}return false};f.getPrevToken=function(e){e=e||this.getNode();var t=e&&e.loc;var r=t&&t.tokens;if(r&&t.start.token>0){var n=r[t.start.token-1];if(n){var i=this.getRootValue().loc;if(u.comparePos(i.start,n.loc.start)<=0){return n}}}return null};f.getNextToken=function(e){e=e||this.getNode();var t=e&&e.loc;var r=t&&t.tokens;if(r&&t.end.token<r.length){var n=r[t.end.token];if(n){var i=this.getRootValue().loc;if(u.comparePos(n.loc.end,i.end)<=0){return n}}}return null};f.needsParens=function(e){var t=this.getNode();if(t.type==="AssignmentExpression"&&t.left.type==="ObjectPattern"){return true}var r=this.getParentNode();if(!r){return false}var n=this.getName();if(this.getValue()!==t){return false}if(a.Statement.check(t)){return false}if(t.type==="Identifier"){return false}if(r.type==="ParenthesizedExpression"){return false}switch(t.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return r.type==="MemberExpression"&&n==="object"&&r.object===t;case"BinaryExpression":case"LogicalExpression":switch(r.type){case"CallExpression":return n==="callee"&&r.callee===t;case"UnaryExpression":case"SpreadElement":case"SpreadProperty":return true;case"MemberExpression":return n==="object"&&r.object===t;case"BinaryExpression":case"LogicalExpression":var s=r.operator;var o=d[s];var u=t.operator;var c=d[u];if(o>c){return true}if(o===c&&n==="right"){i.default.strictEqual(r.right,t);return true}default:return false}case"SequenceExpression":switch(r.type){case"ReturnStatement":return false;case"ForStatement":return false;case"ExpressionStatement":return n!=="expression";default:return true}case"YieldExpression":switch(r.type){case"BinaryExpression":case"LogicalExpression":case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"CallExpression":case"MemberExpression":case"NewExpression":case"ConditionalExpression":case"YieldExpression":return true;default:return false}case"IntersectionTypeAnnotation":case"UnionTypeAnnotation":return r.type==="NullableTypeAnnotation";case"Literal":return r.type==="MemberExpression"&&l.check(t.value)&&n==="object"&&r.object===t;case"NumericLiteral":return r.type==="MemberExpression"&&n==="object"&&r.object===t;case"AssignmentExpression":case"ConditionalExpression":switch(r.type){case"UnaryExpression":case"SpreadElement":case"SpreadProperty":case"BinaryExpression":case"LogicalExpression":return true;case"CallExpression":case"NewExpression":return n==="callee"&&r.callee===t;case"ConditionalExpression":return n==="test"&&r.test===t;case"MemberExpression":return n==="object"&&r.object===t;default:return false}case"ArrowFunctionExpression":if(a.CallExpression.check(r)&&n==="callee"){return true}if(a.MemberExpression.check(r)&&n==="object"){return true}return p(r);case"ObjectExpression":if(r.type==="ArrowFunctionExpression"&&n==="body"){return true}break;case"CallExpression":if(n==="declaration"&&a.ExportDefaultDeclaration.check(r)&&a.FunctionExpression.check(t.callee)){return true}}if(r.type==="NewExpression"&&n==="callee"&&r.callee===t){return m(t)}if(e!==true&&!this.canBeFirstInStatement()&&this.firstInStatement()){return true}return false};function p(e){return a.BinaryExpression.check(e)||a.LogicalExpression.check(e)}var d={};[["||"],["&&"],["|"],["^"],["&"],["==","===","!=","!=="],["<",">","<=",">=","in","instanceof"],[">>","<<",">>>"],["+","-"],["*","/","%","**"]].forEach(function(e,t){e.forEach(function(e){d[e]=t})});function m(e){if(a.CallExpression.check(e)){return true}if(o.check(e)){return e.some(m)}if(a.Node.check(e)){return s.someField(e,function(e,t){return m(t)})}return false}f.canBeFirstInStatement=function(){var e=this.getNode();if(a.FunctionExpression.check(e)){return false}if(a.ObjectExpression.check(e)){return false}if(a.ClassExpression.check(e)){return false}return true};f.firstInStatement=function(){var e=this.stack;var t,r;var n,s;for(var o=e.length-1;o>=0;o-=2){if(a.Node.check(e[o])){n=t;s=r;t=e[o-1];r=e[o]}if(!r||!s){continue}if(a.BlockStatement.check(r)&&t==="body"&&n===0){i.default.strictEqual(r.body[0],s);return true}if(a.ExpressionStatement.check(r)&&n==="expression"){i.default.strictEqual(r.expression,s);return true}if(a.AssignmentExpression.check(r)&&n==="left"){i.default.strictEqual(r.left,s);return true}if(a.ArrowFunctionExpression.check(r)&&n==="body"){i.default.strictEqual(r.body,s);return true}if(a.SequenceExpression.check(r)&&t==="expressions"&&n===0){i.default.strictEqual(r.expressions[0],s);continue}if(a.CallExpression.check(r)&&n==="callee"){i.default.strictEqual(r.callee,s);continue}if(a.MemberExpression.check(r)&&n==="object"){i.default.strictEqual(r.object,s);continue}if(a.ConditionalExpression.check(r)&&n==="test"){i.default.strictEqual(r.test,s);continue}if(p(r)&&n==="left"){i.default.strictEqual(r.left,s);continue}if(a.UnaryExpression.check(r)&&!r.prefix&&n==="argument"){i.default.strictEqual(r.argument,s);continue}return false}return true};t.default=c});o(Wi);var Hi=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(gi);var a=n(I);var o=a.namedTypes.Printable;var l=a.namedTypes.Expression;var u=a.namedTypes.ReturnStatement;var c=a.namedTypes.SourceLocation;var f=r(Wi);var h=a.builtInTypes.object;var p=a.builtInTypes.array;var d=a.builtInTypes.string;var m=/[0-9a-z_$]/i;var v=function e(t){i.default.ok(this instanceof e);i.default.ok(t instanceof s.Lines);var r=this,n=[];r.replace=function(e,t){if(d.check(t))t=s.fromString(t);n.push({lines:t,start:e.start,end:e.end})};r.get=function(e){e=e||{start:{line:1,column:0},end:{line:t.length,column:t.getLineLength(t.length)}};var r=e.start,a=[];function o(e,r){i.default.ok(Rn.comparePos(e,r)<=0);a.push(t.slice(e,r))}n.sort(function(e,t){return Rn.comparePos(e.start,t.start)}).forEach(function(e){if(Rn.comparePos(r,e.start)>0);else{o(r,e.start);a.push(e.lines);r=e.end}});o(r,e.end);return s.concat(a)}};t.Patcher=v;var g=v.prototype;g.tryToReprintComments=function(e,t,r){var n=this;if(!e.comments&&!t.comments){return true}var s=f.default.from(e);var a=f.default.from(t);s.stack.push("comments",y(e));a.stack.push("comments",y(t));var o=[];var l=C(s,a,o);if(l&&o.length>0){o.forEach(function(e){var t=e.oldPath.getValue();i.default.ok(t.leading||t.trailing);n.replace(t.loc,r(e.newPath).indentTail(t.loc.indent))})}return l};function y(e){var t=[];if(e.comments&&e.comments.length>0){e.comments.forEach(function(e){if(e.leading||e.trailing){t.push(e)}})}return t}g.deleteComments=function(e){if(!e.comments){return}var t=this;e.comments.forEach(function(r){if(r.leading){t.replace({start:r.loc.start,end:e.loc.lines.skipSpaces(r.loc.end,false,false)},"")}else if(r.trailing){t.replace({start:e.loc.lines.skipSpaces(r.loc.start,true,false),end:r.loc.end},"")}})};function x(e){i.default.ok(e instanceof f.default);var t=e.getValue();if(!o.check(t))return;var r=t.original;var n=r&&r.loc;var a=n&&n.lines;var l=[];if(!a||!S(e,l))return;return function(t){var i=new v(a);l.forEach(function(e){var r=e.newPath.getValue();var n=e.oldPath.getValue();c.assert(n.loc,true);var o=!i.tryToReprintComments(r,n,t);if(o){i.deleteComments(n)}var l=t(e.newPath,{includeComments:o,avoidRootParens:n.type===r.type&&e.oldPath.hasParens()}).indentTail(n.loc.indent);var u=E(a,n.loc,l);var f=b(a,n.loc,l);if(u||f){var h=[];u&&h.push(" ");h.push(l);f&&h.push(" ");l=s.concat(h)}i.replace(n.loc,l)});var o=i.get(n).indentTail(-r.loc.indent);if(e.needsParens()){return s.concat(["(",o,")"])}return o}}t.getReprinter=x;function E(e,t,r){var n=Rn.copyPos(t.start);var i=e.prevPos(n)&&e.charAt(n);var s=r.charAt(r.firstPos());return i&&m.test(i)&&s&&m.test(s)}function b(e,t,r){var n=e.charAt(t.end);var i=r.lastPos();var s=r.prevPos(i)&&r.charAt(i);return s&&m.test(s)&&n&&m.test(n)}function S(e,t){var r=e.getValue();o.assert(r);var n=r.original;o.assert(n);i.default.deepEqual(t,[]);if(r.type!==n.type){return false}var s=new f.default(n);var a=A(e,s,t);if(!a){t.length=0}return a}function D(e,t,r){var n=e.getValue();var i=t.getValue();if(n===i)return true;if(p.check(n))return C(e,t,r);if(h.check(n))return w(e,t,r);return false}function C(e,t,r){var n=e.getValue();var i=t.getValue();if(n===i||e.valueIsDuplicate()||t.valueIsDuplicate()){return true}p.assert(n);var s=n.length;if(!(p.check(i)&&i.length===s))return false;for(var a=0;a<s;++a){e.stack.push(a,n[a]);t.stack.push(a,i[a]);var o=D(e,t,r);e.stack.length-=2;t.stack.length-=2;if(!o){return false}}return true}function w(e,t,r){var n=e.getValue();h.assert(n);if(n.original===null){return false}var i=t.getValue();if(!h.check(i))return false;if(n===i||e.valueIsDuplicate()||t.valueIsDuplicate()){return true}if(o.check(n)){if(!o.check(i)){return false}if(n.type===i.type){var s=[];if(A(e,t,s)){r.push.apply(r,s)}else if(i.loc){r.push({oldPath:t.copy(),newPath:e.copy()})}else{return false}return true}if(l.check(n)&&l.check(i)&&i.loc){r.push({oldPath:t.copy(),newPath:e.copy()});return true}return false}return A(e,t,r)}function A(e,t,r){var n=e.getValue();var i=t.getValue();h.assert(n);h.assert(i);if(n.original===null){return false}if(e.needsParens()&&!t.hasParens()){return false}var s=Rn.getUnionOfKeys(i,n);if(i.type==="File"||n.type==="File"){delete s.tokens}delete s.loc;var o=r.length;for(var l in s){if(l.charAt(0)==="_"){continue}e.stack.push(l,a.getFieldValue(n,l));t.stack.push(l,a.getFieldValue(i,l));var c=D(e,t,r);e.stack.length-=2;t.stack.length-=2;if(!c){return false}}if(u.check(e.getNode())&&r.length>o){return false}return true}});o(Hi);var Ki=Hi.Patcher;var $i=Hi.getReprinter;var Yi=l(function(e,t){var r=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var n=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(t,"__esModule",{value:true});var i=r(Wt);var s=n(I);var a=s.namedTypes;var o=s.builtInTypes.string;var l=s.builtInTypes.object;var u=r(Wi);var c=n(Rn);var f=function e(t,r){i.default.ok(this instanceof e);o.assert(t);this.code=t;if(r){l.assert(r);this.map=r}};var h=f.prototype;var p=false;h.toString=function(){if(!p){console.warn("Deprecation warning: recast.print now returns an object with "+"a .code property. You appear to be treating the object as a "+"string, which might still work but is strongly discouraged.");p=true}return this.code};var d=new f("");var m=function e(t){i.default.ok(this instanceof e);var r=t&&t.tabWidth;t=di.normalize(t);t.sourceFileName=null;function n(e,t){e=Object.assign({},e,t);return function(t){return s(t,e)}}function s(e,a){i.default.ok(e instanceof u.default);a=a||{};if(a.includeComments){return Gi.printComments(e,n(a,{includeComments:false}))}var o=t.tabWidth;if(!r){var l=e.getNode().loc;if(l&&l.lines&&l.lines.guessTabWidth){t.tabWidth=l.lines.guessTabWidth()}}var c=Hi.getReprinter(e);var f=c?c(s):v(e,t,a,n(a,{includeComments:true,avoidRootParens:false}));t.tabWidth=o;return f}this.print=function(e){if(!e){return d}var r=s(u.default.from(e),{includeComments:true,avoidRootParens:false});return new f(r.toString(t),c.composeSourceMaps(t.inputSourceMap,r.getSourceMap(t.sourceMapName,t.sourceRoot)))};this.printGenerically=function(e){if(!e){return d}function r(e){return Gi.printComments(e,function(e){return v(e,t,{includeComments:true,avoidRootParens:false},r)})}var n=u.default.from(e);var i=t.reuseWhitespace;t.reuseWhitespace=false;var s=new f(r(n).toString(t));t.reuseWhitespace=i;return s}};t.Printer=m;function v(e,t,r,n){i.default.ok(e instanceof u.default);var s=e.getValue();var a=[];var o=g(e,t,n);if(!s||o.isEmpty()){return o}var l=false;var c=y(e,n);if(c.isEmpty()){if(!r.avoidRootParens){l=e.needsParens()}}else{a.push(c)}if(l){a.unshift("(")}a.push(o);if(l){a.push(")")}return gi.concat(a)}function g(e,t,r){var n=e.getValue();if(!n){return gi.fromString("")}if(typeof n==="string"){return gi.fromString(n,t)}a.Printable.assert(n);var s=[];switch(n.type){case"File":return e.call(r,"program");case"Program":if(n.directives){e.each(function(e){s.push(r(e),";\n")},"directives")}if(n.interpreter){s.push(e.call(r,"interpreter"))}s.push(e.call(function(e){return x(e,t,r)},"body"));return gi.concat(s);case"Noop":case"EmptyStatement":return gi.fromString("");case"ExpressionStatement":return gi.concat([e.call(r,"expression"),";"]);case"ParenthesizedExpression":return gi.concat(["(",e.call(r,"expression"),")"]);case"BinaryExpression":case"LogicalExpression":case"AssignmentExpression":return gi.fromString(" ").join([e.call(r,"left"),n.operator,e.call(r,"right")]);case"AssignmentPattern":return gi.concat([e.call(r,"left")," = ",e.call(r,"right")]);case"MemberExpression":case"OptionalMemberExpression":s.push(e.call(r,"object"));var o=e.call(r,"property");var l=n.type==="OptionalMemberExpression"&&n.optional;if(n.computed){s.push(l?"?.[":"[",o,"]")}else{s.push(l?"?.":".",o)}return gi.concat(s);case"MetaProperty":return gi.concat([e.call(r,"meta"),".",e.call(r,"property")]);case"BindExpression":if(n.object){s.push(e.call(r,"object"))}s.push("::",e.call(r,"callee"));return gi.concat(s);case"Path":return gi.fromString(".").join(n.body);case"Identifier":return gi.concat([gi.fromString(n.name,t),n.optional?"?":"",e.call(r,"typeAnnotation")]);case"SpreadElement":case"SpreadElementPattern":case"RestProperty":case"SpreadProperty":case"SpreadPropertyPattern":case"ObjectTypeSpreadProperty":case"RestElement":return gi.concat(["...",e.call(r,"argument"),e.call(r,"typeAnnotation")]);case"FunctionDeclaration":case"FunctionExpression":case"TSDeclareFunction":if(n.declare){s.push("declare ")}if(n.async){s.push("async ")}s.push("function");if(n.generator)s.push("*");if(n.id){s.push(" ",e.call(r,"id"),e.call(r,"typeParameters"))}else{if(n.typeParameters){s.push(e.call(r,"typeParameters"))}}s.push("(",D(e,t,r),")",e.call(r,"returnType"));if(n.body){s.push(" ",e.call(r,"body"))}return gi.concat(s);case"ArrowFunctionExpression":if(n.async){s.push("async ")}if(n.typeParameters){s.push(e.call(r,"typeParameters"))}if(!t.arrowParensAlways&&n.params.length===1&&!n.rest&&n.params[0].type==="Identifier"&&!n.params[0].typeAnnotation&&!n.returnType){s.push(e.call(r,"params",0))}else{s.push("(",D(e,t,r),")",e.call(r,"returnType"))}s.push(" => ",e.call(r,"body"));return gi.concat(s);case"MethodDefinition":return b(e,t,r);case"YieldExpression":s.push("yield");if(n.delegate)s.push("*");if(n.argument)s.push(" ",e.call(r,"argument"));return gi.concat(s);case"AwaitExpression":s.push("await");if(n.all)s.push("*");if(n.argument)s.push(" ",e.call(r,"argument"));return gi.concat(s);case"ModuleDeclaration":s.push("module",e.call(r,"id"));if(n.source){i.default.ok(!n.body);s.push("from",e.call(r,"source"))}else{s.push(e.call(r,"body"))}return gi.fromString(" ").join(s);case"ImportSpecifier":if(n.importKind&&n.importKind!=="value"){s.push(n.importKind+" ")}if(n.imported){s.push(e.call(r,"imported"));if(n.local&&n.local.name!==n.imported.name){s.push(" as ",e.call(r,"local"))}}else if(n.id){s.push(e.call(r,"id"));if(n.name){s.push(" as ",e.call(r,"name"))}}return gi.concat(s);case"ExportSpecifier":if(n.local){s.push(e.call(r,"local"));if(n.exported&&n.exported.name!==n.local.name){s.push(" as ",e.call(r,"exported"))}}else if(n.id){s.push(e.call(r,"id"));if(n.name){s.push(" as ",e.call(r,"name"))}}return gi.concat(s);case"ExportBatchSpecifier":return gi.fromString("*");case"ImportNamespaceSpecifier":s.push("* as ");if(n.local){s.push(e.call(r,"local"))}else if(n.id){s.push(e.call(r,"id"))}return gi.concat(s);case"ImportDefaultSpecifier":if(n.local){return e.call(r,"local")}return e.call(r,"id");case"TSExportAssignment":return gi.concat(["export = ",e.call(r,"expression")]);case"ExportDeclaration":case"ExportDefaultDeclaration":case"ExportNamedDeclaration":return C(e,t,r);case"ExportAllDeclaration":s.push("export *");if(n.exported){s.push(" as ",e.call(r,"exported"))}s.push(" from ",e.call(r,"source"),";");return gi.concat(s);case"TSNamespaceExportDeclaration":s.push("export as namespace ",e.call(r,"id"));return M(gi.concat(s));case"ExportNamespaceSpecifier":return gi.concat(["* as ",e.call(r,"exported")]);case"ExportDefaultSpecifier":return e.call(r,"exported");case"Import":return gi.fromString("import",t);case"ImportDeclaration":{s.push("import ");if(n.importKind&&n.importKind!=="value"){s.push(n.importKind+" ")}if(n.specifiers&&n.specifiers.length>0){var u=[];var f=[];e.each(function(e){var t=e.getValue();if(t.type==="ImportSpecifier"){f.push(r(e))}else if(t.type==="ImportDefaultSpecifier"||t.type==="ImportNamespaceSpecifier"){u.push(r(e))}},"specifiers");u.forEach(function(e,t){if(t>0){s.push(", ")}s.push(e)});if(f.length>0){var h=gi.fromString(", ").join(f);if(h.getLineLength(1)>t.wrapColumn){h=gi.concat([gi.fromString(",\n").join(f).indent(t.tabWidth),","])}if(u.length>0){s.push(", ")}if(h.length>1){s.push("{\n",h,"\n}")}else if(t.objectCurlySpacing){s.push("{ ",h," }")}else{s.push("{",h,"}")}}s.push(" from ")}s.push(e.call(r,"source"),";");return gi.concat(s)}case"BlockStatement":var p=e.call(function(e){return x(e,t,r)},"body");if(p.isEmpty()){if(!n.directives||n.directives.length===0){return gi.fromString("{}")}}s.push("{\n");if(n.directives){e.each(function(e){s.push(r(e).indent(t.tabWidth),";",n.directives.length>1||!p.isEmpty()?"\n":"")},"directives")}s.push(p.indent(t.tabWidth));s.push("\n}");return gi.concat(s);case"ReturnStatement":s.push("return");if(n.argument){var d=e.call(r,"argument");if(d.startsWithComment()||d.length>1&&a.JSXElement&&a.JSXElement.check(n.argument)){s.push(" (\n",d.indent(t.tabWidth),"\n)")}else{s.push(" ",d)}}s.push(";");return gi.concat(s);case"CallExpression":case"OptionalCallExpression":s.push(e.call(r,"callee"));if(n.typeParameters){s.push(e.call(r,"typeParameters"))}if(n.typeArguments){s.push(e.call(r,"typeArguments"))}if(n.type==="OptionalCallExpression"&&n.callee.type!=="OptionalMemberExpression"){s.push("?.")}s.push(S(e,t,r));return gi.concat(s);case"ObjectExpression":case"ObjectPattern":case"ObjectTypeAnnotation":var m=false;var v=n.type==="ObjectTypeAnnotation";var g=t.flowObjectCommas?",":v?";":",";var y=[];if(v){y.push("indexers","callProperties");if(n.internalSlots!=null){y.push("internalSlots")}}y.push("properties");var E=0;y.forEach(function(e){E+=n[e].length});var k=v&&E===1||E===0;var P=n.exact?"{|":"{";var I=n.exact?"|}":"}";s.push(k?P:P+"\n");var N=s.length-1;var L=0;y.forEach(function(n){e.each(function(e){var n=r(e);if(!k){n=n.indent(t.tabWidth)}var i=!v&&n.length>1;if(i&&m){s.push("\n")}s.push(n);if(L<E-1){s.push(g+(i?"\n\n":"\n"));m=!i}else if(E!==1&&v){s.push(g)}else if(!k&&c.isTrailingCommaEnabled(t,"objects")){s.push(g)}L++},n)});if(n.inexact){var B=gi.fromString("...",t);if(k){if(E>0){s.push(g," ")}s.push(B)}else{s.push("\n",B.indent(t.tabWidth))}}s.push(k?I:"\n"+I);if(L!==0&&k&&t.objectCurlySpacing){s[N]=P+" ";s[s.length-1]=" "+I}if(n.typeAnnotation){s.push(e.call(r,"typeAnnotation"))}return gi.concat(s);case"PropertyPattern":return gi.concat([e.call(r,"key"),": ",e.call(r,"pattern")]);case"ObjectProperty":case"Property":if(n.method||n.kind==="get"||n.kind==="set"){return b(e,t,r)}var O=e.call(r,"key");if(n.computed){s.push("[",O,"]")}else{s.push(O)}if(!n.shorthand){s.push(": ",e.call(r,"value"))}return gi.concat(s);case"ClassMethod":case"ObjectMethod":case"ClassPrivateMethod":case"TSDeclareMethod":return b(e,t,r);case"PrivateName":return gi.concat(["#",e.call(r,"id")]);case"Decorator":return gi.concat(["@",e.call(r,"expression")]);case"ArrayExpression":case"ArrayPattern":var R=n.elements,E=R.length;var j=e.map(r,"elements");var U=gi.fromString(", ").join(j);var k=U.getLineLength(1)<=t.wrapColumn;if(k){if(t.arrayBracketSpacing){s.push("[ ")}else{s.push("[")}}else{s.push("[\n")}e.each(function(e){var r=e.getName();var n=e.getValue();if(!n){s.push(",")}else{var i=j[r];if(k){if(r>0)s.push(" ")}else{i=i.indent(t.tabWidth)}s.push(i);if(r<E-1||!k&&c.isTrailingCommaEnabled(t,"arrays"))s.push(",");if(!k)s.push("\n")}},"elements");if(k&&t.arrayBracketSpacing){s.push(" ]")}else{s.push("]")}return gi.concat(s);case"SequenceExpression":return gi.fromString(", ").join(e.map(r,"expressions"));case"ThisExpression":return gi.fromString("this");case"Super":return gi.fromString("super");case"NullLiteral":return gi.fromString("null");case"RegExpLiteral":return gi.fromString(n.extra.raw);case"BigIntLiteral":return gi.fromString(n.value+"n");case"NumericLiteral":if(n.extra&&typeof n.extra.raw==="string"&&Number(n.extra.raw)===n.value){return gi.fromString(n.extra.raw,t)}return gi.fromString(n.value,t);case"BooleanLiteral":case"StringLiteral":case"Literal":if(typeof n.value==="number"&&typeof n.raw==="string"&&Number(n.raw)===n.value){return gi.fromString(n.raw,t)}if(typeof n.value!=="string"){return gi.fromString(n.value,t)}return gi.fromString(F(n.value,t),t);case"Directive":return e.call(r,"value");case"DirectiveLiteral":return gi.fromString(F(n.value,t));case"InterpreterDirective":return gi.fromString("#!"+n.value+"\n",t);case"ModuleSpecifier":if(n.local){throw new Error("The ESTree ModuleSpecifier type should be abstract")}return gi.fromString(F(n.value,t),t);case"UnaryExpression":s.push(n.operator);if(/[a-z]$/.test(n.operator))s.push(" ");s.push(e.call(r,"argument"));return gi.concat(s);case"UpdateExpression":s.push(e.call(r,"argument"),n.operator);if(n.prefix)s.reverse();return gi.concat(s);case"ConditionalExpression":return gi.concat([e.call(r,"test")," ? ",e.call(r,"consequent")," : ",e.call(r,"alternate")]);case"NewExpression":s.push("new ",e.call(r,"callee"));if(n.typeParameters){s.push(e.call(r,"typeParameters"))}if(n.typeArguments){s.push(e.call(r,"typeArguments"))}var V=n.arguments;if(V){s.push(S(e,t,r))}return gi.concat(s);case"VariableDeclaration":if(n.declare){s.push("declare ")}s.push(n.kind," ");var G=0;var j=e.map(function(e){var t=r(e);G=Math.max(t.length,G);return t},"declarations");if(G===1){s.push(gi.fromString(", ").join(j))}else if(j.length>1){s.push(gi.fromString(",\n").join(j).indentTail(n.kind.length+1))}else{s.push(j[0])}var z=e.getParentNode();if(!a.ForStatement.check(z)&&!a.ForInStatement.check(z)&&!(a.ForOfStatement&&a.ForOfStatement.check(z))&&!(a.ForAwaitStatement&&a.ForAwaitStatement.check(z))){s.push(";")}return gi.concat(s);case"VariableDeclarator":return n.init?gi.fromString(" = ").join([e.call(r,"id"),e.call(r,"init")]):e.call(r,"id");case"WithStatement":return gi.concat(["with (",e.call(r,"object"),") ",e.call(r,"body")]);case"IfStatement":var X=T(e.call(r,"consequent"),t);s.push("if (",e.call(r,"test"),")",X);if(n.alternate)s.push(_(X)?" else":"\nelse",T(e.call(r,"alternate"),t));return gi.concat(s);case"ForStatement":var J=e.call(r,"init"),q=J.length>1?";\n":"; ",W="for (",H=gi.fromString(q).join([J,e.call(r,"test"),e.call(r,"update")]).indentTail(W.length),K=gi.concat([W,H,")"]),$=T(e.call(r,"body"),t);s.push(K);if(K.length>1){s.push("\n");$=$.trimLeft()}s.push($);return gi.concat(s);case"WhileStatement":return gi.concat(["while (",e.call(r,"test"),")",T(e.call(r,"body"),t)]);case"ForInStatement":return gi.concat([n.each?"for each (":"for (",e.call(r,"left")," in ",e.call(r,"right"),")",T(e.call(r,"body"),t)]);case"ForOfStatement":case"ForAwaitStatement":s.push("for ");if(n.await||n.type==="ForAwaitStatement"){s.push("await ")}s.push("(",e.call(r,"left")," of ",e.call(r,"right"),")",T(e.call(r,"body"),t));return gi.concat(s);case"DoWhileStatement":var Y=gi.concat(["do",T(e.call(r,"body"),t)]);s.push(Y);if(_(Y))s.push(" while");else s.push("\nwhile");s.push(" (",e.call(r,"test"),");");return gi.concat(s);case"DoExpression":var Q=e.call(function(e){return x(e,t,r)},"body");return gi.concat(["do {\n",Q.indent(t.tabWidth),"\n}"]);case"BreakStatement":s.push("break");if(n.label)s.push(" ",e.call(r,"label"));s.push(";");return gi.concat(s);case"ContinueStatement":s.push("continue");if(n.label)s.push(" ",e.call(r,"label"));s.push(";");return gi.concat(s);case"LabeledStatement":return gi.concat([e.call(r,"label"),":\n",e.call(r,"body")]);case"TryStatement":s.push("try ",e.call(r,"block"));if(n.handler){s.push(" ",e.call(r,"handler"))}else if(n.handlers){e.each(function(e){s.push(" ",r(e))},"handlers")}if(n.finalizer){s.push(" finally ",e.call(r,"finalizer"))}return gi.concat(s);case"CatchClause":s.push("catch ");if(n.param){s.push("(",e.call(r,"param"))}if(n.guard){s.push(" if ",e.call(r,"guard"))}if(n.param){s.push(") ")}s.push(e.call(r,"body"));return gi.concat(s);case"ThrowStatement":return gi.concat(["throw ",e.call(r,"argument"),";"]);case"SwitchStatement":return gi.concat(["switch (",e.call(r,"discriminant"),") {\n",gi.fromString("\n").join(e.map(r,"cases")),"\n}"]);case"SwitchCase":if(n.test)s.push("case ",e.call(r,"test"),":");else s.push("default:");if(n.consequent.length>0){s.push("\n",e.call(function(e){return x(e,t,r)},"consequent").indent(t.tabWidth))}return gi.concat(s);case"DebuggerStatement":return gi.fromString("debugger;");case"JSXAttribute":s.push(e.call(r,"name"));if(n.value)s.push("=",e.call(r,"value"));return gi.concat(s);case"JSXIdentifier":return gi.fromString(n.name,t);case"JSXNamespacedName":return gi.fromString(":").join([e.call(r,"namespace"),e.call(r,"name")]);case"JSXMemberExpression":return gi.fromString(".").join([e.call(r,"object"),e.call(r,"property")]);case"JSXSpreadAttribute":return gi.concat(["{...",e.call(r,"argument"),"}"]);case"JSXSpreadChild":return gi.concat(["{...",e.call(r,"expression"),"}"]);case"JSXExpressionContainer":return gi.concat(["{",e.call(r,"expression"),"}"]);case"JSXElement":case"JSXFragment":var Z="opening"+(n.type==="JSXElement"?"Element":"Fragment");var ee="closing"+(n.type==="JSXElement"?"Element":"Fragment");var te=e.call(r,Z);if(n[Z].selfClosing){i.default.ok(!n[ee],"unexpected "+ee+" element in self-closing "+n.type);return te}var re=gi.concat(e.map(function(e){var t=e.getValue();if(a.Literal.check(t)&&typeof t.value==="string"){if(/\S/.test(t.value)){return t.value.replace(/^\s+|\s+$/g,"")}else if(/\n/.test(t.value)){return"\n"}}return r(e)},"children")).indentTail(t.tabWidth);var ne=e.call(r,ee);return gi.concat([te,re,ne]);case"JSXOpeningElement":s.push("<",e.call(r,"name"));var ie=[];e.each(function(e){ie.push(" ",r(e))},"attributes");var se=gi.concat(ie);var ae=se.length>1||se.getLineLength(1)>t.wrapColumn;if(ae){ie.forEach(function(e,t){if(e===" "){i.default.strictEqual(t%2,0);ie[t]="\n"}});se=gi.concat(ie).indentTail(t.tabWidth)}s.push(se,n.selfClosing?" />":">");return gi.concat(s);case"JSXClosingElement":return gi.concat(["</",e.call(r,"name"),">"]);case"JSXOpeningFragment":return gi.fromString("<>");case"JSXClosingFragment":return gi.fromString("</>");case"JSXText":return gi.fromString(n.value,t);case"JSXEmptyExpression":return gi.fromString("");case"TypeAnnotatedIdentifier":return gi.concat([e.call(r,"annotation")," ",e.call(r,"identifier")]);case"ClassBody":if(n.body.length===0){return gi.fromString("{}")}return gi.concat(["{\n",e.call(function(e){return x(e,t,r)},"body").indent(t.tabWidth),"\n}"]);case"ClassPropertyDefinition":s.push("static ",e.call(r,"definition"));if(!a.MethodDefinition.check(n.definition))s.push(";");return gi.concat(s);case"ClassProperty":var oe=n.accessibility||n.access;if(typeof oe==="string"){s.push(oe," ")}if(n.static){s.push("static ")}if(n.abstract){s.push("abstract ")}if(n.readonly){s.push("readonly ")}var O=e.call(r,"key");if(n.computed){O=gi.concat(["[",O,"]"])}if(n.variance){O=gi.concat([A(e,r),O])}s.push(O);if(n.optional){s.push("?")}if(n.typeAnnotation){s.push(e.call(r,"typeAnnotation"))}if(n.value){s.push(" = ",e.call(r,"value"))}s.push(";");return gi.concat(s);case"ClassPrivateProperty":if(n.static){s.push("static ")}s.push(e.call(r,"key"));if(n.typeAnnotation){s.push(e.call(r,"typeAnnotation"))}if(n.value){s.push(" = ",e.call(r,"value"))}s.push(";");return gi.concat(s);case"ClassDeclaration":case"ClassExpression":if(n.declare){s.push("declare ")}if(n.abstract){s.push("abstract ")}s.push("class");if(n.id){s.push(" ",e.call(r,"id"))}if(n.typeParameters){s.push(e.call(r,"typeParameters"))}if(n.superClass){s.push(" extends ",e.call(r,"superClass"),e.call(r,"superTypeParameters"))}if(n["implements"]&&n["implements"].length>0){s.push(" implements ",gi.fromString(", ").join(e.map(r,"implements")))}s.push(" ",e.call(r,"body"));return gi.concat(s);case"TemplateElement":return gi.fromString(n.value.raw,t).lockIndentTail();case"TemplateLiteral":var le=e.map(r,"expressions");s.push("`");e.each(function(e){var t=e.getName();s.push(r(e));if(t<le.length){s.push("${",le[t],"}")}},"quasis");s.push("`");return gi.concat(s).lockIndentTail();case"TaggedTemplateExpression":return gi.concat([e.call(r,"tag"),e.call(r,"quasi")]);case"Node":case"Printable":case"SourceLocation":case"Position":case"Statement":case"Function":case"Pattern":case"Expression":case"Declaration":case"Specifier":case"NamedSpecifier":case"Comment":case"Flow":case"FlowType":case"FlowPredicate":case"MemberTypeAnnotation":case"Type":case"TSHasOptionalTypeParameterInstantiation":case"TSHasOptionalTypeParameters":case"TSHasOptionalTypeAnnotation":throw new Error("unprintable type: "+JSON.stringify(n.type));case"CommentBlock":case"Block":return gi.concat(["/*",gi.fromString(n.value,t),"*/"]);case"CommentLine":case"Line":return gi.concat(["//",gi.fromString(n.value,t)]);case"TypeAnnotation":if(n.typeAnnotation){if(n.typeAnnotation.type!=="FunctionTypeAnnotation"){s.push(": ")}s.push(e.call(r,"typeAnnotation"));return gi.concat(s)}return gi.fromString("");case"ExistentialTypeParam":case"ExistsTypeAnnotation":return gi.fromString("*",t);case"EmptyTypeAnnotation":return gi.fromString("empty",t);case"AnyTypeAnnotation":return gi.fromString("any",t);case"MixedTypeAnnotation":return gi.fromString("mixed",t);case"ArrayTypeAnnotation":return gi.concat([e.call(r,"elementType"),"[]"]);case"TupleTypeAnnotation":var j=e.map(r,"types");var U=gi.fromString(", ").join(j);var k=U.getLineLength(1)<=t.wrapColumn;if(k){if(t.arrayBracketSpacing){s.push("[ ")}else{s.push("[")}}else{s.push("[\n")}e.each(function(e){var r=e.getName();var i=e.getValue();if(!i){s.push(",")}else{var a=j[r];if(k){if(r>0)s.push(" ")}else{a=a.indent(t.tabWidth)}s.push(a);if(r<n.types.length-1||!k&&c.isTrailingCommaEnabled(t,"arrays"))s.push(",");if(!k)s.push("\n")}},"types");if(k&&t.arrayBracketSpacing){s.push(" ]")}else{s.push("]")}return gi.concat(s);case"BooleanTypeAnnotation":return gi.fromString("boolean",t);case"BooleanLiteralTypeAnnotation":i.default.strictEqual(typeof n.value,"boolean");return gi.fromString(""+n.value,t);case"InterfaceTypeAnnotation":s.push("interface");if(n.extends&&n.extends.length>0){s.push(" extends ",gi.fromString(", ").join(e.map(r,"extends")))}s.push(" ",e.call(r,"body"));return gi.concat(s);case"DeclareClass":return w(e,["class ",e.call(r,"id")," ",e.call(r,"body")]);case"DeclareFunction":return w(e,["function ",e.call(r,"id"),";"]);case"DeclareModule":return w(e,["module ",e.call(r,"id")," ",e.call(r,"body")]);case"DeclareModuleExports":return w(e,["module.exports",e.call(r,"typeAnnotation")]);case"DeclareVariable":return w(e,["var ",e.call(r,"id"),";"]);case"DeclareExportDeclaration":case"DeclareExportAllDeclaration":return gi.concat(["declare ",C(e,t,r)]);case"InferredPredicate":return gi.fromString("%checks",t);case"DeclaredPredicate":return gi.concat(["%checks(",e.call(r,"value"),")"]);case"FunctionTypeAnnotation":var ue=e.getParentNode(0);var ce=!(a.ObjectTypeCallProperty.check(ue)||a.ObjectTypeInternalSlot.check(ue)&&ue.method||a.DeclareFunction.check(e.getParentNode(2)));var fe=ce&&!a.FunctionTypeParam.check(ue);if(fe){s.push(": ")}s.push("(",D(e,t,r),")");if(n.returnType){s.push(ce?" => ":": ",e.call(r,"returnType"))}return gi.concat(s);case"FunctionTypeParam":return gi.concat([e.call(r,"name"),n.optional?"?":"",": ",e.call(r,"typeAnnotation")]);case"GenericTypeAnnotation":return gi.concat([e.call(r,"id"),e.call(r,"typeParameters")]);case"DeclareInterface":s.push("declare ");case"InterfaceDeclaration":case"TSInterfaceDeclaration":if(n.declare){s.push("declare ")}s.push("interface ",e.call(r,"id"),e.call(r,"typeParameters")," ");if(n["extends"]&&n["extends"].length>0){s.push("extends ",gi.fromString(", ").join(e.map(r,"extends"))," ")}if(n.body){s.push(e.call(r,"body"))}return gi.concat(s);case"ClassImplements":case"InterfaceExtends":return gi.concat([e.call(r,"id"),e.call(r,"typeParameters")]);case"IntersectionTypeAnnotation":return gi.fromString(" & ").join(e.map(r,"types"));case"NullableTypeAnnotation":return gi.concat(["?",e.call(r,"typeAnnotation")]);case"NullLiteralTypeAnnotation":return gi.fromString("null",t);case"ThisTypeAnnotation":return gi.fromString("this",t);case"NumberTypeAnnotation":return gi.fromString("number",t);case"ObjectTypeCallProperty":return e.call(r,"value");case"ObjectTypeIndexer":return gi.concat([A(e,r),"[",e.call(r,"id"),": ",e.call(r,"key"),"]: ",e.call(r,"value")]);case"ObjectTypeProperty":return gi.concat([A(e,r),e.call(r,"key"),n.optional?"?":"",": ",e.call(r,"value")]);case"ObjectTypeInternalSlot":return gi.concat([n.static?"static ":"","[[",e.call(r,"id"),"]]",n.optional?"?":"",n.value.type!=="FunctionTypeAnnotation"?": ":"",e.call(r,"value")]);case"QualifiedTypeIdentifier":return gi.concat([e.call(r,"qualification"),".",e.call(r,"id")]);case"StringLiteralTypeAnnotation":return gi.fromString(F(n.value,t),t);case"NumberLiteralTypeAnnotation":case"NumericLiteralTypeAnnotation":i.default.strictEqual(typeof n.value,"number");return gi.fromString(JSON.stringify(n.value),t);case"StringTypeAnnotation":return gi.fromString("string",t);case"DeclareTypeAlias":s.push("declare ");case"TypeAlias":return gi.concat(["type ",e.call(r,"id"),e.call(r,"typeParameters")," = ",e.call(r,"right"),";"]);case"DeclareOpaqueType":s.push("declare ");case"OpaqueType":s.push("opaque type ",e.call(r,"id"),e.call(r,"typeParameters"));if(n["supertype"]){s.push(": ",e.call(r,"supertype"))}if(n["impltype"]){s.push(" = ",e.call(r,"impltype"))}s.push(";");return gi.concat(s);case"TypeCastExpression":return gi.concat(["(",e.call(r,"expression"),e.call(r,"typeAnnotation"),")"]);case"TypeParameterDeclaration":case"TypeParameterInstantiation":return gi.concat(["<",gi.fromString(", ").join(e.map(r,"params")),">"]);case"Variance":if(n.kind==="plus"){return gi.fromString("+")}if(n.kind==="minus"){return gi.fromString("-")}return gi.fromString("");case"TypeParameter":if(n.variance){s.push(A(e,r))}s.push(e.call(r,"name"));if(n.bound){s.push(e.call(r,"bound"))}if(n["default"]){s.push("=",e.call(r,"default"))}return gi.concat(s);case"TypeofTypeAnnotation":return gi.concat([gi.fromString("typeof ",t),e.call(r,"argument")]);case"UnionTypeAnnotation":return gi.fromString(" | ").join(e.map(r,"types"));case"VoidTypeAnnotation":return gi.fromString("void",t);case"NullTypeAnnotation":return gi.fromString("null",t);case"TSType":throw new Error("unprintable type: "+JSON.stringify(n.type));case"TSNumberKeyword":return gi.fromString("number",t);case"TSBigIntKeyword":return gi.fromString("bigint",t);case"TSObjectKeyword":return gi.fromString("object",t);case"TSBooleanKeyword":return gi.fromString("boolean",t);case"TSStringKeyword":return gi.fromString("string",t);case"TSSymbolKeyword":return gi.fromString("symbol",t);case"TSAnyKeyword":return gi.fromString("any",t);case"TSVoidKeyword":return gi.fromString("void",t);case"TSThisType":return gi.fromString("this",t);case"TSNullKeyword":return gi.fromString("null",t);case"TSUndefinedKeyword":return gi.fromString("undefined",t);case"TSUnknownKeyword":return gi.fromString("unknown",t);case"TSNeverKeyword":return gi.fromString("never",t);case"TSArrayType":return gi.concat([e.call(r,"elementType"),"[]"]);case"TSLiteralType":return e.call(r,"literal");case"TSUnionType":return gi.fromString(" | ").join(e.map(r,"types"));case"TSIntersectionType":return gi.fromString(" & ").join(e.map(r,"types"));case"TSConditionalType":s.push(e.call(r,"checkType")," extends ",e.call(r,"extendsType")," ? ",e.call(r,"trueType")," : ",e.call(r,"falseType"));return gi.concat(s);case"TSInferType":s.push("infer ",e.call(r,"typeParameter"));return gi.concat(s);case"TSParenthesizedType":return gi.concat(["(",e.call(r,"typeAnnotation"),")"]);case"TSFunctionType":case"TSConstructorType":return gi.concat([e.call(r,"typeParameters"),"(",D(e,t,r),")",e.call(r,"typeAnnotation")]);case"TSMappedType":{s.push(n.readonly?"readonly ":"","[",e.call(r,"typeParameter"),"]",n.optional?"?":"");if(n.typeAnnotation){s.push(": ",e.call(r,"typeAnnotation"),";")}return gi.concat(["{\n",gi.concat(s).indent(t.tabWidth),"\n}"])}case"TSTupleType":return gi.concat(["[",gi.fromString(", ").join(e.map(r,"elementTypes")),"]"]);case"TSRestType":return gi.concat(["...",e.call(r,"typeAnnotation"),"[]"]);case"TSOptionalType":return gi.concat([e.call(r,"typeAnnotation"),"?"]);case"TSIndexedAccessType":return gi.concat([e.call(r,"objectType"),"[",e.call(r,"indexType"),"]"]);case"TSTypeOperator":return gi.concat([e.call(r,"operator")," ",e.call(r,"typeAnnotation")]);case"TSTypeLiteral":{var he=gi.fromString(",\n").join(e.map(r,"members"));if(he.isEmpty()){return gi.fromString("{}",t)}s.push("{\n",he.indent(t.tabWidth),"\n}");return gi.concat(s)}case"TSEnumMember":s.push(e.call(r,"id"));if(n.initializer){s.push(" = ",e.call(r,"initializer"))}return gi.concat(s);case"TSTypeQuery":return gi.concat(["typeof ",e.call(r,"exprName")]);case"TSParameterProperty":if(n.accessibility){s.push(n.accessibility," ")}if(n.export){s.push("export ")}if(n.static){s.push("static ")}if(n.readonly){s.push("readonly ")}s.push(e.call(r,"parameter"));return gi.concat(s);case"TSTypeReference":return gi.concat([e.call(r,"typeName"),e.call(r,"typeParameters")]);case"TSQualifiedName":return gi.concat([e.call(r,"left"),".",e.call(r,"right")]);case"TSAsExpression":{var pe=n.extra&&n.extra.parenthesized===true;if(pe)s.push("(");s.push(e.call(r,"expression"),gi.fromString(" as "),e.call(r,"typeAnnotation"));if(pe)s.push(")");return gi.concat(s)}case"TSNonNullExpression":return gi.concat([e.call(r,"expression"),"!"]);case"TSTypeAnnotation":{var ue=e.getParentNode(0);var de=": ";if(a.TSFunctionType.check(ue)){de=" => "}if(a.TSTypePredicate.check(ue)){de=" is "}return gi.concat([de,e.call(r,"typeAnnotation")])}case"TSIndexSignature":return gi.concat([n.readonly?"readonly ":"","[",e.map(r,"parameters"),"]",e.call(r,"typeAnnotation")]);case"TSPropertySignature":s.push(A(e,r),n.readonly?"readonly ":"");if(n.computed){s.push("[",e.call(r,"key"),"]")}else{s.push(e.call(r,"key"))}s.push(n.optional?"?":"",e.call(r,"typeAnnotation"));return gi.concat(s);case"TSMethodSignature":if(n.computed){s.push("[",e.call(r,"key"),"]")}else{s.push(e.call(r,"key"))}if(n.optional){s.push("?")}s.push(e.call(r,"typeParameters"),"(",D(e,t,r),")",e.call(r,"typeAnnotation"));return gi.concat(s);case"TSTypePredicate":return gi.concat([e.call(r,"parameterName"),e.call(r,"typeAnnotation")]);case"TSCallSignatureDeclaration":return gi.concat([e.call(r,"typeParameters"),"(",D(e,t,r),")",e.call(r,"typeAnnotation")]);case"TSConstructSignatureDeclaration":if(n.typeParameters){s.push("new",e.call(r,"typeParameters"))}else{s.push("new ")}s.push("(",D(e,t,r),")",e.call(r,"typeAnnotation"));return gi.concat(s);case"TSTypeAliasDeclaration":return gi.concat([n.declare?"declare ":"","type ",e.call(r,"id"),e.call(r,"typeParameters")," = ",e.call(r,"typeAnnotation"),";"]);case"TSTypeParameter":s.push(e.call(r,"name"));var ue=e.getParentNode(0);var me=a.TSMappedType.check(ue);if(n.constraint){s.push(me?" in ":" extends ",e.call(r,"constraint"))}if(n["default"]){s.push(" = ",e.call(r,"default"))}return gi.concat(s);case"TSTypeAssertion":var pe=n.extra&&n.extra.parenthesized===true;if(pe){s.push("(")}s.push("<",e.call(r,"typeAnnotation"),"> ",e.call(r,"expression"));if(pe){s.push(")")}return gi.concat(s);case"TSTypeParameterDeclaration":case"TSTypeParameterInstantiation":return gi.concat(["<",gi.fromString(", ").join(e.map(r,"params")),">"]);case"TSEnumDeclaration":s.push(n.declare?"declare ":"",n.const?"const ":"","enum ",e.call(r,"id"));var ve=gi.fromString(",\n").join(e.map(r,"members"));if(ve.isEmpty()){s.push(" {}")}else{s.push(" {\n",ve.indent(t.tabWidth),"\n}")}return gi.concat(s);case"TSExpressionWithTypeArguments":return gi.concat([e.call(r,"expression"),e.call(r,"typeParameters")]);case"TSInterfaceBody":var ge=gi.fromString(";\n").join(e.map(r,"body"));if(ge.isEmpty()){return gi.fromString("{}",t)}return gi.concat(["{\n",ge.indent(t.tabWidth),";","\n}"]);case"TSImportType":s.push("import(",e.call(r,"argument"),")");if(n.qualifier){s.push(".",e.call(r,"qualifier"))}if(n.typeParameters){s.push(e.call(r,"typeParameters"))}return gi.concat(s);case"TSImportEqualsDeclaration":if(n.isExport){s.push("export ")}s.push("import ",e.call(r,"id")," = ",e.call(r,"moduleReference"));return M(gi.concat(s));case"TSExternalModuleReference":return gi.concat(["require(",e.call(r,"expression"),")"]);case"TSModuleDeclaration":{var ye=e.getParentNode();if(ye.type==="TSModuleDeclaration"){s.push(".")}else{if(n.declare){s.push("declare ")}if(!n.global){var xe=n.id.type==="StringLiteral"||n.id.type==="Literal"&&typeof n.id.value==="string";if(xe){s.push("module ")}else if(n.loc&&n.loc.lines&&n.id.loc){var Ee=n.loc.lines.sliceString(n.loc.start,n.id.loc.start);if(Ee.indexOf("module")>=0){s.push("module ")}else{s.push("namespace ")}}else{s.push("namespace ")}}}s.push(e.call(r,"id"));if(n.body&&n.body.type==="TSModuleDeclaration"){s.push(e.call(r,"body"))}else if(n.body){var be=e.call(r,"body");if(be.isEmpty()){s.push(" {}")}else{s.push(" {\n",be.indent(t.tabWidth),"\n}")}}return gi.concat(s)}case"TSModuleBlock":return e.call(function(e){return x(e,t,r)},"body");case"ClassHeritage":case"ComprehensionBlock":case"ComprehensionExpression":case"Glob":case"GeneratorExpression":case"LetStatement":case"LetExpression":case"GraphExpression":case"GraphIndexExpression":case"XMLDefaultDeclaration":case"XMLAnyName":case"XMLQualifiedIdentifier":case"XMLFunctionQualifiedIdentifier":case"XMLAttributeSelector":case"XMLFilterExpression":case"XML":case"XMLElement":case"XMLList":case"XMLEscape":case"XMLText":case"XMLStartTag":case"XMLEndTag":case"XMLPointTag":case"XMLName":case"XMLAttribute":case"XMLCdata":case"XMLComment":case"XMLProcessingInstruction":default:debugger;throw new Error("unknown type: "+JSON.stringify(n.type))}}function y(e,t){var r=[];var n=e.getValue();if(n.decorators&&n.decorators.length>0&&!c.getParentExportDeclaration(e)){e.each(function(e){r.push(t(e),"\n")},"decorators")}else if(c.isExportDeclaration(n)&&n.declaration&&n.declaration.decorators){e.each(function(e){r.push(t(e),"\n")},"declaration","decorators")}return gi.concat(r)}function x(e,t,r){var n=[];var s=false;var l=false;e.each(function(e){var t=e.getValue();if(!t){return}if(t.type==="EmptyStatement"&&!(t.comments&&t.comments.length>0)){return}if(a.Comment.check(t)){s=true}else if(a.Statement.check(t)){l=true}else{o.assert(t)}n.push({node:t,printed:r(e)})});if(s){i.default.strictEqual(l,false,"Comments may appear as statements in otherwise empty statement "+"lists, but may not coexist with non-Comment nodes.")}var u=null;var f=n.length;var h=[];n.forEach(function(e,r){var n=e.printed;var i=e.node;var s=n.length>1;var a=r>0;var o=r<f-1;var l;var p;var d=i&&i.loc&&i.loc.lines;var m=d&&t.reuseWhitespace&&c.getTrueLoc(i,d);if(a){if(m){var v=d.skipSpaces(m.start,true);var g=v?v.line:1;var y=m.start.line-g;l=Array(y+1).join("\n")}else{l=s?"\n\n":"\n"}}else{l=""}if(o){if(m){var x=d.skipSpaces(m.end);var b=x?x.line:d.length;var S=b-m.end.line;p=Array(S+1).join("\n")}else{p=s?"\n\n":"\n"}}else{p=""}h.push(E(u,l),n);if(o){u=p}else if(p){h.push(p)}});return gi.concat(h)}function E(e,t){if(!e&&!t){return gi.fromString("")}if(!e){return gi.fromString(t)}if(!t){return gi.fromString(e)}var r=gi.fromString(e);var n=gi.fromString(t);if(n.length>r.length){return n}return r}function b(e,t,r){var n=e.getNode();var i=n.kind;var s=[];var o=n.value;if(!a.FunctionExpression.check(o)){o=n}var l=n.accessibility||n.access;if(typeof l==="string"){s.push(l," ")}if(n.static){s.push("static ")}if(n.abstract){s.push("abstract ")}if(n.readonly){s.push("readonly ")}if(o.async){s.push("async ")}if(o.generator){s.push("*")}if(i==="get"||i==="set"){s.push(i," ")}var u=e.call(r,"key");if(n.computed){u=gi.concat(["[",u,"]"])}s.push(u);if(n.optional){s.push("?")}if(n===o){s.push(e.call(r,"typeParameters"),"(",D(e,t,r),")",e.call(r,"returnType"));if(n.body){s.push(" ",e.call(r,"body"))}else{s.push(";")}}else{s.push(e.call(r,"value","typeParameters"),"(",e.call(function(e){return D(e,t,r)},"value"),")",e.call(r,"value","returnType"));if(o.body){s.push(" ",e.call(r,"value","body"))}else{s.push(";")}}return gi.concat(s)}function S(e,t,r){var n=e.map(r,"arguments");var i=c.isTrailingCommaEnabled(t,"parameters");var s=gi.fromString(", ").join(n);if(s.getLineLength(1)>t.wrapColumn){s=gi.fromString(",\n").join(n);return gi.concat(["(\n",s.indent(t.tabWidth),i?",\n)":"\n)"])}return gi.concat(["(",s,")"])}function D(e,t,r){var n=e.getValue();if(n.params){var i=n.params;var s=e.map(r,"params")}else if(n.parameters){i=n.parameters;s=e.map(r,"parameters")}if(n.defaults){e.each(function(e){var t=e.getName();var n=s[t];if(n&&e.getValue()){s[t]=gi.concat([n," = ",r(e)])}},"defaults")}if(n.rest){s.push(gi.concat(["...",e.call(r,"rest")]))}var a=gi.fromString(", ").join(s);if(a.length>1||a.getLineLength(1)>t.wrapColumn){a=gi.fromString(",\n").join(s);if(c.isTrailingCommaEnabled(t,"parameters")&&!n.rest&&i[i.length-1].type!=="RestElement"){a=gi.concat([a,",\n"])}else{a=gi.concat([a,"\n"])}return gi.concat(["\n",a.indent(t.tabWidth)])}return a}function C(e,t,r){var n=e.getValue();var i=["export "];if(n.exportKind&&n.exportKind!=="value"){i.push(n.exportKind+" ")}var s=t.objectCurlySpacing;a.Declaration.assert(n);if(n["default"]||n.type==="ExportDefaultDeclaration"){i.push("default ")}if(n.declaration){i.push(e.call(r,"declaration"))}else if(n.specifiers){if(n.specifiers.length===1&&n.specifiers[0].type==="ExportBatchSpecifier"){i.push("*")}else if(n.specifiers.length===0){i.push("{}")}else if(n.specifiers[0].type==="ExportDefaultSpecifier"){var o=[];var l=[];e.each(function(e){var t=e.getValue();if(t.type==="ExportDefaultSpecifier"){o.push(r(e))}else{l.push(r(e))}},"specifiers");o.forEach(function(e,t){if(t>0){i.push(", ")}i.push(e)});if(l.length>0){var u=gi.fromString(", ").join(l);if(u.getLineLength(1)>t.wrapColumn){u=gi.concat([gi.fromString(",\n").join(l).indent(t.tabWidth),","])}if(o.length>0){i.push(", ")}if(u.length>1){i.push("{\n",u,"\n}")}else if(t.objectCurlySpacing){i.push("{ ",u," }")}else{i.push("{",u,"}")}}}else{i.push(s?"{ ":"{",gi.fromString(", ").join(e.map(r,"specifiers")),s?" }":"}")}if(n.source){i.push(" from ",e.call(r,"source"))}}var c=gi.concat(i);if(k(c)!==";"&&!(n.declaration&&(n.declaration.type==="FunctionDeclaration"||n.declaration.type==="ClassDeclaration"||n.declaration.type==="TSModuleDeclaration"||n.declaration.type==="TSInterfaceDeclaration"||n.declaration.type==="TSEnumDeclaration"))){c=gi.concat([c,";"])}return c}function w(e,t){var r=c.getParentExportDeclaration(e);if(r){i.default.strictEqual(r.type,"DeclareExportDeclaration")}else{t.unshift("declare ")}return gi.concat(t)}function A(e,t){return e.call(function(e){var r=e.getValue();if(r){if(r==="plus"){return gi.fromString("+")}if(r==="minus"){return gi.fromString("-")}return t(e)}return gi.fromString("")},"variance")}function T(e,t){if(e.length>1)return gi.concat([" ",e]);return gi.concat(["\n",M(e).indent(t.tabWidth)])}function k(e){var t=e.lastPos();do{var r=e.charAt(t);if(/\S/.test(r))return r}while(e.prevPos(t))}function _(e){return k(e)==="}"}function P(e){return e.replace(/['"]/g,function(e){return e==='"'?"'":'"'})}function F(e,t){o.assert(e);switch(t.quote){case"auto":var r=JSON.stringify(e);var n=P(JSON.stringify(P(e)));return r.length>n.length?n:r;case"single":return P(JSON.stringify(P(e)));case"double":default:return JSON.stringify(e)}}function M(e){var t=k(e);if(!t||"\n};".indexOf(t)<0)return gi.concat([e,";"]);return e}});o(Yi);var Qi=Yi.Printer;var Zi=l(function(e,r){var n=this&&this.__importDefault||function(e){return e&&e.__esModule?e:{default:e}};var i=this&&this.__importStar||function(e){if(e&&e.__esModule)return e;var t={};if(e!=null)for(var r in e)if(Object.hasOwnProperty.call(e,r))t[r]=e[r];t["default"]=e;return t};Object.defineProperty(r,"__esModule",{value:true});var s=n(t);var a=i(I);r.types=a;r.parse=Ji.parse;var o=I;r.visit=o.visit;function l(e,t){return new Yi.Printer(t).print(e)}r.print=l;function u(e,t){return new Yi.Printer(t).printGenerically(e)}r.prettyPrint=u;function c(e,t){return f(process.argv[2],e,t)}r.run=c;function f(e,t,r){s.default.readFile(e,"utf-8",function(e,n){if(e){console.error(e);return}p(n,t,r)})}function h(e){process.stdout.write(e)}function p(e,t,r){var n=r&&r.writeback||h;t(Ji.parse(e,r),function(e){n(l(e,r).code)})}});o(Zi);var es=Zi.types;var ts=Zi.parse;var rs=Zi.visit;var ns=Zi.print;var is=Zi.prettyPrint;var ss=Zi.run;const as=es;const os=es.builders;const ls=es.namedTypes;function us(){return os.literal(null)}function cs(e,t){return os.property("init",os.literal(e),t,false)}function fs(e){if(e&&e.toJSON)return e.toJSON();return e}function hs(){return typeof process!=="undefined"}function ps(e,t){if(hs()&&e&&t&&t.mappings){return zn(fs(e),fs(t))}else if(hs()&&e){return fs(e)}return{}}const ds="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");var ms=function e(t){if(0<=t&&t<ds.length){return ds[t]}throw new TypeError("Must be between 0 and 63: "+t)};var vs={encode:ms};const gs=5;const ys=1<<gs;const xs=ys-1;const Es=ys;function bs(e){return e<0?(-e<<1)+1:(e<<1)+0}var Ss=function e(t){let r="";let n;let i=bs(t);do{n=i&xs;i>>>=gs;if(i>0){n|=Es}r+=vs.encode(n)}while(i>0);return r};var Ds={encode:Ss};var Cs=l(function(e,t){function r(e,t,r){if(t in e){return e[t]}else if(arguments.length===3){return r}throw new Error('"'+t+'" is a required argument.')}t.getArg=r;const n=/^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;const i=/^data:.+\,.+$/;function s(e){const t=e.match(n);if(!t){return null}return{scheme:t[1],auth:t[2],host:t[3],port:t[4],path:t[5]}}t.urlParse=s;function a(e){let t="";if(e.scheme){t+=e.scheme+":"}t+="//";if(e.auth){t+=e.auth+"@"}if(e.host){t+=e.host}if(e.port){t+=":"+e.port}if(e.path){t+=e.path}return t}t.urlGenerate=a;const o=32;function l(e){const t=[];return function(r){for(let e=0;e<t.length;e++){if(t[e].input===r){const r=t[0];t[0]=t[e];t[e]=r;return t[0].result}}const n=e(r);t.unshift({input:r,result:n});if(t.length>o){t.pop()}return n}}const u=l(function e(r){let n=r;const i=s(r);if(i){if(!i.path){return r}n=i.path}const o=t.isAbsolute(n);const l=[];let u=0;let c=0;while(true){u=c;c=n.indexOf("/",u);if(c===-1){l.push(n.slice(u));break}else{l.push(n.slice(u,c));while(c<n.length&&n[c]==="/"){c++}}}let f=0;for(c=l.length-1;c>=0;c--){const e=l[c];if(e==="."){l.splice(c,1)}else if(e===".."){f++}else if(f>0){if(e===""){l.splice(c+1,f);f=0}else{l.splice(c,2);f--}}}n=l.join("/");if(n===""){n=o?"/":"."}if(i){i.path=n;return a(i)}return n});t.normalize=u;function c(e,t){if(e===""){e="."}if(t===""){t="."}const r=s(t);const n=s(e);if(n){e=n.path||"/"}if(r&&!r.scheme){if(n){r.scheme=n.scheme}return a(r)}if(r||t.match(i)){return t}if(n&&!n.host&&!n.path){n.host=t;return a(n)}const o=t.charAt(0)==="/"?t:u(e.replace(/\/+$/,"")+"/"+t);if(n){n.path=o;return a(n)}return o}t.join=c;t.isAbsolute=function(e){return e.charAt(0)==="/"||n.test(e)};function f(e,t){if(e===""){e="."}e=e.replace(/\/$/,"");let r=0;while(t.indexOf(e+"/")!==0){const n=e.lastIndexOf("/");if(n<0){return t}e=e.slice(0,n);if(e.match(/^([^\/]+:\/)?\/*$/)){return t}++r}return Array(r+1).join("../")+t.substr(e.length+1)}t.relative=f;const h=function(){const e=Object.create(null);return!("__proto__"in e)}();function p(e){return e}function d(e){if(v(e)){return"$"+e}return e}t.toSetString=h?p:d;function m(e){if(v(e)){return e.slice(1)}return e}t.fromSetString=h?p:m;function v(e){if(!e){return false}const t=e.length;if(t<9){return false}if(e.charCodeAt(t-1)!==95||e.charCodeAt(t-2)!==95||e.charCodeAt(t-3)!==111||e.charCodeAt(t-4)!==116||e.charCodeAt(t-5)!==111||e.charCodeAt(t-6)!==114||e.charCodeAt(t-7)!==112||e.charCodeAt(t-8)!==95||e.charCodeAt(t-9)!==95){return false}for(let r=t-10;r>=0;r--){if(e.charCodeAt(r)!==36){return false}}return true}function g(e,t,r){let n=x(e.source,t.source);if(n!==0){return n}n=e.originalLine-t.originalLine;if(n!==0){return n}n=e.originalColumn-t.originalColumn;if(n!==0||r){return n}n=e.generatedColumn-t.generatedColumn;if(n!==0){return n}n=e.generatedLine-t.generatedLine;if(n!==0){return n}return x(e.name,t.name)}t.compareByOriginalPositions=g;function y(e,t,r){let n=e.generatedLine-t.generatedLine;if(n!==0){return n}n=e.generatedColumn-t.generatedColumn;if(n!==0||r){return n}n=x(e.source,t.source);if(n!==0){return n}n=e.originalLine-t.originalLine;if(n!==0){return n}n=e.originalColumn-t.originalColumn;if(n!==0){return n}return x(e.name,t.name)}t.compareByGeneratedPositionsDeflated=y;function x(e,t){if(e===t){return 0}if(e===null){return 1}if(t===null){return-1}if(e>t){return 1}return-1}function E(e,t){let r=e.generatedLine-t.generatedLine;if(r!==0){return r}r=e.generatedColumn-t.generatedColumn;if(r!==0){return r}r=x(e.source,t.source);if(r!==0){return r}r=e.originalLine-t.originalLine;if(r!==0){return r}r=e.originalColumn-t.originalColumn;if(r!==0){return r}return x(e.name,t.name)}t.compareByGeneratedPositionsInflated=E;function b(e){return JSON.parse(e.replace(/^\)]}'[^\n]*\n/,""))}t.parseSourceMapInput=b;function S(e,t,r){t=t||"";if(e){if(e[e.length-1]!=="/"&&t[0]!=="/"){e+="/"}t=e+t}if(r){const e=s(r);if(!e){throw new Error("sourceMapURL could not be parsed")}if(e.path){const t=e.path.lastIndexOf("/");if(t>=0){e.path=e.path.substring(0,t+1)}}t=c(a(e),t)}return u(t)}t.computeSourceURL=S});var ws=Cs.getArg;var As=Cs.urlParse;var Ts=Cs.urlGenerate;var ks=Cs.normalize;var _s=Cs.join;var Ps=Cs.isAbsolute;var Fs=Cs.relative;var Is=Cs.toSetString;var Ms=Cs.fromSetString;var Ns=Cs.compareByOriginalPositions;var Ls=Cs.compareByGeneratedPositionsDeflated;var Bs=Cs.compareByGeneratedPositionsInflated;var Os=Cs.parseSourceMapInput;var Rs=Cs.computeSourceURL;class js{constructor(){this._array=[];this._set=new Map}static fromArray(e,t){const r=new js;for(let n=0,i=e.length;n<i;n++){r.add(e[n],t)}return r}size(){return this._set.size}add(e,t){const r=this.has(e);const n=this._array.length;if(!r||t){this._array.push(e)}if(!r){this._set.set(e,n)}}has(e){return this._set.has(e)}indexOf(e){const t=this._set.get(e);if(t>=0){return t}throw new Error('"'+e+'" is not in the set.')}at(e){if(e>=0&&e<this._array.length){return this._array[e]}throw new Error("No element indexed by "+e)}toArray(){return this._array.slice()}}var Us=js;var Vs={ArraySet:Us};function Gs(e,t){const r=e.generatedLine;const n=t.generatedLine;const i=e.generatedColumn;const s=t.generatedColumn;return n>r||n==r&&s>=i||Cs.compareByGeneratedPositionsInflated(e,t)<=0}class zs{constructor(){this._array=[];this._sorted=true;this._last={generatedLine:-1,generatedColumn:0}}unsortedForEach(e,t){this._array.forEach(e,t)}add(e){if(Gs(this._last,e)){this._last=e;this._array.push(e)}else{this._sorted=false;this._array.push(e)}}toArray(){if(!this._sorted){this._array.sort(Cs.compareByGeneratedPositionsInflated);this._sorted=true}return this._array}}var Xs=zs;var Js={MappingList:Xs};const qs=Vs.ArraySet;const Ws=Js.MappingList;class Hs{constructor(e){if(!e){e={}}this._file=Cs.getArg(e,"file",null);this._sourceRoot=Cs.getArg(e,"sourceRoot",null);this._skipValidation=Cs.getArg(e,"skipValidation",false);this._sources=new qs;this._names=new qs;this._mappings=new Ws;this._sourcesContents=null}static fromSourceMap(e){const t=e.sourceRoot;const r=new Hs({file:e.file,sourceRoot:t});e.eachMapping(function(e){const n={generated:{line:e.generatedLine,column:e.generatedColumn}};if(e.source!=null){n.source=e.source;if(t!=null){n.source=Cs.relative(t,n.source)}n.original={line:e.originalLine,column:e.originalColumn};if(e.name!=null){n.name=e.name}}r.addMapping(n)});e.sources.forEach(function(n){let i=n;if(t!==null){i=Cs.relative(t,n)}if(!r._sources.has(i)){r._sources.add(i)}const s=e.sourceContentFor(n);if(s!=null){r.setSourceContent(n,s)}});return r}addMapping(e){const t=Cs.getArg(e,"generated");const r=Cs.getArg(e,"original",null);let n=Cs.getArg(e,"source",null);let i=Cs.getArg(e,"name",null);if(!this._skipValidation){this._validateMapping(t,r,n,i)}if(n!=null){n=String(n);if(!this._sources.has(n)){this._sources.add(n)}}if(i!=null){i=String(i);if(!this._names.has(i)){this._names.add(i)}}this._mappings.add({generatedLine:t.line,generatedColumn:t.column,originalLine:r!=null&&r.line,originalColumn:r!=null&&r.column,source:n,name:i})}setSourceContent(e,t){let r=e;if(this._sourceRoot!=null){r=Cs.relative(this._sourceRoot,r)}if(t!=null){if(!this._sourcesContents){this._sourcesContents=Object.create(null)}this._sourcesContents[Cs.toSetString(r)]=t}else if(this._sourcesContents){delete this._sourcesContents[Cs.toSetString(r)];if(Object.keys(this._sourcesContents).length===0){this._sourcesContents=null}}}applySourceMap(e,t,r){let n=t;if(t==null){if(e.file==null){throw new Error("SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, "+'or the source map\'s "file" property. Both were omitted.')}n=e.file}const i=this._sourceRoot;if(i!=null){n=Cs.relative(i,n)}const s=this._mappings.toArray().length>0?new qs:this._sources;const a=new qs;this._mappings.unsortedForEach(function(t){if(t.source===n&&t.originalLine!=null){const n=e.originalPositionFor({line:t.originalLine,column:t.originalColumn});if(n.source!=null){t.source=n.source;if(r!=null){t.source=Cs.join(r,t.source)}if(i!=null){t.source=Cs.relative(i,t.source)}t.originalLine=n.line;t.originalColumn=n.column;if(n.name!=null){t.name=n.name}}}const o=t.source;if(o!=null&&!s.has(o)){s.add(o)}const l=t.name;if(l!=null&&!a.has(l)){a.add(l)}},this);this._sources=s;this._names=a;e.sources.forEach(function(t){const n=e.sourceContentFor(t);if(n!=null){if(r!=null){t=Cs.join(r,t)}if(i!=null){t=Cs.relative(i,t)}this.setSourceContent(t,n)}},this)}_validateMapping(e,t,r,n){if(t&&typeof t.line!=="number"&&typeof t.column!=="number"){throw new Error("original.line and original.column are not numbers -- you probably meant to omit "+"the original mapping entirely and only map the generated position. If so, pass "+"null for the original mapping instead of an object with empty or null values.")}if(e&&"line"in e&&"column"in e&&e.line>0&&e.column>=0&&!t&&!r&&!n);else if(e&&"line"in e&&"column"in e&&t&&"line"in t&&"column"in t&&e.line>0&&e.column>=0&&t.line>0&&t.column>=0&&r);else{throw new Error("Invalid mapping: "+JSON.stringify({generated:e,source:r,original:t,name:n}))}}_serializeMappings(){let e=0;let t=1;let r=0;let n=0;let i=0;let s=0;let a="";let o;let l;let u;let c;const f=this._mappings.toArray();for(let h=0,p=f.length;h<p;h++){l=f[h];o="";if(l.generatedLine!==t){e=0;while(l.generatedLine!==t){o+=";";t++}}else if(h>0){if(!Cs.compareByGeneratedPositionsInflated(l,f[h-1])){continue}o+=","}o+=Ds.encode(l.generatedColumn-e);e=l.generatedColumn;if(l.source!=null){c=this._sources.indexOf(l.source);o+=Ds.encode(c-s);s=c;o+=Ds.encode(l.originalLine-1-n);n=l.originalLine-1;o+=Ds.encode(l.originalColumn-r);r=l.originalColumn;if(l.name!=null){u=this._names.indexOf(l.name);o+=Ds.encode(u-i);i=u}}a+=o}return a}_generateSourcesContent(e,t){return e.map(function(e){if(!this._sourcesContents){return null}if(t!=null){e=Cs.relative(t,e)}const r=Cs.toSetString(e);return Object.prototype.hasOwnProperty.call(this._sourcesContents,r)?this._sourcesContents[r]:null},this)}toJSON(){const e={version:this._version,sources:this._sources.toArray(),names:this._names.toArray(),mappings:this._serializeMappings()};if(this._file!=null){e.file=this._file}if(this._sourceRoot!=null){e.sourceRoot=this._sourceRoot}if(this._sourcesContents){e.sourcesContent=this._generateSourcesContent(e.sources,e.sourceRoot)}return e}toString(){return JSON.stringify(this.toJSON())}}Hs.prototype._version=3;var Ks=Hs;var $s={SourceMapGenerator:Ks};var Ys=l(function(e,t){t.GREATEST_LOWER_BOUND=1;t.LEAST_UPPER_BOUND=2;function r(e,n,i,s,a,o){const l=Math.floor((n-e)/2)+e;const u=a(i,s[l],true);if(u===0){return l}else if(u>0){if(n-l>1){return r(l,n,i,s,a,o)}if(o==t.LEAST_UPPER_BOUND){return n<s.length?n:-1}return l}if(l-e>1){return r(e,l,i,s,a,o)}if(o==t.LEAST_UPPER_BOUND){return l}return e<0?-1:e}t.search=function e(n,i,s,a){if(i.length===0){return-1}let o=r(-1,i.length,n,i,s,a||t.GREATEST_LOWER_BOUND);if(o<0){return-1}while(o-1>=0){if(s(i[o],i[o-1],true)!==0){break}--o}return o}});var Qs=Ys.GREATEST_LOWER_BOUND;var Zs=Ys.LEAST_UPPER_BOUND;var ea=Ys.search;var ta=l(function(e){if(typeof fetch==="function"){let t=null;e.exports=function e(){if(typeof t!=="string"){throw new Error("You must provide the URL of lib/mappings.wasm by calling "+"SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) "+"before using SourceMapConsumer")}return fetch(t).then(e=>e.arrayBuffer())};e.exports.initialize=e=>t=e}else{const n=t;const i=r;e.exports=function e(){return new Promise((e,t)=>{const r=i.join(__dirname,"mappings.wasm");n.readFile(r,null,(r,n)=>{if(r){t(r);return}e(n.buffer)})})};e.exports.initialize=e=>{console.debug("SourceMapConsumer.initialize is a no-op when running in node.js")}}});var ra=ta.initialize;function na(){this.generatedLine=0;this.generatedColumn=0;this.lastGeneratedColumn=null;this.source=null;this.originalLine=null;this.originalColumn=null;this.name=null}let ia=null;var sa=function e(){if(ia){return ia}const t=[];ia=ta().then(e=>{return WebAssembly.instantiate(e,{env:{mapping_callback(e,r,n,i,s,a,o,l,u,c){const f=new na;f.generatedLine=e+1;f.generatedColumn=r;if(n){f.lastGeneratedColumn=i-1}if(s){f.source=a;f.originalLine=o+1;f.originalColumn=l;if(u){f.name=c}}t[t.length-1](f)},start_all_generated_locations_for(){console.time("all_generated_locations_for")},end_all_generated_locations_for(){console.timeEnd("all_generated_locations_for")},start_compute_column_spans(){console.time("compute_column_spans")},end_compute_column_spans(){console.timeEnd("compute_column_spans")},start_generated_location_for(){console.time("generated_location_for")},end_generated_location_for(){console.timeEnd("generated_location_for")},start_original_location_for(){console.time("original_location_for")},end_original_location_for(){console.timeEnd("original_location_for")},start_parse_mappings(){console.time("parse_mappings")},end_parse_mappings(){console.timeEnd("parse_mappings")},start_sort_by_generated_location(){console.time("sort_by_generated_location")},end_sort_by_generated_location(){console.timeEnd("sort_by_generated_location")},start_sort_by_original_location(){console.time("sort_by_original_location")},end_sort_by_original_location(){console.timeEnd("sort_by_original_location")}}})}).then(e=>{return{exports:e.instance.exports,withMappingCallback:(e,r)=>{t.push(e);try{r()}finally{t.pop()}}}}).then(null,e=>{ia=null;throw e});return ia};const aa=Vs.ArraySet;const oa=Symbol("smcInternal");class la{constructor(e,t){if(e==oa){return Promise.resolve(this)}return fa(e,t)}static initialize(e){ta.initialize(e["lib/mappings.wasm"])}static fromSourceMap(e,t){return ha(e,t)}static with(e,t,r){let n=null;const i=new la(e,t);return i.then(e=>{n=e;return r(e)}).then(e=>{if(n){n.destroy()}return e},e=>{if(n){n.destroy()}throw e})}_parseMappings(e,t){throw new Error("Subclasses must implement _parseMappings")}eachMapping(e,t,r){throw new Error("Subclasses must implement eachMapping")}allGeneratedPositionsFor(e){throw new Error("Subclasses must implement allGeneratedPositionsFor")}destroy(){throw new Error("Subclasses must implement destroy")}}la.prototype._version=3;la.GENERATED_ORDER=1;la.ORIGINAL_ORDER=2;la.GREATEST_LOWER_BOUND=1;la.LEAST_UPPER_BOUND=2;class ua extends la{constructor(e,t){return super(oa).then(r=>{let n=e;if(typeof e==="string"){n=Cs.parseSourceMapInput(e)}const i=Cs.getArg(n,"version");let s=Cs.getArg(n,"sources");const a=Cs.getArg(n,"names",[]);let o=Cs.getArg(n,"sourceRoot",null);const l=Cs.getArg(n,"sourcesContent",null);const u=Cs.getArg(n,"mappings");const c=Cs.getArg(n,"file",null);if(i!=r._version){throw new Error("Unsupported version: "+i)}if(o){o=Cs.normalize(o)}s=s.map(String).map(Cs.normalize).map(function(e){return o&&Cs.isAbsolute(o)&&Cs.isAbsolute(e)?Cs.relative(o,e):e});r._names=aa.fromArray(a.map(String),true);r._sources=aa.fromArray(s,true);r._absoluteSources=r._sources.toArray().map(function(e){return Cs.computeSourceURL(o,e,t)});r.sourceRoot=o;r.sourcesContent=l;r._mappings=u;r._sourceMapURL=t;r.file=c;r._computedColumnSpans=false;r._mappingsPtr=0;r._wasm=null;return sa().then(e=>{r._wasm=e;return r})})}_findSourceIndex(e){let t=e;if(this.sourceRoot!=null){t=Cs.relative(this.sourceRoot,t)}if(this._sources.has(t)){return this._sources.indexOf(t)}for(let t=0;t<this._absoluteSources.length;++t){if(this._absoluteSources[t]==e){return t}}return-1}static fromSourceMap(e,t){return new ua(e.toString())}get sources(){return this._absoluteSources.slice()}_getMappingsPtr(){if(this._mappingsPtr===0){this._parseMappings(this._mappings,this.sourceRoot)}return this._mappingsPtr}_parseMappings(e,t){const r=e.length;const n=this._wasm.exports.allocate_mappings(r);const i=new Uint8Array(this._wasm.exports.memory.buffer,n,r);for(let t=0;t<r;t++){i[t]=e.charCodeAt(t)}const s=this._wasm.exports.parse_mappings(n);if(!s){const e=this._wasm.exports.get_last_error();let t=`Error parsing mappings (code ${e}): `;switch(e){case 1:t+="the mappings contained a negative line, column, source index, or name index";break;case 2:t+="the mappings contained a number larger than 2**32";break;case 3:t+="reached EOF while in the middle of parsing a VLQ";break;case 4:t+="invalid base 64 character while parsing a VLQ";break;default:t+="unknown error code";break}throw new Error(t)}this._mappingsPtr=s}eachMapping(e,t,r){const n=t||null;const i=r||la.GENERATED_ORDER;const s=this.sourceRoot;this._wasm.withMappingCallback(t=>{if(t.source!==null){t.source=this._sources.at(t.source);t.source=Cs.computeSourceURL(s,t.source,this._sourceMapURL);if(t.name!==null){t.name=this._names.at(t.name)}}e.call(n,t)},()=>{switch(i){case la.GENERATED_ORDER:this._wasm.exports.by_generated_location(this._getMappingsPtr());break;case la.ORIGINAL_ORDER:this._wasm.exports.by_original_location(this._getMappingsPtr());break;default:throw new Error("Unknown order of iteration.")}})}allGeneratedPositionsFor(e){let t=Cs.getArg(e,"source");const r=Cs.getArg(e,"line");const n=e.column||0;t=this._findSourceIndex(t);if(t<0){return[]}if(r<1){throw new Error("Line numbers must be >= 1")}if(n<0){throw new Error("Column numbers must be >= 0")}const i=[];this._wasm.withMappingCallback(e=>{let t=e.lastGeneratedColumn;if(this._computedColumnSpans&&t===null){t=Infinity}i.push({line:e.generatedLine,column:e.generatedColumn,lastColumn:t})},()=>{this._wasm.exports.all_generated_locations_for(this._getMappingsPtr(),t,r-1,"column"in e,n)});return i}destroy(){if(this._mappingsPtr!==0){this._wasm.exports.free_mappings(this._mappingsPtr);this._mappingsPtr=0}}computeColumnSpans(){if(this._computedColumnSpans){return}this._wasm.exports.compute_column_spans(this._getMappingsPtr());this._computedColumnSpans=true}originalPositionFor(e){const t={generatedLine:Cs.getArg(e,"line"),generatedColumn:Cs.getArg(e,"column")};if(t.generatedLine<1){throw new Error("Line numbers must be >= 1")}if(t.generatedColumn<0){throw new Error("Column numbers must be >= 0")}let r=Cs.getArg(e,"bias",la.GREATEST_LOWER_BOUND);if(r==null){r=la.GREATEST_LOWER_BOUND}let n;this._wasm.withMappingCallback(e=>n=e,()=>{this._wasm.exports.original_location_for(this._getMappingsPtr(),t.generatedLine-1,t.generatedColumn,r)});if(n){if(n.generatedLine===t.generatedLine){let e=Cs.getArg(n,"source",null);if(e!==null){e=this._sources.at(e);e=Cs.computeSourceURL(this.sourceRoot,e,this._sourceMapURL)}let t=Cs.getArg(n,"name",null);if(t!==null){t=this._names.at(t)}return{source:e,line:Cs.getArg(n,"originalLine",null),column:Cs.getArg(n,"originalColumn",null),name:t}}}return{source:null,line:null,column:null,name:null}}hasContentsOfAllSources(){if(!this.sourcesContent){return false}return this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(e){return e==null})}sourceContentFor(e,t){if(!this.sourcesContent){return null}const r=this._findSourceIndex(e);if(r>=0){return this.sourcesContent[r]}let n=e;if(this.sourceRoot!=null){n=Cs.relative(this.sourceRoot,n)}let i;if(this.sourceRoot!=null&&(i=Cs.urlParse(this.sourceRoot))){const e=n.replace(/^file:\/\//,"");if(i.scheme=="file"&&this._sources.has(e)){return this.sourcesContent[this._sources.indexOf(e)]}if((!i.path||i.path=="/")&&this._sources.has("/"+n)){return this.sourcesContent[this._sources.indexOf("/"+n)]}}if(t){return null}throw new Error('"'+n+'" is not in the SourceMap.')}generatedPositionFor(e){let t=Cs.getArg(e,"source");t=this._findSourceIndex(t);if(t<0){return{line:null,column:null,lastColumn:null}}const r={source:t,originalLine:Cs.getArg(e,"line"),originalColumn:Cs.getArg(e,"column")};if(r.originalLine<1){throw new Error("Line numbers must be >= 1")}if(r.originalColumn<0){throw new Error("Column numbers must be >= 0")}let n=Cs.getArg(e,"bias",la.GREATEST_LOWER_BOUND);if(n==null){n=la.GREATEST_LOWER_BOUND}let i;this._wasm.withMappingCallback(e=>i=e,()=>{this._wasm.exports.generated_location_for(this._getMappingsPtr(),r.source,r.originalLine-1,r.originalColumn,n)});if(i){if(i.source===r.source){let e=i.lastGeneratedColumn;if(this._computedColumnSpans&&e===null){e=Infinity}return{line:Cs.getArg(i,"generatedLine",null),column:Cs.getArg(i,"generatedColumn",null),lastColumn:e}}}return{line:null,column:null,lastColumn:null}}}ua.prototype.consumer=la;class ca extends la{constructor(e,t){return super(oa).then(r=>{let n=e;if(typeof e==="string"){n=Cs.parseSourceMapInput(e)}const i=Cs.getArg(n,"version");const s=Cs.getArg(n,"sections");if(i!=r._version){throw new Error("Unsupported version: "+i)}r._sources=new aa;r._names=new aa;r.__generatedMappings=null;r.__originalMappings=null;r.__generatedMappingsUnsorted=null;r.__originalMappingsUnsorted=null;let a={line:-1,column:0};return Promise.all(s.map(e=>{if(e.url){throw new Error("Support for url field in sections not implemented.")}const r=Cs.getArg(e,"offset");const n=Cs.getArg(r,"line");const i=Cs.getArg(r,"column");if(n<a.line||n===a.line&&i<a.column){throw new Error("Section offsets must be ordered and non-overlapping.")}a=r;const s=new la(Cs.getArg(e,"map"),t);return s.then(e=>{return{generatedOffset:{generatedLine:n+1,generatedColumn:i+1},consumer:e}})})).then(e=>{r._sections=e;return r})})}get _generatedMappings(){if(!this.__generatedMappings){this._sortGeneratedMappings()}return this.__generatedMappings}get _originalMappings(){if(!this.__originalMappings){this._sortOriginalMappings()}return this.__originalMappings}get _generatedMappingsUnsorted(){if(!this.__generatedMappingsUnsorted){this._parseMappings(this._mappings,this.sourceRoot)}return this.__generatedMappingsUnsorted}get _originalMappingsUnsorted(){if(!this.__originalMappingsUnsorted){this._parseMappings(this._mappings,this.sourceRoot)}return this.__originalMappingsUnsorted}_sortGeneratedMappings(){const e=this._generatedMappingsUnsorted;e.sort(Cs.compareByGeneratedPositionsDeflated);this.__generatedMappings=e}_sortOriginalMappings(){const e=this._originalMappingsUnsorted;e.sort(Cs.compareByOriginalPositions);this.__originalMappings=e}get sources(){const e=[];for(let t=0;t<this._sections.length;t++){for(let r=0;r<this._sections[t].consumer.sources.length;r++){e.push(this._sections[t].consumer.sources[r])}}return e}originalPositionFor(e){const t={generatedLine:Cs.getArg(e,"line"),generatedColumn:Cs.getArg(e,"column")};const r=Ys.search(t,this._sections,function(e,t){const r=e.generatedLine-t.generatedOffset.generatedLine;if(r){return r}return e.generatedColumn-t.generatedOffset.generatedColumn});const n=this._sections[r];if(!n){return{source:null,line:null,column:null,name:null}}return n.consumer.originalPositionFor({line:t.generatedLine-(n.generatedOffset.generatedLine-1),column:t.generatedColumn-(n.generatedOffset.generatedLine===t.generatedLine?n.generatedOffset.generatedColumn-1:0),bias:e.bias})}hasContentsOfAllSources(){return this._sections.every(function(e){return e.consumer.hasContentsOfAllSources()})}sourceContentFor(e,t){for(let t=0;t<this._sections.length;t++){const r=this._sections[t];const n=r.consumer.sourceContentFor(e,true);if(n){return n}}if(t){return null}throw new Error('"'+e+'" is not in the SourceMap.')}generatedPositionFor(e){for(let t=0;t<this._sections.length;t++){const r=this._sections[t];if(r.consumer._findSourceIndex(Cs.getArg(e,"source"))===-1){continue}const n=r.consumer.generatedPositionFor(e);if(n){const e={line:n.line+(r.generatedOffset.generatedLine-1),column:n.column+(r.generatedOffset.generatedLine===n.line?r.generatedOffset.generatedColumn-1:0)};return e}}return{line:null,column:null}}_parseMappings(e,t){const r=this.__generatedMappingsUnsorted=[];const n=this.__originalMappingsUnsorted=[];for(let e=0;e<this._sections.length;e++){const t=this._sections[e];const i=[];t.consumer.eachMapping(e=>i.push(e));for(let e=0;e<i.length;e++){const s=i[e];let a=Cs.computeSourceURL(t.consumer.sourceRoot,null,this._sourceMapURL);this._sources.add(a);a=this._sources.indexOf(a);let o=null;if(s.name){this._names.add(s.name);o=this._names.indexOf(s.name)}const l={source:a,generatedLine:s.generatedLine+(t.generatedOffset.generatedLine-1),generatedColumn:s.generatedColumn+(t.generatedOffset.generatedLine===s.generatedLine?t.generatedOffset.generatedColumn-1:0),originalLine:s.originalLine,originalColumn:s.originalColumn,name:o};r.push(l);if(typeof l.originalLine==="number"){n.push(l)}}}}eachMapping(e,t,r){const n=t||null;const i=r||la.GENERATED_ORDER;let s;switch(i){case la.GENERATED_ORDER:s=this._generatedMappings;break;case la.ORIGINAL_ORDER:s=this._originalMappings;break;default:throw new Error("Unknown order of iteration.")}const a=this.sourceRoot;s.map(function(e){let t=null;if(e.source!==null){t=this._sources.at(e.source);t=Cs.computeSourceURL(a,t,this._sourceMapURL)}return{source:t,generatedLine:e.generatedLine,generatedColumn:e.generatedColumn,originalLine:e.originalLine,originalColumn:e.originalColumn,name:e.name===null?null:this._names.at(e.name)}},this).forEach(e,n)}_findMapping(e,t,r,n,i,s){if(e[r]<=0){throw new TypeError("Line must be greater than or equal to 1, got "+e[r])}if(e[n]<0){throw new TypeError("Column must be greater than or equal to 0, got "+e[n])}return Ys.search(e,t,i,s)}allGeneratedPositionsFor(e){const t=Cs.getArg(e,"line");const r={source:Cs.getArg(e,"source"),originalLine:t,originalColumn:Cs.getArg(e,"column",0)};r.source=this._findSourceIndex(r.source);if(r.source<0){return[]}if(r.originalLine<1){throw new Error("Line numbers must be >= 1")}if(r.originalColumn<0){throw new Error("Column numbers must be >= 0")}const n=[];let i=this._findMapping(r,this._originalMappings,"originalLine","originalColumn",Cs.compareByOriginalPositions,Ys.LEAST_UPPER_BOUND);if(i>=0){let r=this._originalMappings[i];if(e.column===undefined){const e=r.originalLine;while(r&&r.originalLine===e){let e=r.lastGeneratedColumn;if(this._computedColumnSpans&&e===null){e=Infinity}n.push({line:Cs.getArg(r,"generatedLine",null),column:Cs.getArg(r,"generatedColumn",null),lastColumn:e});r=this._originalMappings[++i]}}else{const e=r.originalColumn;while(r&&r.originalLine===t&&r.originalColumn==e){let e=r.lastGeneratedColumn;if(this._computedColumnSpans&&e===null){e=Infinity}n.push({line:Cs.getArg(r,"generatedLine",null),column:Cs.getArg(r,"generatedColumn",null),lastColumn:e});r=this._originalMappings[++i]}}}return n}destroy(){for(let e=0;e<this._sections.length;e++){this._sections[e].consumer.destroy()}}}function fa(e,t){let r=e;if(typeof e==="string"){r=Cs.parseSourceMapInput(e)}const n=r.sections!=null?new ca(r,t):new ua(r,t);return Promise.resolve(n)}function ha(e,t){return ua.fromSourceMap(e,t)}var pa=$s.SourceMapGenerator;function da(e){return new pa(e)}const ma=Object.freeze({code:"",ast:[],meta:{},map:null});function va(e,t){const r=Object.assign({},ma,{},e,{meta:t});if(!r.map&&t&&t.options&&t.options.file)return Object.assign({},r,{map:da({file:t.options.file})});return r}function ga(e,t,r){const n=e?e(r,t):{code:r};return va(n,t)}function ya(e){throw new Error(e)}const xa=new Set;function Ea(e){if(xa.has(e)){ya(`This postprocessor "${e.name||e.toString()}" was already registered`)}xa.add(e);return xa}function ba(e,t){return Array.from(xa).reduce(function(e,r){const{code:n,map:i}=e;const s=r(n,t);return{code:s.code,map:ps(i,s.map)}},va(e,t))}const Sa=Object.freeze({javascript:new Map,css:new Map,template:(new Map).set("default",e=>({code:e}))});function Da(e){ya(`No preprocessor of type "${e}" was found, please make sure to use one of these: 'javascript', 'css' or 'template'`)}function Ca(e){ya(`No preprocessor named "${e}" was found, are you sure you have registered it?'`)}function wa(e,t,r){if(!e)ya("Please define the type of preprocessor you want to register 'javascript', 'css' or 'template'");if(!t)ya("Please define a name for your preprocessor");if(!r)ya("Please provide a preprocessor function");if(!Sa[e])Da(e);if(Sa[e].has(t))ya(`The preprocessor ${t} was already registered before`);Sa[e].set(t,r);return Sa}function Aa(e,t,r,n){if(!Sa[e])Da(e);if(!Sa[e].has(t))Ca(t);return ga(Sa[e].get(t),r,n)}function Ta(){for(var e=arguments.length,t=new Array(e),r=0;r<e;r++){t[r]=arguments[r]}return t.reduce((e,t)=>(function(){return e(t(...arguments))}))}var ka={};var _a=ka.hasOwnProperty;var Pa=function e(t,r){if(!t){return r}var n={};for(var i in r){n[i]=_a.call(t,i)?t[i]:r[i]}return n};var Fa=/[ -,\.\/:-@\[-\^`\{-~]/;var Ia=/[ -,\.\/:-@\[\]\^`\{-~]/;var Ma=/(^|\\+)?(\\[A-F0-9]{1,6})\x20(?![a-fA-F0-9\x20])/g;var Na=function e(t,r){r=Pa(r,e.options);if(r.quotes!="single"&&r.quotes!="double"){r.quotes="single"}var n=r.quotes=="double"?'"':"'";var i=r.isIdentifier;var s=t.charAt(0);var a="";var o=0;var l=t.length;while(o<l){var u=t.charAt(o++);var c=u.charCodeAt();var f=void 0;if(c<32||c>126){if(c>=55296&&c<=56319&&o<l){var h=t.charCodeAt(o++);if((h&64512)==56320){c=((c&1023)<<10)+(h&1023)+65536}else{o--}}f="\\"+c.toString(16).toUpperCase()+" "}else{if(r.escapeEverything){if(Fa.test(u)){f="\\"+u}else{f="\\"+c.toString(16).toUpperCase()+" "}}else if(/[\t\n\f\r\x0B]/.test(u)){f="\\"+c.toString(16).toUpperCase()+" "}else if(u=="\\"||!i&&(u=='"'&&n==u||u=="'"&&n==u)||i&&Ia.test(u)){f="\\"+u}else{f=u}}a+=f}if(i){if(/^-[-\d]/.test(a)){a="\\-"+a.slice(1)}else if(/\d/.test(s)){a="\\3"+s+" "+a.slice(1)}}a=a.replace(Ma,function(e,t,r){if(t&&t.length%2){return e}return(t||"")+r});if(!i&&r.wrap){return n+a+n}return a};Na.options={escapeEverything:false,isIdentifier:false,quotes:"single",wrap:false};Na.version="3.0.0";var La=Na;const Ba="type";function Oa(e){const t=e.attributes?e.attributes.find(e=>e.name===Ba):null;return t?Ra(t.value):null}function Ra(e){return e.replace("text/","")}function ja(e,t,r,n){const i=n.text;return t?Aa(e,t,r,i):{code:i}}const Ua=/\/\*[^*]*\*+(?:[^*\/][^*]*\*+)*\//g;const Va=/"[^"\n\\]*(?:\\[\S\s][^"\n\\]*)*"|'[^'\n\\]*(?:\\[\S\s][^'\n\\]*)*'/.source;const Ga=RegExp(`([{}]|^)[; ]*((?:[^@ ;{}][^{}]*)?[^@ ;{}:] ?)(?={)|${Va}`,"g");function za(e,t){const r=":host";const n=["from","to"];return t.replace(Ga,function(t,i,s){if(!s)return t;s=s.replace(/[^,]+/g,function(t){const i=t.trim();if(i.indexOf(e)===0){return t}if(!i||n.indexOf(i)>-1||i.slice(-1)==="%"){return t}if(i.indexOf(r)<0){return`${e} ${i},[is="${e}"] ${i}`}else{return`${i.replace(r,e)},${i.replace(r,`[is="${e}"]`)}`}});return i?`${i} ${s}`:s})}function Xa(e){return e.replace(Ua,"").replace(/\s+/g," ").trim()}const Ja=e=>e.replace(/\\/g,"\\\\");const qa=e=>Ja(La(e,{isIdentifier:true}));function Wa(e,t,r,n){const s=Oa(e);const{options:a}=r;const o=ja("css",s,r,e.text);const l=Xa(o.code);const u=qa(r.tagName);const c=(a.scopedCss?za(u,Ja(l)):Ja(l)).trim();as.visit(n,{visitProperty(e){if(e.value.key.value===i){e.value.value=os.templateLiteral([os.templateElement({raw:c,cooked:""},false)],[]);return false}this.traverse(e)}});return n}function Ha(e){for(var t=arguments.length,r=new Array(t>1?t-1:0),n=1;n<t;n++){r[n-1]=arguments[n]}return function(){for(var t=arguments.length,n=new Array(t),i=0;i<t;i++){n[i]=arguments[i]}n=[...r,...n];return n.length<e.length?Ha(e,...n):e(...n)}}function Ka(e,t){return ns(e,Object.assign({},t,{tabWidth:2,quote:"single"}))}function $a(e){return!e||!e.mappings||!e.mappings.length}const Ya=/\r\n?|\n/g;function Qa(e){return e.split(Ya)}function Za(e,t){const r=Qa(e.slice(0,t));return{line:r.length,column:r[r.length-1].length}}function eo(e,t,r){const{column:n,line:i}=Za(t,r.start);return`${"\n".repeat(i-1)}${" ".repeat(n+1)}${e}`}var to={3:"abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile",5:"class enum extends super const export import",6:"enum",strict:"implements interface let package private protected public static yield",strictBind:"eval arguments"};var ro="break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this";var no={5:ro,"5module":ro+" export import",6:ro+" const class extends export import super"};var io=/^in(stanceof)?$/;var so="ªµºÀ-ÖØ-öø-ˁˆ-ˑˠ-ˤˬˮͰ-ʹͶͷͺ-ͽͿΆΈ-ΊΌΎ-ΡΣ-ϵϷ-ҁҊ-ԯԱ-Ֆՙՠ-ֈא-תׯ-ײؠ-يٮٯٱ-ۓەۥۦۮۯۺ-ۼۿܐܒ-ܯݍ-ޥޱߊ-ߪߴߵߺࠀ-ࠕࠚࠤࠨࡀ-ࡘࡠ-ࡪࢠ-ࢴࢶ-ࢽऄ-हऽॐक़-ॡॱ-ঀঅ-ঌএঐও-নপ-রলশ-হঽৎড়ঢ়য়-ৡৰৱৼਅ-ਊਏਐਓ-ਨਪ-ਰਲਲ਼ਵਸ਼ਸਹਖ਼-ੜਫ਼ੲ-ੴઅ-ઍએ-ઑઓ-નપ-રલળવ-હઽૐૠૡૹଅ-ଌଏଐଓ-ନପ-ରଲଳଵ-ହଽଡ଼ଢ଼ୟ-ୡୱஃஅ-ஊஎ-ஐஒ-கஙசஜஞடணதந-பம-ஹௐఅ-ఌఎ-ఐఒ-నప-హఽౘ-ౚౠౡಀಅ-ಌಎ-ಐಒ-ನಪ-ಳವ-ಹಽೞೠೡೱೲഅ-ഌഎ-ഐഒ-ഺഽൎൔ-ൖൟ-ൡൺ-ൿඅ-ඖක-නඳ-රලව-ෆก-ะาำเ-ๆກຂຄຆ-ຊຌ-ຣລວ-ະາຳຽເ-ໄໆໜ-ໟༀཀ-ཇཉ-ཬྈ-ྌက-ဪဿၐ-ၕၚ-ၝၡၥၦၮ-ၰၵ-ႁႎႠ-ჅჇჍა-ჺჼ-ቈቊ-ቍቐ-ቖቘቚ-ቝበ-ኈኊ-ኍነ-ኰኲ-ኵኸ-ኾዀዂ-ዅወ-ዖዘ-ጐጒ-ጕጘ-ፚᎀ-ᎏᎠ-Ᏽᏸ-ᏽᐁ-ᙬᙯ-ᙿᚁ-ᚚᚠ-ᛪᛮ-ᛸᜀ-ᜌᜎ-ᜑᜠ-ᜱᝀ-ᝑᝠ-ᝬᝮ-ᝰក-ឳៗៜᠠ-ᡸᢀ-ᢨᢪᢰ-ᣵᤀ-ᤞᥐ-ᥭᥰ-ᥴᦀ-ᦫᦰ-ᧉᨀ-ᨖᨠ-ᩔᪧᬅ-ᬳᭅ-ᭋᮃ-ᮠᮮᮯᮺ-ᯥᰀ-ᰣᱍ-ᱏᱚ-ᱽᲀ-ᲈᲐ-ᲺᲽ-Ჿᳩ-ᳬᳮ-ᳳᳵᳶᳺᴀ-ᶿḀ-ἕἘ-Ἕἠ-ὅὈ-Ὅὐ-ὗὙὛὝὟ-ώᾀ-ᾴᾶ-ᾼιῂ-ῄῆ-ῌῐ-ΐῖ-Ίῠ-Ῥῲ-ῴῶ-ῼⁱⁿₐ-ₜℂℇℊ-ℓℕ℘-ℝℤΩℨK-ℹℼ-ℿⅅ-ⅉⅎⅠ-ↈⰀ-Ⱞⰰ-ⱞⱠ-ⳤⳫ-ⳮⳲⳳⴀ-ⴥⴧⴭⴰ-ⵧⵯⶀ-ⶖⶠ-ⶦⶨ-ⶮⶰ-ⶶⶸ-ⶾⷀ-ⷆⷈ-ⷎⷐ-ⷖⷘ-ⷞ々-〇〡-〩〱-〵〸-〼ぁ-ゖ゛-ゟァ-ヺー-ヿㄅ-ㄯㄱ-ㆎㆠ-ㆺㇰ-ㇿ㐀-䶵一-鿯ꀀ-ꒌꓐ-ꓽꔀ-ꘌꘐ-ꘟꘪꘫꙀ-ꙮꙿ-ꚝꚠ-ꛯꜗ-ꜟꜢ-ꞈꞋ-ꞿꟂ-Ᶎꟷ-ꠁꠃ-ꠅꠇ-ꠊꠌ-ꠢꡀ-ꡳꢂ-ꢳꣲ-ꣷꣻꣽꣾꤊ-ꤥꤰ-ꥆꥠ-ꥼꦄ-ꦲꧏꧠ-ꧤꧦ-ꧯꧺ-ꧾꨀ-ꨨꩀ-ꩂꩄ-ꩋꩠ-ꩶꩺꩾ-ꪯꪱꪵꪶꪹ-ꪽꫀꫂꫛ-ꫝꫠ-ꫪꫲ-ꫴꬁ-ꬆꬉ-ꬎꬑ-ꬖꬠ-ꬦꬨ-ꬮꬰ-ꭚꭜ-ꭧꭰ-ꯢ가-힣ힰ-ퟆퟋ-ퟻ豈-舘並-龎ff-stﬓ-ﬗיִײַ-ﬨשׁ-זּטּ-לּמּנּסּףּפּצּ-ﮱﯓ-ﴽﵐ-ﶏﶒ-ﷇﷰ-ﷻﹰ-ﹴﹶ-ﻼＡ-Ｚａ-ｚｦ-ﾾￂ-ￇￊ-ￏￒ-ￗￚ-ￜ";var ao="‌‍·̀-ͯ·҃-֑҇-ׇֽֿׁׂׅׄؐ-ًؚ-٩ٰۖ-ۜ۟-۪ۤۧۨ-ۭ۰-۹ܑܰ-݊ަ-ް߀-߉߫-߽߳ࠖ-࠙ࠛ-ࠣࠥ-ࠧࠩ-࡙࠭-࡛࣓-ࣣ࣡-ःऺ-़ा-ॏ॑-ॗॢॣ०-९ঁ-ঃ়া-ৄেৈো-্ৗৢৣ০-৯৾ਁ-ਃ਼ਾ-ੂੇੈੋ-੍ੑ੦-ੱੵઁ-ઃ઼ા-ૅે-ૉો-્ૢૣ૦-૯ૺ-૿ଁ-ଃ଼ା-ୄେୈୋ-୍ୖୗୢୣ୦-୯ஂா-ூெ-ைொ-்ௗ௦-௯ఀ-ఄా-ౄె-ైొ-్ౕౖౢౣ౦-౯ಁ-ಃ಼ಾ-ೄೆ-ೈೊ-್ೕೖೢೣ೦-೯ഀ-ഃ഻഼ാ-ൄെ-ൈൊ-്ൗൢൣ൦-൯ංඃ්ා-ුූෘ-ෟ෦-෯ෲෳัิ-ฺ็-๎๐-๙ັິ-ຼ່-ໍ໐-໙༘༙༠-༩༹༵༷༾༿ཱ-྄྆྇ྍ-ྗྙ-ྼ࿆ါ-ှ၀-၉ၖ-ၙၞ-ၠၢ-ၤၧ-ၭၱ-ၴႂ-ႍႏ-ႝ፝-፟፩-፱ᜒ-᜔ᜲ-᜴ᝒᝓᝲᝳ឴-៓៝០-៩᠋-᠍᠐-᠙ᢩᤠ-ᤫᤰ-᤻᥆-᥏᧐-᧚ᨗ-ᨛᩕ-ᩞ᩠-᩿᩼-᪉᪐-᪙᪰-᪽ᬀ-ᬄ᬴-᭄᭐-᭙᭫-᭳ᮀ-ᮂᮡ-ᮭ᮰-᮹᯦-᯳ᰤ-᰷᱀-᱉᱐-᱙᳐-᳔᳒-᳨᳭᳴᳷-᳹᷀-᷹᷻-᷿‿⁀⁔⃐-⃥⃜⃡-⃰⳯-⵿⳱ⷠ-〪ⷿ-゙゚〯꘠-꘩꙯ꙴ-꙽ꚞꚟ꛰꛱ꠂ꠆ꠋꠣ-ꠧꢀꢁꢴ-ꣅ꣐-꣙꣠-꣱ꣿ-꤉ꤦ-꤭ꥇ-꥓ꦀ-ꦃ꦳-꧀꧐-꧙ꧥ꧰-꧹ꨩ-ꨶꩃꩌꩍ꩐-꩙ꩻ-ꩽꪰꪲ-ꪴꪷꪸꪾ꪿꫁ꫫ-ꫯꫵ꫶ꯣ-ꯪ꯬꯭꯰-꯹ﬞ︀-️︠-︯︳︴﹍-﹏０-９＿";var oo=new RegExp("["+so+"]");var lo=new RegExp("["+so+ao+"]");so=ao=null;var uo=[0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,477,28,11,0,9,21,155,22,13,52,76,44,33,24,27,35,30,0,12,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,0,33,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,0,161,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,270,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,754,9486,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,15,7472,3104,541];var co=[509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,525,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,4,9,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,232,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,792487,239];function fo(e,t){var r=65536;for(var n=0;n<t.length;n+=2){r+=t[n];if(r>e){return false}r+=t[n+1];if(r>=e){return true}}}function ho(e,t){if(e<65){return e===36}if(e<91){return true}if(e<97){return e===95}if(e<123){return true}if(e<=65535){return e>=170&&oo.test(String.fromCharCode(e))}if(t===false){return false}return fo(e,uo)}function po(e,t){if(e<48){return e===36}if(e<58){return true}if(e<65){return false}if(e<91){return true}if(e<97){return e===95}if(e<123){return true}if(e<=65535){return e>=170&&lo.test(String.fromCharCode(e))}if(t===false){return false}return fo(e,uo)||fo(e,co)}var mo=function e(t,r){if(r===void 0)r={};this.label=t;this.keyword=r.keyword;this.beforeExpr=!!r.beforeExpr;this.startsExpr=!!r.startsExpr;this.isLoop=!!r.isLoop;this.isAssign=!!r.isAssign;this.prefix=!!r.prefix;this.postfix=!!r.postfix;this.binop=r.binop||null;this.updateContext=null};function vo(e,t){return new mo(e,{beforeExpr:true,binop:t})}var go={beforeExpr:true},yo={startsExpr:true};var xo={};function Eo(e,t){if(t===void 0)t={};t.keyword=e;return xo[e]=new mo(e,t)}var bo={num:new mo("num",yo),regexp:new mo("regexp",yo),string:new mo("string",yo),name:new mo("name",yo),eof:new mo("eof"),bracketL:new mo("[",{beforeExpr:true,startsExpr:true}),bracketR:new mo("]"),braceL:new mo("{",{beforeExpr:true,startsExpr:true}),braceR:new mo("}"),parenL:new mo("(",{beforeExpr:true,startsExpr:true}),parenR:new mo(")"),comma:new mo(",",go),semi:new mo(";",go),colon:new mo(":",go),dot:new mo("."),question:new mo("?",go),arrow:new mo("=>",go),template:new mo("template"),invalidTemplate:new mo("invalidTemplate"),ellipsis:new mo("...",go),backQuote:new mo("`",yo),dollarBraceL:new mo("${",{beforeExpr:true,startsExpr:true}),eq:new mo("=",{beforeExpr:true,isAssign:true}),assign:new mo("_=",{beforeExpr:true,isAssign:true}),incDec:new mo("++/--",{prefix:true,postfix:true,startsExpr:true}),prefix:new mo("!/~",{beforeExpr:true,prefix:true,startsExpr:true}),logicalOR:vo("||",1),logicalAND:vo("&&",2),bitwiseOR:vo("|",3),bitwiseXOR:vo("^",4),bitwiseAND:vo("&",5),equality:vo("==/!=/===/!==",6),relational:vo("</>/<=/>=",7),bitShift:vo("<</>>/>>>",8),plusMin:new mo("+/-",{beforeExpr:true,binop:9,prefix:true,startsExpr:true}),modulo:vo("%",10),star:vo("*",10),slash:vo("/",10),starstar:new mo("**",{beforeExpr:true}),_break:Eo("break"),_case:Eo("case",go),_catch:Eo("catch"),_continue:Eo("continue"),_debugger:Eo("debugger"),_default:Eo("default",go),_do:Eo("do",{isLoop:true,beforeExpr:true}),_else:Eo("else",go),_finally:Eo("finally"),_for:Eo("for",{isLoop:true}),_function:Eo("function",yo),_if:Eo("if"),_return:Eo("return",go),_switch:Eo("switch"),_throw:Eo("throw",go),_try:Eo("try"),_var:Eo("var"),_const:Eo("const"),_while:Eo("while",{isLoop:true}),_with:Eo("with"),_new:Eo("new",{beforeExpr:true,startsExpr:true}),_this:Eo("this",yo),_super:Eo("super",yo),_class:Eo("class",yo),_extends:Eo("extends",go),_export:Eo("export"),_import:Eo("import",yo),_null:Eo("null",yo),_true:Eo("true",yo),_false:Eo("false",yo),_in:Eo("in",{beforeExpr:true,binop:7}),_instanceof:Eo("instanceof",{beforeExpr:true,binop:7}),_typeof:Eo("typeof",{beforeExpr:true,prefix:true,startsExpr:true}),_void:Eo("void",{beforeExpr:true,prefix:true,startsExpr:true}),_delete:Eo("delete",{beforeExpr:true,prefix:true,startsExpr:true})};var So=/\r\n?|\n|\u2028|\u2029/;var Do=new RegExp(So.source,"g");function Co(e,t){return e===10||e===13||!t&&(e===8232||e===8233)}var wo=/[\u1680\u2000-\u200a\u202f\u205f\u3000\ufeff]/;var Ao=/(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g;var To=Object.prototype;var ko=To.hasOwnProperty;var _o=To.toString;function Po(e,t){return ko.call(e,t)}var Fo=Array.isArray||function(e){return _o.call(e)==="[object Array]"};function Io(e){return new RegExp("^(?:"+e.replace(/ /g,"|")+")$")}var Mo=function e(t,r){this.line=t;this.column=r};Mo.prototype.offset=function e(t){return new Mo(this.line,this.column+t)};var No=function e(t,r,n){this.start=r;this.end=n;if(t.sourceFile!==null){this.source=t.sourceFile}};function Lo(e,t){for(var r=1,n=0;;){Do.lastIndex=n;var i=Do.exec(e);if(i&&i.index<t){++r;n=i.index+i[0].length}else{return new Mo(r,t-n)}}}var Bo={ecmaVersion:10,sourceType:"script",onInsertedSemicolon:null,onTrailingComma:null,allowReserved:null,allowReturnOutsideFunction:false,allowImportExportEverywhere:false,allowAwaitOutsideFunction:false,allowHashBang:false,locations:false,onToken:null,onComment:null,ranges:false,program:null,sourceFile:null,directSourceFile:null,preserveParens:false};function Oo(e){var t={};for(var r in Bo){t[r]=e&&Po(e,r)?e[r]:Bo[r]}if(t.ecmaVersion>=2015){t.ecmaVersion-=2009}if(t.allowReserved==null){t.allowReserved=t.ecmaVersion<5}if(Fo(t.onToken)){var n=t.onToken;t.onToken=function(e){return n.push(e)}}if(Fo(t.onComment)){t.onComment=Ro(t,t.onComment)}return t}function Ro(e,t){return function(r,n,i,s,a,o){var l={type:r?"Block":"Line",value:n,start:i,end:s};if(e.locations){l.loc=new No(this,a,o)}if(e.ranges){l.range=[i,s]}t.push(l)}}var jo=1,Uo=2,Vo=jo|Uo,Go=4,zo=8,Xo=16,Jo=32,qo=64,Wo=128;function Ho(e,t){return Uo|(e?Go:0)|(t?zo:0)}var Ko=0,$o=1,Yo=2,Qo=3,Zo=4,el=5;var tl=function e(t,r,n){this.options=t=Oo(t);this.sourceFile=t.sourceFile;this.keywords=Io(no[t.ecmaVersion>=6?6:t.sourceType==="module"?"5module":5]);var i="";if(t.allowReserved!==true){for(var s=t.ecmaVersion;;s--){if(i=to[s]){break}}if(t.sourceType==="module"){i+=" await"}}this.reservedWords=Io(i);var a=(i?i+" ":"")+to.strict;this.reservedWordsStrict=Io(a);this.reservedWordsStrictBind=Io(a+" "+to.strictBind);this.input=String(r);this.containsEsc=false;if(n){this.pos=n;this.lineStart=this.input.lastIndexOf("\n",n-1)+1;this.curLine=this.input.slice(0,this.lineStart).split(So).length}else{this.pos=this.lineStart=0;this.curLine=1}this.type=bo.eof;this.value=null;this.start=this.end=this.pos;this.startLoc=this.endLoc=this.curPosition();this.lastTokEndLoc=this.lastTokStartLoc=null;this.lastTokStart=this.lastTokEnd=this.pos;this.context=this.initialContext();this.exprAllowed=true;this.inModule=t.sourceType==="module";this.strict=this.inModule||this.strictDirective(this.pos);this.potentialArrowAt=-1;this.yieldPos=this.awaitPos=this.awaitIdentPos=0;this.labels=[];this.undefinedExports={};if(this.pos===0&&t.allowHashBang&&this.input.slice(0,2)==="#!"){this.skipLineComment(2)}this.scopeStack=[];this.enterScope(jo);this.regexpState=null};var rl={inFunction:{configurable:true},inGenerator:{configurable:true},inAsync:{configurable:true},allowSuper:{configurable:true},allowDirectSuper:{configurable:true},treatFunctionsAsVar:{configurable:true}};tl.prototype.parse=function e(){var t=this.options.program||this.startNode();this.nextToken();return this.parseTopLevel(t)};rl.inFunction.get=function(){return(this.currentVarScope().flags&Uo)>0};rl.inGenerator.get=function(){return(this.currentVarScope().flags&zo)>0};rl.inAsync.get=function(){return(this.currentVarScope().flags&Go)>0};rl.allowSuper.get=function(){return(this.currentThisScope().flags&qo)>0};rl.allowDirectSuper.get=function(){return(this.currentThisScope().flags&Wo)>0};rl.treatFunctionsAsVar.get=function(){return this.treatFunctionsAsVarInScope(this.currentScope())};tl.prototype.inNonArrowFunction=function e(){return(this.currentThisScope().flags&Uo)>0};tl.extend=function e(){var t=[],r=arguments.length;while(r--)t[r]=arguments[r];var n=this;for(var i=0;i<t.length;i++){n=t[i](n)}return n};tl.parse=function e(t,r){return new this(r,t).parse()};tl.parseExpressionAt=function e(t,r,n){var i=new this(n,t,r);i.nextToken();return i.parseExpression()};tl.tokenizer=function e(t,r){return new this(r,t)};Object.defineProperties(tl.prototype,rl);var nl=tl.prototype;var il=/^(?:'((?:\\.|[^'])*?)'|"((?:\\.|[^"])*?)")/;nl.strictDirective=function(e){for(;;){Ao.lastIndex=e;e+=Ao.exec(this.input)[0].length;var t=il.exec(this.input.slice(e));if(!t){return false}if((t[1]||t[2])==="use strict"){return true}e+=t[0].length;Ao.lastIndex=e;e+=Ao.exec(this.input)[0].length;if(this.input[e]===";"){e++}}};nl.eat=function(e){if(this.type===e){this.next();return true}else{return false}};nl.isContextual=function(e){return this.type===bo.name&&this.value===e&&!this.containsEsc};nl.eatContextual=function(e){if(!this.isContextual(e)){return false}this.next();return true};nl.expectContextual=function(e){if(!this.eatContextual(e)){this.unexpected()}};nl.canInsertSemicolon=function(){return this.type===bo.eof||this.type===bo.braceR||So.test(this.input.slice(this.lastTokEnd,this.start))};nl.insertSemicolon=function(){if(this.canInsertSemicolon()){if(this.options.onInsertedSemicolon){this.options.onInsertedSemicolon(this.lastTokEnd,this.lastTokEndLoc)}return true}};nl.semicolon=function(){if(!this.eat(bo.semi)&&!this.insertSemicolon()){this.unexpected()}};nl.afterTrailingComma=function(e,t){if(this.type===e){if(this.options.onTrailingComma){this.options.onTrailingComma(this.lastTokStart,this.lastTokStartLoc)}if(!t){this.next()}return true}};nl.expect=function(e){this.eat(e)||this.unexpected()};nl.unexpected=function(e){this.raise(e!=null?e:this.start,"Unexpected token")};function sl(){this.shorthandAssign=this.trailingComma=this.parenthesizedAssign=this.parenthesizedBind=this.doubleProto=-1}nl.checkPatternErrors=function(e,t){if(!e){return}if(e.trailingComma>-1){this.raiseRecoverable(e.trailingComma,"Comma is not permitted after the rest element")}var r=t?e.parenthesizedAssign:e.parenthesizedBind;if(r>-1){this.raiseRecoverable(r,"Parenthesized pattern")}};nl.checkExpressionErrors=function(e,t){if(!e){return false}var r=e.shorthandAssign;var n=e.doubleProto;if(!t){return r>=0||n>=0}if(r>=0){this.raise(r,"Shorthand property assignments are valid only in destructuring patterns")}if(n>=0){this.raiseRecoverable(n,"Redefinition of __proto__ property")}};nl.checkYieldAwaitInDefaultParams=function(){if(this.yieldPos&&(!this.awaitPos||this.yieldPos<this.awaitPos)){this.raise(this.yieldPos,"Yield expression cannot be a default value")}if(this.awaitPos){this.raise(this.awaitPos,"Await expression cannot be a default value")}};nl.isSimpleAssignTarget=function(e){if(e.type==="ParenthesizedExpression"){return this.isSimpleAssignTarget(e.expression)}return e.type==="Identifier"||e.type==="MemberExpression"};var al=tl.prototype;al.parseTopLevel=function(e){var t={};if(!e.body){e.body=[]}while(this.type!==bo.eof){var r=this.parseStatement(null,true,t);e.body.push(r)}if(this.inModule){for(var n=0,i=Object.keys(this.undefinedExports);n<i.length;n+=1){var s=i[n];this.raiseRecoverable(this.undefinedExports[s].start,"Export '"+s+"' is not defined")}}this.adaptDirectivePrologue(e.body);this.next();e.sourceType=this.options.sourceType;return this.finishNode(e,"Program")};var ol={kind:"loop"},ll={kind:"switch"};al.isLet=function(e){if(this.options.ecmaVersion<6||!this.isContextual("let")){return false}Ao.lastIndex=this.pos;var t=Ao.exec(this.input);var r=this.pos+t[0].length,n=this.input.charCodeAt(r);if(n===91){return true}if(e){return false}if(n===123){return true}if(ho(n,true)){var i=r+1;while(po(this.input.charCodeAt(i),true)){++i}var s=this.input.slice(r,i);if(!io.test(s)){return true}}return false};al.isAsyncFunction=function(){if(this.options.ecmaVersion<8||!this.isContextual("async")){return false}Ao.lastIndex=this.pos;var e=Ao.exec(this.input);var t=this.pos+e[0].length;return!So.test(this.input.slice(this.pos,t))&&this.input.slice(t,t+8)==="function"&&(t+8===this.input.length||!po(this.input.charAt(t+8)))};al.parseStatement=function(e,t,r){var n=this.type,i=this.startNode(),s;if(this.isLet(e)){n=bo._var;s="let"}switch(n){case bo._break:case bo._continue:return this.parseBreakContinueStatement(i,n.keyword);case bo._debugger:return this.parseDebuggerStatement(i);case bo._do:return this.parseDoStatement(i);case bo._for:return this.parseForStatement(i);case bo._function:if(e&&(this.strict||e!=="if"&&e!=="label")&&this.options.ecmaVersion>=6){this.unexpected()}return this.parseFunctionStatement(i,false,!e);case bo._class:if(e){this.unexpected()}return this.parseClass(i,true);case bo._if:return this.parseIfStatement(i);case bo._return:return this.parseReturnStatement(i);case bo._switch:return this.parseSwitchStatement(i);case bo._throw:return this.parseThrowStatement(i);case bo._try:return this.parseTryStatement(i);case bo._const:case bo._var:s=s||this.value;if(e&&s!=="var"){this.unexpected()}return this.parseVarStatement(i,s);case bo._while:return this.parseWhileStatement(i);case bo._with:return this.parseWithStatement(i);case bo.braceL:return this.parseBlock(true,i);case bo.semi:return this.parseEmptyStatement(i);case bo._export:case bo._import:if(this.options.ecmaVersion>10&&n===bo._import){Ao.lastIndex=this.pos;var a=Ao.exec(this.input);var o=this.pos+a[0].length,l=this.input.charCodeAt(o);if(l===40){return this.parseExpressionStatement(i,this.parseExpression())}}if(!this.options.allowImportExportEverywhere){if(!t){this.raise(this.start,"'import' and 'export' may only appear at the top level")}if(!this.inModule){this.raise(this.start,"'import' and 'export' may appear only with 'sourceType: module'")}}return n===bo._import?this.parseImport(i):this.parseExport(i,r);default:if(this.isAsyncFunction()){if(e){this.unexpected()}this.next();return this.parseFunctionStatement(i,true,!e)}var u=this.value,c=this.parseExpression();if(n===bo.name&&c.type==="Identifier"&&this.eat(bo.colon)){return this.parseLabeledStatement(i,u,c,e)}else{return this.parseExpressionStatement(i,c)}}};al.parseBreakContinueStatement=function(e,t){var r=t==="break";this.next();if(this.eat(bo.semi)||this.insertSemicolon()){e.label=null}else if(this.type!==bo.name){this.unexpected()}else{e.label=this.parseIdent();this.semicolon()}var n=0;for(;n<this.labels.length;++n){var i=this.labels[n];if(e.label==null||i.name===e.label.name){if(i.kind!=null&&(r||i.kind==="loop")){break}if(e.label&&r){break}}}if(n===this.labels.length){this.raise(e.start,"Unsyntactic "+t)}return this.finishNode(e,r?"BreakStatement":"ContinueStatement")};al.parseDebuggerStatement=function(e){this.next();this.semicolon();return this.finishNode(e,"DebuggerStatement")};al.parseDoStatement=function(e){this.next();this.labels.push(ol);e.body=this.parseStatement("do");this.labels.pop();this.expect(bo._while);e.test=this.parseParenExpression();if(this.options.ecmaVersion>=6){this.eat(bo.semi)}else{this.semicolon()}return this.finishNode(e,"DoWhileStatement")};al.parseForStatement=function(e){this.next();var t=this.options.ecmaVersion>=9&&(this.inAsync||!this.inFunction&&this.options.allowAwaitOutsideFunction)&&this.eatContextual("await")?this.lastTokStart:-1;this.labels.push(ol);this.enterScope(0);this.expect(bo.parenL);if(this.type===bo.semi){if(t>-1){this.unexpected(t)}return this.parseFor(e,null)}var r=this.isLet();if(this.type===bo._var||this.type===bo._const||r){var n=this.startNode(),i=r?"let":this.value;this.next();this.parseVar(n,true,i);this.finishNode(n,"VariableDeclaration");if((this.type===bo._in||this.options.ecmaVersion>=6&&this.isContextual("of"))&&n.declarations.length===1){if(this.options.ecmaVersion>=9){if(this.type===bo._in){if(t>-1){this.unexpected(t)}}else{e.await=t>-1}}return this.parseForIn(e,n)}if(t>-1){this.unexpected(t)}return this.parseFor(e,n)}var s=new sl;var a=this.parseExpression(true,s);if(this.type===bo._in||this.options.ecmaVersion>=6&&this.isContextual("of")){if(this.options.ecmaVersion>=9){if(this.type===bo._in){if(t>-1){this.unexpected(t)}}else{e.await=t>-1}}this.toAssignable(a,false,s);this.checkLVal(a);return this.parseForIn(e,a)}else{this.checkExpressionErrors(s,true)}if(t>-1){this.unexpected(t)}return this.parseFor(e,a)};al.parseFunctionStatement=function(e,t,r){this.next();return this.parseFunction(e,cl|(r?0:fl),false,t)};al.parseIfStatement=function(e){this.next();e.test=this.parseParenExpression();e.consequent=this.parseStatement("if");e.alternate=this.eat(bo._else)?this.parseStatement("if"):null;return this.finishNode(e,"IfStatement")};al.parseReturnStatement=function(e){if(!this.inFunction&&!this.options.allowReturnOutsideFunction){this.raise(this.start,"'return' outside of function")}this.next();if(this.eat(bo.semi)||this.insertSemicolon()){e.argument=null}else{e.argument=this.parseExpression();this.semicolon()}return this.finishNode(e,"ReturnStatement")};al.parseSwitchStatement=function(e){this.next();e.discriminant=this.parseParenExpression();e.cases=[];this.expect(bo.braceL);this.labels.push(ll);this.enterScope(0);var t;for(var r=false;this.type!==bo.braceR;){if(this.type===bo._case||this.type===bo._default){var n=this.type===bo._case;if(t){this.finishNode(t,"SwitchCase")}e.cases.push(t=this.startNode());t.consequent=[];this.next();if(n){t.test=this.parseExpression()}else{if(r){this.raiseRecoverable(this.lastTokStart,"Multiple default clauses")}r=true;t.test=null}this.expect(bo.colon)}else{if(!t){this.unexpected()}t.consequent.push(this.parseStatement(null))}}this.exitScope();if(t){this.finishNode(t,"SwitchCase")}this.next();this.labels.pop();return this.finishNode(e,"SwitchStatement")};al.parseThrowStatement=function(e){this.next();if(So.test(this.input.slice(this.lastTokEnd,this.start))){this.raise(this.lastTokEnd,"Illegal newline after throw")}e.argument=this.parseExpression();this.semicolon();return this.finishNode(e,"ThrowStatement")};var ul=[];al.parseTryStatement=function(e){this.next();e.block=this.parseBlock();e.handler=null;if(this.type===bo._catch){var t=this.startNode();this.next();if(this.eat(bo.parenL)){t.param=this.parseBindingAtom();var r=t.param.type==="Identifier";this.enterScope(r?Jo:0);this.checkLVal(t.param,r?Zo:Yo);this.expect(bo.parenR)}else{if(this.options.ecmaVersion<10){this.unexpected()}t.param=null;this.enterScope(0)}t.body=this.parseBlock(false);this.exitScope();e.handler=this.finishNode(t,"CatchClause")}e.finalizer=this.eat(bo._finally)?this.parseBlock():null;if(!e.handler&&!e.finalizer){this.raise(e.start,"Missing catch or finally clause")}return this.finishNode(e,"TryStatement")};al.parseVarStatement=function(e,t){this.next();this.parseVar(e,false,t);this.semicolon();return this.finishNode(e,"VariableDeclaration")};al.parseWhileStatement=function(e){this.next();e.test=this.parseParenExpression();this.labels.push(ol);e.body=this.parseStatement("while");this.labels.pop();return this.finishNode(e,"WhileStatement")};al.parseWithStatement=function(e){if(this.strict){this.raise(this.start,"'with' in strict mode")}this.next();e.object=this.parseParenExpression();e.body=this.parseStatement("with");return this.finishNode(e,"WithStatement")};al.parseEmptyStatement=function(e){this.next();return this.finishNode(e,"EmptyStatement")};al.parseLabeledStatement=function(e,t,r,n){for(var i=0,s=this.labels;i<s.length;i+=1){var a=s[i];if(a.name===t){this.raise(r.start,"Label '"+t+"' is already declared")}}var o=this.type.isLoop?"loop":this.type===bo._switch?"switch":null;for(var l=this.labels.length-1;l>=0;l--){var u=this.labels[l];if(u.statementStart===e.start){u.statementStart=this.start;u.kind=o}else{break}}this.labels.push({name:t,kind:o,statementStart:this.start});e.body=this.parseStatement(n?n.indexOf("label")===-1?n+"label":n:"label");this.labels.pop();e.label=r;return this.finishNode(e,"LabeledStatement")};al.parseExpressionStatement=function(e,t){e.expression=t;this.semicolon();return this.finishNode(e,"ExpressionStatement")};al.parseBlock=function(e,t){if(e===void 0)e=true;if(t===void 0)t=this.startNode();t.body=[];this.expect(bo.braceL);if(e){this.enterScope(0)}while(!this.eat(bo.braceR)){var r=this.parseStatement(null);t.body.push(r)}if(e){this.exitScope()}return this.finishNode(t,"BlockStatement")};al.parseFor=function(e,t){e.init=t;this.expect(bo.semi);e.test=this.type===bo.semi?null:this.parseExpression();this.expect(bo.semi);e.update=this.type===bo.parenR?null:this.parseExpression();this.expect(bo.parenR);e.body=this.parseStatement("for");this.exitScope();this.labels.pop();return this.finishNode(e,"ForStatement")};al.parseForIn=function(e,t){var r=this.type===bo._in;this.next();if(t.type==="VariableDeclaration"&&t.declarations[0].init!=null&&(!r||this.options.ecmaVersion<8||this.strict||t.kind!=="var"||t.declarations[0].id.type!=="Identifier")){this.raise(t.start,(r?"for-in":"for-of")+" loop variable declaration may not have an initializer")}else if(t.type==="AssignmentPattern"){this.raise(t.start,"Invalid left-hand side in for-loop")}e.left=t;e.right=r?this.parseExpression():this.parseMaybeAssign();this.expect(bo.parenR);e.body=this.parseStatement("for");this.exitScope();this.labels.pop();return this.finishNode(e,r?"ForInStatement":"ForOfStatement")};al.parseVar=function(e,t,r){e.declarations=[];e.kind=r;for(;;){var n=this.startNode();this.parseVarId(n,r);if(this.eat(bo.eq)){n.init=this.parseMaybeAssign(t)}else if(r==="const"&&!(this.type===bo._in||this.options.ecmaVersion>=6&&this.isContextual("of"))){this.unexpected()}else if(n.id.type!=="Identifier"&&!(t&&(this.type===bo._in||this.isContextual("of")))){this.raise(this.lastTokEnd,"Complex binding patterns require an initialization value")}else{n.init=null}e.declarations.push(this.finishNode(n,"VariableDeclarator"));if(!this.eat(bo.comma)){break}}return e};al.parseVarId=function(e,t){e.id=this.parseBindingAtom();this.checkLVal(e.id,t==="var"?$o:Yo,false)};var cl=1,fl=2,hl=4;al.parseFunction=function(e,t,r,n){this.initFunction(e);if(this.options.ecmaVersion>=9||this.options.ecmaVersion>=6&&!n){if(this.type===bo.star&&t&fl){this.unexpected()}e.generator=this.eat(bo.star)}if(this.options.ecmaVersion>=8){e.async=!!n}if(t&cl){e.id=t&hl&&this.type!==bo.name?null:this.parseIdent();if(e.id&&!(t&fl)){this.checkLVal(e.id,this.strict||e.generator||e.async?this.treatFunctionsAsVar?$o:Yo:Qo)}}var i=this.yieldPos,s=this.awaitPos,a=this.awaitIdentPos;this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;this.enterScope(Ho(e.async,e.generator));if(!(t&cl)){e.id=this.type===bo.name?this.parseIdent():null}this.parseFunctionParams(e);this.parseFunctionBody(e,r,false);this.yieldPos=i;this.awaitPos=s;this.awaitIdentPos=a;return this.finishNode(e,t&cl?"FunctionDeclaration":"FunctionExpression")};al.parseFunctionParams=function(e){this.expect(bo.parenL);e.params=this.parseBindingList(bo.parenR,false,this.options.ecmaVersion>=8);this.checkYieldAwaitInDefaultParams()};al.parseClass=function(e,t){this.next();var r=this.strict;this.strict=true;this.parseClassId(e,t);this.parseClassSuper(e);var n=this.startNode();var i=false;n.body=[];this.expect(bo.braceL);while(!this.eat(bo.braceR)){var s=this.parseClassElement(e.superClass!==null);if(s){n.body.push(s);if(s.type==="MethodDefinition"&&s.kind==="constructor"){if(i){this.raise(s.start,"Duplicate constructor in the same class")}i=true}}}e.body=this.finishNode(n,"ClassBody");this.strict=r;return this.finishNode(e,t?"ClassDeclaration":"ClassExpression")};al.parseClassElement=function(e){var t=this;if(this.eat(bo.semi)){return null}var r=this.startNode();var n=function e(n,i){if(i===void 0)i=false;var s=t.start,a=t.startLoc;if(!t.eatContextual(n)){return false}if(t.type!==bo.parenL&&(!i||!t.canInsertSemicolon())){return true}if(r.key){t.unexpected()}r.computed=false;r.key=t.startNodeAt(s,a);r.key.name=n;t.finishNode(r.key,"Identifier");return false};r.kind="method";r.static=n("static");var i=this.eat(bo.star);var s=false;if(!i){if(this.options.ecmaVersion>=8&&n("async",true)){s=true;i=this.options.ecmaVersion>=9&&this.eat(bo.star)}else if(n("get")){r.kind="get"}else if(n("set")){r.kind="set"}}if(!r.key){this.parsePropertyName(r)}var a=r.key;var o=false;if(!r.computed&&!r.static&&(a.type==="Identifier"&&a.name==="constructor"||a.type==="Literal"&&a.value==="constructor")){if(r.kind!=="method"){this.raise(a.start,"Constructor can't have get/set modifier")}if(i){this.raise(a.start,"Constructor can't be a generator")}if(s){this.raise(a.start,"Constructor can't be an async method")}r.kind="constructor";o=e}else if(r.static&&a.type==="Identifier"&&a.name==="prototype"){this.raise(a.start,"Classes may not have a static property named prototype")}this.parseClassMethod(r,i,s,o);if(r.kind==="get"&&r.value.params.length!==0){this.raiseRecoverable(r.value.start,"getter should have no params")}if(r.kind==="set"&&r.value.params.length!==1){this.raiseRecoverable(r.value.start,"setter should have exactly one param")}if(r.kind==="set"&&r.value.params[0].type==="RestElement"){this.raiseRecoverable(r.value.params[0].start,"Setter cannot use rest params")}return r};al.parseClassMethod=function(e,t,r,n){e.value=this.parseMethod(t,r,n);return this.finishNode(e,"MethodDefinition")};al.parseClassId=function(e,t){if(this.type===bo.name){e.id=this.parseIdent();if(t){this.checkLVal(e.id,Yo,false)}}else{if(t===true){this.unexpected()}e.id=null}};al.parseClassSuper=function(e){e.superClass=this.eat(bo._extends)?this.parseExprSubscripts():null};al.parseExport=function(e,t){this.next();if(this.eat(bo.star)){this.expectContextual("from");if(this.type!==bo.string){this.unexpected()}e.source=this.parseExprAtom();this.semicolon();return this.finishNode(e,"ExportAllDeclaration")}if(this.eat(bo._default)){this.checkExport(t,"default",this.lastTokStart);var r;if(this.type===bo._function||(r=this.isAsyncFunction())){var n=this.startNode();this.next();if(r){this.next()}e.declaration=this.parseFunction(n,cl|hl,false,r)}else if(this.type===bo._class){var i=this.startNode();e.declaration=this.parseClass(i,"nullableID")}else{e.declaration=this.parseMaybeAssign();this.semicolon()}return this.finishNode(e,"ExportDefaultDeclaration")}if(this.shouldParseExportStatement()){e.declaration=this.parseStatement(null);if(e.declaration.type==="VariableDeclaration"){this.checkVariableExport(t,e.declaration.declarations)}else{this.checkExport(t,e.declaration.id.name,e.declaration.id.start)}e.specifiers=[];e.source=null}else{e.declaration=null;e.specifiers=this.parseExportSpecifiers(t);if(this.eatContextual("from")){if(this.type!==bo.string){this.unexpected()}e.source=this.parseExprAtom()}else{for(var s=0,a=e.specifiers;s<a.length;s+=1){var o=a[s];this.checkUnreserved(o.local);this.checkLocalExport(o.local)}e.source=null}this.semicolon()}return this.finishNode(e,"ExportNamedDeclaration")};al.checkExport=function(e,t,r){if(!e){return}if(Po(e,t)){this.raiseRecoverable(r,"Duplicate export '"+t+"'")}e[t]=true};al.checkPatternExport=function(e,t){var r=t.type;if(r==="Identifier"){this.checkExport(e,t.name,t.start)}else if(r==="ObjectPattern"){for(var n=0,i=t.properties;n<i.length;n+=1){var s=i[n];this.checkPatternExport(e,s)}}else if(r==="ArrayPattern"){for(var a=0,o=t.elements;a<o.length;a+=1){var l=o[a];if(l){this.checkPatternExport(e,l)}}}else if(r==="Property"){this.checkPatternExport(e,t.value)}else if(r==="AssignmentPattern"){this.checkPatternExport(e,t.left)}else if(r==="RestElement"){this.checkPatternExport(e,t.argument)}else if(r==="ParenthesizedExpression"){this.checkPatternExport(e,t.expression)}};al.checkVariableExport=function(e,t){if(!e){return}for(var r=0,n=t;r<n.length;r+=1){var i=n[r];this.checkPatternExport(e,i.id)}};al.shouldParseExportStatement=function(){return this.type.keyword==="var"||this.type.keyword==="const"||this.type.keyword==="class"||this.type.keyword==="function"||this.isLet()||this.isAsyncFunction()};al.parseExportSpecifiers=function(e){var t=[],r=true;this.expect(bo.braceL);while(!this.eat(bo.braceR)){if(!r){this.expect(bo.comma);if(this.afterTrailingComma(bo.braceR)){break}}else{r=false}var n=this.startNode();n.local=this.parseIdent(true);n.exported=this.eatContextual("as")?this.parseIdent(true):n.local;this.checkExport(e,n.exported.name,n.exported.start);t.push(this.finishNode(n,"ExportSpecifier"))}return t};al.parseImport=function(e){this.next();if(this.type===bo.string){e.specifiers=ul;e.source=this.parseExprAtom()}else{e.specifiers=this.parseImportSpecifiers();this.expectContextual("from");e.source=this.type===bo.string?this.parseExprAtom():this.unexpected()}this.semicolon();return this.finishNode(e,"ImportDeclaration")};al.parseImportSpecifiers=function(){var e=[],t=true;if(this.type===bo.name){var r=this.startNode();r.local=this.parseIdent();this.checkLVal(r.local,Yo);e.push(this.finishNode(r,"ImportDefaultSpecifier"));if(!this.eat(bo.comma)){return e}}if(this.type===bo.star){var n=this.startNode();this.next();this.expectContextual("as");n.local=this.parseIdent();this.checkLVal(n.local,Yo);e.push(this.finishNode(n,"ImportNamespaceSpecifier"));return e}this.expect(bo.braceL);while(!this.eat(bo.braceR)){if(!t){this.expect(bo.comma);if(this.afterTrailingComma(bo.braceR)){break}}else{t=false}var i=this.startNode();i.imported=this.parseIdent(true);if(this.eatContextual("as")){i.local=this.parseIdent()}else{this.checkUnreserved(i.imported);i.local=i.imported}this.checkLVal(i.local,Yo);e.push(this.finishNode(i,"ImportSpecifier"))}return e};al.adaptDirectivePrologue=function(e){for(var t=0;t<e.length&&this.isDirectiveCandidate(e[t]);++t){e[t].directive=e[t].expression.raw.slice(1,-1)}};al.isDirectiveCandidate=function(e){return e.type==="ExpressionStatement"&&e.expression.type==="Literal"&&typeof e.expression.value==="string"&&(this.input[e.start]==='"'||this.input[e.start]==="'")};var pl=tl.prototype;pl.toAssignable=function(e,t,r){if(this.options.ecmaVersion>=6&&e){switch(e.type){case"Identifier":if(this.inAsync&&e.name==="await"){this.raise(e.start,"Cannot use 'await' as identifier inside an async function")}break;case"ObjectPattern":case"ArrayPattern":case"RestElement":break;case"ObjectExpression":e.type="ObjectPattern";if(r){this.checkPatternErrors(r,true)}for(var n=0,i=e.properties;n<i.length;n+=1){var s=i[n];this.toAssignable(s,t);if(s.type==="RestElement"&&(s.argument.type==="ArrayPattern"||s.argument.type==="ObjectPattern")){this.raise(s.argument.start,"Unexpected token")}}break;case"Property":if(e.kind!=="init"){this.raise(e.key.start,"Object pattern can't contain getter or setter")}this.toAssignable(e.value,t);break;case"ArrayExpression":e.type="ArrayPattern";if(r){this.checkPatternErrors(r,true)}this.toAssignableList(e.elements,t);break;case"SpreadElement":e.type="RestElement";this.toAssignable(e.argument,t);if(e.argument.type==="AssignmentPattern"){this.raise(e.argument.start,"Rest elements cannot have a default value")}break;case"AssignmentExpression":if(e.operator!=="="){this.raise(e.left.end,"Only '=' operator can be used for specifying default value.")}e.type="AssignmentPattern";delete e.operator;this.toAssignable(e.left,t);case"AssignmentPattern":break;case"ParenthesizedExpression":this.toAssignable(e.expression,t,r);break;case"MemberExpression":if(!t){break}default:this.raise(e.start,"Assigning to rvalue")}}else if(r){this.checkPatternErrors(r,true)}return e};pl.toAssignableList=function(e,t){var r=e.length;for(var n=0;n<r;n++){var i=e[n];if(i){this.toAssignable(i,t)}}if(r){var s=e[r-1];if(this.options.ecmaVersion===6&&t&&s&&s.type==="RestElement"&&s.argument.type!=="Identifier"){this.unexpected(s.argument.start)}}return e};pl.parseSpread=function(e){var t=this.startNode();this.next();t.argument=this.parseMaybeAssign(false,e);return this.finishNode(t,"SpreadElement")};pl.parseRestBinding=function(){var e=this.startNode();this.next();if(this.options.ecmaVersion===6&&this.type!==bo.name){this.unexpected()}e.argument=this.parseBindingAtom();return this.finishNode(e,"RestElement")};pl.parseBindingAtom=function(){if(this.options.ecmaVersion>=6){switch(this.type){case bo.bracketL:var e=this.startNode();this.next();e.elements=this.parseBindingList(bo.bracketR,true,true);return this.finishNode(e,"ArrayPattern");case bo.braceL:return this.parseObj(true)}}return this.parseIdent()};pl.parseBindingList=function(e,t,r){var n=[],i=true;while(!this.eat(e)){if(i){i=false}else{this.expect(bo.comma)}if(t&&this.type===bo.comma){n.push(null)}else if(r&&this.afterTrailingComma(e)){break}else if(this.type===bo.ellipsis){var s=this.parseRestBinding();this.parseBindingListItem(s);n.push(s);if(this.type===bo.comma){this.raise(this.start,"Comma is not permitted after the rest element")}this.expect(e);break}else{var a=this.parseMaybeDefault(this.start,this.startLoc);this.parseBindingListItem(a);n.push(a)}}return n};pl.parseBindingListItem=function(e){return e};pl.parseMaybeDefault=function(e,t,r){r=r||this.parseBindingAtom();if(this.options.ecmaVersion<6||!this.eat(bo.eq)){return r}var n=this.startNodeAt(e,t);n.left=r;n.right=this.parseMaybeAssign();return this.finishNode(n,"AssignmentPattern")};pl.checkLVal=function(e,t,r){if(t===void 0)t=Ko;switch(e.type){case"Identifier":if(t===Yo&&e.name==="let"){this.raiseRecoverable(e.start,"let is disallowed as a lexically bound name")}if(this.strict&&this.reservedWordsStrictBind.test(e.name)){this.raiseRecoverable(e.start,(t?"Binding ":"Assigning to ")+e.name+" in strict mode")}if(r){if(Po(r,e.name)){this.raiseRecoverable(e.start,"Argument name clash")}r[e.name]=true}if(t!==Ko&&t!==el){this.declareName(e.name,t,e.start)}break;case"MemberExpression":if(t){this.raiseRecoverable(e.start,"Binding member expression")}break;case"ObjectPattern":for(var n=0,i=e.properties;n<i.length;n+=1){var s=i[n];this.checkLVal(s,t,r)}break;case"Property":this.checkLVal(e.value,t,r);break;case"ArrayPattern":for(var a=0,o=e.elements;a<o.length;a+=1){var l=o[a];if(l){this.checkLVal(l,t,r)}}break;case"AssignmentPattern":this.checkLVal(e.left,t,r);break;case"RestElement":this.checkLVal(e.argument,t,r);break;case"ParenthesizedExpression":this.checkLVal(e.expression,t,r);break;default:this.raise(e.start,(t?"Binding":"Assigning to")+" rvalue")}};var dl=tl.prototype;dl.checkPropClash=function(e,t,r){if(this.options.ecmaVersion>=9&&e.type==="SpreadElement"){return}if(this.options.ecmaVersion>=6&&(e.computed||e.method||e.shorthand)){return}var n=e.key;var i;switch(n.type){case"Identifier":i=n.name;break;case"Literal":i=String(n.value);break;default:return}var s=e.kind;if(this.options.ecmaVersion>=6){if(i==="__proto__"&&s==="init"){if(t.proto){if(r&&r.doubleProto<0){r.doubleProto=n.start}else{this.raiseRecoverable(n.start,"Redefinition of __proto__ property")}}t.proto=true}return}i="$"+i;var a=t[i];if(a){var o;if(s==="init"){o=this.strict&&a.init||a.get||a.set}else{o=a.init||a[s]}if(o){this.raiseRecoverable(n.start,"Redefinition of property")}}else{a=t[i]={init:false,get:false,set:false}}a[s]=true};dl.parseExpression=function(e,t){var r=this.start,n=this.startLoc;var i=this.parseMaybeAssign(e,t);if(this.type===bo.comma){var s=this.startNodeAt(r,n);s.expressions=[i];while(this.eat(bo.comma)){s.expressions.push(this.parseMaybeAssign(e,t))}return this.finishNode(s,"SequenceExpression")}return i};dl.parseMaybeAssign=function(e,t,r){if(this.isContextual("yield")){if(this.inGenerator){return this.parseYield(e)}else{this.exprAllowed=false}}var n=false,i=-1,s=-1,a=-1;if(t){i=t.parenthesizedAssign;s=t.trailingComma;a=t.shorthandAssign;t.parenthesizedAssign=t.trailingComma=t.shorthandAssign=-1}else{t=new sl;n=true}var o=this.start,l=this.startLoc;if(this.type===bo.parenL||this.type===bo.name){this.potentialArrowAt=this.start}var u=this.parseMaybeConditional(e,t);if(r){u=r.call(this,u,o,l)}if(this.type.isAssign){var c=this.startNodeAt(o,l);c.operator=this.value;c.left=this.type===bo.eq?this.toAssignable(u,false,t):u;if(!n){sl.call(t)}t.shorthandAssign=-1;this.checkLVal(u);this.next();c.right=this.parseMaybeAssign(e);return this.finishNode(c,"AssignmentExpression")}else{if(n){this.checkExpressionErrors(t,true)}}if(i>-1){t.parenthesizedAssign=i}if(s>-1){t.trailingComma=s}if(a>-1){t.shorthandAssign=a}return u};dl.parseMaybeConditional=function(e,t){var r=this.start,n=this.startLoc;var i=this.parseExprOps(e,t);if(this.checkExpressionErrors(t)){return i}if(this.eat(bo.question)){var s=this.startNodeAt(r,n);s.test=i;s.consequent=this.parseMaybeAssign();this.expect(bo.colon);s.alternate=this.parseMaybeAssign(e);return this.finishNode(s,"ConditionalExpression")}return i};dl.parseExprOps=function(e,t){var r=this.start,n=this.startLoc;var i=this.parseMaybeUnary(t,false);if(this.checkExpressionErrors(t)){return i}return i.start===r&&i.type==="ArrowFunctionExpression"?i:this.parseExprOp(i,r,n,-1,e)};dl.parseExprOp=function(e,t,r,n,i){var s=this.type.binop;if(s!=null&&(!i||this.type!==bo._in)){if(s>n){var a=this.type===bo.logicalOR||this.type===bo.logicalAND;var o=this.value;this.next();var l=this.start,u=this.startLoc;var c=this.parseExprOp(this.parseMaybeUnary(null,false),l,u,s,i);var f=this.buildBinary(t,r,e,c,o,a);return this.parseExprOp(f,t,r,n,i)}}return e};dl.buildBinary=function(e,t,r,n,i,s){var a=this.startNodeAt(e,t);a.left=r;a.operator=i;a.right=n;return this.finishNode(a,s?"LogicalExpression":"BinaryExpression")};dl.parseMaybeUnary=function(e,t){var r=this.start,n=this.startLoc,i;if(this.isContextual("await")&&(this.inAsync||!this.inFunction&&this.options.allowAwaitOutsideFunction)){i=this.parseAwait();t=true}else if(this.type.prefix){var s=this.startNode(),a=this.type===bo.incDec;s.operator=this.value;s.prefix=true;this.next();s.argument=this.parseMaybeUnary(null,true);this.checkExpressionErrors(e,true);if(a){this.checkLVal(s.argument)}else if(this.strict&&s.operator==="delete"&&s.argument.type==="Identifier"){this.raiseRecoverable(s.start,"Deleting local variable in strict mode")}else{t=true}i=this.finishNode(s,a?"UpdateExpression":"UnaryExpression")}else{i=this.parseExprSubscripts(e);if(this.checkExpressionErrors(e)){return i}while(this.type.postfix&&!this.canInsertSemicolon()){var o=this.startNodeAt(r,n);o.operator=this.value;o.prefix=false;o.argument=i;this.checkLVal(i);this.next();i=this.finishNode(o,"UpdateExpression")}}if(!t&&this.eat(bo.starstar)){return this.buildBinary(r,n,i,this.parseMaybeUnary(null,false),"**",false)}else{return i}};dl.parseExprSubscripts=function(e){var t=this.start,r=this.startLoc;var n=this.parseExprAtom(e);var i=n.type==="ArrowFunctionExpression"&&this.input.slice(this.lastTokStart,this.lastTokEnd)!==")";if(this.checkExpressionErrors(e)||i){return n}var s=this.parseSubscripts(n,t,r);if(e&&s.type==="MemberExpression"){if(e.parenthesizedAssign>=s.start){e.parenthesizedAssign=-1}if(e.parenthesizedBind>=s.start){e.parenthesizedBind=-1}}return s};dl.parseSubscripts=function(e,t,r,n){var i=this.options.ecmaVersion>=8&&e.type==="Identifier"&&e.name==="async"&&this.lastTokEnd===e.end&&!this.canInsertSemicolon()&&this.input.slice(e.start,e.end)==="async";while(true){var s=this.parseSubscript(e,t,r,n,i);if(s===e||s.type==="ArrowFunctionExpression"){return s}e=s}};dl.parseSubscript=function(e,t,r,n,i){var s=this.eat(bo.bracketL);if(s||this.eat(bo.dot)){var a=this.startNodeAt(t,r);a.object=e;a.property=s?this.parseExpression():this.parseIdent(this.options.allowReserved!=="never");a.computed=!!s;if(s){this.expect(bo.bracketR)}e=this.finishNode(a,"MemberExpression")}else if(!n&&this.eat(bo.parenL)){var o=new sl,l=this.yieldPos,u=this.awaitPos,c=this.awaitIdentPos;this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;var f=this.parseExprList(bo.parenR,this.options.ecmaVersion>=8,false,o);if(i&&!this.canInsertSemicolon()&&this.eat(bo.arrow)){this.checkPatternErrors(o,false);this.checkYieldAwaitInDefaultParams();if(this.awaitIdentPos>0){this.raise(this.awaitIdentPos,"Cannot use 'await' as identifier inside an async function")}this.yieldPos=l;this.awaitPos=u;this.awaitIdentPos=c;return this.parseArrowExpression(this.startNodeAt(t,r),f,true)}this.checkExpressionErrors(o,true);this.yieldPos=l||this.yieldPos;this.awaitPos=u||this.awaitPos;this.awaitIdentPos=c||this.awaitIdentPos;var h=this.startNodeAt(t,r);h.callee=e;h.arguments=f;e=this.finishNode(h,"CallExpression")}else if(this.type===bo.backQuote){var p=this.startNodeAt(t,r);p.tag=e;p.quasi=this.parseTemplate({isTagged:true});e=this.finishNode(p,"TaggedTemplateExpression")}return e};dl.parseExprAtom=function(e){if(this.type===bo.slash){this.readRegexp()}var t,r=this.potentialArrowAt===this.start;switch(this.type){case bo._super:if(!this.allowSuper){this.raise(this.start,"'super' keyword outside a method")}t=this.startNode();this.next();if(this.type===bo.parenL&&!this.allowDirectSuper){this.raise(t.start,"super() call outside constructor of a subclass")}if(this.type!==bo.dot&&this.type!==bo.bracketL&&this.type!==bo.parenL){this.unexpected()}return this.finishNode(t,"Super");case bo._this:t=this.startNode();this.next();return this.finishNode(t,"ThisExpression");case bo.name:var n=this.start,i=this.startLoc,s=this.containsEsc;var a=this.parseIdent(false);if(this.options.ecmaVersion>=8&&!s&&a.name==="async"&&!this.canInsertSemicolon()&&this.eat(bo._function)){return this.parseFunction(this.startNodeAt(n,i),0,false,true)}if(r&&!this.canInsertSemicolon()){if(this.eat(bo.arrow)){return this.parseArrowExpression(this.startNodeAt(n,i),[a],false)}if(this.options.ecmaVersion>=8&&a.name==="async"&&this.type===bo.name&&!s){a=this.parseIdent(false);if(this.canInsertSemicolon()||!this.eat(bo.arrow)){this.unexpected()}return this.parseArrowExpression(this.startNodeAt(n,i),[a],true)}}return a;case bo.regexp:var o=this.value;t=this.parseLiteral(o.value);t.regex={pattern:o.pattern,flags:o.flags};return t;case bo.num:case bo.string:return this.parseLiteral(this.value);case bo._null:case bo._true:case bo._false:t=this.startNode();t.value=this.type===bo._null?null:this.type===bo._true;t.raw=this.type.keyword;this.next();return this.finishNode(t,"Literal");case bo.parenL:var l=this.start,u=this.parseParenAndDistinguishExpression(r);if(e){if(e.parenthesizedAssign<0&&!this.isSimpleAssignTarget(u)){e.parenthesizedAssign=l}if(e.parenthesizedBind<0){e.parenthesizedBind=l}}return u;case bo.bracketL:t=this.startNode();this.next();t.elements=this.parseExprList(bo.bracketR,true,true,e);return this.finishNode(t,"ArrayExpression");case bo.braceL:return this.parseObj(false,e);case bo._function:t=this.startNode();this.next();return this.parseFunction(t,0);case bo._class:return this.parseClass(this.startNode(),false);case bo._new:return this.parseNew();case bo.backQuote:return this.parseTemplate();case bo._import:if(this.options.ecmaVersion>=11){return this.parseExprImport()}else{return this.unexpected()}default:this.unexpected()}};dl.parseExprImport=function(){var e=this.startNode();this.next();switch(this.type){case bo.parenL:return this.parseDynamicImport(e);default:this.unexpected()}};dl.parseDynamicImport=function(e){this.next();e.source=this.parseMaybeAssign();if(!this.eat(bo.parenR)){var t=this.start;if(this.eat(bo.comma)&&this.eat(bo.parenR)){this.raiseRecoverable(t,"Trailing comma is not allowed in import()")}else{this.unexpected(t)}}return this.finishNode(e,"ImportExpression")};dl.parseLiteral=function(e){var t=this.startNode();t.value=e;t.raw=this.input.slice(this.start,this.end);if(t.raw.charCodeAt(t.raw.length-1)===110){t.bigint=t.raw.slice(0,-1)}this.next();return this.finishNode(t,"Literal")};dl.parseParenExpression=function(){this.expect(bo.parenL);var e=this.parseExpression();this.expect(bo.parenR);return e};dl.parseParenAndDistinguishExpression=function(e){var t=this.start,r=this.startLoc,n,i=this.options.ecmaVersion>=8;if(this.options.ecmaVersion>=6){this.next();var s=this.start,a=this.startLoc;var o=[],l=true,u=false;var c=new sl,f=this.yieldPos,h=this.awaitPos,p;this.yieldPos=0;this.awaitPos=0;while(this.type!==bo.parenR){l?l=false:this.expect(bo.comma);if(i&&this.afterTrailingComma(bo.parenR,true)){u=true;break}else if(this.type===bo.ellipsis){p=this.start;o.push(this.parseParenItem(this.parseRestBinding()));if(this.type===bo.comma){this.raise(this.start,"Comma is not permitted after the rest element")}break}else{o.push(this.parseMaybeAssign(false,c,this.parseParenItem))}}var d=this.start,m=this.startLoc;this.expect(bo.parenR);if(e&&!this.canInsertSemicolon()&&this.eat(bo.arrow)){this.checkPatternErrors(c,false);this.checkYieldAwaitInDefaultParams();this.yieldPos=f;this.awaitPos=h;return this.parseParenArrowList(t,r,o)}if(!o.length||u){this.unexpected(this.lastTokStart)}if(p){this.unexpected(p)}this.checkExpressionErrors(c,true);this.yieldPos=f||this.yieldPos;this.awaitPos=h||this.awaitPos;if(o.length>1){n=this.startNodeAt(s,a);n.expressions=o;this.finishNodeAt(n,"SequenceExpression",d,m)}else{n=o[0]}}else{n=this.parseParenExpression()}if(this.options.preserveParens){var v=this.startNodeAt(t,r);v.expression=n;return this.finishNode(v,"ParenthesizedExpression")}else{return n}};dl.parseParenItem=function(e){return e};dl.parseParenArrowList=function(e,t,r){return this.parseArrowExpression(this.startNodeAt(e,t),r)};var ml=[];dl.parseNew=function(){var e=this.startNode();var t=this.parseIdent(true);if(this.options.ecmaVersion>=6&&this.eat(bo.dot)){e.meta=t;var r=this.containsEsc;e.property=this.parseIdent(true);if(e.property.name!=="target"||r){this.raiseRecoverable(e.property.start,"The only valid meta property for new is new.target")}if(!this.inNonArrowFunction()){this.raiseRecoverable(e.start,"new.target can only be used in functions")}return this.finishNode(e,"MetaProperty")}var n=this.start,i=this.startLoc,s=this.type===bo._import;e.callee=this.parseSubscripts(this.parseExprAtom(),n,i,true);if(s&&e.callee.type==="ImportExpression"){this.raise(n,"Cannot use new with import()")}if(this.eat(bo.parenL)){e.arguments=this.parseExprList(bo.parenR,this.options.ecmaVersion>=8,false)}else{e.arguments=ml}return this.finishNode(e,"NewExpression")};dl.parseTemplateElement=function(e){var t=e.isTagged;var r=this.startNode();if(this.type===bo.invalidTemplate){if(!t){this.raiseRecoverable(this.start,"Bad escape sequence in untagged template literal")}r.value={raw:this.value,cooked:null}}else{r.value={raw:this.input.slice(this.start,this.end).replace(/\r\n?/g,"\n"),cooked:this.value}}this.next();r.tail=this.type===bo.backQuote;return this.finishNode(r,"TemplateElement")};dl.parseTemplate=function(e){if(e===void 0)e={};var t=e.isTagged;if(t===void 0)t=false;var r=this.startNode();this.next();r.expressions=[];var n=this.parseTemplateElement({isTagged:t});r.quasis=[n];while(!n.tail){if(this.type===bo.eof){this.raise(this.pos,"Unterminated template literal")}this.expect(bo.dollarBraceL);r.expressions.push(this.parseExpression());this.expect(bo.braceR);r.quasis.push(n=this.parseTemplateElement({isTagged:t}))}this.next();return this.finishNode(r,"TemplateLiteral")};dl.isAsyncProp=function(e){return!e.computed&&e.key.type==="Identifier"&&e.key.name==="async"&&(this.type===bo.name||this.type===bo.num||this.type===bo.string||this.type===bo.bracketL||this.type.keyword||this.options.ecmaVersion>=9&&this.type===bo.star)&&!So.test(this.input.slice(this.lastTokEnd,this.start))};dl.parseObj=function(e,t){var r=this.startNode(),n=true,i={};r.properties=[];this.next();while(!this.eat(bo.braceR)){if(!n){this.expect(bo.comma);if(this.afterTrailingComma(bo.braceR)){break}}else{n=false}var s=this.parseProperty(e,t);if(!e){this.checkPropClash(s,i,t)}r.properties.push(s)}return this.finishNode(r,e?"ObjectPattern":"ObjectExpression")};dl.parseProperty=function(e,t){var r=this.startNode(),n,i,s,a;if(this.options.ecmaVersion>=9&&this.eat(bo.ellipsis)){if(e){r.argument=this.parseIdent(false);if(this.type===bo.comma){this.raise(this.start,"Comma is not permitted after the rest element")}return this.finishNode(r,"RestElement")}if(this.type===bo.parenL&&t){if(t.parenthesizedAssign<0){t.parenthesizedAssign=this.start}if(t.parenthesizedBind<0){t.parenthesizedBind=this.start}}r.argument=this.parseMaybeAssign(false,t);if(this.type===bo.comma&&t&&t.trailingComma<0){t.trailingComma=this.start}return this.finishNode(r,"SpreadElement")}if(this.options.ecmaVersion>=6){r.method=false;r.shorthand=false;if(e||t){s=this.start;a=this.startLoc}if(!e){n=this.eat(bo.star)}}var o=this.containsEsc;this.parsePropertyName(r);if(!e&&!o&&this.options.ecmaVersion>=8&&!n&&this.isAsyncProp(r)){i=true;n=this.options.ecmaVersion>=9&&this.eat(bo.star);this.parsePropertyName(r,t)}else{i=false}this.parsePropertyValue(r,e,n,i,s,a,t,o);return this.finishNode(r,"Property")};dl.parsePropertyValue=function(e,t,r,n,i,s,a,o){if((r||n)&&this.type===bo.colon){this.unexpected()}if(this.eat(bo.colon)){e.value=t?this.parseMaybeDefault(this.start,this.startLoc):this.parseMaybeAssign(false,a);e.kind="init"}else if(this.options.ecmaVersion>=6&&this.type===bo.parenL){if(t){this.unexpected()}e.kind="init";e.method=true;e.value=this.parseMethod(r,n)}else if(!t&&!o&&this.options.ecmaVersion>=5&&!e.computed&&e.key.type==="Identifier"&&(e.key.name==="get"||e.key.name==="set")&&this.type!==bo.comma&&this.type!==bo.braceR){if(r||n){this.unexpected()}e.kind=e.key.name;this.parsePropertyName(e);e.value=this.parseMethod(false);var l=e.kind==="get"?0:1;if(e.value.params.length!==l){var u=e.value.start;if(e.kind==="get"){this.raiseRecoverable(u,"getter should have no params")}else{this.raiseRecoverable(u,"setter should have exactly one param")}}else{if(e.kind==="set"&&e.value.params[0].type==="RestElement"){this.raiseRecoverable(e.value.params[0].start,"Setter cannot use rest params")}}}else if(this.options.ecmaVersion>=6&&!e.computed&&e.key.type==="Identifier"){if(r||n){this.unexpected()}this.checkUnreserved(e.key);if(e.key.name==="await"&&!this.awaitIdentPos){this.awaitIdentPos=i}e.kind="init";if(t){e.value=this.parseMaybeDefault(i,s,e.key)}else if(this.type===bo.eq&&a){if(a.shorthandAssign<0){a.shorthandAssign=this.start}e.value=this.parseMaybeDefault(i,s,e.key)}else{e.value=e.key}e.shorthand=true}else{this.unexpected()}};dl.parsePropertyName=function(e){if(this.options.ecmaVersion>=6){if(this.eat(bo.bracketL)){e.computed=true;e.key=this.parseMaybeAssign();this.expect(bo.bracketR);return e.key}else{e.computed=false}}return e.key=this.type===bo.num||this.type===bo.string?this.parseExprAtom():this.parseIdent(this.options.allowReserved!=="never")};dl.initFunction=function(e){e.id=null;if(this.options.ecmaVersion>=6){e.generator=e.expression=false}if(this.options.ecmaVersion>=8){e.async=false}};dl.parseMethod=function(e,t,r){var n=this.startNode(),i=this.yieldPos,s=this.awaitPos,a=this.awaitIdentPos;this.initFunction(n);if(this.options.ecmaVersion>=6){n.generator=e}if(this.options.ecmaVersion>=8){n.async=!!t}this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;this.enterScope(Ho(t,n.generator)|qo|(r?Wo:0));this.expect(bo.parenL);n.params=this.parseBindingList(bo.parenR,false,this.options.ecmaVersion>=8);this.checkYieldAwaitInDefaultParams();this.parseFunctionBody(n,false,true);this.yieldPos=i;this.awaitPos=s;this.awaitIdentPos=a;return this.finishNode(n,"FunctionExpression")};dl.parseArrowExpression=function(e,t,r){var n=this.yieldPos,i=this.awaitPos,s=this.awaitIdentPos;this.enterScope(Ho(r,false)|Xo);this.initFunction(e);if(this.options.ecmaVersion>=8){e.async=!!r}this.yieldPos=0;this.awaitPos=0;this.awaitIdentPos=0;e.params=this.toAssignableList(t,true);this.parseFunctionBody(e,true,false);this.yieldPos=n;this.awaitPos=i;this.awaitIdentPos=s;return this.finishNode(e,"ArrowFunctionExpression")};dl.parseFunctionBody=function(e,t,r){var n=t&&this.type!==bo.braceL;var i=this.strict,s=false;if(n){e.body=this.parseMaybeAssign();e.expression=true;this.checkParams(e,false)}else{var a=this.options.ecmaVersion>=7&&!this.isSimpleParamList(e.params);if(!i||a){s=this.strictDirective(this.end);if(s&&a){this.raiseRecoverable(e.start,"Illegal 'use strict' directive in function with non-simple parameter list")}}var o=this.labels;this.labels=[];if(s){this.strict=true}this.checkParams(e,!i&&!s&&!t&&!r&&this.isSimpleParamList(e.params));e.body=this.parseBlock(false);e.expression=false;this.adaptDirectivePrologue(e.body.body);this.labels=o}this.exitScope();if(this.strict&&e.id){this.checkLVal(e.id,el)}this.strict=i};dl.isSimpleParamList=function(e){for(var t=0,r=e;t<r.length;t+=1){var n=r[t];if(n.type!=="Identifier"){return false}}return true};dl.checkParams=function(e,t){var r={};for(var n=0,i=e.params;n<i.length;n+=1){var s=i[n];this.checkLVal(s,$o,t?null:r)}};dl.parseExprList=function(e,t,r,n){var i=[],s=true;while(!this.eat(e)){if(!s){this.expect(bo.comma);if(t&&this.afterTrailingComma(e)){break}}else{s=false}var a=void 0;if(r&&this.type===bo.comma){a=null}else if(this.type===bo.ellipsis){a=this.parseSpread(n);if(n&&this.type===bo.comma&&n.trailingComma<0){n.trailingComma=this.start}}else{a=this.parseMaybeAssign(false,n)}i.push(a)}return i};dl.checkUnreserved=function(e){var t=e.start;var r=e.end;var n=e.name;if(this.inGenerator&&n==="yield"){this.raiseRecoverable(t,"Cannot use 'yield' as identifier inside a generator")}if(this.inAsync&&n==="await"){this.raiseRecoverable(t,"Cannot use 'await' as identifier inside an async function")}if(this.keywords.test(n)){this.raise(t,"Unexpected keyword '"+n+"'")}if(this.options.ecmaVersion<6&&this.input.slice(t,r).indexOf("\\")!==-1){return}var i=this.strict?this.reservedWordsStrict:this.reservedWords;if(i.test(n)){if(!this.inAsync&&n==="await"){this.raiseRecoverable(t,"Cannot use keyword 'await' outside an async function")}this.raiseRecoverable(t,"The keyword '"+n+"' is reserved")}};dl.parseIdent=function(e,t){var r=this.startNode();if(this.type===bo.name){r.name=this.value}else if(this.type.keyword){r.name=this.type.keyword;if((r.name==="class"||r.name==="function")&&(this.lastTokEnd!==this.lastTokStart+1||this.input.charCodeAt(this.lastTokStart)!==46)){this.context.pop()}}else{this.unexpected()}this.next();this.finishNode(r,"Identifier");if(!e){this.checkUnreserved(r);if(r.name==="await"&&!this.awaitIdentPos){this.awaitIdentPos=r.start}}return r};dl.parseYield=function(e){if(!this.yieldPos){this.yieldPos=this.start}var t=this.startNode();this.next();if(this.type===bo.semi||this.canInsertSemicolon()||this.type!==bo.star&&!this.type.startsExpr){t.delegate=false;t.argument=null}else{t.delegate=this.eat(bo.star);t.argument=this.parseMaybeAssign(e)}return this.finishNode(t,"YieldExpression")};dl.parseAwait=function(){if(!this.awaitPos){this.awaitPos=this.start}var e=this.startNode();this.next();e.argument=this.parseMaybeUnary(null,true);return this.finishNode(e,"AwaitExpression")};var vl=tl.prototype;vl.raise=function(e,t){var r=Lo(this.input,e);t+=" ("+r.line+":"+r.column+")";var n=new SyntaxError(t);n.pos=e;n.loc=r;n.raisedAt=this.pos;throw n};vl.raiseRecoverable=vl.raise;vl.curPosition=function(){if(this.options.locations){return new Mo(this.curLine,this.pos-this.lineStart)}};var gl=tl.prototype;var yl=function e(t){this.flags=t;this.var=[];this.lexical=[];this.functions=[]};gl.enterScope=function(e){this.scopeStack.push(new yl(e))};gl.exitScope=function(){this.scopeStack.pop()};gl.treatFunctionsAsVarInScope=function(e){return e.flags&Uo||!this.inModule&&e.flags&jo};gl.declareName=function(e,t,r){var n=false;if(t===Yo){var i=this.currentScope();n=i.lexical.indexOf(e)>-1||i.functions.indexOf(e)>-1||i.var.indexOf(e)>-1;i.lexical.push(e);if(this.inModule&&i.flags&jo){delete this.undefinedExports[e]}}else if(t===Zo){var s=this.currentScope();s.lexical.push(e)}else if(t===Qo){var a=this.currentScope();if(this.treatFunctionsAsVar){n=a.lexical.indexOf(e)>-1}else{n=a.lexical.indexOf(e)>-1||a.var.indexOf(e)>-1}a.functions.push(e)}else{for(var o=this.scopeStack.length-1;o>=0;--o){var l=this.scopeStack[o];if(l.lexical.indexOf(e)>-1&&!(l.flags&Jo&&l.lexical[0]===e)||!this.treatFunctionsAsVarInScope(l)&&l.functions.indexOf(e)>-1){n=true;break}l.var.push(e);if(this.inModule&&l.flags&jo){delete this.undefinedExports[e]}if(l.flags&Vo){break}}}if(n){this.raiseRecoverable(r,"Identifier '"+e+"' has already been declared")}};gl.checkLocalExport=function(e){if(this.scopeStack[0].lexical.indexOf(e.name)===-1&&this.scopeStack[0].var.indexOf(e.name)===-1){this.undefinedExports[e.name]=e}};gl.currentScope=function(){return this.scopeStack[this.scopeStack.length-1]};gl.currentVarScope=function(){for(var e=this.scopeStack.length-1;;e--){var t=this.scopeStack[e];if(t.flags&Vo){return t}}};gl.currentThisScope=function(){for(var e=this.scopeStack.length-1;;e--){var t=this.scopeStack[e];if(t.flags&Vo&&!(t.flags&Xo)){return t}}};var xl=function e(t,r,n){this.type="";this.start=r;this.end=0;if(t.options.locations){this.loc=new No(t,n)}if(t.options.directSourceFile){this.sourceFile=t.options.directSourceFile}if(t.options.ranges){this.range=[r,0]}};var El=tl.prototype;El.startNode=function(){return new xl(this,this.start,this.startLoc)};El.startNodeAt=function(e,t){return new xl(this,e,t)};function bl(e,t,r,n){e.type=t;e.end=r;if(this.options.locations){e.loc.end=n}if(this.options.ranges){e.range[1]=r}return e}El.finishNode=function(e,t){return bl.call(this,e,t,this.lastTokEnd,this.lastTokEndLoc)};El.finishNodeAt=function(e,t,r,n){return bl.call(this,e,t,r,n)};var Sl=function e(t,r,n,i,s){this.token=t;this.isExpr=!!r;this.preserveSpace=!!n;this.override=i;this.generator=!!s};var Dl={b_stat:new Sl("{",false),b_expr:new Sl("{",true),b_tmpl:new Sl("${",false),p_stat:new Sl("(",false),p_expr:new Sl("(",true),q_tmpl:new Sl("`",true,true,function(e){return e.tryReadTemplateToken()}),f_stat:new Sl("function",false),f_expr:new Sl("function",true),f_expr_gen:new Sl("function",true,false,null,true),f_gen:new Sl("function",false,false,null,true)};var Cl=tl.prototype;Cl.initialContext=function(){return[Dl.b_stat]};Cl.braceIsBlock=function(e){var t=this.curContext();if(t===Dl.f_expr||t===Dl.f_stat){return true}if(e===bo.colon&&(t===Dl.b_stat||t===Dl.b_expr)){return!t.isExpr}if(e===bo._return||e===bo.name&&this.exprAllowed){return So.test(this.input.slice(this.lastTokEnd,this.start))}if(e===bo._else||e===bo.semi||e===bo.eof||e===bo.parenR||e===bo.arrow){return true}if(e===bo.braceL){return t===Dl.b_stat}if(e===bo._var||e===bo._const||e===bo.name){return false}return!this.exprAllowed};Cl.inGeneratorContext=function(){for(var e=this.context.length-1;e>=1;e--){var t=this.context[e];if(t.token==="function"){return t.generator}}return false};Cl.updateContext=function(e){var t,r=this.type;if(r.keyword&&e===bo.dot){this.exprAllowed=false}else if(t=r.updateContext){t.call(this,e)}else{this.exprAllowed=r.beforeExpr}};bo.parenR.updateContext=bo.braceR.updateContext=function(){if(this.context.length===1){this.exprAllowed=true;return}var e=this.context.pop();if(e===Dl.b_stat&&this.curContext().token==="function"){e=this.context.pop()}this.exprAllowed=!e.isExpr};bo.braceL.updateContext=function(e){this.context.push(this.braceIsBlock(e)?Dl.b_stat:Dl.b_expr);this.exprAllowed=true};bo.dollarBraceL.updateContext=function(){this.context.push(Dl.b_tmpl);this.exprAllowed=true};bo.parenL.updateContext=function(e){var t=e===bo._if||e===bo._for||e===bo._with||e===bo._while;this.context.push(t?Dl.p_stat:Dl.p_expr);this.exprAllowed=true};bo.incDec.updateContext=function(){};bo._function.updateContext=bo._class.updateContext=function(e){if(e.beforeExpr&&e!==bo.semi&&e!==bo._else&&!(e===bo._return&&So.test(this.input.slice(this.lastTokEnd,this.start)))&&!((e===bo.colon||e===bo.braceL)&&this.curContext()===Dl.b_stat)){this.context.push(Dl.f_expr)}else{this.context.push(Dl.f_stat)}this.exprAllowed=false};bo.backQuote.updateContext=function(){if(this.curContext()===Dl.q_tmpl){this.context.pop()}else{this.context.push(Dl.q_tmpl)}this.exprAllowed=false};bo.star.updateContext=function(e){if(e===bo._function){var t=this.context.length-1;if(this.context[t]===Dl.f_expr){this.context[t]=Dl.f_expr_gen}else{this.context[t]=Dl.f_gen}}this.exprAllowed=true};bo.name.updateContext=function(e){var t=false;if(this.options.ecmaVersion>=6&&e!==bo.dot){if(this.value==="of"&&!this.exprAllowed||this.value==="yield"&&this.inGeneratorContext()){t=true}}this.exprAllowed=t};var wl="ASCII ASCII_Hex_Digit AHex Alphabetic Alpha Any Assigned Bidi_Control Bidi_C Bidi_Mirrored Bidi_M Case_Ignorable CI Cased Changes_When_Casefolded CWCF Changes_When_Casemapped CWCM Changes_When_Lowercased CWL Changes_When_NFKC_Casefolded CWKCF Changes_When_Titlecased CWT Changes_When_Uppercased CWU Dash Default_Ignorable_Code_Point DI Deprecated Dep Diacritic Dia Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Extender Ext Grapheme_Base Gr_Base Grapheme_Extend Gr_Ext Hex_Digit Hex IDS_Binary_Operator IDSB IDS_Trinary_Operator IDST ID_Continue IDC ID_Start IDS Ideographic Ideo Join_Control Join_C Logical_Order_Exception LOE Lowercase Lower Math Noncharacter_Code_Point NChar Pattern_Syntax Pat_Syn Pattern_White_Space Pat_WS Quotation_Mark QMark Radical Regional_Indicator RI Sentence_Terminal STerm Soft_Dotted SD Terminal_Punctuation Term Unified_Ideograph UIdeo Uppercase Upper Variation_Selector VS White_Space space XID_Continue XIDC XID_Start XIDS";var Al=wl+" Extended_Pictographic";var Tl=Al;var kl={9:wl,10:Al,11:Tl};var _l="Cased_Letter LC Close_Punctuation Pe Connector_Punctuation Pc Control Cc cntrl Currency_Symbol Sc Dash_Punctuation Pd Decimal_Number Nd digit Enclosing_Mark Me Final_Punctuation Pf Format Cf Initial_Punctuation Pi Letter L Letter_Number Nl Line_Separator Zl Lowercase_Letter Ll Mark M Combining_Mark Math_Symbol Sm Modifier_Letter Lm Modifier_Symbol Sk Nonspacing_Mark Mn Number N Open_Punctuation Ps Other C Other_Letter Lo Other_Number No Other_Punctuation Po Other_Symbol So Paragraph_Separator Zp Private_Use Co Punctuation P punct Separator Z Space_Separator Zs Spacing_Mark Mc Surrogate Cs Symbol S Titlecase_Letter Lt Unassigned Cn Uppercase_Letter Lu";var Pl="Adlam Adlm Ahom Ahom Anatolian_Hieroglyphs Hluw Arabic Arab Armenian Armn Avestan Avst Balinese Bali Bamum Bamu Bassa_Vah Bass Batak Batk Bengali Beng Bhaiksuki Bhks Bopomofo Bopo Brahmi Brah Braille Brai Buginese Bugi Buhid Buhd Canadian_Aboriginal Cans Carian Cari Caucasian_Albanian Aghb Chakma Cakm Cham Cham Cherokee Cher Common Zyyy Coptic Copt Qaac Cuneiform Xsux Cypriot Cprt Cyrillic Cyrl Deseret Dsrt Devanagari Deva Duployan Dupl Egyptian_Hieroglyphs Egyp Elbasan Elba Ethiopic Ethi Georgian Geor Glagolitic Glag Gothic Goth Grantha Gran Greek Grek Gujarati Gujr Gurmukhi Guru Han Hani Hangul Hang Hanunoo Hano Hatran Hatr Hebrew Hebr Hiragana Hira Imperial_Aramaic Armi Inherited Zinh Qaai Inscriptional_Pahlavi Phli Inscriptional_Parthian Prti Javanese Java Kaithi Kthi Kannada Knda Katakana Kana Kayah_Li Kali Kharoshthi Khar Khmer Khmr Khojki Khoj Khudawadi Sind Lao Laoo Latin Latn Lepcha Lepc Limbu Limb Linear_A Lina Linear_B Linb Lisu Lisu Lycian Lyci Lydian Lydi Mahajani Mahj Malayalam Mlym Mandaic Mand Manichaean Mani Marchen Marc Masaram_Gondi Gonm Meetei_Mayek Mtei Mende_Kikakui Mend Meroitic_Cursive Merc Meroitic_Hieroglyphs Mero Miao Plrd Modi Modi Mongolian Mong Mro Mroo Multani Mult Myanmar Mymr Nabataean Nbat New_Tai_Lue Talu Newa Newa Nko Nkoo Nushu Nshu Ogham Ogam Ol_Chiki Olck Old_Hungarian Hung Old_Italic Ital Old_North_Arabian Narb Old_Permic Perm Old_Persian Xpeo Old_South_Arabian Sarb Old_Turkic Orkh Oriya Orya Osage Osge Osmanya Osma Pahawh_Hmong Hmng Palmyrene Palm Pau_Cin_Hau Pauc Phags_Pa Phag Phoenician Phnx Psalter_Pahlavi Phlp Rejang Rjng Runic Runr Samaritan Samr Saurashtra Saur Sharada Shrd Shavian Shaw Siddham Sidd SignWriting Sgnw Sinhala Sinh Sora_Sompeng Sora Soyombo Soyo Sundanese Sund Syloti_Nagri Sylo Syriac Syrc Tagalog Tglg Tagbanwa Tagb Tai_Le Tale Tai_Tham Lana Tai_Viet Tavt Takri Takr Tamil Taml Tangut Tang Telugu Telu Thaana Thaa Thai Thai Tibetan Tibt Tifinagh Tfng Tirhuta Tirh Ugaritic Ugar Vai Vaii Warang_Citi Wara Yi Yiii Zanabazar_Square Zanb";var Fl=Pl+" Dogra Dogr Gunjala_Gondi Gong Hanifi_Rohingya Rohg Makasar Maka Medefaidrin Medf Old_Sogdian Sogo Sogdian Sogd";var Il=Fl+" Elymaic Elym Nandinagari Nand Nyiakeng_Puachue_Hmong Hmnp Wancho Wcho";var Ml={9:Pl,10:Fl,11:Il};var Nl={};function Ll(e){var t=Nl[e]={binary:Io(kl[e]+" "+_l),nonBinary:{General_Category:Io(_l),Script:Io(Ml[e])}};t.nonBinary.Script_Extensions=t.nonBinary.Script;t.nonBinary.gc=t.nonBinary.General_Category;t.nonBinary.sc=t.nonBinary.Script;t.nonBinary.scx=t.nonBinary.Script_Extensions}Ll(9);Ll(10);Ll(11);var Bl=tl.prototype;var Ol=function e(t){this.parser=t;this.validFlags="gim"+(t.options.ecmaVersion>=6?"uy":"")+(t.options.ecmaVersion>=9?"s":"");this.unicodeProperties=Nl[t.options.ecmaVersion>=11?11:t.options.ecmaVersion];this.source="";this.flags="";this.start=0;this.switchU=false;this.switchN=false;this.pos=0;this.lastIntValue=0;this.lastStringValue="";this.lastAssertionIsQuantifiable=false;this.numCapturingParens=0;this.maxBackReference=0;this.groupNames=[];this.backReferenceNames=[]};Ol.prototype.reset=function e(t,r,n){var i=n.indexOf("u")!==-1;this.start=t|0;this.source=r+"";this.flags=n;this.switchU=i&&this.parser.options.ecmaVersion>=6;this.switchN=i&&this.parser.options.ecmaVersion>=9};Ol.prototype.raise=function e(t){this.parser.raiseRecoverable(this.start,"Invalid regular expression: /"+this.source+"/: "+t)};Ol.prototype.at=function e(t){var r=this.source;var n=r.length;if(t>=n){return-1}var i=r.charCodeAt(t);if(!this.switchU||i<=55295||i>=57344||t+1>=n){return i}return(i<<10)+r.charCodeAt(t+1)-56613888};Ol.prototype.nextIndex=function e(t){var r=this.source;var n=r.length;if(t>=n){return n}var i=r.charCodeAt(t);if(!this.switchU||i<=55295||i>=57344||t+1>=n){return t+1}return t+2};Ol.prototype.current=function e(){return this.at(this.pos)};Ol.prototype.lookahead=function e(){return this.at(this.nextIndex(this.pos))};Ol.prototype.advance=function e(){this.pos=this.nextIndex(this.pos)};Ol.prototype.eat=function e(t){if(this.current()===t){this.advance();return true}return false};function Rl(e){if(e<=65535){return String.fromCharCode(e)}e-=65536;return String.fromCharCode((e>>10)+55296,(e&1023)+56320)}Bl.validateRegExpFlags=function(e){var t=e.validFlags;var r=e.flags;for(var n=0;n<r.length;n++){var i=r.charAt(n);if(t.indexOf(i)===-1){this.raise(e.start,"Invalid regular expression flag")}if(r.indexOf(i,n+1)>-1){this.raise(e.start,"Duplicate regular expression flag")}}};Bl.validateRegExpPattern=function(e){this.regexp_pattern(e);if(!e.switchN&&this.options.ecmaVersion>=9&&e.groupNames.length>0){e.switchN=true;this.regexp_pattern(e)}};Bl.regexp_pattern=function(e){e.pos=0;e.lastIntValue=0;e.lastStringValue="";e.lastAssertionIsQuantifiable=false;e.numCapturingParens=0;e.maxBackReference=0;e.groupNames.length=0;e.backReferenceNames.length=0;this.regexp_disjunction(e);if(e.pos!==e.source.length){if(e.eat(41)){e.raise("Unmatched ')'")}if(e.eat(93)||e.eat(125)){e.raise("Lone quantifier brackets")}}if(e.maxBackReference>e.numCapturingParens){e.raise("Invalid escape")}for(var t=0,r=e.backReferenceNames;t<r.length;t+=1){var n=r[t];if(e.groupNames.indexOf(n)===-1){e.raise("Invalid named capture referenced")}}};Bl.regexp_disjunction=function(e){this.regexp_alternative(e);while(e.eat(124)){this.regexp_alternative(e)}if(this.regexp_eatQuantifier(e,true)){e.raise("Nothing to repeat")}if(e.eat(123)){e.raise("Lone quantifier brackets")}};Bl.regexp_alternative=function(e){while(e.pos<e.source.length&&this.regexp_eatTerm(e)){}};Bl.regexp_eatTerm=function(e){if(this.regexp_eatAssertion(e)){if(e.lastAssertionIsQuantifiable&&this.regexp_eatQuantifier(e)){if(e.switchU){e.raise("Invalid quantifier")}}return true}if(e.switchU?this.regexp_eatAtom(e):this.regexp_eatExtendedAtom(e)){this.regexp_eatQuantifier(e);return true}return false};Bl.regexp_eatAssertion=function(e){var t=e.pos;e.lastAssertionIsQuantifiable=false;if(e.eat(94)||e.eat(36)){return true}if(e.eat(92)){if(e.eat(66)||e.eat(98)){return true}e.pos=t}if(e.eat(40)&&e.eat(63)){var r=false;if(this.options.ecmaVersion>=9){r=e.eat(60)}if(e.eat(61)||e.eat(33)){this.regexp_disjunction(e);if(!e.eat(41)){e.raise("Unterminated group")}e.lastAssertionIsQuantifiable=!r;return true}}e.pos=t;return false};Bl.regexp_eatQuantifier=function(e,t){if(t===void 0)t=false;if(this.regexp_eatQuantifierPrefix(e,t)){e.eat(63);return true}return false};Bl.regexp_eatQuantifierPrefix=function(e,t){return e.eat(42)||e.eat(43)||e.eat(63)||this.regexp_eatBracedQuantifier(e,t)};Bl.regexp_eatBracedQuantifier=function(e,t){var r=e.pos;if(e.eat(123)){var n=0,i=-1;if(this.regexp_eatDecimalDigits(e)){n=e.lastIntValue;if(e.eat(44)&&this.regexp_eatDecimalDigits(e)){i=e.lastIntValue}if(e.eat(125)){if(i!==-1&&i<n&&!t){e.raise("numbers out of order in {} quantifier")}return true}}if(e.switchU&&!t){e.raise("Incomplete quantifier")}e.pos=r}return false};Bl.regexp_eatAtom=function(e){return this.regexp_eatPatternCharacters(e)||e.eat(46)||this.regexp_eatReverseSolidusAtomEscape(e)||this.regexp_eatCharacterClass(e)||this.regexp_eatUncapturingGroup(e)||this.regexp_eatCapturingGroup(e)};Bl.regexp_eatReverseSolidusAtomEscape=function(e){var t=e.pos;if(e.eat(92)){if(this.regexp_eatAtomEscape(e)){return true}e.pos=t}return false};Bl.regexp_eatUncapturingGroup=function(e){var t=e.pos;if(e.eat(40)){if(e.eat(63)&&e.eat(58)){this.regexp_disjunction(e);if(e.eat(41)){return true}e.raise("Unterminated group")}e.pos=t}return false};Bl.regexp_eatCapturingGroup=function(e){if(e.eat(40)){if(this.options.ecmaVersion>=9){this.regexp_groupSpecifier(e)}else if(e.current()===63){e.raise("Invalid group")}this.regexp_disjunction(e);if(e.eat(41)){e.numCapturingParens+=1;return true}e.raise("Unterminated group")}return false};Bl.regexp_eatExtendedAtom=function(e){return e.eat(46)||this.regexp_eatReverseSolidusAtomEscape(e)||this.regexp_eatCharacterClass(e)||this.regexp_eatUncapturingGroup(e)||this.regexp_eatCapturingGroup(e)||this.regexp_eatInvalidBracedQuantifier(e)||this.regexp_eatExtendedPatternCharacter(e)};Bl.regexp_eatInvalidBracedQuantifier=function(e){if(this.regexp_eatBracedQuantifier(e,true)){e.raise("Nothing to repeat")}return false};Bl.regexp_eatSyntaxCharacter=function(e){var t=e.current();if(jl(t)){e.lastIntValue=t;e.advance();return true}return false};function jl(e){return e===36||e>=40&&e<=43||e===46||e===63||e>=91&&e<=94||e>=123&&e<=125}Bl.regexp_eatPatternCharacters=function(e){var t=e.pos;var r=0;while((r=e.current())!==-1&&!jl(r)){e.advance()}return e.pos!==t};Bl.regexp_eatExtendedPatternCharacter=function(e){var t=e.current();if(t!==-1&&t!==36&&!(t>=40&&t<=43)&&t!==46&&t!==63&&t!==91&&t!==94&&t!==124){e.advance();return true}return false};Bl.regexp_groupSpecifier=function(e){if(e.eat(63)){if(this.regexp_eatGroupName(e)){if(e.groupNames.indexOf(e.lastStringValue)!==-1){e.raise("Duplicate capture group name")}e.groupNames.push(e.lastStringValue);return}e.raise("Invalid group")}};Bl.regexp_eatGroupName=function(e){e.lastStringValue="";if(e.eat(60)){if(this.regexp_eatRegExpIdentifierName(e)&&e.eat(62)){return true}e.raise("Invalid capture group name")}return false};Bl.regexp_eatRegExpIdentifierName=function(e){e.lastStringValue="";if(this.regexp_eatRegExpIdentifierStart(e)){e.lastStringValue+=Rl(e.lastIntValue);while(this.regexp_eatRegExpIdentifierPart(e)){e.lastStringValue+=Rl(e.lastIntValue)}return true}return false};Bl.regexp_eatRegExpIdentifierStart=function(e){var t=e.pos;var r=e.current();e.advance();if(r===92&&this.regexp_eatRegExpUnicodeEscapeSequence(e)){r=e.lastIntValue}if(Ul(r)){e.lastIntValue=r;return true}e.pos=t;return false};function Ul(e){return ho(e,true)||e===36||e===95}Bl.regexp_eatRegExpIdentifierPart=function(e){var t=e.pos;var r=e.current();e.advance();if(r===92&&this.regexp_eatRegExpUnicodeEscapeSequence(e)){r=e.lastIntValue}if(Vl(r)){e.lastIntValue=r;return true}e.pos=t;return false};function Vl(e){return po(e,true)||e===36||e===95||e===8204||e===8205}Bl.regexp_eatAtomEscape=function(e){if(this.regexp_eatBackReference(e)||this.regexp_eatCharacterClassEscape(e)||this.regexp_eatCharacterEscape(e)||e.switchN&&this.regexp_eatKGroupName(e)){return true}if(e.switchU){if(e.current()===99){e.raise("Invalid unicode escape")}e.raise("Invalid escape")}return false};Bl.regexp_eatBackReference=function(e){var t=e.pos;if(this.regexp_eatDecimalEscape(e)){var r=e.lastIntValue;if(e.switchU){if(r>e.maxBackReference){e.maxBackReference=r}return true}if(r<=e.numCapturingParens){return true}e.pos=t}return false};Bl.regexp_eatKGroupName=function(e){if(e.eat(107)){if(this.regexp_eatGroupName(e)){e.backReferenceNames.push(e.lastStringValue);return true}e.raise("Invalid named reference")}return false};Bl.regexp_eatCharacterEscape=function(e){return this.regexp_eatControlEscape(e)||this.regexp_eatCControlLetter(e)||this.regexp_eatZero(e)||this.regexp_eatHexEscapeSequence(e)||this.regexp_eatRegExpUnicodeEscapeSequence(e)||!e.switchU&&this.regexp_eatLegacyOctalEscapeSequence(e)||this.regexp_eatIdentityEscape(e)};Bl.regexp_eatCControlLetter=function(e){var t=e.pos;if(e.eat(99)){if(this.regexp_eatControlLetter(e)){return true}e.pos=t}return false};Bl.regexp_eatZero=function(e){if(e.current()===48&&!Wl(e.lookahead())){e.lastIntValue=0;e.advance();return true}return false};Bl.regexp_eatControlEscape=function(e){var t=e.current();if(t===116){e.lastIntValue=9;e.advance();return true}if(t===110){e.lastIntValue=10;e.advance();return true}if(t===118){e.lastIntValue=11;e.advance();return true}if(t===102){e.lastIntValue=12;e.advance();return true}if(t===114){e.lastIntValue=13;e.advance();return true}return false};Bl.regexp_eatControlLetter=function(e){var t=e.current();if(Gl(t)){e.lastIntValue=t%32;e.advance();return true}return false};function Gl(e){return e>=65&&e<=90||e>=97&&e<=122}Bl.regexp_eatRegExpUnicodeEscapeSequence=function(e){var t=e.pos;if(e.eat(117)){if(this.regexp_eatFixedHexDigits(e,4)){var r=e.lastIntValue;if(e.switchU&&r>=55296&&r<=56319){var n=e.pos;if(e.eat(92)&&e.eat(117)&&this.regexp_eatFixedHexDigits(e,4)){var i=e.lastIntValue;if(i>=56320&&i<=57343){e.lastIntValue=(r-55296)*1024+(i-56320)+65536;return true}}e.pos=n;e.lastIntValue=r}return true}if(e.switchU&&e.eat(123)&&this.regexp_eatHexDigits(e)&&e.eat(125)&&zl(e.lastIntValue)){return true}if(e.switchU){e.raise("Invalid unicode escape")}e.pos=t}return false};function zl(e){return e>=0&&e<=1114111}Bl.regexp_eatIdentityEscape=function(e){if(e.switchU){if(this.regexp_eatSyntaxCharacter(e)){return true}if(e.eat(47)){e.lastIntValue=47;return true}return false}var t=e.current();if(t!==99&&(!e.switchN||t!==107)){e.lastIntValue=t;e.advance();return true}return false};Bl.regexp_eatDecimalEscape=function(e){e.lastIntValue=0;var t=e.current();if(t>=49&&t<=57){do{e.lastIntValue=10*e.lastIntValue+(t-48);e.advance()}while((t=e.current())>=48&&t<=57);return true}return false};Bl.regexp_eatCharacterClassEscape=function(e){var t=e.current();if(Xl(t)){e.lastIntValue=-1;e.advance();return true}if(e.switchU&&this.options.ecmaVersion>=9&&(t===80||t===112)){e.lastIntValue=-1;e.advance();if(e.eat(123)&&this.regexp_eatUnicodePropertyValueExpression(e)&&e.eat(125)){return true}e.raise("Invalid property name")}return false};function Xl(e){return e===100||e===68||e===115||e===83||e===119||e===87}Bl.regexp_eatUnicodePropertyValueExpression=function(e){var t=e.pos;if(this.regexp_eatUnicodePropertyName(e)&&e.eat(61)){var r=e.lastStringValue;if(this.regexp_eatUnicodePropertyValue(e)){var n=e.lastStringValue;this.regexp_validateUnicodePropertyNameAndValue(e,r,n);return true}}e.pos=t;if(this.regexp_eatLoneUnicodePropertyNameOrValue(e)){var i=e.lastStringValue;this.regexp_validateUnicodePropertyNameOrValue(e,i);return true}return false};Bl.regexp_validateUnicodePropertyNameAndValue=function(e,t,r){if(!Po(e.unicodeProperties.nonBinary,t)){e.raise("Invalid property name")}if(!e.unicodeProperties.nonBinary[t].test(r)){e.raise("Invalid property value")}};Bl.regexp_validateUnicodePropertyNameOrValue=function(e,t){if(!e.unicodeProperties.binary.test(t)){e.raise("Invalid property name")}};Bl.regexp_eatUnicodePropertyName=function(e){var t=0;e.lastStringValue="";while(Jl(t=e.current())){e.lastStringValue+=Rl(t);e.advance()}return e.lastStringValue!==""};function Jl(e){return Gl(e)||e===95}Bl.regexp_eatUnicodePropertyValue=function(e){var t=0;e.lastStringValue="";while(ql(t=e.current())){e.lastStringValue+=Rl(t);e.advance()}return e.lastStringValue!==""};function ql(e){return Jl(e)||Wl(e)}Bl.regexp_eatLoneUnicodePropertyNameOrValue=function(e){return this.regexp_eatUnicodePropertyValue(e)};Bl.regexp_eatCharacterClass=function(e){if(e.eat(91)){e.eat(94);this.regexp_classRanges(e);if(e.eat(93)){return true}e.raise("Unterminated character class")}return false};Bl.regexp_classRanges=function(e){while(this.regexp_eatClassAtom(e)){var t=e.lastIntValue;if(e.eat(45)&&this.regexp_eatClassAtom(e)){var r=e.lastIntValue;if(e.switchU&&(t===-1||r===-1)){e.raise("Invalid character class")}if(t!==-1&&r!==-1&&t>r){e.raise("Range out of order in character class")}}}};Bl.regexp_eatClassAtom=function(e){var t=e.pos;if(e.eat(92)){if(this.regexp_eatClassEscape(e)){return true}if(e.switchU){var r=e.current();if(r===99||$l(r)){e.raise("Invalid class escape")}e.raise("Invalid escape")}e.pos=t}var n=e.current();if(n!==93){e.lastIntValue=n;e.advance();return true}return false};Bl.regexp_eatClassEscape=function(e){var t=e.pos;if(e.eat(98)){e.lastIntValue=8;return true}if(e.switchU&&e.eat(45)){e.lastIntValue=45;return true}if(!e.switchU&&e.eat(99)){if(this.regexp_eatClassControlLetter(e)){return true}e.pos=t}return this.regexp_eatCharacterClassEscape(e)||this.regexp_eatCharacterEscape(e)};Bl.regexp_eatClassControlLetter=function(e){var t=e.current();if(Wl(t)||t===95){e.lastIntValue=t%32;e.advance();return true}return false};Bl.regexp_eatHexEscapeSequence=function(e){var t=e.pos;if(e.eat(120)){if(this.regexp_eatFixedHexDigits(e,2)){return true}if(e.switchU){e.raise("Invalid escape")}e.pos=t}return false};Bl.regexp_eatDecimalDigits=function(e){var t=e.pos;var r=0;e.lastIntValue=0;while(Wl(r=e.current())){e.lastIntValue=10*e.lastIntValue+(r-48);e.advance()}return e.pos!==t};function Wl(e){return e>=48&&e<=57}Bl.regexp_eatHexDigits=function(e){var t=e.pos;var r=0;e.lastIntValue=0;while(Hl(r=e.current())){e.lastIntValue=16*e.lastIntValue+Kl(r);e.advance()}return e.pos!==t};function Hl(e){return e>=48&&e<=57||e>=65&&e<=70||e>=97&&e<=102}function Kl(e){if(e>=65&&e<=70){return 10+(e-65)}if(e>=97&&e<=102){return 10+(e-97)}return e-48}Bl.regexp_eatLegacyOctalEscapeSequence=function(e){if(this.regexp_eatOctalDigit(e)){var t=e.lastIntValue;if(this.regexp_eatOctalDigit(e)){var r=e.lastIntValue;if(t<=3&&this.regexp_eatOctalDigit(e)){e.lastIntValue=t*64+r*8+e.lastIntValue}else{e.lastIntValue=t*8+r}}else{e.lastIntValue=t}return true}return false};Bl.regexp_eatOctalDigit=function(e){var t=e.current();if($l(t)){e.lastIntValue=t-48;e.advance();return true}e.lastIntValue=0;return false};function $l(e){return e>=48&&e<=55}Bl.regexp_eatFixedHexDigits=function(e,t){var r=e.pos;e.lastIntValue=0;for(var n=0;n<t;++n){var i=e.current();if(!Hl(i)){e.pos=r;return false}e.lastIntValue=16*e.lastIntValue+Kl(i);e.advance()}return true};var Yl=function e(t){this.type=t.type;this.value=t.value;this.start=t.start;this.end=t.end;if(t.options.locations){this.loc=new No(t,t.startLoc,t.endLoc)}if(t.options.ranges){this.range=[t.start,t.end]}};var Ql=tl.prototype;Ql.next=function(){if(this.options.onToken){this.options.onToken(new Yl(this))}this.lastTokEnd=this.end;this.lastTokStart=this.start;this.lastTokEndLoc=this.endLoc;this.lastTokStartLoc=this.startLoc;this.nextToken()};Ql.getToken=function(){this.next();return new Yl(this)};if(typeof Symbol!=="undefined"){Ql[Symbol.iterator]=function(){var e=this;return{next:function t(){var r=e.getToken();return{done:r.type===bo.eof,value:r}}}}}Ql.curContext=function(){return this.context[this.context.length-1]};Ql.nextToken=function(){var e=this.curContext();if(!e||!e.preserveSpace){this.skipSpace()}this.start=this.pos;if(this.options.locations){this.startLoc=this.curPosition()}if(this.pos>=this.input.length){return this.finishToken(bo.eof)}if(e.override){return e.override(this)}else{this.readToken(this.fullCharCodeAtPos())}};Ql.readToken=function(e){if(ho(e,this.options.ecmaVersion>=6)||e===92){return this.readWord()}return this.getTokenFromCode(e)};Ql.fullCharCodeAtPos=function(){var e=this.input.charCodeAt(this.pos);if(e<=55295||e>=57344){return e}var t=this.input.charCodeAt(this.pos+1);return(e<<10)+t-56613888};Ql.skipBlockComment=function(){var e=this.options.onComment&&this.curPosition();var t=this.pos,r=this.input.indexOf("*/",this.pos+=2);if(r===-1){this.raise(this.pos-2,"Unterminated comment")}this.pos=r+2;if(this.options.locations){Do.lastIndex=t;var n;while((n=Do.exec(this.input))&&n.index<this.pos){++this.curLine;this.lineStart=n.index+n[0].length}}if(this.options.onComment){this.options.onComment(true,this.input.slice(t+2,r),t,this.pos,e,this.curPosition())}};Ql.skipLineComment=function(e){var t=this.pos;var r=this.options.onComment&&this.curPosition();var n=this.input.charCodeAt(this.pos+=e);while(this.pos<this.input.length&&!Co(n)){n=this.input.charCodeAt(++this.pos)}if(this.options.onComment){this.options.onComment(false,this.input.slice(t+e,this.pos),t,this.pos,r,this.curPosition())}};Ql.skipSpace=function(){e:while(this.pos<this.input.length){var e=this.input.charCodeAt(this.pos);switch(e){case 32:case 160:++this.pos;break;case 13:if(this.input.charCodeAt(this.pos+1)===10){++this.pos}case 10:case 8232:case 8233:++this.pos;if(this.options.locations){++this.curLine;this.lineStart=this.pos}break;case 47:switch(this.input.charCodeAt(this.pos+1)){case 42:this.skipBlockComment();break;case 47:this.skipLineComment(2);break;default:break e}break;default:if(e>8&&e<14||e>=5760&&wo.test(String.fromCharCode(e))){++this.pos}else{break e}}}};Ql.finishToken=function(e,t){this.end=this.pos;if(this.options.locations){this.endLoc=this.curPosition()}var r=this.type;this.type=e;this.value=t;this.updateContext(r)};Ql.readToken_dot=function(){var e=this.input.charCodeAt(this.pos+1);if(e>=48&&e<=57){return this.readNumber(true)}var t=this.input.charCodeAt(this.pos+2);if(this.options.ecmaVersion>=6&&e===46&&t===46){this.pos+=3;return this.finishToken(bo.ellipsis)}else{++this.pos;return this.finishToken(bo.dot)}};Ql.readToken_slash=function(){var e=this.input.charCodeAt(this.pos+1);if(this.exprAllowed){++this.pos;return this.readRegexp()}if(e===61){return this.finishOp(bo.assign,2)}return this.finishOp(bo.slash,1)};Ql.readToken_mult_modulo_exp=function(e){var t=this.input.charCodeAt(this.pos+1);var r=1;var n=e===42?bo.star:bo.modulo;if(this.options.ecmaVersion>=7&&e===42&&t===42){++r;n=bo.starstar;t=this.input.charCodeAt(this.pos+2)}if(t===61){return this.finishOp(bo.assign,r+1)}return this.finishOp(n,r)};Ql.readToken_pipe_amp=function(e){var t=this.input.charCodeAt(this.pos+1);if(t===e){return this.finishOp(e===124?bo.logicalOR:bo.logicalAND,2)}if(t===61){return this.finishOp(bo.assign,2)}return this.finishOp(e===124?bo.bitwiseOR:bo.bitwiseAND,1)};Ql.readToken_caret=function(){var e=this.input.charCodeAt(this.pos+1);if(e===61){return this.finishOp(bo.assign,2)}return this.finishOp(bo.bitwiseXOR,1)};Ql.readToken_plus_min=function(e){var t=this.input.charCodeAt(this.pos+1);if(t===e){if(t===45&&!this.inModule&&this.input.charCodeAt(this.pos+2)===62&&(this.lastTokEnd===0||So.test(this.input.slice(this.lastTokEnd,this.pos)))){this.skipLineComment(3);this.skipSpace();return this.nextToken()}return this.finishOp(bo.incDec,2)}if(t===61){return this.finishOp(bo.assign,2)}return this.finishOp(bo.plusMin,1)};Ql.readToken_lt_gt=function(e){var t=this.input.charCodeAt(this.pos+1);var r=1;if(t===e){r=e===62&&this.input.charCodeAt(this.pos+2)===62?3:2;if(this.input.charCodeAt(this.pos+r)===61){return this.finishOp(bo.assign,r+1)}return this.finishOp(bo.bitShift,r)}if(t===33&&e===60&&!this.inModule&&this.input.charCodeAt(this.pos+2)===45&&this.input.charCodeAt(this.pos+3)===45){this.skipLineComment(4);this.skipSpace();return this.nextToken()}if(t===61){r=2}return this.finishOp(bo.relational,r)};Ql.readToken_eq_excl=function(e){var t=this.input.charCodeAt(this.pos+1);if(t===61){return this.finishOp(bo.equality,this.input.charCodeAt(this.pos+2)===61?3:2)}if(e===61&&t===62&&this.options.ecmaVersion>=6){this.pos+=2;return this.finishToken(bo.arrow)}return this.finishOp(e===61?bo.eq:bo.prefix,1)};Ql.getTokenFromCode=function(e){switch(e){case 46:return this.readToken_dot();case 40:++this.pos;return this.finishToken(bo.parenL);case 41:++this.pos;return this.finishToken(bo.parenR);case 59:++this.pos;return this.finishToken(bo.semi);case 44:++this.pos;return this.finishToken(bo.comma);case 91:++this.pos;return this.finishToken(bo.bracketL);case 93:++this.pos;return this.finishToken(bo.bracketR);case 123:++this.pos;return this.finishToken(bo.braceL);case 125:++this.pos;return this.finishToken(bo.braceR);case 58:++this.pos;return this.finishToken(bo.colon);case 63:++this.pos;return this.finishToken(bo.question);case 96:if(this.options.ecmaVersion<6){break}++this.pos;return this.finishToken(bo.backQuote);case 48:var t=this.input.charCodeAt(this.pos+1);if(t===120||t===88){return this.readRadixNumber(16)}if(this.options.ecmaVersion>=6){if(t===111||t===79){return this.readRadixNumber(8)}if(t===98||t===66){return this.readRadixNumber(2)}}case 49:case 50:case 51:case 52:case 53:case 54:case 55:case 56:case 57:return this.readNumber(false);case 34:case 39:return this.readString(e);case 47:return this.readToken_slash();case 37:case 42:return this.readToken_mult_modulo_exp(e);case 124:case 38:return this.readToken_pipe_amp(e);case 94:return this.readToken_caret();case 43:case 45:return this.readToken_plus_min(e);case 60:case 62:return this.readToken_lt_gt(e);case 61:case 33:return this.readToken_eq_excl(e);case 126:return this.finishOp(bo.prefix,1)}this.raise(this.pos,"Unexpected character '"+Zl(e)+"'")};Ql.finishOp=function(e,t){var r=this.input.slice(this.pos,this.pos+t);this.pos+=t;return this.finishToken(e,r)};Ql.readRegexp=function(){var e,t,r=this.pos;for(;;){if(this.pos>=this.input.length){this.raise(r,"Unterminated regular expression")}var n=this.input.charAt(this.pos);if(So.test(n)){this.raise(r,"Unterminated regular expression")}if(!e){if(n==="["){t=true}else if(n==="]"&&t){t=false}else if(n==="/"&&!t){break}e=n==="\\"}else{e=false}++this.pos}var i=this.input.slice(r,this.pos);++this.pos;var s=this.pos;var a=this.readWord1();if(this.containsEsc){this.unexpected(s)}var o=this.regexpState||(this.regexpState=new Ol(this));o.reset(r,i,a);this.validateRegExpFlags(o);this.validateRegExpPattern(o);var l=null;try{l=new RegExp(i,a)}catch(e){}return this.finishToken(bo.regexp,{pattern:i,flags:a,value:l})};Ql.readInt=function(e,t){var r=this.pos,n=0;for(var i=0,s=t==null?Infinity:t;i<s;++i){var a=this.input.charCodeAt(this.pos),o=void 0;if(a>=97){o=a-97+10}else if(a>=65){o=a-65+10}else if(a>=48&&a<=57){o=a-48}else{o=Infinity}if(o>=e){break}++this.pos;n=n*e+o}if(this.pos===r||t!=null&&this.pos-r!==t){return null}return n};Ql.readRadixNumber=function(e){var t=this.pos;this.pos+=2;var r=this.readInt(e);if(r==null){this.raise(this.start+2,"Expected number in radix "+e)}if(this.options.ecmaVersion>=11&&this.input.charCodeAt(this.pos)===110){r=typeof BigInt!=="undefined"?BigInt(this.input.slice(t,this.pos)):null;++this.pos}else if(ho(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number")}return this.finishToken(bo.num,r)};Ql.readNumber=function(e){var t=this.pos;if(!e&&this.readInt(10)===null){this.raise(t,"Invalid number")}var r=this.pos-t>=2&&this.input.charCodeAt(t)===48;if(r&&this.strict){this.raise(t,"Invalid number")}if(r&&/[89]/.test(this.input.slice(t,this.pos))){r=false}var n=this.input.charCodeAt(this.pos);if(!r&&!e&&this.options.ecmaVersion>=11&&n===110){var i=this.input.slice(t,this.pos);var s=typeof BigInt!=="undefined"?BigInt(i):null;++this.pos;if(ho(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number")}return this.finishToken(bo.num,s)}if(n===46&&!r){++this.pos;this.readInt(10);n=this.input.charCodeAt(this.pos)}if((n===69||n===101)&&!r){n=this.input.charCodeAt(++this.pos);if(n===43||n===45){++this.pos}if(this.readInt(10)===null){this.raise(t,"Invalid number")}}if(ho(this.fullCharCodeAtPos())){this.raise(this.pos,"Identifier directly after number")}var a=this.input.slice(t,this.pos);var o=r?parseInt(a,8):parseFloat(a);return this.finishToken(bo.num,o)};Ql.readCodePoint=function(){var e=this.input.charCodeAt(this.pos),t;if(e===123){if(this.options.ecmaVersion<6){this.unexpected()}var r=++this.pos;t=this.readHexChar(this.input.indexOf("}",this.pos)-this.pos);++this.pos;if(t>1114111){this.invalidStringToken(r,"Code point out of bounds")}}else{t=this.readHexChar(4)}return t};function Zl(e){if(e<=65535){return String.fromCharCode(e)}e-=65536;return String.fromCharCode((e>>10)+55296,(e&1023)+56320)}Ql.readString=function(e){var t="",r=++this.pos;for(;;){if(this.pos>=this.input.length){this.raise(this.start,"Unterminated string constant")}var n=this.input.charCodeAt(this.pos);if(n===e){break}if(n===92){t+=this.input.slice(r,this.pos);t+=this.readEscapedChar(false);r=this.pos}else{if(Co(n,this.options.ecmaVersion>=10)){this.raise(this.start,"Unterminated string constant")}++this.pos}}t+=this.input.slice(r,this.pos++);return this.finishToken(bo.string,t)};var eu={};Ql.tryReadTemplateToken=function(){this.inTemplateElement=true;try{this.readTmplToken()}catch(e){if(e===eu){this.readInvalidTemplateToken()}else{throw e}}this.inTemplateElement=false};Ql.invalidStringToken=function(e,t){if(this.inTemplateElement&&this.options.ecmaVersion>=9){throw eu}else{this.raise(e,t)}};Ql.readTmplToken=function(){var e="",t=this.pos;for(;;){if(this.pos>=this.input.length){this.raise(this.start,"Unterminated template")}var r=this.input.charCodeAt(this.pos);if(r===96||r===36&&this.input.charCodeAt(this.pos+1)===123){if(this.pos===this.start&&(this.type===bo.template||this.type===bo.invalidTemplate)){if(r===36){this.pos+=2;return this.finishToken(bo.dollarBraceL)}else{++this.pos;return this.finishToken(bo.backQuote)}}e+=this.input.slice(t,this.pos);return this.finishToken(bo.template,e)}if(r===92){e+=this.input.slice(t,this.pos);e+=this.readEscapedChar(true);t=this.pos}else if(Co(r)){e+=this.input.slice(t,this.pos);++this.pos;switch(r){case 13:if(this.input.charCodeAt(this.pos)===10){++this.pos}case 10:e+="\n";break;default:e+=String.fromCharCode(r);break}if(this.options.locations){++this.curLine;this.lineStart=this.pos}t=this.pos}else{++this.pos}}};Ql.readInvalidTemplateToken=function(){for(;this.pos<this.input.length;this.pos++){switch(this.input[this.pos]){case"\\":++this.pos;break;case"$":if(this.input[this.pos+1]!=="{"){break}case"`":return this.finishToken(bo.invalidTemplate,this.input.slice(this.start,this.pos))}}this.raise(this.start,"Unterminated template")};Ql.readEscapedChar=function(e){var t=this.input.charCodeAt(++this.pos);++this.pos;switch(t){case 110:return"\n";case 114:return"\r";case 120:return String.fromCharCode(this.readHexChar(2));case 117:return Zl(this.readCodePoint());case 116:return"\t";case 98:return"\b";case 118:return"\v";case 102:return"\f";case 13:if(this.input.charCodeAt(this.pos)===10){++this.pos}case 10:if(this.options.locations){this.lineStart=this.pos;++this.curLine}return"";default:if(t>=48&&t<=55){var r=this.input.substr(this.pos-1,3).match(/^[0-7]+/)[0];var n=parseInt(r,8);if(n>255){r=r.slice(0,-1);n=parseInt(r,8)}this.pos+=r.length-1;t=this.input.charCodeAt(this.pos);if((r!=="0"||t===56||t===57)&&(this.strict||e)){this.invalidStringToken(this.pos-1-r.length,e?"Octal literal in template string":"Octal literal in strict mode")}return String.fromCharCode(n)}if(Co(t)){return""}return String.fromCharCode(t)}};Ql.readHexChar=function(e){var t=this.pos;var r=this.readInt(16,e);if(r===null){this.invalidStringToken(t,"Bad character escape sequence")}return r};Ql.readWord1=function(){this.containsEsc=false;var e="",t=true,r=this.pos;var n=this.options.ecmaVersion>=6;while(this.pos<this.input.length){var i=this.fullCharCodeAtPos();if(po(i,n)){this.pos+=i<=65535?1:2}else if(i===92){this.containsEsc=true;e+=this.input.slice(r,this.pos);var s=this.pos;if(this.input.charCodeAt(++this.pos)!==117){this.invalidStringToken(this.pos,"Expecting Unicode escape sequence \\uXXXX")}++this.pos;var a=this.readCodePoint();if(!(t?ho:po)(a,n)){this.invalidStringToken(s,"Invalid Unicode escape")}e+=Zl(a);r=this.pos}else{break}t=false}return e+this.input.slice(r,this.pos)};Ql.readWord=function(){var e=this.readWord1();var t=bo.name;if(this.keywords.test(e)){if(this.containsEsc){this.raiseRecoverable(this.start,"Escape sequence in keyword "+e)}t=xo[e]}return this.finishToken(t,e)};function tu(e,t){return ts(e,Object.assign({parser:{parse(e,t){return tl.parse(e,Object.assign({},t,{ecmaVersion:2020}))}}},t))}var ru={Array:false,ArrayBuffer:false,Atomics:false,BigInt:false,BigInt64Array:false,BigUint64Array:false,Boolean:false,constructor:false,DataView:false,Date:false,decodeURI:false,decodeURIComponent:false,encodeURI:false,encodeURIComponent:false,Error:false,escape:false,eval:false,EvalError:false,Float32Array:false,Float64Array:false,Function:false,globalThis:false,hasOwnProperty:false,Infinity:false,Int16Array:false,Int32Array:false,Int8Array:false,isFinite:false,isNaN:false,isPrototypeOf:false,JSON:false,Map:false,Math:false,NaN:false,Number:false,Object:false,parseFloat:false,parseInt:false,Promise:false,propertyIsEnumerable:false,Proxy:false,RangeError:false,ReferenceError:false,Reflect:false,RegExp:false,Set:false,SharedArrayBuffer:false,String:false,Symbol:false,SyntaxError:false,toLocaleString:false,toString:false,TypeError:false,Uint16Array:false,Uint32Array:false,Uint8Array:false,Uint8ClampedArray:false,undefined:false,unescape:false,URIError:false,valueOf:false,WeakMap:false,WeakSet:false};var nu={Array:false,Boolean:false,constructor:false,Date:false,decodeURI:false,decodeURIComponent:false,encodeURI:false,encodeURIComponent:false,Error:false,escape:false,eval:false,EvalError:false,Function:false,hasOwnProperty:false,Infinity:false,isFinite:false,isNaN:false,isPrototypeOf:false,JSON:false,Math:false,NaN:false,Number:false,Object:false,parseFloat:false,parseInt:false,propertyIsEnumerable:false,RangeError:false,ReferenceError:false,RegExp:false,String:false,SyntaxError:false,toLocaleString:false,toString:false,TypeError:false,undefined:false,unescape:false,URIError:false,valueOf:false};var iu={Array:false,ArrayBuffer:false,Boolean:false,constructor:false,DataView:false,Date:false,decodeURI:false,decodeURIComponent:false,encodeURI:false,encodeURIComponent:false,Error:false,escape:false,eval:false,EvalError:false,Float32Array:false,Float64Array:false,Function:false,hasOwnProperty:false,Infinity:false,Int16Array:false,Int32Array:false,Int8Array:false,isFinite:false,isNaN:false,isPrototypeOf:false,JSON:false,Map:false,Math:false,NaN:false,Number:false,Object:false,parseFloat:false,parseInt:false,Promise:false,propertyIsEnumerable:false,Proxy:false,RangeError:false,ReferenceError:false,Reflect:false,RegExp:false,Set:false,String:false,Symbol:false,SyntaxError:false,toLocaleString:false,toString:false,TypeError:false,Uint16Array:false,Uint32Array:false,Uint8Array:false,Uint8ClampedArray:false,undefined:false,unescape:false,URIError:false,valueOf:false,WeakMap:false,WeakSet:false};var su={Array:false,ArrayBuffer:false,Atomics:false,Boolean:false,constructor:false,DataView:false,Date:false,decodeURI:false,decodeURIComponent:false,encodeURI:false,encodeURIComponent:false,Error:false,escape:false,eval:false,EvalError:false,Float32Array:false,Float64Array:false,Function:false,hasOwnProperty:false,Infinity:false,Int16Array:false,Int32Array:false,Int8Array:false,isFinite:false,isNaN:false,isPrototypeOf:false,JSON:false,Map:false,Math:false,NaN:false,Number:false,Object:false,parseFloat:false,parseInt:false,Promise:false,propertyIsEnumerable:false,Proxy:false,RangeError:false,ReferenceError:false,Reflect:false,RegExp:false,Set:false,SharedArrayBuffer:false,String:false,Symbol:false,SyntaxError:false,toLocaleString:false,toString:false,TypeError:false,Uint16Array:false,Uint32Array:false,Uint8Array:false,Uint8ClampedArray:false,undefined:false,unescape:false,URIError:false,valueOf:false,WeakMap:false,WeakSet:false};var au={AbortController:false,AbortSignal:false,addEventListener:false,alert:false,AnalyserNode:false,Animation:false,AnimationEffectReadOnly:false,AnimationEffectTiming:false,AnimationEffectTimingReadOnly:false,AnimationEvent:false,AnimationPlaybackEvent:false,AnimationTimeline:false,applicationCache:false,ApplicationCache:false,ApplicationCacheErrorEvent:false,atob:false,Attr:false,Audio:false,AudioBuffer:false,AudioBufferSourceNode:false,AudioContext:false,AudioDestinationNode:false,AudioListener:false,AudioNode:false,AudioParam:false,AudioProcessingEvent:false,AudioScheduledSourceNode:false,"AudioWorkletGlobalScope ":false,AudioWorkletNode:false,AudioWorkletProcessor:false,BarProp:false,BaseAudioContext:false,BatteryManager:false,BeforeUnloadEvent:false,BiquadFilterNode:false,Blob:false,BlobEvent:false,blur:false,BroadcastChannel:false,btoa:false,BudgetService:false,ByteLengthQueuingStrategy:false,Cache:false,caches:false,CacheStorage:false,cancelAnimationFrame:false,cancelIdleCallback:false,CanvasCaptureMediaStreamTrack:false,CanvasGradient:false,CanvasPattern:false,CanvasRenderingContext2D:false,ChannelMergerNode:false,ChannelSplitterNode:false,CharacterData:false,clearInterval:false,clearTimeout:false,clientInformation:false,ClipboardEvent:false,close:false,closed:false,CloseEvent:false,Comment:false,CompositionEvent:false,confirm:false,console:false,ConstantSourceNode:false,ConvolverNode:false,CountQueuingStrategy:false,createImageBitmap:false,Credential:false,CredentialsContainer:false,crypto:false,Crypto:false,CryptoKey:false,CSS:false,CSSConditionRule:false,CSSFontFaceRule:false,CSSGroupingRule:false,CSSImportRule:false,CSSKeyframeRule:false,CSSKeyframesRule:false,CSSMediaRule:false,CSSNamespaceRule:false,CSSPageRule:false,CSSRule:false,CSSRuleList:false,CSSStyleDeclaration:false,CSSStyleRule:false,CSSStyleSheet:false,CSSSupportsRule:false,CustomElementRegistry:false,customElements:false,CustomEvent:false,DataTransfer:false,DataTransferItem:false,DataTransferItemList:false,defaultstatus:false,defaultStatus:false,DelayNode:false,DeviceMotionEvent:false,DeviceOrientationEvent:false,devicePixelRatio:false,dispatchEvent:false,document:false,Document:false,DocumentFragment:false,DocumentType:false,DOMError:false,DOMException:false,DOMImplementation:false,DOMMatrix:false,DOMMatrixReadOnly:false,DOMParser:false,DOMPoint:false,DOMPointReadOnly:false,DOMQuad:false,DOMRect:false,DOMRectReadOnly:false,DOMStringList:false,DOMStringMap:false,DOMTokenList:false,DragEvent:false,DynamicsCompressorNode:false,Element:false,ErrorEvent:false,event:false,Event:false,EventSource:false,EventTarget:false,external:false,fetch:false,File:false,FileList:false,FileReader:false,find:false,focus:false,FocusEvent:false,FontFace:false,FontFaceSetLoadEvent:false,FormData:false,frameElement:false,frames:false,GainNode:false,Gamepad:false,GamepadButton:false,GamepadEvent:false,getComputedStyle:false,getSelection:false,HashChangeEvent:false,Headers:false,history:false,History:false,HTMLAllCollection:false,HTMLAnchorElement:false,HTMLAreaElement:false,HTMLAudioElement:false,HTMLBaseElement:false,HTMLBodyElement:false,HTMLBRElement:false,HTMLButtonElement:false,HTMLCanvasElement:false,HTMLCollection:false,HTMLContentElement:false,HTMLDataElement:false,HTMLDataListElement:false,HTMLDetailsElement:false,HTMLDialogElement:false,HTMLDirectoryElement:false,HTMLDivElement:false,HTMLDListElement:false,HTMLDocument:false,HTMLElement:false,HTMLEmbedElement:false,HTMLFieldSetElement:false,HTMLFontElement:false,HTMLFormControlsCollection:false,HTMLFormElement:false,HTMLFrameElement:false,HTMLFrameSetElement:false,HTMLHeadElement:false,HTMLHeadingElement:false,HTMLHRElement:false,HTMLHtmlElement:false,HTMLIFrameElement:false,HTMLImageElement:false,HTMLInputElement:false,HTMLLabelElement:false,HTMLLegendElement:false,HTMLLIElement:false,HTMLLinkElement:false,HTMLMapElement:false,HTMLMarqueeElement:false,HTMLMediaElement:false,HTMLMenuElement:false,HTMLMetaElement:false,HTMLMeterElement:false,HTMLModElement:false,HTMLObjectElement:false,HTMLOListElement:false,HTMLOptGroupElement:false,HTMLOptionElement:false,HTMLOptionsCollection:false,HTMLOutputElement:false,HTMLParagraphElement:false,HTMLParamElement:false,HTMLPictureElement:false,HTMLPreElement:false,HTMLProgressElement:false,HTMLQuoteElement:false,HTMLScriptElement:false,HTMLSelectElement:false,HTMLShadowElement:false,HTMLSlotElement:false,HTMLSourceElement:false,HTMLSpanElement:false,HTMLStyleElement:false,HTMLTableCaptionElement:false,HTMLTableCellElement:false,HTMLTableColElement:false,HTMLTableElement:false,HTMLTableRowElement:false,HTMLTableSectionElement:false,HTMLTemplateElement:false,HTMLTextAreaElement:false,HTMLTimeElement:false,HTMLTitleElement:false,HTMLTrackElement:false,HTMLUListElement:false,HTMLUnknownElement:false,HTMLVideoElement:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,IdleDeadline:false,IIRFilterNode:false,Image:false,ImageBitmap:false,ImageBitmapRenderingContext:false,ImageCapture:false,ImageData:false,indexedDB:false,innerHeight:false,innerWidth:false,InputEvent:false,IntersectionObserver:false,IntersectionObserverEntry:false,Intl:false,isSecureContext:false,KeyboardEvent:false,KeyframeEffect:false,KeyframeEffectReadOnly:false,length:false,localStorage:false,location:true,Location:false,locationbar:false,matchMedia:false,MediaDeviceInfo:false,MediaDevices:false,MediaElementAudioSourceNode:false,MediaEncryptedEvent:false,MediaError:false,MediaKeyMessageEvent:false,MediaKeySession:false,MediaKeyStatusMap:false,MediaKeySystemAccess:false,MediaList:false,MediaQueryList:false,MediaQueryListEvent:false,MediaRecorder:false,MediaSettingsRange:false,MediaSource:false,MediaStream:false,MediaStreamAudioDestinationNode:false,MediaStreamAudioSourceNode:false,MediaStreamEvent:false,MediaStreamTrack:false,MediaStreamTrackEvent:false,menubar:false,MessageChannel:false,MessageEvent:false,MessagePort:false,MIDIAccess:false,MIDIConnectionEvent:false,MIDIInput:false,MIDIInputMap:false,MIDIMessageEvent:false,MIDIOutput:false,MIDIOutputMap:false,MIDIPort:false,MimeType:false,MimeTypeArray:false,MouseEvent:false,moveBy:false,moveTo:false,MutationEvent:false,MutationObserver:false,MutationRecord:false,name:false,NamedNodeMap:false,NavigationPreloadManager:false,navigator:false,Navigator:false,NetworkInformation:false,Node:false,NodeFilter:false,NodeIterator:false,NodeList:false,Notification:false,OfflineAudioCompletionEvent:false,OfflineAudioContext:false,offscreenBuffering:false,OffscreenCanvas:true,onabort:true,onafterprint:true,onanimationend:true,onanimationiteration:true,onanimationstart:true,onappinstalled:true,onauxclick:true,onbeforeinstallprompt:true,onbeforeprint:true,onbeforeunload:true,onblur:true,oncancel:true,oncanplay:true,oncanplaythrough:true,onchange:true,onclick:true,onclose:true,oncontextmenu:true,oncuechange:true,ondblclick:true,ondevicemotion:true,ondeviceorientation:true,ondeviceorientationabsolute:true,ondrag:true,ondragend:true,ondragenter:true,ondragleave:true,ondragover:true,ondragstart:true,ondrop:true,ondurationchange:true,onemptied:true,onended:true,onerror:true,onfocus:true,ongotpointercapture:true,onhashchange:true,oninput:true,oninvalid:true,onkeydown:true,onkeypress:true,onkeyup:true,onlanguagechange:true,onload:true,onloadeddata:true,onloadedmetadata:true,onloadstart:true,onlostpointercapture:true,onmessage:true,onmessageerror:true,onmousedown:true,onmouseenter:true,onmouseleave:true,onmousemove:true,onmouseout:true,onmouseover:true,onmouseup:true,onmousewheel:true,onoffline:true,ononline:true,onpagehide:true,onpageshow:true,onpause:true,onplay:true,onplaying:true,onpointercancel:true,onpointerdown:true,onpointerenter:true,onpointerleave:true,onpointermove:true,onpointerout:true,onpointerover:true,onpointerup:true,onpopstate:true,onprogress:true,onratechange:true,onrejectionhandled:true,onreset:true,onresize:true,onscroll:true,onsearch:true,onseeked:true,onseeking:true,onselect:true,onstalled:true,onstorage:true,onsubmit:true,onsuspend:true,ontimeupdate:true,ontoggle:true,ontransitionend:true,onunhandledrejection:true,onunload:true,onvolumechange:true,onwaiting:true,onwheel:true,open:false,openDatabase:false,opener:false,Option:false,origin:false,OscillatorNode:false,outerHeight:false,outerWidth:false,PageTransitionEvent:false,pageXOffset:false,pageYOffset:false,PannerNode:false,parent:false,Path2D:false,PaymentAddress:false,PaymentRequest:false,PaymentRequestUpdateEvent:false,PaymentResponse:false,performance:false,Performance:false,PerformanceEntry:false,PerformanceLongTaskTiming:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceNavigationTiming:false,PerformanceObserver:false,PerformanceObserverEntryList:false,PerformancePaintTiming:false,PerformanceResourceTiming:false,PerformanceTiming:false,PeriodicWave:false,Permissions:false,PermissionStatus:false,personalbar:false,PhotoCapabilities:false,Plugin:false,PluginArray:false,PointerEvent:false,PopStateEvent:false,postMessage:false,Presentation:false,PresentationAvailability:false,PresentationConnection:false,PresentationConnectionAvailableEvent:false,PresentationConnectionCloseEvent:false,PresentationConnectionList:false,PresentationReceiver:false,PresentationRequest:false,print:false,ProcessingInstruction:false,ProgressEvent:false,PromiseRejectionEvent:false,prompt:false,PushManager:false,PushSubscription:false,PushSubscriptionOptions:false,queueMicrotask:false,RadioNodeList:false,Range:false,ReadableStream:false,registerProcessor:false,RemotePlayback:false,removeEventListener:false,Request:false,requestAnimationFrame:false,requestIdleCallback:false,resizeBy:false,ResizeObserver:false,ResizeObserverEntry:false,resizeTo:false,Response:false,RTCCertificate:false,RTCDataChannel:false,RTCDataChannelEvent:false,RTCDtlsTransport:false,RTCIceCandidate:false,RTCIceGatherer:false,RTCIceTransport:false,RTCPeerConnection:false,RTCPeerConnectionIceEvent:false,RTCRtpContributingSource:false,RTCRtpReceiver:false,RTCRtpSender:false,RTCSctpTransport:false,RTCSessionDescription:false,RTCStatsReport:false,RTCTrackEvent:false,screen:false,Screen:false,screenLeft:false,ScreenOrientation:false,screenTop:false,screenX:false,screenY:false,ScriptProcessorNode:false,scroll:false,scrollbars:false,scrollBy:false,scrollTo:false,scrollX:false,scrollY:false,SecurityPolicyViolationEvent:false,Selection:false,self:false,ServiceWorker:false,ServiceWorkerContainer:false,ServiceWorkerRegistration:false,sessionStorage:false,setInterval:false,setTimeout:false,ShadowRoot:false,SharedWorker:false,SourceBuffer:false,SourceBufferList:false,speechSynthesis:false,SpeechSynthesisEvent:false,SpeechSynthesisUtterance:false,StaticRange:false,status:false,statusbar:false,StereoPannerNode:false,stop:false,Storage:false,StorageEvent:false,StorageManager:false,styleMedia:false,StyleSheet:false,StyleSheetList:false,SubtleCrypto:false,SVGAElement:false,SVGAngle:false,SVGAnimatedAngle:false,SVGAnimatedBoolean:false,SVGAnimatedEnumeration:false,SVGAnimatedInteger:false,SVGAnimatedLength:false,SVGAnimatedLengthList:false,SVGAnimatedNumber:false,SVGAnimatedNumberList:false,SVGAnimatedPreserveAspectRatio:false,SVGAnimatedRect:false,SVGAnimatedString:false,SVGAnimatedTransformList:false,SVGAnimateElement:false,SVGAnimateMotionElement:false,SVGAnimateTransformElement:false,SVGAnimationElement:false,SVGCircleElement:false,SVGClipPathElement:false,SVGComponentTransferFunctionElement:false,SVGDefsElement:false,SVGDescElement:false,SVGDiscardElement:false,SVGElement:false,SVGEllipseElement:false,SVGFEBlendElement:false,SVGFEColorMatrixElement:false,SVGFEComponentTransferElement:false,SVGFECompositeElement:false,SVGFEConvolveMatrixElement:false,SVGFEDiffuseLightingElement:false,SVGFEDisplacementMapElement:false,SVGFEDistantLightElement:false,SVGFEDropShadowElement:false,SVGFEFloodElement:false,SVGFEFuncAElement:false,SVGFEFuncBElement:false,SVGFEFuncGElement:false,SVGFEFuncRElement:false,SVGFEGaussianBlurElement:false,SVGFEImageElement:false,SVGFEMergeElement:false,SVGFEMergeNodeElement:false,SVGFEMorphologyElement:false,SVGFEOffsetElement:false,SVGFEPointLightElement:false,SVGFESpecularLightingElement:false,SVGFESpotLightElement:false,SVGFETileElement:false,SVGFETurbulenceElement:false,SVGFilterElement:false,SVGForeignObjectElement:false,SVGGElement:false,SVGGeometryElement:false,SVGGradientElement:false,SVGGraphicsElement:false,SVGImageElement:false,SVGLength:false,SVGLengthList:false,SVGLinearGradientElement:false,SVGLineElement:false,SVGMarkerElement:false,SVGMaskElement:false,SVGMatrix:false,SVGMetadataElement:false,SVGMPathElement:false,SVGNumber:false,SVGNumberList:false,SVGPathElement:false,SVGPatternElement:false,SVGPoint:false,SVGPointList:false,SVGPolygonElement:false,SVGPolylineElement:false,SVGPreserveAspectRatio:false,SVGRadialGradientElement:false,SVGRect:false,SVGRectElement:false,SVGScriptElement:false,SVGSetElement:false,SVGStopElement:false,SVGStringList:false,SVGStyleElement:false,SVGSVGElement:false,SVGSwitchElement:false,SVGSymbolElement:false,SVGTextContentElement:false,SVGTextElement:false,SVGTextPathElement:false,SVGTextPositioningElement:false,SVGTitleElement:false,SVGTransform:false,SVGTransformList:false,SVGTSpanElement:false,SVGUnitTypes:false,SVGUseElement:false,SVGViewElement:false,TaskAttributionTiming:false,Text:false,TextDecoder:false,TextEncoder:false,TextEvent:false,TextMetrics:false,TextTrack:false,TextTrackCue:false,TextTrackCueList:false,TextTrackList:false,TimeRanges:false,toolbar:false,top:false,Touch:false,TouchEvent:false,TouchList:false,TrackEvent:false,TransitionEvent:false,TreeWalker:false,UIEvent:false,URL:false,URLSearchParams:false,ValidityState:false,visualViewport:false,VisualViewport:false,VTTCue:false,WaveShaperNode:false,WebAssembly:false,WebGL2RenderingContext:false,WebGLActiveInfo:false,WebGLBuffer:false,WebGLContextEvent:false,WebGLFramebuffer:false,WebGLProgram:false,WebGLQuery:false,WebGLRenderbuffer:false,WebGLRenderingContext:false,WebGLSampler:false,WebGLShader:false,WebGLShaderPrecisionFormat:false,WebGLSync:false,WebGLTexture:false,WebGLTransformFeedback:false,WebGLUniformLocation:false,WebGLVertexArrayObject:false,WebSocket:false,WheelEvent:false,window:false,Window:false,Worker:false,WritableStream:false,XMLDocument:false,XMLHttpRequest:false,XMLHttpRequestEventTarget:false,XMLHttpRequestUpload:false,XMLSerializer:false,XPathEvaluator:false,XPathExpression:false,XPathResult:false,XSLTProcessor:false};var ou={addEventListener:false,applicationCache:false,atob:false,Blob:false,BroadcastChannel:false,btoa:false,Cache:false,caches:false,clearInterval:false,clearTimeout:false,close:true,console:false,fetch:false,FileReaderSync:false,FormData:false,Headers:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,ImageData:false,importScripts:true,indexedDB:false,location:false,MessageChannel:false,MessagePort:false,name:false,navigator:false,Notification:false,onclose:true,onconnect:true,onerror:true,onlanguagechange:true,onmessage:true,onoffline:true,ononline:true,onrejectionhandled:true,onunhandledrejection:true,performance:false,Performance:false,PerformanceEntry:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceResourceTiming:false,PerformanceTiming:false,postMessage:true,Promise:false,queueMicrotask:false,removeEventListener:false,Request:false,Response:false,self:true,ServiceWorkerRegistration:false,setInterval:false,setTimeout:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false,WebSocket:false,Worker:false,WorkerGlobalScope:false,XMLHttpRequest:false};var lu={__dirname:false,__filename:false,Buffer:false,clearImmediate:false,clearInterval:false,clearTimeout:false,console:false,exports:true,global:false,Intl:false,module:false,process:false,queueMicrotask:false,require:false,setImmediate:false,setInterval:false,setTimeout:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false};var uu={exports:true,global:false,module:false,require:false};var cu={define:false,require:false};var fu={after:false,afterEach:false,before:false,beforeEach:false,context:false,describe:false,it:false,mocha:false,run:false,setup:false,specify:false,suite:false,suiteSetup:false,suiteTeardown:false,teardown:false,test:false,xcontext:false,xdescribe:false,xit:false,xspecify:false};var hu={afterAll:false,afterEach:false,beforeAll:false,beforeEach:false,describe:false,expect:false,fail:false,fdescribe:false,fit:false,it:false,jasmine:false,pending:false,runs:false,spyOn:false,spyOnProperty:false,waits:false,waitsFor:false,xdescribe:false,xit:false};var pu={afterAll:false,afterEach:false,beforeAll:false,beforeEach:false,describe:false,expect:false,fdescribe:false,fit:false,it:false,jest:false,pit:false,require:false,test:false,xdescribe:false,xit:false,xtest:false};var du={asyncTest:false,deepEqual:false,equal:false,expect:false,module:false,notDeepEqual:false,notEqual:false,notOk:false,notPropEqual:false,notStrictEqual:false,ok:false,propEqual:false,QUnit:false,raises:false,start:false,stop:false,strictEqual:false,test:false,throws:false};var mu={console:true,exports:true,phantom:true,require:true,WebPage:true};var vu={emit:false,exports:false,getRow:false,log:false,module:false,provides:false,require:false,respond:false,send:false,start:false,sum:false};var gu={defineClass:false,deserialize:false,gc:false,help:false,importClass:false,importPackage:false,java:false,load:false,loadClass:false,Packages:false,print:false,quit:false,readFile:false,readUrl:false,runCommand:false,seal:false,serialize:false,spawn:false,sync:false,toint32:false,version:false};var yu={__DIR__:false,__FILE__:false,__LINE__:false,com:false,edu:false,exit:false,java:false,Java:false,javafx:false,JavaImporter:false,javax:false,JSAdapter:false,load:false,loadWithNewGlobal:false,org:false,Packages:false,print:false,quit:false};var xu={ActiveXObject:true,Enumerator:true,GetObject:true,ScriptEngine:true,ScriptEngineBuildVersion:true,ScriptEngineMajorVersion:true,ScriptEngineMinorVersion:true,VBArray:true,WScript:true,WSH:true,XDomainRequest:true};var Eu={$:false,jQuery:false};var bu={YAHOO:false,YAHOO_config:false,YUI:false,YUI_config:false};var Su={cat:false,cd:false,chmod:false,config:false,cp:false,dirs:false,echo:false,env:false,error:false,exec:false,exit:false,find:false,grep:false,ln:false,ls:false,mkdir:false,mv:false,popd:false,pushd:false,pwd:false,rm:false,sed:false,set:false,target:false,tempdir:false,test:false,touch:false,which:false};var Du={$:false,$$:false,$A:false,$break:false,$continue:false,$F:false,$H:false,$R:false,$w:false,Abstract:false,Ajax:false,Autocompleter:false,Builder:false,Class:false,Control:false,Draggable:false,Draggables:false,Droppables:false,Effect:false,Element:false,Enumerable:false,Event:false,Field:false,Form:false,Hash:false,Insertion:false,ObjectRange:false,PeriodicalExecuter:false,Position:false,Prototype:false,Scriptaculous:false,Selector:false,Sortable:false,SortableObserver:false,Sound:false,Template:false,Toggle:false,Try:false};var Cu={_:false,$:false,Accounts:false,AccountsClient:false,AccountsCommon:false,AccountsServer:false,App:false,Assets:false,Blaze:false,check:false,Cordova:false,DDP:false,DDPRateLimiter:false,DDPServer:false,Deps:false,EJSON:false,Email:false,HTTP:false,Log:false,Match:false,Meteor:false,Mongo:false,MongoInternals:false,Npm:false,Package:false,Plugin:false,process:false,Random:false,ReactiveDict:false,ReactiveVar:false,Router:false,ServiceConfiguration:false,Session:false,share:false,Spacebars:false,Template:false,Tinytest:false,Tracker:false,UI:false,Utils:false,WebApp:false,WebAppInternals:false};var wu={_isWindows:false,_rand:false,BulkWriteResult:false,cat:false,cd:false,connect:false,db:false,getHostName:false,getMemInfo:false,hostname:false,ISODate:false,listFiles:false,load:false,ls:false,md5sumFile:false,mkdir:false,Mongo:false,NumberInt:false,NumberLong:false,ObjectId:false,PlanCache:false,print:false,printjson:false,pwd:false,quit:false,removeFile:false,rs:false,sh:false,UUID:false,version:false,WriteResult:false};var Au={$:false,Application:false,Automation:false,console:false,delay:false,Library:false,ObjC:false,ObjectSpecifier:false,Path:false,Progress:false,Ref:false};var Tu={addEventListener:false,applicationCache:false,atob:false,Blob:false,BroadcastChannel:false,btoa:false,Cache:false,caches:false,CacheStorage:false,clearInterval:false,clearTimeout:false,Client:false,clients:false,Clients:false,close:true,console:false,ExtendableEvent:false,ExtendableMessageEvent:false,fetch:false,FetchEvent:false,FileReaderSync:false,FormData:false,Headers:false,IDBCursor:false,IDBCursorWithValue:false,IDBDatabase:false,IDBFactory:false,IDBIndex:false,IDBKeyRange:false,IDBObjectStore:false,IDBOpenDBRequest:false,IDBRequest:false,IDBTransaction:false,IDBVersionChangeEvent:false,ImageData:false,importScripts:false,indexedDB:false,location:false,MessageChannel:false,MessagePort:false,name:false,navigator:false,Notification:false,onclose:true,onconnect:true,onerror:true,onfetch:true,oninstall:true,onlanguagechange:true,onmessage:true,onmessageerror:true,onnotificationclick:true,onnotificationclose:true,onoffline:true,ononline:true,onpush:true,onpushsubscriptionchange:true,onrejectionhandled:true,onsync:true,onunhandledrejection:true,performance:false,Performance:false,PerformanceEntry:false,PerformanceMark:false,PerformanceMeasure:false,PerformanceNavigation:false,PerformanceResourceTiming:false,PerformanceTiming:false,postMessage:true,Promise:false,queueMicrotask:false,registration:false,removeEventListener:false,Request:false,Response:false,self:false,ServiceWorker:false,ServiceWorkerContainer:false,ServiceWorkerGlobalScope:false,ServiceWorkerMessageEvent:false,ServiceWorkerRegistration:false,setInterval:false,setTimeout:false,skipWaiting:false,TextDecoder:false,TextEncoder:false,URL:false,URLSearchParams:false,WebSocket:false,WindowClient:false,Worker:false,WorkerGlobalScope:false,XMLHttpRequest:false};var ku={advanceClock:false,fakeClearInterval:false,fakeClearTimeout:false,fakeSetInterval:false,fakeSetTimeout:false,resetTimeouts:false,waitsForPromise:false};var _u={andThen:false,click:false,currentPath:false,currentRouteName:false,currentURL:false,fillIn:false,find:false,findAll:false,findWithAssert:false,keyEvent:false,pauseTest:false,resumeTest:false,triggerEvent:false,visit:false,wait:false};var Pu={$:false,$$:false,browser:false,by:false,By:false,DartObject:false,element:false,protractor:false};var Fu={browser:false,chrome:false,opr:false};var Iu={cloneInto:false,createObjectIn:false,exportFunction:false,GM:false,GM_addStyle:false,GM_deleteValue:false,GM_getResourceText:false,GM_getResourceURL:false,GM_getValue:false,GM_info:false,GM_listValues:false,GM_log:false,GM_openInTab:false,GM_registerMenuCommand:false,GM_setClipboard:false,GM_setValue:false,GM_xmlhttpRequest:false,unsafeWindow:false};var Mu={$:false,$_:false,$$:false,$0:false,$1:false,$2:false,$3:false,$4:false,$x:false,chrome:false,clear:false,copy:false,debug:false,dir:false,dirxml:false,getEventListeners:false,inspect:false,keys:false,monitor:false,monitorEvents:false,profile:false,profileEnd:false,queryObjects:false,table:false,undebug:false,unmonitor:false,unmonitorEvents:false,values:false};var Nu={builtin:ru,es5:nu,es2015:iu,es2017:su,browser:au,worker:ou,node:lu,commonjs:uu,amd:cu,mocha:fu,jasmine:hu,jest:pu,qunit:du,phantomjs:mu,couch:vu,rhino:gu,nashorn:yu,wsh:xu,jquery:Eu,yui:bu,shelljs:Su,prototypejs:Du,meteor:Cu,mongo:wu,applescript:Au,serviceworker:Tu,atomtest:ku,embertest:_u,protractor:Pu,"shared-node-browser":{clearInterval:false,clearTimeout:false,console:false,setInterval:false,setTimeout:false,URL:false,URLSearchParams:false},webextensions:Fu,greasemonkey:Iu,devtools:Mu};var Lu=Object.freeze({builtin:ru,es5:nu,es2015:iu,es2017:su,browser:au,worker:ou,node:lu,commonjs:uu,amd:cu,mocha:fu,jasmine:hu,jest:pu,qunit:du,phantomjs:mu,couch:vu,rhino:gu,nashorn:yu,wsh:xu,jquery:Eu,yui:bu,shelljs:Su,prototypejs:Du,meteor:Cu,mongo:wu,applescript:Au,serviceworker:Tu,atomtest:ku,embertest:_u,protractor:Pu,webextensions:Fu,greasemonkey:Iu,devtools:Mu,default:Nu});var Bu=u(Lu);var Ou=Bu;const Ru=Object.keys(Ou.browser);const ju=Object.keys(Ou.builtin);const Uu=ls.Identifier.check.bind(ls.Identifier);const Vu=ls.Literal.check.bind(ls.Literal);const Gu=ls.ExpressionStatement.check.bind(ls.ExpressionStatement);const zu=ls.ObjectExpression.check.bind(ls.ObjectExpression);const Xu=ls.ThisExpression.check.bind(ls.ThisExpression);const Ju=ls.NewExpression.check.bind(ls.NewExpression);const qu=ls.SequenceExpression.check.bind(ls.SequenceExpression);const Wu=ls.BinaryExpression.check.bind(ls.BinaryExpression);const Hu=ls.ExportDefaultDeclaration.check.bind(ls.ExportDefaultDeclaration);const Ku=e=>{let{name:t}=e;return Ru.includes(t)};const $u=e=>{let{name:t}=e;return ju.includes(t)};const Yu=e=>e&&e.raw;function Qu(e){return e.find(Hu)}function Zu(e){return e.filter(e=>!Hu(e))}function ec(e){return e.body||e.program.body}function tc(e,t){as.visit(e,{visitProperty(e){if(e.value.key.value===n){e.value.value=t.declaration;return false}this.traverse(e)}});return e}function rc(e,t,r,n){const i=Oa(e);const s=eo(e.text.text,t,e);const{options:a}=r;const o=ja("javascript",i,r,Object.assign({},e,{text:s}));const l=fs(o.map);const u=tu(o.code,{sourceFileName:a.file,inputSourceMap:$a(l)?null:l});const c=ec(u);const f=Zu(c);const h=Qu(c);const p=ec(n);p.unshift(...f);if(h)tc(n,h);return n}const nc=1;const ic=2;const sc=3;const ac=4;const oc=8;const lc=9;const uc=10;const cc=11;var fc=Object.freeze({TAG:nc,ATTR:ic,TEXT:sc,CDATA:ac,COMMENT:oc,DOCUMENT:lc,DOCTYPE:uc,DOCUMENT_FRAGMENT:cc});const hc="Root tag not found.";const pc="Unclosed ES6 template literal.";const dc="Unexpected end of file.";const mc="Unclosed comment.";const vc='Unclosed "%1" block.';const gc='Duplicate tag "<%1>".';const yc="Unexpected character %1.";const xc="Unclosed expression.";const Ec=/^(?:\/[a-zA-Z]|[a-zA-Z][^\s>\/]?)/;const bc=/(\/?[^\s>\/]+)\s*(>)?/g;const Sc=/(\S[^>\/=\s]*)(?:\s*=\s*([^>\/])?)?/g;const Dc=/\.\.\./;const Cc={script:/<\/script\s*>/gi,style:/<\/style\s*>/gi,textarea:/<\/textarea\s*>/gi};const wc=/^\/?(?:pre|textarea)$/;const Ac="javascript";const Tc="css";const kc="template";const _c="script";const Pc="style";const Fc="textarea";const Ic="isRaw";const Mc="isSelfClosing";const Nc="isVoid";const Lc="isBoolean";const Bc="isCustom";const Oc="isSpread";function Rc(e,t){if(e===void 0){e=[]}e.push(t);return e}function jc(e,t,r){e.lastIndex=t;return e.exec(r)}var Uc=e=>e.replace(/(?=[-[\](){^*+?.$|\\])/g,"\\");function Vc(e,t,r){if(!r){r=e.length}const n=(e.slice(0,r).match(/\r\n?|\n/g)||"").length+1;let i=0;while(--r>=0&&!/[\r\n]/.test(e[r])){++i}return`[${n},${i}]: ${t}`}const Gc="`";function zc(e,t,r){const n=/[`$\\]/g;let i;while(n.lastIndex=t,n.exec(e)){t=n.lastIndex;i=e[t-1];if(i==="`"){return t}if(i==="$"&&e[t++]==="{"){r.push(Gc,"}");return t}}throw Vc(e,pc,t)}function Xc(e,t,r){const n=Vc(e,t,r);throw new Error(n)}const Jc="[{(,;:?=|&!^~>%*/";const qc=`${Jc}+-`;const Wc=["case","default","do","else","in","instanceof","prefix","return","typeof","void","yield"];const Hc=Wc.reduce((e,t)=>e+t.slice(-1),"");const Kc=/^\/(?=[^*>\/])[^[\/\\]*(?:(?:\\.|\[(?:\\.|[^\]\\]*)*\])[^[\\\/]*)*?\/[gimuy]*/;const $c=/[$\w]/;const Yc=/.*/g;function Qc(e,t){while(--t>=0&&/\s/.test(e[t]));return t}function Zc(e,t){let r=Yc.lastIndex=t++;const n=(Yc.exec(e)||" ")[0].match(Kc);if(n){const i=r+n[0].length;r=Qc(e,r);let s=e[r];if(r<0||Jc.includes(s)){return i}if(s==="."){if(e[r-1]==="."){t=i}}else{if(s==="+"||s==="-"){if(e[--r]!==s||(r=Qc(e,r))<0||qc.includes(s=e[r])){return i}}if(Hc.includes(s)){const n=r+1;while(--r>=0&&$c.test(e[r]));if(Wc.includes(e.slice(r+1,n))){t=i}}}}return t}const ef=/'[^'\n\r\\]*(?:\\(?:\r\n?|[\S\s])[^'\n\r\\]*)*'/.source;const tf=`${ef}|${ef.replace(/'/g,'"')}`;const rf={};function nf(e){let t=rf[e];if(!t){let r=Uc(e);if(e.length>1){r=`${r}|[`}else{r=/[{}[\]()]/.test(e)?"[":`[${r}`}rf[e]=t=new RegExp(`${tf}|${r}\`/\\{}[\\]()]`,"g")}return t}function sf(e,t,r,n){let i=0;switch(t){case"[":case"(":case"{":e.push(t==="["?"]":t==="("?")":"}");break;case")":case"]":case"}":if(t!==e.pop()){Xc(n,yc.replace("%1",t),i)}if(t==="}"&&e[e.length-1]===Gc){t=e.pop()}i=r+1;break;case"/":i=Zc(n,r)}return{char:t,index:i}}function af(e,t,r){const[n,i]=r;const s=t+n.length;const a=[];const o=nf(i);o.lastIndex=s;let l;let u;while(u=o.exec(e)){const r=u.index;const n=u[0];l=o.lastIndex;if(n===i&&!a.length){return{text:e.slice(s,r),start:t,end:l}}const{char:c,index:f}=sf(a,n[0],r,e);l=f||l;o.lastIndex=c===Gc?zc(e,l,a):l}if(a.length){Xc(e,xc,l)}}function of(e){const t=e.last;e.last=null;if(t&&e.root){e.builder.push(t)}}function lf(e,t,r){return e.slice(t,r)}function uf(e,t,r,n){if(n===void 0){n={}}const i=lf(e.data,t,r);const s=n.expressions;const a=n.unescape;let o=e.last;e.pos=r;if(o&&o.type===sc){o.text+=i;o.end=r}else{of(e);e.last=o={type:sc,text:i,start:t,end:r}}if(s&&s.length){o.expressions=(o.expressions||[]).concat(s)}if(a){o.unescape=a}return sc}function cf(e,t,r,n){const i=hf(e,r);i.lastIndex=n;const{unescape:s,expressions:a,end:o}=ff(e,i);if(t){if(s){t.unescape=s}if(a.length){t.expressions=a}}else{uf(e,n,o,{expressions:a,unescape:s})}return o}function ff(e,t){const{data:r,options:n}=e;const{brackets:i}=n;const s=[];let a,o,l;while((l=t.exec(r))&&!l[1]){o=l.index;if(r[o-1]==="\\"){a=l[0]}else{const e=af(r,o,i);if(e){s.push(e);t.lastIndex=e.end}}}if(!l){Xc(r,dc,o)}return{unescape:a,expressions:s,end:l.index}}function hf(e,t){const{brackets:r}=e.options;const n=e.regexCache[t];if(n)return n;const i=Uc(r[0]);Object.assign(e.regexCache,{[t]:new RegExp(`(${t})|${i}`,"g")});return e.regexCache[t]}const pf=e=>e.filter((e,t,r)=>r.indexOf(e)===t);const df=["circle","ellipse","line","path","polygon","polyline","rect","stop","use"];const mf=["button","data","input","select","li","meter","option","output","progress","textarea","param"];const vf=pf(["a","altGlyph","altGlyphDef","altGlyphItem","animate","animateColor","animateMotion","animateTransform","animation","audio","canvas","clipPath","color-profile","cursor","defs","desc","discard","feBlend","feColorMatrix","feComponentTransfer","feComposite","feConvolveMatrix","feDiffuseLighting","feDisplacementMap","feDistantLight","feDropShadow","feFlood","feFuncA","feFuncB","feFuncG","feFuncR","feGaussianBlur","feImage","feMerge","feMergeNode","feMorphology","feOffset","fePointLight","feSpecularLighting","feSpotLight","feTile","feTurbulence","filter","font","font-face","font-face-format","font-face-name","font-face-src","font-face-uri","foreignObject","g","glyph","glyphRef","handler","hatch","hatchpath","hkern","iframe","image","linearGradient","listener","marker","mask","mesh","meshgradient","meshpatch","meshrow","metadata","missing-glyph","mpath","pattern","prefetch","radialGradient","script","set","solidColor","solidcolor","style","svg","switch","symbol","tbreak","text","textArea","textPath","title","tref","tspan","unknown","video","view","vkern"].concat(df)).sort();const gf=["area","base","br","col","embed","hr","img","input","keygen","link","menuitem","meta","param","source","track","wbr"];const yf=pf(["a","abbr","address","article","aside","audio","b","bdi","bdo","blockquote","body","canvas","caption","cite","code","colgroup","datalist","dd","del","details","dfn","dialog","div","dl","dt","em","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","head","header","hgroup","html","i","iframe","ins","kbd","label","legend","main","map","mark","math","menu","nav","noscript","object","ol","optgroup","p","picture","pre","q","rb","rp","rt","rtc","ruby","s","samp","script","section","select","slot","small","span","strong","style","sub","summary","sup","svg","table","tbody","td","template","tfoot","th","thead","time","title","tr","u","ul","var","video"].concat(gf).concat(mf)).sort();const xf=["disabled","visible","checked","readonly","required","allowfullscreen","autofocus","autoplay","compact","controls","default","formnovalidate","hidden","ismap","itemscope","loop","multiple","muted","noresize","noshade","novalidate","nowrap","open","reversed","seamless","selected","sortable","truespeed","typemustmatch"];function Ef(e){return e.join("|")}function bf(){for(var e=arguments.length,t=new Array(e),r=0;r<e;r++){t[r]=arguments[r]}return new RegExp(`^/?(?:${Ef(t.map(Ef))})$`,"i")}const Sf=bf(yf);const Df=bf(vf);const Cf=bf(gf);const wf=bf(df);const Af=bf(mf);const Tf=bf(xf);function kf(e){return[Cf,wf].some(t=>t.test(e))}function _f(e){return[Sf,Df].every(t=>!t.test(e))}function Pf(e){return Af.test(e)}function Ff(e){return Tf.test(e)}function If(e){const t=new WeakMap;return function(){if(t.has(arguments.length<=0?undefined:arguments[0]))return t.get(arguments.length<=0?undefined:arguments[0]);const r=e(...arguments);t.set(arguments.length<=0?undefined:arguments[0],r);return r}}const Mf=If(e=>RegExp(`(${e[0]}[^${e[1]}]*?${e[1]})`,"g"));const Nf=e=>Dc.test(e);const Lf=(e,t)=>e[0]===t[0];const Bf=(e,t)=>cf(e,t,"[>/\\s]",t.start);function Of(e){const{data:t,last:r,pos:n,root:i}=e;const s=r;const a=/\S/g;const o=jc(a,n,t);switch(true){case!o:e.pos=t.length;break;case o[0]===">":e.pos=s.end=a.lastIndex;if(s[Mc]){e.scryle=null;if(i&&i.name===s.name){e.count--}}return sc;case o[0]==="/":e.pos=a.lastIndex;s[Mc]=true;break;default:delete s[Mc];Rf(e,o.index,s)}return ic}function Rf(e,t,r){const{data:n}=e;const i=Mf(e.options.brackets);const s=Sc;const a=s.lastIndex=i.lastIndex=t;const o=s.exec(n);const l=Lf(o[1],e.options.brackets);const u=l?[null,i.exec(n)[1],null]:o;if(u){const t=s.lastIndex;const n=Gf(e,u,a,t,l);e.pos=r.end=n.end;r.attributes=Rc(r.attributes,n)}}function jf(e,t,r){const{data:n}=e;let{end:i}=t;if(Ff(t.name)){t[Lc]=true}if(r){let s=i;if(r!=='"'&&r!=="'"){r="";s--}i=cf(e,t,r||"[>/\\s]",s);return Object.assign(t,{value:lf(n,s,i),valueStart:s,end:r?++i:i})}return t}function Uf(e,t){const r=Bf(e,t);return{[Oc]:true,start:t.start,expressions:t.expressions.map(e=>Object.assign(e,{text:e.text.replace(Dc,"").trim()})),end:r}}function Vf(e,t){const r=Bf(e,t);return{start:t.start,name:t.expressions[0].text.trim(),expressions:t.expressions,end:r}}function Gf(e,t,r,n,i){const s={name:t[1],value:"",start:r,end:n};const a=t[2];switch(true){case Nf(s.name):return Uf(e,s);case i===true:return Vf(e,s);default:return jf(e,s,a)}}function zf(e,t,r){const n=r+2;const i=t.substr(n,2)==="--"?"--\x3e":">";const s=t.indexOf(i,n);if(s<0){Xc(t,mc,r)}Xf(e,r,s+i.length);return sc}function Xf(e,t,r){of(e);e.pos=r;if(e.options.comments===true){e.last={type:oc,start:t,end:r}}}function Jf(e,t,r,n){const i=e.root;const s={type:nc,name:t,start:r,end:n};if(_f(t)){s[Bc]=true}if(kf(t)){s[Nc]=true}e.pos=n;if(i){if(t===i.name){e.count++}else if(t===i.close){e.count--}of(e)}else{e.root={name:s.name,close:`/${t}`};e.count=1}e.last=s}function qf(e){const{pos:t,data:r}=e;const n=t-1;const i=r.substr(t,2);switch(true){case i[0]==="!":return zf(e,r,n);case Ec.test(i):return Wf(e,n);default:return uf(e,n,t)}}function Wf(e,t){const{data:r,pos:n}=e;const i=bc;const s=jc(i,n,r);const a=i.lastIndex;const o=s[1].toLowerCase();if(o in Cc){e.scryle=o}Jf(e,o,t,a);if(!s[2]){return ic}return sc}function Hf(e){const{pos:t,data:r,scryle:n}=e;switch(true){case typeof n==="string":{const i=n;const s=Cc[i];const a=jc(s,t,r);if(!a){Xc(r,vc.replace("%1",i),t-1)}const o=a.index;const l=s.lastIndex;e.scryle=null;if(o>t){Kf(e,i,a)}Jf(e,`/${i}`,o,l);break}case r[t]==="<":e.pos++;return nc;default:cf(e,null,"<",t)}return sc}function Kf(e,t,r){const{pos:n}=e;const i=r.index;if(t===Fc){cf(e,null,r[0],n)}else{uf(e,n,i)}}function $f(e){return e.replace(/\r/g,"\\r").replace(/\n/g,"\\n")}function Yf(e){return e.replace(/\\/g,"\\\\")}function Qf(e){return e.replace(/\s+/g," ")}const Zf=Object.seal({get(){const e=this.store;return{[kc]:e.root.nodes[0],[Tc]:e[Pc],[Ac]:e[_c]}},push(e){const t=this.store;switch(e.type){case sc:this.pushText(t,e);break;case nc:{const r=e.name;const n="/";const[i]=r;if(i===n&&!e.isVoid){this.closeTag(t,e,r)}else if(i!==n){this.openTag(t,e)}break}}},closeTag(e,t){const r=e.scryle||e.last;r.end=t.end;if(e.scryle){e.scryle=null}else{e.last=e.stack.pop()}},openTag(e,t){const r=t.name;const n=t.attributes;if([_c,Pc].includes(r)){if(e[r]){Xc(this.store.data,gc.replace("%1",r),t.start)}e[r]=t;e.scryle=e[r]}else{const n=e.last;const i=t;n.nodes.push(i);if(n[Ic]||wc.test(r)){t[Ic]=true}if(!t[Mc]&&!t[Nc]){e.stack.push(n);i.nodes=[];e.last=i}}if(n){this.attrs(n)}},attrs(e){e.forEach(e=>{if(e.value){this.split(e,e.value,e.valueStart,true)}})},pushText(e,t){const r=t.text;const n=!/\S/.test(r);const i=e.scryle;if(!i){const i=e.last;const s=this.compact&&!i[Ic];if(s&&n){return}this.split(t,r,t.start,s);i.nodes.push(t)}else if(!n){i.text=t}},split(e,t,r,n){const i=e.expressions;const s=[];if(i){let a=0;i.forEach(i=>{const o=t.slice(a,i.start-r);const l=i.text;s.push(this.sanitise(e,o,n),$f(Yf(l).trim()));a=i.end-r});if(a<e.end){s.push(this.sanitise(e,t.slice(a),n))}}else{s[0]=this.sanitise(e,t,n)}e.parts=s.filter(e=>e)},sanitise(e,t,r){let n=e.unescape;if(n){let e=0;n=`\\${n}`;while((e=t.indexOf(n,e))!==-1){t=t.substr(0,e)+t.substr(e+1);e++}}t=Yf(t);return r?Qf(t):$f(t)}});function eh(e,t){const r={type:nc,name:"",start:0,end:0,nodes:[]};return Object.assign(Object.create(Zf),{compact:t.compact!==false,store:{last:r,stack:[],scryle:null,root:r,style:null,script:null,data:e}})}function th(e,t){const r=Ha(rh)(e,t||eh);return{parse:e=>nh(r(e))}}function rh(e,t,r){const n=Object.assign({brackets:["{","}"]},e);return{options:n,regexCache:{},pos:0,count:-1,root:null,last:null,scryle:null,builder:t(r,n),data:r}}function nh(e){const{data:t}=e;ih(e);of(e);if(e.count){Xc(t,e.count>0?dc:hc,e.pos)}return{data:t,output:e.builder.get()}}function ih(e,t){const{data:r}=e;const n=r.length;if(e.pos<n&&e.count){ih(e,sh(e,t))}}function sh(e,t){switch(t){case nc:return qf(e);case ic:return Of(e);default:return Hf(e)}}const ah=fc;const oh="bindingTypes";const lh="EACH";const uh="IF";const ch="TAG";const fh="SLOT";const hh="expressionTypes";const ph="ATTRIBUTE";const dh="VALUE";const mh="TEXT";const vh="EVENT";const gh="template";const yh="scope";const xh="getComponent";const Eh="selector";const bh="getComponent";const Sh="template";const Dh="type";const Ch="redundantAttribute";const wh="condition";const Ah="itemName";const Th="getKey";const kh="indexName";const _h="evaluate";const Ph="name";const Fh="slots";const Ih="expressions";const Mh="childNodeIndex";const Nh="bindings";const Lh="id";const Bh="html";const Oh="attributes";const Rh="if";const jh="each";const Uh="key";const Vh="slot";const Gh="name";const zh="is";const Xh="default";const Jh="\x3c!----\x3e";const qh="expr";const Wh="slot";const Hh="progress";const Kh="isVoid";const $h="isCustom";const Yh="isBoolean";const Qh="isSpread";function Zh(e){return[hp,Ep,xp,rp,np].every(t=>!t(e))}function ep(e){let{scope:t,node:r}=e;return Boolean(Yu(r)||$u(r)||Ku(r)||Ju(r)||tp(t,r))}function tp(e,t){const r=function r(n){if(n===void 0){n=false}as.visit(t,{visitIdentifier(t){if(e.lookup(Tp(t.node))){n=true}this.abort()}});return n};return r()}function rp(e){return!!(e[$h]||vp(e))}function np(e){return e.name===Wh}function ip(e){return!!e[Kh]}function sp(e){return e.type===ah.TAG}function ap(e){return e.type===ah.TEXT}function op(e){return e.isRoot}function lp(e){return e[Qh]}function up(e){return e.name==="value"}function cp(e){return e.name===Hh}const fp=(()=>{const e=/^on/;return t=>e.test(t.name)})();function hp(e){return!!(e.expressions||Kp(e).some(e=>hp(e))||e.nodes&&e.nodes.some(e=>ap(e)&&hp(e)))}function pp(e){return[Ep,xp,rp].some(t=>t(e))}const dp=Ta(Boolean,xp);const mp=Ta(Boolean,Ep);const vp=Ta(Boolean,Sp);const gp=Ta(Boolean,bp);function yp(e,t){return t.attributes&&t.attributes.find(t=>Tp(t)===e)}function xp(e){return yp(Rh,e)}function Ep(e){return yp(jh,e)}function bp(e){return yp(Uh,e)}function Sp(e){return yp(zh,e)}function Dp(e){return Kp(e).filter(e=>!hp(e))}function Cp(e){return Kp(e).filter(hp)}function wp(e,t){return e.replace(RegExp(`\\\\${t}`,"gm"),t)}const Ap=os.identifier(yh);const Tp=e=>e&&e.name?e.name:e;function kp(e,t){e.replace(os.memberExpression(Ap,t,false))}function _p(e){if(!ep(e)){kp(e,e.node);return false}this.traverse(e)}function Pp(e){if(!ep(e)&&!ep({node:e.node.object,scope:e.scope})){if(e.value.computed){this.traverse(e)}else if(Wu(e.node.object)||e.node.object.computed){this.traverse(e.get("object"))}else if(!e.node.object.callee){kp(e,Xu(e.node.object)?e.node.property:e.node)}else{this.traverse(e.get("object"))}}return false}function Fp(e){const t=e.node.value;if(Uu(t)){_p(e.get("value"))}else{this.traverse(e.get("value"))}return false}function Ip(e){e.replace(Ap);this.traverse(e)}function Mp(e){const t=()=>false;as.visit(e,{visitIdentifier:_p,visitMemberExpression:Pp,visitProperty:Fp,visitThisExpression:Ip,visitClassExpression:t});return e}function Np(e,t,r){const n=t?eo(e.text,r,e):e.text;return tu(`(${n})`,{sourceFileName:t})}function Lp(e){return cs(Sh,e?Vp(...e):us())}function Bp(e){return e.expressions?e.expressions[0]:Object.assign({},e,{text:e.value})}function Op(e){return os.functionExpression(null,[Ap],os.blockStatement([os.returnStatement(e)]))}function Rp(e,t,r){return Ta(Op,jp)(e,t,r)}function jp(e,t,r){return Ta(Up,Mp,Np)(e,t,r)}function Up(e){const t=e.program.body;return t[0]?t[0].expression:t}function Vp(e,t){return os.callExpression(os.identifier(gh),[e?os.literal(e):us(),t?os.arrayExpression(t):us()])}const Gp=e=>`[${e}]`;function zp(e){return e?[cs(Ch,os.literal(e)),cs(Eh,Ta(os.literal,Gp)(e))]:[]}function Xp(e,t){return Object.assign({},e,{attributes:Jp(Kp(e),t)})}function Jp(e,t){if(t)return e.filter(e=>e.name!==t);return e}function qp(e){return Kp(e).filter(e=>![Rh,jh,Uh,Vh,zh].includes(e.name))}function Wp(e){return{nodes:Hp(e),isRoot:true,attributes:qp(e)}}function Hp(e){return e&&e.nodes?e.nodes:[]}function Kp(e){return e.attributes?e.attributes:[]}function $p(e){const t=Sp(e);const r=e=>`'${e}'`;if(t){return t.expressions?t.expressions[0]:Object.assign({},t,{text:r(t.value)})}return Object.assign({},e,{text:r(Tp(e))})}function Yp(e){return Dp(e).map(e=>e[Yh]||!e.value?e.name:`${e.name}="${Qp(e,"value").value}"`).join(" ")}function Qp(e,t){if(e.unescape){return Object.assign({},e,{[t]:wp(e[t],e.unescape)})}return e}function Zp(e){const t=Yp(e);switch(true){case sp(e):return`<${e.name}${t?` ${t}`:""}${ip(e)?"/":""}>`;case ap(e):return hp(e)?Jh:Qp(e,"text").text;default:return""}}function ed(e){return e.name?`</${e.name}>`:""}function td(e){return os.callExpression(os.memberExpression(os.arrayExpression(e),os.identifier("join"),false),[os.literal("")])}function rd(e,t,r){if(!e.parts||e.parts.length===1){return jp(e.expressions[0],t,r)}const n=[...e.parts.reduce((n,i)=>{const s=e.expressions.find(e=>e.text.trim()===i);return[...n,s?jp(s,t,r):os.literal(i)]},[])].filter(e=>!Vu(e)||e.value);return td(n)}const nd=function e(t){if(t===void 0){t=0}return()=>`${qh}${t++}`}();function id(e,t,r){return hp(e)?Op(rd(e,t,r)):os.functionExpression(null,[],os.blockStatement([os.returnStatement(os.literal(e.value||true))]))}function sd(e){return JSON.parse(JSON.stringify(e))}const ad=e=>qu(e.left)?e.left.expressions[0]:e.left;const od=e=>qu(e.left)?e.left.expressions[1]:null;const ld=e=>e.right;const ud=Ta(os.literal,Tp);const cd=e=>cs(Ah,Ta(ud,ad)(e));const fd=e=>cs(kh,Ta(ud,od)(e));const hd=(e,t,r,n)=>cs(_h,Ta(e=>Rp(e,r,n),e=>Object.assign({},t,{text:Ka(e).code}),ld)(e));function pd(e,t,r){const n=Np(e,t,r);const i=n.program.body;const s=i[0];if(!Gu(s)){ya(`The each directives supported should be of type "ExpressionStatement",you have provided a "${s.type}"`)}const{expression:a}=s;return[cd(a),fd(a),hd(a,e,t,r)]}function dd(e,t,r,n){const[i,s,a]=[xp,Ep,bp].map(t=>t(e));const o=e=>e?Rp(Bp(e),r,n):us();return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(oh),os.identifier(lh),false)),cs(Th,o(a)),cs(wh,o(i)),Lp(Rd(e,r,n,t)),...zp(t),...Ta(pd,Bp)(s)])}function md(e,t,r,n){const i=xp(e);return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(oh),os.identifier(uh),false)),cs(_h,Rp(i.expressions[0],r,n)),...zp(t),Lp(Rd(e,r,n,t))])}function vd(e,t,r){return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(hh),os.identifier(ph),false)),cs(Ph,lp(e)?us():os.literal(e.name)),cs(_h,id(e,t,r))])}function gd(e,t,r){return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(hh),os.identifier(vh),false)),cs(Ph,os.literal(e.name)),cs(_h,id(e,t,r))])}function yd(e,t){return e.expressions.reduce((r,n,i)=>{const s=i?e.expressions[i-1].end:e.start;r.push(t.substring(s,n.start));if(i===e.expressions.length-1)r.push(t.substring(n.end,e.end));return r},[]).map(t=>e.unescape?wp(t,e.unescape):t)}function xd(e,t,r){if(e.parts.length===1)return jp(e.expressions[0],t,r);const n=yd(e,r);const i=n.reduce((n,i,s)=>{const a=e.expressions[s];return[...n,os.literal(i),a?jp(a,t,r):us()]},[]).filter(e=>!Vu(e)||e.value);return td(i)}function Ed(e,t,r,n){return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(hh),os.identifier(mh),false)),cs(Mh,os.literal(n)),cs(_h,Op(xd(e,t,r)))])}function bd(e,t,r){return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(hh),os.identifier(dh),false)),cs(_h,id(e,t,r))])}function Sd(e,t,r,n,i){switch(true){case ap(e):return Ed(e,t,r,n);case up(e)&&Pf(i.name)&&!cp(i):return bd(e,t,r);case fp(e):return gd(e,t,r);default:return vd(e,t,r)}}function Dd(e,t,r){return Cp(e).map(n=>Sd(n,t,r,0,e))}function Cd(e,t,r){const n=Hp(e);return n.filter(ap).filter(hp).map(i=>Sd(i,t,r,n.indexOf(i),e))}function wd(e,t,r,n){return os.objectExpression([...zp(t),cs(Ih,os.arrayExpression([...Cd(e,r,n),...Dd(e,r,n)]))])}function Ad(e,t){const r=yp(Gh,e);const n=r?r.value:Xh;return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(oh),os.identifier(fh),false)),cs(Ph,os.literal(n)),...zp(t)])}function Td(e){return Hp(e).reduce((e,t)=>{const r=Fd(t);if(r){e[r.value]=t}else{e.default=Wp({nodes:[...Hp(e.default),t]})}return e},{default:null})}function kd(e,t,r,n){const i=Object.assign({},t,{attributes:Kp(t).filter(e=>e.name!==Vh)});const[s,a]=jd(i,r,n);return os.objectExpression([cs(Lh,os.literal(e)),cs(Bh,os.literal(s)),cs(Nh,os.arrayExpression(a))])}function _d(e,t,r){return os.arrayExpression([...Ta(e=>e.map(e=>{let[n,i]=e;return kd(n,i,t,r)}),e=>e.filter(e=>{let[,t]=e;return t}),Object.entries,Td)(e)])}function Pd(e,t,r,n){return os.arrayExpression([...Ta(t=>t.map(t=>Sd(t,r,n,0,e)),e=>Jp(e,t),qp)(e)])}function Fd(e){return Kp(e).find(e=>e.name===Vh)}function Id(e,t,r,n){return os.objectExpression([cs(Dh,os.memberExpression(os.identifier(oh),os.identifier(ch),false)),cs(bh,os.identifier(xh)),cs(_h,Rp($p(e),r,n)),cs(Fh,_d(e,r,n)),cs(Oh,Pd(e,t,r,n)),...zp(t)])}const Md=Object.freeze({html:[],bindings:[],parent:null});function Nd(e,t){if(!t)return e;return Object.assign({},e,{attributes:[{name:t,value:t},...Kp(e)]})}function Ld(e,t,r,n){switch(true){case ap(e):return[Zp(e),[]];default:return Bd(e,t,r)}}function Bd(e,t,r){const n=op(e)?null:nd();const i=Nd(e,n);const s=Zp(i);switch(true){case mp(i):return[s,[dd(i,n,t,r)]];case dp(i):return[s,[md(i,n,t,r)]];case rp(i):return[s,[Id(i,n,t,r)]];case np(i):return[s,[Ad(i,n)]];default:return[s,[wd(i,n,t,r)]]}}function Od(e,t,r,n){if(Zh(e))return[Zp(e),[]];return Ld(e,t,r)}function Rd(e,t,r,n){const i=rp(e);return i?[null,[Id(Xp(e,n),null,t,r)]]:jd(Wp(e),t,r)}function jd(e,t,r,n){if(!e)ya("Something went wrong with your tag DOM parsing, your tag template can't be created");const[i,s]=Od(e,t,r);const a=Hp(e);const o=Object.assign({},sd(Md),{},n);o.html.push(...i);o.bindings.push(...s);if(a.length&&!pp(e)){a.forEach(n=>jd(n,t,r,Object.assign({parent:e},o)))}if(sp(e)&&!ip(e)){o.html.push(ed(e))}return[o.html.join(""),o.bindings]}const Ud=[gh,hh,oh,xh].map(os.identifier);function Vd(e,t,r){return os.blockStatement([os.returnStatement(Vp(...jd(Wp(e),t,r)))])}function Gd(e,t,r,n){as.visit(e,{visitProperty(e){if(e.value.key.value===s){e.value.value=os.functionExpression(null,Ud,Vd(n,t,r));return false}this.traverse(e)}});return e}function zd(e,t,r,n){const{options:i}=r;return Gd(n,i.file,t,e)}const Xd={template:"default",file:"[unknown-source-file]",scopedCss:true};function Jd(e){let{tagName:t}=e;return os.program([os.exportDefaultDeclaration(os.objectExpression([cs(i,us()),cs(n,us()),cs(s,us()),cs(a,os.literal(t))]))])}function qd(e){const t=fs(e);return $a(t)?null:t}function Wd(e,t){return Object.assign({},e,{sourcesContent:[t]})}function Hd(e,t){return{tagName:null,fragments:null,options:Object.assign({},Xd,{},t),source:e}}function Kd(e,t){if(t===void 0){t={}}const r=Hd(e,t);const{options:n}=r;const{code:i,map:s}=Aa("template",n.template,r,e);const{template:a,css:o,javascript:l}=th(n).parse(i).output;Object.assign(r,{tagName:a.name,fragments:{template:a,css:o,javascript:l}});return Ta(e=>Object.assign({},e,{meta:r}),e=>ba(e,r),t=>Object.assign({},t,{map:Wd(t.map,e)}),e=>r.ast=e&&Ka(e,{sourceMapName:`${n.file}.map`,inputSourceMap:qd(s)}),$d(zd,a,i,r),$d(rc,l,i,r),$d(Wa,o,i,r))(Jd(r))}function $d(e,t,r,n){if(!t||t.nodes&&!t.nodes.length||!t.nodes&&!t.text){return e=>e}return Ha(e)(t,r,n)}const Yd=wa;const Qd=Ea;e.compile=Kd;e.createInitialInput=Jd;e.registerPostprocessor=Qd;e.registerPreprocessor=Yd;Object.defineProperty(e,"__esModule",{value:true})})});var zt=Bt(Gt);const Xt="__riot_registry__";window[Xt]={};function Jt(e,t){const r=document.createElement("script");const n=document.documentElement;if(t)r.text=`${e}\n//# sourceURL=${t}.js`;n.appendChild(r);n.removeChild(r)}function qt(e){return`(function (global){${e}})(this)`.replace("export default","return")}function Wt(e,t,r){Jt(`window.${Xt}['${t}'] = ${qt(e)}`,r);wt(t,window[Xt][t])}function Ht(e,t){return zt.compile(e,t)}async function Kt(e,t){const r=await fetch(e);const n=await r.text();return zt.compile(n,Object.assign({file:e},t))}async function $t(e){const t=tt('script[type="riot"]');const r=t.map(e=>Qe(e,"src")||Qe(e,"data-src"));const n=await Promise.all(r.map(t=>Kt(t,e)));n.forEach((e,t)=>{let{code:n,meta:i}=e;const s=r[t];const{tagName:a}=i;Wt(n,a,s)})}var Yt=Object.assign({},Nt,{compile:$t,inject:Wt,compileFromUrl:Kt,compileFromString:Ht});return Yt});
diff --git a/node_modules/riot/riot.d.ts b/node_modules/riot/riot.d.ts
new file mode 100644
index 0000000..d48c6a2
--- /dev/null
+++ b/node_modules/riot/riot.d.ts
@@ -0,0 +1,71 @@
+// This interface is only exposed and any Riot component will receive the following properties
+export interface RiotCoreComponent<P = object, S = object> {
+  // automatically generated on any component instance
+  readonly props: P
+  readonly root: HTMLElement
+  readonly name?: string
+  // TODO: add the @riotjs/dom-bindings types
+  readonly slots: any[]
+  mount(
+    element: HTMLElement,
+    initialState?: S,
+    parentScope?: object
+  ): RiotComponent<P, S>
+  update(
+    newState?: Partial<S>,
+    parentScope?: object
+  ): RiotComponent<P, S>
+  unmount(keepRootElement: boolean): RiotComponent<P, S>
+
+  // Helpers
+  $(selector: string): HTMLElement
+  $$(selector: string): [HTMLElement]
+}
+
+// This object interface is created anytime a riot file will be compiled into javascript
+export interface RiotComponentShell<P = object, S = object> {
+  readonly css?: string
+  readonly exports?: () => RiotComponentExport<P, S>|object
+  readonly name?: string
+  // TODO: add the @riotjs/dom-bindings types
+  template(): any
+}
+
+// Interface that can be used when creating the components export
+export interface RiotComponentExport<P = object, S = object> {
+  // optional on the component object
+  state?: S
+
+  // optional alias to map the children component names
+  components?: {
+    [key: string]: RiotComponentShell<P, S>
+  }
+
+  // state handling methods
+  shouldUpdate?(newProps: P, currentProps: P): boolean
+
+  // lifecycle methods
+  onBeforeMount?(currentProps: P, currentState: S): void
+  onMounted?(currentProps: P, currentState: S): void
+  onBeforeUpdate?(currentProps: P, currentState: S): void
+  onUpdated?(currentProps: P, currentState: S): void
+  onBeforeUnmount?(currentProps: P, currentState: S): void
+  onUnmounted?(currentProps: P, currentState: S): void
+  [key: string]: any
+}
+
+// All the RiotComponent Public interface properties are optional
+export interface RiotComponent<P = object, S = object> extends RiotCoreComponent<P, S>, RiotComponentExport<P, S> {}
+
+export type RegisteredComponentsMap = Map<string, () => RiotComponent>
+export type ComponentEnhancer = <P, S>(component: RiotComponent<P, S>) => RiotComponent<P, S>
+export type InstalledPluginsSet = Set<ComponentEnhancer>
+
+export function register<P, S>(componentName: string, shell: RiotComponentShell<P, S>): RegisteredComponentsMap
+export function unregister(componentName: string): RegisteredComponentsMap
+export function mount<P = object, S = object>(selector: string, initialProps?: P, componentName?: string): RiotComponent<P, S>[]
+export function unmount(selector: string, keepRootElement: boolean):HTMLElement[]
+export function install(plugin: ComponentEnhancer):InstalledPluginsSet
+export function uninstall(plugin: ComponentEnhancer):InstalledPluginsSet
+export function component<P , S>(shell: RiotComponentShell<P, S>):(el: HTMLElement, initialProps?: P) => RiotComponent<P, S>
+export const version: string
diff --git a/node_modules/riot/riot.esm.js b/node_modules/riot/riot.esm.js
new file mode 100644
index 0000000..c2dcfc0
--- /dev/null
+++ b/node_modules/riot/riot.esm.js
@@ -0,0 +1,2366 @@
+/* Riot v4.5.0, @license MIT */
+const COMPONENTS_IMPLEMENTATION_MAP = new Map(),
+      DOM_COMPONENT_INSTANCE_PROPERTY = Symbol('riot-component'),
+      PLUGINS_SET = new Set(),
+      IS_DIRECTIVE = 'is',
+      VALUE_ATTRIBUTE = 'value',
+      ATTRIBUTES_KEY_SYMBOL = Symbol('attributes'),
+      TEMPLATE_KEY_SYMBOL = Symbol('template');
+
+var globals = /*#__PURE__*/Object.freeze({
+  COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP,
+  DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY,
+  PLUGINS_SET: PLUGINS_SET,
+  IS_DIRECTIVE: IS_DIRECTIVE,
+  VALUE_ATTRIBUTE: VALUE_ATTRIBUTE,
+  ATTRIBUTES_KEY_SYMBOL: ATTRIBUTES_KEY_SYMBOL,
+  TEMPLATE_KEY_SYMBOL: TEMPLATE_KEY_SYMBOL
+});
+
+/**
+ * Remove the child nodes from any DOM node
+ * @param   {HTMLElement} node - target node
+ * @returns {undefined}
+ */
+function cleanNode(node) {
+  clearChildren(node.childNodes);
+}
+/**
+ * Clear multiple children in a node
+ * @param   {HTMLElement[]} children - direct children nodes
+ * @returns {undefined}
+ */
+
+
+function clearChildren(children) {
+  Array.from(children).forEach(n => n.parentNode && n.parentNode.removeChild(n));
+}
+
+const EACH = 0;
+const IF = 1;
+const SIMPLE = 2;
+const TAG = 3;
+const SLOT = 4;
+var bindingTypes = {
+  EACH,
+  IF,
+  SIMPLE,
+  TAG,
+  SLOT
+};
+/**
+ * Create the template meta object in case of <template> fragments
+ * @param   {TemplateChunk} componentTemplate - template chunk object
+ * @returns {Object} the meta property that will be passed to the mount function of the TemplateChunk
+ */
+
+function createTemplateMeta(componentTemplate) {
+  const fragment = componentTemplate.dom.cloneNode(true);
+  return {
+    avoidDOMInjection: true,
+    fragment,
+    children: Array.from(fragment.childNodes)
+  };
+}
+/* get rid of the @ungap/essential-map polyfill */
+
+
+const {
+  indexOf: iOF
+} = [];
+
+const append = (get, parent, children, start, end, before) => {
+  const isSelect = 'selectedIndex' in parent;
+  let noSelection = isSelect;
+
+  while (start < end) {
+    const child = get(children[start], 1);
+    parent.insertBefore(child, before);
+
+    if (isSelect && noSelection && child.selected) {
+      noSelection = !noSelection;
+      let {
+        selectedIndex
+      } = parent;
+      parent.selectedIndex = selectedIndex < 0 ? start : iOF.call(parent.querySelectorAll('option'), child);
+    }
+
+    start++;
+  }
+};
+
+const eqeq = (a, b) => a == b;
+
+const identity = O => O;
+
+const indexOf = (moreNodes, moreStart, moreEnd, lessNodes, lessStart, lessEnd, compare) => {
+  const length = lessEnd - lessStart;
+  /* istanbul ignore if */
+
+  if (length < 1) return -1;
+
+  while (moreEnd - moreStart >= length) {
+    let m = moreStart;
+    let l = lessStart;
+
+    while (m < moreEnd && l < lessEnd && compare(moreNodes[m], lessNodes[l])) {
+      m++;
+      l++;
+    }
+
+    if (l === lessEnd) return moreStart;
+    moreStart = m + 1;
+  }
+
+  return -1;
+};
+
+const isReversed = (futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare) => {
+  while (currentStart < currentEnd && compare(currentNodes[currentStart], futureNodes[futureEnd - 1])) {
+    currentStart++;
+    futureEnd--;
+  }
+
+  return futureEnd === 0;
+};
+
+const next = (get, list, i, length, before) => i < length ? get(list[i], 0) : 0 < i ? get(list[i - 1], -0).nextSibling : before;
+
+const remove = (get, parent, children, start, end) => {
+  if (end - start < 2) parent.removeChild(get(children[start], -1));else {
+    const range = parent.ownerDocument.createRange();
+    range.setStartBefore(get(children[start], -1));
+    range.setEndAfter(get(children[end - 1], -1));
+    range.deleteContents();
+  }
+}; // - - - - - - - - - - - - - - - - - - -
+// diff related constants and utilities
+// - - - - - - - - - - - - - - - - - - -
+
+
+const DELETION = -1;
+const INSERTION = 1;
+const SKIP = 0;
+const SKIP_OND = 50;
+
+const HS = (futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges) => {
+  let k = 0;
+  /* istanbul ignore next */
+
+  let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+  const link = Array(minLen++);
+  const tresh = Array(minLen);
+  tresh[0] = -1;
+
+  for (let i = 1; i < minLen; i++) tresh[i] = currentEnd;
+
+  const keymap = new Map();
+
+  for (let i = currentStart; i < currentEnd; i++) keymap.set(currentNodes[i], i);
+
+  for (let i = futureStart; i < futureEnd; i++) {
+    const idxInOld = keymap.get(futureNodes[i]);
+
+    if (idxInOld != null) {
+      k = findK(tresh, minLen, idxInOld);
+      /* istanbul ignore else */
+
+      if (-1 < k) {
+        tresh[k] = idxInOld;
+        link[k] = {
+          newi: i,
+          oldi: idxInOld,
+          prev: link[k - 1]
+        };
+      }
+    }
+  }
+
+  k = --minLen;
+  --currentEnd;
+
+  while (tresh[k] > currentEnd) --k;
+
+  minLen = currentChanges + futureChanges - k;
+  const diff = Array(minLen);
+  let ptr = link[k];
+  --futureEnd;
+
+  while (ptr) {
+    const {
+      newi,
+      oldi
+    } = ptr;
+
+    while (futureEnd > newi) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+
+    while (currentEnd > oldi) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+
+    diff[--minLen] = SKIP;
+    --futureEnd;
+    --currentEnd;
+    ptr = ptr.prev;
+  }
+
+  while (futureEnd >= futureStart) {
+    diff[--minLen] = INSERTION;
+    --futureEnd;
+  }
+
+  while (currentEnd >= currentStart) {
+    diff[--minLen] = DELETION;
+    --currentEnd;
+  }
+
+  return diff;
+}; // this is pretty much the same petit-dom code without the delete map part
+// https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+
+
+const OND = (futureNodes, futureStart, rows, currentNodes, currentStart, cols, compare) => {
+  const length = rows + cols;
+  const v = [];
+  let d, k, r, c, pv, cv, pd;
+
+  outer: for (d = 0; d <= length; d++) {
+    /* istanbul ignore if */
+    if (d > SKIP_OND) return null;
+    pd = d - 1;
+    /* istanbul ignore next */
+
+    pv = d ? v[d - 1] : [0, 0];
+    cv = v[d] = [];
+
+    for (k = -d; k <= d; k += 2) {
+      if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+        c = pv[pd + k + 1];
+      } else {
+        c = pv[pd + k - 1] + 1;
+      }
+
+      r = c - k;
+
+      while (c < cols && r < rows && compare(currentNodes[currentStart + c], futureNodes[futureStart + r])) {
+        c++;
+        r++;
+      }
+
+      if (c === cols && r === rows) {
+        break outer;
+      }
+
+      cv[d + k] = c;
+    }
+  }
+
+  const diff = Array(d / 2 + length / 2);
+  let diffIdx = diff.length - 1;
+
+  for (d = v.length - 1; d >= 0; d--) {
+    while (c > 0 && r > 0 && compare(currentNodes[currentStart + c - 1], futureNodes[futureStart + r - 1])) {
+      // diagonal edge = equality
+      diff[diffIdx--] = SKIP;
+      c--;
+      r--;
+    }
+
+    if (!d) break;
+    pd = d - 1;
+    /* istanbul ignore next */
+
+    pv = d ? v[d - 1] : [0, 0];
+    k = c - r;
+
+    if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+      // vertical edge = insertion
+      r--;
+      diff[diffIdx--] = INSERTION;
+    } else {
+      // horizontal edge = deletion
+      c--;
+      diff[diffIdx--] = DELETION;
+    }
+  }
+
+  return diff;
+};
+
+const applyDiff = (diff, get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before) => {
+  const live = new Map();
+  const length = diff.length;
+  let currentIndex = currentStart;
+  let i = 0;
+
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        futureStart++;
+        currentIndex++;
+        break;
+
+      case INSERTION:
+        // TODO: bulk appends for sequential nodes
+        live.set(futureNodes[futureStart], 1);
+        append(get, parentNode, futureNodes, futureStart++, futureStart, currentIndex < currentLength ? get(currentNodes[currentIndex], 0) : before);
+        break;
+
+      case DELETION:
+        currentIndex++;
+        break;
+    }
+  }
+
+  i = 0;
+
+  while (i < length) {
+    switch (diff[i++]) {
+      case SKIP:
+        currentStart++;
+        break;
+
+      case DELETION:
+        // TODO: bulk removes for sequential nodes
+        if (live.has(currentNodes[currentStart])) currentStart++;else remove(get, parentNode, currentNodes, currentStart++, currentStart);
+        break;
+    }
+  }
+};
+
+const findK = (ktr, length, j) => {
+  let lo = 1;
+  let hi = length;
+
+  while (lo < hi) {
+    const mid = (lo + hi) / 2 >>> 0;
+    if (j < ktr[mid]) hi = mid;else lo = mid + 1;
+  }
+
+  return lo;
+};
+
+const smartDiff = (get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before) => {
+  applyDiff(OND(futureNodes, futureStart, futureChanges, currentNodes, currentStart, currentChanges, compare) || HS(futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges), get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before);
+};
+/*! (c) 2018 Andrea Giammarchi (ISC) */
+
+
+const domdiff = (parentNode, // where changes happen
+currentNodes, // Array of current items/nodes
+futureNodes, // Array of future items/nodes
+options // optional object with one of the following properties
+//  before: domNode
+//  compare(generic, generic) => true if same generic
+//  node(generic) => Node
+) => {
+  if (!options) options = {};
+  const compare = options.compare || eqeq;
+  const get = options.node || identity;
+  const before = options.before == null ? null : get(options.before, 0);
+  const currentLength = currentNodes.length;
+  let currentEnd = currentLength;
+  let currentStart = 0;
+  let futureEnd = futureNodes.length;
+  let futureStart = 0; // common prefix
+
+  while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentStart], futureNodes[futureStart])) {
+    currentStart++;
+    futureStart++;
+  } // common suffix
+
+
+  while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])) {
+    currentEnd--;
+    futureEnd--;
+  }
+
+  const currentSame = currentStart === currentEnd;
+  const futureSame = futureStart === futureEnd; // same list
+
+  if (currentSame && futureSame) return futureNodes; // only stuff to add
+
+  if (currentSame && futureStart < futureEnd) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentStart, currentLength, before));
+    return futureNodes;
+  } // only stuff to remove
+
+
+  if (futureSame && currentStart < currentEnd) {
+    remove(get, parentNode, currentNodes, currentStart, currentEnd);
+    return futureNodes;
+  }
+
+  const currentChanges = currentEnd - currentStart;
+  const futureChanges = futureEnd - futureStart;
+  let i = -1; // 2 simple indels: the shortest sequence is a subsequence of the longest
+
+  if (currentChanges < futureChanges) {
+    i = indexOf(futureNodes, futureStart, futureEnd, currentNodes, currentStart, currentEnd, compare); // inner diff
+
+    if (-1 < i) {
+      append(get, parentNode, futureNodes, futureStart, i, get(currentNodes[currentStart], 0));
+      append(get, parentNode, futureNodes, i + currentChanges, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+      return futureNodes;
+    }
+  }
+  /* istanbul ignore else */
+  else if (futureChanges < currentChanges) {
+      i = indexOf(currentNodes, currentStart, currentEnd, futureNodes, futureStart, futureEnd, compare); // outer diff
+
+      if (-1 < i) {
+        remove(get, parentNode, currentNodes, currentStart, i);
+        remove(get, parentNode, currentNodes, i + futureChanges, currentEnd);
+        return futureNodes;
+      }
+    } // common case with one replacement for many nodes
+  // or many nodes replaced for a single one
+
+  /* istanbul ignore else */
+
+
+  if (currentChanges < 2 || futureChanges < 2) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, get(currentNodes[currentStart], 0));
+    remove(get, parentNode, currentNodes, currentStart, currentEnd);
+    return futureNodes;
+  } // the half match diff part has been skipped in petit-dom
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+  // accordingly, I think it's safe to skip in here too
+  // if one day it'll come out like the speediest thing ever to do
+  // then I might add it in here too
+  // Extra: before going too fancy, what about reversed lists ?
+  //        This should bail out pretty quickly if that's not the case.
+
+
+  if (currentChanges === futureChanges && isReversed(futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare)) {
+    append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+    return futureNodes;
+  } // last resort through a smart diff
+
+
+  smartDiff(get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before);
+  return futureNodes;
+};
+/**
+ * Check if a value is null or undefined
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the 'undefined' and 'null' types
+ */
+
+
+function isNil(value) {
+  return value === null || value === undefined;
+}
+/**
+ * Check if an element is a template tag
+ * @param   {HTMLElement}  el - element to check
+ * @returns {boolean} true if it's a <template>
+ */
+
+
+function isTemplate(el) {
+  return !isNil(el.content);
+}
+
+const EachBinding = Object.seal({
+  // dynamic binding properties
+  childrenMap: null,
+  node: null,
+  root: null,
+  condition: null,
+  evaluate: null,
+  template: null,
+  isTemplateTag: false,
+  nodes: [],
+  getKey: null,
+  indexName: null,
+  itemName: null,
+  afterPlaceholder: null,
+  placeholder: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    return this.update(scope, parentScope);
+  },
+
+  update(scope, parentScope) {
+    const {
+      placeholder
+    } = this;
+    const collection = this.evaluate(scope);
+    const items = collection ? Array.from(collection) : [];
+    const parent = placeholder.parentNode; // prepare the diffing
+
+    const {
+      newChildrenMap,
+      batches,
+      futureNodes
+    } = createPatch(items, scope, parentScope, this); // patch the DOM only if there are new nodes
+
+    if (futureNodes.length) {
+      domdiff(parent, this.nodes, futureNodes, {
+        before: placeholder,
+        node: patch(Array.from(this.childrenMap.values()), parentScope)
+      });
+    } else {
+      // remove all redundant templates
+      unmountRedundant(this.childrenMap);
+    } // trigger the mounts and the updates
+
+
+    batches.forEach(fn => fn()); // update the children map
+
+    this.childrenMap = newChildrenMap;
+    this.nodes = futureNodes;
+    return this;
+  },
+
+  unmount(scope, parentScope) {
+    unmountRedundant(this.childrenMap, parentScope);
+    this.childrenMap = new Map();
+    this.nodes = [];
+    return this;
+  }
+
+});
+/**
+ * Patch the DOM while diffing
+ * @param   {TemplateChunk[]} redundant - redundant tepmplate chunks
+ * @param   {*} parentScope - scope of the parent template
+ * @returns {Function} patch function used by domdiff
+ */
+
+function patch(redundant, parentScope) {
+  return (item, info) => {
+    if (info < 0) {
+      const {
+        template,
+        context
+      } = redundant.pop(); // notice that we pass null as last argument because
+      // the root node and its children will be removed by domdiff
+
+      template.unmount(context, parentScope, null);
+    }
+
+    return item;
+  };
+}
+/**
+ * Unmount the remaining template instances
+ * @param   {Map} childrenMap - map containing the children template to unmount
+ * @param   {*} parentScope - scope of the parent template
+ * @returns {TemplateChunk[]} collection containing the template chunks unmounted
+ */
+
+
+function unmountRedundant(childrenMap, parentScope) {
+  return Array.from(childrenMap.values()).map((_ref) => {
+    let {
+      template,
+      context
+    } = _ref;
+    return template.unmount(context, parentScope, true);
+  });
+}
+/**
+ * Check whether a template must be filtered from a loop
+ * @param   {Function} condition - filter function
+ * @param   {Object} context - argument passed to the filter function
+ * @returns {boolean} true if this item should be skipped
+ */
+
+
+function mustFilterItem(condition, context) {
+  return condition ? Boolean(condition(context)) === false : false;
+}
+/**
+ * Extend the scope of the looped template
+ * @param   {Object} scope - current template scope
+ * @param   {string} options.itemName - key to identify the looped item in the new context
+ * @param   {string} options.indexName - key to identify the index of the looped item
+ * @param   {number} options.index - current index
+ * @param   {*} options.item - collection item looped
+ * @returns {Object} enhanced scope object
+ */
+
+
+function extendScope(scope, _ref2) {
+  let {
+    itemName,
+    indexName,
+    index,
+    item
+  } = _ref2;
+  scope[itemName] = item;
+  if (indexName) scope[indexName] = index;
+  return scope;
+}
+/**
+ * Loop the current template items
+ * @param   {Array} items - expression collection value
+ * @param   {*} scope - template scope
+ * @param   {*} parentScope - scope of the parent template
+ * @param   {EeachBinding} binding - each binding object instance
+ * @returns {Object} data
+ * @returns {Map} data.newChildrenMap - a Map containing the new children template structure
+ * @returns {Array} data.batches - array containing the template lifecycle functions to trigger
+ * @returns {Array} data.futureNodes - array containing the nodes we need to diff
+ */
+
+
+function createPatch(items, scope, parentScope, binding) {
+  const {
+    condition,
+    template,
+    childrenMap,
+    itemName,
+    getKey,
+    indexName,
+    root,
+    isTemplateTag
+  } = binding;
+  const newChildrenMap = new Map();
+  const batches = [];
+  const futureNodes = [];
+  items.forEach((item, index) => {
+    const context = extendScope(Object.create(scope), {
+      itemName,
+      indexName,
+      index,
+      item
+    });
+    const key = getKey ? getKey(context) : index;
+    const oldItem = childrenMap.get(key);
+
+    if (mustFilterItem(condition, context)) {
+      return;
+    }
+
+    const componentTemplate = oldItem ? oldItem.template : template.clone();
+    const el = oldItem ? componentTemplate.el : root.cloneNode();
+    const mustMount = !oldItem;
+    const meta = isTemplateTag && mustMount ? createTemplateMeta(componentTemplate) : {};
+
+    if (mustMount) {
+      batches.push(() => componentTemplate.mount(el, context, parentScope, meta));
+    } else {
+      componentTemplate.update(context, parentScope);
+    } // create the collection of nodes to update or to add
+    // in case of template tags we need to add all its children nodes
+
+
+    if (isTemplateTag) {
+      futureNodes.push(...(meta.children || componentTemplate.children));
+    } else {
+      futureNodes.push(el);
+    } // delete the old item from the children map
+
+
+    childrenMap.delete(key); // update the children map
+
+    newChildrenMap.set(key, {
+      template: componentTemplate,
+      context,
+      index
+    });
+  });
+  return {
+    newChildrenMap,
+    batches,
+    futureNodes
+  };
+}
+
+function create(node, _ref3) {
+  let {
+    evaluate,
+    condition,
+    itemName,
+    indexName,
+    getKey,
+    template
+  } = _ref3;
+  const placeholder = document.createTextNode('');
+  const parent = node.parentNode;
+  const root = node.cloneNode();
+  parent.insertBefore(placeholder, node);
+  parent.removeChild(node);
+  return Object.assign({}, EachBinding, {
+    childrenMap: new Map(),
+    node,
+    root,
+    condition,
+    evaluate,
+    isTemplateTag: isTemplate(root),
+    template: template.createDOM(node),
+    getKey,
+    indexName,
+    itemName,
+    placeholder
+  });
+}
+/**
+ * Binding responsible for the `if` directive
+ */
+
+
+const IfBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  evaluate: null,
+  parent: null,
+  isTemplateTag: false,
+  placeholder: null,
+  template: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    this.parent.insertBefore(this.placeholder, this.node);
+    this.parent.removeChild(this.node);
+    return this.update(scope, parentScope);
+  },
+
+  update(scope, parentScope) {
+    const value = !!this.evaluate(scope);
+    const mustMount = !this.value && value;
+    const mustUnmount = this.value && !value;
+
+    const mount = () => {
+      const pristine = this.node.cloneNode();
+      this.parent.insertBefore(pristine, this.placeholder);
+      this.template = this.template.clone();
+      this.template.mount(pristine, scope, parentScope);
+    };
+
+    switch (true) {
+      case mustMount:
+        mount();
+        break;
+
+      case mustUnmount:
+        this.unmount(scope);
+        break;
+
+      default:
+        if (value) this.template.update(scope, parentScope);
+    }
+
+    this.value = value;
+    return this;
+  },
+
+  unmount(scope, parentScope) {
+    this.template.unmount(scope, parentScope, true);
+    return this;
+  }
+
+});
+
+function create$1(node, _ref4) {
+  let {
+    evaluate,
+    template
+  } = _ref4;
+  return Object.assign({}, IfBinding, {
+    node,
+    evaluate,
+    parent: node.parentNode,
+    placeholder: document.createTextNode(''),
+    template: template.createDOM(node)
+  });
+}
+
+const ATTRIBUTE = 0;
+const EVENT = 1;
+const TEXT = 2;
+const VALUE = 3;
+var expressionTypes = {
+  ATTRIBUTE,
+  EVENT,
+  TEXT,
+  VALUE
+};
+/**
+ * Check if a value is a Boolean
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the value is a boolean
+ */
+
+function isBoolean(value) {
+  return typeof value === 'boolean';
+}
+/**
+ * Check if a value is an Object
+ * @param   {*}  value - anything
+ * @returns {boolean} true only for the value is an object
+ */
+
+
+function isObject(value) {
+  return typeof value === 'object';
+}
+
+const REMOVE_ATTRIBUTE = 'removeAttribute';
+const SET_ATTIBUTE = 'setAttribute';
+/**
+ * Add all the attributes provided
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} attributes - object containing the attributes names and values
+ * @returns {undefined} sorry it's a void function :(
+ */
+
+function setAllAttributes(node, attributes) {
+  Object.entries(attributes).forEach((_ref5) => {
+    let [name, value] = _ref5;
+    return attributeExpression(node, {
+      name
+    }, value);
+  });
+}
+/**
+ * Remove all the attributes provided
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} attributes - object containing all the attribute names
+ * @returns {undefined} sorry it's a void function :(
+ */
+
+
+function removeAllAttributes(node, attributes) {
+  Object.keys(attributes).forEach(attribute => node.removeAttribute(attribute));
+}
+/**
+ * This methods handles the DOM attributes updates
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {string} expression.name - attribute name
+ * @param   {*} value - new expression value
+ * @param   {*} oldValue - the old expression cached value
+ * @returns {undefined}
+ */
+
+
+function attributeExpression(node, _ref6, value, oldValue) {
+  let {
+    name
+  } = _ref6;
+
+  // is it a spread operator? {...attributes}
+  if (!name) {
+    // is the value still truthy?
+    if (value) {
+      setAllAttributes(node, value);
+    } else if (oldValue) {
+      // otherwise remove all the old attributes
+      removeAllAttributes(node, oldValue);
+    }
+
+    return;
+  } // handle boolean attributes
+
+
+  if (isBoolean(value) || isObject(value)) {
+    node[name] = value;
+  }
+
+  node[getMethod(value)](name, normalizeValue(name, value));
+}
+/**
+ * Get the attribute modifier method
+ * @param   {*} value - if truthy we return `setAttribute` othewise `removeAttribute`
+ * @returns {string} the node attribute modifier method name
+ */
+
+
+function getMethod(value) {
+  return isNil(value) || value === false || value === '' || isObject(value) ? REMOVE_ATTRIBUTE : SET_ATTIBUTE;
+}
+/**
+ * Get the value as string
+ * @param   {string} name - attribute name
+ * @param   {*} value - user input value
+ * @returns {string} input value as string
+ */
+
+
+function normalizeValue(name, value) {
+  // be sure that expressions like selected={ true } will be always rendered as selected='selected'
+  if (value === true) return name;
+  return value;
+}
+
+const RE_EVENTS_PREFIX = /^on/;
+/**
+ * Set a new event listener
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {string} expression.name - event name
+ * @param   {*} value - new expression value
+ * @param   {*} oldValue - old expression value
+ * @returns {value} the callback just received
+ */
+
+function eventExpression(node, _ref7, value, oldValue) {
+  let {
+    name
+  } = _ref7;
+  const normalizedEventName = name.replace(RE_EVENTS_PREFIX, '');
+
+  if (oldValue) {
+    node.removeEventListener(normalizedEventName, oldValue);
+  }
+
+  if (value) {
+    node.addEventListener(normalizedEventName, value, false);
+  }
+
+  return value;
+}
+/**
+ * This methods handles a simple text expression update
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {number} expression.childNodeIndex - index to find the text node to update
+ * @param   {*} value - new expression value
+ * @returns {undefined}
+ */
+
+
+function textExpression(node, _ref8, value) {
+  let {
+    childNodeIndex
+  } = _ref8;
+  const target = node.childNodes[childNodeIndex];
+  const val = normalizeValue$1(value); // replace the target if it's a placeholder comment
+
+  if (target.nodeType === Node.COMMENT_NODE) {
+    const textNode = document.createTextNode(val);
+    node.replaceChild(textNode, target);
+  } else {
+    target.data = normalizeValue$1(val);
+  }
+}
+/**
+ * Normalize the user value in order to render a empty string in case of falsy values
+ * @param   {*} value - user input value
+ * @returns {string} hopefully a string
+ */
+
+
+function normalizeValue$1(value) {
+  return isNil(value) ? '' : value;
+}
+/**
+ * This methods handles the input fileds value updates
+ * @param   {HTMLElement} node - target node
+ * @param   {Object} expression - expression object
+ * @param   {*} value - new expression value
+ * @returns {undefined}
+ */
+
+
+function valueExpression(node, expression, value) {
+  node.value = value;
+}
+
+var expressions = {
+  [ATTRIBUTE]: attributeExpression,
+  [EVENT]: eventExpression,
+  [TEXT]: textExpression,
+  [VALUE]: valueExpression
+};
+const Expression = Object.seal({
+  // Static props
+  node: null,
+  value: null,
+
+  // API methods
+
+  /**
+   * Mount the expression evaluating its initial value
+   * @param   {*} scope - argument passed to the expression to evaluate its current values
+   * @returns {Expression} self
+   */
+  mount(scope) {
+    // hopefully a pure function
+    this.value = this.evaluate(scope); // IO() DOM updates
+
+    apply(this, this.value);
+    return this;
+  },
+
+  /**
+   * Update the expression if its value changed
+   * @param   {*} scope - argument passed to the expression to evaluate its current values
+   * @returns {Expression} self
+   */
+  update(scope) {
+    // pure function
+    const value = this.evaluate(scope);
+
+    if (this.value !== value) {
+      // IO() DOM updates
+      apply(this, value);
+      this.value = value;
+    }
+
+    return this;
+  },
+
+  /**
+   * Expression teardown method
+   * @returns {Expression} self
+   */
+  unmount() {
+    // unmount only the event handling expressions
+    if (this.type === EVENT) apply(this, null);
+    return this;
+  }
+
+});
+/**
+ * IO() function to handle the DOM updates
+ * @param {Expression} expression - expression object
+ * @param {*} value - current expression value
+ * @returns {undefined}
+ */
+
+function apply(expression, value) {
+  return expressions[expression.type](expression.node, expression, value, expression.value);
+}
+
+function create$2(node, data) {
+  return Object.assign({}, Expression, {}, data, {
+    node
+  });
+}
+/**
+ * Create a flat object having as keys a list of methods that if dispatched will propagate
+ * on the whole collection
+ * @param   {Array} collection - collection to iterate
+ * @param   {Array<string>} methods - methods to execute on each item of the collection
+ * @param   {*} context - context returned by the new methods created
+ * @returns {Object} a new object to simplify the the nested methods dispatching
+ */
+
+
+function flattenCollectionMethods(collection, methods, context) {
+  return methods.reduce((acc, method) => {
+    return Object.assign({}, acc, {
+      [method]: scope => {
+        return collection.map(item => item[method](scope)) && context;
+      }
+    });
+  }, {});
+}
+
+function create$3(node, _ref9) {
+  let {
+    expressions
+  } = _ref9;
+  return Object.assign({}, flattenCollectionMethods(expressions.map(expression => create$2(node, expression)), ['mount', 'update', 'unmount']));
+}
+
+const SlotBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  name: null,
+  template: null,
+
+  // API methods
+  mount(scope, parentScope) {
+    const templateData = scope.slots ? scope.slots.find((_ref10) => {
+      let {
+        id
+      } = _ref10;
+      return id === this.name;
+    }) : false;
+    const {
+      parentNode
+    } = this.node;
+    this.template = templateData && create$6(templateData.html, templateData.bindings).createDOM(parentNode);
+
+    if (this.template) {
+      this.template.mount(this.node, parentScope);
+      moveSlotInnerContent(this.node);
+    }
+
+    parentNode.removeChild(this.node);
+    return this;
+  },
+
+  update(scope, parentScope) {
+    if (this.template && parentScope) {
+      this.template.update(parentScope);
+    }
+
+    return this;
+  },
+
+  unmount(scope, parentScope, mustRemoveRoot) {
+    if (this.template) {
+      this.template.unmount(parentScope, null, mustRemoveRoot);
+    }
+
+    return this;
+  }
+
+});
+/**
+ * Move the inner content of the slots outside of them
+ * @param   {HTMLNode} slot - slot node
+ * @returns {undefined} it's a void function
+ */
+
+function moveSlotInnerContent(slot) {
+  if (slot.firstChild) {
+    slot.parentNode.insertBefore(slot.firstChild, slot);
+    moveSlotInnerContent(slot);
+  }
+}
+/**
+ * Create a single slot binding
+ * @param   {HTMLElement} node - slot node
+ * @param   {string} options.name - slot id
+ * @returns {Object} Slot binding object
+ */
+
+
+function createSlot(node, _ref11) {
+  let {
+    name
+  } = _ref11;
+  return Object.assign({}, SlotBinding, {
+    node,
+    name
+  });
+}
+/**
+ * Create a new tag object if it was registered before, otherwise fallback to the simple
+ * template chunk
+ * @param   {Function} component - component factory function
+ * @param   {Array<Object>} slots - array containing the slots markup
+ * @param   {Array} attributes - dynamic attributes that will be received by the tag element
+ * @returns {TagImplementation|TemplateChunk} a tag implementation or a template chunk as fallback
+ */
+
+
+function getTag(component, slots, attributes) {
+  if (slots === void 0) {
+    slots = [];
+  }
+
+  if (attributes === void 0) {
+    attributes = [];
+  }
+
+  // if this tag was registered before we will return its implementation
+  if (component) {
+    return component({
+      slots,
+      attributes
+    });
+  } // otherwise we return a template chunk
+
+
+  return create$6(slotsToMarkup(slots), [...slotBindings(slots), {
+    // the attributes should be registered as binding
+    // if we fallback to a normal template chunk
+    expressions: attributes.map(attr => {
+      return Object.assign({
+        type: ATTRIBUTE
+      }, attr);
+    })
+  }]);
+}
+/**
+ * Merge all the slots bindings into a single array
+ * @param   {Array<Object>} slots - slots collection
+ * @returns {Array<Bindings>} flatten bindings array
+ */
+
+
+function slotBindings(slots) {
+  return slots.reduce((acc, _ref12) => {
+    let {
+      bindings
+    } = _ref12;
+    return acc.concat(bindings);
+  }, []);
+}
+/**
+ * Merge all the slots together in a single markup string
+ * @param   {Array<Object>} slots - slots collection
+ * @returns {string} markup of all the slots in a single string
+ */
+
+
+function slotsToMarkup(slots) {
+  return slots.reduce((acc, slot) => {
+    return acc + slot.html;
+  }, '');
+}
+
+const TagBinding = Object.seal({
+  // dynamic binding properties
+  node: null,
+  evaluate: null,
+  name: null,
+  slots: null,
+  tag: null,
+  attributes: null,
+  getComponent: null,
+
+  mount(scope) {
+    return this.update(scope);
+  },
+
+  update(scope, parentScope) {
+    const name = this.evaluate(scope); // simple update
+
+    if (name === this.name) {
+      this.tag.update(scope);
+    } else {
+      // unmount the old tag if it exists
+      this.unmount(scope, parentScope, true); // mount the new tag
+
+      this.name = name;
+      this.tag = getTag(this.getComponent(name), this.slots, this.attributes);
+      this.tag.mount(this.node, scope);
+    }
+
+    return this;
+  },
+
+  unmount(scope, parentScope, keepRootTag) {
+    if (this.tag) {
+      // keep the root tag
+      this.tag.unmount(keepRootTag);
+    }
+
+    return this;
+  }
+
+});
+
+function create$4(node, _ref13) {
+  let {
+    evaluate,
+    getComponent,
+    slots,
+    attributes
+  } = _ref13;
+  return Object.assign({}, TagBinding, {
+    node,
+    evaluate,
+    slots,
+    attributes,
+    getComponent
+  });
+}
+
+var bindings = {
+  [IF]: create$1,
+  [SIMPLE]: create$3,
+  [EACH]: create,
+  [TAG]: create$4,
+  [SLOT]: createSlot
+};
+/**
+ * Bind a new expression object to a DOM node
+ * @param   {HTMLElement} root - DOM node where to bind the expression
+ * @param   {Object} binding - binding data
+ * @returns {Expression} Expression object
+ */
+
+function create$5(root, binding) {
+  const {
+    selector,
+    type,
+    redundantAttribute,
+    expressions
+  } = binding; // find the node to apply the bindings
+
+  const node = selector ? root.querySelector(selector) : root; // remove eventually additional attributes created only to select this node
+
+  if (redundantAttribute) node.removeAttribute(redundantAttribute); // init the binding
+
+  return (bindings[type] || bindings[SIMPLE])(node, Object.assign({}, binding, {
+    expressions: expressions || []
+  }));
+}
+/**
+ * Check if an element is part of an svg
+ * @param   {HTMLElement}  el - element to check
+ * @returns {boolean} true if we are in an svg context
+ */
+
+
+function isSvg(el) {
+  const owner = el.ownerSVGElement;
+  return !!owner || owner === null;
+} // in this case a simple innerHTML is enough
+
+
+function createHTMLTree(html, root) {
+  const template = isTemplate(root) ? root : document.createElement('template');
+  template.innerHTML = html;
+  return template.content;
+} // for svg nodes we need a bit more work
+
+
+function createSVGTree(html, container) {
+  // create the SVGNode
+  const svgNode = container.ownerDocument.importNode(new window.DOMParser().parseFromString(`<svg xmlns="http://www.w3.org/2000/svg">${html}</svg>`, 'application/xml').documentElement, true);
+  return svgNode;
+}
+/**
+ * Create the DOM that will be injected
+ * @param {Object} root - DOM node to find out the context where the fragment will be created
+ * @param   {string} html - DOM to create as string
+ * @returns {HTMLDocumentFragment|HTMLElement} a new html fragment
+ */
+
+
+function createDOMTree(root, html) {
+  if (isSvg(root)) return createSVGTree(html, root);
+  return createHTMLTree(html, root);
+}
+/**
+ * Move all the child nodes from a source tag to another
+ * @param   {HTMLElement} source - source node
+ * @param   {HTMLElement} target - target node
+ * @returns {undefined} it's a void method ¯\_(ツ)_/¯
+ */
+// Ignore this helper because it's needed only for svg tags
+
+/* istanbul ignore next */
+
+
+function moveChildren(source, target) {
+  if (source.firstChild) {
+    target.appendChild(source.firstChild);
+    moveChildren(source, target);
+  }
+}
+/**
+ * Inject the DOM tree into a target node
+ * @param   {HTMLElement} el - target element
+ * @param   {HTMLFragment|SVGElement} dom - dom tree to inject
+ * @returns {undefined}
+ */
+
+
+function injectDOM(el, dom) {
+  switch (true) {
+    case isSvg(el):
+      moveChildren(dom, el);
+      break;
+
+    case isTemplate(el):
+      el.parentNode.replaceChild(dom, el);
+      break;
+
+    default:
+      el.appendChild(dom);
+  }
+}
+/**
+ * Create the Template DOM skeleton
+ * @param   {HTMLElement} el - root node where the DOM will be injected
+ * @param   {string} html - markup that will be injected into the root node
+ * @returns {HTMLFragment} fragment that will be injected into the root node
+ */
+
+
+function createTemplateDOM(el, html) {
+  return html && (typeof html === 'string' ? createDOMTree(el, html) : html);
+}
+/**
+ * Template Chunk model
+ * @type {Object}
+ */
+
+
+const TemplateChunk = Object.freeze({
+  // Static props
+  bindings: null,
+  bindingsData: null,
+  html: null,
+  isTemplateTag: false,
+  fragment: null,
+  children: null,
+  dom: null,
+  el: null,
+
+  /**
+   * Create the template DOM structure that will be cloned on each mount
+   * @param   {HTMLElement} el - the root node
+   * @returns {TemplateChunk} self
+   */
+  createDOM(el) {
+    // make sure that the DOM gets created before cloning the template
+    this.dom = this.dom || createTemplateDOM(el, this.html);
+    return this;
+  },
+
+  // API methods
+
+  /**
+   * Attach the template to a DOM node
+   * @param   {HTMLElement} el - target DOM node
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @param   {Object} meta - meta properties needed to handle the <template> tags in loops
+   * @returns {TemplateChunk} self
+   */
+  mount(el, scope, parentScope, meta) {
+    if (meta === void 0) {
+      meta = {};
+    }
+
+    if (!el) throw new Error('Please provide DOM node to mount properly your template');
+    if (this.el) this.unmount(scope); // <template> tags require a bit more work
+    // the template fragment might be already created via meta outside of this call
+
+    const {
+      fragment,
+      children,
+      avoidDOMInjection
+    } = meta; // <template> bindings of course can not have a root element
+    // so we check the parent node to set the query selector bindings
+
+    const {
+      parentNode
+    } = children ? children[0] : el;
+    this.isTemplateTag = isTemplate(el); // create the DOM if it wasn't created before
+
+    this.createDOM(el);
+
+    if (this.dom) {
+      // create the new template dom fragment if it want already passed in via meta
+      this.fragment = fragment || this.dom.cloneNode(true);
+    } // store root node
+    // notice that for template tags the root note will be the parent tag
+
+
+    this.el = this.isTemplateTag ? parentNode : el; // create the children array only for the <template> fragments
+
+    this.children = this.isTemplateTag ? children || Array.from(this.fragment.childNodes) : null; // inject the DOM into the el only if a fragment is available
+
+    if (!avoidDOMInjection && this.fragment) injectDOM(el, this.fragment); // create the bindings
+
+    this.bindings = this.bindingsData.map(binding => create$5(this.el, binding));
+    this.bindings.forEach(b => b.mount(scope, parentScope));
+    return this;
+  },
+
+  /**
+   * Update the template with fresh data
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @returns {TemplateChunk} self
+   */
+  update(scope, parentScope) {
+    this.bindings.forEach(b => b.update(scope, parentScope));
+    return this;
+  },
+
+  /**
+   * Remove the template from the node where it was initially mounted
+   * @param   {*} scope - template data
+   * @param   {*} parentScope - scope of the parent template tag
+   * @param   {boolean|null} mustRemoveRoot - if true remove the root element,
+   * if false or undefined clean the root tag content, if null don't touch the DOM
+   * @returns {TemplateChunk} self
+   */
+  unmount(scope, parentScope, mustRemoveRoot) {
+    if (this.el) {
+      this.bindings.forEach(b => b.unmount(scope, parentScope, mustRemoveRoot));
+
+      switch (true) {
+        // <template> tags should be treated a bit differently
+        // we need to clear their children only if it's explicitly required by the caller
+        // via mustRemoveRoot !== null
+        case this.isTemplateTag === true && mustRemoveRoot !== null:
+          clearChildren(this.children);
+          break;
+        // remove the root node only if the mustRemoveRoot === true
+
+        case mustRemoveRoot === true && this.el.parentNode !== null:
+          this.el.parentNode.removeChild(this.el);
+          break;
+        // otherwise we clean the node children
+
+        case mustRemoveRoot !== null:
+          cleanNode(this.el);
+          break;
+      }
+
+      this.el = null;
+    }
+
+    return this;
+  },
+
+  /**
+   * Clone the template chunk
+   * @returns {TemplateChunk} a clone of this object resetting the this.el property
+   */
+  clone() {
+    return Object.assign({}, this, {
+      el: null
+    });
+  }
+
+});
+/**
+ * Create a template chunk wiring also the bindings
+ * @param   {string|HTMLElement} html - template string
+ * @param   {Array} bindings - bindings collection
+ * @returns {TemplateChunk} a new TemplateChunk copy
+ */
+
+function create$6(html, bindings) {
+  if (bindings === void 0) {
+    bindings = [];
+  }
+
+  return Object.assign({}, TemplateChunk, {
+    html,
+    bindingsData: bindings
+  });
+}
+
+/**
+ * Quick type checking
+ * @param   {*} element - anything
+ * @param   {string} type - type definition
+ * @returns {boolean} true if the type corresponds
+ */
+function checkType(element, type) {
+  return typeof element === type;
+}
+/**
+ * Check that will be passed if its argument is a function
+ * @param   {*} value - value to check
+ * @returns {boolean} - true if the value is a function
+ */
+
+function isFunction(value) {
+  return checkType(value, 'function');
+}
+
+/* eslint-disable fp/no-mutating-methods */
+/**
+ * Throw an error
+ * @param {string} error - error message
+ * @returns {undefined} it's a IO void function
+ */
+
+function panic(error) {
+  throw new Error(error);
+}
+/**
+ * Call the first argument received only if it's a function otherwise return it as it is
+ * @param   {*} source - anything
+ * @returns {*} anything
+ */
+
+function callOrAssign(source) {
+  return isFunction(source) ? source.prototype && source.prototype.constructor ? new source() : source() : source;
+}
+/**
+ * Convert a string from camel case to dash-case
+ * @param   {string} string - probably a component tag name
+ * @returns {string} component name normalized
+ */
+
+function camelToDashCase(string) {
+  return string.replace(/([a-z])([A-Z])/g, '$1-$2').toLowerCase();
+}
+/**
+ * Convert a string containing dashes to camel case
+ * @param   {string} string - input string
+ * @returns {string} my-string -> myString
+ */
+
+function dashToCamelCase(string) {
+  return string.replace(/-(\w)/g, (_, c) => c.toUpperCase());
+}
+/**
+ * Define default properties if they don't exist on the source object
+ * @param   {Object} source - object that will receive the default properties
+ * @param   {Object} defaults - object containing additional optional keys
+ * @returns {Object} the original object received enhanced
+ */
+
+function defineDefaults(source, defaults) {
+  Object.entries(defaults).forEach((_ref) => {
+    let [key, value] = _ref;
+    if (!source[key]) source[key] = value;
+  });
+  return source;
+} // doese simply nothing
+
+function noop() {
+  return this;
+}
+/**
+ * Autobind the methods of a source object to itself
+ * @param   {Object} source - probably a riot tag instance
+ * @param   {Array<string>} methods - list of the methods to autobind
+ * @returns {Object} the original object received
+ */
+
+function autobindMethods(source, methods) {
+  methods.forEach(method => {
+    source[method] = source[method].bind(source);
+  });
+  return source;
+}
+/**
+ * Helper function to set an immutable property
+ * @param   {Object} source - object where the new property will be set
+ * @param   {string} key - object key where the new property will be stored
+ * @param   {*} value - value of the new property
+ * @param   {Object} options - set the propery overriding the default options
+ * @returns {Object} - the original object modified
+ */
+
+function defineProperty(source, key, value, options) {
+  if (options === void 0) {
+    options = {};
+  }
+
+  Object.defineProperty(source, key, Object.assign({
+    value,
+    enumerable: false,
+    writable: false,
+    configurable: true
+  }, options));
+  return source;
+}
+/**
+ * Define multiple properties on a target object
+ * @param   {Object} source - object where the new properties will be set
+ * @param   {Object} properties - object containing as key pair the key + value properties
+ * @param   {Object} options - set the propery overriding the default options
+ * @returns {Object} the original object modified
+ */
+
+function defineProperties(source, properties, options) {
+  Object.entries(properties).forEach((_ref2) => {
+    let [key, value] = _ref2;
+    defineProperty(source, key, value, options);
+  });
+  return source;
+}
+/**
+ * Evaluate a list of attribute expressions
+ * @param   {Array} attributes - attribute expressions generated by the riot compiler
+ * @returns {Object} key value pairs with the result of the computation
+ */
+
+function evaluateAttributeExpressions(attributes) {
+  return attributes.reduce((acc, attribute) => {
+    const {
+      value,
+      type
+    } = attribute;
+
+    switch (true) {
+      // spread attribute
+      case !attribute.name && type === expressionTypes.ATTRIBUTE:
+        return Object.assign({}, acc, {}, value);
+      // value attribute
+
+      case type === expressionTypes.VALUE:
+        acc[VALUE_ATTRIBUTE] = attribute.value;
+        break;
+      // normal attributes
+
+      default:
+        acc[dashToCamelCase(attribute.name)] = attribute.value;
+    }
+
+    return acc;
+  }, {});
+}
+
+/**
+ * Converts any DOM node/s to a loopable array
+ * @param   { HTMLElement|NodeList } els - single html element or a node list
+ * @returns { Array } always a loopable object
+ */
+function domToArray(els) {
+  // can this object be already looped?
+  if (!Array.isArray(els)) {
+    // is it a node list?
+    if (/^\[object (HTMLCollection|NodeList|Object)\]$/.test(Object.prototype.toString.call(els)) && typeof els.length === 'number') return Array.from(els);else // if it's a single node
+      // it will be returned as "array" with one single entry
+      return [els];
+  } // this object could be looped out of the box
+
+
+  return els;
+}
+
+/**
+ * Normalize the return values, in case of a single value we avoid to return an array
+ * @param   { Array } values - list of values we want to return
+ * @returns { Array|string|boolean } either the whole list of values or the single one found
+ * @private
+ */
+
+const normalize = values => values.length === 1 ? values[0] : values;
+/**
+ * Parse all the nodes received to get/remove/check their attributes
+ * @param   { HTMLElement|NodeList|Array } els    - DOM node/s to parse
+ * @param   { string|Array }               name   - name or list of attributes
+ * @param   { string }                     method - method that will be used to parse the attributes
+ * @returns { Array|string } result of the parsing in a list or a single value
+ * @private
+ */
+
+
+function parseNodes(els, name, method) {
+  const names = typeof name === 'string' ? [name] : name;
+  return normalize(domToArray(els).map(el => {
+    return normalize(names.map(n => el[method](n)));
+  }));
+}
+/**
+ * Set any attribute on a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Object }              name  - either the name of the attribute to set
+ *                                                 or a list of properties as object key - value
+ * @param   { string }                     value - the new value of the attribute (optional)
+ * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+ *
+ * @example
+ *
+ * import { set } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * set(img, 'width', 100)
+ *
+ * // or also
+ * set(img, {
+ *   width: 300,
+ *   height: 300
+ * })
+ *
+ */
+
+
+function set(els, name, value) {
+  const attrs = typeof name === 'object' ? name : {
+    [name]: value
+  };
+  const props = Object.keys(attrs);
+  domToArray(els).forEach(el => {
+    props.forEach(prop => el.setAttribute(prop, attrs[prop]));
+  });
+  return els;
+}
+/**
+ * Get any attribute from a single or a list of DOM nodes
+ * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+ * @param   { string|Array }               name  - name or list of attributes to get
+ * @returns { Array|string } list of the attributes found
+ *
+ * @example
+ *
+ * import { get } from 'bianco.attr'
+ *
+ * const img = document.createElement('img')
+ *
+ * get(img, 'width') // => '200'
+ *
+ * // or also
+ * get(img, ['width', 'height']) // => ['200', '300']
+ *
+ * // or also
+ * get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+ */
+
+function get(els, name) {
+  return parseNodes(els, name, 'getAttribute');
+}
+
+/**
+ * Get all the element attributes as object
+ * @param   {HTMLElement} element - DOM node we want to parse
+ * @returns {Object} all the attributes found as a key value pairs
+ */
+
+function DOMattributesToObject(element) {
+  return Array.from(element.attributes).reduce((acc, attribute) => {
+    acc[dashToCamelCase(attribute.name)] = attribute.value;
+    return acc;
+  }, {});
+}
+/**
+ * Get the tag name of any DOM node
+ * @param   {HTMLElement} element - DOM node we want to inspect
+ * @returns {string} name to identify this dom node in riot
+ */
+
+function getName(element) {
+  return get(element, IS_DIRECTIVE) || element.tagName.toLowerCase();
+}
+
+/**
+ * Simple helper to find DOM nodes returning them as array like loopable object
+ * @param   { string|DOMNodeList } selector - either the query or the DOM nodes to arraify
+ * @param   { HTMLElement }        ctx      - context defining where the query will search for the DOM nodes
+ * @returns { Array } DOM nodes found as array
+ */
+
+function $(selector, ctx) {
+  return domToArray(typeof selector === 'string' ? (ctx || document).querySelectorAll(selector) : selector);
+}
+
+const CSS_BY_NAME = new Map();
+const STYLE_NODE_SELECTOR = 'style[riot]'; // memoized curried function
+
+const getStyleNode = (style => {
+  return () => {
+    // lazy evaluation:
+    // if this function was already called before
+    // we return its cached result
+    if (style) return style; // create a new style element or use an existing one
+    // and cache it internally
+
+    style = $(STYLE_NODE_SELECTOR)[0] || document.createElement('style');
+    set(style, 'type', 'text/css');
+    /* istanbul ignore next */
+
+    if (!style.parentNode) document.head.appendChild(style);
+    return style;
+  };
+})();
+/**
+ * Object that will be used to inject and manage the css of every tag instance
+ */
+
+
+var cssManager = {
+  CSS_BY_NAME,
+
+  /**
+   * Save a tag style to be later injected into DOM
+   * @param { string } name - if it's passed we will map the css to a tagname
+   * @param { string } css - css string
+   * @returns {Object} self
+   */
+  add(name, css) {
+    if (!CSS_BY_NAME.has(name)) {
+      CSS_BY_NAME.set(name, css);
+      this.inject();
+    }
+
+    return this;
+  },
+
+  /**
+   * Inject all previously saved tag styles into DOM
+   * innerHTML seems slow: http://jsperf.com/riot-insert-style
+   * @returns {Object} self
+   */
+  inject() {
+    getStyleNode().innerHTML = [...CSS_BY_NAME.values()].join('\n');
+    return this;
+  },
+
+  /**
+   * Remove a tag style from the DOM
+   * @param {string} name a registered tagname
+   * @returns {Object} self
+   */
+  remove(name) {
+    if (CSS_BY_NAME.has(name)) {
+      CSS_BY_NAME.delete(name);
+      this.inject();
+    }
+
+    return this;
+  }
+
+};
+
+/**
+ * Function to curry any javascript method
+ * @param   {Function}  fn - the target function we want to curry
+ * @param   {...[args]} acc - initial arguments
+ * @returns {Function|*} it will return a function until the target function
+ *                       will receive all of its arguments
+ */
+function curry(fn) {
+  for (var _len = arguments.length, acc = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    acc[_key - 1] = arguments[_key];
+  }
+
+  return function () {
+    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      args[_key2] = arguments[_key2];
+    }
+
+    args = [...acc, ...args];
+    return args.length < fn.length ? curry(fn, ...args) : fn(...args);
+  };
+}
+
+const COMPONENT_CORE_HELPERS = Object.freeze({
+  // component helpers
+  $(selector) {
+    return $(selector, this.root)[0];
+  },
+
+  $$(selector) {
+    return $(selector, this.root);
+  }
+
+});
+const COMPONENT_LIFECYCLE_METHODS = Object.freeze({
+  shouldUpdate: noop,
+  onBeforeMount: noop,
+  onMounted: noop,
+  onBeforeUpdate: noop,
+  onUpdated: noop,
+  onBeforeUnmount: noop,
+  onUnmounted: noop
+});
+const MOCKED_TEMPLATE_INTERFACE = {
+  update: noop,
+  mount: noop,
+  unmount: noop,
+  clone: noop,
+  createDOM: noop
+  /**
+   * Factory function to create the component templates only once
+   * @param   {Function} template - component template creation function
+   * @param   {Object} components - object containing the nested components
+   * @returns {TemplateChunk} template chunk object
+   */
+
+};
+
+function componentTemplateFactory(template, components) {
+  return template(create$6, expressionTypes, bindingTypes, name => {
+    return components[name] || COMPONENTS_IMPLEMENTATION_MAP.get(name);
+  });
+}
+/**
+ * Create the component interface needed for the @riotjs/dom-bindings tag bindings
+ * @param   {string} options.css - component css
+ * @param   {Function} options.template - functon that will return the dom-bindings template function
+ * @param   {Object} options.exports - component interface
+ * @param   {string} options.name - component name
+ * @returns {Object} component like interface
+ */
+
+
+function createComponent(_ref) {
+  let {
+    css,
+    template,
+    exports,
+    name
+  } = _ref;
+  const templateFn = template ? componentTemplateFactory(template, exports ? createSubcomponents(exports.components) : {}) : MOCKED_TEMPLATE_INTERFACE;
+  return (_ref2) => {
+    let {
+      slots,
+      attributes,
+      props
+    } = _ref2;
+    const componentAPI = callOrAssign(exports) || {};
+    const component = defineComponent({
+      css,
+      template: templateFn,
+      componentAPI,
+      name
+    })({
+      slots,
+      attributes,
+      props
+    }); // notice that for the components create via tag binding
+    // we need to invert the mount (state/parentScope) arguments
+    // the template bindings will only forward the parentScope updates
+    // and never deal with the component state
+
+    return {
+      mount(element, parentScope, state) {
+        return component.mount(element, state, parentScope);
+      },
+
+      update(parentScope, state) {
+        return component.update(state, parentScope);
+      },
+
+      unmount(preserveRoot) {
+        return component.unmount(preserveRoot);
+      }
+
+    };
+  };
+}
+/**
+ * Component definition function
+ * @param   {Object} implementation - the componen implementation will be generated via compiler
+ * @param   {Object} component - the component initial properties
+ * @returns {Object} a new component implementation object
+ */
+
+function defineComponent(_ref3) {
+  let {
+    css,
+    template,
+    componentAPI,
+    name
+  } = _ref3;
+  // add the component css into the DOM
+  if (css && name) cssManager.add(name, css);
+  return curry(enhanceComponentAPI)(defineProperties( // set the component defaults without overriding the original component API
+  defineDefaults(componentAPI, Object.assign({}, COMPONENT_LIFECYCLE_METHODS, {
+    state: {}
+  })), Object.assign({
+    // defined during the component creation
+    slots: null,
+    root: null
+  }, COMPONENT_CORE_HELPERS, {
+    name,
+    css,
+    template
+  })));
+}
+/**
+ * Evaluate the component properties either from its real attributes or from its attribute expressions
+ * @param   {HTMLElement} element - component root
+ * @param   {Array}  attributeExpressions - attribute values generated via createAttributeBindings
+ * @returns {Object} attributes key value pairs
+ */
+
+function evaluateProps(element, attributeExpressions) {
+  if (attributeExpressions === void 0) {
+    attributeExpressions = [];
+  }
+
+  return Object.assign({}, DOMattributesToObject(element), {}, evaluateAttributeExpressions(attributeExpressions));
+}
+/**
+ * Create the bindings to update the component attributes
+ * @param   {HTMLElement} node - node where we will bind the expressions
+ * @param   {Array} attributes - list of attribute bindings
+ * @returns {TemplateChunk} - template bindings object
+ */
+
+
+function createAttributeBindings(node, attributes) {
+  if (attributes === void 0) {
+    attributes = [];
+  }
+
+  const expressions = attributes.map(a => create$2(node, a));
+  const binding = {};
+
+  const updateValues = method => scope => {
+    expressions.forEach(e => e[method](scope));
+    return binding;
+  };
+
+  return Object.assign(binding, {
+    expressions,
+    mount: updateValues('mount'),
+    update: updateValues('update'),
+    unmount: updateValues('unmount')
+  });
+}
+/**
+ * Create the subcomponents that can be included inside a tag in runtime
+ * @param   {Object} components - components imported in runtime
+ * @returns {Object} all the components transformed into Riot.Component factory functions
+ */
+
+
+function createSubcomponents(components) {
+  if (components === void 0) {
+    components = {};
+  }
+
+  return Object.entries(callOrAssign(components)).reduce((acc, _ref4) => {
+    let [key, value] = _ref4;
+    acc[camelToDashCase(key)] = createComponent(value);
+    return acc;
+  }, {});
+}
+/**
+ * Run the component instance through all the plugins set by the user
+ * @param   {Object} component - component instance
+ * @returns {Object} the component enhanced by the plugins
+ */
+
+
+function runPlugins(component) {
+  return [...PLUGINS_SET].reduce((c, fn) => fn(c) || c, component);
+}
+/**
+ * Compute the component current state merging it with its previous state
+ * @param   {Object} oldState - previous state object
+ * @param   {Object} newState - new state givent to the `update` call
+ * @returns {Object} new object state
+ */
+
+
+function computeState(oldState, newState) {
+  return Object.assign({}, oldState, {}, callOrAssign(newState));
+}
+/**
+ * Add eventually the "is" attribute to link this DOM node to its css
+ * @param {HTMLElement} element - target root node
+ * @param {string} name - name of the component mounted
+ * @returns {undefined} it's a void function
+ */
+
+
+function addCssHook(element, name) {
+  if (getName(element) !== name) {
+    set(element, 'is', name);
+  }
+}
+/**
+ * Component creation factory function that will enhance the user provided API
+ * @param   {Object} component - a component implementation previously defined
+ * @param   {Array} options.slots - component slots generated via riot compiler
+ * @param   {Array} options.attributes - attribute expressions generated via riot compiler
+ * @returns {Riot.Component} a riot component instance
+ */
+
+
+function enhanceComponentAPI(component, _ref5) {
+  let {
+    slots,
+    attributes,
+    props
+  } = _ref5;
+  const initialProps = callOrAssign(props);
+  return autobindMethods(runPlugins(defineProperties(Object.create(component), {
+    mount(element, state, parentScope) {
+      if (state === void 0) {
+        state = {};
+      }
+
+      this[ATTRIBUTES_KEY_SYMBOL] = createAttributeBindings(element, attributes).mount(parentScope);
+      this.props = Object.freeze(Object.assign({}, initialProps, {}, evaluateProps(element, this[ATTRIBUTES_KEY_SYMBOL].expressions)));
+      this.state = computeState(this.state, state);
+      this[TEMPLATE_KEY_SYMBOL] = this.template.createDOM(element).clone(); // link this object to the DOM node
+
+      element[DOM_COMPONENT_INSTANCE_PROPERTY] = this; // add eventually the 'is' attribute
+
+      component.name && addCssHook(element, component.name); // define the root element
+
+      defineProperty(this, 'root', element); // define the slots array
+
+      defineProperty(this, 'slots', slots); // before mount lifecycle event
+
+      this.onBeforeMount(this.props, this.state); // mount the template
+
+      this[TEMPLATE_KEY_SYMBOL].mount(element, this, parentScope);
+      this.onMounted(this.props, this.state);
+      return this;
+    },
+
+    update(state, parentScope) {
+      if (state === void 0) {
+        state = {};
+      }
+
+      if (parentScope) {
+        this[ATTRIBUTES_KEY_SYMBOL].update(parentScope);
+      }
+
+      const newProps = evaluateProps(this.root, this[ATTRIBUTES_KEY_SYMBOL].expressions);
+      if (this.shouldUpdate(newProps, this.props) === false) return;
+      this.props = Object.freeze(Object.assign({}, initialProps, {}, newProps));
+      this.state = computeState(this.state, state);
+      this.onBeforeUpdate(this.props, this.state);
+      this[TEMPLATE_KEY_SYMBOL].update(this, parentScope);
+      this.onUpdated(this.props, this.state);
+      return this;
+    },
+
+    unmount(preserveRoot) {
+      this.onBeforeUnmount(this.props, this.state);
+      this[ATTRIBUTES_KEY_SYMBOL].unmount(); // if the preserveRoot is null the template html will be left untouched
+      // in that case the DOM cleanup will happen differently from a parent node
+
+      this[TEMPLATE_KEY_SYMBOL].unmount(this, {}, preserveRoot === null ? null : !preserveRoot);
+      this.onUnmounted(this.props, this.state);
+      return this;
+    }
+
+  })), Object.keys(component).filter(prop => isFunction(component[prop])));
+}
+/**
+ * Component initialization function starting from a DOM node
+ * @param   {HTMLElement} element - element to upgrade
+ * @param   {Object} initialProps - initial component properties
+ * @param   {string} componentName - component id
+ * @returns {Object} a new component instance bound to a DOM node
+ */
+
+function mountComponent(element, initialProps, componentName) {
+  const name = componentName || getName(element);
+  if (!COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component named "${name}" was never registered`);
+  const component = COMPONENTS_IMPLEMENTATION_MAP.get(name)({
+    props: initialProps
+  });
+  return component.mount(element);
+}
+
+/**
+ * Similar to compose but performs from left-to-right function composition.<br/>
+ * {@link https://30secondsofcode.org/function#composeright see also}
+ * @param   {...[function]} fns) - list of unary function
+ * @returns {*} result of the computation
+ */
+/**
+ * Performs right-to-left function composition.<br/>
+ * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+ * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+ * {@link https://30secondsofcode.org/function#compose original source code}
+ * @param   {...[function]} fns) - list of unary function
+ * @returns {*} result of the computation
+ */
+
+function compose() {
+  for (var _len2 = arguments.length, fns = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    fns[_key2] = arguments[_key2];
+  }
+
+  return fns.reduce((f, g) => function () {
+    return f(g(...arguments));
+  });
+}
+
+const {
+  DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY$1,
+  COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP$1,
+  PLUGINS_SET: PLUGINS_SET$1
+} = globals;
+/**
+ * Riot public api
+ */
+
+/**
+ * Register a custom tag by name
+ * @param   {string} name - component name
+ * @param   {Object} implementation - tag implementation
+ * @returns {Map} map containing all the components implementations
+ */
+
+function register(name, _ref) {
+  let {
+    css,
+    template,
+    exports
+  } = _ref;
+  if (COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was already registered`);
+  COMPONENTS_IMPLEMENTATION_MAP$1.set(name, createComponent({
+    name,
+    css,
+    template,
+    exports
+  }));
+  return COMPONENTS_IMPLEMENTATION_MAP$1;
+}
+/**
+ * Unregister a riot web component
+ * @param   {string} name - component name
+ * @returns {Map} map containing all the components implementations
+ */
+
+function unregister(name) {
+  if (!COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was never registered`);
+  COMPONENTS_IMPLEMENTATION_MAP$1.delete(name);
+  cssManager.remove(name);
+  return COMPONENTS_IMPLEMENTATION_MAP$1;
+}
+/**
+ * Mounting function that will work only for the components that were globally registered
+ * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+ * @param   {Object} initialProps - the initial component properties
+ * @param   {string} name - optional component name
+ * @returns {Array} list of nodes upgraded
+ */
+
+function mount(selector, initialProps, name) {
+  return $(selector).map(element => mountComponent(element, initialProps, name));
+}
+/**
+ * Sweet unmounting helper function for the DOM node mounted manually by the user
+ * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+ * @param   {boolean|null} keepRootElement - if true keep the root element
+ * @returns {Array} list of nodes unmounted
+ */
+
+function unmount(selector, keepRootElement) {
+  return $(selector).map(element => {
+    if (element[DOM_COMPONENT_INSTANCE_PROPERTY$1]) {
+      element[DOM_COMPONENT_INSTANCE_PROPERTY$1].unmount(keepRootElement);
+    }
+
+    return element;
+  });
+}
+/**
+ * Define a riot plugin
+ * @param   {Function} plugin - function that will receive all the components created
+ * @returns {Set} the set containing all the plugins installed
+ */
+
+function install(plugin) {
+  if (!isFunction(plugin)) panic('Plugins must be of type function');
+  if (PLUGINS_SET$1.has(plugin)) panic('This plugin was already install');
+  PLUGINS_SET$1.add(plugin);
+  return PLUGINS_SET$1;
+}
+/**
+ * Uninstall a riot plugin
+ * @param   {Function} plugin - plugin previously installed
+ * @returns {Set} the set containing all the plugins installed
+ */
+
+function uninstall(plugin) {
+  if (!PLUGINS_SET$1.has(plugin)) panic('This plugin was never installed');
+  PLUGINS_SET$1.delete(plugin);
+  return PLUGINS_SET$1;
+}
+/**
+ * Helpter method to create component without relying on the registered ones
+ * @param   {Object} implementation - component implementation
+ * @returns {Function} function that will allow you to mount a riot component on a DOM node
+ */
+
+function component(implementation) {
+  return (el, props) => compose(c => c.mount(el), c => c({
+    props
+  }), createComponent)(implementation);
+}
+/** @type {string} current riot version */
+
+const version = 'v4.5.0'; // expose some internal stuff that might be used from external tools
+
+const __ = {
+  cssManager,
+  defineComponent,
+  globals
+};
+
+export { __, component, install, mount, register, uninstall, unmount, unregister, version };
diff --git a/node_modules/riot/riot.js b/node_modules/riot/riot.js
new file mode 100644
index 0000000..1aaf06e
--- /dev/null
+++ b/node_modules/riot/riot.js
@@ -0,0 +1,2384 @@
+/* Riot v4.5.0, @license MIT */
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+  typeof define === 'function' && define.amd ? define(['exports'], factory) :
+  (global = global || self, factory(global.riot = {}));
+}(this, function (exports) { 'use strict';
+
+  const COMPONENTS_IMPLEMENTATION_MAP = new Map(),
+        DOM_COMPONENT_INSTANCE_PROPERTY = Symbol('riot-component'),
+        PLUGINS_SET = new Set(),
+        IS_DIRECTIVE = 'is',
+        VALUE_ATTRIBUTE = 'value',
+        ATTRIBUTES_KEY_SYMBOL = Symbol('attributes'),
+        TEMPLATE_KEY_SYMBOL = Symbol('template');
+
+  var globals = /*#__PURE__*/Object.freeze({
+    COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP,
+    DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY,
+    PLUGINS_SET: PLUGINS_SET,
+    IS_DIRECTIVE: IS_DIRECTIVE,
+    VALUE_ATTRIBUTE: VALUE_ATTRIBUTE,
+    ATTRIBUTES_KEY_SYMBOL: ATTRIBUTES_KEY_SYMBOL,
+    TEMPLATE_KEY_SYMBOL: TEMPLATE_KEY_SYMBOL
+  });
+
+  /**
+   * Remove the child nodes from any DOM node
+   * @param   {HTMLElement} node - target node
+   * @returns {undefined}
+   */
+  function cleanNode(node) {
+    clearChildren(node.childNodes);
+  }
+  /**
+   * Clear multiple children in a node
+   * @param   {HTMLElement[]} children - direct children nodes
+   * @returns {undefined}
+   */
+
+
+  function clearChildren(children) {
+    Array.from(children).forEach(n => n.parentNode && n.parentNode.removeChild(n));
+  }
+
+  const EACH = 0;
+  const IF = 1;
+  const SIMPLE = 2;
+  const TAG = 3;
+  const SLOT = 4;
+  var bindingTypes = {
+    EACH,
+    IF,
+    SIMPLE,
+    TAG,
+    SLOT
+  };
+  /**
+   * Create the template meta object in case of <template> fragments
+   * @param   {TemplateChunk} componentTemplate - template chunk object
+   * @returns {Object} the meta property that will be passed to the mount function of the TemplateChunk
+   */
+
+  function createTemplateMeta(componentTemplate) {
+    const fragment = componentTemplate.dom.cloneNode(true);
+    return {
+      avoidDOMInjection: true,
+      fragment,
+      children: Array.from(fragment.childNodes)
+    };
+  }
+  /* get rid of the @ungap/essential-map polyfill */
+
+
+  const {
+    indexOf: iOF
+  } = [];
+
+  const append = (get, parent, children, start, end, before) => {
+    const isSelect = 'selectedIndex' in parent;
+    let noSelection = isSelect;
+
+    while (start < end) {
+      const child = get(children[start], 1);
+      parent.insertBefore(child, before);
+
+      if (isSelect && noSelection && child.selected) {
+        noSelection = !noSelection;
+        let {
+          selectedIndex
+        } = parent;
+        parent.selectedIndex = selectedIndex < 0 ? start : iOF.call(parent.querySelectorAll('option'), child);
+      }
+
+      start++;
+    }
+  };
+
+  const eqeq = (a, b) => a == b;
+
+  const identity = O => O;
+
+  const indexOf = (moreNodes, moreStart, moreEnd, lessNodes, lessStart, lessEnd, compare) => {
+    const length = lessEnd - lessStart;
+    /* istanbul ignore if */
+
+    if (length < 1) return -1;
+
+    while (moreEnd - moreStart >= length) {
+      let m = moreStart;
+      let l = lessStart;
+
+      while (m < moreEnd && l < lessEnd && compare(moreNodes[m], lessNodes[l])) {
+        m++;
+        l++;
+      }
+
+      if (l === lessEnd) return moreStart;
+      moreStart = m + 1;
+    }
+
+    return -1;
+  };
+
+  const isReversed = (futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare) => {
+    while (currentStart < currentEnd && compare(currentNodes[currentStart], futureNodes[futureEnd - 1])) {
+      currentStart++;
+      futureEnd--;
+    }
+
+    return futureEnd === 0;
+  };
+
+  const next = (get, list, i, length, before) => i < length ? get(list[i], 0) : 0 < i ? get(list[i - 1], -0).nextSibling : before;
+
+  const remove = (get, parent, children, start, end) => {
+    if (end - start < 2) parent.removeChild(get(children[start], -1));else {
+      const range = parent.ownerDocument.createRange();
+      range.setStartBefore(get(children[start], -1));
+      range.setEndAfter(get(children[end - 1], -1));
+      range.deleteContents();
+    }
+  }; // - - - - - - - - - - - - - - - - - - -
+  // diff related constants and utilities
+  // - - - - - - - - - - - - - - - - - - -
+
+
+  const DELETION = -1;
+  const INSERTION = 1;
+  const SKIP = 0;
+  const SKIP_OND = 50;
+
+  const HS = (futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges) => {
+    let k = 0;
+    /* istanbul ignore next */
+
+    let minLen = futureChanges < currentChanges ? futureChanges : currentChanges;
+    const link = Array(minLen++);
+    const tresh = Array(minLen);
+    tresh[0] = -1;
+
+    for (let i = 1; i < minLen; i++) tresh[i] = currentEnd;
+
+    const keymap = new Map();
+
+    for (let i = currentStart; i < currentEnd; i++) keymap.set(currentNodes[i], i);
+
+    for (let i = futureStart; i < futureEnd; i++) {
+      const idxInOld = keymap.get(futureNodes[i]);
+
+      if (idxInOld != null) {
+        k = findK(tresh, minLen, idxInOld);
+        /* istanbul ignore else */
+
+        if (-1 < k) {
+          tresh[k] = idxInOld;
+          link[k] = {
+            newi: i,
+            oldi: idxInOld,
+            prev: link[k - 1]
+          };
+        }
+      }
+    }
+
+    k = --minLen;
+    --currentEnd;
+
+    while (tresh[k] > currentEnd) --k;
+
+    minLen = currentChanges + futureChanges - k;
+    const diff = Array(minLen);
+    let ptr = link[k];
+    --futureEnd;
+
+    while (ptr) {
+      const {
+        newi,
+        oldi
+      } = ptr;
+
+      while (futureEnd > newi) {
+        diff[--minLen] = INSERTION;
+        --futureEnd;
+      }
+
+      while (currentEnd > oldi) {
+        diff[--minLen] = DELETION;
+        --currentEnd;
+      }
+
+      diff[--minLen] = SKIP;
+      --futureEnd;
+      --currentEnd;
+      ptr = ptr.prev;
+    }
+
+    while (futureEnd >= futureStart) {
+      diff[--minLen] = INSERTION;
+      --futureEnd;
+    }
+
+    while (currentEnd >= currentStart) {
+      diff[--minLen] = DELETION;
+      --currentEnd;
+    }
+
+    return diff;
+  }; // this is pretty much the same petit-dom code without the delete map part
+  // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L556-L561
+
+
+  const OND = (futureNodes, futureStart, rows, currentNodes, currentStart, cols, compare) => {
+    const length = rows + cols;
+    const v = [];
+    let d, k, r, c, pv, cv, pd;
+
+    outer: for (d = 0; d <= length; d++) {
+      /* istanbul ignore if */
+      if (d > SKIP_OND) return null;
+      pd = d - 1;
+      /* istanbul ignore next */
+
+      pv = d ? v[d - 1] : [0, 0];
+      cv = v[d] = [];
+
+      for (k = -d; k <= d; k += 2) {
+        if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+          c = pv[pd + k + 1];
+        } else {
+          c = pv[pd + k - 1] + 1;
+        }
+
+        r = c - k;
+
+        while (c < cols && r < rows && compare(currentNodes[currentStart + c], futureNodes[futureStart + r])) {
+          c++;
+          r++;
+        }
+
+        if (c === cols && r === rows) {
+          break outer;
+        }
+
+        cv[d + k] = c;
+      }
+    }
+
+    const diff = Array(d / 2 + length / 2);
+    let diffIdx = diff.length - 1;
+
+    for (d = v.length - 1; d >= 0; d--) {
+      while (c > 0 && r > 0 && compare(currentNodes[currentStart + c - 1], futureNodes[futureStart + r - 1])) {
+        // diagonal edge = equality
+        diff[diffIdx--] = SKIP;
+        c--;
+        r--;
+      }
+
+      if (!d) break;
+      pd = d - 1;
+      /* istanbul ignore next */
+
+      pv = d ? v[d - 1] : [0, 0];
+      k = c - r;
+
+      if (k === -d || k !== d && pv[pd + k - 1] < pv[pd + k + 1]) {
+        // vertical edge = insertion
+        r--;
+        diff[diffIdx--] = INSERTION;
+      } else {
+        // horizontal edge = deletion
+        c--;
+        diff[diffIdx--] = DELETION;
+      }
+    }
+
+    return diff;
+  };
+
+  const applyDiff = (diff, get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before) => {
+    const live = new Map();
+    const length = diff.length;
+    let currentIndex = currentStart;
+    let i = 0;
+
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          futureStart++;
+          currentIndex++;
+          break;
+
+        case INSERTION:
+          // TODO: bulk appends for sequential nodes
+          live.set(futureNodes[futureStart], 1);
+          append(get, parentNode, futureNodes, futureStart++, futureStart, currentIndex < currentLength ? get(currentNodes[currentIndex], 0) : before);
+          break;
+
+        case DELETION:
+          currentIndex++;
+          break;
+      }
+    }
+
+    i = 0;
+
+    while (i < length) {
+      switch (diff[i++]) {
+        case SKIP:
+          currentStart++;
+          break;
+
+        case DELETION:
+          // TODO: bulk removes for sequential nodes
+          if (live.has(currentNodes[currentStart])) currentStart++;else remove(get, parentNode, currentNodes, currentStart++, currentStart);
+          break;
+      }
+    }
+  };
+
+  const findK = (ktr, length, j) => {
+    let lo = 1;
+    let hi = length;
+
+    while (lo < hi) {
+      const mid = (lo + hi) / 2 >>> 0;
+      if (j < ktr[mid]) hi = mid;else lo = mid + 1;
+    }
+
+    return lo;
+  };
+
+  const smartDiff = (get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before) => {
+    applyDiff(OND(futureNodes, futureStart, futureChanges, currentNodes, currentStart, currentChanges, compare) || HS(futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges), get, parentNode, futureNodes, futureStart, currentNodes, currentStart, currentLength, before);
+  };
+  /*! (c) 2018 Andrea Giammarchi (ISC) */
+
+
+  const domdiff = (parentNode, // where changes happen
+  currentNodes, // Array of current items/nodes
+  futureNodes, // Array of future items/nodes
+  options // optional object with one of the following properties
+  //  before: domNode
+  //  compare(generic, generic) => true if same generic
+  //  node(generic) => Node
+  ) => {
+    if (!options) options = {};
+    const compare = options.compare || eqeq;
+    const get = options.node || identity;
+    const before = options.before == null ? null : get(options.before, 0);
+    const currentLength = currentNodes.length;
+    let currentEnd = currentLength;
+    let currentStart = 0;
+    let futureEnd = futureNodes.length;
+    let futureStart = 0; // common prefix
+
+    while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentStart], futureNodes[futureStart])) {
+      currentStart++;
+      futureStart++;
+    } // common suffix
+
+
+    while (currentStart < currentEnd && futureStart < futureEnd && compare(currentNodes[currentEnd - 1], futureNodes[futureEnd - 1])) {
+      currentEnd--;
+      futureEnd--;
+    }
+
+    const currentSame = currentStart === currentEnd;
+    const futureSame = futureStart === futureEnd; // same list
+
+    if (currentSame && futureSame) return futureNodes; // only stuff to add
+
+    if (currentSame && futureStart < futureEnd) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentStart, currentLength, before));
+      return futureNodes;
+    } // only stuff to remove
+
+
+    if (futureSame && currentStart < currentEnd) {
+      remove(get, parentNode, currentNodes, currentStart, currentEnd);
+      return futureNodes;
+    }
+
+    const currentChanges = currentEnd - currentStart;
+    const futureChanges = futureEnd - futureStart;
+    let i = -1; // 2 simple indels: the shortest sequence is a subsequence of the longest
+
+    if (currentChanges < futureChanges) {
+      i = indexOf(futureNodes, futureStart, futureEnd, currentNodes, currentStart, currentEnd, compare); // inner diff
+
+      if (-1 < i) {
+        append(get, parentNode, futureNodes, futureStart, i, get(currentNodes[currentStart], 0));
+        append(get, parentNode, futureNodes, i + currentChanges, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+        return futureNodes;
+      }
+    }
+    /* istanbul ignore else */
+    else if (futureChanges < currentChanges) {
+        i = indexOf(currentNodes, currentStart, currentEnd, futureNodes, futureStart, futureEnd, compare); // outer diff
+
+        if (-1 < i) {
+          remove(get, parentNode, currentNodes, currentStart, i);
+          remove(get, parentNode, currentNodes, i + futureChanges, currentEnd);
+          return futureNodes;
+        }
+      } // common case with one replacement for many nodes
+    // or many nodes replaced for a single one
+
+    /* istanbul ignore else */
+
+
+    if (currentChanges < 2 || futureChanges < 2) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, get(currentNodes[currentStart], 0));
+      remove(get, parentNode, currentNodes, currentStart, currentEnd);
+      return futureNodes;
+    } // the half match diff part has been skipped in petit-dom
+    // https://github.com/yelouafi/petit-dom/blob/bd6f5c919b5ae5297be01612c524c40be45f14a7/src/vdom.js#L391-L397
+    // accordingly, I think it's safe to skip in here too
+    // if one day it'll come out like the speediest thing ever to do
+    // then I might add it in here too
+    // Extra: before going too fancy, what about reversed lists ?
+    //        This should bail out pretty quickly if that's not the case.
+
+
+    if (currentChanges === futureChanges && isReversed(futureNodes, futureEnd, currentNodes, currentStart, currentEnd, compare)) {
+      append(get, parentNode, futureNodes, futureStart, futureEnd, next(get, currentNodes, currentEnd, currentLength, before));
+      return futureNodes;
+    } // last resort through a smart diff
+
+
+    smartDiff(get, parentNode, futureNodes, futureStart, futureEnd, futureChanges, currentNodes, currentStart, currentEnd, currentChanges, currentLength, compare, before);
+    return futureNodes;
+  };
+  /**
+   * Check if a value is null or undefined
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the 'undefined' and 'null' types
+   */
+
+
+  function isNil(value) {
+    return value === null || value === undefined;
+  }
+  /**
+   * Check if an element is a template tag
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if it's a <template>
+   */
+
+
+  function isTemplate(el) {
+    return !isNil(el.content);
+  }
+
+  const EachBinding = Object.seal({
+    // dynamic binding properties
+    childrenMap: null,
+    node: null,
+    root: null,
+    condition: null,
+    evaluate: null,
+    template: null,
+    isTemplateTag: false,
+    nodes: [],
+    getKey: null,
+    indexName: null,
+    itemName: null,
+    afterPlaceholder: null,
+    placeholder: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      return this.update(scope, parentScope);
+    },
+
+    update(scope, parentScope) {
+      const {
+        placeholder
+      } = this;
+      const collection = this.evaluate(scope);
+      const items = collection ? Array.from(collection) : [];
+      const parent = placeholder.parentNode; // prepare the diffing
+
+      const {
+        newChildrenMap,
+        batches,
+        futureNodes
+      } = createPatch(items, scope, parentScope, this); // patch the DOM only if there are new nodes
+
+      if (futureNodes.length) {
+        domdiff(parent, this.nodes, futureNodes, {
+          before: placeholder,
+          node: patch(Array.from(this.childrenMap.values()), parentScope)
+        });
+      } else {
+        // remove all redundant templates
+        unmountRedundant(this.childrenMap);
+      } // trigger the mounts and the updates
+
+
+      batches.forEach(fn => fn()); // update the children map
+
+      this.childrenMap = newChildrenMap;
+      this.nodes = futureNodes;
+      return this;
+    },
+
+    unmount(scope, parentScope) {
+      unmountRedundant(this.childrenMap, parentScope);
+      this.childrenMap = new Map();
+      this.nodes = [];
+      return this;
+    }
+
+  });
+  /**
+   * Patch the DOM while diffing
+   * @param   {TemplateChunk[]} redundant - redundant tepmplate chunks
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {Function} patch function used by domdiff
+   */
+
+  function patch(redundant, parentScope) {
+    return (item, info) => {
+      if (info < 0) {
+        const {
+          template,
+          context
+        } = redundant.pop(); // notice that we pass null as last argument because
+        // the root node and its children will be removed by domdiff
+
+        template.unmount(context, parentScope, null);
+      }
+
+      return item;
+    };
+  }
+  /**
+   * Unmount the remaining template instances
+   * @param   {Map} childrenMap - map containing the children template to unmount
+   * @param   {*} parentScope - scope of the parent template
+   * @returns {TemplateChunk[]} collection containing the template chunks unmounted
+   */
+
+
+  function unmountRedundant(childrenMap, parentScope) {
+    return Array.from(childrenMap.values()).map((_ref) => {
+      let {
+        template,
+        context
+      } = _ref;
+      return template.unmount(context, parentScope, true);
+    });
+  }
+  /**
+   * Check whether a template must be filtered from a loop
+   * @param   {Function} condition - filter function
+   * @param   {Object} context - argument passed to the filter function
+   * @returns {boolean} true if this item should be skipped
+   */
+
+
+  function mustFilterItem(condition, context) {
+    return condition ? Boolean(condition(context)) === false : false;
+  }
+  /**
+   * Extend the scope of the looped template
+   * @param   {Object} scope - current template scope
+   * @param   {string} options.itemName - key to identify the looped item in the new context
+   * @param   {string} options.indexName - key to identify the index of the looped item
+   * @param   {number} options.index - current index
+   * @param   {*} options.item - collection item looped
+   * @returns {Object} enhanced scope object
+   */
+
+
+  function extendScope(scope, _ref2) {
+    let {
+      itemName,
+      indexName,
+      index,
+      item
+    } = _ref2;
+    scope[itemName] = item;
+    if (indexName) scope[indexName] = index;
+    return scope;
+  }
+  /**
+   * Loop the current template items
+   * @param   {Array} items - expression collection value
+   * @param   {*} scope - template scope
+   * @param   {*} parentScope - scope of the parent template
+   * @param   {EeachBinding} binding - each binding object instance
+   * @returns {Object} data
+   * @returns {Map} data.newChildrenMap - a Map containing the new children template structure
+   * @returns {Array} data.batches - array containing the template lifecycle functions to trigger
+   * @returns {Array} data.futureNodes - array containing the nodes we need to diff
+   */
+
+
+  function createPatch(items, scope, parentScope, binding) {
+    const {
+      condition,
+      template,
+      childrenMap,
+      itemName,
+      getKey,
+      indexName,
+      root,
+      isTemplateTag
+    } = binding;
+    const newChildrenMap = new Map();
+    const batches = [];
+    const futureNodes = [];
+    items.forEach((item, index) => {
+      const context = extendScope(Object.create(scope), {
+        itemName,
+        indexName,
+        index,
+        item
+      });
+      const key = getKey ? getKey(context) : index;
+      const oldItem = childrenMap.get(key);
+
+      if (mustFilterItem(condition, context)) {
+        return;
+      }
+
+      const componentTemplate = oldItem ? oldItem.template : template.clone();
+      const el = oldItem ? componentTemplate.el : root.cloneNode();
+      const mustMount = !oldItem;
+      const meta = isTemplateTag && mustMount ? createTemplateMeta(componentTemplate) : {};
+
+      if (mustMount) {
+        batches.push(() => componentTemplate.mount(el, context, parentScope, meta));
+      } else {
+        componentTemplate.update(context, parentScope);
+      } // create the collection of nodes to update or to add
+      // in case of template tags we need to add all its children nodes
+
+
+      if (isTemplateTag) {
+        futureNodes.push(...(meta.children || componentTemplate.children));
+      } else {
+        futureNodes.push(el);
+      } // delete the old item from the children map
+
+
+      childrenMap.delete(key); // update the children map
+
+      newChildrenMap.set(key, {
+        template: componentTemplate,
+        context,
+        index
+      });
+    });
+    return {
+      newChildrenMap,
+      batches,
+      futureNodes
+    };
+  }
+
+  function create(node, _ref3) {
+    let {
+      evaluate,
+      condition,
+      itemName,
+      indexName,
+      getKey,
+      template
+    } = _ref3;
+    const placeholder = document.createTextNode('');
+    const parent = node.parentNode;
+    const root = node.cloneNode();
+    parent.insertBefore(placeholder, node);
+    parent.removeChild(node);
+    return Object.assign({}, EachBinding, {
+      childrenMap: new Map(),
+      node,
+      root,
+      condition,
+      evaluate,
+      isTemplateTag: isTemplate(root),
+      template: template.createDOM(node),
+      getKey,
+      indexName,
+      itemName,
+      placeholder
+    });
+  }
+  /**
+   * Binding responsible for the `if` directive
+   */
+
+
+  const IfBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    parent: null,
+    isTemplateTag: false,
+    placeholder: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      this.parent.insertBefore(this.placeholder, this.node);
+      this.parent.removeChild(this.node);
+      return this.update(scope, parentScope);
+    },
+
+    update(scope, parentScope) {
+      const value = !!this.evaluate(scope);
+      const mustMount = !this.value && value;
+      const mustUnmount = this.value && !value;
+
+      const mount = () => {
+        const pristine = this.node.cloneNode();
+        this.parent.insertBefore(pristine, this.placeholder);
+        this.template = this.template.clone();
+        this.template.mount(pristine, scope, parentScope);
+      };
+
+      switch (true) {
+        case mustMount:
+          mount();
+          break;
+
+        case mustUnmount:
+          this.unmount(scope);
+          break;
+
+        default:
+          if (value) this.template.update(scope, parentScope);
+      }
+
+      this.value = value;
+      return this;
+    },
+
+    unmount(scope, parentScope) {
+      this.template.unmount(scope, parentScope, true);
+      return this;
+    }
+
+  });
+
+  function create$1(node, _ref4) {
+    let {
+      evaluate,
+      template
+    } = _ref4;
+    return Object.assign({}, IfBinding, {
+      node,
+      evaluate,
+      parent: node.parentNode,
+      placeholder: document.createTextNode(''),
+      template: template.createDOM(node)
+    });
+  }
+
+  const ATTRIBUTE = 0;
+  const EVENT = 1;
+  const TEXT = 2;
+  const VALUE = 3;
+  var expressionTypes = {
+    ATTRIBUTE,
+    EVENT,
+    TEXT,
+    VALUE
+  };
+  /**
+   * Check if a value is a Boolean
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is a boolean
+   */
+
+  function isBoolean(value) {
+    return typeof value === 'boolean';
+  }
+  /**
+   * Check if a value is an Object
+   * @param   {*}  value - anything
+   * @returns {boolean} true only for the value is an object
+   */
+
+
+  function isObject(value) {
+    return typeof value === 'object';
+  }
+
+  const REMOVE_ATTRIBUTE = 'removeAttribute';
+  const SET_ATTIBUTE = 'setAttribute';
+  /**
+   * Add all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing the attributes names and values
+   * @returns {undefined} sorry it's a void function :(
+   */
+
+  function setAllAttributes(node, attributes) {
+    Object.entries(attributes).forEach((_ref5) => {
+      let [name, value] = _ref5;
+      return attributeExpression(node, {
+        name
+      }, value);
+    });
+  }
+  /**
+   * Remove all the attributes provided
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} attributes - object containing all the attribute names
+   * @returns {undefined} sorry it's a void function :(
+   */
+
+
+  function removeAllAttributes(node, attributes) {
+    Object.keys(attributes).forEach(attribute => node.removeAttribute(attribute));
+  }
+  /**
+   * This methods handles the DOM attributes updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - attribute name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - the old expression cached value
+   * @returns {undefined}
+   */
+
+
+  function attributeExpression(node, _ref6, value, oldValue) {
+    let {
+      name
+    } = _ref6;
+
+    // is it a spread operator? {...attributes}
+    if (!name) {
+      // is the value still truthy?
+      if (value) {
+        setAllAttributes(node, value);
+      } else if (oldValue) {
+        // otherwise remove all the old attributes
+        removeAllAttributes(node, oldValue);
+      }
+
+      return;
+    } // handle boolean attributes
+
+
+    if (isBoolean(value) || isObject(value)) {
+      node[name] = value;
+    }
+
+    node[getMethod(value)](name, normalizeValue(name, value));
+  }
+  /**
+   * Get the attribute modifier method
+   * @param   {*} value - if truthy we return `setAttribute` othewise `removeAttribute`
+   * @returns {string} the node attribute modifier method name
+   */
+
+
+  function getMethod(value) {
+    return isNil(value) || value === false || value === '' || isObject(value) ? REMOVE_ATTRIBUTE : SET_ATTIBUTE;
+  }
+  /**
+   * Get the value as string
+   * @param   {string} name - attribute name
+   * @param   {*} value - user input value
+   * @returns {string} input value as string
+   */
+
+
+  function normalizeValue(name, value) {
+    // be sure that expressions like selected={ true } will be always rendered as selected='selected'
+    if (value === true) return name;
+    return value;
+  }
+
+  const RE_EVENTS_PREFIX = /^on/;
+  /**
+   * Set a new event listener
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {string} expression.name - event name
+   * @param   {*} value - new expression value
+   * @param   {*} oldValue - old expression value
+   * @returns {value} the callback just received
+   */
+
+  function eventExpression(node, _ref7, value, oldValue) {
+    let {
+      name
+    } = _ref7;
+    const normalizedEventName = name.replace(RE_EVENTS_PREFIX, '');
+
+    if (oldValue) {
+      node.removeEventListener(normalizedEventName, oldValue);
+    }
+
+    if (value) {
+      node.addEventListener(normalizedEventName, value, false);
+    }
+
+    return value;
+  }
+  /**
+   * This methods handles a simple text expression update
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {number} expression.childNodeIndex - index to find the text node to update
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+
+
+  function textExpression(node, _ref8, value) {
+    let {
+      childNodeIndex
+    } = _ref8;
+    const target = node.childNodes[childNodeIndex];
+    const val = normalizeValue$1(value); // replace the target if it's a placeholder comment
+
+    if (target.nodeType === Node.COMMENT_NODE) {
+      const textNode = document.createTextNode(val);
+      node.replaceChild(textNode, target);
+    } else {
+      target.data = normalizeValue$1(val);
+    }
+  }
+  /**
+   * Normalize the user value in order to render a empty string in case of falsy values
+   * @param   {*} value - user input value
+   * @returns {string} hopefully a string
+   */
+
+
+  function normalizeValue$1(value) {
+    return isNil(value) ? '' : value;
+  }
+  /**
+   * This methods handles the input fileds value updates
+   * @param   {HTMLElement} node - target node
+   * @param   {Object} expression - expression object
+   * @param   {*} value - new expression value
+   * @returns {undefined}
+   */
+
+
+  function valueExpression(node, expression, value) {
+    node.value = value;
+  }
+
+  var expressions = {
+    [ATTRIBUTE]: attributeExpression,
+    [EVENT]: eventExpression,
+    [TEXT]: textExpression,
+    [VALUE]: valueExpression
+  };
+  const Expression = Object.seal({
+    // Static props
+    node: null,
+    value: null,
+
+    // API methods
+
+    /**
+     * Mount the expression evaluating its initial value
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    mount(scope) {
+      // hopefully a pure function
+      this.value = this.evaluate(scope); // IO() DOM updates
+
+      apply(this, this.value);
+      return this;
+    },
+
+    /**
+     * Update the expression if its value changed
+     * @param   {*} scope - argument passed to the expression to evaluate its current values
+     * @returns {Expression} self
+     */
+    update(scope) {
+      // pure function
+      const value = this.evaluate(scope);
+
+      if (this.value !== value) {
+        // IO() DOM updates
+        apply(this, value);
+        this.value = value;
+      }
+
+      return this;
+    },
+
+    /**
+     * Expression teardown method
+     * @returns {Expression} self
+     */
+    unmount() {
+      // unmount only the event handling expressions
+      if (this.type === EVENT) apply(this, null);
+      return this;
+    }
+
+  });
+  /**
+   * IO() function to handle the DOM updates
+   * @param {Expression} expression - expression object
+   * @param {*} value - current expression value
+   * @returns {undefined}
+   */
+
+  function apply(expression, value) {
+    return expressions[expression.type](expression.node, expression, value, expression.value);
+  }
+
+  function create$2(node, data) {
+    return Object.assign({}, Expression, {}, data, {
+      node
+    });
+  }
+  /**
+   * Create a flat object having as keys a list of methods that if dispatched will propagate
+   * on the whole collection
+   * @param   {Array} collection - collection to iterate
+   * @param   {Array<string>} methods - methods to execute on each item of the collection
+   * @param   {*} context - context returned by the new methods created
+   * @returns {Object} a new object to simplify the the nested methods dispatching
+   */
+
+
+  function flattenCollectionMethods(collection, methods, context) {
+    return methods.reduce((acc, method) => {
+      return Object.assign({}, acc, {
+        [method]: scope => {
+          return collection.map(item => item[method](scope)) && context;
+        }
+      });
+    }, {});
+  }
+
+  function create$3(node, _ref9) {
+    let {
+      expressions
+    } = _ref9;
+    return Object.assign({}, flattenCollectionMethods(expressions.map(expression => create$2(node, expression)), ['mount', 'update', 'unmount']));
+  }
+
+  const SlotBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    name: null,
+    template: null,
+
+    // API methods
+    mount(scope, parentScope) {
+      const templateData = scope.slots ? scope.slots.find((_ref10) => {
+        let {
+          id
+        } = _ref10;
+        return id === this.name;
+      }) : false;
+      const {
+        parentNode
+      } = this.node;
+      this.template = templateData && create$6(templateData.html, templateData.bindings).createDOM(parentNode);
+
+      if (this.template) {
+        this.template.mount(this.node, parentScope);
+        moveSlotInnerContent(this.node);
+      }
+
+      parentNode.removeChild(this.node);
+      return this;
+    },
+
+    update(scope, parentScope) {
+      if (this.template && parentScope) {
+        this.template.update(parentScope);
+      }
+
+      return this;
+    },
+
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.template) {
+        this.template.unmount(parentScope, null, mustRemoveRoot);
+      }
+
+      return this;
+    }
+
+  });
+  /**
+   * Move the inner content of the slots outside of them
+   * @param   {HTMLNode} slot - slot node
+   * @returns {undefined} it's a void function
+   */
+
+  function moveSlotInnerContent(slot) {
+    if (slot.firstChild) {
+      slot.parentNode.insertBefore(slot.firstChild, slot);
+      moveSlotInnerContent(slot);
+    }
+  }
+  /**
+   * Create a single slot binding
+   * @param   {HTMLElement} node - slot node
+   * @param   {string} options.name - slot id
+   * @returns {Object} Slot binding object
+   */
+
+
+  function createSlot(node, _ref11) {
+    let {
+      name
+    } = _ref11;
+    return Object.assign({}, SlotBinding, {
+      node,
+      name
+    });
+  }
+  /**
+   * Create a new tag object if it was registered before, otherwise fallback to the simple
+   * template chunk
+   * @param   {Function} component - component factory function
+   * @param   {Array<Object>} slots - array containing the slots markup
+   * @param   {Array} attributes - dynamic attributes that will be received by the tag element
+   * @returns {TagImplementation|TemplateChunk} a tag implementation or a template chunk as fallback
+   */
+
+
+  function getTag(component, slots, attributes) {
+    if (slots === void 0) {
+      slots = [];
+    }
+
+    if (attributes === void 0) {
+      attributes = [];
+    }
+
+    // if this tag was registered before we will return its implementation
+    if (component) {
+      return component({
+        slots,
+        attributes
+      });
+    } // otherwise we return a template chunk
+
+
+    return create$6(slotsToMarkup(slots), [...slotBindings(slots), {
+      // the attributes should be registered as binding
+      // if we fallback to a normal template chunk
+      expressions: attributes.map(attr => {
+        return Object.assign({
+          type: ATTRIBUTE
+        }, attr);
+      })
+    }]);
+  }
+  /**
+   * Merge all the slots bindings into a single array
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {Array<Bindings>} flatten bindings array
+   */
+
+
+  function slotBindings(slots) {
+    return slots.reduce((acc, _ref12) => {
+      let {
+        bindings
+      } = _ref12;
+      return acc.concat(bindings);
+    }, []);
+  }
+  /**
+   * Merge all the slots together in a single markup string
+   * @param   {Array<Object>} slots - slots collection
+   * @returns {string} markup of all the slots in a single string
+   */
+
+
+  function slotsToMarkup(slots) {
+    return slots.reduce((acc, slot) => {
+      return acc + slot.html;
+    }, '');
+  }
+
+  const TagBinding = Object.seal({
+    // dynamic binding properties
+    node: null,
+    evaluate: null,
+    name: null,
+    slots: null,
+    tag: null,
+    attributes: null,
+    getComponent: null,
+
+    mount(scope) {
+      return this.update(scope);
+    },
+
+    update(scope, parentScope) {
+      const name = this.evaluate(scope); // simple update
+
+      if (name === this.name) {
+        this.tag.update(scope);
+      } else {
+        // unmount the old tag if it exists
+        this.unmount(scope, parentScope, true); // mount the new tag
+
+        this.name = name;
+        this.tag = getTag(this.getComponent(name), this.slots, this.attributes);
+        this.tag.mount(this.node, scope);
+      }
+
+      return this;
+    },
+
+    unmount(scope, parentScope, keepRootTag) {
+      if (this.tag) {
+        // keep the root tag
+        this.tag.unmount(keepRootTag);
+      }
+
+      return this;
+    }
+
+  });
+
+  function create$4(node, _ref13) {
+    let {
+      evaluate,
+      getComponent,
+      slots,
+      attributes
+    } = _ref13;
+    return Object.assign({}, TagBinding, {
+      node,
+      evaluate,
+      slots,
+      attributes,
+      getComponent
+    });
+  }
+
+  var bindings = {
+    [IF]: create$1,
+    [SIMPLE]: create$3,
+    [EACH]: create,
+    [TAG]: create$4,
+    [SLOT]: createSlot
+  };
+  /**
+   * Bind a new expression object to a DOM node
+   * @param   {HTMLElement} root - DOM node where to bind the expression
+   * @param   {Object} binding - binding data
+   * @returns {Expression} Expression object
+   */
+
+  function create$5(root, binding) {
+    const {
+      selector,
+      type,
+      redundantAttribute,
+      expressions
+    } = binding; // find the node to apply the bindings
+
+    const node = selector ? root.querySelector(selector) : root; // remove eventually additional attributes created only to select this node
+
+    if (redundantAttribute) node.removeAttribute(redundantAttribute); // init the binding
+
+    return (bindings[type] || bindings[SIMPLE])(node, Object.assign({}, binding, {
+      expressions: expressions || []
+    }));
+  }
+  /**
+   * Check if an element is part of an svg
+   * @param   {HTMLElement}  el - element to check
+   * @returns {boolean} true if we are in an svg context
+   */
+
+
+  function isSvg(el) {
+    const owner = el.ownerSVGElement;
+    return !!owner || owner === null;
+  } // in this case a simple innerHTML is enough
+
+
+  function createHTMLTree(html, root) {
+    const template = isTemplate(root) ? root : document.createElement('template');
+    template.innerHTML = html;
+    return template.content;
+  } // for svg nodes we need a bit more work
+
+
+  function createSVGTree(html, container) {
+    // create the SVGNode
+    const svgNode = container.ownerDocument.importNode(new window.DOMParser().parseFromString(`<svg xmlns="http://www.w3.org/2000/svg">${html}</svg>`, 'application/xml').documentElement, true);
+    return svgNode;
+  }
+  /**
+   * Create the DOM that will be injected
+   * @param {Object} root - DOM node to find out the context where the fragment will be created
+   * @param   {string} html - DOM to create as string
+   * @returns {HTMLDocumentFragment|HTMLElement} a new html fragment
+   */
+
+
+  function createDOMTree(root, html) {
+    if (isSvg(root)) return createSVGTree(html, root);
+    return createHTMLTree(html, root);
+  }
+  /**
+   * Move all the child nodes from a source tag to another
+   * @param   {HTMLElement} source - source node
+   * @param   {HTMLElement} target - target node
+   * @returns {undefined} it's a void method ¯\_(ツ)_/¯
+   */
+  // Ignore this helper because it's needed only for svg tags
+
+  /* istanbul ignore next */
+
+
+  function moveChildren(source, target) {
+    if (source.firstChild) {
+      target.appendChild(source.firstChild);
+      moveChildren(source, target);
+    }
+  }
+  /**
+   * Inject the DOM tree into a target node
+   * @param   {HTMLElement} el - target element
+   * @param   {HTMLFragment|SVGElement} dom - dom tree to inject
+   * @returns {undefined}
+   */
+
+
+  function injectDOM(el, dom) {
+    switch (true) {
+      case isSvg(el):
+        moveChildren(dom, el);
+        break;
+
+      case isTemplate(el):
+        el.parentNode.replaceChild(dom, el);
+        break;
+
+      default:
+        el.appendChild(dom);
+    }
+  }
+  /**
+   * Create the Template DOM skeleton
+   * @param   {HTMLElement} el - root node where the DOM will be injected
+   * @param   {string} html - markup that will be injected into the root node
+   * @returns {HTMLFragment} fragment that will be injected into the root node
+   */
+
+
+  function createTemplateDOM(el, html) {
+    return html && (typeof html === 'string' ? createDOMTree(el, html) : html);
+  }
+  /**
+   * Template Chunk model
+   * @type {Object}
+   */
+
+
+  const TemplateChunk = Object.freeze({
+    // Static props
+    bindings: null,
+    bindingsData: null,
+    html: null,
+    isTemplateTag: false,
+    fragment: null,
+    children: null,
+    dom: null,
+    el: null,
+
+    /**
+     * Create the template DOM structure that will be cloned on each mount
+     * @param   {HTMLElement} el - the root node
+     * @returns {TemplateChunk} self
+     */
+    createDOM(el) {
+      // make sure that the DOM gets created before cloning the template
+      this.dom = this.dom || createTemplateDOM(el, this.html);
+      return this;
+    },
+
+    // API methods
+
+    /**
+     * Attach the template to a DOM node
+     * @param   {HTMLElement} el - target DOM node
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {Object} meta - meta properties needed to handle the <template> tags in loops
+     * @returns {TemplateChunk} self
+     */
+    mount(el, scope, parentScope, meta) {
+      if (meta === void 0) {
+        meta = {};
+      }
+
+      if (!el) throw new Error('Please provide DOM node to mount properly your template');
+      if (this.el) this.unmount(scope); // <template> tags require a bit more work
+      // the template fragment might be already created via meta outside of this call
+
+      const {
+        fragment,
+        children,
+        avoidDOMInjection
+      } = meta; // <template> bindings of course can not have a root element
+      // so we check the parent node to set the query selector bindings
+
+      const {
+        parentNode
+      } = children ? children[0] : el;
+      this.isTemplateTag = isTemplate(el); // create the DOM if it wasn't created before
+
+      this.createDOM(el);
+
+      if (this.dom) {
+        // create the new template dom fragment if it want already passed in via meta
+        this.fragment = fragment || this.dom.cloneNode(true);
+      } // store root node
+      // notice that for template tags the root note will be the parent tag
+
+
+      this.el = this.isTemplateTag ? parentNode : el; // create the children array only for the <template> fragments
+
+      this.children = this.isTemplateTag ? children || Array.from(this.fragment.childNodes) : null; // inject the DOM into the el only if a fragment is available
+
+      if (!avoidDOMInjection && this.fragment) injectDOM(el, this.fragment); // create the bindings
+
+      this.bindings = this.bindingsData.map(binding => create$5(this.el, binding));
+      this.bindings.forEach(b => b.mount(scope, parentScope));
+      return this;
+    },
+
+    /**
+     * Update the template with fresh data
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @returns {TemplateChunk} self
+     */
+    update(scope, parentScope) {
+      this.bindings.forEach(b => b.update(scope, parentScope));
+      return this;
+    },
+
+    /**
+     * Remove the template from the node where it was initially mounted
+     * @param   {*} scope - template data
+     * @param   {*} parentScope - scope of the parent template tag
+     * @param   {boolean|null} mustRemoveRoot - if true remove the root element,
+     * if false or undefined clean the root tag content, if null don't touch the DOM
+     * @returns {TemplateChunk} self
+     */
+    unmount(scope, parentScope, mustRemoveRoot) {
+      if (this.el) {
+        this.bindings.forEach(b => b.unmount(scope, parentScope, mustRemoveRoot));
+
+        switch (true) {
+          // <template> tags should be treated a bit differently
+          // we need to clear their children only if it's explicitly required by the caller
+          // via mustRemoveRoot !== null
+          case this.isTemplateTag === true && mustRemoveRoot !== null:
+            clearChildren(this.children);
+            break;
+          // remove the root node only if the mustRemoveRoot === true
+
+          case mustRemoveRoot === true && this.el.parentNode !== null:
+            this.el.parentNode.removeChild(this.el);
+            break;
+          // otherwise we clean the node children
+
+          case mustRemoveRoot !== null:
+            cleanNode(this.el);
+            break;
+        }
+
+        this.el = null;
+      }
+
+      return this;
+    },
+
+    /**
+     * Clone the template chunk
+     * @returns {TemplateChunk} a clone of this object resetting the this.el property
+     */
+    clone() {
+      return Object.assign({}, this, {
+        el: null
+      });
+    }
+
+  });
+  /**
+   * Create a template chunk wiring also the bindings
+   * @param   {string|HTMLElement} html - template string
+   * @param   {Array} bindings - bindings collection
+   * @returns {TemplateChunk} a new TemplateChunk copy
+   */
+
+  function create$6(html, bindings) {
+    if (bindings === void 0) {
+      bindings = [];
+    }
+
+    return Object.assign({}, TemplateChunk, {
+      html,
+      bindingsData: bindings
+    });
+  }
+
+  /**
+   * Quick type checking
+   * @param   {*} element - anything
+   * @param   {string} type - type definition
+   * @returns {boolean} true if the type corresponds
+   */
+  function checkType(element, type) {
+    return typeof element === type;
+  }
+  /**
+   * Check that will be passed if its argument is a function
+   * @param   {*} value - value to check
+   * @returns {boolean} - true if the value is a function
+   */
+
+  function isFunction(value) {
+    return checkType(value, 'function');
+  }
+
+  /* eslint-disable fp/no-mutating-methods */
+  /**
+   * Throw an error
+   * @param {string} error - error message
+   * @returns {undefined} it's a IO void function
+   */
+
+  function panic(error) {
+    throw new Error(error);
+  }
+  /**
+   * Call the first argument received only if it's a function otherwise return it as it is
+   * @param   {*} source - anything
+   * @returns {*} anything
+   */
+
+  function callOrAssign(source) {
+    return isFunction(source) ? source.prototype && source.prototype.constructor ? new source() : source() : source;
+  }
+  /**
+   * Convert a string from camel case to dash-case
+   * @param   {string} string - probably a component tag name
+   * @returns {string} component name normalized
+   */
+
+  function camelToDashCase(string) {
+    return string.replace(/([a-z])([A-Z])/g, '$1-$2').toLowerCase();
+  }
+  /**
+   * Convert a string containing dashes to camel case
+   * @param   {string} string - input string
+   * @returns {string} my-string -> myString
+   */
+
+  function dashToCamelCase(string) {
+    return string.replace(/-(\w)/g, (_, c) => c.toUpperCase());
+  }
+  /**
+   * Define default properties if they don't exist on the source object
+   * @param   {Object} source - object that will receive the default properties
+   * @param   {Object} defaults - object containing additional optional keys
+   * @returns {Object} the original object received enhanced
+   */
+
+  function defineDefaults(source, defaults) {
+    Object.entries(defaults).forEach((_ref) => {
+      let [key, value] = _ref;
+      if (!source[key]) source[key] = value;
+    });
+    return source;
+  } // doese simply nothing
+
+  function noop() {
+    return this;
+  }
+  /**
+   * Autobind the methods of a source object to itself
+   * @param   {Object} source - probably a riot tag instance
+   * @param   {Array<string>} methods - list of the methods to autobind
+   * @returns {Object} the original object received
+   */
+
+  function autobindMethods(source, methods) {
+    methods.forEach(method => {
+      source[method] = source[method].bind(source);
+    });
+    return source;
+  }
+  /**
+   * Helper function to set an immutable property
+   * @param   {Object} source - object where the new property will be set
+   * @param   {string} key - object key where the new property will be stored
+   * @param   {*} value - value of the new property
+   * @param   {Object} options - set the propery overriding the default options
+   * @returns {Object} - the original object modified
+   */
+
+  function defineProperty(source, key, value, options) {
+    if (options === void 0) {
+      options = {};
+    }
+
+    Object.defineProperty(source, key, Object.assign({
+      value,
+      enumerable: false,
+      writable: false,
+      configurable: true
+    }, options));
+    return source;
+  }
+  /**
+   * Define multiple properties on a target object
+   * @param   {Object} source - object where the new properties will be set
+   * @param   {Object} properties - object containing as key pair the key + value properties
+   * @param   {Object} options - set the propery overriding the default options
+   * @returns {Object} the original object modified
+   */
+
+  function defineProperties(source, properties, options) {
+    Object.entries(properties).forEach((_ref2) => {
+      let [key, value] = _ref2;
+      defineProperty(source, key, value, options);
+    });
+    return source;
+  }
+  /**
+   * Evaluate a list of attribute expressions
+   * @param   {Array} attributes - attribute expressions generated by the riot compiler
+   * @returns {Object} key value pairs with the result of the computation
+   */
+
+  function evaluateAttributeExpressions(attributes) {
+    return attributes.reduce((acc, attribute) => {
+      const {
+        value,
+        type
+      } = attribute;
+
+      switch (true) {
+        // spread attribute
+        case !attribute.name && type === expressionTypes.ATTRIBUTE:
+          return Object.assign({}, acc, {}, value);
+        // value attribute
+
+        case type === expressionTypes.VALUE:
+          acc[VALUE_ATTRIBUTE] = attribute.value;
+          break;
+        // normal attributes
+
+        default:
+          acc[dashToCamelCase(attribute.name)] = attribute.value;
+      }
+
+      return acc;
+    }, {});
+  }
+
+  /**
+   * Converts any DOM node/s to a loopable array
+   * @param   { HTMLElement|NodeList } els - single html element or a node list
+   * @returns { Array } always a loopable object
+   */
+  function domToArray(els) {
+    // can this object be already looped?
+    if (!Array.isArray(els)) {
+      // is it a node list?
+      if (/^\[object (HTMLCollection|NodeList|Object)\]$/.test(Object.prototype.toString.call(els)) && typeof els.length === 'number') return Array.from(els);else // if it's a single node
+        // it will be returned as "array" with one single entry
+        return [els];
+    } // this object could be looped out of the box
+
+
+    return els;
+  }
+
+  /**
+   * Normalize the return values, in case of a single value we avoid to return an array
+   * @param   { Array } values - list of values we want to return
+   * @returns { Array|string|boolean } either the whole list of values or the single one found
+   * @private
+   */
+
+  const normalize = values => values.length === 1 ? values[0] : values;
+  /**
+   * Parse all the nodes received to get/remove/check their attributes
+   * @param   { HTMLElement|NodeList|Array } els    - DOM node/s to parse
+   * @param   { string|Array }               name   - name or list of attributes
+   * @param   { string }                     method - method that will be used to parse the attributes
+   * @returns { Array|string } result of the parsing in a list or a single value
+   * @private
+   */
+
+
+  function parseNodes(els, name, method) {
+    const names = typeof name === 'string' ? [name] : name;
+    return normalize(domToArray(els).map(el => {
+      return normalize(names.map(n => el[method](n)));
+    }));
+  }
+  /**
+   * Set any attribute on a single or a list of DOM nodes
+   * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+   * @param   { string|Object }              name  - either the name of the attribute to set
+   *                                                 or a list of properties as object key - value
+   * @param   { string }                     value - the new value of the attribute (optional)
+   * @returns { HTMLElement|NodeList|Array } the original array of elements passed to this function
+   *
+   * @example
+   *
+   * import { set } from 'bianco.attr'
+   *
+   * const img = document.createElement('img')
+   *
+   * set(img, 'width', 100)
+   *
+   * // or also
+   * set(img, {
+   *   width: 300,
+   *   height: 300
+   * })
+   *
+   */
+
+
+  function set(els, name, value) {
+    const attrs = typeof name === 'object' ? name : {
+      [name]: value
+    };
+    const props = Object.keys(attrs);
+    domToArray(els).forEach(el => {
+      props.forEach(prop => el.setAttribute(prop, attrs[prop]));
+    });
+    return els;
+  }
+  /**
+   * Get any attribute from a single or a list of DOM nodes
+   * @param   { HTMLElement|NodeList|Array } els   - DOM node/s to parse
+   * @param   { string|Array }               name  - name or list of attributes to get
+   * @returns { Array|string } list of the attributes found
+   *
+   * @example
+   *
+   * import { get } from 'bianco.attr'
+   *
+   * const img = document.createElement('img')
+   *
+   * get(img, 'width') // => '200'
+   *
+   * // or also
+   * get(img, ['width', 'height']) // => ['200', '300']
+   *
+   * // or also
+   * get([img1, img2], ['width', 'height']) // => [['200', '300'], ['500', '200']]
+   */
+
+  function get(els, name) {
+    return parseNodes(els, name, 'getAttribute');
+  }
+
+  /**
+   * Get all the element attributes as object
+   * @param   {HTMLElement} element - DOM node we want to parse
+   * @returns {Object} all the attributes found as a key value pairs
+   */
+
+  function DOMattributesToObject(element) {
+    return Array.from(element.attributes).reduce((acc, attribute) => {
+      acc[dashToCamelCase(attribute.name)] = attribute.value;
+      return acc;
+    }, {});
+  }
+  /**
+   * Get the tag name of any DOM node
+   * @param   {HTMLElement} element - DOM node we want to inspect
+   * @returns {string} name to identify this dom node in riot
+   */
+
+  function getName(element) {
+    return get(element, IS_DIRECTIVE) || element.tagName.toLowerCase();
+  }
+
+  /**
+   * Simple helper to find DOM nodes returning them as array like loopable object
+   * @param   { string|DOMNodeList } selector - either the query or the DOM nodes to arraify
+   * @param   { HTMLElement }        ctx      - context defining where the query will search for the DOM nodes
+   * @returns { Array } DOM nodes found as array
+   */
+
+  function $(selector, ctx) {
+    return domToArray(typeof selector === 'string' ? (ctx || document).querySelectorAll(selector) : selector);
+  }
+
+  const CSS_BY_NAME = new Map();
+  const STYLE_NODE_SELECTOR = 'style[riot]'; // memoized curried function
+
+  const getStyleNode = (style => {
+    return () => {
+      // lazy evaluation:
+      // if this function was already called before
+      // we return its cached result
+      if (style) return style; // create a new style element or use an existing one
+      // and cache it internally
+
+      style = $(STYLE_NODE_SELECTOR)[0] || document.createElement('style');
+      set(style, 'type', 'text/css');
+      /* istanbul ignore next */
+
+      if (!style.parentNode) document.head.appendChild(style);
+      return style;
+    };
+  })();
+  /**
+   * Object that will be used to inject and manage the css of every tag instance
+   */
+
+
+  var cssManager = {
+    CSS_BY_NAME,
+
+    /**
+     * Save a tag style to be later injected into DOM
+     * @param { string } name - if it's passed we will map the css to a tagname
+     * @param { string } css - css string
+     * @returns {Object} self
+     */
+    add(name, css) {
+      if (!CSS_BY_NAME.has(name)) {
+        CSS_BY_NAME.set(name, css);
+        this.inject();
+      }
+
+      return this;
+    },
+
+    /**
+     * Inject all previously saved tag styles into DOM
+     * innerHTML seems slow: http://jsperf.com/riot-insert-style
+     * @returns {Object} self
+     */
+    inject() {
+      getStyleNode().innerHTML = [...CSS_BY_NAME.values()].join('\n');
+      return this;
+    },
+
+    /**
+     * Remove a tag style from the DOM
+     * @param {string} name a registered tagname
+     * @returns {Object} self
+     */
+    remove(name) {
+      if (CSS_BY_NAME.has(name)) {
+        CSS_BY_NAME.delete(name);
+        this.inject();
+      }
+
+      return this;
+    }
+
+  };
+
+  /**
+   * Function to curry any javascript method
+   * @param   {Function}  fn - the target function we want to curry
+   * @param   {...[args]} acc - initial arguments
+   * @returns {Function|*} it will return a function until the target function
+   *                       will receive all of its arguments
+   */
+  function curry(fn) {
+    for (var _len = arguments.length, acc = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+      acc[_key - 1] = arguments[_key];
+    }
+
+    return function () {
+      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        args[_key2] = arguments[_key2];
+      }
+
+      args = [...acc, ...args];
+      return args.length < fn.length ? curry(fn, ...args) : fn(...args);
+    };
+  }
+
+  const COMPONENT_CORE_HELPERS = Object.freeze({
+    // component helpers
+    $(selector) {
+      return $(selector, this.root)[0];
+    },
+
+    $$(selector) {
+      return $(selector, this.root);
+    }
+
+  });
+  const COMPONENT_LIFECYCLE_METHODS = Object.freeze({
+    shouldUpdate: noop,
+    onBeforeMount: noop,
+    onMounted: noop,
+    onBeforeUpdate: noop,
+    onUpdated: noop,
+    onBeforeUnmount: noop,
+    onUnmounted: noop
+  });
+  const MOCKED_TEMPLATE_INTERFACE = {
+    update: noop,
+    mount: noop,
+    unmount: noop,
+    clone: noop,
+    createDOM: noop
+    /**
+     * Factory function to create the component templates only once
+     * @param   {Function} template - component template creation function
+     * @param   {Object} components - object containing the nested components
+     * @returns {TemplateChunk} template chunk object
+     */
+
+  };
+
+  function componentTemplateFactory(template, components) {
+    return template(create$6, expressionTypes, bindingTypes, name => {
+      return components[name] || COMPONENTS_IMPLEMENTATION_MAP.get(name);
+    });
+  }
+  /**
+   * Create the component interface needed for the @riotjs/dom-bindings tag bindings
+   * @param   {string} options.css - component css
+   * @param   {Function} options.template - functon that will return the dom-bindings template function
+   * @param   {Object} options.exports - component interface
+   * @param   {string} options.name - component name
+   * @returns {Object} component like interface
+   */
+
+
+  function createComponent(_ref) {
+    let {
+      css,
+      template,
+      exports,
+      name
+    } = _ref;
+    const templateFn = template ? componentTemplateFactory(template, exports ? createSubcomponents(exports.components) : {}) : MOCKED_TEMPLATE_INTERFACE;
+    return (_ref2) => {
+      let {
+        slots,
+        attributes,
+        props
+      } = _ref2;
+      const componentAPI = callOrAssign(exports) || {};
+      const component = defineComponent({
+        css,
+        template: templateFn,
+        componentAPI,
+        name
+      })({
+        slots,
+        attributes,
+        props
+      }); // notice that for the components create via tag binding
+      // we need to invert the mount (state/parentScope) arguments
+      // the template bindings will only forward the parentScope updates
+      // and never deal with the component state
+
+      return {
+        mount(element, parentScope, state) {
+          return component.mount(element, state, parentScope);
+        },
+
+        update(parentScope, state) {
+          return component.update(state, parentScope);
+        },
+
+        unmount(preserveRoot) {
+          return component.unmount(preserveRoot);
+        }
+
+      };
+    };
+  }
+  /**
+   * Component definition function
+   * @param   {Object} implementation - the componen implementation will be generated via compiler
+   * @param   {Object} component - the component initial properties
+   * @returns {Object} a new component implementation object
+   */
+
+  function defineComponent(_ref3) {
+    let {
+      css,
+      template,
+      componentAPI,
+      name
+    } = _ref3;
+    // add the component css into the DOM
+    if (css && name) cssManager.add(name, css);
+    return curry(enhanceComponentAPI)(defineProperties( // set the component defaults without overriding the original component API
+    defineDefaults(componentAPI, Object.assign({}, COMPONENT_LIFECYCLE_METHODS, {
+      state: {}
+    })), Object.assign({
+      // defined during the component creation
+      slots: null,
+      root: null
+    }, COMPONENT_CORE_HELPERS, {
+      name,
+      css,
+      template
+    })));
+  }
+  /**
+   * Evaluate the component properties either from its real attributes or from its attribute expressions
+   * @param   {HTMLElement} element - component root
+   * @param   {Array}  attributeExpressions - attribute values generated via createAttributeBindings
+   * @returns {Object} attributes key value pairs
+   */
+
+  function evaluateProps(element, attributeExpressions) {
+    if (attributeExpressions === void 0) {
+      attributeExpressions = [];
+    }
+
+    return Object.assign({}, DOMattributesToObject(element), {}, evaluateAttributeExpressions(attributeExpressions));
+  }
+  /**
+   * Create the bindings to update the component attributes
+   * @param   {HTMLElement} node - node where we will bind the expressions
+   * @param   {Array} attributes - list of attribute bindings
+   * @returns {TemplateChunk} - template bindings object
+   */
+
+
+  function createAttributeBindings(node, attributes) {
+    if (attributes === void 0) {
+      attributes = [];
+    }
+
+    const expressions = attributes.map(a => create$2(node, a));
+    const binding = {};
+
+    const updateValues = method => scope => {
+      expressions.forEach(e => e[method](scope));
+      return binding;
+    };
+
+    return Object.assign(binding, {
+      expressions,
+      mount: updateValues('mount'),
+      update: updateValues('update'),
+      unmount: updateValues('unmount')
+    });
+  }
+  /**
+   * Create the subcomponents that can be included inside a tag in runtime
+   * @param   {Object} components - components imported in runtime
+   * @returns {Object} all the components transformed into Riot.Component factory functions
+   */
+
+
+  function createSubcomponents(components) {
+    if (components === void 0) {
+      components = {};
+    }
+
+    return Object.entries(callOrAssign(components)).reduce((acc, _ref4) => {
+      let [key, value] = _ref4;
+      acc[camelToDashCase(key)] = createComponent(value);
+      return acc;
+    }, {});
+  }
+  /**
+   * Run the component instance through all the plugins set by the user
+   * @param   {Object} component - component instance
+   * @returns {Object} the component enhanced by the plugins
+   */
+
+
+  function runPlugins(component) {
+    return [...PLUGINS_SET].reduce((c, fn) => fn(c) || c, component);
+  }
+  /**
+   * Compute the component current state merging it with its previous state
+   * @param   {Object} oldState - previous state object
+   * @param   {Object} newState - new state givent to the `update` call
+   * @returns {Object} new object state
+   */
+
+
+  function computeState(oldState, newState) {
+    return Object.assign({}, oldState, {}, callOrAssign(newState));
+  }
+  /**
+   * Add eventually the "is" attribute to link this DOM node to its css
+   * @param {HTMLElement} element - target root node
+   * @param {string} name - name of the component mounted
+   * @returns {undefined} it's a void function
+   */
+
+
+  function addCssHook(element, name) {
+    if (getName(element) !== name) {
+      set(element, 'is', name);
+    }
+  }
+  /**
+   * Component creation factory function that will enhance the user provided API
+   * @param   {Object} component - a component implementation previously defined
+   * @param   {Array} options.slots - component slots generated via riot compiler
+   * @param   {Array} options.attributes - attribute expressions generated via riot compiler
+   * @returns {Riot.Component} a riot component instance
+   */
+
+
+  function enhanceComponentAPI(component, _ref5) {
+    let {
+      slots,
+      attributes,
+      props
+    } = _ref5;
+    const initialProps = callOrAssign(props);
+    return autobindMethods(runPlugins(defineProperties(Object.create(component), {
+      mount(element, state, parentScope) {
+        if (state === void 0) {
+          state = {};
+        }
+
+        this[ATTRIBUTES_KEY_SYMBOL] = createAttributeBindings(element, attributes).mount(parentScope);
+        this.props = Object.freeze(Object.assign({}, initialProps, {}, evaluateProps(element, this[ATTRIBUTES_KEY_SYMBOL].expressions)));
+        this.state = computeState(this.state, state);
+        this[TEMPLATE_KEY_SYMBOL] = this.template.createDOM(element).clone(); // link this object to the DOM node
+
+        element[DOM_COMPONENT_INSTANCE_PROPERTY] = this; // add eventually the 'is' attribute
+
+        component.name && addCssHook(element, component.name); // define the root element
+
+        defineProperty(this, 'root', element); // define the slots array
+
+        defineProperty(this, 'slots', slots); // before mount lifecycle event
+
+        this.onBeforeMount(this.props, this.state); // mount the template
+
+        this[TEMPLATE_KEY_SYMBOL].mount(element, this, parentScope);
+        this.onMounted(this.props, this.state);
+        return this;
+      },
+
+      update(state, parentScope) {
+        if (state === void 0) {
+          state = {};
+        }
+
+        if (parentScope) {
+          this[ATTRIBUTES_KEY_SYMBOL].update(parentScope);
+        }
+
+        const newProps = evaluateProps(this.root, this[ATTRIBUTES_KEY_SYMBOL].expressions);
+        if (this.shouldUpdate(newProps, this.props) === false) return;
+        this.props = Object.freeze(Object.assign({}, initialProps, {}, newProps));
+        this.state = computeState(this.state, state);
+        this.onBeforeUpdate(this.props, this.state);
+        this[TEMPLATE_KEY_SYMBOL].update(this, parentScope);
+        this.onUpdated(this.props, this.state);
+        return this;
+      },
+
+      unmount(preserveRoot) {
+        this.onBeforeUnmount(this.props, this.state);
+        this[ATTRIBUTES_KEY_SYMBOL].unmount(); // if the preserveRoot is null the template html will be left untouched
+        // in that case the DOM cleanup will happen differently from a parent node
+
+        this[TEMPLATE_KEY_SYMBOL].unmount(this, {}, preserveRoot === null ? null : !preserveRoot);
+        this.onUnmounted(this.props, this.state);
+        return this;
+      }
+
+    })), Object.keys(component).filter(prop => isFunction(component[prop])));
+  }
+  /**
+   * Component initialization function starting from a DOM node
+   * @param   {HTMLElement} element - element to upgrade
+   * @param   {Object} initialProps - initial component properties
+   * @param   {string} componentName - component id
+   * @returns {Object} a new component instance bound to a DOM node
+   */
+
+  function mountComponent(element, initialProps, componentName) {
+    const name = componentName || getName(element);
+    if (!COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component named "${name}" was never registered`);
+    const component = COMPONENTS_IMPLEMENTATION_MAP.get(name)({
+      props: initialProps
+    });
+    return component.mount(element);
+  }
+
+  /**
+   * Similar to compose but performs from left-to-right function composition.<br/>
+   * {@link https://30secondsofcode.org/function#composeright see also}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+  /**
+   * Performs right-to-left function composition.<br/>
+   * Use Array.prototype.reduce() to perform right-to-left function composition.<br/>
+   * The last (rightmost) function can accept one or more arguments; the remaining functions must be unary.<br/>
+   * {@link https://30secondsofcode.org/function#compose original source code}
+   * @param   {...[function]} fns) - list of unary function
+   * @returns {*} result of the computation
+   */
+
+  function compose() {
+    for (var _len2 = arguments.length, fns = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      fns[_key2] = arguments[_key2];
+    }
+
+    return fns.reduce((f, g) => function () {
+      return f(g(...arguments));
+    });
+  }
+
+  const {
+    DOM_COMPONENT_INSTANCE_PROPERTY: DOM_COMPONENT_INSTANCE_PROPERTY$1,
+    COMPONENTS_IMPLEMENTATION_MAP: COMPONENTS_IMPLEMENTATION_MAP$1,
+    PLUGINS_SET: PLUGINS_SET$1
+  } = globals;
+  /**
+   * Riot public api
+   */
+
+  /**
+   * Register a custom tag by name
+   * @param   {string} name - component name
+   * @param   {Object} implementation - tag implementation
+   * @returns {Map} map containing all the components implementations
+   */
+
+  function register(name, _ref) {
+    let {
+      css,
+      template,
+      exports
+    } = _ref;
+    if (COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was already registered`);
+    COMPONENTS_IMPLEMENTATION_MAP$1.set(name, createComponent({
+      name,
+      css,
+      template,
+      exports
+    }));
+    return COMPONENTS_IMPLEMENTATION_MAP$1;
+  }
+  /**
+   * Unregister a riot web component
+   * @param   {string} name - component name
+   * @returns {Map} map containing all the components implementations
+   */
+
+  function unregister(name) {
+    if (!COMPONENTS_IMPLEMENTATION_MAP$1.has(name)) panic(`The component "${name}" was never registered`);
+    COMPONENTS_IMPLEMENTATION_MAP$1.delete(name);
+    cssManager.remove(name);
+    return COMPONENTS_IMPLEMENTATION_MAP$1;
+  }
+  /**
+   * Mounting function that will work only for the components that were globally registered
+   * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+   * @param   {Object} initialProps - the initial component properties
+   * @param   {string} name - optional component name
+   * @returns {Array} list of nodes upgraded
+   */
+
+  function mount(selector, initialProps, name) {
+    return $(selector).map(element => mountComponent(element, initialProps, name));
+  }
+  /**
+   * Sweet unmounting helper function for the DOM node mounted manually by the user
+   * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+   * @param   {boolean|null} keepRootElement - if true keep the root element
+   * @returns {Array} list of nodes unmounted
+   */
+
+  function unmount(selector, keepRootElement) {
+    return $(selector).map(element => {
+      if (element[DOM_COMPONENT_INSTANCE_PROPERTY$1]) {
+        element[DOM_COMPONENT_INSTANCE_PROPERTY$1].unmount(keepRootElement);
+      }
+
+      return element;
+    });
+  }
+  /**
+   * Define a riot plugin
+   * @param   {Function} plugin - function that will receive all the components created
+   * @returns {Set} the set containing all the plugins installed
+   */
+
+  function install(plugin) {
+    if (!isFunction(plugin)) panic('Plugins must be of type function');
+    if (PLUGINS_SET$1.has(plugin)) panic('This plugin was already install');
+    PLUGINS_SET$1.add(plugin);
+    return PLUGINS_SET$1;
+  }
+  /**
+   * Uninstall a riot plugin
+   * @param   {Function} plugin - plugin previously installed
+   * @returns {Set} the set containing all the plugins installed
+   */
+
+  function uninstall(plugin) {
+    if (!PLUGINS_SET$1.has(plugin)) panic('This plugin was never installed');
+    PLUGINS_SET$1.delete(plugin);
+    return PLUGINS_SET$1;
+  }
+  /**
+   * Helpter method to create component without relying on the registered ones
+   * @param   {Object} implementation - component implementation
+   * @returns {Function} function that will allow you to mount a riot component on a DOM node
+   */
+
+  function component(implementation) {
+    return (el, props) => compose(c => c.mount(el), c => c({
+      props
+    }), createComponent)(implementation);
+  }
+  /** @type {string} current riot version */
+
+  const version = 'v4.5.0'; // expose some internal stuff that might be used from external tools
+
+  const __ = {
+    cssManager,
+    defineComponent,
+    globals
+  };
+
+  exports.__ = __;
+  exports.component = component;
+  exports.install = install;
+  exports.mount = mount;
+  exports.register = register;
+  exports.uninstall = uninstall;
+  exports.unmount = unmount;
+  exports.unregister = unregister;
+  exports.version = version;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
diff --git a/node_modules/riot/riot.min.js b/node_modules/riot/riot.min.js
new file mode 100644
index 0000000..da05318
--- /dev/null
+++ b/node_modules/riot/riot.min.js
@@ -0,0 +1,2 @@
+/* Riot v4.5.0, @license MIT */
+var e,t;e=this,t=function(e){"use strict";const t=new Map,n=Symbol("riot-component"),r=new Set,o="is",s="value",i=Symbol("attributes"),u=Symbol("template");var a=Object.freeze({COMPONENTS_IMPLEMENTATION_MAP:t,DOM_COMPONENT_INSTANCE_PROPERTY:n,PLUGINS_SET:r,IS_DIRECTIVE:o,VALUE_ATTRIBUTE:s,ATTRIBUTES_KEY_SYMBOL:i,TEMPLATE_KEY_SYMBOL:u});function l(e){Array.from(e).forEach(e=>e.parentNode&&e.parentNode.removeChild(e))}const c=2;var h={EACH:0,IF:1,SIMPLE:c,TAG:3,SLOT:4};const{indexOf:d}=[],p=(e,t,n,r,o,s)=>{const i="selectedIndex"in t;let u=i;for(;r<o;){const o=e(n[r],1);if(t.insertBefore(o,s),i&&u&&o.selected){u=!u;let{selectedIndex:e}=t;t.selectedIndex=e<0?r:d.call(t.querySelectorAll("option"),o)}r++}},m=(e,t)=>e==t,f=e=>e,b=(e,t,n,r,o,s,i)=>{const u=s-o;if(u<1)return-1;for(;n-t>=u;){let u=t,a=o;for(;u<n&&a<s&&i(e[u],r[a]);)u++,a++;if(a===s)return t;t=u+1}return-1},g=(e,t,n,r,o)=>n<r?e(t[n],0):0<n?e(t[n-1],-0).nextSibling:o,v=(e,t,n,r,o)=>{if(o-r<2)t.removeChild(e(n[r],-1));else{const s=t.ownerDocument.createRange();s.setStartBefore(e(n[r],-1)),s.setEndAfter(e(n[o-1],-1)),s.deleteContents()}},O=(e,t,n)=>{let r=1,o=t;for(;r<o;){const t=(r+o)/2>>>0;n<e[t]?o=t:r=t+1}return r},N=(e,t,n,r,o,s,i,u,a,l,c,h,d)=>{((e,t,n,r,o,s,i,u,a)=>{const l=new Map,c=e.length;let h=i,d=0;for(;d<c;)switch(e[d++]){case 0:o++,h++;break;case 1:l.set(r[o],1),p(t,n,r,o++,o,h<u?t(s[h],0):a);break;case-1:h++}for(d=0;d<c;)switch(e[d++]){case 0:i++;break;case-1:l.has(s[i])?i++:v(t,n,s,i++,i)}})(((e,t,n,r,o,s,i)=>{const u=n+s,a=[];let l,c,h,d,p,m,f;e:for(l=0;l<=u;l++){if(l>50)return null;for(f=l-1,p=l?a[l-1]:[0,0],m=a[l]=[],c=-l;c<=l;c+=2){for(h=(d=c===-l||c!==l&&p[f+c-1]<p[f+c+1]?p[f+c+1]:p[f+c-1]+1)-c;d<s&&h<n&&i(r[o+d],e[t+h]);)d++,h++;if(d===s&&h===n)break e;m[l+c]=d}}const b=Array(l/2+u/2);let g=b.length-1;for(l=a.length-1;l>=0;l--){for(;d>0&&h>0&&i(r[o+d-1],e[t+h-1]);)b[g--]=0,d--,h--;if(!l)break;f=l-1,p=l?a[l-1]:[0,0],(c=d-h)==-l||c!==l&&p[f+c-1]<p[f+c+1]?(h--,b[g--]=1):(d--,b[g--]=-1)}return b})(n,r,s,i,u,l,h)||((e,t,n,r,o,s,i,u)=>{let a=0,l=r<u?r:u;const c=Array(l++),h=Array(l);h[0]=-1;for(let e=1;e<l;e++)h[e]=i;const d=new Map;for(let e=s;e<i;e++)d.set(o[e],e);for(let r=t;r<n;r++){const t=d.get(e[r]);null!=t&&-1<(a=O(h,l,t))&&(h[a]=t,c[a]={newi:r,oldi:t,prev:c[a-1]})}for(a=--l,--i;h[a]>i;)--a;l=u+r-a;const p=Array(l);let m=c[a];for(--n;m;){const{newi:e,oldi:t}=m;for(;n>e;)p[--l]=1,--n;for(;i>t;)p[--l]=-1,--i;p[--l]=0,--n,--i,m=m.prev}for(;n>=t;)p[--l]=1,--n;for(;i>=s;)p[--l]=-1,--i;return p})(n,r,o,s,i,u,a,l),e,t,n,r,i,u,c,d)};function T(e){return null==e}function y(e){return!T(e.content)}const E=Object.seal({childrenMap:null,node:null,root:null,condition:null,evaluate:null,template:null,isTemplateTag:!1,nodes:[],getKey:null,indexName:null,itemName:null,afterPlaceholder:null,placeholder:null,mount(e,t){return this.update(e,t)},update(e,t){const{placeholder:n}=this,r=this.evaluate(e),o=r?Array.from(r):[],s=n.parentNode,{newChildrenMap:i,batches:u,futureNodes:a}=function(e,t,n,r){const{condition:o,template:s,childrenMap:i,itemName:u,getKey:a,indexName:l,root:c,isTemplateTag:h}=r,d=new Map,p=[],m=[];return e.forEach((e,r)=>{const f=function(e,t){let{itemName:n,indexName:r,index:o,item:s}=t;return e[n]=s,r&&(e[r]=o),e}(Object.create(t),{itemName:u,indexName:l,index:r,item:e}),b=a?a(f):r,g=i.get(b);if(function(e,t){return!!e&&!1===Boolean(e(t))}(o,f))return;const v=g?g.template:s.clone(),O=g?v.el:c.cloneNode(),N=!g,T=h&&N?function(e){const t=e.dom.cloneNode(!0);return{avoidDOMInjection:!0,fragment:t,children:Array.from(t.childNodes)}}(v):{};N?p.push(()=>v.mount(O,f,n,T)):v.update(f,n),h?m.push(...T.children||v.children):m.push(O),i.delete(b),d.set(b,{template:v,context:f,index:r})}),{newChildrenMap:d,batches:p,futureNodes:m}}(o,e,t,this);return a.length?((e,t,n,r)=>{r||(r={});const o=r.compare||m,s=r.node||f,i=null==r.before?null:s(r.before,0),u=t.length;let a=u,l=0,c=n.length,h=0;for(;l<a&&h<c&&o(t[l],n[h]);)l++,h++;for(;l<a&&h<c&&o(t[a-1],n[c-1]);)a--,c--;const d=l===a,O=h===c;if(d&&O)return n;if(d&&h<c)return p(s,e,n,h,c,g(s,t,l,u,i)),n;if(O&&l<a)return v(s,e,t,l,a),n;const T=a-l,y=c-h;let E=-1;if(T<y){if(-1<(E=b(n,h,c,t,l,a,o)))return p(s,e,n,h,E,s(t[l],0)),p(s,e,n,E+T,c,g(s,t,a,u,i)),n}else if(y<T&&-1<(E=b(t,l,a,n,h,c,o)))return v(s,e,t,l,E),v(s,e,t,E+y,a),n;T<2||y<2?(p(s,e,n,h,c,s(t[l],0)),v(s,e,t,l,a)):T===y&&((e,t,n,r,o,s)=>{for(;r<o&&s(n[r],e[t-1]);)r++,t--;return 0===t})(n,c,t,l,a,o)?p(s,e,n,h,c,g(s,t,a,u,i)):N(s,e,n,h,c,y,t,l,a,T,u,o,i)})(s,this.nodes,a,{before:n,node:M(Array.from(this.childrenMap.values()),t)}):j(this.childrenMap),u.forEach(e=>e()),this.childrenMap=i,this.nodes=a,this},unmount(e,t){return j(this.childrenMap,t),this.childrenMap=new Map,this.nodes=[],this}});function M(e,t){return(n,r)=>{if(r<0){const{template:n,context:r}=e.pop();n.unmount(r,t,null)}return n}}function j(e,t){return Array.from(e.values()).map(e=>{let{template:n,context:r}=e;return n.unmount(r,t,!0)})}const A=Object.seal({node:null,evaluate:null,parent:null,isTemplateTag:!1,placeholder:null,template:null,mount(e,t){return this.parent.insertBefore(this.placeholder,this.node),this.parent.removeChild(this.node),this.update(e,t)},update(e,t){const n=!!this.evaluate(e),r=!this.value&&n,o=this.value&&!n,s=()=>{const n=this.node.cloneNode();this.parent.insertBefore(n,this.placeholder),this.template=this.template.clone(),this.template.mount(n,e,t)};switch(!0){case r:s();break;case o:this.unmount(e);break;default:n&&this.template.update(e,t)}return this.value=n,this},unmount(e,t){return this.template.unmount(e,t,!0),this}}),w=0;var x={ATTRIBUTE:w,EVENT:1,TEXT:2,VALUE:3};function C(e){return"object"==typeof e}const S="removeAttribute",I="setAttribute";function P(e,t,n,r){let{name:o}=t;o?((function(e){return"boolean"==typeof e}(n)||C(n))&&(e[o]=n),e[function(e){return T(e)||!1===e||""===e||C(e)?S:I}(n)](o,function(e,t){return!0===t?e:t}(o,n))):n?function(e,t){Object.entries(t).forEach(t=>{let[n,r]=t;return P(e,{name:n},r)})}(e,n):r&&function(e,t){Object.keys(t).forEach(t=>e.removeAttribute(t))}(e,r)}const _=/^on/;function B(e){return T(e)?"":e}var D={[w]:P,1:function(e,t,n,r){let{name:o}=t;const s=o.replace(_,"");return r&&e.removeEventListener(s,r),n&&e.addEventListener(s,n,!1),n},2:function(e,t,n){let{childNodeIndex:r}=t;const o=e.childNodes[r],s=B(n);if(o.nodeType===Node.COMMENT_NODE){const t=document.createTextNode(s);e.replaceChild(t,o)}else o.data=B(s)},3:function(e,t,n){e.value=n}};const L=Object.seal({node:null,value:null,mount(e){return this.value=this.evaluate(e),U(this,this.value),this},update(e){const t=this.evaluate(e);return this.value!==t&&(U(this,t),this.value=t),this},unmount(){return 1===this.type&&U(this,null),this}});function U(e,t){return D[e.type](e.node,e,t,e.value)}function k(e,t){return Object.assign({},L,{},t,{node:e})}const R=Object.seal({node:null,name:null,template:null,mount(e,t){const n=!!e.slots&&e.slots.find(e=>{let{id:t}=e;return t===this.name}),{parentNode:r}=this.node;return this.template=n&&q(n.html,n.bindings).createDOM(r),this.template&&(this.template.mount(this.node,t),function e(t){t.firstChild&&(t.parentNode.insertBefore(t.firstChild,t),e(t))}(this.node)),r.removeChild(this.node),this},update(e,t){return this.template&&t&&this.template.update(t),this},unmount(e,t,n){return this.template&&this.template.unmount(t,null,n),this}});function $(e){return e.reduce((e,t)=>{let{bindings:n}=t;return e.concat(n)},[])}const z=Object.seal({node:null,evaluate:null,name:null,slots:null,tag:null,attributes:null,getComponent:null,mount(e){return this.update(e)},update(e,t){const n=this.evaluate(e);return n===this.name?this.tag.update(e):(this.unmount(e,t,!0),this.name=n,this.tag=function(e,t,n){return void 0===t&&(t=[]),void 0===n&&(n=[]),e?e({slots:t,attributes:n}):q(function(e){return e.reduce((e,t)=>e+t.html,"")}(t),[...$(t),{expressions:n.map(e=>Object.assign({type:w},e))}])}(this.getComponent(n),this.slots,this.attributes),this.tag.mount(this.node,e)),this},unmount(e,t,n){return this.tag&&this.tag.unmount(n),this}});var Y={1:function(e,t){let{evaluate:n,template:r}=t;return Object.assign({},A,{node:e,evaluate:n,parent:e.parentNode,placeholder:document.createTextNode(""),template:r.createDOM(e)})},[c]:function(e,t){let{expressions:n}=t;return Object.assign({},(r=n.map(t=>k(e,t)),["mount","update","unmount"].reduce((e,t)=>Object.assign({},e,{[t]:e=>r.map(n=>n[t](e))&&o}),{})));var r,o},0:function(e,t){let{evaluate:n,condition:r,itemName:o,indexName:s,getKey:i,template:u}=t;const a=document.createTextNode(""),l=e.parentNode,c=e.cloneNode();return l.insertBefore(a,e),l.removeChild(e),Object.assign({},E,{childrenMap:new Map,node:e,root:c,condition:r,evaluate:n,isTemplateTag:y(c),template:u.createDOM(e),getKey:i,indexName:s,itemName:o,placeholder:a})},3:function(e,t){let{evaluate:n,getComponent:r,slots:o,attributes:s}=t;return Object.assign({},z,{node:e,evaluate:n,slots:o,attributes:s,getComponent:r})},4:function(e,t){let{name:n}=t;return Object.assign({},R,{node:e,name:n})}};function K(e){const t=e.ownerSVGElement;return!!t||null===t}function V(e,t){return K(e)?function(e,t){return t.ownerDocument.importNode((new window.DOMParser).parseFromString(`<svg xmlns="http://www.w3.org/2000/svg">${e}</svg>`,"application/xml").documentElement,!0)}(t,e):function(e,t){const n=y(t)?t:document.createElement("template");return n.innerHTML=e,n.content}(t,e)}function G(e,t){switch(!0){case K(e):!function e(t,n){t.firstChild&&(n.appendChild(t.firstChild),e(t,n))}(t,e);break;case y(e):e.parentNode.replaceChild(t,e);break;default:e.appendChild(t)}}const H=Object.freeze({bindings:null,bindingsData:null,html:null,isTemplateTag:!1,fragment:null,children:null,dom:null,el:null,createDOM(e){return this.dom=this.dom||function(e,t){return t&&("string"==typeof t?V(e,t):t)}(e,this.html),this},mount(e,t,n,r){if(void 0===r&&(r={}),!e)throw new Error("Please provide DOM node to mount properly your template");this.el&&this.unmount(t);const{fragment:o,children:s,avoidDOMInjection:i}=r,{parentNode:u}=s?s[0]:e;return this.isTemplateTag=y(e),this.createDOM(e),this.dom&&(this.fragment=o||this.dom.cloneNode(!0)),this.el=this.isTemplateTag?u:e,this.children=this.isTemplateTag?s||Array.from(this.fragment.childNodes):null,!i&&this.fragment&&G(e,this.fragment),this.bindings=this.bindingsData.map(e=>(function(e,t){const{selector:n,type:r,redundantAttribute:o,expressions:s}=t,i=n?e.querySelector(n):e;return o&&i.removeAttribute(o),(Y[r]||Y[c])(i,Object.assign({},t,{expressions:s||[]}))})(this.el,e)),this.bindings.forEach(e=>e.mount(t,n)),this},update(e,t){return this.bindings.forEach(n=>n.update(e,t)),this},unmount(e,t,n){if(this.el){switch(this.bindings.forEach(r=>r.unmount(e,t,n)),!0){case!0===this.isTemplateTag&&null!==n:l(this.children);break;case!0===n&&null!==this.el.parentNode:this.el.parentNode.removeChild(this.el);break;case null!==n:l(this.el.childNodes)}this.el=null}return this},clone(){return Object.assign({},this,{el:null})}});function q(e,t){return void 0===t&&(t=[]),Object.assign({},H,{html:e,bindingsData:t})}function F(e){return"function"==typeof e}function W(e){throw new Error(e)}function X(e){return F(e)?e.prototype&&e.prototype.constructor?new e:e():e}function Z(e){return e.replace(/-(\w)/g,(e,t)=>t.toUpperCase())}function J(){return this}function Q(e,t,n,r){return void 0===r&&(r={}),Object.defineProperty(e,t,Object.assign({value:n,enumerable:!1,writable:!1,configurable:!0},r)),e}function ee(e,t,n){return Object.entries(t).forEach(t=>{let[r,o]=t;Q(e,r,o,n)}),e}function te(e){return Array.isArray(e)?e:/^\[object (HTMLCollection|NodeList|Object)\]$/.test(Object.prototype.toString.call(e))&&"number"==typeof e.length?Array.from(e):[e]}const ne=e=>1===e.length?e[0]:e;function re(e,t,n){const r="object"==typeof t?t:{[t]:n},o=Object.keys(r);return te(e).forEach(e=>{o.forEach(t=>e.setAttribute(t,r[t]))}),e}function oe(e,t){return function(e,t,n){const r="string"==typeof t?[t]:t;return ne(te(e).map(e=>ne(r.map(t=>e[n](t)))))}(e,t,"getAttribute")}function se(e){return oe(e,o)||e.tagName.toLowerCase()}function ie(e,t){return te("string"==typeof e?(t||document).querySelectorAll(e):e)}const ue=new Map,ae=(e=>()=>e||(re(e=ie("style[riot]")[0]||document.createElement("style"),"type","text/css"),e.parentNode||document.head.appendChild(e),e))();var le={CSS_BY_NAME:ue,add(e,t){return ue.has(e)||(ue.set(e,t),this.inject()),this},inject(){return ae().innerHTML=[...ue.values()].join("\n"),this},remove(e){return ue.has(e)&&(ue.delete(e),this.inject()),this}};const ce=Object.freeze({$(e){return ie(e,this.root)[0]},$$(e){return ie(e,this.root)}}),he=Object.freeze({shouldUpdate:J,onBeforeMount:J,onMounted:J,onBeforeUpdate:J,onUpdated:J,onBeforeUnmount:J,onUnmounted:J}),de={update:J,mount:J,unmount:J,clone:J,createDOM:J};function pe(e){let{css:n,template:r,exports:o,name:s}=e;const i=r?function(e,n){return e(q,x,h,e=>n[e]||t.get(e))}(r,o?(void 0===(u=o.components)&&(u={}),Object.entries(X(u)).reduce((e,t)=>{let[n,r]=t;return e[function(e){return e.replace(/([a-z])([A-Z])/g,"$1-$2").toLowerCase()}(n)]=pe(r),e},{})):{}):de;var u;return e=>{let{slots:t,attributes:r,props:u}=e;const a=X(o)||{},l=me({css:n,template:i,componentAPI:a,name:s})({slots:t,attributes:r,props:u});return{mount:(e,t,n)=>l.mount(e,n,t),update:(e,t)=>l.update(t,e),unmount:e=>l.unmount(e)}}}function me(e){let{css:t,template:n,componentAPI:r,name:o}=e;return t&&o&&le.add(o,t),function e(t){for(var n=arguments.length,r=new Array(n>1?n-1:0),o=1;o<n;o++)r[o-1]=arguments[o];return function(){for(var n=arguments.length,o=new Array(n),s=0;s<n;s++)o[s]=arguments[s];return(o=[...r,...o]).length<t.length?e(t,...o):t(...o)}}(ge)(ee((s=r,i=Object.assign({},he,{state:{}}),Object.entries(i).forEach(e=>{let[t,n]=e;s[t]||(s[t]=n)}),s),Object.assign({slots:null,root:null},ce,{name:o,css:t,template:n})));var s,i}function fe(e,t){return void 0===t&&(t=[]),Object.assign({},function(e){return Array.from(e.attributes).reduce((e,t)=>(e[Z(t.name)]=t.value,e),{})}(e),{},t.reduce((e,t)=>{const{value:n,type:r}=t;switch(!0){case!t.name&&r===x.ATTRIBUTE:return Object.assign({},e,{},n);case r===x.VALUE:e[s]=t.value;break;default:e[Z(t.name)]=t.value}return e},{}))}function be(e,t){return Object.assign({},e,{},X(t))}function ge(e,t){let{slots:o,attributes:s,props:a}=t;const l=X(a);return c=function(e){return[...r].reduce((e,t)=>t(e)||e,e)}(ee(Object.create(e),{mount(t,r,a){return void 0===r&&(r={}),this[i]=function(e,t){void 0===t&&(t=[]);const n=t.map(t=>k(e,t)),r={},o=e=>t=>(n.forEach(n=>n[e](t)),r);return Object.assign(r,{expressions:n,mount:o("mount"),update:o("update"),unmount:o("unmount")})}(t,s).mount(a),this.props=Object.freeze(Object.assign({},l,{},fe(t,this[i].expressions))),this.state=be(this.state,r),this[u]=this.template.createDOM(t).clone(),t[n]=this,e.name&&function(e,t){se(e)!==t&&re(e,"is",t)}(t,e.name),Q(this,"root",t),Q(this,"slots",o),this.onBeforeMount(this.props,this.state),this[u].mount(t,this,a),this.onMounted(this.props,this.state),this},update(e,t){void 0===e&&(e={}),t&&this[i].update(t);const n=fe(this.root,this[i].expressions);if(!1!==this.shouldUpdate(n,this.props))return this.props=Object.freeze(Object.assign({},l,{},n)),this.state=be(this.state,e),this.onBeforeUpdate(this.props,this.state),this[u].update(this,t),this.onUpdated(this.props,this.state),this},unmount(e){return this.onBeforeUnmount(this.props,this.state),this[i].unmount(),this[u].unmount(this,{},null===e?null:!e),this.onUnmounted(this.props,this.state),this}})),Object.keys(e).filter(t=>F(e[t])).forEach(e=>{c[e]=c[e].bind(c)}),c;var c}const{DOM_COMPONENT_INSTANCE_PROPERTY:ve,COMPONENTS_IMPLEMENTATION_MAP:Oe,PLUGINS_SET:Ne}=a,Te={cssManager:le,defineComponent:me,globals:a};e.__=Te,e.component=function(e){return(t,n)=>(function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];return t.reduce((e,t)=>(function(){return e(t(...arguments))}))})(e=>e.mount(t),e=>e({props:n}),pe)(e)},e.install=function(e){return F(e)||W("Plugins must be of type function"),Ne.has(e)&&W("This plugin was already install"),Ne.add(e),Ne},e.mount=function(e,n,r){return ie(e).map(e=>(function(e,n,r){const o=r||se(e);return t.has(o)||W(`The component named "${o}" was never registered`),t.get(o)({props:n}).mount(e)})(e,n,r))},e.register=function(e,t){let{css:n,template:r,exports:o}=t;return Oe.has(e)&&W(`The component "${e}" was already registered`),Oe.set(e,pe({name:e,css:n,template:r,exports:o})),Oe},e.uninstall=function(e){return Ne.has(e)||W("This plugin was never installed"),Ne.delete(e),Ne},e.unmount=function(e,t){return ie(e).map(e=>(e[ve]&&e[ve].unmount(t),e))},e.unregister=function(e){return Oe.has(e)||W(`The component "${e}" was never registered`),Oe.delete(e),le.remove(e),Oe},e.version="v4.5.0",Object.defineProperty(e,"__esModule",{value:!0})},"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e=e||self).riot={});
diff --git a/node_modules/riot/src/.DS_Store b/node_modules/riot/src/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..5008ddfcf53c02e82d7eee2e57c38e5672ef89f6
GIT binary patch
literal 6148
zcmeH~Jr2S!425mzP>H1@V-^m;4Wg<&0T*E43hX&L&p$$qDprKhvt+--jT7}7np#A3
zem<@ulZcFPQ@L2!n>{z**<q8>++&mCkOWA81W14cNZ<zv;LbK1Poaz?KmsK2CSc!(
z0ynLxE!0092;Krf2c+FF_Fe*7ECH>lEfg7;MkzE(HCqgga^y>{tEnwC%0;vJ&^%eQ
zLs35+`xjp>T0<F0fCPF1$Cyrb|F7^5{eNG?83~ZUUlGt@xh*qZDeu<Z%US-OSsOPv
j)R!Z4KLME7ReXlK;d!wEw5GODWMKRea10D2@KpjYNUI8I

literal 0
HcmV?d00001

diff --git a/node_modules/riot/src/core/component.js b/node_modules/riot/src/core/component.js
new file mode 100644
index 0000000..c6ad7c6
--- /dev/null
+++ b/node_modules/riot/src/core/component.js
@@ -0,0 +1,314 @@
+import {
+  ATTRIBUTES_KEY_SYMBOL,
+  COMPONENTS_IMPLEMENTATION_MAP,
+  DOM_COMPONENT_INSTANCE_PROPERTY,
+  PLUGINS_SET,
+  TEMPLATE_KEY_SYMBOL
+} from '../globals'
+import {DOMattributesToObject, getName} from '../utils/dom'
+import {
+  autobindMethods,
+  callOrAssign,
+  camelToDashCase,
+  defineDefaults,
+  defineProperties,
+  defineProperty,
+  evaluateAttributeExpressions,
+  noop,
+  panic
+} from '../utils/misc'
+import {bindingTypes, createExpression, template as createTemplate, expressionTypes} from '@riotjs/dom-bindings'
+import $ from 'bianco.query'
+import cssManager from './css-manager'
+import curry from 'curri'
+import {isFunction} from '../utils/checks'
+import {set as setAttr} from 'bianco.attr'
+
+const COMPONENT_CORE_HELPERS = Object.freeze({
+  // component helpers
+  $(selector){ return $(selector, this.root)[0] },
+  $$(selector){ return $(selector, this.root) }
+})
+
+const COMPONENT_LIFECYCLE_METHODS = Object.freeze({
+  shouldUpdate: noop,
+  onBeforeMount: noop,
+  onMounted: noop,
+  onBeforeUpdate: noop,
+  onUpdated: noop,
+  onBeforeUnmount: noop,
+  onUnmounted: noop
+})
+
+const MOCKED_TEMPLATE_INTERFACE = {
+  update: noop,
+  mount: noop,
+  unmount: noop,
+  clone: noop,
+  createDOM: noop
+}
+
+/**
+ * Factory function to create the component templates only once
+ * @param   {Function} template - component template creation function
+ * @param   {Object} components - object containing the nested components
+ * @returns {TemplateChunk} template chunk object
+ */
+function componentTemplateFactory(template, components) {
+  return template(
+    createTemplate,
+    expressionTypes,
+    bindingTypes,
+    name => {
+      return components[name] || COMPONENTS_IMPLEMENTATION_MAP.get(name)
+    }
+  )
+}
+
+/**
+ * Create the component interface needed for the @riotjs/dom-bindings tag bindings
+ * @param   {string} options.css - component css
+ * @param   {Function} options.template - functon that will return the dom-bindings template function
+ * @param   {Object} options.exports - component interface
+ * @param   {string} options.name - component name
+ * @returns {Object} component like interface
+ */
+export function createComponent({css, template, exports, name}) {
+  const templateFn = template ? componentTemplateFactory(
+    template,
+    exports ? createSubcomponents(exports.components) : {}
+  ) : MOCKED_TEMPLATE_INTERFACE
+
+  return ({slots, attributes, props}) => {
+    const componentAPI = callOrAssign(exports) || {}
+
+    const component = defineComponent({
+      css,
+      template: templateFn,
+      componentAPI,
+      name
+    })({slots, attributes, props})
+
+    // notice that for the components create via tag binding
+    // we need to invert the mount (state/parentScope) arguments
+    // the template bindings will only forward the parentScope updates
+    // and never deal with the component state
+    return {
+      mount(element, parentScope, state) {
+        return component.mount(element, state, parentScope)
+      },
+      update(parentScope, state) {
+        return component.update(state, parentScope)
+      },
+      unmount(preserveRoot) {
+        return component.unmount(preserveRoot)
+      }
+    }
+  }
+}
+
+/**
+ * Component definition function
+ * @param   {Object} implementation - the componen implementation will be generated via compiler
+ * @param   {Object} component - the component initial properties
+ * @returns {Object} a new component implementation object
+ */
+export function defineComponent({css, template, componentAPI, name}) {
+  // add the component css into the DOM
+  if (css && name) cssManager.add(name, css)
+
+  return curry(enhanceComponentAPI)(defineProperties(
+    // set the component defaults without overriding the original component API
+    defineDefaults(componentAPI, {
+      ...COMPONENT_LIFECYCLE_METHODS,
+      state: {}
+    }), {
+      // defined during the component creation
+      slots: null,
+      root: null,
+      // these properties should not be overriden
+      ...COMPONENT_CORE_HELPERS,
+      name,
+      css,
+      template
+    })
+  )
+}
+
+/**
+ * Evaluate the component properties either from its real attributes or from its attribute expressions
+ * @param   {HTMLElement} element - component root
+ * @param   {Array}  attributeExpressions - attribute values generated via createAttributeBindings
+ * @returns {Object} attributes key value pairs
+ */
+function evaluateProps(element, attributeExpressions = []) {
+  return {
+    ...DOMattributesToObject(element),
+    ...evaluateAttributeExpressions(attributeExpressions)
+  }
+}
+
+/**
+ * Create the bindings to update the component attributes
+ * @param   {HTMLElement} node - node where we will bind the expressions
+ * @param   {Array} attributes - list of attribute bindings
+ * @returns {TemplateChunk} - template bindings object
+ */
+function createAttributeBindings(node, attributes = []) {
+  const expressions = attributes.map(a => createExpression(node, a))
+  const binding = {}
+
+  const updateValues = method => scope => {
+    expressions.forEach(e => e[method](scope))
+
+    return binding
+  }
+
+  return Object.assign(binding, {
+    expressions,
+    mount: updateValues('mount'),
+    update: updateValues('update'),
+    unmount: updateValues('unmount')
+  })
+}
+
+/**
+ * Create the subcomponents that can be included inside a tag in runtime
+ * @param   {Object} components - components imported in runtime
+ * @returns {Object} all the components transformed into Riot.Component factory functions
+ */
+function createSubcomponents(components = {}) {
+  return Object.entries(callOrAssign(components))
+    .reduce((acc, [key, value]) => {
+      acc[camelToDashCase(key)] = createComponent(value)
+      return acc
+    }, {})
+}
+
+/**
+ * Run the component instance through all the plugins set by the user
+ * @param   {Object} component - component instance
+ * @returns {Object} the component enhanced by the plugins
+ */
+function runPlugins(component) {
+  return [...PLUGINS_SET].reduce((c, fn) => fn(c) || c, component)
+}
+
+/**
+ * Compute the component current state merging it with its previous state
+ * @param   {Object} oldState - previous state object
+ * @param   {Object} newState - new state givent to the `update` call
+ * @returns {Object} new object state
+ */
+function computeState(oldState, newState) {
+  return {
+    ...oldState,
+    ...callOrAssign(newState)
+  }
+}
+
+/**
+ * Add eventually the "is" attribute to link this DOM node to its css
+ * @param {HTMLElement} element - target root node
+ * @param {string} name - name of the component mounted
+ * @returns {undefined} it's a void function
+ */
+function addCssHook(element, name) {
+  if (getName(element) !== name) {
+    setAttr(element, 'is', name)
+  }
+}
+
+/**
+ * Component creation factory function that will enhance the user provided API
+ * @param   {Object} component - a component implementation previously defined
+ * @param   {Array} options.slots - component slots generated via riot compiler
+ * @param   {Array} options.attributes - attribute expressions generated via riot compiler
+ * @returns {Riot.Component} a riot component instance
+ */
+export function enhanceComponentAPI(component, {slots, attributes, props}) {
+  const initialProps = callOrAssign(props)
+
+  return autobindMethods(
+    runPlugins(
+      defineProperties(Object.create(component), {
+        mount(element, state = {}, parentScope) {
+          this[ATTRIBUTES_KEY_SYMBOL] = createAttributeBindings(element, attributes).mount(parentScope)
+
+          this.props = Object.freeze({
+            ...initialProps,
+            ...evaluateProps(element, this[ATTRIBUTES_KEY_SYMBOL].expressions)
+          })
+
+          this.state = computeState(this.state, state)
+          this[TEMPLATE_KEY_SYMBOL] = this.template.createDOM(element).clone()
+
+          // link this object to the DOM node
+          element[DOM_COMPONENT_INSTANCE_PROPERTY] = this
+          // add eventually the 'is' attribute
+          component.name && addCssHook(element, component.name)
+
+          // define the root element
+          defineProperty(this, 'root', element)
+          // define the slots array
+          defineProperty(this, 'slots', slots)
+
+          // before mount lifecycle event
+          this.onBeforeMount(this.props, this.state)
+          // mount the template
+          this[TEMPLATE_KEY_SYMBOL].mount(element, this, parentScope)
+
+          this.onMounted(this.props, this.state)
+
+          return this
+        },
+        update(state = {}, parentScope) {
+          if (parentScope) {
+            this[ATTRIBUTES_KEY_SYMBOL].update(parentScope)
+          }
+
+          const newProps = evaluateProps(this.root, this[ATTRIBUTES_KEY_SYMBOL].expressions)
+
+          if (this.shouldUpdate(newProps, this.props) === false) return
+
+          this.props = Object.freeze({...initialProps, ...newProps})
+          this.state = computeState(this.state, state)
+
+          this.onBeforeUpdate(this.props, this.state)
+
+          this[TEMPLATE_KEY_SYMBOL].update(this, parentScope)
+          this.onUpdated(this.props, this.state)
+
+          return this
+        },
+        unmount(preserveRoot) {
+          this.onBeforeUnmount(this.props, this.state)
+          this[ATTRIBUTES_KEY_SYMBOL].unmount()
+          // if the preserveRoot is null the template html will be left untouched
+          // in that case the DOM cleanup will happen differently from a parent node
+          this[TEMPLATE_KEY_SYMBOL].unmount(this, {}, preserveRoot === null ? null : !preserveRoot)
+          this.onUnmounted(this.props, this.state)
+
+          return this
+        }
+      })
+    ),
+    Object.keys(component).filter(prop => isFunction(component[prop]))
+  )
+}
+
+/**
+ * Component initialization function starting from a DOM node
+ * @param   {HTMLElement} element - element to upgrade
+ * @param   {Object} initialProps - initial component properties
+ * @param   {string} componentName - component id
+ * @returns {Object} a new component instance bound to a DOM node
+ */
+export function mountComponent(element, initialProps, componentName) {
+  const name = componentName || getName(element)
+  if (!COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component named "${name}" was never registered`)
+
+  const component = COMPONENTS_IMPLEMENTATION_MAP.get(name)({ props: initialProps })
+
+  return component.mount(element)
+}
diff --git a/node_modules/riot/src/core/css-manager.js b/node_modules/riot/src/core/css-manager.js
new file mode 100644
index 0000000..5f78160
--- /dev/null
+++ b/node_modules/riot/src/core/css-manager.js
@@ -0,0 +1,69 @@
+import $ from 'bianco.query'
+import {set as setAttr} from 'bianco.attr'
+
+export const CSS_BY_NAME = new Map()
+export const STYLE_NODE_SELECTOR = 'style[riot]'
+
+// memoized curried function
+const getStyleNode = (style => {
+  return () => {
+    // lazy evaluation:
+    // if this function was already called before
+    // we return its cached result
+    if (style) return style
+
+    // create a new style element or use an existing one
+    // and cache it internally
+    style = $(STYLE_NODE_SELECTOR)[0] || document.createElement('style')
+    setAttr(style, 'type', 'text/css')
+
+    /* istanbul ignore next */
+    if (!style.parentNode) document.head.appendChild(style)
+
+    return style
+  }
+})()
+
+/**
+ * Object that will be used to inject and manage the css of every tag instance
+ */
+export default {
+  CSS_BY_NAME,
+  /**
+   * Save a tag style to be later injected into DOM
+   * @param { string } name - if it's passed we will map the css to a tagname
+   * @param { string } css - css string
+   * @returns {Object} self
+   */
+  add(name, css) {
+    if (!CSS_BY_NAME.has(name)) {
+      CSS_BY_NAME.set(name, css)
+      this.inject()
+    }
+
+    return this
+  },
+  /**
+   * Inject all previously saved tag styles into DOM
+   * innerHTML seems slow: http://jsperf.com/riot-insert-style
+   * @returns {Object} self
+   */
+  inject() {
+    getStyleNode().innerHTML = [...CSS_BY_NAME.values()].join('\n')
+    return this
+  },
+
+  /**
+   * Remove a tag style from the DOM
+   * @param {string} name a registered tagname
+   * @returns {Object} self
+   */
+  remove(name) {
+    if (CSS_BY_NAME.has(name)) {
+      CSS_BY_NAME.delete(name)
+      this.inject()
+    }
+
+    return this
+  }
+}
diff --git a/node_modules/riot/src/globals.js b/node_modules/riot/src/globals.js
new file mode 100644
index 0000000..8aa7c67
--- /dev/null
+++ b/node_modules/riot/src/globals.js
@@ -0,0 +1,8 @@
+export const
+  COMPONENTS_IMPLEMENTATION_MAP = new Map(),
+  DOM_COMPONENT_INSTANCE_PROPERTY = Symbol('riot-component'),
+  PLUGINS_SET = new Set(),
+  IS_DIRECTIVE = 'is',
+  VALUE_ATTRIBUTE = 'value',
+  ATTRIBUTES_KEY_SYMBOL = Symbol('attributes'),
+  TEMPLATE_KEY_SYMBOL = Symbol('template')
\ No newline at end of file
diff --git a/node_modules/riot/src/riot+compiler.js b/node_modules/riot/src/riot+compiler.js
new file mode 100644
index 0000000..2900a4e
--- /dev/null
+++ b/node_modules/riot/src/riot+compiler.js
@@ -0,0 +1,63 @@
+import * as riot from './riot'
+import $ from 'bianco.query'
+import compiler from '@riotjs/compiler/dist/compiler'
+import {get as getAttr} from 'bianco.attr'
+
+const GLOBAL_REGISTRY = '__riot_registry__'
+window[GLOBAL_REGISTRY] = {}
+
+// evaluates a compiled tag within the global context
+function evaluate(js, url) {
+  const node = document.createElement('script')
+  const root = document.documentElement
+
+  // make the source available in the "(no domain)" tab
+  // of Chrome DevTools, with a .js extension
+  if (url) node.text = `${js}\n//# sourceURL=${url}.js`
+
+  root.appendChild(node)
+  root.removeChild(node)
+}
+
+// cheap module transpilation
+function transpile(code) {
+  return `(function (global){${code}})(this)`.replace('export default', 'return')
+}
+
+function inject(code, tagName, url) {
+  evaluate(`window.${GLOBAL_REGISTRY}['${tagName}'] = ${transpile(code)}`, url)
+  riot.register(tagName, window[GLOBAL_REGISTRY][tagName])
+}
+
+function compileFromString(string, options) {
+  return compiler.compile(string, options)
+}
+
+async function compileFromUrl(url, options) {
+  const response = await fetch(url)
+  const code = await response.text()
+
+  return compiler.compile(code, { file: url, ...options })
+}
+
+async function compile(options) {
+  const scripts = $('script[type="riot"]')
+  const urls = scripts.map(s => getAttr(s, 'src') || getAttr(s, 'data-src'))
+  const tags = await Promise.all(urls.map(url => compileFromUrl(url, options)))
+
+  tags.forEach(({code, meta}, i) => {
+    const url = urls[i]
+    const {tagName} = meta
+
+    inject(code, tagName, url)
+  })
+}
+
+export default {
+  ...riot,
+  compile,
+  inject,
+  compileFromUrl,
+  compileFromString
+}
+
diff --git a/node_modules/riot/src/riot.js b/node_modules/riot/src/riot.js
new file mode 100644
index 0000000..540635a
--- /dev/null
+++ b/node_modules/riot/src/riot.js
@@ -0,0 +1,117 @@
+import * as globals from './globals'
+import {createComponent, defineComponent, mountComponent} from './core/component'
+import $ from 'bianco.query'
+import compose from 'cumpa'
+import cssManager from './core/css-manager'
+import {isFunction} from './utils/checks'
+import {panic} from './utils/misc'
+
+const { DOM_COMPONENT_INSTANCE_PROPERTY, COMPONENTS_IMPLEMENTATION_MAP, PLUGINS_SET } = globals
+
+/**
+ * Riot public api
+ */
+
+/**
+ * Register a custom tag by name
+ * @param   {string} name - component name
+ * @param   {Object} implementation - tag implementation
+ * @returns {Map} map containing all the components implementations
+ */
+export function register(name, {css, template, exports}) {
+  if (COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component "${name}" was already registered`)
+
+  COMPONENTS_IMPLEMENTATION_MAP.set(name, createComponent({name, css, template, exports}))
+
+  return COMPONENTS_IMPLEMENTATION_MAP
+}
+
+/**
+ * Unregister a riot web component
+ * @param   {string} name - component name
+ * @returns {Map} map containing all the components implementations
+ */
+export function unregister(name) {
+  if (!COMPONENTS_IMPLEMENTATION_MAP.has(name)) panic(`The component "${name}" was never registered`)
+
+  COMPONENTS_IMPLEMENTATION_MAP.delete(name)
+  cssManager.remove(name)
+
+  return COMPONENTS_IMPLEMENTATION_MAP
+}
+
+/**
+ * Mounting function that will work only for the components that were globally registered
+ * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+ * @param   {Object} initialProps - the initial component properties
+ * @param   {string} name - optional component name
+ * @returns {Array} list of nodes upgraded
+ */
+export function mount(selector, initialProps, name) {
+  return $(selector).map(element => mountComponent(element, initialProps, name))
+}
+
+/**
+ * Sweet unmounting helper function for the DOM node mounted manually by the user
+ * @param   {string|HTMLElement} selector - query for the selection or a DOM element
+ * @param   {boolean|null} keepRootElement - if true keep the root element
+ * @returns {Array} list of nodes unmounted
+ */
+export function unmount(selector, keepRootElement) {
+  return $(selector).map(element => {
+    if (element[DOM_COMPONENT_INSTANCE_PROPERTY]) {
+      element[DOM_COMPONENT_INSTANCE_PROPERTY].unmount(keepRootElement)
+    }
+    return element
+  })
+}
+
+/**
+ * Define a riot plugin
+ * @param   {Function} plugin - function that will receive all the components created
+ * @returns {Set} the set containing all the plugins installed
+ */
+export function install(plugin) {
+  if (!isFunction(plugin)) panic('Plugins must be of type function')
+  if (PLUGINS_SET.has(plugin)) panic('This plugin was already install')
+
+  PLUGINS_SET.add(plugin)
+
+  return PLUGINS_SET
+}
+
+/**
+ * Uninstall a riot plugin
+ * @param   {Function} plugin - plugin previously installed
+ * @returns {Set} the set containing all the plugins installed
+ */
+export function uninstall(plugin) {
+  if (!PLUGINS_SET.has(plugin)) panic('This plugin was never installed')
+
+  PLUGINS_SET.delete(plugin)
+
+  return PLUGINS_SET
+}
+
+/**
+ * Helpter method to create component without relying on the registered ones
+ * @param   {Object} implementation - component implementation
+ * @returns {Function} function that will allow you to mount a riot component on a DOM node
+ */
+export function component(implementation) {
+  return (el, props) => compose(
+    c => c.mount(el),
+    c => c({props}),
+    createComponent
+  )(implementation)
+}
+
+/** @type {string} current riot version */
+export const version = 'WIP'
+
+// expose some internal stuff that might be used from external tools
+export const __ = {
+  cssManager,
+  defineComponent,
+  globals
+}
diff --git a/node_modules/riot/src/utils/checks.js b/node_modules/riot/src/utils/checks.js
new file mode 100644
index 0000000..5cdb382
--- /dev/null
+++ b/node_modules/riot/src/utils/checks.js
@@ -0,0 +1,18 @@
+/**
+ * Quick type checking
+ * @param   {*} element - anything
+ * @param   {string} type - type definition
+ * @returns {boolean} true if the type corresponds
+ */
+export function checkType(element, type) {
+  return typeof element === type
+}
+
+/**
+ * Check that will be passed if its argument is a function
+ * @param   {*} value - value to check
+ * @returns {boolean} - true if the value is a function
+ */
+export function isFunction(value) {
+  return checkType(value, 'function')
+}
\ No newline at end of file
diff --git a/node_modules/riot/src/utils/dom.js b/node_modules/riot/src/utils/dom.js
new file mode 100644
index 0000000..e71b17e
--- /dev/null
+++ b/node_modules/riot/src/utils/dom.js
@@ -0,0 +1,24 @@
+import {IS_DIRECTIVE} from '../globals'
+import {dashToCamelCase} from './misc'
+import {get as getAttr} from 'bianco.attr'
+
+/**
+ * Get all the element attributes as object
+ * @param   {HTMLElement} element - DOM node we want to parse
+ * @returns {Object} all the attributes found as a key value pairs
+ */
+export function DOMattributesToObject(element) {
+  return Array.from(element.attributes).reduce((acc, attribute) => {
+    acc[dashToCamelCase(attribute.name)] = attribute.value
+    return acc
+  }, {})
+}
+
+/**
+ * Get the tag name of any DOM node
+ * @param   {HTMLElement} element - DOM node we want to inspect
+ * @returns {string} name to identify this dom node in riot
+ */
+export function getName(element) {
+  return getAttr(element, IS_DIRECTIVE) || element.tagName.toLowerCase()
+}
\ No newline at end of file
diff --git a/node_modules/riot/src/utils/misc.js b/node_modules/riot/src/utils/misc.js
new file mode 100644
index 0000000..d93004d
--- /dev/null
+++ b/node_modules/riot/src/utils/misc.js
@@ -0,0 +1,139 @@
+/* eslint-disable fp/no-mutating-methods */
+import {VALUE_ATTRIBUTE} from '../globals'
+import {expressionTypes} from '@riotjs/dom-bindings'
+import {isFunction} from './checks'
+
+/**
+ * Throw an error
+ * @param {string} error - error message
+ * @returns {undefined} it's a IO void function
+ */
+export function panic(error) {
+  throw new Error(error)
+}
+
+/**
+ * Call the first argument received only if it's a function otherwise return it as it is
+ * @param   {*} source - anything
+ * @returns {*} anything
+ */
+export function callOrAssign(source) {
+  return isFunction(source) ? (source.prototype && source.prototype.constructor ?
+    new source() : source()
+  ) : source
+}
+
+/**
+ * Convert a string from camel case to dash-case
+ * @param   {string} string - probably a component tag name
+ * @returns {string} component name normalized
+ */
+export function camelToDashCase(string) {
+  return string.replace(/([a-z])([A-Z])/g, '$1-$2').toLowerCase()
+}
+
+/**
+ * Convert a string containing dashes to camel case
+ * @param   {string} string - input string
+ * @returns {string} my-string -> myString
+ */
+export function dashToCamelCase(string) {
+  return string.replace(/-(\w)/g, (_, c) => c.toUpperCase())
+}
+
+/**
+ * Define default properties if they don't exist on the source object
+ * @param   {Object} source - object that will receive the default properties
+ * @param   {Object} defaults - object containing additional optional keys
+ * @returns {Object} the original object received enhanced
+ */
+export function defineDefaults(source, defaults) {
+  Object.entries(defaults).forEach(([key, value]) => {
+    if (!source[key]) source[key] = value
+  })
+
+  return source
+}
+
+// doese simply nothing
+export function noop() {
+  return this
+}
+
+/**
+ * Autobind the methods of a source object to itself
+ * @param   {Object} source - probably a riot tag instance
+ * @param   {Array<string>} methods - list of the methods to autobind
+ * @returns {Object} the original object received
+ */
+export function autobindMethods(source, methods) {
+  methods.forEach(method => {
+    source[method] = source[method].bind(source)
+  })
+
+  return source
+}
+
+/**
+ * Helper function to set an immutable property
+ * @param   {Object} source - object where the new property will be set
+ * @param   {string} key - object key where the new property will be stored
+ * @param   {*} value - value of the new property
+ * @param   {Object} options - set the propery overriding the default options
+ * @returns {Object} - the original object modified
+ */
+export function defineProperty(source, key, value, options = {}) {
+  Object.defineProperty(source, key, {
+    value,
+    enumerable: false,
+    writable: false,
+    configurable: true,
+    ...options
+  })
+
+  return source
+}
+
+/**
+ * Define multiple properties on a target object
+ * @param   {Object} source - object where the new properties will be set
+ * @param   {Object} properties - object containing as key pair the key + value properties
+ * @param   {Object} options - set the propery overriding the default options
+ * @returns {Object} the original object modified
+ */
+export function defineProperties(source, properties, options) {
+  Object.entries(properties).forEach(([key, value]) => {
+    defineProperty(source, key, value, options)
+  })
+
+  return source
+}
+
+/**
+ * Evaluate a list of attribute expressions
+ * @param   {Array} attributes - attribute expressions generated by the riot compiler
+ * @returns {Object} key value pairs with the result of the computation
+ */
+export function evaluateAttributeExpressions(attributes) {
+  return attributes.reduce((acc, attribute) => {
+    const {value, type} = attribute
+
+    switch (true) {
+    // spread attribute
+    case !attribute.name && type === expressionTypes.ATTRIBUTE:
+      return {
+        ...acc,
+        ...value
+      }
+    // value attribute
+    case type === expressionTypes.VALUE:
+      acc[VALUE_ATTRIBUTE] = attribute.value
+      break
+    // normal attributes
+    default:
+      acc[dashToCamelCase(attribute.name)] = attribute.value
+    }
+
+    return acc
+  }, {})
+}
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/.github/contributing.md b/node_modules/smooth-scroll/.github/contributing.md
new file mode 100644
index 0000000..6cf9168
--- /dev/null
+++ b/node_modules/smooth-scroll/.github/contributing.md
@@ -0,0 +1,17 @@
+# Bugs, Questions, and Feature Requests
+
+Report bugs, ask questions, and request features using [GitHub Issues](https://github.com/cferdinandi/smooth-scroll/issues).
+
+**Before posting, do a search to make sure your issue or question hasn't already been reported or discussed.** If no matching issue exists, go ahead and create one.
+
+**Please be sure to include all of the following:**
+
+1. A clear, descriptive title (ie. "A bug" is not a good title).
+2. [A reduced test case.](https://css-tricks.com/reduced-test-cases/)
+	- Clearly demonstrate the bug or issue.
+	- Include the bare minimum HTML, CSS, and JavaScript required to demonstrate the bug.
+	- A link to your production site is **not** a reduced test case.
+	- You can create one by [forking this CodePen](https://codepen.io/cferdinandi/pen/RqGLpz).
+3. The browser and OS that you're using.
+
+Duplicates and issues without a reduced test case may be closed without comment.
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/.github/issue_template.md b/node_modules/smooth-scroll/.github/issue_template.md
new file mode 100755
index 0000000..664bfaa
--- /dev/null
+++ b/node_modules/smooth-scroll/.github/issue_template.md
@@ -0,0 +1,3 @@
+<!-- Thanks for submitting an issue! All bug reports and problem issues require a **reduced test case**. Create one forking the CodePen linked below. See the guidelines link above for more details. -->
+
+**Test case:** https://codepen.io/cferdinandi/pen/RqGLpz
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/.github/main.workflow b/node_modules/smooth-scroll/.github/main.workflow
new file mode 100644
index 0000000..3f7dcd2
--- /dev/null
+++ b/node_modules/smooth-scroll/.github/main.workflow
@@ -0,0 +1,10 @@
+workflow "publish on release" {
+  on = "push"
+  resolves = ["publish"]
+}
+
+action "publish" {
+  uses = "actions/npm@master"
+  args = "publish"
+  secrets = ["NPM_AUTH_TOKEN"]
+}
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/.travis.yml b/node_modules/smooth-scroll/.travis.yml
new file mode 100755
index 0000000..09ce0fd
--- /dev/null
+++ b/node_modules/smooth-scroll/.travis.yml
@@ -0,0 +1,6 @@
+language: node_js
+node_js:
+  - "7"
+before_script:
+  - npm install -g gulp
+script: gulp
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/LICENSE.md b/node_modules/smooth-scroll/LICENSE.md
new file mode 100755
index 0000000..b5e8ef7
--- /dev/null
+++ b/node_modules/smooth-scroll/LICENSE.md
@@ -0,0 +1,21 @@
+# The MIT License (MIT)
+
+Copyright (c) Go Make Things, LLC
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/README.md b/node_modules/smooth-scroll/README.md
new file mode 100755
index 0000000..faf9895
--- /dev/null
+++ b/node_modules/smooth-scroll/README.md
@@ -0,0 +1,390 @@
+# Smooth Scroll [![Build Status](https://travis-ci.org/cferdinandi/smooth-scroll.svg)](https://travis-ci.org/cferdinandi/smooth-scroll)
+A lightweight script to animate scrolling to anchor links. Smooth Scroll works great with [Gumshoe](https://github.com/cferdinandi/gumshoe).
+
+**[View the Demo on CodePen &rarr;](https://codepen.io/cferdinandi/pen/wQzrdM)**
+
+[Getting Started](#getting-started) | [Scroll Speed](#scroll-speed) | [Easing Options](#easing-options) | [API](#api) | [What's new?](#whats-new) | [Known Issues](#known-issues) | [Browser Compatibility](#browser-compatibility) | [License](#license)
+
+*__Quick aside:__ you might not need this library. There's [a native CSS way to handle smooth scrolling](https://gomakethings.com/smooth-scrolling-links-with-only-css/) that might fit your needs.*
+
+
+<hr>
+
+### Want to learn how to write your own vanilla JS plugins? Check out my [Vanilla JS Pocket Guides](https://vanillajsguides.com/) or join the [Vanilla JS Academy](https://vanillajsacademy.com) and level-up as a web developer. 🚀
+
+<hr>
+
+
+## Getting Started
+
+Compiled and production-ready code can be found in the `dist` directory. The `src` directory contains development code.
+
+### 1. Include Smooth Scroll on your site.
+
+There are two versions of Smooth Scroll: the standalone version, and one that comes preloaded with polyfills for `closest()`, `requestAnimationFrame()`, and `CustomEvent()`, which are only supported in newer browsers.
+
+If you're including your own polyfills or don't want to enable this feature for older browsers, use the standalone version. Otherwise, use the version with polyfills.
+
+**Direct Download**
+
+You can [download the files directly from GitHub](https://github.com/cferdinandi/smooth-scroll/archive/master.zip).
+
+```html
+<script src="path/to/smooth-scroll.polyfills.min.js"></script>
+```
+
+**CDN**
+
+You can also use the [jsDelivr CDN](https://cdn.jsdelivr.net/gh/cferdinandi/smooth-scroll/dist/). I recommend linking to a specific version number or version range to prevent major updates from breaking your site. Smooth Scroll uses semantic versioning.
+
+```html
+<!-- Always get the latest version -->
+<!-- Not recommended for production sites! -->
+<script src="https://cdn.jsdelivr.net/gh/cferdinandi/smooth-scroll/dist/smooth-scroll.polyfills.min.js"></script>
+
+<!-- Get minor updates and patch fixes within a major version -->
+<script src="https://cdn.jsdelivr.net/gh/cferdinandi/smooth-scroll@15/dist/smooth-scroll.polyfills.min.js"></script>
+
+<!-- Get patch fixes within a minor version -->
+<script src="https://cdn.jsdelivr.net/gh/cferdinandi/smooth-scroll@15.0/dist/smooth-scroll.polyfills.min.js"></script>
+
+<!-- Get a specific version -->
+<script src="https://cdn.jsdelivr.net/gh/cferdinandi/smooth-scroll@15.0.0/dist/smooth-scroll.polyfills.min.js"></script>
+```
+
+**NPM**
+
+You can also use NPM (or your favorite package manager).
+
+```bash
+npm install smooth-scroll
+```
+
+### 2. Add the markup to your HTML.
+
+No special markup needed&mdash;just standard anchor links. Give the anchor location an ID just like you normally would.
+
+```html
+<a data-scroll href="#bazinga">Anchor Link</a>
+...
+<div id="bazinga">Bazinga!</div>
+```
+
+***Note:*** *Smooth Scroll does not work with `<a name="anchor"></a>` style anchors. It requires IDs.*
+
+### 3. Initialize Smooth Scroll.
+
+In the footer of your page, after the content, initialize Smooth Scroll by passing in a selector for the anchor links that should be animated. And that's it, you're done. Nice work!
+
+```html
+<script>
+	var scroll = new SmoothScroll('a[href*="#"]');
+</script>
+```
+
+***Note:*** *The `a[href*="#"]` selector will apply Smooth Scroll to all anchor links. You can selectively target links using any other selector(s) you'd like. Smooth Scroll accepts multiple selectors as a comma separated list. Example: `'.js-scroll, [data-scroll], #some-link'`.*
+
+
+
+## Scroll Speed
+
+Smooth Scroll allows you to adjust the speed of your animations with the `speed` option.
+
+This a number representing the amount of time in milliseconds that it should take to scroll 1000px. Scroll distances shorter than that will take less time, and scroll distances longer than that will take more time. The default is 300ms.
+
+```js
+var scroll = new SmoothScroll('a[href*="#"]', {
+	speed: 300
+});
+```
+
+If you want all of your animations to take exactly the same amount of time (the value you set for `speed`), set the `speedAsDuration` option to `true`.
+
+```js
+// All animations will take exactly 500ms
+var scroll = new SmoothScroll('a[href*="#"]', {
+	speed: 500,
+	speedAsDuration: true
+});
+```
+
+
+## Easing Options
+
+Smooth Scroll comes with about a dozen common easing patterns. [Here's a demo of the different patterns.](https://codepen.io/cferdinandi/pen/jQMGaB)
+
+**Linear**
+*Moves at the same speed from start to finish.*
+
+- `Linear`
+
+
+**Ease-In**
+*Gradually increases in speed.*
+
+- `easeInQuad`
+- `easeInCubic`
+- `easeInQuart`
+- `easeInQuint`
+
+
+**Ease-In-Out**
+*Gradually increases in speed, peaks, and then gradually slows down.*
+
+- `easeInOutQuad`
+- `easeInOutCubic`
+- `easeInOutQuart`
+- `easeInOutQuint`
+
+
+**Ease-Out**
+*Gradually decreases in speed.*
+
+- `easeOutQuad`
+- `easeOutCubic`
+- `easeOutQuart`
+- `easeOutQuint`
+
+
+You can also pass in your own custom easing pattern [using the `customEasing` option](#global-settings).
+
+```js
+var scroll = new SmoothScroll('a[href*="#"]', {
+	// Function. Custom easing pattern
+	// If this is set to anything other than null, will override the easing option above
+	customEasing: function (time) {
+
+		// return <your formulate with time as a multiplier>
+
+		// Example: easeInOut Quad
+		return time < 0.5 ? 2 * time * time : -1 + (4 - 2 * time) * time;
+
+	}
+});
+```
+
+
+
+## API
+
+Smooth Scroll includes smart defaults and works right out of the box. But if you want to customize things, it also has a robust API that provides multiple ways for you to adjust the default options and settings.
+
+### Options and Settings
+
+You can pass options and callbacks into Smooth Scroll when instantiating.
+
+```javascript
+var scroll = new SmoothScroll('a[href*="#"]', {
+
+	// Selectors
+	ignore: '[data-scroll-ignore]', // Selector for links to ignore (must be a valid CSS selector)
+	header: null, // Selector for fixed headers (must be a valid CSS selector)
+	topOnEmptyHash: true, // Scroll to the top of the page for links with href="#"
+
+	// Speed & Duration
+	speed: 500, // Integer. Amount of time in milliseconds it should take to scroll 1000px
+	speedAsDuration: false, // If true, use speed as the total duration of the scroll animation
+	durationMax: null, // Integer. The maximum amount of time the scroll animation should take
+	durationMin: null, // Integer. The minimum amount of time the scroll animation should take
+	clip: true, // If true, adjust scroll distance to prevent abrupt stops near the bottom of the page
+	offset: function (anchor, toggle) {
+
+		// Integer or Function returning an integer. How far to offset the scrolling anchor location in pixels
+		// This example is a function, but you could do something as simple as `offset: 25`
+
+		// An example returning different values based on whether the clicked link was in the header nav or not
+		if (toggle.classList.closest('.my-header-nav')) {
+			return 25;
+		} else {
+			return 50;
+		}
+
+	},
+
+	// Easing
+	easing: 'easeInOutCubic', // Easing pattern to use
+	customEasing: function (time) {
+
+		// Function. Custom easing pattern
+		// If this is set to anything other than null, will override the easing option above
+
+		// return <your formulate with time as a multiplier>
+
+		// Example: easeInOut Quad
+		return time < 0.5 ? 2 * time * time : -1 + (4 - 2 * time) * time;
+
+	},
+
+	// History
+	updateURL: true, // Update the URL on scroll
+	popstate: true, // Animate scrolling with the forward/backward browser buttons (requires updateURL to be true)
+
+	// Custom Events
+	emitEvents: true // Emit custom events
+
+});
+```
+
+### Custom Events
+
+Smooth Scroll emits three custom events:
+
+- `scrollStart` is emitted when the scrolling animation starts.
+- `scrollStop` is emitted when the scrolling animation stops.
+- `scrollCancel` is emitted if the scrolling animation is canceled.
+
+All three events are emitted on the `document` element and bubble up. You can listen for them with the `addEventListener()` method. The `event.detail` object includes the `anchor` and `toggle` elements for the animation.
+
+```js
+// Log scroll events
+var logScrollEvent = function (event) {
+
+	// The event type
+	console.log('type:', event.type);
+
+	// The anchor element being scrolled to
+	console.log('anchor:', event.detail.anchor);
+
+	// The anchor link that triggered the scroll
+	console.log('toggle:', event.detail.toggle);
+
+};
+
+// Listen for scroll events
+document.addEventListener('scrollStart', logScrollEvent, false);
+document.addEventListener('scrollStop', logScrollEvent, false);
+document.addEventListener('scrollCancel', logScrollEvent, false);
+```
+
+### Methods
+
+Smooth Scroll also exposes several public methods.
+
+#### animateScroll()
+Animate scrolling to an anchor.
+
+```javascript
+var scroll = new SmoothScroll();
+scroll.animateScroll(
+	anchor, // Node to scroll to. ex. document.querySelector('#bazinga')
+	toggle, // Node that toggles the animation, OR an integer. ex. document.querySelector('#toggle')
+	options // Classes and callbacks. Same options as those passed into the init() function.
+);
+```
+
+**Example 1**
+
+```javascript
+var scroll = new SmoothScroll();
+var anchor = document.querySelector('#bazinga');
+scroll.animateScroll(anchor);
+```
+
+**Example 2**
+
+```javascript
+var scroll = new SmoothScroll();
+var anchor = document.querySelector('#bazinga');
+var toggle = document.querySelector('#toggle');
+var options = { speed: 1000, easing: 'easeOutCubic' };
+scroll.animateScroll(anchor, toggle, options);
+```
+
+**Example 3**
+
+```javascript
+// You can optionally pass in a y-position to scroll to as an integer
+var scroll = new SmoothScroll();
+scroll.animateScroll(750);
+```
+
+#### cancelScroll()
+Cancel a scroll-in-progress.
+
+```javascript
+var scroll = new SmoothScroll();
+scroll.cancelScroll();
+```
+
+***Note:*** *This does not handle focus management. The user will stop in place, and focus will remain on the anchor link that triggered the scroll.*
+
+#### destroy()
+Destroy the current initialization. This is called automatically in the `init` method to remove any existing initializations.
+
+```javascript
+var scroll = new SmoothScroll();
+scroll.destroy();
+```
+
+
+### Fixed Headers
+
+If you're using a fixed header, Smooth Scroll will automatically offset scroll distances by the header height. Pass in a valid CSS selector for your fixed header as an option to the `init`.
+
+If you have multiple fixed headers, pass in the last one in the markup.
+
+```html
+<nav data-scroll-header>
+	...
+</nav>
+...
+<script>
+	var scroll = new SmoothScroll('.some-selector',{
+		header: '[data-scroll-header]'
+	});
+</script>
+```
+
+
+
+## What's new?
+
+Scroll duration now varies based on distance traveled. If you want to maintain the old scroll animation duration behavior, set the `speedAsDuration` option to `true`.
+
+
+
+## Known Issues
+
+### Reduce Motion Settings
+
+This isn't really an "issue" so-much as a question I get a lot.
+
+Smooth Scroll respects [the `Reduce Motion` setting](https://developer.mozilla.org/en-US/docs/Web/CSS/@media/prefers-reduced-motion) available in certain operating systems. In browsers that surface that setting, Smooth Scroll will not run and will revert to the default "jump to location" anchor link behavior.
+
+I've decided to respect user preferences of developer desires here. This is *not* a configurable setting.
+
+### `<body>` styling
+
+If the `<body>` element has been assigned a height of `100%` or `overflow: hidden`, Smooth Scroll is unable to properly calculate page distances and will not scroll to the right location. The `<body>` element can have a fixed, non-percentage based height (ex. `500px`), or a height of `auto`, and an `overflow` of `visible`.
+
+### Animating from the bottom
+
+Animated scrolling links at the very bottom of the page (example: a "scroll to top" link) will stop animated almost immediately after they start when using certain easing patterns. This is an issue that's been around for a while and I've yet to find a good fix for it. I've found that `easeOut*` easing patterns work as expected, but other patterns can cause issues. [See this discussion for more details.](https://github.com/cferdinandi/smooth-scroll/issues/49)
+
+### Scrolling to an anchor link on another page
+
+This, unfortunately, cannot be done well.
+
+Most browsers instantly jump you to the anchor location when you load a page. You could use `scrollTo(0, 0)` to pull users back up to the top, and then manually use the `animateScroll()` method, but in my experience, it results in a visible jump on the page that's a worse experience than the default browser behavior.
+
+
+
+## Browser Compatibility
+
+Smooth Scroll works in all modern browsers, and IE 9 and above.
+
+Smooth Scroll is built with modern JavaScript APIs, and uses progressive enhancement. If the JavaScript file fails to load, or if your site is viewed on older and less capable browsers, anchor links will jump the way they normally would.
+
+*__Note:__ Smooth Scroll will not run&mdash;even in supported browsers&mdash;if users have `Reduce Motion` enabled. [Learn more in the "Known Issues" section.](#reduce-motion-settings)*
+
+### Polyfills
+
+Support back to IE9 requires polyfills for `closest()`, `requestAnimationFrame()`, and `CustomEvent()`. Without them, support starts with Edge.
+
+Use the included polyfills version of Smooth Scroll, or include your own.
+
+
+
+## License
+
+The code is available under the [MIT License](LICENSE.md).
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/dist/smooth-scroll.js b/node_modules/smooth-scroll/dist/smooth-scroll.js
new file mode 100755
index 0000000..21fbd11
--- /dev/null
+++ b/node_modules/smooth-scroll/dist/smooth-scroll.js
@@ -0,0 +1,645 @@
+/*!
+ * smooth-scroll v16.1.0
+ * Animate scrolling to anchor links
+ * (c) 2019 Chris Ferdinandi
+ * MIT License
+ * http://github.com/cferdinandi/smooth-scroll
+ */
+
+(function (root, factory) {
+	if (typeof define === 'function' && define.amd) {
+		define([], (function () {
+			return factory(root);
+		}));
+	} else if (typeof exports === 'object') {
+		module.exports = factory(root);
+	} else {
+		root.SmoothScroll = factory(root);
+	}
+})(typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : this, (function (window) {
+
+	'use strict';
+
+	//
+	// Default settings
+	//
+
+	var defaults = {
+
+		// Selectors
+		ignore: '[data-scroll-ignore]',
+		header: null,
+		topOnEmptyHash: true,
+
+		// Speed & Duration
+		speed: 500,
+		speedAsDuration: false,
+		durationMax: null,
+		durationMin: null,
+		clip: true,
+		offset: 0,
+
+		// Easing
+		easing: 'easeInOutCubic',
+		customEasing: null,
+
+		// History
+		updateURL: true,
+		popstate: true,
+
+		// Custom Events
+		emitEvents: true
+
+	};
+
+
+	//
+	// Utility Methods
+	//
+
+	/**
+	 * Check if browser supports required methods
+	 * @return {Boolean} Returns true if all required methods are supported
+	 */
+	var supports = function () {
+		return (
+			'querySelector' in document &&
+			'addEventListener' in window &&
+			'requestAnimationFrame' in window &&
+			'closest' in window.Element.prototype
+		);
+	};
+
+	/**
+	 * Merge two or more objects together.
+	 * @param   {Object}   objects  The objects to merge together
+	 * @returns {Object}            Merged values of defaults and options
+	 */
+	var extend = function () {
+		var merged = {};
+		Array.prototype.forEach.call(arguments, (function (obj) {
+			for (var key in obj) {
+				if (!obj.hasOwnProperty(key)) return;
+				merged[key] = obj[key];
+			}
+		}));
+		return merged;
+	};
+
+	/**
+	 * Check to see if user prefers reduced motion
+	 * @param  {Object} settings Script settings
+	 */
+	var reduceMotion = function () {
+		if ('matchMedia' in window && window.matchMedia('(prefers-reduced-motion)').matches) {
+			return true;
+		}
+		return false;
+	};
+
+	/**
+	 * Get the height of an element.
+	 * @param  {Node} elem The element to get the height of
+	 * @return {Number}    The element's height in pixels
+	 */
+	var getHeight = function (elem) {
+		return parseInt(window.getComputedStyle(elem).height, 10);
+	};
+
+	/**
+	 * Escape special characters for use with querySelector
+	 * @author Mathias Bynens
+	 * @link https://github.com/mathiasbynens/CSS.escape
+	 * @param {String} id The anchor ID to escape
+	 */
+	var escapeCharacters = function (id) {
+
+		// Remove leading hash
+		if (id.charAt(0) === '#') {
+			id = id.substr(1);
+		}
+
+		var string = String(id);
+		var length = string.length;
+		var index = -1;
+		var codeUnit;
+		var result = '';
+		var firstCodeUnit = string.charCodeAt(0);
+		while (++index < length) {
+			codeUnit = string.charCodeAt(index);
+			// Note: there’s no need to special-case astral symbols, surrogate
+			// pairs, or lone surrogates.
+
+			// If the character is NULL (U+0000), then throw an
+			// `InvalidCharacterError` exception and terminate these steps.
+			if (codeUnit === 0x0000) {
+				throw new InvalidCharacterError(
+					'Invalid character: the input contains U+0000.'
+				);
+			}
+
+			if (
+				// If the character is in the range [\1-\1F] (U+0001 to U+001F) or is
+				// U+007F, […]
+				(codeUnit >= 0x0001 && codeUnit <= 0x001F) || codeUnit == 0x007F ||
+				// If the character is the first character and is in the range [0-9]
+				// (U+0030 to U+0039), […]
+				(index === 0 && codeUnit >= 0x0030 && codeUnit <= 0x0039) ||
+				// If the character is the second character and is in the range [0-9]
+				// (U+0030 to U+0039) and the first character is a `-` (U+002D), […]
+				(
+					index === 1 &&
+					codeUnit >= 0x0030 && codeUnit <= 0x0039 &&
+					firstCodeUnit === 0x002D
+				)
+			) {
+				// http://dev.w3.org/csswg/cssom/#escape-a-character-as-code-point
+				result += '\\' + codeUnit.toString(16) + ' ';
+				continue;
+			}
+
+			// If the character is not handled by one of the above rules and is
+			// greater than or equal to U+0080, is `-` (U+002D) or `_` (U+005F), or
+			// is in one of the ranges [0-9] (U+0030 to U+0039), [A-Z] (U+0041 to
+			// U+005A), or [a-z] (U+0061 to U+007A), […]
+			if (
+				codeUnit >= 0x0080 ||
+				codeUnit === 0x002D ||
+				codeUnit === 0x005F ||
+				codeUnit >= 0x0030 && codeUnit <= 0x0039 ||
+				codeUnit >= 0x0041 && codeUnit <= 0x005A ||
+				codeUnit >= 0x0061 && codeUnit <= 0x007A
+			) {
+				// the character itself
+				result += string.charAt(index);
+				continue;
+			}
+
+			// Otherwise, the escaped character.
+			// http://dev.w3.org/csswg/cssom/#escape-a-character
+			result += '\\' + string.charAt(index);
+
+		}
+
+		// Return sanitized hash
+		return '#' + result;
+
+	};
+
+	/**
+	 * Calculate the easing pattern
+	 * @link https://gist.github.com/gre/1650294
+	 * @param {String} type Easing pattern
+	 * @param {Number} time Time animation should take to complete
+	 * @returns {Number}
+	 */
+	var easingPattern = function (settings, time) {
+		var pattern;
+
+		// Default Easing Patterns
+		if (settings.easing === 'easeInQuad') pattern = time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuad') pattern = time * (2 - time); // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuad') pattern = time < 0.5 ? 2 * time * time : -1 + (4 - 2 * time) * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInCubic') pattern = time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutCubic') pattern = (--time) * time * time + 1; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutCubic') pattern = time < 0.5 ? 4 * time * time * time : (time - 1) * (2 * time - 2) * (2 * time - 2) + 1; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuart') pattern = time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuart') pattern = 1 - (--time) * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuart') pattern = time < 0.5 ? 8 * time * time * time * time : 1 - 8 * (--time) * time * time * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuint') pattern = time * time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuint') pattern = 1 + (--time) * time * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuint') pattern = time < 0.5 ? 16 * time * time * time * time * time : 1 + 16 * (--time) * time * time * time * time; // acceleration until halfway, then deceleration
+
+		// Custom Easing Patterns
+		if (!!settings.customEasing) pattern = settings.customEasing(time);
+
+		return pattern || time; // no easing, no acceleration
+	};
+
+	/**
+	 * Determine the document's height
+	 * @returns {Number}
+	 */
+	var getDocumentHeight = function () {
+		return Math.max(
+			document.body.scrollHeight, document.documentElement.scrollHeight,
+			document.body.offsetHeight, document.documentElement.offsetHeight,
+			document.body.clientHeight, document.documentElement.clientHeight
+		);
+	};
+
+	/**
+	 * Calculate how far to scroll
+	 * Clip support added by robjtede - https://github.com/cferdinandi/smooth-scroll/issues/405
+	 * @param {Element} anchor       The anchor element to scroll to
+	 * @param {Number}  headerHeight Height of a fixed header, if any
+	 * @param {Number}  offset       Number of pixels by which to offset scroll
+	 * @param {Boolean} clip         If true, adjust scroll distance to prevent abrupt stops near the bottom of the page
+	 * @returns {Number}
+	 */
+	var getEndLocation = function (anchor, headerHeight, offset, clip) {
+		var location = 0;
+		if (anchor.offsetParent) {
+			do {
+				location += anchor.offsetTop;
+				anchor = anchor.offsetParent;
+			} while (anchor);
+		}
+		location = Math.max(location - headerHeight - offset, 0);
+		if (clip) {
+			location = Math.min(location, getDocumentHeight() - window.innerHeight);
+		}
+ 		return location;
+	};
+
+	/**
+	 * Get the height of the fixed header
+	 * @param  {Node}   header The header
+	 * @return {Number}        The height of the header
+	 */
+	var getHeaderHeight = function (header) {
+		return !header ? 0 : (getHeight(header) + header.offsetTop);
+	};
+
+	/**
+	 * Calculate the speed to use for the animation
+	 * @param  {Number} distance The distance to travel
+	 * @param  {Object} settings The plugin settings
+	 * @return {Number}          How fast to animate
+	 */
+	var getSpeed = function (distance, settings) {
+		var speed = settings.speedAsDuration ? settings.speed : Math.abs(distance / 1000 * settings.speed);
+		if (settings.durationMax && speed > settings.durationMax) return settings.durationMax;
+		if (settings.durationMin && speed < settings.durationMin) return settings.durationMin;
+		return parseInt(speed, 10);
+	};
+
+	var setHistory = function (options) {
+
+		// Make sure this should run
+		if (!history.replaceState || !options.updateURL || history.state) return;
+
+		// Get the hash to use
+		var hash = window.location.hash;
+		hash = hash ? hash : '';
+
+		// Set a default history
+		history.replaceState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: hash ? hash : window.pageYOffset
+			},
+			document.title,
+			hash ? hash : window.location.href
+		);
+
+	};
+
+	/**
+	 * Update the URL
+	 * @param  {Node}    anchor  The anchor that was scrolled to
+	 * @param  {Boolean} isNum   If true, anchor is a number
+	 * @param  {Object}  options Settings for Smooth Scroll
+	 */
+	var updateURL = function (anchor, isNum, options) {
+
+		// Bail if the anchor is a number
+		if (isNum) return;
+
+		// Verify that pushState is supported and the updateURL option is enabled
+		if (!history.pushState || !options.updateURL) return;
+
+		// Update URL
+		history.pushState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: anchor.id
+			},
+			document.title,
+			anchor === document.documentElement ? '#top' : '#' + anchor.id
+		);
+
+	};
+
+	/**
+	 * Bring the anchored element into focus
+	 * @param {Node}     anchor      The anchor element
+	 * @param {Number}   endLocation The end location to scroll to
+	 * @param {Boolean}  isNum       If true, scroll is to a position rather than an element
+	 */
+	var adjustFocus = function (anchor, endLocation, isNum) {
+
+		// Is scrolling to top of page, blur
+		if (anchor === 0) {
+			document.body.focus();
+		}
+
+		// Don't run if scrolling to a number on the page
+		if (isNum) return;
+
+		// Otherwise, bring anchor element into focus
+		anchor.focus();
+		if (document.activeElement !== anchor) {
+			anchor.setAttribute('tabindex', '-1');
+			anchor.focus();
+			anchor.style.outline = 'none';
+		}
+		window.scrollTo(0 , endLocation);
+
+	};
+
+	/**
+	 * Emit a custom event
+	 * @param  {String} type    The event type
+	 * @param  {Object} options The settings object
+	 * @param  {Node}   anchor  The anchor element
+	 * @param  {Node}   toggle  The toggle element
+	 */
+	var emitEvent = function (type, options, anchor, toggle) {
+		if (!options.emitEvents || typeof window.CustomEvent !== 'function') return;
+		var event = new CustomEvent(type, {
+			bubbles: true,
+			detail: {
+				anchor: anchor,
+				toggle: toggle
+			}
+		});
+		document.dispatchEvent(event);
+	};
+
+
+	//
+	// SmoothScroll Constructor
+	//
+
+	var SmoothScroll = function (selector, options) {
+
+		//
+		// Variables
+		//
+
+		var smoothScroll = {}; // Object for public APIs
+		var settings, anchor, toggle, fixedHeader, eventTimeout, animationInterval;
+
+
+		//
+		// Methods
+		//
+
+		/**
+		 * Cancel a scroll-in-progress
+		 */
+		smoothScroll.cancelScroll = function (noEvent) {
+			cancelAnimationFrame(animationInterval);
+			animationInterval = null;
+			if (noEvent) return;
+			emitEvent('scrollCancel', settings);
+		};
+
+		/**
+		 * Start/stop the scrolling animation
+		 * @param {Node|Number} anchor  The element or position to scroll to
+		 * @param {Element}     toggle  The element that toggled the scroll event
+		 * @param {Object}      options
+		 */
+		smoothScroll.animateScroll = function (anchor, toggle, options) {
+
+			// Cancel any in progress scrolls
+			smoothScroll.cancelScroll();
+
+			// Local settings
+			var _settings = extend(settings || defaults, options || {}); // Merge user options with defaults
+
+			// Selectors and variables
+			var isNum = Object.prototype.toString.call(anchor) === '[object Number]' ? true : false;
+			var anchorElem = isNum || !anchor.tagName ? null : anchor;
+			if (!isNum && !anchorElem) return;
+			var startLocation = window.pageYOffset; // Current location on the page
+			if (_settings.header && !fixedHeader) {
+				// Get the fixed header if not already set
+				fixedHeader = document.querySelector(_settings.header);
+			}
+			var headerHeight = getHeaderHeight(fixedHeader);
+			var endLocation = isNum ? anchor : getEndLocation(anchorElem, headerHeight, parseInt((typeof _settings.offset === 'function' ? _settings.offset(anchor, toggle) : _settings.offset), 10), _settings.clip); // Location to scroll to
+			var distance = endLocation - startLocation; // distance to travel
+			var documentHeight = getDocumentHeight();
+			var timeLapsed = 0;
+			var speed = getSpeed(distance, _settings);
+			var start, percentage, position;
+
+			/**
+			 * Stop the scroll animation when it reaches its target (or the bottom/top of page)
+			 * @param {Number} position Current position on the page
+			 * @param {Number} endLocation Scroll to location
+			 * @param {Number} animationInterval How much to scroll on this loop
+			 */
+			var stopAnimateScroll = function (position, endLocation) {
+
+				// Get the current location
+				var currentLocation = window.pageYOffset;
+
+				// Check if the end location has been reached yet (or we've hit the end of the document)
+				if (position == endLocation || currentLocation == endLocation || ((startLocation < endLocation && window.innerHeight + currentLocation) >= documentHeight)) {
+
+					// Clear the animation timer
+					smoothScroll.cancelScroll(true);
+
+					// Bring the anchored element into focus
+					adjustFocus(anchor, endLocation, isNum);
+
+					// Emit a custom event
+					emitEvent('scrollStop', _settings, anchor, toggle);
+
+					// Reset start
+					start = null;
+					animationInterval = null;
+
+					return true;
+
+				}
+			};
+
+			/**
+			 * Loop scrolling animation
+			 */
+			var loopAnimateScroll = function (timestamp) {
+				if (!start) { start = timestamp; }
+				timeLapsed += timestamp - start;
+				percentage = speed === 0 ? 0 : (timeLapsed / speed);
+				percentage = (percentage > 1) ? 1 : percentage;
+				position = startLocation + (distance * easingPattern(_settings, percentage));
+				window.scrollTo(0, Math.floor(position));
+				if (!stopAnimateScroll(position, endLocation)) {
+					animationInterval = window.requestAnimationFrame(loopAnimateScroll);
+					start = timestamp;
+				}
+			};
+
+			/**
+			 * Reset position to fix weird iOS bug
+			 * @link https://github.com/cferdinandi/smooth-scroll/issues/45
+			 */
+			if (window.pageYOffset === 0) {
+				window.scrollTo(0, 0);
+			}
+
+			// Update the URL
+			updateURL(anchor, isNum, _settings);
+
+			// If the user prefers reduced motion, jump to location
+			if (reduceMotion()) {
+				window.scrollTo(0, Math.floor(endLocation));
+				return;
+			}
+
+			// Emit a custom event
+			emitEvent('scrollStart', _settings, anchor, toggle);
+
+			// Start scrolling animation
+			smoothScroll.cancelScroll(true);
+			window.requestAnimationFrame(loopAnimateScroll);
+
+		};
+
+		/**
+		 * If smooth scroll element clicked, animate scroll
+		 */
+		var clickHandler = function (event) {
+
+			// Don't run if event was canceled but still bubbled up
+			// By @mgreter - https://github.com/cferdinandi/smooth-scroll/pull/462/
+			if (event.defaultPrevented) return;
+
+			// Don't run if right-click or command/control + click or shift + click
+			if (event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey) return;
+
+			// Check if event.target has closest() method
+			// By @totegi - https://github.com/cferdinandi/smooth-scroll/pull/401/
+			if (!('closest' in event.target)) return;
+
+			// Check if a smooth scroll link was clicked
+			toggle = event.target.closest(selector);
+			if (!toggle || toggle.tagName.toLowerCase() !== 'a' || event.target.closest(settings.ignore)) return;
+
+			// Only run if link is an anchor and points to the current page
+			if (toggle.hostname !== window.location.hostname || toggle.pathname !== window.location.pathname || !/#/.test(toggle.href)) return;
+
+			// Get an escaped version of the hash
+			var hash = escapeCharacters(toggle.hash);
+
+			// Get the anchored element
+			var anchor;
+			if (hash === '#') {
+				if (!settings.topOnEmptyHash) return;
+				anchor = document.documentElement;
+			} else {
+				anchor = document.querySelector(hash);
+			}
+			anchor = !anchor && hash === '#top' ? document.documentElement : anchor;
+
+			// If anchored element exists, scroll to it
+			if (!anchor) return;
+			event.preventDefault();
+			setHistory(settings);
+			smoothScroll.animateScroll(anchor, toggle);
+
+		};
+
+		/**
+		 * Animate scroll on popstate events
+		 */
+		var popstateHandler = function (event) {
+
+			// Stop if history.state doesn't exist (ex. if clicking on a broken anchor link).
+			// fixes `Cannot read property 'smoothScroll' of null` error getting thrown.
+			if (history.state === null) return;
+
+			// Only run if state is a popstate record for this instantiation
+			if (!history.state.smoothScroll || history.state.smoothScroll !== JSON.stringify(settings)) return;
+
+			// Only run if state includes an anchor
+
+			// if (!history.state.anchor && history.state.anchor !== 0) return;
+
+			// Get the anchor
+			var anchor = history.state.anchor;
+			if (typeof anchor === 'string' && anchor) {
+				anchor = document.querySelector(escapeCharacters(history.state.anchor));
+				if (!anchor) return;
+			}
+
+			// Animate scroll to anchor link
+			smoothScroll.animateScroll(anchor, null, {updateURL: false});
+
+		};
+
+		/**
+		 * Destroy the current initialization.
+		 */
+		smoothScroll.destroy = function () {
+
+			// If plugin isn't already initialized, stop
+			if (!settings) return;
+
+			// Remove event listeners
+			document.removeEventListener('click', clickHandler, false);
+			window.removeEventListener('popstate', popstateHandler, false);
+
+			// Cancel any scrolls-in-progress
+			smoothScroll.cancelScroll();
+
+			// Reset variables
+			settings = null;
+			anchor = null;
+			toggle = null;
+			fixedHeader = null;
+			eventTimeout = null;
+			animationInterval = null;
+
+		};
+
+		/**
+		 * Initialize Smooth Scroll
+		 * @param {Object} options User settings
+		 */
+		var init = function () {
+
+			// feature test
+			if (!supports()) throw 'Smooth Scroll: This browser does not support the required JavaScript methods and browser APIs.';
+
+			// Destroy any existing initializations
+			smoothScroll.destroy();
+
+			// Selectors and variables
+			settings = extend(defaults, options || {}); // Merge user options with defaults
+			fixedHeader = settings.header ? document.querySelector(settings.header) : null; // Get the fixed header
+
+			// When a toggle is clicked, run the click handler
+			document.addEventListener('click', clickHandler, false);
+
+			// If updateURL and popState are enabled, listen for pop events
+			if (settings.updateURL && settings.popstate) {
+				window.addEventListener('popstate', popstateHandler, false);
+			}
+
+		};
+
+
+		//
+		// Initialize plugin
+		//
+
+		init();
+
+
+		//
+		// Public APIs
+		//
+
+		return smoothScroll;
+
+	};
+
+	return SmoothScroll;
+
+}));
diff --git a/node_modules/smooth-scroll/dist/smooth-scroll.min.js b/node_modules/smooth-scroll/dist/smooth-scroll.min.js
new file mode 100755
index 0000000..b1d6908
--- /dev/null
+++ b/node_modules/smooth-scroll/dist/smooth-scroll.min.js
@@ -0,0 +1,2 @@
+/*! smooth-scroll v16.1.0 | (c) 2019 Chris Ferdinandi | MIT License | http://github.com/cferdinandi/smooth-scroll */
+!(function(e,t){"function"==typeof define&&define.amd?define([],(function(){return t(e)})):"object"==typeof exports?module.exports=t(e):e.SmoothScroll=t(e)})("undefined"!=typeof global?global:"undefined"!=typeof window?window:this,(function(C){"use strict";var L={ignore:"[data-scroll-ignore]",header:null,topOnEmptyHash:!0,speed:500,speedAsDuration:!1,durationMax:null,durationMin:null,clip:!0,offset:0,easing:"easeInOutCubic",customEasing:null,updateURL:!0,popstate:!0,emitEvents:!0},H=function(){var n={};return Array.prototype.forEach.call(arguments,(function(e){for(var t in e){if(!e.hasOwnProperty(t))return;n[t]=e[t]}})),n},r=function(e){"#"===e.charAt(0)&&(e=e.substr(1));for(var t,n=String(e),o=n.length,a=-1,r="",i=n.charCodeAt(0);++a<o;){if(0===(t=n.charCodeAt(a)))throw new InvalidCharacterError("Invalid character: the input contains U+0000.");1<=t&&t<=31||127==t||0===a&&48<=t&&t<=57||1===a&&48<=t&&t<=57&&45===i?r+="\\"+t.toString(16)+" ":r+=128<=t||45===t||95===t||48<=t&&t<=57||65<=t&&t<=90||97<=t&&t<=122?n.charAt(a):"\\"+n.charAt(a)}return"#"+r},q=function(){return Math.max(document.body.scrollHeight,document.documentElement.scrollHeight,document.body.offsetHeight,document.documentElement.offsetHeight,document.body.clientHeight,document.documentElement.clientHeight)},x=function(e){return e?(t=e,parseInt(C.getComputedStyle(t).height,10)+e.offsetTop):0;var t},Q=function(e,t,n,o){if(t.emitEvents&&"function"==typeof C.CustomEvent){var a=new CustomEvent(e,{bubbles:!0,detail:{anchor:n,toggle:o}});document.dispatchEvent(a)}};return function(o,e){var M,a,I,A,w={};w.cancelScroll=function(e){cancelAnimationFrame(A),A=null,e||Q("scrollCancel",M)},w.animateScroll=function(i,s,e){w.cancelScroll();var c=H(M||L,e||{}),u="[object Number]"===Object.prototype.toString.call(i),t=u||!i.tagName?null:i;if(u||t){var l=C.pageYOffset;c.header&&!I&&(I=document.querySelector(c.header));var n,o,a,d,r,f,m,h,p=x(I),g=u?i:(function(e,t,n,o){var a=0;if(e.offsetParent)for(;a+=e.offsetTop,e=e.offsetParent;);return a=Math.max(a-t-n,0),o&&(a=Math.min(a,q()-C.innerHeight)),a})(t,p,parseInt("function"==typeof c.offset?c.offset(i,s):c.offset,10),c.clip),y=g-l,v=q(),S=0,E=(n=y,a=(o=c).speedAsDuration?o.speed:Math.abs(n/1e3*o.speed),o.durationMax&&a>o.durationMax?o.durationMax:o.durationMin&&a<o.durationMin?o.durationMin:parseInt(a,10)),b=function(e,t){var n,o,a,r=C.pageYOffset;if(e==t||r==t||(l<t&&C.innerHeight+r)>=v)return w.cancelScroll(!0),o=t,a=u,0===(n=i)&&document.body.focus(),a||(n.focus(),document.activeElement!==n&&(n.setAttribute("tabindex","-1"),n.focus(),n.style.outline="none"),C.scrollTo(0,o)),Q("scrollStop",c,i,s),!(A=d=null)},O=function(e){var t,n,o;d||(d=e),S+=e-d,f=l+y*(n=r=1<(r=0===E?0:S/E)?1:r,"easeInQuad"===(t=c).easing&&(o=n*n),"easeOutQuad"===t.easing&&(o=n*(2-n)),"easeInOutQuad"===t.easing&&(o=n<.5?2*n*n:(4-2*n)*n-1),"easeInCubic"===t.easing&&(o=n*n*n),"easeOutCubic"===t.easing&&(o=--n*n*n+1),"easeInOutCubic"===t.easing&&(o=n<.5?4*n*n*n:(n-1)*(2*n-2)*(2*n-2)+1),"easeInQuart"===t.easing&&(o=n*n*n*n),"easeOutQuart"===t.easing&&(o=1- --n*n*n*n),"easeInOutQuart"===t.easing&&(o=n<.5?8*n*n*n*n:1-8*--n*n*n*n),"easeInQuint"===t.easing&&(o=n*n*n*n*n),"easeOutQuint"===t.easing&&(o=1+--n*n*n*n*n),"easeInOutQuint"===t.easing&&(o=n<.5?16*n*n*n*n*n:1+16*--n*n*n*n*n),t.customEasing&&(o=t.customEasing(n)),o||n),C.scrollTo(0,Math.floor(f)),b(f,g)||(A=C.requestAnimationFrame(O),d=e)};0===C.pageYOffset&&C.scrollTo(0,0),m=i,h=c,u||history.pushState&&h.updateURL&&history.pushState({smoothScroll:JSON.stringify(h),anchor:m.id},document.title,m===document.documentElement?"#top":"#"+m.id),"matchMedia"in C&&C.matchMedia("(prefers-reduced-motion)").matches?C.scrollTo(0,Math.floor(g)):(Q("scrollStart",c,i,s),w.cancelScroll(!0),C.requestAnimationFrame(O))}};var t=function(e){if(!e.defaultPrevented&&!(0!==e.button||e.metaKey||e.ctrlKey||e.shiftKey)&&"closest"in e.target&&(a=e.target.closest(o))&&"a"===a.tagName.toLowerCase()&&!e.target.closest(M.ignore)&&a.hostname===C.location.hostname&&a.pathname===C.location.pathname&&/#/.test(a.href)){var t,n=r(a.hash);if("#"===n){if(!M.topOnEmptyHash)return;t=document.documentElement}else t=document.querySelector(n);(t=t||"#top"!==n?t:document.documentElement)&&(e.preventDefault(),(function(e){if(history.replaceState&&e.updateURL&&!history.state){var t=C.location.hash;t=t||"",history.replaceState({smoothScroll:JSON.stringify(e),anchor:t||C.pageYOffset},document.title,t||C.location.href)}})(M),w.animateScroll(t,a))}},n=function(e){if(null!==history.state&&history.state.smoothScroll&&history.state.smoothScroll===JSON.stringify(M)){var t=history.state.anchor;"string"==typeof t&&t&&!(t=document.querySelector(r(history.state.anchor)))||w.animateScroll(t,null,{updateURL:!1})}};w.destroy=function(){M&&(document.removeEventListener("click",t,!1),C.removeEventListener("popstate",n,!1),w.cancelScroll(),A=I=a=M=null)};return (function(){if(!("querySelector"in document&&"addEventListener"in C&&"requestAnimationFrame"in C&&"closest"in C.Element.prototype))throw"Smooth Scroll: This browser does not support the required JavaScript methods and browser APIs.";w.destroy(),M=H(L,e||{}),I=M.header?document.querySelector(M.header):null,document.addEventListener("click",t,!1),M.updateURL&&M.popstate&&C.addEventListener("popstate",n,!1)})(),w}}));
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.js b/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.js
new file mode 100755
index 0000000..9907746
--- /dev/null
+++ b/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.js
@@ -0,0 +1,715 @@
+/*!
+ * smooth-scroll v16.1.0
+ * Animate scrolling to anchor links
+ * (c) 2019 Chris Ferdinandi
+ * MIT License
+ * http://github.com/cferdinandi/smooth-scroll
+ */
+
+/**
+ * closest() polyfill
+ * @link https://developer.mozilla.org/en-US/docs/Web/API/Element/closest#Polyfill
+ */
+if (window.Element && !Element.prototype.closest) {
+	Element.prototype.closest = function(s) {
+		var matches = (this.document || this.ownerDocument).querySelectorAll(s),
+			i,
+			el = this;
+		do {
+			i = matches.length;
+			while (--i >= 0 && matches.item(i) !== el) {}
+		} while ((i < 0) && (el = el.parentElement));
+		return el;
+	};
+}
+
+/**
+ * CustomEvent() polyfill
+ * https://developer.mozilla.org/en-US/docs/Web/API/CustomEvent/CustomEvent#Polyfill
+ */
+(function () {
+
+	if (typeof window.CustomEvent === "function") return false;
+
+	function CustomEvent(event, params) {
+		params = params || { bubbles: false, cancelable: false, detail: undefined };
+		var evt = document.createEvent('CustomEvent');
+		evt.initCustomEvent(event, params.bubbles, params.cancelable, params.detail);
+		return evt;
+	}
+
+	CustomEvent.prototype = window.Event.prototype;
+
+	window.CustomEvent = CustomEvent;
+})();
+/**
+ * requestAnimationFrame() polyfill
+ * By Erik Möller. Fixes from Paul Irish and Tino Zijdel.
+ * @link http://paulirish.com/2011/requestanimationframe-for-smart-animating/
+ * @link http://my.opera.com/emoller/blog/2011/12/20/requestanimationframe-for-smart-er-animating
+ * @license MIT
+ */
+(function() {
+	var lastTime = 0;
+	var vendors = ['ms', 'moz', 'webkit', 'o'];
+	for(var x = 0; x < vendors.length && !window.requestAnimationFrame; ++x) {
+		window.requestAnimationFrame = window[vendors[x]+'RequestAnimationFrame'];
+		window.cancelAnimationFrame = window[vendors[x]+'CancelAnimationFrame'] ||
+		                              window[vendors[x]+'CancelRequestAnimationFrame'];
+	}
+
+	if (!window.requestAnimationFrame) {
+		window.requestAnimationFrame = function(callback, element) {
+			var currTime = new Date().getTime();
+			var timeToCall = Math.max(0, 16 - (currTime - lastTime));
+			var id = window.setTimeout((function() { callback(currTime + timeToCall); }),
+				timeToCall);
+			lastTime = currTime + timeToCall;
+			return id;
+		};
+	}
+
+	if (!window.cancelAnimationFrame) {
+		window.cancelAnimationFrame = function(id) {
+			clearTimeout(id);
+		};
+	}
+}());
+
+(function (root, factory) {
+	if (typeof define === 'function' && define.amd) {
+		define([], (function () {
+			return factory(root);
+		}));
+	} else if (typeof exports === 'object') {
+		module.exports = factory(root);
+	} else {
+		root.SmoothScroll = factory(root);
+	}
+})(typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : this, (function (window) {
+
+	'use strict';
+
+	//
+	// Default settings
+	//
+
+	var defaults = {
+
+		// Selectors
+		ignore: '[data-scroll-ignore]',
+		header: null,
+		topOnEmptyHash: true,
+
+		// Speed & Duration
+		speed: 500,
+		speedAsDuration: false,
+		durationMax: null,
+		durationMin: null,
+		clip: true,
+		offset: 0,
+
+		// Easing
+		easing: 'easeInOutCubic',
+		customEasing: null,
+
+		// History
+		updateURL: true,
+		popstate: true,
+
+		// Custom Events
+		emitEvents: true
+
+	};
+
+
+	//
+	// Utility Methods
+	//
+
+	/**
+	 * Check if browser supports required methods
+	 * @return {Boolean} Returns true if all required methods are supported
+	 */
+	var supports = function () {
+		return (
+			'querySelector' in document &&
+			'addEventListener' in window &&
+			'requestAnimationFrame' in window &&
+			'closest' in window.Element.prototype
+		);
+	};
+
+	/**
+	 * Merge two or more objects together.
+	 * @param   {Object}   objects  The objects to merge together
+	 * @returns {Object}            Merged values of defaults and options
+	 */
+	var extend = function () {
+		var merged = {};
+		Array.prototype.forEach.call(arguments, (function (obj) {
+			for (var key in obj) {
+				if (!obj.hasOwnProperty(key)) return;
+				merged[key] = obj[key];
+			}
+		}));
+		return merged;
+	};
+
+	/**
+	 * Check to see if user prefers reduced motion
+	 * @param  {Object} settings Script settings
+	 */
+	var reduceMotion = function () {
+		if ('matchMedia' in window && window.matchMedia('(prefers-reduced-motion)').matches) {
+			return true;
+		}
+		return false;
+	};
+
+	/**
+	 * Get the height of an element.
+	 * @param  {Node} elem The element to get the height of
+	 * @return {Number}    The element's height in pixels
+	 */
+	var getHeight = function (elem) {
+		return parseInt(window.getComputedStyle(elem).height, 10);
+	};
+
+	/**
+	 * Escape special characters for use with querySelector
+	 * @author Mathias Bynens
+	 * @link https://github.com/mathiasbynens/CSS.escape
+	 * @param {String} id The anchor ID to escape
+	 */
+	var escapeCharacters = function (id) {
+
+		// Remove leading hash
+		if (id.charAt(0) === '#') {
+			id = id.substr(1);
+		}
+
+		var string = String(id);
+		var length = string.length;
+		var index = -1;
+		var codeUnit;
+		var result = '';
+		var firstCodeUnit = string.charCodeAt(0);
+		while (++index < length) {
+			codeUnit = string.charCodeAt(index);
+			// Note: there’s no need to special-case astral symbols, surrogate
+			// pairs, or lone surrogates.
+
+			// If the character is NULL (U+0000), then throw an
+			// `InvalidCharacterError` exception and terminate these steps.
+			if (codeUnit === 0x0000) {
+				throw new InvalidCharacterError(
+					'Invalid character: the input contains U+0000.'
+				);
+			}
+
+			if (
+				// If the character is in the range [\1-\1F] (U+0001 to U+001F) or is
+				// U+007F, […]
+				(codeUnit >= 0x0001 && codeUnit <= 0x001F) || codeUnit == 0x007F ||
+				// If the character is the first character and is in the range [0-9]
+				// (U+0030 to U+0039), […]
+				(index === 0 && codeUnit >= 0x0030 && codeUnit <= 0x0039) ||
+				// If the character is the second character and is in the range [0-9]
+				// (U+0030 to U+0039) and the first character is a `-` (U+002D), […]
+				(
+					index === 1 &&
+					codeUnit >= 0x0030 && codeUnit <= 0x0039 &&
+					firstCodeUnit === 0x002D
+				)
+			) {
+				// http://dev.w3.org/csswg/cssom/#escape-a-character-as-code-point
+				result += '\\' + codeUnit.toString(16) + ' ';
+				continue;
+			}
+
+			// If the character is not handled by one of the above rules and is
+			// greater than or equal to U+0080, is `-` (U+002D) or `_` (U+005F), or
+			// is in one of the ranges [0-9] (U+0030 to U+0039), [A-Z] (U+0041 to
+			// U+005A), or [a-z] (U+0061 to U+007A), […]
+			if (
+				codeUnit >= 0x0080 ||
+				codeUnit === 0x002D ||
+				codeUnit === 0x005F ||
+				codeUnit >= 0x0030 && codeUnit <= 0x0039 ||
+				codeUnit >= 0x0041 && codeUnit <= 0x005A ||
+				codeUnit >= 0x0061 && codeUnit <= 0x007A
+			) {
+				// the character itself
+				result += string.charAt(index);
+				continue;
+			}
+
+			// Otherwise, the escaped character.
+			// http://dev.w3.org/csswg/cssom/#escape-a-character
+			result += '\\' + string.charAt(index);
+
+		}
+
+		// Return sanitized hash
+		return '#' + result;
+
+	};
+
+	/**
+	 * Calculate the easing pattern
+	 * @link https://gist.github.com/gre/1650294
+	 * @param {String} type Easing pattern
+	 * @param {Number} time Time animation should take to complete
+	 * @returns {Number}
+	 */
+	var easingPattern = function (settings, time) {
+		var pattern;
+
+		// Default Easing Patterns
+		if (settings.easing === 'easeInQuad') pattern = time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuad') pattern = time * (2 - time); // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuad') pattern = time < 0.5 ? 2 * time * time : -1 + (4 - 2 * time) * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInCubic') pattern = time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutCubic') pattern = (--time) * time * time + 1; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutCubic') pattern = time < 0.5 ? 4 * time * time * time : (time - 1) * (2 * time - 2) * (2 * time - 2) + 1; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuart') pattern = time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuart') pattern = 1 - (--time) * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuart') pattern = time < 0.5 ? 8 * time * time * time * time : 1 - 8 * (--time) * time * time * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuint') pattern = time * time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuint') pattern = 1 + (--time) * time * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuint') pattern = time < 0.5 ? 16 * time * time * time * time * time : 1 + 16 * (--time) * time * time * time * time; // acceleration until halfway, then deceleration
+
+		// Custom Easing Patterns
+		if (!!settings.customEasing) pattern = settings.customEasing(time);
+
+		return pattern || time; // no easing, no acceleration
+	};
+
+	/**
+	 * Determine the document's height
+	 * @returns {Number}
+	 */
+	var getDocumentHeight = function () {
+		return Math.max(
+			document.body.scrollHeight, document.documentElement.scrollHeight,
+			document.body.offsetHeight, document.documentElement.offsetHeight,
+			document.body.clientHeight, document.documentElement.clientHeight
+		);
+	};
+
+	/**
+	 * Calculate how far to scroll
+	 * Clip support added by robjtede - https://github.com/cferdinandi/smooth-scroll/issues/405
+	 * @param {Element} anchor       The anchor element to scroll to
+	 * @param {Number}  headerHeight Height of a fixed header, if any
+	 * @param {Number}  offset       Number of pixels by which to offset scroll
+	 * @param {Boolean} clip         If true, adjust scroll distance to prevent abrupt stops near the bottom of the page
+	 * @returns {Number}
+	 */
+	var getEndLocation = function (anchor, headerHeight, offset, clip) {
+		var location = 0;
+		if (anchor.offsetParent) {
+			do {
+				location += anchor.offsetTop;
+				anchor = anchor.offsetParent;
+			} while (anchor);
+		}
+		location = Math.max(location - headerHeight - offset, 0);
+		if (clip) {
+			location = Math.min(location, getDocumentHeight() - window.innerHeight);
+		}
+ 		return location;
+	};
+
+	/**
+	 * Get the height of the fixed header
+	 * @param  {Node}   header The header
+	 * @return {Number}        The height of the header
+	 */
+	var getHeaderHeight = function (header) {
+		return !header ? 0 : (getHeight(header) + header.offsetTop);
+	};
+
+	/**
+	 * Calculate the speed to use for the animation
+	 * @param  {Number} distance The distance to travel
+	 * @param  {Object} settings The plugin settings
+	 * @return {Number}          How fast to animate
+	 */
+	var getSpeed = function (distance, settings) {
+		var speed = settings.speedAsDuration ? settings.speed : Math.abs(distance / 1000 * settings.speed);
+		if (settings.durationMax && speed > settings.durationMax) return settings.durationMax;
+		if (settings.durationMin && speed < settings.durationMin) return settings.durationMin;
+		return parseInt(speed, 10);
+	};
+
+	var setHistory = function (options) {
+
+		// Make sure this should run
+		if (!history.replaceState || !options.updateURL || history.state) return;
+
+		// Get the hash to use
+		var hash = window.location.hash;
+		hash = hash ? hash : '';
+
+		// Set a default history
+		history.replaceState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: hash ? hash : window.pageYOffset
+			},
+			document.title,
+			hash ? hash : window.location.href
+		);
+
+	};
+
+	/**
+	 * Update the URL
+	 * @param  {Node}    anchor  The anchor that was scrolled to
+	 * @param  {Boolean} isNum   If true, anchor is a number
+	 * @param  {Object}  options Settings for Smooth Scroll
+	 */
+	var updateURL = function (anchor, isNum, options) {
+
+		// Bail if the anchor is a number
+		if (isNum) return;
+
+		// Verify that pushState is supported and the updateURL option is enabled
+		if (!history.pushState || !options.updateURL) return;
+
+		// Update URL
+		history.pushState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: anchor.id
+			},
+			document.title,
+			anchor === document.documentElement ? '#top' : '#' + anchor.id
+		);
+
+	};
+
+	/**
+	 * Bring the anchored element into focus
+	 * @param {Node}     anchor      The anchor element
+	 * @param {Number}   endLocation The end location to scroll to
+	 * @param {Boolean}  isNum       If true, scroll is to a position rather than an element
+	 */
+	var adjustFocus = function (anchor, endLocation, isNum) {
+
+		// Is scrolling to top of page, blur
+		if (anchor === 0) {
+			document.body.focus();
+		}
+
+		// Don't run if scrolling to a number on the page
+		if (isNum) return;
+
+		// Otherwise, bring anchor element into focus
+		anchor.focus();
+		if (document.activeElement !== anchor) {
+			anchor.setAttribute('tabindex', '-1');
+			anchor.focus();
+			anchor.style.outline = 'none';
+		}
+		window.scrollTo(0 , endLocation);
+
+	};
+
+	/**
+	 * Emit a custom event
+	 * @param  {String} type    The event type
+	 * @param  {Object} options The settings object
+	 * @param  {Node}   anchor  The anchor element
+	 * @param  {Node}   toggle  The toggle element
+	 */
+	var emitEvent = function (type, options, anchor, toggle) {
+		if (!options.emitEvents || typeof window.CustomEvent !== 'function') return;
+		var event = new CustomEvent(type, {
+			bubbles: true,
+			detail: {
+				anchor: anchor,
+				toggle: toggle
+			}
+		});
+		document.dispatchEvent(event);
+	};
+
+
+	//
+	// SmoothScroll Constructor
+	//
+
+	var SmoothScroll = function (selector, options) {
+
+		//
+		// Variables
+		//
+
+		var smoothScroll = {}; // Object for public APIs
+		var settings, anchor, toggle, fixedHeader, eventTimeout, animationInterval;
+
+
+		//
+		// Methods
+		//
+
+		/**
+		 * Cancel a scroll-in-progress
+		 */
+		smoothScroll.cancelScroll = function (noEvent) {
+			cancelAnimationFrame(animationInterval);
+			animationInterval = null;
+			if (noEvent) return;
+			emitEvent('scrollCancel', settings);
+		};
+
+		/**
+		 * Start/stop the scrolling animation
+		 * @param {Node|Number} anchor  The element or position to scroll to
+		 * @param {Element}     toggle  The element that toggled the scroll event
+		 * @param {Object}      options
+		 */
+		smoothScroll.animateScroll = function (anchor, toggle, options) {
+
+			// Cancel any in progress scrolls
+			smoothScroll.cancelScroll();
+
+			// Local settings
+			var _settings = extend(settings || defaults, options || {}); // Merge user options with defaults
+
+			// Selectors and variables
+			var isNum = Object.prototype.toString.call(anchor) === '[object Number]' ? true : false;
+			var anchorElem = isNum || !anchor.tagName ? null : anchor;
+			if (!isNum && !anchorElem) return;
+			var startLocation = window.pageYOffset; // Current location on the page
+			if (_settings.header && !fixedHeader) {
+				// Get the fixed header if not already set
+				fixedHeader = document.querySelector(_settings.header);
+			}
+			var headerHeight = getHeaderHeight(fixedHeader);
+			var endLocation = isNum ? anchor : getEndLocation(anchorElem, headerHeight, parseInt((typeof _settings.offset === 'function' ? _settings.offset(anchor, toggle) : _settings.offset), 10), _settings.clip); // Location to scroll to
+			var distance = endLocation - startLocation; // distance to travel
+			var documentHeight = getDocumentHeight();
+			var timeLapsed = 0;
+			var speed = getSpeed(distance, _settings);
+			var start, percentage, position;
+
+			/**
+			 * Stop the scroll animation when it reaches its target (or the bottom/top of page)
+			 * @param {Number} position Current position on the page
+			 * @param {Number} endLocation Scroll to location
+			 * @param {Number} animationInterval How much to scroll on this loop
+			 */
+			var stopAnimateScroll = function (position, endLocation) {
+
+				// Get the current location
+				var currentLocation = window.pageYOffset;
+
+				// Check if the end location has been reached yet (or we've hit the end of the document)
+				if (position == endLocation || currentLocation == endLocation || ((startLocation < endLocation && window.innerHeight + currentLocation) >= documentHeight)) {
+
+					// Clear the animation timer
+					smoothScroll.cancelScroll(true);
+
+					// Bring the anchored element into focus
+					adjustFocus(anchor, endLocation, isNum);
+
+					// Emit a custom event
+					emitEvent('scrollStop', _settings, anchor, toggle);
+
+					// Reset start
+					start = null;
+					animationInterval = null;
+
+					return true;
+
+				}
+			};
+
+			/**
+			 * Loop scrolling animation
+			 */
+			var loopAnimateScroll = function (timestamp) {
+				if (!start) { start = timestamp; }
+				timeLapsed += timestamp - start;
+				percentage = speed === 0 ? 0 : (timeLapsed / speed);
+				percentage = (percentage > 1) ? 1 : percentage;
+				position = startLocation + (distance * easingPattern(_settings, percentage));
+				window.scrollTo(0, Math.floor(position));
+				if (!stopAnimateScroll(position, endLocation)) {
+					animationInterval = window.requestAnimationFrame(loopAnimateScroll);
+					start = timestamp;
+				}
+			};
+
+			/**
+			 * Reset position to fix weird iOS bug
+			 * @link https://github.com/cferdinandi/smooth-scroll/issues/45
+			 */
+			if (window.pageYOffset === 0) {
+				window.scrollTo(0, 0);
+			}
+
+			// Update the URL
+			updateURL(anchor, isNum, _settings);
+
+			// If the user prefers reduced motion, jump to location
+			if (reduceMotion()) {
+				window.scrollTo(0, Math.floor(endLocation));
+				return;
+			}
+
+			// Emit a custom event
+			emitEvent('scrollStart', _settings, anchor, toggle);
+
+			// Start scrolling animation
+			smoothScroll.cancelScroll(true);
+			window.requestAnimationFrame(loopAnimateScroll);
+
+		};
+
+		/**
+		 * If smooth scroll element clicked, animate scroll
+		 */
+		var clickHandler = function (event) {
+
+			// Don't run if event was canceled but still bubbled up
+			// By @mgreter - https://github.com/cferdinandi/smooth-scroll/pull/462/
+			if (event.defaultPrevented) return;
+
+			// Don't run if right-click or command/control + click or shift + click
+			if (event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey) return;
+
+			// Check if event.target has closest() method
+			// By @totegi - https://github.com/cferdinandi/smooth-scroll/pull/401/
+			if (!('closest' in event.target)) return;
+
+			// Check if a smooth scroll link was clicked
+			toggle = event.target.closest(selector);
+			if (!toggle || toggle.tagName.toLowerCase() !== 'a' || event.target.closest(settings.ignore)) return;
+
+			// Only run if link is an anchor and points to the current page
+			if (toggle.hostname !== window.location.hostname || toggle.pathname !== window.location.pathname || !/#/.test(toggle.href)) return;
+
+			// Get an escaped version of the hash
+			var hash = escapeCharacters(toggle.hash);
+
+			// Get the anchored element
+			var anchor;
+			if (hash === '#') {
+				if (!settings.topOnEmptyHash) return;
+				anchor = document.documentElement;
+			} else {
+				anchor = document.querySelector(hash);
+			}
+			anchor = !anchor && hash === '#top' ? document.documentElement : anchor;
+
+			// If anchored element exists, scroll to it
+			if (!anchor) return;
+			event.preventDefault();
+			setHistory(settings);
+			smoothScroll.animateScroll(anchor, toggle);
+
+		};
+
+		/**
+		 * Animate scroll on popstate events
+		 */
+		var popstateHandler = function (event) {
+
+			// Stop if history.state doesn't exist (ex. if clicking on a broken anchor link).
+			// fixes `Cannot read property 'smoothScroll' of null` error getting thrown.
+			if (history.state === null) return;
+
+			// Only run if state is a popstate record for this instantiation
+			if (!history.state.smoothScroll || history.state.smoothScroll !== JSON.stringify(settings)) return;
+
+			// Only run if state includes an anchor
+
+			// if (!history.state.anchor && history.state.anchor !== 0) return;
+
+			// Get the anchor
+			var anchor = history.state.anchor;
+			if (typeof anchor === 'string' && anchor) {
+				anchor = document.querySelector(escapeCharacters(history.state.anchor));
+				if (!anchor) return;
+			}
+
+			// Animate scroll to anchor link
+			smoothScroll.animateScroll(anchor, null, {updateURL: false});
+
+		};
+
+		/**
+		 * Destroy the current initialization.
+		 */
+		smoothScroll.destroy = function () {
+
+			// If plugin isn't already initialized, stop
+			if (!settings) return;
+
+			// Remove event listeners
+			document.removeEventListener('click', clickHandler, false);
+			window.removeEventListener('popstate', popstateHandler, false);
+
+			// Cancel any scrolls-in-progress
+			smoothScroll.cancelScroll();
+
+			// Reset variables
+			settings = null;
+			anchor = null;
+			toggle = null;
+			fixedHeader = null;
+			eventTimeout = null;
+			animationInterval = null;
+
+		};
+
+		/**
+		 * Initialize Smooth Scroll
+		 * @param {Object} options User settings
+		 */
+		var init = function () {
+
+			// feature test
+			if (!supports()) throw 'Smooth Scroll: This browser does not support the required JavaScript methods and browser APIs.';
+
+			// Destroy any existing initializations
+			smoothScroll.destroy();
+
+			// Selectors and variables
+			settings = extend(defaults, options || {}); // Merge user options with defaults
+			fixedHeader = settings.header ? document.querySelector(settings.header) : null; // Get the fixed header
+
+			// When a toggle is clicked, run the click handler
+			document.addEventListener('click', clickHandler, false);
+
+			// If updateURL and popState are enabled, listen for pop events
+			if (settings.updateURL && settings.popstate) {
+				window.addEventListener('popstate', popstateHandler, false);
+			}
+
+		};
+
+
+		//
+		// Initialize plugin
+		//
+
+		init();
+
+
+		//
+		// Public APIs
+		//
+
+		return smoothScroll;
+
+	};
+
+	return SmoothScroll;
+
+}));
diff --git a/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.min.js b/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.min.js
new file mode 100755
index 0000000..debe3d0
--- /dev/null
+++ b/node_modules/smooth-scroll/dist/smooth-scroll.polyfills.min.js
@@ -0,0 +1,2 @@
+/*! smooth-scroll v16.1.0 | (c) 2019 Chris Ferdinandi | MIT License | http://github.com/cferdinandi/smooth-scroll */
+window.Element&&!Element.prototype.closest&&(Element.prototype.closest=function(e){var t,n=(this.document||this.ownerDocument).querySelectorAll(e),o=this;do{for(t=n.length;0<=--t&&n.item(t)!==o;);}while(t<0&&(o=o.parentElement));return o}),(function(){if("function"==typeof window.CustomEvent)return;function e(e,t){t=t||{bubbles:!1,cancelable:!1,detail:void 0};var n=document.createEvent("CustomEvent");return n.initCustomEvent(e,t.bubbles,t.cancelable,t.detail),n}e.prototype=window.Event.prototype,window.CustomEvent=e})(),(function(){for(var r=0,e=["ms","moz","webkit","o"],t=0;t<e.length&&!window.requestAnimationFrame;++t)window.requestAnimationFrame=window[e[t]+"RequestAnimationFrame"],window.cancelAnimationFrame=window[e[t]+"CancelAnimationFrame"]||window[e[t]+"CancelRequestAnimationFrame"];window.requestAnimationFrame||(window.requestAnimationFrame=function(e,t){var n=(new Date).getTime(),o=Math.max(0,16-(n-r)),a=window.setTimeout((function(){e(n+o)}),o);return r=n+o,a}),window.cancelAnimationFrame||(window.cancelAnimationFrame=function(e){clearTimeout(e)})})(),(function(e,t){"function"==typeof define&&define.amd?define([],(function(){return t(e)})):"object"==typeof exports?module.exports=t(e):e.SmoothScroll=t(e)})("undefined"!=typeof global?global:"undefined"!=typeof window?window:this,(function(q){"use strict";var I={ignore:"[data-scroll-ignore]",header:null,topOnEmptyHash:!0,speed:500,speedAsDuration:!1,durationMax:null,durationMin:null,clip:!0,offset:0,easing:"easeInOutCubic",customEasing:null,updateURL:!0,popstate:!0,emitEvents:!0},F=function(){var n={};return Array.prototype.forEach.call(arguments,(function(e){for(var t in e){if(!e.hasOwnProperty(t))return;n[t]=e[t]}})),n},r=function(e){"#"===e.charAt(0)&&(e=e.substr(1));for(var t,n=String(e),o=n.length,a=-1,r="",i=n.charCodeAt(0);++a<o;){if(0===(t=n.charCodeAt(a)))throw new InvalidCharacterError("Invalid character: the input contains U+0000.");1<=t&&t<=31||127==t||0===a&&48<=t&&t<=57||1===a&&48<=t&&t<=57&&45===i?r+="\\"+t.toString(16)+" ":r+=128<=t||45===t||95===t||48<=t&&t<=57||65<=t&&t<=90||97<=t&&t<=122?n.charAt(a):"\\"+n.charAt(a)}return"#"+r},L=function(){return Math.max(document.body.scrollHeight,document.documentElement.scrollHeight,document.body.offsetHeight,document.documentElement.offsetHeight,document.body.clientHeight,document.documentElement.clientHeight)},x=function(e){return e?(t=e,parseInt(q.getComputedStyle(t).height,10)+e.offsetTop):0;var t},H=function(e,t,n,o){if(t.emitEvents&&"function"==typeof q.CustomEvent){var a=new CustomEvent(e,{bubbles:!0,detail:{anchor:n,toggle:o}});document.dispatchEvent(a)}};return function(o,e){var A,a,O,C,M={};M.cancelScroll=function(e){cancelAnimationFrame(C),C=null,e||H("scrollCancel",A)},M.animateScroll=function(i,c,e){M.cancelScroll();var s=F(A||I,e||{}),u="[object Number]"===Object.prototype.toString.call(i),t=u||!i.tagName?null:i;if(u||t){var l=q.pageYOffset;s.header&&!O&&(O=document.querySelector(s.header));var n,o,a,m,r,d,f,h,p=x(O),g=u?i:(function(e,t,n,o){var a=0;if(e.offsetParent)for(;a+=e.offsetTop,e=e.offsetParent;);return a=Math.max(a-t-n,0),o&&(a=Math.min(a,L()-q.innerHeight)),a})(t,p,parseInt("function"==typeof s.offset?s.offset(i,c):s.offset,10),s.clip),y=g-l,v=L(),w=0,S=(n=y,a=(o=s).speedAsDuration?o.speed:Math.abs(n/1e3*o.speed),o.durationMax&&a>o.durationMax?o.durationMax:o.durationMin&&a<o.durationMin?o.durationMin:parseInt(a,10)),E=function(e,t){var n,o,a,r=q.pageYOffset;if(e==t||r==t||(l<t&&q.innerHeight+r)>=v)return M.cancelScroll(!0),o=t,a=u,0===(n=i)&&document.body.focus(),a||(n.focus(),document.activeElement!==n&&(n.setAttribute("tabindex","-1"),n.focus(),n.style.outline="none"),q.scrollTo(0,o)),H("scrollStop",s,i,c),!(C=m=null)},b=function(e){var t,n,o;m||(m=e),w+=e-m,d=l+y*(n=r=1<(r=0===S?0:w/S)?1:r,"easeInQuad"===(t=s).easing&&(o=n*n),"easeOutQuad"===t.easing&&(o=n*(2-n)),"easeInOutQuad"===t.easing&&(o=n<.5?2*n*n:(4-2*n)*n-1),"easeInCubic"===t.easing&&(o=n*n*n),"easeOutCubic"===t.easing&&(o=--n*n*n+1),"easeInOutCubic"===t.easing&&(o=n<.5?4*n*n*n:(n-1)*(2*n-2)*(2*n-2)+1),"easeInQuart"===t.easing&&(o=n*n*n*n),"easeOutQuart"===t.easing&&(o=1- --n*n*n*n),"easeInOutQuart"===t.easing&&(o=n<.5?8*n*n*n*n:1-8*--n*n*n*n),"easeInQuint"===t.easing&&(o=n*n*n*n*n),"easeOutQuint"===t.easing&&(o=1+--n*n*n*n*n),"easeInOutQuint"===t.easing&&(o=n<.5?16*n*n*n*n*n:1+16*--n*n*n*n*n),t.customEasing&&(o=t.customEasing(n)),o||n),q.scrollTo(0,Math.floor(d)),E(d,g)||(C=q.requestAnimationFrame(b),m=e)};0===q.pageYOffset&&q.scrollTo(0,0),f=i,h=s,u||history.pushState&&h.updateURL&&history.pushState({smoothScroll:JSON.stringify(h),anchor:f.id},document.title,f===document.documentElement?"#top":"#"+f.id),"matchMedia"in q&&q.matchMedia("(prefers-reduced-motion)").matches?q.scrollTo(0,Math.floor(g)):(H("scrollStart",s,i,c),M.cancelScroll(!0),q.requestAnimationFrame(b))}};var t=function(e){if(!e.defaultPrevented&&!(0!==e.button||e.metaKey||e.ctrlKey||e.shiftKey)&&"closest"in e.target&&(a=e.target.closest(o))&&"a"===a.tagName.toLowerCase()&&!e.target.closest(A.ignore)&&a.hostname===q.location.hostname&&a.pathname===q.location.pathname&&/#/.test(a.href)){var t,n=r(a.hash);if("#"===n){if(!A.topOnEmptyHash)return;t=document.documentElement}else t=document.querySelector(n);(t=t||"#top"!==n?t:document.documentElement)&&(e.preventDefault(),(function(e){if(history.replaceState&&e.updateURL&&!history.state){var t=q.location.hash;t=t||"",history.replaceState({smoothScroll:JSON.stringify(e),anchor:t||q.pageYOffset},document.title,t||q.location.href)}})(A),M.animateScroll(t,a))}},n=function(e){if(null!==history.state&&history.state.smoothScroll&&history.state.smoothScroll===JSON.stringify(A)){var t=history.state.anchor;"string"==typeof t&&t&&!(t=document.querySelector(r(history.state.anchor)))||M.animateScroll(t,null,{updateURL:!1})}};M.destroy=function(){A&&(document.removeEventListener("click",t,!1),q.removeEventListener("popstate",n,!1),M.cancelScroll(),C=O=a=A=null)};return (function(){if(!("querySelector"in document&&"addEventListener"in q&&"requestAnimationFrame"in q&&"closest"in q.Element.prototype))throw"Smooth Scroll: This browser does not support the required JavaScript methods and browser APIs.";M.destroy(),A=F(I,e||{}),O=A.header?document.querySelector(A.header):null,document.addEventListener("click",t,!1),A.updateURL&&A.popstate&&q.addEventListener("popstate",n,!1)})(),M}}));
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/gulpfile.js b/node_modules/smooth-scroll/gulpfile.js
new file mode 100755
index 0000000..0b20e1e
--- /dev/null
+++ b/node_modules/smooth-scroll/gulpfile.js
@@ -0,0 +1,315 @@
+/**
+ * Settings
+ * Turn on/off build features
+ */
+
+var settings = {
+	clean: true,
+	scripts: true,
+	polyfills: true,
+	styles: false,
+	svgs: false,
+	copy: true,
+	reload: true
+};
+
+
+/**
+ * Paths to project folders
+ */
+
+var paths = {
+	input: 'src/',
+	output: 'dist/',
+	scripts: {
+		input: 'src/js/*',
+		polyfills: '.polyfill.js',
+		output: 'dist/'
+	},
+	styles: {
+		input: 'src/sass/**/*.{scss,sass}',
+		output: 'dist/css/'
+	},
+	svgs: {
+		input: 'src/svg/*.svg',
+		output: 'dist/svg/'
+	},
+	copy: {
+		input: 'src/copy/*',
+		output: './'
+	},
+	reload: './'
+};
+
+
+/**
+ * Template for banner to add to file headers
+ */
+
+var banner = {
+	full:
+		'/*!\n' +
+		' * <%= package.name %> v<%= package.version %>\n' +
+		' * <%= package.description %>\n' +
+		' * (c) ' + new Date().getFullYear() + ' <%= package.author.name %>\n' +
+		' * <%= package.license %> License\n' +
+		' * <%= package.repository.url %>\n' +
+		' */\n\n',
+	min:
+		'/*!' +
+		' <%= package.name %> v<%= package.version %>' +
+		' | (c) ' + new Date().getFullYear() + ' <%= package.author.name %>' +
+		' | <%= package.license %> License' +
+		' | <%= package.repository.url %>' +
+		' */\n'
+};
+
+
+/**
+ * Gulp Packages
+ */
+
+// General
+var {gulp, src, dest, watch, series, parallel} = require('gulp');
+var del = require('del');
+var flatmap = require('gulp-flatmap');
+var lazypipe = require('lazypipe');
+var rename = require('gulp-rename');
+var header = require('gulp-header');
+var package = require('./package.json');
+
+// Scripts
+var jshint = require('gulp-jshint');
+var stylish = require('jshint-stylish');
+var concat = require('gulp-concat');
+var uglify = require('gulp-uglify');
+var optimizejs = require('gulp-optimize-js');
+
+// Styles
+var sass = require('gulp-sass');
+var prefix = require('gulp-autoprefixer');
+var minify = require('gulp-cssnano');
+
+// SVGs
+var svgmin = require('gulp-svgmin');
+
+// BrowserSync
+var browserSync = require('browser-sync');
+
+
+/**
+ * Gulp Tasks
+ */
+
+// Remove pre-existing content from output folders
+var cleanDist = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.clean) return done();
+
+	// Clean the dist folder
+	del.sync([
+		paths.output
+	]);
+
+	// Signal completion
+	return done();
+
+};
+
+// Repeated JavaScript tasks
+var jsTasks = lazypipe()
+	.pipe(header, banner.full, {package: package})
+	.pipe(optimizejs)
+	.pipe(dest, paths.scripts.output)
+	.pipe(rename, {suffix: '.min'})
+	.pipe(uglify)
+	.pipe(optimizejs)
+	.pipe(header, banner.min, {package: package})
+	.pipe(dest, paths.scripts.output);
+
+// Lint, minify, and concatenate scripts
+var buildScripts = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.scripts) return done();
+
+	// Run tasks on script files
+	src(paths.scripts.input)
+		.pipe(flatmap(function(stream, file) {
+
+			// If the file is a directory
+			if (file.isDirectory()) {
+
+				// Setup a suffix variable
+				var suffix = '';
+
+				// If separate polyfill files enabled
+				if (settings.polyfills) {
+
+					// Update the suffix
+					suffix = '.polyfills';
+
+					// Grab files that aren't polyfills, concatenate them, and process them
+					src([file.path + '/*.js', '!' + file.path + '/*' + paths.scripts.polyfills])
+						.pipe(concat(file.relative + '.js'))
+						.pipe(jsTasks());
+
+				}
+
+				// Grab all files and concatenate them
+				// If separate polyfills enabled, this will have .polyfills in the filename
+				src(file.path + '/*.js')
+					.pipe(concat(file.relative + suffix + '.js'))
+					.pipe(jsTasks());
+
+				return stream;
+
+			}
+
+			// Otherwise, process the file
+			return stream.pipe(jsTasks());
+
+		}));
+
+	// Signal completion
+	done();
+
+};
+
+// Lint scripts
+var lintScripts = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.scripts) return done();
+
+	// Lint scripts
+	src(paths.scripts.input)
+		.pipe(jshint())
+		.pipe(jshint.reporter('jshint-stylish'));
+
+	// Signal completion
+	done();
+
+};
+
+// Process, lint, and minify Sass files
+var buildStyles = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.styles) return done();
+
+	// Run tasks on all Sass files
+	src(paths.styles.input)
+		.pipe(sass({
+			outputStyle: 'expanded',
+			sourceComments: true
+		}))
+		.pipe(prefix({
+			browsers: ['last 2 version', '> 0.25%'],
+			cascade: true,
+			remove: true
+		}))
+		.pipe(header(banner.full, { package : package }))
+		.pipe(dest(paths.styles.output))
+		.pipe(rename({suffix: '.min'}))
+		.pipe(minify({
+			discardComments: {
+				removeAll: true
+			}
+		}))
+		.pipe(header(banner.min, { package : package }))
+		.pipe(dest(paths.styles.output));
+
+	// Signal completion
+	done();
+
+};
+
+// Optimize SVG files
+var buildSVGs = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.svgs) return done();
+
+	// Optimize SVG files
+	src(paths.svgs.input)
+		.pipe(svgmin())
+		.pipe(dest(paths.svgs.output));
+
+	// Signal completion
+	done();
+
+};
+
+// Copy static files into output folder
+var copyFiles = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.copy) return done();
+
+	// Copy static files
+	src(paths.copy.input)
+		.pipe(dest(paths.copy.output));
+
+	// Signal completion
+	done();
+
+};
+
+// Watch for changes to the src directory
+var startServer = function (done) {
+
+	// Make sure this feature is activated before running
+	if (!settings.reload) return done();
+
+	// Initialize BrowserSync
+	browserSync.init({
+		server: {
+			baseDir: paths.reload
+		}
+	});
+
+	// Signal completion
+	done();
+
+};
+
+// Reload the browser when files change
+var reloadBrowser = function (done) {
+	if (!settings.reload) return done();
+	browserSync.reload();
+	done();
+};
+
+// Watch for changes
+var watchSource = function (done) {
+	watch(paths.input, series(exports.default, reloadBrowser));
+	done();
+};
+
+
+/**
+ * Export Tasks
+ */
+
+// Default task
+// gulp
+exports.default = series(
+	cleanDist,
+	parallel(
+		buildScripts,
+		lintScripts,
+		buildStyles,
+		buildSVGs,
+		copyFiles
+	)
+);
+
+// Watch and reload
+// gulp watch
+exports.watch = series(
+	exports.default,
+	startServer,
+	watchSource
+);
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/index.html b/node_modules/smooth-scroll/index.html
new file mode 100755
index 0000000..74c0f43
--- /dev/null
+++ b/node_modules/smooth-scroll/index.html
@@ -0,0 +1,132 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+				<p>
+				    <strong>Linear</strong><br>
+				    <a data-easing="linear" href="#bazinga">Linear (no other options)</a><br>
+				</p>
+
+				<p>
+				    <strong>Ease-In</strong><br>
+				    <a data-easing="easeInQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeInCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeInQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeInQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    <strong>Ease-In-Out</strong><br>
+				    <a data-easing="easeInOutQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeInOutCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeInOutQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeInOutQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    <strong>Ease-Out</strong><br>
+				    <a data-easing="easeOutQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeOutCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeOutQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeOutQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p>
+				    <strong>Non-ASCII Characters</strong><br>
+				    <a href="#中文">中文</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="中文">中文</p>
+
+				<p id="bazinga"><a href="#1@#%^-bottom">Bazinga!</a></p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="1@#%^-bottom"><a href="#top">Back to the top</a></p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+
+			// Instantiate Scrolls
+			var scroll = new SmoothScroll('a[href*="#"]:not([data-easing])');
+
+			if (document.querySelector('[data-easing]')) {
+				var linear = new SmoothScroll('[data-easing="linear"]', {easing: 'linear'});
+
+				var easeInQuad = new SmoothScroll('[data-easing="easeInQuad"]', {easing: 'easeInQuad'});
+				var easeInCubic = new SmoothScroll('[data-easing="easeInCubic"]', {easing: 'easeInCubic'});
+				var easeInQuart = new SmoothScroll('[data-easing="easeInQuart"]', {easing: 'easeInQuart'});
+				var easeInQuint = new SmoothScroll('[data-easing="easeInQuint"]', {easing: 'easeInQuint'});
+
+				var easeInOutQuad = new SmoothScroll('[data-easing="easeInOutQuad"]', {easing: 'easeInOutQuad'});
+				var easeInOutCubic = new SmoothScroll('[data-easing="easeInOutCubic"]', {easing: 'easeInOutCubic'});
+				var easeInOutQuart = new SmoothScroll('[data-easing="easeInOutQuart"]', {easing: 'easeInOutQuart'});
+				var easeInOutQuint = new SmoothScroll('[data-easing="easeInOutQuint"]', {easing: 'easeInOutQuint'});
+
+				var easeOutQuad = new SmoothScroll('[data-easing="easeOutQuad"]', {easing: 'easeOutQuad'});
+				var easeOutCubic = new SmoothScroll('[data-easing="easeOutCubic"]', {easing: 'easeOutCubic'});
+				var easeOutQuart = new SmoothScroll('[data-easing="easeOutQuart"]', {easing: 'easeOutQuart'});
+				var easeOutQuint = new SmoothScroll('[data-easing="easeOutQuint"]', {easing: 'easeOutQuint'});
+			}
+
+			// // Log scroll events
+			// var logScrollEvent = function (event) {
+			// 	console.log('type:', event.type);
+			// 	console.log('anchor:', event.detail.anchor);
+			// 	console.log('toggle:', event.detail.toggle);
+			// };
+			// document.addEventListener('scrollStart', logScrollEvent, false);
+			// document.addEventListener('scrollStop', logScrollEvent, false);
+			// document.addEventListener('scrollCancel', logScrollEvent, false);
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/jump-to-top.html b/node_modules/smooth-scroll/jump-to-top.html
new file mode 100644
index 0000000..393e4ad
--- /dev/null
+++ b/node_modules/smooth-scroll/jump-to-top.html
@@ -0,0 +1,60 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p><a href="#">Back to the top</a></p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+			// Instantiate Scrolls
+			var scroll = new SmoothScroll('a[href*="#"]', {
+				topOnEmptyHash: false
+			});
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/package.json b/node_modules/smooth-scroll/package.json
new file mode 100755
index 0000000..c9b34e6
--- /dev/null
+++ b/node_modules/smooth-scroll/package.json
@@ -0,0 +1,64 @@
+{
+  "_from": "smooth-scroll",
+  "_id": "smooth-scroll@16.1.0",
+  "_inBundle": false,
+  "_integrity": "sha512-V5b8ekIekZ3xJ6f0sPsLgEbN5YT8gX0Q6yNjZXTKgqjH9dBGadZ0P50fhP0rLRBGifc44qfI3rnWNM+lebhJag==",
+  "_location": "/smooth-scroll",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "tag",
+    "registry": true,
+    "raw": "smooth-scroll",
+    "name": "smooth-scroll",
+    "escapedName": "smooth-scroll",
+    "rawSpec": "",
+    "saveSpec": null,
+    "fetchSpec": "latest"
+  },
+  "_requiredBy": [
+    "#USER",
+    "/"
+  ],
+  "_resolved": "https://registry.npmjs.org/smooth-scroll/-/smooth-scroll-16.1.0.tgz",
+  "_shasum": "c811c63db67215d30847745ba0732feb3291947f",
+  "_spec": "smooth-scroll",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page",
+  "author": {
+    "name": "Chris Ferdinandi",
+    "url": "http://gomakethings.com"
+  },
+  "bugs": {
+    "url": "https://github.com/cferdinandi/smooth-scroll/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Animate scrolling to anchor links",
+  "devDependencies": {
+    "browser-sync": "2.26.3",
+    "del": "3.0.0",
+    "gulp": "4.0.0",
+    "gulp-autoprefixer": "6.0.0",
+    "gulp-concat": "2.6.1",
+    "gulp-cssnano": "2.1.3",
+    "gulp-flatmap": "1.0.2",
+    "gulp-header": "2.0.5",
+    "gulp-jshint": "2.1.0",
+    "gulp-optimize-js": "1.1.0",
+    "gulp-rename": "1.4.0",
+    "gulp-sass": "4.0.2",
+    "gulp-svgmin": "2.1.0",
+    "gulp-uglify": "3.0.1",
+    "jshint": "2.9.6",
+    "jshint-stylish": "2.2.1",
+    "lazypipe": "1.0.1"
+  },
+  "homepage": "https://github.com/cferdinandi/smooth-scroll#readme",
+  "license": "MIT",
+  "main": "./dist/smooth-scroll.polyfills.min.js",
+  "name": "smooth-scroll",
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://git@github.com/cferdinandi/smooth-scroll.git"
+  },
+  "version": "16.1.0"
+}
diff --git a/node_modules/smooth-scroll/speed.html b/node_modules/smooth-scroll/speed.html
new file mode 100644
index 0000000..21c834a
--- /dev/null
+++ b/node_modules/smooth-scroll/speed.html
@@ -0,0 +1,69 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+				<p>
+				    <a href="#bazinga">Click Me</a><br>
+				    <a href="#1@#%^-bottom">Or me</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="bazinga"><a href="#1@#%^-bottom">Bazinga!</a></p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="1@#%^-bottom"><a href="#top">Back to the top</a></p>
+
+				<p>.<br>.<br>.<br>.<br>.</p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+			var scroll = new SmoothScroll('a[href*="#"]');
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/src/copy/index.html b/node_modules/smooth-scroll/src/copy/index.html
new file mode 100755
index 0000000..74c0f43
--- /dev/null
+++ b/node_modules/smooth-scroll/src/copy/index.html
@@ -0,0 +1,132 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+				<p>
+				    <strong>Linear</strong><br>
+				    <a data-easing="linear" href="#bazinga">Linear (no other options)</a><br>
+				</p>
+
+				<p>
+				    <strong>Ease-In</strong><br>
+				    <a data-easing="easeInQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeInCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeInQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeInQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    <strong>Ease-In-Out</strong><br>
+				    <a data-easing="easeInOutQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeInOutCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeInOutQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeInOutQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    <strong>Ease-Out</strong><br>
+				    <a data-easing="easeOutQuad" href="#bazinga">Quad</a><br>
+				    <a data-easing="easeOutCubic" href="#bazinga">Cubic</a><br>
+				    <a data-easing="easeOutQuart" href="#bazinga">Quart</a><br>
+				    <a data-easing="easeOutQuint" href="#bazinga">Quint</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p>
+				    <strong>Non-ASCII Characters</strong><br>
+				    <a href="#中文">中文</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="中文">中文</p>
+
+				<p id="bazinga"><a href="#1@#%^-bottom">Bazinga!</a></p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="1@#%^-bottom"><a href="#top">Back to the top</a></p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+
+			// Instantiate Scrolls
+			var scroll = new SmoothScroll('a[href*="#"]:not([data-easing])');
+
+			if (document.querySelector('[data-easing]')) {
+				var linear = new SmoothScroll('[data-easing="linear"]', {easing: 'linear'});
+
+				var easeInQuad = new SmoothScroll('[data-easing="easeInQuad"]', {easing: 'easeInQuad'});
+				var easeInCubic = new SmoothScroll('[data-easing="easeInCubic"]', {easing: 'easeInCubic'});
+				var easeInQuart = new SmoothScroll('[data-easing="easeInQuart"]', {easing: 'easeInQuart'});
+				var easeInQuint = new SmoothScroll('[data-easing="easeInQuint"]', {easing: 'easeInQuint'});
+
+				var easeInOutQuad = new SmoothScroll('[data-easing="easeInOutQuad"]', {easing: 'easeInOutQuad'});
+				var easeInOutCubic = new SmoothScroll('[data-easing="easeInOutCubic"]', {easing: 'easeInOutCubic'});
+				var easeInOutQuart = new SmoothScroll('[data-easing="easeInOutQuart"]', {easing: 'easeInOutQuart'});
+				var easeInOutQuint = new SmoothScroll('[data-easing="easeInOutQuint"]', {easing: 'easeInOutQuint'});
+
+				var easeOutQuad = new SmoothScroll('[data-easing="easeOutQuad"]', {easing: 'easeOutQuad'});
+				var easeOutCubic = new SmoothScroll('[data-easing="easeOutCubic"]', {easing: 'easeOutCubic'});
+				var easeOutQuart = new SmoothScroll('[data-easing="easeOutQuart"]', {easing: 'easeOutQuart'});
+				var easeOutQuint = new SmoothScroll('[data-easing="easeOutQuint"]', {easing: 'easeOutQuint'});
+			}
+
+			// // Log scroll events
+			// var logScrollEvent = function (event) {
+			// 	console.log('type:', event.type);
+			// 	console.log('anchor:', event.detail.anchor);
+			// 	console.log('toggle:', event.detail.toggle);
+			// };
+			// document.addEventListener('scrollStart', logScrollEvent, false);
+			// document.addEventListener('scrollStop', logScrollEvent, false);
+			// document.addEventListener('scrollCancel', logScrollEvent, false);
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/src/copy/jump-to-top.html b/node_modules/smooth-scroll/src/copy/jump-to-top.html
new file mode 100644
index 0000000..393e4ad
--- /dev/null
+++ b/node_modules/smooth-scroll/src/copy/jump-to-top.html
@@ -0,0 +1,60 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p><a href="#">Back to the top</a></p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+			// Instantiate Scrolls
+			var scroll = new SmoothScroll('a[href*="#"]', {
+				topOnEmptyHash: false
+			});
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/src/copy/speed.html b/node_modules/smooth-scroll/src/copy/speed.html
new file mode 100644
index 0000000..21c834a
--- /dev/null
+++ b/node_modules/smooth-scroll/src/copy/speed.html
@@ -0,0 +1,69 @@
+<!DOCTYPE html>
+<html lang="en">
+
+	<head>
+		<meta charset="utf-8">
+		<title>Smooth Scroll</title>
+		<meta name="viewport" content="width=device-width, initial-scale=1.0">
+
+		<!-- stylesheets -->
+		<style type="text/css">
+			body {
+				font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif;
+				font-size: 112.5%;
+				margin-left: auto;
+				margin-right: auto;
+				max-width: 40em;
+				width: 88%;
+			}
+		</style>
+	</head>
+
+	<body>
+
+		<main id="top">
+
+			<nav>
+				<h1>Smooth Scroll</h1>
+				<p><a href="https://github.com/cferdinandi/smooth-scroll">GitHub</a></p>
+				<hr>
+			</nav>
+
+			<section>
+				<p>
+				    <a href="#bazinga">Click Me</a><br>
+				    <a href="#1@#%^-bottom">Or me</a>
+				</p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="bazinga"><a href="#1@#%^-bottom">Bazinga!</a></p>
+
+				<p>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>
+				    .<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.<br>.
+				</p>
+
+				<p id="1@#%^-bottom"><a href="#top">Back to the top</a></p>
+
+				<p>.<br>.<br>.<br>.<br>.</p>
+			</section>
+		</main>
+
+		<!-- Javascript -->
+		<script src="dist/smooth-scroll.polyfills.js"></script>
+		<script>
+			var scroll = new SmoothScroll('a[href*="#"]');
+		</script>
+
+
+	</body>
+</html>
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/src/js/smooth-scroll/_closest.polyfill.js b/node_modules/smooth-scroll/src/js/smooth-scroll/_closest.polyfill.js
new file mode 100644
index 0000000..068e47a
--- /dev/null
+++ b/node_modules/smooth-scroll/src/js/smooth-scroll/_closest.polyfill.js
@@ -0,0 +1,16 @@
+/**
+ * closest() polyfill
+ * @link https://developer.mozilla.org/en-US/docs/Web/API/Element/closest#Polyfill
+ */
+if (window.Element && !Element.prototype.closest) {
+	Element.prototype.closest = function(s) {
+		var matches = (this.document || this.ownerDocument).querySelectorAll(s),
+			i,
+			el = this;
+		do {
+			i = matches.length;
+			while (--i >= 0 && matches.item(i) !== el) {}
+		} while ((i < 0) && (el = el.parentElement));
+		return el;
+	};
+}
diff --git a/node_modules/smooth-scroll/src/js/smooth-scroll/_customEvent.polyfill.js b/node_modules/smooth-scroll/src/js/smooth-scroll/_customEvent.polyfill.js
new file mode 100644
index 0000000..4e7a110
--- /dev/null
+++ b/node_modules/smooth-scroll/src/js/smooth-scroll/_customEvent.polyfill.js
@@ -0,0 +1,19 @@
+/**
+ * CustomEvent() polyfill
+ * https://developer.mozilla.org/en-US/docs/Web/API/CustomEvent/CustomEvent#Polyfill
+ */
+(function () {
+
+	if (typeof window.CustomEvent === "function") return false;
+
+	function CustomEvent(event, params) {
+		params = params || { bubbles: false, cancelable: false, detail: undefined };
+		var evt = document.createEvent('CustomEvent');
+		evt.initCustomEvent(event, params.bubbles, params.cancelable, params.detail);
+		return evt;
+	}
+
+	CustomEvent.prototype = window.Event.prototype;
+
+	window.CustomEvent = CustomEvent;
+})();
\ No newline at end of file
diff --git a/node_modules/smooth-scroll/src/js/smooth-scroll/_requestAnimationFrame.polyfill.js b/node_modules/smooth-scroll/src/js/smooth-scroll/_requestAnimationFrame.polyfill.js
new file mode 100644
index 0000000..9b1bfee
--- /dev/null
+++ b/node_modules/smooth-scroll/src/js/smooth-scroll/_requestAnimationFrame.polyfill.js
@@ -0,0 +1,33 @@
+/**
+ * requestAnimationFrame() polyfill
+ * By Erik Möller. Fixes from Paul Irish and Tino Zijdel.
+ * @link http://paulirish.com/2011/requestanimationframe-for-smart-animating/
+ * @link http://my.opera.com/emoller/blog/2011/12/20/requestanimationframe-for-smart-er-animating
+ * @license MIT
+ */
+(function() {
+	var lastTime = 0;
+	var vendors = ['ms', 'moz', 'webkit', 'o'];
+	for(var x = 0; x < vendors.length && !window.requestAnimationFrame; ++x) {
+		window.requestAnimationFrame = window[vendors[x]+'RequestAnimationFrame'];
+		window.cancelAnimationFrame = window[vendors[x]+'CancelAnimationFrame'] ||
+		                              window[vendors[x]+'CancelRequestAnimationFrame'];
+	}
+
+	if (!window.requestAnimationFrame) {
+		window.requestAnimationFrame = function(callback, element) {
+			var currTime = new Date().getTime();
+			var timeToCall = Math.max(0, 16 - (currTime - lastTime));
+			var id = window.setTimeout(function() { callback(currTime + timeToCall); },
+				timeToCall);
+			lastTime = currTime + timeToCall;
+			return id;
+		};
+	}
+
+	if (!window.cancelAnimationFrame) {
+		window.cancelAnimationFrame = function(id) {
+			clearTimeout(id);
+		};
+	}
+}());
diff --git a/node_modules/smooth-scroll/src/js/smooth-scroll/smooth-scroll.js b/node_modules/smooth-scroll/src/js/smooth-scroll/smooth-scroll.js
new file mode 100755
index 0000000..49c3b63
--- /dev/null
+++ b/node_modules/smooth-scroll/src/js/smooth-scroll/smooth-scroll.js
@@ -0,0 +1,637 @@
+(function (root, factory) {
+	if (typeof define === 'function' && define.amd) {
+		define([], function () {
+			return factory(root);
+		});
+	} else if (typeof exports === 'object') {
+		module.exports = factory(root);
+	} else {
+		root.SmoothScroll = factory(root);
+	}
+})(typeof global !== 'undefined' ? global : typeof window !== 'undefined' ? window : this, function (window) {
+
+	'use strict';
+
+	//
+	// Default settings
+	//
+
+	var defaults = {
+
+		// Selectors
+		ignore: '[data-scroll-ignore]',
+		header: null,
+		topOnEmptyHash: true,
+
+		// Speed & Duration
+		speed: 500,
+		speedAsDuration: false,
+		durationMax: null,
+		durationMin: null,
+		clip: true,
+		offset: 0,
+
+		// Easing
+		easing: 'easeInOutCubic',
+		customEasing: null,
+
+		// History
+		updateURL: true,
+		popstate: true,
+
+		// Custom Events
+		emitEvents: true
+
+	};
+
+
+	//
+	// Utility Methods
+	//
+
+	/**
+	 * Check if browser supports required methods
+	 * @return {Boolean} Returns true if all required methods are supported
+	 */
+	var supports = function () {
+		return (
+			'querySelector' in document &&
+			'addEventListener' in window &&
+			'requestAnimationFrame' in window &&
+			'closest' in window.Element.prototype
+		);
+	};
+
+	/**
+	 * Merge two or more objects together.
+	 * @param   {Object}   objects  The objects to merge together
+	 * @returns {Object}            Merged values of defaults and options
+	 */
+	var extend = function () {
+		var merged = {};
+		Array.prototype.forEach.call(arguments, function (obj) {
+			for (var key in obj) {
+				if (!obj.hasOwnProperty(key)) return;
+				merged[key] = obj[key];
+			}
+		});
+		return merged;
+	};
+
+	/**
+	 * Check to see if user prefers reduced motion
+	 * @param  {Object} settings Script settings
+	 */
+	var reduceMotion = function () {
+		if ('matchMedia' in window && window.matchMedia('(prefers-reduced-motion)').matches) {
+			return true;
+		}
+		return false;
+	};
+
+	/**
+	 * Get the height of an element.
+	 * @param  {Node} elem The element to get the height of
+	 * @return {Number}    The element's height in pixels
+	 */
+	var getHeight = function (elem) {
+		return parseInt(window.getComputedStyle(elem).height, 10);
+	};
+
+	/**
+	 * Escape special characters for use with querySelector
+	 * @author Mathias Bynens
+	 * @link https://github.com/mathiasbynens/CSS.escape
+	 * @param {String} id The anchor ID to escape
+	 */
+	var escapeCharacters = function (id) {
+
+		// Remove leading hash
+		if (id.charAt(0) === '#') {
+			id = id.substr(1);
+		}
+
+		var string = String(id);
+		var length = string.length;
+		var index = -1;
+		var codeUnit;
+		var result = '';
+		var firstCodeUnit = string.charCodeAt(0);
+		while (++index < length) {
+			codeUnit = string.charCodeAt(index);
+			// Note: there’s no need to special-case astral symbols, surrogate
+			// pairs, or lone surrogates.
+
+			// If the character is NULL (U+0000), then throw an
+			// `InvalidCharacterError` exception and terminate these steps.
+			if (codeUnit === 0x0000) {
+				throw new InvalidCharacterError(
+					'Invalid character: the input contains U+0000.'
+				);
+			}
+
+			if (
+				// If the character is in the range [\1-\1F] (U+0001 to U+001F) or is
+				// U+007F, […]
+				(codeUnit >= 0x0001 && codeUnit <= 0x001F) || codeUnit == 0x007F ||
+				// If the character is the first character and is in the range [0-9]
+				// (U+0030 to U+0039), […]
+				(index === 0 && codeUnit >= 0x0030 && codeUnit <= 0x0039) ||
+				// If the character is the second character and is in the range [0-9]
+				// (U+0030 to U+0039) and the first character is a `-` (U+002D), […]
+				(
+					index === 1 &&
+					codeUnit >= 0x0030 && codeUnit <= 0x0039 &&
+					firstCodeUnit === 0x002D
+				)
+			) {
+				// http://dev.w3.org/csswg/cssom/#escape-a-character-as-code-point
+				result += '\\' + codeUnit.toString(16) + ' ';
+				continue;
+			}
+
+			// If the character is not handled by one of the above rules and is
+			// greater than or equal to U+0080, is `-` (U+002D) or `_` (U+005F), or
+			// is in one of the ranges [0-9] (U+0030 to U+0039), [A-Z] (U+0041 to
+			// U+005A), or [a-z] (U+0061 to U+007A), […]
+			if (
+				codeUnit >= 0x0080 ||
+				codeUnit === 0x002D ||
+				codeUnit === 0x005F ||
+				codeUnit >= 0x0030 && codeUnit <= 0x0039 ||
+				codeUnit >= 0x0041 && codeUnit <= 0x005A ||
+				codeUnit >= 0x0061 && codeUnit <= 0x007A
+			) {
+				// the character itself
+				result += string.charAt(index);
+				continue;
+			}
+
+			// Otherwise, the escaped character.
+			// http://dev.w3.org/csswg/cssom/#escape-a-character
+			result += '\\' + string.charAt(index);
+
+		}
+
+		// Return sanitized hash
+		return '#' + result;
+
+	};
+
+	/**
+	 * Calculate the easing pattern
+	 * @link https://gist.github.com/gre/1650294
+	 * @param {String} type Easing pattern
+	 * @param {Number} time Time animation should take to complete
+	 * @returns {Number}
+	 */
+	var easingPattern = function (settings, time) {
+		var pattern;
+
+		// Default Easing Patterns
+		if (settings.easing === 'easeInQuad') pattern = time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuad') pattern = time * (2 - time); // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuad') pattern = time < 0.5 ? 2 * time * time : -1 + (4 - 2 * time) * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInCubic') pattern = time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutCubic') pattern = (--time) * time * time + 1; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutCubic') pattern = time < 0.5 ? 4 * time * time * time : (time - 1) * (2 * time - 2) * (2 * time - 2) + 1; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuart') pattern = time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuart') pattern = 1 - (--time) * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuart') pattern = time < 0.5 ? 8 * time * time * time * time : 1 - 8 * (--time) * time * time * time; // acceleration until halfway, then deceleration
+		if (settings.easing === 'easeInQuint') pattern = time * time * time * time * time; // accelerating from zero velocity
+		if (settings.easing === 'easeOutQuint') pattern = 1 + (--time) * time * time * time * time; // decelerating to zero velocity
+		if (settings.easing === 'easeInOutQuint') pattern = time < 0.5 ? 16 * time * time * time * time * time : 1 + 16 * (--time) * time * time * time * time; // acceleration until halfway, then deceleration
+
+		// Custom Easing Patterns
+		if (!!settings.customEasing) pattern = settings.customEasing(time);
+
+		return pattern || time; // no easing, no acceleration
+	};
+
+	/**
+	 * Determine the document's height
+	 * @returns {Number}
+	 */
+	var getDocumentHeight = function () {
+		return Math.max(
+			document.body.scrollHeight, document.documentElement.scrollHeight,
+			document.body.offsetHeight, document.documentElement.offsetHeight,
+			document.body.clientHeight, document.documentElement.clientHeight
+		);
+	};
+
+	/**
+	 * Calculate how far to scroll
+	 * Clip support added by robjtede - https://github.com/cferdinandi/smooth-scroll/issues/405
+	 * @param {Element} anchor       The anchor element to scroll to
+	 * @param {Number}  headerHeight Height of a fixed header, if any
+	 * @param {Number}  offset       Number of pixels by which to offset scroll
+	 * @param {Boolean} clip         If true, adjust scroll distance to prevent abrupt stops near the bottom of the page
+	 * @returns {Number}
+	 */
+	var getEndLocation = function (anchor, headerHeight, offset, clip) {
+		var location = 0;
+		if (anchor.offsetParent) {
+			do {
+				location += anchor.offsetTop;
+				anchor = anchor.offsetParent;
+			} while (anchor);
+		}
+		location = Math.max(location - headerHeight - offset, 0);
+		if (clip) {
+			location = Math.min(location, getDocumentHeight() - window.innerHeight);
+		}
+ 		return location;
+	};
+
+	/**
+	 * Get the height of the fixed header
+	 * @param  {Node}   header The header
+	 * @return {Number}        The height of the header
+	 */
+	var getHeaderHeight = function (header) {
+		return !header ? 0 : (getHeight(header) + header.offsetTop);
+	};
+
+	/**
+	 * Calculate the speed to use for the animation
+	 * @param  {Number} distance The distance to travel
+	 * @param  {Object} settings The plugin settings
+	 * @return {Number}          How fast to animate
+	 */
+	var getSpeed = function (distance, settings) {
+		var speed = settings.speedAsDuration ? settings.speed : Math.abs(distance / 1000 * settings.speed);
+		if (settings.durationMax && speed > settings.durationMax) return settings.durationMax;
+		if (settings.durationMin && speed < settings.durationMin) return settings.durationMin;
+		return parseInt(speed, 10);
+	};
+
+	var setHistory = function (options) {
+
+		// Make sure this should run
+		if (!history.replaceState || !options.updateURL || history.state) return;
+
+		// Get the hash to use
+		var hash = window.location.hash;
+		hash = hash ? hash : '';
+
+		// Set a default history
+		history.replaceState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: hash ? hash : window.pageYOffset
+			},
+			document.title,
+			hash ? hash : window.location.href
+		);
+
+	};
+
+	/**
+	 * Update the URL
+	 * @param  {Node}    anchor  The anchor that was scrolled to
+	 * @param  {Boolean} isNum   If true, anchor is a number
+	 * @param  {Object}  options Settings for Smooth Scroll
+	 */
+	var updateURL = function (anchor, isNum, options) {
+
+		// Bail if the anchor is a number
+		if (isNum) return;
+
+		// Verify that pushState is supported and the updateURL option is enabled
+		if (!history.pushState || !options.updateURL) return;
+
+		// Update URL
+		history.pushState(
+			{
+				smoothScroll: JSON.stringify(options),
+				anchor: anchor.id
+			},
+			document.title,
+			anchor === document.documentElement ? '#top' : '#' + anchor.id
+		);
+
+	};
+
+	/**
+	 * Bring the anchored element into focus
+	 * @param {Node}     anchor      The anchor element
+	 * @param {Number}   endLocation The end location to scroll to
+	 * @param {Boolean}  isNum       If true, scroll is to a position rather than an element
+	 */
+	var adjustFocus = function (anchor, endLocation, isNum) {
+
+		// Is scrolling to top of page, blur
+		if (anchor === 0) {
+			document.body.focus();
+		}
+
+		// Don't run if scrolling to a number on the page
+		if (isNum) return;
+
+		// Otherwise, bring anchor element into focus
+		anchor.focus();
+		if (document.activeElement !== anchor) {
+			anchor.setAttribute('tabindex', '-1');
+			anchor.focus();
+			anchor.style.outline = 'none';
+		}
+		window.scrollTo(0 , endLocation);
+
+	};
+
+	/**
+	 * Emit a custom event
+	 * @param  {String} type    The event type
+	 * @param  {Object} options The settings object
+	 * @param  {Node}   anchor  The anchor element
+	 * @param  {Node}   toggle  The toggle element
+	 */
+	var emitEvent = function (type, options, anchor, toggle) {
+		if (!options.emitEvents || typeof window.CustomEvent !== 'function') return;
+		var event = new CustomEvent(type, {
+			bubbles: true,
+			detail: {
+				anchor: anchor,
+				toggle: toggle
+			}
+		});
+		document.dispatchEvent(event);
+	};
+
+
+	//
+	// SmoothScroll Constructor
+	//
+
+	var SmoothScroll = function (selector, options) {
+
+		//
+		// Variables
+		//
+
+		var smoothScroll = {}; // Object for public APIs
+		var settings, anchor, toggle, fixedHeader, eventTimeout, animationInterval;
+
+
+		//
+		// Methods
+		//
+
+		/**
+		 * Cancel a scroll-in-progress
+		 */
+		smoothScroll.cancelScroll = function (noEvent) {
+			cancelAnimationFrame(animationInterval);
+			animationInterval = null;
+			if (noEvent) return;
+			emitEvent('scrollCancel', settings);
+		};
+
+		/**
+		 * Start/stop the scrolling animation
+		 * @param {Node|Number} anchor  The element or position to scroll to
+		 * @param {Element}     toggle  The element that toggled the scroll event
+		 * @param {Object}      options
+		 */
+		smoothScroll.animateScroll = function (anchor, toggle, options) {
+
+			// Cancel any in progress scrolls
+			smoothScroll.cancelScroll();
+
+			// Local settings
+			var _settings = extend(settings || defaults, options || {}); // Merge user options with defaults
+
+			// Selectors and variables
+			var isNum = Object.prototype.toString.call(anchor) === '[object Number]' ? true : false;
+			var anchorElem = isNum || !anchor.tagName ? null : anchor;
+			if (!isNum && !anchorElem) return;
+			var startLocation = window.pageYOffset; // Current location on the page
+			if (_settings.header && !fixedHeader) {
+				// Get the fixed header if not already set
+				fixedHeader = document.querySelector(_settings.header);
+			}
+			var headerHeight = getHeaderHeight(fixedHeader);
+			var endLocation = isNum ? anchor : getEndLocation(anchorElem, headerHeight, parseInt((typeof _settings.offset === 'function' ? _settings.offset(anchor, toggle) : _settings.offset), 10), _settings.clip); // Location to scroll to
+			var distance = endLocation - startLocation; // distance to travel
+			var documentHeight = getDocumentHeight();
+			var timeLapsed = 0;
+			var speed = getSpeed(distance, _settings);
+			var start, percentage, position;
+
+			/**
+			 * Stop the scroll animation when it reaches its target (or the bottom/top of page)
+			 * @param {Number} position Current position on the page
+			 * @param {Number} endLocation Scroll to location
+			 * @param {Number} animationInterval How much to scroll on this loop
+			 */
+			var stopAnimateScroll = function (position, endLocation) {
+
+				// Get the current location
+				var currentLocation = window.pageYOffset;
+
+				// Check if the end location has been reached yet (or we've hit the end of the document)
+				if (position == endLocation || currentLocation == endLocation || ((startLocation < endLocation && window.innerHeight + currentLocation) >= documentHeight)) {
+
+					// Clear the animation timer
+					smoothScroll.cancelScroll(true);
+
+					// Bring the anchored element into focus
+					adjustFocus(anchor, endLocation, isNum);
+
+					// Emit a custom event
+					emitEvent('scrollStop', _settings, anchor, toggle);
+
+					// Reset start
+					start = null;
+					animationInterval = null;
+
+					return true;
+
+				}
+			};
+
+			/**
+			 * Loop scrolling animation
+			 */
+			var loopAnimateScroll = function (timestamp) {
+				if (!start) { start = timestamp; }
+				timeLapsed += timestamp - start;
+				percentage = speed === 0 ? 0 : (timeLapsed / speed);
+				percentage = (percentage > 1) ? 1 : percentage;
+				position = startLocation + (distance * easingPattern(_settings, percentage));
+				window.scrollTo(0, Math.floor(position));
+				if (!stopAnimateScroll(position, endLocation)) {
+					animationInterval = window.requestAnimationFrame(loopAnimateScroll);
+					start = timestamp;
+				}
+			};
+
+			/**
+			 * Reset position to fix weird iOS bug
+			 * @link https://github.com/cferdinandi/smooth-scroll/issues/45
+			 */
+			if (window.pageYOffset === 0) {
+				window.scrollTo(0, 0);
+			}
+
+			// Update the URL
+			updateURL(anchor, isNum, _settings);
+
+			// If the user prefers reduced motion, jump to location
+			if (reduceMotion()) {
+				window.scrollTo(0, Math.floor(endLocation));
+				return;
+			}
+
+			// Emit a custom event
+			emitEvent('scrollStart', _settings, anchor, toggle);
+
+			// Start scrolling animation
+			smoothScroll.cancelScroll(true);
+			window.requestAnimationFrame(loopAnimateScroll);
+
+		};
+
+		/**
+		 * If smooth scroll element clicked, animate scroll
+		 */
+		var clickHandler = function (event) {
+
+			// Don't run if event was canceled but still bubbled up
+			// By @mgreter - https://github.com/cferdinandi/smooth-scroll/pull/462/
+			if (event.defaultPrevented) return;
+
+			// Don't run if right-click or command/control + click or shift + click
+			if (event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey) return;
+
+			// Check if event.target has closest() method
+			// By @totegi - https://github.com/cferdinandi/smooth-scroll/pull/401/
+			if (!('closest' in event.target)) return;
+
+			// Check if a smooth scroll link was clicked
+			toggle = event.target.closest(selector);
+			if (!toggle || toggle.tagName.toLowerCase() !== 'a' || event.target.closest(settings.ignore)) return;
+
+			// Only run if link is an anchor and points to the current page
+			if (toggle.hostname !== window.location.hostname || toggle.pathname !== window.location.pathname || !/#/.test(toggle.href)) return;
+
+			// Get an escaped version of the hash
+			var hash = escapeCharacters(toggle.hash);
+
+			// Get the anchored element
+			var anchor;
+			if (hash === '#') {
+				if (!settings.topOnEmptyHash) return;
+				anchor = document.documentElement;
+			} else {
+				anchor = document.querySelector(hash);
+			}
+			anchor = !anchor && hash === '#top' ? document.documentElement : anchor;
+
+			// If anchored element exists, scroll to it
+			if (!anchor) return;
+			event.preventDefault();
+			setHistory(settings);
+			smoothScroll.animateScroll(anchor, toggle);
+
+		};
+
+		/**
+		 * Animate scroll on popstate events
+		 */
+		var popstateHandler = function (event) {
+
+			// Stop if history.state doesn't exist (ex. if clicking on a broken anchor link).
+			// fixes `Cannot read property 'smoothScroll' of null` error getting thrown.
+			if (history.state === null) return;
+
+			// Only run if state is a popstate record for this instantiation
+			if (!history.state.smoothScroll || history.state.smoothScroll !== JSON.stringify(settings)) return;
+
+			// Only run if state includes an anchor
+
+			// if (!history.state.anchor && history.state.anchor !== 0) return;
+
+			// Get the anchor
+			var anchor = history.state.anchor;
+			if (typeof anchor === 'string' && anchor) {
+				anchor = document.querySelector(escapeCharacters(history.state.anchor));
+				if (!anchor) return;
+			}
+
+			// Animate scroll to anchor link
+			smoothScroll.animateScroll(anchor, null, {updateURL: false});
+
+		};
+
+		/**
+		 * Destroy the current initialization.
+		 */
+		smoothScroll.destroy = function () {
+
+			// If plugin isn't already initialized, stop
+			if (!settings) return;
+
+			// Remove event listeners
+			document.removeEventListener('click', clickHandler, false);
+			window.removeEventListener('popstate', popstateHandler, false);
+
+			// Cancel any scrolls-in-progress
+			smoothScroll.cancelScroll();
+
+			// Reset variables
+			settings = null;
+			anchor = null;
+			toggle = null;
+			fixedHeader = null;
+			eventTimeout = null;
+			animationInterval = null;
+
+		};
+
+		/**
+		 * Initialize Smooth Scroll
+		 * @param {Object} options User settings
+		 */
+		var init = function () {
+
+			// feature test
+			if (!supports()) throw 'Smooth Scroll: This browser does not support the required JavaScript methods and browser APIs.';
+
+			// Destroy any existing initializations
+			smoothScroll.destroy();
+
+			// Selectors and variables
+			settings = extend(defaults, options || {}); // Merge user options with defaults
+			fixedHeader = settings.header ? document.querySelector(settings.header) : null; // Get the fixed header
+
+			// When a toggle is clicked, run the click handler
+			document.addEventListener('click', clickHandler, false);
+
+			// If updateURL and popState are enabled, listen for pop events
+			if (settings.updateURL && settings.popstate) {
+				window.addEventListener('popstate', popstateHandler, false);
+			}
+
+		};
+
+
+		//
+		// Initialize plugin
+		//
+
+		init();
+
+
+		//
+		// Public APIs
+		//
+
+		return smoothScroll;
+
+	};
+
+	return SmoothScroll;
+
+});
diff --git a/node_modules/source-map/CHANGELOG.md b/node_modules/source-map/CHANGELOG.md
new file mode 100644
index 0000000..ef31a09
--- /dev/null
+++ b/node_modules/source-map/CHANGELOG.md
@@ -0,0 +1,344 @@
+# Change Log
+
+## 0.7.3
+
+* Fix a bug where nested uses of `SourceMapConsumer` could result in a
+  `TypeError`. [#338](https://github.com/mozilla/source-map/issues/338)
+  [#330](https://github.com/mozilla/source-map/issues/330)
+  [#319](https://github.com/mozilla/source-map/issues/319)
+
+## 0.7.2
+
+* Another 3x speed up in `SourceMapConsumer`. Read about it here:
+  http://fitzgeraldnick.com/2018/02/26/speed-without-wizardry.html
+
+## 0.7.1
+
+* Updated TypeScript typings. [#321][]
+
+[#321]: https://github.com/mozilla/source-map/pull/321
+
+## 0.7.0
+
+* `SourceMapConsumer` now uses WebAssembly, and is **much** faster! Read about
+  it here:
+  https://hacks.mozilla.org/2018/01/oxidizing-source-maps-with-rust-and-webassembly/
+
+* **Breaking change:** `new SourceMapConsumer` now returns a `Promise` object
+  that resolves to the newly constructed `SourceMapConsumer` instance, rather
+  than returning the new instance immediately.
+
+* **Breaking change:** when you're done using a `SourceMapConsumer` instance,
+  you must call `SourceMapConsumer.prototype.destroy` on it. After calling
+  `destroy`, you must not use the instance again.
+
+* **Breaking change:** `SourceMapConsumer` used to be able to handle lines,
+  columns numbers and source and name indices up to `2^53 - 1` (aka
+  `Number.MAX_SAFE_INTEGER`). It can now only handle them up to `2^32 - 1`.
+
+* **Breaking change:** The `source-map` library now uses modern ECMAScript-isms:
+  `let`, arrow functions, `async`, etc. Use Babel to compile it down to
+  ECMAScript 5 if you need to support older JavaScript environments.
+
+* **Breaking change:** Drop support for Node < 8. If you want to support older
+versions of node, please use v0.6 or below.
+
+## 0.5.6
+
+* Fix for regression when people were using numbers as names in source maps. See
+  #236.
+
+## 0.5.5
+
+* Fix "regression" of unsupported, implementation behavior that half the world
+  happens to have come to depend on. See #235.
+
+* Fix regression involving function hoisting in SpiderMonkey. See #233.
+
+## 0.5.4
+
+* Large performance improvements to source-map serialization. See #228 and #229.
+
+## 0.5.3
+
+* Do not include unnecessary distribution files. See
+  commit ef7006f8d1647e0a83fdc60f04f5a7ca54886f86.
+
+## 0.5.2
+
+* Include browser distributions of the library in package.json's `files`. See
+  issue #212.
+
+## 0.5.1
+
+* Fix latent bugs in IndexedSourceMapConsumer.prototype._parseMappings. See
+  ff05274becc9e6e1295ed60f3ea090d31d843379.
+
+## 0.5.0
+
+* Node 0.8 is no longer supported.
+
+* Use webpack instead of dryice for bundling.
+
+* Big speedups serializing source maps. See pull request #203.
+
+* Fix a bug with `SourceMapConsumer.prototype.sourceContentFor` and sources that
+  explicitly start with the source root. See issue #199.
+
+## 0.4.4
+
+* Fix an issue where using a `SourceMapGenerator` after having created a
+  `SourceMapConsumer` from it via `SourceMapConsumer.fromSourceMap` failed. See
+  issue #191.
+
+* Fix an issue with where `SourceMapGenerator` would mistakenly consider
+  different mappings as duplicates of each other and avoid generating them. See
+  issue #192.
+
+## 0.4.3
+
+* A very large number of performance improvements, particularly when parsing
+  source maps. Collectively about 75% of time shaved off of the source map
+  parsing benchmark!
+
+* Fix a bug in `SourceMapConsumer.prototype.allGeneratedPositionsFor` and fuzzy
+  searching in the presence of a column option. See issue #177.
+
+* Fix a bug with joining a source and its source root when the source is above
+  the root. See issue #182.
+
+* Add the `SourceMapConsumer.prototype.hasContentsOfAllSources` method to
+  determine when all sources' contents are inlined into the source map. See
+  issue #190.
+
+## 0.4.2
+
+* Add an `.npmignore` file so that the benchmarks aren't pulled down by
+  dependent projects. Issue #169.
+
+* Add an optional `column` argument to
+  `SourceMapConsumer.prototype.allGeneratedPositionsFor` and better handle lines
+  with no mappings. Issues #172 and #173.
+
+## 0.4.1
+
+* Fix accidentally defining a global variable. #170.
+
+## 0.4.0
+
+* The default direction for fuzzy searching was changed back to its original
+  direction. See #164.
+
+* There is now a `bias` option you can supply to `SourceMapConsumer` to control
+  the fuzzy searching direction. See #167.
+
+* About an 8% speed up in parsing source maps. See #159.
+
+* Added a benchmark for parsing and generating source maps.
+
+## 0.3.0
+
+* Change the default direction that searching for positions fuzzes when there is
+  not an exact match. See #154.
+
+* Support for environments using json2.js for JSON serialization. See #156.
+
+## 0.2.0
+
+* Support for consuming "indexed" source maps which do not have any remote
+  sections. See pull request #127. This introduces a minor backwards
+  incompatibility if you are monkey patching `SourceMapConsumer.prototype`
+  methods.
+
+## 0.1.43
+
+* Performance improvements for `SourceMapGenerator` and `SourceNode`. See issue
+  #148 for some discussion and issues #150, #151, and #152 for implementations.
+
+## 0.1.42
+
+* Fix an issue where `SourceNode`s from different versions of the source-map
+  library couldn't be used in conjunction with each other. See issue #142.
+
+## 0.1.41
+
+* Fix a bug with getting the source content of relative sources with a "./"
+  prefix. See issue #145 and [Bug 1090768](bugzil.la/1090768).
+
+* Add the `SourceMapConsumer.prototype.computeColumnSpans` method to compute the
+  column span of each mapping.
+
+* Add the `SourceMapConsumer.prototype.allGeneratedPositionsFor` method to find
+  all generated positions associated with a given original source and line.
+
+## 0.1.40
+
+* Performance improvements for parsing source maps in SourceMapConsumer.
+
+## 0.1.39
+
+* Fix a bug where setting a source's contents to null before any source content
+  had been set before threw a TypeError. See issue #131.
+
+## 0.1.38
+
+* Fix a bug where finding relative paths from an empty path were creating
+  absolute paths. See issue #129.
+
+## 0.1.37
+
+* Fix a bug where if the source root was an empty string, relative source paths
+  would turn into absolute source paths. Issue #124.
+
+## 0.1.36
+
+* Allow the `names` mapping property to be an empty string. Issue #121.
+
+## 0.1.35
+
+* A third optional parameter was added to `SourceNode.fromStringWithSourceMap`
+  to specify a path that relative sources in the second parameter should be
+  relative to. Issue #105.
+
+* If no file property is given to a `SourceMapGenerator`, then the resulting
+  source map will no longer have a `null` file property. The property will
+  simply not exist. Issue #104.
+
+* Fixed a bug where consecutive newlines were ignored in `SourceNode`s.
+  Issue #116.
+
+## 0.1.34
+
+* Make `SourceNode` work with windows style ("\r\n") newlines. Issue #103.
+
+* Fix bug involving source contents and the
+  `SourceMapGenerator.prototype.applySourceMap`. Issue #100.
+
+## 0.1.33
+
+* Fix some edge cases surrounding path joining and URL resolution.
+
+* Add a third parameter for relative path to
+  `SourceMapGenerator.prototype.applySourceMap`.
+
+* Fix issues with mappings and EOLs.
+
+## 0.1.32
+
+* Fixed a bug where SourceMapConsumer couldn't handle negative relative columns
+  (issue 92).
+
+* Fixed test runner to actually report number of failed tests as its process
+  exit code.
+
+* Fixed a typo when reporting bad mappings (issue 87).
+
+## 0.1.31
+
+* Delay parsing the mappings in SourceMapConsumer until queried for a source
+  location.
+
+* Support Sass source maps (which at the time of writing deviate from the spec
+  in small ways) in SourceMapConsumer.
+
+## 0.1.30
+
+* Do not join source root with a source, when the source is a data URI.
+
+* Extend the test runner to allow running single specific test files at a time.
+
+* Performance improvements in `SourceNode.prototype.walk` and
+  `SourceMapConsumer.prototype.eachMapping`.
+
+* Source map browser builds will now work inside Workers.
+
+* Better error messages when attempting to add an invalid mapping to a
+  `SourceMapGenerator`.
+
+## 0.1.29
+
+* Allow duplicate entries in the `names` and `sources` arrays of source maps
+  (usually from TypeScript) we are parsing. Fixes github issue 72.
+
+## 0.1.28
+
+* Skip duplicate mappings when creating source maps from SourceNode; github
+  issue 75.
+
+## 0.1.27
+
+* Don't throw an error when the `file` property is missing in SourceMapConsumer,
+  we don't use it anyway.
+
+## 0.1.26
+
+* Fix SourceNode.fromStringWithSourceMap for empty maps. Fixes github issue 70.
+
+## 0.1.25
+
+* Make compatible with browserify
+
+## 0.1.24
+
+* Fix issue with absolute paths and `file://` URIs. See
+  https://bugzilla.mozilla.org/show_bug.cgi?id=885597
+
+## 0.1.23
+
+* Fix issue with absolute paths and sourcesContent, github issue 64.
+
+## 0.1.22
+
+* Ignore duplicate mappings in SourceMapGenerator. Fixes github issue 21.
+
+## 0.1.21
+
+* Fixed handling of sources that start with a slash so that they are relative to
+  the source root's host.
+
+## 0.1.20
+
+* Fixed github issue #43: absolute URLs aren't joined with the source root
+  anymore.
+
+## 0.1.19
+
+* Using Travis CI to run tests.
+
+## 0.1.18
+
+* Fixed a bug in the handling of sourceRoot.
+
+## 0.1.17
+
+* Added SourceNode.fromStringWithSourceMap.
+
+## 0.1.16
+
+* Added missing documentation.
+
+* Fixed the generating of empty mappings in SourceNode.
+
+## 0.1.15
+
+* Added SourceMapGenerator.applySourceMap.
+
+## 0.1.14
+
+* The sourceRoot is now handled consistently.
+
+## 0.1.13
+
+* Added SourceMapGenerator.fromSourceMap.
+
+## 0.1.12
+
+* SourceNode now generates empty mappings too.
+
+## 0.1.11
+
+* Added name support to SourceNode.
+
+## 0.1.10
+
+* Added sourcesContent support to the customer and generator.
diff --git a/node_modules/source-map/LICENSE b/node_modules/source-map/LICENSE
new file mode 100644
index 0000000..ed1b7cf
--- /dev/null
+++ b/node_modules/source-map/LICENSE
@@ -0,0 +1,28 @@
+
+Copyright (c) 2009-2011, Mozilla Foundation and contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the names of the Mozilla Foundation nor the names of project
+  contributors may be used to endorse or promote products derived from this
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/source-map/README.md b/node_modules/source-map/README.md
new file mode 100644
index 0000000..db20846
--- /dev/null
+++ b/node_modules/source-map/README.md
@@ -0,0 +1,822 @@
+# Source Map
+
+[![Build Status](https://travis-ci.org/mozilla/source-map.png?branch=master)](https://travis-ci.org/mozilla/source-map)
+
+[![Coverage Status](https://coveralls.io/repos/github/mozilla/source-map/badge.svg)](https://coveralls.io/github/mozilla/source-map)
+
+[![NPM](https://nodei.co/npm/source-map.png?downloads=true&downloadRank=true)](https://www.npmjs.com/package/source-map)
+
+This is a library to generate and consume the source map format
+[described here][format].
+
+[format]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit
+
+## Use with Node
+
+    $ npm install source-map
+
+## Use on the Web
+
+    <script src="https://unpkg.com/source-map@0.7.3/dist/source-map.js"></script>
+    <script>
+        sourceMap.SourceMapConsumer.initialize({
+            "lib/mappings.wasm": "https://unpkg.com/source-map@0.7.3/lib/mappings.wasm"
+        });
+    </script>
+
+--------------------------------------------------------------------------------
+
+<!-- `npm run toc` to regenerate the Table of Contents -->
+
+<!-- START doctoc generated TOC please keep comment here to allow auto update -->
+<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE -->
+## Table of Contents
+
+- [Examples](#examples)
+  - [Consuming a source map](#consuming-a-source-map)
+  - [Generating a source map](#generating-a-source-map)
+    - [With SourceNode (high level API)](#with-sourcenode-high-level-api)
+    - [With SourceMapGenerator (low level API)](#with-sourcemapgenerator-low-level-api)
+- [API](#api)
+  - [SourceMapConsumer](#sourcemapconsumer)
+    - [SourceMapConsumer.initialize(options)](#sourcemapconsumerinitializeoptions)
+    - [new SourceMapConsumer(rawSourceMap)](#new-sourcemapconsumerrawsourcemap)
+    - [SourceMapConsumer.with](#sourcemapconsumerwith)
+    - [SourceMapConsumer.prototype.destroy()](#sourcemapconsumerprototypedestroy)
+    - [SourceMapConsumer.prototype.computeColumnSpans()](#sourcemapconsumerprototypecomputecolumnspans)
+    - [SourceMapConsumer.prototype.originalPositionFor(generatedPosition)](#sourcemapconsumerprototypeoriginalpositionforgeneratedposition)
+    - [SourceMapConsumer.prototype.generatedPositionFor(originalPosition)](#sourcemapconsumerprototypegeneratedpositionfororiginalposition)
+    - [SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)](#sourcemapconsumerprototypeallgeneratedpositionsfororiginalposition)
+    - [SourceMapConsumer.prototype.hasContentsOfAllSources()](#sourcemapconsumerprototypehascontentsofallsources)
+    - [SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])](#sourcemapconsumerprototypesourcecontentforsource-returnnullonmissing)
+    - [SourceMapConsumer.prototype.eachMapping(callback, context, order)](#sourcemapconsumerprototypeeachmappingcallback-context-order)
+  - [SourceMapGenerator](#sourcemapgenerator)
+    - [new SourceMapGenerator([startOfSourceMap])](#new-sourcemapgeneratorstartofsourcemap)
+    - [SourceMapGenerator.fromSourceMap(sourceMapConsumer)](#sourcemapgeneratorfromsourcemapsourcemapconsumer)
+    - [SourceMapGenerator.prototype.addMapping(mapping)](#sourcemapgeneratorprototypeaddmappingmapping)
+    - [SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)](#sourcemapgeneratorprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])](#sourcemapgeneratorprototypeapplysourcemapsourcemapconsumer-sourcefile-sourcemappath)
+    - [SourceMapGenerator.prototype.toString()](#sourcemapgeneratorprototypetostring)
+  - [SourceNode](#sourcenode)
+    - [new SourceNode([line, column, source[, chunk[, name]]])](#new-sourcenodeline-column-source-chunk-name)
+    - [SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])](#sourcenodefromstringwithsourcemapcode-sourcemapconsumer-relativepath)
+    - [SourceNode.prototype.add(chunk)](#sourcenodeprototypeaddchunk)
+    - [SourceNode.prototype.prepend(chunk)](#sourcenodeprototypeprependchunk)
+    - [SourceNode.prototype.setSourceContent(sourceFile, sourceContent)](#sourcenodeprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceNode.prototype.walk(fn)](#sourcenodeprototypewalkfn)
+    - [SourceNode.prototype.walkSourceContents(fn)](#sourcenodeprototypewalksourcecontentsfn)
+    - [SourceNode.prototype.join(sep)](#sourcenodeprototypejoinsep)
+    - [SourceNode.prototype.replaceRight(pattern, replacement)](#sourcenodeprototypereplacerightpattern-replacement)
+    - [SourceNode.prototype.toString()](#sourcenodeprototypetostring)
+    - [SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])](#sourcenodeprototypetostringwithsourcemapstartofsourcemap)
+
+<!-- END doctoc generated TOC please keep comment here to allow auto update -->
+
+## Examples
+
+### Consuming a source map
+
+```js
+const rawSourceMap = {
+  version: 3,
+  file: 'min.js',
+  names: ['bar', 'baz', 'n'],
+  sources: ['one.js', 'two.js'],
+  sourceRoot: 'http://example.com/www/js/',
+  mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'
+};
+
+const whatever = await SourceMapConsumer.with(rawSourceMap, null, consumer => {
+
+  console.log(consumer.sources);
+  // [ 'http://example.com/www/js/one.js',
+  //   'http://example.com/www/js/two.js' ]
+
+  console.log(consumer.originalPositionFor({
+    line: 2,
+    column: 28
+  }));
+  // { source: 'http://example.com/www/js/two.js',
+  //   line: 2,
+  //   column: 10,
+  //   name: 'n' }
+
+  console.log(consumer.generatedPositionFor({
+    source: 'http://example.com/www/js/two.js',
+    line: 2,
+    column: 10
+  }));
+  // { line: 2, column: 28 }
+
+  consumer.eachMapping(function (m) {
+    // ...
+  });
+
+  return computeWhatever();
+});
+```
+
+### Generating a source map
+
+In depth guide:
+[**Compiling to JavaScript, and Debugging with Source Maps**](https://hacks.mozilla.org/2013/05/compiling-to-javascript-and-debugging-with-source-maps/)
+
+#### With SourceNode (high level API)
+
+```js
+function compile(ast) {
+  switch (ast.type) {
+  case 'BinaryExpression':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      [compile(ast.left), " + ", compile(ast.right)]
+    );
+  case 'Literal':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      String(ast.value)
+    );
+  // ...
+  default:
+    throw new Error("Bad AST");
+  }
+}
+
+var ast = parse("40 + 2", "add.js");
+console.log(compile(ast).toStringWithSourceMap({
+  file: 'add.js'
+}));
+// { code: '40 + 2',
+//   map: [object SourceMapGenerator] }
+```
+
+#### With SourceMapGenerator (low level API)
+
+```js
+var map = new SourceMapGenerator({
+  file: "source-mapped.js"
+});
+
+map.addMapping({
+  generated: {
+    line: 10,
+    column: 35
+  },
+  source: "foo.js",
+  original: {
+    line: 33,
+    column: 2
+  },
+  name: "christopher"
+});
+
+console.log(map.toString());
+// '{"version":3,"file":"source-mapped.js","sources":["foo.js"],"names":["christopher"],"mappings":";;;;;;;;;mCAgCEA"}'
+```
+
+## API
+
+Get a reference to the module:
+
+```js
+// Node.js
+var sourceMap = require('source-map');
+
+// Browser builds
+var sourceMap = window.sourceMap;
+
+// Inside Firefox
+const sourceMap = require("devtools/toolkit/sourcemap/source-map.js");
+```
+
+### SourceMapConsumer
+
+A `SourceMapConsumer` instance represents a parsed source map which we can query
+for information about the original file positions by giving it a file position
+in the generated source.
+
+#### SourceMapConsumer.initialize(options)
+
+When using `SourceMapConsumer` outside of node.js, for example on the Web, it
+needs to know from what URL to load `lib/mappings.wasm`. You must inform it by
+calling `initialize` before constructing any `SourceMapConsumer`s.
+
+The options object has the following properties:
+
+* `"lib/mappings.wasm"`: A `String` containing the URL of the
+  `lib/mappings.wasm` file.
+
+```js
+sourceMap.SourceMapConsumer.initialize({
+  "lib/mappings.wasm": "https://example.com/source-map/lib/mappings.wasm"
+});
+```
+
+#### new SourceMapConsumer(rawSourceMap)
+
+The only parameter is the raw source map (either as a string which can be
+`JSON.parse`'d, or an object). According to the spec, source maps have the
+following attributes:
+
+* `version`: Which version of the source map spec this map is following.
+
+* `sources`: An array of URLs to the original source files.
+
+* `names`: An array of identifiers which can be referenced by individual
+  mappings.
+
+* `sourceRoot`: Optional. The URL root from which all sources are relative.
+
+* `sourcesContent`: Optional. An array of contents of the original source files.
+
+* `mappings`: A string of base64 VLQs which contain the actual mappings.
+
+* `file`: Optional. The generated filename this source map is associated with.
+
+The promise of the constructed souce map consumer is returned.
+
+When the `SourceMapConsumer` will no longer be used anymore, you must call its
+`destroy` method.
+
+```js
+const consumer = await new sourceMap.SourceMapConsumer(rawSourceMapJsonData);
+doStuffWith(consumer);
+consumer.destroy();
+```
+
+Alternatively, you can use `SourceMapConsumer.with` to avoid needing to remember
+to call `destroy`.
+
+#### SourceMapConsumer.with
+
+Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+(see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+value.
+
+You must not use the consumer after `f` completes!
+
+By using `with`, you do not have to remember to manually call `destroy` on
+the consumer, since it will be called automatically once `f` completes.
+
+```js
+const xSquared = await SourceMapConsumer.with(
+  myRawSourceMap,
+  null,
+  async function (consumer) {
+    // Use `consumer` inside here and don't worry about remembering
+    // to call `destroy`.
+
+    const x = await whatever(consumer);
+    return x * x;
+  }
+);
+
+// You may not use that `consumer` anymore out here; it has
+// been destroyed. But you can use `xSquared`.
+console.log(xSquared);
+```
+
+#### SourceMapConsumer.prototype.destroy()
+
+Free this source map consumer's associated wasm data that is manually-managed.
+
+```js
+consumer.destroy();
+```
+
+Alternatively, you can use `SourceMapConsumer.with` to avoid needing to remember
+to call `destroy`.
+
+#### SourceMapConsumer.prototype.computeColumnSpans()
+
+Compute the last column for each generated mapping. The last column is
+inclusive.
+
+```js
+// Before:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+
+consumer.computeColumnSpans();
+
+// After:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1,
+//     lastColumn: 9 },
+//   { line: 2,
+//     column: 10,
+//     lastColumn: 19 },
+//   { line: 2,
+//     column: 20,
+//     lastColumn: Infinity } ]
+```
+
+#### SourceMapConsumer.prototype.originalPositionFor(generatedPosition)
+
+Returns the original source, line, and column information for the generated
+source's line and column positions provided. The only argument is an object with
+the following properties:
+
+* `line`: The line number in the generated source.  Line numbers in
+  this library are 1-based (note that the underlying source map
+  specification uses 0-based line numbers -- this library handles the
+  translation).
+
+* `column`: The column number in the generated source.  Column numbers
+  in this library are 0-based.
+
+* `bias`: Either `SourceMapConsumer.GREATEST_LOWER_BOUND` or
+  `SourceMapConsumer.LEAST_UPPER_BOUND`. Specifies whether to return the closest
+  element that is smaller than or greater than the one we are searching for,
+  respectively, if the exact element cannot be found.  Defaults to
+  `SourceMapConsumer.GREATEST_LOWER_BOUND`.
+
+and an object is returned with the following properties:
+
+* `source`: The original source file, or null if this information is not
+  available.
+
+* `line`: The line number in the original source, or null if this information is
+  not available.  The line number is 1-based.
+
+* `column`: The column number in the original source, or null if this
+  information is not available.  The column number is 0-based.
+
+* `name`: The original identifier, or null if this information is not available.
+
+```js
+consumer.originalPositionFor({ line: 2, column: 10 })
+// { source: 'foo.coffee',
+//   line: 2,
+//   column: 2,
+//   name: null }
+
+consumer.originalPositionFor({ line: 99999999999999999, column: 999999999999999 })
+// { source: null,
+//   line: null,
+//   column: null,
+//   name: null }
+```
+
+#### SourceMapConsumer.prototype.generatedPositionFor(originalPosition)
+
+Returns the generated line and column information for the original source,
+line, and column positions provided. The only argument is an object with
+the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: The column number in the original source.  The column
+  number is 0-based.
+
+and an object is returned with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.generatedPositionFor({ source: "example.js", line: 2, column: 10 })
+// { line: 1,
+//   column: 56 }
+```
+
+#### SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)
+
+Returns all generated line and column information for the original source, line,
+and column provided. If no column is provided, returns all mappings
+corresponding to a either the line we are searching for or the next closest line
+that has any mappings. Otherwise, returns all mappings corresponding to the
+given line and either the column we are searching for or the next closest column
+that has any offsets.
+
+The only argument is an object with the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: Optional. The column number in the original source.  The
+  column number is 0-based.
+
+and an array of objects is returned, each with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.allGeneratedpositionsfor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+```
+
+#### SourceMapConsumer.prototype.hasContentsOfAllSources()
+
+Return true if we have the embedded source content for every source listed in
+the source map, false otherwise.
+
+In other words, if this method returns `true`, then
+`consumer.sourceContentFor(s)` will succeed for every source `s` in
+`consumer.sources`.
+
+```js
+// ...
+if (consumer.hasContentsOfAllSources()) {
+  consumerReadyCallback(consumer);
+} else {
+  fetchSources(consumer, consumerReadyCallback);
+}
+// ...
+```
+
+#### SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])
+
+Returns the original source content for the source provided. The only
+argument is the URL of the original source file.
+
+If the source content for the given source is not found, then an error is
+thrown. Optionally, pass `true` as the second param to have `null` returned
+instead.
+
+```js
+consumer.sources
+// [ "my-cool-lib.clj" ]
+
+consumer.sourceContentFor("my-cool-lib.clj")
+// "..."
+
+consumer.sourceContentFor("this is not in the source map");
+// Error: "this is not in the source map" is not in the source map
+
+consumer.sourceContentFor("this is not in the source map", true);
+// null
+```
+
+#### SourceMapConsumer.prototype.eachMapping(callback, context, order)
+
+Iterate over each mapping between an original source/line/column and a
+generated line/column in this source map.
+
+* `callback`: The function that is called with each mapping. Mappings have the
+  form `{ source, generatedLine, generatedColumn, originalLine, originalColumn,
+  name }`
+
+* `context`: Optional. If specified, this object will be the value of `this`
+  every time that `callback` is called.
+
+* `order`: Either `SourceMapConsumer.GENERATED_ORDER` or
+  `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to iterate over
+  the mappings sorted by the generated file's line/column order or the
+  original's source/line/column order, respectively. Defaults to
+  `SourceMapConsumer.GENERATED_ORDER`.
+
+```js
+consumer.eachMapping(function (m) { console.log(m); })
+// ...
+// { source: 'illmatic.js',
+//   generatedLine: 1,
+//   generatedColumn: 0,
+//   originalLine: 1,
+//   originalColumn: 0,
+//   name: null }
+// { source: 'illmatic.js',
+//   generatedLine: 2,
+//   generatedColumn: 0,
+//   originalLine: 2,
+//   originalColumn: 0,
+//   name: null }
+// ...
+```
+### SourceMapGenerator
+
+An instance of the SourceMapGenerator represents a source map which is being
+built incrementally.
+
+#### new SourceMapGenerator([startOfSourceMap])
+
+You may pass an object with the following properties:
+
+* `file`: The filename of the generated source that this source map is
+  associated with.
+
+* `sourceRoot`: A root for all relative URLs in this source map.
+
+* `skipValidation`: Optional. When `true`, disables validation of mappings as
+  they are added. This can improve performance but should be used with
+  discretion, as a last resort. Even then, one should avoid using this flag when
+  running tests, if possible.
+
+```js
+var generator = new sourceMap.SourceMapGenerator({
+  file: "my-generated-javascript-file.js",
+  sourceRoot: "http://example.com/app/js/"
+});
+```
+
+#### SourceMapGenerator.fromSourceMap(sourceMapConsumer)
+
+Creates a new `SourceMapGenerator` from an existing `SourceMapConsumer` instance.
+
+* `sourceMapConsumer` The SourceMap.
+
+```js
+var generator = sourceMap.SourceMapGenerator.fromSourceMap(consumer);
+```
+
+#### SourceMapGenerator.prototype.addMapping(mapping)
+
+Add a single mapping from original source line and column to the generated
+source's line and column for this source map being created. The mapping object
+should have the following properties:
+
+* `generated`: An object with the generated line and column positions.
+
+* `original`: An object with the original line and column positions.
+
+* `source`: The original source file (relative to the sourceRoot).
+
+* `name`: An optional original token name for this mapping.
+
+```js
+generator.addMapping({
+  source: "module-one.scm",
+  original: { line: 128, column: 0 },
+  generated: { line: 3, column: 456 }
+})
+```
+
+#### SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for an original source file.
+
+* `sourceFile` the URL of the original source file.
+
+* `sourceContent` the content of the source file.
+
+```js
+generator.setSourceContent("module-one.scm",
+                           fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])
+
+Applies a SourceMap for a source file to the SourceMap.
+Each mapping to the supplied source file is rewritten using the
+supplied SourceMap. Note: The resolution for the resulting mappings
+is the minimum of this map and the supplied map.
+
+* `sourceMapConsumer`: The SourceMap to be applied.
+
+* `sourceFile`: Optional. The filename of the source file.
+  If omitted, sourceMapConsumer.file will be used, if it exists.
+  Otherwise an error will be thrown.
+
+* `sourceMapPath`: Optional. The dirname of the path to the SourceMap
+  to be applied. If relative, it is relative to the SourceMap.
+
+  This parameter is needed when the two SourceMaps aren't in the same
+  directory, and the SourceMap to be applied contains relative source
+  paths. If so, those relative source paths need to be rewritten
+  relative to the SourceMap.
+
+  If omitted, it is assumed that both SourceMaps are in the same directory,
+  thus not needing any rewriting. (Supplying `'.'` has the same effect.)
+
+#### SourceMapGenerator.prototype.toString()
+
+Renders the source map being generated to a string.
+
+```js
+generator.toString()
+// '{"version":3,"sources":["module-one.scm"],"names":[],"mappings":"...snip...","file":"my-generated-javascript-file.js","sourceRoot":"http://example.com/app/js/"}'
+```
+
+### SourceNode
+
+SourceNodes provide a way to abstract over interpolating and/or concatenating
+snippets of generated JavaScript source code, while maintaining the line and
+column information associated between those snippets and the original source
+code. This is useful as the final intermediate representation a compiler might
+use before outputting the generated JS and source map.
+
+#### new SourceNode([line, column, source[, chunk[, name]]])
+
+* `line`: The original line number associated with this source node, or null if
+  it isn't associated with an original line.  The line number is 1-based.
+
+* `column`: The original column number associated with this source node, or null
+  if it isn't associated with an original column.  The column number
+  is 0-based.
+
+* `source`: The original source's filename; null if no filename is provided.
+
+* `chunk`: Optional. Is immediately passed to `SourceNode.prototype.add`, see
+  below.
+
+* `name`: Optional. The original identifier.
+
+```js
+var node = new SourceNode(1, 2, "a.cpp", [
+  new SourceNode(3, 4, "b.cpp", "extern int status;\n"),
+  new SourceNode(5, 6, "c.cpp", "std::string* make_string(size_t n);\n"),
+  new SourceNode(7, 8, "d.cpp", "int main(int argc, char** argv) {}\n"),
+]);
+```
+
+#### SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])
+
+Creates a SourceNode from generated code and a SourceMapConsumer.
+
+* `code`: The generated code
+
+* `sourceMapConsumer` The SourceMap for the generated code
+
+* `relativePath` The optional path that relative sources in `sourceMapConsumer`
+  should be relative to.
+
+```js
+const consumer = await new SourceMapConsumer(fs.readFileSync("path/to/my-file.js.map", "utf8"));
+const node = SourceNode.fromStringWithSourceMap(fs.readFileSync("path/to/my-file.js"), consumer);
+```
+
+#### SourceNode.prototype.add(chunk)
+
+Add a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.add(" + ");
+node.add(otherNode);
+node.add([leftHandOperandNode, " + ", rightHandOperandNode]);
+```
+
+#### SourceNode.prototype.prepend(chunk)
+
+Prepend a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.prepend("/** Build Id: f783haef86324gf **/\n\n");
+```
+
+#### SourceNode.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for a source file. This will be added to the
+`SourceMap` in the `sourcesContent` field.
+
+* `sourceFile`: The filename of the source file
+
+* `sourceContent`: The content of the source file
+
+```js
+node.setSourceContent("module-one.scm",
+                      fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceNode.prototype.walk(fn)
+
+Walk over the tree of JS snippets in this node and its children. The walking
+function is called once for each snippet of JS and is passed that snippet and
+the its original associated source's line/column location.
+
+* `fn`: The traversal function.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.walk(function (code, loc) { console.log("WALK:", code, loc); })
+// WALK: uno { source: 'b.js', line: 3, column: 4, name: null }
+// WALK: dos { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: tres { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: quatro { source: 'c.js', line: 5, column: 6, name: null }
+```
+
+#### SourceNode.prototype.walkSourceContents(fn)
+
+Walk over the tree of SourceNodes. The walking function is called for each
+source file content and is passed the filename and source content.
+
+* `fn`: The traversal function.
+
+```js
+var a = new SourceNode(1, 2, "a.js", "generated from a");
+a.setSourceContent("a.js", "original a");
+var b = new SourceNode(1, 2, "b.js", "generated from b");
+b.setSourceContent("b.js", "original b");
+var c = new SourceNode(1, 2, "c.js", "generated from c");
+c.setSourceContent("c.js", "original c");
+
+var node = new SourceNode(null, null, null, [a, b, c]);
+node.walkSourceContents(function (source, contents) { console.log("WALK:", source, ":", contents); })
+// WALK: a.js : original a
+// WALK: b.js : original b
+// WALK: c.js : original c
+```
+
+#### SourceNode.prototype.join(sep)
+
+Like `Array.prototype.join` except for SourceNodes. Inserts the separator
+between each of this source node's children.
+
+* `sep`: The separator.
+
+```js
+var lhs = new SourceNode(1, 2, "a.rs", "my_copy");
+var operand = new SourceNode(3, 4, "a.rs", "=");
+var rhs = new SourceNode(5, 6, "a.rs", "orig.clone()");
+
+var node = new SourceNode(null, null, null, [ lhs, operand, rhs ]);
+var joinedNode = node.join(" ");
+```
+
+#### SourceNode.prototype.replaceRight(pattern, replacement)
+
+Call `String.prototype.replace` on the very right-most source snippet. Useful
+for trimming white space from the end of a source node, etc.
+
+* `pattern`: The pattern to replace.
+
+* `replacement`: The thing to replace the pattern with.
+
+```js
+// Trim trailing white space.
+node.replaceRight(/\s*$/, "");
+```
+
+#### SourceNode.prototype.toString()
+
+Return the string representation of this source node. Walks over the tree and
+concatenates all the various snippets together to one string.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toString()
+// 'unodostresquatro'
+```
+
+#### SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])
+
+Returns the string representation of this tree of source nodes, plus a
+SourceMapGenerator which contains all the mappings between the generated and
+original sources.
+
+The arguments are the same as those to `new SourceMapGenerator`.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toStringWithSourceMap({ file: "my-output-file.js" })
+// { code: 'unodostresquatro',
+//   map: [object SourceMapGenerator] }
+```
diff --git a/node_modules/source-map/dist/source-map.js b/node_modules/source-map/dist/source-map.js
new file mode 100644
index 0000000..a947957
--- /dev/null
+++ b/node_modules/source-map/dist/source-map.js
@@ -0,0 +1,3351 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory(require("fs"), require("path"));
+	else if(typeof define === 'function' && define.amd)
+		define(["fs", "path"], factory);
+	else if(typeof exports === 'object')
+		exports["sourceMap"] = factory(require("fs"), require("path"));
+	else
+		root["sourceMap"] = factory(root["fs"], root["path"]);
+})(typeof self !== 'undefined' ? self : this, function(__WEBPACK_EXTERNAL_MODULE_10__, __WEBPACK_EXTERNAL_MODULE_11__) {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId]) {
+/******/ 			return installedModules[moduleId].exports;
+/******/ 		}
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			i: moduleId,
+/******/ 			l: false,
+/******/ 			exports: {}
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.l = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// define getter function for harmony exports
+/******/ 	__webpack_require__.d = function(exports, name, getter) {
+/******/ 		if(!__webpack_require__.o(exports, name)) {
+/******/ 			Object.defineProperty(exports, name, {
+/******/ 				configurable: false,
+/******/ 				enumerable: true,
+/******/ 				get: getter
+/******/ 			});
+/******/ 		}
+/******/ 	};
+/******/
+/******/ 	// getDefaultExport function for compatibility with non-harmony modules
+/******/ 	__webpack_require__.n = function(module) {
+/******/ 		var getter = module && module.__esModule ?
+/******/ 			function getDefault() { return module['default']; } :
+/******/ 			function getModuleExports() { return module; };
+/******/ 		__webpack_require__.d(getter, 'a', getter);
+/******/ 		return getter;
+/******/ 	};
+/******/
+/******/ 	// Object.prototype.hasOwnProperty.call
+/******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(__webpack_require__.s = 5);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  }
+    throw new Error('"' + aName + '" is a required argument.');
+
+}
+exports.getArg = getArg;
+
+const urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+const dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  const match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  let url = "";
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ":";
+  }
+  url += "//";
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + "@";
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port;
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+const MAX_CACHED_INPUTS = 32;
+
+/**
+ * Takes some function `f(input) -> result` and returns a memoized version of
+ * `f`.
+ *
+ * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+ * memoization is a dumb-simple, linear least-recently-used cache.
+ */
+function lruMemoize(f) {
+  const cache = [];
+
+  return function(input) {
+    for (let i = 0; i < cache.length; i++) {
+      if (cache[i].input === input) {
+        const temp = cache[0];
+        cache[0] = cache[i];
+        cache[i] = temp;
+        return cache[0].result;
+      }
+    }
+
+    const result = f(input);
+
+    cache.unshift({
+      input,
+      result,
+    });
+
+    if (cache.length > MAX_CACHED_INPUTS) {
+      cache.pop();
+    }
+
+    return result;
+  };
+}
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+const normalize = lruMemoize(function normalize(aPath) {
+  let path = aPath;
+  const url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  const isAbsolute = exports.isAbsolute(path);
+
+  // Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  const parts = [];
+  let start = 0;
+  let i = 0;
+  while (true) {
+    start = i;
+    i = path.indexOf("/", start);
+    if (i === -1) {
+      parts.push(path.slice(start));
+      break;
+    } else {
+      parts.push(path.slice(start, i));
+      while (i < path.length && path[i] === "/") {
+        i++;
+      }
+    }
+  }
+
+  let up = 0;
+  for (i = parts.length - 1; i >= 0; i--) {
+    const part = parts[i];
+    if (part === ".") {
+      parts.splice(i, 1);
+    } else if (part === "..") {
+      up++;
+    } else if (up > 0) {
+      if (part === "") {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join("/");
+
+  if (path === "") {
+    path = isAbsolute ? "/" : ".";
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+});
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  const aPathUrl = urlParse(aPath);
+  const aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || "/";
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  const joined = aPath.charAt(0) === "/"
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function(aPath) {
+  return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, "");
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  let level = 0;
+  while (aPath.indexOf(aRoot + "/") !== 0) {
+    const index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+const supportsNullProto = (function() {
+  const obj = Object.create(null);
+  return !("__proto__" in obj);
+}());
+
+function identity(s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return "$" + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  const length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  /* eslint-disable no-multi-spaces */
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+  /* eslint-enable no-multi-spaces */
+
+  for (let i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  let cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || "";
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") {
+      sourceRoot += "/";
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    const parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      const index = parsed.path.lastIndexOf("/");
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
+
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const base64VLQ = __webpack_require__(2);
+const util = __webpack_require__(0);
+const ArraySet = __webpack_require__(3).ArraySet;
+const MappingList = __webpack_require__(7).MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+class SourceMapGenerator {
+  constructor(aArgs) {
+    if (!aArgs) {
+      aArgs = {};
+    }
+    this._file = util.getArg(aArgs, "file", null);
+    this._sourceRoot = util.getArg(aArgs, "sourceRoot", null);
+    this._skipValidation = util.getArg(aArgs, "skipValidation", false);
+    this._sources = new ArraySet();
+    this._names = new ArraySet();
+    this._mappings = new MappingList();
+    this._sourcesContents = null;
+  }
+
+  /**
+   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+   *
+   * @param aSourceMapConsumer The SourceMap.
+   */
+  static fromSourceMap(aSourceMapConsumer) {
+    const sourceRoot = aSourceMapConsumer.sourceRoot;
+    const generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      const newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      let sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  }
+
+  /**
+   * Add a single mapping from original source line and column to the generated
+   * source's line and column for this source map being created. The mapping
+   * object should have the following properties:
+   *
+   *   - generated: An object with the generated line and column positions.
+   *   - original: An object with the original line and column positions.
+   *   - source: The original source file (relative to the sourceRoot).
+   *   - name: An optional original token name for this mapping.
+   */
+  addMapping(aArgs) {
+    const generated = util.getArg(aArgs, "generated");
+    const original = util.getArg(aArgs, "original", null);
+    let source = util.getArg(aArgs, "source", null);
+    let name = util.getArg(aArgs, "name", null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source,
+      name
+    });
+  }
+
+  /**
+   * Set the source content for a source file.
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    let source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  }
+
+  /**
+   * Applies the mappings of a sub-source-map for a specific source file to the
+   * source map being generated. Each mapping to the supplied source file is
+   * rewritten using the supplied source map. Note: The resolution for the
+   * resulting mappings is the minimium of this map and the supplied map.
+   *
+   * @param aSourceMapConsumer The source map to be applied.
+   * @param aSourceFile Optional. The filename of the source file.
+   *        If omitted, SourceMapConsumer's file property will be used.
+   * @param aSourceMapPath Optional. The dirname of the path to the source map
+   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+   *        This parameter is needed when the two source maps aren't in the same
+   *        directory, and the source map to be applied contains relative source
+   *        paths. If so, those relative source paths need to be rewritten
+   *        relative to the SourceMapGenerator.
+   */
+  applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    let sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          "SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, " +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    const sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    const newSources = this._mappings.toArray().length > 0
+      ? new ArraySet()
+      : this._sources;
+    const newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function(mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        const original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source);
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      const source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      const name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function(srcFile) {
+      const content = aSourceMapConsumer.sourceContentFor(srcFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          srcFile = util.join(aSourceMapPath, srcFile);
+        }
+        if (sourceRoot != null) {
+          srcFile = util.relative(sourceRoot, srcFile);
+        }
+        this.setSourceContent(srcFile, content);
+      }
+    }, this);
+  }
+
+  /**
+   * A mapping can have one of the three levels of data:
+   *
+   *   1. Just the generated position.
+   *   2. The Generated position, original position, and original source.
+   *   3. Generated and original position, original source, as well as a name
+   *      token.
+   *
+   * To maintain consistency, we validate that any new mapping being added falls
+   * in to one of these categories.
+   */
+  _validateMapping(aGenerated, aOriginal, aSource, aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+        throw new Error(
+            "original.line and original.column are not numbers -- you probably meant to omit " +
+            "the original mapping entirely and only map the generated position. If so, pass " +
+            "null for the original mapping instead of an object with empty or null values."
+        );
+    }
+
+    if (aGenerated && "line" in aGenerated && "column" in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+
+    } else if (aGenerated && "line" in aGenerated && "column" in aGenerated
+             && aOriginal && "line" in aOriginal && "column" in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+
+    } else {
+      throw new Error("Invalid mapping: " + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  }
+
+  /**
+   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+   * specified by the source map format.
+   */
+  _serializeMappings() {
+    let previousGeneratedColumn = 0;
+    let previousGeneratedLine = 1;
+    let previousOriginalColumn = 0;
+    let previousOriginalLine = 0;
+    let previousName = 0;
+    let previousSource = 0;
+    let result = "";
+    let next;
+    let mapping;
+    let nameIdx;
+    let sourceIdx;
+
+    const mappings = this._mappings.toArray();
+    for (let i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = "";
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ";";
+          previousGeneratedLine++;
+        }
+      } else if (i > 0) {
+        if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+          continue;
+        }
+        next += ",";
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  }
+
+  _generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function(source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      const key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  }
+
+  /**
+   * Externalize the source map.
+   */
+  toJSON() {
+    const map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  }
+
+  /**
+   * Render the source map being generated to a string.
+   */
+  toString() {
+    return JSON.stringify(this.toJSON());
+  }
+}
+
+SourceMapGenerator.prototype._version = 3;
+exports.SourceMapGenerator = SourceMapGenerator;
+
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+const base64 = __webpack_require__(6);
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+const VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+const VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+const VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+const VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+// eslint-disable-next-line no-unused-vars
+function fromVLQSigned(aValue) {
+  const isNegative = (aValue & 1) === 1;
+  const shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  let encoded = "";
+  let digit;
+
+  let vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+class ArraySet {
+  constructor() {
+    this._array = [];
+    this._set = new Map();
+  }
+
+  /**
+   * Static method for creating ArraySet instances from an existing array.
+   */
+  static fromArray(aArray, aAllowDuplicates) {
+    const set = new ArraySet();
+    for (let i = 0, len = aArray.length; i < len; i++) {
+      set.add(aArray[i], aAllowDuplicates);
+    }
+    return set;
+  }
+
+  /**
+   * Return how many unique items are in this ArraySet. If duplicates have been
+   * added, than those do not count towards the size.
+   *
+   * @returns Number
+   */
+  size() {
+    return this._set.size;
+  }
+
+  /**
+   * Add the given string to this set.
+   *
+   * @param String aStr
+   */
+  add(aStr, aAllowDuplicates) {
+    const isDuplicate = this.has(aStr);
+    const idx = this._array.length;
+    if (!isDuplicate || aAllowDuplicates) {
+      this._array.push(aStr);
+    }
+    if (!isDuplicate) {
+      this._set.set(aStr, idx);
+    }
+  }
+
+  /**
+   * Is the given string a member of this set?
+   *
+   * @param String aStr
+   */
+  has(aStr) {
+      return this._set.has(aStr);
+  }
+
+  /**
+   * What is the index of the given string in the array?
+   *
+   * @param String aStr
+   */
+  indexOf(aStr) {
+    const idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+    throw new Error('"' + aStr + '" is not in the set.');
+  }
+
+  /**
+   * What is the element at the given index?
+   *
+   * @param Number aIdx
+   */
+  at(aIdx) {
+    if (aIdx >= 0 && aIdx < this._array.length) {
+      return this._array[aIdx];
+    }
+    throw new Error("No element indexed by " + aIdx);
+  }
+
+  /**
+   * Returns the array representation of this set (which has the proper indices
+   * indicated by indexOf). Note that this is a copy of the internal array used
+   * for storing the members so that no one can mess with internal state.
+   */
+  toArray() {
+    return this._array.slice();
+  }
+}
+exports.ArraySet = ArraySet;
+
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* WEBPACK VAR INJECTION */(function(__dirname) {if (typeof fetch === "function") {
+  // Web version of reading a wasm file into an array buffer.
+
+  let mappingsWasmUrl = null;
+
+  module.exports = function readWasm() {
+    if (typeof mappingsWasmUrl !== "string") {
+      throw new Error("You must provide the URL of lib/mappings.wasm by calling " +
+                      "SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) " +
+                      "before using SourceMapConsumer");
+    }
+
+    return fetch(mappingsWasmUrl)
+      .then(response => response.arrayBuffer());
+  };
+
+  module.exports.initialize = url => mappingsWasmUrl = url;
+} else {
+  // Node version of reading a wasm file into an array buffer.
+  const fs = __webpack_require__(10);
+  const path = __webpack_require__(11);
+
+  module.exports = function readWasm() {
+    return new Promise((resolve, reject) => {
+      const wasmPath = path.join(__dirname, "mappings.wasm");
+      fs.readFile(wasmPath, null, (error, data) => {
+        if (error) {
+          reject(error);
+          return;
+        }
+
+        resolve(data.buffer);
+      });
+    });
+  };
+
+  module.exports.initialize = _ => {
+    console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");
+  };
+}
+
+/* WEBPACK VAR INJECTION */}.call(exports, "/"))
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+exports.SourceMapConsumer = __webpack_require__(8).SourceMapConsumer;
+exports.SourceNode = __webpack_require__(13).SourceNode;
+
+
+/***/ }),
+/* 6 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function(number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = __webpack_require__(0);
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  const lineA = mappingA.generatedLine;
+  const lineB = mappingB.generatedLine;
+  const columnA = mappingA.generatedColumn;
+  const columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a negligible overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+class MappingList {
+  constructor() {
+    this._array = [];
+    this._sorted = true;
+    // Serves as infimum
+    this._last = {generatedLine: -1, generatedColumn: 0};
+  }
+
+  /**
+   * Iterate through internal items. This method takes the same arguments that
+   * `Array.prototype.forEach` takes.
+   *
+   * NOTE: The order of the mappings is NOT guaranteed.
+   */
+  unsortedForEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  }
+
+  /**
+   * Add the given source mapping.
+   *
+   * @param Object aMapping
+   */
+  add(aMapping) {
+    if (generatedPositionAfter(this._last, aMapping)) {
+      this._last = aMapping;
+      this._array.push(aMapping);
+    } else {
+      this._sorted = false;
+      this._array.push(aMapping);
+    }
+  }
+
+  /**
+   * Returns the flat, sorted array of mappings. The mappings are sorted by
+   * generated position.
+   *
+   * WARNING: This method returns internal data without copying, for
+   * performance. The return value must NOT be mutated, and should be treated as
+   * an immutable borrow. If you want to take ownership, you must make your own
+   * copy.
+   */
+  toArray() {
+    if (!this._sorted) {
+      this._array.sort(util.compareByGeneratedPositionsInflated);
+      this._sorted = true;
+    }
+    return this._array;
+  }
+}
+
+exports.MappingList = MappingList;
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = __webpack_require__(0);
+const binarySearch = __webpack_require__(9);
+const ArraySet = __webpack_require__(3).ArraySet;
+const base64VLQ = __webpack_require__(2); // eslint-disable-line no-unused-vars
+const readWasm = __webpack_require__(4);
+const wasm = __webpack_require__(12);
+
+const INTERNAL = Symbol("smcInternal");
+
+class SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    // If the constructor was called by super(), just return Promise<this>.
+    // Yes, this is a hack to retain the pre-existing API of the base-class
+    // constructor also being an async factory function.
+    if (aSourceMap == INTERNAL) {
+      return Promise.resolve(this);
+    }
+
+    return _factory(aSourceMap, aSourceMapURL);
+  }
+
+  static initialize(opts) {
+    readWasm.initialize(opts["lib/mappings.wasm"]);
+  }
+
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return _factoryBSM(aSourceMap, aSourceMapURL);
+  }
+
+  /**
+   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+   * value.
+   *
+   * You must not use the consumer after `f` completes!
+   *
+   * By using `with`, you do not have to remember to manually call `destroy` on
+   * the consumer, since it will be called automatically once `f` completes.
+   *
+   * ```js
+   * const xSquared = await SourceMapConsumer.with(
+   *   myRawSourceMap,
+   *   null,
+   *   async function (consumer) {
+   *     // Use `consumer` inside here and don't worry about remembering
+   *     // to call `destroy`.
+   *
+   *     const x = await whatever(consumer);
+   *     return x * x;
+   *   }
+   * );
+   *
+   * // You may not use that `consumer` anymore out here; it has
+   * // been destroyed. But you can use `xSquared`.
+   * console.log(xSquared);
+   * ```
+   */
+  static with(rawSourceMap, sourceMapUrl, f) {
+    // Note: The `acorn` version that `webpack` currently depends on doesn't
+    // support `async` functions, and the nodes that we support don't all have
+    // `.finally`. Therefore, this is written a bit more convolutedly than it
+    // should really be.
+
+    let consumer = null;
+    const promise = new SourceMapConsumer(rawSourceMap, sourceMapUrl);
+    return promise
+      .then(c => {
+        consumer = c;
+        return f(c);
+      })
+      .then(x => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        return x;
+      }, e => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        throw e;
+      });
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  }
+
+  /**
+   * Iterate over each mapping between an original source/line/column and a
+   * generated line/column in this source map.
+   *
+   * @param Function aCallback
+   *        The function that is called with each mapping.
+   * @param Object aContext
+   *        Optional. If specified, this object will be the value of `this` every
+   *        time that `aCallback` is called.
+   * @param aOrder
+   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+   *        iterate over the mappings sorted by the generated file's line/column
+   *        order or the original's source/line/column order, respectively. Defaults to
+   *        `SourceMapConsumer.GENERATED_ORDER`.
+   */
+  eachMapping(aCallback, aContext, aOrder) {
+    throw new Error("Subclasses must implement eachMapping");
+  }
+
+  /**
+   * Returns all generated line and column information for the original source,
+   * line, and column provided. If no column is provided, returns all mappings
+   * corresponding to a either the line we are searching for or the next
+   * closest line that has any mappings. Otherwise, returns all mappings
+   * corresponding to the given line and either the column we are searching for
+   * or the next closest column that has any offsets.
+   *
+   * The only argument is an object with the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number is 1-based.
+   *   - column: Optional. the column number in the original source.
+   *    The column number is 0-based.
+   *
+   * and an array of objects is returned, each with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *    line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *    The column number is 0-based.
+   */
+  allGeneratedPositionsFor(aArgs) {
+    throw new Error("Subclasses must implement allGeneratedPositionsFor");
+  }
+
+  destroy() {
+    throw new Error("Subclasses must implement destroy");
+  }
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+class BasicSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      let sources = util.getArg(sourceMap, "sources");
+      // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+      // requires the array) to play nice here.
+      const names = util.getArg(sourceMap, "names", []);
+      let sourceRoot = util.getArg(sourceMap, "sourceRoot", null);
+      const sourcesContent = util.getArg(sourceMap, "sourcesContent", null);
+      const mappings = util.getArg(sourceMap, "mappings");
+      const file = util.getArg(sourceMap, "file", null);
+
+      // Once again, Sass deviates from the spec and supplies the version as a
+      // string rather than a number, so we use loose equality checking here.
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      if (sourceRoot) {
+        sourceRoot = util.normalize(sourceRoot);
+      }
+
+      sources = sources
+        .map(String)
+        // Some source maps produce relative source paths like "./foo.js" instead of
+        // "foo.js".  Normalize these first so that future comparisons will succeed.
+        // See bugzil.la/1090768.
+        .map(util.normalize)
+        // Always ensure that absolute sources are internally stored relative to
+        // the source root, if the source root is absolute. Not doing this would
+        // be particularly problematic when the source root is a prefix of the
+        // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+        .map(function(source) {
+          return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+            ? util.relative(sourceRoot, source)
+            : source;
+        });
+
+      // Pass `true` below to allow duplicate names and sources. While source maps
+      // are intended to be compressed and deduplicated, the TypeScript compiler
+      // sometimes generates source maps with duplicates in them. See Github issue
+      // #72 and bugzil.la/889492.
+      that._names = ArraySet.fromArray(names.map(String), true);
+      that._sources = ArraySet.fromArray(sources, true);
+
+      that._absoluteSources = that._sources.toArray().map(function(s) {
+        return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+      });
+
+      that.sourceRoot = sourceRoot;
+      that.sourcesContent = sourcesContent;
+      that._mappings = mappings;
+      that._sourceMapURL = aSourceMapURL;
+      that.file = file;
+
+      that._computedColumnSpans = false;
+      that._mappingsPtr = 0;
+      that._wasm = null;
+
+      return wasm().then(w => {
+        that._wasm = w;
+        return that;
+      });
+    });
+  }
+
+  /**
+   * Utility function to find the index of a source.  Returns -1 if not
+   * found.
+   */
+  _findSourceIndex(aSource) {
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    if (this._sources.has(relativeSource)) {
+      return this._sources.indexOf(relativeSource);
+    }
+
+    // Maybe aSource is an absolute URL as returned by |sources|.  In
+    // this case we can't simply undo the transform.
+    for (let i = 0; i < this._absoluteSources.length; ++i) {
+      if (this._absoluteSources[i] == aSource) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+
+  /**
+   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+   *
+   * @param SourceMapGenerator aSourceMap
+   *        The source map that will be consumed.
+   * @param String aSourceMapURL
+   *        The URL at which the source map can be found (optional)
+   * @returns BasicSourceMapConsumer
+   */
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return new BasicSourceMapConsumer(aSourceMap.toString());
+  }
+
+  get sources() {
+    return this._absoluteSources.slice();
+  }
+
+  _getMappingsPtr() {
+    if (this._mappingsPtr === 0) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this._mappingsPtr;
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const size = aStr.length;
+
+    const mappingsBufPtr = this._wasm.exports.allocate_mappings(size);
+    const mappingsBuf = new Uint8Array(this._wasm.exports.memory.buffer, mappingsBufPtr, size);
+    for (let i = 0; i < size; i++) {
+      mappingsBuf[i] = aStr.charCodeAt(i);
+    }
+
+    const mappingsPtr = this._wasm.exports.parse_mappings(mappingsBufPtr);
+
+    if (!mappingsPtr) {
+      const error = this._wasm.exports.get_last_error();
+      let msg = `Error parsing mappings (code ${error}): `;
+
+      // XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+      switch (error) {
+        case 1:
+          msg += "the mappings contained a negative line, column, source index, or name index";
+          break;
+        case 2:
+          msg += "the mappings contained a number larger than 2**32";
+          break;
+        case 3:
+          msg += "reached EOF while in the middle of parsing a VLQ";
+          break;
+        case 4:
+          msg += "invalid base 64 character while parsing a VLQ";
+          break;
+        default:
+          msg += "unknown error code";
+          break;
+      }
+
+      throw new Error(msg);
+    }
+
+    this._mappingsPtr = mappingsPtr;
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+    const sourceRoot = this.sourceRoot;
+
+    this._wasm.withMappingCallback(
+      mapping => {
+        if (mapping.source !== null) {
+          mapping.source = this._sources.at(mapping.source);
+          mapping.source = util.computeSourceURL(sourceRoot, mapping.source, this._sourceMapURL);
+
+          if (mapping.name !== null) {
+            mapping.name = this._names.at(mapping.name);
+          }
+        }
+
+        aCallback.call(context, mapping);
+      },
+      () => {
+        switch (order) {
+        case SourceMapConsumer.GENERATED_ORDER:
+          this._wasm.exports.by_generated_location(this._getMappingsPtr());
+          break;
+        case SourceMapConsumer.ORIGINAL_ORDER:
+          this._wasm.exports.by_original_location(this._getMappingsPtr());
+          break;
+        default:
+          throw new Error("Unknown order of iteration.");
+        }
+      }
+    );
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    const originalLine = util.getArg(aArgs, "line");
+    const originalColumn = aArgs.column || 0;
+
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return [];
+    }
+
+    if (originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    this._wasm.withMappingCallback(
+      m => {
+        let lastColumn = m.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        mappings.push({
+          line: m.generatedLine,
+          column: m.generatedColumn,
+          lastColumn,
+        });
+      }, () => {
+        this._wasm.exports.all_generated_locations_for(
+          this._getMappingsPtr(),
+          source,
+          originalLine - 1,
+          "column" in aArgs,
+          originalColumn
+        );
+      }
+    );
+
+    return mappings;
+  }
+
+  destroy() {
+    if (this._mappingsPtr !== 0) {
+      this._wasm.exports.free_mappings(this._mappingsPtr);
+      this._mappingsPtr = 0;
+    }
+  }
+
+  /**
+   * Compute the last column for each generated mapping. The last column is
+   * inclusive.
+   */
+  computeColumnSpans() {
+    if (this._computedColumnSpans) {
+      return;
+    }
+
+    this._wasm.exports.compute_column_spans(this._getMappingsPtr());
+    this._computedColumnSpans = true;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.generatedLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.generatedColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.original_location_for(
+        this._getMappingsPtr(),
+        needle.generatedLine - 1,
+        needle.generatedColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.generatedLine === needle.generatedLine) {
+        let source = util.getArg(mapping, "source", null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+
+        let name = util.getArg(mapping, "name", null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+
+        return {
+          source,
+          line: util.getArg(mapping, "originalLine", null),
+          column: util.getArg(mapping, "originalColumn", null),
+          name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function(sc) { return sc == null; });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    const index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    let url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      const fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+
+    throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    const needle = {
+      source,
+      originalLine: util.getArg(aArgs, "line"),
+      originalColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.generated_location_for(
+        this._getMappingsPtr(),
+        needle.source,
+        needle.originalLine - 1,
+        needle.originalColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.source === needle.source) {
+        let lastColumn = mapping.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        return {
+          line: util.getArg(mapping, "generatedLine", null),
+          column: util.getArg(mapping, "generatedColumn", null),
+          lastColumn,
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  }
+}
+
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+class IndexedSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      const sections = util.getArg(sourceMap, "sections");
+
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      that._sources = new ArraySet();
+      that._names = new ArraySet();
+      that.__generatedMappings = null;
+      that.__originalMappings = null;
+      that.__generatedMappingsUnsorted = null;
+      that.__originalMappingsUnsorted = null;
+
+      let lastOffset = {
+        line: -1,
+        column: 0
+      };
+      return Promise.all(sections.map(s => {
+        if (s.url) {
+          // The url field will require support for asynchronicity.
+          // See https://github.com/mozilla/source-map/issues/16
+          throw new Error("Support for url field in sections not implemented.");
+        }
+        const offset = util.getArg(s, "offset");
+        const offsetLine = util.getArg(offset, "line");
+        const offsetColumn = util.getArg(offset, "column");
+
+        if (offsetLine < lastOffset.line ||
+            (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+          throw new Error("Section offsets must be ordered and non-overlapping.");
+        }
+        lastOffset = offset;
+
+        const cons = new SourceMapConsumer(util.getArg(s, "map"), aSourceMapURL);
+        return cons.then(consumer => {
+          return {
+            generatedOffset: {
+              // The offset fields are 0-based, but we use 1-based indices when
+              // encoding/decoding from VLQ.
+              generatedLine: offsetLine + 1,
+              generatedColumn: offsetColumn + 1
+            },
+            consumer
+          };
+        });
+      })).then(s => {
+        that._sections = s;
+        return that;
+      });
+    });
+  }
+
+  // `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  get _generatedMappings() {
+    if (!this.__generatedMappings) {
+      this._sortGeneratedMappings();
+    }
+
+    return this.__generatedMappings;
+  }
+
+  get _originalMappings() {
+    if (!this.__originalMappings) {
+      this._sortOriginalMappings();
+    }
+
+    return this.__originalMappings;
+  }
+
+  get _generatedMappingsUnsorted() {
+    if (!this.__generatedMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappingsUnsorted;
+  }
+
+  get _originalMappingsUnsorted() {
+    if (!this.__originalMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappingsUnsorted;
+  }
+
+  _sortGeneratedMappings() {
+    const mappings = this._generatedMappingsUnsorted;
+    mappings.sort(util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = mappings;
+  }
+
+  _sortOriginalMappings() {
+    const mappings = this._originalMappingsUnsorted;
+    mappings.sort(util.compareByOriginalPositions);
+    this.__originalMappings = mappings;
+  }
+
+  /**
+   * The list of original sources.
+   */
+  get sources() {
+    const sources = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      for (let j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    const sectionIndex = binarySearch.search(needle, this._sections,
+      function(aNeedle, section) {
+        const cmp = aNeedle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (aNeedle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    const section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    return this._sections.every(function(s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    throw new Error('"' + aSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, "source")) === -1) {
+        continue;
+      }
+      const generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        const ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const generatedMappings = this.__generatedMappingsUnsorted = [];
+    const originalMappings = this.__originalMappingsUnsorted = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const sectionMappings = [];
+      section.consumer.eachMapping(m => sectionMappings.push(m));
+
+      for (let j = 0; j < sectionMappings.length; j++) {
+        const mapping = sectionMappings[j];
+
+        // TODO: test if null is correct here.  The original code used
+        // `source`, which would actually have gotten used as null because
+        // var's get hoisted.
+        // See: https://github.com/mozilla/source-map/issues/333
+        let source = util.computeSourceURL(section.consumer.sourceRoot, null, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        let name = null;
+        if (mapping.name) {
+          this._names.add(mapping.name);
+          name = this._names.indexOf(mapping.name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        const adjustedMapping = {
+          source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name
+        };
+
+        generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === "number") {
+          originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    let mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    const sourceRoot = this.sourceRoot;
+    mappings.map(function(mapping) {
+      let source = null;
+      if (mapping.source !== null) {
+        source = this._sources.at(mapping.source);
+        source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      }
+      return {
+        source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  }
+
+  /**
+   * Find the mapping that best matches the hypothetical "needle" mapping that
+   * we are searching for in the given "haystack" of mappings.
+   */
+  _findMapping(aNeedle, aMappings, aLineName,
+              aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError("Line must be greater than or equal to 1, got "
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError("Column must be greater than or equal to 0, got "
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    const line = util.getArg(aArgs, "line");
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    const needle = {
+      source: util.getArg(aArgs, "source"),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, "column", 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    let index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      let mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        const originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        const originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  }
+
+  destroy() {
+    for (let i = 0; i < this._sections.length; i++) {
+      this._sections[i].consumer.destroy();
+    }
+  }
+}
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+/*
+ * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+ * where it has access to non-hoisted classes, but it gets hoisted itself.
+ */
+function _factory(aSourceMap, aSourceMapURL) {
+  let sourceMap = aSourceMap;
+  if (typeof aSourceMap === "string") {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  const consumer = sourceMap.sections != null
+      ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+      : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+  return Promise.resolve(consumer);
+}
+
+function _factoryBSM(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  const mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  const cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  } else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    }
+    return mid;
+  }
+
+  // Our needle is less than aHaystack[mid].
+  if (mid - aLow > 1) {
+    // The element is in the lower half.
+    return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+  }
+
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if (aBias == exports.LEAST_UPPER_BOUND) {
+    return mid;
+  }
+  return aLow < 0 ? -1 : aLow;
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  let index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports) {
+
+module.exports = __WEBPACK_EXTERNAL_MODULE_10__;
+
+/***/ }),
+/* 11 */
+/***/ (function(module, exports) {
+
+module.exports = __WEBPACK_EXTERNAL_MODULE_11__;
+
+/***/ }),
+/* 12 */
+/***/ (function(module, exports, __webpack_require__) {
+
+const readWasm = __webpack_require__(4);
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.lastGeneratedColumn = null;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+let cachedWasm = null;
+
+module.exports = function wasm() {
+  if (cachedWasm) {
+    return cachedWasm;
+  }
+
+  const callbackStack = [];
+
+  cachedWasm = readWasm().then(buffer => {
+      return WebAssembly.instantiate(buffer, {
+        env: {
+          mapping_callback(
+            generatedLine,
+            generatedColumn,
+
+            hasLastGeneratedColumn,
+            lastGeneratedColumn,
+
+            hasOriginal,
+            source,
+            originalLine,
+            originalColumn,
+
+            hasName,
+            name
+          ) {
+            const mapping = new Mapping();
+            // JS uses 1-based line numbers, wasm uses 0-based.
+            mapping.generatedLine = generatedLine + 1;
+            mapping.generatedColumn = generatedColumn;
+
+            if (hasLastGeneratedColumn) {
+              // JS uses inclusive last generated column, wasm uses exclusive.
+              mapping.lastGeneratedColumn = lastGeneratedColumn - 1;
+            }
+
+            if (hasOriginal) {
+              mapping.source = source;
+              // JS uses 1-based line numbers, wasm uses 0-based.
+              mapping.originalLine = originalLine + 1;
+              mapping.originalColumn = originalColumn;
+
+              if (hasName) {
+                mapping.name = name;
+              }
+            }
+
+            callbackStack[callbackStack.length - 1](mapping);
+          },
+
+          start_all_generated_locations_for() { console.time("all_generated_locations_for"); },
+          end_all_generated_locations_for() { console.timeEnd("all_generated_locations_for"); },
+
+          start_compute_column_spans() { console.time("compute_column_spans"); },
+          end_compute_column_spans() { console.timeEnd("compute_column_spans"); },
+
+          start_generated_location_for() { console.time("generated_location_for"); },
+          end_generated_location_for() { console.timeEnd("generated_location_for"); },
+
+          start_original_location_for() { console.time("original_location_for"); },
+          end_original_location_for() { console.timeEnd("original_location_for"); },
+
+          start_parse_mappings() { console.time("parse_mappings"); },
+          end_parse_mappings() { console.timeEnd("parse_mappings"); },
+
+          start_sort_by_generated_location() { console.time("sort_by_generated_location"); },
+          end_sort_by_generated_location() { console.timeEnd("sort_by_generated_location"); },
+
+          start_sort_by_original_location() { console.time("sort_by_original_location"); },
+          end_sort_by_original_location() { console.timeEnd("sort_by_original_location"); },
+        }
+      });
+  }).then(Wasm => {
+    return {
+      exports: Wasm.instance.exports,
+      withMappingCallback: (mappingCallback, f) => {
+        callbackStack.push(mappingCallback);
+        try {
+          f();
+        } finally {
+          callbackStack.pop();
+        }
+      }
+    };
+  }).then(null, e => {
+    cachedWasm = null;
+    throw e;
+  });
+
+  return cachedWasm;
+};
+
+
+/***/ }),
+/* 13 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const SourceMapGenerator = __webpack_require__(1).SourceMapGenerator;
+const util = __webpack_require__(0);
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+const REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+const NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+const isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+class SourceNode {
+  constructor(aLine, aColumn, aSource, aChunks, aName) {
+    this.children = [];
+    this.sourceContents = {};
+    this.line = aLine == null ? null : aLine;
+    this.column = aColumn == null ? null : aColumn;
+    this.source = aSource == null ? null : aSource;
+    this.name = aName == null ? null : aName;
+    this[isSourceNode] = true;
+    if (aChunks != null) this.add(aChunks);
+  }
+
+  /**
+   * Creates a SourceNode from generated code and a SourceMapConsumer.
+   *
+   * @param aGeneratedCode The generated code
+   * @param aSourceMapConsumer The SourceMap for the generated code
+   * @param aRelativePath Optional. The path that relative sources in the
+   *        SourceMapConsumer should be relative to.
+   */
+  static fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    const node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    const remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    let remainingLinesIndex = 0;
+    const shiftNextLine = function() {
+      const lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      const newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    let lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    let lastMapping = null;
+    let nextLine;
+
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          nextLine = remainingLines[remainingLinesIndex] || "";
+          const code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        nextLine = remainingLines[remainingLinesIndex] || "";
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        const source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  }
+
+  /**
+   * Add a chunk of generated JS to this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  add(aChunk) {
+    if (Array.isArray(aChunk)) {
+      aChunk.forEach(function(chunk) {
+        this.add(chunk);
+      }, this);
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      if (aChunk) {
+        this.children.push(aChunk);
+      }
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Add a chunk of generated JS to the beginning of this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  prepend(aChunk) {
+    if (Array.isArray(aChunk)) {
+      for (let i = aChunk.length - 1; i >= 0; i--) {
+        this.prepend(aChunk[i]);
+      }
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      this.children.unshift(aChunk);
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Walk over the tree of JS snippets in this node and its children. The
+   * walking function is called once for each snippet of JS and is passed that
+   * snippet and the its original associated source's line/column location.
+   *
+   * @param aFn The traversal function.
+   */
+  walk(aFn) {
+    let chunk;
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      chunk = this.children[i];
+      if (chunk[isSourceNode]) {
+        chunk.walk(aFn);
+      } else if (chunk !== "") {
+        aFn(chunk, { source: this.source,
+                      line: this.line,
+                      column: this.column,
+                      name: this.name });
+      }
+    }
+  }
+
+  /**
+   * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+   * each of `this.children`.
+   *
+   * @param aSep The separator.
+   */
+  join(aSep) {
+    let newChildren;
+    let i;
+    const len = this.children.length;
+    if (len > 0) {
+      newChildren = [];
+      for (i = 0; i < len - 1; i++) {
+        newChildren.push(this.children[i]);
+        newChildren.push(aSep);
+      }
+      newChildren.push(this.children[i]);
+      this.children = newChildren;
+    }
+    return this;
+  }
+
+  /**
+   * Call String.prototype.replace on the very right-most source snippet. Useful
+   * for trimming whitespace from the end of a source node, etc.
+   *
+   * @param aPattern The pattern to replace.
+   * @param aReplacement The thing to replace the pattern with.
+   */
+  replaceRight(aPattern, aReplacement) {
+    const lastChild = this.children[this.children.length - 1];
+    if (lastChild[isSourceNode]) {
+      lastChild.replaceRight(aPattern, aReplacement);
+    } else if (typeof lastChild === "string") {
+      this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+    } else {
+      this.children.push("".replace(aPattern, aReplacement));
+    }
+    return this;
+  }
+
+  /**
+   * Set the source content for a source file. This will be added to the SourceMapGenerator
+   * in the sourcesContent field.
+   *
+   * @param aSourceFile The filename of the source file
+   * @param aSourceContent The content of the source file
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  }
+
+  /**
+   * Walk over the tree of SourceNodes. The walking function is called for each
+   * source file content and is passed the filename and source content.
+   *
+   * @param aFn The traversal function.
+   */
+  walkSourceContents(aFn) {
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    const sources = Object.keys(this.sourceContents);
+    for (let i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  }
+
+  /**
+   * Return the string representation of this source node. Walks over the tree
+   * and concatenates all the various snippets together to one string.
+   */
+  toString() {
+    let str = "";
+    this.walk(function(chunk) {
+      str += chunk;
+    });
+    return str;
+  }
+
+  /**
+   * Returns the string representation of this source node along with a source
+   * map.
+   */
+  toStringWithSourceMap(aArgs) {
+    const generated = {
+      code: "",
+      line: 1,
+      column: 0
+    };
+    const map = new SourceMapGenerator(aArgs);
+    let sourceMappingActive = false;
+    let lastOriginalSource = null;
+    let lastOriginalLine = null;
+    let lastOriginalColumn = null;
+    let lastOriginalName = null;
+    this.walk(function(chunk, original) {
+      generated.code += chunk;
+      if (original.source !== null
+          && original.line !== null
+          && original.column !== null) {
+        if (lastOriginalSource !== original.source
+          || lastOriginalLine !== original.line
+          || lastOriginalColumn !== original.column
+          || lastOriginalName !== original.name) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+        lastOriginalSource = original.source;
+        lastOriginalLine = original.line;
+        lastOriginalColumn = original.column;
+        lastOriginalName = original.name;
+        sourceMappingActive = true;
+      } else if (sourceMappingActive) {
+        map.addMapping({
+          generated: {
+            line: generated.line,
+            column: generated.column
+          }
+        });
+        lastOriginalSource = null;
+        sourceMappingActive = false;
+      }
+      for (let idx = 0, length = chunk.length; idx < length; idx++) {
+        if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+          generated.line++;
+          generated.column = 0;
+          // Mappings end at eol
+          if (idx + 1 === length) {
+            lastOriginalSource = null;
+            sourceMappingActive = false;
+          } else if (sourceMappingActive) {
+            map.addMapping({
+              source: original.source,
+              original: {
+                line: original.line,
+                column: original.column
+              },
+              generated: {
+                line: generated.line,
+                column: generated.column
+              },
+              name: original.name
+            });
+          }
+        } else {
+          generated.column++;
+        }
+      }
+    });
+    this.walkSourceContents(function(sourceFile, sourceContent) {
+      map.setSourceContent(sourceFile, sourceContent);
+    });
+
+    return { code: generated.code, map };
+  }
+}
+
+exports.SourceNode = SourceNode;
+
+
+/***/ })
+/******/ ]);
+});
\ No newline at end of file
diff --git a/node_modules/source-map/lib/array-set.js b/node_modules/source-map/lib/array-set.js
new file mode 100644
index 0000000..40171b9
--- /dev/null
+++ b/node_modules/source-map/lib/array-set.js
@@ -0,0 +1,100 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+class ArraySet {
+  constructor() {
+    this._array = [];
+    this._set = new Map();
+  }
+
+  /**
+   * Static method for creating ArraySet instances from an existing array.
+   */
+  static fromArray(aArray, aAllowDuplicates) {
+    const set = new ArraySet();
+    for (let i = 0, len = aArray.length; i < len; i++) {
+      set.add(aArray[i], aAllowDuplicates);
+    }
+    return set;
+  }
+
+  /**
+   * Return how many unique items are in this ArraySet. If duplicates have been
+   * added, than those do not count towards the size.
+   *
+   * @returns Number
+   */
+  size() {
+    return this._set.size;
+  }
+
+  /**
+   * Add the given string to this set.
+   *
+   * @param String aStr
+   */
+  add(aStr, aAllowDuplicates) {
+    const isDuplicate = this.has(aStr);
+    const idx = this._array.length;
+    if (!isDuplicate || aAllowDuplicates) {
+      this._array.push(aStr);
+    }
+    if (!isDuplicate) {
+      this._set.set(aStr, idx);
+    }
+  }
+
+  /**
+   * Is the given string a member of this set?
+   *
+   * @param String aStr
+   */
+  has(aStr) {
+      return this._set.has(aStr);
+  }
+
+  /**
+   * What is the index of the given string in the array?
+   *
+   * @param String aStr
+   */
+  indexOf(aStr) {
+    const idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+    throw new Error('"' + aStr + '" is not in the set.');
+  }
+
+  /**
+   * What is the element at the given index?
+   *
+   * @param Number aIdx
+   */
+  at(aIdx) {
+    if (aIdx >= 0 && aIdx < this._array.length) {
+      return this._array[aIdx];
+    }
+    throw new Error("No element indexed by " + aIdx);
+  }
+
+  /**
+   * Returns the array representation of this set (which has the proper indices
+   * indicated by indexOf). Note that this is a copy of the internal array used
+   * for storing the members so that no one can mess with internal state.
+   */
+  toArray() {
+    return this._array.slice();
+  }
+}
+exports.ArraySet = ArraySet;
diff --git a/node_modules/source-map/lib/base64-vlq.js b/node_modules/source-map/lib/base64-vlq.js
new file mode 100644
index 0000000..fc1049c
--- /dev/null
+++ b/node_modules/source-map/lib/base64-vlq.js
@@ -0,0 +1,111 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+const base64 = require("./base64");
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+const VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+const VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+const VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+const VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+// eslint-disable-next-line no-unused-vars
+function fromVLQSigned(aValue) {
+  const isNegative = (aValue & 1) === 1;
+  const shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  let encoded = "";
+  let digit;
+
+  let vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
diff --git a/node_modules/source-map/lib/base64.js b/node_modules/source-map/lib/base64.js
new file mode 100644
index 0000000..b9ca319
--- /dev/null
+++ b/node_modules/source-map/lib/base64.js
@@ -0,0 +1,18 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function(number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
diff --git a/node_modules/source-map/lib/binary-search.js b/node_modules/source-map/lib/binary-search.js
new file mode 100644
index 0000000..d6f898e
--- /dev/null
+++ b/node_modules/source-map/lib/binary-search.js
@@ -0,0 +1,107 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  const mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  const cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  } else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    }
+    return mid;
+  }
+
+  // Our needle is less than aHaystack[mid].
+  if (mid - aLow > 1) {
+    // The element is in the lower half.
+    return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+  }
+
+  // we are in termination case (3) or (2) and return the appropriate thing.
+  if (aBias == exports.LEAST_UPPER_BOUND) {
+    return mid;
+  }
+  return aLow < 0 ? -1 : aLow;
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  let index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};
diff --git a/node_modules/source-map/lib/mapping-list.js b/node_modules/source-map/lib/mapping-list.js
new file mode 100644
index 0000000..7056861
--- /dev/null
+++ b/node_modules/source-map/lib/mapping-list.js
@@ -0,0 +1,80 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = require("./util");
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  const lineA = mappingA.generatedLine;
+  const lineB = mappingB.generatedLine;
+  const columnA = mappingA.generatedColumn;
+  const columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a negligible overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+class MappingList {
+  constructor() {
+    this._array = [];
+    this._sorted = true;
+    // Serves as infimum
+    this._last = {generatedLine: -1, generatedColumn: 0};
+  }
+
+  /**
+   * Iterate through internal items. This method takes the same arguments that
+   * `Array.prototype.forEach` takes.
+   *
+   * NOTE: The order of the mappings is NOT guaranteed.
+   */
+  unsortedForEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  }
+
+  /**
+   * Add the given source mapping.
+   *
+   * @param Object aMapping
+   */
+  add(aMapping) {
+    if (generatedPositionAfter(this._last, aMapping)) {
+      this._last = aMapping;
+      this._array.push(aMapping);
+    } else {
+      this._sorted = false;
+      this._array.push(aMapping);
+    }
+  }
+
+  /**
+   * Returns the flat, sorted array of mappings. The mappings are sorted by
+   * generated position.
+   *
+   * WARNING: This method returns internal data without copying, for
+   * performance. The return value must NOT be mutated, and should be treated as
+   * an immutable borrow. If you want to take ownership, you must make your own
+   * copy.
+   */
+  toArray() {
+    if (!this._sorted) {
+      this._array.sort(util.compareByGeneratedPositionsInflated);
+      this._sorted = true;
+    }
+    return this._array;
+  }
+}
+
+exports.MappingList = MappingList;
diff --git a/node_modules/source-map/lib/mappings.wasm b/node_modules/source-map/lib/mappings.wasm
new file mode 100644
index 0000000000000000000000000000000000000000..3515370723369347c024869dc4dbb3318c45a294
GIT binary patch
literal 48693
zcmeIb3zS{gS?75k_gUxOTeqYtsiZ1N=U&UUWW7qyl4Lv9ks~>Z?Z~m?B!m#DER}7Q
zURJ5(N4IU29TNg1pv+_%FJ5h?-6YVcF|z`s=`=AjNl1WB3<C{A^YF|HGnut$5UVrY
znVxh!zyG)QxsOuG4?3`Vtr^Qz`#kpJ+uwVC``f32sq?49APB;vgGb|w7cYhvkA@cm
ze!{2iJ~$fL!vWs;|AM1|Jq?Z)^n_a)MNd7Y-%mbi9q_B<YI9Yzs~{Q;<LNVxHcwAI
z^2muZ4;?u+b?VduQ^!sQ#d!0ka#)VSav==EN(?juNv#|f>g6!3)@nQqD~(2@9GA=b
zRVoz2N5UODig6eWmH%V3qI7!t^x4@bqM&@_$f@b`4{i&ZTs`Ej296xLaOUjn@%-`h
zx%}$XTz++?+o<#G)bw#W8nTY;D(@(NJbf;|IyIMHo#{4m&l(R+&mB26b$;&1^z7`}
z*<j@mvp#!lYHs?7$HVzxtntXy?D?Jt<Mjt;r+e;KjXdxK(>XIeOS|Joto@0zXM)wk
z$IhO9<N|#iJA3NF=`%;pKQeXZe6VJi>St$9JappB)TwUmbmXdMM;-*E*0QU+wioR&
zU|nR~^Y-?->fSKOf@H_0a`(StsZ=PJE9HSYzYCS5l+>!#VxhuqRlo9|fq(nk(Wd`U
zj2aiCr?Wy<SQiD^#L4#Ht|&;uO~L4a!oD<YMoAX5>giw>?20Ps;Qqp79At%7HQJ|t
zX-KPftfG>wJvGy=rSTnweeu3D&c<h24T`lh?Wh%}4Rs&!F0H3gM$JSm8+Th}`d=3n
z4)SuaIm%d-8D45s71boIruD2aH`9*yKQli+|8g)1h%vSH+m-4ALrmo?oN3oJfqL4w
zyB;KoyNIo)b~SCdZmi}V^#YJQJhPKAhPXOzgEqK2YF8DmK4@3v{ZXsQ-Q&7z54dSW
z*^_FzKmABLkc9^?KWA0utU-y&kJwc))jV5;1b7QGtt1^%gNAD`#KYQ5Tc~Ld*o3$e
z7Lw))Ls)AdvG$B0<i=@bS5!#jw5%z{>Chx3iPOTas7dSLnY3unv(cHf<gUhN(x#Br
zaQF{r^cZp^sR(5V8qC(s<S1{)dOt`9?I?BE4s%?m>7Y?b_+862#V`eLnrX;1S`Ehz
zwRY`59S#B>%`0X)OnnY&)}T`>7H{yv9zUrn&0!&@$t$S*2=p_sLZ0waUDZ^hkq)kp
z-CXD<jd&+m4R`T@dX#pC6pFwOZ?gh(nb4dElkA0%KI+X{km%nJL}B$JoLzE!-#pna
zIu0+U0bRF4bzV$E-8s&t!$MlrL@N}`q#TLQ%kW?vL>JQ%G-Xm@D@qG#p&qWRf#oob
z4+0w<nH;FoFlkj&u&c`D{h`Du1Ppj2jay+YOmv%;GlKvgbbv%^uSZrf5?Uf!RDm_E
zWZaAiYGDPcA}?IQ7PYjheky5&7gR5+C>aV;hTR*CCeKG<<zg=W>B+W@7p@D0ny^&{
z@NicE)a!x*9fVn7SD-=?r%GTAe8k{RmBh_eJ&qYzkD`4!UO<B20Xc%lxC@a&PDY{6
zFujyPTg?6NOcrEm8b5ThxgH2AV1#;CHwL*#6y4dtetbBim_q^!2mpZqsv+8e*#q^k
z7A0v}*LC_Wh_eEL6i|r5nRG%bmPxRI$q>)MB<;l&)V8O369=JP?+?R^X|O3MWRWNu
z2s5S>)xa844u$z;PgkZp`@0O1?dmR4M@~|tiG#g1#c-wtJE7sgZj@a_L`_hF<YC${
z%P<WN(GcDUW7?<D43&6lrSBzg2NnX*DmHox1G#wz$xG{_Dn=vPmkUp;B0OL952$+n
z_22cr@z)^ln;`}v`$ip{wWF-blVm1){G7@|W9?EFKiV#2YtFSPgDgJBRC#srd={Qd
z3p2cm=cx3px@jJf0*pb23YxQ&U8&EsOOi%z#EK=}o0^cI2HC#D^_4arJwJX9?*B`J
zqI#eXE2pKCtvEtqP@}@wAZ}&0hAv)v?X~iq+;DkA8a&hvP6FPez{6Xv!@1d{UCyGp
z>|28lr~`E;>-^4ENX#Eq3oh0i9Gh!}2tpKt591u*XcyDcA*e)wib~_dx`qL$1{2py
zg4`+EBJzXsLMm20nibB?IQ`iU?ikaHF%#a95z+v*Nec(+G-w62asuezYJ%{)>y?y=
zNt4EN8EBdV6HNHz>^XmN?qP@Gu!CZU+t6?u9;{cvE&8Tr3c}%bAc36l>(goBv2zkD
zx;HxUYu2f1D912}Sr*!p5N+*{&kTzwTc&*S+`~Osly(zaKo#Uw@~|#yiYiO8pte*V
zi(yEz9@Wi*iI@;LKG&I3T4h!?TbpBF_j;bh(4bB4DUOi_1IE%}fQJqs=+L=#I0g;4
zOu4`a8w60N;OSv#mM~)7($WlEU|1Fbfp)Z2R8ga^=pd8iy25DKw3-kk9a*d=wOWDz
znc%qA0s<k=zAb|3=593FswA5q;vQTWco@^e^^j+>XaNnagbNTELoipUZ}}sD@9++)
zZVR|AWxqIIfOn9yeQ<S<HRsw)BFa8G#QzM!{CHG^Wa|54Lsa>go(uT2aCl5lpK}i&
zUUq4y6@W<)r8-cB;o9NM!FpMjl{Q$aEkPFnrSS_;11RV+>kfFHC%AIL%J>F1x?naD
znXMU5D>JZ-4E;iOlNu1A)WR_w-9s>xg%Q(_Kvy%uzYu2gF$s~z38^U#M<;kZdkt00
zLO5Ma6{3ouGBc_bAX)aJVL(m}BSVaYCuYjUn?d%;A#>Hhjy=piJ(Rt+MnnIkqZt?j
zj5_d`WI6kkeVYgV5+f62^N~C_u<bf|VJO2nHXq^JO{C`i9*IEUr^wYzwhkP?S3*CI
zTA_xEDWfY!L}eJA#@bp8NIVKaQfNuZQbP<x4ZX{2NR`OiwWN29WW{>1Rx%>s^nh>h
zp3s3QTLV7S9BLx6E99SufgSl_1M4Oll+`cXjqDWeoJBxz=48x@GR--IWrH#faPs3q
zhsgvL)C8KJJc+V0g(3_YVL^+-AI8G)kack;pfwFtP6!1fD7P*ehxSf)8%9!FzZ8Xp
zBI3?1Z$X)686b$*5pZO8CinEVD;iZt&9)hS4G#>eGwRUpIn80%LFZn}5&X+KZq(Ch
z=oBX)#n~YC5ki5BvavH%OUojj1j|j=946Ip46hn6JkFKp0<N4W_1k9Nzb5NT3D5J(
z@qFNU9dD2~;`Q9@B3306VyW4J8AsM+kG4zRIMQEk9Ak`QX>sESD#p`-7IL!o4%r>!
zi}T4t4O&FNn1|2>znSu9{etergcXe4N~y#fL`dENOv<6;FbYFBUSlwE9*$n6R>bhx
zYoQs&vc|@hqatK%_8G}>_8BN-pG&d)tWwv+wqXR56oA9pYv2|zcR|z|)HIz3!Yg+p
zat;gpDvl5yG0K_*F1E1<D+vcOMMWHAT8<?|Io{VpzQ2R(wA@$`gi&0nCbfE_xn$|^
zvgM;ALj!|_VyTSNkWUeFh@47R549tC87O2{Bht)Tj$oDRqZtc{+U739>rup`O`ut(
zkOhP@g)EjvvzRv<?M;QQjb!k!EMld;qK4eWPF-ouC@@e)3}i%DpDm;DO^hTWsG5`?
z)l?y`R=+V@PObF|HCLrRT3havK;-~%6sUBg!O^1z)RES7qgj#HHzX{+=$_>j=BrN|
z7^DV1EP0^5A}djUt-K%B@S~b=Q-*a#R_6J2dd?KJA`&NL6&|+TOf@wsj%HP!5kSzi
zOyT>wU_=~T>?n$CfQoAnNx1>bvnAZErYndfv+9kYtX;p>SgAU>jWmx1@$f2xD`$Fg
zFXTXdSyrRtalzATA|r1ibG6ZLB9~=#8jV38EG3KGWqpPMqGb)<uW*d+G%0kH1Q>c$
z$XsND)MDBg4aGU+J4kA>CXbg3Yt9$oZbbAf*M^g9gaXe{xLJ}IZHL@l)7{}X=v^bp
zmQvK+T`e)PB}q2SLtI(WrRv^cwA7%SWJsf|hkz<3*$@R9NfU_^0|^IIY>7f2rBL+2
zyn)<F5FPK9-^4|c#hv*~eZt*YIiY>T@M1vllKW4#mg5d{&KUBzEHa^*@^eh5o4lIa
zb0@y7wMBCZ7L97Yf~Pgmc;mRZV*xp&pJJk97+*8JkOgL&VTBfEOr!t|>+uN&@ClkT
z+4H(-CkjJVpiG(&@<_vUK*6gD1p$zS{?PM7G_9Da_Z|`V#1jJ{AhYO~{DC%@U~!}{
zOF@f|P`*eZdzy6yic?QfPJUXUml<#5qD74ym6=#><iLa+I$3q*;bM&iz%Wx6$<z^e
zvUOn8HFXiDF21IzLl@*WF7|7jejDe)m>nC3hsQji6xPZ_fDVk5<_Jmc<`OF--vS?L
zbkZ%0V&^4kaS=PAJXps@f*`G<&t>5q^+8(WKUKiVo%I2ygh7D#s(7$2V}!J^n3Ee*
zk!Z-Z&dsbj-=e1(tVK;Mt5bU(^qE+NCl#H8Lb7VEsA-1LqBd6%Ly@JktnJub^J(T}
zYFeRTh1uYg!4Zzb#r;ls_<>B7IQtJxM~O56hs3n&A$m7b(FDOL&Ne4fezIR0xKM+0
zEm1-0BUeGH?=XUz=ooX&7)<&Z%jyfBq<0k;)VOE$BJ86j94#Q11l<UN*P*GDOaZ3l
zdL*#FQFq=Mx*wW8YJQ@;2w6yeVVP(<j95w)5Csz^S$LLY8Rf=ML9g-(5+(UFcrg|Y
z4H!oOGju2s$&O=8pW}o}y<@Bnuzfg=W%Wmhv11CQoYRtXj17M7%rU07ju8xLX|p1X
ztU1cS19Us2ra|gZ=iWK5*hvnPF8YuHOf-Y*5vRC*^4-)!t_M04?9!%3xuRO3uycG_
z5%xH~g=;vzT3dh)RzVe^n$T~iA$lBN`pX^P0@?t_H|~iFacxl{L|{A(oZ}nkN+FLr
zNhvr*w20$daE@=h!12uibB?d6X(Xe=|1zFk$Jdy)$MJ<Spx)^^1*YQM@db+4aeOWE
z?j7G4AvC-rgn%d^<hB#lFj$B%2?)VrA{q2Jz6P-wcvt|*bJZxijxP&10A*n(k$Y~)
zX}C6zux#Qr<lU=#p5@DZ=#~8MNmvxA=^hRd{Y_uM#o;+c)bd!O<OHop+%V@6niPrn
zI1MT;FPgSAeN&TrX;V~K5p67xxsbL*oe3F?fUae!Qjm%;C7{3yy~s)h_zmh|RO<%0
zz^rpSrrig<i493hmadX`dhSZRd4=Zc(hm}E9&ynmUi$<^=L_4?wZ|7OO5(MiM=97E
z1hnN6kDBO6JbjM0iEvvO)A~*W;leZsi!#XKoL>wD_;M0&@N;JpPj8ZVI>PN07Bwrm
zyILU|4u<9BVrqKaTfJK#@ji%{QztKTTu0}$YuPb<5+V!P*d~l@U1Y??(#YhQo)8g@
zPtmnfA)bgPDy(yQsU`O5@K@+`x*Wi(tOvW0M(UpWo`LEL1De_4ft5I(T_eIvsZ-xx
z!C62PcTk8sy7u5LamPY?@ZIGOU|Yx?W)HgD;g?2l#2s|BD0lFDSiY9$4lnB0=8nba
zgz+{`Kr!W#IB0PmV<G8=(3=6meLZF%^kzT{nXYRX%5FOSpNB5IUx?rOXd9k4zmP6-
zOAulSir2IRsIJ@u6un;<bp|Y0?85>L5YA#BIB#%jD>nf!hJ`N(3=k5LQ)bGvqyEi}
zGtFDU#X!kOf1>@-RX%2dhho$T^iEouqDEb!dW%?tB8~(M*yEB}z|gD#h?+y4#Kc^o
zTMli<8lX6(B^O!)AY|0sC1YR<kN}2!Cq$Af*U*YeLX95bLSRg{CVy5BOQz?wE};wd
z=uM?d^aH}cA~taMDSZPSoZvop)Cn3>;X}tUQdeH-Q@7S;T_L59EHXunD;L@Hg?!kn
zl)jLS!s%D~^dPae{?NTr`qruW+BN5SzoF9CRs(t)uZy<1o9C2%2qT!%m(29Ld8YIs
zjg)?DDrj+~PoLxMoGs0T#H{xz{le8s-{4=M^y#SCmYZkm3AuR^T{Ar1%`>HM8q>X7
zp!DNB0GiXsl{v1R(vO@sAWTM%a2=%|8gWg)rSu_@h)6+zNlG81;D{(oE2Y~@Epeh(
z`dm55@=D*_kZ(8rl0g9#k-De8hl3591xlZE1lu8i?GD$=@MMs!XC-TkcVr7QNzf;?
zrMtNpT2yov?%FgVB*A_UYireHpFwvt#Ql*YOnci}q1LC_PhoSxe%)!iGd@m!H>Qa2
z_eDT<Cdg(3oX!OK*%&q)uNvC0+lFBcV6=L(ysAA0@Cqx^&v%_y>2o2kTCBcnf_$vL
z*90xbt8}y|uL|fl<)C<8?d5`;YoI}|2@<pPm>}EdgAd$V#G+~hDf)x(GD4BXC*XM)
z-D2JF5Y*6G#D~#4F$&wO&TSDr=e8(twkYaZm2hpV5>vHomYSzWc8A-C)pEp*tKdJH
zUtEU;H0@5tiQ@2)Uyi^b-8ek3B^Ux9)i&2y%U?4A<}W*YWUOba5ogD=Hh1=@KSsdX
zE--_HaddHcpwjY01_^TZ7$hk;5lm*v3{uoGk<USvL4v4=iHi|9w;kBb|1%I-Rptf>
zg`~xWiML=gU1hL!SM!obHu63#kyLtyDFa0HZzH6#Z#{Y>=b+^Oj9AAY>lm^OHDMVN
z%{#|PJ4i$F-Rw!|b0#Q>$g$H^n`ti5a#{xS@!SZCc>pp#hh7dblP;*Dc#v!wkr6ij
zExH$iSkxZKJDJ%~T(rZJ*cXM7j0<JW#SG!O*-XR-a`u>rzL*1GffDI{W1CJT2Jo${
z1v<F7R7@NZ?E>4-hH0uJ*Pk4B(2vVzt+Xl2;5H?B^|FEv0aBIBD2GME5X=F57Y%fK
zz}(6|z%u0vMxHd6ioICf3yS3P)u>DYZk`%NW@MG|qkXUUPlG56D9S2q%ySnvN7|%X
z@E9;~67+NTShJy-HHU4kDBlpyd1<H>XKRrnLeFp#mihA+@2uCLaO~+xd1$N^0wUBJ
z5PMgk7EVMZr-P`gU9IpiBXXgn1KW!~h=i7NqiAVh1sX@^hz+WbHgP3#W76;t4=9vX
zQ8SOHtay%ANEGJrDBsW|gt^IBIy*!G%IBj)YMm8k56v>5I?A4zuN)$e0m0R68v}5N
zNaFx_sPvGC)?yd*o$&%!@T1rzrw&ix4g&DbcsXc=;srfvDQ2BXk5So;Y6}Jc_K`dS
z_|C?;ZnQlQp-e;o5<(erN%uSl@s$M{pBvLI7eHJ^y|NgxGc`y*U=vGAP7(q~2J+lG
zbCLA&6N||gK<_{o9-Pd0JeW@Q=&;y!-*&m)DvSVyw3C+8OIF$ut(RVGp)Cv?!adzE
zLRnTikK<vboffq)LX5j;i2{NTGp<*8g-+m5+Sc@5B@ZJ+DVu42M;&;20*C4#Ez6_q
z?xB^PM`<&TTo{4jm|?2m0AlHO&*-RWnWe^sh=}UoQS#g`6wTc*y1RD^Jjy(9Sa2Ka
z1CUTe?_){0qnB>dO`_LT^<Z7;AIG{}El_+sfpvksifX~y*lb9Yl3J@elTyW`(1*M}
zO|_a<*T-a)HfgfX{3R@zUMTI<wJ)klvt8Gw3dzxvaSBVZuSAzF;T604d>j$;B1;br
z4YvdpbdF4RtGJ&nF{&5z2D_<P$hl0}i)67XnhPjJ$bwpuzJeL0c++T8fO4D@BH><=
z&gl=_&Y~?b7StjU<7670%jUlmpJR)m@~A36HHME+W}w9eTB&rlDEr43XZ)?{%YSi^
zxSX&QW%sxj1D4FlvdNxjZv&Vp+i=htZ^7lrZd0gNvD<UmZF1`gnqS_(=EG^>^8VXC
z{E;Wy$ijQbk<<%>cuWbV8T)I5u>@F_68JNB!ev)hX0qt!0BZq`_rsU_!;iKrPtlUA
z4}WTmT`Da(l`~77l&Y3V>K|yy?VDp2!&%<;)Ycnj)~S^IUdSr7$FRtoU`rCC?*1`O
zVMc^d(g;A4f|Xso3!N?w5mCezAxxt>=F!@k-(87>O+8H^9@oQdB5!NCrqG_4)l#6e
zFbBJ^(!ua9Q*=eo@RTA^_~ih7sAtSstSY=<SjB~E&`GL(Zd0=wu!$HX|MOd$)0cx&
ze<zb#d+OSgx)i?ENez=(i@*7qO+vJAP&zo4e1fcq9>;*xaiJyJ$Lkm_cr?R!!HLmF
z+J*h;M?a;2WZ_fzD^M_`mKMSSB&>%L*p@iMp*WOZ3`v}Butli}7IxMq)igO2sqq=E
zY!v1*M}VJgM9m(Mt^_A79&RwX2neKov|YKpf9=z4P9Qj_hCW4f`r<o*hm6;mwjz(M
zLD~>ONQ*#NLIJarU1-@p9%&212s~UQmjp;jV#uPs!EPRMH=zRMw=3Gg^W8HRT-Zah
zJmMChF+zR@_>uOg@l)rg%1^{k11+S5kJCbF5j}))n7~1!*dYsHyh+~^X~C%>#MpA>
z<#Y!Lv?<Kq3_f!SQt7+2to#bC+CjEa&RKCwC<luTELy<xopEhU*qt$L*OU&V`X)33
z?fO$lM9$S+l3zzwZ|?Le6>Yux+1!B<?(3EF5_zw(Cvo-)u62w!HJ4NT5iuyV*rwnf
z?asmnn}T=4Qvgoha%_7A41b``)+{GTIB{V(6j)&z-EG;o%6-@s-J=)Sv`EKB^wM%x
zH5lBSlBayKxz?tmWt*Q_8Jh!dT)aQ6UQUOe<TALgT{y>q71oWf4c;%8t^iQgbm&uQ
zVNAzziVmxm`2Jr&G$6qi2`>a^(+;V4aPz@gp7dggdJaFrc^`g4C0_^^-H9aEm<WzP
zli@6mO+@=tJ#=_WBh+7agt{LAdi||OsJ-q8H9rFRoZl^CNH*RSDY}HnSimeK28yGf
z7z5pjl>4~KTC<^zcLhPpV><L?Vl#Y)5*F|^ISmy%YuB<DP0p~Oli=$+O*eR^e*=bx
z2v|eYOTTByPjU9w!3-=clOAUSg!b~AG~N=NzB#-HX^ppp_uL$E#0Jh9RK6_R?qLhh
zL7g#r$&Qc^TZwgMfH&!&xxUnB@(ONp(K%TWDNkG6cGTzwN&i3x2pMN7SsVgsSJdjb
zioL-)2TA4TU_B4M4EV%u*G1&=3iOw`*NQQnF~3odcF*Ad#OvcxCEG9yot=s&vT@Wp
z*=P#<euGACN$xs%)jBP7dO#V`X(hi`7Za25J@AI&AJ_^tvmM8x>evnLsdb<mHMobz
za!TXuN`PA8DQ*#~B|FWA=jxXB4c8MLYU3f1fwApOJIH6l)m#luvsnlR9X68==$Y7}
zO}Bu9LiDG$prX%h^5)SS%OH6&#I$(l3fifer;&w(6;IH}Jhn|roFn`pz$GRS#`|p6
zG*h_5wd9g>Yw)4YtwoB;8b)~Ox~k>%G|ZpMLlQS=T(-qM0DxZ*J}kFX_>@JX&w#iM
z9c2Q^&O_oag$FIMlE*wW7g64V&1u{!M+XHs?IV6zikaz+GcjHFMnNu1`Kb9LYdDOp
zSiFl&0U9Dgfj?>!ZV^i{StEo4!kYru(#1=*$B!%WS#tu%fJsyGCr1NLj&|PtN+}%d
zIJ_J(lN?0UwIv7GsM%u9qh6~3OBWBCIIV&QaiLDq5+^h7xtZ2r_Q}n-5&SZD)j=R<
zD&80U7yL`Z#!wiO;961A>tIkFXci(xgBVsMlH+3MEkG<p&k1C4M2_-69ab7bogKi#
z*`ZR0FarnbgX9B-Bu&zdd?EQjvf(0lu|__kzs%G*OY8vxdraI?wMZ`vYvgG1pb2Hs
zxaikVxsu{0PFGSCNV%f`INmq1nD;D-b$nJ!pa$d{;5;m@4@8WzwOVu5?jYU--jp|q
zb8@ggL}IHFGf^*y5jrHZ^M5hyMh-lWwAQslchb5<4S7_xRevCH<N#n<k1)fiFCG!*
zxr0t?bUGs0FCno~a-fuJf7nkBi4>c);ADsz+F*);M!K_cI1_`;P^Sm#OS3v%a(pi#
zjz%0$fXP<CEJOit_72o*#M1Ik^KM*wKLp(jW@Wk|BeX&>1gZ|y8)VvswI;M{4wK>;
zY8%w|EY*qSL8FyWK`^le??R4KK)O)DFwulCl~9jgCB%}~#Q_NI80n72y2DjzP+%lW
z6qpo^!$MjGqN>6cRk5Y5L?$W#!J0WDT;+(YHGC0nxBbpsqu`%v>8`!KLMw>zc41w)
z{v-^tC@1Ed5f=h{ohRn-tF#8TBsw%k&FJ8my|*-b)HDzI%|mgvq`#s}7!oIJ`^k4z
zbjsX!1^?5E-@YrcV>_^}_<azD&MqEQnk(H|L??DSh+PWYOZbR5LGf;`IisnL<t6j@
zZrp?X3F?8#9cJIoKS`XXQ@juXRZ$_jDVWJ)V|@L>lBFdSC70vGI;4F;k^~Q~L&cfK
zbXwBiFg_w!7*k-}D@v}Ktq9o?2u?9k=v*vCAgR-G8FQCn5}H9*|6v5b02oAqAnVTz
zgyoJhe3hk|@>v~;`Caft4gjgr(PhxM?;myqsFczNdCg!+YnHWwAh2wazxOkHB;kYT
zZUx3=b#;VZr!%Oibw{bGxm(EaJ(jYd`uDV$Th2t4cpvJ6+eh2PH96bs*(TR%^#*8V
z73a9dTTXNzEWqzBH#IqWFK*&DEYNM>A{aP%#%b|EYB*+-qz~v!wqrJcs4N^BQuhtJ
z2on<qv0?emu$V*N;Ob$EI$R24V(8%$3s@S;A%|N(@(4_u!WRl9RfhHy086CCc3vvo
zDSs*EW#2`|Aqj5*g<>vGY6x|Orcx)Z0g#L@ryR?owrL1PqJ%8YDALh|YfYeE2iYq4
z8uXz35lD&7!D^TB_j0=LW+3Qz3-LLqTY{yq<Kh4}KH}v#V1gaCrYXxETHyQ1(HI2S
zg4Qt%P#KgFP|}i|5lIw20p8Z#Os%B6Y?>e}?U>3sY0dzG2|qD*Ba9zl8UQs))MG%K
z1t#u2D70f}IerQCY6;@lnv@EQM|-Zu^;bv3ni6?|Iah-=wkj}4gjQ@$HSmNgp_Xl7
zRDf6-FN9d^@0S%o^F6L}_}Zu*!9$KEdIXPhG<}b2Q}%QWwW(*ukkx>Jhd-Y8_6{fn
ze0PzEBkapVK}Sm?hy?N_C4_V?A$*y3zW2AgdF^Y_A=o_3%13)M4rYby#T4pNDkf(=
zZGfQ5U8io|Y&Mzn2bMo8v&3ts7v<V@d`NDfqV%G3Ah|TXST((<z>Fy%O2o$LMXiCj
zVKnq&^(qGvS#3cPjnZ;m;}>WcEsI2{YKj4o?;-nH&R(?@!65AG9mwqW^}Zw(`M;L?
zKT1ICDKPI6zPIyYfDseX6?&^Zig9tZXxj^-wvOpI7R7G}Sv$HJ0d5Z;Nx~c-2?=Ub
zVImad-wC-L<%mSts(@KK1<8UbS*WFCHKBsHm2!T-NV|6D7=)|k3ewS&4LB)IetU}x
z7NrE~-7KyU=oq5oQ;H*e*LgU&WL*=dwCDL(I6~{1-+F#9Rj!lV4I?O*wmN|GuwXN-
zFds;YCJ=VxeVU?nl)~(3)P`)YUzA`=G1gj)<i4l$#Rq9fU6dZi)BqXKv<K2M6XbV3
z@$Q7B$|CVX0EdgL917VCtq@18@r7f_LeQN$T2^mQ>Nyp)P873Y=&8f4GT`-54E84?
ztRzYend56D8JF6<4v_6uz|`_2v9jhO#XhHwQqB>`?SI^E$Y+iO8V^qC0i6VVI)*Dg
z2P02I?Le1M=)NOU<H~(Urb<JUmNO*go-0m(NL14r$bg^RH(qe8(-8hw*ZAfDJCmiX
zu{>S`wK!lgs6~zr)bd~cR)ESIS`<)rgZlx^(b5NQ)q#r>EE;(C7>a&ftRS{=-(K<3
z{=(a%@r$L-_WGsxWP8Z`psqO6Y($$yL)i<k<r<K-f}bKJE2b;X$!<beEu(pS4(4Q>
z=8fh+wF+{FOf2OhVcPxj+7L`izH9@(w1TBt#J)F_;|g99^YTz?TO(Ob?Wl*q@x1Nz
zL7rxVv+)S_+U6jn*D}u@>1ajJynz?iNr`vR8tKLF2NN%Dw*CMU9hch4kx>d%T7`n3
z&$x;#;tZ|w(Ky}4hK#mynsyzZ(!$BIhM$kpHG(IysLBwRT2=idFmkB~@bm6c025_-
z8BW%uvTcXjOSK`PYA>ttHzKaSVcYF2(q@|L!0iwU-d_ysf`pcrBfjer*)j{j(S<My
z1uId6OaH)uTL{#s)*igfz1A3Qyn@QksPI&~O*k1^QrrtFYfg^aCUYoee_NLb25D_4
zGp1Sd>Sn|G<`VU-y!!R1e{JQ$*X6V>#|BB1XxCs-$+=jS@{mRC(8_ho2Vl09w)^-J
zI#K4wj_eyzM31Ul???d<=%a%|YcSQ3Q236Mo?MnZW(+srY8VI9A%yAiVWP`@;E79#
z0q~uu95rm52wMNtp_7jzc}y+q!Bl-Arn=2)4pDqq>1u@a)^d2O!$qL?8h};OWdg_+
z^l=A$^$z-SP^tHNC^TLcBQJ(RdCZ!zVKL_|FlY=_mUy;H3)u;ngm_Sw^I+nUH0V(1
z-^x=Jy_ybniI|Me`kAb!Gmkn2DHcIWKBPk#%)Th<e67K>Dbx*$^VoRsoLB0iu3N8*
zI$|Y&yO8@>EH;HDwE#;LGH(McZQ-%!BeYtg1D~Y>dds76d=i##+SB816eq)c6jM;>
zH>cCsD{>0V-ZlrZKM1%|7Eo(Wm${X>g*au{)AC8&uQ0K5gtAy)$EVQuLI^9jIM>9~
zTFbE~Ou3bqqDK8_M}N5+U(rq}a|S+cGF!^_^`JRoPNpgXDm-aqt2(lkIIG&BB7s4y
zt~5d^yQ`;p+-*GPU*EI%>&N};_bm3hYGgAot0Eodj-eUrg8~6ciRq|xNc-eq(2xef
zPzj_`S&*coAeqootWR=qR{A&TF)MhLkywMMW``Ua#F#xNiy0eJr)ZJp;7ZiA5eG8y
zs(HP-CPOV_nNeV<5(^wdi?s2w%kB14?G{^mjNFm}Rv7N(!0^b1CFeqkTh)2y1f-@%
zqRbB0hsg--?gIg?xs9;fqt1&5Z@wq*U+ckJ{A({4daVqeTC1+T8`lrBsJToN4zQ=S
zL$*2t-#X3?z6ItN3`{P(mR9_YJA;(2q%bMKzi?ZxDzf&;&GP4EV`Xu9W9AmpHCv-;
zX?;{_U7z>Y8sW-0j;pw`C1-2c$lO{&FCwb+HW_<0CSA>R-Z=MA(5jYXyy|l6hIIIH
z>$-IGa%(M5ja9}m3oL!2R@2x&=X0ZknL>|(oWG^-S*+#^y;c<K*3%2e%GX`}!ZGm;
z3tyO~4jj*pkY=ur{x!u`CU&1gh)X)eZJvwg-ln)0>&7h2Wl2}|%!2CnwZzoTp+jx2
zr~n@_^bWC4BOG63gh~th?nWspe$hLM@mB9RavKa+whf@HN6(%P9}5sAzIFImfGEAN
zFE*xKL{+f%Y3m+728aLmrXcsYDF|w*ENqobmb;SG%D}4@@x^qByoO?Wz0SE8(`DN0
zDyE}y9*XI(3}7)`rG37lKBYKLF+$D`QTVKAx&tojiTY{ff^%Y-or=XvxD`TJU=c&G
z=k=yOz$ryZOj<rwF5D*XE>vy`qH6%7Zc7tsnt0Ks$NSJxosLbUdF@5J|20#Wt;6bA
z_JfmKDx3UDXTl`ZIi$}JIO{_+-Z7z|lt-=91*Rq^yGpy(a*CI+EAkoE%^<T?sRaZS
z6*$vcN`ad>s>uctKsgreRk|I#+-mC^i762(it!d7M3nsBU>{DzP2=HcyDrh?YPh}Z
za_f4G7OPNvWi1g7^9ie}G!79P;5Gu}3xQ%6><%Rid?^mo87tEz8hcE|IABwZVk9Ys
zv5^$b*6MVL1BkmqYlR*Lt<*ef2LY&Dp;?TGjA6P`u#N*}x>{2m5tgHLiQz+w=V4Pe
zi8rbXl+6HCd9thZb?dC>0vXZ^CtTO}>lD3MRJd#ztLzPZ?KB-bTxSm-KSL|2VW|{U
zs#Hof2@FWZ;FcIkJ<L?@75R>8saS`aI-#XSIxN#+e@_TNe_tK-QMSI&=Jdw3pP^0t
z;`?$PqZe+53#P6YPJMLs3L@*(2lH73I$QMp&StSqZjJKGPi`hK64=uqQ36zMRQ|tM
zrj5qF4R5<`<EGVX(wl;iZw;*);cG)HR*sEFaiO98*eYM6t`9bcTJ7uBUVp=l>(+1H
zGO=~r_8mKSP43>a_vTw}y%hy6%AR2JtWkSPcZkLbKK0Y6JqeG9KC*m#gQZdXhe_H-
zM9uT`9DX2M!Ha+3J(H8!7<W&gr@X+}qT%h?I8Pr>(zQG{$?=Wfo~`1=W4`f;Y&Ca}
zCh7H5Gdc3rZqL^6;)1XCaF%j6m!#KG&3MjN+n=>~ah`RhrtnbK=5E$EdMLY&yK@Q>
zYtQLWeP6bc2agC+#En>l^FI-{?X?|AI?|c<^;A2fO<vb-GP{8Xrx$6rt+pMh?X;^=
z?WDt(iKqwiX7*njwHXiA``Dgt)K1Ww)UF|GFMHjM+QSZ6y;#`GCvqCKhkVQX`9M*l
z_Mk&nFBbOjA)ZEU+E;rIU*Kufjyq(T9C|o*^JSk#?U<SG!}a_4(oUoHfHit|eUeSq
zMr~@5Ij+;^pKt~}Pn4*3#Lck-DLUa+HisLv4|x!7&u--I`_!A;2eN72m#yO|yKL|T
z2Gv7#U$&m7-|Jgu*-hMiz|GNYx36|@wt*Ml<E!n<HgflVH^+)hys!4|Y!ffu=jV7^
zwwb&4(&(N8_1m&7+}tmq2stSf<zich>RW0Pxq)r4^f2~!uB;XhOMN|aAaDw`q-drM
zXLP$fbQ30}QM*qT8(TP%#oXQNC2cbs+Kt+~y`*i<Cb+vNVS$%pbt?}JUoB~evTeM0
zm!I^eY&&;%YXZ(R8CKts?cnKMS4-MEvYouR(>LCb?c(m8S4-L**(5Ix`D!<1ySaPE
z)sl8F+rx`Hyriwq_HuX7H(H<F%-w-p(hk?xXSeX+?Tes#Oy9xM`oU?Kw^40>E@_AB
z8_85})Urj|tz@awsO{4llCQ4oIDmcHsG8m&pOIj%MVjO~;`zu+9Hk%^YMg>CkyL9Q
zi95nh)R3-jQ&$cQJQ#f`gAnTB`aXf9B~dA$KJ{+Vr>GjWn`M0)wY^Cu<*>)y?M_J6
zXw)X%-7Z(`bj1!=Y<I;rS8R2~ge$hVVzVnYxniR$Hn`#@SFBG+v}n}UC7BrIMhDpq
z37P(l+Vx6|Xz;x>1NXWlyOld!*&+q*nRuS5S18uFVzn#y6sjJQVWVQq6)Rn_!WDcs
zOz-&8n+m=_rh@N;so*<dYbp3n7&cj1A<`e@<*490VJgV@P{GHLq<2Z4Q9=HP3PRs1
z$p275{)gZs|3d}&A1cWIP{Ary%tZc&3i3ZxM6L*3q5Kc1)*8@)C>_@Jp&UW(a0QhU
zy_hQ)V(45H`=}iSv(059T?AgeE{W;DR#W(DZsqGdBHh+(S&=(~g>Jp3y~sVHo)^RR
zBKL?oFKqQ*phsJRq+^HbtkZo^d_a!%Ksv0bcx>+58$gT)y+3%jEh%iJ&g|ujFVdYh
zklqjhS|UkvzTy0B+<UEF|NMJi^v|DjGkAn@CGXMd=4uEbC^IKq1Vslx3a;zg89ZdI
z;@I&|hfkUc88i|TtXM!|(Lb9HTgwnzc4Avg`H?Ku^l*9FXenP~P+2<YfHV2dC<@`9
zd^xzYy-I<nYBtZhzl#1Z9%99t9BMab+vMD`;NmU1J8h29RViJji)FUBr2`^}%TKnJ
z0Y7c<^TFYA>WdRulqh`P;;Saw6o992`q?rC6xdg}wKOLZLWHuaz;`Ejkojm*xH28h
zE~YwufCD#1+>(_1gryp0iEaUzqDp5vl6a1vJB+o{<yt1Y0c(O&L$_(Cz$fb>7prFV
z_{M-Sn;y_uF!X{37|t-cy$a0a!bMY0?dHODQ{TG<OQ-HTCgrvz!j&uwl%i#yAg&=f
zV_<yjZ;KT$q0R5_0t%eR(?NkWN@wNNod>vap^02o1YUME!6qA1YL{z^2=nJu3|9e*
zq!B*Yu+nDF^`SB8L(7JH%iNHNy&ab>>vHKJ!LF9ujJ3Ff-$}fRMRQ%rA~Xlkv#8GL
zE#OkICyo~xkj&4q=Rx^l2#{w_w%}TJu-OGWirjP=^v%HJxHE@pA$NM1+Do<g0nX|I
zE#Aw^Rd_)Z=uoF;epSESkyEFqort&8!Z|s2R())#X$;EmE`z>Vgn)y;<H>7L-#5Vp
zlkZ{8g_B>vnoE0Flj{Yn`6g#9AG(HSmh(-d9uBGAJ=T`iwXIlQRMOg}z*0P%8}2q{
zJ9{(mPlW1r@49tS_)BR<?4Q4bfFW`3*_%;d9hGb*!CuZkJ*x^Dhx6VjWj`A0HH)=1
z)m7)sf)0sfOBqX-x9ceSCb=Baze`g-jJ}i}DL92P2!IX_rUksNXSl~Isi0CNUETpC
zv83ri6u>eweg;F4hlA-V`iJ?kINCTGl$^0CWn$}4qpW7PFO|>4W5?l)C5?|Gx~6=p
z#6TWYm(J4KUl*y+ZLwua1LG~bB^M>3Pvklu35%+DWT|I{V93@@xb6O>EL91VBsPx1
zzDxZ$@=I38$6u1BiVH7sKK_z)wS4>~>9~CSCFx4}_)8QCCO(+*xfc2Oq;Av8nUt)1
zzW1;Fd2Q<xV0NP}p{Du#_{WN#HeockWija1011C50>HHdNbVlP+ln7OOsEle<8CyS
zZT5*BZPwvoP))WCX<>tDp}7_Zly!s_5q92H2kHqP+nZ`DNC!!zu_cClRn{QP8;@N)
z=gfY)#MTrm58*?3Aw$`vSi9+@R1c>ET8{um$<`%o)#ST2pV_Rljh`z;2^k`Afa{pz
zX`$Ehipb93MZk@Gr-Dnh;eaD<R6!wl)ZA0;y4&)qYs)L9GFU-A%qJxgPOgiB(S6VD
zu(9vkkm{?O<qPt<+B((*>CWQkjG!>%f`OcK=<DUN^u?==nqJPU+MU4f?UlSj00z4{
z2Tfe4J0Xj#=kT~VJJEGbO<xE@(NaLQvTZH<*($4<&n2ftMW2ZYxn{Cs&c>0=rH?XU
z?GTIt@?+lz!6_?p_gTb)Gb_kLv`=}7fgvo;l(3MI<9M<~LXsm*_DLmy!4Jy7v}|*I
zn*yql`Di^*AlD(i!qWxV#9orX1NZ}%#mtxa>s;l_ttGB!qVB2z9evM$(BO#=tMuYb
z2bDX-)*gt~MrH*1aSL1W!l<?Ih5oeFBGgcdw`FI<qJ$RiVUBm(6Xq>Ba$+r?X#~9B
zWRYpJQUbO4Qb-l@+$CKp_ubAukuRc<0Et!7A*4@AYp}qQ)+p#G)F=h#wE2|2PF1Bz
z@={^p=S!4CDMCSv2=b9x1oRx=2Z4}IUoBvFDS%NZv`XaCgp072$Qj#>%f1+JoJpZ%
zo?@?zNLx6h`we@V=Xn+jn>hjLY%?u<?S!JU&D8&zy&HM>vU4z$=U>M5+r*}=sAD`I
zyBt89ney|si)ItFgIDc>o1mL*Z0RNaW9frR>xgUG)&VCF{VgU@Tt#zEM4KL1*vw5(
zUtctRwD7f?pw6%@@){pf6SSptgm^e9kNYM_9h;ysRxt=pCdCPe7S>OnfRmJ>16)#G
z{<qMc;~cf$llbNqQCu4lKN<I&OW<=i?vR#=HYea@7tlVBX5Z0gr1VEOPy&uucwV1N
z!}BoJ(4%QVWpPd=wwZSqXCC7G$vK`Pxf=HnUsEw6h*tod{XfrYkU&P3Y&Ffr6uV7C
z`NH<bcvR$Oz~UkUrf)P3n4#M@9tX+DXLpUkUUw)dXU9*7w5Akxrlh@2Xk!A!8xf|&
z0dO;l%2)7&NyW5EW$@Jbd^xIc#6ML=wFFm-4ACI}YJ{B$(mOJhm8aLvC6*h$_<b3K
z9$k#hd^OL~94gZ;qX*tU?ASg-p19q=UxerL?i}am{VdA=c~vI`dDTT_0s2c8bhrs&
z&l~1;&k)@w7t}Yo2<?j%mctD`lzR)}<bGA0Epm9W_S$~sAd1tz5z1QlH|BR1vmJvy
zNJZM-K%e&Ob06}A#(Xw?n$XvLBLq4x<xL^bReci(?AMk#$k#?-t~veZLX-smItYx>
zj>29sM;YwqC3q2S+K(G~4aRXM@co+A*K`Q8_lt6zqkoPt*UvRL&Q;A3=Bh5raYX3E
zac1AeaXmbiPpyyRsP8$>PAFf6uq65AcSfr&7W)#Ob@18iS4(tmSfaC%oR{(A5}lWw
zYmLYIBA6d=czn%7XHITt?L{mC120WmZEmm!EK{zT=!{p^o9K)m!z|baT9D|>K@>}L
z=J<tEXUaYc=)WT8jjall5xHmANOb1lsT>skvZ_Q6XH9;Jd^VTpT;MuSbk-?VJ}XC}
za}6kHMxrx+3N=r3=Fga7EG^NQOUrWBBSDLI^D>0OgS9N@l?rz1U7qFK@LA6M1=yM9
zM%>s2rpI59_q<VmNt7&SuRZC8d+{^{2cq+Rl{SecgN{k{_dmP;Z~;vi+e4m(wHXZv
z=uW@PFfFPTkYm)r+$p$D+N6+DXpy2Irb0CO8?5FO^uMmzB7jJ!DZ(Mgf*8<2e>Fe|
z4c4JrI)E3a4Tgw_DA7?KL0XHGTL0b7LpL@V&dk{U#4FoL+Ig@nX00ELoB1kLSARD2
zr2-?Ia@TvbDcO*Ig{8HEC8u_gWV~*e<tz<`xINUtrtKMnFVH4@31BG(B}O`Y*^(a9
zJ<x}@D2LtSD;?;=TjzC?!#38t;Vs8jlj^1e+a0{|NN8g5K@-bSvekWO*+@z;OD`S!
z8Wb9HsG41L65xcC45mD0=AplAtZ;6DHLyLqHbRa2#rk~+9qJ%dT!<r-1H-z_a~av@
zAPUF|8qwc@y_{`v4m)VH4q#KSA&tL03&^o@?C06=sdnFMv`{S_>>yH}zeAs567H%d
zWp1gQVm?(D8v+Q}P%tMK6LR2%JqHZIcUJ2RrMw@CcdHM+@c|W7fG|x-Ckw=b9R0lp
z3h`LQlPr!n)M^R%={VaCh%kxKRhJlDwZv#1jq8lCON{1jl!%-iw=;!?26b8mJLnXi
zy>*GvTsn8u>Ar=D(Hzr3oAoC~^Wl3-j9!(wjA-_0zy-=zfh~C>S|3VpS4jjx%IsXX
z?wtRSQ&|+Y?;Y^>w7@;`0YY-Z<_RfAF|SWB0-m7NJQ1b;H8R>mP9@vPC6Y3K(ynrH
zvS1R=Q=MHa2!f6QHAX|QkdyB|6d3($&rCUZbVYeorDaHiN=3>+yFO0R$&gk8d;X71
zP~u%KN7@c>dW*y#AL-;s=af<Ba^^b}a)@l##O>x|>i{R-H)Haud6T;4l#z0zHABNK
zaSqEZv}uD;=rJHPm&CnXITY_Uo$OKVg~Fp)J>BA8FQT&fY-2j0Uj3G+WiIA8cGxa!
z3_#@&k}?gcPu8J^7bZ9^%a$?A01%Pqkbyg0YWi;AF8-bJL41@bY533OMS`QuNgise
z5K0@F?T>6bv#iX>Nu?M#E+B2u?=4t{Wu6+n!ln4wSL7PmPeRHvy*WN@T1VLxf(c99
zcjg+|U)tFs_ePR9+UA<mNsW|}(?>4lQ4a%*mZcB*z6p0OQ6*dk<#&P^2Pd6;BhslT
z>xGh}PQ!(fz0qnST0@qooh~Ow(y^A&5;BaYHF!`)(WLD-AKaq4SvIH+2;ymWwoFVs
zHi^``vwqs#b(X;dR-`Az*?3GFFUH-N=9xCfgwXa#3{+aGWKGKs*GWM@Sk(`L6EyP<
z2x`*JoDr3Mn6_JIP$*+xszJc9dDH*GLLdl(xT?%n3`0oj{6ws7m|7>&W_CJ}Jq(N-
zNsH8n+058=rliDhb>J1>HKx^%NE=(yqPR*9>4GUZt+L1z;C&|}f^HG8d+;x?krDH5
z7Jv;U)c%@KTgtWw=FGCc!je?GDcj4%VU~z3iG<MzzG;hr1J6p#wYTiASt6;c>Jzz_
z%E3i)<=GZ3Zm;bvpUB;l#tn9q$W0Jies+*r2pJ9LbdkQc;v`ARoq83iBGUz2xxeJ)
zy`etyU36MkaUW;Cz1H_^+<DE3@*Y*>LrJLOj^39hV!qNpriu7=uhT>ve3masE^8j6
z?<TM+_67U#%a7M_D3z!V+RSL1Pw7;5PvW$6H-9(Jxdn=oaCW|+crVRbB)lM8i2jJj
zJ*M4s6oOBMl;AMMIBpQdFdhPh@~frX(iOC^FE*QY;+Iqvj;#M+X2Y};n!|L8X(?P2
zyD@(ul!DQkg~GHH-iL2$spOr$(NfEET?eQr%}yt1DQ-+lQR0A0lsNsIy&TMt%Wk>q
zWO%SaLQ*%L0SD|YT-H|9G8@2a>X=2aE?40y{B=1<cqAbnX0>>erIWLj1k|LOqhy80
zHQYJqlyp8R(5R5MmZ=yAB#P12Diy<IrvH88G3~))>viy`q?uOD>vhYLuYenp;@hOs
zASPkTi5yFizfRfb_)H*|ElTfUbtTM>O63j|+G?#+xD@xAhv0+>h1>taOgUWb>?CH?
z&PAFxL~@JO4O8nxn#+m6sMlOnHihf0g*HapOH<@bf5tXYGLPj7xa4>xD=alvv1_1m
z9mz<&HY#Q$JCB}@nvGhdf0rF)%;!6HHp4}=`}KD3g!$wn-k{gp{VzDk;>?ZH+Y4sj
z1CwSiZ$2HylXRX7URlrV**>ha;CIx|Ql+|yn%qH8rMfMkXE)2uQZH!ekkq3*%>{M3
zGAC@o(L{vnCv4|M$4ATE;HwE+be+h-@`TlL5mN+VEz8ZPgSai^bm>)DZe57!!dOu{
z9vln7IZ<uhs+70RDBgj#*1diArMz|fHfr`Tx+dL^jp$m~=)A~@>j5*$$BRziQP!=N
zwJ0K4OS=R3K1?6VasdNCTK2^`cn#g<x7YRDZI9PP;TznM7S7OJFY;fP&4;ZKBtV&N
z%Hh)YNB9%x%5<w+ULzkR(2++n-SFY`k4ajl+n9nseD7YzR9VN9={AIjwFhV0CB9pl
zmUzpNqI6K1ZdFp`xfszJRc@rqbQ=L`+H^DB#E2+m#g`O<BId;(e~rbiRi(JmPHyFE
zp?yHN+$C(_Jj#wM#KLLNIb-@ntV|bt<YlYJt!uGCZstNM4ujMr=Z&F!&YM9nB#3p@
zuC#_&l9{x~!CU~OR%_P)+kkPP)7nGL0tp=&*aOEhxWhf5K}dbtM=*1cuK&eQI;^Y{
zC9rYHUn>|Ckmgf&FyLmdKen~V?46@ZGfM)z3JX5_?<!1$C;(52@BW-*K_H{o_Cx8i
z?i82(y-iUrx=(2vfqfl268=Hj^c^^Hr4r3t%=qt+B{d$pPAqA8ZitU^JN)o=GTl2V
zt!6J%E&?jA7kLUHStuY=ixbjL2mI}rv)N@%F275Z>%oVZb5Wcacm7>Xs-HWXUGC)a
z?{ALE=^9d28)=Yy&<;&iCb><D)*|q{;N!lVAgY3w=AgQGyjG<CR>^ICDc!A$v1rn)
zUG7V6BfjR6+Y~aBUrokYp4>*;lrPbAliSE|(!xSXUu5d}Hw!u>AfVItQibi62orx8
z*|@ryu2j<7kcuINzj8Rl?|E{Y&P=P43Mviw<Te3PA&+eUCJ)jPGjs-nlH17XMQYHo
zGE88}1ews739v&A8R9tem{EP$*$k$~j>8#S$QFEd-)A6C%_q0%3ndk2RR<(t15Brg
z?Ld9F<TeYdRp=8z&PVb@&<Ba~8G<2;q1m@0g+T97a&X&F18|Vqf(D%RT%v=`N^T>M
zE#T8Msb6U<(Q3Js-*i^gmiDH6H#-2mM8~0(@5VuwG}Yg9snhY9bSbeteF`#P_4MSs
z0Sq35+m<5X-K~1SDt_6?HlOuWN{*~VrIYWrOx}j_-D+Arh(p~6;*{6Gp-i^f`AbfG
zgtXd{Z%3e~s=xRQPw+<hZtICC2dp8;K+xNYj(2oZ)|B&S*=z_xp3Rm=>|8cm79`G1
zb*{?)|NCkTq)Fr8=C>c%GND7Bn}SehKvNEZt{GponscDVhR%U<vbZ+b93EP-lw+V9
zHm+NLQ+^EemRmUp`nKElW&3ZxUC|f3n8!HBlhi(r7}%#*9^=$gQu~;s0_wv-_?9bp
z^20pIlbCGV={^qdB()#nvCd|i7vx=?`#2by)P9gRcs}>mALrm_Qu`>kI_qg(k*|0!
zhd`6s59Ade<LGBn`v|wTclTJ9a{K+<BA4E?;8VPhXKfxo$K(7oq4`&bv+H>L;k>U4
z*;;O&<rblL%aFtM!#YuCdsc@zrJB^{c}*-pX(B%0&PN^gaMp{&%Y5!PQ15A~A)guU
z?QFJ=2OOPc@ceA7jekqFo)?^=wK<>5ZsLw3v>M&koQLW+XE*YU)3a9%xwE#b7u|KL
zae%fD+j}@smFV>BLS*mZRB57vv^MS(=SCBqo?VFQ-5eoJbdc7n9nF?<$LU!#{vGux
zj)x{XJ==%SNsfsoIz?+OKExs6L`P_Q&^alv>49UkoMTONa`vjJZK!QjDAIHhoK&LP
zsRdKJofD*qj?XTf+U*&uRvn);2;P}(;Ev<73#WD@+sF$J(OR`b*(UBdIcrn<5GO7Z
zot*8P+J`tzm+086wRlIijl1JLQ#(|Dht5UP!{PdYYzuE65X|^7FbZ?Q;J_$GHK%tw
z)N|o=9Uj%5iRzgWMxQF5sm7Ym3~iU&CU8uX+EMuiM6^aZJeuf~tx4t%4v!`}T5E#2
zBiqg$M{B#-+`$7*)%G#U{T%*GbgFhCHt)}N@qz=kHtFrzBzK&uU5L&1a1J!l0b8rK
zjl-XbovM`&wT;7{iB8q_3FN&TJWO=Fwhzbmaz-(!y~p>nmGhm6&d7Gy=TLoXZJSBs
z;reEd_9Z$cdlimb9BAyB@NWoN9GCSomOxHs|Dzrv*nPv_mHkh8%$Zr6#|}RJ!0lZ<
z032pIU(~}p7a4aIo^_%_v*na8?vW~`^b9<dbh)?FWf^UKI#G{t5_}jOPeAFWWtXH*
z&Vh_J>uaB+F5d~x3E5jo#9=up180=YY910mvWxB@YQkY#Q@{tbL`^tbn@J_z?(X&{
z95GKgIBW0rx#Bigyv-H2x`N}ZYHr6_6CG#OogHUQY8+>k{MvEW1fjNfcAPcge7xP+
zan=Ninc}qLtO<vwvjN(1oK>92aaJLX<E+1-zB$h-Y2V<Ua-Q{NJ>@_v#|U(wRbs_~
zRuvp*tx|BHRmECYaG+IpZCA8(;4_f`=^+PNRdAqH1qWJHaG+HM2U^u9NrSrMK&uK4
zw5s4hs|pUZUQfY+)*1x|S~YtPw5s4hs|pUZ4pVTTRfd8CttvRss)7TpDmc*Eq9AQl
zdYuEUD(paOq64j)xw8YUiFPM%;m!`UCfXy=9S2%(rik1fYk6bFfB>id;X(O>0#*EX
z7d&ZK*`I|o<Xb8wvf&R3B)?ychAtL5X;b8-D!~fR*>ys}p#Z)EibBH6h1pCgMaofc
zk%nyxWQzA_BcfH3)4`o>vZKFjlZ7;1rF38~EulB06El!LV8(`!y3D<RVa15Ul;U1u
zS$S0#56P=~KcK%V-nxsGqHMZjxJaWqa-+C=zEv9Hcd`hvG=7?D10D!1l%oBXr`pzg
z-~j3L$L>kqRlf17%wZIbhm_RU&X%vzn%VvFf5%`K!p_%#Nq5r5hy4`;+fm_!I8_WT
z9P9`uN0=Ps%54dghn{UzDzHBN(zd_ZQDF1A%`!v}*b-AJpl#;*m+VB;-JkC$=*#`1
zs<W1{DHuSz55Cz@TGzFujbVn=lYIbKfYOk^OX(U?jG}L1Ge8jm1fA|}TyBjx9}{aO
zLc8+=LbdToetv+vP8gQ0zckFTt7H_AY+p;Gl7)LMwk}#}U1lDn)&o}^W{9K=qkIRL
zuMlyX_OgAx$O3ev^qy>81qguW=M{X$Enm6L*>0)ZnxGIo%Xs0LtpA1W1?zLIp?4}R
zZ#JKl)#WUoIzgLL$tI=XJbS^c{rK#(I}h^~rgsgrzUkQzIA44=L`+=T?_%KVKvNI+
z1mLM`J1cL2I<_S&@^MUtIHkWr%-j`!_CZO8q#L`xoyRf|Zq<&k{v1SS6F8Q+6tBCg
z*hBpZAFLyP!biJU{0Sc&;y}H_wJy^;`R%JtXK33HZTLDTGo0?qbB17cR>1j(@N_E1
zQdC*CyRd)7DK|EE@~ki|h&To0I0{|omo)?8EdKbCn1WBI`_OLxsf*5QR@zcx_;}j0
z$YY`$L-6cI!io;T6C$wmFWXBNZnN$&1E<3{M}iKsvH7bc8r$}CNwCiKR@{4N!{$zA
zyvvtzGxdArD1Rv!VIx1MAw3S1SIu2&NO9}_0~wvk>90Mz*Iu^zQA2*SdR6d=NlLA*
zLpdo6zoWD@ca*lxo$5|~XWi2lIxE8Pi_9I)V*5Uyd-YA7=kR~(Gr3f;qdw`?M*}*C
z0@xX6grKdtJHBywW(B7qy`IcZ?s)uh7{KSQ+OYsx7HjRX=s7OuqpJ9bxQpYXysE=!
zUe)8ZziKJv>)JXBVtCCPI-F|Ep498M_$%XpAqJqL#6tXyhzvo5mq*%(<I49SO#8-$
zZyS`@j^NW9n~JdRD{+Y;)L}Wx{g<^3UB)uVTaf*(O&ieZFzVnlsRJ-h5D?ev|Hlw!
zEWBvOjy=uqFo@0X==uPTN%M(&F*WenCd|Qi9bOx~ovJ>Qy@OuY(4n_;Or=MB4ZX3@
zYg@K7w~ak7W8EqEG*~~iMX`-*=Oo)#>c=(%2*s9k@dhaF!5%0sq8UJ`%iec*2TF%j
zaO?G*u&ll2K0J1s^<vdCg$UqinPau@e1H+4Qx!sYltI{O*u|=A>h6p3=Hgr(z^SqK
z=KOdLch;iIsXe$epd9Y35|<u#cGlo3+$BjI;6?xGhMx}kFn<!KqfP#<Sh97?{pY7=
z&u@9~#N0o4X!^{S^RvgcoIiVE_Sp2M(^HS==aCa<9y)K&Pn~#R^X&P6m1R<I20^fu
zpYIKWV0FM>Y3M$>$fN7^?ceUB-{#SE0o%06sx8MJo<4T+?1j0!%c)bR&K}$H==3q`
z`-L#6&(rTJepZx%pb=y*(W=I+ehU25`DySo$dAAn3bI!?%XZ(~ERY_Uojp4nWPd_8
zOL(XH`dJ!ee;FntP2d>fc7k##<!?nnPz|z6Q8ILF>XE5qC+40=&ptXm`{1dwk1=qR
zEM?9Pz}czCj^sdoAxcJuX`Vwg!u2wKmIv9Z{DHFv&(5Bnnwy)RO{X0+^Kr6*j?T{=
z-*Wzm^IIO9I)8f0>|;#(q|Ny!<D@=H^9nx#c14i=LYx%$L9lH>_A-rK<y0-EkEisX
zJ~n$|j_EQ}8qYJG6*O$|!&&Qp7bgWKwgH3}k_~eY&rVMrPal~&bHZ9b_V9^Q)Bcto
zHm6e$oSju)n+KS3A*tSS;mnz-)6>V_#@L0Vvj6Pkw`6CY;O@(XWW`Dkqu?ClXPh6=
z3Lf}IA=z|=aW#zq*o{7v{EuP{0)Xt46Lz1yP)tJD@x@|Ne2JFZ0ic*{KXZ0&dT)B~
zg)`}6C*~ebkKTL#eeXH4KfC?T_uQM^e&E)vM-2m0=>t>8PR`9v9h(;9SBgo+PxVG7
zUP=aU?9O>=F6H5+QWD>|F%7a8N(q0mIeUqMmY=0q!(2<rwrk*O_Uy6g^XEa4>#-kY
z-=aBve!G;^h5wu<+6;sLd~E6r(@AHik6oBOf8x>UQ%|H*$Ie|iF*}`}zA!iaIOCR+
z`YWJA9FXz@KfY2<Mi=sn)i!pyQcl*LI0Ji~nL6b-Y;QWPdsySb8Hj!C;i(58@v*bV
zr-SVIN>ZPITC3^$r}&XTRg%@+?vEThd;0X*Gh4dYl#IVZvr8f}|EVMx{3?$g;Zg$h
zO8{I1>6K)No{pWJo!&A#eg49!IfL+0HHr3ulTTKYk?W|fe)O}JpX>R#0T`;uu!q4R
zeaq>y$F1?J)i;B+`2m0__F?UXfn@T*DVY0sI(IfjnN815%}s-n6Xz~Wr=GNj-o7_|
z;KbZ{gnc@le*EF73+Lyij|bTw(ceqJD6ziG<WMSC240T}my+bVvyW(q6KBt)qVf3)
zk351TF+2|><LMLAbFf#EgfQRdl4N8Zo#(h%&-G3GAf>M+L^qC!#k}_VOX?m)`EB6+
zB}!rZFyb=;57(0B)G0~y6De{#d-gFw|3WR<<2h~0I!dR~_uO?~`smatrhfc_G-Ha^
zn0ioJ>BL-m;(U61`uyDN*(cQe)mpOQ7-|mCj~;$R6WY7?!kNcrryg0i{-|a%l^%W9
z*)!8eU57wX@6!FOH89e>R8K~8;NVxduouWL*OR*bYA};AU4Y>KQ9Wt)KC<iVrJ-c4
zpAD>h=Ar3y>ePvc&YXtH1<X-qFPm``von;8TtVLmL3|yeSEpYYT2!ZBT5=7Y{^FA4
z%i+Yt#MX&z6Wb?tOzfQ4H8DA{dt%SliLG0=Zri$j>yE8Ex9-|Hxpnu}J=-R>ZQZtQ
z+xBfcw(Z=uYun_u-P`tTpV+>2`?l@dx9`}#bNjCCliPQ1-?L+4$JQO&c5L6VW5>=N
zyLL?O*u7)V&WW8{cW&FcedmsyJ9qBdIk|K9&ON&(c5U6YZP)f)J9h2dwQJYpuHC!#
zOioO0o!mCLeR9X-&dFVqlasqA_w1h7y><7t-P?EX*u8W2uHBQnckkY_2N3r#{2sdA
zL$f_Rf_axFg_QqLg~Lg>5t31$>|UVY;Y$?j&^;9EG3dj|$VO0@^X4Y5H}kUv))-ET
z-@AG9=I^6RYF$CSCA@hRBP@$|4<&T`=tyz`{<Qy6Um`^IUvH^8`bq7LGYz_2SO;71
zI(4#dj-WDuL>B%s<VR&bw=7xp62QnYc$rdDd4*CAf(P=&Wy!~}HtxUFm%StFk?vJT
zKPf-@?^<<UA4=DU+NSD+|E}&Q`^@t0On!-(pi{rF9N`CY6Mo7b;s2B6$@Mt}F!bnA
zTp3Cl2Ky*c75QYJ8%=)czp}|XgorRHKl*PGgnV{I7a_my5c0~3WJzvhP+1*Aab-o4
zJn#e>{=}K%(~pbOS0*<|vq>3GrKpZsROE#-$ERkWxY;Yc6KBq!I6f@_SeaDPb!vW|
zyO&ocrS<9A2h*cizLiNx@#@OAsuRZ+*NJ0E<ALdiPMk?^xfL^gJeAmuA)MSY*jPdm
z!DA0kpGnW3I&n;DT4RqT%QO+ZWC3N9;LgDN)>u;C2bW9wj#A?9eRMpjr(DW*EeEGC
z(F@~dUd=G8<LM68ULH@D*%Obp^K(<PbLUe$B*s-o4=^Zj`bSrIbcw#jS}#!I*37T!
z4mae6yR<4P<y3fKRnpEOpEd0*f7K1i6i!W_c?hQtKBt>k=`p2e`HD*ze^uh4>YMpq
zjQ6w}3MY)eI$2^+>Zu#mp1-g<DT=$8{%2Mv)sRa`XdGm}u{wD-f5Ep{DaGYNrBZDU
zj3p~-%j!!S%LWV0c*&Bb)n(!G;%KxYURhohu347G8;TpFP08kPBHkKri#`>8I{LZj
z=L`R=@}Hvrr}&=>--%yC=e)2cc`3U5_!B?;@&A6}eeXZ|(I5WUrSVmN+8Dg^uFYF+
z`{4H-`Q`uZxsU(IC;pqC`=wv|mtXwSSAOfyzWx`5p(X3L?wH(r^R0*8`F+p*2(Lc#
zYya{~zxCCxef=+jLcL*c_uhQq;GuVZ==k(=pZJNN`pQ?oR;UlHKXB-M+<*KNKS%X1
ze&x@<{uftxdf?FU>G@}#`yW2{>!1IFKfLlcAO8N2{NN9N?D-d7{Mk?c+%NpvuYdlF
zzxma#{qetj$MgT{Uw`SVUpw@!!|(f^4;}fzANkQ=`jub({BL~eH~(;G+4ArG;D7j!
z-+67me)`;>{dr?>&6%^~tBySN^gsW_|FmrR>NN-Nc-P_gf8c{3divrofARPK;7_jn
z&Hpuf{zvC7{G%WH%9bNHY~J#zU;Ne2|K`{J@XvpI-;X`NW#UKIy!MOVdF`vOz3cD?
zzPDT%Y~Hx#um1YX*~wdP+kfEFC%*IAeGgsu@>gE@-9P$Y{*Ujx7G%HMO1>DSN7~Q+
zdEwc&SH_CPp=W-fadYwH&ehB2|2$q%2@CCbps=G*=F=mkax=MSa7p?8N>mshsK%AJ
z97l0XjHehUrLZwl+#3&-OT}j8z2&GpQopBgd%P(Q3qz&B+TOyd>+7Yv($j^R>*v2*
zeD<YyW$D@f9Dh%FBw1b^t_{~_N&}^prT14h6b}w;EYu2NyfxWaSjj43{ug+)CcCS!
zDW0p`5)a0=Ojas4m7aZVXtc6rXj7avTZ8i-D?IySE0U2P_&~gDMWH$W&El5g&E=>u
zTAly-U30bhf3vbyoPVu2|0~6{wV(LX!0&AsdG6!!Wc8U34$ptKGXL4zb`}OoyDJAP
zwbER&I{rZ6d#dvv9vvT8Ry{Z{|3jsJ_F`>$Ve8Knp84Y&%C%x~{+|v#bGrHXx|>RO
z73M!)nE&;7EFMJke}=uoQW!Gh2)>R6;v{N@Lxm;9rAvmRk!WQ+UR+gJ8_vWhqt8XZ
z8~uLm532tr`orjt!&i&ni2f?QQuv$j|Hgh_S)2T$uy*6kZ+q9_AN}c{{>P<qb=R$L
zd+)!0<#!9iqwjs+zuNiLuf4kD2Y&EJe!8DW-*x!-^anopE5G{O_y1IN^3o?hT^_jk
zZD)`C)n9+$fgk^g8`s_cQ!o6?KY8&}pT7KSpZh|Iy~kC1Z#(erpZ(PD{OcFWD^|9z
z|KgW8D|!75>$dOS`;K?sb<chGzgOIL^w{)+C(l3r)Wsiq@#lZ>rI%mXavPq@4aqm6
z54HbcF@_w|g>cK}`Da(fTL;GrYpbh^8;Wl)G;W&z`O@0L+QPcZjwGDF^vq;+*+6Cf
z`91NmN_Apcu@#RM!+pC8cNW(b;zG4jE$>TjEYzyI;=RR{<wC7|&!Nff_3h=-Ge_4v
z^US*ns|RmytSAqZ-d?-0dLg+jyQy?@aiH|>Qpn#%EzbY&huZI`49x%RhuQ~{fl__x
z?#jTfl`)FsnWOjB!e@eaRPI}~=b7@sfmQJxhbH4jW#HML{qT=Jcp;hp!Vi7!xh+5X
zyU*V7Gyme*J>{DU(a{?Q4i2m<F8%N$2a+w#p?%TnANzMppZ)j$wEoPRcR%y7A1s_K
z*5hiq`QIL${|^J_D`%D;od31=RhP{F$TN4u-@kuw<ooa0@B@D^|A*`EEDjW+=U%v_
z6c+9;j_rt^X>2SUuf2Dm9)GZK>z-BhjfE<VS(^Xx5C1`;4(Dq3Z>SZ3yR@#d`rcaM
z)_8n)bX_>O{3C=OzO^nHxr8Z^|M4<qkN<IL{adt&FRx$JCjS0<LPG>i<iFj9%4V_k
z_4Ucf1dlZ8QOcfCzui-NJGC*Omu~911P`8`>ln9}ZhDIVzIxN50Dki(paBwmO!FkS
zQf}ji0L7&ZNwj%0YugP;{R)8Uze|)XkYC)89FWz~f2sXm%*A;#{$+M$Lz3*b<(*#=
z&TmW_?!ny`=KQlu8<PkSvgbD@tv4Pw``pH)eh+SgQ2XCGyZy?>MW=s-$BV?np4*g+
zJmNcefwCup_QIxXEUP}VDG5s~f@%5+O+;S8WWD5lWz$=v+5F~3f&S!XJV&~2Gr}GW
zKk>#Fdmim|k3O>*?xvRFRxeS?XZi}rLzn&zwU6@XIv#z3+N*F#HYe9z6|n4as?M|C
zcM*>*$@tWHBB>S)a8Zc8>FE>4<>ukJ;BaoamPhu=mZbf9gXDpcZ*J+r_bFf`g7w@)
L_t8J+(Zv4?U`;jz

literal 0
HcmV?d00001

diff --git a/node_modules/source-map/lib/read-wasm.js b/node_modules/source-map/lib/read-wasm.js
new file mode 100644
index 0000000..9bb6492
--- /dev/null
+++ b/node_modules/source-map/lib/read-wasm.js
@@ -0,0 +1,40 @@
+if (typeof fetch === "function") {
+  // Web version of reading a wasm file into an array buffer.
+
+  let mappingsWasmUrl = null;
+
+  module.exports = function readWasm() {
+    if (typeof mappingsWasmUrl !== "string") {
+      throw new Error("You must provide the URL of lib/mappings.wasm by calling " +
+                      "SourceMapConsumer.initialize({ 'lib/mappings.wasm': ... }) " +
+                      "before using SourceMapConsumer");
+    }
+
+    return fetch(mappingsWasmUrl)
+      .then(response => response.arrayBuffer());
+  };
+
+  module.exports.initialize = url => mappingsWasmUrl = url;
+} else {
+  // Node version of reading a wasm file into an array buffer.
+  const fs = require("fs");
+  const path = require("path");
+
+  module.exports = function readWasm() {
+    return new Promise((resolve, reject) => {
+      const wasmPath = path.join(__dirname, "mappings.wasm");
+      fs.readFile(wasmPath, null, (error, data) => {
+        if (error) {
+          reject(error);
+          return;
+        }
+
+        resolve(data.buffer);
+      });
+    });
+  };
+
+  module.exports.initialize = _ => {
+    console.debug("SourceMapConsumer.initialize is a no-op when running in node.js");
+  };
+}
diff --git a/node_modules/source-map/lib/source-map-consumer.js b/node_modules/source-map/lib/source-map-consumer.js
new file mode 100644
index 0000000..43ea1a0
--- /dev/null
+++ b/node_modules/source-map/lib/source-map-consumer.js
@@ -0,0 +1,1254 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const util = require("./util");
+const binarySearch = require("./binary-search");
+const ArraySet = require("./array-set").ArraySet;
+const base64VLQ = require("./base64-vlq"); // eslint-disable-line no-unused-vars
+const readWasm = require("../lib/read-wasm");
+const wasm = require("./wasm");
+
+const INTERNAL = Symbol("smcInternal");
+
+class SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    // If the constructor was called by super(), just return Promise<this>.
+    // Yes, this is a hack to retain the pre-existing API of the base-class
+    // constructor also being an async factory function.
+    if (aSourceMap == INTERNAL) {
+      return Promise.resolve(this);
+    }
+
+    return _factory(aSourceMap, aSourceMapURL);
+  }
+
+  static initialize(opts) {
+    readWasm.initialize(opts["lib/mappings.wasm"]);
+  }
+
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return _factoryBSM(aSourceMap, aSourceMapURL);
+  }
+
+  /**
+   * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+   * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+   * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+   * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+   * value.
+   *
+   * You must not use the consumer after `f` completes!
+   *
+   * By using `with`, you do not have to remember to manually call `destroy` on
+   * the consumer, since it will be called automatically once `f` completes.
+   *
+   * ```js
+   * const xSquared = await SourceMapConsumer.with(
+   *   myRawSourceMap,
+   *   null,
+   *   async function (consumer) {
+   *     // Use `consumer` inside here and don't worry about remembering
+   *     // to call `destroy`.
+   *
+   *     const x = await whatever(consumer);
+   *     return x * x;
+   *   }
+   * );
+   *
+   * // You may not use that `consumer` anymore out here; it has
+   * // been destroyed. But you can use `xSquared`.
+   * console.log(xSquared);
+   * ```
+   */
+  static with(rawSourceMap, sourceMapUrl, f) {
+    // Note: The `acorn` version that `webpack` currently depends on doesn't
+    // support `async` functions, and the nodes that we support don't all have
+    // `.finally`. Therefore, this is written a bit more convolutedly than it
+    // should really be.
+
+    let consumer = null;
+    const promise = new SourceMapConsumer(rawSourceMap, sourceMapUrl);
+    return promise
+      .then(c => {
+        consumer = c;
+        return f(c);
+      })
+      .then(x => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        return x;
+      }, e => {
+        if (consumer) {
+          consumer.destroy();
+        }
+        throw e;
+      });
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    throw new Error("Subclasses must implement _parseMappings");
+  }
+
+  /**
+   * Iterate over each mapping between an original source/line/column and a
+   * generated line/column in this source map.
+   *
+   * @param Function aCallback
+   *        The function that is called with each mapping.
+   * @param Object aContext
+   *        Optional. If specified, this object will be the value of `this` every
+   *        time that `aCallback` is called.
+   * @param aOrder
+   *        Either `SourceMapConsumer.GENERATED_ORDER` or
+   *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+   *        iterate over the mappings sorted by the generated file's line/column
+   *        order or the original's source/line/column order, respectively. Defaults to
+   *        `SourceMapConsumer.GENERATED_ORDER`.
+   */
+  eachMapping(aCallback, aContext, aOrder) {
+    throw new Error("Subclasses must implement eachMapping");
+  }
+
+  /**
+   * Returns all generated line and column information for the original source,
+   * line, and column provided. If no column is provided, returns all mappings
+   * corresponding to a either the line we are searching for or the next
+   * closest line that has any mappings. Otherwise, returns all mappings
+   * corresponding to the given line and either the column we are searching for
+   * or the next closest column that has any offsets.
+   *
+   * The only argument is an object with the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number is 1-based.
+   *   - column: Optional. the column number in the original source.
+   *    The column number is 0-based.
+   *
+   * and an array of objects is returned, each with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *    line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *    The column number is 0-based.
+   */
+  allGeneratedPositionsFor(aArgs) {
+    throw new Error("Subclasses must implement allGeneratedPositionsFor");
+  }
+
+  destroy() {
+    throw new Error("Subclasses must implement destroy");
+  }
+}
+
+/**
+ * The version of the source mapping spec that we are consuming.
+ */
+SourceMapConsumer.prototype._version = 3;
+SourceMapConsumer.GENERATED_ORDER = 1;
+SourceMapConsumer.ORIGINAL_ORDER = 2;
+
+SourceMapConsumer.GREATEST_LOWER_BOUND = 1;
+SourceMapConsumer.LEAST_UPPER_BOUND = 2;
+
+exports.SourceMapConsumer = SourceMapConsumer;
+
+/**
+ * A BasicSourceMapConsumer instance represents a parsed source map which we can
+ * query for information about the original file positions by giving it a file
+ * position in the generated source.
+ *
+ * The first parameter is the raw source map (either as a JSON string, or
+ * already parsed to an object). According to the spec, source maps have the
+ * following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - sources: An array of URLs to the original source files.
+ *   - names: An array of identifiers which can be referenced by individual mappings.
+ *   - sourceRoot: Optional. The URL root from which all sources are relative.
+ *   - sourcesContent: Optional. An array of contents of the original source files.
+ *   - mappings: A string of base64 VLQs which contain the actual mappings.
+ *   - file: Optional. The generated file this source map is associated with.
+ *
+ * Here is an example source map, taken from the source map spec[0]:
+ *
+ *     {
+ *       version : 3,
+ *       file: "out.js",
+ *       sourceRoot : "",
+ *       sources: ["foo.js", "bar.js"],
+ *       names: ["src", "maps", "are", "fun"],
+ *       mappings: "AA,AB;;ABCDE;"
+ *     }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#
+ */
+class BasicSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      let sources = util.getArg(sourceMap, "sources");
+      // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which
+      // requires the array) to play nice here.
+      const names = util.getArg(sourceMap, "names", []);
+      let sourceRoot = util.getArg(sourceMap, "sourceRoot", null);
+      const sourcesContent = util.getArg(sourceMap, "sourcesContent", null);
+      const mappings = util.getArg(sourceMap, "mappings");
+      const file = util.getArg(sourceMap, "file", null);
+
+      // Once again, Sass deviates from the spec and supplies the version as a
+      // string rather than a number, so we use loose equality checking here.
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      if (sourceRoot) {
+        sourceRoot = util.normalize(sourceRoot);
+      }
+
+      sources = sources
+        .map(String)
+        // Some source maps produce relative source paths like "./foo.js" instead of
+        // "foo.js".  Normalize these first so that future comparisons will succeed.
+        // See bugzil.la/1090768.
+        .map(util.normalize)
+        // Always ensure that absolute sources are internally stored relative to
+        // the source root, if the source root is absolute. Not doing this would
+        // be particularly problematic when the source root is a prefix of the
+        // source (valid, but why??). See github issue #199 and bugzil.la/1188982.
+        .map(function(source) {
+          return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)
+            ? util.relative(sourceRoot, source)
+            : source;
+        });
+
+      // Pass `true` below to allow duplicate names and sources. While source maps
+      // are intended to be compressed and deduplicated, the TypeScript compiler
+      // sometimes generates source maps with duplicates in them. See Github issue
+      // #72 and bugzil.la/889492.
+      that._names = ArraySet.fromArray(names.map(String), true);
+      that._sources = ArraySet.fromArray(sources, true);
+
+      that._absoluteSources = that._sources.toArray().map(function(s) {
+        return util.computeSourceURL(sourceRoot, s, aSourceMapURL);
+      });
+
+      that.sourceRoot = sourceRoot;
+      that.sourcesContent = sourcesContent;
+      that._mappings = mappings;
+      that._sourceMapURL = aSourceMapURL;
+      that.file = file;
+
+      that._computedColumnSpans = false;
+      that._mappingsPtr = 0;
+      that._wasm = null;
+
+      return wasm().then(w => {
+        that._wasm = w;
+        return that;
+      });
+    });
+  }
+
+  /**
+   * Utility function to find the index of a source.  Returns -1 if not
+   * found.
+   */
+  _findSourceIndex(aSource) {
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    if (this._sources.has(relativeSource)) {
+      return this._sources.indexOf(relativeSource);
+    }
+
+    // Maybe aSource is an absolute URL as returned by |sources|.  In
+    // this case we can't simply undo the transform.
+    for (let i = 0; i < this._absoluteSources.length; ++i) {
+      if (this._absoluteSources[i] == aSource) {
+        return i;
+      }
+    }
+
+    return -1;
+  }
+
+  /**
+   * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+   *
+   * @param SourceMapGenerator aSourceMap
+   *        The source map that will be consumed.
+   * @param String aSourceMapURL
+   *        The URL at which the source map can be found (optional)
+   * @returns BasicSourceMapConsumer
+   */
+  static fromSourceMap(aSourceMap, aSourceMapURL) {
+    return new BasicSourceMapConsumer(aSourceMap.toString());
+  }
+
+  get sources() {
+    return this._absoluteSources.slice();
+  }
+
+  _getMappingsPtr() {
+    if (this._mappingsPtr === 0) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this._mappingsPtr;
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const size = aStr.length;
+
+    const mappingsBufPtr = this._wasm.exports.allocate_mappings(size);
+    const mappingsBuf = new Uint8Array(this._wasm.exports.memory.buffer, mappingsBufPtr, size);
+    for (let i = 0; i < size; i++) {
+      mappingsBuf[i] = aStr.charCodeAt(i);
+    }
+
+    const mappingsPtr = this._wasm.exports.parse_mappings(mappingsBufPtr);
+
+    if (!mappingsPtr) {
+      const error = this._wasm.exports.get_last_error();
+      let msg = `Error parsing mappings (code ${error}): `;
+
+      // XXX: keep these error codes in sync with `fitzgen/source-map-mappings`.
+      switch (error) {
+        case 1:
+          msg += "the mappings contained a negative line, column, source index, or name index";
+          break;
+        case 2:
+          msg += "the mappings contained a number larger than 2**32";
+          break;
+        case 3:
+          msg += "reached EOF while in the middle of parsing a VLQ";
+          break;
+        case 4:
+          msg += "invalid base 64 character while parsing a VLQ";
+          break;
+        default:
+          msg += "unknown error code";
+          break;
+      }
+
+      throw new Error(msg);
+    }
+
+    this._mappingsPtr = mappingsPtr;
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+    const sourceRoot = this.sourceRoot;
+
+    this._wasm.withMappingCallback(
+      mapping => {
+        if (mapping.source !== null) {
+          mapping.source = this._sources.at(mapping.source);
+          mapping.source = util.computeSourceURL(sourceRoot, mapping.source, this._sourceMapURL);
+
+          if (mapping.name !== null) {
+            mapping.name = this._names.at(mapping.name);
+          }
+        }
+
+        aCallback.call(context, mapping);
+      },
+      () => {
+        switch (order) {
+        case SourceMapConsumer.GENERATED_ORDER:
+          this._wasm.exports.by_generated_location(this._getMappingsPtr());
+          break;
+        case SourceMapConsumer.ORIGINAL_ORDER:
+          this._wasm.exports.by_original_location(this._getMappingsPtr());
+          break;
+        default:
+          throw new Error("Unknown order of iteration.");
+        }
+      }
+    );
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    const originalLine = util.getArg(aArgs, "line");
+    const originalColumn = aArgs.column || 0;
+
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return [];
+    }
+
+    if (originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    this._wasm.withMappingCallback(
+      m => {
+        let lastColumn = m.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        mappings.push({
+          line: m.generatedLine,
+          column: m.generatedColumn,
+          lastColumn,
+        });
+      }, () => {
+        this._wasm.exports.all_generated_locations_for(
+          this._getMappingsPtr(),
+          source,
+          originalLine - 1,
+          "column" in aArgs,
+          originalColumn
+        );
+      }
+    );
+
+    return mappings;
+  }
+
+  destroy() {
+    if (this._mappingsPtr !== 0) {
+      this._wasm.exports.free_mappings(this._mappingsPtr);
+      this._mappingsPtr = 0;
+    }
+  }
+
+  /**
+   * Compute the last column for each generated mapping. The last column is
+   * inclusive.
+   */
+  computeColumnSpans() {
+    if (this._computedColumnSpans) {
+      return;
+    }
+
+    this._wasm.exports.compute_column_spans(this._getMappingsPtr());
+    this._computedColumnSpans = true;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.generatedLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.generatedColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.original_location_for(
+        this._getMappingsPtr(),
+        needle.generatedLine - 1,
+        needle.generatedColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.generatedLine === needle.generatedLine) {
+        let source = util.getArg(mapping, "source", null);
+        if (source !== null) {
+          source = this._sources.at(source);
+          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);
+        }
+
+        let name = util.getArg(mapping, "name", null);
+        if (name !== null) {
+          name = this._names.at(name);
+        }
+
+        return {
+          source,
+          line: util.getArg(mapping, "originalLine", null),
+          column: util.getArg(mapping, "originalColumn", null),
+          name
+        };
+      }
+    }
+
+    return {
+      source: null,
+      line: null,
+      column: null,
+      name: null
+    };
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    if (!this.sourcesContent) {
+      return false;
+    }
+    return this.sourcesContent.length >= this._sources.size() &&
+      !this.sourcesContent.some(function(sc) { return sc == null; });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    if (!this.sourcesContent) {
+      return null;
+    }
+
+    const index = this._findSourceIndex(aSource);
+    if (index >= 0) {
+      return this.sourcesContent[index];
+    }
+
+    let relativeSource = aSource;
+    if (this.sourceRoot != null) {
+      relativeSource = util.relative(this.sourceRoot, relativeSource);
+    }
+
+    let url;
+    if (this.sourceRoot != null
+        && (url = util.urlParse(this.sourceRoot))) {
+      // XXX: file:// URIs and absolute paths lead to unexpected behavior for
+      // many users. We can help them out when they expect file:// URIs to
+      // behave like it would if they were running a local HTTP server. See
+      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.
+      const fileUriAbsPath = relativeSource.replace(/^file:\/\//, "");
+      if (url.scheme == "file"
+          && this._sources.has(fileUriAbsPath)) {
+        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];
+      }
+
+      if ((!url.path || url.path == "/")
+          && this._sources.has("/" + relativeSource)) {
+        return this.sourcesContent[this._sources.indexOf("/" + relativeSource)];
+      }
+    }
+
+    // This function is used recursively from
+    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we
+    // don't want to throw if we can't find the source - we just want to
+    // return null, so we provide a flag to exit gracefully.
+    if (nullOnMissing) {
+      return null;
+    }
+
+    throw new Error('"' + relativeSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+   *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+   *     closest element that is smaller than or greater than the one we are
+   *     searching for, respectively, if the exact element cannot be found.
+   *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    let source = util.getArg(aArgs, "source");
+    source = this._findSourceIndex(source);
+    if (source < 0) {
+      return {
+        line: null,
+        column: null,
+        lastColumn: null
+      };
+    }
+
+    const needle = {
+      source,
+      originalLine: util.getArg(aArgs, "line"),
+      originalColumn: util.getArg(aArgs, "column")
+    };
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    let bias = util.getArg(aArgs, "bias", SourceMapConsumer.GREATEST_LOWER_BOUND);
+    if (bias == null) {
+      bias = SourceMapConsumer.GREATEST_LOWER_BOUND;
+    }
+
+    let mapping;
+    this._wasm.withMappingCallback(m => mapping = m, () => {
+      this._wasm.exports.generated_location_for(
+        this._getMappingsPtr(),
+        needle.source,
+        needle.originalLine - 1,
+        needle.originalColumn,
+        bias
+      );
+    });
+
+    if (mapping) {
+      if (mapping.source === needle.source) {
+        let lastColumn = mapping.lastGeneratedColumn;
+        if (this._computedColumnSpans && lastColumn === null) {
+          lastColumn = Infinity;
+        }
+        return {
+          line: util.getArg(mapping, "generatedLine", null),
+          column: util.getArg(mapping, "generatedColumn", null),
+          lastColumn,
+        };
+      }
+    }
+
+    return {
+      line: null,
+      column: null,
+      lastColumn: null
+    };
+  }
+}
+
+BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;
+exports.BasicSourceMapConsumer = BasicSourceMapConsumer;
+
+/**
+ * An IndexedSourceMapConsumer instance represents a parsed source map which
+ * we can query for information. It differs from BasicSourceMapConsumer in
+ * that it takes "indexed" source maps (i.e. ones with a "sections" field) as
+ * input.
+ *
+ * The first parameter is a raw source map (either as a JSON string, or already
+ * parsed to an object). According to the spec for indexed source maps, they
+ * have the following attributes:
+ *
+ *   - version: Which version of the source map spec this map is following.
+ *   - file: Optional. The generated file this source map is associated with.
+ *   - sections: A list of section definitions.
+ *
+ * Each value under the "sections" field has two fields:
+ *   - offset: The offset into the original specified at which this section
+ *       begins to apply, defined as an object with a "line" and "column"
+ *       field.
+ *   - map: A source map definition. This source map could also be indexed,
+ *       but doesn't have to be.
+ *
+ * Instead of the "map" field, it's also possible to have a "url" field
+ * specifying a URL to retrieve a source map from, but that's currently
+ * unsupported.
+ *
+ * Here's an example source map, taken from the source map spec[0], but
+ * modified to omit a section which uses the "url" field.
+ *
+ *  {
+ *    version : 3,
+ *    file: "app.js",
+ *    sections: [{
+ *      offset: {line:100, column:10},
+ *      map: {
+ *        version : 3,
+ *        file: "section.js",
+ *        sources: ["foo.js", "bar.js"],
+ *        names: ["src", "maps", "are", "fun"],
+ *        mappings: "AAAA,E;;ABCDE;"
+ *      }
+ *    }],
+ *  }
+ *
+ * The second parameter, if given, is a string whose value is the URL
+ * at which the source map was found.  This URL is used to compute the
+ * sources array.
+ *
+ * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt
+ */
+class IndexedSourceMapConsumer extends SourceMapConsumer {
+  constructor(aSourceMap, aSourceMapURL) {
+    return super(INTERNAL).then(that => {
+      let sourceMap = aSourceMap;
+      if (typeof aSourceMap === "string") {
+        sourceMap = util.parseSourceMapInput(aSourceMap);
+      }
+
+      const version = util.getArg(sourceMap, "version");
+      const sections = util.getArg(sourceMap, "sections");
+
+      if (version != that._version) {
+        throw new Error("Unsupported version: " + version);
+      }
+
+      that._sources = new ArraySet();
+      that._names = new ArraySet();
+      that.__generatedMappings = null;
+      that.__originalMappings = null;
+      that.__generatedMappingsUnsorted = null;
+      that.__originalMappingsUnsorted = null;
+
+      let lastOffset = {
+        line: -1,
+        column: 0
+      };
+      return Promise.all(sections.map(s => {
+        if (s.url) {
+          // The url field will require support for asynchronicity.
+          // See https://github.com/mozilla/source-map/issues/16
+          throw new Error("Support for url field in sections not implemented.");
+        }
+        const offset = util.getArg(s, "offset");
+        const offsetLine = util.getArg(offset, "line");
+        const offsetColumn = util.getArg(offset, "column");
+
+        if (offsetLine < lastOffset.line ||
+            (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {
+          throw new Error("Section offsets must be ordered and non-overlapping.");
+        }
+        lastOffset = offset;
+
+        const cons = new SourceMapConsumer(util.getArg(s, "map"), aSourceMapURL);
+        return cons.then(consumer => {
+          return {
+            generatedOffset: {
+              // The offset fields are 0-based, but we use 1-based indices when
+              // encoding/decoding from VLQ.
+              generatedLine: offsetLine + 1,
+              generatedColumn: offsetColumn + 1
+            },
+            consumer
+          };
+        });
+      })).then(s => {
+        that._sections = s;
+        return that;
+      });
+    });
+  }
+
+  // `__generatedMappings` and `__originalMappings` are arrays that hold the
+  // parsed mapping coordinates from the source map's "mappings" attribute. They
+  // are lazily instantiated, accessed via the `_generatedMappings` and
+  // `_originalMappings` getters respectively, and we only parse the mappings
+  // and create these arrays once queried for a source location. We jump through
+  // these hoops because there can be many thousands of mappings, and parsing
+  // them is expensive, so we only want to do it if we must.
+  //
+  // Each object in the arrays is of the form:
+  //
+  //     {
+  //       generatedLine: The line number in the generated code,
+  //       generatedColumn: The column number in the generated code,
+  //       source: The path to the original source file that generated this
+  //               chunk of code,
+  //       originalLine: The line number in the original source that
+  //                     corresponds to this chunk of generated code,
+  //       originalColumn: The column number in the original source that
+  //                       corresponds to this chunk of generated code,
+  //       name: The name of the original symbol which generated this chunk of
+  //             code.
+  //     }
+  //
+  // All properties except for `generatedLine` and `generatedColumn` can be
+  // `null`.
+  //
+  // `_generatedMappings` is ordered by the generated positions.
+  //
+  // `_originalMappings` is ordered by the original positions.
+  get _generatedMappings() {
+    if (!this.__generatedMappings) {
+      this._sortGeneratedMappings();
+    }
+
+    return this.__generatedMappings;
+  }
+
+  get _originalMappings() {
+    if (!this.__originalMappings) {
+      this._sortOriginalMappings();
+    }
+
+    return this.__originalMappings;
+  }
+
+  get _generatedMappingsUnsorted() {
+    if (!this.__generatedMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__generatedMappingsUnsorted;
+  }
+
+  get _originalMappingsUnsorted() {
+    if (!this.__originalMappingsUnsorted) {
+      this._parseMappings(this._mappings, this.sourceRoot);
+    }
+
+    return this.__originalMappingsUnsorted;
+  }
+
+  _sortGeneratedMappings() {
+    const mappings = this._generatedMappingsUnsorted;
+    mappings.sort(util.compareByGeneratedPositionsDeflated);
+    this.__generatedMappings = mappings;
+  }
+
+  _sortOriginalMappings() {
+    const mappings = this._originalMappingsUnsorted;
+    mappings.sort(util.compareByOriginalPositions);
+    this.__originalMappings = mappings;
+  }
+
+  /**
+   * The list of original sources.
+   */
+  get sources() {
+    const sources = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      for (let j = 0; j < this._sections[i].consumer.sources.length; j++) {
+        sources.push(this._sections[i].consumer.sources[j]);
+      }
+    }
+    return sources;
+  }
+
+  /**
+   * Returns the original source, line, and column information for the generated
+   * source's line and column positions provided. The only argument is an object
+   * with the following properties:
+   *
+   *   - line: The line number in the generated source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the generated source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - source: The original source file, or null.
+   *   - line: The line number in the original source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the original source, or null.  The
+   *     column number is 0-based.
+   *   - name: The original identifier, or null.
+   */
+  originalPositionFor(aArgs) {
+    const needle = {
+      generatedLine: util.getArg(aArgs, "line"),
+      generatedColumn: util.getArg(aArgs, "column")
+    };
+
+    // Find the section containing the generated position we're trying to map
+    // to an original position.
+    const sectionIndex = binarySearch.search(needle, this._sections,
+      function(aNeedle, section) {
+        const cmp = aNeedle.generatedLine - section.generatedOffset.generatedLine;
+        if (cmp) {
+          return cmp;
+        }
+
+        return (aNeedle.generatedColumn -
+                section.generatedOffset.generatedColumn);
+      });
+    const section = this._sections[sectionIndex];
+
+    if (!section) {
+      return {
+        source: null,
+        line: null,
+        column: null,
+        name: null
+      };
+    }
+
+    return section.consumer.originalPositionFor({
+      line: needle.generatedLine -
+        (section.generatedOffset.generatedLine - 1),
+      column: needle.generatedColumn -
+        (section.generatedOffset.generatedLine === needle.generatedLine
+         ? section.generatedOffset.generatedColumn - 1
+         : 0),
+      bias: aArgs.bias
+    });
+  }
+
+  /**
+   * Return true if we have the source content for every source in the source
+   * map, false otherwise.
+   */
+  hasContentsOfAllSources() {
+    return this._sections.every(function(s) {
+      return s.consumer.hasContentsOfAllSources();
+    });
+  }
+
+  /**
+   * Returns the original source content. The only argument is the url of the
+   * original source file. Returns null if no original source content is
+   * available.
+   */
+  sourceContentFor(aSource, nullOnMissing) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const content = section.consumer.sourceContentFor(aSource, true);
+      if (content) {
+        return content;
+      }
+    }
+    if (nullOnMissing) {
+      return null;
+    }
+    throw new Error('"' + aSource + '" is not in the SourceMap.');
+  }
+
+  /**
+   * Returns the generated line and column information for the original source,
+   * line, and column positions provided. The only argument is an object with
+   * the following properties:
+   *
+   *   - source: The filename of the original source.
+   *   - line: The line number in the original source.  The line number
+   *     is 1-based.
+   *   - column: The column number in the original source.  The column
+   *     number is 0-based.
+   *
+   * and an object is returned with the following properties:
+   *
+   *   - line: The line number in the generated source, or null.  The
+   *     line number is 1-based.
+   *   - column: The column number in the generated source, or null.
+   *     The column number is 0-based.
+   */
+  generatedPositionFor(aArgs) {
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      // Only consider this section if the requested source is in the list of
+      // sources of the consumer.
+      if (section.consumer._findSourceIndex(util.getArg(aArgs, "source")) === -1) {
+        continue;
+      }
+      const generatedPosition = section.consumer.generatedPositionFor(aArgs);
+      if (generatedPosition) {
+        const ret = {
+          line: generatedPosition.line +
+            (section.generatedOffset.generatedLine - 1),
+          column: generatedPosition.column +
+            (section.generatedOffset.generatedLine === generatedPosition.line
+             ? section.generatedOffset.generatedColumn - 1
+             : 0)
+        };
+        return ret;
+      }
+    }
+
+    return {
+      line: null,
+      column: null
+    };
+  }
+
+  /**
+   * Parse the mappings in a string in to a data structure which we can easily
+   * query (the ordered arrays in the `this.__generatedMappings` and
+   * `this.__originalMappings` properties).
+   */
+  _parseMappings(aStr, aSourceRoot) {
+    const generatedMappings = this.__generatedMappingsUnsorted = [];
+    const originalMappings = this.__originalMappingsUnsorted = [];
+    for (let i = 0; i < this._sections.length; i++) {
+      const section = this._sections[i];
+
+      const sectionMappings = [];
+      section.consumer.eachMapping(m => sectionMappings.push(m));
+
+      for (let j = 0; j < sectionMappings.length; j++) {
+        const mapping = sectionMappings[j];
+
+        // TODO: test if null is correct here.  The original code used
+        // `source`, which would actually have gotten used as null because
+        // var's get hoisted.
+        // See: https://github.com/mozilla/source-map/issues/333
+        let source = util.computeSourceURL(section.consumer.sourceRoot, null, this._sourceMapURL);
+        this._sources.add(source);
+        source = this._sources.indexOf(source);
+
+        let name = null;
+        if (mapping.name) {
+          this._names.add(mapping.name);
+          name = this._names.indexOf(mapping.name);
+        }
+
+        // The mappings coming from the consumer for the section have
+        // generated positions relative to the start of the section, so we
+        // need to offset them to be relative to the start of the concatenated
+        // generated file.
+        const adjustedMapping = {
+          source,
+          generatedLine: mapping.generatedLine +
+            (section.generatedOffset.generatedLine - 1),
+          generatedColumn: mapping.generatedColumn +
+            (section.generatedOffset.generatedLine === mapping.generatedLine
+            ? section.generatedOffset.generatedColumn - 1
+            : 0),
+          originalLine: mapping.originalLine,
+          originalColumn: mapping.originalColumn,
+          name
+        };
+
+        generatedMappings.push(adjustedMapping);
+        if (typeof adjustedMapping.originalLine === "number") {
+          originalMappings.push(adjustedMapping);
+        }
+      }
+    }
+  }
+
+  eachMapping(aCallback, aContext, aOrder) {
+    const context = aContext || null;
+    const order = aOrder || SourceMapConsumer.GENERATED_ORDER;
+
+    let mappings;
+    switch (order) {
+    case SourceMapConsumer.GENERATED_ORDER:
+      mappings = this._generatedMappings;
+      break;
+    case SourceMapConsumer.ORIGINAL_ORDER:
+      mappings = this._originalMappings;
+      break;
+    default:
+      throw new Error("Unknown order of iteration.");
+    }
+
+    const sourceRoot = this.sourceRoot;
+    mappings.map(function(mapping) {
+      let source = null;
+      if (mapping.source !== null) {
+        source = this._sources.at(mapping.source);
+        source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);
+      }
+      return {
+        source,
+        generatedLine: mapping.generatedLine,
+        generatedColumn: mapping.generatedColumn,
+        originalLine: mapping.originalLine,
+        originalColumn: mapping.originalColumn,
+        name: mapping.name === null ? null : this._names.at(mapping.name)
+      };
+    }, this).forEach(aCallback, context);
+  }
+
+  /**
+   * Find the mapping that best matches the hypothetical "needle" mapping that
+   * we are searching for in the given "haystack" of mappings.
+   */
+  _findMapping(aNeedle, aMappings, aLineName,
+              aColumnName, aComparator, aBias) {
+    // To return the position we are searching for, we must first find the
+    // mapping for the given position and then return the opposite position it
+    // points to. Because the mappings are sorted, we can use binary search to
+    // find the best mapping.
+
+    if (aNeedle[aLineName] <= 0) {
+      throw new TypeError("Line must be greater than or equal to 1, got "
+                          + aNeedle[aLineName]);
+    }
+    if (aNeedle[aColumnName] < 0) {
+      throw new TypeError("Column must be greater than or equal to 0, got "
+                          + aNeedle[aColumnName]);
+    }
+
+    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);
+  }
+
+  allGeneratedPositionsFor(aArgs) {
+    const line = util.getArg(aArgs, "line");
+
+    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping
+    // returns the index of the closest mapping less than the needle. By
+    // setting needle.originalColumn to 0, we thus find the last mapping for
+    // the given line, provided such a mapping exists.
+    const needle = {
+      source: util.getArg(aArgs, "source"),
+      originalLine: line,
+      originalColumn: util.getArg(aArgs, "column", 0)
+    };
+
+    needle.source = this._findSourceIndex(needle.source);
+    if (needle.source < 0) {
+      return [];
+    }
+
+    if (needle.originalLine < 1) {
+      throw new Error("Line numbers must be >= 1");
+    }
+
+    if (needle.originalColumn < 0) {
+      throw new Error("Column numbers must be >= 0");
+    }
+
+    const mappings = [];
+
+    let index = this._findMapping(needle,
+                                  this._originalMappings,
+                                  "originalLine",
+                                  "originalColumn",
+                                  util.compareByOriginalPositions,
+                                  binarySearch.LEAST_UPPER_BOUND);
+    if (index >= 0) {
+      let mapping = this._originalMappings[index];
+
+      if (aArgs.column === undefined) {
+        const originalLine = mapping.originalLine;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we found. Since
+        // mappings are sorted, this is guaranteed to find all mappings for
+        // the line we found.
+        while (mapping && mapping.originalLine === originalLine) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      } else {
+        const originalColumn = mapping.originalColumn;
+
+        // Iterate until either we run out of mappings, or we run into
+        // a mapping for a different line than the one we were searching for.
+        // Since mappings are sorted, this is guaranteed to find all mappings for
+        // the line we are searching for.
+        while (mapping &&
+               mapping.originalLine === line &&
+               mapping.originalColumn == originalColumn) {
+          let lastColumn = mapping.lastGeneratedColumn;
+          if (this._computedColumnSpans && lastColumn === null) {
+            lastColumn = Infinity;
+          }
+          mappings.push({
+            line: util.getArg(mapping, "generatedLine", null),
+            column: util.getArg(mapping, "generatedColumn", null),
+            lastColumn,
+          });
+
+          mapping = this._originalMappings[++index];
+        }
+      }
+    }
+
+    return mappings;
+  }
+
+  destroy() {
+    for (let i = 0; i < this._sections.length; i++) {
+      this._sections[i].consumer.destroy();
+    }
+  }
+}
+exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;
+
+/*
+ * Cheat to get around inter-twingled classes.  `factory()` can be at the end
+ * where it has access to non-hoisted classes, but it gets hoisted itself.
+ */
+function _factory(aSourceMap, aSourceMapURL) {
+  let sourceMap = aSourceMap;
+  if (typeof aSourceMap === "string") {
+    sourceMap = util.parseSourceMapInput(aSourceMap);
+  }
+
+  const consumer = sourceMap.sections != null
+      ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)
+      : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);
+  return Promise.resolve(consumer);
+}
+
+function _factoryBSM(aSourceMap, aSourceMapURL) {
+  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);
+}
diff --git a/node_modules/source-map/lib/source-map-generator.js b/node_modules/source-map/lib/source-map-generator.js
new file mode 100644
index 0000000..8111e06
--- /dev/null
+++ b/node_modules/source-map/lib/source-map-generator.js
@@ -0,0 +1,413 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const base64VLQ = require("./base64-vlq");
+const util = require("./util");
+const ArraySet = require("./array-set").ArraySet;
+const MappingList = require("./mapping-list").MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+class SourceMapGenerator {
+  constructor(aArgs) {
+    if (!aArgs) {
+      aArgs = {};
+    }
+    this._file = util.getArg(aArgs, "file", null);
+    this._sourceRoot = util.getArg(aArgs, "sourceRoot", null);
+    this._skipValidation = util.getArg(aArgs, "skipValidation", false);
+    this._sources = new ArraySet();
+    this._names = new ArraySet();
+    this._mappings = new MappingList();
+    this._sourcesContents = null;
+  }
+
+  /**
+   * Creates a new SourceMapGenerator based on a SourceMapConsumer
+   *
+   * @param aSourceMapConsumer The SourceMap.
+   */
+  static fromSourceMap(aSourceMapConsumer) {
+    const sourceRoot = aSourceMapConsumer.sourceRoot;
+    const generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      const newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      let sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  }
+
+  /**
+   * Add a single mapping from original source line and column to the generated
+   * source's line and column for this source map being created. The mapping
+   * object should have the following properties:
+   *
+   *   - generated: An object with the generated line and column positions.
+   *   - original: An object with the original line and column positions.
+   *   - source: The original source file (relative to the sourceRoot).
+   *   - name: An optional original token name for this mapping.
+   */
+  addMapping(aArgs) {
+    const generated = util.getArg(aArgs, "generated");
+    const original = util.getArg(aArgs, "original", null);
+    let source = util.getArg(aArgs, "source", null);
+    let name = util.getArg(aArgs, "name", null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source,
+      name
+    });
+  }
+
+  /**
+   * Set the source content for a source file.
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    let source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  }
+
+  /**
+   * Applies the mappings of a sub-source-map for a specific source file to the
+   * source map being generated. Each mapping to the supplied source file is
+   * rewritten using the supplied source map. Note: The resolution for the
+   * resulting mappings is the minimium of this map and the supplied map.
+   *
+   * @param aSourceMapConsumer The source map to be applied.
+   * @param aSourceFile Optional. The filename of the source file.
+   *        If omitted, SourceMapConsumer's file property will be used.
+   * @param aSourceMapPath Optional. The dirname of the path to the source map
+   *        to be applied. If relative, it is relative to the SourceMapConsumer.
+   *        This parameter is needed when the two source maps aren't in the same
+   *        directory, and the source map to be applied contains relative source
+   *        paths. If so, those relative source paths need to be rewritten
+   *        relative to the SourceMapGenerator.
+   */
+  applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    let sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          "SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, " +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    const sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    const newSources = this._mappings.toArray().length > 0
+      ? new ArraySet()
+      : this._sources;
+    const newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function(mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        const original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source);
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      const source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      const name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function(srcFile) {
+      const content = aSourceMapConsumer.sourceContentFor(srcFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          srcFile = util.join(aSourceMapPath, srcFile);
+        }
+        if (sourceRoot != null) {
+          srcFile = util.relative(sourceRoot, srcFile);
+        }
+        this.setSourceContent(srcFile, content);
+      }
+    }, this);
+  }
+
+  /**
+   * A mapping can have one of the three levels of data:
+   *
+   *   1. Just the generated position.
+   *   2. The Generated position, original position, and original source.
+   *   3. Generated and original position, original source, as well as a name
+   *      token.
+   *
+   * To maintain consistency, we validate that any new mapping being added falls
+   * in to one of these categories.
+   */
+  _validateMapping(aGenerated, aOriginal, aSource, aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== "number" && typeof aOriginal.column !== "number") {
+        throw new Error(
+            "original.line and original.column are not numbers -- you probably meant to omit " +
+            "the original mapping entirely and only map the generated position. If so, pass " +
+            "null for the original mapping instead of an object with empty or null values."
+        );
+    }
+
+    if (aGenerated && "line" in aGenerated && "column" in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+
+    } else if (aGenerated && "line" in aGenerated && "column" in aGenerated
+             && aOriginal && "line" in aOriginal && "column" in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+
+    } else {
+      throw new Error("Invalid mapping: " + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  }
+
+  /**
+   * Serialize the accumulated mappings in to the stream of base 64 VLQs
+   * specified by the source map format.
+   */
+  _serializeMappings() {
+    let previousGeneratedColumn = 0;
+    let previousGeneratedLine = 1;
+    let previousOriginalColumn = 0;
+    let previousOriginalLine = 0;
+    let previousName = 0;
+    let previousSource = 0;
+    let result = "";
+    let next;
+    let mapping;
+    let nameIdx;
+    let sourceIdx;
+
+    const mappings = this._mappings.toArray();
+    for (let i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = "";
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ";";
+          previousGeneratedLine++;
+        }
+      } else if (i > 0) {
+        if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+          continue;
+        }
+        next += ",";
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  }
+
+  _generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function(source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      const key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  }
+
+  /**
+   * Externalize the source map.
+   */
+  toJSON() {
+    const map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  }
+
+  /**
+   * Render the source map being generated to a string.
+   */
+  toString() {
+    return JSON.stringify(this.toJSON());
+  }
+}
+
+SourceMapGenerator.prototype._version = 3;
+exports.SourceMapGenerator = SourceMapGenerator;
diff --git a/node_modules/source-map/lib/source-node.js b/node_modules/source-map/lib/source-node.js
new file mode 100644
index 0000000..8a7a157
--- /dev/null
+++ b/node_modules/source-map/lib/source-node.js
@@ -0,0 +1,404 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+const SourceMapGenerator = require("./source-map-generator").SourceMapGenerator;
+const util = require("./util");
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+const REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+const NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+const isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+class SourceNode {
+  constructor(aLine, aColumn, aSource, aChunks, aName) {
+    this.children = [];
+    this.sourceContents = {};
+    this.line = aLine == null ? null : aLine;
+    this.column = aColumn == null ? null : aColumn;
+    this.source = aSource == null ? null : aSource;
+    this.name = aName == null ? null : aName;
+    this[isSourceNode] = true;
+    if (aChunks != null) this.add(aChunks);
+  }
+
+  /**
+   * Creates a SourceNode from generated code and a SourceMapConsumer.
+   *
+   * @param aGeneratedCode The generated code
+   * @param aSourceMapConsumer The SourceMap for the generated code
+   * @param aRelativePath Optional. The path that relative sources in the
+   *        SourceMapConsumer should be relative to.
+   */
+  static fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    const node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    const remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    let remainingLinesIndex = 0;
+    const shiftNextLine = function() {
+      const lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      const newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    let lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    let lastMapping = null;
+    let nextLine;
+
+    aSourceMapConsumer.eachMapping(function(mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          nextLine = remainingLines[remainingLinesIndex] || "";
+          const code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        nextLine = remainingLines[remainingLinesIndex] || "";
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function(sourceFile) {
+      const content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        const source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  }
+
+  /**
+   * Add a chunk of generated JS to this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  add(aChunk) {
+    if (Array.isArray(aChunk)) {
+      aChunk.forEach(function(chunk) {
+        this.add(chunk);
+      }, this);
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      if (aChunk) {
+        this.children.push(aChunk);
+      }
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Add a chunk of generated JS to the beginning of this source node.
+   *
+   * @param aChunk A string snippet of generated JS code, another instance of
+   *        SourceNode, or an array where each member is one of those things.
+   */
+  prepend(aChunk) {
+    if (Array.isArray(aChunk)) {
+      for (let i = aChunk.length - 1; i >= 0; i--) {
+        this.prepend(aChunk[i]);
+      }
+    } else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+      this.children.unshift(aChunk);
+    } else {
+      throw new TypeError(
+        "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+      );
+    }
+    return this;
+  }
+
+  /**
+   * Walk over the tree of JS snippets in this node and its children. The
+   * walking function is called once for each snippet of JS and is passed that
+   * snippet and the its original associated source's line/column location.
+   *
+   * @param aFn The traversal function.
+   */
+  walk(aFn) {
+    let chunk;
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      chunk = this.children[i];
+      if (chunk[isSourceNode]) {
+        chunk.walk(aFn);
+      } else if (chunk !== "") {
+        aFn(chunk, { source: this.source,
+                      line: this.line,
+                      column: this.column,
+                      name: this.name });
+      }
+    }
+  }
+
+  /**
+   * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+   * each of `this.children`.
+   *
+   * @param aSep The separator.
+   */
+  join(aSep) {
+    let newChildren;
+    let i;
+    const len = this.children.length;
+    if (len > 0) {
+      newChildren = [];
+      for (i = 0; i < len - 1; i++) {
+        newChildren.push(this.children[i]);
+        newChildren.push(aSep);
+      }
+      newChildren.push(this.children[i]);
+      this.children = newChildren;
+    }
+    return this;
+  }
+
+  /**
+   * Call String.prototype.replace on the very right-most source snippet. Useful
+   * for trimming whitespace from the end of a source node, etc.
+   *
+   * @param aPattern The pattern to replace.
+   * @param aReplacement The thing to replace the pattern with.
+   */
+  replaceRight(aPattern, aReplacement) {
+    const lastChild = this.children[this.children.length - 1];
+    if (lastChild[isSourceNode]) {
+      lastChild.replaceRight(aPattern, aReplacement);
+    } else if (typeof lastChild === "string") {
+      this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+    } else {
+      this.children.push("".replace(aPattern, aReplacement));
+    }
+    return this;
+  }
+
+  /**
+   * Set the source content for a source file. This will be added to the SourceMapGenerator
+   * in the sourcesContent field.
+   *
+   * @param aSourceFile The filename of the source file
+   * @param aSourceContent The content of the source file
+   */
+  setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  }
+
+  /**
+   * Walk over the tree of SourceNodes. The walking function is called for each
+   * source file content and is passed the filename and source content.
+   *
+   * @param aFn The traversal function.
+   */
+  walkSourceContents(aFn) {
+    for (let i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    const sources = Object.keys(this.sourceContents);
+    for (let i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  }
+
+  /**
+   * Return the string representation of this source node. Walks over the tree
+   * and concatenates all the various snippets together to one string.
+   */
+  toString() {
+    let str = "";
+    this.walk(function(chunk) {
+      str += chunk;
+    });
+    return str;
+  }
+
+  /**
+   * Returns the string representation of this source node along with a source
+   * map.
+   */
+  toStringWithSourceMap(aArgs) {
+    const generated = {
+      code: "",
+      line: 1,
+      column: 0
+    };
+    const map = new SourceMapGenerator(aArgs);
+    let sourceMappingActive = false;
+    let lastOriginalSource = null;
+    let lastOriginalLine = null;
+    let lastOriginalColumn = null;
+    let lastOriginalName = null;
+    this.walk(function(chunk, original) {
+      generated.code += chunk;
+      if (original.source !== null
+          && original.line !== null
+          && original.column !== null) {
+        if (lastOriginalSource !== original.source
+          || lastOriginalLine !== original.line
+          || lastOriginalColumn !== original.column
+          || lastOriginalName !== original.name) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+        lastOriginalSource = original.source;
+        lastOriginalLine = original.line;
+        lastOriginalColumn = original.column;
+        lastOriginalName = original.name;
+        sourceMappingActive = true;
+      } else if (sourceMappingActive) {
+        map.addMapping({
+          generated: {
+            line: generated.line,
+            column: generated.column
+          }
+        });
+        lastOriginalSource = null;
+        sourceMappingActive = false;
+      }
+      for (let idx = 0, length = chunk.length; idx < length; idx++) {
+        if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+          generated.line++;
+          generated.column = 0;
+          // Mappings end at eol
+          if (idx + 1 === length) {
+            lastOriginalSource = null;
+            sourceMappingActive = false;
+          } else if (sourceMappingActive) {
+            map.addMapping({
+              source: original.source,
+              original: {
+                line: original.line,
+                column: original.column
+              },
+              generated: {
+                line: generated.line,
+                column: generated.column
+              },
+              name: original.name
+            });
+          }
+        } else {
+          generated.column++;
+        }
+      }
+    });
+    this.walkSourceContents(function(sourceFile, sourceContent) {
+      map.setSourceContent(sourceFile, sourceContent);
+    });
+
+    return { code: generated.code, map };
+  }
+}
+
+exports.SourceNode = SourceNode;
diff --git a/node_modules/source-map/lib/util.js b/node_modules/source-map/lib/util.js
new file mode 100644
index 0000000..35bd93d
--- /dev/null
+++ b/node_modules/source-map/lib/util.js
@@ -0,0 +1,546 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  }
+    throw new Error('"' + aName + '" is a required argument.');
+
+}
+exports.getArg = getArg;
+
+const urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+const dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  const match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  let url = "";
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ":";
+  }
+  url += "//";
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + "@";
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port;
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+const MAX_CACHED_INPUTS = 32;
+
+/**
+ * Takes some function `f(input) -> result` and returns a memoized version of
+ * `f`.
+ *
+ * We keep at most `MAX_CACHED_INPUTS` memoized results of `f` alive. The
+ * memoization is a dumb-simple, linear least-recently-used cache.
+ */
+function lruMemoize(f) {
+  const cache = [];
+
+  return function(input) {
+    for (let i = 0; i < cache.length; i++) {
+      if (cache[i].input === input) {
+        const temp = cache[0];
+        cache[0] = cache[i];
+        cache[i] = temp;
+        return cache[0].result;
+      }
+    }
+
+    const result = f(input);
+
+    cache.unshift({
+      input,
+      result,
+    });
+
+    if (cache.length > MAX_CACHED_INPUTS) {
+      cache.pop();
+    }
+
+    return result;
+  };
+}
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+const normalize = lruMemoize(function normalize(aPath) {
+  let path = aPath;
+  const url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  const isAbsolute = exports.isAbsolute(path);
+
+  // Split the path into parts between `/` characters. This is much faster than
+  // using `.split(/\/+/g)`.
+  const parts = [];
+  let start = 0;
+  let i = 0;
+  while (true) {
+    start = i;
+    i = path.indexOf("/", start);
+    if (i === -1) {
+      parts.push(path.slice(start));
+      break;
+    } else {
+      parts.push(path.slice(start, i));
+      while (i < path.length && path[i] === "/") {
+        i++;
+      }
+    }
+  }
+
+  let up = 0;
+  for (i = parts.length - 1; i >= 0; i--) {
+    const part = parts[i];
+    if (part === ".") {
+      parts.splice(i, 1);
+    } else if (part === "..") {
+      up++;
+    } else if (up > 0) {
+      if (part === "") {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join("/");
+
+  if (path === "") {
+    path = isAbsolute ? "/" : ".";
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+});
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  const aPathUrl = urlParse(aPath);
+  const aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || "/";
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  const joined = aPath.charAt(0) === "/"
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, "") + "/" + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function(aPath) {
+  return aPath.charAt(0) === "/" || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, "");
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  let level = 0;
+  while (aPath.indexOf(aRoot + "/") !== 0) {
+    const index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+const supportsNullProto = (function() {
+  const obj = Object.create(null);
+  return !("__proto__" in obj);
+}());
+
+function identity(s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return "$" + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  const length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  /* eslint-disable no-multi-spaces */
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+  /* eslint-enable no-multi-spaces */
+
+  for (let i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  let cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  let cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ""));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || "";
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== "/" && sourceURL[0] !== "/") {
+      sourceRoot += "/";
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    const parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      const index = parsed.path.lastIndexOf("/");
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;
diff --git a/node_modules/source-map/lib/wasm.js b/node_modules/source-map/lib/wasm.js
new file mode 100644
index 0000000..88b18be
--- /dev/null
+++ b/node_modules/source-map/lib/wasm.js
@@ -0,0 +1,107 @@
+const readWasm = require("../lib/read-wasm");
+
+/**
+ * Provide the JIT with a nice shape / hidden class.
+ */
+function Mapping() {
+  this.generatedLine = 0;
+  this.generatedColumn = 0;
+  this.lastGeneratedColumn = null;
+  this.source = null;
+  this.originalLine = null;
+  this.originalColumn = null;
+  this.name = null;
+}
+
+let cachedWasm = null;
+
+module.exports = function wasm() {
+  if (cachedWasm) {
+    return cachedWasm;
+  }
+
+  const callbackStack = [];
+
+  cachedWasm = readWasm().then(buffer => {
+      return WebAssembly.instantiate(buffer, {
+        env: {
+          mapping_callback(
+            generatedLine,
+            generatedColumn,
+
+            hasLastGeneratedColumn,
+            lastGeneratedColumn,
+
+            hasOriginal,
+            source,
+            originalLine,
+            originalColumn,
+
+            hasName,
+            name
+          ) {
+            const mapping = new Mapping();
+            // JS uses 1-based line numbers, wasm uses 0-based.
+            mapping.generatedLine = generatedLine + 1;
+            mapping.generatedColumn = generatedColumn;
+
+            if (hasLastGeneratedColumn) {
+              // JS uses inclusive last generated column, wasm uses exclusive.
+              mapping.lastGeneratedColumn = lastGeneratedColumn - 1;
+            }
+
+            if (hasOriginal) {
+              mapping.source = source;
+              // JS uses 1-based line numbers, wasm uses 0-based.
+              mapping.originalLine = originalLine + 1;
+              mapping.originalColumn = originalColumn;
+
+              if (hasName) {
+                mapping.name = name;
+              }
+            }
+
+            callbackStack[callbackStack.length - 1](mapping);
+          },
+
+          start_all_generated_locations_for() { console.time("all_generated_locations_for"); },
+          end_all_generated_locations_for() { console.timeEnd("all_generated_locations_for"); },
+
+          start_compute_column_spans() { console.time("compute_column_spans"); },
+          end_compute_column_spans() { console.timeEnd("compute_column_spans"); },
+
+          start_generated_location_for() { console.time("generated_location_for"); },
+          end_generated_location_for() { console.timeEnd("generated_location_for"); },
+
+          start_original_location_for() { console.time("original_location_for"); },
+          end_original_location_for() { console.timeEnd("original_location_for"); },
+
+          start_parse_mappings() { console.time("parse_mappings"); },
+          end_parse_mappings() { console.timeEnd("parse_mappings"); },
+
+          start_sort_by_generated_location() { console.time("sort_by_generated_location"); },
+          end_sort_by_generated_location() { console.timeEnd("sort_by_generated_location"); },
+
+          start_sort_by_original_location() { console.time("sort_by_original_location"); },
+          end_sort_by_original_location() { console.timeEnd("sort_by_original_location"); },
+        }
+      });
+  }).then(Wasm => {
+    return {
+      exports: Wasm.instance.exports,
+      withMappingCallback: (mappingCallback, f) => {
+        callbackStack.push(mappingCallback);
+        try {
+          f();
+        } finally {
+          callbackStack.pop();
+        }
+      }
+    };
+  }).then(null, e => {
+    cachedWasm = null;
+    throw e;
+  });
+
+  return cachedWasm;
+};
diff --git a/node_modules/source-map/package.json b/node_modules/source-map/package.json
new file mode 100644
index 0000000..389bf08
--- /dev/null
+++ b/node_modules/source-map/package.json
@@ -0,0 +1,229 @@
+{
+  "_from": "source-map@^0.7.3",
+  "_id": "source-map@0.7.3",
+  "_inBundle": false,
+  "_integrity": "sha512-CkCj6giN3S+n9qrYiBTX5gystlENnRW5jZeNLHpe6aue+SrHcG5VYwujhW9s4dY31mEGsxBDrHR6oI69fTXsaQ==",
+  "_location": "/source-map",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "source-map@^0.7.3",
+    "name": "source-map",
+    "escapedName": "source-map",
+    "rawSpec": "^0.7.3",
+    "saveSpec": null,
+    "fetchSpec": "^0.7.3"
+  },
+  "_requiredBy": [
+    "/@riotjs/compiler"
+  ],
+  "_resolved": "https://registry.npmjs.org/source-map/-/source-map-0.7.3.tgz",
+  "_shasum": "5302f8169031735226544092e64981f751750383",
+  "_spec": "source-map@^0.7.3",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/@riotjs/compiler",
+  "author": {
+    "name": "Nick Fitzgerald",
+    "email": "nfitzgerald@mozilla.com"
+  },
+  "bugs": {
+    "url": "https://github.com/mozilla/source-map/issues"
+  },
+  "bundleDependencies": false,
+  "contributors": [
+    {
+      "name": "Tobias Koppers",
+      "email": "tobias.koppers@googlemail.com"
+    },
+    {
+      "name": "Duncan Beevers",
+      "email": "duncan@dweebd.com"
+    },
+    {
+      "name": "Stephen Crane",
+      "email": "scrane@mozilla.com"
+    },
+    {
+      "name": "Ryan Seddon",
+      "email": "seddon.ryan@gmail.com"
+    },
+    {
+      "name": "Miles Elam",
+      "email": "miles.elam@deem.com"
+    },
+    {
+      "name": "Mihai Bazon",
+      "email": "mihai.bazon@gmail.com"
+    },
+    {
+      "name": "Michael Ficarra",
+      "email": "github.public.email@michael.ficarra.me"
+    },
+    {
+      "name": "Todd Wolfson",
+      "email": "todd@twolfson.com"
+    },
+    {
+      "name": "Alexander Solovyov",
+      "email": "alexander@solovyov.net"
+    },
+    {
+      "name": "Felix Gnass",
+      "email": "fgnass@gmail.com"
+    },
+    {
+      "name": "Conrad Irwin",
+      "email": "conrad.irwin@gmail.com"
+    },
+    {
+      "name": "usrbincc",
+      "email": "usrbincc@yahoo.com"
+    },
+    {
+      "name": "David Glasser",
+      "email": "glasser@davidglasser.net"
+    },
+    {
+      "name": "Chase Douglas",
+      "email": "chase@newrelic.com"
+    },
+    {
+      "name": "Evan Wallace",
+      "email": "evan.exe@gmail.com"
+    },
+    {
+      "name": "Heather Arthur",
+      "email": "fayearthur@gmail.com"
+    },
+    {
+      "name": "Hugh Kennedy",
+      "email": "hughskennedy@gmail.com"
+    },
+    {
+      "name": "David Glasser",
+      "email": "glasser@davidglasser.net"
+    },
+    {
+      "name": "Simon Lydell",
+      "email": "simon.lydell@gmail.com"
+    },
+    {
+      "name": "Jmeas Smith",
+      "email": "jellyes2@gmail.com"
+    },
+    {
+      "name": "Michael Z Goddard",
+      "email": "mzgoddard@gmail.com"
+    },
+    {
+      "name": "azu",
+      "email": "azu@users.noreply.github.com"
+    },
+    {
+      "name": "John Gozde",
+      "email": "john@gozde.ca"
+    },
+    {
+      "name": "Adam Kirkton",
+      "email": "akirkton@truefitinnovation.com"
+    },
+    {
+      "name": "Chris Montgomery",
+      "email": "christopher.montgomery@dowjones.com"
+    },
+    {
+      "name": "J. Ryan Stinnett",
+      "email": "jryans@gmail.com"
+    },
+    {
+      "name": "Jack Herrington",
+      "email": "jherrington@walmartlabs.com"
+    },
+    {
+      "name": "Chris Truter",
+      "email": "jeffpalentine@gmail.com"
+    },
+    {
+      "name": "Daniel Espeset",
+      "email": "daniel@danielespeset.com"
+    },
+    {
+      "name": "Jamie Wong",
+      "email": "jamie.lf.wong@gmail.com"
+    },
+    {
+      "name": "Eddy Bruël",
+      "email": "ejpbruel@mozilla.com"
+    },
+    {
+      "name": "Hawken Rives",
+      "email": "hawkrives@gmail.com"
+    },
+    {
+      "name": "Gilad Peleg",
+      "email": "giladp007@gmail.com"
+    },
+    {
+      "name": "djchie",
+      "email": "djchie.dev@gmail.com"
+    },
+    {
+      "name": "Gary Ye",
+      "email": "garysye@gmail.com"
+    },
+    {
+      "name": "Nicolas Lalevée",
+      "email": "nicolas.lalevee@hibnet.org"
+    }
+  ],
+  "deprecated": false,
+  "description": "Generates and consumes source maps",
+  "devDependencies": {
+    "doctoc": "^0.15.0",
+    "eslint": "^4.19.1",
+    "live-server": "^1.2.0",
+    "npm-run-all": "^4.1.2",
+    "nyc": "^11.7.1",
+    "watch": "^1.0.2",
+    "webpack": "^3.10"
+  },
+  "engines": {
+    "node": ">= 8"
+  },
+  "files": [
+    "source-map.js",
+    "source-map.d.ts",
+    "lib/",
+    "dist/source-map.js"
+  ],
+  "homepage": "https://github.com/mozilla/source-map",
+  "license": "BSD-3-Clause",
+  "main": "./source-map.js",
+  "name": "source-map",
+  "nyc": {
+    "reporter": "html"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://git@github.com/mozilla/source-map.git"
+  },
+  "scripts": {
+    "build": "webpack --color",
+    "clean": "rm -rf coverage .nyc_output",
+    "coverage": "nyc node test/run-tests.js",
+    "dev": "npm-run-all -p --silent dev:*",
+    "dev:live": "live-server --port=4103 --ignorePattern='(js|css|png)$' coverage",
+    "dev:watch": "watch 'npm run coverage' lib/ test/",
+    "lint": "eslint *.js lib/ test/",
+    "prebuild": "npm run lint",
+    "precoverage": "npm run build",
+    "predev": "npm run setup",
+    "pretest": "npm run build",
+    "setup": "mkdir -p coverage && cp -n .waiting.html coverage/index.html || true",
+    "test": "node test/run-tests.js",
+    "toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
+  },
+  "types": "./source-map.d.ts",
+  "typings": "source-map",
+  "version": "0.7.3"
+}
diff --git a/node_modules/source-map/source-map.d.ts b/node_modules/source-map/source-map.d.ts
new file mode 100644
index 0000000..2459391
--- /dev/null
+++ b/node_modules/source-map/source-map.d.ts
@@ -0,0 +1,369 @@
+// Type definitions for source-map 0.7
+// Project: https://github.com/mozilla/source-map
+// Definitions by: Morten Houston Ludvigsen <https://github.com/MortenHoustonLudvigsen>,
+//                 Ron Buckton <https://github.com/rbuckton>,
+//                 John Vilk <https://github.com/jvilk>
+// Definitions: https://github.com/mozilla/source-map
+export type SourceMapUrl = string;
+
+export interface StartOfSourceMap {
+    file?: string;
+    sourceRoot?: string;
+    skipValidation?: boolean;
+}
+
+export interface RawSourceMap {
+    version: number;
+    sources: string[];
+    names: string[];
+    sourceRoot?: string;
+    sourcesContent?: string[];
+    mappings: string;
+    file: string;
+}
+
+export interface RawIndexMap extends StartOfSourceMap {
+    version: number;
+    sections: RawSection[];
+}
+
+export interface RawSection {
+    offset: Position;
+    map: RawSourceMap;
+}
+
+export interface Position {
+    line: number;
+    column: number;
+}
+
+export interface NullablePosition {
+    line: number | null;
+    column: number | null;
+    lastColumn: number | null;
+}
+
+export interface MappedPosition {
+    source: string;
+    line: number;
+    column: number;
+    name?: string;
+}
+
+export interface NullableMappedPosition {
+    source: string | null;
+    line: number | null;
+    column: number | null;
+    name: string | null;
+}
+
+export interface MappingItem {
+    source: string;
+    generatedLine: number;
+    generatedColumn: number;
+    originalLine: number;
+    originalColumn: number;
+    name: string;
+}
+
+export interface Mapping {
+    generated: Position;
+    original: Position;
+    source: string;
+    name?: string;
+}
+
+export interface CodeWithSourceMap {
+    code: string;
+    map: SourceMapGenerator;
+}
+
+export interface SourceMapConsumer {
+    /**
+     * Compute the last column for each generated mapping. The last column is
+     * inclusive.
+     */
+    computeColumnSpans(): void;
+
+    /**
+     * Returns the original source, line, and column information for the generated
+     * source's line and column positions provided. The only argument is an object
+     * with the following properties:
+     *
+     *   - line: The line number in the generated source.
+     *   - column: The column number in the generated source.
+     *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+     *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+     *     closest element that is smaller than or greater than the one we are
+     *     searching for, respectively, if the exact element cannot be found.
+     *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+     *
+     * and an object is returned with the following properties:
+     *
+     *   - source: The original source file, or null.
+     *   - line: The line number in the original source, or null.
+     *   - column: The column number in the original source, or null.
+     *   - name: The original identifier, or null.
+     */
+    originalPositionFor(generatedPosition: Position & { bias?: number }): NullableMappedPosition;
+
+    /**
+     * Returns the generated line and column information for the original source,
+     * line, and column positions provided. The only argument is an object with
+     * the following properties:
+     *
+     *   - source: The filename of the original source.
+     *   - line: The line number in the original source.
+     *   - column: The column number in the original source.
+     *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or
+     *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the
+     *     closest element that is smaller than or greater than the one we are
+     *     searching for, respectively, if the exact element cannot be found.
+     *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.
+     *
+     * and an object is returned with the following properties:
+     *
+     *   - line: The line number in the generated source, or null.
+     *   - column: The column number in the generated source, or null.
+     */
+    generatedPositionFor(originalPosition: MappedPosition & { bias?: number }): NullablePosition;
+
+    /**
+     * Returns all generated line and column information for the original source,
+     * line, and column provided. If no column is provided, returns all mappings
+     * corresponding to a either the line we are searching for or the next
+     * closest line that has any mappings. Otherwise, returns all mappings
+     * corresponding to the given line and either the column we are searching for
+     * or the next closest column that has any offsets.
+     *
+     * The only argument is an object with the following properties:
+     *
+     *   - source: The filename of the original source.
+     *   - line: The line number in the original source.
+     *   - column: Optional. the column number in the original source.
+     *
+     * and an array of objects is returned, each with the following properties:
+     *
+     *   - line: The line number in the generated source, or null.
+     *   - column: The column number in the generated source, or null.
+     */
+    allGeneratedPositionsFor(originalPosition: MappedPosition): NullablePosition[];
+
+    /**
+     * Return true if we have the source content for every source in the source
+     * map, false otherwise.
+     */
+    hasContentsOfAllSources(): boolean;
+
+    /**
+     * Returns the original source content. The only argument is the url of the
+     * original source file. Returns null if no original source content is
+     * available.
+     */
+    sourceContentFor(source: string, returnNullOnMissing?: boolean): string | null;
+
+    /**
+     * Iterate over each mapping between an original source/line/column and a
+     * generated line/column in this source map.
+     *
+     * @param callback
+     *        The function that is called with each mapping.
+     * @param context
+     *        Optional. If specified, this object will be the value of `this` every
+     *        time that `aCallback` is called.
+     * @param order
+     *        Either `SourceMapConsumer.GENERATED_ORDER` or
+     *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to
+     *        iterate over the mappings sorted by the generated file's line/column
+     *        order or the original's source/line/column order, respectively. Defaults to
+     *        `SourceMapConsumer.GENERATED_ORDER`.
+     */
+    eachMapping(callback: (mapping: MappingItem) => void, context?: any, order?: number): void;
+    /**
+     * Free this source map consumer's associated wasm data that is manually-managed.
+     * Alternatively, you can use SourceMapConsumer.with to avoid needing to remember to call destroy.
+     */
+    destroy(): void;
+}
+
+export interface SourceMapConsumerConstructor {
+    prototype: SourceMapConsumer;
+
+    GENERATED_ORDER: number;
+    ORIGINAL_ORDER: number;
+    GREATEST_LOWER_BOUND: number;
+    LEAST_UPPER_BOUND: number;
+
+    new (rawSourceMap: RawSourceMap, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer>;
+    new (rawSourceMap: RawIndexMap, sourceMapUrl?: SourceMapUrl): Promise<IndexedSourceMapConsumer>;
+    new (rawSourceMap: RawSourceMap | RawIndexMap | string, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer | IndexedSourceMapConsumer>;
+
+    /**
+     * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+     *
+     * @param sourceMap
+     *        The source map that will be consumed.
+     */
+    fromSourceMap(sourceMap: SourceMapGenerator, sourceMapUrl?: SourceMapUrl): Promise<BasicSourceMapConsumer>;
+
+    /**
+     * Construct a new `SourceMapConsumer` from `rawSourceMap` and `sourceMapUrl`
+     * (see the `SourceMapConsumer` constructor for details. Then, invoke the `async
+     * function f(SourceMapConsumer) -> T` with the newly constructed consumer, wait
+     * for `f` to complete, call `destroy` on the consumer, and return `f`'s return
+     * value.
+     *
+     * You must not use the consumer after `f` completes!
+     *
+     * By using `with`, you do not have to remember to manually call `destroy` on
+     * the consumer, since it will be called automatically once `f` completes.
+     *
+     * ```js
+     * const xSquared = await SourceMapConsumer.with(
+     *   myRawSourceMap,
+     *   null,
+     *   async function (consumer) {
+     *     // Use `consumer` inside here and don't worry about remembering
+     *     // to call `destroy`.
+     *
+     *     const x = await whatever(consumer);
+     *     return x * x;
+     *   }
+     * );
+     *
+     * // You may not use that `consumer` anymore out here; it has
+     * // been destroyed. But you can use `xSquared`.
+     * console.log(xSquared);
+     * ```
+     */
+    with<T>(rawSourceMap: RawSourceMap | RawIndexMap | string, sourceMapUrl: SourceMapUrl | null | undefined, callback: (consumer: BasicSourceMapConsumer | IndexedSourceMapConsumer) => Promise<T> | T): Promise<T>;
+}
+
+export const SourceMapConsumer: SourceMapConsumerConstructor;
+
+export interface BasicSourceMapConsumer extends SourceMapConsumer {
+    file: string;
+    sourceRoot: string;
+    sources: string[];
+    sourcesContent: string[];
+}
+
+export interface BasicSourceMapConsumerConstructor {
+    prototype: BasicSourceMapConsumer;
+
+    new (rawSourceMap: RawSourceMap | string): Promise<BasicSourceMapConsumer>;
+
+    /**
+     * Create a BasicSourceMapConsumer from a SourceMapGenerator.
+     *
+     * @param sourceMap
+     *        The source map that will be consumed.
+     */
+    fromSourceMap(sourceMap: SourceMapGenerator): Promise<BasicSourceMapConsumer>;
+}
+
+export const BasicSourceMapConsumer: BasicSourceMapConsumerConstructor;
+
+export interface IndexedSourceMapConsumer extends SourceMapConsumer {
+    sources: string[];
+}
+
+export interface IndexedSourceMapConsumerConstructor {
+    prototype: IndexedSourceMapConsumer;
+
+    new (rawSourceMap: RawIndexMap | string): Promise<IndexedSourceMapConsumer>;
+}
+
+export const IndexedSourceMapConsumer: IndexedSourceMapConsumerConstructor;
+
+export class SourceMapGenerator {
+    constructor(startOfSourceMap?: StartOfSourceMap);
+
+    /**
+     * Creates a new SourceMapGenerator based on a SourceMapConsumer
+     *
+     * @param sourceMapConsumer The SourceMap.
+     */
+    static fromSourceMap(sourceMapConsumer: SourceMapConsumer): SourceMapGenerator;
+
+    /**
+     * Add a single mapping from original source line and column to the generated
+     * source's line and column for this source map being created. The mapping
+     * object should have the following properties:
+     *
+     *   - generated: An object with the generated line and column positions.
+     *   - original: An object with the original line and column positions.
+     *   - source: The original source file (relative to the sourceRoot).
+     *   - name: An optional original token name for this mapping.
+     */
+    addMapping(mapping: Mapping): void;
+
+    /**
+     * Set the source content for a source file.
+     */
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+
+    /**
+     * Applies the mappings of a sub-source-map for a specific source file to the
+     * source map being generated. Each mapping to the supplied source file is
+     * rewritten using the supplied source map. Note: The resolution for the
+     * resulting mappings is the minimium of this map and the supplied map.
+     *
+     * @param sourceMapConsumer The source map to be applied.
+     * @param sourceFile Optional. The filename of the source file.
+     *        If omitted, SourceMapConsumer's file property will be used.
+     * @param sourceMapPath Optional. The dirname of the path to the source map
+     *        to be applied. If relative, it is relative to the SourceMapConsumer.
+     *        This parameter is needed when the two source maps aren't in the same
+     *        directory, and the source map to be applied contains relative source
+     *        paths. If so, those relative source paths need to be rewritten
+     *        relative to the SourceMapGenerator.
+     */
+    applySourceMap(sourceMapConsumer: SourceMapConsumer, sourceFile?: string, sourceMapPath?: string): void;
+
+    toString(): string;
+
+    toJSON(): RawSourceMap;
+}
+
+export class SourceNode {
+    children: SourceNode[];
+    sourceContents: any;
+    line: number;
+    column: number;
+    source: string;
+    name: string;
+
+    constructor();
+    constructor(
+        line: number | null,
+        column: number | null,
+        source: string | null,
+        chunks?: Array<(string | SourceNode)> | SourceNode | string,
+        name?: string
+    );
+
+    static fromStringWithSourceMap(
+        code: string,
+        sourceMapConsumer: SourceMapConsumer,
+        relativePath?: string
+    ): SourceNode;
+
+    add(chunk: Array<(string | SourceNode)> | SourceNode | string): SourceNode;
+
+    prepend(chunk: Array<(string | SourceNode)> | SourceNode | string): SourceNode;
+
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+
+    walk(fn: (chunk: string, mapping: MappedPosition) => void): void;
+
+    walkSourceContents(fn: (file: string, content: string) => void): void;
+
+    join(sep: string): SourceNode;
+
+    replaceRight(pattern: string, replacement: string): SourceNode;
+
+    toString(): string;
+
+    toStringWithSourceMap(startOfSourceMap?: StartOfSourceMap): CodeWithSourceMap;
+}
diff --git a/node_modules/source-map/source-map.js b/node_modules/source-map/source-map.js
new file mode 100644
index 0000000..a84abf1
--- /dev/null
+++ b/node_modules/source-map/source-map.js
@@ -0,0 +1,8 @@
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = require("./lib/source-map-generator").SourceMapGenerator;
+exports.SourceMapConsumer = require("./lib/source-map-consumer").SourceMapConsumer;
+exports.SourceNode = require("./lib/source-node").SourceNode;
diff --git a/node_modules/type-fest/index.d.ts b/node_modules/type-fest/index.d.ts
new file mode 100644
index 0000000..4ef4b18
--- /dev/null
+++ b/node_modules/type-fest/index.d.ts
@@ -0,0 +1,15 @@
+// Basic
+export * from './source/basic';
+
+// Utilities
+export {Except} from './source/except';
+export {Mutable} from './source/mutable';
+export {Merge} from './source/merge';
+export {MergeExclusive} from './source/merge-exclusive';
+export {RequireAtLeastOne} from './source/require-at-least-one';
+export {ReadonlyDeep} from './source/readonly-deep';
+export {LiteralUnion} from './source/literal-union';
+export {Promisable} from './source/promisable';
+
+// Miscellaneous
+export {PackageJson} from './source/package-json';
diff --git a/node_modules/type-fest/license b/node_modules/type-fest/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/type-fest/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/type-fest/package.json b/node_modules/type-fest/package.json
new file mode 100644
index 0000000..5367b85
--- /dev/null
+++ b/node_modules/type-fest/package.json
@@ -0,0 +1,83 @@
+{
+  "_from": "type-fest@^0.6.0",
+  "_id": "type-fest@0.6.0",
+  "_inBundle": false,
+  "_integrity": "sha512-q+MB8nYR1KDLrgr4G5yemftpMC7/QLqVndBmEEdqzmNj5dcFOO4Oo8qlwZE3ULT3+Zim1F8Kq4cBnikNhlCMlg==",
+  "_location": "/type-fest",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "type-fest@^0.6.0",
+    "name": "type-fest",
+    "escapedName": "type-fest",
+    "rawSpec": "^0.6.0",
+    "saveSpec": null,
+    "fetchSpec": "^0.6.0"
+  },
+  "_requiredBy": [
+    "/globals"
+  ],
+  "_resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.6.0.tgz",
+  "_shasum": "8d2a2370d3df886eb5c90ada1c5bf6188acf838b",
+  "_spec": "type-fest@^0.6.0",
+  "_where": "/home/herrhase/Workspace/tentakelfabrik/tiny-components/tiny-one-page/node_modules/globals",
+  "author": {
+    "name": "Sindre Sorhus",
+    "email": "sindresorhus@gmail.com",
+    "url": "sindresorhus.com"
+  },
+  "bugs": {
+    "url": "https://github.com/sindresorhus/type-fest/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "A collection of essential TypeScript types",
+  "devDependencies": {
+    "@sindresorhus/tsconfig": "^0.4.0",
+    "@typescript-eslint/eslint-plugin": "^1.9.0",
+    "@typescript-eslint/parser": "^1.10.2",
+    "eslint-config-xo-typescript": "^0.14.0",
+    "tsd": "^0.7.3",
+    "xo": "^0.24.0"
+  },
+  "engines": {
+    "node": ">=8"
+  },
+  "files": [
+    "index.d.ts",
+    "source"
+  ],
+  "homepage": "https://github.com/sindresorhus/type-fest#readme",
+  "keywords": [
+    "typescript",
+    "ts",
+    "types",
+    "utility",
+    "util",
+    "utilities",
+    "omit",
+    "merge",
+    "json"
+  ],
+  "license": "(MIT OR CC0-1.0)",
+  "name": "type-fest",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/sindresorhus/type-fest.git"
+  },
+  "scripts": {
+    "test": "xo && tsd"
+  },
+  "version": "0.6.0",
+  "xo": {
+    "extends": "xo-typescript",
+    "extensions": [
+      "ts"
+    ],
+    "rules": {
+      "import/no-unresolved": "off",
+      "@typescript-eslint/indent": "off"
+    }
+  }
+}
diff --git a/node_modules/type-fest/readme.md b/node_modules/type-fest/readme.md
new file mode 100644
index 0000000..ff3840c
--- /dev/null
+++ b/node_modules/type-fest/readme.md
@@ -0,0 +1,119 @@
+<div align="center">
+	<br>
+	<br>
+	<img src="media/logo.svg" alt="type-fest" height="300">
+	<br>
+	<br>
+	<b>A collection of essential TypeScript types</b>
+	<br>
+	<hr>
+</div>
+<br>
+<br>
+
+[![Build Status](https://travis-ci.com/sindresorhus/type-fest.svg?branch=master)](https://travis-ci.com/sindresorhus/type-fest)
+[![](https://img.shields.io/badge/unicorn-approved-ff69b4.svg)](https://www.youtube.com/watch?v=9auOCbH5Ns4)
+<!-- Commented out until they actually show anything
+[![npm dependents](https://badgen.net/npm/dependents/type-fest)](https://www.npmjs.com/package/type-fest?activeTab=dependents) [![npm downloads](https://badgen.net/npm/dt/type-fest)](https://www.npmjs.com/package/type-fest)
+-->
+
+Many of the types here should have been built-in. You can help by suggesting some of them to the [TypeScript project](https://github.com/Microsoft/TypeScript/blob/master/CONTRIBUTING.md).
+
+Either add this package as a dependency or copy-paste the needed types. No credit required. 👌
+
+PR welcome for additional commonly needed types and docs improvements. Read the [contributing guidelines](.github/contributing.md) first.
+
+
+## Install
+
+```
+$ npm install type-fest
+```
+
+*Requires TypeScript >=3.2*
+
+
+## Usage
+
+```ts
+import {Except} from 'type-fest';
+
+type Foo = {
+	unicorn: string;
+	rainbow: boolean;
+};
+
+type FooWithoutRainbow = Except<Foo, 'rainbow'>;
+//=> {unicorn: string}
+```
+
+
+## API
+
+Click the type names for complete docs.
+
+### Basic
+
+- [`Primitive`](source/basic.d.ts) - Matches any [primitive value](https://developer.mozilla.org/en-US/docs/Glossary/Primitive).
+- [`Class`](source/basic.d.ts) - Matches a [`class` constructor](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes).
+- [`TypedArray`](source/basic.d.ts) - Matches any [typed array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray), like `Uint8Array` or `Float64Array`.
+- [`JsonObject`](source/basic.d.ts) - Matches a JSON object.
+- [`JsonArray`](source/basic.d.ts) - Matches a JSON array.
+- [`JsonValue`](source/basic.d.ts) - Matches any valid JSON value.
+- [`ObservableLike`](source/basic.d.ts) - Matches a value that is like an [Observable](https://github.com/tc39/proposal-observable).
+
+### Utilities
+
+- [`Except`](source/except.d.ts) - Create a type from an object type without certain keys. This is a stricter version of [`Omit`](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-3-5.html#the-omit-helper-type).
+- [`Mutable`](source/mutable.d.ts) - Convert an object with `readonly` properties into a mutable object. Inverse of `Readonly<T>`.
+- [`Merge`](source/merge.d.ts) - Merge two types into a new type. Keys of the second type overrides keys of the first type.
+- [`MergeExclusive`](source/merge-exclusive.d.ts) - Create a type that has mutually exclusive properties.
+- [`RequireAtLeastOne`](source/require-at-least-one.d.ts) - Create a type that requires at least one of the given properties.
+- [`ReadonlyDeep`](source/readonly-deep.d.ts) - Create a deeply immutable version of a `object`/`Map`/`Set`/`Array` type.
+- [`LiteralUnion`](source/literal-union.d.ts) - Create a union type by combining primitive types and literal types without sacrificing auto-completion in IDEs for the literal type part of the union. Workaround for [Microsoft/TypeScript#29729](https://github.com/Microsoft/TypeScript/issues/29729).
+- [`Promisable`](source/promisable.d.ts) - Create a type that represents either the value or the value wrapped in `PromiseLike`.
+
+### Miscellaneous
+
+- [`PackageJson`](source/package-json.d.ts) - Type for [npm's `package.json` file](https://docs.npmjs.com/creating-a-package-json-file).
+
+
+## Declined types
+
+*If we decline a type addition, we will make sure to document the better solution here.*
+
+- [`Diff` and `Spread`](https://github.com/sindresorhus/type-fest/pull/7) - The PR author didn't provide any real-world use-cases and the PR went stale. If you think this type is useful, provide some real-world use-cases and we might reconsider.
+
+
+## Tips
+
+### Built-in types
+
+There are many advanced types most users don't know about.
+
+- [`Partial<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1401-L1406) - Make all properties in `T` optional.
+- [`Required<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1408-L1413) - Make all properties in `T` required.
+- [`Readonly<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1415-L1420) - Make all properties in `T` readonly.
+- [`Pick<T, K>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1422-L1427) - From `T`, pick a set of properties whose keys are in the union `K`.
+- [`Record<K, T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1429-L1434) - Construct a type with a set of properties `K` of type `T`.
+- [`Exclude<T, U>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1436-L1439) - Exclude from `T` those types that are assignable to `U`.
+- [`Extract<T, U>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1441-L1444) - Extract from `T` those types that are assignable to `U`.
+- [`NonNullable<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1446-L1449) - Exclude `null` and `undefined` from `T`.
+- [`Parameters<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1451-L1454) - Obtain the parameters of a function type in a tuple.
+- [`ConstructorParameters<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1456-L1459) - Obtain the parameters of a constructor function type in a tuple.
+- [`ReturnType<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1461-L1464) – Obtain the return type of a function type.
+- [`InstanceType<T>`](https://github.com/Microsoft/TypeScript/blob/2961bc3fc0ea1117d4e53bc8e97fa76119bc33e3/src/lib/es5.d.ts#L1466-L1469) – Obtain the instance type of a constructor function type.
+
+You can find some examples in the [TypeScript docs](https://www.typescriptlang.org/docs/handbook/advanced-types.html#predefined-conditional-types).
+
+
+## Maintainers
+
+- [Sindre Sorhus](https://github.com/sindresorhus)
+- [Jarek Radosz](https://github.com/CvX)
+- [Dimitri Benin](https://github.com/BendingBender)
+
+
+## License
+
+(MIT OR CC0-1.0)
diff --git a/node_modules/type-fest/source/basic.d.ts b/node_modules/type-fest/source/basic.d.ts
new file mode 100644
index 0000000..f308c5f
--- /dev/null
+++ b/node_modules/type-fest/source/basic.d.ts
@@ -0,0 +1,67 @@
+/// <reference lib="esnext"/>
+
+// TODO: This can just be `export type Primitive = not object` when the `not` keyword is out.
+/**
+Matches any [primitive value](https://developer.mozilla.org/en-US/docs/Glossary/Primitive).
+*/
+export type Primitive =
+	| null
+	| undefined
+	| string
+	| number
+	| boolean
+	| symbol
+	| bigint;
+
+// TODO: Remove the `= unknown` sometime  in the future when most users are on TS 3.5 as it's now the default
+/**
+Matches a [`class` constructor](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Classes).
+*/
+export type Class<T = unknown> = new(...arguments_: any[]) => T;
+
+/**
+Matches any [typed array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray), like `Uint8Array` or `Float64Array`.
+*/
+export type TypedArray =
+	| Int8Array
+	| Uint8Array
+	| Uint8ClampedArray
+	| Int16Array
+	| Uint16Array
+	| Int32Array
+	| Uint32Array
+	| Float32Array
+	| Float64Array
+	| BigInt64Array
+	| BigUint64Array;
+
+/**
+Matches a JSON object.
+
+This type can be useful to enforce some input to be JSON-compatible or as a super-type to be extended from. Don't use this as a direct return type as the user would have to double-cast it: `jsonObject as unknown as CustomResponse`. Instead, you could extend your CustomResponse type from it to ensure your type only uses JSON-compatible types: `interface CustomResponse extends JsonObject { … }`.
+*/
+export type JsonObject = {[key: string]: JsonValue};
+
+/**
+Matches a JSON array.
+*/
+export interface JsonArray extends Array<JsonValue> {}
+
+/**
+Matches any valid JSON value.
+*/
+export type JsonValue = string | number | boolean | null | JsonObject | JsonArray;
+
+declare global {
+	interface SymbolConstructor {
+		readonly observable: symbol;
+	}
+}
+
+/**
+Matches a value that is like an [Observable](https://github.com/tc39/proposal-observable).
+*/
+export interface ObservableLike {
+	subscribe(observer: (value: unknown) => void): void;
+	[Symbol.observable](): ObservableLike;
+}
diff --git a/node_modules/type-fest/source/except.d.ts b/node_modules/type-fest/source/except.d.ts
new file mode 100644
index 0000000..7dedbaa
--- /dev/null
+++ b/node_modules/type-fest/source/except.d.ts
@@ -0,0 +1,22 @@
+/**
+Create a type from an object type without certain keys.
+
+This type is a stricter version of [`Omit`](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-3-5.html#the-omit-helper-type). The `Omit` type does not restrict the omitted keys to be keys present on the given type, while `Except` does. The benefits of a stricter type are avoiding typos and allowing the compiler to pick up on rename refactors automatically.
+
+Please upvote [this issue](https://github.com/microsoft/TypeScript/issues/30825) if you want to have the stricter version as a built-in in TypeScript.
+
+@example
+```
+import {Except} from 'type-fest';
+
+type Foo = {
+	a: number;
+	b: string;
+	c: boolean;
+};
+
+type FooWithoutA = Except<Foo, 'a' | 'c'>;
+//=> {b: string};
+```
+*/
+export type Except<ObjectType, KeysType extends keyof ObjectType> = Pick<ObjectType, Exclude<keyof ObjectType, KeysType>>;
diff --git a/node_modules/type-fest/source/literal-union.d.ts b/node_modules/type-fest/source/literal-union.d.ts
new file mode 100644
index 0000000..52e8de6
--- /dev/null
+++ b/node_modules/type-fest/source/literal-union.d.ts
@@ -0,0 +1,33 @@
+import {Primitive} from './basic';
+
+/**
+Allows creating a union type by combining primitive types and literal types without sacrificing auto-completion in IDEs for the literal type part of the union.
+
+Currently, when a union type of a primitive type is combined with literal types, TypeScript loses all information about the combined literals. Thus, when such type is used in an IDE with autocompletion, no suggestions are made for the declared literals.
+
+This type is a workaround for [Microsoft/TypeScript#29729](https://github.com/Microsoft/TypeScript/issues/29729). It will be removed as soon as it's not needed anymore.
+
+@example
+```
+import {LiteralUnion} from 'type-fest';
+
+// Before
+
+type Pet = 'dog' | 'cat' | string;
+
+const pet: Pet = '';
+// Start typing in your TypeScript-enabled IDE.
+// You **will not** get auto-completion for `dog` and `cat` literals.
+
+// After
+
+type Pet2 = LiteralUnion<'dog' | 'cat', string>;
+
+const pet: Pet2 = '';
+// You **will** get auto-completion for `dog` and `cat` literals.
+```
+ */
+export type LiteralUnion<
+	LiteralType extends BaseType,
+	BaseType extends Primitive
+> = LiteralType | (BaseType & {_?: never});
diff --git a/node_modules/type-fest/source/merge-exclusive.d.ts b/node_modules/type-fest/source/merge-exclusive.d.ts
new file mode 100644
index 0000000..6290f42
--- /dev/null
+++ b/node_modules/type-fest/source/merge-exclusive.d.ts
@@ -0,0 +1,39 @@
+// Helper type. Not useful on its own.
+type Without<FirstType, SecondType> = {[KeyType in Exclude<keyof FirstType, keyof SecondType>]?: never};
+
+/**
+Create a type that has mutually exclusive properties.
+
+This type was inspired by [this comment](https://github.com/Microsoft/TypeScript/issues/14094#issuecomment-373782604).
+
+This type works with a helper type, called `Without`. `Without<FirstType, SecondType>` produces a type that has only keys from `FirstType` which are not present on `SecondType` and sets the value type for these keys to `never`. This helper type is then used in `MergeExclusive` to remove keys from either `FirstType` or `SecondType`.
+
+@example
+```
+import {MergeExclusive} from 'type-fest';
+
+interface ExclusiveVariation1 {
+	exclusive1: boolean;
+}
+
+interface ExclusiveVariation2 {
+	exclusive2: string;
+}
+
+type ExclusiveOptions = MergeExclusive<ExclusiveVariation1, ExclusiveVariation2>;
+
+let exclusiveOptions: ExclusiveOptions;
+
+exclusiveOptions = {exclusive1: true};
+//=> Works
+exclusiveOptions = {exclusive2: 'hi'};
+//=> Works
+exclusiveOptions = {exclusive1: true, exclusive2: 'hi'};
+//=> Error
+```
+*/
+export type MergeExclusive<FirstType, SecondType> =
+	(FirstType | SecondType) extends object ?
+		(Without<FirstType, SecondType> & SecondType) | (Without<SecondType, FirstType> & FirstType) :
+		FirstType | SecondType;
+
diff --git a/node_modules/type-fest/source/merge.d.ts b/node_modules/type-fest/source/merge.d.ts
new file mode 100644
index 0000000..4b3920b
--- /dev/null
+++ b/node_modules/type-fest/source/merge.d.ts
@@ -0,0 +1,22 @@
+import {Except} from './except';
+
+/**
+Merge two types into a new type. Keys of the second type overrides keys of the first type.
+
+@example
+```
+import {Merge} from 'type-fest';
+
+type Foo = {
+	a: number;
+	b: string;
+};
+
+type Bar = {
+	b: number;
+};
+
+const ab: Merge<Foo, Bar> = {a: 1, b: 2};
+```
+*/
+export type Merge<FirstType, SecondType> = Except<FirstType, Extract<keyof FirstType, keyof SecondType>> & SecondType;
diff --git a/node_modules/type-fest/source/mutable.d.ts b/node_modules/type-fest/source/mutable.d.ts
new file mode 100644
index 0000000..5c98039
--- /dev/null
+++ b/node_modules/type-fest/source/mutable.d.ts
@@ -0,0 +1,22 @@
+/**
+Convert an object with `readonly` properties into a mutable object. Inverse of `Readonly<T>`.
+
+This can be used to [store and mutate options within a class](https://github.com/sindresorhus/pageres/blob/4a5d05fca19a5fbd2f53842cbf3eb7b1b63bddd2/source/index.ts#L72), [edit `readonly` objects within tests](https://stackoverflow.com/questions/50703834), and [construct a `readonly` object within a function](https://github.com/Microsoft/TypeScript/issues/24509).
+
+@example
+```
+import {Mutable} from 'type-fest';
+
+type Foo = {
+	readonly a: number;
+	readonly b: string;
+};
+
+const mutableFoo: Mutable<Foo> = {a: 1, b: '2'};
+mutableFoo.a = 3;
+```
+*/
+export type Mutable<ObjectType> = {
+	// For each `Key` in the keys of `ObjectType`, make a mapped type by removing the `readonly` modifier from the property.
+	-readonly [KeyType in keyof ObjectType]: ObjectType[KeyType];
+};
diff --git a/node_modules/type-fest/source/package-json.d.ts b/node_modules/type-fest/source/package-json.d.ts
new file mode 100644
index 0000000..3179e58
--- /dev/null
+++ b/node_modules/type-fest/source/package-json.d.ts
@@ -0,0 +1,501 @@
+import {LiteralUnion} from '..';
+
+declare namespace PackageJson {
+	/**
+	A person who has been involved in creating or maintaining the package.
+	*/
+	export type Person =
+		| string
+		| {
+			name: string;
+			url?: string;
+			email?: string;
+		};
+
+	export type BugsLocation =
+		| string
+		| {
+			/**
+			The URL to the package's issue tracker.
+			*/
+			url?: string;
+
+			/**
+			The email address to which issues should be reported.
+			*/
+			email?: string;
+		};
+
+	export interface DirectoryLocations {
+		/**
+		Location for executable scripts. Sugar to generate entries in the `bin` property by walking the folder.
+		*/
+		bin?: string;
+
+		/**
+		Location for Markdown files.
+		*/
+		doc?: string;
+
+		/**
+		Location for example scripts.
+		*/
+		example?: string;
+
+		/**
+		Location for the bulk of the library.
+		*/
+		lib?: string;
+
+		/**
+		Location for man pages. Sugar to generate a `man` array by walking the folder.
+		*/
+		man?: string;
+
+		/**
+		Location for test files.
+		*/
+		test?: string;
+
+		[directoryType: string]: unknown;
+	}
+
+	export type Scripts = {
+		/**
+		Run **before** the package is published (Also run on local `npm install` without any arguments).
+		*/
+		prepublish?: string;
+
+		/**
+		Run both **before** the package is packed and published, and on local `npm install` without any arguments. This is run **after** `prepublish`, but **before** `prepublishOnly`.
+		*/
+		prepare?: string;
+
+		/**
+		Run **before** the package is prepared and packed, **only** on `npm publish`.
+		*/
+		prepublishOnly?: string;
+
+		/**
+		Run **before** a tarball is packed (on `npm pack`, `npm publish`, and when installing git dependencies).
+		*/
+		prepack?: string;
+
+		/**
+		Run **after** the tarball has been generated and moved to its final destination.
+		*/
+		postpack?: string;
+
+		/**
+		Run **after** the package is published.
+		*/
+		publish?: string;
+
+		/**
+		Run **after** the package is published.
+		*/
+		postpublish?: string;
+
+		/**
+		Run **before** the package is installed.
+		*/
+		preinstall?: string;
+
+		/**
+		Run **after** the package is installed.
+		*/
+		install?: string;
+
+		/**
+		Run **after** the package is installed and after `install`.
+		*/
+		postinstall?: string;
+
+		/**
+		Run **before** the package is uninstalled and before `uninstall`.
+		*/
+		preuninstall?: string;
+
+		/**
+		Run **before** the package is uninstalled.
+		*/
+		uninstall?: string;
+
+		/**
+		Run **after** the package is uninstalled.
+		*/
+		postuninstall?: string;
+
+		/**
+		Run **before** bump the package version and before `version`.
+		*/
+		preversion?: string;
+
+		/**
+		Run **before** bump the package version.
+		*/
+		version?: string;
+
+		/**
+		Run **after** bump the package version.
+		*/
+		postversion?: string;
+
+		/**
+		Run with the `npm test` command, before `test`.
+		*/
+		pretest?: string;
+
+		/**
+		Run with the `npm test` command.
+		*/
+		test?: string;
+
+		/**
+		Run with the `npm test` command, after `test`.
+		*/
+		posttest?: string;
+
+		/**
+		Run with the `npm stop` command, before `stop`.
+		*/
+		prestop?: string;
+
+		/**
+		Run with the `npm stop` command.
+		*/
+		stop?: string;
+
+		/**
+		Run with the `npm stop` command, after `stop`.
+		*/
+		poststop?: string;
+
+		/**
+		Run with the `npm start` command, before `start`.
+		*/
+		prestart?: string;
+
+		/**
+		Run with the `npm start` command.
+		*/
+		start?: string;
+
+		/**
+		Run with the `npm start` command, after `start`.
+		*/
+		poststart?: string;
+
+		/**
+		Run with the `npm restart` command, before `restart`. Note: `npm restart` will run the `stop` and `start` scripts if no `restart` script is provided.
+		*/
+		prerestart?: string;
+
+		/**
+		Run with the `npm restart` command. Note: `npm restart` will run the `stop` and `start` scripts if no `restart` script is provided.
+		*/
+		restart?: string;
+
+		/**
+		Run with the `npm restart` command, after `restart`. Note: `npm restart` will run the `stop` and `start` scripts if no `restart` script is provided.
+		*/
+		postrestart?: string;
+	} & {
+		[scriptName: string]: string;
+	};
+
+	/**
+	Dependencies of the package. The version range is a string which has one or more space-separated descriptors. Dependencies can also be identified with a tarball or Git URL.
+	*/
+	export interface Dependency {
+		[packageName: string]: string;
+	}
+
+	export interface NonStandardEntryPoints {
+		/**
+		An ECMAScript module ID that is the primary entry point to the program.
+		*/
+		module?: string;
+
+		/**
+		A module ID with untranspiled code that is the primary entry point to the program.
+		*/
+		esnext?:
+		| string
+		| {
+			main?: string;
+			browser?: string;
+			[moduleName: string]: string | undefined;
+		};
+
+		/**
+		A hint to JavaScript bundlers or component tools when packaging modules for client side use.
+		*/
+		browser?:
+		| string
+		| {
+			[moduleName: string]: string | false;
+		};
+	}
+
+	export interface TypeScriptConfiguration {
+		/**
+		Location of the bundled TypeScript declaration file.
+		*/
+		types?: string;
+
+		/**
+		Location of the bundled TypeScript declaration file. Alias of `types`.
+		*/
+		typings?: string;
+	}
+
+	export interface YarnConfiguration {
+		/**
+		If your package only allows one version of a given dependency, and you’d like to enforce the same behavior as `yarn install --flat` on the command line, set this to `true`.
+
+		Note that if your `package.json` contains `"flat": true` and other packages depend on yours (e.g. you are building a library rather than an application), those other packages will also need `"flat": true` in their `package.json` or be installed with `yarn install --flat` on the command-line.
+		*/
+		flat?: boolean;
+
+		/**
+		Selective version resolutions. Allows the definition of custom package versions inside dependencies without manual edits in the `yarn.lock` file.
+		*/
+		resolutions?: Dependency;
+	}
+
+	export interface JSPMConfiguration {
+		/**
+		JSPM configuration.
+		*/
+		jspm?: PackageJson;
+	}
+}
+
+/**
+Type for [npm's `package.json` file](https://docs.npmjs.com/creating-a-package-json-file). Also includes types for fields used by other popular projects, like TypeScript and Yarn.
+*/
+export type PackageJson = {
+	/**
+	The name of the package.
+	*/
+	name?: string;
+
+	/**
+	Package version, parseable by [`node-semver`](https://github.com/npm/node-semver).
+	*/
+	version?: string;
+
+	/**
+	Package description, listed in `npm search`.
+	*/
+	description?: string;
+
+	/**
+	Keywords associated with package, listed in `npm search`.
+	*/
+	keywords?: string[];
+
+	/**
+	The URL to the package's homepage.
+	*/
+	homepage?: LiteralUnion<'.', string>;
+
+	/**
+	The URL to the package's issue tracker and/or the email address to which issues should be reported.
+	*/
+	bugs?: PackageJson.BugsLocation;
+
+	/**
+	The license for the package.
+	*/
+	license?: string;
+
+	/**
+	The licenses for the package.
+	*/
+	licenses?: Array<{
+		type?: string;
+		url?: string;
+	}>;
+
+	author?: PackageJson.Person;
+
+	/**
+	A list of people who contributed to the package.
+	*/
+	contributors?: PackageJson.Person[];
+
+	/**
+	A list of people who maintain the package.
+	*/
+	maintainers?: PackageJson.Person[];
+
+	/**
+	The files included in the package.
+	*/
+	files?: string[];
+
+	/**
+	The module ID that is the primary entry point to the program.
+	*/
+	main?: string;
+
+	/**
+	The executable files that should be installed into the `PATH`.
+	*/
+	bin?:
+	| string
+	| {
+		[binary: string]: string;
+	};
+
+	/**
+	Filenames to put in place for the `man` program to find.
+	*/
+	man?: string | string[];
+
+	/**
+	Indicates the structure of the package.
+	*/
+	directories?: PackageJson.DirectoryLocations;
+
+	/**
+	Location for the code repository.
+	*/
+	repository?:
+	| string
+	| {
+		type: string;
+		url: string;
+	};
+
+	/**
+	Script commands that are run at various times in the lifecycle of the package. The key is the lifecycle event, and the value is the command to run at that point.
+	*/
+	scripts?: PackageJson.Scripts;
+
+	/**
+	Is used to set configuration parameters used in package scripts that persist across upgrades.
+	*/
+	config?: {
+		[configKey: string]: unknown;
+	};
+
+	/**
+	The dependencies of the package.
+	*/
+	dependencies?: PackageJson.Dependency;
+
+	/**
+	Additional tooling dependencies that are not required for the package to work. Usually test, build, or documentation tooling.
+	*/
+	devDependencies?: PackageJson.Dependency;
+
+	/**
+	Dependencies that are skipped if they fail to install.
+	*/
+	optionalDependencies?: PackageJson.Dependency;
+
+	/**
+	Dependencies that will usually be required by the package user directly or via another dependency.
+	*/
+	peerDependencies?: PackageJson.Dependency;
+
+	/**
+	Package names that are bundled when the package is published.
+	*/
+	bundledDependencies?: string[];
+
+	/**
+	Alias of `bundledDependencies`.
+	*/
+	bundleDependencies?: string[];
+
+	/**
+	Engines that this package runs on.
+	*/
+	engines?: {
+		[EngineName in 'npm' | 'node' | string]: string;
+	};
+
+	/**
+	@deprecated
+	*/
+	engineStrict?: boolean;
+
+	/**
+	Operating systems the module runs on.
+	*/
+	os?: Array<LiteralUnion<
+		| 'aix'
+		| 'darwin'
+		| 'freebsd'
+		| 'linux'
+		| 'openbsd'
+		| 'sunos'
+		| 'win32'
+		| '!aix'
+		| '!darwin'
+		| '!freebsd'
+		| '!linux'
+		| '!openbsd'
+		| '!sunos'
+		| '!win32',
+		string
+	>>;
+
+	/**
+	CPU architectures the module runs on.
+	*/
+	cpu?: Array<LiteralUnion<
+		| 'arm'
+		| 'arm64'
+		| 'ia32'
+		| 'mips'
+		| 'mipsel'
+		| 'ppc'
+		| 'ppc64'
+		| 's390'
+		| 's390x'
+		| 'x32'
+		| 'x64'
+		| '!arm'
+		| '!arm64'
+		| '!ia32'
+		| '!mips'
+		| '!mipsel'
+		| '!ppc'
+		| '!ppc64'
+		| '!s390'
+		| '!s390x'
+		| '!x32'
+		| '!x64',
+		string
+	>>;
+
+	/**
+	If set to `true`, a warning will be shown if package is installed locally. Useful if the package is primarily a command-line application that should be installed globally.
+
+	@deprecated
+	*/
+	preferGlobal?: boolean;
+
+	/**
+	If set to `true`, then npm will refuse to publish it.
+	*/
+	private?: boolean;
+
+	/**
+	 * A set of config values that will be used at publish-time. It's especially handy to set the tag, registry or access, to ensure that a given package is not tagged with 'latest', published to the global public registry or that a scoped module is private by default.
+	 */
+	publishConfig?: {
+		[config: string]: unknown;
+	};
+} &
+PackageJson.NonStandardEntryPoints &
+PackageJson.TypeScriptConfiguration &
+PackageJson.YarnConfiguration &
+PackageJson.JSPMConfiguration & {
+	[key: string]: unknown;
+};
diff --git a/node_modules/type-fest/source/promisable.d.ts b/node_modules/type-fest/source/promisable.d.ts
new file mode 100644
index 0000000..71242a5
--- /dev/null
+++ b/node_modules/type-fest/source/promisable.d.ts
@@ -0,0 +1,23 @@
+/**
+Create a type that represents either the value or the value wrapped in `PromiseLike`.
+
+Use-cases:
+- A function accepts a callback that may either return a value synchronously or may return a promised value.
+- This type could be the return type of `Promise#then()`, `Promise#catch()`, and `Promise#finally()` callbacks.
+
+Please upvote [this issue](https://github.com/microsoft/TypeScript/issues/31394) if you want to have this type as a built-in in TypeScript.
+
+@example
+```
+import {Promisable} from 'type-fest';
+
+async function logger(getLogEntry: () => Promisable<string>): Promise<void> {
+    const entry = await getLogEntry();
+    console.log(entry);
+}
+
+logger(() => 'foo');
+logger(() => Promise.resolve('bar'));
+```
+*/
+export type Promisable<T> = T | PromiseLike<T>;
diff --git a/node_modules/type-fest/source/readonly-deep.d.ts b/node_modules/type-fest/source/readonly-deep.d.ts
new file mode 100644
index 0000000..8de4677
--- /dev/null
+++ b/node_modules/type-fest/source/readonly-deep.d.ts
@@ -0,0 +1,59 @@
+import {Primitive} from './basic';
+
+/**
+Convert `object`s, `Map`s, `Set`s, and `Array`s and all of their properties/elements into immutable structures recursively.
+
+This is useful when a deeply nested structure needs to be exposed as completely immutable, for example, an imported JSON module or when receiving an API response that is passed around.
+
+Please upvote [this issue](https://github.com/microsoft/TypeScript/issues/13923) if you want to have this type as a built-in in TypeScript.
+
+@example
+```
+// data.json
+{
+	"foo": ["bar"]
+}
+
+// main.ts
+import {ReadonlyDeep} from 'type-fest';
+import dataJson = require('./data.json');
+
+const data: ReadonlyDeep<typeof dataJson> = dataJson;
+
+export default data;
+
+// test.ts
+import data from './main';
+
+data.foo.push('bar');
+//=> error TS2339: Property 'push' does not exist on type 'readonly string[]'
+```
+*/
+export type ReadonlyDeep<T> = T extends Primitive | ((...arguments: any[]) => unknown)
+	? T
+	: T extends ReadonlyMap<infer KeyType, infer ValueType>
+	? ReadonlyMapDeep<KeyType, ValueType>
+	: T extends ReadonlySet<infer ItemType>
+	? ReadonlySetDeep<ItemType>
+	: T extends object
+	? ReadonlyObjectDeep<T>
+	: unknown;
+
+/**
+Same as `ReadonlyDeep`, but accepts only `ReadonlyMap`s as inputs. Internal helper for `ReadonlyDeep`.
+*/
+interface ReadonlyMapDeep<KeyType, ValueType>
+	extends ReadonlyMap<ReadonlyDeep<KeyType>, ReadonlyDeep<ValueType>> {}
+
+/**
+Same as `ReadonlyDeep`, but accepts only `ReadonlySet`s as inputs. Internal helper for `ReadonlyDeep`.
+*/
+interface ReadonlySetDeep<ItemType>
+	extends ReadonlySet<ReadonlyDeep<ItemType>> {}
+
+/**
+Same as `ReadonlyDeep`, but accepts only `object`s as inputs. Internal helper for `ReadonlyDeep`.
+*/
+type ReadonlyObjectDeep<ObjectType extends object> = {
+	readonly [PropertyType in keyof ObjectType]: ReadonlyDeep<ObjectType[PropertyType]>
+};
diff --git a/node_modules/type-fest/source/require-at-least-one.d.ts b/node_modules/type-fest/source/require-at-least-one.d.ts
new file mode 100644
index 0000000..2200d49
--- /dev/null
+++ b/node_modules/type-fest/source/require-at-least-one.d.ts
@@ -0,0 +1,32 @@
+import {Except} from './except';
+
+/**
+Create a type that requires at least one of the given properties. The remaining properties are kept as is.
+
+@example
+```
+import {RequireAtLeastOne} from 'type-fest';
+
+type Responder = {
+	text?: () => string;
+	json?: () => string;
+
+	secure?: boolean;
+};
+
+const responder: RequireAtLeastOne<Responder, 'text' | 'json'> = {
+	json: () => '{"message": "ok"}',
+	secure: true
+};
+```
+*/
+export type RequireAtLeastOne<ObjectType, KeysType extends keyof ObjectType = keyof ObjectType> =
+	{
+		// For each Key in KeysType make a mapped type
+		[Key in KeysType]: (
+			// …by picking that Key's type and making it required
+			Required<Pick<ObjectType, Key>>
+		)
+	}[KeysType]
+	// …then, make intersection types by adding the remaining properties to each mapped type.
+	& Except<ObjectType, KeysType>;
diff --git a/package-lock.json b/package-lock.json
new file mode 100644
index 0000000..8f09ac8
--- /dev/null
+++ b/package-lock.json
@@ -0,0 +1,168 @@
+{
+  "requires": true,
+  "lockfileVersion": 1,
+  "dependencies": {
+    "@riotjs/compiler": {
+      "version": "4.3.11",
+      "resolved": "https://registry.npmjs.org/@riotjs/compiler/-/compiler-4.3.11.tgz",
+      "integrity": "sha512-3TpOuoiXWSLGvcvZRfhJLdpRpwJihmT+J+NB2nWXA5/8+23x1soUoPmBtRi9Jo2xLInsh3J1/q5tQ8LjXLc2eQ==",
+      "requires": {
+        "@riotjs/dom-bindings": "^4.2.5",
+        "@riotjs/parser": "^4.0.3",
+        "acorn": "^7.0.0",
+        "cssesc": "^3.0.0",
+        "cumpa": "^1.0.1",
+        "curri": "^1.0.1",
+        "dom-nodes": "^1.1.3",
+        "globals": "^12.0.0",
+        "recast": "^0.18.2",
+        "source-map": "^0.7.3"
+      }
+    },
+    "@riotjs/dom-bindings": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/@riotjs/dom-bindings/-/dom-bindings-4.3.0.tgz",
+      "integrity": "sha512-SxcuWgW9wdUlJnMiyNgeC6n/Olo1SyiDmhSpR+Ss+iUKCnfjbl5lpq6AoBqpUiO++PMUIRZqsDsvkI+pilMSqw==",
+      "requires": {
+        "domdiff": "^2.0.7"
+      }
+    },
+    "@riotjs/parser": {
+      "version": "4.0.3",
+      "resolved": "https://registry.npmjs.org/@riotjs/parser/-/parser-4.0.3.tgz",
+      "integrity": "sha512-mP10ljXVJ2T0uD6FD9ZKRs1TZZiL6LcXRQJYUCbQ2tNePaKDfcsteuL3O+rk77zNwSgYfEPMSwk9gkcqCy7L7w==",
+      "requires": {
+        "curri": "^1.0.1",
+        "dom-nodes": "^1.0.0"
+      }
+    },
+    "@ungap/essential-map": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmjs.org/@ungap/essential-map/-/essential-map-0.2.0.tgz",
+      "integrity": "sha512-PM7rUPhH2IAeDZXGjMi1KwNVW/4b/wxfzlPkZSXacHA5A98n+PdCou+HD2EaeXlO8pY5Tp81Ysg+J2xB7J/mjw=="
+    },
+    "acorn": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.0.0.tgz",
+      "integrity": "sha512-PaF/MduxijYYt7unVGRuds1vBC9bFxbNf+VWqhOClfdgy7RlVkQqt610ig1/yxTgsDIfW1cWDel5EBbOy3jdtQ=="
+    },
+    "ast-types": {
+      "version": "0.13.2",
+      "resolved": "https://registry.npmjs.org/ast-types/-/ast-types-0.13.2.tgz",
+      "integrity": "sha512-uWMHxJxtfj/1oZClOxDEV1sQ1HCDkA4MG8Gr69KKeBjEVH0R84WlejZ0y2DcwyBlpAEMltmVYkVgqfLFb2oyiA=="
+    },
+    "bianco.attr": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/bianco.attr/-/bianco.attr-1.0.0.tgz",
+      "integrity": "sha512-ry700auBXrfRcn18wgOlDeCIAOy1HKnUrM96hc2xbzt4FQL+pfXTUGrt++gg9/rpp7JD4JUXi0X1OB7um+jm2w==",
+      "requires": {
+        "bianco.dom-to-array": "^0.0.10"
+      }
+    },
+    "bianco.dom-to-array": {
+      "version": "0.0.10",
+      "resolved": "https://registry.npmjs.org/bianco.dom-to-array/-/bianco.dom-to-array-0.0.10.tgz",
+      "integrity": "sha512-EFYkcEGPmIqatvh+6I2eF6/X4mDtEyGoBucqmudJ5qABbFOw3RPIWB913aLD1FTaux8pZtYzD/yvcwGJKSNgXg=="
+    },
+    "bianco.query": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/bianco.query/-/bianco.query-1.0.0.tgz",
+      "integrity": "sha512-pDstv5+tsuw//wNuPnXuf4DjyN116tcH/a7hxbqH1OpWMsBgBkp/O29uxlWEZWN5e6hCaGajLNA9CAGTsgYeWw==",
+      "requires": {
+        "bianco.dom-to-array": "^0.0.10"
+      }
+    },
+    "cssesc": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/cssesc/-/cssesc-3.0.0.tgz",
+      "integrity": "sha512-/Tb/JcjK111nNScGob5MNtsntNM1aCNUDipB/TkwZFhyDrrE47SOx/18wF2bbjgc3ZzCSKW1T5nt5EbFoAz/Vg=="
+    },
+    "cumpa": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/cumpa/-/cumpa-1.0.1.tgz",
+      "integrity": "sha512-Ew3sfG4cqvDFINS1VgdvLX1FIruhySlnP6DRLhB+1EjewiOzhJzKRKPEp/TCuo0RDisSFeuaDrk0S4Q8grF9CA=="
+    },
+    "curri": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/curri/-/curri-1.0.1.tgz",
+      "integrity": "sha512-VwFb2MGqN0A1RPA0vSgDRSWc0c+V6N9yz8pVYJ9AXILAukRAyCZP5Sqp4VdOxgw1lT0t5oaplwIDT/ruF3Nz7Q=="
+    },
+    "dom-nodes": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmjs.org/dom-nodes/-/dom-nodes-1.1.3.tgz",
+      "integrity": "sha512-y5wnIx97oe0IqMllL/lizgkK2c9vu1cQeqPCCsS7mwNdPuYxg3b04eDJynHhC63kM8+ZsteOmiPElfVGOUmmKg=="
+    },
+    "domdiff": {
+      "version": "2.0.7",
+      "resolved": "https://registry.npmjs.org/domdiff/-/domdiff-2.0.7.tgz",
+      "integrity": "sha512-tkfFrF0aas8ECV1l3gQ8GOEaFIrK5z4MoR2c0XXY6dGSyrBvsoUoG7t0Gk3c4tbowkhMYpMe0gay4D7Ao31XCw==",
+      "requires": {
+        "@ungap/essential-map": "^0.2.0"
+      }
+    },
+    "esprima": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
+      "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A=="
+    },
+    "globals": {
+      "version": "12.0.0",
+      "resolved": "https://registry.npmjs.org/globals/-/globals-12.0.0.tgz",
+      "integrity": "sha512-c9xoi32iDwlETiyYfO0pd3M8GcEuytJinSoqq7k3fz4H8p2p31NyfKr7JVd7Y0QvmtWcWXcwqW4L33eeDYgh1A==",
+      "requires": {
+        "type-fest": "^0.6.0"
+      }
+    },
+    "private": {
+      "version": "0.1.8",
+      "resolved": "https://registry.npmjs.org/private/-/private-0.1.8.tgz",
+      "integrity": "sha512-VvivMrbvd2nKkiG38qjULzlc+4Vx4wm/whI9pQD35YrARNnhxeiRktSOhSukRLFNlzg6Br/cJPet5J/u19r/mg=="
+    },
+    "recast": {
+      "version": "0.18.2",
+      "resolved": "https://registry.npmjs.org/recast/-/recast-0.18.2.tgz",
+      "integrity": "sha512-MbuHc1lzIDIn7bpxaqIAGwwtyaokkzPqINf1Vm/LA0BSyVrTgXNVTTT7RzWC9kP+vqrUoYVpd6wHhI8x75ej8w==",
+      "requires": {
+        "ast-types": "0.13.2",
+        "esprima": "~4.0.0",
+        "private": "^0.1.8",
+        "source-map": "~0.6.1"
+      },
+      "dependencies": {
+        "source-map": {
+          "version": "0.6.1",
+          "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz",
+          "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g=="
+        }
+      }
+    },
+    "riot": {
+      "version": "4.5.0",
+      "resolved": "https://registry.npmjs.org/riot/-/riot-4.5.0.tgz",
+      "integrity": "sha512-eyDJvZIXxo192jVO8TJliK2jX6HYrECO6IEkjXsvAzysRcu81OgozRtzd3Vtf/ASiuCmJYnw5ahAVZK5zx0d4w==",
+      "requires": {
+        "@riotjs/compiler": "^4.3.11",
+        "@riotjs/dom-bindings": "^4.2.5",
+        "bianco.attr": "^1.0.0",
+        "bianco.query": "^1.0.0",
+        "cumpa": "^1.0.1",
+        "curri": "^1.0.1"
+      }
+    },
+    "smooth-scroll": {
+      "version": "16.1.0",
+      "resolved": "https://registry.npmjs.org/smooth-scroll/-/smooth-scroll-16.1.0.tgz",
+      "integrity": "sha512-V5b8ekIekZ3xJ6f0sPsLgEbN5YT8gX0Q6yNjZXTKgqjH9dBGadZ0P50fhP0rLRBGifc44qfI3rnWNM+lebhJag=="
+    },
+    "source-map": {
+      "version": "0.7.3",
+      "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.7.3.tgz",
+      "integrity": "sha512-CkCj6giN3S+n9qrYiBTX5gystlENnRW5jZeNLHpe6aue+SrHcG5VYwujhW9s4dY31mEGsxBDrHR6oI69fTXsaQ=="
+    },
+    "type-fest": {
+      "version": "0.6.0",
+      "resolved": "https://registry.npmjs.org/type-fest/-/type-fest-0.6.0.tgz",
+      "integrity": "sha512-q+MB8nYR1KDLrgr4G5yemftpMC7/QLqVndBmEEdqzmNj5dcFOO4Oo8qlwZE3ULT3+Zim1F8Kq4cBnikNhlCMlg=="
+    }
+  }
+}
diff --git a/src/TinyOnePage.riot b/src/TinyOnePage.riot
new file mode 100644
index 0000000..fc30b50
--- /dev/null
+++ b/src/TinyOnePage.riot
@@ -0,0 +1,60 @@
+<tiny-one-page>
+    <div class="tiny-one-page">
+        <div>
+            <div class="tiny-one-page__inner"></div>
+        </div>
+    </div>
+
+    <script>
+
+        import SmoothScroll from 'smooth-scroll';
+
+        export default
+        {
+
+            /**
+             *
+             *
+             */
+            state:
+            {
+
+            },
+
+            /**
+             *  setting innerHTML
+             *
+             *
+             */
+            onMounted()
+            {
+                const wrapper = this.$('.tiny-one-page__inner');
+                wrapper.innerHTML = this.content;
+
+                // adding scroll smooth
+                this.scroll = new SmoothScroll('.tiny-one-page__inner a[href*="#"]', {
+                    offset: function() {
+                        return 100;
+                    }
+                });
+
+                document.addEventListener('scrollStart', this.handleScrollStart, false);
+                document.addEventListener('scrollStop', this.handleScrollStop, false);
+
+                if (window.location.hash) {
+                    this.$(".tiny-one-page__inner a[href$='/" + window.location.hash + "']").parent().addClass('current_page_item');
+                }
+            },
+
+            handleScrollStart(event) {
+                this.$('.navigation li a').not("[href$='" + window.location.hash + "']").parent().removeClass('current_page_item');
+            },
+
+            handleScrollStop(event) {
+                this.$('.navigation li a[href$='" + window.location.hash + "']").parent().addClass('current_page_item');
+            }
+
+        }
+
+    </script>
+</tiny-one-page>