yeet

node_modules/metro/README.md

@@ -0,0 +1,9 @@
+# Metro
+
+🚇 The JavaScript bundler for React Native.
+
+- **🚅 Fast**: We aim for sub-second reload cycles, fast startup and quick bundling speeds.
+- **⚖️ Scalable**: Works with thousands of modules in a single application.
+- **⚛️ Integrated**: Supports every React Native project out of the box.
+
+This project was previously part of the [react-native](https://github.com/facebook/react-native) repository. In this smaller repository it is easier for the team working on Metro to respond to both issues and pull requests. See [react-native#13976](https://github.com/facebook/react-native/issues/13976) for the initial announcement.

node_modules/metro/node_modules/.bin/rimraf

@@ -0,0 +1 @@
+../rimraf/bin.js

node_modules/metro/node_modules/@jest/console/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/metro/node_modules/@jest/console/build/BufferedConsole.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { Console } from 'console';
+import { SourceMapRegistry } from '@jest/source-map';
+import { ConsoleBuffer, LogMessage, LogType } from './types';
+export default class BufferedConsole extends Console {
+    private _buffer;
+    private _counters;
+    private _timers;
+    private _groupDepth;
+    private _getSourceMaps;
+    constructor(getSourceMaps: () => SourceMapRegistry | null | undefined);
+    static write(buffer: ConsoleBuffer, type: LogType, message: LogMessage, level?: number | null, sourceMaps?: SourceMapRegistry | null): import("./types").LogEntry[];
+    private _log;
+    assert(value: any, message?: string | Error): void;
+    count(label?: string): void;
+    countReset(label?: string): void;
+    debug(firstArg: any, ...rest: Array<any>): void;
+    dir(firstArg: any, ...rest: Array<any>): void;
+    dirxml(firstArg: any, ...rest: Array<any>): void;
+    error(firstArg: any, ...rest: Array<any>): void;
+    group(title?: string, ...rest: Array<any>): void;
+    groupCollapsed(title?: string, ...rest: Array<any>): void;
+    groupEnd(): void;
+    info(firstArg: any, ...rest: Array<any>): void;
+    log(firstArg: any, ...rest: Array<any>): void;
+    time(label?: string): void;
+    timeEnd(label?: string): void;
+    warn(firstArg: any, ...rest: Array<any>): void;
+    getBuffer(): import("./types").LogEntry[] | undefined;
+}
+//# sourceMappingURL=BufferedConsole.d.ts.map

node_modules/metro/node_modules/@jest/console/build/BufferedConsole.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BufferedConsole.d.ts","sourceRoot":"","sources":["../src/BufferedConsole.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAC,OAAO,EAAC,MAAM,SAAS,CAAC;AAGhC,OAAO,EAAc,iBAAiB,EAAC,MAAM,kBAAkB,CAAC;AAChE,OAAO,EACL,aAAa,EAEb,UAAU,EAEV,OAAO,EACR,MAAM,SAAS,CAAC;AAEjB,MAAM,CAAC,OAAO,OAAO,eAAgB,SAAQ,OAAO;IAClD,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,OAAO,CAAY;IAC3B,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,cAAc,CAA6C;gBAEvD,aAAa,EAAE,MAAM,iBAAiB,GAAG,IAAI,GAAG,SAAS;IAgBrE,MAAM,CAAC,KAAK,CACV,MAAM,EAAE,aAAa,EACrB,IAAI,EAAE,OAAO,EACb,OAAO,EAAE,UAAU,EACnB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,EACrB,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI;IAcvC,OAAO,CAAC,IAAI;IAUZ,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK;IAQ3C,KAAK,CAAC,KAAK,GAAE,MAAkB;IAQ/B,UAAU,CAAC,KAAK,GAAE,MAAkB;IAIpC,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIxC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAItC,MAAM,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIzC,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIxC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAQzC,cAAc,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAQlD,QAAQ;IAMR,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIvC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAItC,IAAI,CAAC,KAAK,GAAE,MAAkB;IAQ9B,OAAO,CAAC,KAAK,GAAE,MAAkB;IAWjC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIvC,SAAS;CAGV"}

node_modules/metro/node_modules/@jest/console/build/BufferedConsole.js

@@ -0,0 +1,232 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _assert() {
+  const data = _interopRequireDefault(require('assert'));
+
+  _assert = function _assert() {
+    return data;
+  };
+
+  return data;
+}
+
+function _console() {
+  const data = require('console');
+
+  _console = function _console() {
+    return data;
+  };
+
+  return data;
+}
+
+function _util() {
+  const data = require('util');
+
+  _util = function _util() {
+    return data;
+  };
+
+  return data;
+}
+
+function _chalk() {
+  const data = _interopRequireDefault(require('chalk'));
+
+  _chalk = function _chalk() {
+    return data;
+  };
+
+  return data;
+}
+
+function _sourceMap() {
+  const data = require('@jest/source-map');
+
+  _sourceMap = function _sourceMap() {
+    return data;
+  };
+
+  return data;
+}
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+class BufferedConsole extends _console().Console {
+  constructor(getSourceMaps) {
+    const buffer = [];
+    super({
+      write: message => {
+        BufferedConsole.write(buffer, 'log', message, null, getSourceMaps());
+        return true;
+      }
+    });
+
+    _defineProperty(this, '_buffer', void 0);
+
+    _defineProperty(this, '_counters', void 0);
+
+    _defineProperty(this, '_timers', void 0);
+
+    _defineProperty(this, '_groupDepth', void 0);
+
+    _defineProperty(this, '_getSourceMaps', void 0);
+
+    this._getSourceMaps = getSourceMaps;
+    this._buffer = buffer;
+    this._counters = {};
+    this._timers = {};
+    this._groupDepth = 0;
+  }
+
+  static write(buffer, type, message, level, sourceMaps) {
+    const callsite = (0, _sourceMap().getCallsite)(
+      level != null ? level : 2,
+      sourceMaps
+    );
+    const origin = callsite.getFileName() + ':' + callsite.getLineNumber();
+    buffer.push({
+      message,
+      origin,
+      type
+    });
+    return buffer;
+  }
+
+  _log(type, message) {
+    BufferedConsole.write(
+      this._buffer,
+      type,
+      '  '.repeat(this._groupDepth) + message,
+      3,
+      this._getSourceMaps()
+    );
+  }
+
+  assert(value, message) {
+    try {
+      (0, _assert().default)(value, message);
+    } catch (error) {
+      this._log('assert', error.toString());
+    }
+  }
+
+  count(label = 'default') {
+    if (!this._counters[label]) {
+      this._counters[label] = 0;
+    }
+
+    this._log(
+      'count',
+      (0, _util().format)(`${label}: ${++this._counters[label]}`)
+    );
+  }
+
+  countReset(label = 'default') {
+    this._counters[label] = 0;
+  }
+
+  debug(firstArg, ...rest) {
+    this._log('debug', (0, _util().format)(firstArg, ...rest));
+  }
+
+  dir(firstArg, ...rest) {
+    this._log('dir', (0, _util().format)(firstArg, ...rest));
+  }
+
+  dirxml(firstArg, ...rest) {
+    this._log('dirxml', (0, _util().format)(firstArg, ...rest));
+  }
+
+  error(firstArg, ...rest) {
+    this._log('error', (0, _util().format)(firstArg, ...rest));
+  }
+
+  group(title, ...rest) {
+    this._groupDepth++;
+
+    if (title || rest.length > 0) {
+      this._log(
+        'group',
+        _chalk().default.bold((0, _util().format)(title, ...rest))
+      );
+    }
+  }
+
+  groupCollapsed(title, ...rest) {
+    this._groupDepth++;
+
+    if (title || rest.length > 0) {
+      this._log(
+        'groupCollapsed',
+        _chalk().default.bold((0, _util().format)(title, ...rest))
+      );
+    }
+  }
+
+  groupEnd() {
+    if (this._groupDepth > 0) {
+      this._groupDepth--;
+    }
+  }
+
+  info(firstArg, ...rest) {
+    this._log('info', (0, _util().format)(firstArg, ...rest));
+  }
+
+  log(firstArg, ...rest) {
+    this._log('log', (0, _util().format)(firstArg, ...rest));
+  }
+
+  time(label = 'default') {
+    if (this._timers[label]) {
+      return;
+    }
+
+    this._timers[label] = new Date();
+  }
+
+  timeEnd(label = 'default') {
+    const startTime = this._timers[label];
+
+    if (startTime) {
+      const endTime = new Date();
+      const time = endTime.getTime() - startTime.getTime();
+
+      this._log('time', (0, _util().format)(`${label}: ${time}ms`));
+
+      delete this._timers[label];
+    }
+  }
+
+  warn(firstArg, ...rest) {
+    this._log('warn', (0, _util().format)(firstArg, ...rest));
+  }
+
+  getBuffer() {
+    return this._buffer.length ? this._buffer : undefined;
+  }
+}
+
+exports.default = BufferedConsole;

node_modules/metro/node_modules/@jest/console/build/CustomConsole.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { Console } from 'console';
+import { LogMessage, LogType } from './types';
+declare type Formatter = (type: LogType, message: LogMessage) => string;
+export default class CustomConsole extends Console {
+    private _stdout;
+    private _stderr;
+    private _formatBuffer;
+    private _counters;
+    private _timers;
+    private _groupDepth;
+    constructor(stdout: NodeJS.WritableStream, stderr: NodeJS.WritableStream, formatBuffer?: Formatter);
+    private _log;
+    private _logError;
+    assert(value: any, message?: string | Error): void;
+    count(label?: string): void;
+    countReset(label?: string): void;
+    debug(firstArg: any, ...args: Array<any>): void;
+    dir(firstArg: any, ...args: Array<any>): void;
+    dirxml(firstArg: any, ...args: Array<any>): void;
+    error(firstArg: any, ...args: Array<any>): void;
+    group(title?: string, ...args: Array<any>): void;
+    groupCollapsed(title?: string, ...args: Array<any>): void;
+    groupEnd(): void;
+    info(firstArg: any, ...args: Array<any>): void;
+    log(firstArg: any, ...args: Array<any>): void;
+    time(label?: string): void;
+    timeEnd(label?: string): void;
+    warn(firstArg: any, ...args: Array<any>): void;
+    getBuffer(): undefined;
+}
+export {};
+//# sourceMappingURL=CustomConsole.d.ts.map

node_modules/metro/node_modules/@jest/console/build/CustomConsole.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CustomConsole.d.ts","sourceRoot":"","sources":["../src/CustomConsole.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;;AAIH,OAAO,EAAC,OAAO,EAAC,MAAM,SAAS,CAAC;AAEhC,OAAO,EAAc,UAAU,EAAa,OAAO,EAAC,MAAM,SAAS,CAAC;AASpE,aAAK,SAAS,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,KAAK,MAAM,CAAC;AAEhE,MAAM,CAAC,OAAO,OAAO,aAAc,SAAQ,OAAO;IAChD,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,OAAO,CAAY;IAC3B,OAAO,CAAC,WAAW,CAAS;gBAG1B,MAAM,EAAE,MAAM,CAAC,cAAc,EAC7B,MAAM,EAAE,MAAM,CAAC,cAAc,EAC7B,YAAY,GAAE,SAAuC;IAWvD,OAAO,CAAC,IAAI;IAOZ,OAAO,CAAC,SAAS;IAOjB,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK;IAQ3C,KAAK,CAAC,KAAK,GAAE,MAAkB;IAQ/B,UAAU,CAAC,KAAK,GAAE,MAAkB;IAIpC,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIxC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAItC,MAAM,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIzC,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIxC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAQzC,cAAc,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAQlD,QAAQ;IAMR,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIvC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAItC,IAAI,CAAC,KAAK,GAAE,MAAkB;IAQ9B,OAAO,CAAC,KAAK,GAAE,MAAkB;IAWjC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAIvC,SAAS;CAGV"}

node_modules/metro/node_modules/@jest/console/build/CustomConsole.js

@@ -0,0 +1,216 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _assert() {
+  const data = _interopRequireDefault(require('assert'));
+
+  _assert = function _assert() {
+    return data;
+  };
+
+  return data;
+}
+
+function _util() {
+  const data = require('util');
+
+  _util = function _util() {
+    return data;
+  };
+
+  return data;
+}
+
+function _console() {
+  const data = require('console');
+
+  _console = function _console() {
+    return data;
+  };
+
+  return data;
+}
+
+function _chalk() {
+  const data = _interopRequireDefault(require('chalk'));
+
+  _chalk = function _chalk() {
+    return data;
+  };
+
+  return data;
+}
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+// TODO: Copied from `jest-util`. Import from it in Jest 25
+function clearLine(stream) {
+  if (stream.isTTY) {
+    stream.write('\x1b[999D\x1b[K');
+  }
+}
+
+class CustomConsole extends _console().Console {
+  constructor(stdout, stderr, formatBuffer = (_type, message) => message) {
+    super(stdout, stderr);
+
+    _defineProperty(this, '_stdout', void 0);
+
+    _defineProperty(this, '_stderr', void 0);
+
+    _defineProperty(this, '_formatBuffer', void 0);
+
+    _defineProperty(this, '_counters', void 0);
+
+    _defineProperty(this, '_timers', void 0);
+
+    _defineProperty(this, '_groupDepth', void 0);
+
+    this._stdout = stdout;
+    this._stderr = stderr;
+    this._formatBuffer = formatBuffer;
+    this._counters = {};
+    this._timers = {};
+    this._groupDepth = 0;
+  }
+
+  _log(type, message) {
+    clearLine(this._stdout);
+    super.log(
+      this._formatBuffer(type, '  '.repeat(this._groupDepth) + message)
+    );
+  }
+
+  _logError(type, message) {
+    clearLine(this._stderr);
+    super.error(
+      this._formatBuffer(type, '  '.repeat(this._groupDepth) + message)
+    );
+  }
+
+  assert(value, message) {
+    try {
+      (0, _assert().default)(value, message);
+    } catch (error) {
+      this._logError('assert', error.toString());
+    }
+  }
+
+  count(label = 'default') {
+    if (!this._counters[label]) {
+      this._counters[label] = 0;
+    }
+
+    this._log(
+      'count',
+      (0, _util().format)(`${label}: ${++this._counters[label]}`)
+    );
+  }
+
+  countReset(label = 'default') {
+    this._counters[label] = 0;
+  }
+
+  debug(firstArg, ...args) {
+    this._log('debug', (0, _util().format)(firstArg, ...args));
+  }
+
+  dir(firstArg, ...args) {
+    this._log('dir', (0, _util().format)(firstArg, ...args));
+  }
+
+  dirxml(firstArg, ...args) {
+    this._log('dirxml', (0, _util().format)(firstArg, ...args));
+  }
+
+  error(firstArg, ...args) {
+    this._logError('error', (0, _util().format)(firstArg, ...args));
+  }
+
+  group(title, ...args) {
+    this._groupDepth++;
+
+    if (title || args.length > 0) {
+      this._log(
+        'group',
+        _chalk().default.bold((0, _util().format)(title, ...args))
+      );
+    }
+  }
+
+  groupCollapsed(title, ...args) {
+    this._groupDepth++;
+
+    if (title || args.length > 0) {
+      this._log(
+        'groupCollapsed',
+        _chalk().default.bold((0, _util().format)(title, ...args))
+      );
+    }
+  }
+
+  groupEnd() {
+    if (this._groupDepth > 0) {
+      this._groupDepth--;
+    }
+  }
+
+  info(firstArg, ...args) {
+    this._log('info', (0, _util().format)(firstArg, ...args));
+  }
+
+  log(firstArg, ...args) {
+    this._log('log', (0, _util().format)(firstArg, ...args));
+  }
+
+  time(label = 'default') {
+    if (this._timers[label]) {
+      return;
+    }
+
+    this._timers[label] = new Date();
+  }
+
+  timeEnd(label = 'default') {
+    const startTime = this._timers[label];
+
+    if (startTime) {
+      const endTime = new Date().getTime();
+      const time = endTime - startTime.getTime();
+
+      this._log('time', (0, _util().format)(`${label}: ${time}ms`));
+
+      delete this._timers[label];
+    }
+  }
+
+  warn(firstArg, ...args) {
+    this._logError('warn', (0, _util().format)(firstArg, ...args));
+  }
+
+  getBuffer() {
+    return undefined;
+  }
+}
+
+exports.default = CustomConsole;

node_modules/metro/node_modules/@jest/console/build/NullConsole.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import CustomConsole from './CustomConsole';
+export default class NullConsole extends CustomConsole {
+    assert(): void;
+    debug(): void;
+    dir(): void;
+    error(): void;
+    info(): void;
+    log(): void;
+    time(): void;
+    timeEnd(): void;
+    trace(): void;
+    warn(): void;
+}
+//# sourceMappingURL=NullConsole.d.ts.map

node_modules/metro/node_modules/@jest/console/build/NullConsole.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"NullConsole.d.ts","sourceRoot":"","sources":["../src/NullConsole.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAE5C,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,aAAa;IACpD,MAAM;IACN,KAAK;IACL,GAAG;IACH,KAAK;IACL,IAAI;IACJ,GAAG;IACH,IAAI;IACJ,OAAO;IACP,KAAK;IACL,IAAI;CACL"}

node_modules/metro/node_modules/@jest/console/build/NullConsole.js

@@ -0,0 +1,42 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+var _CustomConsole = _interopRequireDefault(require('./CustomConsole'));
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+class NullConsole extends _CustomConsole.default {
+  assert() {}
+
+  debug() {}
+
+  dir() {}
+
+  error() {}
+
+  info() {}
+
+  log() {}
+
+  time() {}
+
+  timeEnd() {}
+
+  trace() {}
+
+  warn() {}
+}
+
+exports.default = NullConsole;

node_modules/metro/node_modules/@jest/console/build/getConsoleOutput.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+declare const _default: (root: string, verbose: boolean, buffer: import("./types").LogEntry[]) => string;
+export default _default;
+//# sourceMappingURL=getConsoleOutput.d.ts.map

node_modules/metro/node_modules/@jest/console/build/getConsoleOutput.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getConsoleOutput.d.ts","sourceRoot":"","sources":["../src/getConsoleOutput.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;;AAOH,wBA+BE"}

node_modules/metro/node_modules/@jest/console/build/getConsoleOutput.js

@@ -0,0 +1,80 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _path() {
+  const data = _interopRequireDefault(require('path'));
+
+  _path = function _path() {
+    return data;
+  };
+
+  return data;
+}
+
+function _chalk() {
+  const data = _interopRequireDefault(require('chalk'));
+
+  _chalk = function _chalk() {
+    return data;
+  };
+
+  return data;
+}
+
+function _slash() {
+  const data = _interopRequireDefault(require('slash'));
+
+  _slash = function _slash() {
+    return data;
+  };
+
+  return data;
+}
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+var _default = (root, verbose, buffer) => {
+  const TITLE_INDENT = verbose ? '  ' : '    ';
+  const CONSOLE_INDENT = TITLE_INDENT + '  ';
+  return buffer.reduce((output, {type, message, origin}) => {
+    origin = (0, _slash().default)(_path().default.relative(root, origin));
+    message = message
+      .split(/\n/)
+      .map(line => CONSOLE_INDENT + line)
+      .join('\n');
+    let typeMessage = 'console.' + type;
+
+    if (type === 'warn') {
+      message = _chalk().default.yellow(message);
+      typeMessage = _chalk().default.yellow(typeMessage);
+    } else if (type === 'error') {
+      message = _chalk().default.red(message);
+      typeMessage = _chalk().default.red(typeMessage);
+    }
+
+    return (
+      output +
+      TITLE_INDENT +
+      _chalk().default.dim(typeMessage) +
+      ' ' +
+      _chalk().default.dim(origin) +
+      '\n' +
+      message +
+      '\n'
+    );
+  }, '');
+};
+
+exports.default = _default;

node_modules/metro/node_modules/@jest/console/build/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export { default as BufferedConsole } from './BufferedConsole';
+export { default as CustomConsole } from './CustomConsole';
+export { default as NullConsole } from './NullConsole';
+export { default as getConsoleOutput } from './getConsoleOutput';
+export { ConsoleBuffer, LogMessage, LogType } from './types';
+//# sourceMappingURL=index.d.ts.map

node_modules/metro/node_modules/@jest/console/build/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAC,OAAO,IAAI,eAAe,EAAC,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAC,OAAO,IAAI,aAAa,EAAC,MAAM,iBAAiB,CAAC;AACzD,OAAO,EAAC,OAAO,IAAI,WAAW,EAAC,MAAM,eAAe,CAAC;AACrD,OAAO,EAAC,OAAO,IAAI,gBAAgB,EAAC,MAAM,oBAAoB,CAAC;AAC/D,OAAO,EAAC,aAAa,EAAE,UAAU,EAAE,OAAO,EAAC,MAAM,SAAS,CAAC"}

node_modules/metro/node_modules/@jest/console/build/index.js

@@ -0,0 +1,61 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'BufferedConsole', {
+  enumerable: true,
+  get: function get() {
+    return _BufferedConsole.default;
+  }
+});
+Object.defineProperty(exports, 'CustomConsole', {
+  enumerable: true,
+  get: function get() {
+    return _CustomConsole.default;
+  }
+});
+Object.defineProperty(exports, 'NullConsole', {
+  enumerable: true,
+  get: function get() {
+    return _NullConsole.default;
+  }
+});
+Object.defineProperty(exports, 'getConsoleOutput', {
+  enumerable: true,
+  get: function get() {
+    return _getConsoleOutput.default;
+  }
+});
+Object.defineProperty(exports, 'ConsoleBuffer', {
+  enumerable: true,
+  get: function get() {
+    return _types.ConsoleBuffer;
+  }
+});
+Object.defineProperty(exports, 'LogMessage', {
+  enumerable: true,
+  get: function get() {
+    return _types.LogMessage;
+  }
+});
+Object.defineProperty(exports, 'LogType', {
+  enumerable: true,
+  get: function get() {
+    return _types.LogType;
+  }
+});
+
+var _BufferedConsole = _interopRequireDefault(require('./BufferedConsole'));
+
+var _CustomConsole = _interopRequireDefault(require('./CustomConsole'));
+
+var _NullConsole = _interopRequireDefault(require('./NullConsole'));
+
+var _getConsoleOutput = _interopRequireDefault(require('./getConsoleOutput'));
+
+var _types = require('./types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}

node_modules/metro/node_modules/@jest/console/build/types.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export declare type LogMessage = string;
+export declare type LogEntry = {
+    message: LogMessage;
+    origin: string;
+    type: LogType;
+};
+export declare type LogCounters = {
+    [label: string]: number;
+};
+export declare type LogTimers = {
+    [label: string]: Date;
+};
+export declare type LogType = 'assert' | 'count' | 'debug' | 'dir' | 'dirxml' | 'error' | 'group' | 'groupCollapsed' | 'info' | 'log' | 'time' | 'warn';
+export declare type ConsoleBuffer = Array<LogEntry>;
+//# sourceMappingURL=types.d.ts.map

node_modules/metro/node_modules/@jest/console/build/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,oBAAY,UAAU,GAAG,MAAM,CAAC;AAEhC,oBAAY,QAAQ,GAAG;IACrB,OAAO,EAAE,UAAU,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,OAAO,CAAC;CACf,CAAC;AAEF,oBAAY,WAAW,GAAG;IACxB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;CACzB,CAAC;AAEF,oBAAY,SAAS,GAAG;IACtB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB,CAAC;AAEF,oBAAY,OAAO,GACf,QAAQ,GACR,OAAO,GACP,OAAO,GACP,KAAK,GACL,QAAQ,GACR,OAAO,GACP,OAAO,GACP,gBAAgB,GAChB,MAAM,GACN,KAAK,GACL,MAAM,GACN,MAAM,CAAC;AAEX,oBAAY,aAAa,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC"}

node_modules/metro/node_modules/@jest/console/build/types.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/console/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@jest/console",
+  "version": "24.9.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-console"
+  },
+  "license": "MIT",
+  "main": "build/index.js",
+  "types": "build/index.d.ts",
+  "dependencies": {
+    "@jest/source-map": "^24.9.0",
+    "chalk": "^2.0.1",
+    "slash": "^2.0.0"
+  },
+  "devDependencies": {
+    "@types/slash": "^2.0.0"
+  },
+  "engines": {
+    "node": ">= 6"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1"
+}

node_modules/metro/node_modules/@jest/fake-timers/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/metro/node_modules/@jest/fake-timers/build/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export { default as JestFakeTimers } from './jestFakeTimers';
+//# sourceMappingURL=index.d.ts.map

node_modules/metro/node_modules/@jest/fake-timers/build/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAC,OAAO,IAAI,cAAc,EAAC,MAAM,kBAAkB,CAAC"}

node_modules/metro/node_modules/@jest/fake-timers/build/index.js

@@ -0,0 +1,17 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'JestFakeTimers', {
+  enumerable: true,
+  get: function get() {
+    return _jestFakeTimers.default;
+  }
+});
+
+var _jestFakeTimers = _interopRequireDefault(require('./jestFakeTimers'));
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}

node_modules/metro/node_modules/@jest/fake-timers/build/jestFakeTimers.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { ModuleMocker } from 'jest-mock';
+import { StackTraceConfig } from 'jest-message-util';
+declare type Callback = (...args: Array<unknown>) => void;
+declare type TimerConfig<Ref> = {
+    idToRef: (id: number) => Ref;
+    refToId: (ref: Ref) => number | void;
+};
+export default class FakeTimers<TimerRef> {
+    private _cancelledImmediates;
+    private _cancelledTicks;
+    private _config;
+    private _disposed?;
+    private _fakeTimerAPIs;
+    private _global;
+    private _immediates;
+    private _maxLoops;
+    private _moduleMocker;
+    private _now;
+    private _ticks;
+    private _timerAPIs;
+    private _timers;
+    private _uuidCounter;
+    private _timerConfig;
+    constructor({ global, moduleMocker, timerConfig, config, maxLoops, }: {
+        global: NodeJS.Global;
+        moduleMocker: ModuleMocker;
+        timerConfig: TimerConfig<TimerRef>;
+        config: StackTraceConfig;
+        maxLoops?: number;
+    });
+    clearAllTimers(): void;
+    dispose(): void;
+    reset(): void;
+    runAllTicks(): void;
+    runAllImmediates(): void;
+    private _runImmediate;
+    runAllTimers(): void;
+    runOnlyPendingTimers(): void;
+    advanceTimersToNextTimer(steps?: number): void;
+    advanceTimersByTime(msToRun: number): void;
+    runWithRealTimers(cb: Callback): void;
+    useRealTimers(): void;
+    useFakeTimers(): void;
+    getTimerCount(): number;
+    private _checkFakeTimers;
+    private _createMocks;
+    private _fakeClearTimer;
+    private _fakeClearImmediate;
+    private _fakeNextTick;
+    private _fakeSetImmediate;
+    private _fakeSetInterval;
+    private _fakeSetTimeout;
+    private _getNextTimerHandle;
+    private _runTimerHandle;
+}
+export {};
+//# sourceMappingURL=jestFakeTimers.d.ts.map

node_modules/metro/node_modules/@jest/fake-timers/build/jestFakeTimers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"jestFakeTimers.d.ts","sourceRoot":"","sources":["../src/jestFakeTimers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;;AAEH,OAAO,EAAC,YAAY,EAAC,MAAM,WAAW,CAAC;AACvC,OAAO,EAAmB,gBAAgB,EAAC,MAAM,mBAAmB,CAAC;AAErE,aAAK,QAAQ,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC;AA2BlD,aAAK,WAAW,CAAC,GAAG,IAAI;IACtB,OAAO,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,GAAG,CAAC;IAC7B,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,GAAG,IAAI,CAAC;CACtC,CAAC;AAcF,MAAM,CAAC,OAAO,OAAO,UAAU,CAAC,QAAQ;IACtC,OAAO,CAAC,oBAAoB,CAA2B;IACvD,OAAO,CAAC,eAAe,CAA2B;IAClD,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B,OAAO,CAAC,cAAc,CAAY;IAClC,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,WAAW,CAAe;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,aAAa,CAAe;IACpC,OAAO,CAAC,IAAI,CAAU;IACtB,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,OAAO,CAAsB;IACrC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,YAAY,CAAwB;gBAEhC,EACV,MAAM,EACN,YAAY,EACZ,WAAW,EACX,MAAM,EACN,QAAQ,GACT,EAAE;QACD,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;QACtB,YAAY,EAAE,YAAY,CAAC;QAC3B,WAAW,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,EAAE,gBAAgB,CAAC;QACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;KACnB;IAuBD,cAAc;IAOd,OAAO;IAKP,KAAK;IASL,WAAW;IA6BX,gBAAgB;IAsBhB,OAAO,CAAC,aAAa;IAQrB,YAAY;IAwCZ,oBAAoB;IAapB,wBAAwB,CAAC,KAAK,SAAI;IAiBlC,mBAAmB,CAAC,OAAO,EAAE,MAAM;IAuCnC,iBAAiB,CAAC,EAAE,EAAE,QAAQ;IAiC9B,aAAa;IAYb,aAAa;IAcb,aAAa;IAMb,OAAO,CAAC,gBAAgB;IAkBxB,OAAO,CAAC,YAAY;IAiBpB,OAAO,CAAC,eAAe;IAQvB,OAAO,CAAC,mBAAmB;IAI3B,OAAO,CAAC,aAAa;IAsBrB,OAAO,CAAC,iBAAiB;IAwBzB,OAAO,CAAC,gBAAgB;IAyBxB,OAAO,CAAC,eAAe;IAwBvB,OAAO,CAAC,mBAAmB;IAc3B,OAAO,CAAC,eAAe;CAuBxB"}

node_modules/metro/node_modules/@jest/fake-timers/build/jestFakeTimers.js

