(function (global, factory) {
  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('acorn/dist/acorn.js'), require('magic-string')) :
  typeof define === 'function' && define.amd ? define(['exports', 'acorn/dist/acorn.js', 'magic-string'], factory) :
  (factory((global.buble = global.buble || {}),global.acorn,global.MagicString));
}(this, function (exports,acorn,MagicString) { 'use strict';

  acorn = 'default' in acorn ? acorn['default'] : acorn;
  MagicString = 'default' in MagicString ? MagicString['default'] : MagicString;

  var __commonjs_global = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : this;
  function __commonjs(fn, module) { return module = { exports: {} }, fn(module, module.exports, __commonjs_global), module.exports; }

  var xhtml = __commonjs(function (module) {
  module.exports = {
    quot: '\u0022',
    amp: '&',
    apos: '\u0027',
    lt: '<',
    gt: '>',
    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',
    lang: '\u2329',
    rang: '\u232A',
    loz: '\u25CA',
    spades: '\u2660',
    clubs: '\u2663',
    hearts: '\u2665',
    diams: '\u2666'
  };
  });

  var require$$0 = (xhtml && typeof xhtml === 'object' && 'default' in xhtml ? xhtml['default'] : xhtml);

  var inject = __commonjs(function (module) {
  'use strict';

  var XHTMLEntities = require$$0;

  var hexNumber = /^[\da-fA-F]+$/;
  var decimalNumber = /^\d+$/;

  module.exports = function(acorn) {
    var tt = acorn.tokTypes;
    var tc = acorn.tokContexts;

    tc.j_oTag = new acorn.TokContext('<tag', false);
    tc.j_cTag = new acorn.TokContext('</tag', false);
    tc.j_expr = new acorn.TokContext('<tag>...</tag>', true, true);

    tt.jsxName = new acorn.TokenType('jsxName');
    tt.jsxText = new acorn.TokenType('jsxText', {beforeExpr: true});
    tt.jsxTagStart = new acorn.TokenType('jsxTagStart');
    tt.jsxTagEnd = new acorn.TokenType('jsxTagEnd');

    tt.jsxTagStart.updateContext = function() {
      this.context.push(tc.j_expr); // treat as beginning of JSX expression
      this.context.push(tc.j_oTag); // start opening tag context
      this.exprAllowed = false;
    };
    tt.jsxTagEnd.updateContext = function(prevType) {
      var out = this.context.pop();
      if (out === tc.j_oTag && prevType === tt.slash || out === tc.j_cTag) {
        this.context.pop();
        this.exprAllowed = this.curContext() === tc.j_expr;
      } else {
        this.exprAllowed = true;
      }
    };

    var pp = acorn.Parser.prototype;

    // Reads inline JSX contents token.

    pp.jsx_readToken = function() {
      var out = '', chunkStart = this.pos;
      for (;;) {
        if (this.pos >= this.input.length)
          this.raise(this.start, 'Unterminated JSX contents');
        var ch = this.input.charCodeAt(this.pos);

        switch (ch) {
        case 60: // '<'
        case 123: // '{'
          if (this.pos === this.start) {
            if (ch === 60 && this.exprAllowed) {
              ++this.pos;
              return this.finishToken(tt.jsxTagStart);
            }
            return this.getTokenFromCode(ch);
          }
          out += this.input.slice(chunkStart, this.pos);
          return this.finishToken(tt.jsxText, out);

        case 38: // '&'
          out += this.input.slice(chunkStart, this.pos);
          out += this.jsx_readEntity();
          chunkStart = this.pos;
          break;

        default:
          if (acorn.isNewLine(ch)) {
            out += this.input.slice(chunkStart, this.pos);
            out += this.jsx_readNewLine(true);
            chunkStart = this.pos;
          } else {
            ++this.pos;
          }
        }
      }
    };

    pp.jsx_readNewLine = function(normalizeCRLF) {
      var ch = this.input.charCodeAt(this.pos);
      var out;
      ++this.pos;
      if (ch === 13 && this.input.charCodeAt(this.pos) === 10) {
        ++this.pos;
        out = normalizeCRLF ? '\n' : '\r\n';
      } else {
        out = String.fromCharCode(ch);
      }
      if (this.options.locations) {
        ++this.curLine;
        this.lineStart = this.pos;
      }

      return out;
    };

    pp.jsx_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 === 38) { // '&'
          out += this.input.slice(chunkStart, this.pos);
          out += this.jsx_readEntity();
          chunkStart = this.pos;
        } else if (acorn.isNewLine(ch)) {
          out += this.input.slice(chunkStart, this.pos);
          out += this.jsx_readNewLine(false);
          chunkStart = this.pos;
        } else {
          ++this.pos;
        }
      }
      out += this.input.slice(chunkStart, this.pos++);
      return this.finishToken(tt.string, out);
    };

    pp.jsx_readEntity = function() {
      var str = '', count = 0, entity;
      var ch = this.input[this.pos];
      if (ch !== '&')
        this.raise(this.pos, 'Entity must start with an ampersand');
      var startPos = ++this.pos;
      while (this.pos < this.input.length && count++ < 10) {
        ch = this.input[this.pos++];
        if (ch === ';') {
          if (str[0] === '#') {
            if (str[1] === 'x') {
              str = str.substr(2);
              if (hexNumber.test(str))
                entity = String.fromCharCode(parseInt(str, 16));
            } else {
              str = str.substr(1);
              if (decimalNumber.test(str))
                entity = String.fromCharCode(parseInt(str, 10));
            }
          } else {
            entity = XHTMLEntities[str];
          }
          break;
        }
        str += ch;
      }
      if (!entity) {
        this.pos = startPos;
        return '&';
      }
      return entity;
    };


    // Read a JSX identifier (valid tag or attribute name).
    //
    // Optimized version since JSX identifiers can't contain
    // escape characters and so can be read as single slice.
    // Also assumes that first character was already checked
    // by isIdentifierStart in readToken.

    pp.jsx_readWord = function() {
      var ch, start = this.pos;
      do {
        ch = this.input.charCodeAt(++this.pos);
      } while (acorn.isIdentifierChar(ch) || ch === 45); // '-'
      return this.finishToken(tt.jsxName, this.input.slice(start, this.pos));
    };

    // Transforms JSX element name to string.

    function getQualifiedJSXName(object) {
      if (object.type === 'JSXIdentifier')
        return object.name;

      if (object.type === 'JSXNamespacedName')
        return object.namespace.name + ':' + object.name.name;

      if (object.type === 'JSXMemberExpression')
        return getQualifiedJSXName(object.object) + '.' +
        getQualifiedJSXName(object.property);
    }

    // Parse next token as JSX identifier

    pp.jsx_parseIdentifier = function() {
      var node = this.startNode();
      if (this.type === tt.jsxName)
        node.name = this.value;
      else if (this.type.keyword)
        node.name = this.type.keyword;
      else
        this.unexpected();
      this.next();
      return this.finishNode(node, 'JSXIdentifier');
    };

    // Parse namespaced identifier.

    pp.jsx_parseNamespacedName = function() {
      var startPos = this.start, startLoc = this.startLoc;
      var name = this.jsx_parseIdentifier();
      if (!this.options.plugins.jsx.allowNamespaces || !this.eat(tt.colon)) return name;
      var node = this.startNodeAt(startPos, startLoc);
      node.namespace = name;
      node.name = this.jsx_parseIdentifier();
      return this.finishNode(node, 'JSXNamespacedName');
    };

    // Parses element name in any form - namespaced, member
    // or single identifier.

    pp.jsx_parseElementName = function() {
      var startPos = this.start, startLoc = this.startLoc;
      var node = this.jsx_parseNamespacedName();
      if (this.type === tt.dot && node.type === 'JSXNamespacedName' && !this.options.plugins.jsx.allowNamespacedObjects) {
        this.unexpected();
      }
      while (this.eat(tt.dot)) {
        var newNode = this.startNodeAt(startPos, startLoc);
        newNode.object = node;
        newNode.property = this.jsx_parseIdentifier();
        node = this.finishNode(newNode, 'JSXMemberExpression');
      }
      return node;
    };

    // Parses any type of JSX attribute value.

    pp.jsx_parseAttributeValue = function() {
      switch (this.type) {
      case tt.braceL:
        var node = this.jsx_parseExpressionContainer();
        if (node.expression.type === 'JSXEmptyExpression')
          this.raise(node.start, 'JSX attributes must only be assigned a non-empty expression');
        return node;

      case tt.jsxTagStart:
      case tt.string:
        return this.parseExprAtom();

      default:
        this.raise(this.start, 'JSX value should be either an expression or a quoted JSX text');
      }
    };

    // JSXEmptyExpression is unique type since it doesn't actually parse anything,
    // and so it should start at the end of last read token (left brace) and finish
    // at the beginning of the next one (right brace).

    pp.jsx_parseEmptyExpression = function() {
      var node = this.startNodeAt(this.lastTokEnd, this.lastTokEndLoc);
      return this.finishNodeAt(node, 'JSXEmptyExpression', this.start, this.startLoc);
    };

    // Parses JSX expression enclosed into curly brackets.


    pp.jsx_parseExpressionContainer = function() {
      var node = this.startNode();
      this.next();
      node.expression = this.type === tt.braceR
        ? this.jsx_parseEmptyExpression()
        : this.parseExpression();
      this.expect(tt.braceR);
      return this.finishNode(node, 'JSXExpressionContainer');
    };

    // Parses following JSX attribute name-value pair.

    pp.jsx_parseAttribute = function() {
      var node = this.startNode();
      if (this.eat(tt.braceL)) {
        this.expect(tt.ellipsis);
        node.argument = this.parseMaybeAssign();
        this.expect(tt.braceR);
        return this.finishNode(node, 'JSXSpreadAttribute');
      }
      node.name = this.jsx_parseNamespacedName();
      node.value = this.eat(tt.eq) ? this.jsx_parseAttributeValue() : null;
      return this.finishNode(node, 'JSXAttribute');
    };

    // Parses JSX opening tag starting after '<'.

    pp.jsx_parseOpeningElementAt = function(startPos, startLoc) {
      var node = this.startNodeAt(startPos, startLoc);
      node.attributes = [];
      node.name = this.jsx_parseElementName();
      while (this.type !== tt.slash && this.type !== tt.jsxTagEnd)
        node.attributes.push(this.jsx_parseAttribute());
      node.selfClosing = this.eat(tt.slash);
      this.expect(tt.jsxTagEnd);
      return this.finishNode(node, 'JSXOpeningElement');
    };

    // Parses JSX closing tag starting after '</'.

    pp.jsx_parseClosingElementAt = function(startPos, startLoc) {
      var node = this.startNodeAt(startPos, startLoc);
      node.name = this.jsx_parseElementName();
      this.expect(tt.jsxTagEnd);
      return this.finishNode(node, 'JSXClosingElement');
    };

    // Parses entire JSX element, including it's opening tag
    // (starting after '<'), attributes, contents and closing tag.

    pp.jsx_parseElementAt = function(startPos, startLoc) {
      var node = this.startNodeAt(startPos, startLoc);
      var children = [];
      var openingElement = this.jsx_parseOpeningElementAt(startPos, startLoc);
      var closingElement = null;

      if (!openingElement.selfClosing) {
        contents: for (;;) {
          switch (this.type) {
          case tt.jsxTagStart:
            startPos = this.start; startLoc = this.startLoc;
            this.next();
            if (this.eat(tt.slash)) {
              closingElement = this.jsx_parseClosingElementAt(startPos, startLoc);
              break contents;
            }
            children.push(this.jsx_parseElementAt(startPos, startLoc));
            break;

          case tt.jsxText:
            children.push(this.parseExprAtom());
            break;

          case tt.braceL:
            children.push(this.jsx_parseExpressionContainer());
            break;

          default:
            this.unexpected();
          }
        }
        if (getQualifiedJSXName(closingElement.name) !== getQualifiedJSXName(openingElement.name)) {
          this.raise(
            closingElement.start,
            'Expected corresponding JSX closing tag for <' + getQualifiedJSXName(openingElement.name) + '>');
        }
      }

      node.openingElement = openingElement;
      node.closingElement = closingElement;
      node.children = children;
      if (this.type === tt.relational && this.value === "<") {
        this.raise(this.start, "Adjacent JSX elements must be wrapped in an enclosing tag");
      }
      return this.finishNode(node, 'JSXElement');
    };

    // Parses entire JSX element from current position.

    pp.jsx_parseElement = function() {
      var startPos = this.start, startLoc = this.startLoc;
      this.next();
      return this.jsx_parseElementAt(startPos, startLoc);
    };

    acorn.plugins.jsx = function(instance, opts) {
      if (!opts) {
        return;
      }

      if (typeof opts !== 'object') {
        opts = {};
      }

      instance.options.plugins.jsx = {
        allowNamespaces: opts.allowNamespaces !== false,
        allowNamespacedObjects: !!opts.allowNamespacedObjects
      };

      instance.extend('parseExprAtom', function(inner) {
        return function(refShortHandDefaultPos) {
          if (this.type === tt.jsxText)
            return this.parseLiteral(this.value);
          else if (this.type === tt.jsxTagStart)
            return this.jsx_parseElement();
          else
            return inner.call(this, refShortHandDefaultPos);
        };
      });

      instance.extend('readToken', function(inner) {
        return function(code) {
          var context = this.curContext();

          if (context === tc.j_expr) return this.jsx_readToken();

          if (context === tc.j_oTag || context === tc.j_cTag) {
            if (acorn.isIdentifierStart(code)) return this.jsx_readWord();

            if (code == 62) {
              ++this.pos;
              return this.finishToken(tt.jsxTagEnd);
            }

            if ((code === 34 || code === 39) && context == tc.j_oTag)
              return this.jsx_readString(code);
          }

          if (code === 60 && this.exprAllowed) {
            ++this.pos;
            return this.finishToken(tt.jsxTagStart);
          }
          return inner.call(this, code);
        };
      });

      instance.extend('updateContext', function(inner) {
        return function(prevType) {
          if (this.type == tt.braceL) {
            var curContext = this.curContext();
            if (curContext == tc.j_oTag) this.context.push(tc.b_expr);
            else if (curContext == tc.j_expr) this.context.push(tc.b_tmpl);
            else inner.call(this, prevType);
            this.exprAllowed = true;
          } else if (this.type === tt.slash && prevType === tt.jsxTagStart) {
            this.context.length -= 2; // do not consider JSX expr -> JSX open tag -> ... anymore
            this.context.push(tc.j_cTag); // reconsider as closing tag context
            this.exprAllowed = false;
          } else {
            return inner.call(this, prevType);
          }
        };
      });
    };

    return acorn;
  };
  });

  var acornJsx = (inject && typeof inject === 'object' && 'default' in inject ? inject['default'] : inject);

  var inject$1 = __commonjs(function (module) {
  'use strict';

  module.exports = function(acorn) {
    var tt = acorn.tokTypes;
    var pp = acorn.Parser.prototype;

    // this is the same parseObj that acorn has with...
    function parseObj(isPattern, refDestructuringErrors) {
      var this$1 = this;

      var node = this.startNode(), first = true, propHash = {}
      node.properties = []
      this.next()
      while (!this$1.eat(tt.braceR)) {
        if (!first) {
          this$1.expect(tt.comma)
          if (this$1.afterTrailingComma(tt.braceR)) break
        } else first = false

        var prop = this$1.startNode(), isGenerator, startPos, startLoc
        if (this$1.options.ecmaVersion >= 6) {
          // ...the spread logic borrowed from babylon :)
          if (this$1.type === tt.ellipsis) {
            prop = this$1.parseSpread()
            prop.type = isPattern ? "RestProperty" : "SpreadProperty"
            node.properties.push(prop)
            continue
          }

          prop.method = false
          prop.shorthand = false
          if (isPattern || refDestructuringErrors) {
            startPos = this$1.start
            startLoc = this$1.startLoc
          }
          if (!isPattern)
            isGenerator = this$1.eat(tt.star)
        }
        this$1.parsePropertyName(prop)
        this$1.parsePropertyValue(prop, isPattern, isGenerator, startPos, startLoc, refDestructuringErrors)
        this$1.checkPropClash(prop, propHash)
        node.properties.push(this$1.finishNode(prop, "Property"))
      }
      return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression")
    }

    acorn.plugins.objectSpread = function objectSpreadPlugin(instance) {
      pp.parseObj = parseObj;
    };

    return acorn;
  };
  });

  var acornObjectSpread = (inject$1 && typeof inject$1 === 'object' && 'default' in inject$1 ? inject$1['default'] : inject$1);

  var keys = {
  	Program: [ 'body' ],
  	Literal: []
  };

  // used for debugging, without the noise created by
  // circular references
  function toJSON ( node ) {
  	var obj = {};

  	Object.keys( node ).forEach( function ( key ) {
  		if ( key === 'parent' || key === 'program' || key === 'keys' || key === '__wrapped' ) return;

  		if ( Array.isArray( node[ key ] ) ) {
  			obj[ key ] = node[ key ].map( toJSON );
  		} else if ( node[ key ] && node[ key ].toJSON ) {
  			obj[ key ] = node[ key ].toJSON();
  		} else {
  			obj[ key ] = node[ key ];
  		}
  	});

  	return obj;
  }

  var Node = function Node ( raw, parent ) {
  	raw.parent = parent;
  	raw.program = parent.program || parent;
  	raw.depth = parent.depth + 1;
  	raw.keys = keys[ raw.type ];
  	raw.indentation = undefined;

  	for ( var i = 0, list = keys[ raw.type ]; i < list.length; i += 1 ) {
  		var key = list[i];

  			wrap( raw[ key ], raw );
  	}

  	raw.program.magicString.addSourcemapLocation( raw.start );
  	raw.program.magicString.addSourcemapLocation( raw.end );
  };

  Node.prototype.ancestor = function ancestor ( level ) {
  	var node = this;
  	while ( level-- ) {
  		node = node.parent;
  		if ( !node ) return null;
  	}

  	return node;
  };

  Node.prototype.contains = function contains ( node ) {
  		var this$1 = this;

  	while ( node ) {
  		if ( node === this$1 ) return true;
  		node = node.parent;
  	}

  	return false;
  };

  Node.prototype.findLexicalBoundary = function findLexicalBoundary () {
  	return this.parent.findLexicalBoundary();
  };

  Node.prototype.findNearest = function findNearest ( type ) {
  	if ( typeof type === 'string' ) type = new RegExp( ("^" + type + "$") );
  	if ( type.test( this.type ) ) return this;
  	return this.parent.findNearest( type );
  };

  Node.prototype.unparenthesizedParent = function unparenthesizedParent () {
  	var node = this.parent;
  	while ( node && node.type === 'ParenthesizedExpression' ) {
  		node = node.parent;
  	}
  	return node;
  };

  Node.prototype.unparenthesize = function unparenthesize () {
  	var node = this;
  	while ( node.type === 'ParenthesizedExpression' ) {
  		node = node.expression;
  	}
  	return node;
  };

  Node.prototype.findScope = function findScope ( functionScope ) {
  	return this.parent.findScope( functionScope );
  };

  Node.prototype.getIndentation = function getIndentation () {
  	return this.parent.getIndentation();
  };

  Node.prototype.initialise = function initialise ( transforms ) {
  	for ( var i = 0, list = this.keys; i < list.length; i += 1 ) {
  		var key = list[i];

  			var value = this[ key ];

  		if ( Array.isArray( value ) ) {
  			value.forEach( function ( node ) { return node && node.initialise( transforms ); } );
  		} else if ( value && typeof value === 'object' ) {
  			value.initialise( transforms );
  		}
  	}
  };

  Node.prototype.toJSON = function toJSON$1 () {
  	return toJSON( this );
  };

  Node.prototype.toString = function toString () {
  	return this.program.magicString.original.slice( this.start, this.end );
  };

  Node.prototype.transpile = function transpile ( code, transforms ) {
  	for ( var i = 0, list = this.keys; i < list.length; i += 1 ) {
  		var key = list[i];

  			var value = this[ key ];

  		if ( Array.isArray( value ) ) {
  			value.forEach( function ( node ) { return node && node.transpile( code, transforms ); } );
  		} else if ( value && typeof value === 'object' ) {
  			value.transpile( code, transforms );
  		}
  	}
  };

  function isArguments ( node ) {
  	return node.type === 'Identifier' && node.name === 'arguments';
  }

  function spread ( code, elements, start, argumentsArrayAlias, isNew ) {
  	var i = elements.length;
  	var firstSpreadIndex = -1;

  	while ( i-- ) {
  		var element$1 = elements[i];
  		if ( element$1 && element$1.type === 'SpreadElement' ) {
  			if ( isArguments( element$1.argument ) ) {
  				code.overwrite( element$1.argument.start, element$1.argument.end, argumentsArrayAlias );
  			}

  			firstSpreadIndex = i;
  		}
  	}

  	if ( firstSpreadIndex === -1 ) return false; // false indicates no spread elements

  	if (isNew) {
  		for ( i = 0; i < elements.length; i += 1 ) {
  			var element$2 = elements[i];
  			if ( element$2.type === 'SpreadElement' ) {
  				code.remove( element$2.start, element$2.argument.start );
  			} else {
  				code.insertRight( element$2.start, '[' );
  				code.insertRight( element$2.end, ']' );
  			}
  		}

  		return true; // true indicates some spread elements
  	}

  	var element = elements[ firstSpreadIndex ];
  	var previousElement = elements[ firstSpreadIndex - 1 ];

  	if ( !previousElement ) {
  		code.remove( start, element.start );
  		code.overwrite( element.end, elements[1].start, '.concat( ' );
  	} else {
  		code.overwrite( previousElement.end, element.start, ' ].concat( ' );
  	}

  	for ( i = firstSpreadIndex; i < elements.length; i += 1 ) {
  		element = elements[i];

  		if ( element ) {
  			if ( element.type === 'SpreadElement' ) {
  				code.remove( element.start, element.argument.start );
  			} else {
  				code.insertLeft( element.start, '[' );
  				code.insertLeft( element.end, ']' );
  			}
  		}
  	}

  	return true; // true indicates some spread elements
  }

  var ArrayExpression = (function (Node) {
  	function ArrayExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ArrayExpression.__proto__ = Node;
  	ArrayExpression.prototype = Object.create( Node && Node.prototype );
  	ArrayExpression.prototype.constructor = ArrayExpression;

  	ArrayExpression.prototype.initialise = function initialise ( transforms ) {
  		var this$1 = this;

  		if ( transforms.spreadRest && this.elements.length ) {
  			var lexicalBoundary = this.findLexicalBoundary();

  			var i = this.elements.length;
  			while ( i-- ) {
  				var element = this$1.elements[i];
  				if ( element && element.type === 'SpreadElement' && isArguments( element.argument ) ) {
  					this$1.argumentsArrayAlias = lexicalBoundary.getArgumentsArrayAlias();
  				}
  			}
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	ArrayExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.spreadRest ) {
  			// erase trailing comma after last array element if not an array hole
  			if ( this.elements.length ) {
  				var lastElement = this.elements[ this.elements.length - 1 ];
  				if ( lastElement && /\s*,/.test( code.original.slice( lastElement.end, this.end ) ) ) {
  					code.overwrite( lastElement.end, this.end - 1, ' ' );
  				}
  			}

  			if ( this.elements.length === 1 ) {
  				var element = this.elements[0];

  				if ( element && element.type === 'SpreadElement' ) {
  					// special case – [ ...arguments ]
  					if ( isArguments( element.argument ) ) {
  						code.overwrite( this.start, this.end, ("[].concat( " + (this.argumentsArrayAlias) + " )") ); // TODO if this is the only use of argsArray, don't bother concating
  					} else {
  						code.overwrite( this.start, element.argument.start, '[].concat( ' );
  						code.overwrite( element.end, this.end, ' )' );
  					}
  				}
  			}
  			else {
  				var hasSpreadElements = spread( code, this.elements, this.start, this.argumentsArrayAlias );

  				if ( hasSpreadElements ) {
  					code.overwrite( this.end - 1, this.end, ')' );
  				}
  			}
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return ArrayExpression;
  }(Node));

  var ArrowFunctionExpression = (function (Node) {
  	function ArrowFunctionExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ArrowFunctionExpression.__proto__ = Node;
  	ArrowFunctionExpression.prototype = Object.create( Node && Node.prototype );
  	ArrowFunctionExpression.prototype.constructor = ArrowFunctionExpression;

  	ArrowFunctionExpression.prototype.initialise = function initialise ( transforms ) {
  		this.body.createScope();
  		Node.prototype.initialise.call( this, transforms );
  	};

  	ArrowFunctionExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.arrow ) {
  			// remove arrow
  			var charIndex = this.body.start;
  			while ( code.original[ charIndex ] !== '=' ) {
  				charIndex -= 1;
  			}
  			code.remove( charIndex, this.body.start );

  			// wrap naked parameter
  			if ( this.params.length === 1 && this.start === this.params[0].start ) {
  				code.insertRight( this.params[0].start, '(' );
  				code.insertLeft( this.params[0].end, ')' );
  			}

  			// add function
  			if ( this.parent && this.parent.type === 'ExpressionStatement' ) {
  				// standalone expression statement
  				code.insertRight( this.start, '(function' );
  				code.insertRight( this.end, ')' );
  			} else {
  				code.insertRight( this.start, 'function ' );
  			}
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return ArrowFunctionExpression;
  }(Node));

  function locate ( source, index ) {
  	var lines = source.split( '\n' );
  	var len = lines.length;

  	var lineStart = 0;
  	var i;

  	for ( i = 0; i < len; i += 1 ) {
  		var line = lines[i];
  		var lineEnd =  lineStart + line.length + 1; // +1 for newline

  		if ( lineEnd > index ) {
  			return { line: i + 1, column: index - lineStart, char: i };
  		}

  		lineStart = lineEnd;
  	}

  	throw new Error( 'Could not determine location of character' );
  }

  function pad ( num, len ) {
  	var result = String( num );
  	return result + repeat( ' ', len - result.length );
  }

  function repeat ( str, times ) {
  	var result = '';
  	while ( times-- ) result += str;
  	return result;
  }

  function getSnippet ( source, loc, length ) {
  	if ( length === void 0 ) length = 1;

  	var first = Math.max( loc.line - 5, 0 );
  	var last = loc.line;

  	var numDigits = String( last ).length;

  	var lines = source.split( '\n' ).slice( first, last );

  	var lastLine = lines[ lines.length - 1 ];
  	var offset = lastLine.slice( 0, loc.column ).replace( /\t/g, '  ' ).length;

  	var snippet = lines
  		.map( function ( line, i ) { return ((pad( i + first + 1, numDigits )) + " : " + (line.replace( /\t/g, '  '))); } )
  		.join( '\n' );

  	snippet += '\n' + repeat( ' ', numDigits + 3 + offset ) + repeat( '^', length );

  	return snippet;
  }

  var CompileError = (function (Error) {
  	function CompileError ( node, message ) {
  		Error.call(this);

  		var source = node.program.magicString.original;
  		var loc = locate( source, node.start );

  		this.name = 'CompileError';
  		this.message = message + " (" + (loc.line) + ":" + (loc.column) + ")";

  		this.stack = new Error().stack.replace( new RegExp( (".+new " + (this.name) + ".+\\n"), 'm' ), '' );

  		this.loc = loc;
  		this.snippet = getSnippet( source, loc, node.end - node.start );
  	}

  	if ( Error ) CompileError.__proto__ = Error;
  	CompileError.prototype = Object.create( Error && Error.prototype );
  	CompileError.prototype.constructor = CompileError;

  	CompileError.prototype.toString = function toString () {
  		return ((this.name) + ": " + (this.message) + "\n" + (this.snippet));
  	};

  	return CompileError;
  }(Error));

  var AssignmentExpression = (function (Node) {
  	function AssignmentExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) AssignmentExpression.__proto__ = Node;
  	AssignmentExpression.prototype = Object.create( Node && Node.prototype );
  	AssignmentExpression.prototype.constructor = AssignmentExpression;

  	AssignmentExpression.prototype.initialise = function initialise ( transforms ) {
  		if ( this.left.type === 'Identifier' ) {
  			var declaration = this.findScope( false ).findDeclaration( this.left.name );
  			if ( declaration && declaration.kind === 'const' ) {
  				throw new CompileError( this.left, ((this.left.name) + " is read-only") );
  			}

  			// special case – https://gitlab.com/Rich-Harris/buble/issues/11
  			var statement = declaration && declaration.node.ancestor( 3 );
  			if ( statement && statement.type === 'ForStatement' && statement.body.contains( this ) ) {
  				statement.reassigned[ this.left.name ] = true;
  			}
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	AssignmentExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( this.operator === '**=' && transforms.exponentiation ) {
  			this.transpileExponentiation( code, transforms );
  		}

  		else if ( /Pattern/.test( this.left.type ) && transforms.destructuring ) {
  			this.transpileDestructuring( code, transforms );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	AssignmentExpression.prototype.transpileDestructuring = function transpileDestructuring ( code ) {
  		var scope = this.findScope( true );
  		var assign = scope.createIdentifier( 'assign' );
  		var temporaries = [ assign ];

  		var start = this.start;

  		// We need to pick out some elements from the original code,
  		// interleaved with generated code. These helpers are used to
  		// easily do that while keeping the order of the output
  		// predictable.
  		var text = '';
  		function use ( node ) {
  			code.insertRight( node.start, text );
  			code.move( node.start, node.end, start );
  			text = '';
  		}
  		function write ( string ) {
  			text += string;
  		}

  		write( ("(" + assign + " = ") );
  		use( this.right );

  		// Walk `pattern`, generating code that assigns the value in
  		// `ref` to it. When `mayDuplicate` is false, the function
  		// must take care to only output `ref` once.
  		function destructure ( pattern, ref, mayDuplicate ) {
  			if ( pattern.type === 'Identifier' || pattern.type === 'MemberExpression' ) {
  				write( ', ' );
  				use( pattern );
  				write( (" = " + ref) );
  			}

  			else if ( pattern.type === 'AssignmentPattern' ) {
  				if ( pattern.left.type === 'Identifier' ) {
  					var target = pattern.left.name;
  					var source = ref;
  					if ( !mayDuplicate ) {
  						write( (", " + target + " = " + ref) );
  						source = target;
  					}
  					write( (", " + target + " = " + source + " === void 0 ? ") );
  					use( pattern.right );
  					write( (" : " + source) );
  				}
  				else {
  					var target$1 = scope.createIdentifier( 'temp' );
  					var source$1 = ref;
  					temporaries.push( target$1 );
  					if ( !mayDuplicate ) {
  						write( (", " + target$1 + " = " + ref) );
  						source$1 = target$1;
  					}
  					write( (", " + target$1 + " = " + source$1 + " === void 0 ? ") );
  					use( pattern.right );
  					write( (" : " + source$1) );
  					destructure( pattern.left, target$1, true );
  				}
  			}

  			else if ( pattern.type === 'ArrayPattern' ) {
  				var elements = pattern.elements;
  				if ( elements.length === 1 ) {
  					destructure( elements[0], (ref + "[0]"), false );
  				}
  				else {
  					if ( !mayDuplicate ) {
  						var temp = scope.createIdentifier( 'array' );
  						temporaries.push( temp );
  						write( (", " + temp + " = " + ref) );
  						ref = temp;
  					}
  					elements.forEach( function ( element, i ) {
  						if ( element ) {
  							if ( element.type === 'RestElement' ) {
  								destructure( element.argument, (ref + ".slice(" + i + ")"), false );
  							} else {
  								destructure( element, (ref + "[" + i + "]"), false );
  							}
  						}
  					} );
  				}
  			}

  			else if ( pattern.type === 'ObjectPattern' ) {
  				var props = pattern.properties;
  				if ( props.length == 1 ) {
  					var prop = props[0];
  					var value = prop.computed || prop.key.type !== 'Identifier' ? (ref + "[" + (code.slice(prop.key.start, prop.key.end)) + "]") : (ref + "." + (prop.key.name));
  					destructure( prop.value, value, false );
  				}
  				else {
  					if ( !mayDuplicate ) {
  						var temp$1 = scope.createIdentifier( 'obj' );
  						temporaries.push( temp$1 );
  						write( (", " + temp$1 + " = " + ref) );
  						ref = temp$1;
  					}
  					props.forEach( function ( prop ) {
  						var value = prop.computed || prop.key.type !== 'Identifier' ? (ref + "[" + (code.slice(prop.key.start, prop.key.end)) + "]") : (ref + "." + (prop.key.name));
  						destructure( prop.value, value, false );
  					} );
  				}
  			}

  			else {
  				throw new Error( ("Unexpected node type in destructuring assignment (" + (pattern.type) + ")") );
  			}
  		}
  		destructure( this.left, assign, true );

  		if ( this.unparenthesizedParent().type === 'ExpressionStatement' ) {
  			// no rvalue needed for expression statement
  			code.insertRight( start, (text + ")") );
  		} else {
  			// destructuring is part of an expression - need an rvalue
  			code.insertRight( start, (text + ", " + assign + ")") );
  		}

  		code.remove( start, this.right.start );

  		var statement = this.findNearest( /(?:Statement|Declaration)$/ );
  		code.insertLeft( statement.start, ("var " + (temporaries.join( ', ' )) + ";\n" + (statement.getIndentation())) );
  	};

  	AssignmentExpression.prototype.transpileExponentiation = function transpileExponentiation ( code ) {
  		var scope = this.findScope( false );
  		var getAlias = function ( name ) {
  			var declaration = scope.findDeclaration( name );
  			return declaration ? declaration.name : name;
  		};

  		// first, the easy part – `**=` -> `=`
  		var charIndex = this.left.end;
  		while ( code.original[ charIndex ] !== '*' ) charIndex += 1;
  		code.remove( charIndex, charIndex + 2 );

  		// how we do the next part depends on a number of factors – whether
  		// this is a top-level statement, and whether we're updating a
  		// simple or complex reference
  		var base;

  		var left = this.left.unparenthesize();

  		if ( left.type === 'Identifier' ) {
  			base = getAlias( left.name );
  		} else if ( left.type === 'MemberExpression' ) {
  			var object;
  			var needsObjectVar = false;
  			var property;
  			var needsPropertyVar = false;

  			var statement = this.findNearest( /(?:Statement|Declaration)$/ );
  			var i0 = statement.getIndentation();

  			if ( left.property.type === 'Identifier' ) {
  				property = left.computed ? getAlias( left.property.name ) : left.property.name;
  			} else {
  				property = scope.createIdentifier( 'property' );
  				needsPropertyVar = true;
  			}

  			if ( left.object.type === 'Identifier' ) {
  				object = getAlias( left.object.name );
  			} else {
  				object = scope.createIdentifier( 'object' );
  				needsObjectVar = true;
  			}

  			if ( left.start === statement.start ) {
  				if ( needsObjectVar && needsPropertyVar ) {
  					code.insertRight( statement.start, ("var " + object + " = ") );
  					code.overwrite( left.object.end, left.property.start, (";\n" + i0 + "var " + property + " = ") );
  					code.overwrite( left.property.end, left.end, (";\n" + i0 + object + "[" + property + "]") );
  				}

  				else if ( needsObjectVar ) {
  					code.insertRight( statement.start, ("var " + object + " = ") );
  					code.insertLeft( left.object.end, (";\n" + i0) );
  					code.insertLeft( left.object.end, object );
  				}

  				else if ( needsPropertyVar ) {
  					code.insertRight( left.property.start, ("var " + property + " = ") );
  					code.insertLeft( left.property.end, (";\n" + i0) );
  					code.move( left.property.start, left.property.end, this.start );

  					code.insertLeft( left.object.end, ("[" + property + "]") );
  					code.remove( left.object.end, left.property.start );
  					code.remove( left.property.end, left.end );
  				}
  			}

  			else {
  				var declarators = [];
  				if ( needsObjectVar ) declarators.push( object );
  				if ( needsPropertyVar ) declarators.push( property );

  				if ( declarators.length ) {
  					code.insertRight( statement.start, ("var " + (declarators.join( ', ' )) + ";\n" + i0) );
  				}

  				if ( needsObjectVar && needsPropertyVar ) {
  					code.insertRight( left.start, ("( " + object + " = ") );
  					code.overwrite( left.object.end, left.property.start, (", " + property + " = ") );
  					code.overwrite( left.property.end, left.end, (", " + object + "[" + property + "]") );
  				}

  				else if ( needsObjectVar ) {
  					code.insertRight( left.start, ("( " + object + " = ") );
  					code.insertLeft( left.object.end, (", " + object) );
  				}

  				else if ( needsPropertyVar ) {
  					code.insertRight( left.property.start, ("( " + property + " = ") );
  					code.insertLeft( left.property.end, ", " );
  					code.move( left.property.start, left.property.end, left.start );

  					code.overwrite( left.object.end, left.property.start, ("[" + property + "]") );
  					code.remove( left.property.end, left.end );
  				}

  				if ( needsPropertyVar ) {
  					code.insertLeft( this.end, " )" );
  				}
  			}

  			base = object + ( left.computed || needsPropertyVar ? ("[" + property + "]") : ("." + property) );
  		}

  		code.insertRight( this.right.start, ("Math.pow( " + base + ", ") );
  		code.insertLeft( this.right.end, " )" );
  	};

  	return AssignmentExpression;
  }(Node));

  var BinaryExpression = (function (Node) {
  	function BinaryExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) BinaryExpression.__proto__ = Node;
  	BinaryExpression.prototype = Object.create( Node && Node.prototype );
  	BinaryExpression.prototype.constructor = BinaryExpression;

  	BinaryExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( this.operator === '**' && transforms.exponentiation ) {
  			code.insertRight( this.start, "Math.pow( " );
  			code.overwrite( this.left.end, this.right.start, ", " );
  			code.insertLeft( this.end, " )" );
  		}
  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return BinaryExpression;
  }(Node));

  var loopStatement = /(?:For(?:In|Of)?|While)Statement/;

  var BreakStatement = (function (Node) {
  	function BreakStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) BreakStatement.__proto__ = Node;
  	BreakStatement.prototype = Object.create( Node && Node.prototype );
  	BreakStatement.prototype.constructor = BreakStatement;

  	BreakStatement.prototype.initialise = function initialise () {
  		var loop = this.findNearest( loopStatement );
  		var switchCase = this.findNearest( 'SwitchCase' );

  		if ( loop && ( !switchCase || loop.depth > switchCase.depth ) ) {
  			loop.canBreak = true;
  			this.loop = loop;
  		}
  	};

  	BreakStatement.prototype.transpile = function transpile ( code ) {
  		if ( this.loop && this.loop.shouldRewriteAsFunction ) {
  			if ( this.label ) throw new CompileError( this, 'Labels are not currently supported in a loop with locally-scoped variables' );
  			code.overwrite( this.start, this.start + 5, "return 'break'" );
  		}
  	};

  	return BreakStatement;
  }(Node));

  var CallExpression = (function (Node) {
  	function CallExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) CallExpression.__proto__ = Node;
  	CallExpression.prototype = Object.create( Node && Node.prototype );
  	CallExpression.prototype.constructor = CallExpression;

  	CallExpression.prototype.initialise = function initialise ( transforms ) {
  		var this$1 = this;

  		if ( transforms.spreadRest && this.arguments.length > 1 ) {
  			var lexicalBoundary = this.findLexicalBoundary();

  			var i = this.arguments.length;
  			while ( i-- ) {
  				var arg = this$1.arguments[i];
  				if ( arg.type === 'SpreadElement' && isArguments( arg.argument ) ) {
  					this$1.argumentsArrayAlias = lexicalBoundary.getArgumentsArrayAlias();
  				}
  			}
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	CallExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.spreadRest && this.arguments.length ) {
  			var hasSpreadElements = false;
  			var context;

  			var firstArgument = this.arguments[0];

  			if ( this.arguments.length === 1 ) {
  				if ( firstArgument.type === 'SpreadElement' ) {
  					code.remove( firstArgument.start, firstArgument.argument.start );
  					hasSpreadElements = true;
  				}
  			} else {
  				hasSpreadElements = spread( code, this.arguments, firstArgument.start, this.argumentsArrayAlias );
  			}

  			if ( hasSpreadElements ) {

  				// we need to handle super() and super.method() differently
  				// due to its instance
  				var _super = null;
  				if ( this.callee.type === 'Super' ) {
  					_super = this.callee;
  				}
  				else if ( this.callee.type === 'MemberExpression' && this.callee.object.type === 'Super' ) {
  					_super = this.callee.object;
  				}

  				if ( !_super && this.callee.type === 'MemberExpression' ) {
  					if ( this.callee.object.type === 'Identifier' ) {
  						context = this.callee.object.name;
  					} else {
  						context = this.findScope( true ).createIdentifier( 'ref' );
  						var callExpression = this.callee.object;
  						var enclosure = callExpression.findNearest( /Function/ );
  						var block = enclosure ? enclosure.body.body
  							: callExpression.findNearest( /^Program$/ ).body;
  						var lastStatementInBlock = block[ block.length - 1 ];
  						var i0 = lastStatementInBlock.getIndentation();
  						code.insertRight( callExpression.start, ("(" + context + " = ") );
  						code.insertLeft( callExpression.end, ")" );
  						code.insertLeft( lastStatementInBlock.end, ("\n" + i0 + "var " + context + ";") );
  					}
  				} else {
  					context = 'void 0';
  				}

  				code.insertLeft( this.callee.end, '.apply' );

  				if ( _super ) {
  					_super.noCall = true; // bit hacky...

  					if ( this.arguments.length > 1 ) {
  						if ( firstArgument.type !== 'SpreadElement' ) {
  							code.insertRight( firstArgument.start, "[ " );
  						}

  						code.insertLeft( this.arguments[ this.arguments.length - 1 ].end, ' )' );
  					}
  				}

  				else if ( this.arguments.length === 1 ) {
  					code.insertRight( firstArgument.start, (context + ", ") );
  				} else {
  					if ( firstArgument.type === 'SpreadElement' ) {
  						code.insertLeft( firstArgument.start, (context + ", ") );
  					} else {
  						code.insertLeft( firstArgument.start, (context + ", [ ") );
  					}

  					code.insertLeft( this.arguments[ this.arguments.length - 1 ].end, ' )' );
  				}
  			}
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return CallExpression;
  }(Node));

  function findIndex ( array, fn ) {
  	for ( var i = 0; i < array.length; i += 1 ) {
  		if ( fn( array[i], i ) ) return i;
  	}

  	return -1;
  }

  var reserved = Object.create( null );
  'do if in for let new try var case else enum eval null this true void with await break catch class const false super throw while yield delete export import public return static switch typeof default extends finally package private continue debugger function arguments interface protected implements instanceof'.split( ' ' )
  	.forEach( function ( word ) { return reserved[ word ] = true; } );

  // TODO this code is pretty wild, tidy it up
  var ClassBody = (function (Node) {
  	function ClassBody () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ClassBody.__proto__ = Node;
  	ClassBody.prototype = Object.create( Node && Node.prototype );
  	ClassBody.prototype.constructor = ClassBody;

  	ClassBody.prototype.transpile = function transpile ( code, transforms, inFunctionExpression, superName ) {
  		var this$1 = this;

  		if ( transforms.classes ) {
  			var name = this.parent.name;

  			var indentStr = code.getIndentString();
  			var i0 = this.getIndentation() + ( inFunctionExpression ? indentStr : '' );
  			var i1 = i0 + indentStr;

  			var constructorIndex = findIndex( this.body, function ( node ) { return node.kind === 'constructor'; } );
  			var constructor = this.body[ constructorIndex ];

  			var introBlock = '';
  			var outroBlock = '';

  			if ( this.body.length ) {
  				code.remove( this.start, this.body[0].start );
  				code.remove( this.body[ this.body.length - 1 ].end, this.end );
  			} else {
  				code.remove( this.start, this.end );
  			}

  			if ( constructor ) {
  				constructor.value.body.isConstructorBody = true;

  				var previousMethod = this.body[ constructorIndex - 1 ];
  				var nextMethod = this.body[ constructorIndex + 1 ];

  				// ensure constructor is first
  				if ( constructorIndex > 0 ) {
  					code.remove( previousMethod.end, constructor.start );
  					code.move( constructor.start, nextMethod ? nextMethod.start : this.end - 1, this.body[0].start );
  				}

  				if ( !inFunctionExpression ) code.insertLeft( constructor.end, ';' );
  			}

  			var namedFunctions = this.program.options.namedFunctionExpressions !== false;
  			var namedConstructor = namedFunctions || this.parent.superClass || this.parent.type !== 'ClassDeclaration';
  			if ( this.parent.superClass ) {
  				var inheritanceBlock = "if ( " + superName + " ) " + name + ".__proto__ = " + superName + ";\n" + i0 + name + ".prototype = Object.create( " + superName + " && " + superName + ".prototype );\n" + i0 + name + ".prototype.constructor = " + name + ";";

  				if ( constructor ) {
  					introBlock += "\n\n" + i0 + inheritanceBlock;
  				} else {
  					var fn = "function " + name + " () {" + ( superName ?
  						("\n" + i1 + superName + ".apply(this, arguments);\n" + i0 + "}") :
  						"}" ) + ( inFunctionExpression ? '' : ';' ) + ( this.body.length ? ("\n\n" + i0) : '' );

  					inheritanceBlock = fn + inheritanceBlock;
  					introBlock += inheritanceBlock + "\n\n" + i0;
  				}
  			} else if ( !constructor ) {
  				var fn$1 = 'function ' + (namedConstructor ? name + ' ' : '') + '() {}';
  				if ( this.parent.type === 'ClassDeclaration' ) fn$1 += ';';
  				if ( this.body.length ) fn$1 += "\n\n" + i0;

  				introBlock += fn$1;
  			}

  			var scope = this.findScope( false );

  			var prototypeGettersAndSetters = [];
  			var staticGettersAndSetters = [];
  			var prototypeAccessors;
  			var staticAccessors;

  			this.body.forEach( function ( method, i ) {
  				if ( method.kind === 'constructor' ) {
  					var constructorName = namedConstructor ? ' ' + name : '';
  					code.overwrite( method.key.start, method.key.end, ("function" + constructorName) );
  					return;
  				}

  				if ( method.static ) {
  					var len = code.original[ method.start + 6 ] == ' ' ? 7 : 6;
  					code.remove( method.start, method.start + len );
  				}

  				var isAccessor = method.kind !== 'method';
  				var lhs;

  				var methodName = method.key.name;
  				if ( reserved[ methodName ] || method.value.body.scope.references[methodName] ) {
  					methodName = scope.createIdentifier( methodName );
  				}

  				// when method name is a string or a number let's pretend it's a computed method

  				var fake_computed = false;
  				if ( ! method.computed && method.key.type === 'Literal' ) {
  					fake_computed = true;
  					method.computed = true;
  				}

  				if ( isAccessor ) {
  					if ( method.computed ) {
  						throw new Error( 'Computed accessor properties are not currently supported' );
  					}

  					code.remove( method.start, method.key.start );

  					if ( method.static ) {
  						if ( !~staticGettersAndSetters.indexOf( method.key.name ) ) staticGettersAndSetters.push( method.key.name );
  						if ( !staticAccessors ) staticAccessors = scope.createIdentifier( 'staticAccessors' );

  						lhs = "" + staticAccessors;
  					} else {
  						if ( !~prototypeGettersAndSetters.indexOf( method.key.name ) ) prototypeGettersAndSetters.push( method.key.name );
  						if ( !prototypeAccessors ) prototypeAccessors = scope.createIdentifier( 'prototypeAccessors' );

  						lhs = "" + prototypeAccessors;
  					}
  				} else {
  					lhs = method.static ?
  						("" + name) :
  						(name + ".prototype");
  				}

  				if ( !method.computed ) lhs += '.';

  				var insertNewlines = ( constructorIndex > 0 && i === constructorIndex + 1 ) ||
  				                       ( i === 0 && constructorIndex === this$1.body.length - 1 );

  				if ( insertNewlines ) lhs = "\n\n" + i0 + lhs;

  				var c = method.key.end;
  				if ( method.computed ) {
  					if ( fake_computed ) {
  						code.insertRight( method.key.start, '[' );
  						code.insertLeft( method.key.end, ']' );
  					} else {
  						while ( code.original[c] !== ']' ) c += 1;
  						c += 1;
  					}
  				}

  				code.insertRight( method.start, lhs );

  				var funcName = method.computed || isAccessor || !namedFunctions ? '' : (methodName + " ");
  				var rhs = ( isAccessor ? ("." + (method.kind)) : '' ) + " = function" + ( method.value.generator ? '* ' : ' ' ) + funcName;
  				code.remove( c, method.value.start );
  				code.insertRight( method.value.start, rhs );
  				code.insertLeft( method.end, ';' );

  				if ( method.value.generator ) code.remove( method.start, method.key.start );
  			});

  			if ( prototypeGettersAndSetters.length || staticGettersAndSetters.length ) {
  				var intro = [];
  				var outro = [];

  				if ( prototypeGettersAndSetters.length ) {
  					intro.push( ("var " + prototypeAccessors + " = { " + (prototypeGettersAndSetters.map( function ( name ) { return (name + ": {}"); } ).join( ',' )) + " };") );
  					outro.push( ("Object.defineProperties( " + name + ".prototype, " + prototypeAccessors + " );") );
  				}

  				if ( staticGettersAndSetters.length ) {
  					intro.push( ("var " + staticAccessors + " = { " + (staticGettersAndSetters.map( function ( name ) { return (name + ": {}"); } ).join( ',' )) + " };") );
  					outro.push( ("Object.defineProperties( " + name + ", " + staticAccessors + " );") );
  				}

  				if ( constructor ) introBlock += "\n\n" + i0;
  				introBlock += intro.join( ("\n" + i0) );
  				if ( !constructor ) introBlock += "\n\n" + i0;

  				outroBlock += "\n\n" + i0 + outro.join( ("\n" + i0) );
  			}

  			if ( constructor ) {
  				code.insertLeft( constructor.end, introBlock );
  			} else {
  				code.insertRight( this.start, introBlock );
  			}

  			code.insertLeft( this.end, outroBlock );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return ClassBody;
  }(Node));

  // TODO this function is slightly flawed – it works on the original string,
  // not its current edited state.
  // That's not a problem for the way that it's currently used, but it could
  // be in future...
  function deindent ( node, code ) {
  	var start = node.start;
  	var end = node.end;

  	var indentStr = code.getIndentString();
  	var indentStrLen = indentStr.length;
  	var indentStart = start - indentStrLen;

  	if ( !node.program.indentExclusions[ indentStart ]
  	&& code.original.slice( indentStart, start ) === indentStr ) {
  		code.remove( indentStart, start );
  	}

  	var pattern = new RegExp( indentStr + '\\S', 'g' );
  	var slice = code.original.slice( start, end );
  	var match;

  	while ( match = pattern.exec( slice ) ) {
  		var removeStart = start + match.index;
  		if ( !node.program.indentExclusions[ removeStart ] ) {
  			code.remove( removeStart, removeStart + indentStrLen );
  		}
  	}
  }

  var ClassDeclaration = (function (Node) {
  	function ClassDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ClassDeclaration.__proto__ = Node;
  	ClassDeclaration.prototype = Object.create( Node && Node.prototype );
  	ClassDeclaration.prototype.constructor = ClassDeclaration;

  	ClassDeclaration.prototype.initialise = function initialise ( transforms ) {
  		this.name = this.id.name;
  		this.findScope( true ).addDeclaration( this.id, 'class' );

  		Node.prototype.initialise.call( this, transforms );
  	};

  	ClassDeclaration.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.classes ) {
  			if ( !this.superClass ) deindent( this.body, code );

  			var superName = this.superClass && ( this.superClass.name || 'superclass' );

  			var i0 = this.getIndentation();
  			var i1 = i0 + code.getIndentString();

  			// if this is an export default statement, we have to move the export to
  			// after the declaration, because `export default var Foo = ...` is illegal
  			var syntheticDefaultExport = this.parent.type === 'ExportDefaultDeclaration' ?
  				("\n\n" + i0 + "export default " + (this.id.name) + ";") :
  				'';

  			if ( syntheticDefaultExport ) code.remove( this.parent.start, this.start );

  			code.overwrite( this.start, this.id.start, 'var ' );

  			if ( this.superClass ) {
  				if ( this.superClass.end === this.body.start ) {
  					code.remove( this.id.end, this.superClass.start );
  					code.insertLeft( this.id.end, (" = (function (" + superName + ") {\n" + i1) );
  				} else {
  					code.overwrite( this.id.end, this.superClass.start, ' = ' );
  					code.overwrite( this.superClass.end, this.body.start, ("(function (" + superName + ") {\n" + i1) );
  				}
  			} else {
  				if ( this.id.end === this.body.start ) {
  					code.insertLeft( this.id.end, ' = ' );
  				} else {
  					code.overwrite( this.id.end, this.body.start, ' = ' );
  				}
  			}

  			this.body.transpile( code, transforms, !!this.superClass, superName );

  			if ( this.superClass ) {
  				code.insertLeft( this.end, ("\n\n" + i1 + "return " + (this.name) + ";\n" + i0 + "}(") );
  				code.move( this.superClass.start, this.superClass.end, this.end );
  				code.insertRight( this.end, ("));" + syntheticDefaultExport) );
  			} else if ( syntheticDefaultExport ) {
  				code.insertRight( this.end, syntheticDefaultExport );
  			}
  		}

  		else {
  			this.body.transpile( code, transforms, false, null );
  		}
  	};

  	return ClassDeclaration;
  }(Node));

  var ClassExpression = (function (Node) {
  	function ClassExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ClassExpression.__proto__ = Node;
  	ClassExpression.prototype = Object.create( Node && Node.prototype );
  	ClassExpression.prototype.constructor = ClassExpression;

  	ClassExpression.prototype.initialise = function initialise ( transforms ) {
  		this.name = this.id ? this.id.name :
  		            this.parent.type === 'VariableDeclarator' ? this.parent.id.name :
  		            this.parent.type === 'AssignmentExpression' ? this.parent.left.name :
  		            this.findScope( true ).createIdentifier( 'anonymous' );

  		Node.prototype.initialise.call( this, transforms );
  	};

  	ClassExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.classes ) {
  			var superName = this.superClass && ( this.superClass.name || 'superclass' );

  			var i0 = this.getIndentation();
  			var i1 = i0 + code.getIndentString();

  			if ( this.superClass ) {
  				code.remove( this.start, this.superClass.start );
  				code.remove( this.superClass.end, this.body.start );
  				code.insertLeft( this.start, ("(function (" + superName + ") {\n" + i1) );
  			} else {
  				code.overwrite( this.start, this.body.start, ("(function () {\n" + i1) );
  			}

  			this.body.transpile( code, transforms, true, superName );

  			var outro = "\n\n" + i1 + "return " + (this.name) + ";\n" + i0 + "}(";

  			if ( this.superClass ) {
  				code.insertLeft( this.end, outro );
  				code.move( this.superClass.start, this.superClass.end, this.end );
  				code.insertRight( this.end, '))' );
  			} else {
  				code.insertLeft( this.end, ("\n\n" + i1 + "return " + (this.name) + ";\n" + i0 + "}())") );
  			}
  		}

  		else {
  			this.body.transpile( code, transforms, false );
  		}
  	};

  	return ClassExpression;
  }(Node));

  var ContinueStatement = (function (Node) {
  	function ContinueStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ContinueStatement.__proto__ = Node;
  	ContinueStatement.prototype = Object.create( Node && Node.prototype );
  	ContinueStatement.prototype.constructor = ContinueStatement;

  	ContinueStatement.prototype.transpile = function transpile ( code ) {
  		var loop = this.findNearest( loopStatement );
  		if ( loop.shouldRewriteAsFunction ) {
  			if ( this.label ) throw new CompileError( this, 'Labels are not currently supported in a loop with locally-scoped variables' );
  			code.overwrite( this.start, this.start + 8, 'return' );
  		}
  	};

  	return ContinueStatement;
  }(Node));

  var ExportDefaultDeclaration = (function (Node) {
  	function ExportDefaultDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ExportDefaultDeclaration.__proto__ = Node;
  	ExportDefaultDeclaration.prototype = Object.create( Node && Node.prototype );
  	ExportDefaultDeclaration.prototype.constructor = ExportDefaultDeclaration;

  	ExportDefaultDeclaration.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.moduleExport ) throw new CompileError( this, 'export is not supported' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return ExportDefaultDeclaration;
  }(Node));

  var ExportNamedDeclaration = (function (Node) {
  	function ExportNamedDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ExportNamedDeclaration.__proto__ = Node;
  	ExportNamedDeclaration.prototype = Object.create( Node && Node.prototype );
  	ExportNamedDeclaration.prototype.constructor = ExportNamedDeclaration;

  	ExportNamedDeclaration.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.moduleExport ) throw new CompileError( this, 'export is not supported' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return ExportNamedDeclaration;
  }(Node));

  var LoopStatement = (function (Node) {
  	function LoopStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) LoopStatement.__proto__ = Node;
  	LoopStatement.prototype = Object.create( Node && Node.prototype );
  	LoopStatement.prototype.constructor = LoopStatement;

  	LoopStatement.prototype.findScope = function findScope ( functionScope ) {
  		return functionScope || !this.createdScope ? this.parent.findScope( functionScope ) : this.body.scope;
  	};

  	LoopStatement.prototype.initialise = function initialise ( transforms ) {
  		var this$1 = this;

  		this.body.createScope();
  		this.createdScope = true;

  		// this is populated as and when reassignments occur
  		this.reassigned = Object.create( null );
  		this.aliases = Object.create( null );

  		Node.prototype.initialise.call( this, transforms );

  		if ( transforms.letConst ) {
  			// see if any block-scoped declarations are referenced
  			// inside function expressions
  			var names = Object.keys( this.body.scope.declarations );

  			var i = names.length;
  			while ( i-- ) {
  				var name = names[i];
  				var declaration = this$1.body.scope.declarations[ name ];

  				var j = declaration.instances.length;
  				while ( j-- ) {
  					var instance = declaration.instances[j];
  					var nearestFunctionExpression = instance.findNearest( /Function/ );

  					if ( nearestFunctionExpression && nearestFunctionExpression.depth > this$1.depth ) {
  						this$1.shouldRewriteAsFunction = true;
  						break;
  					}
  				}

  				if ( this$1.shouldRewriteAsFunction ) break;
  			}
  		}
  	};

  	LoopStatement.prototype.transpile = function transpile ( code, transforms ) {
  		var needsBlock = this.type != 'ForOfStatement' && (
  			this.body.type !== 'BlockStatement'
  			|| this.body.type === 'BlockStatement' && this.body.synthetic );

  		if ( this.shouldRewriteAsFunction ) {
  			var i0 = this.getIndentation();
  			var i1 = i0 + code.getIndentString();

  			var argString = this.args ? (" " + (this.args.join( ', ' )) + " ") : '';
  			var paramString = this.params ? (" " + (this.params.join( ', ' )) + " ") : '';

  			var functionScope = this.findScope( true );
  			var loop = functionScope.createIdentifier( 'loop' );

  			var before = "var " + loop + " = function (" + paramString + ") " + ( this.body.synthetic ? ("{\n" + i0 + (code.getIndentString())) : '' );
  			var after = ( this.body.synthetic ? ("\n" + i0 + "}") : '' ) + ";\n\n" + i0;

  			code.insertRight( this.body.start, before );
  			code.insertLeft( this.body.end, after );
  			code.move( this.start, this.body.start, this.body.end );

  			if ( this.canBreak || this.canReturn ) {
  				var returned = functionScope.createIdentifier( 'returned' );

  				var insert = "{\n" + i1 + "var " + returned + " = " + loop + "(" + argString + ");\n";
  				if ( this.canBreak ) insert += "\n" + i1 + "if ( " + returned + " === 'break' ) break;";
  				if ( this.canReturn ) insert += "\n" + i1 + "if ( " + returned + " ) return " + returned + ".v;";
  				insert += "\n" + i0 + "}";

  				code.insertRight( this.body.end, insert );
  			} else {
  				var callExpression = loop + "(" + argString + ");";

  				if ( this.type === 'DoWhileStatement' ) {
  					code.overwrite( this.start, this.body.start, ("do {\n" + i1 + callExpression + "\n" + i0 + "}") );
  				} else {
  					code.insertRight( this.body.end, callExpression );
  				}
  			}
  		} else if ( needsBlock ) {
  			code.insertLeft( this.body.start, '{ ' );
  			code.insertRight( this.body.end, ' }' );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return LoopStatement;
  }(Node));

  function extractNames ( node ) {
  	var names = [];
  	extractors[ node.type ]( names, node );
  	return names;
  }

  var extractors = {
  	Identifier: function Identifier ( names, node ) {
  		names.push( node );
  	},

  	ObjectPattern: function ObjectPattern ( names, node ) {
  		for ( var i = 0, list = node.properties; i < list.length; i += 1 ) {
  			var prop = list[i];

  			extractors[ prop.value.type ]( names, prop.value );
  		}
  	},

  	ArrayPattern: function ArrayPattern ( names, node ) {
  		for ( var i = 0, list = node.elements; i < list.length; i += 1 )  {
  			var element = list[i];

  			if ( element ) extractors[ element.type ]( names, element );
  		}
  	},

  	RestElement: function RestElement ( names, node ) {
  		extractors[ node.argument.type ]( names, node.argument );
  	},

  	AssignmentPattern: function AssignmentPattern ( names, node ) {
  		extractors[ node.left.type ]( names, node.left );
  	}
  };

  var ForStatement = (function (LoopStatement) {
  	function ForStatement () {
  		LoopStatement.apply(this, arguments);
  	}

  	if ( LoopStatement ) ForStatement.__proto__ = LoopStatement;
  	ForStatement.prototype = Object.create( LoopStatement && LoopStatement.prototype );
  	ForStatement.prototype.constructor = ForStatement;

  	ForStatement.prototype.findScope = function findScope ( functionScope ) {
  		return functionScope || !this.createdScope ? this.parent.findScope( functionScope ) : this.body.scope;
  	};

  	ForStatement.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		var i1 = this.getIndentation() + code.getIndentString();

  		if ( this.shouldRewriteAsFunction ) {
  			// which variables are declared in the init statement?
  			var names = this.init.type === 'VariableDeclaration' ?
  				[].concat.apply( [], this.init.declarations.map( function ( declarator ) { return extractNames( declarator.id ); } ) ) :
  				[];

  			var aliases = this.aliases;

  			this.args = names.map( function ( name ) { return name in this$1.aliases ? this$1.aliases[ name ].outer : name; } );
  			this.params = names.map( function ( name ) { return name in this$1.aliases ? this$1.aliases[ name ].inner : name; } );

  			var updates = Object.keys( this.reassigned )
  				.map( function ( name ) { return ((aliases[ name ].outer) + " = " + (aliases[ name ].inner) + ";"); } );

  			if ( updates.length ) {
  				if ( this.body.synthetic ) {
  					code.insertLeft( this.body.body[0].end, ("; " + (updates.join(" "))) );
  				} else {
  					var lastStatement = this.body.body[ this.body.body.length - 1 ];
  					code.insertLeft( lastStatement.end, ("\n\n" + i1 + (updates.join(("\n" + i1)))) );
  				}
  			}
  		}

  		LoopStatement.prototype.transpile.call( this, code, transforms );
  	};

  	return ForStatement;
  }(LoopStatement));

  var ForInStatement = (function (LoopStatement) {
  	function ForInStatement () {
  		LoopStatement.apply(this, arguments);
  	}

  	if ( LoopStatement ) ForInStatement.__proto__ = LoopStatement;
  	ForInStatement.prototype = Object.create( LoopStatement && LoopStatement.prototype );
  	ForInStatement.prototype.constructor = ForInStatement;

  	ForInStatement.prototype.findScope = function findScope ( functionScope ) {
  		return functionScope || !this.createdScope ? this.parent.findScope( functionScope ) : this.body.scope;
  	};

  	ForInStatement.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		if ( this.shouldRewriteAsFunction ) {
  			// which variables are declared in the init statement?
  			var names = this.left.type === 'VariableDeclaration' ?
  				[].concat.apply( [], this.left.declarations.map( function ( declarator ) { return extractNames( declarator.id ); } ) ) :
  				[];

  			this.args = names.map( function ( name ) { return name in this$1.aliases ? this$1.aliases[ name ].outer : name; } );
  			this.params = names.map( function ( name ) { return name in this$1.aliases ? this$1.aliases[ name ].inner : name; } );
  		}

  		LoopStatement.prototype.transpile.call( this, code, transforms );
  	};

  	return ForInStatement;
  }(LoopStatement));

  var handlers = {
  	Identifier: destructureIdentifier,
  	AssignmentPattern: destructureAssignmentPattern,
  	ArrayPattern: destructureArrayPattern,
  	ObjectPattern: destructureObjectPattern
  };

  function destructure ( code, scope, node, ref, inline, statementGenerators ) {
  	handlers[ node.type ]( code, scope, node, ref, inline, statementGenerators );
  }

  function destructureIdentifier ( code, scope, node, ref, inline, statementGenerators ) {
  	statementGenerators.push( function ( start, prefix, suffix ) {
  		code.insertRight( node.start, inline ? prefix : (prefix + "var ") );
  		code.insertLeft( node.end, (" = " + ref + suffix) );
  		code.move( node.start, node.end, start );
  	});
  }

  function destructureAssignmentPattern ( code, scope, node, ref, inline, statementGenerators ) {
  	var isIdentifier = node.left.type === 'Identifier';
  	var name = isIdentifier ? node.left.name : ref;

  	if ( !inline ) {
  		statementGenerators.push( function ( start, prefix, suffix ) {
  			code.insertRight( node.left.end, (prefix + "if ( " + name + " === void 0 ) " + name) );
  			code.move( node.left.end, node.right.end, start );
  			code.insertLeft( node.right.end, suffix );
  		});
  	}

  	if ( !isIdentifier ) {
  		destructure( code, scope, node.left, ref, inline, statementGenerators );
  	}
  }

  function destructureArrayPattern ( code, scope, node, ref, inline, statementGenerators ) {
  	var c = node.start;

  	node.elements.forEach( function ( element, i ) {
  		if ( !element ) return;

  		if ( element.type === 'RestElement' ) {
  			handleProperty( code, scope, c, element.argument, (ref + ".slice(" + i + ")"), inline, statementGenerators );
  		} else {
  			handleProperty( code, scope, c, element, (ref + "[" + i + "]"), inline, statementGenerators );
  		}
  		c = element.end;
  	});

  	code.remove( c, node.end );
  }

  function destructureObjectPattern ( code, scope, node, ref, inline, statementGenerators ) {
  	var c = node.start;

  	node.properties.forEach( function ( prop ) {
  		var value = prop.computed || prop.key.type !== 'Identifier' ? (ref + "[" + (code.slice(prop.key.start, prop.key.end)) + "]") : (ref + "." + (prop.key.name));
  		handleProperty( code, scope, c, prop.value, value, inline, statementGenerators );
  		c = prop.end;
  	});

  	code.remove( c, node.end );
  }

  function handleProperty ( code, scope, c, node, value, inline, statementGenerators ) {
  	switch ( node.type ) {
  		case 'Identifier': {
  			code.remove( c, node.start );
  			destructureIdentifier( code, scope, node, value, inline, statementGenerators );
  			break;
  		}

  		case 'AssignmentPattern': {
  			var name;

  			var isIdentifier = node.left.type === 'Identifier';

  			if ( isIdentifier ) {
  				name = node.left.name;
  				var declaration = scope.findDeclaration( name );
  				if ( declaration ) name = declaration.name;
  			} else {
  				name = scope.createIdentifier( value );
  			}

  			statementGenerators.push( function ( start, prefix, suffix ) {
  				if ( inline ) {
  					code.insertRight( node.right.start, (name + " = " + value + " === undefined ? ") );
  					code.insertLeft( node.right.end, (" : " + value) );
  				} else {
  					code.insertRight( node.right.start, (prefix + "var " + name + " = " + value + "; if ( " + name + " === void 0 ) " + name + " = ") );
  					code.insertLeft( node.right.end, suffix );
  				}

  				code.move( node.right.start, node.right.end, start );
  			});

  			if ( isIdentifier ) {
  				code.remove( c, node.right.start );
  			} else {
  				code.remove( c, node.left.start );
  				code.remove( node.left.end, node.right.start );
  				handleProperty( code, scope, c, node.left, name, inline, statementGenerators );
  			}

  			break;
  		}

  		case 'ObjectPattern': {
  			code.remove( c, c = node.start );

  			if ( node.properties.length > 1 ) {
  				var ref = scope.createIdentifier( value );

  				statementGenerators.push( function ( start, prefix, suffix ) {
  					// this feels a tiny bit hacky, but we can't do a
  					// straightforward insertLeft and keep correct order...
  					code.insertRight( node.start, (prefix + "var " + ref + " = ") );
  					code.overwrite( node.start, c = node.start + 1, value );
  					code.insertLeft( c, suffix );

  					code.move( node.start, c, start );
  				});

  				node.properties.forEach( function ( prop ) {
  					var value = prop.computed || prop.key.type !== 'Identifier' ? (ref + "[" + (code.slice(prop.key.start, prop.key.end)) + "]") : (ref + "." + (prop.key.name));
  					handleProperty( code, scope, c, prop.value, value, inline, statementGenerators );
  					c = prop.end;
  				});
  			} else {
  				var prop = node.properties[0];
  				var value_suffix = prop.computed || prop.key.type !== 'Identifier' ? ("[" + (code.slice(prop.key.start, prop.key.end)) + "]") : ("." + (prop.key.name));
  				handleProperty( code, scope, c, prop.value, ("" + value + value_suffix), inline, statementGenerators );
  				c = prop.end;
  			}

  			code.remove( c, node.end );
  			break;
  		}

  		case 'ArrayPattern': {
  			code.remove( c, c = node.start );

  			if ( node.elements.filter( Boolean ).length > 1 ) {
  				var ref$1 = scope.createIdentifier( value );

  				statementGenerators.push( function ( start, prefix, suffix ) {
  					code.insertRight( node.start, (prefix + "var " + ref$1 + " = ") );
  					code.overwrite( node.start, c = node.start + 1, value );
  					code.insertLeft( c, suffix );

  					code.move( node.start, c, start );
  				});

  				node.elements.forEach( function ( element, i ) {
  					if ( !element ) return;

  					if ( element.type === 'RestElement' ) {
  						handleProperty( code, scope, c, element.argument, (ref$1 + ".slice(" + i + ")"), inline, statementGenerators );
  					} else {
  						handleProperty( code, scope, c, element, (ref$1 + "[" + i + "]"), inline, statementGenerators );
  					}
  					c = element.end;
  				});
  			} else {
  				var index = findIndex( node.elements, Boolean );
  				var element = node.elements[ index ];
  				if ( element.type === 'RestElement' ) {
  					handleProperty( code, scope, c, element.argument, (value + ".slice(" + index + ")"), inline, statementGenerators );
  				} else {
  					handleProperty( code, scope, c, element, (value + "[" + index + "]"), inline, statementGenerators );
  				}
  				c = element.end;
  			}

  			code.remove( c, node.end );
  			break;
  		}

  		default: {
  			throw new Error( ("Unexpected node type in destructuring (" + (node.type) + ")") );
  		}
  	}
  }

  var ForOfStatement = (function (LoopStatement) {
  	function ForOfStatement () {
  		LoopStatement.apply(this, arguments);
  	}

  	if ( LoopStatement ) ForOfStatement.__proto__ = LoopStatement;
  	ForOfStatement.prototype = Object.create( LoopStatement && LoopStatement.prototype );
  	ForOfStatement.prototype.constructor = ForOfStatement;

  	ForOfStatement.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.forOf && !transforms.dangerousForOf ) throw new CompileError( this, 'for...of statements are not supported. Use `transforms: { forOf: false }` to skip transformation and disable this error, or `transforms: { dangerousForOf: true }` if you know what you\'re doing' );
  		LoopStatement.prototype.initialise.call( this, transforms );
  	};

  	ForOfStatement.prototype.transpile = function transpile ( code, transforms ) {
  		if ( !transforms.dangerousForOf ) {
  			LoopStatement.prototype.transpile.call( this, code, transforms );
  			return;
  		}

  		// edge case (#80)
  		if ( !this.body.body[0] ) {
  			if ( this.left.type === 'VariableDeclaration' && this.left.kind === 'var' ) {
  				code.remove( this.start, this.left.start );
  				code.insertLeft( this.left.end, ';' );
  				code.remove( this.left.end, this.end );
  			} else {
  				code.remove( this.start, this.end );
  			}

  			return;
  		}

  		var scope = this.findScope( true );
  		var i0 = this.getIndentation();
  		var i1 = i0 + code.getIndentString();

  		var key = scope.createIdentifier( 'i' );
  		var list = scope.createIdentifier( 'list' );

  		if ( this.body.synthetic ) {
  			code.insertRight( this.left.start, ("{\n" + i1) );
  			code.insertLeft( this.body.body[0].end, ("\n" + i0 + "}") );
  		}

  		var bodyStart = this.body.body[0].start;

  		code.remove( this.left.end, this.right.start );
  		code.move( this.left.start, this.left.end, bodyStart );


  		code.insertRight( this.right.start, ("var " + key + " = 0, " + list + " = ") );
  		code.insertLeft( this.right.end, ("; " + key + " < " + list + ".length; " + key + " += 1") );

  		// destructuring. TODO non declaration destructuring
  		var declarator = this.left.type === 'VariableDeclaration' && this.left.declarations[0];
  		if ( declarator && declarator.id.type !== 'Identifier' ) {
  			var statementGenerators = [];
  			var ref = scope.createIdentifier( 'ref' );
  			destructure( code, scope, declarator.id, ref, false, statementGenerators );

  			var suffix = ";\n" + i1;
  			statementGenerators.forEach( function ( fn, i ) {
  				if ( i === statementGenerators.length - 1 ) {
  					suffix = ";\n\n" + i1;
  				}

  				fn( bodyStart, '', suffix );
  			});

  			code.insertLeft( this.left.start + this.left.kind.length + 1, ref );
  			code.insertLeft( this.left.end, (" = " + list + "[" + key + "];\n" + i1) );
  		} else {
  			code.insertLeft( this.left.end, (" = " + list + "[" + key + "];\n\n" + i1) );
  		}

  		LoopStatement.prototype.transpile.call( this, code, transforms );
  	};

  	return ForOfStatement;
  }(LoopStatement));

  var FunctionDeclaration = (function (Node) {
  	function FunctionDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) FunctionDeclaration.__proto__ = Node;
  	FunctionDeclaration.prototype = Object.create( Node && Node.prototype );
  	FunctionDeclaration.prototype.constructor = FunctionDeclaration;

  	FunctionDeclaration.prototype.initialise = function initialise ( transforms ) {
  		if ( this.generator && transforms.generator ) {
  			throw new CompileError( this, 'Generators are not supported' );
  		}

  		this.body.createScope();

  		this.findScope( true ).addDeclaration( this.id, 'function' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return FunctionDeclaration;
  }(Node));

  var FunctionExpression = (function (Node) {
  	function FunctionExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) FunctionExpression.__proto__ = Node;
  	FunctionExpression.prototype = Object.create( Node && Node.prototype );
  	FunctionExpression.prototype.constructor = FunctionExpression;

  	FunctionExpression.prototype.initialise = function initialise ( transforms ) {
  		if ( this.generator && transforms.generator ) {
  			throw new CompileError( this, 'Generators are not supported' );
  		}

  		this.body.createScope();

  		if ( this.id ) {
  			// function expression IDs belong to the child scope...
  			this.body.scope.addDeclaration( this.id, 'function' );
  		}

  		Node.prototype.initialise.call( this, transforms );

  		var parent = this.parent;
  		var methodName;

  		if ( transforms.conciseMethodProperty
  				&& parent.type === 'Property'
  				&& parent.kind === 'init'
  				&& parent.method
  				&& parent.key.type === 'Identifier' ) {
  			// object literal concise method
  			methodName = parent.key.name;
  		}
  		else if ( transforms.classes
  				&& parent.type === 'MethodDefinition'
  				&& parent.kind === 'method'
  				&& parent.key.type === 'Identifier' ) {
  			// method definition in a class
  			methodName = parent.key.name;
  		}
  		else if ( this.id && this.id.type === 'Identifier' ) {
  			// naked function expression
  			methodName = this.id.alias || this.id.name;
  		}

  		if ( methodName ) {
  			for ( var i = 0, list = this.params; i < list.length; i += 1 ) {
  				var param = list[i];

  				if ( param.type === 'Identifier' && methodName === param.name ) {
  					// workaround for Safari 9/WebKit bug:
  					// https://gitlab.com/Rich-Harris/buble/issues/154
  					// change parameter name when same as method name

  					var scope = this.body.scope;
  					var declaration = scope.declarations[ methodName ];

  					var alias = scope.createIdentifier( methodName );
  					param.alias = alias;

  					for ( var i$1 = 0, list$1 = declaration.instances; i$1 < list$1.length; i$1 += 1 ) {
  						var identifier = list$1[i$1];

  						identifier.alias = alias;
  					}

  					break;
  				}
  			}
  		}
  	};

  	return FunctionExpression;
  }(Node));

  function isReference ( node, parent ) {
  	if ( node.type === 'MemberExpression' ) {
  		return !node.computed && isReference( node.object, node );
  	}

  	if ( node.type === 'Identifier' ) {
  		// the only time we could have an identifier node without a parent is
  		// if it's the entire body of a function without a block statement –
  		// i.e. an arrow function expression like `a => a`
  		if ( !parent ) return true;

  		if ( /(Function|Class)Expression/.test( parent.type ) ) return false;

  		if ( parent.type === 'VariableDeclarator' ) return node === parent.init;

  		// TODO is this right?
  		if ( parent.type === 'MemberExpression' || parent.type === 'MethodDefinition' ) {
  			return parent.computed || node === parent.object;
  		}

  		if ( parent.type === 'ArrayPattern' ) return false;

  		// disregard the `bar` in `{ bar: foo }`, but keep it in `{ [bar]: foo }`
  		if ( parent.type === 'Property' ) {
  			if ( parent.parent.type === 'ObjectPattern' ) return false;
  			return parent.computed || node === parent.value;
  		}

  		// disregard the `bar` in `class Foo { bar () {...} }`
  		if ( parent.type === 'MethodDefinition' ) return false;

  		// disregard the `bar` in `export { foo as bar }`
  		if ( parent.type === 'ExportSpecifier' && node !== parent.local ) return false;

  		return true;
  	}
  }

  var Identifier = (function (Node) {
  	function Identifier () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) Identifier.__proto__ = Node;
  	Identifier.prototype = Object.create( Node && Node.prototype );
  	Identifier.prototype.constructor = Identifier;

  	Identifier.prototype.findScope = function findScope ( functionScope ) {
  		if ( this.parent.params && ~this.parent.params.indexOf( this ) ) {
  			return this.parent.body.scope;
  		}

  		if ( this.parent.type === 'FunctionExpression' && this === this.parent.id ) {
  			return this.parent.body.scope;
  		}

  		return this.parent.findScope( functionScope	);
  	};

  	Identifier.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.arrow && isReference( this, this.parent ) ) {
  			if ( this.name === 'arguments' && !this.findScope( false ).contains( this.name ) ) {
  				var lexicalBoundary = this.findLexicalBoundary();
  				var arrowFunction = this.findNearest( 'ArrowFunctionExpression' );
  				var loop = this.findNearest( loopStatement );

  				if ( arrowFunction && arrowFunction.depth > lexicalBoundary.depth ) {
  					this.alias = lexicalBoundary.getArgumentsAlias();
  				}

  				if ( loop && loop.body.contains( this ) && loop.depth > lexicalBoundary.depth ) {
  					this.alias = lexicalBoundary.getArgumentsAlias();
  				}
  			}

  			this.findScope( false ).addReference( this );
  		}
  	};

  	Identifier.prototype.transpile = function transpile ( code ) {
  		if ( this.alias ) {
  			code.overwrite( this.start, this.end, this.alias, true );
  		}
  	};

  	return Identifier;
  }(Node));

  var IfStatement = (function (Node) {
  	function IfStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) IfStatement.__proto__ = Node;
  	IfStatement.prototype = Object.create( Node && Node.prototype );
  	IfStatement.prototype.constructor = IfStatement;

  	IfStatement.prototype.initialise = function initialise ( transforms ) {
  		Node.prototype.initialise.call( this, transforms );
  	};

  	IfStatement.prototype.transpile = function transpile ( code, transforms ) {
  		if ( this.consequent.type !== 'BlockStatement'
  				|| this.consequent.type === 'BlockStatement' && this.consequent.synthetic ) {
  			code.insertLeft( this.consequent.start, '{ ' );
  			code.insertRight( this.consequent.end, ' }' );
  		}

  		if ( this.alternate && this.alternate.type !== 'IfStatement' && (
  				this.alternate.type !== 'BlockStatement'
  				|| this.alternate.type === 'BlockStatement' && this.alternate.synthetic ) ) {
  			code.insertLeft( this.alternate.start, '{ ' );
  			code.insertRight( this.alternate.end, ' }' );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return IfStatement;
  }(Node));

  var ImportDeclaration = (function (Node) {
  	function ImportDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ImportDeclaration.__proto__ = Node;
  	ImportDeclaration.prototype = Object.create( Node && Node.prototype );
  	ImportDeclaration.prototype.constructor = ImportDeclaration;

  	ImportDeclaration.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.moduleImport ) throw new CompileError( this, 'import is not supported' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return ImportDeclaration;
  }(Node));

  var ImportDefaultSpecifier = (function (Node) {
  	function ImportDefaultSpecifier () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ImportDefaultSpecifier.__proto__ = Node;
  	ImportDefaultSpecifier.prototype = Object.create( Node && Node.prototype );
  	ImportDefaultSpecifier.prototype.constructor = ImportDefaultSpecifier;

  	ImportDefaultSpecifier.prototype.initialise = function initialise ( transforms ) {
  		this.findScope( true ).addDeclaration( this.local, 'import' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return ImportDefaultSpecifier;
  }(Node));

  var ImportSpecifier = (function (Node) {
  	function ImportSpecifier () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ImportSpecifier.__proto__ = Node;
  	ImportSpecifier.prototype = Object.create( Node && Node.prototype );
  	ImportSpecifier.prototype.constructor = ImportSpecifier;

  	ImportSpecifier.prototype.initialise = function initialise ( transforms ) {
  		this.findScope( true ).addDeclaration( this.local, 'import' );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	return ImportSpecifier;
  }(Node));

  var IS_DATA_ATTRIBUTE = /-/;

  var JSXAttribute = (function (Node) {
  	function JSXAttribute () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXAttribute.__proto__ = Node;
  	JSXAttribute.prototype = Object.create( Node && Node.prototype );
  	JSXAttribute.prototype.constructor = JSXAttribute;

  	JSXAttribute.prototype.transpile = function transpile ( code, transforms ) {
  		if ( this.value ) {
  			code.overwrite( this.name.end, this.value.start, ': ' );
  		} else {
  			// tag without value
  			code.overwrite( this.name.start, this.name.end, ((this.name.name) + ": true") );
  		}

  		if ( IS_DATA_ATTRIBUTE.test( this.name.name ) ) {
  			code.overwrite( this.name.start, this.name.end, ("'" + (this.name.name) + "'") );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return JSXAttribute;
  }(Node));

  function containsNewLine ( node ) {
  	return node.type === 'Literal' && !/\S/.test( node.value ) && /\n/.test( node.value );
  }

  var JSXClosingElement = (function (Node) {
  	function JSXClosingElement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXClosingElement.__proto__ = Node;
  	JSXClosingElement.prototype = Object.create( Node && Node.prototype );
  	JSXClosingElement.prototype.constructor = JSXClosingElement;

  	JSXClosingElement.prototype.transpile = function transpile ( code ) {
  		var spaceBeforeParen = true;

  		var lastChild = this.parent.children[ this.parent.children.length - 1 ];

  		// omit space before closing paren if
  		//   a) this is on a separate line, or
  		//   b) there are no children but there are attributes
  		if ( ( lastChild && containsNewLine( lastChild ) ) || ( this.parent.openingElement.attributes.length ) ) {
  			spaceBeforeParen = false;
  		}

  		code.overwrite( this.start, this.end, spaceBeforeParen ? ' )' : ')' );
  	};

  	return JSXClosingElement;
  }(Node));

  function normalise ( str, removeTrailingWhitespace ) {
  	if ( removeTrailingWhitespace && /\n/.test( str ) ) {
  		str = str.replace( /\s+$/, '' );
  	}

  	str = str
  		.replace( /^\n\r?\s+/, '' )       // remove leading newline + space
  		.replace( /\s*\n\r?\s*/gm, ' ' ); // replace newlines with spaces

  	// TODO prefer single quotes?
  	return JSON.stringify( str );
  }

  var JSXElement = (function (Node) {
  	function JSXElement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXElement.__proto__ = Node;
  	JSXElement.prototype = Object.create( Node && Node.prototype );
  	JSXElement.prototype.constructor = JSXElement;

  	JSXElement.prototype.transpile = function transpile ( code, transforms ) {
  		Node.prototype.transpile.call( this, code, transforms );

  		var children = this.children.filter( function ( child ) {
  			if ( child.type !== 'Literal' ) return true;

  			// remove whitespace-only literals, unless on a single line
  			return /\S/.test( child.value ) || !/\n/.test( child.value );
  		});

  		if ( children.length ) {
  			var c = this.openingElement.end;

  			var i;
  			for ( i = 0; i < children.length; i += 1 ) {
  				var child = children[i];

  				if ( child.type === 'JSXExpressionContainer' && child.expression.type === 'JSXEmptyExpression' ) {
  					// empty block is a no op
  				} else {
  					var tail = code.original[ c ] === '\n' && child.type !== 'Literal' ? '' : ' ';
  					code.insertLeft( c, ("," + tail) );
  				}

  				if ( child.type === 'Literal' ) {
  					var str = normalise( child.value, i === children.length - 1 );
  					code.overwrite( child.start, child.end, str );
  				}

  				c = child.end;
  			}
  		}
  	};

  	return JSXElement;
  }(Node));

  var JSXExpressionContainer = (function (Node) {
  	function JSXExpressionContainer () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXExpressionContainer.__proto__ = Node;
  	JSXExpressionContainer.prototype = Object.create( Node && Node.prototype );
  	JSXExpressionContainer.prototype.constructor = JSXExpressionContainer;

  	JSXExpressionContainer.prototype.transpile = function transpile ( code, transforms ) {
  		code.remove( this.start, this.expression.start );
  		code.remove( this.expression.end, this.end );

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return JSXExpressionContainer;
  }(Node));

  var JSXOpeningElement = (function (Node) {
  	function JSXOpeningElement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXOpeningElement.__proto__ = Node;
  	JSXOpeningElement.prototype = Object.create( Node && Node.prototype );
  	JSXOpeningElement.prototype.constructor = JSXOpeningElement;

  	JSXOpeningElement.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		code.overwrite( this.start, this.name.start, ((this.program.jsx) + "( ") );

  		var html = this.name.type === 'JSXIdentifier' && this.name.name[0] === this.name.name[0].toLowerCase();
  		if ( html ) code.insertRight( this.name.start, "'" );

  		var len = this.attributes.length;
  		var c = this.name.end;

  		if ( len ) {
  			var i;

  			var hasSpread = false;
  			for ( i = 0; i < len; i += 1 ) {
  				if ( this$1.attributes[i].type === 'JSXSpreadAttribute' ) {
  					hasSpread = true;
  					break;
  				}
  			}

  			c = this.attributes[0].end;

  			for ( i = 0; i < len; i += 1 ) {
  				var attr = this$1.attributes[i];

  				if ( i > 0 ) {
  					code.overwrite( c, attr.start, ', ' );
  				}

  				if ( hasSpread && attr.type !== 'JSXSpreadAttribute' ) {
  					var lastAttr = this$1.attributes[ i - 1 ];
  					var nextAttr = this$1.attributes[ i + 1 ];

  					if ( !lastAttr || lastAttr.type === 'JSXSpreadAttribute' ) {
  						code.insertRight( attr.start, '{ ' );
  					}

  					if ( !nextAttr || nextAttr.type === 'JSXSpreadAttribute' ) {
  						code.insertLeft( attr.end, ' }' );
  					}
  				}

  				c = attr.end;
  			}

  			var after;
  			var before;
  			if ( hasSpread ) {
  				if ( len === 1 ) {
  					before = html ? "'," : ',';
  				} else {
  					if (!this.program.options.objectAssign) {
  						throw new CompileError( this, 'Mixed JSX attributes ending in spread requires specified objectAssign option with \'Object.assign\' or polyfill helper.' );
  					}
  					before = html ? ("', " + (this.program.options.objectAssign) + "({},") : (", " + (this.program.options.objectAssign) + "({},");
  					after = ')';
  				}
  			} else {
  				before = html ? "', {" : ', {';
  				after = ' }';
  			}

  			code.insertRight( this.name.end, before );

  			if ( after ) {
  				code.insertLeft( this.attributes[ len - 1 ].end, after );
  			}
  		} else {
  			code.insertLeft( this.name.end, html ? "', null" : ", null" );
  			c = this.name.end;
  		}

  		Node.prototype.transpile.call( this, code, transforms );

  		if ( this.selfClosing ) {
  			code.overwrite( c, this.end, this.attributes.length ? ")" : " )" );
  		} else {
  			code.remove( c, this.end );
  		}
  	};

  	return JSXOpeningElement;
  }(Node));

  var JSXSpreadAttribute = (function (Node) {
  	function JSXSpreadAttribute () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) JSXSpreadAttribute.__proto__ = Node;
  	JSXSpreadAttribute.prototype = Object.create( Node && Node.prototype );
  	JSXSpreadAttribute.prototype.constructor = JSXSpreadAttribute;

  	JSXSpreadAttribute.prototype.transpile = function transpile ( code, transforms ) {
  		code.remove( this.start, this.argument.start );
  		code.remove( this.argument.end, this.end );

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return JSXSpreadAttribute;
  }(Node));

  var regenerate = __commonjs(function (module, exports, global) {
  /*! https://mths.be/regenerate v1.3.1 by @mathias | MIT license */
  ;(function(root) {

  	// Detect free variables `exports`.
  	var freeExports = typeof exports == 'object' && exports;

  	// Detect free variable `module`.
  	var freeModule = typeof module == 'object' && module &&
  		module.exports == freeExports && module;

  	// Detect free variable `global`, from Node.js/io.js or Browserified code,
  	// and use it as `root`.
  	var freeGlobal = typeof global == 'object' && global;
  	if (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) {
  		root = freeGlobal;
  	}

  	/*--------------------------------------------------------------------------*/

  	var ERRORS = {
  		'rangeOrder': 'A range\u2019s `stop` value must be greater than or equal ' +
  			'to the `start` value.',
  		'codePointRange': 'Invalid code point value. Code points range from ' +
  			'U+000000 to U+10FFFF.'
  	};

  	// https://mathiasbynens.be/notes/javascript-encoding#surrogate-pairs
  	var HIGH_SURROGATE_MIN = 0xD800;
  	var HIGH_SURROGATE_MAX = 0xDBFF;
  	var LOW_SURROGATE_MIN = 0xDC00;
  	var LOW_SURROGATE_MAX = 0xDFFF;

  	// In Regenerate output, `\0` is never preceded by `\` because we sort by
  	// code point value, so let’s keep this regular expression simple.
  	var regexNull = /\\x00([^0123456789]|$)/g;

  	var object = {};
  	var hasOwnProperty = object.hasOwnProperty;
  	var extend = function(destination, source) {
  		var key;
  		for (key in source) {
  			if (hasOwnProperty.call(source, key)) {
  				destination[key] = source[key];
  			}
  		}
  		return destination;
  	};

  	var forEach = function(array, callback) {
  		var index = -1;
  		var length = array.length;
  		while (++index < length) {
  			callback(array[index], index);
  		}
  	};

  	var toString = object.toString;
  	var isArray = function(value) {
  		return toString.call(value) == '[object Array]';
  	};
  	var isNumber = function(value) {
  		return typeof value == 'number' ||
  			toString.call(value) == '[object Number]';
  	};

  	// This assumes that `number` is a positive integer that `toString()`s nicely
  	// (which is the case for all code point values).
  	var zeroes = '0000';
  	var pad = function(number, totalCharacters) {
  		var string = String(number);
  		return string.length < totalCharacters
  			? (zeroes + string).slice(-totalCharacters)
  			: string;
  	};

  	var hex = function(number) {
  		return Number(number).toString(16).toUpperCase();
  	};

  	var slice = [].slice;

  	/*--------------------------------------------------------------------------*/

  	var dataFromCodePoints = function(codePoints) {
  		var index = -1;
  		var length = codePoints.length;
  		var max = length - 1;
  		var result = [];
  		var isStart = true;
  		var tmp;
  		var previous = 0;
  		while (++index < length) {
  			tmp = codePoints[index];
  			if (isStart) {
  				result.push(tmp);
  				previous = tmp;
  				isStart = false;
  			} else {
  				if (tmp == previous + 1) {
  					if (index != max) {
  						previous = tmp;
  						continue;
  					} else {
  						isStart = true;
  						result.push(tmp + 1);
  					}
  				} else {
  					// End the previous range and start a new one.
  					result.push(previous + 1, tmp);
  					previous = tmp;
  				}
  			}
  		}
  		if (!isStart) {
  			result.push(tmp + 1);
  		}
  		return result;
  	};

  	var dataRemove = function(data, codePoint) {
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var length = data.length;
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1];
  			if (codePoint >= start && codePoint < end) {
  				// Modify this pair.
  				if (codePoint == start) {
  					if (end == start + 1) {
  						// Just remove `start` and `end`.
  						data.splice(index, 2);
  						return data;
  					} else {
  						// Just replace `start` with a new value.
  						data[index] = codePoint + 1;
  						return data;
  					}
  				} else if (codePoint == end - 1) {
  					// Just replace `end` with a new value.
  					data[index + 1] = codePoint;
  					return data;
  				} else {
  					// Replace `[start, end]` with `[startA, endA, startB, endB]`.
  					data.splice(index, 2, start, codePoint, codePoint + 1, end);
  					return data;
  				}
  			}
  			index += 2;
  		}
  		return data;
  	};

  	var dataRemoveRange = function(data, rangeStart, rangeEnd) {
  		if (rangeEnd < rangeStart) {
  			throw Error(ERRORS.rangeOrder);
  		}
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		while (index < data.length) {
  			start = data[index];
  			end = data[index + 1] - 1; // Note: the `- 1` makes `end` inclusive.

  			// Exit as soon as no more matching pairs can be found.
  			if (start > rangeEnd) {
  				return data;
  			}

  			// Check if this range pair is equal to, or forms a subset of, the range
  			// to be removed.
  			// E.g. we have `[0, 11, 40, 51]` and want to remove 0-10 → `[40, 51]`.
  			// E.g. we have `[40, 51]` and want to remove 0-100 → `[]`.
  			if (rangeStart <= start && rangeEnd >= end) {
  				// Remove this pair.
  				data.splice(index, 2);
  				continue;
  			}

  			// Check if both `rangeStart` and `rangeEnd` are within the bounds of
  			// this pair.
  			// E.g. we have `[0, 11]` and want to remove 4-6 → `[0, 4, 7, 11]`.
  			if (rangeStart >= start && rangeEnd < end) {
  				if (rangeStart == start) {
  					// Replace `[start, end]` with `[startB, endB]`.
  					data[index] = rangeEnd + 1;
  					data[index + 1] = end + 1;
  					return data;
  				}
  				// Replace `[start, end]` with `[startA, endA, startB, endB]`.
  				data.splice(index, 2, start, rangeStart, rangeEnd + 1, end + 1);
  				return data;
  			}

  			// Check if only `rangeStart` is within the bounds of this pair.
  			// E.g. we have `[0, 11]` and want to remove 4-20 → `[0, 4]`.
  			if (rangeStart >= start && rangeStart <= end) {
  				// Replace `end` with `rangeStart`.
  				data[index + 1] = rangeStart;
  				// Note: we cannot `return` just yet, in case any following pairs still
  				// contain matching code points.
  				// E.g. we have `[0, 11, 14, 31]` and want to remove 4-20
  				// → `[0, 4, 21, 31]`.
  			}

  			// Check if only `rangeEnd` is within the bounds of this pair.
  			// E.g. we have `[14, 31]` and want to remove 4-20 → `[21, 31]`.
  			else if (rangeEnd >= start && rangeEnd <= end) {
  				// Just replace `start`.
  				data[index] = rangeEnd + 1;
  				return data;
  			}

  			index += 2;
  		}
  		return data;
  	};

  	 var dataAdd = function(data, codePoint) {
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var lastIndex = null;
  		var length = data.length;
  		if (codePoint < 0x0 || codePoint > 0x10FFFF) {
  			throw RangeError(ERRORS.codePointRange);
  		}
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1];

  			// Check if the code point is already in the set.
  			if (codePoint >= start && codePoint < end) {
  				return data;
  			}

  			if (codePoint == start - 1) {
  				// Just replace `start` with a new value.
  				data[index] = codePoint;
  				return data;
  			}

  			// At this point, if `start` is `greater` than `codePoint`, insert a new
  			// `[start, end]` pair before the current pair, or after the current pair
  			// if there is a known `lastIndex`.
  			if (start > codePoint) {
  				data.splice(
  					lastIndex != null ? lastIndex + 2 : 0,
  					0,
  					codePoint,
  					codePoint + 1
  				);
  				return data;
  			}

  			if (codePoint == end) {
  				// Check if adding this code point causes two separate ranges to become
  				// a single range, e.g. `dataAdd([0, 4, 5, 10], 4)` → `[0, 10]`.
  				if (codePoint + 1 == data[index + 2]) {
  					data.splice(index, 4, start, data[index + 3]);
  					return data;
  				}
  				// Else, just replace `end` with a new value.
  				data[index + 1] = codePoint + 1;
  				return data;
  			}
  			lastIndex = index;
  			index += 2;
  		}
  		// The loop has finished; add the new pair to the end of the data set.
  		data.push(codePoint, codePoint + 1);
  		return data;
  	};

  	var dataAddData = function(dataA, dataB) {
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var data = dataA.slice();
  		var length = dataB.length;
  		while (index < length) {
  			start = dataB[index];
  			end = dataB[index + 1] - 1;
  			if (start == end) {
  				data = dataAdd(data, start);
  			} else {
  				data = dataAddRange(data, start, end);
  			}
  			index += 2;
  		}
  		return data;
  	};

  	var dataRemoveData = function(dataA, dataB) {
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var data = dataA.slice();
  		var length = dataB.length;
  		while (index < length) {
  			start = dataB[index];
  			end = dataB[index + 1] - 1;
  			if (start == end) {
  				data = dataRemove(data, start);
  			} else {
  				data = dataRemoveRange(data, start, end);
  			}
  			index += 2;
  		}
  		return data;
  	};

  	var dataAddRange = function(data, rangeStart, rangeEnd) {
  		if (rangeEnd < rangeStart) {
  			throw Error(ERRORS.rangeOrder);
  		}
  		if (
  			rangeStart < 0x0 || rangeStart > 0x10FFFF ||
  			rangeEnd < 0x0 || rangeEnd > 0x10FFFF
  		) {
  			throw RangeError(ERRORS.codePointRange);
  		}
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var added = false;
  		var length = data.length;
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1];

  			if (added) {
  				// The range has already been added to the set; at this point, we just
  				// need to get rid of the following ranges in case they overlap.

  				// Check if this range can be combined with the previous range.
  				if (start == rangeEnd + 1) {
  					data.splice(index - 1, 2);
  					return data;
  				}

  				// Exit as soon as no more possibly overlapping pairs can be found.
  				if (start > rangeEnd) {
  					return data;
  				}

  				// E.g. `[0, 11, 12, 16]` and we’ve added 5-15, so we now have
  				// `[0, 16, 12, 16]`. Remove the `12,16` part, as it lies within the
  				// `0,16` range that was previously added.
  				if (start >= rangeStart && start <= rangeEnd) {
  					// `start` lies within the range that was previously added.

  					if (end > rangeStart && end - 1 <= rangeEnd) {
  						// `end` lies within the range that was previously added as well,
  						// so remove this pair.
  						data.splice(index, 2);
  						index -= 2;
  						// Note: we cannot `return` just yet, as there may still be other
  						// overlapping pairs.
  					} else {
  						// `start` lies within the range that was previously added, but
  						// `end` doesn’t. E.g. `[0, 11, 12, 31]` and we’ve added 5-15, so
  						// now we have `[0, 16, 12, 31]`. This must be written as `[0, 31]`.
  						// Remove the previously added `end` and the current `start`.
  						data.splice(index - 1, 2);
  						index -= 2;
  					}

  					// Note: we cannot return yet.
  				}

  			}

  			else if (start == rangeEnd + 1) {
  				data[index] = rangeStart;
  				return data;
  			}

  			// Check if a new pair must be inserted *before* the current one.
  			else if (start > rangeEnd) {
  				data.splice(index, 0, rangeStart, rangeEnd + 1);
  				return data;
  			}

  			else if (rangeStart >= start && rangeStart < end && rangeEnd + 1 <= end) {
  				// The new range lies entirely within an existing range pair. No action
  				// needed.
  				return data;
  			}

  			else if (
  				// E.g. `[0, 11]` and you add 5-15 → `[0, 16]`.
  				(rangeStart >= start && rangeStart < end) ||
  				// E.g. `[0, 3]` and you add 3-6 → `[0, 7]`.
  				end == rangeStart
  			) {
  				// Replace `end` with the new value.
  				data[index + 1] = rangeEnd + 1;
  				// Make sure the next range pair doesn’t overlap, e.g. `[0, 11, 12, 14]`
  				// and you add 5-15 → `[0, 16]`, i.e. remove the `12,14` part.
  				added = true;
  				// Note: we cannot `return` just yet.
  			}

  			else if (rangeStart <= start && rangeEnd + 1 >= end) {
  				// The new range is a superset of the old range.
  				data[index] = rangeStart;
  				data[index + 1] = rangeEnd + 1;
  				added = true;
  			}

  			index += 2;
  		}
  		// The loop has finished without doing anything; add the new pair to the end
  		// of the data set.
  		if (!added) {
  			data.push(rangeStart, rangeEnd + 1);
  		}
  		return data;
  	};

  	var dataContains = function(data, codePoint) {
  		var index = 0;
  		var length = data.length;
  		// Exit early if `codePoint` is not within `data`’s overall range.
  		var start = data[index];
  		var end = data[length - 1];
  		if (length >= 2) {
  			if (codePoint < start || codePoint > end) {
  				return false;
  			}
  		}
  		// Iterate over the data per `(start, end)` pair.
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1];
  			if (codePoint >= start && codePoint < end) {
  				return true;
  			}
  			index += 2;
  		}
  		return false;
  	};

  	var dataIntersection = function(data, codePoints) {
  		var index = 0;
  		var length = codePoints.length;
  		var codePoint;
  		var result = [];
  		while (index < length) {
  			codePoint = codePoints[index];
  			if (dataContains(data, codePoint)) {
  				result.push(codePoint);
  			}
  			++index;
  		}
  		return dataFromCodePoints(result);
  	};

  	var dataIsEmpty = function(data) {
  		return !data.length;
  	};

  	var dataIsSingleton = function(data) {
  		// Check if the set only represents a single code point.
  		return data.length == 2 && data[0] + 1 == data[1];
  	};

  	var dataToArray = function(data) {
  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var result = [];
  		var length = data.length;
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1];
  			while (start < end) {
  				result.push(start);
  				++start;
  			}
  			index += 2;
  		}
  		return result;
  	};

  	/*--------------------------------------------------------------------------*/

  	// https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
  	var floor = Math.floor;
  	var highSurrogate = function(codePoint) {
  		return parseInt(
  			floor((codePoint - 0x10000) / 0x400) + HIGH_SURROGATE_MIN,
  			10
  		);
  	};

  	var lowSurrogate = function(codePoint) {
  		return parseInt(
  			(codePoint - 0x10000) % 0x400 + LOW_SURROGATE_MIN,
  			10
  		);
  	};

  	var stringFromCharCode = String.fromCharCode;
  	var codePointToString = function(codePoint) {
  		var string;
  		// https://mathiasbynens.be/notes/javascript-escapes#single
  		// Note: the `\b` escape sequence for U+0008 BACKSPACE in strings has a
  		// different meaning in regular expressions (word boundary), so it cannot
  		// be used here.
  		if (codePoint == 0x09) {
  			string = '\\t';
  		}
  		// Note: IE < 9 treats `'\v'` as `'v'`, so avoid using it.
  		// else if (codePoint == 0x0B) {
  		// 	string = '\\v';
  		// }
  		else if (codePoint == 0x0A) {
  			string = '\\n';
  		}
  		else if (codePoint == 0x0C) {
  			string = '\\f';
  		}
  		else if (codePoint == 0x0D) {
  			string = '\\r';
  		}
  		else if (codePoint == 0x5C) {
  			string = '\\\\';
  		}
  		else if (
  			codePoint == 0x24 ||
  			(codePoint >= 0x28 && codePoint <= 0x2B) ||
  			codePoint == 0x2D || codePoint == 0x2E || codePoint == 0x3F ||
  			(codePoint >= 0x5B && codePoint <= 0x5E) ||
  			(codePoint >= 0x7B && codePoint <= 0x7D)
  		) {
  			// The code point maps to an unsafe printable ASCII character;
  			// backslash-escape it. Here’s the list of those symbols:
  			//
  			//     $()*+-.?[\]^{|}
  			//
  			// See #7 for more info.
  			string = '\\' + stringFromCharCode(codePoint);
  		}
  		else if (codePoint >= 0x20 && codePoint <= 0x7E) {
  			// The code point maps to one of these printable ASCII symbols
  			// (including the space character):
  			//
  			//      !"#%&',/0123456789:;<=>@ABCDEFGHIJKLMNO
  			//     PQRSTUVWXYZ_`abcdefghijklmnopqrstuvwxyz~
  			//
  			// These can safely be used directly.
  			string = stringFromCharCode(codePoint);
  		}
  		else if (codePoint <= 0xFF) {
  			// https://mathiasbynens.be/notes/javascript-escapes#hexadecimal
  			string = '\\x' + pad(hex(codePoint), 2);
  		}
  		else { // `codePoint <= 0xFFFF` holds true.
  			// https://mathiasbynens.be/notes/javascript-escapes#unicode
  			string = '\\u' + pad(hex(codePoint), 4);
  		}

  		// There’s no need to account for astral symbols / surrogate pairs here,
  		// since `codePointToString` is private and only used for BMP code points.
  		// But if that’s what you need, just add an `else` block with this code:
  		//
  		//     string = '\\u' + pad(hex(highSurrogate(codePoint)), 4)
  		//     	+ '\\u' + pad(hex(lowSurrogate(codePoint)), 4);

  		return string;
  	};

  	var codePointToStringUnicode = function(codePoint) {
  		if (codePoint <= 0xFFFF) {
  			return codePointToString(codePoint);
  		}
  		return '\\u{' + codePoint.toString(16).toUpperCase() + '}';
  	};

  	var symbolToCodePoint = function(symbol) {
  		var length = symbol.length;
  		var first = symbol.charCodeAt(0);
  		var second;
  		if (
  			first >= HIGH_SURROGATE_MIN && first <= HIGH_SURROGATE_MAX &&
  			length > 1 // There is a next code unit.
  		) {
  			// `first` is a high surrogate, and there is a next character. Assume
  			// it’s a low surrogate (else it’s invalid usage of Regenerate anyway).
  			second = symbol.charCodeAt(1);
  			// https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
  			return (first - HIGH_SURROGATE_MIN) * 0x400 +
  				second - LOW_SURROGATE_MIN + 0x10000;
  		}
  		return first;
  	};

  	var createBMPCharacterClasses = function(data) {
  		// Iterate over the data per `(start, end)` pair.
  		var result = '';
  		var index = 0;
  		var start;
  		var end;
  		var length = data.length;
  		if (dataIsSingleton(data)) {
  			return codePointToString(data[0]);
  		}
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1] - 1; // Note: the `- 1` makes `end` inclusive.
  			if (start == end) {
  				result += codePointToString(start);
  			} else if (start + 1 == end) {
  				result += codePointToString(start) + codePointToString(end);
  			} else {
  				result += codePointToString(start) + '-' + codePointToString(end);
  			}
  			index += 2;
  		}
  		return '[' + result + ']';
  	};

  	var createUnicodeCharacterClasses = function(data) {
  		// Iterate over the data per `(start, end)` pair.
  		var result = '';
  		var index = 0;
  		var start;
  		var end;
  		var length = data.length;
  		if (dataIsSingleton(data)) {
  			return codePointToStringUnicode(data[0]);
  		}
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1] - 1; // Note: the `- 1` makes `end` inclusive.
  			if (start == end) {
  				result += codePointToStringUnicode(start);
  			} else if (start + 1 == end) {
  				result += codePointToStringUnicode(start) + codePointToStringUnicode(end);
  			} else {
  				result += codePointToStringUnicode(start) + '-' + codePointToStringUnicode(end);
  			}
  			index += 2;
  		}
  		return '[' + result + ']';
  	};

  	var splitAtBMP = function(data) {
  		// Iterate over the data per `(start, end)` pair.
  		var loneHighSurrogates = [];
  		var loneLowSurrogates = [];
  		var bmp = [];
  		var astral = [];
  		var index = 0;
  		var start;
  		var end;
  		var length = data.length;
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1] - 1; // Note: the `- 1` makes `end` inclusive.

  			if (start < HIGH_SURROGATE_MIN) {

  				// The range starts and ends before the high surrogate range.
  				// E.g. (0, 0x10).
  				if (end < HIGH_SURROGATE_MIN) {
  					bmp.push(start, end + 1);
  				}

  				// The range starts before the high surrogate range and ends within it.
  				// E.g. (0, 0xD855).
  				if (end >= HIGH_SURROGATE_MIN && end <= HIGH_SURROGATE_MAX) {
  					bmp.push(start, HIGH_SURROGATE_MIN);
  					loneHighSurrogates.push(HIGH_SURROGATE_MIN, end + 1);
  				}

  				// The range starts before the high surrogate range and ends in the low
  				// surrogate range. E.g. (0, 0xDCFF).
  				if (end >= LOW_SURROGATE_MIN && end <= LOW_SURROGATE_MAX) {
  					bmp.push(start, HIGH_SURROGATE_MIN);
  					loneHighSurrogates.push(HIGH_SURROGATE_MIN, HIGH_SURROGATE_MAX + 1);
  					loneLowSurrogates.push(LOW_SURROGATE_MIN, end + 1);
  				}

  				// The range starts before the high surrogate range and ends after the
  				// low surrogate range. E.g. (0, 0x10FFFF).
  				if (end > LOW_SURROGATE_MAX) {
  					bmp.push(start, HIGH_SURROGATE_MIN);
  					loneHighSurrogates.push(HIGH_SURROGATE_MIN, HIGH_SURROGATE_MAX + 1);
  					loneLowSurrogates.push(LOW_SURROGATE_MIN, LOW_SURROGATE_MAX + 1);
  					if (end <= 0xFFFF) {
  						bmp.push(LOW_SURROGATE_MAX + 1, end + 1);
  					} else {
  						bmp.push(LOW_SURROGATE_MAX + 1, 0xFFFF + 1);
  						astral.push(0xFFFF + 1, end + 1);
  					}
  				}

  			} else if (start >= HIGH_SURROGATE_MIN && start <= HIGH_SURROGATE_MAX) {

  				// The range starts and ends in the high surrogate range.
  				// E.g. (0xD855, 0xD866).
  				if (end >= HIGH_SURROGATE_MIN && end <= HIGH_SURROGATE_MAX) {
  					loneHighSurrogates.push(start, end + 1);
  				}

  				// The range starts in the high surrogate range and ends in the low
  				// surrogate range. E.g. (0xD855, 0xDCFF).
  				if (end >= LOW_SURROGATE_MIN && end <= LOW_SURROGATE_MAX) {
  					loneHighSurrogates.push(start, HIGH_SURROGATE_MAX + 1);
  					loneLowSurrogates.push(LOW_SURROGATE_MIN, end + 1);
  				}

  				// The range starts in the high surrogate range and ends after the low
  				// surrogate range. E.g. (0xD855, 0x10FFFF).
  				if (end > LOW_SURROGATE_MAX) {
  					loneHighSurrogates.push(start, HIGH_SURROGATE_MAX + 1);
  					loneLowSurrogates.push(LOW_SURROGATE_MIN, LOW_SURROGATE_MAX + 1);
  					if (end <= 0xFFFF) {
  						bmp.push(LOW_SURROGATE_MAX + 1, end + 1);
  					} else {
  						bmp.push(LOW_SURROGATE_MAX + 1, 0xFFFF + 1);
  						astral.push(0xFFFF + 1, end + 1);
  					}
  				}

  			} else if (start >= LOW_SURROGATE_MIN && start <= LOW_SURROGATE_MAX) {

  				// The range starts and ends in the low surrogate range.
  				// E.g. (0xDCFF, 0xDDFF).
  				if (end >= LOW_SURROGATE_MIN && end <= LOW_SURROGATE_MAX) {
  					loneLowSurrogates.push(start, end + 1);
  				}

  				// The range starts in the low surrogate range and ends after the low
  				// surrogate range. E.g. (0xDCFF, 0x10FFFF).
  				if (end > LOW_SURROGATE_MAX) {
  					loneLowSurrogates.push(start, LOW_SURROGATE_MAX + 1);
  					if (end <= 0xFFFF) {
  						bmp.push(LOW_SURROGATE_MAX + 1, end + 1);
  					} else {
  						bmp.push(LOW_SURROGATE_MAX + 1, 0xFFFF + 1);
  						astral.push(0xFFFF + 1, end + 1);
  					}
  				}

  			} else if (start > LOW_SURROGATE_MAX && start <= 0xFFFF) {

  				// The range starts and ends after the low surrogate range.
  				// E.g. (0xFFAA, 0x10FFFF).
  				if (end <= 0xFFFF) {
  					bmp.push(start, end + 1);
  				} else {
  					bmp.push(start, 0xFFFF + 1);
  					astral.push(0xFFFF + 1, end + 1);
  				}

  			} else {

  				// The range starts and ends in the astral range.
  				astral.push(start, end + 1);

  			}

  			index += 2;
  		}
  		return {
  			'loneHighSurrogates': loneHighSurrogates,
  			'loneLowSurrogates': loneLowSurrogates,
  			'bmp': bmp,
  			'astral': astral
  		};
  	};

  	var optimizeSurrogateMappings = function(surrogateMappings) {
  		var result = [];
  		var tmpLow = [];
  		var addLow = false;
  		var mapping;
  		var nextMapping;
  		var highSurrogates;
  		var lowSurrogates;
  		var nextHighSurrogates;
  		var nextLowSurrogates;
  		var index = -1;
  		var length = surrogateMappings.length;
  		while (++index < length) {
  			mapping = surrogateMappings[index];
  			nextMapping = surrogateMappings[index + 1];
  			if (!nextMapping) {
  				result.push(mapping);
  				continue;
  			}
  			highSurrogates = mapping[0];
  			lowSurrogates = mapping[1];
  			nextHighSurrogates = nextMapping[0];
  			nextLowSurrogates = nextMapping[1];

  			// Check for identical high surrogate ranges.
  			tmpLow = lowSurrogates;
  			while (
  				nextHighSurrogates &&
  				highSurrogates[0] == nextHighSurrogates[0] &&
  				highSurrogates[1] == nextHighSurrogates[1]
  			) {
  				// Merge with the next item.
  				if (dataIsSingleton(nextLowSurrogates)) {
  					tmpLow = dataAdd(tmpLow, nextLowSurrogates[0]);
  				} else {
  					tmpLow = dataAddRange(
  						tmpLow,
  						nextLowSurrogates[0],
  						nextLowSurrogates[1] - 1
  					);
  				}
  				++index;
  				mapping = surrogateMappings[index];
  				highSurrogates = mapping[0];
  				lowSurrogates = mapping[1];
  				nextMapping = surrogateMappings[index + 1];
  				nextHighSurrogates = nextMapping && nextMapping[0];
  				nextLowSurrogates = nextMapping && nextMapping[1];
  				addLow = true;
  			}
  			result.push([
  				highSurrogates,
  				addLow ? tmpLow : lowSurrogates
  			]);
  			addLow = false;
  		}
  		return optimizeByLowSurrogates(result);
  	};

  	var optimizeByLowSurrogates = function(surrogateMappings) {
  		if (surrogateMappings.length == 1) {
  			return surrogateMappings;
  		}
  		var index = -1;
  		var innerIndex = -1;
  		while (++index < surrogateMappings.length) {
  			var mapping = surrogateMappings[index];
  			var lowSurrogates = mapping[1];
  			var lowSurrogateStart = lowSurrogates[0];
  			var lowSurrogateEnd = lowSurrogates[1];
  			innerIndex = index; // Note: the loop starts at the next index.
  			while (++innerIndex < surrogateMappings.length) {
  				var otherMapping = surrogateMappings[innerIndex];
  				var otherLowSurrogates = otherMapping[1];
  				var otherLowSurrogateStart = otherLowSurrogates[0];
  				var otherLowSurrogateEnd = otherLowSurrogates[1];
  				if (
  					lowSurrogateStart == otherLowSurrogateStart &&
  					lowSurrogateEnd == otherLowSurrogateEnd
  				) {
  					// Add the code points in the other item to this one.
  					if (dataIsSingleton(otherMapping[0])) {
  						mapping[0] = dataAdd(mapping[0], otherMapping[0][0]);
  					} else {
  						mapping[0] = dataAddRange(
  							mapping[0],
  							otherMapping[0][0],
  							otherMapping[0][1] - 1
  						);
  					}
  					// Remove the other, now redundant, item.
  					surrogateMappings.splice(innerIndex, 1);
  					--innerIndex;
  				}
  			}
  		}
  		return surrogateMappings;
  	};

  	var surrogateSet = function(data) {
  		// Exit early if `data` is an empty set.
  		if (!data.length) {
  			return [];
  		}

  		// Iterate over the data per `(start, end)` pair.
  		var index = 0;
  		var start;
  		var end;
  		var startHigh;
  		var startLow;
  		var prevStartHigh = 0;
  		var prevEndHigh = 0;
  		var tmpLow = [];
  		var endHigh;
  		var endLow;
  		var surrogateMappings = [];
  		var length = data.length;
  		var dataHigh = [];
  		while (index < length) {
  			start = data[index];
  			end = data[index + 1] - 1;

  			startHigh = highSurrogate(start);
  			startLow = lowSurrogate(start);
  			endHigh = highSurrogate(end);
  			endLow = lowSurrogate(end);

  			var startsWithLowestLowSurrogate = startLow == LOW_SURROGATE_MIN;
  			var endsWithHighestLowSurrogate = endLow == LOW_SURROGATE_MAX;
  			var complete = false;

  			// Append the previous high-surrogate-to-low-surrogate mappings.
  			// Step 1: `(startHigh, startLow)` to `(startHigh, LOW_SURROGATE_MAX)`.
  			if (
  				startHigh == endHigh ||
  				startsWithLowestLowSurrogate && endsWithHighestLowSurrogate
  			) {
  				surrogateMappings.push([
  					[startHigh, endHigh + 1],
  					[startLow, endLow + 1]
  				]);
  				complete = true;
  			} else {
  				surrogateMappings.push([
  					[startHigh, startHigh + 1],
  					[startLow, LOW_SURROGATE_MAX + 1]
  				]);
  			}

  			// Step 2: `(startHigh + 1, LOW_SURROGATE_MIN)` to
  			// `(endHigh - 1, LOW_SURROGATE_MAX)`.
  			if (!complete && startHigh + 1 < endHigh) {
  				if (endsWithHighestLowSurrogate) {
  					// Combine step 2 and step 3.
  					surrogateMappings.push([
  						[startHigh + 1, endHigh + 1],
  						[LOW_SURROGATE_MIN, endLow + 1]
  					]);
  					complete = true;
  				} else {
  					surrogateMappings.push([
  						[startHigh + 1, endHigh],
  						[LOW_SURROGATE_MIN, LOW_SURROGATE_MAX + 1]
  					]);
  				}
  			}

  			// Step 3. `(endHigh, LOW_SURROGATE_MIN)` to `(endHigh, endLow)`.
  			if (!complete) {
  				surrogateMappings.push([
  					[endHigh, endHigh + 1],
  					[LOW_SURROGATE_MIN, endLow + 1]
  				]);
  			}

  			prevStartHigh = startHigh;
  			prevEndHigh = endHigh;

  			index += 2;
  		}

  		// The format of `surrogateMappings` is as follows:
  		//
  		//     [ surrogateMapping1, surrogateMapping2 ]
  		//
  		// i.e.:
  		//
  		//     [
  		//       [ highSurrogates1, lowSurrogates1 ],
  		//       [ highSurrogates2, lowSurrogates2 ]
  		//     ]
  		return optimizeSurrogateMappings(surrogateMappings);
  	};

  	var createSurrogateCharacterClasses = function(surrogateMappings) {
  		var result = [];
  		forEach(surrogateMappings, function(surrogateMapping) {
  			var highSurrogates = surrogateMapping[0];
  			var lowSurrogates = surrogateMapping[1];
  			result.push(
  				createBMPCharacterClasses(highSurrogates) +
  				createBMPCharacterClasses(lowSurrogates)
  			);
  		});
  		return result.join('|');
  	};

  	var createCharacterClassesFromData = function(data, bmpOnly, hasUnicodeFlag) {
  		if (hasUnicodeFlag) {
  			return createUnicodeCharacterClasses(data);
  		}
  		var result = [];

  		var parts = splitAtBMP(data);
  		var loneHighSurrogates = parts.loneHighSurrogates;
  		var loneLowSurrogates = parts.loneLowSurrogates;
  		var bmp = parts.bmp;
  		var astral = parts.astral;
  		var hasAstral = !dataIsEmpty(parts.astral);
  		var hasLoneHighSurrogates = !dataIsEmpty(loneHighSurrogates);
  		var hasLoneLowSurrogates = !dataIsEmpty(loneLowSurrogates);

  		var surrogateMappings = surrogateSet(astral);

  		if (bmpOnly) {
  			bmp = dataAddData(bmp, loneHighSurrogates);
  			hasLoneHighSurrogates = false;
  			bmp = dataAddData(bmp, loneLowSurrogates);
  			hasLoneLowSurrogates = false;
  		}

  		if (!dataIsEmpty(bmp)) {
  			// The data set contains BMP code points that are not high surrogates
  			// needed for astral code points in the set.
  			result.push(createBMPCharacterClasses(bmp));
  		}
  		if (surrogateMappings.length) {
  			// The data set contains astral code points; append character classes
  			// based on their surrogate pairs.
  			result.push(createSurrogateCharacterClasses(surrogateMappings));
  		}
  		// https://gist.github.com/mathiasbynens/bbe7f870208abcfec860
  		if (hasLoneHighSurrogates) {
  			result.push(
  				createBMPCharacterClasses(loneHighSurrogates) +
  				// Make sure the high surrogates aren’t part of a surrogate pair.
  				'(?![\\uDC00-\\uDFFF])'
  			);
  		}
  		if (hasLoneLowSurrogates) {
  			result.push(
  				// It is not possible to accurately assert the low surrogates aren’t
  				// part of a surrogate pair, since JavaScript regular expressions do
  				// not support lookbehind.
  				'(?:[^\\uD800-\\uDBFF]|^)' +
  				createBMPCharacterClasses(loneLowSurrogates)
  			);
  		}
  		return result.join('|');
  	};

  	/*--------------------------------------------------------------------------*/

  	// `regenerate` can be used as a constructor (and new methods can be added to
  	// its prototype) but also as a regular function, the latter of which is the
  	// documented and most common usage. For that reason, it’s not capitalized.
  	var regenerate = function(value) {
  		if (arguments.length > 1) {
  			value = slice.call(arguments);
  		}
  		if (this instanceof regenerate) {
  			this.data = [];
  			return value ? this.add(value) : this;
  		}
  		return (new regenerate).add(value);
  	};

  	regenerate.version = '1.3.1';

  	var proto = regenerate.prototype;
  	extend(proto, {
  		'add': function(value) {
  			var $this = this;
  			if (value == null) {
  				return $this;
  			}
  			if (value instanceof regenerate) {
  				// Allow passing other Regenerate instances.
  				$this.data = dataAddData($this.data, value.data);
  				return $this;
  			}
  			if (arguments.length > 1) {
  				value = slice.call(arguments);
  			}
  			if (isArray(value)) {
  				forEach(value, function(item) {
  					$this.add(item);
  				});
  				return $this;
  			}
  			$this.data = dataAdd(
  				$this.data,
  				isNumber(value) ? value : symbolToCodePoint(value)
  			);
  			return $this;
  		},
  		'remove': function(value) {
  			var $this = this;
  			if (value == null) {
  				return $this;
  			}
  			if (value instanceof regenerate) {
  				// Allow passing other Regenerate instances.
  				$this.data = dataRemoveData($this.data, value.data);
  				return $this;
  			}
  			if (arguments.length > 1) {
  				value = slice.call(arguments);
  			}
  			if (isArray(value)) {
  				forEach(value, function(item) {
  					$this.remove(item);
  				});
  				return $this;
  			}
  			$this.data = dataRemove(
  				$this.data,
  				isNumber(value) ? value : symbolToCodePoint(value)
  			);
  			return $this;
  		},
  		'addRange': function(start, end) {
  			var $this = this;
  			$this.data = dataAddRange($this.data,
  				isNumber(start) ? start : symbolToCodePoint(start),
  				isNumber(end) ? end : symbolToCodePoint(end)
  			);
  			return $this;
  		},
  		'removeRange': function(start, end) {
  			var $this = this;
  			var startCodePoint = isNumber(start) ? start : symbolToCodePoint(start);
  			var endCodePoint = isNumber(end) ? end : symbolToCodePoint(end);
  			$this.data = dataRemoveRange(
  				$this.data,
  				startCodePoint,
  				endCodePoint
  			);
  			return $this;
  		},
  		'intersection': function(argument) {
  			var $this = this;
  			// Allow passing other Regenerate instances.
  			// TODO: Optimize this by writing and using `dataIntersectionData()`.
  			var array = argument instanceof regenerate ?
  				dataToArray(argument.data) :
  				argument;
  			$this.data = dataIntersection($this.data, array);
  			return $this;
  		},
  		'contains': function(codePoint) {
  			return dataContains(
  				this.data,
  				isNumber(codePoint) ? codePoint : symbolToCodePoint(codePoint)
  			);
  		},
  		'clone': function() {
  			var set = new regenerate;
  			set.data = this.data.slice(0);
  			return set;
  		},
  		'toString': function(options) {
  			var result = createCharacterClassesFromData(
  				this.data,
  				options ? options.bmpOnly : false,
  				options ? options.hasUnicodeFlag : false
  			);
  			if (!result) {
  				// For an empty set, return something that can be inserted `/here/` to
  				// form a valid regular expression. Avoid `(?:)` since that matches the
  				// empty string.
  				return '[]';
  			}
  			// Use `\0` instead of `\x00` where possible.
  			return result.replace(regexNull, '\\0$1');
  		},
  		'toRegExp': function(flags) {
  			var pattern = this.toString(
  				flags && flags.indexOf('u') != -1 ?
  					{ 'hasUnicodeFlag': true } :
  					null
  			);
  			return RegExp(pattern, flags || '');
  		},
  		'valueOf': function() { // Note: `valueOf` is aliased as `toArray`.
  			return dataToArray(this.data);
  		}
  	});

  	proto.toArray = proto.valueOf;

  	// Some AMD build optimizers, like r.js, check for specific condition patterns
  	// like the following:
  	if (
  		typeof define == 'function' &&
  		typeof define.amd == 'object' &&
  		define.amd
  	) {
  		define(function() {
  			return regenerate;
  		});
  	}	else if (freeExports && !freeExports.nodeType) {
  		if (freeModule) { // in Node.js, io.js, or RingoJS v0.8.0+
  			freeModule.exports = regenerate;
  		} else { // in Narwhal or RingoJS v0.7.0-
  			freeExports.regenerate = regenerate;
  		}
  	} else { // in Rhino or a web browser
  		root.regenerate = regenerate;
  	}

  }(__commonjs_global));
  });

  var require$$0$2 = (regenerate && typeof regenerate === 'object' && 'default' in regenerate ? regenerate['default'] : regenerate);

  var characterClassEscapeSets = __commonjs(function (module, exports) {
  // Generated by `/scripts/character-class-escape-sets.js`. Do not edit.
  var regenerate = require$$0$2;

  exports.REGULAR = {
  	'd': regenerate()
  		.addRange(0x30, 0x39),
  	'D': regenerate()
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0xFFFF),
  	's': regenerate(0x20, 0xA0, 0x1680, 0x202F, 0x205F, 0x3000, 0xFEFF)
  		.addRange(0x9, 0xD)
  		.addRange(0x2000, 0x200A)
  		.addRange(0x2028, 0x2029),
  	'S': regenerate()
  		.addRange(0x0, 0x8)
  		.addRange(0xE, 0x1F)
  		.addRange(0x21, 0x9F)
  		.addRange(0xA1, 0x167F)
  		.addRange(0x1681, 0x1FFF)
  		.addRange(0x200B, 0x2027)
  		.addRange(0x202A, 0x202E)
  		.addRange(0x2030, 0x205E)
  		.addRange(0x2060, 0x2FFF)
  		.addRange(0x3001, 0xFEFE)
  		.addRange(0xFF00, 0xFFFF),
  	'w': regenerate(0x5F)
  		.addRange(0x30, 0x39)
  		.addRange(0x41, 0x5A)
  		.addRange(0x61, 0x7A),
  	'W': regenerate(0x60)
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0x40)
  		.addRange(0x5B, 0x5E)
  		.addRange(0x7B, 0xFFFF)
  };

  exports.UNICODE = {
  	'd': regenerate()
  		.addRange(0x30, 0x39),
  	'D': regenerate()
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0x10FFFF),
  	's': regenerate(0x20, 0xA0, 0x1680, 0x202F, 0x205F, 0x3000, 0xFEFF)
  		.addRange(0x9, 0xD)
  		.addRange(0x2000, 0x200A)
  		.addRange(0x2028, 0x2029),
  	'S': regenerate()
  		.addRange(0x0, 0x8)
  		.addRange(0xE, 0x1F)
  		.addRange(0x21, 0x9F)
  		.addRange(0xA1, 0x167F)
  		.addRange(0x1681, 0x1FFF)
  		.addRange(0x200B, 0x2027)
  		.addRange(0x202A, 0x202E)
  		.addRange(0x2030, 0x205E)
  		.addRange(0x2060, 0x2FFF)
  		.addRange(0x3001, 0xFEFE)
  		.addRange(0xFF00, 0x10FFFF),
  	'w': regenerate(0x5F)
  		.addRange(0x30, 0x39)
  		.addRange(0x41, 0x5A)
  		.addRange(0x61, 0x7A),
  	'W': regenerate(0x60)
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0x40)
  		.addRange(0x5B, 0x5E)
  		.addRange(0x7B, 0x10FFFF)
  };

  exports.UNICODE_IGNORE_CASE = {
  	'd': regenerate()
  		.addRange(0x30, 0x39),
  	'D': regenerate()
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0x10FFFF),
  	's': regenerate(0x20, 0xA0, 0x1680, 0x202F, 0x205F, 0x3000, 0xFEFF)
  		.addRange(0x9, 0xD)
  		.addRange(0x2000, 0x200A)
  		.addRange(0x2028, 0x2029),
  	'S': regenerate()
  		.addRange(0x0, 0x8)
  		.addRange(0xE, 0x1F)
  		.addRange(0x21, 0x9F)
  		.addRange(0xA1, 0x167F)
  		.addRange(0x1681, 0x1FFF)
  		.addRange(0x200B, 0x2027)
  		.addRange(0x202A, 0x202E)
  		.addRange(0x2030, 0x205E)
  		.addRange(0x2060, 0x2FFF)
  		.addRange(0x3001, 0xFEFE)
  		.addRange(0xFF00, 0x10FFFF),
  	'w': regenerate(0x5F, 0x17F, 0x212A)
  		.addRange(0x30, 0x39)
  		.addRange(0x41, 0x5A)
  		.addRange(0x61, 0x7A),
  	'W': regenerate(0x4B, 0x53, 0x60)
  		.addRange(0x0, 0x2F)
  		.addRange(0x3A, 0x40)
  		.addRange(0x5B, 0x5E)
  		.addRange(0x7B, 0x10FFFF)
  };
  });

  var require$$0$1 = (characterClassEscapeSets && typeof characterClassEscapeSets === 'object' && 'default' in characterClassEscapeSets ? characterClassEscapeSets['default'] : characterClassEscapeSets);

  var require$$1 = {
  	"75": 8490,
  	"83": 383,
  	"107": 8490,
  	"115": 383,
  	"181": 924,
  	"197": 8491,
  	"383": 83,
  	"452": 453,
  	"453": 452,
  	"455": 456,
  	"456": 455,
  	"458": 459,
  	"459": 458,
  	"497": 498,
  	"498": 497,
  	"837": 8126,
  	"914": 976,
  	"917": 1013,
  	"920": 1012,
  	"921": 8126,
  	"922": 1008,
  	"924": 181,
  	"928": 982,
  	"929": 1009,
  	"931": 962,
  	"934": 981,
  	"937": 8486,
  	"962": 931,
  	"976": 914,
  	"977": 1012,
  	"981": 934,
  	"982": 928,
  	"1008": 922,
  	"1009": 929,
  	"1012": [920,977],
  	"1013": 917,
  	"7776": 7835,
  	"7835": 7776,
  	"8126": [837,921],
  	"8486": 937,
  	"8490": 75,
  	"8491": 197,
  	"66560": 66600,
  	"66561": 66601,
  	"66562": 66602,
  	"66563": 66603,
  	"66564": 66604,
  	"66565": 66605,
  	"66566": 66606,
  	"66567": 66607,
  	"66568": 66608,
  	"66569": 66609,
  	"66570": 66610,
  	"66571": 66611,
  	"66572": 66612,
  	"66573": 66613,
  	"66574": 66614,
  	"66575": 66615,
  	"66576": 66616,
  	"66577": 66617,
  	"66578": 66618,
  	"66579": 66619,
  	"66580": 66620,
  	"66581": 66621,
  	"66582": 66622,
  	"66583": 66623,
  	"66584": 66624,
  	"66585": 66625,
  	"66586": 66626,
  	"66587": 66627,
  	"66588": 66628,
  	"66589": 66629,
  	"66590": 66630,
  	"66591": 66631,
  	"66592": 66632,
  	"66593": 66633,
  	"66594": 66634,
  	"66595": 66635,
  	"66596": 66636,
  	"66597": 66637,
  	"66598": 66638,
  	"66599": 66639,
  	"66600": 66560,
  	"66601": 66561,
  	"66602": 66562,
  	"66603": 66563,
  	"66604": 66564,
  	"66605": 66565,
  	"66606": 66566,
  	"66607": 66567,
  	"66608": 66568,
  	"66609": 66569,
  	"66610": 66570,
  	"66611": 66571,
  	"66612": 66572,
  	"66613": 66573,
  	"66614": 66574,
  	"66615": 66575,
  	"66616": 66576,
  	"66617": 66577,
  	"66618": 66578,
  	"66619": 66579,
  	"66620": 66580,
  	"66621": 66581,
  	"66622": 66582,
  	"66623": 66583,
  	"66624": 66584,
  	"66625": 66585,
  	"66626": 66586,
  	"66627": 66587,
  	"66628": 66588,
  	"66629": 66589,
  	"66630": 66590,
  	"66631": 66591,
  	"66632": 66592,
  	"66633": 66593,
  	"66634": 66594,
  	"66635": 66595,
  	"66636": 66596,
  	"66637": 66597,
  	"66638": 66598,
  	"66639": 66599,
  	"68736": 68800,
  	"68737": 68801,
  	"68738": 68802,
  	"68739": 68803,
  	"68740": 68804,
  	"68741": 68805,
  	"68742": 68806,
  	"68743": 68807,
  	"68744": 68808,
  	"68745": 68809,
  	"68746": 68810,
  	"68747": 68811,
  	"68748": 68812,
  	"68749": 68813,
  	"68750": 68814,
  	"68751": 68815,
  	"68752": 68816,
  	"68753": 68817,
  	"68754": 68818,
  	"68755": 68819,
  	"68756": 68820,
  	"68757": 68821,
  	"68758": 68822,
  	"68759": 68823,
  	"68760": 68824,
  	"68761": 68825,
  	"68762": 68826,
  	"68763": 68827,
  	"68764": 68828,
  	"68765": 68829,
  	"68766": 68830,
  	"68767": 68831,
  	"68768": 68832,
  	"68769": 68833,
  	"68770": 68834,
  	"68771": 68835,
  	"68772": 68836,
  	"68773": 68837,
  	"68774": 68838,
  	"68775": 68839,
  	"68776": 68840,
  	"68777": 68841,
  	"68778": 68842,
  	"68779": 68843,
  	"68780": 68844,
  	"68781": 68845,
  	"68782": 68846,
  	"68783": 68847,
  	"68784": 68848,
  	"68785": 68849,
  	"68786": 68850,
  	"68800": 68736,
  	"68801": 68737,
  	"68802": 68738,
  	"68803": 68739,
  	"68804": 68740,
  	"68805": 68741,
  	"68806": 68742,
  	"68807": 68743,
  	"68808": 68744,
  	"68809": 68745,
  	"68810": 68746,
  	"68811": 68747,
  	"68812": 68748,
  	"68813": 68749,
  	"68814": 68750,
  	"68815": 68751,
  	"68816": 68752,
  	"68817": 68753,
  	"68818": 68754,
  	"68819": 68755,
  	"68820": 68756,
  	"68821": 68757,
  	"68822": 68758,
  	"68823": 68759,
  	"68824": 68760,
  	"68825": 68761,
  	"68826": 68762,
  	"68827": 68763,
  	"68828": 68764,
  	"68829": 68765,
  	"68830": 68766,
  	"68831": 68767,
  	"68832": 68768,
  	"68833": 68769,
  	"68834": 68770,
  	"68835": 68771,
  	"68836": 68772,
  	"68837": 68773,
  	"68838": 68774,
  	"68839": 68775,
  	"68840": 68776,
  	"68841": 68777,
  	"68842": 68778,
  	"68843": 68779,
  	"68844": 68780,
  	"68845": 68781,
  	"68846": 68782,
  	"68847": 68783,
  	"68848": 68784,
  	"68849": 68785,
  	"68850": 68786,
  	"71840": 71872,
  	"71841": 71873,
  	"71842": 71874,
  	"71843": 71875,
  	"71844": 71876,
  	"71845": 71877,
  	"71846": 71878,
  	"71847": 71879,
  	"71848": 71880,
  	"71849": 71881,
  	"71850": 71882,
  	"71851": 71883,
  	"71852": 71884,
  	"71853": 71885,
  	"71854": 71886,
  	"71855": 71887,
  	"71856": 71888,
  	"71857": 71889,
  	"71858": 71890,
  	"71859": 71891,
  	"71860": 71892,
  	"71861": 71893,
  	"71862": 71894,
  	"71863": 71895,
  	"71864": 71896,
  	"71865": 71897,
  	"71866": 71898,
  	"71867": 71899,
  	"71868": 71900,
  	"71869": 71901,
  	"71870": 71902,
  	"71871": 71903,
  	"71872": 71840,
  	"71873": 71841,
  	"71874": 71842,
  	"71875": 71843,
  	"71876": 71844,
  	"71877": 71845,
  	"71878": 71846,
  	"71879": 71847,
  	"71880": 71848,
  	"71881": 71849,
  	"71882": 71850,
  	"71883": 71851,
  	"71884": 71852,
  	"71885": 71853,
  	"71886": 71854,
  	"71887": 71855,
  	"71888": 71856,
  	"71889": 71857,
  	"71890": 71858,
  	"71891": 71859,
  	"71892": 71860,
  	"71893": 71861,
  	"71894": 71862,
  	"71895": 71863,
  	"71896": 71864,
  	"71897": 71865,
  	"71898": 71866,
  	"71899": 71867,
  	"71900": 71868,
  	"71901": 71869,
  	"71902": 71870,
  	"71903": 71871
  };

  var parser = __commonjs(function (module) {
  // regjsparser
  //
  // ==================================================================
  //
  // See ECMA-262 Standard: 15.10.1
  //
  // NOTE: The ECMA-262 standard uses the term "Assertion" for /^/. Here the
  //   term "Anchor" is used.
  //
  // Pattern ::
  //      Disjunction
  //
  // Disjunction ::
  //      Alternative
  //      Alternative | Disjunction
  //
  // Alternative ::
  //      [empty]
  //      Alternative Term
  //
  // Term ::
  //      Anchor
  //      Atom
  //      Atom Quantifier
  //
  // Anchor ::
  //      ^
  //      $
  //      \ b
  //      \ B
  //      ( ? = Disjunction )
  //      ( ? ! Disjunction )
  //
  // Quantifier ::
  //      QuantifierPrefix
  //      QuantifierPrefix ?
  //
  // QuantifierPrefix ::
  //      *
  //      +
  //      ?
  //      { DecimalDigits }
  //      { DecimalDigits , }
  //      { DecimalDigits , DecimalDigits }
  //
  // Atom ::
  //      PatternCharacter
  //      .
  //      \ AtomEscape
  //      CharacterClass
  //      ( Disjunction )
  //      ( ? : Disjunction )
  //
  // PatternCharacter ::
  //      SourceCharacter but not any of: ^ $ \ . * + ? ( ) [ ] { } |
  //
  // AtomEscape ::
  //      DecimalEscape
  //      CharacterEscape
  //      CharacterClassEscape
  //
  // CharacterEscape[U] ::
  //      ControlEscape
  //      c ControlLetter
  //      HexEscapeSequence
  //      RegExpUnicodeEscapeSequence[?U] (ES6)
  //      IdentityEscape[?U]
  //
  // ControlEscape ::
  //      one of f n r t v
  // ControlLetter ::
  //      one of
  //          a b c d e f g h i j k l m n o p q r s t u v w x y z
  //          A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
  //
  // IdentityEscape ::
  //      SourceCharacter but not IdentifierPart
  //      <ZWJ>
  //      <ZWNJ>
  //
  // DecimalEscape ::
  //      DecimalIntegerLiteral [lookahead ∉ DecimalDigit]
  //
  // CharacterClassEscape ::
  //      one of d D s S w W
  //
  // CharacterClass ::
  //      [ [lookahead ∉ {^}] ClassRanges ]
  //      [ ^ ClassRanges ]
  //
  // ClassRanges ::
  //      [empty]
  //      NonemptyClassRanges
  //
  // NonemptyClassRanges ::
  //      ClassAtom
  //      ClassAtom NonemptyClassRangesNoDash
  //      ClassAtom - ClassAtom ClassRanges
  //
  // NonemptyClassRangesNoDash ::
  //      ClassAtom
  //      ClassAtomNoDash NonemptyClassRangesNoDash
  //      ClassAtomNoDash - ClassAtom ClassRanges
  //
  // ClassAtom ::
  //      -
  //      ClassAtomNoDash
  //
  // ClassAtomNoDash ::
  //      SourceCharacter but not one of \ or ] or -
  //      \ ClassEscape
  //
  // ClassEscape ::
  //      DecimalEscape
  //      b
  //      CharacterEscape
  //      CharacterClassEscape

  (function() {

    function parse(str, flags) {
      function addRaw(node) {
        node.raw = str.substring(node.range[0], node.range[1]);
        return node;
      }

      function updateRawStart(node, start) {
        node.range[0] = start;
        return addRaw(node);
      }

      function createAnchor(kind, rawLength) {
        return addRaw({
          type: 'anchor',
          kind: kind,
          range: [
            pos - rawLength,
            pos
          ]
        });
      }

      function createValue(kind, codePoint, from, to) {
        return addRaw({
          type: 'value',
          kind: kind,
          codePoint: codePoint,
          range: [from, to]
        });
      }

      function createEscaped(kind, codePoint, value, fromOffset) {
        fromOffset = fromOffset || 0;
        return createValue(kind, codePoint, pos - (value.length + fromOffset), pos);
      }

      function createCharacter(matches) {
        var _char = matches[0];
        var first = _char.charCodeAt(0);
        if (hasUnicodeFlag) {
          var second;
          if (_char.length === 1 && first >= 0xD800 && first <= 0xDBFF) {
            second = lookahead().charCodeAt(0);
            if (second >= 0xDC00 && second <= 0xDFFF) {
              // Unicode surrogate pair
              pos++;
              return createValue(
                  'symbol',
                  (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000,
                  pos - 2, pos);
            }
          }
        }
        return createValue('symbol', first, pos - 1, pos);
      }

      function createDisjunction(alternatives, from, to) {
        return addRaw({
          type: 'disjunction',
          body: alternatives,
          range: [
            from,
            to
          ]
        });
      }

      function createDot() {
        return addRaw({
          type: 'dot',
          range: [
            pos - 1,
            pos
          ]
        });
      }

      function createCharacterClassEscape(value) {
        return addRaw({
          type: 'characterClassEscape',
          value: value,
          range: [
            pos - 2,
            pos
          ]
        });
      }

      function createReference(matchIndex) {
        return addRaw({
          type: 'reference',
          matchIndex: parseInt(matchIndex, 10),
          range: [
            pos - 1 - matchIndex.length,
            pos
          ]
        });
      }

      function createGroup(behavior, disjunction, from, to) {
        return addRaw({
          type: 'group',
          behavior: behavior,
          body: disjunction,
          range: [
            from,
            to
          ]
        });
      }

      function createQuantifier(min, max, from, to) {
        if (to == null) {
          from = pos - 1;
          to = pos;
        }

        return addRaw({
          type: 'quantifier',
          min: min,
          max: max,
          greedy: true,
          body: null, // set later on
          range: [
            from,
            to
          ]
        });
      }

      function createAlternative(terms, from, to) {
        return addRaw({
          type: 'alternative',
          body: terms,
          range: [
            from,
            to
          ]
        });
      }

      function createCharacterClass(classRanges, negative, from, to) {
        return addRaw({
          type: 'characterClass',
          body: classRanges,
          negative: negative,
          range: [
            from,
            to
          ]
        });
      }

      function createClassRange(min, max, from, to) {
        // See 15.10.2.15:
        if (min.codePoint > max.codePoint) {
          bail('invalid range in character class', min.raw + '-' + max.raw, from, to);
        }

        return addRaw({
          type: 'characterClassRange',
          min: min,
          max: max,
          range: [
            from,
            to
          ]
        });
      }

      function flattenBody(body) {
        if (body.type === 'alternative') {
          return body.body;
        } else {
          return [body];
        }
      }

      function isEmpty(obj) {
        return obj.type === 'empty';
      }

      function incr(amount) {
        amount = (amount || 1);
        var res = str.substring(pos, pos + amount);
        pos += (amount || 1);
        return res;
      }

      function skip(value) {
        if (!match(value)) {
          bail('character', value);
        }
      }

      function match(value) {
        if (str.indexOf(value, pos) === pos) {
          return incr(value.length);
        }
      }

      function lookahead() {
        return str[pos];
      }

      function current(value) {
        return str.indexOf(value, pos) === pos;
      }

      function next(value) {
        return str[pos + 1] === value;
      }

      function matchReg(regExp) {
        var subStr = str.substring(pos);
        var res = subStr.match(regExp);
        if (res) {
          res.range = [];
          res.range[0] = pos;
          incr(res[0].length);
          res.range[1] = pos;
        }
        return res;
      }

      function parseDisjunction() {
        // Disjunction ::
        //      Alternative
        //      Alternative | Disjunction
        var res = [], from = pos;
        res.push(parseAlternative());

        while (match('|')) {
          res.push(parseAlternative());
        }

        if (res.length === 1) {
          return res[0];
        }

        return createDisjunction(res, from, pos);
      }

      function parseAlternative() {
        var res = [], from = pos;
        var term;

        // Alternative ::
        //      [empty]
        //      Alternative Term
        while (term = parseTerm()) {
          res.push(term);
        }

        if (res.length === 1) {
          return res[0];
        }

        return createAlternative(res, from, pos);
      }

      function parseTerm() {
        // Term ::
        //      Anchor
        //      Atom
        //      Atom Quantifier

        if (pos >= str.length || current('|') || current(')')) {
          return null; /* Means: The term is empty */
        }

        var anchor = parseAnchor();

        if (anchor) {
          return anchor;
        }

        var atom = parseAtom();
        if (!atom) {
          bail('Expected atom');
        }
        var quantifier = parseQuantifier() || false;
        if (quantifier) {
          quantifier.body = flattenBody(atom);
          // The quantifier contains the atom. Therefore, the beginning of the
          // quantifier range is given by the beginning of the atom.
          updateRawStart(quantifier, atom.range[0]);
          return quantifier;
        }
        return atom;
      }

      function parseGroup(matchA, typeA, matchB, typeB) {
        var type = null, from = pos;

        if (match(matchA)) {
          type = typeA;
        } else if (match(matchB)) {
          type = typeB;
        } else {
          return false;
        }

        var body = parseDisjunction();
        if (!body) {
          bail('Expected disjunction');
        }
        skip(')');
        var group = createGroup(type, flattenBody(body), from, pos);

        if (type == 'normal') {
          // Keep track of the number of closed groups. This is required for
          // parseDecimalEscape(). In case the string is parsed a second time the
          // value already holds the total count and no incrementation is required.
          if (firstIteration) {
            closedCaptureCounter++;
          }
        }
        return group;
      }

      function parseAnchor() {
        // Anchor ::
        //      ^
        //      $
        //      \ b
        //      \ B
        //      ( ? = Disjunction )
        //      ( ? ! Disjunction )
        var res, from = pos;

        if (match('^')) {
          return createAnchor('start', 1 /* rawLength */);
        } else if (match('$')) {
          return createAnchor('end', 1 /* rawLength */);
        } else if (match('\\b')) {
          return createAnchor('boundary', 2 /* rawLength */);
        } else if (match('\\B')) {
          return createAnchor('not-boundary', 2 /* rawLength */);
        } else {
          return parseGroup('(?=', 'lookahead', '(?!', 'negativeLookahead');
        }
      }

      function parseQuantifier() {
        // Quantifier ::
        //      QuantifierPrefix
        //      QuantifierPrefix ?
        //
        // QuantifierPrefix ::
        //      *
        //      +
        //      ?
        //      { DecimalDigits }
        //      { DecimalDigits , }
        //      { DecimalDigits , DecimalDigits }

        var res, from = pos;
        var quantifier;
        var min, max;

        if (match('*')) {
          quantifier = createQuantifier(0);
        }
        else if (match('+')) {
          quantifier = createQuantifier(1);
        }
        else if (match('?')) {
          quantifier = createQuantifier(0, 1);
        }
        else if (res = matchReg(/^\{([0-9]+)\}/)) {
          min = parseInt(res[1], 10);
          quantifier = createQuantifier(min, min, res.range[0], res.range[1]);
        }
        else if (res = matchReg(/^\{([0-9]+),\}/)) {
          min = parseInt(res[1], 10);
          quantifier = createQuantifier(min, undefined, res.range[0], res.range[1]);
        }
        else if (res = matchReg(/^\{([0-9]+),([0-9]+)\}/)) {
          min = parseInt(res[1], 10);
          max = parseInt(res[2], 10);
          if (min > max) {
            bail('numbers out of order in {} quantifier', '', from, pos);
          }
          quantifier = createQuantifier(min, max, res.range[0], res.range[1]);
        }

        if (quantifier) {
          if (match('?')) {
            quantifier.greedy = false;
            quantifier.range[1] += 1;
          }
        }

        return quantifier;
      }

      function parseAtom() {
        // Atom ::
        //      PatternCharacter
        //      .
        //      \ AtomEscape
        //      CharacterClass
        //      ( Disjunction )
        //      ( ? : Disjunction )

        var res;

        // jviereck: allow ']', '}' here as well to be compatible with browser's
        //   implementations: ']'.match(/]/);
        // if (res = matchReg(/^[^^$\\.*+?()[\]{}|]/)) {
        if (res = matchReg(/^[^^$\\.*+?(){[|]/)) {
          //      PatternCharacter
          return createCharacter(res);
        }
        else if (match('.')) {
          //      .
          return createDot();
        }
        else if (match('\\')) {
          //      \ AtomEscape
          res = parseAtomEscape();
          if (!res) {
            bail('atomEscape');
          }
          return res;
        }
        else if (res = parseCharacterClass()) {
          return res;
        }
        else {
          //      ( Disjunction )
          //      ( ? : Disjunction )
          return parseGroup('(?:', 'ignore', '(', 'normal');
        }
      }

      function parseUnicodeSurrogatePairEscape(firstEscape) {
        if (hasUnicodeFlag) {
          var first, second;
          if (firstEscape.kind == 'unicodeEscape' &&
            (first = firstEscape.codePoint) >= 0xD800 && first <= 0xDBFF &&
            current('\\') && next('u') ) {
            var prevPos = pos;
            pos++;
            var secondEscape = parseClassEscape();
            if (secondEscape.kind == 'unicodeEscape' &&
              (second = secondEscape.codePoint) >= 0xDC00 && second <= 0xDFFF) {
              // Unicode surrogate pair
              firstEscape.range[1] = secondEscape.range[1];
              firstEscape.codePoint = (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
              firstEscape.type = 'value';
              firstEscape.kind = 'unicodeCodePointEscape';
              addRaw(firstEscape);
            }
            else {
              pos = prevPos;
            }
          }
        }
        return firstEscape;
      }

      function parseClassEscape() {
        return parseAtomEscape(true);
      }

      function parseAtomEscape(insideCharacterClass) {
        // AtomEscape ::
        //      DecimalEscape
        //      CharacterEscape
        //      CharacterClassEscape

        var res, from = pos;

        res = parseDecimalEscape();
        if (res) {
          return res;
        }

        // For ClassEscape
        if (insideCharacterClass) {
          if (match('b')) {
            // 15.10.2.19
            // The production ClassEscape :: b evaluates by returning the
            // CharSet containing the one character <BS> (Unicode value 0008).
            return createEscaped('singleEscape', 0x0008, '\\b');
          } else if (match('B')) {
            bail('\\B not possible inside of CharacterClass', '', from);
          }
        }

        res = parseCharacterEscape();

        return res;
      }


      function parseDecimalEscape() {
        // DecimalEscape ::
        //      DecimalIntegerLiteral [lookahead ∉ DecimalDigit]
        //      CharacterClassEscape :: one of d D s S w W

        var res, match;

        if (res = matchReg(/^(?!0)\d+/)) {
          match = res[0];
          var refIdx = parseInt(res[0], 10);
          if (refIdx <= closedCaptureCounter) {
            // If the number is smaller than the normal-groups found so
            // far, then it is a reference...
            return createReference(res[0]);
          } else {
            // ... otherwise it needs to be interpreted as a octal (if the
            // number is in an octal format). If it is NOT octal format,
            // then the slash is ignored and the number is matched later
            // as normal characters.

            // Recall the negative decision to decide if the input must be parsed
            // a second time with the total normal-groups.
            backrefDenied.push(refIdx);

            // Reset the position again, as maybe only parts of the previous
            // matched numbers are actual octal numbers. E.g. in '019' only
            // the '01' should be matched.
            incr(-res[0].length);
            if (res = matchReg(/^[0-7]{1,3}/)) {
              return createEscaped('octal', parseInt(res[0], 8), res[0], 1);
            } else {
              // If we end up here, we have a case like /\91/. Then the
              // first slash is to be ignored and the 9 & 1 to be treated
              // like ordinary characters. Create a character for the
              // first number only here - other number-characters
              // (if available) will be matched later.
              res = createCharacter(matchReg(/^[89]/));
              return updateRawStart(res, res.range[0] - 1);
            }
          }
        }
        // Only allow octal numbers in the following. All matched numbers start
        // with a zero (if the do not, the previous if-branch is executed).
        // If the number is not octal format and starts with zero (e.g. `091`)
        // then only the zeros `0` is treated here and the `91` are ordinary
        // characters.
        // Example:
        //   /\091/.exec('\091')[0].length === 3
        else if (res = matchReg(/^[0-7]{1,3}/)) {
          match = res[0];
          if (/^0{1,3}$/.test(match)) {
            // If they are all zeros, then only take the first one.
            return createEscaped('null', 0x0000, '0', match.length + 1);
          } else {
            return createEscaped('octal', parseInt(match, 8), match, 1);
          }
        } else if (res = matchReg(/^[dDsSwW]/)) {
          return createCharacterClassEscape(res[0]);
        }
        return false;
      }

      function parseCharacterEscape() {
        // CharacterEscape ::
        //      ControlEscape
        //      c ControlLetter
        //      HexEscapeSequence
        //      UnicodeEscapeSequence
        //      IdentityEscape

        var res;
        if (res = matchReg(/^[fnrtv]/)) {
          // ControlEscape
          var codePoint = 0;
          switch (res[0]) {
            case 't': codePoint = 0x009; break;
            case 'n': codePoint = 0x00A; break;
            case 'v': codePoint = 0x00B; break;
            case 'f': codePoint = 0x00C; break;
            case 'r': codePoint = 0x00D; break;
          }
          return createEscaped('singleEscape', codePoint, '\\' + res[0]);
        } else if (res = matchReg(/^c([a-zA-Z])/)) {
          // c ControlLetter
          return createEscaped('controlLetter', res[1].charCodeAt(0) % 32, res[1], 2);
        } else if (res = matchReg(/^x([0-9a-fA-F]{2})/)) {
          // HexEscapeSequence
          return createEscaped('hexadecimalEscape', parseInt(res[1], 16), res[1], 2);
        } else if (res = matchReg(/^u([0-9a-fA-F]{4})/)) {
          // UnicodeEscapeSequence
          return parseUnicodeSurrogatePairEscape(
            createEscaped('unicodeEscape', parseInt(res[1], 16), res[1], 2)
          );
        } else if (hasUnicodeFlag && (res = matchReg(/^u\{([0-9a-fA-F]+)\}/))) {
          // RegExpUnicodeEscapeSequence (ES6 Unicode code point escape)
          return createEscaped('unicodeCodePointEscape', parseInt(res[1], 16), res[1], 4);
        } else {
          // IdentityEscape
          return parseIdentityEscape();
        }
      }

      // Taken from the Esprima parser.
      function isIdentifierPart(ch) {
        // Generated by `tools/generate-identifier-regex.js`.
        var NonAsciiIdentifierPart = new RegExp('[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\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-\u08B2\u08E4-\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\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\u0C59\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\u0D60-\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\u1380-\u138F\u13A0-\u13F4\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-\u19D9\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\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\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\u2E2F\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099\u309A\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA69D\uA69F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\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-\uAB5F\uAB64\uAB65\uABC0-\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-\uFE2D\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]');

        return (ch === 36) || (ch === 95) ||  // $ (dollar) and _ (underscore)
          (ch >= 65 && ch <= 90) ||         // A..Z
          (ch >= 97 && ch <= 122) ||        // a..z
          (ch >= 48 && ch <= 57) ||         // 0..9
          (ch === 92) ||                    // \ (backslash)
          ((ch >= 0x80) && NonAsciiIdentifierPart.test(String.fromCharCode(ch)));
      }

      function parseIdentityEscape() {
        // IdentityEscape ::
        //      SourceCharacter but not IdentifierPart
        //      <ZWJ>
        //      <ZWNJ>

        var ZWJ = '\u200C';
        var ZWNJ = '\u200D';

        var tmp;

        if (!isIdentifierPart(lookahead())) {
          tmp = incr();
          return createEscaped('identifier', tmp.charCodeAt(0), tmp, 1);
        }

        if (match(ZWJ)) {
          // <ZWJ>
          return createEscaped('identifier', 0x200C, ZWJ);
        } else if (match(ZWNJ)) {
          // <ZWNJ>
          return createEscaped('identifier', 0x200D, ZWNJ);
        }

        return null;
      }

      function parseCharacterClass() {
        // CharacterClass ::
        //      [ [lookahead ∉ {^}] ClassRanges ]
        //      [ ^ ClassRanges ]

        var res, from = pos;
        if (res = matchReg(/^\[\^/)) {
          res = parseClassRanges();
          skip(']');
          return createCharacterClass(res, true, from, pos);
        } else if (match('[')) {
          res = parseClassRanges();
          skip(']');
          return createCharacterClass(res, false, from, pos);
        }

        return null;
      }

      function parseClassRanges() {
        // ClassRanges ::
        //      [empty]
        //      NonemptyClassRanges

        var res;
        if (current(']')) {
          // Empty array means nothing insinde of the ClassRange.
          return [];
        } else {
          res = parseNonemptyClassRanges();
          if (!res) {
            bail('nonEmptyClassRanges');
          }
          return res;
        }
      }

      function parseHelperClassRanges(atom) {
        var from, to, res;
        if (current('-') && !next(']')) {
          // ClassAtom - ClassAtom ClassRanges
          skip('-');

          res = parseClassAtom();
          if (!res) {
            bail('classAtom');
          }
          to = pos;
          var classRanges = parseClassRanges();
          if (!classRanges) {
            bail('classRanges');
          }
          from = atom.range[0];
          if (classRanges.type === 'empty') {
            return [createClassRange(atom, res, from, to)];
          }
          return [createClassRange(atom, res, from, to)].concat(classRanges);
        }

        res = parseNonemptyClassRangesNoDash();
        if (!res) {
          bail('nonEmptyClassRangesNoDash');
        }

        return [atom].concat(res);
      }

      function parseNonemptyClassRanges() {
        // NonemptyClassRanges ::
        //      ClassAtom
        //      ClassAtom NonemptyClassRangesNoDash
        //      ClassAtom - ClassAtom ClassRanges

        var atom = parseClassAtom();
        if (!atom) {
          bail('classAtom');
        }

        if (current(']')) {
          // ClassAtom
          return [atom];
        }

        // ClassAtom NonemptyClassRangesNoDash
        // ClassAtom - ClassAtom ClassRanges
        return parseHelperClassRanges(atom);
      }

      function parseNonemptyClassRangesNoDash() {
        // NonemptyClassRangesNoDash ::
        //      ClassAtom
        //      ClassAtomNoDash NonemptyClassRangesNoDash
        //      ClassAtomNoDash - ClassAtom ClassRanges

        var res = parseClassAtom();
        if (!res) {
          bail('classAtom');
        }
        if (current(']')) {
          //      ClassAtom
          return res;
        }

        // ClassAtomNoDash NonemptyClassRangesNoDash
        // ClassAtomNoDash - ClassAtom ClassRanges
        return parseHelperClassRanges(res);
      }

      function parseClassAtom() {
        // ClassAtom ::
        //      -
        //      ClassAtomNoDash
        if (match('-')) {
          return createCharacter('-');
        } else {
          return parseClassAtomNoDash();
        }
      }

      function parseClassAtomNoDash() {
        // ClassAtomNoDash ::
        //      SourceCharacter but not one of \ or ] or -
        //      \ ClassEscape

        var res;
        if (res = matchReg(/^[^\\\]-]/)) {
          return createCharacter(res[0]);
        } else if (match('\\')) {
          res = parseClassEscape();
          if (!res) {
            bail('classEscape');
          }

          return parseUnicodeSurrogatePairEscape(res);
        }
      }

      function bail(message, details, from, to) {
        from = from == null ? pos : from;
        to = to == null ? from : to;

        var contextStart = Math.max(0, from - 10);
        var contextEnd = Math.min(to + 10, str.length);

        // Output a bit of context and a line pointing to where our error is.
        //
        // We are assuming that there are no actual newlines in the content as this is a regular expression.
        var context = '    ' + str.substring(contextStart, contextEnd);
        var pointer = '    ' + new Array(from - contextStart + 1).join(' ') + '^';

        throw SyntaxError(message + ' at position ' + from + (details ? ': ' + details : '') + '\n' + context + '\n' + pointer);
      }

      var backrefDenied = [];
      var closedCaptureCounter = 0;
      var firstIteration = true;
      var hasUnicodeFlag = (flags || "").indexOf("u") !== -1;
      var pos = 0;

      // Convert the input to a string and treat the empty string special.
      str = String(str);
      if (str === '') {
        str = '(?:)';
      }

      var result = parseDisjunction();

      if (result.range[1] !== str.length) {
        bail('Could not parse entire input - got stuck', '', result.range[1]);
      }

      // The spec requires to interpret the `\2` in `/\2()()/` as backreference.
      // As the parser collects the number of capture groups as the string is
      // parsed it is impossible to make these decisions at the point when the
      // `\2` is handled. In case the local decision turns out to be wrong after
      // the parsing has finished, the input string is parsed a second time with
      // the total number of capture groups set.
      //
      // SEE: https://github.com/jviereck/regjsparser/issues/70
      for (var i = 0; i < backrefDenied.length; i++) {
        if (backrefDenied[i] <= closedCaptureCounter) {
          // Parse the input a second time.
          pos = 0;
          firstIteration = false;
          return parseDisjunction();
        }
      }

      return result;
    }

    var regjsparser = {
      parse: parse
    };

    if (typeof module !== 'undefined' && module.exports) {
      module.exports = regjsparser;
    } else {
      window.regjsparser = regjsparser;
    }

  }());
  });

  var require$$3 = (parser && typeof parser === 'object' && 'default' in parser ? parser['default'] : parser);

  var regjsgen = __commonjs(function (module, exports, global) {
  /*!
   * RegJSGen
   * Copyright 2014 Benjamin Tan <https://d10.github.io/>
   * Available under MIT license <http://d10.mit-license.org/>
   */
  ;(function() {
    'use strict';

    /** Used to determine if values are of the language type `Object` */
    var objectTypes = {
      'function': true,
      'object': true
    };

    /** Used as a reference to the global object */
    var root = (objectTypes[typeof window] && window) || this;

    /** Backup possible global object */
    var oldRoot = root;

    /** Detect free variable `exports` */
    var freeExports = objectTypes[typeof exports] && exports;

    /** Detect free variable `module` */
    var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;

    /** Detect free variable `global` from Node.js or Browserified code and use it as `root` */
    var freeGlobal = freeExports && freeModule && typeof global == 'object' && global;
    if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal || freeGlobal.self === freeGlobal)) {
      root = freeGlobal;
    }

    /*--------------------------------------------------------------------------*/

    /*! Based on https://mths.be/fromcodepoint v0.2.0 by @mathias */

    var stringFromCharCode = String.fromCharCode;
    var floor = Math.floor;
    function fromCodePoint() {
      var MAX_SIZE = 0x4000;
      var codeUnits = [];
      var highSurrogate;
      var lowSurrogate;
      var index = -1;
      var length = arguments.length;
      if (!length) {
        return '';
      }
      var result = '';
      while (++index < length) {
        var codePoint = Number(arguments[index]);
        if (
          !isFinite(codePoint) || // `NaN`, `+Infinity`, or `-Infinity`
          codePoint < 0 || // not a valid Unicode code point
          codePoint > 0x10FFFF || // not a valid Unicode code point
          floor(codePoint) != codePoint // not an integer
        ) {
          throw RangeError('Invalid code point: ' + codePoint);
        }
        if (codePoint <= 0xFFFF) {
          // BMP code point
          codeUnits.push(codePoint);
        } else {
          // Astral code point; split in surrogate halves
          // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
          codePoint -= 0x10000;
          highSurrogate = (codePoint >> 10) + 0xD800;
          lowSurrogate = (codePoint % 0x400) + 0xDC00;
          codeUnits.push(highSurrogate, lowSurrogate);
        }
        if (index + 1 == length || codeUnits.length > MAX_SIZE) {
          result += stringFromCharCode.apply(null, codeUnits);
          codeUnits.length = 0;
        }
      }
      return result;
    }

    function assertType(type, expected) {
      if (expected.indexOf('|') == -1) {
        if (type == expected) {
          return;
        }

        throw Error('Invalid node type: ' + type);
      }

      expected = assertType.hasOwnProperty(expected)
        ? assertType[expected]
        : (assertType[expected] = RegExp('^(?:' + expected + ')$'));

      if (expected.test(type)) {
        return;
      }

      throw Error('Invalid node type: ' + type);
    }

    /*--------------------------------------------------------------------------*/

    function generate(node) {
      var type = node.type;

      if (generate.hasOwnProperty(type) && typeof generate[type] == 'function') {
        return generate[type](node);
      }

      throw Error('Invalid node type: ' + type);
    }

    /*--------------------------------------------------------------------------*/

    function generateAlternative(node) {
      assertType(node.type, 'alternative');

      var terms = node.body,
          length = terms ? terms.length : 0;

      if (length == 1) {
        return generateTerm(terms[0]);
      } else {
        var i = -1,
            result = '';

        while (++i < length) {
          result += generateTerm(terms[i]);
        }

        return result;
      }
    }

    function generateAnchor(node) {
      assertType(node.type, 'anchor');

      switch (node.kind) {
        case 'start':
          return '^';
        case 'end':
          return '$';
        case 'boundary':
          return '\\b';
        case 'not-boundary':
          return '\\B';
        default:
          throw Error('Invalid assertion');
      }
    }

    function generateAtom(node) {
      assertType(node.type, 'anchor|characterClass|characterClassEscape|dot|group|reference|value');

      return generate(node);
    }

    function generateCharacterClass(node) {
      assertType(node.type, 'characterClass');

      var classRanges = node.body,
          length = classRanges ? classRanges.length : 0;

      var i = -1,
          result = '[';

      if (node.negative) {
        result += '^';
      }

      while (++i < length) {
        result += generateClassAtom(classRanges[i]);
      }

      result += ']';

      return result;
    }

    function generateCharacterClassEscape(node) {
      assertType(node.type, 'characterClassEscape');

      return '\\' + node.value;
    }

    function generateCharacterClassRange(node) {
      assertType(node.type, 'characterClassRange');

      var min = node.min,
          max = node.max;

      if (min.type == 'characterClassRange' || max.type == 'characterClassRange') {
        throw Error('Invalid character class range');
      }

      return generateClassAtom(min) + '-' + generateClassAtom(max);
    }

    function generateClassAtom(node) {
      assertType(node.type, 'anchor|characterClassEscape|characterClassRange|dot|value');

      return generate(node);
    }

    function generateDisjunction(node) {
      assertType(node.type, 'disjunction');

      var body = node.body,
          length = body ? body.length : 0;

      if (length == 0) {
        throw Error('No body');
      } else if (length == 1) {
        return generate(body[0]);
      } else {
        var i = -1,
            result = '';

        while (++i < length) {
          if (i != 0) {
            result += '|';
          }
          result += generate(body[i]);
        }

        return result;
      }
    }

    function generateDot(node) {
      assertType(node.type, 'dot');

      return '.';
    }

    function generateGroup(node) {
      assertType(node.type, 'group');

      var result = '(';

      switch (node.behavior) {
        case 'normal':
          break;
        case 'ignore':
          result += '?:';
          break;
        case 'lookahead':
          result += '?=';
          break;
        case 'negativeLookahead':
          result += '?!';
          break;
        default:
          throw Error('Invalid behaviour: ' + node.behaviour);
      }

      var body = node.body,
          length = body ? body.length : 0;

      if (length == 1) {
        result += generate(body[0]);
      } else {
        var i = -1;

        while (++i < length) {
          result += generate(body[i]);
        }
      }

      result += ')';

      return result;
    }

    function generateQuantifier(node) {
      assertType(node.type, 'quantifier');

      var quantifier = '',
          min = node.min,
          max = node.max;

      switch (max) {
        case undefined:
        case null:
          switch (min) {
            case 0:
              quantifier = '*'
              break;
            case 1:
              quantifier = '+';
              break;
            default:
              quantifier = '{' + min + ',}';
              break;
          }
          break;
        default:
          if (min == max) {
            quantifier = '{' + min + '}';
          }
          else if (min == 0 && max == 1) {
            quantifier = '?';
          } else {
            quantifier = '{' + min + ',' + max + '}';
          }
          break;
      }

      if (!node.greedy) {
        quantifier += '?';
      }

      return generateAtom(node.body[0]) + quantifier;
    }

    function generateReference(node) {
      assertType(node.type, 'reference');

      return '\\' + node.matchIndex;
    }

    function generateTerm(node) {
      assertType(node.type, 'anchor|characterClass|characterClassEscape|empty|group|quantifier|reference|value');

      return generate(node);
    }

    function generateValue(node) {
      assertType(node.type, 'value');

      var kind = node.kind,
          codePoint = node.codePoint;

      switch (kind) {
        case 'controlLetter':
          return '\\c' + fromCodePoint(codePoint + 64);
        case 'hexadecimalEscape':
          return '\\x' + ('00' + codePoint.toString(16).toUpperCase()).slice(-2);
        case 'identifier':
          return '\\' + fromCodePoint(codePoint);
        case 'null':
          return '\\' + codePoint;
        case 'octal':
          return '\\' + codePoint.toString(8);
        case 'singleEscape':
          switch (codePoint) {
            case 0x0008:
              return '\\b';
            case 0x009:
              return '\\t';
            case 0x00A:
              return '\\n';
            case 0x00B:
              return '\\v';
            case 0x00C:
              return '\\f';
            case 0x00D:
              return '\\r';
            default:
              throw Error('Invalid codepoint: ' + codePoint);
          }
        case 'symbol':
          return fromCodePoint(codePoint);
        case 'unicodeEscape':
          return '\\u' + ('0000' + codePoint.toString(16).toUpperCase()).slice(-4);
        case 'unicodeCodePointEscape':
          return '\\u{' + codePoint.toString(16).toUpperCase() + '}';
        default:
          throw Error('Unsupported node kind: ' + kind);
      }
    }

    /*--------------------------------------------------------------------------*/

    generate.alternative = generateAlternative;
    generate.anchor = generateAnchor;
    generate.characterClass = generateCharacterClass;
    generate.characterClassEscape = generateCharacterClassEscape;
    generate.characterClassRange = generateCharacterClassRange;
    generate.disjunction = generateDisjunction;
    generate.dot = generateDot;
    generate.group = generateGroup;
    generate.quantifier = generateQuantifier;
    generate.reference = generateReference;
    generate.value = generateValue;

    /*--------------------------------------------------------------------------*/

    // export regjsgen
    // some AMD build optimizers, like r.js, check for condition patterns like the following:
    if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {
      // define as an anonymous module so, through path mapping, it can be aliased
      define(function() {
        return {
          'generate': generate
        };
      });
    }
    // check for `exports` after `define` in case a build optimizer adds an `exports` object
    else if (freeExports && freeModule) {
      // in Narwhal, Node.js, Rhino -require, or RingoJS
      freeExports.generate = generate;
    }
    // in a browser or Rhino
    else {
      root.regjsgen = {
        'generate': generate
      };
    }
  }.call(__commonjs_global));
  });

  var require$$4 = (regjsgen && typeof regjsgen === 'object' && 'default' in regjsgen ? regjsgen['default'] : regjsgen);

  var rewritePattern = __commonjs(function (module) {
  var generate = require$$4.generate;
  var parse = require$$3.parse;
  var regenerate = require$$0$2;
  var iuMappings = require$$1;
  var ESCAPE_SETS = require$$0$1;

  function getCharacterClassEscapeSet(character) {
  	if (unicode) {
  		if (ignoreCase) {
  			return ESCAPE_SETS.UNICODE_IGNORE_CASE[character];
  		}
  		return ESCAPE_SETS.UNICODE[character];
  	}
  	return ESCAPE_SETS.REGULAR[character];
  }

  var object = {};
  var hasOwnProperty = object.hasOwnProperty;
  function has(object, property) {
  	return hasOwnProperty.call(object, property);
  }

  // Prepare a Regenerate set containing all code points, used for negative
  // character classes (if any).
  var UNICODE_SET = regenerate().addRange(0x0, 0x10FFFF);
  // Without the `u` flag, the range stops at 0xFFFF.
  // https://mths.be/es6#sec-pattern-semantics
  var BMP_SET = regenerate().addRange(0x0, 0xFFFF);

  // Prepare a Regenerate set containing all code points that are supposed to be
  // matched by `/./u`. https://mths.be/es6#sec-atom
  var DOT_SET_UNICODE = UNICODE_SET.clone() // all Unicode code points
  	.remove(
  		// minus `LineTerminator`s (https://mths.be/es6#sec-line-terminators):
  		0x000A, // Line Feed <LF>
  		0x000D, // Carriage Return <CR>
  		0x2028, // Line Separator <LS>
  		0x2029  // Paragraph Separator <PS>
  	);
  // Prepare a Regenerate set containing all code points that are supposed to be
  // matched by `/./` (only BMP code points).
  var DOT_SET = DOT_SET_UNICODE.clone()
  	.intersection(BMP_SET);

  // Add a range of code points + any case-folded code points in that range to a
  // set.
  regenerate.prototype.iuAddRange = function(min, max) {
  	var $this = this;
  	do {
  		var folded = caseFold(min);
  		if (folded) {
  			$this.add(folded);
  		}
  	} while (++min <= max);
  	return $this;
  };

  function assign(target, source) {
  	for (var key in source) {
  		// Note: `hasOwnProperty` is not needed here.
  		target[key] = source[key];
  	}
  }

  function update(item, pattern) {
  	// TODO: Test if memoizing `pattern` here is worth the effort.
  	if (!pattern) {
  		return;
  	}
  	var tree = parse(pattern, '');
  	switch (tree.type) {
  		case 'characterClass':
  		case 'group':
  		case 'value':
  			// No wrapping needed.
  			break;
  		default:
  			// Wrap the pattern in a non-capturing group.
  			tree = wrap(tree, pattern);
  	}
  	assign(item, tree);
  }

  function wrap(tree, pattern) {
  	// Wrap the pattern in a non-capturing group.
  	return {
  		'type': 'group',
  		'behavior': 'ignore',
  		'body': [tree],
  		'raw': '(?:' + pattern + ')'
  	};
  }

  function caseFold(codePoint) {
  	return has(iuMappings, codePoint) ? iuMappings[codePoint] : false;
  }

  var ignoreCase = false;
  var unicode = false;
  function processCharacterClass(characterClassItem) {
  	var set = regenerate();
  	var body = characterClassItem.body.forEach(function(item) {
  		switch (item.type) {
  			case 'value':
  				set.add(item.codePoint);
  				if (ignoreCase && unicode) {
  					var folded = caseFold(item.codePoint);
  					if (folded) {
  						set.add(folded);
  					}
  				}
  				break;
  			case 'characterClassRange':
  				var min = item.min.codePoint;
  				var max = item.max.codePoint;
  				set.addRange(min, max);
  				if (ignoreCase && unicode) {
  					set.iuAddRange(min, max);
  				}
  				break;
  			case 'characterClassEscape':
  				set.add(getCharacterClassEscapeSet(item.value));
  				break;
  			// The `default` clause is only here as a safeguard; it should never be
  			// reached. Code coverage tools should ignore it.
  			/* istanbul ignore next */
  			default:
  				throw Error('Unknown term type: ' + item.type);
  		}
  	});
  	if (characterClassItem.negative) {
  		set = (unicode ? UNICODE_SET : BMP_SET).clone().remove(set);
  	}
  	update(characterClassItem, set.toString());
  	return characterClassItem;
  }

  function processTerm(item) {
  	switch (item.type) {
  		case 'dot':
  			update(
  				item,
  				(unicode ? DOT_SET_UNICODE : DOT_SET).toString()
  			);
  			break;
  		case 'characterClass':
  			item = processCharacterClass(item);
  			break;
  		case 'characterClassEscape':
  			update(
  				item,
  				getCharacterClassEscapeSet(item.value).toString()
  			);
  			break;
  		case 'alternative':
  		case 'disjunction':
  		case 'group':
  		case 'quantifier':
  			item.body = item.body.map(processTerm);
  			break;
  		case 'value':
  			var codePoint = item.codePoint;
  			var set = regenerate(codePoint);
  			if (ignoreCase && unicode) {
  				var folded = caseFold(codePoint);
  				if (folded) {
  					set.add(folded);
  				}
  			}
  			update(item, set.toString());
  			break;
  		case 'anchor':
  		case 'empty':
  		case 'group':
  		case 'reference':
  			// Nothing to do here.
  			break;
  		// The `default` clause is only here as a safeguard; it should never be
  		// reached. Code coverage tools should ignore it.
  		/* istanbul ignore next */
  		default:
  			throw Error('Unknown term type: ' + item.type);
  	}
  	return item;
  };

  module.exports = function(pattern, flags) {
  	var tree = parse(pattern, flags);
  	ignoreCase = flags ? flags.indexOf('i') > -1 : false;
  	unicode = flags ? flags.indexOf('u') > -1 : false;
  	assign(tree, processTerm(tree));
  	return generate(tree);
  };
  });

  var rewritePattern$1 = (rewritePattern && typeof rewritePattern === 'object' && 'default' in rewritePattern ? rewritePattern['default'] : rewritePattern);

  var Literal = (function (Node) {
  	function Literal () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) Literal.__proto__ = Node;
  	Literal.prototype = Object.create( Node && Node.prototype );
  	Literal.prototype.constructor = Literal;

  	Literal.prototype.initialise = function initialise () {
  		if ( typeof this.value === 'string' ) {
  			this.program.indentExclusionElements.push( this );
  		}
  	};

  	Literal.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.numericLiteral ) {
  			var leading = this.raw.slice( 0, 2 );
  			if ( leading === '0b' || leading === '0o' ) {
  				code.overwrite( this.start, this.end, String( this.value ), true );
  			}
  		}

  		if ( this.regex ) {
  			var ref = this.regex;
  			var pattern = ref.pattern;
  			var flags = ref.flags;

  			if ( transforms.stickyRegExp && /y/.test( flags ) ) throw new CompileError( this, 'Regular expression sticky flag is not supported' );
  			if ( transforms.unicodeRegExp && /u/.test( flags ) ) {
  				code.overwrite( this.start, this.end, ("/" + (rewritePattern$1( pattern, flags )) + "/" + (flags.replace( 'u', '' ))) );
  			}
  		}
  	};

  	return Literal;
  }(Node));

  var MemberExpression = (function (Node) {
  	function MemberExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) MemberExpression.__proto__ = Node;
  	MemberExpression.prototype = Object.create( Node && Node.prototype );
  	MemberExpression.prototype.constructor = MemberExpression;

  	MemberExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.reservedProperties && reserved[ this.property.name ] ) {
  			code.overwrite( this.object.end, this.property.start, "['" );
  			code.insertLeft( this.property.end, "']" );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return MemberExpression;
  }(Node));

  var NewExpression = (function (Node) {
  	function NewExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) NewExpression.__proto__ = Node;
  	NewExpression.prototype = Object.create( Node && Node.prototype );
  	NewExpression.prototype.constructor = NewExpression;

  	NewExpression.prototype.initialise = function initialise ( transforms ) {
  		var this$1 = this;

  		if ( transforms.spreadRest && this.arguments.length ) {
  			var lexicalBoundary = this.findLexicalBoundary();

  			var i = this.arguments.length;
  			while ( i-- ) {
  				var arg = this$1.arguments[i];
  				if ( arg.type === 'SpreadElement' && isArguments( arg.argument ) ) {
  					this$1.argumentsArrayAlias = lexicalBoundary.getArgumentsArrayAlias();
  					break;
  				}
  			}
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	NewExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.spreadRest && this.arguments.length ) {
  			var firstArgument = this.arguments[0];
  			var isNew = true;
  			var hasSpreadElements = spread( code, this.arguments, firstArgument.start, this.argumentsArrayAlias, isNew );

  			if ( hasSpreadElements ) {
  				code.insertRight( this.start + 'new'.length, ' (Function.prototype.bind.apply(' );
  				code.overwrite( this.callee.end, firstArgument.start, ', [ null ].concat( ' );
  				code.insertLeft( this.end, ' ))' );
  			}
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return NewExpression;
  }(Node));

  var ObjectExpression = (function (Node) {
  	function ObjectExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ObjectExpression.__proto__ = Node;
  	ObjectExpression.prototype = Object.create( Node && Node.prototype );
  	ObjectExpression.prototype.constructor = ObjectExpression;

  	ObjectExpression.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		Node.prototype.transpile.call( this, code, transforms );

  		var firstPropertyStart = this.start + 1;
  		var regularPropertyCount = 0;
  		var spreadPropertyCount = 0;
  		var computedPropertyCount = 0;

  		for ( var i$2 = 0, list = this.properties; i$2 < list.length; i$2 += 1 ) {
  			var prop = list[i$2];

  			if ( prop.type === 'SpreadProperty' ) {
  				spreadPropertyCount += 1;
  			} else if ( prop.computed ) {
  				computedPropertyCount += 1;
  			} else if ( prop.type === 'Property' ) {
  				regularPropertyCount += 1;
  			}
  		}

  		if ( spreadPropertyCount ) {
  			if ( !this.program.options.objectAssign ) {
  				throw new CompileError( this, 'Object spread operator requires specified objectAssign option with \'Object.assign\' or polyfill helper.' );
  			}
  			// enclose run of non-spread properties in curlies
  			var i = this.properties.length;
  			if ( regularPropertyCount ) {
  				while ( i-- ) {
  					var prop$1 = this$1.properties[i];

  					if ( prop$1.type === 'Property' && !prop$1.computed ) {
  						var lastProp = this$1.properties[ i - 1 ];
  						var nextProp = this$1.properties[ i + 1 ];

  						if ( !lastProp || lastProp.type !== 'Property' || lastProp.computed ) {
  							code.insertRight( prop$1.start, '{' );
  						}

  						if ( !nextProp || nextProp.type !== 'Property' || nextProp.computed ) {
  							code.insertLeft( prop$1.end, '}' );
  						}
  					}
  				}
  			}

  			// wrap the whole thing in Object.assign
  			firstPropertyStart = this.properties[0].start;
  			code.overwrite( this.start, firstPropertyStart, ((this.program.options.objectAssign) + "({}, "));
  			code.overwrite( this.properties[ this.properties.length - 1 ].end, this.end, ')' );
  		}

  		if ( computedPropertyCount && transforms.computedProperty ) {
  			var i0 = this.getIndentation();

  			var isSimpleAssignment;
  			var name;

  			if ( this.parent.type === 'VariableDeclarator' && this.parent.parent.declarations.length === 1 ) {
  				isSimpleAssignment = true;
  				name = this.parent.id.alias || this.parent.id.name; // TODO is this right?
  			} else if ( this.parent.type === 'AssignmentExpression' && this.parent.parent.type === 'ExpressionStatement' && this.parent.left.type === 'Identifier' ) {
  				isSimpleAssignment = true;
  				name = this.parent.left.alias || this.parent.left.name; // TODO is this right?
  			} else if ( this.parent.type === 'AssignmentPattern' && this.parent.left.type === 'Identifier' ) {
  				isSimpleAssignment = true;
  				name = this.parent.left.alias || this.parent.left.name; // TODO is this right?
  			}

  			// handle block scoping
  			var declaration = this.findScope( false ).findDeclaration( name );
  			if ( declaration ) name = declaration.name;

  			var start = firstPropertyStart;
  			var end = this.end;

  			if ( isSimpleAssignment ) {
  				// ???
  			} else {
  				name = this.findScope( true ).createIdentifier( 'obj' );

  				var statement = this.findNearest( /(?:Statement|Declaration)$/ );
  				code.insertLeft( statement.end, ("\n" + i0 + "var " + name + ";") );

  				code.insertRight( this.start, ("( " + name + " = ") );
  			}

  			var len = this.properties.length;
  			var lastComputedProp;
  			var sawNonComputedProperty = false;

  			for ( var i$1 = 0; i$1 < len; i$1 += 1 ) {
  				var prop$2 = this$1.properties[i$1];

  				if ( prop$2.computed ) {
  					lastComputedProp = prop$2;
  					var moveStart = i$1 > 0 ? this$1.properties[ i$1 - 1 ].end : start;

  					var propId = isSimpleAssignment ? (";\n" + i0 + name) : (", " + name);

  					if (moveStart < prop$2.start) {
  						code.overwrite( moveStart, prop$2.start, propId );
  					} else {
  						code.insertRight( prop$2.start, propId );
  					}

  					var c = prop$2.key.end;
  					while ( code.original[c] !== ']' ) c += 1;
  					c += 1;

  					if ( prop$2.value.start > c ) code.remove( c, prop$2.value.start );
  					code.insertLeft( c, ' = ' );
  					code.move( moveStart, prop$2.end, end );

  					if ( i$1 < len - 1 && ! sawNonComputedProperty ) {
  						// remove trailing comma
  						c = prop$2.end;
  						while ( code.original[c] !== ',' ) c += 1;

  						code.remove( prop$2.end, c + 1 );
  					}

  					if ( prop$2.method && transforms.conciseMethodProperty ) {
  						code.insertRight( prop$2.value.start, 'function ' );
  					}
  				} else {
  					sawNonComputedProperty = true;
  				}
  			}

  			// special case
  			if ( computedPropertyCount === len ) {
  				code.remove( this.properties[ len - 1 ].end, this.end - 1 );
  			}

  			if ( !isSimpleAssignment ) {
  				code.insertLeft( lastComputedProp.end, (", " + name + " )") );
  			}
  		}
  	};

  	return ObjectExpression;
  }(Node));

  var Property = (function (Node) {
  	function Property () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) Property.__proto__ = Node;
  	Property.prototype = Object.create( Node && Node.prototype );
  	Property.prototype.constructor = Property;

  	Property.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.conciseMethodProperty && !this.computed && this.parent.type !== 'ObjectPattern' ) {
  			if ( this.shorthand ) {
  				code.insertRight( this.start, ((this.key.name) + ": ") );
  			} else if ( this.method ) {
  				var name = '';
  				if ( this.program.options.namedFunctionExpressions !== false ) {
  					if ( this.key.type === 'Literal' && typeof this.key.value === 'number' ) {
  						name = "";
  					} else if ( this.key.type === 'Identifier' ) {
  						if ( reserved[ this.key.name ] ||
  							 ! /^[a-z_$][a-z0-9_$]*$/i.test( this.key.name ) ||
  						     this.value.body.scope.references[this.key.name] ) {
  							name = this.findScope( true ).createIdentifier( this.key.name );
  						} else {
  							name = this.key.name;
  						}
  					} else {
  						name = this.findScope( true ).createIdentifier( this.key.value );
  					}
  					name = ' ' + name;
  				}

  				if ( this.value.generator ) code.remove( this.start, this.key.start );
  				code.insertLeft( this.key.end, (": function" + (this.value.generator ? '*' : '') + name) );
  			}
  		}

  		if ( transforms.reservedProperties && reserved[ this.key.name ] ) {
  			code.insertRight( this.key.start, "'" );
  			code.insertLeft( this.key.end, "'" );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return Property;
  }(Node));

  var ReturnStatement = (function (Node) {
  	function ReturnStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ReturnStatement.__proto__ = Node;
  	ReturnStatement.prototype = Object.create( Node && Node.prototype );
  	ReturnStatement.prototype.constructor = ReturnStatement;

  	ReturnStatement.prototype.initialise = function initialise ( transforms ) {
  		this.loop = this.findNearest( loopStatement );
  		this.nearestFunction = this.findNearest( /Function/ );

  		if ( this.loop && ( !this.nearestFunction || this.loop.depth > this.nearestFunction.depth ) ) {
  			this.loop.canReturn = true;
  			this.shouldWrap = true;
  		}

  		if ( this.argument ) this.argument.initialise( transforms );
  	};

  	ReturnStatement.prototype.transpile = function transpile ( code, transforms ) {
  		var shouldWrap = this.shouldWrap && this.loop && this.loop.shouldRewriteAsFunction;

  		if ( this.argument ) {
  			if ( shouldWrap ) code.insertRight( this.argument.start, "{ v: " );
  			this.argument.transpile( code, transforms );
  			if ( shouldWrap ) code.insertLeft( this.argument.end, " }" );
  		} else if ( shouldWrap ) {
  			code.insertLeft( this.start + 6, ' {}' );
  		}
  	};

  	return ReturnStatement;
  }(Node));

  var SpreadProperty = (function (Node) {
  	function SpreadProperty () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) SpreadProperty.__proto__ = Node;
  	SpreadProperty.prototype = Object.create( Node && Node.prototype );
  	SpreadProperty.prototype.constructor = SpreadProperty;

  	SpreadProperty.prototype.transpile = function transpile ( code, transforms ) {
  		code.remove( this.start, this.argument.start );
  		code.remove( this.argument.end, this.end );

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return SpreadProperty;
  }(Node));

  var Super = (function (Node) {
  	function Super () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) Super.__proto__ = Node;
  	Super.prototype = Object.create( Node && Node.prototype );
  	Super.prototype.constructor = Super;

  	Super.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.classes ) {
  			this.method = this.findNearest( 'MethodDefinition' );
  			if ( !this.method ) throw new CompileError( this, 'use of super outside class method' );

  			var parentClass = this.findNearest( 'ClassBody' ).parent;
  			this.superClassName = parentClass.superClass && (parentClass.superClass.name || 'superclass');

  			if ( !this.superClassName ) throw new CompileError( this, 'super used in base class' );

  			this.isCalled = this.parent.type === 'CallExpression' && this === this.parent.callee;

  			if ( this.method.kind !== 'constructor' && this.isCalled ) {
  				throw new CompileError( this, 'super() not allowed outside class constructor' );
  			}

  			this.isMember = this.parent.type === 'MemberExpression';

  			if ( !this.isCalled && !this.isMember ) {
  				throw new CompileError( this, 'Unexpected use of `super` (expected `super(...)` or `super.*`)' );
  			}
  		}

  		if ( transforms.arrow ) {
  			var lexicalBoundary = this.findLexicalBoundary();
  			var arrowFunction = this.findNearest( 'ArrowFunctionExpression' );
  			var loop = this.findNearest( loopStatement );

  			if ( arrowFunction && arrowFunction.depth > lexicalBoundary.depth ) {
  				this.thisAlias = lexicalBoundary.getThisAlias();
  			}

  			if ( loop && loop.body.contains( this ) && loop.depth > lexicalBoundary.depth ) {
  				this.thisAlias = lexicalBoundary.getThisAlias();
  			}
  		}
  	};

  	Super.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.classes ) {
  			var expression = ( this.isCalled || this.method.static ) ?
  				this.superClassName :
  				((this.superClassName) + ".prototype");

  			code.overwrite( this.start, this.end, expression, true );

  			var callExpression = this.isCalled ? this.parent : this.parent.parent;

  			if ( callExpression && callExpression.type === 'CallExpression' ) {
  				if ( !this.noCall ) { // special case – `super( ...args )`
  					code.insertLeft( callExpression.callee.end, '.call' );
  				}

  				var thisAlias = this.thisAlias || 'this';

  				if ( callExpression.arguments.length ) {
  					code.insertLeft( callExpression.arguments[0].start, (thisAlias + ", ") );
  				} else {
  					code.insertLeft( callExpression.end - 1, ("" + thisAlias) );
  				}
  			}
  		}
  	};

  	return Super;
  }(Node));

  var TaggedTemplateExpression = (function (Node) {
  	function TaggedTemplateExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) TaggedTemplateExpression.__proto__ = Node;
  	TaggedTemplateExpression.prototype = Object.create( Node && Node.prototype );
  	TaggedTemplateExpression.prototype.constructor = TaggedTemplateExpression;

  	TaggedTemplateExpression.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.templateString && !transforms.dangerousTaggedTemplateString ) {
  			throw new CompileError( this, 'Tagged template strings are not supported. Use `transforms: { templateString: false }` to skip transformation and disable this error, or `transforms: { dangerousTaggedTemplateString: true }` if you know what you\'re doing' );
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	TaggedTemplateExpression.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.templateString && transforms.dangerousTaggedTemplateString ) {
  			var ordered = this.quasi.expressions.concat( this.quasi.quasis ).sort( function ( a, b ) { return a.start - b.start; } );

  			// insert strings at start
  			var templateStrings = this.quasi.quasis.map( function ( quasi ) { return JSON.stringify( quasi.value.cooked ); } );
  			code.overwrite( this.tag.end, ordered[0].start, ("([" + (templateStrings.join(', ')) + "]") );

  			var lastIndex = ordered[0].start;
  			ordered.forEach( function ( node ) {
  				if ( node.type === 'TemplateElement' ) {
  					code.remove( lastIndex, node.end );
  				} else {
  					code.overwrite( lastIndex, node.start, ', ' );
  				}

  				lastIndex = node.end;
  			});

  			code.overwrite( lastIndex, this.end, ')' );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return TaggedTemplateExpression;
  }(Node));

  var TemplateElement = (function (Node) {
  	function TemplateElement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) TemplateElement.__proto__ = Node;
  	TemplateElement.prototype = Object.create( Node && Node.prototype );
  	TemplateElement.prototype.constructor = TemplateElement;

  	TemplateElement.prototype.initialise = function initialise () {
  		this.program.indentExclusionElements.push( this );
  	};

  	return TemplateElement;
  }(Node));

  var TemplateLiteral = (function (Node) {
  	function TemplateLiteral () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) TemplateLiteral.__proto__ = Node;
  	TemplateLiteral.prototype = Object.create( Node && Node.prototype );
  	TemplateLiteral.prototype.constructor = TemplateLiteral;

  	TemplateLiteral.prototype.transpile = function transpile ( code, transforms ) {
  		if ( transforms.templateString && this.parent.type !== 'TaggedTemplateExpression' ) {
  			var ordered = this.expressions.concat( this.quasis )
  				.sort( function ( a, b ) { return a.start - b.start || a.end - b.end; } )
  				.filter( function ( node, i ) {
  					// include all expressions
  					if ( node.type !== 'TemplateElement' ) return true;

  					// include all non-empty strings
  					if ( node.value.raw ) return true;

  					// exclude all empty strings not at the head
  					return !i;
  				});

  			// special case – we may be able to skip the first element,
  			// if it's the empty string, but only if the second and
  			// third elements aren't both expressions (since they maybe
  			// be numeric, and `1 + 2 + '3' === '33'`)
  			if ( ordered.length >= 3 ) {
  				var first = ordered[0];
  				var third = ordered[2];
  				if ( first.type === 'TemplateElement' && first.value.raw === '' && third.type === 'TemplateElement' ) {
  					ordered.shift();
  				}
  			}

  			var parenthesise = ( this.quasis.length !== 1 || this.expressions.length !== 0 ) &&
  			                     this.parent.type !== 'AssignmentExpression' &&
  			                     this.parent.type !== 'AssignmentPattern' &&
  			                     this.parent.type !== 'VariableDeclarator' &&
  			                     ( this.parent.type !== 'BinaryExpression' || this.parent.operator !== '+' );

  			if ( parenthesise ) code.insertRight( this.start, '(' );

  			var lastIndex = this.start;

  			ordered.forEach( function ( node, i ) {
  				if ( node.type === 'TemplateElement' ) {
  					var replacement = '';
  					if ( i ) replacement += ' + ';
  					replacement += JSON.stringify( node.value.cooked );

  					code.overwrite( lastIndex, node.end, replacement );
  				} else {
  					var parenthesise = node.type !== 'Identifier'; // TODO other cases where it's safe

  					var replacement$1 = '';
  					if ( i ) replacement$1 += ' + ';
  					if ( parenthesise ) replacement$1 += '(';

  					code.overwrite( lastIndex, node.start, replacement$1 );

  					if ( parenthesise ) code.insertLeft( node.end, ')' );
  				}

  				lastIndex = node.end;
  			});

  			var close = '';
  			if ( parenthesise ) close += ')';

  			code.overwrite( lastIndex, this.end, close );
  		}

  		Node.prototype.transpile.call( this, code, transforms );
  	};

  	return TemplateLiteral;
  }(Node));

  var ThisExpression = (function (Node) {
  	function ThisExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) ThisExpression.__proto__ = Node;
  	ThisExpression.prototype = Object.create( Node && Node.prototype );
  	ThisExpression.prototype.constructor = ThisExpression;

  	ThisExpression.prototype.initialise = function initialise ( transforms ) {
  		if ( transforms.arrow ) {
  			var lexicalBoundary = this.findLexicalBoundary();
  			var arrowFunction = this.findNearest( 'ArrowFunctionExpression' );
  			var loop = this.findNearest( loopStatement );

  			if ( ( arrowFunction && arrowFunction.depth > lexicalBoundary.depth )
  			|| ( loop && loop.body.contains( this ) && loop.depth > lexicalBoundary.depth )
  			|| ( loop && loop.right && loop.right.contains( this ) ) ) {
  				this.alias = lexicalBoundary.getThisAlias();
  			}
  		}
  	};

  	ThisExpression.prototype.transpile = function transpile ( code ) {
  		if ( this.alias ) {
  			code.overwrite( this.start, this.end, this.alias, true );
  		}
  	};

  	return ThisExpression;
  }(Node));

  var UpdateExpression = (function (Node) {
  	function UpdateExpression () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) UpdateExpression.__proto__ = Node;
  	UpdateExpression.prototype = Object.create( Node && Node.prototype );
  	UpdateExpression.prototype.constructor = UpdateExpression;

  	UpdateExpression.prototype.initialise = function initialise ( transforms ) {
  		if ( this.argument.type === 'Identifier' ) {
  			var declaration = this.findScope( false ).findDeclaration( this.argument.name );
  			if ( declaration && declaration.kind === 'const' ) {
  				throw new CompileError( this, ((this.argument.name) + " is read-only") );
  			}

  			// special case – https://gitlab.com/Rich-Harris/buble/issues/150
  			var statement = declaration && declaration.node.ancestor( 3 );
  			if ( statement && statement.type === 'ForStatement' && statement.body.contains( this ) ) {
  				statement.reassigned[ this.argument.name ] = true;
  			}
  		}

  		Node.prototype.initialise.call( this, transforms );
  	};

  	return UpdateExpression;
  }(Node));

  var VariableDeclaration = (function (Node) {
  	function VariableDeclaration () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) VariableDeclaration.__proto__ = Node;
  	VariableDeclaration.prototype = Object.create( Node && Node.prototype );
  	VariableDeclaration.prototype.constructor = VariableDeclaration;

  	VariableDeclaration.prototype.initialise = function initialise ( transforms ) {
  		this.scope = this.findScope( this.kind === 'var' );
  		this.declarations.forEach( function ( declarator ) { return declarator.initialise( transforms ); } );
  	};

  	VariableDeclaration.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		var i0 = this.getIndentation();
  		var kind = this.kind;

  		if ( transforms.letConst && kind !== 'var' ) {
  			kind = 'var';
  			code.overwrite( this.start, this.start + this.kind.length, kind, true );
  		}

  		if ( transforms.destructuring && this.parent.type !== 'ForOfStatement' ) {
  			var c = this.start;
  			var lastDeclaratorIsPattern;

  			this.declarations.forEach( function ( declarator, i ) {
  				if ( declarator.id.type === 'Identifier' ) {
  					if ( i > 0 && this$1.declarations[ i - 1 ].id.type !== 'Identifier' ) {
  						code.overwrite( c, declarator.id.start, "var " );
  					}
  				} else {
  					var inline = loopStatement.test( this$1.parent.type );

  					if ( i === 0 ) {
  						code.remove( c, declarator.id.start );
  					} else {
  						code.overwrite( c, declarator.id.start, (";\n" + i0) );
  					}

  					var simple = declarator.init.type === 'Identifier' && !declarator.init.rewritten;

  					var name = simple ? declarator.init.name : declarator.findScope( true ).createIdentifier( 'ref' );

  					var c$1 = declarator.start;

  					var statementGenerators = [];

  					if ( simple ) {
  						code.remove( declarator.id.end, declarator.end );
  					} else {
  						statementGenerators.push( function ( start, prefix, suffix ) {
  							code.insertRight( declarator.id.end, ("var " + name) );
  							code.insertLeft( declarator.init.end, ("" + suffix) );
  							code.move( declarator.id.end, declarator.end, start );
  						});
  					}

  					destructure( code, declarator.findScope( false ), declarator.id, name, inline, statementGenerators );

  					var prefix = inline ? 'var ' : '';
  					var suffix = inline ? ", " : (";\n" + i0);
  					statementGenerators.forEach( function ( fn, j ) {
  						if ( i === this$1.declarations.length - 1 && j === statementGenerators.length - 1 ) {
  							suffix = inline ? '' : ';';
  						}

  						fn( declarator.start, j === 0 ? prefix : '', suffix );
  					});
  				}

  				declarator.transpile( code, transforms );

  				c = declarator.end;
  				lastDeclaratorIsPattern = declarator.id.type !== 'Identifier';
  			});

  			if ( lastDeclaratorIsPattern ) {
  				code.remove( c, this.end );
  			}
  		}

  		else {
  			this.declarations.forEach( function ( declarator ) {
  				declarator.transpile( code, transforms );
  			});
  		}
  	};

  	return VariableDeclaration;
  }(Node));

  var VariableDeclarator = (function (Node) {
  	function VariableDeclarator () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) VariableDeclarator.__proto__ = Node;
  	VariableDeclarator.prototype = Object.create( Node && Node.prototype );
  	VariableDeclarator.prototype.constructor = VariableDeclarator;

  	VariableDeclarator.prototype.initialise = function initialise ( transforms ) {
  		var kind = this.parent.kind;
  		if ( kind === 'let' && this.parent.parent.type === 'ForStatement' ) {
  			kind = 'for.let'; // special case...
  		}

  		this.parent.scope.addDeclaration( this.id, kind );
  		Node.prototype.initialise.call( this, transforms );
  	};

  	VariableDeclarator.prototype.transpile = function transpile ( code, transforms ) {
  		if ( !this.init && transforms.letConst && this.parent.kind !== 'var' ) {
  			var inLoop = this.findNearest( /Function|^For(In|Of)?Statement|^(?:Do)?WhileStatement/ );
  			if ( inLoop && ! /Function/.test( inLoop.type ) && ! this.isLeftDeclaratorOfLoop() ) {
  				code.insertLeft( this.id.end, ' = (void 0)' );
  			}
  		}

  		if ( this.id ) this.id.transpile( code, transforms );
  		if ( this.init ) this.init.transpile( code, transforms );
  	};

  	VariableDeclarator.prototype.isLeftDeclaratorOfLoop = function isLeftDeclaratorOfLoop () {
  		return this.parent
  			&& this.parent.type === 'VariableDeclaration'
  			&& this.parent.parent
  			&& (this.parent.parent.type === 'ForInStatement'
  				|| this.parent.parent.type === 'ForOfStatement')
  			&& this.parent.parent.left
  			&& this.parent.parent.left.declarations[0] === this;
  	};

  	return VariableDeclarator;
  }(Node));

  var types = {
  	ArrayExpression: ArrayExpression,
  	ArrowFunctionExpression: ArrowFunctionExpression,
  	AssignmentExpression: AssignmentExpression,
  	BinaryExpression: BinaryExpression,
  	BreakStatement: BreakStatement,
  	CallExpression: CallExpression,
  	ClassBody: ClassBody,
  	ClassDeclaration: ClassDeclaration,
  	ClassExpression: ClassExpression,
  	ContinueStatement: ContinueStatement,
  	DoWhileStatement: LoopStatement,
  	ExportNamedDeclaration: ExportNamedDeclaration,
  	ExportDefaultDeclaration: ExportDefaultDeclaration,
  	ForStatement: ForStatement,
  	ForInStatement: ForInStatement,
  	ForOfStatement: ForOfStatement,
  	FunctionDeclaration: FunctionDeclaration,
  	FunctionExpression: FunctionExpression,
  	Identifier: Identifier,
  	IfStatement: IfStatement,
  	ImportDeclaration: ImportDeclaration,
  	ImportDefaultSpecifier: ImportDefaultSpecifier,
  	ImportSpecifier: ImportSpecifier,
  	JSXAttribute: JSXAttribute,
  	JSXClosingElement: JSXClosingElement,
  	JSXElement: JSXElement,
  	JSXExpressionContainer: JSXExpressionContainer,
  	JSXOpeningElement: JSXOpeningElement,
  	JSXSpreadAttribute: JSXSpreadAttribute,
  	Literal: Literal,
  	MemberExpression: MemberExpression,
  	NewExpression: NewExpression,
  	ObjectExpression: ObjectExpression,
  	Property: Property,
  	ReturnStatement: ReturnStatement,
  	SpreadProperty: SpreadProperty,
  	Super: Super,
  	TaggedTemplateExpression: TaggedTemplateExpression,
  	TemplateElement: TemplateElement,
  	TemplateLiteral: TemplateLiteral,
  	ThisExpression: ThisExpression,
  	UpdateExpression: UpdateExpression,
  	VariableDeclaration: VariableDeclaration,
  	VariableDeclarator: VariableDeclarator,
  	WhileStatement: LoopStatement
  };

  var statementsWithBlocks = {
  	IfStatement: 'consequent',
  	ForStatement: 'body',
  	ForInStatement: 'body',
  	ForOfStatement: 'body',
  	WhileStatement: 'body',
  	DoWhileStatement: 'body',
  	ArrowFunctionExpression: 'body'
  };

  function wrap ( raw, parent ) {
  	if ( !raw ) return;

  	if ( 'length' in raw ) {
  		var i = raw.length;
  		while ( i-- ) wrap( raw[i], parent );
  		return;
  	}

  	// with e.g. shorthand properties, key and value are
  	// the same node. We don't want to wrap an object twice
  	if ( raw.__wrapped ) return;
  	raw.__wrapped = true;

  	if ( !keys[ raw.type ] ) {
  		keys[ raw.type ] = Object.keys( raw ).filter( function ( key ) { return typeof raw[ key ] === 'object'; } );
  	}

  	// special case – body-less if/for/while statements. TODO others?
  	var bodyType = statementsWithBlocks[ raw.type ];
  	if ( bodyType && raw[ bodyType ].type !== 'BlockStatement' ) {
  		var expression = raw[ bodyType ];

  		// create a synthetic block statement, otherwise all hell
  		// breaks loose when it comes to block scoping
  		raw[ bodyType ] = {
  			start: expression.start,
  			end: expression.end,
  			type: 'BlockStatement',
  			body: [ expression ],
  			synthetic: true
  		};
  	}

  	new Node( raw, parent );

  	var type = ( raw.type === 'BlockStatement' ? BlockStatement : types[ raw.type ] ) || Node;
  	raw.__proto__ = type.prototype;
  }

  var letConst = /^(?:let|const)$/;

  function Scope ( options ) {
  	options = options || {};

  	this.parent = options.parent;
  	this.isBlockScope = !!options.block;

  	var scope = this;
  	while ( scope.isBlockScope ) scope = scope.parent;
  	this.functionScope = scope;

  	this.identifiers = [];
  	this.declarations = Object.create( null );
  	this.references = Object.create( null );
  	this.blockScopedDeclarations = this.isBlockScope ? null : Object.create( null );
  	this.aliases = this.isBlockScope ? null : Object.create( null );
  }

  Scope.prototype = {
  	addDeclaration: function addDeclaration ( node, kind ) {
  		for ( var i = 0, list = extractNames( node ); i < list.length; i += 1 ) {
  			var identifier = list[i];

  			var name = identifier.name;
  			var existingDeclaration = this.declarations[ name ];
  			if ( existingDeclaration && ( letConst.test( kind ) || letConst.test( existingDeclaration.kind ) ) ) {
  				// TODO warn about double var declarations?
  				throw new CompileError( identifier, (name + " is already declared") );
  			}

  			var declaration = { name: name, node: identifier, kind: kind, instances: [] };
  			this.declarations[ name ] = declaration;

  			if ( this.isBlockScope ) {
  				if ( !this.functionScope.blockScopedDeclarations[ name ] ) this.functionScope.blockScopedDeclarations[ name ] = [];
  				this.functionScope.blockScopedDeclarations[ name ].push( declaration );
  			}
  		}
  	},

  	addReference: function addReference ( identifier ) {
  		if ( this.consolidated ) {
  			this.consolidateReference( identifier );
  		} else {
  			this.identifiers.push( identifier );
  		}
  	},

  	consolidate: function consolidate () {
  		var this$1 = this;

  		for ( var i = 0; i < this$1.identifiers.length; i += 1 ) { // we might push to the array during consolidation, so don't cache length
  			var identifier = this$1.identifiers[i];
  			this$1.consolidateReference( identifier );
  		}

  		this.consolidated = true; // TODO understand why this is necessary... seems bad
  	},

  	consolidateReference: function consolidateReference ( identifier ) {
  		var declaration = this.declarations[ identifier.name ];
  		if ( declaration ) {
  			declaration.instances.push( identifier );
  		} else {
  			this.references[ identifier.name ] = true;
  			if ( this.parent ) this.parent.addReference( identifier );
  		}
  	},

  	contains: function contains ( name ) {
  		return this.declarations[ name ] ||
  		       ( this.parent ? this.parent.contains( name ) : false );
  	},

  	createIdentifier: function createIdentifier ( base ) {
  		var this$1 = this;

  		if ( typeof base === 'number' ) base = base.toString();

  		base = base
  			.replace( /\s/g, '' )
  			.replace( /\[([^\]]+)\]/g, '_$1' )
  			.replace( /[^a-zA-Z0-9_$]/g, '_' )
  			.replace( /_{2,}/, '_' );

  		var name = base;
  		var counter = 1;

  		while ( this$1.declarations[ name ] || this$1.references[ name ] || this$1.aliases[ name ] || name in reserved ) {
  			name = base + "$" + (counter++);
  		}

  		this.aliases[ name ] = true;
  		return name;
  	},

  	findDeclaration: function findDeclaration ( name ) {
  		return this.declarations[ name ] ||
  		       ( this.parent && this.parent.findDeclaration( name ) );
  	}
  };

  function isUseStrict ( node ) {
  	if ( !node ) return false;
  	if ( node.type !== 'ExpressionStatement' ) return false;
  	if ( node.expression.type !== 'Literal' ) return false;
  	return node.expression.value === 'use strict';
  }

  var BlockStatement = (function (Node) {
  	function BlockStatement () {
  		Node.apply(this, arguments);
  	}

  	if ( Node ) BlockStatement.__proto__ = Node;
  	BlockStatement.prototype = Object.create( Node && Node.prototype );
  	BlockStatement.prototype.constructor = BlockStatement;

  	BlockStatement.prototype.createScope = function createScope () {
  		var this$1 = this;

  		this.parentIsFunction = /Function/.test( this.parent.type );
  		this.isFunctionBlock = this.parentIsFunction || this.parent.type === 'Root';
  		this.scope = new Scope({
  			block: !this.isFunctionBlock,
  			parent: this.parent.findScope( false )
  		});

  		if ( this.parentIsFunction ) {
  			this.parent.params.forEach( function ( node ) {
  				this$1.scope.addDeclaration( node, 'param' );
  			});
  		}
  	};

  	BlockStatement.prototype.initialise = function initialise ( transforms ) {
  		this.thisAlias = null;
  		this.argumentsAlias = null;
  		this.defaultParameters = [];

  		// normally the scope gets created here, during initialisation,
  		// but in some cases (e.g. `for` statements), we need to create
  		// the scope early, as it pertains to both the init block and
  		// the body of the statement
  		if ( !this.scope ) this.createScope();

  		this.body.forEach( function ( node ) { return node.initialise( transforms ); } );

  		this.scope.consolidate();
  	};

  	BlockStatement.prototype.findLexicalBoundary = function findLexicalBoundary () {
  		if ( this.type === 'Program' ) return this;
  		if ( /^Function/.test( this.parent.type ) ) return this;

  		return this.parent.findLexicalBoundary();
  	};

  	BlockStatement.prototype.findScope = function findScope ( functionScope ) {
  		if ( functionScope && !this.isFunctionBlock ) return this.parent.findScope( functionScope );
  		return this.scope;
  	};

  	BlockStatement.prototype.getArgumentsAlias = function getArgumentsAlias () {
  		if ( !this.argumentsAlias ) {
  			this.argumentsAlias = this.scope.createIdentifier( 'arguments' );
  		}

  		return this.argumentsAlias;
  	};

  	BlockStatement.prototype.getArgumentsArrayAlias = function getArgumentsArrayAlias () {
  		if ( !this.argumentsArrayAlias ) {
  			this.argumentsArrayAlias = this.scope.createIdentifier( 'argsArray' );
  		}

  		return this.argumentsArrayAlias;
  	};

  	BlockStatement.prototype.getThisAlias = function getThisAlias () {
  		if ( !this.thisAlias ) {
  			this.thisAlias = this.scope.createIdentifier( 'this' );
  		}

  		return this.thisAlias;
  	};

  	BlockStatement.prototype.getIndentation = function getIndentation () {
  		var this$1 = this;

  		if ( this.indentation === undefined ) {
  			var source = this.program.magicString.original;

  			var useOuter = this.synthetic || !this.body.length;
  			var c = useOuter ? this.start : this.body[0].start;

  			while ( c && source[c] !== '\n' ) c -= 1;

  			this.indentation = '';

  			while ( true ) { // eslint-disable-line no-constant-condition
  				c += 1;
  				var char = source[c];

  				if ( char !== ' ' && char !== '\t' ) break;

  				this$1.indentation += char;
  			}

  			var indentString = this.program.magicString.getIndentString();

  			// account for dedented class constructors
  			var parent = this.parent;
  			while ( parent ) {
  				if ( parent.kind === 'constructor' && !parent.parent.parent.superClass ) {
  					this$1.indentation = this$1.indentation.replace( indentString, '' );
  				}

  				parent = parent.parent;
  			}

  			if ( useOuter ) this.indentation += indentString;
  		}

  		return this.indentation;
  	};

  	BlockStatement.prototype.transpile = function transpile ( code, transforms ) {
  		var this$1 = this;

  		var indentation = this.getIndentation();

  		var introStatementGenerators = [];

  		if ( this.argumentsAlias ) {
  			introStatementGenerators.push( function ( start, prefix, suffix ) {
  				var assignment = prefix + "var " + (this$1.argumentsAlias) + " = arguments" + suffix;
  				code.insertLeft( start, assignment );
  			});
  		}

  		if ( this.thisAlias ) {
  			introStatementGenerators.push( function ( start, prefix, suffix ) {
  				var assignment = prefix + "var " + (this$1.thisAlias) + " = this" + suffix;
  				code.insertLeft( start, assignment );
  			});
  		}

  		if ( this.argumentsArrayAlias ) {
  			introStatementGenerators.push( function ( start, prefix, suffix ) {
  				var i = this$1.scope.createIdentifier( 'i' );
  				var assignment = prefix + "var " + i + " = arguments.length, " + (this$1.argumentsArrayAlias) + " = Array(" + i + ");\n" + indentation + "while ( " + i + "-- ) " + (this$1.argumentsArrayAlias) + "[" + i + "] = arguments[" + i + "]" + suffix;
  				code.insertLeft( start, assignment );
  			});
  		}

  		if ( /Function/.test( this.parent.type ) ) {
  			this.transpileParameters( code, transforms, indentation, introStatementGenerators );
  		}

  		if ( transforms.letConst && this.isFunctionBlock ) {
  			this.transpileBlockScopedIdentifiers( code );
  		}

  		Node.prototype.transpile.call( this, code, transforms );

  		if ( this.synthetic ) {
  			if ( this.parent.type === 'ArrowFunctionExpression' ) {
  				var expr = this.body[0];

  				if ( introStatementGenerators.length ) {
  					code.insertLeft( this.start, "{" ).insertRight( this.end, ((this.parent.getIndentation()) + "}") );

  					code.insertRight( expr.start, ("\n" + indentation + "return ") );
  					code.insertLeft( expr.end, ";\n" );
  				} else if ( transforms.arrow ) {
  					code.insertLeft( expr.start, "{ return " );
  					code.insertLeft( expr.end, "; }" );
  				}
  			}

  			else if ( introStatementGenerators.length ) {
  				code.insertLeft( this.start, "{" ).insertRight( this.end, "}" );
  			}
  		}

  		var start;
  		if ( isUseStrict( this.body[0] ) ) {
  			start = this.body[0].end;
  		} else if ( this.synthetic || this.parent.type === 'Root' ) {
  			start = this.start;
  		} else {
  			start = this.start + 1;
  		}

  		var prefix = "\n" + indentation;
  		var suffix = ';';
  		introStatementGenerators.forEach( function ( fn, i ) {
  			if ( i === introStatementGenerators.length - 1 ) suffix = ";\n";
  			fn( start, prefix, suffix );
  		});
  	};

  	BlockStatement.prototype.transpileParameters = function transpileParameters ( code, transforms, indentation, introStatementGenerators ) {
  		var this$1 = this;

  		var params = this.parent.params;

  		params.forEach( function ( param ) {
  			if ( param.type === 'AssignmentPattern' && param.left.type === 'Identifier' ) {
  				if ( transforms.defaultParameter ) {
  					introStatementGenerators.push( function ( start, prefix, suffix ) {
  						var lhs = prefix + "if ( " + (param.left.name) + " === void 0 ) " + (param.left.name);

  						code
  							.insertRight( param.left.end, lhs )
  							.move( param.left.end, param.right.end, start )
  							.insertLeft( param.right.end, suffix );
  					});
  				}
  			}

  			else if ( param.type === 'RestElement' ) {
  				if ( transforms.spreadRest ) {
  					introStatementGenerators.push( function ( start, prefix, suffix ) {
  						var penultimateParam = params[ params.length - 2 ];

  						if ( penultimateParam ) {
  							code.remove( penultimateParam ? penultimateParam.end : param.start, param.end );
  						} else {
  							var start$1 = param.start, end = param.end; // TODO https://gitlab.com/Rich-Harris/buble/issues/8

  							while ( /\s/.test( code.original[ start$1 - 1 ] ) ) start$1 -= 1;
  							while ( /\s/.test( code.original[ end ] ) ) end += 1;

  							code.remove( start$1, end );
  						}

  						var name = param.argument.name;
  						var len = this$1.scope.createIdentifier( 'len' );
  						var count = params.length - 1;

  						if ( count ) {
  							code.insertLeft( start, (prefix + "var " + name + " = [], " + len + " = arguments.length - " + count + ";\n" + indentation + "while ( " + len + "-- > 0 ) " + name + "[ " + len + " ] = arguments[ " + len + " + " + count + " ]" + suffix) );
  						} else {
  							code.insertLeft( start, (prefix + "var " + name + " = [], " + len + " = arguments.length;\n" + indentation + "while ( " + len + "-- ) " + name + "[ " + len + " ] = arguments[ " + len + " ]" + suffix) );
  						}
  					});
  				}
  			}

  			else if ( param.type !== 'Identifier' ) {
  				if ( transforms.parameterDestructuring ) {
  					var ref = this$1.scope.createIdentifier( 'ref' );
  					destructure( code, this$1.scope, param, ref, false, introStatementGenerators );
  					code.insertLeft( param.start, ref );
  				}
  			}
  		});
  	};

  	BlockStatement.prototype.transpileBlockScopedIdentifiers = function transpileBlockScopedIdentifiers ( code ) {
  		var this$1 = this;

  		Object.keys( this.scope.blockScopedDeclarations ).forEach( function ( name ) {
  			var declarations = this$1.scope.blockScopedDeclarations[ name ];

  			for ( var i = 0, list = declarations; i < list.length; i += 1 ) {
  				var declaration = list[i];

  				var cont = false; // TODO implement proper continue...

  				if ( declaration.kind === 'for.let' ) {
  					// special case
  					var forStatement = declaration.node.findNearest( 'ForStatement' );

  					if ( forStatement.shouldRewriteAsFunction ) {
  						var outerAlias = this$1.scope.createIdentifier( name );
  						var innerAlias = forStatement.reassigned[ name ] ?
  							this$1.scope.createIdentifier( name ) :
  							name;

  						declaration.name = outerAlias;
  						code.overwrite( declaration.node.start, declaration.node.end, outerAlias, true );

  						forStatement.aliases[ name ] = {
  							outer: outerAlias,
  							inner: innerAlias
  						};

  						for ( var i$1 = 0, list$1 = declaration.instances; i$1 < list$1.length; i$1 += 1 ) {
  							var identifier = list$1[i$1];

  							var alias = forStatement.body.contains( identifier ) ?
  								innerAlias :
  								outerAlias;

  							if ( name !== alias ) {
  								code.overwrite( identifier.start, identifier.end, alias, true );
  							}
  						}

  						cont = true;
  					}
  				}

  				if ( !cont ) {
  					var alias$1 = this$1.scope.createIdentifier( name );

  					if ( name !== alias$1 ) {
  						declaration.name = alias$1;
  						code.overwrite( declaration.node.start, declaration.node.end, alias$1, true );

  						for ( var i$2 = 0, list$2 = declaration.instances; i$2 < list$2.length; i$2 += 1 ) {
  							var identifier$1 = list$2[i$2];

  							identifier$1.rewritten = true;
  							code.overwrite( identifier$1.start, identifier$1.end, alias$1, true );
  						}
  					}
  				}
  			}
  		});
  	};

  	return BlockStatement;
  }(Node));

  function Program ( source, ast, transforms, options ) {
  	var this$1 = this;

  	this.type = 'Root';

  	// options
  	this.jsx = options.jsx || 'React.createElement';
  	this.options = options;

  	this.source = source;
  	this.magicString = new MagicString( source );

  	this.ast = ast;
  	this.depth = 0;

  	wrap( this.body = ast, this );
  	this.body.__proto__ = BlockStatement.prototype;

  	this.indentExclusionElements = [];
  	this.body.initialise( transforms );

  	this.indentExclusions = Object.create( null );
  	for ( var i$1 = 0, list = this.indentExclusionElements; i$1 < list.length; i$1 += 1 ) {
  		var node = list[i$1];

  		for ( var i = node.start; i < node.end; i += 1 ) {
  			this$1.indentExclusions[ i ] = true;
  		}
  	}

  	this.body.transpile( this.magicString, transforms );
  }

  Program.prototype = {
  	export: function export$1 ( options ) {
  		if ( options === void 0 ) options = {};

  		return {
  			code: this.magicString.toString(),
  			map: this.magicString.generateMap({
  				file: options.file,
  				source: options.source,
  				includeContent: options.includeContent !== false
  			})
  		};
  	},

  	findNearest: function findNearest () {
  		return null;
  	},

  	findScope: function findScope () {
  		return null;
  	}
  };

  var matrix = {
  	chrome: {
  		    48: 1333689725,
  		    49: 1342078975,
  		    50: 1610514431,
  		    51: 1610514431,
  		    52: 2147385343
  	},
  	firefox: {
  		    43: 1207307741,
  		    44: 1207307741,
  		    45: 1207307741,
  		    46: 1476267485,
  		    47: 1476296671,
  		    48: 1476296671
  	},
  	safari: {
  		     8: 1073741824,
  		     9: 1328940894
  	},
  	ie: {
  		     8: 0,
  		     9: 1073741824,
  		    10: 1073741824,
  		    11: 1073770592
  	},
  	edge: {
  		    12: 1591620701,
  		    13: 1608400479
  	},
  	node: {
  		'0.10': 1075052608,
  		'0.12': 1091830852,
  		     4: 1327398527,
  		     5: 1327398527,
  		     6: 1610514431
  	}
  };

  var features = [
  	'arrow',
  	'classes',
  	'collections',
  	'computedProperty',
  	'conciseMethodProperty',
  	'constLoop',
  	'constRedef',
  	'defaultParameter',
  	'destructuring',
  	'extendNatives',
  	'forOf',
  	'generator',
  	'letConst',
  	'letLoop',
  	'letLoopScope',
  	'moduleExport',
  	'moduleImport',
  	'numericLiteral',
  	'objectProto',
  	'objectSuper',
  	'oldOctalLiteral',
  	'parameterDestructuring',
  	'spreadRest',
  	'stickyRegExp',
  	'symbol',
  	'templateString',
  	'unicodeEscape',
  	'unicodeIdentifier',
  	'unicodeRegExp',

  	// ES2016
  	'exponentiation',

  	// additional transforms, not from
  	// https://featuretests.io
  	'reservedProperties'
  ];

  var version = "0.15.2";

  var ref = [
  	acornObjectSpread,
  	acornJsx
  ].reduce( function ( final, plugin ) { return plugin( final ); }, acorn );
  var parse = ref.parse;

  var dangerousTransforms = [
  	'dangerousTaggedTemplateString',
  	'dangerousForOf'
  ];

  function target ( target ) {
  	var targets = Object.keys( target );
  	var bitmask = targets.length ?
  		2147483647 :
  		1073741824;

  	Object.keys( target ).forEach( function ( environment ) {
  		var versions = matrix[ environment ];
  		if ( !versions ) throw new Error( ("Unknown environment '" + environment + "'. Please raise an issue at https://gitlab.com/Rich-Harris/buble/issues") );

  		var targetVersion = target[ environment ];
  		if ( !( targetVersion in versions ) ) throw new Error( ("Support data exists for the following versions of " + environment + ": " + (Object.keys( versions ).join( ', ')) + ". Please raise an issue at https://gitlab.com/Rich-Harris/buble/issues") );
  		var support = versions[ targetVersion ];

  		bitmask &= support;
  	});

  	var transforms = Object.create( null );
  	features.forEach( function ( name, i ) {
  		transforms[ name ] = !( bitmask & 1 << i );
  	});

  	dangerousTransforms.forEach( function ( name ) {
  		transforms[ name ] = false;
  	});

  	return transforms;
  }

  function transform ( source, options ) {
  	if ( options === void 0 ) options = {};

  	var ast;

  	try {
  		ast = parse( source, {
  			ecmaVersion: 7,
  			preserveParens: true,
  			sourceType: 'module',
  			plugins: {
  				jsx: true,
  				objectSpread: true
  			}
  		});
  	} catch ( err ) {
  		err.snippet = getSnippet( source, err.loc );
  		err.toString = function () { return ((err.name) + ": " + (err.message) + "\n" + (err.snippet)); };
  		throw err;
  	}

  	var transforms = target( options.target || {} );
  	Object.keys( options.transforms || {} ).forEach( function ( name ) {
  		if ( name === 'modules' ) {
  			if ( !( 'moduleImport' in options.transforms ) ) transforms.moduleImport = options.transforms.modules;
  			if ( !( 'moduleExport' in options.transforms ) ) transforms.moduleExport = options.transforms.modules;
  			return;
  		}

  		if ( !( name in transforms ) ) throw new Error( ("Unknown transform '" + name + "'") );
  		transforms[ name ] = options.transforms[ name ];
  	});

  	return new Program( source, ast, transforms, options ).export( options );
  }

  exports.target = target;
  exports.transform = transform;
  exports.VERSION = version;

  Object.defineProperty(exports, '__esModule', { value: true });

}));
//# sourceMappingURL=buble.umd.js.map