@@ -0,0 +1,574 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _jestMessageUtil() {
+  const data = require('jest-message-util');
+
+  _jestMessageUtil = function _jestMessageUtil() {
+    return data;
+  };
+
+  return data;
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+const MS_IN_A_YEAR = 31536000000; // TODO: Copied from `jest-util` to avoid cyclic dependency. Import from `jest-util` in the next major
+
+const setGlobal = (globalToMutate, key, value) => {
+  // @ts-ignore: no index
+  globalToMutate[key] = value;
+};
+
+class FakeTimers {
+  constructor({global, moduleMocker, timerConfig, config, maxLoops}) {
+    _defineProperty(this, '_cancelledImmediates', void 0);
+
+    _defineProperty(this, '_cancelledTicks', void 0);
+
+    _defineProperty(this, '_config', void 0);
+
+    _defineProperty(this, '_disposed', void 0);
+
+    _defineProperty(this, '_fakeTimerAPIs', void 0);
+
+    _defineProperty(this, '_global', void 0);
+
+    _defineProperty(this, '_immediates', void 0);
+
+    _defineProperty(this, '_maxLoops', void 0);
+
+    _defineProperty(this, '_moduleMocker', void 0);
+
+    _defineProperty(this, '_now', void 0);
+
+    _defineProperty(this, '_ticks', void 0);
+
+    _defineProperty(this, '_timerAPIs', void 0);
+
+    _defineProperty(this, '_timers', void 0);
+
+    _defineProperty(this, '_uuidCounter', void 0);
+
+    _defineProperty(this, '_timerConfig', void 0);
+
+    this._global = global;
+    this._timerConfig = timerConfig;
+    this._config = config;
+    this._maxLoops = maxLoops || 100000;
+    this._uuidCounter = 1;
+    this._moduleMocker = moduleMocker; // Store original timer APIs for future reference
+
+    this._timerAPIs = {
+      clearImmediate: global.clearImmediate,
+      clearInterval: global.clearInterval,
+      clearTimeout: global.clearTimeout,
+      nextTick: global.process && global.process.nextTick,
+      setImmediate: global.setImmediate,
+      setInterval: global.setInterval,
+      setTimeout: global.setTimeout
+    };
+    this.reset();
+
+    this._createMocks();
+  }
+
+  clearAllTimers() {
+    this._immediates.forEach(immediate =>
+      this._fakeClearImmediate(immediate.uuid)
+    );
+
+    this._timers.clear();
+  }
+
+  dispose() {
+    this._disposed = true;
+    this.clearAllTimers();
+  }
+
+  reset() {
+    this._cancelledTicks = {};
+    this._cancelledImmediates = {};
+    this._now = 0;
+    this._ticks = [];
+    this._immediates = [];
+    this._timers = new Map();
+  }
+
+  runAllTicks() {
+    this._checkFakeTimers(); // Only run a generous number of ticks and then bail.
+    // This is just to help avoid recursive loops
+
+    let i;
+
+    for (i = 0; i < this._maxLoops; i++) {
+      const tick = this._ticks.shift();
+
+      if (tick === undefined) {
+        break;
+      }
+
+      if (!this._cancelledTicks.hasOwnProperty(tick.uuid)) {
+        // Callback may throw, so update the map prior calling.
+        this._cancelledTicks[tick.uuid] = true;
+        tick.callback();
+      }
+    }
+
+    if (i === this._maxLoops) {
+      throw new Error(
+        'Ran ' +
+          this._maxLoops +
+          ' ticks, and there are still more! ' +
+          "Assuming we've hit an infinite recursion and bailing out..."
+      );
+    }
+  }
+
+  runAllImmediates() {
+    this._checkFakeTimers(); // Only run a generous number of immediates and then bail.
+
+    let i;
+
+    for (i = 0; i < this._maxLoops; i++) {
+      const immediate = this._immediates.shift();
+
+      if (immediate === undefined) {
+        break;
+      }
+
+      this._runImmediate(immediate);
+    }
+
+    if (i === this._maxLoops) {
+      throw new Error(
+        'Ran ' +
+          this._maxLoops +
+          ' immediates, and there are still more! Assuming ' +
+          "we've hit an infinite recursion and bailing out..."
+      );
+    }
+  }
+
+  _runImmediate(immediate) {
+    if (!this._cancelledImmediates.hasOwnProperty(immediate.uuid)) {
+      // Callback may throw, so update the map prior calling.
+      this._cancelledImmediates[immediate.uuid] = true;
+      immediate.callback();
+    }
+  }
+
+  runAllTimers() {
+    this._checkFakeTimers();
+
+    this.runAllTicks();
+    this.runAllImmediates(); // Only run a generous number of timers and then bail.
+    // This is just to help avoid recursive loops
+
+    let i;
+
+    for (i = 0; i < this._maxLoops; i++) {
+      const nextTimerHandle = this._getNextTimerHandle(); // If there are no more timer handles, stop!
+
+      if (nextTimerHandle === null) {
+        break;
+      }
+
+      this._runTimerHandle(nextTimerHandle); // Some of the immediate calls could be enqueued
+      // during the previous handling of the timers, we should
+      // run them as well.
+
+      if (this._immediates.length) {
+        this.runAllImmediates();
+      }
+
+      if (this._ticks.length) {
+        this.runAllTicks();
+      }
+    }
+
+    if (i === this._maxLoops) {
+      throw new Error(
+        'Ran ' +
+          this._maxLoops +
+          ' timers, and there are still more! ' +
+          "Assuming we've hit an infinite recursion and bailing out..."
+      );
+    }
+  }
+
+  runOnlyPendingTimers() {
+    // We need to hold the current shape of `this._timers` because existing
+    // timers can add new ones to the map and hence would run more than necessary.
+    // See https://github.com/facebook/jest/pull/4608 for details
+    const timerEntries = Array.from(this._timers.entries());
+
+    this._checkFakeTimers();
+
+    this._immediates.forEach(this._runImmediate, this);
+
+    timerEntries
+      .sort(([, left], [, right]) => left.expiry - right.expiry)
+      .forEach(([timerHandle]) => this._runTimerHandle(timerHandle));
+  }
+
+  advanceTimersToNextTimer(steps = 1) {
+    if (steps < 1) {
+      return;
+    }
+
+    const nextExpiry = Array.from(this._timers.values()).reduce(
+      (minExpiry, timer) => {
+        if (minExpiry === null || timer.expiry < minExpiry) return timer.expiry;
+        return minExpiry;
+      },
+      null
+    );
+
+    if (nextExpiry !== null) {
+      this.advanceTimersByTime(nextExpiry - this._now);
+      this.advanceTimersToNextTimer(steps - 1);
+    }
+  }
+
+  advanceTimersByTime(msToRun) {
+    this._checkFakeTimers(); // Only run a generous number of timers and then bail.
+    // This is just to help avoid recursive loops
+
+    let i;
+
+    for (i = 0; i < this._maxLoops; i++) {
+      const timerHandle = this._getNextTimerHandle(); // If there are no more timer handles, stop!
+
+      if (timerHandle === null) {
+        break;
+      }
+
+      const timerValue = this._timers.get(timerHandle);
+
+      if (timerValue === undefined) {
+        break;
+      }
+
+      const nextTimerExpiry = timerValue.expiry;
+
+      if (this._now + msToRun < nextTimerExpiry) {
+        // There are no timers between now and the target we're running to, so
+        // adjust our time cursor and quit
+        this._now += msToRun;
+        break;
+      } else {
+        msToRun -= nextTimerExpiry - this._now;
+        this._now = nextTimerExpiry;
+
+        this._runTimerHandle(timerHandle);
+      }
+    }
+
+    if (i === this._maxLoops) {
+      throw new Error(
+        'Ran ' +
+          this._maxLoops +
+          ' timers, and there are still more! ' +
+          "Assuming we've hit an infinite recursion and bailing out..."
+      );
+    }
+  }
+
+  runWithRealTimers(cb) {
+    const prevClearImmediate = this._global.clearImmediate;
+    const prevClearInterval = this._global.clearInterval;
+    const prevClearTimeout = this._global.clearTimeout;
+    const prevNextTick = this._global.process.nextTick;
+    const prevSetImmediate = this._global.setImmediate;
+    const prevSetInterval = this._global.setInterval;
+    const prevSetTimeout = this._global.setTimeout;
+    this.useRealTimers();
+    let cbErr = null;
+    let errThrown = false;
+
+    try {
+      cb();
+    } catch (e) {
+      errThrown = true;
+      cbErr = e;
+    }
+
+    this._global.clearImmediate = prevClearImmediate;
+    this._global.clearInterval = prevClearInterval;
+    this._global.clearTimeout = prevClearTimeout;
+    this._global.process.nextTick = prevNextTick;
+    this._global.setImmediate = prevSetImmediate;
+    this._global.setInterval = prevSetInterval;
+    this._global.setTimeout = prevSetTimeout;
+
+    if (errThrown) {
+      throw cbErr;
+    }
+  }
+
+  useRealTimers() {
+    const global = this._global;
+    setGlobal(global, 'clearImmediate', this._timerAPIs.clearImmediate);
+    setGlobal(global, 'clearInterval', this._timerAPIs.clearInterval);
+    setGlobal(global, 'clearTimeout', this._timerAPIs.clearTimeout);
+    setGlobal(global, 'setImmediate', this._timerAPIs.setImmediate);
+    setGlobal(global, 'setInterval', this._timerAPIs.setInterval);
+    setGlobal(global, 'setTimeout', this._timerAPIs.setTimeout);
+    global.process.nextTick = this._timerAPIs.nextTick;
+  }
+
+  useFakeTimers() {
+    this._createMocks();
+
+    const global = this._global;
+    setGlobal(global, 'clearImmediate', this._fakeTimerAPIs.clearImmediate);
+    setGlobal(global, 'clearInterval', this._fakeTimerAPIs.clearInterval);
+    setGlobal(global, 'clearTimeout', this._fakeTimerAPIs.clearTimeout);
+    setGlobal(global, 'setImmediate', this._fakeTimerAPIs.setImmediate);
+    setGlobal(global, 'setInterval', this._fakeTimerAPIs.setInterval);
+    setGlobal(global, 'setTimeout', this._fakeTimerAPIs.setTimeout);
+    global.process.nextTick = this._fakeTimerAPIs.nextTick;
+  }
+
+  getTimerCount() {
+    this._checkFakeTimers();
+
+    return this._timers.size + this._immediates.length + this._ticks.length;
+  }
+
+  _checkFakeTimers() {
+    if (this._global.setTimeout !== this._fakeTimerAPIs.setTimeout) {
+      this._global.console.warn(
+        `A function to advance timers was called but the timers API is not ` +
+          `mocked with fake timers. Call \`jest.useFakeTimers()\` in this ` +
+          `test or enable fake timers globally by setting ` +
+          `\`"timers": "fake"\` in ` +
+          `the configuration file. This warning is likely a result of a ` +
+          `default configuration change in Jest 15.\n\n` +
+          `Release Blog Post: https://jestjs.io/blog/2016/09/01/jest-15.html\n` +
+          `Stack Trace:\n` +
+          (0, _jestMessageUtil().formatStackTrace)(
+            new Error().stack,
+            this._config,
+            {
+              noStackTrace: false
+            }
+          )
+      );
+    }
+  }
+
+  _createMocks() {
+    const fn = (
+      impl // @ts-ignore TODO: figure out better typings here
+    ) => this._moduleMocker.fn().mockImplementation(impl); // TODO: add better typings; these are mocks, but typed as regular timers
+
+    this._fakeTimerAPIs = {
+      clearImmediate: fn(this._fakeClearImmediate.bind(this)),
+      clearInterval: fn(this._fakeClearTimer.bind(this)),
+      clearTimeout: fn(this._fakeClearTimer.bind(this)),
+      nextTick: fn(this._fakeNextTick.bind(this)),
+      setImmediate: fn(this._fakeSetImmediate.bind(this)),
+      setInterval: fn(this._fakeSetInterval.bind(this)),
+      setTimeout: fn(this._fakeSetTimeout.bind(this))
+    };
+  }
+
+  _fakeClearTimer(timerRef) {
+    const uuid = this._timerConfig.refToId(timerRef);
+
+    if (uuid) {
+      this._timers.delete(String(uuid));
+    }
+  }
+
+  _fakeClearImmediate(uuid) {
+    this._cancelledImmediates[uuid] = true;
+  }
+
+  _fakeNextTick(callback, ...args) {
+    if (this._disposed) {
+      return;
+    }
+
+    const uuid = String(this._uuidCounter++);
+
+    this._ticks.push({
+      callback: (function(_callback) {
+        function callback() {
+          return _callback.apply(this, arguments);
+        }
+
+        callback.toString = function() {
+          return _callback.toString();
+        };
+
+        return callback;
+      })(() => callback.apply(null, args)),
+      uuid
+    });
+
+    const cancelledTicks = this._cancelledTicks;
+
+    this._timerAPIs.nextTick(() => {
+      if (!cancelledTicks.hasOwnProperty(uuid)) {
+        // Callback may throw, so update the map prior calling.
+        cancelledTicks[uuid] = true;
+        callback.apply(null, args);
+      }
+    });
+  }
+
+  _fakeSetImmediate(callback, ...args) {
+    if (this._disposed) {
+      return null;
+    }
+
+    const uuid = this._uuidCounter++;
+
+    this._immediates.push({
+      callback: (function(_callback2) {
+        function callback() {
+          return _callback2.apply(this, arguments);
+        }
+
+        callback.toString = function() {
+          return _callback2.toString();
+        };
+
+        return callback;
+      })(() => callback.apply(null, args)),
+      uuid: String(uuid)
+    });
+
+    const cancelledImmediates = this._cancelledImmediates;
+
+    this._timerAPIs.setImmediate(() => {
+      if (!cancelledImmediates.hasOwnProperty(uuid)) {
+        // Callback may throw, so update the map prior calling.
+        cancelledImmediates[String(uuid)] = true;
+        callback.apply(null, args);
+      }
+    });
+
+    return uuid;
+  }
+
+  _fakeSetInterval(callback, intervalDelay, ...args) {
+    if (this._disposed) {
+      return null;
+    }
+
+    if (intervalDelay == null) {
+      intervalDelay = 0;
+    }
+
+    const uuid = this._uuidCounter++;
+
+    this._timers.set(String(uuid), {
+      callback: (function(_callback3) {
+        function callback() {
+          return _callback3.apply(this, arguments);
+        }
+
+        callback.toString = function() {
+          return _callback3.toString();
+        };
+
+        return callback;
+      })(() => callback.apply(null, args)),
+      expiry: this._now + intervalDelay,
+      interval: intervalDelay,
+      type: 'interval'
+    });
+
+    return this._timerConfig.idToRef(uuid);
+  }
+
+  _fakeSetTimeout(callback, delay, ...args) {
+    if (this._disposed) {
+      return null;
+    } // eslint-disable-next-line no-bitwise
+
+    delay = Number(delay) | 0;
+    const uuid = this._uuidCounter++;
+
+    this._timers.set(String(uuid), {
+      callback: (function(_callback4) {
+        function callback() {
+          return _callback4.apply(this, arguments);
+        }
+
+        callback.toString = function() {
+          return _callback4.toString();
+        };
+
+        return callback;
+      })(() => callback.apply(null, args)),
+      expiry: this._now + delay,
+      interval: undefined,
+      type: 'timeout'
+    });
+
+    return this._timerConfig.idToRef(uuid);
+  }
+
+  _getNextTimerHandle() {
+    let nextTimerHandle = null;
+    let soonestTime = MS_IN_A_YEAR;
+
+    this._timers.forEach((timer, uuid) => {
+      if (timer.expiry < soonestTime) {
+        soonestTime = timer.expiry;
+        nextTimerHandle = uuid;
+      }
+    });
+
+    return nextTimerHandle;
+  }
+
+  _runTimerHandle(timerHandle) {
+    const timer = this._timers.get(timerHandle);
+
+    if (!timer) {
+      return;
+    }
+
+    switch (timer.type) {
+      case 'timeout':
+        const callback = timer.callback;
+
+        this._timers.delete(timerHandle);
+
+        callback();
+        break;
+
+      case 'interval':
+        timer.expiry = this._now + (timer.interval || 0);
+        timer.callback();
+        break;
+
+      default:
+        throw new Error('Unexpected timer type: ' + timer.type);
+    }
+  }
+}
+
+exports.default = FakeTimers;

node_modules/metro/node_modules/@jest/fake-timers/package.json

@@ -0,0 +1,24 @@
+{
+  "name": "@jest/fake-timers",
+  "version": "24.9.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-fake-timers"
+  },
+  "license": "MIT",
+  "main": "build/index.js",
+  "types": "build/index.d.ts",
+  "dependencies": {
+    "@jest/types": "^24.9.0",
+    "jest-message-util": "^24.9.0",
+    "jest-mock": "^24.9.0"
+  },
+  "engines": {
+    "node": ">= 6"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1"
+}

node_modules/metro/node_modules/@jest/source-map/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/metro/node_modules/@jest/source-map/build/getCallsite.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import callsites from 'callsites';
+declare const _default: (level: number, sourceMaps?: Record<string, string> | null | undefined) => callsites.CallSite;
+export default _default;
+//# sourceMappingURL=getCallsite.d.ts.map

node_modules/metro/node_modules/@jest/source-map/build/getCallsite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getCallsite.d.ts","sourceRoot":"","sources":["../src/getCallsite.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,SAAqB,MAAM,WAAW,CAAC;;AAwC9C,wBAgBE"}

node_modules/metro/node_modules/@jest/source-map/build/getCallsite.js

@@ -0,0 +1,107 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = void 0;
+
+function _gracefulFs() {
+  const data = _interopRequireDefault(require('graceful-fs'));
+
+  _gracefulFs = function _gracefulFs() {
+    return data;
+  };
+
+  return data;
+}
+
+function _callsites() {
+  const data = _interopRequireDefault(require('callsites'));
+
+  _callsites = function _callsites() {
+    return data;
+  };
+
+  return data;
+}
+
+function _sourceMap() {
+  const data = require('source-map');
+
+  _sourceMap = function _sourceMap() {
+    return data;
+  };
+
+  return data;
+}
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+// Copied from https://github.com/rexxars/sourcemap-decorate-callsites/blob/5b9735a156964973a75dc62fd2c7f0c1975458e8/lib/index.js#L113-L158
+const addSourceMapConsumer = (callsite, consumer) => {
+  const getLineNumber = callsite.getLineNumber;
+  const getColumnNumber = callsite.getColumnNumber;
+  let position = null;
+
+  function getPosition() {
+    if (!position) {
+      position = consumer.originalPositionFor({
+        column: getColumnNumber.call(callsite) || -1,
+        line: getLineNumber.call(callsite) || -1
+      });
+    }
+
+    return position;
+  }
+
+  Object.defineProperties(callsite, {
+    getColumnNumber: {
+      value() {
+        return getPosition().column || getColumnNumber.call(callsite);
+      },
+
+      writable: false
+    },
+    getLineNumber: {
+      value() {
+        return getPosition().line || getLineNumber.call(callsite);
+      },
+
+      writable: false
+    }
+  });
+};
+
+var _default = (level, sourceMaps) => {
+  const levelAfterThisCall = level + 1;
+  const stack = (0, _callsites().default)()[levelAfterThisCall];
+  const sourceMapFileName = sourceMaps && sourceMaps[stack.getFileName() || ''];
+
+  if (sourceMapFileName) {
+    try {
+      const sourceMap = _gracefulFs().default.readFileSync(
+        sourceMapFileName,
+        'utf8'
+      ); // @ts-ignore: Not allowed to pass string
+
+      addSourceMapConsumer(
+        stack,
+        new (_sourceMap()).SourceMapConsumer(sourceMap)
+      );
+    } catch (e) {
+      // ignore
+    }
+  }
+
+  return stack;
+};
+
+exports.default = _default;

node_modules/metro/node_modules/@jest/source-map/build/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export { default as getCallsite } from './getCallsite';
+export { SourceMapRegistry } from './types';
+//# sourceMappingURL=index.d.ts.map

node_modules/metro/node_modules/@jest/source-map/build/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAC,OAAO,IAAI,WAAW,EAAC,MAAM,eAAe,CAAC;AACrD,OAAO,EAAC,iBAAiB,EAAC,MAAM,SAAS,CAAC"}

node_modules/metro/node_modules/@jest/source-map/build/index.js

@@ -0,0 +1,25 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'getCallsite', {
+  enumerable: true,
+  get: function get() {
+    return _getCallsite.default;
+  }
+});
+Object.defineProperty(exports, 'SourceMapRegistry', {
+  enumerable: true,
+  get: function get() {
+    return _types.SourceMapRegistry;
+  }
+});
+
+var _getCallsite = _interopRequireDefault(require('./getCallsite'));
+
+var _types = require('./types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}

node_modules/metro/node_modules/@jest/source-map/build/types.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export declare type SourceMapRegistry = Record<string, string>;
+//# sourceMappingURL=types.d.ts.map

node_modules/metro/node_modules/@jest/source-map/build/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,oBAAY,iBAAiB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC"}

node_modules/metro/node_modules/@jest/source-map/build/types.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/CHANGELOG.md

@@ -0,0 +1,301 @@
+# Change Log
+
+## 0.5.6
+
+* Fix for regression when people were using numbers as names in source maps. See
+  #236.
+
+## 0.5.5
+
+* Fix "regression" of unsupported, implementation behavior that half the world
+  happens to have come to depend on. See #235.
+
+* Fix regression involving function hoisting in SpiderMonkey. See #233.
+
+## 0.5.4
+
+* Large performance improvements to source-map serialization. See #228 and #229.
+
+## 0.5.3
+
+* Do not include unnecessary distribution files. See
+  commit ef7006f8d1647e0a83fdc60f04f5a7ca54886f86.
+
+## 0.5.2
+
+* Include browser distributions of the library in package.json's `files`. See
+  issue #212.
+
+## 0.5.1
+
+* Fix latent bugs in IndexedSourceMapConsumer.prototype._parseMappings. See
+  ff05274becc9e6e1295ed60f3ea090d31d843379.
+
+## 0.5.0
+
+* Node 0.8 is no longer supported.
+
+* Use webpack instead of dryice for bundling.
+
+* Big speedups serializing source maps. See pull request #203.
+
+* Fix a bug with `SourceMapConsumer.prototype.sourceContentFor` and sources that
+  explicitly start with the source root. See issue #199.
+
+## 0.4.4
+
+* Fix an issue where using a `SourceMapGenerator` after having created a
+  `SourceMapConsumer` from it via `SourceMapConsumer.fromSourceMap` failed. See
+  issue #191.
+
+* Fix an issue with where `SourceMapGenerator` would mistakenly consider
+  different mappings as duplicates of each other and avoid generating them. See
+  issue #192.
+
+## 0.4.3
+
+* A very large number of performance improvements, particularly when parsing
+  source maps. Collectively about 75% of time shaved off of the source map
+  parsing benchmark!
+
+* Fix a bug in `SourceMapConsumer.prototype.allGeneratedPositionsFor` and fuzzy
+  searching in the presence of a column option. See issue #177.
+
+* Fix a bug with joining a source and its source root when the source is above
+  the root. See issue #182.
+
+* Add the `SourceMapConsumer.prototype.hasContentsOfAllSources` method to
+  determine when all sources' contents are inlined into the source map. See
+  issue #190.
+
+## 0.4.2
+
+* Add an `.npmignore` file so that the benchmarks aren't pulled down by
+  dependent projects. Issue #169.
+
+* Add an optional `column` argument to
+  `SourceMapConsumer.prototype.allGeneratedPositionsFor` and better handle lines
+  with no mappings. Issues #172 and #173.
+
+## 0.4.1
+
+* Fix accidentally defining a global variable. #170.
+
+## 0.4.0
+
+* The default direction for fuzzy searching was changed back to its original
+  direction. See #164.
+
+* There is now a `bias` option you can supply to `SourceMapConsumer` to control
+  the fuzzy searching direction. See #167.
+
+* About an 8% speed up in parsing source maps. See #159.
+
+* Added a benchmark for parsing and generating source maps.
+
+## 0.3.0
+
+* Change the default direction that searching for positions fuzzes when there is
+  not an exact match. See #154.
+
+* Support for environments using json2.js for JSON serialization. See #156.
+
+## 0.2.0
+
+* Support for consuming "indexed" source maps which do not have any remote
+  sections. See pull request #127. This introduces a minor backwards
+  incompatibility if you are monkey patching `SourceMapConsumer.prototype`
+  methods.
+
+## 0.1.43
+
+* Performance improvements for `SourceMapGenerator` and `SourceNode`. See issue
+  #148 for some discussion and issues #150, #151, and #152 for implementations.
+
+## 0.1.42
+
+* Fix an issue where `SourceNode`s from different versions of the source-map
+  library couldn't be used in conjunction with each other. See issue #142.
+
+## 0.1.41
+
+* Fix a bug with getting the source content of relative sources with a "./"
+  prefix. See issue #145 and [Bug 1090768](bugzil.la/1090768).
+
+* Add the `SourceMapConsumer.prototype.computeColumnSpans` method to compute the
+  column span of each mapping.
+
+* Add the `SourceMapConsumer.prototype.allGeneratedPositionsFor` method to find
+  all generated positions associated with a given original source and line.
+
+## 0.1.40
+
+* Performance improvements for parsing source maps in SourceMapConsumer.
+
+## 0.1.39
+
+* Fix a bug where setting a source's contents to null before any source content
+  had been set before threw a TypeError. See issue #131.
+
+## 0.1.38
+
+* Fix a bug where finding relative paths from an empty path were creating
+  absolute paths. See issue #129.
+
+## 0.1.37
+
+* Fix a bug where if the source root was an empty string, relative source paths
+  would turn into absolute source paths. Issue #124.
+
+## 0.1.36
+
+* Allow the `names` mapping property to be an empty string. Issue #121.
+
+## 0.1.35
+
+* A third optional parameter was added to `SourceNode.fromStringWithSourceMap`
+  to specify a path that relative sources in the second parameter should be
+  relative to. Issue #105.
+
+* If no file property is given to a `SourceMapGenerator`, then the resulting
+  source map will no longer have a `null` file property. The property will
+  simply not exist. Issue #104.
+
+* Fixed a bug where consecutive newlines were ignored in `SourceNode`s.
+  Issue #116.
+
+## 0.1.34
+
+* Make `SourceNode` work with windows style ("\r\n") newlines. Issue #103.
+
+* Fix bug involving source contents and the
+  `SourceMapGenerator.prototype.applySourceMap`. Issue #100.
+
+## 0.1.33
+
+* Fix some edge cases surrounding path joining and URL resolution.
+
+* Add a third parameter for relative path to
+  `SourceMapGenerator.prototype.applySourceMap`.
+
+* Fix issues with mappings and EOLs.
+
+## 0.1.32
+
+* Fixed a bug where SourceMapConsumer couldn't handle negative relative columns
+  (issue 92).
+
+* Fixed test runner to actually report number of failed tests as its process
+  exit code.
+
+* Fixed a typo when reporting bad mappings (issue 87).
+
+## 0.1.31
+
+* Delay parsing the mappings in SourceMapConsumer until queried for a source
+  location.
+
+* Support Sass source maps (which at the time of writing deviate from the spec
+  in small ways) in SourceMapConsumer.
+
+## 0.1.30
+
+* Do not join source root with a source, when the source is a data URI.
+
+* Extend the test runner to allow running single specific test files at a time.
+
+* Performance improvements in `SourceNode.prototype.walk` and
+  `SourceMapConsumer.prototype.eachMapping`.
+
+* Source map browser builds will now work inside Workers.
+
+* Better error messages when attempting to add an invalid mapping to a
+  `SourceMapGenerator`.
+
+## 0.1.29
+
+* Allow duplicate entries in the `names` and `sources` arrays of source maps
+  (usually from TypeScript) we are parsing. Fixes github issue 72.
+
+## 0.1.28
+
+* Skip duplicate mappings when creating source maps from SourceNode; github
+  issue 75.
+
+## 0.1.27
+
+* Don't throw an error when the `file` property is missing in SourceMapConsumer,
+  we don't use it anyway.
+
+## 0.1.26
+
+* Fix SourceNode.fromStringWithSourceMap for empty maps. Fixes github issue 70.
+
+## 0.1.25
+
+* Make compatible with browserify
+
+## 0.1.24
+
+* Fix issue with absolute paths and `file://` URIs. See
+  https://bugzilla.mozilla.org/show_bug.cgi?id=885597
+
+## 0.1.23
+
+* Fix issue with absolute paths and sourcesContent, github issue 64.
+
+## 0.1.22
+
+* Ignore duplicate mappings in SourceMapGenerator. Fixes github issue 21.
+
+## 0.1.21
+
+* Fixed handling of sources that start with a slash so that they are relative to
+  the source root's host.
+
+## 0.1.20
+
+* Fixed github issue #43: absolute URLs aren't joined with the source root
+  anymore.
+
+## 0.1.19
+
+* Using Travis CI to run tests.
+
+## 0.1.18
+
+* Fixed a bug in the handling of sourceRoot.
+
+## 0.1.17
+
+* Added SourceNode.fromStringWithSourceMap.
+
+## 0.1.16
+
+* Added missing documentation.
+
+* Fixed the generating of empty mappings in SourceNode.
+
+## 0.1.15
+
+* Added SourceMapGenerator.applySourceMap.
+
+## 0.1.14
+
+* The sourceRoot is now handled consistently.
+
+## 0.1.13
+
+* Added SourceMapGenerator.fromSourceMap.
+
+## 0.1.12
+
+* SourceNode now generates empty mappings too.
+
+## 0.1.11
+
+* Added name support to SourceNode.
+
+## 0.1.10
+
+* Added sourcesContent support to the customer and generator.

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/LICENSE

@@ -0,0 +1,28 @@
+
+Copyright (c) 2009-2011, Mozilla Foundation and contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the names of the Mozilla Foundation nor the names of project
+  contributors may be used to endorse or promote products derived from this
+  software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/README.md

@@ -0,0 +1,742 @@
+# Source Map
+
+[![Build Status](https://travis-ci.org/mozilla/source-map.png?branch=master)](https://travis-ci.org/mozilla/source-map)
+
+[![NPM](https://nodei.co/npm/source-map.png?downloads=true&downloadRank=true)](https://www.npmjs.com/package/source-map)
+
+This is a library to generate and consume the source map format
+[described here][format].
+
+[format]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit
+
+## Use with Node
+
+    $ npm install source-map
+
+## Use on the Web
+
+    <script src="https://raw.githubusercontent.com/mozilla/source-map/master/dist/source-map.min.js" defer></script>
+
+--------------------------------------------------------------------------------
+
+<!-- `npm run toc` to regenerate the Table of Contents -->
+
+<!-- START doctoc generated TOC please keep comment here to allow auto update -->
+<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN doctoc TO UPDATE -->
+## Table of Contents
+
+- [Examples](#examples)
+  - [Consuming a source map](#consuming-a-source-map)
+  - [Generating a source map](#generating-a-source-map)
+    - [With SourceNode (high level API)](#with-sourcenode-high-level-api)
+    - [With SourceMapGenerator (low level API)](#with-sourcemapgenerator-low-level-api)
+- [API](#api)
+  - [SourceMapConsumer](#sourcemapconsumer)
+    - [new SourceMapConsumer(rawSourceMap)](#new-sourcemapconsumerrawsourcemap)
+    - [SourceMapConsumer.prototype.computeColumnSpans()](#sourcemapconsumerprototypecomputecolumnspans)
+    - [SourceMapConsumer.prototype.originalPositionFor(generatedPosition)](#sourcemapconsumerprototypeoriginalpositionforgeneratedposition)
+    - [SourceMapConsumer.prototype.generatedPositionFor(originalPosition)](#sourcemapconsumerprototypegeneratedpositionfororiginalposition)
+    - [SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)](#sourcemapconsumerprototypeallgeneratedpositionsfororiginalposition)
+    - [SourceMapConsumer.prototype.hasContentsOfAllSources()](#sourcemapconsumerprototypehascontentsofallsources)
+    - [SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])](#sourcemapconsumerprototypesourcecontentforsource-returnnullonmissing)
+    - [SourceMapConsumer.prototype.eachMapping(callback, context, order)](#sourcemapconsumerprototypeeachmappingcallback-context-order)
+  - [SourceMapGenerator](#sourcemapgenerator)
+    - [new SourceMapGenerator([startOfSourceMap])](#new-sourcemapgeneratorstartofsourcemap)
+    - [SourceMapGenerator.fromSourceMap(sourceMapConsumer)](#sourcemapgeneratorfromsourcemapsourcemapconsumer)
+    - [SourceMapGenerator.prototype.addMapping(mapping)](#sourcemapgeneratorprototypeaddmappingmapping)
+    - [SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)](#sourcemapgeneratorprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])](#sourcemapgeneratorprototypeapplysourcemapsourcemapconsumer-sourcefile-sourcemappath)
+    - [SourceMapGenerator.prototype.toString()](#sourcemapgeneratorprototypetostring)
+  - [SourceNode](#sourcenode)
+    - [new SourceNode([line, column, source[, chunk[, name]]])](#new-sourcenodeline-column-source-chunk-name)
+    - [SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])](#sourcenodefromstringwithsourcemapcode-sourcemapconsumer-relativepath)
+    - [SourceNode.prototype.add(chunk)](#sourcenodeprototypeaddchunk)
+    - [SourceNode.prototype.prepend(chunk)](#sourcenodeprototypeprependchunk)
+    - [SourceNode.prototype.setSourceContent(sourceFile, sourceContent)](#sourcenodeprototypesetsourcecontentsourcefile-sourcecontent)
+    - [SourceNode.prototype.walk(fn)](#sourcenodeprototypewalkfn)
+    - [SourceNode.prototype.walkSourceContents(fn)](#sourcenodeprototypewalksourcecontentsfn)
+    - [SourceNode.prototype.join(sep)](#sourcenodeprototypejoinsep)
+    - [SourceNode.prototype.replaceRight(pattern, replacement)](#sourcenodeprototypereplacerightpattern-replacement)
+    - [SourceNode.prototype.toString()](#sourcenodeprototypetostring)
+    - [SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])](#sourcenodeprototypetostringwithsourcemapstartofsourcemap)
+
+<!-- END doctoc generated TOC please keep comment here to allow auto update -->
+
+## Examples
+
+### Consuming a source map
+
+```js
+var rawSourceMap = {
+  version: 3,
+  file: 'min.js',
+  names: ['bar', 'baz', 'n'],
+  sources: ['one.js', 'two.js'],
+  sourceRoot: 'http://example.com/www/js/',
+  mappings: 'CAAC,IAAI,IAAM,SAAUA,GAClB,OAAOC,IAAID;CCDb,IAAI,IAAM,SAAUE,GAClB,OAAOA'
+};
+
+var smc = new SourceMapConsumer(rawSourceMap);
+
+console.log(smc.sources);
+// [ 'http://example.com/www/js/one.js',
+//   'http://example.com/www/js/two.js' ]
+
+console.log(smc.originalPositionFor({
+  line: 2,
+  column: 28
+}));
+// { source: 'http://example.com/www/js/two.js',
+//   line: 2,
+//   column: 10,
+//   name: 'n' }
+
+console.log(smc.generatedPositionFor({
+  source: 'http://example.com/www/js/two.js',
+  line: 2,
+  column: 10
+}));
+// { line: 2, column: 28 }
+
+smc.eachMapping(function (m) {
+  // ...
+});
+```
+
+### Generating a source map
+
+In depth guide:
+[**Compiling to JavaScript, and Debugging with Source Maps**](https://hacks.mozilla.org/2013/05/compiling-to-javascript-and-debugging-with-source-maps/)
+
+#### With SourceNode (high level API)
+
+```js
+function compile(ast) {
+  switch (ast.type) {
+  case 'BinaryExpression':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      [compile(ast.left), " + ", compile(ast.right)]
+    );
+  case 'Literal':
+    return new SourceNode(
+      ast.location.line,
+      ast.location.column,
+      ast.location.source,
+      String(ast.value)
+    );
+  // ...
+  default:
+    throw new Error("Bad AST");
+  }
+}
+
+var ast = parse("40 + 2", "add.js");
+console.log(compile(ast).toStringWithSourceMap({
+  file: 'add.js'
+}));
+// { code: '40 + 2',
+//   map: [object SourceMapGenerator] }
+```
+
+#### With SourceMapGenerator (low level API)
+
+```js
+var map = new SourceMapGenerator({
+  file: "source-mapped.js"
+});
+
+map.addMapping({
+  generated: {
+    line: 10,
+    column: 35
+  },
+  source: "foo.js",
+  original: {
+    line: 33,
+    column: 2
+  },
+  name: "christopher"
+});
+
+console.log(map.toString());
+// '{"version":3,"file":"source-mapped.js","sources":["foo.js"],"names":["christopher"],"mappings":";;;;;;;;;mCAgCEA"}'
+```
+
+## API
+
+Get a reference to the module:
+
+```js
+// Node.js
+var sourceMap = require('source-map');
+
+// Browser builds
+var sourceMap = window.sourceMap;
+
+// Inside Firefox
+const sourceMap = require("devtools/toolkit/sourcemap/source-map.js");
+```
+
+### SourceMapConsumer
+
+A SourceMapConsumer instance represents a parsed source map which we can query
+for information about the original file positions by giving it a file position
+in the generated source.
+
+#### new SourceMapConsumer(rawSourceMap)
+
+The only parameter is the raw source map (either as a string which can be
+`JSON.parse`'d, or an object). According to the spec, source maps have the
+following attributes:
+
+* `version`: Which version of the source map spec this map is following.
+
+* `sources`: An array of URLs to the original source files.
+
+* `names`: An array of identifiers which can be referenced by individual
+  mappings.
+
+* `sourceRoot`: Optional. The URL root from which all sources are relative.
+
+* `sourcesContent`: Optional. An array of contents of the original source files.
+
+* `mappings`: A string of base64 VLQs which contain the actual mappings.
+
+* `file`: Optional. The generated filename this source map is associated with.
+
+```js
+var consumer = new sourceMap.SourceMapConsumer(rawSourceMapJsonData);
+```
+
+#### SourceMapConsumer.prototype.computeColumnSpans()
+
+Compute the last column for each generated mapping. The last column is
+inclusive.
+
+```js
+// Before:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+
+consumer.computeColumnSpans();
+
+// After:
+consumer.allGeneratedPositionsFor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1,
+//     lastColumn: 9 },
+//   { line: 2,
+//     column: 10,
+//     lastColumn: 19 },
+//   { line: 2,
+//     column: 20,
+//     lastColumn: Infinity } ]
+
+```
+
+#### SourceMapConsumer.prototype.originalPositionFor(generatedPosition)
+
+Returns the original source, line, and column information for the generated
+source's line and column positions provided. The only argument is an object with
+the following properties:
+
+* `line`: The line number in the generated source.  Line numbers in
+  this library are 1-based (note that the underlying source map
+  specification uses 0-based line numbers -- this library handles the
+  translation).
+
+* `column`: The column number in the generated source.  Column numbers
+  in this library are 0-based.
+
+* `bias`: Either `SourceMapConsumer.GREATEST_LOWER_BOUND` or
+  `SourceMapConsumer.LEAST_UPPER_BOUND`. Specifies whether to return the closest
+  element that is smaller than or greater than the one we are searching for,
+  respectively, if the exact element cannot be found.  Defaults to
+  `SourceMapConsumer.GREATEST_LOWER_BOUND`.
+
+and an object is returned with the following properties:
+
+* `source`: The original source file, or null if this information is not
+  available.
+
+* `line`: The line number in the original source, or null if this information is
+  not available.  The line number is 1-based.
+
+* `column`: The column number in the original source, or null if this
+  information is not available.  The column number is 0-based.
+
+* `name`: The original identifier, or null if this information is not available.
+
+```js
+consumer.originalPositionFor({ line: 2, column: 10 })
+// { source: 'foo.coffee',
+//   line: 2,
+//   column: 2,
+//   name: null }
+
+consumer.originalPositionFor({ line: 99999999999999999, column: 999999999999999 })
+// { source: null,
+//   line: null,
+//   column: null,
+//   name: null }
+```
+
+#### SourceMapConsumer.prototype.generatedPositionFor(originalPosition)
+
+Returns the generated line and column information for the original source,
+line, and column positions provided. The only argument is an object with
+the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: The column number in the original source.  The column
+  number is 0-based.
+
+and an object is returned with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.generatedPositionFor({ source: "example.js", line: 2, column: 10 })
+// { line: 1,
+//   column: 56 }
+```
+
+#### SourceMapConsumer.prototype.allGeneratedPositionsFor(originalPosition)
+
+Returns all generated line and column information for the original source, line,
+and column provided. If no column is provided, returns all mappings
+corresponding to a either the line we are searching for or the next closest line
+that has any mappings. Otherwise, returns all mappings corresponding to the
+given line and either the column we are searching for or the next closest column
+that has any offsets.
+
+The only argument is an object with the following properties:
+
+* `source`: The filename of the original source.
+
+* `line`: The line number in the original source.  The line number is
+  1-based.
+
+* `column`: Optional. The column number in the original source.  The
+  column number is 0-based.
+
+and an array of objects is returned, each with the following properties:
+
+* `line`: The line number in the generated source, or null.  The line
+  number is 1-based.
+
+* `column`: The column number in the generated source, or null.  The
+  column number is 0-based.
+
+```js
+consumer.allGeneratedpositionsfor({ line: 2, source: "foo.coffee" })
+// [ { line: 2,
+//     column: 1 },
+//   { line: 2,
+//     column: 10 },
+//   { line: 2,
+//     column: 20 } ]
+```
+
+#### SourceMapConsumer.prototype.hasContentsOfAllSources()
+
+Return true if we have the embedded source content for every source listed in
+the source map, false otherwise.
+
+In other words, if this method returns `true`, then
+`consumer.sourceContentFor(s)` will succeed for every source `s` in
+`consumer.sources`.
+
+```js
+// ...
+if (consumer.hasContentsOfAllSources()) {
+  consumerReadyCallback(consumer);
+} else {
+  fetchSources(consumer, consumerReadyCallback);
+}
+// ...
+```
+
+#### SourceMapConsumer.prototype.sourceContentFor(source[, returnNullOnMissing])
+
+Returns the original source content for the source provided. The only
+argument is the URL of the original source file.
+
+If the source content for the given source is not found, then an error is
+thrown. Optionally, pass `true` as the second param to have `null` returned
+instead.
+
+```js
+consumer.sources
+// [ "my-cool-lib.clj" ]
+
+consumer.sourceContentFor("my-cool-lib.clj")
+// "..."
+
+consumer.sourceContentFor("this is not in the source map");
+// Error: "this is not in the source map" is not in the source map
+
+consumer.sourceContentFor("this is not in the source map", true);
+// null
+```
+
+#### SourceMapConsumer.prototype.eachMapping(callback, context, order)
+
+Iterate over each mapping between an original source/line/column and a
+generated line/column in this source map.
+
+* `callback`: The function that is called with each mapping. Mappings have the
+  form `{ source, generatedLine, generatedColumn, originalLine, originalColumn,
+  name }`
+
+* `context`: Optional. If specified, this object will be the value of `this`
+  every time that `callback` is called.
+
+* `order`: Either `SourceMapConsumer.GENERATED_ORDER` or
+  `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to iterate over
+  the mappings sorted by the generated file's line/column order or the
+  original's source/line/column order, respectively. Defaults to
+  `SourceMapConsumer.GENERATED_ORDER`.
+
+```js
+consumer.eachMapping(function (m) { console.log(m); })
+// ...
+// { source: 'illmatic.js',
+//   generatedLine: 1,
+//   generatedColumn: 0,
+//   originalLine: 1,
+//   originalColumn: 0,
+//   name: null }
+// { source: 'illmatic.js',
+//   generatedLine: 2,
+//   generatedColumn: 0,
+//   originalLine: 2,
+//   originalColumn: 0,
+//   name: null }
+// ...
+```
+### SourceMapGenerator
+
+An instance of the SourceMapGenerator represents a source map which is being
+built incrementally.
+
+#### new SourceMapGenerator([startOfSourceMap])
+
+You may pass an object with the following properties:
+
+* `file`: The filename of the generated source that this source map is
+  associated with.
+
+* `sourceRoot`: A root for all relative URLs in this source map.
+
+* `skipValidation`: Optional. When `true`, disables validation of mappings as
+  they are added. This can improve performance but should be used with
+  discretion, as a last resort. Even then, one should avoid using this flag when
+  running tests, if possible.
+
+```js
+var generator = new sourceMap.SourceMapGenerator({
+  file: "my-generated-javascript-file.js",
+  sourceRoot: "http://example.com/app/js/"
+});
+```
+
+#### SourceMapGenerator.fromSourceMap(sourceMapConsumer)
+
+Creates a new `SourceMapGenerator` from an existing `SourceMapConsumer` instance.
+
+* `sourceMapConsumer` The SourceMap.
+
+```js
+var generator = sourceMap.SourceMapGenerator.fromSourceMap(consumer);
+```
+
+#### SourceMapGenerator.prototype.addMapping(mapping)
+
+Add a single mapping from original source line and column to the generated
+source's line and column for this source map being created. The mapping object
+should have the following properties:
+
+* `generated`: An object with the generated line and column positions.
+
+* `original`: An object with the original line and column positions.
+
+* `source`: The original source file (relative to the sourceRoot).
+
+* `name`: An optional original token name for this mapping.
+
+```js
+generator.addMapping({
+  source: "module-one.scm",
+  original: { line: 128, column: 0 },
+  generated: { line: 3, column: 456 }
+})
+```
+
+#### SourceMapGenerator.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for an original source file.
+
+* `sourceFile` the URL of the original source file.
+
+* `sourceContent` the content of the source file.
+
+```js
+generator.setSourceContent("module-one.scm",
+                           fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceMapGenerator.prototype.applySourceMap(sourceMapConsumer[, sourceFile[, sourceMapPath]])
+
+Applies a SourceMap for a source file to the SourceMap.
+Each mapping to the supplied source file is rewritten using the
+supplied SourceMap. Note: The resolution for the resulting mappings
+is the minimum of this map and the supplied map.
+
+* `sourceMapConsumer`: The SourceMap to be applied.
+
+* `sourceFile`: Optional. The filename of the source file.
+  If omitted, sourceMapConsumer.file will be used, if it exists.
+  Otherwise an error will be thrown.
+
+* `sourceMapPath`: Optional. The dirname of the path to the SourceMap
+  to be applied. If relative, it is relative to the SourceMap.
+
+  This parameter is needed when the two SourceMaps aren't in the same
+  directory, and the SourceMap to be applied contains relative source
+  paths. If so, those relative source paths need to be rewritten
+  relative to the SourceMap.
+
+  If omitted, it is assumed that both SourceMaps are in the same directory,
+  thus not needing any rewriting. (Supplying `'.'` has the same effect.)
+
+#### SourceMapGenerator.prototype.toString()
+
+Renders the source map being generated to a string.
+
+```js
+generator.toString()
+// '{"version":3,"sources":["module-one.scm"],"names":[],"mappings":"...snip...","file":"my-generated-javascript-file.js","sourceRoot":"http://example.com/app/js/"}'
+```
+
+### SourceNode
+
+SourceNodes provide a way to abstract over interpolating and/or concatenating
+snippets of generated JavaScript source code, while maintaining the line and
+column information associated between those snippets and the original source
+code. This is useful as the final intermediate representation a compiler might
+use before outputting the generated JS and source map.
+
+#### new SourceNode([line, column, source[, chunk[, name]]])
+
+* `line`: The original line number associated with this source node, or null if
+  it isn't associated with an original line.  The line number is 1-based.
+
+* `column`: The original column number associated with this source node, or null
+  if it isn't associated with an original column.  The column number
+  is 0-based.
+
+* `source`: The original source's filename; null if no filename is provided.
+
+* `chunk`: Optional. Is immediately passed to `SourceNode.prototype.add`, see
+  below.
+
+* `name`: Optional. The original identifier.
+
+```js
+var node = new SourceNode(1, 2, "a.cpp", [
+  new SourceNode(3, 4, "b.cpp", "extern int status;\n"),
+  new SourceNode(5, 6, "c.cpp", "std::string* make_string(size_t n);\n"),
+  new SourceNode(7, 8, "d.cpp", "int main(int argc, char** argv) {}\n"),
+]);
+```
+
+#### SourceNode.fromStringWithSourceMap(code, sourceMapConsumer[, relativePath])
+
+Creates a SourceNode from generated code and a SourceMapConsumer.
+
+* `code`: The generated code
+
+* `sourceMapConsumer` The SourceMap for the generated code
+
+* `relativePath` The optional path that relative sources in `sourceMapConsumer`
+  should be relative to.
+
+```js
+var consumer = new SourceMapConsumer(fs.readFileSync("path/to/my-file.js.map", "utf8"));
+var node = SourceNode.fromStringWithSourceMap(fs.readFileSync("path/to/my-file.js"),
+                                              consumer);
+```
+
+#### SourceNode.prototype.add(chunk)
+
+Add a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.add(" + ");
+node.add(otherNode);
+node.add([leftHandOperandNode, " + ", rightHandOperandNode]);
+```
+
+#### SourceNode.prototype.prepend(chunk)
+
+Prepend a chunk of generated JS to this source node.
+
+* `chunk`: A string snippet of generated JS code, another instance of
+   `SourceNode`, or an array where each member is one of those things.
+
+```js
+node.prepend("/** Build Id: f783haef86324gf **/\n\n");
+```
+
+#### SourceNode.prototype.setSourceContent(sourceFile, sourceContent)
+
+Set the source content for a source file. This will be added to the
+`SourceMap` in the `sourcesContent` field.
+
+* `sourceFile`: The filename of the source file
+
+* `sourceContent`: The content of the source file
+
+```js
+node.setSourceContent("module-one.scm",
+                      fs.readFileSync("path/to/module-one.scm"))
+```
+
+#### SourceNode.prototype.walk(fn)
+
+Walk over the tree of JS snippets in this node and its children. The walking
+function is called once for each snippet of JS and is passed that snippet and
+the its original associated source's line/column location.
+
+* `fn`: The traversal function.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.walk(function (code, loc) { console.log("WALK:", code, loc); })
+// WALK: uno { source: 'b.js', line: 3, column: 4, name: null }
+// WALK: dos { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: tres { source: 'a.js', line: 1, column: 2, name: null }
+// WALK: quatro { source: 'c.js', line: 5, column: 6, name: null }
+```
+
+#### SourceNode.prototype.walkSourceContents(fn)
+
+Walk over the tree of SourceNodes. The walking function is called for each
+source file content and is passed the filename and source content.
+
+* `fn`: The traversal function.
+
+```js
+var a = new SourceNode(1, 2, "a.js", "generated from a");
+a.setSourceContent("a.js", "original a");
+var b = new SourceNode(1, 2, "b.js", "generated from b");
+b.setSourceContent("b.js", "original b");
+var c = new SourceNode(1, 2, "c.js", "generated from c");
+c.setSourceContent("c.js", "original c");
+
+var node = new SourceNode(null, null, null, [a, b, c]);
+node.walkSourceContents(function (source, contents) { console.log("WALK:", source, ":", contents); })
+// WALK: a.js : original a
+// WALK: b.js : original b
+// WALK: c.js : original c
+```
+
+#### SourceNode.prototype.join(sep)
+
+Like `Array.prototype.join` except for SourceNodes. Inserts the separator
+between each of this source node's children.
+
+* `sep`: The separator.
+
+```js
+var lhs = new SourceNode(1, 2, "a.rs", "my_copy");
+var operand = new SourceNode(3, 4, "a.rs", "=");
+var rhs = new SourceNode(5, 6, "a.rs", "orig.clone()");
+
+var node = new SourceNode(null, null, null, [ lhs, operand, rhs ]);
+var joinedNode = node.join(" ");
+```
+
+#### SourceNode.prototype.replaceRight(pattern, replacement)
+
+Call `String.prototype.replace` on the very right-most source snippet. Useful
+for trimming white space from the end of a source node, etc.
+
+* `pattern`: The pattern to replace.
+
+* `replacement`: The thing to replace the pattern with.
+
+```js
+// Trim trailing white space.
+node.replaceRight(/\s*$/, "");
+```
+
+#### SourceNode.prototype.toString()
+
+Return the string representation of this source node. Walks over the tree and
+concatenates all the various snippets together to one string.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toString()
+// 'unodostresquatro'
+```
+
+#### SourceNode.prototype.toStringWithSourceMap([startOfSourceMap])
+
+Returns the string representation of this tree of source nodes, plus a
+SourceMapGenerator which contains all the mappings between the generated and
+original sources.
+
+The arguments are the same as those to `new SourceMapGenerator`.
+
+```js
+var node = new SourceNode(1, 2, "a.js", [
+  new SourceNode(3, 4, "b.js", "uno"),
+  "dos",
+  [
+    "tres",
+    new SourceNode(5, 6, "c.js", "quatro")
+  ]
+]);
+
+node.toStringWithSourceMap({ file: "my-output-file.js" })
+// { code: 'unodostresquatro',
+//   map: [object SourceMapGenerator] }
+```

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/array-set.js

@@ -0,0 +1,121 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+var has = Object.prototype.hasOwnProperty;
+var hasNativeMap = typeof Map !== "undefined";
+
+/**
+ * A data structure which is a combination of an array and a set. Adding a new
+ * member is O(1), testing for membership is O(1), and finding the index of an
+ * element is O(1). Removing elements from the set is not supported. Only
+ * strings are supported for membership.
+ */
+function ArraySet() {
+  this._array = [];
+  this._set = hasNativeMap ? new Map() : Object.create(null);
+}
+
+/**
+ * Static method for creating ArraySet instances from an existing array.
+ */
+ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+  var set = new ArraySet();
+  for (var i = 0, len = aArray.length; i < len; i++) {
+    set.add(aArray[i], aAllowDuplicates);
+  }
+  return set;
+};
+
+/**
+ * Return how many unique items are in this ArraySet. If duplicates have been
+ * added, than those do not count towards the size.
+ *
+ * @returns Number
+ */
+ArraySet.prototype.size = function ArraySet_size() {
+  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+};
+
+/**
+ * Add the given string to this set.
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+  var idx = this._array.length;
+  if (!isDuplicate || aAllowDuplicates) {
+    this._array.push(aStr);
+  }
+  if (!isDuplicate) {
+    if (hasNativeMap) {
+      this._set.set(aStr, idx);
+    } else {
+      this._set[sStr] = idx;
+    }
+  }
+};
+
+/**
+ * Is the given string a member of this set?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.has = function ArraySet_has(aStr) {
+  if (hasNativeMap) {
+    return this._set.has(aStr);
+  } else {
+    var sStr = util.toSetString(aStr);
+    return has.call(this._set, sStr);
+  }
+};
+
+/**
+ * What is the index of the given string in the array?
+ *
+ * @param String aStr
+ */
+ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+  if (hasNativeMap) {
+    var idx = this._set.get(aStr);
+    if (idx >= 0) {
+        return idx;
+    }
+  } else {
+    var sStr = util.toSetString(aStr);
+    if (has.call(this._set, sStr)) {
+      return this._set[sStr];
+    }
+  }
+
+  throw new Error('"' + aStr + '" is not in the set.');
+};
+
+/**
+ * What is the element at the given index?
+ *
+ * @param Number aIdx
+ */
+ArraySet.prototype.at = function ArraySet_at(aIdx) {
+  if (aIdx >= 0 && aIdx < this._array.length) {
+    return this._array[aIdx];
+  }
+  throw new Error('No element indexed by ' + aIdx);
+};
+
+/**
+ * Returns the array representation of this set (which has the proper indices
+ * indicated by indexOf). Note that this is a copy of the internal array used
+ * for storing the members so that no one can mess with internal state.
+ */
+ArraySet.prototype.toArray = function ArraySet_toArray() {
+  return this._array.slice();
+};
+
+exports.ArraySet = ArraySet;

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/base64-vlq.js

@@ -0,0 +1,140 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ *
+ * Based on the Base 64 VLQ implementation in Closure Compiler:
+ * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+ *
+ * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *  * Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *  * Redistributions in binary form must reproduce the above
+ *    copyright notice, this list of conditions and the following
+ *    disclaimer in the documentation and/or other materials provided
+ *    with the distribution.
+ *  * Neither the name of Google Inc. nor the names of its
+ *    contributors may be used to endorse or promote products derived
+ *    from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+var base64 = require('./base64');
+
+// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+// length quantities we use in the source map spec, the first bit is the sign,
+// the next four bits are the actual value, and the 6th bit is the
+// continuation bit. The continuation bit tells us whether there are more
+// digits in this value following this digit.
+//
+//   Continuation
+//   |    Sign
+//   |    |
+//   V    V
+//   101011
+
+var VLQ_BASE_SHIFT = 5;
+
+// binary: 100000
+var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+// binary: 011111
+var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+// binary: 100000
+var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+/**
+ * Converts from a two-complement value to a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+ *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+ */
+function toVLQSigned(aValue) {
+  return aValue < 0
+    ? ((-aValue) << 1) + 1
+    : (aValue << 1) + 0;
+}
+
+/**
+ * Converts to a two-complement value from a value where the sign bit is
+ * placed in the least significant bit.  For example, as decimals:
+ *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+ *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+ */
+function fromVLQSigned(aValue) {
+  var isNegative = (aValue & 1) === 1;
+  var shifted = aValue >> 1;
+  return isNegative
+    ? -shifted
+    : shifted;
+}
+
+/**
+ * Returns the base 64 VLQ encoded value.
+ */
+exports.encode = function base64VLQ_encode(aValue) {
+  var encoded = "";
+  var digit;
+
+  var vlq = toVLQSigned(aValue);
+
+  do {
+    digit = vlq & VLQ_BASE_MASK;
+    vlq >>>= VLQ_BASE_SHIFT;
+    if (vlq > 0) {
+      // There are still more digits in this value, so we must make sure the
+      // continuation bit is marked.
+      digit |= VLQ_CONTINUATION_BIT;
+    }
+    encoded += base64.encode(digit);
+  } while (vlq > 0);
+
+  return encoded;
+};
+
+/**
+ * Decodes the next base 64 VLQ value from the given string and returns the
+ * value and the rest of the string via the out parameter.
+ */
+exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+  var strLen = aStr.length;
+  var result = 0;
+  var shift = 0;
+  var continuation, digit;
+
+  do {
+    if (aIndex >= strLen) {
+      throw new Error("Expected more digits in base 64 VLQ value.");
+    }
+
+    digit = base64.decode(aStr.charCodeAt(aIndex++));
+    if (digit === -1) {
+      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+    }
+
+    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+    digit &= VLQ_BASE_MASK;
+    result = result + (digit << shift);
+    shift += VLQ_BASE_SHIFT;
+  } while (continuation);
+
+  aOutParam.value = fromVLQSigned(result);
+  aOutParam.rest = aIndex;
+};

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/base64.js

@@ -0,0 +1,67 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');
+
+/**
+ * Encode an integer in the range of 0 to 63 to a single base 64 digit.
+ */
+exports.encode = function (number) {
+  if (0 <= number && number < intToCharMap.length) {
+    return intToCharMap[number];
+  }
+  throw new TypeError("Must be between 0 and 63: " + number);
+};
+
+/**
+ * Decode a single base 64 character code digit to an integer. Returns -1 on
+ * failure.
+ */
+exports.decode = function (charCode) {
+  var bigA = 65;     // 'A'
+  var bigZ = 90;     // 'Z'
+
+  var littleA = 97;  // 'a'
+  var littleZ = 122; // 'z'
+
+  var zero = 48;     // '0'
+  var nine = 57;     // '9'
+
+  var plus = 43;     // '+'
+  var slash = 47;    // '/'
+
+  var littleOffset = 26;
+  var numberOffset = 52;
+
+  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ
+  if (bigA <= charCode && charCode <= bigZ) {
+    return (charCode - bigA);
+  }
+
+  // 26 - 51: abcdefghijklmnopqrstuvwxyz
+  if (littleA <= charCode && charCode <= littleZ) {
+    return (charCode - littleA + littleOffset);
+  }
+
+  // 52 - 61: 0123456789
+  if (zero <= charCode && charCode <= nine) {
+    return (charCode - zero + numberOffset);
+  }
+
+  // 62: +
+  if (charCode == plus) {
+    return 62;
+  }
+
+  // 63: /
+  if (charCode == slash) {
+    return 63;
+  }
+
+  // Invalid base64 digit.
+  return -1;
+};

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/binary-search.js

@@ -0,0 +1,111 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+exports.GREATEST_LOWER_BOUND = 1;
+exports.LEAST_UPPER_BOUND = 2;
+
+/**
+ * Recursive implementation of binary search.
+ *
+ * @param aLow Indices here and lower do not contain the needle.
+ * @param aHigh Indices here and higher do not contain the needle.
+ * @param aNeedle The element being searched for.
+ * @param aHaystack The non-empty array being searched.
+ * @param aCompare Function which takes two elements and returns -1, 0, or 1.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ */
+function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
+  // This function terminates when one of the following is true:
+  //
+  //   1. We find the exact element we are looking for.
+  //
+  //   2. We did not find the exact element, but we can return the index of
+  //      the next-closest element.
+  //
+  //   3. We did not find the exact element, and there is no next-closest
+  //      element than the one we are searching for, so we return -1.
+  var mid = Math.floor((aHigh - aLow) / 2) + aLow;
+  var cmp = aCompare(aNeedle, aHaystack[mid], true);
+  if (cmp === 0) {
+    // Found the element we are looking for.
+    return mid;
+  }
+  else if (cmp > 0) {
+    // Our needle is greater than aHaystack[mid].
+    if (aHigh - mid > 1) {
+      // The element is in the upper half.
+      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // The exact needle element was not found in this haystack. Determine if
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return aHigh < aHaystack.length ? aHigh : -1;
+    } else {
+      return mid;
+    }
+  }
+  else {
+    // Our needle is less than aHaystack[mid].
+    if (mid - aLow > 1) {
+      // The element is in the lower half.
+      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);
+    }
+
+    // we are in termination case (3) or (2) and return the appropriate thing.
+    if (aBias == exports.LEAST_UPPER_BOUND) {
+      return mid;
+    } else {
+      return aLow < 0 ? -1 : aLow;
+    }
+  }
+}
+
+/**
+ * This is an implementation of binary search which will always try and return
+ * the index of the closest element if there is no exact hit. This is because
+ * mappings between original and generated line/col pairs are single points,
+ * and there is an implicit region between each of them, so a miss just means
+ * that you aren't on the very start of a region.
+ *
+ * @param aNeedle The element you are looking for.
+ * @param aHaystack The array that is being searched.
+ * @param aCompare A function which takes the needle and an element in the
+ *     array and returns -1, 0, or 1 depending on whether the needle is less
+ *     than, equal to, or greater than the element, respectively.
+ * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or
+ *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the
+ *     closest element that is smaller than or greater than the one we are
+ *     searching for, respectively, if the exact element cannot be found.
+ *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.
+ */
+exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {
+  if (aHaystack.length === 0) {
+    return -1;
+  }
+
+  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,
+                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);
+  if (index < 0) {
+    return -1;
+  }
+
+  // We have found either the exact element, or the next-closest element than
+  // the one we are searching for. However, there may be more than one such
+  // element. Make sure we always return the smallest of these.
+  while (index - 1 >= 0) {
+    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {
+      break;
+    }
+    --index;
+  }
+
+  return index;
+};

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/mapping-list.js

@@ -0,0 +1,79 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2014 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var util = require('./util');
+
+/**
+ * Determine whether mappingB is after mappingA with respect to generated
+ * position.
+ */
+function generatedPositionAfter(mappingA, mappingB) {
+  // Optimized for most common case
+  var lineA = mappingA.generatedLine;
+  var lineB = mappingB.generatedLine;
+  var columnA = mappingA.generatedColumn;
+  var columnB = mappingB.generatedColumn;
+  return lineB > lineA || lineB == lineA && columnB >= columnA ||
+         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;
+}
+
+/**
+ * A data structure to provide a sorted view of accumulated mappings in a
+ * performance conscious manner. It trades a neglibable overhead in general
+ * case for a large speedup in case of mappings being added in order.
+ */
+function MappingList() {
+  this._array = [];
+  this._sorted = true;
+  // Serves as infimum
+  this._last = {generatedLine: -1, generatedColumn: 0};
+}
+
+/**
+ * Iterate through internal items. This method takes the same arguments that
+ * `Array.prototype.forEach` takes.
+ *
+ * NOTE: The order of the mappings is NOT guaranteed.
+ */
+MappingList.prototype.unsortedForEach =
+  function MappingList_forEach(aCallback, aThisArg) {
+    this._array.forEach(aCallback, aThisArg);
+  };
+
+/**
+ * Add the given source mapping.
+ *
+ * @param Object aMapping
+ */
+MappingList.prototype.add = function MappingList_add(aMapping) {
+  if (generatedPositionAfter(this._last, aMapping)) {
+    this._last = aMapping;
+    this._array.push(aMapping);
+  } else {
+    this._sorted = false;
+    this._array.push(aMapping);
+  }
+};
+
+/**
+ * Returns the flat, sorted array of mappings. The mappings are sorted by
+ * generated position.
+ *
+ * WARNING: This method returns internal data without copying, for
+ * performance. The return value must NOT be mutated, and should be treated as
+ * an immutable borrow. If you want to take ownership, you must make your own
+ * copy.
+ */
+MappingList.prototype.toArray = function MappingList_toArray() {
+  if (!this._sorted) {
+    this._array.sort(util.compareByGeneratedPositionsInflated);
+    this._sorted = true;
+  }
+  return this._array;
+};
+
+exports.MappingList = MappingList;

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/quick-sort.js

@@ -0,0 +1,114 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+// It turns out that some (most?) JavaScript engines don't self-host
+// `Array.prototype.sort`. This makes sense because C++ will likely remain
+// faster than JS when doing raw CPU-intensive sorting. However, when using a
+// custom comparator function, calling back and forth between the VM's C++ and
+// JIT'd JS is rather slow *and* loses JIT type information, resulting in
+// worse generated code for the comparator function than would be optimal. In
+// fact, when sorting with a comparator, these costs outweigh the benefits of
+// sorting in C++. By using our own JS-implemented Quick Sort (below), we get
+// a ~3500ms mean speed-up in `bench/bench.html`.
+
+/**
+ * Swap the elements indexed by `x` and `y` in the array `ary`.
+ *
+ * @param {Array} ary
+ *        The array.
+ * @param {Number} x
+ *        The index of the first item.
+ * @param {Number} y
+ *        The index of the second item.
+ */
+function swap(ary, x, y) {
+  var temp = ary[x];
+  ary[x] = ary[y];
+  ary[y] = temp;
+}
+
+/**
+ * Returns a random integer within the range `low .. high` inclusive.
+ *
+ * @param {Number} low
+ *        The lower bound on the range.
+ * @param {Number} high
+ *        The upper bound on the range.
+ */
+function randomIntInRange(low, high) {
+  return Math.round(low + (Math.random() * (high - low)));
+}
+
+/**
+ * The Quick Sort algorithm.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ * @param {Number} p
+ *        Start index of the array
+ * @param {Number} r
+ *        End index of the array
+ */
+function doQuickSort(ary, comparator, p, r) {
+  // If our lower bound is less than our upper bound, we (1) partition the
+  // array into two pieces and (2) recurse on each half. If it is not, this is
+  // the empty array and our base case.
+
+  if (p < r) {
+    // (1) Partitioning.
+    //
+    // The partitioning chooses a pivot between `p` and `r` and moves all
+    // elements that are less than or equal to the pivot to the before it, and
+    // all the elements that are greater than it after it. The effect is that
+    // once partition is done, the pivot is in the exact place it will be when
+    // the array is put in sorted order, and it will not need to be moved
+    // again. This runs in O(n) time.
+
+    // Always choose a random pivot so that an input array which is reverse
+    // sorted does not cause O(n^2) running time.
+    var pivotIndex = randomIntInRange(p, r);
+    var i = p - 1;
+
+    swap(ary, pivotIndex, r);
+    var pivot = ary[r];
+
+    // Immediately after `j` is incremented in this loop, the following hold
+    // true:
+    //
+    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.
+    //
+    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.
+    for (var j = p; j < r; j++) {
+      if (comparator(ary[j], pivot) <= 0) {
+        i += 1;
+        swap(ary, i, j);
+      }
+    }
+
+    swap(ary, i + 1, j);
+    var q = i + 1;
+
+    // (2) Recurse on each half.
+
+    doQuickSort(ary, comparator, p, q - 1);
+    doQuickSort(ary, comparator, q + 1, r);
+  }
+}
+
+/**
+ * Sort the given array in-place with the given comparator function.
+ *
+ * @param {Array} ary
+ *        An array to sort.
+ * @param {function} comparator
+ *        Function to use to compare two items.
+ */
+exports.quickSort = function (ary, comparator) {
+  doQuickSort(ary, comparator, 0, ary.length - 1);
+};

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/source-map-generator.js

@@ -0,0 +1,425 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var base64VLQ = require('./base64-vlq');
+var util = require('./util');
+var ArraySet = require('./array-set').ArraySet;
+var MappingList = require('./mapping-list').MappingList;
+
+/**
+ * An instance of the SourceMapGenerator represents a source map which is
+ * being built incrementally. You may pass an object with the following
+ * properties:
+ *
+ *   - file: The filename of the generated source.
+ *   - sourceRoot: A root for all relative URLs in this source map.
+ */
+function SourceMapGenerator(aArgs) {
+  if (!aArgs) {
+    aArgs = {};
+  }
+  this._file = util.getArg(aArgs, 'file', null);
+  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);
+  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);
+  this._sources = new ArraySet();
+  this._names = new ArraySet();
+  this._mappings = new MappingList();
+  this._sourcesContents = null;
+}
+
+SourceMapGenerator.prototype._version = 3;
+
+/**
+ * Creates a new SourceMapGenerator based on a SourceMapConsumer
+ *
+ * @param aSourceMapConsumer The SourceMap.
+ */
+SourceMapGenerator.fromSourceMap =
+  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {
+    var sourceRoot = aSourceMapConsumer.sourceRoot;
+    var generator = new SourceMapGenerator({
+      file: aSourceMapConsumer.file,
+      sourceRoot: sourceRoot
+    });
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      var newMapping = {
+        generated: {
+          line: mapping.generatedLine,
+          column: mapping.generatedColumn
+        }
+      };
+
+      if (mapping.source != null) {
+        newMapping.source = mapping.source;
+        if (sourceRoot != null) {
+          newMapping.source = util.relative(sourceRoot, newMapping.source);
+        }
+
+        newMapping.original = {
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        };
+
+        if (mapping.name != null) {
+          newMapping.name = mapping.name;
+        }
+      }
+
+      generator.addMapping(newMapping);
+    });
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var sourceRelative = sourceFile;
+      if (sourceRoot !== null) {
+        sourceRelative = util.relative(sourceRoot, sourceFile);
+      }
+
+      if (!generator._sources.has(sourceRelative)) {
+        generator._sources.add(sourceRelative);
+      }
+
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        generator.setSourceContent(sourceFile, content);
+      }
+    });
+    return generator;
+  };
+
+/**
+ * Add a single mapping from original source line and column to the generated
+ * source's line and column for this source map being created. The mapping
+ * object should have the following properties:
+ *
+ *   - generated: An object with the generated line and column positions.
+ *   - original: An object with the original line and column positions.
+ *   - source: The original source file (relative to the sourceRoot).
+ *   - name: An optional original token name for this mapping.
+ */
+SourceMapGenerator.prototype.addMapping =
+  function SourceMapGenerator_addMapping(aArgs) {
+    var generated = util.getArg(aArgs, 'generated');
+    var original = util.getArg(aArgs, 'original', null);
+    var source = util.getArg(aArgs, 'source', null);
+    var name = util.getArg(aArgs, 'name', null);
+
+    if (!this._skipValidation) {
+      this._validateMapping(generated, original, source, name);
+    }
+
+    if (source != null) {
+      source = String(source);
+      if (!this._sources.has(source)) {
+        this._sources.add(source);
+      }
+    }
+
+    if (name != null) {
+      name = String(name);
+      if (!this._names.has(name)) {
+        this._names.add(name);
+      }
+    }
+
+    this._mappings.add({
+      generatedLine: generated.line,
+      generatedColumn: generated.column,
+      originalLine: original != null && original.line,
+      originalColumn: original != null && original.column,
+      source: source,
+      name: name
+    });
+  };
+
+/**
+ * Set the source content for a source file.
+ */
+SourceMapGenerator.prototype.setSourceContent =
+  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {
+    var source = aSourceFile;
+    if (this._sourceRoot != null) {
+      source = util.relative(this._sourceRoot, source);
+    }
+
+    if (aSourceContent != null) {
+      // Add the source content to the _sourcesContents map.
+      // Create a new _sourcesContents map if the property is null.
+      if (!this._sourcesContents) {
+        this._sourcesContents = Object.create(null);
+      }
+      this._sourcesContents[util.toSetString(source)] = aSourceContent;
+    } else if (this._sourcesContents) {
+      // Remove the source file from the _sourcesContents map.
+      // If the _sourcesContents map is empty, set the property to null.
+      delete this._sourcesContents[util.toSetString(source)];
+      if (Object.keys(this._sourcesContents).length === 0) {
+        this._sourcesContents = null;
+      }
+    }
+  };
+
+/**
+ * Applies the mappings of a sub-source-map for a specific source file to the
+ * source map being generated. Each mapping to the supplied source file is
+ * rewritten using the supplied source map. Note: The resolution for the
+ * resulting mappings is the minimium of this map and the supplied map.
+ *
+ * @param aSourceMapConsumer The source map to be applied.
+ * @param aSourceFile Optional. The filename of the source file.
+ *        If omitted, SourceMapConsumer's file property will be used.
+ * @param aSourceMapPath Optional. The dirname of the path to the source map
+ *        to be applied. If relative, it is relative to the SourceMapConsumer.
+ *        This parameter is needed when the two source maps aren't in the same
+ *        directory, and the source map to be applied contains relative source
+ *        paths. If so, those relative source paths need to be rewritten
+ *        relative to the SourceMapGenerator.
+ */
+SourceMapGenerator.prototype.applySourceMap =
+  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {
+    var sourceFile = aSourceFile;
+    // If aSourceFile is omitted, we will use the file property of the SourceMap
+    if (aSourceFile == null) {
+      if (aSourceMapConsumer.file == null) {
+        throw new Error(
+          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +
+          'or the source map\'s "file" property. Both were omitted.'
+        );
+      }
+      sourceFile = aSourceMapConsumer.file;
+    }
+    var sourceRoot = this._sourceRoot;
+    // Make "sourceFile" relative if an absolute Url is passed.
+    if (sourceRoot != null) {
+      sourceFile = util.relative(sourceRoot, sourceFile);
+    }
+    // Applying the SourceMap can add and remove items from the sources and
+    // the names array.
+    var newSources = new ArraySet();
+    var newNames = new ArraySet();
+
+    // Find mappings for the "sourceFile"
+    this._mappings.unsortedForEach(function (mapping) {
+      if (mapping.source === sourceFile && mapping.originalLine != null) {
+        // Check if it can be mapped by the source map, then update the mapping.
+        var original = aSourceMapConsumer.originalPositionFor({
+          line: mapping.originalLine,
+          column: mapping.originalColumn
+        });
+        if (original.source != null) {
+          // Copy mapping
+          mapping.source = original.source;
+          if (aSourceMapPath != null) {
+            mapping.source = util.join(aSourceMapPath, mapping.source)
+          }
+          if (sourceRoot != null) {
+            mapping.source = util.relative(sourceRoot, mapping.source);
+          }
+          mapping.originalLine = original.line;
+          mapping.originalColumn = original.column;
+          if (original.name != null) {
+            mapping.name = original.name;
+          }
+        }
+      }
+
+      var source = mapping.source;
+      if (source != null && !newSources.has(source)) {
+        newSources.add(source);
+      }
+
+      var name = mapping.name;
+      if (name != null && !newNames.has(name)) {
+        newNames.add(name);
+      }
+
+    }, this);
+    this._sources = newSources;
+    this._names = newNames;
+
+    // Copy sourcesContents of applied map.
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aSourceMapPath != null) {
+          sourceFile = util.join(aSourceMapPath, sourceFile);
+        }
+        if (sourceRoot != null) {
+          sourceFile = util.relative(sourceRoot, sourceFile);
+        }
+        this.setSourceContent(sourceFile, content);
+      }
+    }, this);
+  };
+
+/**
+ * A mapping can have one of the three levels of data:
+ *
+ *   1. Just the generated position.
+ *   2. The Generated position, original position, and original source.
+ *   3. Generated and original position, original source, as well as a name
+ *      token.
+ *
+ * To maintain consistency, we validate that any new mapping being added falls
+ * in to one of these categories.
+ */
+SourceMapGenerator.prototype._validateMapping =
+  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,
+                                              aName) {
+    // When aOriginal is truthy but has empty values for .line and .column,
+    // it is most likely a programmer error. In this case we throw a very
+    // specific error message to try to guide them the right way.
+    // For example: https://github.com/Polymer/polymer-bundler/pull/519
+    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {
+        throw new Error(
+            'original.line and original.column are not numbers -- you probably meant to omit ' +
+            'the original mapping entirely and only map the generated position. If so, pass ' +
+            'null for the original mapping instead of an object with empty or null values.'
+        );
+    }
+
+    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+        && aGenerated.line > 0 && aGenerated.column >= 0
+        && !aOriginal && !aSource && !aName) {
+      // Case 1.
+      return;
+    }
+    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated
+             && aOriginal && 'line' in aOriginal && 'column' in aOriginal
+             && aGenerated.line > 0 && aGenerated.column >= 0
+             && aOriginal.line > 0 && aOriginal.column >= 0
+             && aSource) {
+      // Cases 2 and 3.
+      return;
+    }
+    else {
+      throw new Error('Invalid mapping: ' + JSON.stringify({
+        generated: aGenerated,
+        source: aSource,
+        original: aOriginal,
+        name: aName
+      }));
+    }
+  };
+
+/**
+ * Serialize the accumulated mappings in to the stream of base 64 VLQs
+ * specified by the source map format.
+ */
+SourceMapGenerator.prototype._serializeMappings =
+  function SourceMapGenerator_serializeMappings() {
+    var previousGeneratedColumn = 0;
+    var previousGeneratedLine = 1;
+    var previousOriginalColumn = 0;
+    var previousOriginalLine = 0;
+    var previousName = 0;
+    var previousSource = 0;
+    var result = '';
+    var next;
+    var mapping;
+    var nameIdx;
+    var sourceIdx;
+
+    var mappings = this._mappings.toArray();
+    for (var i = 0, len = mappings.length; i < len; i++) {
+      mapping = mappings[i];
+      next = ''
+
+      if (mapping.generatedLine !== previousGeneratedLine) {
+        previousGeneratedColumn = 0;
+        while (mapping.generatedLine !== previousGeneratedLine) {
+          next += ';';
+          previousGeneratedLine++;
+        }
+      }
+      else {
+        if (i > 0) {
+          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {
+            continue;
+          }
+          next += ',';
+        }
+      }
+
+      next += base64VLQ.encode(mapping.generatedColumn
+                                 - previousGeneratedColumn);
+      previousGeneratedColumn = mapping.generatedColumn;
+
+      if (mapping.source != null) {
+        sourceIdx = this._sources.indexOf(mapping.source);
+        next += base64VLQ.encode(sourceIdx - previousSource);
+        previousSource = sourceIdx;
+
+        // lines are stored 0-based in SourceMap spec version 3
+        next += base64VLQ.encode(mapping.originalLine - 1
+                                   - previousOriginalLine);
+        previousOriginalLine = mapping.originalLine - 1;
+
+        next += base64VLQ.encode(mapping.originalColumn
+                                   - previousOriginalColumn);
+        previousOriginalColumn = mapping.originalColumn;
+
+        if (mapping.name != null) {
+          nameIdx = this._names.indexOf(mapping.name);
+          next += base64VLQ.encode(nameIdx - previousName);
+          previousName = nameIdx;
+        }
+      }
+
+      result += next;
+    }
+
+    return result;
+  };
+
+SourceMapGenerator.prototype._generateSourcesContent =
+  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {
+    return aSources.map(function (source) {
+      if (!this._sourcesContents) {
+        return null;
+      }
+      if (aSourceRoot != null) {
+        source = util.relative(aSourceRoot, source);
+      }
+      var key = util.toSetString(source);
+      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)
+        ? this._sourcesContents[key]
+        : null;
+    }, this);
+  };
+
+/**
+ * Externalize the source map.
+ */
+SourceMapGenerator.prototype.toJSON =
+  function SourceMapGenerator_toJSON() {
+    var map = {
+      version: this._version,
+      sources: this._sources.toArray(),
+      names: this._names.toArray(),
+      mappings: this._serializeMappings()
+    };
+    if (this._file != null) {
+      map.file = this._file;
+    }
+    if (this._sourceRoot != null) {
+      map.sourceRoot = this._sourceRoot;
+    }
+    if (this._sourcesContents) {
+      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);
+    }
+
+    return map;
+  };
+
+/**
+ * Render the source map being generated to a string.
+ */
+SourceMapGenerator.prototype.toString =
+  function SourceMapGenerator_toString() {
+    return JSON.stringify(this.toJSON());
+  };
+
+exports.SourceMapGenerator = SourceMapGenerator;

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/source-node.js

@@ -0,0 +1,413 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+var SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;
+var util = require('./util');
+
+// Matches a Windows-style `\r\n` newline or a `\n` newline used by all other
+// operating systems these days (capturing the result).
+var REGEX_NEWLINE = /(\r?\n)/;
+
+// Newline character code for charCodeAt() comparisons
+var NEWLINE_CODE = 10;
+
+// Private symbol for identifying `SourceNode`s when multiple versions of
+// the source-map library are loaded. This MUST NOT CHANGE across
+// versions!
+var isSourceNode = "$$$isSourceNode$$$";
+
+/**
+ * SourceNodes provide a way to abstract over interpolating/concatenating
+ * snippets of generated JavaScript source code while maintaining the line and
+ * column information associated with the original source code.
+ *
+ * @param aLine The original line number.
+ * @param aColumn The original column number.
+ * @param aSource The original source's filename.
+ * @param aChunks Optional. An array of strings which are snippets of
+ *        generated JS, or other SourceNodes.
+ * @param aName The original identifier.
+ */
+function SourceNode(aLine, aColumn, aSource, aChunks, aName) {
+  this.children = [];
+  this.sourceContents = {};
+  this.line = aLine == null ? null : aLine;
+  this.column = aColumn == null ? null : aColumn;
+  this.source = aSource == null ? null : aSource;
+  this.name = aName == null ? null : aName;
+  this[isSourceNode] = true;
+  if (aChunks != null) this.add(aChunks);
+}
+
+/**
+ * Creates a SourceNode from generated code and a SourceMapConsumer.
+ *
+ * @param aGeneratedCode The generated code
+ * @param aSourceMapConsumer The SourceMap for the generated code
+ * @param aRelativePath Optional. The path that relative sources in the
+ *        SourceMapConsumer should be relative to.
+ */
+SourceNode.fromStringWithSourceMap =
+  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {
+    // The SourceNode we want to fill with the generated code
+    // and the SourceMap
+    var node = new SourceNode();
+
+    // All even indices of this array are one line of the generated code,
+    // while all odd indices are the newlines between two adjacent lines
+    // (since `REGEX_NEWLINE` captures its match).
+    // Processed fragments are accessed by calling `shiftNextLine`.
+    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);
+    var remainingLinesIndex = 0;
+    var shiftNextLine = function() {
+      var lineContents = getNextLine();
+      // The last line of a file might not have a newline.
+      var newLine = getNextLine() || "";
+      return lineContents + newLine;
+
+      function getNextLine() {
+        return remainingLinesIndex < remainingLines.length ?
+            remainingLines[remainingLinesIndex++] : undefined;
+      }
+    };
+
+    // We need to remember the position of "remainingLines"
+    var lastGeneratedLine = 1, lastGeneratedColumn = 0;
+
+    // The generate SourceNodes we need a code range.
+    // To extract it current and last mapping is used.
+    // Here we store the last mapping.
+    var lastMapping = null;
+
+    aSourceMapConsumer.eachMapping(function (mapping) {
+      if (lastMapping !== null) {
+        // We add the code from "lastMapping" to "mapping":
+        // First check if there is a new line in between.
+        if (lastGeneratedLine < mapping.generatedLine) {
+          // Associate first line with "lastMapping"
+          addMappingWithCode(lastMapping, shiftNextLine());
+          lastGeneratedLine++;
+          lastGeneratedColumn = 0;
+          // The remaining code is added without mapping
+        } else {
+          // There is no new line in between.
+          // Associate the code between "lastGeneratedColumn" and
+          // "mapping.generatedColumn" with "lastMapping"
+          var nextLine = remainingLines[remainingLinesIndex] || '';
+          var code = nextLine.substr(0, mapping.generatedColumn -
+                                        lastGeneratedColumn);
+          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -
+                                              lastGeneratedColumn);
+          lastGeneratedColumn = mapping.generatedColumn;
+          addMappingWithCode(lastMapping, code);
+          // No more remaining code, continue
+          lastMapping = mapping;
+          return;
+        }
+      }
+      // We add the generated code until the first mapping
+      // to the SourceNode without any mapping.
+      // Each line is added as separate string.
+      while (lastGeneratedLine < mapping.generatedLine) {
+        node.add(shiftNextLine());
+        lastGeneratedLine++;
+      }
+      if (lastGeneratedColumn < mapping.generatedColumn) {
+        var nextLine = remainingLines[remainingLinesIndex] || '';
+        node.add(nextLine.substr(0, mapping.generatedColumn));
+        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);
+        lastGeneratedColumn = mapping.generatedColumn;
+      }
+      lastMapping = mapping;
+    }, this);
+    // We have processed all mappings.
+    if (remainingLinesIndex < remainingLines.length) {
+      if (lastMapping) {
+        // Associate the remaining code in the current line with "lastMapping"
+        addMappingWithCode(lastMapping, shiftNextLine());
+      }
+      // and add the remaining lines without any mapping
+      node.add(remainingLines.splice(remainingLinesIndex).join(""));
+    }
+
+    // Copy sourcesContent into SourceNode
+    aSourceMapConsumer.sources.forEach(function (sourceFile) {
+      var content = aSourceMapConsumer.sourceContentFor(sourceFile);
+      if (content != null) {
+        if (aRelativePath != null) {
+          sourceFile = util.join(aRelativePath, sourceFile);
+        }
+        node.setSourceContent(sourceFile, content);
+      }
+    });
+
+    return node;
+
+    function addMappingWithCode(mapping, code) {
+      if (mapping === null || mapping.source === undefined) {
+        node.add(code);
+      } else {
+        var source = aRelativePath
+          ? util.join(aRelativePath, mapping.source)
+          : mapping.source;
+        node.add(new SourceNode(mapping.originalLine,
+                                mapping.originalColumn,
+                                source,
+                                code,
+                                mapping.name));
+      }
+    }
+  };
+
+/**
+ * Add a chunk of generated JS to this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.add = function SourceNode_add(aChunk) {
+  if (Array.isArray(aChunk)) {
+    aChunk.forEach(function (chunk) {
+      this.add(chunk);
+    }, this);
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    if (aChunk) {
+      this.children.push(aChunk);
+    }
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Add a chunk of generated JS to the beginning of this source node.
+ *
+ * @param aChunk A string snippet of generated JS code, another instance of
+ *        SourceNode, or an array where each member is one of those things.
+ */
+SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {
+  if (Array.isArray(aChunk)) {
+    for (var i = aChunk.length-1; i >= 0; i--) {
+      this.prepend(aChunk[i]);
+    }
+  }
+  else if (aChunk[isSourceNode] || typeof aChunk === "string") {
+    this.children.unshift(aChunk);
+  }
+  else {
+    throw new TypeError(
+      "Expected a SourceNode, string, or an array of SourceNodes and strings. Got " + aChunk
+    );
+  }
+  return this;
+};
+
+/**
+ * Walk over the tree of JS snippets in this node and its children. The
+ * walking function is called once for each snippet of JS and is passed that
+ * snippet and the its original associated source's line/column location.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walk = function SourceNode_walk(aFn) {
+  var chunk;
+  for (var i = 0, len = this.children.length; i < len; i++) {
+    chunk = this.children[i];
+    if (chunk[isSourceNode]) {
+      chunk.walk(aFn);
+    }
+    else {
+      if (chunk !== '') {
+        aFn(chunk, { source: this.source,
+                     line: this.line,
+                     column: this.column,
+                     name: this.name });
+      }
+    }
+  }
+};
+
+/**
+ * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between
+ * each of `this.children`.
+ *
+ * @param aSep The separator.
+ */
+SourceNode.prototype.join = function SourceNode_join(aSep) {
+  var newChildren;
+  var i;
+  var len = this.children.length;
+  if (len > 0) {
+    newChildren = [];
+    for (i = 0; i < len-1; i++) {
+      newChildren.push(this.children[i]);
+      newChildren.push(aSep);
+    }
+    newChildren.push(this.children[i]);
+    this.children = newChildren;
+  }
+  return this;
+};
+
+/**
+ * Call String.prototype.replace on the very right-most source snippet. Useful
+ * for trimming whitespace from the end of a source node, etc.
+ *
+ * @param aPattern The pattern to replace.
+ * @param aReplacement The thing to replace the pattern with.
+ */
+SourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {
+  var lastChild = this.children[this.children.length - 1];
+  if (lastChild[isSourceNode]) {
+    lastChild.replaceRight(aPattern, aReplacement);
+  }
+  else if (typeof lastChild === 'string') {
+    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);
+  }
+  else {
+    this.children.push(''.replace(aPattern, aReplacement));
+  }
+  return this;
+};
+
+/**
+ * Set the source content for a source file. This will be added to the SourceMapGenerator
+ * in the sourcesContent field.
+ *
+ * @param aSourceFile The filename of the source file
+ * @param aSourceContent The content of the source file
+ */
+SourceNode.prototype.setSourceContent =
+  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {
+    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;
+  };
+
+/**
+ * Walk over the tree of SourceNodes. The walking function is called for each
+ * source file content and is passed the filename and source content.
+ *
+ * @param aFn The traversal function.
+ */
+SourceNode.prototype.walkSourceContents =
+  function SourceNode_walkSourceContents(aFn) {
+    for (var i = 0, len = this.children.length; i < len; i++) {
+      if (this.children[i][isSourceNode]) {
+        this.children[i].walkSourceContents(aFn);
+      }
+    }
+
+    var sources = Object.keys(this.sourceContents);
+    for (var i = 0, len = sources.length; i < len; i++) {
+      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);
+    }
+  };
+
+/**
+ * Return the string representation of this source node. Walks over the tree
+ * and concatenates all the various snippets together to one string.
+ */
+SourceNode.prototype.toString = function SourceNode_toString() {
+  var str = "";
+  this.walk(function (chunk) {
+    str += chunk;
+  });
+  return str;
+};
+
+/**
+ * Returns the string representation of this source node along with a source
+ * map.
+ */
+SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {
+  var generated = {
+    code: "",
+    line: 1,
+    column: 0
+  };
+  var map = new SourceMapGenerator(aArgs);
+  var sourceMappingActive = false;
+  var lastOriginalSource = null;
+  var lastOriginalLine = null;
+  var lastOriginalColumn = null;
+  var lastOriginalName = null;
+  this.walk(function (chunk, original) {
+    generated.code += chunk;
+    if (original.source !== null
+        && original.line !== null
+        && original.column !== null) {
+      if(lastOriginalSource !== original.source
+         || lastOriginalLine !== original.line
+         || lastOriginalColumn !== original.column
+         || lastOriginalName !== original.name) {
+        map.addMapping({
+          source: original.source,
+          original: {
+            line: original.line,
+            column: original.column
+          },
+          generated: {
+            line: generated.line,
+            column: generated.column
+          },
+          name: original.name
+        });
+      }
+      lastOriginalSource = original.source;
+      lastOriginalLine = original.line;
+      lastOriginalColumn = original.column;
+      lastOriginalName = original.name;
+      sourceMappingActive = true;
+    } else if (sourceMappingActive) {
+      map.addMapping({
+        generated: {
+          line: generated.line,
+          column: generated.column
+        }
+      });
+      lastOriginalSource = null;
+      sourceMappingActive = false;
+    }
+    for (var idx = 0, length = chunk.length; idx < length; idx++) {
+      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {
+        generated.line++;
+        generated.column = 0;
+        // Mappings end at eol
+        if (idx + 1 === length) {
+          lastOriginalSource = null;
+          sourceMappingActive = false;
+        } else if (sourceMappingActive) {
+          map.addMapping({
+            source: original.source,
+            original: {
+              line: original.line,
+              column: original.column
+            },
+            generated: {
+              line: generated.line,
+              column: generated.column
+            },
+            name: original.name
+          });
+        }
+      } else {
+        generated.column++;
+      }
+    }
+  });
+  this.walkSourceContents(function (sourceFile, sourceContent) {
+    map.setSourceContent(sourceFile, sourceContent);
+  });
+
+  return { code: generated.code, map: map };
+};
+
+exports.SourceNode = SourceNode;

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/lib/util.js

@@ -0,0 +1,488 @@
+/* -*- Mode: js; js-indent-level: 2; -*- */
+/*
+ * Copyright 2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+
+/**
+ * This is a helper function for getting values from parameter/options
+ * objects.
+ *
+ * @param args The object we are extracting values from
+ * @param name The name of the property we are getting.
+ * @param defaultValue An optional value to return if the property is missing
+ * from the object. If this is not specified and the property is missing, an
+ * error will be thrown.
+ */
+function getArg(aArgs, aName, aDefaultValue) {
+  if (aName in aArgs) {
+    return aArgs[aName];
+  } else if (arguments.length === 3) {
+    return aDefaultValue;
+  } else {
+    throw new Error('"' + aName + '" is a required argument.');
+  }
+}
+exports.getArg = getArg;
+
+var urlRegexp = /^(?:([\w+\-.]+):)?\/\/(?:(\w+:\w+)@)?([\w.-]*)(?::(\d+))?(.*)$/;
+var dataUrlRegexp = /^data:.+\,.+$/;
+
+function urlParse(aUrl) {
+  var match = aUrl.match(urlRegexp);
+  if (!match) {
+    return null;
+  }
+  return {
+    scheme: match[1],
+    auth: match[2],
+    host: match[3],
+    port: match[4],
+    path: match[5]
+  };
+}
+exports.urlParse = urlParse;
+
+function urlGenerate(aParsedUrl) {
+  var url = '';
+  if (aParsedUrl.scheme) {
+    url += aParsedUrl.scheme + ':';
+  }
+  url += '//';
+  if (aParsedUrl.auth) {
+    url += aParsedUrl.auth + '@';
+  }
+  if (aParsedUrl.host) {
+    url += aParsedUrl.host;
+  }
+  if (aParsedUrl.port) {
+    url += ":" + aParsedUrl.port
+  }
+  if (aParsedUrl.path) {
+    url += aParsedUrl.path;
+  }
+  return url;
+}
+exports.urlGenerate = urlGenerate;
+
+/**
+ * Normalizes a path, or the path portion of a URL:
+ *
+ * - Replaces consecutive slashes with one slash.
+ * - Removes unnecessary '.' parts.
+ * - Removes unnecessary '<dir>/..' parts.
+ *
+ * Based on code in the Node.js 'path' core module.
+ *
+ * @param aPath The path or url to normalize.
+ */
+function normalize(aPath) {
+  var path = aPath;
+  var url = urlParse(aPath);
+  if (url) {
+    if (!url.path) {
+      return aPath;
+    }
+    path = url.path;
+  }
+  var isAbsolute = exports.isAbsolute(path);
+
+  var parts = path.split(/\/+/);
+  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {
+    part = parts[i];
+    if (part === '.') {
+      parts.splice(i, 1);
+    } else if (part === '..') {
+      up++;
+    } else if (up > 0) {
+      if (part === '') {
+        // The first part is blank if the path is absolute. Trying to go
+        // above the root is a no-op. Therefore we can remove all '..' parts
+        // directly after the root.
+        parts.splice(i + 1, up);
+        up = 0;
+      } else {
+        parts.splice(i, 2);
+        up--;
+      }
+    }
+  }
+  path = parts.join('/');
+
+  if (path === '') {
+    path = isAbsolute ? '/' : '.';
+  }
+
+  if (url) {
+    url.path = path;
+    return urlGenerate(url);
+  }
+  return path;
+}
+exports.normalize = normalize;
+
+/**
+ * Joins two paths/URLs.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be joined with the root.
+ *
+ * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a
+ *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended
+ *   first.
+ * - Otherwise aPath is a path. If aRoot is a URL, then its path portion
+ *   is updated with the result and aRoot is returned. Otherwise the result
+ *   is returned.
+ *   - If aPath is absolute, the result is aPath.
+ *   - Otherwise the two paths are joined with a slash.
+ * - Joining for example 'http://' and 'www.example.com' is also supported.
+ */
+function join(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+  if (aPath === "") {
+    aPath = ".";
+  }
+  var aPathUrl = urlParse(aPath);
+  var aRootUrl = urlParse(aRoot);
+  if (aRootUrl) {
+    aRoot = aRootUrl.path || '/';
+  }
+
+  // `join(foo, '//www.example.org')`
+  if (aPathUrl && !aPathUrl.scheme) {
+    if (aRootUrl) {
+      aPathUrl.scheme = aRootUrl.scheme;
+    }
+    return urlGenerate(aPathUrl);
+  }
+
+  if (aPathUrl || aPath.match(dataUrlRegexp)) {
+    return aPath;
+  }
+
+  // `join('http://', 'www.example.com')`
+  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {
+    aRootUrl.host = aPath;
+    return urlGenerate(aRootUrl);
+  }
+
+  var joined = aPath.charAt(0) === '/'
+    ? aPath
+    : normalize(aRoot.replace(/\/+$/, '') + '/' + aPath);
+
+  if (aRootUrl) {
+    aRootUrl.path = joined;
+    return urlGenerate(aRootUrl);
+  }
+  return joined;
+}
+exports.join = join;
+
+exports.isAbsolute = function (aPath) {
+  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);
+};
+
+/**
+ * Make a path relative to a URL or another path.
+ *
+ * @param aRoot The root path or URL.
+ * @param aPath The path or URL to be made relative to aRoot.
+ */
+function relative(aRoot, aPath) {
+  if (aRoot === "") {
+    aRoot = ".";
+  }
+
+  aRoot = aRoot.replace(/\/$/, '');
+
+  // It is possible for the path to be above the root. In this case, simply
+  // checking whether the root is a prefix of the path won't work. Instead, we
+  // need to remove components from the root one by one, until either we find
+  // a prefix that fits, or we run out of components to remove.
+  var level = 0;
+  while (aPath.indexOf(aRoot + '/') !== 0) {
+    var index = aRoot.lastIndexOf("/");
+    if (index < 0) {
+      return aPath;
+    }
+
+    // If the only part of the root that is left is the scheme (i.e. http://,
+    // file:///, etc.), one or more slashes (/), or simply nothing at all, we
+    // have exhausted all components, so the path is not relative to the root.
+    aRoot = aRoot.slice(0, index);
+    if (aRoot.match(/^([^\/]+:\/)?\/*$/)) {
+      return aPath;
+    }
+
+    ++level;
+  }
+
+  // Make sure we add a "../" for each component we removed from the root.
+  return Array(level + 1).join("../") + aPath.substr(aRoot.length + 1);
+}
+exports.relative = relative;
+
+var supportsNullProto = (function () {
+  var obj = Object.create(null);
+  return !('__proto__' in obj);
+}());
+
+function identity (s) {
+  return s;
+}
+
+/**
+ * Because behavior goes wacky when you set `__proto__` on objects, we
+ * have to prefix all the strings in our set with an arbitrary character.
+ *
+ * See https://github.com/mozilla/source-map/pull/31 and
+ * https://github.com/mozilla/source-map/issues/30
+ *
+ * @param String aStr
+ */
+function toSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return '$' + aStr;
+  }
+
+  return aStr;
+}
+exports.toSetString = supportsNullProto ? identity : toSetString;
+
+function fromSetString(aStr) {
+  if (isProtoString(aStr)) {
+    return aStr.slice(1);
+  }
+
+  return aStr;
+}
+exports.fromSetString = supportsNullProto ? identity : fromSetString;
+
+function isProtoString(s) {
+  if (!s) {
+    return false;
+  }
+
+  var length = s.length;
+
+  if (length < 9 /* "__proto__".length */) {
+    return false;
+  }
+
+  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 2) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 4) !== 116 /* 't' */ ||
+      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||
+      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||
+      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||
+      s.charCodeAt(length - 8) !== 95  /* '_' */ ||
+      s.charCodeAt(length - 9) !== 95  /* '_' */) {
+    return false;
+  }
+
+  for (var i = length - 10; i >= 0; i--) {
+    if (s.charCodeAt(i) !== 36 /* '$' */) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+/**
+ * Comparator between two mappings where the original positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same original source/line/column, but different generated
+ * line and column the same. Useful when searching for a mapping with a
+ * stubbed out mapping.
+ */
+function compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {
+  var cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0 || onlyCompareOriginal) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByOriginalPositions = compareByOriginalPositions;
+
+/**
+ * Comparator between two mappings with deflated source and name indices where
+ * the generated positions are compared.
+ *
+ * Optionally pass in `true` as `onlyCompareGenerated` to consider two
+ * mappings with the same generated line and column, but different
+ * source/name/original line and column the same. Useful when searching for a
+ * mapping with a stubbed out mapping.
+ */
+function compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0 || onlyCompareGenerated) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;
+
+function strcmp(aStr1, aStr2) {
+  if (aStr1 === aStr2) {
+    return 0;
+  }
+
+  if (aStr1 === null) {
+    return 1; // aStr2 !== null
+  }
+
+  if (aStr2 === null) {
+    return -1; // aStr1 !== null
+  }
+
+  if (aStr1 > aStr2) {
+    return 1;
+  }
+
+  return -1;
+}
+
+/**
+ * Comparator between two mappings with inflated source and name strings where
+ * the generated positions are compared.
+ */
+function compareByGeneratedPositionsInflated(mappingA, mappingB) {
+  var cmp = mappingA.generatedLine - mappingB.generatedLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.generatedColumn - mappingB.generatedColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = strcmp(mappingA.source, mappingB.source);
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalLine - mappingB.originalLine;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  cmp = mappingA.originalColumn - mappingB.originalColumn;
+  if (cmp !== 0) {
+    return cmp;
+  }
+
+  return strcmp(mappingA.name, mappingB.name);
+}
+exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;
+
+/**
+ * Strip any JSON XSSI avoidance prefix from the string (as documented
+ * in the source maps specification), and then parse the string as
+ * JSON.
+ */
+function parseSourceMapInput(str) {
+  return JSON.parse(str.replace(/^\)]}'[^\n]*\n/, ''));
+}
+exports.parseSourceMapInput = parseSourceMapInput;
+
+/**
+ * Compute the URL of a source given the the source root, the source's
+ * URL, and the source map's URL.
+ */
+function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {
+  sourceURL = sourceURL || '';
+
+  if (sourceRoot) {
+    // This follows what Chrome does.
+    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {
+      sourceRoot += '/';
+    }
+    // The spec says:
+    //   Line 4: An optional source root, useful for relocating source
+    //   files on a server or removing repeated values in the
+    //   “sources” entry.  This value is prepended to the individual
+    //   entries in the “source” field.
+    sourceURL = sourceRoot + sourceURL;
+  }
+
+  // Historically, SourceMapConsumer did not take the sourceMapURL as
+  // a parameter.  This mode is still somewhat supported, which is why
+  // this code block is conditional.  However, it's preferable to pass
+  // the source map URL to SourceMapConsumer, so that this function
+  // can implement the source URL resolution algorithm as outlined in
+  // the spec.  This block is basically the equivalent of:
+  //    new URL(sourceURL, sourceMapURL).toString()
+  // ... except it avoids using URL, which wasn't available in the
+  // older releases of node still supported by this library.
+  //
+  // The spec says:
+  //   If the sources are not absolute URLs after prepending of the
+  //   “sourceRoot”, the sources are resolved relative to the
+  //   SourceMap (like resolving script src in a html document).
+  if (sourceMapURL) {
+    var parsed = urlParse(sourceMapURL);
+    if (!parsed) {
+      throw new Error("sourceMapURL could not be parsed");
+    }
+    if (parsed.path) {
+      // Strip the last path component, but keep the "/".
+      var index = parsed.path.lastIndexOf('/');
+      if (index >= 0) {
+        parsed.path = parsed.path.substring(0, index + 1);
+      }
+    }
+    sourceURL = join(urlGenerate(parsed), sourceURL);
+  }
+
+  return normalize(sourceURL);
+}
+exports.computeSourceURL = computeSourceURL;

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/package.json

@@ -0,0 +1,73 @@
+{
+  "name": "source-map",
+  "description": "Generates and consumes source maps",
+  "version": "0.6.1",
+  "homepage": "https://github.com/mozilla/source-map",
+  "author": "Nick Fitzgerald <nfitzgerald@mozilla.com>",
+  "contributors": [
+    "Tobias Koppers <tobias.koppers@googlemail.com>",
+    "Duncan Beevers <duncan@dweebd.com>",
+    "Stephen Crane <scrane@mozilla.com>",
+    "Ryan Seddon <seddon.ryan@gmail.com>",
+    "Miles Elam <miles.elam@deem.com>",
+    "Mihai Bazon <mihai.bazon@gmail.com>",
+    "Michael Ficarra <github.public.email@michael.ficarra.me>",
+    "Todd Wolfson <todd@twolfson.com>",
+    "Alexander Solovyov <alexander@solovyov.net>",
+    "Felix Gnass <fgnass@gmail.com>",
+    "Conrad Irwin <conrad.irwin@gmail.com>",
+    "usrbincc <usrbincc@yahoo.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Chase Douglas <chase@newrelic.com>",
+    "Evan Wallace <evan.exe@gmail.com>",
+    "Heather Arthur <fayearthur@gmail.com>",
+    "Hugh Kennedy <hughskennedy@gmail.com>",
+    "David Glasser <glasser@davidglasser.net>",
+    "Simon Lydell <simon.lydell@gmail.com>",
+    "Jmeas Smith <jellyes2@gmail.com>",
+    "Michael Z Goddard <mzgoddard@gmail.com>",
+    "azu <azu@users.noreply.github.com>",
+    "John Gozde <john@gozde.ca>",
+    "Adam Kirkton <akirkton@truefitinnovation.com>",
+    "Chris Montgomery <christopher.montgomery@dowjones.com>",
+    "J. Ryan Stinnett <jryans@gmail.com>",
+    "Jack Herrington <jherrington@walmartlabs.com>",
+    "Chris Truter <jeffpalentine@gmail.com>",
+    "Daniel Espeset <daniel@danielespeset.com>",
+    "Jamie Wong <jamie.lf.wong@gmail.com>",
+    "Eddy Bruël <ejpbruel@mozilla.com>",
+    "Hawken Rives <hawkrives@gmail.com>",
+    "Gilad Peleg <giladp007@gmail.com>",
+    "djchie <djchie.dev@gmail.com>",
+    "Gary Ye <garysye@gmail.com>",
+    "Nicolas Lalevée <nicolas.lalevee@hibnet.org>"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/mozilla/source-map.git"
+  },
+  "main": "./source-map.js",
+  "files": [
+    "source-map.js",
+    "source-map.d.ts",
+    "lib/",
+    "dist/source-map.debug.js",
+    "dist/source-map.js",
+    "dist/source-map.min.js",
+    "dist/source-map.min.js.map"
+  ],
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "license": "BSD-3-Clause",
+  "scripts": {
+    "test": "npm run build && node test/run-tests.js",
+    "build": "webpack --color",
+    "toc": "doctoc --title '## Table of Contents' README.md && doctoc --title '## Table of Contents' CONTRIBUTING.md"
+  },
+  "devDependencies": {
+    "doctoc": "^0.15.0",
+    "webpack": "^1.12.0"
+  },
+  "typings": "source-map"
+}

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/source-map.d.ts

@@ -0,0 +1,98 @@
+export interface StartOfSourceMap {
+    file?: string;
+    sourceRoot?: string;
+}
+
+export interface RawSourceMap extends StartOfSourceMap {
+    version: string;
+    sources: string[];
+    names: string[];
+    sourcesContent?: string[];
+    mappings: string;
+}
+
+export interface Position {
+    line: number;
+    column: number;
+}
+
+export interface LineRange extends Position {
+    lastColumn: number;
+}
+
+export interface FindPosition extends Position {
+    // SourceMapConsumer.GREATEST_LOWER_BOUND or SourceMapConsumer.LEAST_UPPER_BOUND
+    bias?: number;
+}
+
+export interface SourceFindPosition extends FindPosition {
+    source: string;
+}
+
+export interface MappedPosition extends Position {
+    source: string;
+    name?: string;
+}
+
+export interface MappingItem {
+    source: string;
+    generatedLine: number;
+    generatedColumn: number;
+    originalLine: number;
+    originalColumn: number;
+    name: string;
+}
+
+export class SourceMapConsumer {
+    static GENERATED_ORDER: number;
+    static ORIGINAL_ORDER: number;
+
+    static GREATEST_LOWER_BOUND: number;
+    static LEAST_UPPER_BOUND: number;
+
+    constructor(rawSourceMap: RawSourceMap);
+    computeColumnSpans(): void;
+    originalPositionFor(generatedPosition: FindPosition): MappedPosition;
+    generatedPositionFor(originalPosition: SourceFindPosition): LineRange;
+    allGeneratedPositionsFor(originalPosition: MappedPosition): Position[];
+    hasContentsOfAllSources(): boolean;
+    sourceContentFor(source: string, returnNullOnMissing?: boolean): string;
+    eachMapping(callback: (mapping: MappingItem) => void, context?: any, order?: number): void;
+}
+
+export interface Mapping {
+    generated: Position;
+    original: Position;
+    source: string;
+    name?: string;
+}
+
+export class SourceMapGenerator {
+    constructor(startOfSourceMap?: StartOfSourceMap);
+    static fromSourceMap(sourceMapConsumer: SourceMapConsumer): SourceMapGenerator;
+    addMapping(mapping: Mapping): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    applySourceMap(sourceMapConsumer: SourceMapConsumer, sourceFile?: string, sourceMapPath?: string): void;
+    toString(): string;
+}
+
+export interface CodeWithSourceMap {
+    code: string;
+    map: SourceMapGenerator;
+}
+
+export class SourceNode {
+    constructor();
+    constructor(line: number, column: number, source: string);
+    constructor(line: number, column: number, source: string, chunk?: string, name?: string);
+    static fromStringWithSourceMap(code: string, sourceMapConsumer: SourceMapConsumer, relativePath?: string): SourceNode;
+    add(chunk: string): void;
+    prepend(chunk: string): void;
+    setSourceContent(sourceFile: string, sourceContent: string): void;
+    walk(fn: (chunk: string, mapping: MappedPosition) => void): void;
+    walkSourceContents(fn: (file: string, content: string) => void): void;
+    join(sep: string): SourceNode;
+    replaceRight(pattern: string, replacement: string): SourceNode;
+    toString(): string;
+    toStringWithSourceMap(startOfSourceMap?: StartOfSourceMap): CodeWithSourceMap;
+}

node_modules/metro/node_modules/@jest/source-map/node_modules/source-map/source-map.js

@@ -0,0 +1,8 @@
+/*
+ * Copyright 2009-2011 Mozilla Foundation and contributors
+ * Licensed under the New BSD license. See LICENSE.txt or:
+ * http://opensource.org/licenses/BSD-3-Clause
+ */
+exports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;
+exports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;
+exports.SourceNode = require('./lib/source-node').SourceNode;

node_modules/metro/node_modules/@jest/source-map/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@jest/source-map",
+  "version": "24.9.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-source-map"
+  },
+  "license": "MIT",
+  "main": "build/index.js",
+  "types": "build/index.d.ts",
+  "dependencies": {
+    "callsites": "^3.0.0",
+    "graceful-fs": "^4.1.15",
+    "source-map": "^0.6.0"
+  },
+  "devDependencies": {
+    "@types/graceful-fs": "^4.1.2"
+  },
+  "engines": {
+    "node": ">= 6"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1"
+}

node_modules/metro/node_modules/@jest/test-result/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/metro/node_modules/@jest/test-result/build/formatTestResults.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { AggregatedResult, CodeCoverageFormatter, CodeCoverageReporter, FormattedTestResults } from './types';
+export default function formatTestResults(results: AggregatedResult, codeCoverageFormatter?: CodeCoverageFormatter, reporter?: CodeCoverageReporter): FormattedTestResults;
+//# sourceMappingURL=formatTestResults.d.ts.map

node_modules/metro/node_modules/@jest/test-result/build/formatTestResults.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatTestResults.d.ts","sourceRoot":"","sources":["../src/formatTestResults.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,gBAAgB,EAEhB,qBAAqB,EACrB,oBAAoB,EAGpB,oBAAoB,EAErB,MAAM,SAAS,CAAC;AAwDjB,MAAM,CAAC,OAAO,UAAU,iBAAiB,CACvC,OAAO,EAAE,gBAAgB,EACzB,qBAAqB,CAAC,EAAE,qBAAqB,EAC7C,QAAQ,CAAC,EAAE,oBAAoB,GAC9B,oBAAoB,CAMtB"}

node_modules/metro/node_modules/@jest/test-result/build/formatTestResults.js

@@ -0,0 +1,104 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.default = formatTestResults;
+
+function _objectSpread(target) {
+  for (var i = 1; i < arguments.length; i++) {
+    var source = arguments[i] != null ? arguments[i] : {};
+    var ownKeys = Object.keys(source);
+    if (typeof Object.getOwnPropertySymbols === 'function') {
+      ownKeys = ownKeys.concat(
+        Object.getOwnPropertySymbols(source).filter(function(sym) {
+          return Object.getOwnPropertyDescriptor(source, sym).enumerable;
+        })
+      );
+    }
+    ownKeys.forEach(function(key) {
+      _defineProperty(target, key, source[key]);
+    });
+  }
+  return target;
+}
+
+function _defineProperty(obj, key, value) {
+  if (key in obj) {
+    Object.defineProperty(obj, key, {
+      value: value,
+      enumerable: true,
+      configurable: true,
+      writable: true
+    });
+  } else {
+    obj[key] = value;
+  }
+  return obj;
+}
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const formatTestResult = (testResult, codeCoverageFormatter, reporter) => {
+  const assertionResults = testResult.testResults.map(formatTestAssertion);
+
+  if (testResult.testExecError) {
+    const now = Date.now();
+    return {
+      assertionResults,
+      coverage: {},
+      endTime: now,
+      message: testResult.failureMessage
+        ? testResult.failureMessage
+        : testResult.testExecError.message,
+      name: testResult.testFilePath,
+      startTime: now,
+      status: 'failed',
+      summary: ''
+    };
+  } else {
+    const allTestsPassed = testResult.numFailingTests === 0;
+    return {
+      assertionResults,
+      coverage: codeCoverageFormatter
+        ? codeCoverageFormatter(testResult.coverage, reporter)
+        : testResult.coverage,
+      endTime: testResult.perfStats.end,
+      message: testResult.failureMessage || '',
+      name: testResult.testFilePath,
+      startTime: testResult.perfStats.start,
+      status: allTestsPassed ? 'passed' : 'failed',
+      summary: ''
+    };
+  }
+};
+
+function formatTestAssertion(assertion) {
+  const result = {
+    ancestorTitles: assertion.ancestorTitles,
+    failureMessages: null,
+    fullName: assertion.fullName,
+    location: assertion.location,
+    status: assertion.status,
+    title: assertion.title
+  };
+
+  if (assertion.failureMessages) {
+    result.failureMessages = assertion.failureMessages;
+  }
+
+  return result;
+}
+
+function formatTestResults(results, codeCoverageFormatter, reporter) {
+  const testResults = results.testResults.map(testResult =>
+    formatTestResult(testResult, codeCoverageFormatter, reporter)
+  );
+  return _objectSpread({}, results, {
+    testResults
+  });
+}

node_modules/metro/node_modules/@jest/test-result/build/helpers.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { AggregatedResult, SerializableError, TestResult } from './types';
+export declare const makeEmptyAggregatedTestResult: () => AggregatedResult;
+export declare const buildFailureTestResult: (testPath: string, err: SerializableError) => TestResult;
+export declare const addResult: (aggregatedResults: AggregatedResult, testResult: TestResult) => void;
+//# sourceMappingURL=helpers.d.ts.map

node_modules/metro/node_modules/@jest/test-result/build/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../src/helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAC,gBAAgB,EAAE,iBAAiB,EAAE,UAAU,EAAC,MAAM,SAAS,CAAC;AAExE,eAAO,MAAM,6BAA6B,wBAiCxC,CAAC;AAEH,eAAO,MAAM,sBAAsB,0DA+BjC,CAAC;AAGH,eAAO,MAAM,SAAS,uEAmErB,CAAC"}

node_modules/metro/node_modules/@jest/test-result/build/helpers.js

@@ -0,0 +1,153 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.addResult = exports.buildFailureTestResult = exports.makeEmptyAggregatedTestResult = void 0;
+
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+const makeEmptyAggregatedTestResult = () => ({
+  numFailedTestSuites: 0,
+  numFailedTests: 0,
+  numPassedTestSuites: 0,
+  numPassedTests: 0,
+  numPendingTestSuites: 0,
+  numPendingTests: 0,
+  numRuntimeErrorTestSuites: 0,
+  numTodoTests: 0,
+  numTotalTestSuites: 0,
+  numTotalTests: 0,
+  openHandles: [],
+  snapshot: {
+    added: 0,
+    didUpdate: false,
+    // is set only after the full run
+    failure: false,
+    filesAdded: 0,
+    // combines individual test results + removed files after the full run
+    filesRemoved: 0,
+    filesRemovedList: [],
+    filesUnmatched: 0,
+    filesUpdated: 0,
+    matched: 0,
+    total: 0,
+    unchecked: 0,
+    uncheckedKeysByFile: [],
+    unmatched: 0,
+    updated: 0
+  },
+  startTime: 0,
+  success: true,
+  testResults: [],
+  wasInterrupted: false
+});
+
+exports.makeEmptyAggregatedTestResult = makeEmptyAggregatedTestResult;
+
+const buildFailureTestResult = (testPath, err) => ({
+  console: undefined,
+  displayName: '',
+  failureMessage: null,
+  leaks: false,
+  numFailingTests: 0,
+  numPassingTests: 0,
+  numPendingTests: 0,
+  numTodoTests: 0,
+  openHandles: [],
+  perfStats: {
+    end: 0,
+    start: 0
+  },
+  skipped: false,
+  snapshot: {
+    added: 0,
+    fileDeleted: false,
+    matched: 0,
+    unchecked: 0,
+    uncheckedKeys: [],
+    unmatched: 0,
+    updated: 0
+  },
+  sourceMaps: {},
+  testExecError: err,
+  testFilePath: testPath,
+  testResults: []
+}); // Add individual test result to an aggregated test result
+
+exports.buildFailureTestResult = buildFailureTestResult;
+
+const addResult = (aggregatedResults, testResult) => {
+  // `todos` are new as of Jest 24, and not all runners return it.
+  // Set it to `0` to avoid `NaN`
+  if (!testResult.numTodoTests) {
+    testResult.numTodoTests = 0;
+  }
+
+  aggregatedResults.testResults.push(testResult);
+  aggregatedResults.numTotalTests +=
+    testResult.numPassingTests +
+    testResult.numFailingTests +
+    testResult.numPendingTests +
+    testResult.numTodoTests;
+  aggregatedResults.numFailedTests += testResult.numFailingTests;
+  aggregatedResults.numPassedTests += testResult.numPassingTests;
+  aggregatedResults.numPendingTests += testResult.numPendingTests;
+  aggregatedResults.numTodoTests += testResult.numTodoTests;
+
+  if (testResult.testExecError) {
+    aggregatedResults.numRuntimeErrorTestSuites++;
+  }
+
+  if (testResult.skipped) {
+    aggregatedResults.numPendingTestSuites++;
+  } else if (testResult.numFailingTests > 0 || testResult.testExecError) {
+    aggregatedResults.numFailedTestSuites++;
+  } else {
+    aggregatedResults.numPassedTestSuites++;
+  } // Snapshot data
+
+  if (testResult.snapshot.added) {
+    aggregatedResults.snapshot.filesAdded++;
+  }
+
+  if (testResult.snapshot.fileDeleted) {
+    aggregatedResults.snapshot.filesRemoved++;
+  }
+
+  if (testResult.snapshot.unmatched) {
+    aggregatedResults.snapshot.filesUnmatched++;
+  }
+
+  if (testResult.snapshot.updated) {
+    aggregatedResults.snapshot.filesUpdated++;
+  }
+
+  aggregatedResults.snapshot.added += testResult.snapshot.added;
+  aggregatedResults.snapshot.matched += testResult.snapshot.matched;
+  aggregatedResults.snapshot.unchecked += testResult.snapshot.unchecked;
+
+  if (
+    testResult.snapshot.uncheckedKeys &&
+    testResult.snapshot.uncheckedKeys.length > 0
+  ) {
+    aggregatedResults.snapshot.uncheckedKeysByFile.push({
+      filePath: testResult.testFilePath,
+      keys: testResult.snapshot.uncheckedKeys
+    });
+  }
+
+  aggregatedResults.snapshot.unmatched += testResult.snapshot.unmatched;
+  aggregatedResults.snapshot.updated += testResult.snapshot.updated;
+  aggregatedResults.snapshot.total +=
+    testResult.snapshot.added +
+    testResult.snapshot.matched +
+    testResult.snapshot.unmatched +
+    testResult.snapshot.updated;
+};
+
+exports.addResult = addResult;

node_modules/metro/node_modules/@jest/test-result/build/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+export { default as formatTestResults } from './formatTestResults';
+export { addResult, buildFailureTestResult, makeEmptyAggregatedTestResult, } from './helpers';
+export { AggregatedResult, AssertionLocation, AssertionResult, FailedAssertion, Milliseconds, SerializableError, SnapshotSummary, Status, Suite, TestResult, } from './types';
+//# sourceMappingURL=index.d.ts.map

node_modules/metro/node_modules/@jest/test-result/build/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAC,OAAO,IAAI,iBAAiB,EAAC,MAAM,qBAAqB,CAAC;AACjE,OAAO,EACL,SAAS,EACT,sBAAsB,EACtB,6BAA6B,GAC9B,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,YAAY,EACZ,iBAAiB,EACjB,eAAe,EACf,MAAM,EACN,KAAK,EACL,UAAU,GACX,MAAM,SAAS,CAAC"}

node_modules/metro/node_modules/@jest/test-result/build/index.js

@@ -0,0 +1,99 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+Object.defineProperty(exports, 'formatTestResults', {
+  enumerable: true,
+  get: function get() {
+    return _formatTestResults.default;
+  }
+});
+Object.defineProperty(exports, 'addResult', {
+  enumerable: true,
+  get: function get() {
+    return _helpers.addResult;
+  }
+});
+Object.defineProperty(exports, 'buildFailureTestResult', {
+  enumerable: true,
+  get: function get() {
+    return _helpers.buildFailureTestResult;
+  }
+});
+Object.defineProperty(exports, 'makeEmptyAggregatedTestResult', {
+  enumerable: true,
+  get: function get() {
+    return _helpers.makeEmptyAggregatedTestResult;
+  }
+});
+Object.defineProperty(exports, 'AggregatedResult', {
+  enumerable: true,
+  get: function get() {
+    return _types.AggregatedResult;
+  }
+});
+Object.defineProperty(exports, 'AssertionLocation', {
+  enumerable: true,
+  get: function get() {
+    return _types.AssertionLocation;
+  }
+});
+Object.defineProperty(exports, 'AssertionResult', {
+  enumerable: true,
+  get: function get() {
+    return _types.AssertionResult;
+  }
+});
+Object.defineProperty(exports, 'FailedAssertion', {
+  enumerable: true,
+  get: function get() {
+    return _types.FailedAssertion;
+  }
+});
+Object.defineProperty(exports, 'Milliseconds', {
+  enumerable: true,
+  get: function get() {
+    return _types.Milliseconds;
+  }
+});
+Object.defineProperty(exports, 'SerializableError', {
+  enumerable: true,
+  get: function get() {
+    return _types.SerializableError;
+  }
+});
+Object.defineProperty(exports, 'SnapshotSummary', {
+  enumerable: true,
+  get: function get() {
+    return _types.SnapshotSummary;
+  }
+});
+Object.defineProperty(exports, 'Status', {
+  enumerable: true,
+  get: function get() {
+    return _types.Status;
+  }
+});
+Object.defineProperty(exports, 'Suite', {
+  enumerable: true,
+  get: function get() {
+    return _types.Suite;
+  }
+});
+Object.defineProperty(exports, 'TestResult', {
+  enumerable: true,
+  get: function get() {
+    return _types.TestResult;
+  }
+});
+
+var _formatTestResults = _interopRequireDefault(require('./formatTestResults'));
+
+var _helpers = require('./helpers');
+
+var _types = require('./types');
+
+function _interopRequireDefault(obj) {
+  return obj && obj.__esModule ? obj : {default: obj};
+}

node_modules/metro/node_modules/@jest/test-result/build/types.d.ts

@@ -0,0 +1,166 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import { CoverageMap, CoverageMapData } from 'istanbul-lib-coverage';
+import { ConsoleBuffer } from '@jest/console';
+import { Config } from '@jest/types';
+export declare type SerializableError = {
+    code?: unknown;
+    message: string;
+    stack: string | null | undefined;
+    type?: string;
+};
+export declare type FailedAssertion = {
+    matcherName?: string;
+    message?: string;
+    actual?: any;
+    pass?: boolean;
+    passed?: boolean;
+    expected?: any;
+    isNot?: boolean;
+    stack?: string;
+    error?: any;
+};
+export declare type AssertionLocation = {
+    fullName: string;
+    path: string;
+};
+export declare type Status = 'passed' | 'failed' | 'skipped' | 'pending' | 'todo' | 'disabled';
+export declare type Bytes = number;
+export declare type Milliseconds = number;
+declare type Callsite = {
+    column: number;
+    line: number;
+};
+export declare type AssertionResult = {
+    ancestorTitles: Array<string>;
+    duration?: Milliseconds | null | undefined;
+    failureMessages: Array<string>;
+    fullName: string;
+    invocations?: number;
+    location: Callsite | null | undefined;
+    numPassingAsserts: number;
+    status: Status;
+    title: string;
+};
+export declare type FormattedAssertionResult = {
+    ancestorTitles: Array<string>;
+    failureMessages: Array<string> | null;
+    fullName: string;
+    location: Callsite | null | undefined;
+    status: Status;
+    title: string;
+};
+export declare type AggregatedResultWithoutCoverage = {
+    numFailedTests: number;
+    numFailedTestSuites: number;
+    numPassedTests: number;
+    numPassedTestSuites: number;
+    numPendingTests: number;
+    numTodoTests: number;
+    numPendingTestSuites: number;
+    numRuntimeErrorTestSuites: number;
+    numTotalTests: number;
+    numTotalTestSuites: number;
+    openHandles: Array<Error>;
+    snapshot: SnapshotSummary;
+    startTime: number;
+    success: boolean;
+    testResults: Array<TestResult>;
+    wasInterrupted: boolean;
+};
+export declare type AggregatedResult = AggregatedResultWithoutCoverage & {
+    coverageMap?: CoverageMap | null;
+};
+export declare type Suite = {
+    title: string;
+    suites: Array<Suite>;
+    tests: Array<AssertionResult>;
+};
+export declare type TestResult = {
+    console?: ConsoleBuffer;
+    coverage?: CoverageMapData;
+    displayName?: Config.DisplayName;
+    failureMessage?: string | null;
+    leaks: boolean;
+    memoryUsage?: Bytes;
+    numFailingTests: number;
+    numPassingTests: number;
+    numPendingTests: number;
+    numTodoTests: number;
+    openHandles: Array<Error>;
+    perfStats: {
+        end: Milliseconds;
+        start: Milliseconds;
+    };
+    skipped: boolean;
+    snapshot: {
+        added: number;
+        fileDeleted: boolean;
+        matched: number;
+        unchecked: number;
+        uncheckedKeys: Array<string>;
+        unmatched: number;
+        updated: number;
+    };
+    sourceMaps?: {
+        [sourcePath: string]: string;
+    };
+    testExecError?: SerializableError;
+    testFilePath: string;
+    testResults: Array<AssertionResult>;
+};
+export declare type FormattedTestResult = {
+    message: string;
+    name: string;
+    summary: string;
+    status: 'failed' | 'passed';
+    startTime: number;
+    endTime: number;
+    coverage: any;
+    assertionResults: Array<FormattedAssertionResult>;
+};
+export declare type FormattedTestResults = {
+    coverageMap?: CoverageMap | null | undefined;
+    numFailedTests: number;
+    numFailedTestSuites: number;
+    numPassedTests: number;
+    numPassedTestSuites: number;
+    numPendingTests: number;
+    numPendingTestSuites: number;
+    numRuntimeErrorTestSuites: number;
+    numTotalTests: number;
+    numTotalTestSuites: number;
+    snapshot: SnapshotSummary;
+    startTime: number;
+    success: boolean;
+    testResults: Array<FormattedTestResult>;
+    wasInterrupted: boolean;
+};
+export declare type CodeCoverageReporter = any;
+export declare type CodeCoverageFormatter = (coverage: CoverageMapData | null | undefined, reporter: CodeCoverageReporter) => Record<string, any> | null | undefined;
+export declare type UncheckedSnapshot = {
+    filePath: string;
+    keys: Array<string>;
+};
+export declare type SnapshotSummary = {
+    added: number;
+    didUpdate: boolean;
+    failure: boolean;
+    filesAdded: number;
+    filesRemoved: number;
+    filesRemovedList: Array<string>;
+    filesUnmatched: number;
+    filesUpdated: number;
+    matched: number;
+    total: number;
+    unchecked: number;
+    uncheckedKeysByFile: Array<UncheckedSnapshot>;
+    unmatched: number;
+    updated: number;
+};
+export {};
+//# sourceMappingURL=types.d.ts.map

node_modules/metro/node_modules/@jest/test-result/build/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAC,WAAW,EAAE,eAAe,EAAC,MAAM,uBAAuB,CAAC;AACnE,OAAO,EAAC,aAAa,EAAC,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAEnC,oBAAY,iBAAiB,GAAG;IAC9B,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC;IACjC,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,oBAAY,eAAe,GAAG;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,GAAG,CAAC;IACb,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,QAAQ,CAAC,EAAE,GAAG,CAAC;IACf,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,GAAG,CAAC;CACb,CAAC;AAEF,oBAAY,iBAAiB,GAAG;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF,oBAAY,MAAM,GACd,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,SAAS,GACT,MAAM,GACN,UAAU,CAAC;AAEf,oBAAY,KAAK,GAAG,MAAM,CAAC;AAE3B,oBAAY,YAAY,GAAG,MAAM,CAAC;AAClC,aAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF,oBAAY,eAAe,GAAG;IAC5B,cAAc,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,QAAQ,CAAC,EAAE,YAAY,GAAG,IAAI,GAAG,SAAS,CAAC;IAC3C,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;IACtC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,oBAAY,wBAAwB,GAAG;IACrC,cAAc,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9B,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IACtC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,QAAQ,GAAG,IAAI,GAAG,SAAS,CAAC;IACtC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,oBAAY,+BAA+B,GAAG;IAC5C,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,yBAAyB,EAAE,MAAM,CAAC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,QAAQ,EAAE,eAAe,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,OAAO,CAAC;IACjB,WAAW,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC/B,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAEF,oBAAY,gBAAgB,GAAG,+BAA+B,GAAG;IAC/D,WAAW,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;CAClC,CAAC;AAEF,oBAAY,KAAK,GAAG;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACrB,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;CAC/B,CAAC;AAEF,oBAAY,UAAU,GAAG;IACvB,OAAO,CAAC,EAAE,aAAa,CAAC;IACxB,QAAQ,CAAC,EAAE,eAAe,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC;IACjC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,KAAK,EAAE,OAAO,CAAC;IACf,WAAW,CAAC,EAAE,KAAK,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,SAAS,EAAE;QACT,GAAG,EAAE,YAAY,CAAC;QAClB,KAAK,EAAE,YAAY,CAAC;KACrB,CAAC;IACF,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE;QACR,KAAK,EAAE,MAAM,CAAC;QACd,WAAW,EAAE,OAAO,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,MAAM,CAAC;QAClB,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7B,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IACF,UAAU,CAAC,EAAE;QACX,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAAC;KAC9B,CAAC;IACF,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;CACrC,CAAC;AAEF,oBAAY,mBAAmB,GAAG;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,QAAQ,GAAG,QAAQ,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,GAAG,CAAC;IACd,gBAAgB,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;CACnD,CAAC;AAEF,oBAAY,oBAAoB,GAAG;IACjC,WAAW,CAAC,EAAE,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;IAC7C,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,yBAAyB,EAAE,MAAM,CAAC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,QAAQ,EAAE,eAAe,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,OAAO,CAAC;IACjB,WAAW,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;IACxC,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAEF,oBAAY,oBAAoB,GAAG,GAAG,CAAC;AAEvC,oBAAY,qBAAqB,GAAG,CAClC,QAAQ,EAAE,eAAe,GAAG,IAAI,GAAG,SAAS,EAC5C,QAAQ,EAAE,oBAAoB,KAC3B,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;AAE5C,oBAAY,iBAAiB,GAAG;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;CACrB,CAAC;AAEF,oBAAY,eAAe,GAAG;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,mBAAmB,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC9C,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC"}

node_modules/metro/node_modules/@jest/test-result/build/types.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/test-result/package.json

@@ -0,0 +1,24 @@
+{
+  "name": "@jest/test-result",
+  "version": "24.9.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-test-result"
+  },
+  "license": "MIT",
+  "main": "build/index.js",
+  "types": "build/index.d.ts",
+  "dependencies": {
+    "@jest/console": "^24.9.0",
+    "@jest/types": "^24.9.0",
+    "@types/istanbul-lib-coverage": "^2.0.0"
+  },
+  "engines": {
+    "node": ">= 6"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1"
+}

node_modules/metro/node_modules/@jest/types/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Facebook, Inc. and its affiliates.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

node_modules/metro/node_modules/@jest/types/build/Circus.d.ts

@@ -0,0 +1,172 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import * as Global from './Global';
+declare type Process = NodeJS.Process;
+export declare type DoneFn = Global.DoneFn;
+export declare type BlockFn = Global.BlockFn;
+export declare type BlockName = Global.BlockName;
+export declare type BlockMode = void | 'skip' | 'only' | 'todo';
+export declare type TestMode = BlockMode;
+export declare type TestName = Global.TestName;
+export declare type TestFn = Global.TestFn;
+export declare type HookFn = (done?: DoneFn) => Promise<any> | null | undefined;
+export declare type AsyncFn = TestFn | HookFn;
+export declare type SharedHookType = 'afterAll' | 'beforeAll';
+export declare type HookType = SharedHookType | 'afterEach' | 'beforeEach';
+export declare type TestContext = Record<string, any>;
+export declare type Exception = any;
+export declare type FormattedError = string;
+export declare type Hook = {
+    asyncError: Error;
+    fn: HookFn;
+    type: HookType;
+    parent: DescribeBlock;
+    timeout: number | undefined | null;
+};
+export declare type EventHandler = (event: Event, state: State) => void;
+export declare type Event = {
+    name: 'include_test_location_in_result';
+} | {
+    asyncError: Error;
+    mode: BlockMode;
+    name: 'start_describe_definition';
+    blockName: BlockName;
+} | {
+    mode: BlockMode;
+    name: 'finish_describe_definition';
+    blockName: BlockName;
+} | {
+    asyncError: Error;
+    name: 'add_hook';
+    hookType: HookType;
+    fn: HookFn;
+    timeout: number | undefined;
+} | {
+    asyncError: Error;
+    name: 'add_test';
+    testName: TestName;
+    fn?: TestFn;
+    mode?: TestMode;
+    timeout: number | undefined;
+} | {
+    name: 'hook_start';
+    hook: Hook;
+} | {
+    name: 'hook_success';
+    describeBlock?: DescribeBlock;
+    test?: TestEntry;
+    hook: Hook;
+} | {
+    name: 'hook_failure';
+    error: string | Exception;
+    describeBlock?: DescribeBlock;
+    test?: TestEntry;
+    hook: Hook;
+} | {
+    name: 'test_fn_start';
+    test: TestEntry;
+} | {
+    name: 'test_fn_success';
+    test: TestEntry;
+} | {
+    name: 'test_fn_failure';
+    error: Exception;
+    test: TestEntry;
+} | {
+    name: 'test_retry';
+    test: TestEntry;
+} | {
+    name: 'test_start';
+    test: TestEntry;
+} | {
+    name: 'test_skip';
+    test: TestEntry;
+} | {
+    name: 'test_todo';
+    test: TestEntry;
+} | {
+    name: 'test_done';
+    test: TestEntry;
+} | {
+    name: 'run_describe_start';
+    describeBlock: DescribeBlock;
+} | {
+    name: 'run_describe_finish';
+    describeBlock: DescribeBlock;
+} | {
+    name: 'run_start';
+} | {
+    name: 'run_finish';
+} | {
+    name: 'error';
+    error: Exception;
+} | {
+    name: 'setup';
+    testNamePattern?: string;
+    parentProcess: Process;
+} | {
+    name: 'teardown';
+};
+export declare type TestStatus = 'skip' | 'done' | 'todo';
+export declare type TestResult = {
+    duration?: number | null;
+    errors: Array<FormattedError>;
+    invocations: number;
+    status: TestStatus;
+    location?: {
+        column: number;
+        line: number;
+    } | null;
+    testPath: Array<TestName | BlockName>;
+};
+export declare type RunResult = {
+    unhandledErrors: Array<FormattedError>;
+    testResults: TestResults;
+};
+export declare type TestResults = Array<TestResult>;
+export declare type GlobalErrorHandlers = {
+    uncaughtException: Array<(exception: Exception) => void>;
+    unhandledRejection: Array<(exception: Exception, promise: Promise<any>) => void>;
+};
+export declare type State = {
+    currentDescribeBlock: DescribeBlock;
+    currentlyRunningTest?: TestEntry | null;
+    expand?: boolean;
+    hasFocusedTests: boolean;
+    originalGlobalErrorHandlers?: GlobalErrorHandlers;
+    parentProcess: Process | null;
+    rootDescribeBlock: DescribeBlock;
+    testNamePattern?: RegExp | null;
+    testTimeout: number;
+    unhandledErrors: Array<Exception>;
+    includeTestLocationInResult: boolean;
+};
+export declare type DescribeBlock = {
+    children: Array<DescribeBlock>;
+    hooks: Array<Hook>;
+    mode: BlockMode;
+    name: BlockName;
+    parent?: DescribeBlock;
+    tests: Array<TestEntry>;
+};
+export declare type TestError = Exception | Array<[Exception | undefined, Exception]>;
+export declare type TestEntry = {
+    asyncError: Exception;
+    errors: TestError;
+    fn?: TestFn;
+    invocations: number;
+    mode: TestMode;
+    name: TestName;
+    parent: DescribeBlock;
+    startedAt?: number | null;
+    duration?: number | null;
+    status?: TestStatus | null;
+    timeout?: number;
+};
+export {};
+//# sourceMappingURL=Circus.d.ts.map

node_modules/metro/node_modules/@jest/types/build/Circus.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Circus.d.ts","sourceRoot":"","sources":["../src/Circus.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;;AAEH,OAAO,KAAK,MAAM,MAAM,UAAU,CAAC;AAEnC,aAAK,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;AAE9B,oBAAY,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AACnC,oBAAY,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;AACrC,oBAAY,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;AACzC,oBAAY,SAAS,GAAG,IAAI,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AACxD,oBAAY,QAAQ,GAAG,SAAS,CAAC;AACjC,oBAAY,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;AACvC,oBAAY,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AACnC,oBAAY,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;AACxE,oBAAY,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AACtC,oBAAY,cAAc,GAAG,UAAU,GAAG,WAAW,CAAC;AACtD,oBAAY,QAAQ,GAAG,cAAc,GAAG,WAAW,GAAG,YAAY,CAAC;AACnE,oBAAY,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC9C,oBAAY,SAAS,GAAG,GAAG,CAAC;AAC5B,oBAAY,cAAc,GAAG,MAAM,CAAC;AACpC,oBAAY,IAAI,GAAG;IACjB,UAAU,EAAE,KAAK,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,aAAa,CAAC;IACtB,OAAO,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAAC;CACpC,CAAC;AAEF,oBAAY,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC;AAEhE,oBAAY,KAAK,GACb;IACE,IAAI,EAAE,iCAAiC,CAAC;CACzC,GACD;IACE,UAAU,EAAE,KAAK,CAAC;IAClB,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,2BAA2B,CAAC;IAClC,SAAS,EAAE,SAAS,CAAC;CACtB,GACD;IACE,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,4BAA4B,CAAC;IACnC,SAAS,EAAE,SAAS,CAAC;CACtB,GACD;IACE,UAAU,EAAE,KAAK,CAAC;IAClB,IAAI,EAAE,UAAU,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC;IACnB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B,GACD;IACE,UAAU,EAAE,KAAK,CAAC;IAClB,IAAI,EAAE,UAAU,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC;IACnB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,QAAQ,CAAC;IAChB,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B,GACD;IACE,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,cAAc,CAAC;IACrB,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,cAAc,CAAC;IACrB,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,iBAAiB,CAAC;IACxB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,iBAAiB,CAAC;IACxB,KAAK,EAAE,SAAS,CAAC;IACjB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IAGE,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IAKE,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,SAAS,CAAC;CACjB,GACD;IACE,IAAI,EAAE,oBAAoB,CAAC;IAC3B,aAAa,EAAE,aAAa,CAAC;CAC9B,GACD;IACE,IAAI,EAAE,qBAAqB,CAAC;IAC5B,aAAa,EAAE,aAAa,CAAC;CAC9B,GACD;IACE,IAAI,EAAE,WAAW,CAAC;CACnB,GACD;IACE,IAAI,EAAE,YAAY,CAAC;CACpB,GACD;IAGE,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,SAAS,CAAC;CAClB,GACD;IAEE,IAAI,EAAE,OAAO,CAAC;IACd,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,OAAO,CAAC;CACxB,GACD;IAGE,IAAI,EAAE,UAAU,CAAC;CAClB,CAAC;AAEN,oBAAY,UAAU,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAClD,oBAAY,UAAU,GAAG;IACvB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,UAAU,CAAC;IACnB,QAAQ,CAAC,EAAE;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAC,GAAG,IAAI,CAAC;IACjD,QAAQ,EAAE,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;CACvC,CAAC;AAEF,oBAAY,SAAS,GAAG;IACtB,eAAe,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;IACvC,WAAW,EAAE,WAAW,CAAC;CAC1B,CAAC;AAEF,oBAAY,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;AAE5C,oBAAY,mBAAmB,GAAG;IAChC,iBAAiB,EAAE,KAAK,CAAC,CAAC,SAAS,EAAE,SAAS,KAAK,IAAI,CAAC,CAAC;IACzD,kBAAkB,EAAE,KAAK,CACvB,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CACtD,CAAC;CACH,CAAC;AAEF,oBAAY,KAAK,GAAG;IAClB,oBAAoB,EAAE,aAAa,CAAC;IACpC,oBAAoB,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC;IACxC,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,eAAe,EAAE,OAAO,CAAC;IAIzB,2BAA2B,CAAC,EAAE,mBAAmB,CAAC;IAClD,aAAa,EAAE,OAAO,GAAG,IAAI,CAAC;IAC9B,iBAAiB,EAAE,aAAa,CAAC;IACjC,eAAe,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAClC,2BAA2B,EAAE,OAAO,CAAC;CACtC,CAAC;AAEF,oBAAY,aAAa,GAAG;IAC1B,QAAQ,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC/B,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACnB,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,CAAC,EAAE,aAAa,CAAC;IACvB,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;CACzB,CAAC;AAEF,oBAAY,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,SAAS,GAAG,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;AAE9E,oBAAY,SAAS,GAAG;IACtB,UAAU,EAAE,SAAS,CAAC;IACtB,MAAM,EAAE,SAAS,CAAC;IAClB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,aAAa,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,MAAM,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC;IAC3B,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC"}

node_modules/metro/node_modules/@jest/types/build/Circus.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/types/build/Config.d.ts

@@ -0,0 +1,439 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { Arguments } from 'yargs';
+import { ReportOptions } from 'istanbul-reports';
+export declare type Path = string;
+export declare type Glob = string;
+export declare type HasteConfig = {
+    computeSha1?: boolean;
+    defaultPlatform?: string | null | undefined;
+    hasteImplModulePath?: string;
+    platforms?: Array<string>;
+    providesModuleNodeModules: Array<string>;
+    throwOnModuleCollision?: boolean;
+};
+export declare type ReporterConfig = [string, Record<string, unknown>];
+export declare type TransformerConfig = [string, Record<string, unknown>];
+export declare type ConfigGlobals = Record<string, any>;
+export declare type DefaultOptions = {
+    automock: boolean;
+    bail: number;
+    browser: boolean;
+    cache: boolean;
+    cacheDirectory: Path;
+    changedFilesWithAncestor: boolean;
+    clearMocks: boolean;
+    collectCoverage: boolean;
+    collectCoverageFrom: Array<string> | null | undefined;
+    coverageDirectory: string | null | undefined;
+    coveragePathIgnorePatterns: Array<string>;
+    coverageReporters: Array<string>;
+    coverageThreshold: {
+        global: {
+            [key: string]: number;
+        };
+    } | null | undefined;
+    dependencyExtractor: string | null | undefined;
+    errorOnDeprecated: boolean;
+    expand: boolean;
+    filter: Path | null | undefined;
+    forceCoverageMatch: Array<Glob>;
+    globals: ConfigGlobals;
+    globalSetup: string | null | undefined;
+    globalTeardown: string | null | undefined;
+    haste: HasteConfig;
+    maxWorkers: number | string;
+    maxConcurrency: number;
+    moduleDirectories: Array<string>;
+    moduleFileExtensions: Array<string>;
+    moduleNameMapper: {
+        [key: string]: string;
+    };
+    modulePathIgnorePatterns: Array<string>;
+    noStackTrace: boolean;
+    notify: boolean;
+    notifyMode: string;
+    preset: string | null | undefined;
+    prettierPath: string | null | undefined;
+    projects: Array<string | ProjectConfig> | null | undefined;
+    resetMocks: boolean;
+    resetModules: boolean;
+    resolver: Path | null | undefined;
+    restoreMocks: boolean;
+    rootDir: Path | null | undefined;
+    roots: Array<Path> | null | undefined;
+    runner: string;
+    runTestsByPath: boolean;
+    setupFiles: Array<Path>;
+    setupFilesAfterEnv: Array<Path>;
+    skipFilter: boolean;
+    snapshotSerializers: Array<Path>;
+    testEnvironment: string;
+    testEnvironmentOptions: Record<string, any>;
+    testFailureExitCode: string | number;
+    testLocationInResults: boolean;
+    testMatch: Array<Glob>;
+    testPathIgnorePatterns: Array<string>;
+    testRegex: Array<string>;
+    testResultsProcessor: string | null | undefined;
+    testRunner: string | null | undefined;
+    testSequencer: string;
+    testURL: string;
+    timers: 'real' | 'fake';
+    transform: {
+        [regex: string]: Path | TransformerConfig;
+    } | null | undefined;
+    transformIgnorePatterns: Array<Glob>;
+    watchPathIgnorePatterns: Array<string>;
+    useStderr: boolean;
+    verbose: boolean | null | undefined;
+    watch: boolean;
+    watchman: boolean;
+};
+export declare type DisplayName = string | {
+    name: string;
+    color: DisplayNameColor;
+};
+export declare type InitialOptions = {
+    automock?: boolean;
+    bail?: boolean | number;
+    browser?: boolean;
+    cache?: boolean;
+    cacheDirectory?: Path;
+    clearMocks?: boolean;
+    changedFilesWithAncestor?: boolean;
+    changedSince?: string;
+    collectCoverage?: boolean;
+    collectCoverageFrom?: Array<Glob>;
+    collectCoverageOnlyFrom?: {
+        [key: string]: boolean;
+    };
+    coverageDirectory?: string;
+    coveragePathIgnorePatterns?: Array<string>;
+    coverageReporters?: Array<string>;
+    coverageThreshold?: {
+        global: {
+            [key: string]: number;
+        };
+    };
+    dependencyExtractor?: string;
+    detectLeaks?: boolean;
+    detectOpenHandles?: boolean;
+    displayName?: DisplayName;
+    expand?: boolean;
+    extraGlobals?: Array<string>;
+    filter?: Path;
+    findRelatedTests?: boolean;
+    forceCoverageMatch?: Array<Glob>;
+    forceExit?: boolean;
+    json?: boolean;
+    globals?: ConfigGlobals;
+    globalSetup?: string | null | undefined;
+    globalTeardown?: string | null | undefined;
+    haste?: HasteConfig;
+    reporters?: Array<string | ReporterConfig>;
+    logHeapUsage?: boolean;
+    lastCommit?: boolean;
+    listTests?: boolean;
+    mapCoverage?: boolean;
+    maxConcurrency?: number;
+    maxWorkers: number | string;
+    moduleDirectories?: Array<string>;
+    moduleFileExtensions?: Array<string>;
+    moduleLoader?: Path;
+    moduleNameMapper?: {
+        [key: string]: string;
+    };
+    modulePathIgnorePatterns?: Array<string>;
+    modulePaths?: Array<string>;
+    name?: string;
+    noStackTrace?: boolean;
+    notify?: boolean;
+    notifyMode?: string;
+    onlyChanged?: boolean;
+    outputFile?: Path;
+    passWithNoTests?: boolean;
+    preprocessorIgnorePatterns?: Array<Glob>;
+    preset?: string | null | undefined;
+    prettierPath?: string | null | undefined;
+    projects?: Array<Glob>;
+    replname?: string | null | undefined;
+    resetMocks?: boolean;
+    resetModules?: boolean;
+    resolver?: Path | null | undefined;
+    restoreMocks?: boolean;
+    rootDir: Path;
+    roots?: Array<Path>;
+    runner?: string;
+    runTestsByPath?: boolean;
+    scriptPreprocessor?: string;
+    setupFiles?: Array<Path>;
+    setupTestFrameworkScriptFile?: Path;
+    setupFilesAfterEnv?: Array<Path>;
+    silent?: boolean;
+    skipFilter?: boolean;
+    skipNodeResolution?: boolean;
+    snapshotResolver?: Path;
+    snapshotSerializers?: Array<Path>;
+    errorOnDeprecated?: boolean;
+    testEnvironment?: string;
+    testEnvironmentOptions?: Record<string, any>;
+    testFailureExitCode?: string | number;
+    testLocationInResults?: boolean;
+    testMatch?: Array<Glob>;
+    testNamePattern?: string;
+    testPathDirs?: Array<Path>;
+    testPathIgnorePatterns?: Array<string>;
+    testRegex?: string | Array<string>;
+    testResultsProcessor?: string | null | undefined;
+    testRunner?: string;
+    testSequencer?: string;
+    testURL?: string;
+    testTimeout?: number;
+    timers?: 'real' | 'fake';
+    transform?: {
+        [regex: string]: Path | TransformerConfig;
+    };
+    transformIgnorePatterns?: Array<Glob>;
+    watchPathIgnorePatterns?: Array<string>;
+    unmockedModulePathPatterns?: Array<string>;
+    updateSnapshot?: boolean;
+    useStderr?: boolean;
+    verbose?: boolean | null | undefined;
+    watch?: boolean;
+    watchAll?: boolean;
+    watchman?: boolean;
+    watchPlugins?: Array<string | [string, Record<string, any>]>;
+};
+export declare type SnapshotUpdateState = 'all' | 'new' | 'none';
+declare type NotifyMode = 'always' | 'failure' | 'success' | 'change' | 'success-change' | 'failure-change';
+/**
+ * Hard coding this until
+ * https://github.com/chalk/chalk/pull/336
+ * gets merged
+ */
+declare type DisplayNameColor = 'black' | 'red' | 'green' | 'yellow' | 'blue' | 'magenta' | 'cyan' | 'white' | 'gray' | 'grey' | 'blackBright' | 'redBright' | 'greenBright' | 'yellowBright' | 'blueBright' | 'magentaBright' | 'cyanBright' | 'whiteBright' | 'bgBlack' | 'bgRed' | 'bgGreen' | 'bgYellow' | 'bgBlue' | 'bgMagenta' | 'bgCyan' | 'bgWhite' | 'bgBlackBright' | 'bgRedBright' | 'bgGreenBright' | 'bgYellowBright' | 'bgBlueBright' | 'bgMagentaBright' | 'bgCyanBright' | 'bgWhiteBright';
+declare type CoverageThreshold = {
+    [path: string]: {
+        [key: string]: number;
+    };
+    global: {
+        [key: string]: number;
+    };
+};
+export declare type GlobalConfig = {
+    bail: number;
+    changedSince: string;
+    changedFilesWithAncestor: boolean;
+    collectCoverage: boolean;
+    collectCoverageFrom: Array<Glob>;
+    collectCoverageOnlyFrom: {
+        [key: string]: boolean;
+    } | null | undefined;
+    coverageDirectory: string;
+    coveragePathIgnorePatterns?: Array<string>;
+    coverageReporters: Array<keyof ReportOptions>;
+    coverageThreshold: CoverageThreshold;
+    detectLeaks: boolean;
+    detectOpenHandles: boolean;
+    enabledTestsMap: {
+        [key: string]: {
+            [key: string]: boolean;
+        };
+    } | null | undefined;
+    expand: boolean;
+    extraGlobals: Array<string>;
+    filter: Path | null | undefined;
+    findRelatedTests: boolean;
+    forceExit: boolean;
+    json: boolean;
+    globalSetup: string | null | undefined;
+    globalTeardown: string | null | undefined;
+    lastCommit: boolean;
+    logHeapUsage: boolean;
+    listTests: boolean;
+    maxConcurrency: number;
+    maxWorkers: number;
+    noStackTrace: boolean;
+    nonFlagArgs: Array<string>;
+    noSCM: boolean | null | undefined;
+    notify: boolean;
+    notifyMode: NotifyMode;
+    outputFile: Path | null | undefined;
+    onlyChanged: boolean;
+    onlyFailures: boolean;
+    passWithNoTests: boolean;
+    projects: Array<Glob>;
+    replname: string | null | undefined;
+    reporters: Array<string | ReporterConfig>;
+    runTestsByPath: boolean;
+    rootDir: Path;
+    silent: boolean;
+    skipFilter: boolean;
+    errorOnDeprecated: boolean;
+    testFailureExitCode: number;
+    testNamePattern: string;
+    testPathPattern: string;
+    testResultsProcessor: string | null | undefined;
+    testSequencer: string;
+    testTimeout: number;
+    updateSnapshot: SnapshotUpdateState;
+    useStderr: boolean;
+    verbose: boolean | null | undefined;
+    watch: boolean;
+    watchAll: boolean;
+    watchman: boolean;
+    watchPlugins: Array<{
+        path: string;
+        config: Record<string, any>;
+    }> | null | undefined;
+};
+export declare type ProjectConfig = {
+    automock: boolean;
+    browser: boolean;
+    cache: boolean;
+    cacheDirectory: Path;
+    clearMocks: boolean;
+    coveragePathIgnorePatterns: Array<string>;
+    cwd: Path;
+    dependencyExtractor?: string;
+    detectLeaks: boolean;
+    detectOpenHandles: boolean;
+    displayName?: DisplayName;
+    errorOnDeprecated: boolean;
+    extraGlobals: Array<keyof NodeJS.Global>;
+    filter: Path | null | undefined;
+    forceCoverageMatch: Array<Glob>;
+    globalSetup: string | null | undefined;
+    globalTeardown: string | null | undefined;
+    globals: ConfigGlobals;
+    haste: HasteConfig;
+    moduleDirectories: Array<string>;
+    moduleFileExtensions: Array<string>;
+    moduleLoader: Path;
+    moduleNameMapper: Array<[string, string]>;
+    modulePathIgnorePatterns: Array<string>;
+    modulePaths: Array<string>;
+    name: string;
+    prettierPath: string;
+    resetMocks: boolean;
+    resetModules: boolean;
+    resolver: Path | null | undefined;
+    restoreMocks: boolean;
+    rootDir: Path;
+    roots: Array<Path>;
+    runner: string;
+    setupFiles: Array<Path>;
+    setupFilesAfterEnv: Array<Path>;
+    skipFilter: boolean;
+    skipNodeResolution: boolean;
+    snapshotResolver: Path | null | undefined;
+    snapshotSerializers: Array<Path>;
+    testEnvironment: string;
+    testEnvironmentOptions: Record<string, any>;
+    testMatch: Array<Glob>;
+    testLocationInResults: boolean;
+    testPathIgnorePatterns: Array<string>;
+    testRegex: Array<string>;
+    testRunner: string;
+    testURL: string;
+    timers: 'real' | 'fake';
+    transform: Array<[string, Path, Record<string, unknown>]>;
+    transformIgnorePatterns: Array<Glob>;
+    watchPathIgnorePatterns: Array<string>;
+    unmockedModulePathPatterns: Array<string> | null | undefined;
+};
+export declare type Argv = Arguments<Partial<{
+    all: boolean;
+    automock: boolean;
+    bail: boolean | number;
+    browser: boolean;
+    cache: boolean;
+    cacheDirectory: string;
+    changedFilesWithAncestor: boolean;
+    changedSince: string;
+    ci: boolean;
+    clearCache: boolean;
+    clearMocks: boolean;
+    collectCoverage: boolean;
+    collectCoverageFrom: string;
+    collectCoverageOnlyFrom: Array<string>;
+    color: boolean;
+    colors: boolean;
+    config: string;
+    coverage: boolean;
+    coverageDirectory: string;
+    coveragePathIgnorePatterns: Array<string>;
+    coverageReporters: Array<string>;
+    coverageThreshold: string;
+    debug: boolean;
+    env: string;
+    expand: boolean;
+    findRelatedTests: boolean;
+    forceExit: boolean;
+    globals: string;
+    globalSetup: string | null | undefined;
+    globalTeardown: string | null | undefined;
+    haste: string;
+    init: boolean;
+    json: boolean;
+    lastCommit: boolean;
+    logHeapUsage: boolean;
+    maxWorkers: number | string;
+    moduleDirectories: Array<string>;
+    moduleFileExtensions: Array<string>;
+    moduleNameMapper: string;
+    modulePathIgnorePatterns: Array<string>;
+    modulePaths: Array<string>;
+    noStackTrace: boolean;
+    notify: boolean;
+    notifyMode: string;
+    onlyChanged: boolean;
+    outputFile: string;
+    preset: string | null | undefined;
+    projects: Array<string>;
+    prettierPath: string | null | undefined;
+    resetMocks: boolean;
+    resetModules: boolean;
+    resolver: string | null | undefined;
+    restoreMocks: boolean;
+    rootDir: string;
+    roots: Array<string>;
+    runInBand: boolean;
+    setupFiles: Array<string>;
+    setupFilesAfterEnv: Array<string>;
+    showConfig: boolean;
+    silent: boolean;
+    snapshotSerializers: Array<string>;
+    testEnvironment: string;
+    testFailureExitCode: string | null | undefined;
+    testMatch: Array<string>;
+    testNamePattern: string;
+    testPathIgnorePatterns: Array<string>;
+    testPathPattern: Array<string>;
+    testRegex: string | Array<string>;
+    testResultsProcessor: string | null | undefined;
+    testRunner: string;
+    testSequencer: string;
+    testURL: string;
+    testTimeout: number | null | undefined;
+    timers: string;
+    transform: string;
+    transformIgnorePatterns: Array<string>;
+    unmockedModulePathPatterns: Array<string> | null | undefined;
+    updateSnapshot: boolean;
+    useStderr: boolean;
+    verbose: boolean | null | undefined;
+    version: boolean;
+    watch: boolean;
+    watchAll: boolean;
+    watchman: boolean;
+    watchPathIgnorePatterns: Array<string>;
+}>>;
+export {};
+//# sourceMappingURL=Config.d.ts.map

node_modules/metro/node_modules/@jest/types/build/Config.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/types/build/Global.d.ts

@@ -0,0 +1,74 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/// <reference types="node" />
+import { CoverageMapData } from 'istanbul-lib-coverage';
+export declare type DoneFn = (reason?: string | Error) => void;
+export declare type TestName = string;
+export declare type TestFn = (done?: DoneFn) => Promise<any> | void | undefined;
+export declare type BlockFn = () => void;
+export declare type BlockName = string;
+export declare type Col = unknown;
+export declare type Row = Array<Col>;
+export declare type Table = Array<Row>;
+export declare type ArrayTable = Table | Row;
+export declare type TemplateTable = TemplateStringsArray;
+export declare type TemplateData = Array<unknown>;
+export declare type EachTable = ArrayTable | TemplateTable;
+export declare type EachTestFn = (...args: Array<any>) => Promise<any> | void | undefined;
+declare type Jasmine = {
+    _DEFAULT_TIMEOUT_INTERVAL?: number;
+    addMatchers: Function;
+};
+declare type Each = (table: EachTable, ...taggedTemplateData: Array<unknown>) => (title: string, test: EachTestFn, timeout?: number) => void;
+export interface ItBase {
+    (testName: TestName, fn: TestFn, timeout?: number): void;
+    each: Each;
+}
+export interface It extends ItBase {
+    only: ItBase;
+    skip: ItBase;
+    todo: (testName: TestName, ...rest: Array<any>) => void;
+}
+export interface ItConcurrentBase {
+    (testName: string, testFn: () => Promise<any>, timeout?: number): void;
+}
+export interface ItConcurrentExtended extends ItConcurrentBase {
+    only: ItConcurrentBase;
+    skip: ItConcurrentBase;
+}
+export interface ItConcurrent extends It {
+    concurrent: ItConcurrentExtended;
+}
+export interface DescribeBase {
+    (blockName: BlockName, blockFn: BlockFn): void;
+    each: Each;
+}
+export interface Describe extends DescribeBase {
+    only: DescribeBase;
+    skip: DescribeBase;
+}
+export interface Global extends NodeJS.Global {
+    it: ItConcurrent;
+    test: ItConcurrent;
+    fit: ItBase & {
+        concurrent?: ItConcurrentBase;
+    };
+    xit: ItBase;
+    xtest: ItBase;
+    describe: Describe;
+    xdescribe: DescribeBase;
+    fdescribe: DescribeBase;
+    __coverage__: CoverageMapData;
+    jasmine: Jasmine;
+    fail: () => void;
+    pending: () => void;
+    spyOn: () => void;
+    spyOnProperty: () => void;
+    [extras: string]: any;
+}
+export {};
+//# sourceMappingURL=Global.d.ts.map

node_modules/metro/node_modules/@jest/types/build/Global.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Global.d.ts","sourceRoot":"","sources":["../src/Global.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;;AAEH,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAEtD,oBAAY,MAAM,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,KAAK,KAAK,IAAI,CAAC;AACvD,oBAAY,QAAQ,GAAG,MAAM,CAAC;AAC9B,oBAAY,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;AACxE,oBAAY,OAAO,GAAG,MAAM,IAAI,CAAC;AACjC,oBAAY,SAAS,GAAG,MAAM,CAAC;AAE/B,oBAAY,GAAG,GAAG,OAAO,CAAC;AAC1B,oBAAY,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;AAC7B,oBAAY,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;AAC/B,oBAAY,UAAU,GAAG,KAAK,GAAG,GAAG,CAAC;AACrC,oBAAY,aAAa,GAAG,oBAAoB,CAAC;AACjD,oBAAY,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;AAC1C,oBAAY,SAAS,GAAG,UAAU,GAAG,aAAa,CAAC;AACnD,oBAAY,UAAU,GAAG,CACvB,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,KAChB,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC;AAGrC,aAAK,OAAO,GAAG;IAAC,yBAAyB,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,QAAQ,CAAA;CAAC,CAAC;AAE3E,aAAK,IAAI,GAAG,CACV,KAAK,EAAE,SAAS,EAChB,GAAG,kBAAkB,EAAE,KAAK,CAAC,OAAO,CAAC,KAClC,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;AAEjE,MAAM,WAAW,MAAM;IACrB,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzD,IAAI,EAAE,IAAI,CAAC;CACZ;AAED,MAAM,WAAW,EAAG,SAAQ,MAAM;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;CACzD;AAED,MAAM,WAAW,gBAAgB;IAC/B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACxE;AAED,MAAM,WAAW,oBAAqB,SAAQ,gBAAgB;IAC5D,IAAI,EAAE,gBAAgB,CAAC;IACvB,IAAI,EAAE,gBAAgB,CAAC;CACxB;AAED,MAAM,WAAW,YAAa,SAAQ,EAAE;IACtC,UAAU,EAAE,oBAAoB,CAAC;CAClC;AAED,MAAM,WAAW,YAAY;IAC3B,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IAC/C,IAAI,EAAE,IAAI,CAAC;CACZ;AAED,MAAM,WAAW,QAAS,SAAQ,YAAY;IAC5C,IAAI,EAAE,YAAY,CAAC;IACnB,IAAI,EAAE,YAAY,CAAC;CACpB;AAGD,MAAM,WAAW,MAAO,SAAQ,MAAM,CAAC,MAAM;IAC3C,EAAE,EAAE,YAAY,CAAC;IACjB,IAAI,EAAE,YAAY,CAAC;IACnB,GAAG,EAAE,MAAM,GAAG;QAAC,UAAU,CAAC,EAAE,gBAAgB,CAAA;KAAC,CAAC;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,CAAC;IACnB,SAAS,EAAE,YAAY,CAAC;IACxB,SAAS,EAAE,YAAY,CAAC;IACxB,YAAY,EAAE,eAAe,CAAC;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,EAAE,MAAM,IAAI,CAAC;IACjB,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,KAAK,EAAE,MAAM,IAAI,CAAC;IAClB,aAAa,EAAE,MAAM,IAAI,CAAC;IAC1B,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC;CACvB"}

node_modules/metro/node_modules/@jest/types/build/Global.js

@@ -0,0 +1 @@
+'use strict';

node_modules/metro/node_modules/@jest/types/build/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+import * as Circus from './Circus';
+import * as Config from './Config';
+import * as Global from './Global';
+export { Circus, Config, Global };
+//# sourceMappingURL=index.d.ts.map

node_modules/metro/node_modules/@jest/types/build/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,MAAM,MAAM,UAAU,CAAC;AACnC,OAAO,KAAK,MAAM,MAAM,UAAU,CAAC;AACnC,OAAO,KAAK,MAAM,MAAM,UAAU,CAAC;AAEnC,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAC,CAAC"}

node_modules/metro/node_modules/@jest/types/build/index.js

@@ -0,0 +1,43 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+});
+exports.Global = exports.Config = exports.Circus = void 0;
+
+var Circus = _interopRequireWildcard(require('./Circus'));
+
+exports.Circus = Circus;
+
+var Config = _interopRequireWildcard(require('./Config'));
+
+exports.Config = Config;
+
+var Global = _interopRequireWildcard(require('./Global'));
+
+exports.Global = Global;
+
+function _interopRequireWildcard(obj) {
+  if (obj && obj.__esModule) {
+    return obj;
+  } else {
+    var newObj = {};
+    if (obj != null) {
+      for (var key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key)) {
+          var desc =
+            Object.defineProperty && Object.getOwnPropertyDescriptor
+              ? Object.getOwnPropertyDescriptor(obj, key)
+              : {};
+          if (desc.get || desc.set) {
+            Object.defineProperty(newObj, key, desc);
+          } else {
+            newObj[key] = obj[key];
+          }
+        }
+      }
+    }
+    newObj.default = obj;
+    return newObj;
+  }
+}

node_modules/metro/node_modules/@jest/types/package.json

@@ -0,0 +1,24 @@
+{
+  "name": "@jest/types",
+  "version": "24.9.0",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/facebook/jest.git",
+    "directory": "packages/jest-types"
+  },
+  "engines": {
+    "node": ">= 6"
+  },
+  "license": "MIT",
+  "main": "build/index.js",
+  "types": "build/index.d.ts",
+  "dependencies": {
+    "@types/istanbul-lib-coverage": "^2.0.0",
+    "@types/istanbul-reports": "^1.1.1",
+    "@types/yargs": "^13.0.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1"
+}

node_modules/metro/node_modules/@types/yargs/LICENSE

@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE

node_modules/metro/node_modules/@types/yargs/README.md

@@ -0,0 +1,16 @@
+# Installation
+> `npm install --save @types/yargs`
+
+# Summary
+This package contains type definitions for yargs (https://github.com/chevex/yargs).
+
+# Details
+Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/yargs/v13.
+
+### Additional Details
+ * Last updated: Wed, 23 Sep 2020 19:15:29 GMT
+ * Dependencies: [@types/yargs-parser](https://npmjs.com/package/@types/yargs-parser)
+ * Global values: none
+
+# Credits
+These definitions were written by [Martin Poelstra](https://github.com/poelstra), [Mizunashi Mana](https://github.com/mizunashi-mana), [Jeffery Grajkowski](https://github.com/pushplay), [Jimi (Dimitris) Charalampidis](https://github.com/JimiC), [Steffen Viken Valvåg](https://github.com/steffenvv), [Emily Marigold Klassen](https://github.com/forivall), and [ExE Boss](https://github.com/ExE-Boss).

node_modules/metro/node_modules/@types/yargs/index.d.ts

@@ -0,0 +1,777 @@
+// Type definitions for yargs 13.0
+// Project: https://github.com/chevex/yargs, https://yargs.js.org
+// Definitions by: Martin Poelstra <https://github.com/poelstra>
+//                 Mizunashi Mana <https://github.com/mizunashi-mana>
+//                 Jeffery Grajkowski <https://github.com/pushplay>
+//                 Jimi (Dimitris) Charalampidis <https://github.com/JimiC>
+//                 Steffen Viken Valvåg <https://github.com/steffenvv>
+//                 Emily Marigold Klassen <https://github.com/forivall>
+//                 ExE Boss <https://github.com/ExE-Boss>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// TypeScript Version: 3.0
+
+// The following TSLint rules have been disabled:
+// unified-signatures: Because there is useful information in the argument names of the overloaded signatures
+
+// Convention:
+// Use 'union types' when:
+//  - parameter types have similar signature type (i.e. 'string | ReadonlyArray<string>')
+//  - parameter names have the same semantic meaning (i.e. ['command', 'commands'] , ['key', 'keys'])
+//    An example for not using 'union types' is the declaration of 'env' where `prefix` and `enable` parameters
+//    have different semantics. On the other hand, in the declaration of 'usage', a `command: string` parameter
+//    has the same semantic meaning with declaring an overload method by using `commands: ReadonlyArray<string>`,
+//    thus it's preferred to use `command: string | ReadonlyArray<string>`
+// Use parameterless declaration instead of declaring all parameters optional,
+// when all parameters are optional and more than one
+
+import { DetailedArguments, Configuration } from 'yargs-parser';
+
+declare namespace yargs {
+    type BuilderCallback<T, R> = ((args: Argv<T>) => Argv<R>) | ((args: Argv<T>) => void);
+
+    type ParserConfigurationOptions = Configuration & {
+        /** Sort commands alphabetically. Default is `false` */
+        'sort-commands': boolean;
+    };
+
+    /**
+     * The type parameter `T` is the expected shape of the parsed options.
+     * `Arguments<T>` is those options plus `_` and `$0`, and an indexer falling
+     * back to `unknown` for unknown options.
+     *
+     * For the return type / `argv` property, we create a mapped type over
+     * `Arguments<T>` to simplify the inferred type signature in client code.
+     */
+    interface Argv<T = {}> {
+        (): { [key in keyof Arguments<T>]: Arguments<T>[key] };
+        (args: ReadonlyArray<string>, cwd?: string): Argv<T>;
+
+        /**
+         * Set key names as equivalent such that updates to a key will propagate to aliases and vice-versa.
+         *
+         * Optionally `.alias()` can take an object that maps keys to aliases.
+         * Each key of this object should be the canonical version of the option, and each value should be a string or an array of strings.
+         */
+        // Aliases for previously declared options can inherit the types of those options.
+        alias<K1 extends keyof T, K2 extends string>(shortName: K1, longName: K2 | ReadonlyArray<K2>): Argv<T & { [key in K2]: T[K1] }>;
+        alias<K1 extends keyof T, K2 extends string>(shortName: K2, longName: K1 | ReadonlyArray<K1>): Argv<T & { [key in K2]: T[K1] }>;
+        alias(shortName: string | ReadonlyArray<string>, longName: string | ReadonlyArray<string>): Argv<T>;
+        alias(aliases: { [shortName: string]: string | ReadonlyArray<string> }): Argv<T>;
+
+        /**
+         * Get the arguments as a plain old object.
+         *
+         * Arguments without a corresponding flag show up in the `argv._` array.
+         *
+         * The script name or node command is available at `argv.$0` similarly to how `$0` works in bash or perl.
+         *
+         * If `yargs` is executed in an environment that embeds node and there's no script name (e.g. Electron or nw.js),
+         * it will ignore the first parameter since it expects it to be the script name. In order to override
+         * this behavior, use `.parse(process.argv.slice(1))` instead of .argv and the first parameter won't be ignored.
+         */
+        argv: { [key in keyof Arguments<T>]: Arguments<T>[key] };
+
+        /**
+         * Tell the parser to interpret `key` as an array.
+         * If `.array('foo')` is set, `--foo foo bar` will be parsed as `['foo', 'bar']` rather than as `'foo'`.
+         * Also, if you use the option multiple times all the values will be flattened in one array so `--foo foo --foo bar` will be parsed as `['foo', 'bar']`
+         *
+         * When the option is used with a positional, use `--` to tell `yargs` to stop adding values to the array.
+         */
+        array<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: ToArray<T[key]> }>;
+        array<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: Array<string | number> | undefined }>;
+
+        /**
+         * Interpret `key` as a boolean. If a non-flag option follows `key` in `process.argv`, that string won't get set as the value of `key`.
+         *
+         * `key` will default to `false`, unless a `default(key, undefined)` is explicitly set.
+         *
+         * If `key` is an array, interpret all the elements as booleans.
+         */
+        boolean<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: boolean | undefined }>;
+        boolean<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: boolean | undefined }>;
+
+        /**
+         * Check that certain conditions are met in the provided arguments.
+         * @param func Called with two arguments, the parsed `argv` hash and an array of options and their aliases.
+         * If `func` throws or returns a non-truthy value, show the thrown error, usage information, and exit.
+         * @param global Indicates whether `check()` should be enabled both at the top-level and for each sub-command.
+         */
+        check(func: (argv: Arguments<T>, aliases: { [alias: string]: string }) => any, global?: boolean): Argv<T>;
+
+        /**
+         * Limit valid values for key to a predefined set of choices, given as an array or as an individual value.
+         * If this method is called multiple times, all enumerated values will be merged together.
+         * Choices are generally strings or numbers, and value matching is case-sensitive.
+         *
+         * Optionally `.choices()` can take an object that maps multiple keys to their choices.
+         *
+         * Choices can also be specified as choices in the object given to `option()`.
+         */
+        choices<K extends keyof T, C extends ReadonlyArray<any>>(key: K, values: C): Argv<Omit<T, K> & { [key in K]: C[number] | undefined }>;
+        choices<K extends string, C extends ReadonlyArray<any>>(key: K, values: C): Argv<T & { [key in K]: C[number] | undefined }>;
+        choices<C extends { [key: string]: ReadonlyArray<any> }>(choices: C): Argv<Omit<T, keyof C> & { [key in keyof C]: C[key][number] | undefined }>;
+
+        /**
+         * Provide a synchronous function to coerce or transform the value(s) given on the command line for `key`.
+         *
+         * The coercion function should accept one argument, representing the parsed value from the command line, and should return a new value or throw an error.
+         * The returned value will be used as the value for `key` (or one of its aliases) in `argv`.
+         *
+         * If the function throws, the error will be treated as a validation failure, delegating to either a custom `.fail()` handler or printing the error message in the console.
+         *
+         * Coercion will be applied to a value after all other modifications, such as `.normalize()`.
+         *
+         * Optionally `.coerce()` can take an object that maps several keys to their respective coercion function.
+         *
+         * You can also map the same function to several keys at one time. Just pass an array of keys as the first argument to `.coerce()`.
+         *
+         * If you are using dot-notion or arrays, .e.g., `user.email` and `user.password`, coercion will be applied to the final object that has been parsed
+         */
+        coerce<K extends keyof T, V>(key: K | ReadonlyArray<K>, func: (arg: any) => V): Argv<Omit<T, K> & { [key in K]: V | undefined }>;
+        coerce<K extends string, V>(key: K | ReadonlyArray<K>, func: (arg: any) => V): Argv<T & { [key in K]: V | undefined }>;
+        coerce<O extends { [key: string]: (arg: any) => any }>(opts: O): Argv<Omit<T, keyof O> & { [key in keyof O]: ReturnType<O[key]> | undefined }>;
+
+        /**
+         * Define the commands exposed by your application.
+         * @param command Should be a string representing the command or an array of strings representing the command and its aliases.
+         * @param description Use to provide a description for each command your application accepts (the values stored in `argv._`).
+         * Set `description` to false to create a hidden command. Hidden commands don't show up in the help output and aren't available for completion.
+         * @param [builder] Object to give hints about the options that your command accepts.
+         * Can also be a function. This function is executed with a yargs instance, and can be used to provide advanced command specific help.
+         *
+         * Note that when `void` is returned, the handler `argv` object type will not include command-specific arguments.
+         * @param [handler] Function, which will be executed with the parsed `argv` object.
+         */
+        command<U = T>(command: string | ReadonlyArray<string>, description: string, builder?: BuilderCallback<T, U>, handler?: (args: Arguments<U>) => void): Argv<T>;
+        command<O extends { [key: string]: Options }>(command: string | ReadonlyArray<string>, description: string, builder?: O, handler?: (args: Arguments<InferredOptionTypes<O>>) => void): Argv<T>;
+        command<U>(command: string | ReadonlyArray<string>, description: string, module: CommandModule<T, U>): Argv<U>;
+        command<U = T>(command: string | ReadonlyArray<string>, showInHelp: false, builder?: BuilderCallback<T, U>, handler?: (args: Arguments<U>) => void): Argv<T>;
+        command<O extends { [key: string]: Options }>(command: string | ReadonlyArray<string>, showInHelp: false, builder?: O, handler?: (args: Arguments<InferredOptionTypes<O>>) => void): Argv<T>;
+        command<U>(command: string | ReadonlyArray<string>, showInHelp: false, module: CommandModule<T, U>): Argv<U>;
+        command<U>(module: CommandModule<T, U>): Argv<U>;
+
+        // Advanced API
+        /** Apply command modules from a directory relative to the module calling this method. */
+        commandDir(dir: string, opts?: RequireDirectoryOptions): Argv<T>;
+
+        /**
+         * Enable bash/zsh-completion shortcuts for commands and options.
+         *
+         * If invoked without parameters, `.completion()` will make completion the command to output the completion script.
+         *
+         * @param [cmd] When present in `argv._`, will result in the `.bashrc` or `.zshrc` completion script being outputted.
+         * To enable bash/zsh completions, concat the generated script to your `.bashrc` or `.bash_profile` (or `.zshrc` for zsh).
+         * @param [description] Provide a description in your usage instructions for the command that generates the completion scripts.
+         * @param [func] Rather than relying on yargs' default completion functionality, which shiver me timbers is pretty awesome, you can provide your own completion method.
+         */
+        completion(): Argv<T>;
+        completion(cmd: string, func?: AsyncCompletionFunction): Argv<T>;
+        completion(cmd: string, func?: SyncCompletionFunction): Argv<T>;
+        completion(cmd: string, func?: PromiseCompletionFunction): Argv<T>;
+        completion(cmd: string, description?: string | false, func?: AsyncCompletionFunction): Argv<T>;
+        completion(cmd: string, description?: string | false, func?: SyncCompletionFunction): Argv<T>;
+        completion(cmd: string, description?: string | false, func?: PromiseCompletionFunction): Argv<T>;
+
+        /**
+         * Tells the parser that if the option specified by `key` is passed in, it should be interpreted as a path to a JSON config file.
+         * The file is loaded and parsed, and its properties are set as arguments.
+         * Because the file is loaded using Node's require(), the filename MUST end in `.json` to be interpreted correctly.
+         *
+         * If invoked without parameters, `.config()` will make --config the option to pass the JSON config file.
+         *
+         * @param [description] Provided to customize the config (`key`) option in the usage string.
+         * @param [explicitConfigurationObject] An explicit configuration `object`
+         */
+        config(): Argv<T>;
+        config(key: string | ReadonlyArray<string>, description?: string, parseFn?: (configPath: string) => object): Argv<T>;
+        config(key: string | ReadonlyArray<string>, parseFn: (configPath: string) => object): Argv<T>;
+        config(explicitConfigurationObject: object): Argv<T>;
+
+        /**
+         * Given the key `x` is set, the key `y` must not be set. `y` can either be a single string or an array of argument names that `x` conflicts with.
+         *
+         * Optionally `.conflicts()` can accept an object specifying multiple conflicting keys.
+         */
+        conflicts(key: string, value: string | ReadonlyArray<string>): Argv<T>;
+        conflicts(conflicts: { [key: string]: string | ReadonlyArray<string> }): Argv<T>;
+
+        /**
+         * Interpret `key` as a boolean flag, but set its parsed value to the number of flag occurrences rather than `true` or `false`. Default value is thus `0`.
+         */
+        count<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: number }>;
+        count<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: number }>;
+
+        /**
+         * Set `argv[key]` to `value` if no option was specified in `process.argv`.
+         *
+         * Optionally `.default()` can take an object that maps keys to default values.
+         *
+         * The default value can be a `function` which returns a value. The name of the function will be used in the usage string.
+         *
+         * Optionally, `description` can also be provided and will take precedence over displaying the value in the usage instructions.
+         */
+        default<K extends keyof T, V>(key: K, value: V, description?: string): Argv<Omit<T, K> & { [key in K]: V }>;
+        default<K extends string, V>(key: K, value: V, description?: string): Argv<T & { [key in K]: V }>;
+        default<D extends { [key: string]: any }>(defaults: D, description?: string): Argv<Omit<T, keyof D> & D>;
+
+        /**
+         * @deprecated since version 6.6.0
+         * Use '.demandCommand()' or '.demandOption()' instead
+         */
+        demand<K extends keyof T>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<Defined<T, K>>;
+        demand<K extends string>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<T & { [key in K]: unknown }>;
+        demand(key: string | ReadonlyArray<string>, required?: boolean): Argv<T>;
+        demand(positionals: number, msg: string): Argv<T>;
+        demand(positionals: number, required?: boolean): Argv<T>;
+        demand(positionals: number, max: number, msg?: string): Argv<T>;
+
+        /**
+         * @param key If is a string, show the usage information and exit if key wasn't specified in `process.argv`.
+         * If is an array, demand each element.
+         * @param msg If string is given, it will be printed when the argument is missing, instead of the standard error message.
+         * @param demand Controls whether the option is demanded; this is useful when using .options() to specify command line parameters.
+         */
+        demandOption<K extends keyof T>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<Defined<T, K>>;
+        demandOption<K extends string>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<T & { [key in K]: unknown }>;
+        demandOption(key: string | ReadonlyArray<string>, demand?: boolean): Argv<T>;
+
+        /**
+         * Demand in context of commands.
+         * You can demand a minimum and a maximum number a user can have within your program, as well as provide corresponding error messages if either of the demands is not met.
+         */
+        demandCommand(): Argv<T>;
+        demandCommand(min: number, minMsg?: string): Argv<T>;
+        demandCommand(min: number, max?: number, minMsg?: string, maxMsg?: string): Argv<T>;
+
+        /**
+         * Describe a `key` for the generated usage information.
+         *
+         * Optionally `.describe()` can take an object that maps keys to descriptions.
+         */
+        describe(key: string | ReadonlyArray<string>, description: string): Argv<T>;
+        describe(descriptions: { [key: string]: string }): Argv<T>;
+
+        /** Should yargs attempt to detect the os' locale? Defaults to `true`. */
+        detectLocale(detect: boolean): Argv<T>;
+
+        /**
+         * Tell yargs to parse environment variables matching the given prefix and apply them to argv as though they were command line arguments.
+         *
+         * Use the "__" separator in the environment variable to indicate nested options. (e.g. prefix_nested__foo => nested.foo)
+         *
+         * If this method is called with no argument or with an empty string or with true, then all env vars will be applied to argv.
+         *
+         * Program arguments are defined in this order of precedence:
+         * 1. Command line args
+         * 2. Env vars
+         * 3. Config file/objects
+         * 4. Configured defaults
+         *
+         * Env var parsing is disabled by default, but you can also explicitly disable it by calling `.env(false)`, e.g. if you need to undo previous configuration.
+         */
+        env(): Argv<T>;
+        env(prefix: string): Argv<T>;
+        env(enable: boolean): Argv<T>;
+
+        /** A message to print at the end of the usage instructions */
+        epilog(msg: string): Argv<T>;
+        /** A message to print at the end of the usage instructions */
+        epilogue(msg: string): Argv<T>;
+
+        /**
+         * Give some example invocations of your program.
+         * Inside `cmd`, the string `$0` will get interpolated to the current script name or node command for the present script similar to how `$0` works in bash or perl.
+         * Examples will be printed out as part of the help message.
+         */
+        example(command: string, description: string): Argv<T>;
+
+        /** Manually indicate that the program should exit, and provide context about why we wanted to exit. Follows the behavior set by `.exitProcess().` */
+        exit(code: number, err: Error): void;
+
+        /**
+         * By default, yargs exits the process when the user passes a help flag, the user uses the `.version` functionality, validation fails, or the command handler fails.
+         * Calling `.exitProcess(false)` disables this behavior, enabling further actions after yargs have been validated.
+         */
+        exitProcess(enabled: boolean): Argv<T>;
+
+        /**
+         * Method to execute when a failure occurs, rather than printing the failure message.
+         * @param func Is called with the failure message that would have been printed, the Error instance originally thrown and yargs state when the failure occurred.
+         */
+        fail(func: (msg: string, err: Error, yargs: Argv<T>) => any): Argv<T>;
+
+        /**
+         * Allows to programmatically get completion choices for any line.
+         * @param args An array of the words in the command line to complete.
+         * @param done The callback to be called with the resulting completions.
+         */
+        getCompletion(args: ReadonlyArray<string>, done: (completions: ReadonlyArray<string>) => void): Argv<T>;
+
+        /**
+         * Indicate that an option (or group of options) should not be reset when a command is executed
+         *
+         * Options default to being global.
+         */
+        global(key: string | ReadonlyArray<string>): Argv<T>;
+
+        /** Given a key, or an array of keys, places options under an alternative heading when displaying usage instructions */
+        group(key: string | ReadonlyArray<string>, groupName: string): Argv<T>;
+
+        /** Hides a key from the generated usage information. Unless a `--show-hidden` option is also passed with `--help` (see `showHidden()`). */
+        hide(key: string): Argv<T>;
+
+        /**
+         * Configure an (e.g. `--help`) and implicit command that displays the usage string and exits the process.
+         * By default yargs enables help on the `--help` option.
+         *
+         * Note that any multi-char aliases (e.g. `help`) used for the help option will also be used for the implicit command.
+         * If there are no multi-char aliases (e.g. `h`), then all single-char aliases will be used for the command.
+         *
+         * If invoked without parameters, `.help()` will use `--help` as the option and help as the implicit command to trigger help output.
+         *
+         * @param [description] Customizes the description of the help option in the usage string.
+         * @param [enableExplicit] If `false` is provided, it will disable --help.
+         */
+        help(): Argv<T>;
+        help(enableExplicit: boolean): Argv<T>;
+        help(option: string, enableExplicit: boolean): Argv<T>;
+        help(option: string, description?: string, enableExplicit?: boolean): Argv<T>;
+
+        /**
+         * Given the key `x` is set, it is required that the key `y` is set.
+         * y` can either be the name of an argument to imply, a number indicating the position of an argument or an array of multiple implications to associate with `x`.
+         *
+         * Optionally `.implies()` can accept an object specifying multiple implications.
+         */
+        implies(key: string, value: string | ReadonlyArray<string>): Argv<T>;
+        implies(implies: { [key: string]: string | ReadonlyArray<string> }): Argv<T>;
+
+        /**
+         * Return the locale that yargs is currently using.
+         *
+         * By default, yargs will auto-detect the operating system's locale so that yargs-generated help content will display in the user's language.
+         */
+        locale(): string;
+        /**
+         * Override the auto-detected locale from the user's operating system with a static locale.
+         * Note that the OS locale can be modified by setting/exporting the `LC_ALL` environment variable.
+         */
+        locale(loc: string): Argv<T>;
+
+        /**
+         * Define global middleware functions to be called first, in list order, for all cli command.
+         * @param callbacks Can be a function or a list of functions. Each callback gets passed a reference to argv.
+         * @param [applyBeforeValidation] Set to `true` to apply middleware before validation. This will execute the middleware prior to validation checks, but after parsing.
+         */
+        middleware(callbacks: MiddlewareFunction<T> | ReadonlyArray<MiddlewareFunction<T>>, applyBeforeValidation?: boolean): Argv<T>;
+
+        /**
+         * The number of arguments that should be consumed after a key. This can be a useful hint to prevent parsing ambiguity.
+         *
+         * Optionally `.nargs()` can take an object of `key`/`narg` pairs.
+         */
+        nargs(key: string, count: number): Argv<T>;
+        nargs(nargs: { [key: string]: number }): Argv<T>;
+
+        /** The key provided represents a path and should have `path.normalize()` applied. */
+        normalize<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: ToString<T[key]> }>;
+        normalize<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: string | undefined }>;
+
+        /**
+         * Tell the parser to always interpret key as a number.
+         *
+         * If `key` is an array, all elements will be parsed as numbers.
+         *
+         * If the option is given on the command line without a value, `argv` will be populated with `undefined`.
+         *
+         * If the value given on the command line cannot be parsed as a number, `argv` will be populated with `NaN`.
+         *
+         * Note that decimals, hexadecimals, and scientific notation are all accepted.
+         */
+        number<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: ToNumber<T[key]> }>;
+        number<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: number | undefined }>;
+
+        /**
+         * This method can be used to make yargs aware of options that could exist.
+         * You can also pass an opt object which can hold further customization, like `.alias()`, `.demandOption()` etc. for that option.
+         */
+        option<K extends keyof T, O extends Options>(key: K, options: O): Argv<Omit<T, K> & { [key in K]: InferredOptionType<O> }>;
+        option<K extends string, O extends Options>(key: K, options: O): Argv<T & { [key in K]: InferredOptionType<O> }>;
+        option<O extends { [key: string]: Options }>(options: O): Argv<Omit<T, keyof O> & InferredOptionTypes<O>>;
+
+        /**
+         * This method can be used to make yargs aware of options that could exist.
+         * You can also pass an opt object which can hold further customization, like `.alias()`, `.demandOption()` etc. for that option.
+         */
+        options<K extends keyof T, O extends Options>(key: K, options: O): Argv<Omit<T, K> & { [key in K]: InferredOptionType<O> }>;
+        options<K extends string, O extends Options>(key: K, options: O): Argv<T & { [key in K]: InferredOptionType<O> }>;
+        options<O extends { [key: string]: Options }>(options: O): Argv<Omit<T, keyof O> & InferredOptionTypes<O>>;
+
+        /**
+         * Parse `args` instead of `process.argv`. Returns the `argv` object. `args` may either be a pre-processed argv array, or a raw argument string.
+         *
+         * Note: Providing a callback to parse() disables the `exitProcess` setting until after the callback is invoked.
+         * @param [context]  Provides a useful mechanism for passing state information to commands
+         */
+        parse(arg?: string | ReadonlyArray<string>): { [key in keyof Arguments<T>]: Arguments<T>[key] };
+        parse(arg: string | ReadonlyArray<string>, parseCallback: ParseCallback<T>): { [key in keyof Arguments<T>]: Arguments<T>[key] };
+        parse(arg: string | ReadonlyArray<string>, context: object, parseCallback?: ParseCallback<T>): { [key in keyof Arguments<T>]: Arguments<T>[key] };
+
+        /**
+         * If the arguments have not been parsed, this property is `false`.
+         *
+         * If the arguments have been parsed, this contain detailed parsed arguments.
+         */
+        parsed: DetailedArguments | false;
+
+        /** Allows to configure advanced yargs features. */
+        parserConfiguration(configuration: Partial<ParserConfigurationOptions>): Argv<T>;
+
+        /**
+         * Similar to `config()`, indicates that yargs should interpret the object from the specified key in package.json as a configuration object.
+         * @param [cwd] If provided, the package.json will be read from this location
+         */
+        pkgConf(key: string | ReadonlyArray<string>, cwd?: string): Argv<T>;
+
+        /**
+         * Allows you to configure a command's positional arguments with an API similar to `.option()`.
+         * `.positional()` should be called in a command's builder function, and is not available on the top-level yargs instance. If so, it will throw an error.
+         */
+        positional<K extends keyof T, O extends PositionalOptions>(key: K, opt: O): Argv<Omit<T, K> & { [key in K]: InferredOptionType<O> }>;
+        positional<K extends string, O extends PositionalOptions>(key: K, opt: O): Argv<T & { [key in K]: InferredOptionType<O> }>;
+
+        /** Should yargs provide suggestions regarding similar commands if no matching command is found? */
+        recommendCommands(): Argv<T>;
+
+        /**
+         * @deprecated since version 6.6.0
+         * Use '.demandCommand()' or '.demandOption()' instead
+         */
+        require<K extends keyof T>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<Defined<T, K>>;
+        require(key: string, msg: string): Argv<T>;
+        require(key: string, required: boolean): Argv<T>;
+        require(keys: ReadonlyArray<number>, msg: string): Argv<T>;
+        require(keys: ReadonlyArray<number>, required: boolean): Argv<T>;
+        require(positionals: number, required: boolean): Argv<T>;
+        require(positionals: number, msg: string): Argv<T>;
+
+        /**
+         * @deprecated since version 6.6.0
+         * Use '.demandCommand()' or '.demandOption()' instead
+         */
+        required<K extends keyof T>(key: K | ReadonlyArray<K>, msg?: string | true): Argv<Defined<T, K>>;
+        required(key: string, msg: string): Argv<T>;
+        required(key: string, required: boolean): Argv<T>;
+        required(keys: ReadonlyArray<number>, msg: string): Argv<T>;
+        required(keys: ReadonlyArray<number>, required: boolean): Argv<T>;
+        required(positionals: number, required: boolean): Argv<T>;
+        required(positionals: number, msg: string): Argv<T>;
+
+        requiresArg(key: string | ReadonlyArray<string>): Argv<T>;
+
+        /**
+         * @deprecated since version 6.6.0
+         * Use '.global()' instead
+         */
+        reset(): Argv<T>;
+
+        /** Set the name of your script ($0). Default is the base filename executed by node (`process.argv[1]`) */
+        scriptName($0: string): Argv<T>;
+
+        /**
+         * Generate a bash completion script.
+         * Users of your application can install this script in their `.bashrc`, and yargs will provide completion shortcuts for commands and options.
+         */
+        showCompletionScript(): Argv<T>;
+
+        /**
+         * Configure the `--show-hidden` option that displays the hidden keys (see `hide()`).
+         * @param option If `boolean`, it enables/disables this option altogether. i.e. hidden keys will be permanently hidden if first argument is `false`.
+         * If `string` it changes the key name ("--show-hidden").
+         * @param description Changes the default description ("Show hidden options")
+         */
+        showHidden(option?: string | boolean): Argv<T>;
+        showHidden(option: string, description?: string): Argv<T>;
+
+        /**
+         * Print the usage data using the console function consoleLevel for printing.
+         * @param [consoleLevel='error']
+         */
+        showHelp(consoleLevel?: string): Argv<T>;
+
+        /**
+         * By default, yargs outputs a usage string if any error is detected.
+         * Use the `.showHelpOnFail()` method to customize this behavior.
+         * @param enable If `false`, the usage string is not output.
+         * @param [message] Message that is output after the error message.
+         */
+        showHelpOnFail(enable: boolean, message?: string): Argv<T>;
+
+        /** Specifies either a single option key (string), or an array of options. If any of the options is present, yargs validation is skipped. */
+        skipValidation(key: string | ReadonlyArray<string>): Argv<T>;
+
+        /**
+         * Any command-line argument given that is not demanded, or does not have a corresponding description, will be reported as an error.
+         *
+         * Unrecognized commands will also be reported as errors.
+         */
+        strict(): Argv<T>;
+        strict(enabled: boolean): Argv<T>;
+
+        /**
+         * Tell the parser logic not to interpret `key` as a number or boolean. This can be useful if you need to preserve leading zeros in an input.
+         *
+         * If `key` is an array, interpret all the elements as strings.
+         *
+         * `.string('_')` will result in non-hyphenated arguments being interpreted as strings, regardless of whether they resemble numbers.
+         */
+        string<K extends keyof T>(key: K | ReadonlyArray<K>): Argv<Omit<T, K> & { [key in K]: ToString<T[key]> }>;
+        string<K extends string>(key: K | ReadonlyArray<K>): Argv<T & { [key in K]: string | undefined }>;
+
+        // Intended to be used with '.wrap()'
+        terminalWidth(): number;
+
+        updateLocale(obj: { [key: string]: string }): Argv<T>;
+
+        /**
+         * Override the default strings used by yargs with the key/value pairs provided in obj
+         *
+         * If you explicitly specify a locale(), you should do so before calling `updateStrings()`.
+         */
+        updateStrings(obj: { [key: string]: string }): Argv<T>;
+
+        /**
+         * Set a usage message to show which commands to use.
+         * Inside `message`, the string `$0` will get interpolated to the current script name or node command for the present script similar to how `$0` works in bash or perl.
+         *
+         * If the optional `description`/`builder`/`handler` are provided, `.usage()` acts an an alias for `.command()`.
+         * This allows you to use `.usage()` to configure the default command that will be run as an entry-point to your application
+         * and allows you to provide configuration for the positional arguments accepted by your program:
+         */
+        usage(message: string): Argv<T>;
+        usage<U>(command: string | ReadonlyArray<string>, description: string, builder?: (args: Argv<T>) => Argv<U>, handler?: (args: Arguments<U>) => void): Argv<T>;
+        usage<U>(command: string | ReadonlyArray<string>, showInHelp: boolean, builder?: (args: Argv<T>) => Argv<U>, handler?: (args: Arguments<U>) => void): Argv<T>;
+        usage<O extends { [key: string]: Options }>(command: string | ReadonlyArray<string>, description: string, builder?: O, handler?: (args: Arguments<InferredOptionTypes<O>>) => void): Argv<T>;
+        usage<O extends { [key: string]: Options }>(command: string | ReadonlyArray<string>, showInHelp: boolean, builder?: O, handler?: (args: Arguments<InferredOptionTypes<O>>) => void): Argv<T>;
+
+        /**
+         * Add an option (e.g. `--version`) that displays the version number (given by the version parameter) and exits the process.
+         * By default yargs enables version for the `--version` option.
+         *
+         * If no arguments are passed to version (`.version()`), yargs will parse the package.json of your module and use its version value.
+         *
+         * If the boolean argument `false` is provided, it will disable `--version`.
+         */
+        version(): Argv<T>;
+        version(version: string): Argv<T>;
+        version(enable: boolean): Argv<T>;
+        version(optionKey: string, version: string): Argv<T>;
+        version(optionKey: string, description: string, version: string): Argv<T>;
+
+        /**
+         * Format usage output to wrap at columns many columns.
+         *
+         * By default wrap will be set to `Math.min(80, windowWidth)`. Use `.wrap(null)` to specify no column limit (no right-align).
+         * Use `.wrap(yargs.terminalWidth())` to maximize the width of yargs' usage instructions.
+         */
+        wrap(columns: number | null): Argv<T>;
+    }
+
+    type Arguments<T = {}> = T & {
+        /** Non-option arguments */
+        _: string[];
+        /** The script name or node command */
+        $0: string;
+        /** All remaining options */
+        [argName: string]: unknown;
+    };
+
+    interface RequireDirectoryOptions {
+        /** Look for command modules in all subdirectories and apply them as a flattened (non-hierarchical) list. */
+        recurse?: boolean;
+        /** The types of files to look for when requiring command modules. */
+        extensions?: ReadonlyArray<string>;
+        /**
+         * A synchronous function called for each command module encountered.
+         * Accepts `commandObject`, `pathToFile`, and `filename` as arguments.
+         * Returns `commandObject` to include the command; any falsy value to exclude/skip it.
+         */
+        visit?: (commandObject: any, pathToFile?: string, filename?: string) => any;
+        /** Whitelist certain modules */
+        include?: RegExp | ((pathToFile: string) => boolean);
+        /** Blacklist certain modules. */
+        exclude?: RegExp | ((pathToFile: string) => boolean);
+    }
+
+    interface Options {
+        /** string or array of strings, alias(es) for the canonical option key, see `alias()` */
+        alias?: string | ReadonlyArray<string>;
+        /** boolean, interpret option as an array, see `array()` */
+        array?: boolean;
+        /**  boolean, interpret option as a boolean flag, see `boolean()` */
+        boolean?: boolean;
+        /** value or array of values, limit valid option arguments to a predefined set, see `choices()` */
+        choices?: Choices;
+        /** function, coerce or transform parsed command line values into another value, see `coerce()` */
+        coerce?: (arg: any) => any;
+        /** boolean, interpret option as a path to a JSON config file, see `config()` */
+        config?: boolean;
+        /** function, provide a custom config parsing function, see `config()` */
+        configParser?: (configPath: string) => object;
+        /** string or object, require certain keys not to be set, see `conflicts()` */
+        conflicts?: string | ReadonlyArray<string> | { [key: string]: string | ReadonlyArray<string> };
+        /** boolean, interpret option as a count of boolean flags, see `count()` */
+        count?: boolean;
+        /** value, set a default value for the option, see `default()` */
+        default?: any;
+        /** string, use this description for the default value in help content, see `default()` */
+        defaultDescription?: string;
+        /**
+         *  @deprecated since version 6.6.0
+         *  Use 'demandOption' instead
+         */
+        demand?: boolean | string;
+        /** boolean or string, demand the option be given, with optional error message, see `demandOption()` */
+        demandOption?: boolean | string;
+        /** string, the option description for help content, see `describe()` */
+        desc?: string;
+        /** string, the option description for help content, see `describe()` */
+        describe?: string;
+        /** string, the option description for help content, see `describe()` */
+        description?: string;
+        /** boolean, indicate that this key should not be reset when a command is invoked, see `global()` */
+        global?: boolean;
+        /** string, when displaying usage instructions place the option under an alternative group heading, see `group()` */
+        group?: string;
+        /** don't display option in help output. */
+        hidden?: boolean;
+        /**  string or object, require certain keys to be set, see `implies()` */
+        implies?: string | ReadonlyArray<string> | { [key: string]: string | ReadonlyArray<string> };
+        /** number, specify how many arguments should be consumed for the option, see `nargs()` */
+        nargs?: number;
+        /** boolean, apply path.normalize() to the option, see `normalize()` */
+        normalize?: boolean;
+        /** boolean, interpret option as a number, `number()` */
+        number?: boolean;
+        /**
+         *  @deprecated since version 6.6.0
+         *  Use 'demandOption' instead
+         */
+        require?: boolean | string;
+        /**
+         *  @deprecated since version 6.6.0
+         *  Use 'demandOption' instead
+         */
+        required?: boolean | string;
+        /** boolean, require the option be specified with a value, see `requiresArg()` */
+        requiresArg?: boolean;
+        /** boolean, skips validation if the option is present, see `skipValidation()` */
+        skipValidation?: boolean;
+        /** boolean, interpret option as a string, see `string()` */
+        string?: boolean;
+        type?: "array" | "count" | PositionalOptionsType;
+    }
+
+    interface PositionalOptions {
+        /** string or array of strings, see `alias()` */
+        alias?: string | ReadonlyArray<string>;
+        /** boolean, interpret option as an array, see `array()` */
+        array?: boolean;
+        /** value or array of values, limit valid option arguments to a predefined set, see `choices()` */
+        choices?: Choices;
+        /** function, coerce or transform parsed command line values into another value, see `coerce()` */
+        coerce?: (arg: any) => any;
+        /** string or object, require certain keys not to be set, see `conflicts()` */
+        conflicts?: string | ReadonlyArray<string> | { [key: string]: string | ReadonlyArray<string> };
+        /** value, set a default value for the option, see `default()` */
+        default?: any;
+        /** boolean or string, demand the option be given, with optional error message, see `demandOption()` */
+        demandOption?: boolean | string;
+        /** string, the option description for help content, see `describe()` */
+        desc?: string;
+        /** string, the option description for help content, see `describe()` */
+        describe?: string;
+        /** string, the option description for help content, see `describe()` */
+        description?: string;
+        /** string or object, require certain keys to be set, see `implies()` */
+        implies?: string | ReadonlyArray<string> | { [key: string]: string | ReadonlyArray<string> };
+        /** boolean, apply path.normalize() to the option, see normalize() */
+        normalize?: boolean;
+        type?: PositionalOptionsType;
+    }
+
+    /** Remove keys K in T */
+    type Omit<T, K> = { [key in Exclude<keyof T, K>]: T[key] };
+
+    /** Remove undefined as a possible value for keys K in T */
+    type Defined<T, K extends keyof T> = Omit<T, K> & { [key in K]: Exclude<T[key], undefined> };
+
+    /** Convert T to T[] and T | undefined to T[] | undefined */
+    type ToArray<T> = Array<Exclude<T, undefined>> | Extract<T, undefined>;
+
+    /** Gives string[] if T is an array type, otherwise string. Preserves | undefined. */
+    type ToString<T> = (Exclude<T, undefined> extends any[] ? string[] : string) | Extract<T, undefined>;
+
+    /** Gives number[] if T is an array type, otherwise number. Preserves | undefined. */
+    type ToNumber<T> = (Exclude<T, undefined> extends any[] ? number[] : number) | Extract<T, undefined>;
+
+    type InferredOptionType<O extends Options | PositionalOptions> =
+        O extends { default: infer D } ? D :
+        O extends { type: "count" } ? number :
+        O extends { count: true } ? number :
+        O extends { required: string | true } ? RequiredOptionType<O> :
+        O extends { require: string | true } ? RequiredOptionType<O> :
+        O extends { demand: string | true } ? RequiredOptionType<O> :
+        O extends { demandOption: string | true } ? RequiredOptionType<O> :
+        RequiredOptionType<O> | undefined;
+
+    type RequiredOptionType<O extends Options | PositionalOptions> =
+        O extends { type: "array", string: true } ? string[] :
+        O extends { type: "array", number: true } ? number[] :
+        O extends { type: "array", normalize: true } ? string[] :
+        O extends { type: "string", array: true } ? string[] :
+        O extends { type: "number", array: true } ? number[] :
+        O extends { string: true, array: true } ? string[] :
+        O extends { number: true, array: true } ? number[] :
+        O extends { normalize: true, array: true } ? string[] :
+        O extends { type: "array" } ? Array<string | number> :
+        O extends { type: "boolean" } ? boolean :
+        O extends { type: "number" } ? number :
+        O extends { type: "string" } ? string :
+        O extends { array: true } ? Array<string | number> :
+        O extends { boolean: true } ? boolean :
+        O extends { number: true } ? number :
+        O extends { string: true } ? string :
+        O extends { normalize: true } ? string :
+        O extends { choices: ReadonlyArray<infer C> } ? C :
+        O extends { coerce: (arg: any) => infer T } ? T :
+        unknown;
+
+    type InferredOptionTypes<O extends { [key: string]: Options }> = { [key in keyof O]: InferredOptionType<O[key]> };
+
+    interface CommandModule<T = {}, U = {}> {
+        /** array of strings (or a single string) representing aliases of `exports.command`, positional args defined in an alias are ignored */
+        aliases?: ReadonlyArray<string> | string;
+        /** object declaring the options the command accepts, or a function accepting and returning a yargs instance */
+        builder?: CommandBuilder<T, U>;
+        /** string (or array of strings) that executes this command when given on the command line, first string may contain positional args */
+        command?: ReadonlyArray<string> | string;
+        /** string used as the description for the command in help text, use `false` for a hidden command */
+        describe?: string | false;
+        /** a function which will be passed the parsed argv. */
+        handler: (args: Arguments<U>) => void;
+    }
+
+    type ParseCallback<T = {}> = (err: Error | undefined, argv: Arguments<T>, output: string) => void;
+    type CommandBuilder<T = {}, U = {}> = { [key: string]: Options } | ((args: Argv<T>) => Argv<U>);
+    type SyncCompletionFunction = (current: string, argv: any) => string[];
+    type AsyncCompletionFunction = (current: string, argv: any, done: (completion: ReadonlyArray<string>) => void) => void;
+    type PromiseCompletionFunction = (current: string, argv: any) => Promise<string[]>;
+    type MiddlewareFunction<T = {}> = (args: Arguments<T>) => void;
+    type Choices = ReadonlyArray<string | number | true | undefined>;
+    type PositionalOptionsType = "boolean" | "number" | "string";
+}
+
+declare var yargs: yargs.Argv;
+export = yargs;

node_modules/metro/node_modules/@types/yargs/package.json

@@ -0,0 +1,56 @@
+{
+    "name": "@types/yargs",
+    "version": "13.0.11",
+    "description": "TypeScript definitions for yargs",
+    "license": "MIT",
+    "contributors": [
+        {
+            "name": "Martin Poelstra",
+            "url": "https://github.com/poelstra",
+            "githubUsername": "poelstra"
+        },
+        {
+            "name": "Mizunashi Mana",
+            "url": "https://github.com/mizunashi-mana",
+            "githubUsername": "mizunashi-mana"
+        },
+        {
+            "name": "Jeffery Grajkowski",
+            "url": "https://github.com/pushplay",
+            "githubUsername": "pushplay"
+        },
+        {
+            "name": "Jimi (Dimitris) Charalampidis",
+            "url": "https://github.com/JimiC",
+            "githubUsername": "JimiC"
+        },
+        {
+            "name": "Steffen Viken Valvåg",
+            "url": "https://github.com/steffenvv",
+            "githubUsername": "steffenvv"
+        },
+        {
+            "name": "Emily Marigold Klassen",
+            "url": "https://github.com/forivall",
+            "githubUsername": "forivall"
+        },
+        {
+            "name": "ExE Boss",
+            "url": "https://github.com/ExE-Boss",
+            "githubUsername": "ExE-Boss"
+        }
+    ],
+    "main": "",
+    "types": "index.d.ts",
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git",
+        "directory": "types/yargs"
+    },
+    "scripts": {},
+    "dependencies": {
+        "@types/yargs-parser": "*"
+    },
+    "typesPublisherContentHash": "064f147d70f08ec7f0379158a1e21bfe3f20ceadcadc729bdf7e2272c3d3fac9",
+    "typeScriptVersion": "3.2"
+}

node_modules/metro/node_modules/@types/yargs/yargs.d.ts

@@ -0,0 +1,9 @@
+import { Argv } from '.';
+
+export = Yargs;
+
+declare function Yargs(
+    processArgs?: ReadonlyArray<string>,
+    cwd?: string,
+    parentRequire?: NodeRequire,
+): Argv;

node_modules/metro/node_modules/ansi-regex/index.js

@@ -0,0 +1,10 @@
+'use strict';
+
+module.exports = () => {
+	const pattern = [
+		'[\\u001B\\u009B][[\\]()#;?]*(?:(?:(?:[a-zA-Z\\d]*(?:;[a-zA-Z\\d]*)*)?\\u0007)',
+		'(?:(?:\\d{1,4}(?:;\\d{0,4})*)?[\\dA-PRZcf-ntqry=><~]))'
+	].join('|');
+
+	return new RegExp(pattern, 'g');
+};

node_modules/metro/node_modules/ansi-regex/license

@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

node_modules/metro/node_modules/ansi-regex/package.json

@@ -0,0 +1,53 @@
+{
+  "name": "ansi-regex",
+  "version": "3.0.0",
+  "description": "Regular expression for matching ANSI escape codes",
+  "license": "MIT",
+  "repository": "chalk/ansi-regex",
+  "author": {
+    "name": "Sindre Sorhus",
+    "email": "sindresorhus@gmail.com",
+    "url": "sindresorhus.com"
+  },
+  "engines": {
+    "node": ">=4"
+  },
+  "scripts": {
+    "test": "xo && ava",
+    "view-supported": "node fixtures/view-codes.js"
+  },
+  "files": [
+    "index.js"
+  ],
+  "keywords": [
+    "ansi",
+    "styles",
+    "color",
+    "colour",
+    "colors",
+    "terminal",
+    "console",
+    "cli",
+    "string",
+    "tty",
+    "escape",
+    "formatting",
+    "rgb",
+    "256",
+    "shell",
+    "xterm",
+    "command-line",
+    "text",
+    "regex",
+    "regexp",
+    "re",
+    "match",
+    "test",
+    "find",
+    "pattern"
+  ],
+  "devDependencies": {
+    "ava": "*",
+    "xo": "*"
+  }
+}

node_modules/metro/node_modules/ansi-regex/readme.md

@@ -0,0 +1,46 @@
+# ansi-regex [![Build Status](https://travis-ci.org/chalk/ansi-regex.svg?branch=master)](https://travis-ci.org/chalk/ansi-regex)
+
+> Regular expression for matching [ANSI escape codes](https://en.wikipedia.org/wiki/ANSI_escape_code)
+
+
+## Install
+
+```
+$ npm install ansi-regex
+```
+
+
+## Usage
+
+```js
+const ansiRegex = require('ansi-regex');
+
+ansiRegex().test('\u001B[4mcake\u001B[0m');
+//=> true
+
+ansiRegex().test('cake');
+//=> false
+
+'\u001B[4mcake\u001B[0m'.match(ansiRegex());
+//=> ['\u001B[4m', '\u001B[0m']
+```
+
+
+## FAQ
+
+### Why do you test for codes not in the ECMA 48 standard?
+
+Some of the codes we run as a test are codes that we acquired finding various lists of non-standard or manufacturer specific codes. We test for both standard and non-standard codes, as most of them follow the same or similar format and can be safely matched in strings without the risk of removing actual string content. There are a few non-standard control codes that do not follow the traditional format (i.e. they end in numbers) thus forcing us to exclude them from the test because we cannot reliably match them.
+
+On the historical side, those ECMA standards were established in the early 90's whereas the VT100, for example, was designed in the mid/late 70's. At that point in time, control codes were still pretty ungoverned and engineers used them for a multitude of things, namely to activate hardware ports that may have been proprietary. Somewhere else you see a similar 'anarchy' of codes is in the x86 architecture for processors; there are a ton of "interrupts" that can mean different things on certain brands of processors, most of which have been phased out.
+
+
+## Maintainers
+
+- [Sindre Sorhus](https://github.com/sindresorhus)
+- [Josh Junon](https://github.com/qix-)
+
+
+## License
+
+MIT

node_modules/metro/node_modules/anymatch/LICENSE

@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) 2014 Elan Shanker
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

node_modules/metro/node_modules/anymatch/README.md

@@ -0,0 +1,99 @@
+anymatch [![Build Status](https://travis-ci.org/micromatch/anymatch.svg?branch=master)](https://travis-ci.org/micromatch/anymatch) [![Coverage Status](https://img.shields.io/coveralls/micromatch/anymatch.svg?branch=master)](https://coveralls.io/r/micromatch/anymatch?branch=master)
+======
+Javascript module to match a string against a regular expression, glob, string,
+or function that takes the string as an argument and returns a truthy or falsy
+value. The matcher can also be an array of any or all of these. Useful for
+allowing a very flexible user-defined config to define things like file paths.
+
+__Note: This module has Bash-parity, please be aware that Windows-style backslashes are not supported as separators. See https://github.com/micromatch/micromatch#backslashes for more information.__
+
+[![NPM](https://nodei.co/npm/anymatch.png?downloads=true&downloadRank=true&stars=true)](https://nodei.co/npm/anymatch/)
+[![NPM](https://nodei.co/npm-dl/anymatch.png?height=3&months=9)](https://nodei.co/npm-dl/anymatch/)
+
+Usage
+-----
+```sh
+npm install anymatch --save
+```
+
+#### anymatch (matchers, testString, [returnIndex], [startIndex], [endIndex])
+* __matchers__: (_Array|String|RegExp|Function_)
+String to be directly matched, string with glob patterns, regular expression
+test, function that takes the testString as an argument and returns a truthy
+value if it should be matched, or an array of any number and mix of these types.
+* __testString__: (_String|Array_) The string to test against the matchers. If
+passed as an array, the first element of the array will be used as the
+`testString` for non-function matchers, while the entire array will be applied
+as the arguments for function matchers.
+* __returnIndex__: (_Boolean [optional]_) If true, return the array index of
+the first matcher that that testString matched, or -1 if no match, instead of a
+boolean result.
+* __startIndex, endIndex__: (_Integer [optional]_) Can be used to define a
+subset out of the array of provided matchers to test against. Can be useful
+with bound matcher functions (see below). When used with `returnIndex = true`
+preserves original indexing. Behaves the same as `Array.prototype.slice` (i.e.
+includes array members up to, but not including endIndex).
+
+```js
+var anymatch = require('anymatch');
+
+var matchers = [
+	'path/to/file.js',
+	'path/anyjs/**/*.js',
+	/foo\.js$/,
+	function (string) {
+		return string.indexOf('bar') !== -1 && string.length > 10
+	}
+];
+
+anymatch(matchers, 'path/to/file.js'); // true
+anymatch(matchers, 'path/anyjs/baz.js'); // true
+anymatch(matchers, 'path/to/foo.js'); // true
+anymatch(matchers, 'path/to/bar.js'); // true
+anymatch(matchers, 'bar.js'); // false
+
+// returnIndex = true
+anymatch(matchers, 'foo.js', true); // 2
+anymatch(matchers, 'path/anyjs/foo.js', true); // 1
+
+// skip matchers
+anymatch(matchers, 'path/to/file.js', false, 1); // false
+anymatch(matchers, 'path/anyjs/foo.js', true, 2, 3); // 2
+anymatch(matchers, 'path/to/bar.js', true, 0, 3); // -1
+
+// using globs to match directories and their children
+anymatch('node_modules', 'node_modules'); // true
+anymatch('node_modules', 'node_modules/somelib/index.js'); // false
+anymatch('node_modules/**', 'node_modules/somelib/index.js'); // true
+anymatch('node_modules/**', '/absolute/path/to/node_modules/somelib/index.js'); // false
+anymatch('**/node_modules/**', '/absolute/path/to/node_modules/somelib/index.js'); // true
+```
+
+#### anymatch (matchers)
+You can also pass in only your matcher(s) to get a curried function that has
+already been bound to the provided matching criteria. This can be used as an
+`Array.prototype.filter` callback.
+
+```js
+var matcher = anymatch(matchers);
+
+matcher('path/to/file.js'); // true
+matcher('path/anyjs/baz.js', true); // 1
+matcher('path/anyjs/baz.js', true, 2); // -1
+
+['foo.js', 'bar.js'].filter(matcher); // ['foo.js']
+```
+
+Change Log
+----------
+[See release notes page on GitHub](https://github.com/micromatch/anymatch/releases)
+
+NOTE: As of v2.0.0, [micromatch](https://github.com/jonschlinkert/micromatch) moves away from minimatch-parity and inline with Bash. This includes handling backslashes differently (see https://github.com/micromatch/micromatch#backslashes for more information).
+
+NOTE: As of v1.2.0, anymatch uses [micromatch](https://github.com/jonschlinkert/micromatch)
+for glob pattern matching. Issues with glob pattern matching should be
+reported directly to the [micromatch issue tracker](https://github.com/jonschlinkert/micromatch/issues).
+
+License
+-------
+[ISC](https://raw.github.com/micromatch/anymatch/master/LICENSE)